HomeSort by: relevance | last modified time | path
    Searched refs:Hash (Results 1 - 15 of 15) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_handlers_cxx.h 33 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
36 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
ubsan_type_hash_itanium.cc 79 // (vptr,type) pair, a hash is computed. This hash is assumed to be globally
84 // * the vptr, and thus the hash, can be affected by ASLR, so multiple runs
87 // The first caching layer is a small hash table with no chaining; buckets are
88 // reused as needed. The second caching layer is a large hash table with open
91 // FIXME: Make these hash table accesses thread-safe. The races here are benign:
96 /// Find a bucket to store the given hash value in.
211 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) {
216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash);
217 if (*Bucket == Hash) {
    [all...]
ubsan_handlers_cxx.cc 35 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash,
37 if (checkDynamicType((void*)Pointer, Data->TypeInfo, Hash))
86 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) {
88 HandleDynamicTypeCacheMiss(Data, Pointer, Hash, Opts);
91 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) {
94 if (HandleDynamicTypeCacheMiss(Data, Pointer, Hash, Opts))
ubsan_type_hash.h 52 bool checkDynamicType(void *Object, void *Type, HashValue Hash);
61 /// return \c true (modulo hash collisions) if
63 /// __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] == Hash
ubsan_type_hash_win.cc 41 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) {
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerSHA1.h 24 // Computes SHA1 hash of 'Len' bytes in 'Data', writes kSHA1NumBytes to 'Out'.
29 std::string Hash(const Unit &U);
FuzzerSHA1.cpp 193 // Return pointer to hash (20 characters)
216 std::string Hash(const Unit &U) {
217 uint8_t Hash[kSHA1NumBytes];
218 ComputeSHA1(U.data(), U.size(), Hash);
219 return Sha1ToString(Hash);
FuzzerCorpus.h 167 bool HasUnit(const Unit &U) { return Hashes.count(Hash(U)); }
FuzzerTracePC.cpp 404 // These values are inserted into a bit-set-based hash map.
423 size_t Hash = 0; // Compute some simple hash of both strings.
428 Hash ^= (T << 8) | B2[i];
437 TORCW.Insert(Idx ^ Hash, Word(B1, Len), Word(B2, Len));
FuzzerLoop.cpp 589 std::string Path = DirPlusFile(Options.OutputCorpus, Hash(U));
598 std::string Path = Options.ArtifactPrefix + Prefix + Hash(U);
FuzzerDriver.cpp 413 : Options.ArtifactPrefix + "minimized-from-" + Hash(U);
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/tests/
FuzzerUnittest.cpp 105 TEST(Fuzzer, Hash) {
108 EXPECT_EQ("a9993e364706816aba3e25717850c26c9cd0d89d", fuzzer::Hash(U));
110 EXPECT_EQ("81fe8bfe87576c3ecb22426f8e57847382917acf", fuzzer::Hash(U));
  /src/sys/external/bsd/gnu-efi/dist/inc/
efiprot.h 741 // Hash Protocol
812 IN OUT EFI_HASH_OUTPUT *Hash);
816 EFI_HASH_HASH Hash;
  /src/usr.bin/make/
var.c 468 GNode_FindVar(GNode *scope, Substring varname, unsigned hash)
470 return HashTable_FindValueBySubstringHash(&scope->vars, varname, hash);
1847 * Compute the 32-bit hash of the given string, using the MurmurHash3
1851 Hash(const char *str)
2595 /* :hash */
2599 if (!ModMatch(*pp, "hash", ch))
2604 Expr_SetValueOwn(ch->expr, Hash(Expr_Str(ch->expr)));
  /src/sys/lib/libkern/arch/hppa/
milli.S 247 hta: .equ 25 ; Hash Table Address

Completed in 28 milliseconds