| /bionic/libc/bionic/ |
| malloc_debug_common.h | 52 struct HashEntry {
54 HashEntry* prev;
55 HashEntry* next;
65 HashEntry* slots[HASHTABLE_SIZE];
|
| malloc_debug_leak.cpp | 81 HashEntry* entry;
105 static HashEntry* find_entry(HashTable* table, int slot,
107 HashEntry* entry = table->slots[slot];
126 static HashEntry* record_backtrace(uintptr_t* backtrace, size_t numEntries, size_t size) {
139 HashEntry* entry = find_entry(&gHashTable, slot, backtrace, numEntries, size);
145 entry = static_cast<HashEntry*>(dlmalloc(sizeof(HashEntry) + numEntries*sizeof(uintptr_t)));
171 static int is_valid_entry(HashEntry* entry) {
175 HashEntry* e1 = gHashTable.slots[i];
190 static void remove_entry(HashEntry* entry)
[all...] |
| malloc_debug_common.cpp | 67 const HashEntry* e1 = *static_cast<HashEntry* const*>(arg1);
68 const HashEntry* e2 = *static_cast<HashEntry* const*>(arg2);
135 HashEntry** list = static_cast<HashEntry**>(dlmalloc(sizeof(void*) * gHashTable.count));
140 HashEntry* entry = gHashTable.slots[i];
169 HashEntry* entry = list[i];
|
| pthread_debug.cpp | 498 typedef struct HashEntry HashEntry;
499 struct HashEntry {
501 HashEntry* prev;
502 HashEntry* next;
508 HashEntry* slots[HASHTABLE_SIZE];
545 static void hashmap_removeEntry(HashTable* table, HashEntry* entry)
547 HashEntry* prev = entry->prev;
548 HashEntry* next = entry->next;
557 static HashEntry* hashmap_lookup(HashTable* table
[all...] |
| /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...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 172 static final class HashEntry<K,V> {
176 volatile HashEntry<K,V> next;
178 HashEntry(int hash, K key, V value, HashEntry<K,V> next) {
189 final void setNext(HashEntry<K,V> n) {
199 Class<?> k = HashEntry.class;
214 static final <K,V> HashEntry<K,V> entryAt(HashEntry<K,V>[] tab, int i) {
216 (HashEntry<K,V>) UNSAFE.getObjectVolatile
224 static final <K,V> void setEntryAt(HashEntry<K,V>[] tab, int i
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/collections/ |
| AbstractHashedMap.java | 29 * Key-value entries are stored in instances of the <code>HashEntry</code> class,
87 protected transient HashEntry<K, V>[] data;
126 this.data = new HashEntry[initialCapacity];
162 this.data = new HashEntry[initialCapacity];
192 HashEntry<K, V> entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
229 HashEntry entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
248 HashEntry entry = data[i];
258 HashEntry entry = data[i];
281 HashEntry<K, V> entry = data[index];
326 HashEntry<K, V> entry = data[index]
[all...] |
| AbstractReferenceMap.java | 2 // Perhaps use four different types of HashEntry classes for max efficiency:
3 // normal HashEntry for HARD,HARD
377 HashEntry<K, V> previous = null;
378 HashEntry<K, V> entry = data[index];
402 protected HashEntry<K, V> getEntry(Object key) {
418 protected int hashEntry(Object key, Object value) {
442 * Creates a ReferenceEntry instead of a HashEntry.
450 public HashEntry<K, V> createEntry(HashEntry<K, V> next, int hashCode, K key, V value) {
564 protected static class ReferenceEntry <K,V> extends HashEntry<K, V>
[all...] |
| /frameworks/compile/mclinker/include/mcld/LD/ |
| SectionSymbolSet.h | 16 #include <mcld/ADT/HashEntry.h>
69 typedef HashEntry<const LDSection*, LDSymbol*, SectCompare> SectHashEntryType;
|
| Archive.h | 16 #include <mcld/ADT/HashEntry.h>
79 typedef HashEntry<uint32_t,
95 typedef HashEntry<const llvm::StringRef,
|
| BranchIsland.h | 17 #include <mcld/ADT/HashEntry.h>
152 typedef HashEntry<Key, Stub*, Key::Compare> StubEntryType;
|
| /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...] |
| /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;
193 typedef HashEntry<int, int, IntCompare> HashEntryType;
229 typedef HashEntry<int, int, IntCompare> HashEntryType;
250 typedef HashEntry<int, int, IntCompare> HashEntryType
[all...] |
| /frameworks/compile/mclinker/include/mcld/Fragment/ |
| FragmentGraph.h | 18 #include <mcld/ADT/HashEntry.h>
98 typedef HashEntry<const Fragment*, FGNode*, PtrCompare> FragHashEntryType;
104 typedef HashEntry<const ResolveInfo*, FGNode*, PtrCompare> SymHashEntryType;
|
| /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);
|
| /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...] |
