| /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/skia/tests/ |
| DynamicHashTest.cpp | 18 static uint32_t Hash(const int& key) { return key; }
22 class Hash : public SkTDynamicHash<Entry, int> {
24 Hash() : INHERITED() {}
45 Hash hash; local
46 ASSERT(hash.capacity() == 0);
48 hash.add(&a);
49 ASSERT(hash.capacity() == 4);
51 hash.add(&b);
52 ASSERT(hash.capacity() == 4)
67 Hash hash; local
79 Hash hash; local
114 Hash hash; local
140 Hash hash; local
193 Hash hash; local
[all...] |
| /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...] |
| /external/skia/include/private/ |
| SkChecksum.h | 18 * uint32_t -> uint32_t hash, useful for when you're about to trucate this hash but you
23 static uint32_t Mix(uint32_t hash) {
24 hash ^= hash >> 16;
25 hash *= 0x85ebca6b;
26 hash ^= hash >> 13;
27 hash *= 0xc2b2ae35;
28 hash ^= hash >> 16
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mips-elf/ |
| hash1b.d | 2 #ld: -shared --hash-style=both
3 #error: .gnu.hash is incompatible with the MIPS ABI
|
| hash1c.d | 2 #ld: -shared --hash-style=gnu
3 #error: .gnu.hash is incompatible with the MIPS ABI
|
| /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...] |
| /art/test/120-hashcode/ |
| info.txt | 1 Check that object hashCode and System.identityHashCode never cause the hash to change
|
| /external/llvm/lib/Fuzzer/test/ |
| SimpleHashTest.cpp | 13 uint32_t Hash = 0x12039854;
15 Hash += Data[i];
16 Hash += (Hash << 10);
17 Hash ^= (Hash >> 6);
19 Hash += (Hash << 3);
20 Hash ^= (Hash >> 11)
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elf/ |
| note-3.l | 1 .*warning: section '.hash' is being made into a note
|
| /prebuilts/go/darwin-x86/src/hash/ |
| hash.go | 5 // Package hash provides interfaces for hash functions.
6 package hash
10 // Hash is the common interface implemented by all hash functions.
11 type Hash interface {
12 // Write (via the embedded io.Writer interface) adds more data to the running hash.
16 // Sum appends the current hash to b and returns the resulting slice.
17 // It does not change the underlying hash state.
20 // Reset resets the Hash to its initial state
[all...] |
| /prebuilts/go/linux-x86/src/hash/ |
| hash.go | 5 // Package hash provides interfaces for hash functions.
6 package hash
10 // Hash is the common interface implemented by all hash functions.
11 type Hash interface {
12 // Write (via the embedded io.Writer interface) adds more data to the running hash.
16 // Sum appends the current hash to b and returns the resulting slice.
17 // It does not change the underlying hash state.
20 // Reset resets the Hash to its initial state
[all...] |
| /prebuilts/go/darwin-x86/pkg/darwin_amd64_race/ |
| crypto.a | 9 import hash "hash"
12 type @"hash".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"hash".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
13 type @"".Hash uint
14 func (@"".h·2 @"".Hash) Available () (? bool) { return @"".h·2 < @"".Hash(0x10) && @"".hashes[@"".h·2] != nil }
15 func (@"".h·2 @"".Hash) HashFunc () (? @"".Hash) { return @"".h·2
[all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64_race/ |
| crypto.a | 9 import hash "hash"
12 type @"hash".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"hash".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
13 type @"".Hash uint
14 func (@"".h·2 @"".Hash) Available () (? bool) { return @"".h·2 < @"".Hash(0x10) && @"".hashes[@"".h·2] != nil }
15 func (@"".h·2 @"".Hash) HashFunc () (? @"".Hash) { return @"".h·2
[all...] |
| /prebuilts/go/darwin-x86/pkg/darwin_amd64/ |
| crypto.a | 9 import hash "hash"
12 type @"hash".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"hash".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
13 type @"".Hash uint
14 func (@"".h·2 @"".Hash) Available () (? bool) { return @"".h·2 < @"".Hash(0x10) && @"".hashes[@"".h·2] != nil }
15 func (@"".h·2 @"".Hash) HashFunc () (? @"".Hash) { return @"".h·2
[all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64/ |
| crypto.a | 9 import hash "hash"
12 type @"hash".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"hash".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
13 type @"".Hash uint
14 func (@"".h·2 @"".Hash) Available () (? bool) { return @"".h·2 < @"".Hash(0x10) && @"".hashes[@"".h·2] != nil }
15 func (@"".h·2 @"".Hash) HashFunc () (? @"".Hash) { return @"".h·2
[all...] |
| /system/core/libutils/ |
| JenkinsHash.cpp | 17 /* Implementation of Jenkins one-at-a-time hash function. These choices are
30 hash_t JenkinsHashWhiten(uint32_t hash) {
31 hash += (hash << 3);
32 hash ^= (hash >> 11);
33 hash += (hash << 15);
34 return hash;
37 uint32_t JenkinsHashMixBytes(uint32_t hash, const uint8_t* bytes, size_t size)
[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/icu/icu4c/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/libdrm/amdgpu/ |
| util_hash.c | 100 static void *util_data_allocate_node(struct util_hash_data *hash)
102 return malloc(hash->nodeSize);
111 util_hash_create_node(struct util_hash *hash,
115 struct util_node *node = util_data_allocate_node(hash->data.d);
125 ++hash->data.d->size;
129 static void util_data_rehash(struct util_hash_data *hash, int hint)
135 hash->userNumBits = (short)hint;
136 while (primeForNumBits(hint) < (hash->size >> 1))
142 if (hash->numBits != hint) {
143 struct util_node *e = (struct util_node *)(hash);
243 struct util_hash *hash = malloc(sizeof(struct util_hash)); local
[all...] |
| /external/clang/test/Preprocessor/ |
| hash_space.c | 5 #define HASH #
6 HASH define foo bar
|
| /external/curl/tests/data/ |
| test1305 | 6 hash
20 internal hash create/destroy testing
|
| test1602 | 5 hash
19 Internal hash create/add/destroy testing, exercising clean functions
|
