Searched defs:hash (Results 176 - 200 of 896) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Source/platform/fonts/
H A DFontDataCache.h44 static unsigned hash(const FontPlatformData& platformData) function in struct:blink::FontDataCacheKeyHash
46 return platformData.hash();
H A DFontFaceCreationParams.h98 unsigned hash() const function in class:blink::FontFaceCreationParams
103 // and endianness. However, since the hash is not transferred over a network
109 return hasher.hash();
111 return CaseFoldingHash::hash(m_family.isEmpty() ? "" : m_family);
/external/chromium_org/third_party/WebKit/Source/platform/network/
H A DHTTPHeaderMap.cpp68 static unsigned hash(const char* cString) function in struct:blink::CaseFoldingCStringTranslator
70 return CaseFoldingHash::hash(cString, strlen(cString));
78 static void translate(AtomicString& location, const char* cString, unsigned /*hash*/)
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DStringHasher.h30 // http://www.azillionmonkeys.com/qed/hash.html
34 // NOTE: The hash computation here must stay in sync with the create_hash_table script in
37 // Golden ratio. Arbitrary start value to avoid mapping all zeros to a hash value of zero.
131 // Reserving space from the high bits for flags preserves most of the hash's
132 // value, since hash lookup typically masks out the high bits anyway.
135 // This avoids ever returning a hash code of 0, since that is used to
136 // signal "hash not computed yet". Setting the high bit maintains
137 // reasonable fidelity to a hash code of 0 because it is likely to yield
138 // exactly 0 when hash lookup masks out the high bits.
145 unsigned hash() cons function in class:WTF::StringHasher
[all...]
/external/chromium_org/third_party/WebKit/public/platform/
H A DWebCryptoKeyAlgorithmParams.h98 WebCryptoHmacKeyAlgorithmParams(const WebCryptoAlgorithm& hash, unsigned lengthBits) argument
99 : m_hash(hash)
104 const WebCryptoAlgorithm& hash() const function in class:blink::WebCryptoHmacKeyAlgorithmParams
121 dict->setAlgorithm("hash", m_hash);
132 WebCryptoRsaHashedKeyAlgorithmParams(unsigned modulusLengthBits, const unsigned char* publicExponent, unsigned publicExponentSize, const WebCryptoAlgorithm& hash) argument
135 , m_hash(hash)
149 const WebCryptoAlgorithm& hash() const function in class:blink::WebCryptoRsaHashedKeyAlgorithmParams
161 dict->setAlgorithm("hash", m_hash);
/external/chromium_org/third_party/android_crazy_linker/src/src/
H A Dcrazy_linker_elf_symbols.cpp14 // Compute the ELF hash of a given symbol.
123 unsigned hash = ElfHash(symbol_name); local
125 for (unsigned n = hash_bucket_[hash % hash_bucket_size_]; n != 0;
/external/chromium_org/third_party/icu/source/i18n/unicode/
H A Dsmpdtfmt.h1530 int32_t hash; member in struct:SimpleDateFormat::NSOverride
/external/chromium_org/third_party/libxslt/libexslt/
H A Dsaxon.c14 #include <libxml/hash.h>
81 xmlHashTablePtr hash; local
95 hash = (xmlHashTablePtr) xsltGetExtData(tctxt,
98 ret = xmlHashLookup(hash, arg);
109 xmlHashAddEntry(hash, arg, (void *) ret);
/external/chromium_org/third_party/libyuv/unit_test/
H A Dcompare_test.cc23 // hash seed of 5381 recommended.
25 uint32 hash = seed; local
28 hash = hash * 33 + *src++;
31 return hash;
50 // Compare different buffers. Expect hash is different.
55 // Make last half same. Expect hash is different.
61 // Make first half same. Expect hash is different.
69 // Make same. Expect hash is same.
75 // Mask seed different. Expect hash i
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_hash_table.c30 * General purpose hash table implementation.
33 * probing hash table implementation at some point -- as it is said they have
35 * a lock-free implementation of such hash tables .
55 unsigned (*hash)(void *key); member in struct:util_hash_table
79 util_hash_table_create(unsigned (*hash)(void *key),
94 ht->hash = hash;
154 key_hash = ht->hash(key);
191 key_hash = ht->hash(key);
213 key_hash = ht->hash(ke
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dprog_cache.c39 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/chromium_org/third_party/skia/src/core/
H A DSkChecksum.h40 * 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) { argument
46 hash ^= hash >> 16;
47 hash *= 0x85ebca6b;
48 hash ^= hash >> 13;
49 hash *= 0xc2b2ae35;
50 hash
74 uint32_t hash = seed; local
[all...]
/external/chromium_org/third_party/skia/tests/
H A DDynamicHashTest.cpp45 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);
54 hash.add(&c);
55 ASSERT(hash.capacity() == 4);
57 hash.add(&d);
58 ASSERT(hash
67 Hash hash; local
79 Hash hash; local
114 Hash hash; local
140 Hash hash; local
193 Hash hash; local
[all...]
/external/chromium_org/tools/android/heap_profiler/
H A Dheap_profiler.h32 uint32_t hash; // H(frames), used to keep these entries in a hashtable. member in struct:StacktraceEntry
/external/chromium_org/tools/gn/
H A Dlabel.h111 template<> struct hash<Label> { struct in namespace:BASE_HASH_NAMESPACE
113 hash<std::string> stringhash;
H A Dlabel_ptr.h93 // The default hash and comparison operators operate on the label, which should
109 template<typename T> struct hash< LabelPtrPair<T> > { struct in namespace:BASE_HASH_NAMESPACE
111 BASE_HASH_NAMESPACE::hash<Label> h;
H A Dsource_dir.h108 template<> struct hash<SourceDir> { struct in namespace:BASE_HASH_NAMESPACE
110 hash<std::string> h;
H A Dsource_file.h94 template<> struct hash<SourceFile> { struct in namespace:BASE_HASH_NAMESPACE
96 hash<std::string> h;
/external/chromium_org/v8/src/
H A Dinterface.cc41 void Interface::DoAdd(const void* name, uint32_t hash, Interface* interface, argument
68 (*map)->Lookup(const_cast<void*>(name), hash, !IsFrozen(), allocator);
157 this->DoAdd(p->key, p->hash, static_cast<Interface*>(p->value), zone, ok);
/external/chromium_org/v8/test/cctest/
H A Dtest-hashmap.cc47 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {} argument
94 void TestSet(IntKeyHash hash, int size) { argument
95 IntSet set(hash);
/external/clang/test/PCH/
H A Dcxx-templates.cpp70 static unsigned hash(const char* data, unsigned length) { function in struct:Test1::CaseFoldingHash
/external/conscrypt/src/main/java/org/conscrypt/
H A DKeyManagerImpl.java53 private final Hashtable<String, PrivateKeyEntry> hash; field in class:KeyManagerImpl
62 this.hash = new Hashtable<String, PrivateKeyEntry>();
75 hash.put(alias, entry);
104 if (hash.containsKey(alias)) {
105 Certificate[] certs = hash.get(alias).getCertificateChain();
133 if (hash.containsKey(alias)) {
134 return hash.get(alias).getPrivateKey();
157 for (Enumeration<String> aliases = hash.keys(); aliases.hasMoreElements();) {
159 final KeyStore.PrivateKeyEntry entry = hash.get(alias);
/external/e2fsprogs/lib/ext2fs/
H A Dext_attr.c32 * 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 >> (
[all...]
/external/elfutils/0.153/lib/
H A Ddynamicsizehash.c56 NAME name of the hash table structure.
57 TYPE data type of the hash table entries
73 /* First hash function: simply take the modul but prevent zero. */
78 HASHTYPE hash; local
84 /* Second hash function as suggested in [Knuth]. */
85 hash = 1 + hval % (htab->size - 2);
89 if (idx <= hash)
90 idx = htab->size + idx - hash;
92 idx -= hash;
243 /* Make the hash valu
[all...]
/external/fio/
H A Dfilehash.c6 #include "hash.h"
17 static unsigned short hash(const char *name) function
49 struct flist_head *bucket = &file_hash[hash(name)];
91 flist_add_tail(&f->hash_list, &file_hash[hash(f->file_name)]);
108 log_err("fio: file hash not empty on exit\n");

Completed in 810 milliseconds

1234567891011>>