/external/libsepol/include/sepol/policydb/ |
H A D | hashtab.h | 37 unsigned int (*hash_value) (struct hashtab_val * h, hashtab_key_t key); /* hash function */ member in struct:hashtab_val 49 extern hashtab_t hashtab_create(unsigned int (*hash_value) (hashtab_t h,
|
/external/chromium/sdch/open-vcdiff/src/ |
H A D | blockhash_test.cc | 50 uint32_t hash_value, 52 return block_hash.FirstMatchingBlock(hash_value, block_ptr); 793 uint32_t hash_value = RollingHash<kBlockSize>::Hash( 795 dh_->FindBestMatch(hash_value, 807 uint32_t hash_value = RollingHash<kBlockSize>::Hash( 809 dh_->FindBestMatch(hash_value, 828 uint32_t hash_value = 830 many_matches_hash.FindBestMatch(hash_value, 49 FirstMatchingBlock(const BlockHash& block_hash, uint32_t hash_value, const char* block_ptr) const argument
|
H A D | blockhash.h | 180 void AddOneIndexHash(int index, uint32_t hash_value) { argument 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 [all...] |
H A D | 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, 80 EncodeCopyForBestMatch( uint32_t hash_value, const char* target_candidate_start, const char* unencoded_target_start, size_t unencoded_target_size, const BlockHash* target_hash, CodeTableWriterInterface* coder) const argument
|
H A D | blockhash.cc | 152 void BlockHash::AddBlock(uint32_t hash_value) { argument 176 const uint32_t hash_table_index = GetHashTableIndex(hash_value); 314 inline int BlockHash::FirstMatchingBlockInline(uint32_t hash_value, argument 316 return SkipNonMatchingBlocks(hash_table_[GetHashTableIndex(hash_value)], 320 int BlockHash::FirstMatchingBlock(uint32_t hash_value, argument 322 return FirstMatchingBlockInline(hash_value, block_ptr); 391 void BlockHash::FindBestMatch(uint32_t hash_value, argument 397 for (int block_number = FirstMatchingBlockInline(hash_value,
|
/external/srtp/crypto/hash/ |
H A D | 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));
|
H A D | sha1.c | 77 sha1(const uint8_t *msg, int octets_in_msg, uint32_t hash_value[5]) { argument 82 sha1_final(&ctx, hash_value); 99 sha1_core(const uint32_t M[16], uint32_t hash_value[5]) { argument 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[ [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | hash_table.c | 114 const unsigned hash_value = (*ht->hash)(key); local 115 const unsigned bucket = hash_value % ht->num_buckets; 133 const unsigned hash_value = (*ht->hash)(key); local 134 const unsigned bucket = hash_value % ht->num_buckets; 148 const unsigned hash_value = (*ht->hash)(key); local 149 const unsigned bucket = hash_value % ht->num_buckets;
|
/external/srtp/crypto/test/ |
H A D | 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/lib/CodeGen/ |
H A D | MachineInstr.cpp | 169 /// operand. Note that this should stay in sync with the hash_value overload 213 hash_code llvm::hash_value(const MachineOperand &MO) { function in class:llvm 1929 HashComponents.push_back(hash_value(MO));
|
/external/llvm/unittests/ADT/ |
H A D | 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(4 129 hash_code hash_value(HashableDummy dummy) { return dummy.value; } function in namespace:__anon9233 [all...] |
/external/valgrind/main/callgrind/ |
H A D | fn.c | 219 int hash_value = 0; local 221 hash_value = (HASH_CONSTANT * hash_value + *s) % table_size; 222 return hash_value;
|
/external/llvm/include/llvm/ADT/ |
H A D | 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(cons 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/llvm/lib/VMCore/ |
H A D | LLVMContextImpl.h | 55 friend hash_code hash_value(const KeyTy &Key) { function in struct:llvm::DenseMapAPIntKeyInfo::KeyTy 62 return static_cast<unsigned>(hash_value(Key)); 80 friend hash_code hash_value(const KeyTy &Key) { function in struct:llvm::DenseMapAPFloatKeyInfo::KeyTy 91 return static_cast<unsigned>(hash_value(Key));
|
/external/dbus/bus/ |
H A D | activation.c | 749 char *hash_key, *hash_value; local 754 if (!_dbus_string_steal_data (&value, &hash_value)) 758 hash_key, hash_value)) 1621 char *hash_value; local 1626 hash_value = NULL; 1632 hash_value = _dbus_strdup (value); 1634 if (hash_value == NULL) 1638 hash_key, hash_value)) 1646 dbus_free (hash_value);
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 50 friend hash_code hash_value(const TableGenStringKey &Value) { function in class:llvm::TableGenStringKey 51 using llvm::hash_value; 52 return hash_value(Value.str()); 69 using llvm::hash_value; 70 return hash_value(Val);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | GVN.cpp | 95 friend hash_code hash_value(const Expression &Value) { function in struct:__anon9088::Expression 146 using llvm::hash_value; 147 return static_cast<unsigned>(hash_value(e));
|
/external/v8/src/ |
H A D | objects.cc | 3558 int hash_value; local 3563 hash_value = V8::RandomPrivate(isolate) & Smi::kMaxValue; 3565 } while (hash_value == 0 && attempts < 30); 3566 hash_value = hash_value != 0 ? hash_value : 1; // never return 0 3568 return Smi::FromInt(hash_value);
|