| /external/chromium_org/third_party/WebKit/Source/modules/crypto/ |
| HmacParams.idl | 34 readonly attribute Algorithm hash;
|
| RsaSsaParams.idl | 34 readonly attribute Algorithm hash;
|
| /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/linux-tools-perf/util/include/linux/added/ |
| hash.h | 40 u64 hash = val; local
43 u64 n = hash;
45 hash -= n;
47 hash -= n;
49 hash += n;
51 hash -= n;
53 hash += n;
55 hash += n;
58 return hash >> (64 - bits);
64 u32 hash = val * GOLDEN_RATIO_PRIME_32 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/smhasher/src/ |
| 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/guava/guava/src/com/google/common/hash/ |
| package-info.java | 17 * Hash functions and related structures.
20 package com.google.common.hash;
|
| /external/protobuf/src/google/protobuf/stubs/ |
| hash.cc | 33 #include <google/protobuf/stubs/hash.h>
|
| /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(-1), offset(-1) {}
25 SpellCheckMarker(uint32 hash, size_t offset) : hash(hash), offset(offset) {}
27 uint32 hash; member in class:SpellCheckMarker
|
| /external/smack/src/org/jivesoftware/smackx/entitycaps/packet/ |
| CapsExtension.java | 25 private String node, ver, hash; field in class:CapsExtension
30 public CapsExtension(String node, String version, String hash) {
33 this.hash = hash;
61 return hash;
64 public void setHash(String hash) {
65 this.hash = hash;
70 * hash='sha-1'
77 "hash=\"" + hash + "\" "
[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/core/ |
| SkChecksum.h | 41 * Calculate 32-bit Murmur hash (murmur3).
42 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
47 * @param seed Initial hash seed. (optional)
48 * @return hash result
54 uint32_t hash = seed; local
61 hash ^= k;
62 hash = (hash << 13) | (hash >> 19);
63 hash *= 5
[all...] |
| /external/skia/include/core/ |
| SkChecksum.h | 41 * Calculate 32-bit Murmur hash (murmur3).
42 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
47 * @param seed Initial hash seed. (optional)
48 * @return hash result
54 uint32_t hash = seed; local
61 hash ^= k;
62 hash = (hash << 13) | (hash >> 19);
63 hash *= 5
[all...] |
| /external/chromium_org/crypto/third_party/nss/ |
| rsawrapr.c | 26 const SECHashObject *hash; local
30 hash = HASH_GetHashObject(hashAlg);
31 if (hash == NULL)
34 hashContext = (*hash->create)();
35 rounds = (maskLen + hash->length - 1) / hash->length;
44 (*hash->begin)(hashContext);
45 (*hash->update)(hashContext, mgfSeed, mgfSeedLen);
46 (*hash->update)(hashContext, C, sizeof C);
48 tempHash = mask + counter * hash->length
78 const SECHashObject *hash; local
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/helper/ |
| hash_filehandle.c | 15 Hash open files, Tom St Denis
19 Hash data from an open file handle.
20 @param hash The index of the hash you want to use
21 @param in The FILE* handle of the file you want to hash
26 int hash_filehandle(int hash, FILE *in, unsigned char *out, unsigned long *outlen)
40 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
44 if (*outlen < hash_descriptor[hash].hashsize) {
45 *outlen = hash_descriptor[hash].hashsize;
48 if ((err = hash_descriptor[hash].init(&md)) != CRYPT_OK)
[all...] |
| hash_memory.c | 15 Hash memory helper, Tom St Denis
19 Hash a block of memory and store the digest.
20 @param hash The index of the hash you wish to use
21 @param in The data you wish to hash
22 @param inlen The length of the data to hash (octets)
27 int hash_memory(int hash, const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen)
36 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
40 if (*outlen < hash_descriptor[hash].hashsize) {
41 *outlen = hash_descriptor[hash].hashsize
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| BloomFilter.h | 48 void add(unsigned hash);
49 void remove(unsigned hash);
53 bool mayContain(unsigned hash) const { return firstSlot(hash) && secondSlot(hash); }
60 void add(const String& string) { add(string.impl()->hash()); }
62 void remove(const String& string) { remove(string.impl()->hash()); }
65 bool mayContain(const String& string) const { return mayContain(string.impl()->hash()); }
74 uint8_t& firstSlot(unsigned hash) { return m_table[hash & keyMask];
[all...] |
| /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/doclava/res/assets/templates/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...] |
