HomeSort by relevance Sort by last modified time
    Searched full:hash_value (Results 1 - 25 of 95) sorted by null

1 2 3 4

  /external/chromium_org/tools/gyp/test/defines/
defines.c 18 #ifdef HASH_VALUE
19 printf("HASH_VALUE is %s\n", HASH_VALUE);
defines.gyp 17 'HASH_VALUE="a#1"',
gyptest-defines.py 23 HASH_VALUE is a#1
gyptest-defines-env-regyp.py 35 HASH_VALUE is a#1
  /external/llvm/unittests/ADT/
HashingTest.cpp 37 friend hash_code hash_value(const NonPOD &obj) { function in struct:llvm::NonPOD
67 EXPECT_EQ(hash_value(42), hash_value(x));
68 EXPECT_EQ(hash_value(42), hash_value(TE_Foo));
69 EXPECT_NE(hash_value(42), hash_value(y));
70 EXPECT_NE(hash_value(42), hash_value(TE_Bar));
71 EXPECT_NE(hash_value(42), hash_value(p))
129 hash_code hash_value(HashableDummy dummy) { return dummy.value; } function in namespace:__anon24197
    [all...]
StringRefTest.cpp 324 EXPECT_EQ(hash_value(std::string()), hash_value(StringRef()));
325 EXPECT_EQ(hash_value(std::string()), hash_value(StringRef("")));
327 hash_code H = hash_value(S);
328 EXPECT_EQ(H, hash_value(StringRef("hello world")));
329 EXPECT_EQ(H, hash_value(StringRef(S)));
330 EXPECT_NE(H, hash_value(StringRef("hello worl")));
331 EXPECT_EQ(hash_value(std::string("hello worl")),
332 hash_value(StringRef("hello worl")))
    [all...]
  /external/chromium_org/chrome/common/metrics/
metrics_util_unittest.cc 14 uint32 hash_value; member in struct:metrics::__anon9163
27 EXPECT_EQ(known_hashes[i].hash_value, HashName(known_hashes[i].name));
  /external/chromium_org/media/base/
djb2.h 30 // uint32 hash_value = kDJB2HashSeed; // Initial seed for DJB2.
32 // hash_value = DJB2Hash(source, bytes_per_line, hash_value);
  /frameworks/compile/mclinker/lib/Support/
HandleToArea.cpp 24 bucket.hash_value = HashFunction()(
44 unsigned int hash_value = HashFunction()( local
50 if (bucket->hash_value == hash_value && bucket->handle->path() == pPath) {
62 unsigned int hash_value = HashFunction()(llvm::StringRef(pPath.native().c_str(), local
68 if (bucket->hash_value == hash_value) {
80 unsigned int hash_value = HashFunction()(llvm::StringRef(pPath.native().c_str(), local
86 if (bucket->hash_value == hash_value) {
    [all...]
  /external/chromium_org/tools/gn/
label.h 106 inline size_t hash_value(const Label& v) {
107 return ((hash_value(v.dir().value()) * 131 +
108 hash_value(v.name())) * 131 +
109 hash_value(v.toolchain_dir().value())) * 131 +
110 hash_value(v.toolchain_name());
source_file.h 90 inline size_t hash_value(const SourceFile& v) {
91 return hash_value(v.value());
  /external/chromium/sdch/open-vcdiff/src/
vcdiffengine.cc 81 uint32_t hash_value,
93 hashed_dictionary_->FindBestMatch(hash_value,
101 target_hash->FindBestMatch(hash_value,
191 uint32_t hash_value = hasher.Hash(candidate_pos); local
195 hash_value,
209 hash_value = hasher.Hash(candidate_pos);
224 hash_value);
226 hash_value = hasher.UpdateHash(hash_value,
blockhash.h 180 void AddOneIndexHash(int index, uint32_t hash_value) {
182 AddBlock(hash_value);
212 // beginning at that position (hash_value). It attempts to find a matching
245 // uint32_t hash_value =
247 // bh1.FindBestMatch(hash_value,
252 // bh2.FindBestMatch(hash_value,
262 // hash_value is passed as a separate parameter from target_candidate_start,
294 void FindBestMatch(uint32_t hash_value,
344 uint32_t GetHashTableIndex(uint32_t hash_value) const {
345 return hash_value & hash_table_mask_
    [all...]
  /external/chromium_org/sdch/open-vcdiff/src/
vcdiffengine.cc 78 uint32_t hash_value,
90 hashed_dictionary_->FindBestMatch(hash_value,
98 target_hash->FindBestMatch(hash_value,
188 uint32_t hash_value = hasher.Hash(candidate_pos); local
192 hash_value,
206 hash_value = hasher.Hash(candidate_pos);
221 hash_value);
223 hash_value = hasher.UpdateHash(hash_value,
  /external/open-vcdiff/src/
vcdiffengine.cc 78 uint32_t hash_value,
90 hashed_dictionary_->FindBestMatch(hash_value,
98 target_hash->FindBestMatch(hash_value,
188 uint32_t hash_value = hasher.Hash(candidate_pos); local
192 hash_value,
206 hash_value = hasher.Hash(candidate_pos);
221 hash_value);
223 hash_value = hasher.UpdateHash(hash_value,
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
hash_table.c 114 const unsigned hash_value = (*ht->hash)(key); local
115 const unsigned bucket = hash_value % ht->num_buckets;
140 const unsigned hash_value = (*ht->hash)(key); local
141 const unsigned bucket = hash_value % ht->num_buckets;
155 const unsigned hash_value = (*ht->hash)(key); local
156 const unsigned bucket = hash_value % ht->num_buckets;
  /external/mesa3d/src/mesa/program/
hash_table.c 114 const unsigned hash_value = (*ht->hash)(key); local
115 const unsigned bucket = hash_value % ht->num_buckets;
140 const unsigned hash_value = (*ht->hash)(key); local
141 const unsigned bucket = hash_value % ht->num_buckets;
155 const unsigned hash_value = (*ht->hash)(key); local
156 const unsigned bucket = hash_value % ht->num_buckets;
  /external/srtp/crypto/hash/
hmac.c 172 uint32_t hash_value[5]; local
200 /* the result is returned in the array hash_value[] */
201 sha1_final(&state->ctx, hash_value);
203 /* copy hash_value to *result */
205 result[i] = ((uint8_t *)hash_value)[i];
208 octet_string_hex_string((uint8_t *)hash_value, tag_len));
sha1.c 77 sha1(const uint8_t *msg, int octets_in_msg, uint32_t hash_value[5]) {
82 sha1_final(&ctx, hash_value);
99 sha1_core(const uint32_t M[16], uint32_t hash_value[5]) {
109 /* copy hash_value into H0, H1, H2, H3, H4 */
110 H0 = hash_value[0];
111 H1 = hash_value[1];
112 H2 = hash_value[2];
113 H3 = hash_value[3];
114 H4 = hash_value[4];
176 hash_value[0] = H0 + A
    [all...]
  /external/libsepol/src/
hashtab.c 35 hashtab_t hashtab_create(unsigned int (*hash_value) (hashtab_t h,
53 p->hash_value = hash_value;
74 hvalue = h->hash_value(h, key);
113 hvalue = h->hash_value(h, key);
146 hvalue = h->hash_value(h, key);
187 hvalue = h->hash_value(h, key);
  /external/skia/tools/
verify_images_for_gm_results.py 25 def FileNameToGSURL(filename, hash_type, hash_value):
32 hash_value: string; the checksum itself.
37 return '%s/%s/%s/%s.png' % (GS_URL, hash_type, test_name, hash_value)
61 hash_type, hash_value = json_content[dict_type][result_type][result]
62 gs_url = FileNameToGSURL(result, hash_type, str(hash_value))
  /external/srtp/crypto/test/
sha1_driver.c 100 uint32_t hash_value[5]; local
112 sha1_final(&ctx, hash_value);
113 if (0 == memcmp(test_case->hash, hash_value, 20)) {
118 octet_string_hex_string((uint8_t *)hash_value, 20));
126 octet_string_hex_string((uint8_t *)hash_value, 20));
  /external/llvm/include/llvm/ADT/
Hashing.h 27 // -- 'hash_value' is a function designed to be overloaded for each
35 // within the implementation of a 'hash_value' routine or similar context.
76 /// using llvm::hash_value;
77 /// llvm::hash_code code = hash_value(x);
100 /// \brief Allow a hash_code to be directly run through hash_value.
101 friend size_t hash_value(const hash_code &code) { return code.value; } function in class:llvm::hash_code
112 typename enable_if<is_integral_or_enum<T>, hash_code>::type hash_value(T value);
117 template <typename T> hash_code hash_value(const T *ptr);
121 hash_code hash_value(const std::pair<T, U> &arg);
125 hash_code hash_value(const std::basic_string<T> &arg)
738 hash_value(T value) { function in namespace:llvm
744 template <typename T> hash_code hash_value(const T *ptr) { function in namespace:llvm
752 hash_code hash_value(const std::pair<T, U> &arg) { function in namespace:llvm
759 hash_code hash_value(const std::basic_string<T> &arg) { function in namespace:llvm
    [all...]
  /external/chromium_org/net/dns/
dns_hosts.h 37 inline size_t hash_value(const net::DnsHostsKey& key) {
38 return hash_value(key.first) + key.second;
  /external/chromium_org/net/http/
http_security_headers_unittest.cc 24 HashValue hash_value(tag);
25 memset(hash_value.data(), label, hash_value.size());
26 return hash_value;
30 HashValue hash_value = GetTestHashValue(label, tag); local
33 reinterpret_cast<char*>(hash_value.data()), hash_value.size()), &base64);
35 switch (hash_value.tag) {
41 NOTREACHED() << "Unknown HashValueTag " << hash_value.tag;

Completed in 632 milliseconds

1 2 3 4