| /external/llvm/runtime/libprofile/ |
| PathProfiling.c | 135 pathHashEntry_t* hashEntry = hashTable->hashBins[i];
137 while (hashEntry) {
141 pte.pathNumber = hashEntry->pathNumber;
142 pte.pathCounter = hashEntry->pathCount;
149 temp = hashEntry;
150 hashEntry = hashEntry->next;
161 pathHashEntry_t* hashEntry;
168 hashEntry = hashTable->hashBins[index];
170 while (hashEntry) {
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| pr2849.ll | 7 %struct.HashEntry = type { %struct.BaseBoundPtrs }
12 @hash_table_begin = external global %struct.HashEntry*
16 %tmp = load %struct.HashEntry** @hash_table_begin, align 8
25 %tmp4 = getelementptr %struct.HashEntry* %tmp, i64 %tmp3, i32 0, i32 1
33 %tmp15 = getelementptr %struct.HashEntry* %tmp, i64 %tmp14, i32 0, i32 1
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExpandedNameTable.java | 87 * internal HashEntry array.
102 private HashEntry[] m_table;
123 m_table = new HashEntry[m_capacity];
138 m_table[i] = new HashEntry(m_defaultExtendedTypes[i], i, i, null);
192 // Calculate the index into the HashEntry table.
199 for (HashEntry e = m_table[index]; e != null; e = e.next)
210 // Expand the internal HashEntry array if necessary.
233 HashEntry entry = new HashEntry(newET, m_nextType, hash, m_table[index]);
248 HashEntry[] oldTable = m_table
[all...] |
| /external/webkit/Source/JavaScriptCore/runtime/ |
| Lookup.h | 56 class HashEntry {
91 void setNext(HashEntry *next) { m_next = next; }
92 HashEntry* next() const { return m_next; }
120 HashEntry* m_next;
129 mutable const HashEntry* table; // Table allocated at runtime.
146 ALWAYS_INLINE const HashEntry* entry(JSGlobalData* globalData, const Identifier& identifier) const
152 ALWAYS_INLINE const HashEntry* entry(ExecState* exec, const Identifier& identifier) const
159 ALWAYS_INLINE const HashEntry* entry(const Identifier& identifier) const
163 const HashEntry* entry = &table[identifier.impl()->existingHash() & compactHashSizeMask];
181 void setUpStaticFunctionSlot(ExecState*, const HashEntry*, JSObject* thisObject, const Identifier& propertyName, PropertySlot&)
[all...] |
| Lookup.cpp | 32 HashEntry* entries = new HashEntry[compactSize];
38 HashEntry* entry = &entries[hashIndex];
71 void setUpStaticFunctionSlot(ExecState* exec, const HashEntry* entry, JSObject* thisObj, const Identifier& propertyName, PropertySlot& slot)
|
| ClassInfo.h | 30 class HashEntry;
|
| JSObject.cpp | 63 const HashEntry* entry = table->table;
229 const HashEntry* entry = findPropertyHashEntry(exec, propertyName);
302 const HashEntry* JSObject::findPropertyHashEntry(ExecState* exec, const Identifier& propertyName) const
306 if (const HashEntry* entry = propHashTable->entry(exec, propertyName))
|
| JSObject.h | 50 class HashEntry;
79 friend void setUpStaticFunctionSlot(ExecState* exec, const HashEntry* entry, JSObject* thisObj, const Identifier& propertyName, PropertySlot& slot);
302 const HashEntry* findPropertyHashEntry(ExecState*, const Identifier& propertyName) const;
[all...] |
| /bionic/libc/bionic/ |
| malloc_debug_common.h | 52 typedef struct HashEntry HashEntry;
53 struct HashEntry {
55 HashEntry* prev;
56 HashEntry* next;
67 HashEntry* slots[HASHTABLE_SIZE];
|
| malloc_debug_leak.c | 89 HashEntry* entry;
110 static HashEntry* find_entry(HashTable* table, int slot,
113 HashEntry* entry = table->slots[slot];
132 static HashEntry* record_backtrace(intptr_t* backtrace, size_t numEntries, size_t size)
145 HashEntry* entry = find_entry(&gHashTable, slot, backtrace, numEntries, size);
151 entry = (HashEntry*)dlmalloc(sizeof(HashEntry) + numEntries*sizeof(intptr_t));
176 static int is_valid_entry(HashEntry* entry)
181 HashEntry* e1 = gHashTable.slots[i];
196 static void remove_entry(HashEntry* entry
[all...] |
| malloc_debug_common.c | 65 HashEntry* e1 = *(HashEntry**)arg1;
66 HashEntry* e2 = *(HashEntry**)arg2;
140 HashEntry* entry = gHashTable.slots[i];
168 HashEntry* entry = list[i];
|
| /dalvik/vm/ |
| Hash.cpp | 60 (HashEntry*) malloc(pHashTable->tableSize * sizeof(HashEntry));
66 memset(pHashTable->pEntries, 0, pHashTable->tableSize * sizeof(HashEntry));
75 HashEntry* pEnt;
135 HashEntry* pNewEntries;
141 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashEntry));
178 HashEntry* pEntry;
179 HashEntry* pEnd;
253 HashEntry* pEntry
[all...] |
| Hash.h | 61 struct HashEntry {
77 HashEntry* pEntries; /* array on heap */
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 189 static final class HashEntry<K,V> {
193 final HashEntry<K,V> next;
195 HashEntry(K key, int hash, HashEntry<K,V> next, V value) {
203 static final <K,V> HashEntry<K,V>[] newArray(int i) {
204 return new HashEntry[i];
278 transient volatile HashEntry<K,V>[] table;
290 setTable(HashEntry.<K,V>newArray(initialCapacity));
299 * Sets table to new HashEntry array.
302 void setTable(HashEntry<K,V>[] newTable)
[all...] |
| /bootable/recovery/minzip/ |
| Hash.c | 65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable));
79 HashEntry* pEnt;
139 HashEntry* pNewEntries;
145 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable));
182 HashEntry* pEntry;
183 HashEntry* pEnd;
257 HashEntry* pEntry;
258 HashEntry* pEnd;
297 HashEntry* pEnt = &pHashTable->pEntries[i];
318 HashEntry* pEntry
[all...] |
| Hash.h | 49 typedef struct HashEntry {
52 } HashEntry;
65 HashEntry* pEntries; /* array on heap */
108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
|
| /external/elfutils/libelf/ |
| nlist.c | 31 struct hashentry struct
36 #define TYPE struct hashentry
130 struct hashentry mem;
163 struct hashentry search;
164 const struct hashentry *found;
|
| /frameworks/base/include/utils/ |
| ZipFileRO.h | 225 typedef struct HashEntry {
229 } HashEntry;
257 HashEntry* mHashTable;
|
| /external/hyphenation/ |
| hyphen.c | 77 typedef struct _HashEntry HashEntry;
83 HashEntry *entries[HASH_SIZE];
87 HashEntry *next;
125 HashEntry *e, *next;
143 HashEntry *e;
146 e = hnj_malloc (sizeof(HashEntry));
158 HashEntry *e;
223 HashEntry *e;
294 HashEntry *e;
[all...] |
| /external/webkit/Source/WebCore/bindings/js/ |
| JSLocationCustom.cpp | 66 const HashEntry* entry = JSLocationPrototype::s_info.propHashTable(exec)->entry(exec, propertyName);
102 const HashEntry* entry = JSLocationPrototype::s_info.propHashTable(exec)->entry(exec, propertyName);
139 const HashEntry* entry = JSLocation::s_info.propHashTable(exec)->entry(exec, propertyName);
|
| JSHistoryCustom.cpp | 67 const HashEntry* entry = JSHistoryPrototype::s_info.propHashTable(exec)->entry(exec, propertyName);
107 const HashEntry* entry = JSHistoryPrototype::s_info.propHashTable(exec)->entry(exec, propertyName);
|
| /frameworks/base/libs/utils/ |
| ZipFileRO.cpp | 335 mHashTable = (HashEntry*) calloc(mHashTableSize, sizeof(HashEntry));
484 HashEntry hashEntry = mHashTable[ent];
491 const unsigned char* ptr = (const unsigned char*) hashEntry.name;
|
| /external/hyphenation/patches/ |
| 0001-Ehhance-hyphenation-dictionary-reading-from-characte.patch | 98 HashEntry *e;
|
| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
| atom.c | 208 } HashEntry;
211 HashEntry *entry;
226 htable->entry = (HashEntry *) malloc(sizeof(HashEntry)*fsize);
|
| /dalvik/vm/alloc/ |
| Visit.cpp | 43 HashEntry *entry = &table->pEntries[i];
|
