| /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 | 78 HashEntry* entry;
99 static HashEntry* find_entry(HashTable* table, int slot,
102 HashEntry* entry = table->slots[slot];
121 static HashEntry* record_backtrace(intptr_t* backtrace, size_t numEntries, size_t size)
134 HashEntry* entry = find_entry(&gHashTable, slot, backtrace, numEntries, size);
140 entry = (HashEntry*)dlmalloc(sizeof(HashEntry) + numEntries*sizeof(intptr_t));
165 static int is_valid_entry(HashEntry* entry)
170 HashEntry* e1 = gHashTable.slots[i];
185 static void remove_entry(HashEntry* entry
[all...] |
| pthread_debug.c | 685 typedef struct HashEntry HashEntry;
686 struct HashEntry {
688 HashEntry* prev;
689 HashEntry* next;
695 HashEntry* slots[HASHTABLE_SIZE];
732 static void hashmap_removeEntry(HashTable* table, HashEntry* entry)
734 HashEntry* prev = entry->prev;
735 HashEntry* next = entry->next;
744 static HashEntry* hashmap_lookup(HashTable* table
[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];
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashEntry.h | 1 //===- HashEntry.h ---------------------------------------------------------===//
22 /** \class HashEntry
23 * \brief HashEntry is the item in the bucket of hash table.
25 * mcld::HashEntry illustrates the demand from mcld::HashTable.
26 * Since HashTable can change the definition of the HashEntry by changing
27 * the template argument. class mcld::HashEntry here is used to show the
29 * of the hash table which has no relation to mcld::HashEntry
31 * Since mcld::HashEntry here is a special class whose size is changing,
33 * are doing when you let a new class inherit from mcld::HashEntry.
36 class HashEntry
[all...] |
| /external/webkit/Source/JavaScriptCore/runtime/ |
| ClassInfo.h | 30 class HashEntry;
|
| 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)
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 16 #include "mcld/ADT/HashEntry.h"
26 typedef HashEntry<llvm::StringRef,
|
| /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...] |
| /frameworks/compile/mclinker/include/mcld/LD/ |
| StringUnorderedMap.h | 85 struct HashEntry {
88 HashEntry *next;
90 typedef Allocator::template rebind<HashEntry>::other HashEntryAllocator;
97 HashEntry **m_HashTable;
140 HashEntry **tmpTable = new HashEntry*[pCapacity];
141 std::memset(tmpTable, 0, pCapacity * sizeof(HashEntry*));
144 for (HashEntry *j = this->m_HashTable[i]; j != 0; ) {
145 HashEntry *nextJ = j->next;
167 HashEntry *&head = this->m_HashTable[hashVal % this->m_Capacity]
[all...] |
| /bootable/recovery/minzip/ |
| Hash.h | 49 typedef struct HashEntry {
52 } HashEntry;
65 HashEntry* pEntries; /* array on heap */
108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
|
| 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...] |
| /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...] |
| /dalvik/vm/ |
| Hash.cpp | 60 (HashEntry*) calloc(pHashTable->tableSize, sizeof(HashEntry));
74 HashEntry* pEnt;
134 HashEntry* pNewEntries;
140 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashEntry));
177 HashEntry* pEntry;
178 HashEntry* pEnd;
252 HashEntry* pEntry;
253 HashEntry* pEnd
[all...] |
| Hash.h | 61 struct HashEntry {
77 HashEntry* pEntries; /* array on heap */
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
|
| /frameworks/compile/mclinker/unittests/ |
| HashTableTest.cpp | 11 #include "mcld/ADT/HashEntry.h"
80 typedef HashEntry<int*, int, PtrCompare> HashEntryType;
98 typedef HashEntry<int, int, IntCompare> HashEntryType;
106 typedef HashEntry<int, int, IntCompare> HashEntryType;
123 typedef HashEntry<int, int, IntCompare> HashEntryType;
145 typedef HashEntry<int, int, IntCompare> HashEntryType;
170 typedef HashEntry<int, int, IntCompare> HashEntryType;
194 typedef HashEntry<int, int, IntCompare> HashEntryType;
230 typedef HashEntry<int, int, IntCompare> HashEntryType;
251 typedef HashEntry<int, int, IntCompare> HashEntryType
[all...] |
| /frameworks/native/include/utils/ |
| ZipFileRO.h | 225 typedef struct HashEntry {
229 } HashEntry;
257 HashEntry* mHashTable;
|
| /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);
|
| /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/ThirdParty/ANGLE/src/compiler/preprocessor/ |
| atom.c | 208 } HashEntry;
211 HashEntry *entry;
226 htable->entry = (HashEntry *) malloc(sizeof(HashEntry)*fsize);
|
| /frameworks/compile/mclinker/include/mcld/Target/ |
| GNULDBackend.h | 17 #include <mcld/ADT/HashEntry.h>
312 typedef HashEntry<LDSymbol*, size_t, SymCompare> HashEntryType;
|
| /frameworks/native/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;
|
| /dalvik/vm/alloc/ |
| Visit.cpp | 43 HashEntry *entry = &table->pEntries[i];
|
