| /dalvik/vm/test/ |
| H A D | TestHash.cpp | 18 * Test the hash table functions.
76 * Some quick hash table tests.
83 u4 hash; local
97 hash = dvmComputeUtf8Hash(tmpStr);
98 dvmHashTableLookup(pTab, hash, strdup(tmpStr),
107 hash = dvmComputeUtf8Hash(tmpStr);
108 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
118 hash = dvmComputeUtf8Hash(tmpStr);
119 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
141 hash
[all...] |
| /dalvik/vm/compiler/codegen/x86/libenc/ |
| H A D | enc_tabl.cpp | 138 - a mapping between a hash value and an opcode description record for a given
143 a hash value.
147 The hash value is calculated and used as follows:
164 So, assigning lowest value to GP register, the max value of hash can be
167 The hash values to use are:
190 The max number is pretty big and the hash functions is quite rare, thus it
197 between a hash code value and opcode position for each given instruction.
202 1. Select [hash,mnemonic] => 'n'.
205 means 'invalid hash - no opcode with given characteristics'
218 hash
278 unsigned short hash = 0; local
[all...] |
| /dalvik/vm/hprof/ |
| H A D | HprofString.cpp | 40 u4 hash = 0; local
46 hash = hash * 31 + c;
49 return hash;
|
| H A D | HprofClass.cpp | 42 u4 hash; local
47 hash = (u4)clazz->classLoader;
49 hash = hash * 31 + c;
52 return hash;
86 /* We're using the hash table as a list.
87 * TODO: replace the hash table with a more suitable structure
|
| /dalvik/vm/native/ |
| H A D | InternalNative.cpp | 68 * Set up hash values on the class names.
102 u4 hash; local
104 hash = dvmComputeUtf8Hash(classDescriptor);
109 if (pClass->classDescriptorHash == hash &&
|
| H A D | dalvik_system_DexFile.cpp | 77 * Expects that the hash table will be *unlocked* here.
90 u4 hash = cookie;
92 void* result = dvmHashTableLookup(gDvm.userDexFiles, hash, pDexOrJar,
105 * Add given DexOrJar to the hash table of user-loaded dex files.
110 * to find it in the hash table without knowing if it's valid or
111 * not, which means we can't compute a hash value from anything
114 * bits of the pointer as the hash.
116 u4 hash = (u4) pDexOrJar; local
120 result = dvmHashTableLookup(gDvm.userDexFiles, hash, pDexOrJar,
145 * To optimize this away we could search for existing entries in the hash
319 u4 hash = (u4) pDexOrJar; local
[all...] |
| /dalvik/vm/ |
| H A D | UtfString.cpp | 77 * Compute a hash code on a UTF-8 string, for use with internal hash tables.
81 * I'm initializing the hash code to 1 so they *don't* match up.)
84 * the hash with the result. That way, if something encoded the same
85 * character in two different ways, the hash value would be the same. For
90 u4 hash = 1; local
93 hash = hash * 31 + *utf8Str++;
95 return hash;
199 u4 hash local
[all...] |
| H A D | Native.cpp | 147 * We add one of these to the hash table for every library we load. The
148 * hash is on the "pathName" field.
197 u4 hash = dvmComputeUtf8Hash(pathName); local
200 ent = dvmHashTableLookup(gDvm.nativeLibs, hash, (void*)pathName,
213 u4 hash = dvmComputeUtf8Hash(pLib->pathName); local
220 return (SharedLib*)dvmHashTableLookup(gDvm.nativeLibs, hash, pLib,
|
| /dalvik/libdex/ |
| H A D | DexFile.cpp | 155 * Compute a hash code on a UTF-8 string, for use with internal hash tables.
157 * This may or may not be compatible with UTF-8 hash functions used inside
165 u4 hash = 1; local
168 hash = hash * 31 + *str++;
170 return hash;
174 * Add an entry to the class lookup table. We hash the string and probe
184 u4 hash = classDescriptorHash(classDescriptor); local
186 int idx = hash
445 u4 hash; local
[all...] |
| H A D | ZipArchive.cpp | 78 * want to adjust the hash table index by a fixed amount. Using a large
85 * Convert a ZipEntry to a hash table index, verifying that it's in a
101 * Simple string hash function for non-null-terminated strings.
105 unsigned int hash = 0; local
108 hash = hash * 31 + *str++;
110 return hash;
114 * Add a new entry to the hash table.
117 unsigned int hash)
120 int ent = hash
116 addToHash(ZipArchive* pArchive, const char* str, int strLen, unsigned int hash) argument
378 unsigned int nameLen, extraLen, commentLen, hash; local
503 unsigned int hash = computeHash(entryName, nameLen); local
[all...] |
| /dalvik/vm/oo/ |
| H A D | Class.cpp | 934 /* search for these criteria in the Class hash table */
957 * The class hash table lock must be held when calling here, since
1057 * Entries in the class hash table are stored as { descriptor, d-loader }
1064 * The caller must lock the hash table before calling here.
1103 * Search through the hash table to find an entry with a matching descriptor
1115 * to the hash table but are not yet fully loaded and linked. Otherwise,
1126 u4 hash; local
1130 hash = dvmComputeUtf8Hash(descriptor);
1136 found = dvmHashTableLookup(gDvm.loadedClasses, hash, &crit,
1141 * The class has been added to the hash tabl
1172 u4 hash; local
1219 u4 hash = dvmComputeUtf8Hash(clazz->descriptor); local
[all...] |