| /prebuilts/go/linux-x86/src/crypto/ |
| crypto.go | 9 "hash"
14 // Hash identifies a cryptographic hash function that is implemented in another
16 type Hash uint
18 // HashFunc simply returns the value of h so that Hash implements SignerOpts.
19 func (h Hash) HashFunc() Hash {
24 MD4 Hash = 1 + iota // import golang.org/x/crypto/md4
68 // Size returns the length, in bytes, of a digest resulting from the given hash
69 // function. It doesn't require that the hash function in question be linke
[all...] |
| /system/tools/hidl/ |
| Hash.cpp | 17 #include "Hash.h"
31 const std::vector<uint8_t> Hash::kEmptyHash = std::vector<uint8_t>(SHA256_DIGEST_LENGTH, 0);
33 Hash& Hash::getMutableHash(const std::string& path) {
34 static std::map<std::string, Hash> hashes;
39 it = hashes.insert(it, {path, Hash(path)});
45 const Hash& Hash::getHash(const std::string& path) {
49 void Hash::clearHash(const std::string& path) {
67 Hash::Hash(const std::string &path
148 std::string hash = match.str(1); local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/unicode/ |
| makeunicodedata.py | 679 # unicode name hash table
694 codehash = Hash("code", data, 47)
[all...] |
| /device/linaro/bootloader/edk2/SecurityPkg/UserIdentification/PwdCredentialProviderDxe/ |
| PwdCredentialProvider.c | 264 Hash the password to get credential.
270 @retval TRUE Hash the password successfully.
271 @retval FALSE Failed to hash the password.
283 VOID *Hash;
286 Hash = AllocatePool (HashSize);
287 ASSERT (Hash != NULL);
289 Status = Sha1Init (Hash);
294 Status = Sha1Update (Hash, Password, PasswordSize);
299 Status = Sha1Final (Hash, Credential);
302 FreePool (Hash);
[all...] |
| /device/linaro/bootloader/edk2/SecurityPkg/UserIdentification/UsbCredentialProviderDxe/ |
| UsbCredentialProvider.c | 417 Hash the data to get credential.
423 @retval TRUE Hash the data successfully.
424 @retval FALSE Failed to hash the data.
436 VOID *Hash;
439 Hash = AllocatePool (HashSize);
440 ASSERT (Hash != NULL);
442 Status = Sha1Init (Hash);
447 Status = Sha1Update (Hash, Buffer, BufferSize);
452 Status = Sha1Final (Hash, Credential);
455 FreePool (Hash);
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| MapBenchmark.java | 40 @Param({"Hash", "LinkedHM", "MapMaker1", "Immutable"})
44 Hash {
64 return Collections.unmodifiableMap(Hash.create(keys));
69 return Collections.synchronizedMap(Hash.create(keys));
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BenchmarkHelpers.java | 41 Hash {
105 Hash {
139 Hash {
193 Hash{
210 Hash {
|
| /external/libchrome/base/trace_event/ |
| heap_profiler_allocation_register.h | 37 // Hash map that mmaps memory only once in the constructor. Its API is
53 // Capacity controls how many items this hash map can hold, and largely
177 // The list head is in |buckets_| at the hash offset.
178 Cell** p_cell = &buckets_[Hash(key)];
191 // nullptr if the hash table has run out of memory.
200 // If the hash table has too little capacity (when too little address space
211 size_t Hash(const Key& key) const {
231 // The array of buckets (pointers into |cells_|). |buckets_[Hash(key)]| will
232 // contain the pointer to the linked list of cells for |Hash(key)|.
256 // When either hash table hits max size, new inserts are dropped
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIEHash.h | 26 /// \brief An object containing the capability of hashing and adding hash
95 /// \brief Adds the parent context of \param Die to the hash.
98 /// \brief Adds the attributes of \param Die to the hash.
101 /// \brief Computes the full DWARF4 7.27 hash of the DIE.
104 // Routines that add DIEValues to the hash.
106 /// \brief Adds \param Value to the hash.
107 void update(uint8_t Value) { Hash.update(Value); }
109 /// \brief Encodes and adds \param Value to the hash as a ULEB128.
112 /// \brief Encodes and adds \param Value to the hash as a SLEB128.
116 /// \brief Adds \param Str to the hash and includes a NULL byte
[all...] |
| /external/llvm/lib/DebugInfo/PDB/Raw/ |
| TpiStream.cpp | 17 #include "llvm/DebugInfo/PDB/Raw/Hash.h"
74 // Computes a hash for a given TPI record.
119 uint32_t Hash = getTpiHash(Rec, *RawRecord);
120 if (Hash % NumHashBuckets != HashValues[Index])
128 uint32_t Hash = hashStringV1(StringRef(Buf, 4));
129 if (Hash % NumHashBuckets != HashValues[Index])
147 // Verifies that a given type record matches with a given hash value.
176 "TPI Stream expected 4 byte hash key size.");
181 "TPI Stream Invalid number of hash buckets.");
187 // Hash indices, hash values, etc come from the hash stream
[all...] |
| /external/llvm/lib/Fuzzer/ |
| FuzzerUtil.cpp | 66 std::string Hash(const Unit &U) {
67 uint8_t Hash[kSHA1NumBytes];
68 ComputeSHA1(U.data(), U.size(), Hash);
71 SS << std::hex << std::setfill('0') << std::setw(2) << (unsigned)Hash[i];
|
| /external/llvm/lib/Target/X86/ |
| X86OptimizeLEAs.cpp | 49 /// \brief Returns a hash table key based on memory operands of \p MI. The
119 assert(Val.Disp != PtrInfo::getEmptyKey() && "Cannot hash the empty key");
121 "Cannot hash the tombstone key");
123 hash_code Hash = hash_combine(*Val.Operands[0], *Val.Operands[1],
127 // hash so that memory operands which differ only be immediate displacement
128 // would have the same hash. If the address displacement is something else,
129 // we should reflect symbol/index/address in the hash.
135 Hash = hash_combine(Hash, Val.Disp->getIndex());
138 Hash = hash_combine(Hash, Val.Disp->getSymbolName())
[all...] |
| /external/llvm/unittests/CodeGen/ |
| DIEHashTest.cpp | 40 DIEHash Hash;
44 uint64_t MD5Res = Hash.computeTypeSignature(Die);
59 // The exact same hash GCC produces for this DIE.
73 // The exact same hash GCC produces for this DIE.
101 // The exact same hash GCC produces for this DIE.
328 // Check that the hash for a pointer-to-member matches regardless of whether the
406 // Check that the hash for a pointer-to-member matches regardless of whether the
482 // causes a hash to differ when the containing type is a declaration in one TU
540 // The exact same hash GCC produces for this DIE.
558 // The exact same hash GCC produces for this DIE
[all...] |
| /external/llvm/unittests/ProfileData/ |
| CoverageMappingTest.cpp | 54 uint64_t Hash;
60 Record.FunctionHash = Hash;
93 uint64_t Hash;
96 InputFunctionCoverageData(std::string Name, uint64_t Hash)
97 : Name(std::move(Name)), Hash(Hash) {}
140 void startFunction(StringRef FuncName, uint64_t Hash) {
141 InputFunctions.emplace_back(FuncName.str(), Hash);
184 OutputFunctions[I].Hash = InputFunctions[I].Hash;
[all...] |
| /external/python/cpython2/Tools/unicode/ |
| makeunicodedata.py | 679 # unicode name hash table
694 codehash = Hash("code", data, 47)
[all...] |
| /external/python/cpython3/Tools/unicode/ |
| makeunicodedata.py | 711 # unicode name hash table
726 codehash = Hash("code", data, 47)
[all...] |
| /external/skia/src/core/ |
| SkGlyph.h | 78 uint32_t hash() const { function in struct:SkPackedID
273 static uint32_t Hash(SkPackedGlyphID glyphId) {
274 return glyphId.hash();
|
| SkTDynamicHash.h | 17 // static uint32_t Hash(const Key&) { ... }
35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
36 SkASSERT(hash);
62 explicit ConstIter(const SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
63 SkASSERT(hash);
267 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
271 return Hash(key) & this->hashMask();
281 static uint32_t Hash(const Key& key) { return Traits::Hash(key);
[all...] |
| /external/skia/src/gpu/ |
| GrResourceAllocator.h | 24 * linked list sorted by increasing start index. (It also maintains a hash table from proxyID
90 static uint32_t Hash(const GrScratchKey& key) { return key.hash(); }
145 static uint32_t Hash(const uint32_t& key) { return key; }
|
| /external/skqp/src/core/ |
| SkGlyph.h | 78 uint32_t hash() const { function in struct:SkPackedID
273 static uint32_t Hash(SkPackedGlyphID glyphId) {
274 return glyphId.hash();
|
| SkTDynamicHash.h | 17 // static uint32_t Hash(const Key&) { ... }
35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
36 SkASSERT(hash);
62 explicit ConstIter(const SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
63 SkASSERT(hash);
267 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
271 return Hash(key) & this->hashMask();
281 static uint32_t Hash(const Key& key) { return Traits::Hash(key);
[all...] |
| /external/skqp/src/gpu/ |
| GrResourceAllocator.h | 24 * linked list sorted by increasing start index. (It also maintains a hash table from proxyID
90 static uint32_t Hash(const GrScratchKey& key) { return key.hash(); }
145 static uint32_t Hash(const uint32_t& key) { return key; }
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallPtrSet.h | 41 /// Large sets use a classic exponentially-probed hash table. Empty buckets are
44 /// (-2), to allow deletion. The hash table is resized when the table is 3/4 or
129 unsigned Hash(const void *Ptr) const {
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| FoldingSet.cpp | 1 //===-- Support/FoldingSet.cpp - Uniquing Hash Set --------------*- C++ -*-===//
10 // This file implements a hash set that can be used to remove duplication of
29 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeIDRef,
33 unsigned Hash = static_cast<unsigned>(Size);
36 Hash += Data & 0xFFFF;
37 unsigned Tmp = ((Data >> 16) << 11) ^ Hash;
38 Hash = (Hash << 16) ^ Tmp;
39 Hash += Hash >> 11
[all...] |
| /external/v8/src/ |
| address-map.h | 26 LookupOrInsert(key, Hash(key))->value = index;
31 Entry* entry = Lookup(key, Hash(key));
41 static uint32_t Hash(uintptr_t key) { return static_cast<uint32_t>(key); }
|
