| /external/webkit/Source/JavaScriptGlue/ForwardingHeaders/wtf/ |
| HashTable.h | 1 #include <JavaScriptCore/HashTable.h>
|
| /external/webkit/Source/WebCore/ForwardingHeaders/wtf/ |
| HashTable.h | 3 #include <JavaScriptCore/HashTable.h>
|
| /external/webkit/Source/WebCore/bindings/js/ |
| DOMObjectHashTableMap.h | 34 // Map from static HashTable instances to per-GlobalData ones.
41 HashMap<const JSC::HashTable*, JSC::HashTable>::iterator mapEnd = m_map.end();
42 for (HashMap<const JSC::HashTable*, JSC::HashTable>::iterator iter = m_map.begin(); iter != m_map.end(); ++iter)
46 const JSC::HashTable* get(const JSC::HashTable* staticTable)
48 HashMap<const JSC::HashTable*, JSC::HashTable>::iterator iter = m_map.find(staticTable);
51 return &m_map.set(staticTable, JSC::HashTable(*staticTable)).first->second
[all...] |
| /external/webkit/Source/JavaScriptCore/runtime/ |
| ClassInfo.h | 31 struct HashTable;
48 const HashTable* propHashTable(ExecState* exec) const
55 const HashTable* staticPropHashTable;
56 typedef const HashTable* (*ClassPropHashTableGetterFunction)(ExecState*);
|
| JSGlobalData.cpp | 95 extern JSC_CONST_HASHTABLE HashTable arrayTable;
96 extern JSC_CONST_HASHTABLE HashTable jsonTable;
97 extern JSC_CONST_HASHTABLE HashTable dateTable;
98 extern JSC_CONST_HASHTABLE HashTable mathTable;
99 extern JSC_CONST_HASHTABLE HashTable numberTable;
100 extern JSC_CONST_HASHTABLE HashTable objectConstructorTable;
101 extern JSC_CONST_HASHTABLE HashTable regExpTable;
102 extern JSC_CONST_HASHTABLE HashTable regExpConstructorTable;
103 extern JSC_CONST_HASHTABLE HashTable stringTable;
149 , arrayTable(fastNew<HashTable>(JSC::arrayTable)
[all...] |
| JSGlobalData.h | 77 struct HashTable;
139 const HashTable* arrayTable;
140 const HashTable* dateTable;
141 const HashTable* jsonTable;
142 const HashTable* mathTable;
143 const HashTable* numberTable;
144 const HashTable* objectConstructorTable;
145 const HashTable* regExpTable;
146 const HashTable* regExpConstructorTable;
147 const HashTable* stringTable
[all...] |
| Lookup.h | 123 struct HashTable {
184 * This method does it all (looking in the hashtable, checking for function
190 inline bool getStaticPropertySlot(ExecState* exec, const HashTable* table, ThisImp* thisObj, const Identifier& propertyName, PropertySlot& slot)
206 inline bool getStaticPropertyDescriptor(ExecState* exec, const HashTable* table, ThisImp* thisObj, const Identifier& propertyName, PropertyDescriptor& descriptor)
229 inline bool getStaticFunctionSlot(ExecState* exec, const HashTable* table, JSObject* thisObj, const Identifier& propertyName, PropertySlot& slot)
248 inline bool getStaticFunctionDescriptor(ExecState* exec, const HashTable* table, JSObject* thisObj, const Identifier& propertyName, PropertyDescriptor& descriptor)
268 inline bool getStaticValueSlot(ExecState* exec, const HashTable* table, ThisImp* thisObj, const Identifier& propertyName, PropertySlot& slot)
286 inline bool getStaticValueDescriptor(ExecState* exec, const HashTable* table, ThisImp* thisObj, const Identifier& propertyName, PropertyDescriptor& descriptor)
306 inline bool lookupPut(ExecState* exec, const Identifier& propertyName, JSValue value, const HashTable* table, ThisImp* thisObj)
331 inline void lookupPut(ExecState* exec, const Identifier& propertyName, JSValue value, const HashTable* table, ThisImp* thisObj, PutPropertySlot& slot
[all...] |
| /bootable/recovery/minzip/ |
| Hash.h | 61 typedef struct HashTable {
67 } HashTable;
70 * Create and initialize a HashTable structure, using "initialSize" as
77 HashTable* mzHashTableCreate(size_t initialSize, HashFreeFunc freeFunc);
90 void mzHashTableClear(HashTable* pHashTable);
95 void mzHashTableFree(HashTable* pHashTable);
100 INLINE int mzHashTableNumEntries(HashTable* pHashTable) {
107 INLINE int mzHashTableMemUsage(HashTable* pHashTable) {
108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
120 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item
[all...] |
| Hash.c | 51 HashTable* mzHashTableCreate(size_t initialSize, HashFreeFunc freeFunc)
53 HashTable* pHashTable;
57 pHashTable = (HashTable*) malloc(sizeof(*pHashTable));
65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable));
77 void mzHashTableClear(HashTable* pHashTable)
102 void mzHashTableFree(HashTable* pHashTable)
115 static int countTombStones(HashTable* pHashTable)
137 static bool resizeHash(HashTable* pHashTable, int newSize)
145 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable));
179 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item
[all...] |
| /dalvik/vm/ |
| Hash.h | 73 struct HashTable {
83 * Create and initialize a HashTable structure, using "initialSize" as
90 HashTable* dvmHashTableCreate(size_t initialSize, HashFreeFunc freeFunc);
103 void dvmHashTableClear(HashTable* pHashTable);
108 void dvmHashTableFree(HashTable* pHashTable);
114 INLINE void dvmHashTableLock(HashTable* pHashTable) {
117 INLINE void dvmHashTableUnlock(HashTable* pHashTable) {
124 INLINE int dvmHashTableNumEntries(HashTable* pHashTable) {
131 INLINE int dvmHashTableMemUsage(HashTable* pHashTable) {
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry)
[all...] |
| Hash.cpp | 44 HashTable* dvmHashTableCreate(size_t initialSize, HashFreeFunc freeFunc)
46 HashTable* pHashTable;
50 pHashTable = (HashTable*) malloc(sizeof(*pHashTable));
72 void dvmHashTableClear(HashTable* pHashTable)
97 void dvmHashTableFree(HashTable* pHashTable)
110 static int countTombStones(HashTable* pHashTable)
132 static bool resizeHash(HashTable* pHashTable, int newSize)
174 void* dvmHashTableLookup(HashTable* pHashTable, u4 itemHash, void* item,
250 bool dvmHashTableRemove(HashTable* pHashTable, u4 itemHash, void* item)
291 int dvmHashForeachRemove(HashTable* pHashTable, HashForeachRemoveFunc func
[all...] |
| /sdk/emulator/qtools/ |
| parse_options.h | 17 extern HashTable<int> excluded_procedures;
18 extern HashTable<int> included_procedures;
|
| hash_table.h | 10 class HashTable {
12 HashTable(int size, T default_value = T());
13 ~HashTable();
42 HashTable<T>::HashTable(int size, T default_value)
64 HashTable<T>::~HashTable()
84 uint32_t HashTable<T>::HashFunction(const char *key)
96 void HashTable<T>::Update(const char *key, T value)
125 bool HashTable<T>::Remove(const char *key
[all...] |
| parse_options.cpp | 18 HashTable<int> excluded_procedures(2000);
19 HashTable<int> included_procedures(2000);
|
| /bionic/libc/bionic/ |
| malloc_debug_common.h | 64 typedef struct HashTable HashTable;
65 struct HashTable {
|
| /external/giflib/ |
| gif_hash.h | 55 void _ClearHashTable(GifHashTableType *HashTable);
56 void _InsertHashTable(GifHashTableType *HashTable, UINT32 Key, int Code);
57 int _ExistsHashTable(GifHashTableType *HashTable, UINT32 Key);
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 17 #include "mcld/ADT/HashTable.h"
31 typedef HashTable<HashEntryType, StringHash<BKDR>, EntryFactory<HashEntryType> > PathCache;
|
| /external/webkit/Source/JavaScriptCore/interpreter/ |
| CallFrame.h | 78 static const HashTable* arrayTable(CallFrame* callFrame) { return callFrame->globalData().arrayTable; }
79 static const HashTable* dateTable(CallFrame* callFrame) { return callFrame->globalData().dateTable; }
80 static const HashTable* jsonTable(CallFrame* callFrame) { return callFrame->globalData().jsonTable; }
81 static const HashTable* mathTable(CallFrame* callFrame) { return callFrame->globalData().mathTable; }
82 static const HashTable* numberTable(CallFrame* callFrame) { return callFrame->globalData().numberTable; }
83 static const HashTable* objectConstructorTable(CallFrame* callFrame) { return callFrame->globalData().objectConstructorTable; }
84 static const HashTable* regExpTable(CallFrame* callFrame) { return callFrame->globalData().regExpTable; }
85 static const HashTable* regExpConstructorTable(CallFrame* callFrame) { return callFrame->globalData().regExpConstructorTable; }
86 static const HashTable* stringTable(CallFrame* callFrame) { return callFrame->globalData().stringTable; }
|
| /external/chromium/base/ |
| id_map.h | 38 typedef base::hash_map<KeyType, T*> HashTable;
82 typename HashTable::iterator i = data_.find(id);
103 typename HashTable::const_iterator i = data_.find(id);
164 typename HashTable::const_iterator iter_;
176 static inline void release_all(HashTable* table) {}
181 static inline void release_all(HashTable* table) {
182 for (typename HashTable::iterator i = table->begin();
211 HashTable data_;
|
| /external/llvm/lib/Support/ |
| StringMap.cpp | 65 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
76 HashTable[FirstTombstone] = FullHashValue;
80 HashTable[BucketNo] = FullHashValue;
87 } else if (HashTable[BucketNo] == FullHashValue) {
120 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
131 } else if (HashTable[BucketNo] == FullHashValue) {
182 /// the appropriate mod-of-hashtable-size.
185 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
212 unsigned FullHash = HashTable[I];
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| ObjectReader.h | 16 #include <mcld/ADT/HashTable.h>
33 typedef HashTable<ResolveInfo,
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashTable.h | 1 //===- HashTable.h ---------------------------------------------------------===//
26 /** \class HashTable
27 * \brief HashTable is a hash table which follows boost::unordered_map, but it
30 * mcld::HashTable is a linear probing hash table. It does not allocate
37 class HashTable : public HashTableImpl<HashEntryTy, HashFunctionTy>,
65 explicit HashTable(size_type pSize=3);
66 ~HashTable();
121 #include "HashTable.tcc"
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| HashTable.h | 68 class HashTable;
75 void addIterator(const HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*,
84 inline void addIterator(const HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*,
97 typedef HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits> HashTableType;
104 friend class HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>;
214 // Any modifications of the m_next or m_previous of an iterator that is in a linked list of a HashTable::m_iterator,
225 typedef HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits> HashTableType;
232 friend class HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>;
287 class HashTable {
296 HashTable();
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| HashTableTest.cpp | 12 #include "mcld/ADT/HashTable.h"
81 typedef HashTable<HashEntryType, PtrHash, EntryFactory<HashEntryType> > HashTableTy;
82 HashTableTy *hashTable = new HashTableTy(0);
87 entry = hashTable->insert(pA, exist);
89 EXPECT_FALSE(hashTable->empty());
92 iter = hashTable->find(NULL);
93 EXPECT_TRUE(iter==hashTable->end());
94 delete hashTable;
99 HashTable<HashEntryType, IntHash, EntryFactory<HashEntryType> > hashTable(16)
[all...] |
| /dalvik/vm/test/ |
| TestHash.cpp | 40 static void dumpForeach(HashTable* pTab)
55 static void dumpIterator(HashTable* pTab)
80 HashTable* pTab;
|
