/external/chromium/net/disk_cache/ |
hash.cc | 1 // From http://www.azillionmonkeys.com/qed/hash.html 3 #include "net/disk_cache/hash.h" 22 uint32_t hash = len, tmp; local 33 hash += get16bits(data); 34 tmp = (get16bits(data + 2) << 11) ^ hash; 35 hash = (hash << 16) ^ tmp; 37 hash += hash >> 11; 42 case 3: hash += get16bits(data) [all...] |
/external/e2fsprogs/tests/f_h_badnode/ |
name | 0 hash directory with bad HTREE nodes
|
/external/e2fsprogs/tests/f_h_reindex/ |
name | 1 reindex HTREE Directory with different hash seed
|
expect.1 | 5 Problem in HTREE directory inode 16001: block #1 has bad max hash 6 Problem in HTREE directory inode 16001: block #2 has bad min hash 7 Problem in HTREE directory inode 16001: block #2 has bad max hash 8 Problem in HTREE directory inode 16001: block #3 has bad min hash 9 Problem in HTREE directory inode 16001: block #3 has bad max hash 10 Problem in HTREE directory inode 16001: block #4 has bad min hash 11 Problem in HTREE directory inode 16001: block #4 has bad max hash 12 Problem in HTREE directory inode 16001: block #5 has bad min hash 13 Problem in HTREE directory inode 16001: block #5 has bad max hash 14 Problem in HTREE directory inode 16001: block #6 has bad min hash [all...] |
/external/chromium_org/base/ |
hash.cc | 1 // From http://www.azillionmonkeys.com/qed/hash.html 3 #include "base/hash.h" 22 uint32_t hash = len, tmp; local 33 hash += get16bits(data); 34 tmp = (get16bits(data + 2) << 11) ^ hash; 35 hash = (hash << 16) ^ tmp; 37 hash += hash >> 11; 43 hash += get16bits(data) [all...] |
sha1.h | 16 static const size_t kSHA1Length = 20; // Length in bytes of a SHA-1 hash. 18 // Computes the SHA-1 hash of the input string |str| and returns the full 19 // hash. 22 // Computes the SHA-1 hash of the |len| bytes in |data| and puts the hash 23 // in |hash|. |hash| must be kSHA1Length bytes long. 25 unsigned char* hash);
|
/external/chromium_org/third_party/smhasher/src/ |
SuperFastHash.cpp | 8 http://www.azillionmonkeys.com/qed/hash.html */ 29 uint32_t hash = 0, tmp; local 39 hash += get16bits (data); 40 tmp = (get16bits (data+2) << 11) ^ hash; 41 hash = (hash << 16) ^ tmp; 43 hash += hash >> 11; 48 case 3: hash += get16bits (data); 49 hash ^= hash << 16 [all...] |
/hardware/invensense/60xx/mlsdk/mlutils/ |
checksum.c | 3 /** bernstein hash, from public domain source */ 7 uint32_t hash = 5381; local 12 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */ 15 return hash;
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
ObjectExtensions.cs | 55 int hash = 23; 56 hash = ( ( hash << 5 ) * 37 ) ^ a; 57 hash = ( ( hash << 5 ) * 37 ) ^ b; 58 return hash; 63 int hash = 23; 64 hash = ( ( hash << 5 ) * 37 ) ^ a; 65 hash = ( ( hash << 5 ) * 37 ) ^ b [all...] |
/system/core/libutils/ |
JenkinsHash.cpp | 17 /* Implementation of Jenkins one-at-a-time hash function. These choices are 26 hash_t JenkinsHashWhiten(uint32_t hash) { 27 hash += (hash << 3); 28 hash ^= (hash >> 11); 29 hash += (hash << 15); 30 return hash; 33 uint32_t JenkinsHashMixBytes(uint32_t hash, const uint8_t* bytes, size_t size) [all...] |
/external/e2fsprogs/ext2ed/ |
ext2.descriptors | 416 __u32 hash[1]; 418 __u32 hash[2]; 420 __u32 hash[3]; 422 __u32 hash[4]; 424 __u32 hash[5]; 426 __u32 hash[6]; 428 __u32 hash[7]; 430 __u32 hash[8]; 432 __u32 hash[9]; 434 __u32 hash[10] [all...] |
/external/chromium_org/tools/page_cycler/startup_test_common/ |
blank.html | 3 console.log("PAGE_ONLOAD_EVENT" + location.hash);
|
/external/skia/tests/ |
DynamicHashTest.cpp | 23 class Hash : public SkTDynamicHash<Entry, int, GetKey, GetHash, AreEqual> { 25 Hash() : INHERITED() {} 26 Hash(int capacity) : INHERITED(capacity) {} 47 Hash hash(4); 48 ASSERT(hash.capacity() == 4); 50 hash.add(&a); 51 ASSERT(hash.capacity() == 4); 53 hash.add(&b); 54 ASSERT(hash.capacity() == 4) 69 Hash hash; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
cso_hash.c | 97 static void *cso_data_allocate_node(struct cso_hash_data *hash) 99 return MALLOC(hash->nodeSize); 108 cso_hash_create_node(struct cso_hash *hash, 112 struct cso_node *node = cso_data_allocate_node(hash->data.d); 122 ++hash->data.d->size; 126 static void cso_data_rehash(struct cso_hash_data *hash, int hint) 132 hash->userNumBits = (short)hint; 133 while (primeForNumBits(hint) < (hash->size >> 1)) 139 if (hash->numBits != hint) { 140 struct cso_node *e = (struct cso_node *)(hash); 240 struct cso_hash *hash = MALLOC_STRUCT(cso_hash); local [all...] |
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
cso_hash.c | 97 static void *cso_data_allocate_node(struct cso_hash_data *hash) 99 return MALLOC(hash->nodeSize); 108 cso_hash_create_node(struct cso_hash *hash, 112 struct cso_node *node = cso_data_allocate_node(hash->data.d); 122 ++hash->data.d->size; 126 static void cso_data_rehash(struct cso_hash_data *hash, int hint) 132 hash->userNumBits = (short)hint; 133 while (primeForNumBits(hint) < (hash->size >> 1)) 139 if (hash->numBits != hint) { 140 struct cso_node *e = (struct cso_node *)(hash); 240 struct cso_hash *hash = MALLOC_STRUCT(cso_hash); local [all...] |
/external/chromium_org/third_party/icu/source/test/cintltst/ |
chashtst.c | 30 static void _put(UHashtable* hash, 35 static void _get(UHashtable* hash, 39 static void _remove(UHashtable* hash, 104 UHashtable *hash; local 106 hash = uhash_open(hashChars, isEqualChars, NULL, &status); 109 u_errorName(status), hash); 112 if (hash == NULL) { 116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); 118 _put(hash, one, 1, 0); 119 _put(hash, omega, 24, 0) 154 UHashtable *hash; local 288 UHashtable *hash; local [all...] |
/external/icu4c/test/cintltst/ |
chashtst.c | 30 static void _put(UHashtable* hash, 35 static void _get(UHashtable* hash, 39 static void _remove(UHashtable* hash, 104 UHashtable *hash; local 106 hash = uhash_open(hashChars, isEqualChars, NULL, &status); 109 u_errorName(status), hash); 112 if (hash == NULL) { 116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); 118 _put(hash, one, 1, 0); 119 _put(hash, omega, 24, 0) 154 UHashtable *hash; local 288 UHashtable *hash; local [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
GrBinHashKey.h | 16 * GrBinHashKey is a hash key class that can take a data chunk of any predetermined 17 * length. The hash function used is the One-at-a-Time Hash 18 * (http://burtleburtle.net/bob/hash/doobs.html). 40 uint32_t hash = 0; local 43 hash += *data++; 44 hash += (hash << 10); 45 hash ^= (hash >> 6) [all...] |
/external/skia/src/gpu/ |
GrBinHashKey.h | 16 * GrBinHashKey is a hash key class that can take a data chunk of any predetermined 17 * length. The hash function used is the One-at-a-Time Hash 18 * (http://burtleburtle.net/bob/hash/doobs.html). 40 uint32_t hash = 0; local 43 hash += *data++; 44 hash += (hash << 10); 45 hash ^= (hash >> 6) [all...] |
/external/chromium/base/ |
sha1.h | 18 SHA1_LENGTH = 20 // Length in bytes of a SHA-1 hash. 21 // Computes the SHA-1 hash of the input string |str| and returns the full 22 // hash. 25 // Computes the SHA-1 hash of the |len| bytes in |data| and puts the hash 26 // in |hash|. |hash| must be SHA1_LENGTH bytes long. 28 unsigned char* hash);
|
/external/chromium_org/remoting/host/ |
pin_hash.h | 12 // Creates a Me2Me shared-secret hash, consisting of the hash method, and the 16 // Extracts the hash function from the given hash, uses it to calculate the 17 // hash of the given host ID and PIN, and compares that hash to the given hash. 19 bool VerifyHostPinHash(const std::string& hash,
|
/external/clang/test/Preprocessor/ |
hash_space.c | 5 #define HASH # 6 HASH define foo bar
|
/external/linux-tools-perf/util/include/linux/ |
hash.h | 5 #include "../../../../include/linux/hash.h" 7 #include "added/hash.h"
|
/build/tools/droiddoc/templates-pdk/assets/ |
jquery-history.js | 15 return msie.getDoc().location.hash; 17 setHash: function(hash) { 21 d.location.hash = hash; 26 var hash = msie.iframe ? msie.getHash() : location.hash; 27 if (hash != currentHash) { 28 currentHash = hash; 30 location.hash = currentHash; 39 add: function(hash) { [all...] |
/external/chromium_org/media/base/ |
djb2.cc | 9 uint32 hash = seed; local 11 hash = hash * 33 + src[i]; 13 return hash;
|