/external/webkit/JavaScriptCore/runtime/ |
ClassInfo.h | 45 * Static hash-table of properties.
|
UStringImpl.h | 157 unsigned hash() const { if (!m_hash) m_hash = computeHash(data(), m_length); return m_hash; } function in class:JSC::UStringImpl 159 void setHash(unsigned hash) { ASSERT(hash == computeHash(data(), m_length)); m_hash = hash; } // fast path for Identifiers
|
/external/webkit/WebCore/page/ |
Location.h | 57 String hash() const;
|
/external/webkit/WebCore/platform/graphics/haiku/ |
FontPlatformData.h | 60 unsigned hash() const;
|
/external/webkit/WebCore/workers/ |
WorkerLocation.h | 59 String hash() const;
|
WorkerLocation.idl | 42 readonly attribute DOMString hash;
|
/external/webkit/WebKitTools/DumpRenderTree/win/ |
MD5.h | 43 void MD5_Final(unsigned char hash[16], MD5_CTX*);
|
/external/webkit/WebKitTools/Scripts/webkitpy/layout_tests/layout_package/ |
test_failures.py | 210 """Actual result hash was missing.""" 217 return "No expected image hash found" 257 """Actual result hash is incorrect.""" 264 return "Images match, expected image hash incorrect. "
|
/external/wpa_supplicant/ |
aes_wrap.h | 5 * - One-Key CBC MAC (OMAC1) hash with AES-128
|
/external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
aes_wrap.h | 5 * - One-Key CBC MAC (OMAC1) hash with AES-128
|
/external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
ikev2_common.h | 259 /* Maximum hash length for supported hash algorithms */ 282 size_t data_len, u8 *hash); 286 u8 *hash);
|
/frameworks/base/awt/java/awt/geom/ |
Point2D.java | 306 HashCode hash = new HashCode(); local 307 hash.append(getX()); 308 hash.append(getY()); 309 return hash.hashCode();
|
/ndk/build/platforms/android-5/arch-x86/usr/lib/ |
libthread_db.so | |
/ndk/build/platforms/android-8/arch-x86/usr/lib/ |
libthread_db.so | |
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
Corpus.java | 31 * and {@link Object#hashCode()} so that they can be used as keys in hash maps.
|
/bootable/recovery/applypatch/ |
main.c | 144 // - if the sha1 hash of <tgt-file> is <tgt-sha1>, does nothing and exits 147 // - otherwise, if the sha1 hash of <src-file> is <src-sha1>, applies the 150 // file has sha1 hash <tgt-sha1>, moves it to replace <tgt-file>, and
|
/build/tools/apicheck/src/com/android/apicheck/ |
MethodInfo.java | 190 String hash = ""; local 192 hash += ":" + pInfo.getType(); 194 return hash;
|
/build/tools/lsd/ |
lsd.c | 15 #include <hash.h> 48 section_info_t hash; member in struct:source_t 204 source->hash.scn = scn; 205 source->hash.data = elf_getdata(scn, NULL); 206 FAILIF_LIBELF(NULL == source->hash.data, elf_getdata); 207 memcpy(&source->hash.shdr, shdr, sizeof(GElf_Shdr)); 236 FAILIF(source->hash.scn == NULL, 237 "File [%s] does not have a hash table!\n", 239 FAILIF(source->hash.shdr.sh_link != elf_ndxscn(source->symtab.scn), 240 "Hash points to section %d, not to %d as expected!\n" [all...] |
/dalvik/dx/src/com/android/dx/ssa/back/ |
IdenticalBlockCombiner.java | 55 * a hash. In particular, hash the contents of each block and only 56 * compare blocks with the same hash.
|
/dalvik/libcore/luni/src/main/java/org/apache/harmony/misc/ |
HashCode.java | 21 * This class is a convenience method to sequentially calculate hash code of the 26 * If you need order independent hash code just summate, multiply or XOR all 40 * The hash code calculation can be expressed in 2 forms.
|
/dalvik/libcore/security/src/main/java/java/security/ |
Permission.java | 52 * Returns the hash code value for this {@code Permission}. Returns the same 53 * hash code for {@code Permission}s that are equal to each other as 56 * @return the hash code value for this {@code Permission}.
|
/dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
AttributedCharacterIteratorAttributeTest.java | 154 assertTrue("The hash codes of same attributes are not equal", mac1 160 assertTrue("The hash codes of different attributes are equal", mac1 165 assertTrue("The hash codes of same attributes but different hierarchy classes are not equal",
|
/external/dropbear/libtomcrypt/notes/ |
tech0004.txt | 19 pool = hash(pool || newbits) 39 Effective bits are added to the pool by sending them through a hash [but not terminating the hash].
|
/external/dropbear/libtomcrypt/src/pk/pkcs1/ |
pkcs_1_oaep_decode.c | 27 @param hash_idx The index of the hash desired 51 /* test valid hash */ 58 /* test hash/message size */
|
/external/e2fsprogs/intl/ |
gettextP.h | 108 /* Size of hash table. */ 110 /* Pointer to hash table. */ 112 /* 1 if the hash table uses a different endianness than this machine. */
|