HomeSort by relevance Sort by last modified time
    Searched refs:hash (Results 1 - 25 of 1583) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/elfutils/0.153/libelf/
dl-hash.h 1 /* Compute hash value for given string according to ELF standard.
62 unsigned int hash = (unsigned int) *iname++; local
65 hash = (hash << 4) + (unsigned int) *iname++;
68 hash = (hash << 4) + (unsigned int) *iname++;
71 hash = (hash << 4) + (unsigned int) *iname++;
74 hash = (hash << 4) + (unsigned int) *iname++
    [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/chromium_org/base/third_party/superfasthash/
superfasthash.c 42 uint32_t hash = len, tmp; local
52 hash += get16bits (data);
53 tmp = (get16bits (data+2) << 11) ^ hash;
54 hash = (hash << 16) ^ tmp;
56 hash += hash >> 11;
61 case 3: hash += get16bits (data);
62 hash ^= hash << 16
    [all...]
  /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...]
SpeedTest.h 5 void BulkSpeedTest ( pfHash hash, uint32_t seed );
6 void TinySpeedTest ( pfHash hash, int hashsize, int keysize, uint32_t seed, bool verbose, double & outCycles );
  /external/libcxx/test/extensions/hash/
specializations.pass.cpp 17 assert(__gnu_cxx::hash<const char *>()("test") ==
18 std::hash<std::string>()("test"));
19 assert(__gnu_cxx::hash<char *>()(str) == std::hash<std::string>()("test"));
20 assert(__gnu_cxx::hash<char>()(42) == 42);
21 assert(__gnu_cxx::hash<signed char>()(42) == 42);
22 assert(__gnu_cxx::hash<unsigned char>()(42) == 42);
23 assert(__gnu_cxx::hash<short>()(42) == 42);
24 assert(__gnu_cxx::hash<unsigned short>()(42) == 42);
25 assert(__gnu_cxx::hash<int>()(42) == 42)
    [all...]
  /external/guava/guava/src/com/google/common/hash/
HashCodes.java 15 package com.google.common.hash;
29 static HashCode fromInt(int hash) {
30 return new IntHashCode(hash);
34 final int hash; field in class:HashCodes.IntHashCode
36 IntHashCode(int hash) {
37 this.hash = hash;
46 (byte) hash,
47 (byte) (hash >> 8),
48 (byte) (hash >> 16)
70 final long hash; field in class:HashCodes.LongHashCode
    [all...]
package-info.java 17 * Hash functions and related structures.
20 package com.google.common.hash;
  /external/clang/test/CodeGen/
ubsan-blacklist.c 2 // RUN: echo "fun:hash" > %t-func.blacklist
13 // DEFAULT: @hash
14 // FUNC: @hash
15 // FILE: @hash
16 unsigned hash() { function
  /external/chromium_org/chrome/installer/mac/third_party/bsdiff/
sha1_adapter.cc 9 void SHA1(const unsigned char* data, size_t len, unsigned char* hash) {
10 base::SHA1HashBytes(data, len, hash);
  /external/chromium_org/third_party/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/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/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/chromium_org/media/base/
djb2.cc 9 uint32 hash = seed; local
11 hash = hash * 33 + src[i];
13 return hash;
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/
cso_hash.h 30 * Hash table implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
59 struct cso_hash *hash; member in struct:cso_hash_iter
65 void cso_hash_delete(struct cso_hash *hash);
68 int cso_hash_size(struct cso_hash *hash);
72 * Adds a data with the given key to the hash. If entry with the given
73 * key is already in the hash, this current entry is instered before it
75 * Function returns iterator pointing to the inserted item in the hash.
77 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigned key
    [all...]
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.h 30 * Hash table implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
59 struct cso_hash *hash; member in struct:cso_hash_iter
65 void cso_hash_delete(struct cso_hash *hash);
68 int cso_hash_size(struct cso_hash *hash);
72 * Adds a data with the given key to the hash. If entry with the given
73 * key is already in the hash, this current entry is instered before it
75 * Function returns iterator pointing to the inserted item in the hash.
77 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigned key
    [all...]
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/chrome/common/
spellcheck_marker.h 23 SpellCheckMarker() : hash(0xFFFFFFFF), offset(static_cast<size_t>(-1)) {}
25 SpellCheckMarker(uint32 hash, size_t offset) : hash(hash), offset(offset) {}
27 uint32 hash; member in class:SpellCheckMarker
  /external/chromium_org/third_party/WebKit/public/web/
WebTextCheckingResult.h 48 , hash(0)
52 WebTextCheckingResult(WebTextDecorationType decoration, int location, int length, const WebString& replacement = WebString(), uint32_t hash = 0)
57 , hash(hash)
69 uint32_t hash; member in struct:blink::WebTextCheckingResult
  /external/chromium_org/third_party/skia/src/core/
SkChecksum.h 40 * uint32_t -> uint32_t hash, useful for when you're about to trucate this hash but you
45 static uint32_t Mix(uint32_t hash) {
46 hash ^= hash >> 16;
47 hash *= 0x85ebca6b;
48 hash ^= hash >> 13;
49 hash *= 0xc2b2ae35;
50 hash ^= hash >> 16
74 uint32_t hash = seed; local
    [all...]
  /external/libcxx/test/utilities/optional/optional.hash/
hash.pass.cpp 12 // template <class T> struct hash<optional<T>>;
28 assert(std::hash<optional<T>>{}(opt) == 0);
30 assert(std::hash<optional<T>>{}(opt) == std::hash<T>{}(*opt));
35 assert(std::hash<optional<T>>{}(opt) == 0);
37 assert(std::hash<optional<T>>{}(opt) == std::hash<T>{}(*opt));
42 assert(std::hash<optional<T>>{}(opt) == 0);
44 assert(std::hash<optional<T>>{}(opt) == std::hash<T>{}(*opt))
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/text/
StringHash.h 36 // The hash() functions on StringHash and CaseFoldingHash do not support
42 // closer to having all the nearly-identical hash functions in one place.
45 static unsigned hash(StringImpl* key) { return key->hash(); } function in struct:WTF::StringHash
51 static unsigned hash(const RefPtr<StringImpl>& key) { return key->hash(); } function in struct:WTF::StringHash
57 static unsigned hash(const String& key) { return key.impl()->hash(); } function in struct:WTF::StringHash
73 static unsigned hash(const UChar* data, unsigned length) function in class:WTF::CaseFoldingHash
78 static unsigned hash(StringImpl* str function in class:WTF::CaseFoldingHash
85 static unsigned hash(const LChar* data, unsigned length) function in class:WTF::CaseFoldingHash
90 static inline unsigned hash(const char* data, unsigned length) function in class:WTF::CaseFoldingHash
100 static unsigned hash(const RefPtr<StringImpl>& key) function in class:WTF::CaseFoldingHash
110 static unsigned hash(const String& key) function in class:WTF::CaseFoldingHash
114 static unsigned hash(const AtomicString& key) function in class:WTF::CaseFoldingHash
134 static unsigned hash(unsigned key) { return key; } function in struct:WTF::AlreadyHashed
    [all...]
  /external/guava/guava-tests/test/com/google/common/hash/
Murmur3Hash32Test.java 17 package com.google.common.hash;
19 import static com.google.common.hash.Hashing.murmur3_32;
21 import com.google.common.hash.Funnels;
22 import com.google.common.hash.HashTestUtils.HashFn;
32 @Override public byte[] hash(byte[] input, int seed) {
35 return hasher.hash().asBytes();
  /external/chromium_org/third_party/skia/include/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...]

Completed in 756 milliseconds

1 2 3 4 5 6 7 8 91011>>