| /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...] |
| HashEntry.tcc | 1 //===- HashEntry.tcc ------------------------------------------------------===//
11 // template implementation of HashEntry
13 HashEntry<KeyType, ValueType, KeyCompare>::HashEntry(const KeyType& pKey)
18 HashEntry<KeyType, ValueType, KeyCompare>::~HashEntry()
23 bool HashEntry<KeyType, ValueType, KeyCompare>::compare(const KeyType& pKey)
|
| /external/llvm/runtime/libprofile/ |
| PathProfiling.c | 130 pathHashEntry_t* hashEntry = hashTable->hashBins[i];
132 while (hashEntry) {
136 pte.pathNumber = hashEntry->pathNumber;
137 pte.pathCounter = hashEntry->pathCount;
144 temp = hashEntry;
145 hashEntry = hashEntry->next;
156 pathHashEntry_t* hashEntry;
163 hashEntry = hashTable->hashBins[index];
165 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/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...] |
| /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);
|
| /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...] |
| /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...] |
| /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);
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 15 #include <mcld/ADT/HashEntry.h>
25 typedef HashEntry<llvm::StringRef,
|
| /bionic/libc/bionic/ |
| malloc_debug_leak.cpp | 78 HashEntry* entry;
106 static HashEntry* find_entry(HashTable* table, int slot,
108 HashEntry* entry = table->slots[slot];
127 static HashEntry* record_backtrace(uintptr_t* backtrace, size_t numEntries, size_t size) {
140 HashEntry* entry = find_entry(&gHashTable, slot, backtrace, numEntries, size);
146 entry = static_cast<HashEntry*>(dlmalloc(sizeof(HashEntry) + numEntries*sizeof(uintptr_t)));
172 static int is_valid_entry(HashEntry* entry) {
176 HashEntry* e1 = gHashTable.slots[i];
191 static void remove_entry(HashEntry* entry)
[all...] |
| malloc_debug_common.h | 57 struct HashEntry {
59 HashEntry* prev;
60 HashEntry* next;
70 HashEntry* slots[HASHTABLE_SIZE];
|
| 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...] |
| 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];
|
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| hash.c | 52 struct HashEntry {
55 struct HashEntry *Next; /**< pointer to next entry */
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
104 struct HashEntry *entry = table->Table[pos];
106 struct HashEntry *next = entry->Next;
130 const struct HashEntry *entry;
180 struct HashEntry *entry;
208 entry = MALLOC_STRUCT(HashEntry);
234 struct HashEntry *entry, *prev;
293 struct HashEntry *entry, *next
[all...] |
| /external/mesa3d/src/mesa/main/ |
| hash.c | 52 struct HashEntry {
55 struct HashEntry *Next; /**< pointer to next entry */
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
104 struct HashEntry *entry = table->Table[pos];
106 struct HashEntry *next = entry->Next;
130 const struct HashEntry *entry;
180 struct HashEntry *entry;
208 entry = MALLOC_STRUCT(HashEntry);
234 struct HashEntry *entry, *prev;
293 struct HashEntry *entry, *next
[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,
|
| /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;
|
| /external/elfutils/libelf/ |
| nlist.c | 64 struct hashentry struct
69 #define TYPE struct hashentry
163 struct hashentry mem;
196 struct hashentry search;
197 const struct hashentry *found;
|
| /frameworks/base/include/androidfw/ |
| ZipFileRO.h | 225 typedef struct HashEntry {
229 } HashEntry;
257 HashEntry* mHashTable;
|
