Searched refs:hash (Results 76 - 100 of 1823) sorted by relevance

1234567891011>>

/external/chromium_org/chrome/browser/chromeos/policy/
H A Dcloud_external_data_store.cc19 // Encodes (policy, hash) into a single string.
20 std::string GetSubkey(const std::string& policy, const std::string& hash) { argument
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);
54 Store(const std::string& policy, const std::string& hash, const std::string& data) argument
61 Load(const std::string& policy, const std::string& hash, size_t max_size, std::string* data) argument
[all...]
/external/chromium_org/net/quic/crypto/
H A Dnull_decrypter.cc29 uint128 hash; local
30 if (!ReadHash(&reader, &hash)) {
39 if (hash != ComputeHash(buffer)) {
54 uint128 hash; local
55 if (!ReadHash(&reader, &hash)) {
65 if (hash != ComputeHash(buffer)) {
75 bool NullDecrypter::ReadHash(QuicDataReader* reader, uint128* hash) { argument
82 *hash = hi;
83 *hash <<= 64;
84 *hash
[all...]
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/
H A Dhash.h59 // Make hash<T> be the same as less<T>. Note that everywhere where custom
60 // hash functions are defined in the protobuf code, they are also defined such
63 struct hash { struct in namespace:google::protobuf
64 // Dummy, just to make derivative hash functions compile.
77 struct hash<const char*> { struct in namespace:google::protobuf
78 // Dummy, just to make derivative hash functions compile.
90 typename HashFcn = hash<Key>,
98 typename HashFcn = hash<Key>,
108 struct hash : public HASH_NAMESPACE::hash_compare<Key> {
121 struct hash<cons
190 struct hash<string> { struct in namespace:google::protobuf
203 struct hash<pair<First, Second> > { struct in namespace:google::protobuf
[all...]
/external/protobuf/src/google/protobuf/stubs/
H A Dhash.h59 // Make hash<T> be the same as less<T>. Note that everywhere where custom
60 // hash functions are defined in the protobuf code, they are also defined such
63 struct hash { struct in namespace:google::protobuf
64 // Dummy, just to make derivative hash functions compile.
77 struct hash<const char*> { struct in namespace:google::protobuf
78 // Dummy, just to make derivative hash functions compile.
90 typename HashFcn = hash<Key>,
96 typename HashFcn = hash<Key>,
104 struct hash : public HASH_NAMESPACE::hash_compare<Key> {
117 struct hash<cons
178 struct hash<string> { struct in namespace:google::protobuf
191 struct hash<pair<First, Second> > { struct in namespace:google::protobuf
[all...]
/external/chromium_org/net/disk_cache/blockfile/
H A Dindex_table_v3_unittest.cc149 uint32 hash = 0x55aa6699; local
160 EntryCell entry = EntryCell::GetEntryCellForTest(cell_num, hash, addr, NULL,
171 EXPECT_EQ(hash, entry.hash());
184 EntryCell entry2 = EntryCell::GetEntryCellForTest(cell_num, hash, addr,
196 hash = ~hash;
278 uint32 hash = i * i * 1111 + i * 11; local
280 EntryCell entry = index.CreateEntryCell(hash, addr);
283 disk_cache::CellInfo info = { hash, add
290 uint32 hash = entries[i].hash; local
312 uint32 hash = entries[i].hash; local
337 uint32 hash = 0x55aa55bb; local
477 uint32 hash = i; // The entries will be ordered on the table. local
595 uint32 hash = entry_id * i * 321 + entry_id * 13; local
629 uint32 hash = i * 256; local
649 uint32 hash = i * 256; local
680 uint32 hash = 0; local
698 uint32 hash = 0; local
[all...]
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dcache.cc11 #include "util/hash.h"
34 uint32_t hash; // Hash of key(); used for fast sharding and comparisons member in struct:leveldb::__anon12466::LRUHandle
48 // We provide our own simple hash table since it removes a whole bunch
49 // of porting hacks and is also faster than some of the built-in hash
58 LRUHandle* Lookup(const Slice& key, uint32_t hash) { argument
59 return *FindPointer(key, hash);
63 LRUHandle** ptr = FindPointer(h->key(), h->hash);
78 LRUHandle* Remove(const Slice& key, uint32_t hash) { argument
79 LRUHandle** ptr = FindPointer(key, hash);
90 // a linked list of cache entries that hash int
98 FindPointer(const Slice& key, uint32_t hash) argument
119 uint32_t hash = h->hash; local
209 Lookup(const Slice& key, uint32_t hash) argument
225 Insert( const Slice& key, uint32_t hash, void* value, size_t charge, void (*deleter)(const Slice& key, void* value)) argument
258 Erase(const Slice& key, uint32_t hash) argument
280 Shard(uint32_t hash) argument
295 const uint32_t hash = HashSlice(key); local
299 const uint32_t hash = HashSlice(key); local
307 const uint32_t hash = HashSlice(key); local
[all...]
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/selector/
H A DMSOutlookKeyIdCalculator.java15 byte[] hash = new byte[dig.getDigestSize()];
29 dig.doFinal(hash, 0);
31 return hash;
/external/chromium_org/components/metrics/
H A Dmetrics_hashes.cc15 // Converts the 8-byte prefix of an MD5 hash into a uint64 value.
16 inline uint64 HashToUInt64(const std::string& hash) { argument
18 DCHECK_GE(hash.size(), sizeof(value));
19 memcpy(&value, hash.data(), sizeof(value));
26 // Create an MD5 hash of the given |name|, represented as a byte buffer
/external/chromium_org/content/test/data/fileapi/
H A Dcommon.js12 if (document.location.hash == '#fail')
18 document.location.hash = '#pass';
24 document.location.hash = '#fail';
/external/clang/test/CXX/temp/temp.spec/temp.explicit/
H A Dp6.cpp17 template<typename T> struct hash { }; struct
24 hash<T> h;
32 template<> struct hash<S> { struct
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DStringHasherTest.cpp60 EXPECT_EQ(emptyStringHash, hasher.hash());
71 EXPECT_EQ(singleNullCharacterHash, hasher.hash());
77 EXPECT_EQ(testAHash1, hasher.hash());
80 EXPECT_EQ(testAHash2, hasher.hash());
83 EXPECT_EQ(testAHash3, hasher.hash());
86 EXPECT_EQ(testAHash4, hasher.hash());
89 EXPECT_EQ(testAHash5, hasher.hash());
95 EXPECT_EQ(testBHash1, hasher.hash());
98 EXPECT_EQ(testBHash2, hasher.hash());
101 EXPECT_EQ(testBHash3, hasher.hash());
[all...]
/external/deqp/framework/delibs/depool/
H A DdePoolHashSet.c21 * \brief Memory pool hash-set class.
57 /* Test find() on empty hash. */
61 const int* val = deTestHash_find(hash, (deInt16)i);
68 deTestHash_insert(hash, (deInt16)i, -i);
71 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000);
74 const int* val = deTestHash_find(hash, (deInt16)i);
80 deTestHash_delete(hash, (deInt16)i);
82 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 4000);
85 const int* val = deTestHash_find(hash, (deInt16)i);
94 deTestHash_insert(hash, (deInt1
[all...]
/external/wpa_supplicant_8/hostapd/src/eap_common/
H A Deap_pwd_common.c26 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len) argument
28 crypto_hash_update(hash, data, len);
32 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest) argument
35 crypto_hash_finish(hash, digest, &len);
43 struct crypto_hash *hash; local
54 hash = crypto_hash_init(CRYPTO_HASH_ALG_HMAC_SHA256,
56 if (hash == NULL)
59 crypto_hash_update(hash, digest, SHA256_MAC_LEN);
60 crypto_hash_update(hash, (u8 *) &i, sizeof(u16));
61 crypto_hash_update(hash, labe
94 struct crypto_hash *hash; local
291 struct crypto_hash *hash; local
[all...]
/external/wpa_supplicant_8/src/eap_common/
H A Deap_pwd_common.c26 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len) argument
28 crypto_hash_update(hash, data, len);
32 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest) argument
35 crypto_hash_finish(hash, digest, &len);
43 struct crypto_hash *hash; local
54 hash = crypto_hash_init(CRYPTO_HASH_ALG_HMAC_SHA256,
56 if (hash == NULL)
59 crypto_hash_update(hash, digest, SHA256_MAC_LEN);
60 crypto_hash_update(hash, (u8 *) &i, sizeof(u16));
61 crypto_hash_update(hash, labe
94 struct crypto_hash *hash; local
291 struct crypto_hash *hash; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/
H A Deap_pwd_common.c26 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len) argument
28 crypto_hash_update(hash, data, len);
32 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest) argument
35 crypto_hash_finish(hash, digest, &len);
43 struct crypto_hash *hash; local
54 hash = crypto_hash_init(CRYPTO_HASH_ALG_HMAC_SHA256,
56 if (hash == NULL)
59 crypto_hash_update(hash, digest, SHA256_MAC_LEN);
60 crypto_hash_update(hash, (u8 *) &i, sizeof(u16));
61 crypto_hash_update(hash, labe
94 struct crypto_hash *hash; local
291 struct crypto_hash *hash; local
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Duhash.h31 * functions. These functions hash keys, compare keys, delete keys,
56 * UHashElement pointer. A hash element contains a key, value, and
88 * This is a single hash element.
101 * @return A NON-NEGATIVE hash code for parm.
139 UHashFunction *keyHasher; /* Computes hash from key.
199 * @param size The initial capacity of this hash table.
222 uhash_init(UHashtable *hash,
230 * @param hash The UHashtable to close. If hash is NULL no operation is performed.
233 uhash_close(UHashtable *hash);
[all...]
/external/icu/icu4c/source/common/
H A Duhash.h31 * functions. These functions hash keys, compare keys, delete keys,
56 * UHashElement pointer. A hash element contains a key, value, and
88 * This is a single hash element.
101 * @return A NON-NEGATIVE hash code for parm.
139 UHashFunction *keyHasher; /* Computes hash from key.
199 * @param size The initial capacity of this hash table.
222 uhash_init(UHashtable *hash,
230 * @param hash The UHashtable to close. If hash is NULL no operation is performed.
233 uhash_close(UHashtable *hash);
[all...]
/external/apache-http/src/org/apache/http/auth/
H A DBasicUserPrincipal.java67 int hash = LangUtils.HASH_SEED;
68 hash = LangUtils.hashCode(hash, this.username);
69 return hash;
/external/chromium_org/base/
H A Dsha1.h16 static const size_t kSHA1Length = 20; // Length in bytes of a SHA-1 hash.
18 // Computes the SHA-1 hash of the input string |str| and returns the full
19 // hash.
22 // Computes the SHA-1 hash of the |len| bytes in |data| and puts the hash
23 // in |hash|. |hash| must be kSHA1Length bytes long.
25 unsigned char* hash);
/external/chromium_org/net/http/
H A Ddes.h23 // bytes), and |hash| is an 8-byte buffer receiving the output ciphertext.
25 uint8* hash);
/external/chromium_org/remoting/host/
H A Dpin_hash.cc16 std::string hash = protocol::AuthenticationMethod::ApplyHashFunction( local
19 base::Base64Encode(hash, &hash_base64);
23 bool VerifyHostPinHash(const std::string& hash, argument
27 if (!hash_parsed.Parse(hash)) {
28 LOG(FATAL) << "Invalid hash.";
/external/chromium_org/third_party/WebKit/Source/platform/fonts/
H A DFontCacheKey.h60 unsigned hash() const function in struct:blink::FontCacheKey
63 m_creationParams.hash(),
99 static unsigned hash(const FontCacheKey& key) function in struct:blink::FontCacheKeyHash
101 return key.hash();
/external/e2fsprogs/lib/e2p/
H A Dhashstr.c20 struct hash { struct
25 static struct hash hash_list[] = {
34 struct hash *p;
46 * Returns the hash algorithm, or -1 on error
50 struct hash *p;
/external/elfutils/0.153/libelf/
H A Delf_hash.c58 #include <dl-hash.h>
/external/guava/guava/src/com/google/common/hash/
H A DFunnel.java15 package com.google.common.hash;

Completed in 880 milliseconds

1234567891011>>