| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashEntry.h | 1 //===- HashEntry.h ---------------------------------------------------------===//
19 /** \class HashEntry
20 * \brief HashEntry is the item in the bucket of hash table.
22 * mcld::HashEntry illustrates the demand from mcld::HashTable.
23 * Since HashTable can change the definition of the HashEntry by changing
24 * the template argument. class mcld::HashEntry here is used to show the
26 * of the hash table which has no relation to mcld::HashEntry
28 * Since mcld::HashEntry here is a special class whose size is changing,
30 * are doing when you let a new class inherit from mcld::HashEntry.
33 class HashEntry
[all...] |
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 12 #include <mcld/ADT/HashEntry.h>
22 typedef HashEntry<llvm::StringRef,
|
| /bionic/libc/bionic/ |
| malloc_debug_common.h | 58 struct HashEntry {
60 HashEntry* prev;
61 HashEntry* next;
72 HashEntry* slots[HASHTABLE_SIZE];
|
| malloc_debug_leak.cpp | 81 HashEntry* entry;
109 static HashEntry* find_entry(HashTable* table, int slot,
111 HashEntry* entry = table->slots[slot];
130 static HashEntry* record_backtrace(uintptr_t* backtrace, size_t numEntries, size_t size) {
143 HashEntry* entry = find_entry(g_hash_table, slot, backtrace, numEntries, size);
149 entry = static_cast<HashEntry*>(g_malloc_dispatch->malloc(sizeof(HashEntry) + numEntries*sizeof(uintptr_t)));
175 static int is_valid_entry(HashEntry* entry) {
178 HashEntry* e1 = g_hash_table->slots[i];
190 static void remove_entry(HashEntry* entry)
[all...] |
| malloc_debug_common.cpp | 122 const HashEntry* e1 = *static_cast<HashEntry* const*>(arg1);
123 const HashEntry* e2 = *static_cast<HashEntry* const*>(arg2);
191 HashEntry** list = static_cast<HashEntry**>(Malloc(malloc)(sizeof(void*) * g_hash_table.count));
196 HashEntry* entry = g_hash_table.slots[i];
223 HashEntry* entry = list[i];
|
| /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...] |
| /frameworks/compile/mclinker/include/mcld/LD/ |
| SectionSymbolSet.h | 13 #include <mcld/ADT/HashEntry.h>
66 typedef HashEntry<const LDSection*, LDSymbol*, SectCompare> SectHashEntryType;
|
| Archive.h | 13 #include <mcld/ADT/HashEntry.h>
74 typedef HashEntry<uint32_t,
90 typedef HashEntry<const llvm::StringRef,
|
| BranchIsland.h | 12 #include <mcld/ADT/HashEntry.h>
165 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...] |
| /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/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/lib/Script/ |
| ScriptFile.cpp | 27 #include <mcld/ADT/HashEntry.h>
36 typedef HashEntry<std::string,
|
| /prebuilts/misc/common/swig/include/2.0.11/gcj/ |
| javaprims.i | 275 class HashMap$HashEntry;
280 class Hashtable$HashEntry;
|
| /frameworks/compile/mclinker/include/mcld/Target/ |
| GNULDBackend.h | 515 typedef HashEntry<LDSymbol*, size_t, SymCompare> SymHashEntryType;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| ntddk.h | [all...] |
| /prebuilts/tools/common/m2/repository/commons-collections/commons-collections/3.2.1/ |
| commons-collections-3.2.1.jar | |
