| /external/chromium_org/third_party/skia/include/gpu/ |
| GrKey.h | 15 typedef intptr_t Hash;
17 explicit GrKey(Hash hash) : fHash(hash) {}
33 const Hash fHash;
|
| /external/oprofile/libutil/ |
| op_string.c | 24 size_t hash = 0; local
26 hash ^= (hash << 16) ^ (hash >> 8) ^ *str;
27 return hash;
|
| /external/skia/include/gpu/ |
| GrKey.h | 15 typedef intptr_t Hash;
17 explicit GrKey(Hash hash) : fHash(hash) {}
33 const Hash fHash;
|
| /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/chromium_org/third_party/WebKit/Source/wtf/ |
| HashFunctions.h | 36 // integer hash function
90 // Compound integer hash method: http://opendatastructures.org/versions/edition-0.1d/ods-java/node33.html#SECTION00832000000000000000
103 static unsigned hash(T key) { return intHash(static_cast<typename IntTypes<sizeof(T)>::UnsignedType>(key)); } function in struct:WTF::IntHash
110 static unsigned hash(T key) function in struct:WTF::FloatHash
121 // pointer identity hash function
124 static unsigned hash(T key) function in struct:WTF::PtrHash
130 return IntHash<uintptr_t>::hash(reinterpret_cast<uintptr_t>(key));
139 using PtrHash<P*>::hash;
140 static unsigned hash(const RefPtr<P>& key) { return hash(key.get()); function in struct:WTF::PtrHash
152 static unsigned hash(const std::pair<T, U>& p) function in struct:WTF::PairHash
165 static unsigned hash(const std::pair<T, U>& p) { return pairIntHash(p.first, p.second); } function in struct:WTF::IntPairHash
[all...] |
| StringHasherTest.cpp | 60 ASSERT_EQ(emptyStringHash, hasher.hash());
71 ASSERT_EQ(singleNullCharacterHash, hasher.hash());
77 ASSERT_EQ(testAHash1, hasher.hash());
80 ASSERT_EQ(testAHash2, hasher.hash());
83 ASSERT_EQ(testAHash3, hasher.hash());
86 ASSERT_EQ(testAHash4, hasher.hash());
89 ASSERT_EQ(testAHash5, hasher.hash());
95 ASSERT_EQ(testBHash1, hasher.hash());
98 ASSERT_EQ(testBHash2, hasher.hash());
101 ASSERT_EQ(testBHash3, hasher.hash());
[all...] |
| /frameworks/base/core/java/android/content/res/ |
| ResourcesKey.java | 41 int hash = 17; local
42 hash = 31 * hash + (mResDir == null ? 0 : mResDir.hashCode());
43 hash = 31 * hash + mDisplayId;
44 hash = 31 * hash + (mOverrideConfiguration != null
46 hash = 31 * hash + Float.floatToIntBits(mScale);
47 mHash = hash;
[all...] |
| /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...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.h | 12 ** This is the header file for the generic hash-table implemenation
14 ** hash table implementation for the full-text indexing module.
21 typedef struct Hash Hash;
24 /* A complete hash table is an instance of the following structure.
32 struct Hash {
39 int htsize; /* Number of buckets in the hash table */
40 struct _ht { /* the hash table */
41 int count; /* Number of entries with this hash */
42 HashElem *chain; /* Pointer to first entry with this hash */
[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...] |
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_init.c | 20 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
25 @param hash The index of the hash you want to use
30 int hmac_init(hmac_state *hmac, int hash, const unsigned char *key, unsigned long keylen)
40 /* valid hash? */
41 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
44 hmac->hash = hash;
45 hashsize = hash_descriptor[hash].hashsize;
68 if ((err = hash_memory(hash, key, keylen, hmac->key, &z)) != CRYPT_OK)
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| HashFunction.java | 15 package com.google.common.hash;
23 * A hash function is a collision-averse pure function that maps an arbitrary block of
24 * data to a number called a <i>hash code</i>.
31 * <li><b>block of data:</b> the input for a hash function is always, in concept, an
36 * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit
39 * {@code long} value is clearly insufficient to hold all hash code values, this API
40 * represents a hash code as an instance of {@link HashCode}.
45 * <li><b>collision-averse:</b> while it can't be helped that a hash function wil
[all...] |
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_hash.h | 1 /* ---- HASH FUNCTIONS ---- */
149 /** hash descriptor */
151 /** name of hash */
164 /** Init a hash state
165 @param hash The hash to initialize
168 int (*init)(hash_state *hash);
170 @param hash The hash state
171 @param in The data to hash
[all...] |
| /external/chromium_org/media/base/ |
| djb2.h | 11 // DJB2 is a hash algorithm with excellent distribution and speed
20 // http://www.cse.yorku.ca/~oz/hash.html
24 // These functions perform DJB2 hash. The simplest call is DJB2Hash() to
25 // generate the DJB2 hash of the given data:
26 // uint32 hash = DJB2Hash(data1, length1, kDJB2HashSeed);
28 // You can also compute the DJB2 hash of data incrementally by making multiple
36 // For the given buffer of data, compute the DJB2 hash of
|
| /external/dropbear/libtomcrypt/src/hashes/helper/ |
| hash_file.c | 15 Hash a file, Tom St Denis
19 @param hash The index of the hash desired
20 @param fname The name of the file you wish to hash
25 int hash_file(int hash, const char *fname, unsigned char *out, unsigned long *outlen)
36 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
45 err = hash_filehandle(hash, in, out, outlen);
|
| /external/dropbear/libtomcrypt/src/misc/crypt/ |
| crypt_unregister_hash.c | 15 Unregister a hash, Tom St Denis
19 Unregister a hash from the descriptor table
20 @param hash The hash descriptor to remove
23 int unregister_hash(const struct ltc_hash_descriptor *hash)
27 LTC_ARGCHK(hash != NULL);
32 if (XMEMCMP(&hash_descriptor[x], hash, sizeof(struct ltc_hash_descriptor)) == 0) {
|
| /external/chromium_org/chrome/browser/chromeos/policy/ |
| cloud_external_data_store.cc | 19 // Encodes (policy, hash) into a single string.
20 std::string GetSubkey(const std::string& policy, const std::string& hash) {
22 DCHECK(!hash.empty());
24 base::IntToString(hash.size()) + ":" +
25 policy + hash;
49 subkeys_to_keep.insert(GetSubkey(it->first, it->second.hash));
55 const std::string& hash,
58 return cache_->Store(cache_key_, GetSubkey(policy, hash), data);
62 const std::string& hash,
66 const std::string subkey = GetSubkey(policy, hash);
[all...] |
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| hash-ref.html | 3 <title>Manual Test for Bug 13067: Manually adding #hash to URL reloads entire page instead of jumping to #hash location in cached page</title>
9 <h3>Manual Test for <a href="https://bugs.webkit.org/show_bug.cgi?id=13067">Bug 13067: Manually adding #hash to URL reloads entire page instead of jumping to #hash location in cached page</a></h3>
13 <li>Click link to <a href="resources/hash-ref-test.html" target="_blank">open test page in new window</a>.</li>
14 <li>Set hash ref to "#div5" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the div5 box <em>without</em> reloading the page.</li>
15 <li>Set hash ref to "#" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the page <em>without</em> reloading.</li>
16 <li>Set hash ref to "#div3" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the div3 box <em>without</em> reloading.</li>
17 <li>Hit <kbd>Enter</kbd> in the address bar without chainging the "#div3" hash.<br> This <em>should</em> reload the page.</li>
18 <li>Set hash ref to "#" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the page < (…)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| prog_cache.c | 39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| ext_attr.c | 32 * Compute the hash of an extended attribute.
36 __u32 hash = 0; local
41 hash = (hash << NAME_HASH_SHIFT) ^
42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
46 /* The hash needs to be calculated on the data in little-endian. */
51 hash = (hash << VALUE_HASH_SHIFT) ^
52 (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT))
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...] |
| /system/core/libcutils/ |
| hashmap.c | 29 int hash; member in struct:Entry
37 int (*hash)(void* key); member in struct:Hashmap
44 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB)) {
45 assert(hash != NULL);
69 map->hash = hash;
81 int h = map->hash(key);
97 static inline size_t calculateIndex(size_t bucketCount, int hash) {
98 return ((size_t) hash) & (bucketCount - 1);
118 size_t index = calculateIndex(newBucketCount, entry->hash);
190 int hash = hashKey(map, key); local
222 int hash = hashKey(map, key); local
237 int hash = hashKey(map, key); local
253 int hash = hashKey(map, key); local
285 int hash = hashKey(map, key); local
[all...] |
| /dalvik/vm/test/ |
| 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 = 0
[all...] |
| /external/guava/guava-tests/test/com/google/common/hash/ |
| HashCodesTest.java | 3 package com.google.common.hash;
46 // expectedHashCodes must contain at least one hash code with 4 bytes
56 // expectedHashCodes must contain at least one hash code with 8 bytes
73 private void assertExpectedHashCode(ExpectedHashCode expected, HashCode hash) {
74 assertTrue(Arrays.equals(expected.bytes, hash.asBytes()));
75 byte[] bb = new byte[hash.bits() / 8];
76 hash.writeBytesTo(bb, 0, bb.length);
78 assertEquals(expected.asInt, hash.asInt());
81 hash.asLong();
85 assertEquals(expected.asLong.longValue(), hash.asLong())
[all...] |
| /external/stlport/stlport/stl/ |
| _hash_fun.h | 40 template <class _Key> struct hash { }; struct
56 struct hash<char*> { struct
64 struct hash<const char*> { struct
71 _STLP_TEMPLATE_NULL struct hash<char> { struct
74 _STLP_TEMPLATE_NULL struct hash<unsigned char> { struct
78 _STLP_TEMPLATE_NULL struct hash<signed char> { struct
82 _STLP_TEMPLATE_NULL struct hash<short> { struct
85 _STLP_TEMPLATE_NULL struct hash<unsigned short> { struct
88 _STLP_TEMPLATE_NULL struct hash<int> { struct
93 _STLP_TEMPLATE_NULL struct hash<unsigned int> struct
103 _STLP_TEMPLATE_NULL struct hash<size_t> { struct
108 _STLP_TEMPLATE_NULL struct hash<long> { struct
111 _STLP_TEMPLATE_NULL struct hash<unsigned long> { struct
116 _STLP_TEMPLATE_NULL struct hash<_STLP_LONG_LONG> { struct
119 _STLP_TEMPLATE_NULL struct hash<unsigned _STLP_LONG_LONG> { struct
125 struct hash<void *> struct
[all...] |
