HomeSort by: relevance | last modified time | path
    Searched refs:HashMap (Results 1 - 25 of 28) sorted by relevancy

1 2

  /src/external/gpl3/binutils/dist/gprofng/src/
HashMap.h 21 // java.util.HashMap
134 class HashMap
137 HashMap (int initialCapacity = 0);
139 ~HashMap ()
229 HashMap<Key_t, Value_t>
230 ::HashMap (int initialCapacity)
246 HashMap<Key_t, Value_t>::clear ()
266 HashMap<Key_t, Value_t>::resize ()
295 HashMap<Key_t, Value_t>::get (Key_t key)
306 HashMap<Key_t, Value_t>::values (Key_t key
    [all...]
LoadObject.h 46 template <typename Key_t, typename Value_t> class HashMap;
170 HashMap<char*, Module*> *modules;
175 HashMap<char*, Function*> *comp_funcs; // list of comparable functions
193 HashMap<char*, Module*> *seg_modules_map; // to find a comparable module
IOActivity.h 68 HashMap<char*, FileData*> *fDataHash;
MemorySpace.h 32 #include "HashMap.h"
93 HashMap<uint64_t, MemObj*> *objs;
DbeSession.h 54 #include "HashMap.h"
373 HashMap<char*, LoadObject *> *comp_lobjs; // list of comparable LoadObjects
374 HashMap<char*, DbeLine *> *comp_dbelines; // list of comparable DbeLines
375 HashMap<char*, SourceFile*>*comp_sources; // list of comparable SourceFiles
434 Vector<HashMap<uint64_t, Histable*>*> *idxobjs; // Master list of IndexObjects
435 HashMap<char*, SourceFile*> *sourcesMap; // list of Source which were not archived
Hist_data.h 31 #include <HashMap.h>
207 HashMap<Histable*, HistItem*>*hi_map; // map: Histable -> HistItem
MemorySpace.cc 65 objs = new HashMap<uint64_t, MemObj*>;
117 // Now that we have a hashmap, which has its own vector,
120 objs = new HashMap<uint64_t, MemObj*>;
LoadObject.cc 100 modules = new HashMap<char*, Module*>;
864 seg_modules_map = new HashMap<char*, Module*>;
917 seg_modules_map = new HashMap<char*, Module*>;
DbeSession.cc 125 idxobjs = new Vector<HashMap<uint64_t, Histable*>*>;
131 sourcesMap = new HashMap<char*, SourceFile*>;
133 comp_lobjs = new HashMap<char*, LoadObject*>;
134 comp_dbelines = new HashMap<char*, DbeLine*>;
135 comp_sources = new HashMap<char*, SourceFile*>;
411 HashMap<uint64_t, Histable*> *hMap = idxobjs->get (i);
649 HashMap<uint64_t, Histable*> *v = idxobjs->fetch (i);
3148 idxobjs->append (new HashMap<uint64_t, Histable*>);
3287 HashMap<uint64_t, Histable*> *iobjs = idxobjs->fetch (idxtype);
3294 HashMap<uint64_t, Histable*> *iobjs = idxobjs->fetch (idxtype)
    [all...]
IOActivity.cc 540 fDataHash = new HashMap<char*, FileData*>;
Hist_data.cc 363 hi_map = new HashMap<Histable*, HistItem*>;
  /src/external/gpl3/binutils.old/dist/gprofng/src/
HashMap.h 21 // java.util.HashMap
134 class HashMap
137 HashMap (int initialCapacity = 0);
139 ~HashMap ()
229 HashMap<Key_t, Value_t>
230 ::HashMap (int initialCapacity)
246 HashMap<Key_t, Value_t>::clear ()
266 HashMap<Key_t, Value_t>::resize ()
295 HashMap<Key_t, Value_t>::get (Key_t key)
306 HashMap<Key_t, Value_t>::values (Key_t key
    [all...]
LoadObject.h 46 template <typename Key_t, typename Value_t> class HashMap;
170 HashMap<char*, Module*> *modules;
175 HashMap<char*, Function*> *comp_funcs; // list of comparable functions
193 HashMap<char*, Module*> *seg_modules_map; // to find a comparable module
IOActivity.h 68 HashMap<char*, FileData*> *fDataHash;
MemorySpace.h 32 #include "HashMap.h"
93 HashMap<uint64_t, MemObj*> *objs;
DbeSession.h 54 #include "HashMap.h"
373 HashMap<char*, LoadObject *> *comp_lobjs; // list of comparable LoadObjects
374 HashMap<char*, DbeLine *> *comp_dbelines; // list of comparable DbeLines
375 HashMap<char*, SourceFile*>*comp_sources; // list of comparable SourceFiles
434 Vector<HashMap<uint64_t, Histable*>*> *idxobjs; // Master list of IndexObjects
435 HashMap<char*, SourceFile*> *sourcesMap; // list of Source which were not archived
Hist_data.h 31 #include <HashMap.h>
207 HashMap<Histable*, HistItem*>*hi_map; // map: Histable -> HistItem
MemorySpace.cc 65 objs = new HashMap<uint64_t, MemObj*>;
117 // Now that we have a hashmap, which has its own vector,
120 objs = new HashMap<uint64_t, MemObj*>;
LoadObject.cc 100 modules = new HashMap<char*, Module*>;
864 seg_modules_map = new HashMap<char*, Module*>;
917 seg_modules_map = new HashMap<char*, Module*>;
DbeSession.cc 125 idxobjs = new Vector<HashMap<uint64_t, Histable*>*>;
131 sourcesMap = new HashMap<char*, SourceFile*>;
133 comp_lobjs = new HashMap<char*, LoadObject*>;
134 comp_dbelines = new HashMap<char*, DbeLine*>;
135 comp_sources = new HashMap<char*, SourceFile*>;
411 HashMap<uint64_t, Histable*> *hMap = idxobjs->get (i);
649 HashMap<uint64_t, Histable*> *v = idxobjs->fetch (i);
3148 idxobjs->append (new HashMap<uint64_t, Histable*>);
3287 HashMap<uint64_t, Histable*> *iobjs = idxobjs->fetch (idxtype);
3294 HashMap<uint64_t, Histable*> *iobjs = idxobjs->fetch (idxtype)
    [all...]
IOActivity.cc 540 fDataHash = new HashMap<char*, FileData*>;
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
TpiStream.cpp 145 if (!HashMap.empty())
150 HashMap.resize(Header->NumHashBuckets);
156 HashMap[HV].push_back(TIB++);
165 if (Bucket > HashMap.size())
169 for (TypeIndex TI : HashMap[Bucket]) {
177 bool TpiStream::supportsTypeLookup() const { return !HashMap.empty(); }
194 for (TypeIndex TI : HashMap[BucketIdx]) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
TpiStream.h 90 std::vector<std::vector<codeview::TypeIndex>> HashMap;
  /src/external/gpl3/gcc/dist/gcc/
ordered-hash-map-tests.cc 43 template <typename HashMap, typename Key, typename Value>
45 get_kv_pairs (const HashMap &m,
48 for (typename HashMap::iterator iter = m.begin ();
  /src/external/gpl3/gcc.old/dist/gcc/
ordered-hash-map-tests.cc 43 template <typename HashMap, typename Key, typename Value>
45 get_kv_pairs (const HashMap &m,
48 for (typename HashMap::iterator iter = m.begin ();

Completed in 43 milliseconds

1 2