/external/clang/test/PCH/Inputs/ |
H A D | pr27445.h | 3 void hash() {} function in struct:Info
|
/external/clang/test/CodeGen/ |
H A D | 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/guava/guava/src/com/google/common/hash/ |
H A D | package-info.java | 24 package com.google.common.hash;
|
H A D | Crc32cHashFunction.java | 15 package com.google.common.hash; 120 public HashCode hash() { method in class:Crc32cHashFunction.Crc32cHasher
|
H A D | HashingOutputStream.java | 15 package com.google.common.hash; 26 * An {@link OutputStream} that maintains a hash of the data written to it. 64 public HashCode hash() { method in class:HashingOutputStream 65 return hasher.hash();
|
H A D | AbstractCompositeHashFunction.java | 17 package com.google.common.hash; 24 * An abstract composition of multiple hash functions. {@linkplain #newHasher()} delegates to the 25 * {@code Hasher} objects of the delegate hash functions, and in the end, they are used by 146 @Override public HashCode hash() {
|
H A D | Funnel.java | 15 package com.google.common.hash;
|
/external/kmod/shared/ |
H A D | hash.h | 5 struct hash; 8 const struct hash *hash; member in struct:hash_iter 13 struct hash *hash_new(unsigned int n_buckets, void (*free_value)(void *value)); 14 void hash_free(struct hash *hash); 15 int hash_add(struct hash *hash, const char *key, const void *value); 16 int hash_add_unique(struct hash *hash, cons [all...] |
/external/libdrm/amdgpu/ |
H A D | util_hash.h | 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 util_hash *hash; member in struct:util_hash_iter 65 drm_private void util_hash_delete(struct util_hash *hash); 69 * Adds a data with the given key to the hash. If entry with the given 70 * key is already in the hash, this current entry is instered before it 72 * Function returns iterator pointing to the inserted item in the hash. 75 util_hash_insert(struct util_hash *hash, unsigned key, void *data); 78 * Removes the item pointed to by the current iterator from the hash. 82 * the hash [all...] |
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.h | 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, 80 * Removes the item pointed to by the current iterator from the hash [all...] |
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | PackageSanityTests.java | 17 package com.google.common.hash; 19 import com.google.common.hash.BloomFilterStrategies.BitArray;
|
/external/libmojo/mojo/public/cpp/bindings/ |
H A D | native_enum.h | 23 struct hash<mojo::NativeEnum> struct in namespace:std
|
/external/adhd/cras/src/common/ |
H A D | sfh.c | 43 uint32_t SuperFastHash (const char * data, int len, uint32_t hash) { argument 54 hash += get16bits (data); 55 tmp = (get16bits (data+2) << 11) ^ hash; 56 hash = (hash << 16) ^ tmp; 58 hash += hash >> 11; 63 case 3: hash += get16bits (data); 64 hash ^= hash << 1 [all...] |
/external/annotation-tools/scene-lib/src/annotations/util/ |
H A D | Hasher.java | 8 * A simple class to mash a lot of data into a hash code for use in 15 * The calculated hash code for the data that has been contributed so far. 17 public int hash = 0; field in class:Hasher 22 * Contributes the data <code>x</code> to the calculation of the hash code. 25 hash = ((hash << SHIFT) | (hash >> (32 - SHIFT))) ^ x;
|
/external/elfutils/libelf/ |
H A D | dl-hash.h | 1 /* Compute hash value for given string according to ELF standard. 31 unsigned long int hash = *name; local 32 if (hash != 0 && name[1] != '\0') 34 hash = (hash << 4) + name[1]; 37 hash = (hash << 4) + name[2]; 40 hash = (hash << 4) + name[3]; 43 hash [all...] |
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/resources/ |
H A D | sort.js | 16 * Sets the initial sorting derived from the hash. 20 * hash links 24 var hash = window.location.hash; variable 25 if (hash) { 26 var m = hash.match(/up-./); 34 var m = hash.match(/dn-./); 70 var hash; 77 hash = 'up-' + header.id; 83 hash [all...] |
/external/libchrome/base/containers/ |
H A D | hash_tables.h | 13 #include "base/hash.h" 23 // A separate hasher which, by default, forwards to std::hash. This is so legacy 25 // std::hash mid-transition. 27 struct hash { struct in namespace:BASE_HASH_NAMESPACE 28 std::size_t operator()(const T& value) const { return std::hash<T>()(value); } 31 // Use base::IntPairHash from base/hash.h as a custom hasher instead. 33 struct hash<std::pair<Type1, Type2>> { struct in namespace:BASE_HASH_NAMESPACE 46 class Hash = BASE_HASH_NAMESPACE::hash<Key>, 54 class Hash = BASE_HASH_NAMESPACE::hash<Key>, 61 class Hash = BASE_HASH_NAMESPACE::hash<Ke [all...] |
/external/libchrome/base/metrics/ |
H A D | metrics_hashes_unittest.cc | 29 uint64_t hash = HashMetricName(cases[i].input); local 30 std::string hash_hex = base::StringPrintf("0x%016" PRIx64, hash);
|
/external/tpm2/ |
H A D | PCR_Event.c | 54 TPM_ALG_ID hash = CryptGetHashAlgByIndex(i); local 55 out->digests.digests[i].hashAlg = hash; 56 size = CryptStartHash(hash, &hashState); 61 PCRExtend(in->pcrHandle, hash, size,
|
H A D | _TPM_Hash_End.c | 51 // Complete hash and extend PCR, or if this is an HCRTM, complete 52 // the hash, reset the H-CRTM register (PCR[0]) to 0...04, and then 56 TPMI_ALG_HASH hash = CryptGetHashAlgByIndex(i); local 61 // Complete hash 62 digest.t.size = CryptGetHashDigestSize(hash); 65 PcrDrtm(pcrHandle, hash, &digest);
|
/external/v8/src/runtime/ |
H A D | runtime-collections.cc | 43 Smi* hash = Object::GetOrCreateHash(isolate, object); local 44 return hash; 263 CONVERT_SMI_ARG_CHECKED(hash, 2) 268 Handle<Object> lookup(table->Lookup(key, hash), isolate); 279 CONVERT_SMI_ARG_CHECKED(hash, 2) 284 Handle<Object> lookup(table->Lookup(key, hash), isolate); 294 CONVERT_SMI_ARG_CHECKED(hash, 2) 299 bool was_present = JSWeakCollection::Delete(weak_collection, key, hash); 311 CONVERT_SMI_ARG_CHECKED(hash, 3) 315 JSWeakCollection::Set(weak_collection, key, value, hash); [all...] |
/external/deqp/framework/delibs/debase/ |
H A D | deSha1.h | 23 * \brief SHA1 hash functions. 33 deUint32 hash[5]; member in struct:deSha1Stream_s 40 deUint32 hash[5]; member in struct:deSha1_s 49 /* Finalize the stream and output the hash. */ 50 void deSha1Stream_finalize (deSha1Stream* stream, deSha1* hash); 52 /* Compute the sha1 hash from data. */ 53 void deSha1_compute (deSha1* hash, size_t size, const void* data); 55 /* Render sha1 hash as 40 digit hex string. */ 56 void deSha1_render (const deSha1* hash, char* buffer); 59 deBool deSha1_parse (deSha1* hash, cons [all...] |
/external/deqp/framework/delibs/decpp/ |
H A D | deSha1.cpp | 21 * \brief SHA1 hash functions 31 deSha1 hash; local 34 DE_CHECK_RUNTIME_ERR_MSG(deSha1_parse(&hash, str.c_str()), "Failed to parse SHA1. Invalid characters.."); 36 return Sha1(hash); 41 deSha1 hash; local 43 deSha1_compute(&hash, size, data); 44 return Sha1(hash); 59 deSha1 hash; local 60 deSha1Stream_finalize(&m_stream, &hash); 62 return Sha1(hash); [all...] |
/external/e2fsprogs/lib/e2p/ |
H A D | hashstr.c | 21 struct hash { struct 26 static struct hash hash_list[] = { 35 struct hash *p; 47 * Returns the hash algorithm, or -1 on error 51 struct hash *p;
|
/external/libchrome/base/trace_event/ |
H A D | memory_allocator_dump_guid.cc | 16 uint64_t hash[(kSHA1Length + sizeof(uint64_t) - 1) / sizeof(uint64_t)] = {0}; local 18 reinterpret_cast<unsigned char*>(hash)); 19 return hash[0];
|