/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 97 static void *cso_data_allocate_node(struct cso_hash_data *hash) argument 99 return MALLOC(hash->nodeSize); 108 cso_hash_create_node(struct cso_hash *hash, argument 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) argument 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); 175 cso_data_might_grow(struct cso_hash_data *hash) argument 181 cso_data_has_shrunk(struct cso_hash_data *hash) argument 190 cso_data_first_node(struct cso_hash_data *hash) argument 203 cso_hash_find_node(struct cso_hash *hash, unsigned akey) argument 218 cso_hash_insert(struct cso_hash *hash, unsigned key, void *data) argument 240 struct cso_hash *hash = MALLOC_STRUCT(cso_hash); local 261 cso_hash_delete(struct cso_hash *hash) argument 279 cso_hash_find(struct cso_hash *hash, unsigned key) argument 382 cso_hash_take(struct cso_hash *hash, unsigned akey) argument 405 cso_hash_first_node(struct cso_hash *hash) argument 411 cso_hash_size(struct cso_hash *hash) argument 416 cso_hash_erase(struct cso_hash *hash, struct cso_hash_iter iter) argument 435 cso_hash_contains(struct cso_hash *hash, unsigned key) argument [all...] |
/external/skia/include/core/ |
H A D | 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 * [all...] |
/external/chromium_org/third_party/skia/include/gpu/ |
H A D | 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); 48 hash [all...] |
/external/skia/src/gpu/ |
H A D | 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); 48 hash [all...] |
/external/chromium_org/crypto/third_party/nss/ |
H A D | 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 78 const SECHashObject *hash; local [all...] |
/external/chromium_org/ui/android/java/src/org/chromium/ui/picker/ |
H A D | DateTimeSuggestion.java | 53 int hash = 31; 54 hash = 37 * hash + (int) mValue; 55 hash = 37 * hash + mLocalizedValue.hashCode(); 56 hash = 37 * hash + mLabel.hashCode(); 57 return hash;
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | 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 argument 75 secondSlot(unsigned hash) argument 83 add(unsigned hash) argument 94 remove(unsigned hash) argument [all...] |
/external/doclava/res/assets/templates/assets/ |
H A D | 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/stlport/stlport/stl/ |
H A D | _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<unsigne 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...] |
/external/chromium_org/chrome/browser/metrics/variations/ |
H A D | generated_resources_map_lookup.cc | 11 int GetResourceIndex(uint32_t hash) { argument 13 const uint32_t* element = std::lower_bound(kResourceHashes, kEnd, hash); 15 if (element == kEnd || *element != hash)
|
/external/srec/srec/crec/ |
H A D | astar_pphash.c | 32 /* initialize the hash with no elements defined */ 34 void hash_init(FixedSizeHash* hash, srec* rec_debug) argument 37 hash->hashsize = FSH_HASHSIZE; 38 for (i = 0; i < hash->hashsize; i++) 39 hash->items[i] = FSH_NULL; 40 hash->rec = rec_debug; 94 int hash_get(FixedSizeHash* hash, partial_path* parp, void** hval) argument 99 hkey_index = hkey_index % hash->hashsize; 100 p_return = hash->items[hkey_index]; 105 if (compare_parp(p_return, parp, hash 116 hash_set(FixedSizeHash* hash, partial_path* parp) argument 151 hash_del(FixedSizeHash* hash, partial_path* parp) argument [all...] |
/external/chromium_org/chrome/common/ |
H A D | spellcheck_marker.h | 23 SpellCheckMarker() : hash(0xFFFFFFFF), offset(static_cast<size_t>(-1)) {} 25 SpellCheckMarker(uint32 hash, size_t offset) : hash(hash), offset(offset) {} argument 27 uint32 hash; member in class:SpellCheckMarker
|
/external/chromium_org/components/policy/core/common/cloud/ |
H A D | cloud_external_data_manager.cc | 16 const std::string& hash) 18 hash(hash) { 23 return url != other.url || hash != other.hash; 15 MetadataEntry(const std::string& url, const std::string& hash) argument
|
/external/chromium_org/third_party/WebKit/public/web/ |
H A D | 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/deqp/framework/delibs/depool/ |
H A D | dePoolHash.h | 23 * \brief Memory pool hash class. 45 * \brief Declare a template pool hash class interface. 46 * \param TYPENAME Type name of the declared hash. 50 * This macro declares the interface for a hash. For the implementation of 51 * the hash, see DE_IMPLEMENT_POOL_HASH. Usually this macro is put into the 56 * The functions for operating the hash are: 61 * int Hash_getNumElements (const Hash* hash); 62 * Value* Hash_find (Hash* hash, Key key); 63 * deBool Hash_insert (Hash* hash, Key key, Value value); 64 * void Hash_delete (Hash* hash, Ke [all...] |
/external/oprofile/libutil/ |
H A D | op_string.c | 24 size_t hash = 0; local 26 hash ^= (hash << 16) ^ (hash >> 8) ^ *str; 27 return hash;
|
/external/linux-tools-perf/perf-3.12.0/include/linux/ |
H A D | hash.h | 37 u64 hash = val; local 40 u64 n = hash; 42 hash -= n; 44 hash -= n; 46 hash += n; 48 hash -= n; 50 hash += n; 52 hash += n; 55 return hash >> (64 - bits); 61 u32 hash local [all...] |
/external/wpa_supplicant_8/hostapd/src/eap_common/ |
H A D | eap_psk_common.c | 37 u8 hash[aes_block_size]; local 41 if (aes_128_encrypt_block(kdk, rand_p, hash)) 44 hash[aes_block_size - 1] ^= counter; 45 if (aes_128_encrypt_block(kdk, hash, tek)) 47 hash[aes_block_size - 1] ^= counter; 51 hash[aes_block_size - 1] ^= counter; 52 if (aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size])) 54 hash[aes_block_size - 1] ^= counter; 59 hash[aes_block_size - 1] ^= counter; 60 if (aes_128_encrypt_block(kdk, hash, [all...] |
/external/wpa_supplicant_8/src/eap_common/ |
H A D | eap_psk_common.c | 37 u8 hash[aes_block_size]; local 41 if (aes_128_encrypt_block(kdk, rand_p, hash)) 44 hash[aes_block_size - 1] ^= counter; 45 if (aes_128_encrypt_block(kdk, hash, tek)) 47 hash[aes_block_size - 1] ^= counter; 51 hash[aes_block_size - 1] ^= counter; 52 if (aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size])) 54 hash[aes_block_size - 1] ^= counter; 59 hash[aes_block_size - 1] ^= counter; 60 if (aes_128_encrypt_block(kdk, hash, [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/ |
H A D | eap_psk_common.c | 37 u8 hash[aes_block_size]; local 41 if (aes_128_encrypt_block(kdk, rand_p, hash)) 44 hash[aes_block_size - 1] ^= counter; 45 if (aes_128_encrypt_block(kdk, hash, tek)) 47 hash[aes_block_size - 1] ^= counter; 51 hash[aes_block_size - 1] ^= counter; 52 if (aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size])) 54 hash[aes_block_size - 1] ^= counter; 59 hash[aes_block_size - 1] ^= counter; 60 if (aes_128_encrypt_block(kdk, hash, [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | ExtendedType.java | 32 private int hash; field in class:ExtendedType 36 * The hash code is calculated from the node type, namespace and local name. 47 this.hash = nodetype + namespace.hashCode() + localName.hashCode(); 52 * and a given hash code. 57 * @param hash The given hash code 59 public ExtendedType (int nodetype, String namespace, String localName, int hash) argument 64 this.hash = hash; 77 this.hash 85 redefine(int nodetype, String namespace, String localName, int hash) argument [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are 22 * resolution (no linked list, etc.). When there is a hash collision 24 * using a secondary hash. The secondary hash is an increment 25 * computed as a hash function (a different one) of the primary 26 * hashcode. This increment is added to the initial hash value to 27 * obtain further slots assigned to the same hash code. For this to 120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \ 121 if (hash->keyDeleter != NULL && keypointer != NULL) { \ 122 (*hash 141 _uhash_setElement(UHashtable *hash, UHashElement* e, int32_t hashcode, UHashTok key, UHashTok value, int8_t hint) argument 181 _uhash_internalRemoveElement(UHashtable *hash, UHashElement* e) argument 190 _uhash_internalSetResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) argument 208 _uhash_allocate(UHashtable *hash, int32_t primeIndex, UErrorCode *status) argument 331 _uhash_find(const UHashtable *hash, UHashTok key, int32_t hashcode) argument 393 _uhash_rehash(UHashtable *hash, UErrorCode *status) argument 436 _uhash_remove(UHashtable *hash, UHashTok key) argument 461 _uhash_put(UHashtable *hash, UHashTok key, UHashTok value, int8_t hint, UErrorCode *status) argument 572 uhash_close(UHashtable *hash) argument 593 uhash_setKeyHasher(UHashtable *hash, UHashFunction *fn) argument 600 uhash_setKeyComparator(UHashtable *hash, UKeyComparator *fn) argument 606 uhash_setValueComparator(UHashtable *hash, UValueComparator *fn) argument 613 uhash_setKeyDeleter(UHashtable *hash, UObjectDeleter *fn) argument 620 uhash_setValueDeleter(UHashtable *hash, UObjectDeleter *fn) argument 627 uhash_setResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) argument 636 uhash_count(const UHashtable *hash) argument 641 uhash_get(const UHashtable *hash, const void* key) argument 649 uhash_iget(const UHashtable *hash, int32_t key) argument 657 uhash_geti(const UHashtable *hash, const void* key) argument 665 uhash_igeti(const UHashtable *hash, int32_t key) argument 673 uhash_put(UHashtable *hash, void* key, void* value, UErrorCode *status) argument 686 uhash_iput(UHashtable *hash, int32_t key, void* value, UErrorCode *status) argument 699 uhash_puti(UHashtable *hash, void* key, int32_t value, UErrorCode *status) argument 713 uhash_iputi(UHashtable *hash, int32_t key, int32_t value, UErrorCode *status) argument 726 uhash_remove(UHashtable *hash, const void* key) argument 734 uhash_iremove(UHashtable *hash, int32_t key) argument 742 uhash_removei(UHashtable *hash, const void* key) argument 750 uhash_iremovei(UHashtable *hash, int32_t key) argument 758 uhash_removeAll(UHashtable *hash) argument 771 uhash_find(const UHashtable *hash, const void* key) argument 780 uhash_nextElement(const UHashtable *hash, int32_t *pos) argument 798 uhash_removeElement(UHashtable *hash, const UHashElement* e) argument [all...] |
H A D | hash.h | 29 UHashtable* hash; member in class:Hashtable 111 hash = &hashObj; 112 uhash_setKeyDeleter(hash, uprv_deleteUObject); 117 UErrorCode& status) : hash(0) { 121 : hash(0) 132 : hash(0) 138 : hash(0) 145 if (hash != NULL) { 146 uhash_close(hash); 151 return uhash_setValueDeleter(hash, f [all...] |
/external/icu/icu4c/source/common/ |
H A D | uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are 22 * resolution (no linked list, etc.). When there is a hash collision 24 * using a secondary hash. The secondary hash is an increment 25 * computed as a hash function (a different one) of the primary 26 * hashcode. This increment is added to the initial hash value to 27 * obtain further slots assigned to the same hash code. For this to 120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \ 121 if (hash->keyDeleter != NULL && keypointer != NULL) { \ 122 (*hash 141 _uhash_setElement(UHashtable *hash, UHashElement* e, int32_t hashcode, UHashTok key, UHashTok value, int8_t hint) argument 181 _uhash_internalRemoveElement(UHashtable *hash, UHashElement* e) argument 190 _uhash_internalSetResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) argument 208 _uhash_allocate(UHashtable *hash, int32_t primeIndex, UErrorCode *status) argument 331 _uhash_find(const UHashtable *hash, UHashTok key, int32_t hashcode) argument 393 _uhash_rehash(UHashtable *hash, UErrorCode *status) argument 436 _uhash_remove(UHashtable *hash, UHashTok key) argument 461 _uhash_put(UHashtable *hash, UHashTok key, UHashTok value, int8_t hint, UErrorCode *status) argument 572 uhash_close(UHashtable *hash) argument 593 uhash_setKeyHasher(UHashtable *hash, UHashFunction *fn) argument 600 uhash_setKeyComparator(UHashtable *hash, UKeyComparator *fn) argument 606 uhash_setValueComparator(UHashtable *hash, UValueComparator *fn) argument 613 uhash_setKeyDeleter(UHashtable *hash, UObjectDeleter *fn) argument 620 uhash_setValueDeleter(UHashtable *hash, UObjectDeleter *fn) argument 627 uhash_setResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) argument 636 uhash_count(const UHashtable *hash) argument 641 uhash_get(const UHashtable *hash, const void* key) argument 649 uhash_iget(const UHashtable *hash, int32_t key) argument 657 uhash_geti(const UHashtable *hash, const void* key) argument 665 uhash_igeti(const UHashtable *hash, int32_t key) argument 673 uhash_put(UHashtable *hash, void* key, void* value, UErrorCode *status) argument 686 uhash_iput(UHashtable *hash, int32_t key, void* value, UErrorCode *status) argument 699 uhash_puti(UHashtable *hash, void* key, int32_t value, UErrorCode *status) argument 713 uhash_iputi(UHashtable *hash, int32_t key, int32_t value, UErrorCode *status) argument 726 uhash_remove(UHashtable *hash, const void* key) argument 734 uhash_iremove(UHashtable *hash, int32_t key) argument 742 uhash_removei(UHashtable *hash, const void* key) argument 750 uhash_iremovei(UHashtable *hash, int32_t key) argument 758 uhash_removeAll(UHashtable *hash) argument 771 uhash_find(const UHashtable *hash, const void* key) argument 780 uhash_nextElement(const UHashtable *hash, int32_t *pos) argument 798 uhash_removeElement(UHashtable *hash, const UHashElement* e) argument [all...] |
/external/fio/ |
H A D | filelock.c | 3 * No hash indexing, just a list, so only works well for < 100 files or 14 #include "hash.h" 18 uint32_t hash; member in struct:fio_filelock 55 static struct fio_filelock *fio_hash_find(uint32_t hash) argument 62 if (ff->hash == hash) 69 static struct fio_filelock *fio_hash_get(uint32_t hash) argument 73 ff = fio_hash_find(hash); 76 ff->hash = hash; 88 uint32_t hash; local 124 uint32_t hash; local 139 uint32_t hash; local [all...] |