HomeSort by relevance Sort by last modified time
    Searched defs:HashEntry (Results 1 - 9 of 9) sorted by null

  /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];
  /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);
  /frameworks/base/include/utils/
ZipFileRO.h 225 typedef struct HashEntry {
229 } HashEntry;
257 HashEntry* mHashTable;
  /dalvik/vm/
Hash.h 61 struct HashEntry {
77 HashEntry* pEntries; /* array on heap */
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
  /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...]
  /external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/
atom.c 208 } HashEntry;
211 HashEntry *entry;
226 htable->entry = (HashEntry *) malloc(sizeof(HashEntry)*fsize);
  /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...]
  /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...]

Completed in 83 milliseconds