HomeSort by relevance Sort by last modified time
    Searched defs:HashEntry (Results 1 - 7 of 7) 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 209 typedef struct HashEntry {
213 } HashEntry;
241 HashEntry* mHashTable;
  /dalvik/vm/
Hash.h 61 typedef struct HashEntry {
64 } HashEntry;
77 HashEntry* pEntries; /* array on heap */
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
  /external/webkit/JavaScriptCore/runtime/
Lookup.h 54 class HashEntry : public FastAllocBase {
78 void setNext(HashEntry *next) { m_next = next; }
79 HashEntry* next() const { return m_next; }
104 HashEntry* m_next;
113 mutable const HashEntry* table; // Table allocated at runtime.
130 ALWAYS_INLINE const HashEntry* entry(JSGlobalData* globalData, const Identifier& identifier) const
136 ALWAYS_INLINE const HashEntry* entry(ExecState* exec, const Identifier& identifier) const
143 ALWAYS_INLINE const HashEntry* entry(const Identifier& identifier) const
147 const HashEntry* entry = &table[identifier.ustring().rep()->existingHash() & compactHashSizeMask];
165 void setUpStaticFunctionSlot(ExecState*, const HashEntry*, JSObject* thisObject, const Identifier& propertyName, PropertySlot&)
    [all...]
  /libcore/luni/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 199 static final class HashEntry<K,V> {
203 final HashEntry<K,V> next;
205 HashEntry(K key, int hash, HashEntry<K,V> next, V value) {
213 static final <K,V> HashEntry<K,V>[] newArray(int i) {
214 return new HashEntry[i];
288 transient volatile HashEntry<K,V>[] table;
300 setTable(HashEntry.<K,V>newArray(initialCapacity));
309 * Sets table to new HashEntry array.
312 void setTable(HashEntry<K,V>[] newTable)
    [all...]

Completed in 147 milliseconds