| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | StableHashing.h | 36 inline void stable_hash_append(stable_hash &Hash, const char Value) { in stable_hash_append() argument 37 Hash = Hash ^ (Value & 0xFF); in stable_hash_append() 38 Hash = Hash * FNV_PRIME_64; in stable_hash_append() 41 inline void stable_hash_append(stable_hash &Hash, stable_hash Value) { in stable_hash_append() argument 43 stable_hash_append(Hash, static_cast<char>(Value)); in stable_hash_append() 52 stable_hash Hash = hashing::detail::FNV_OFFSET_64; in stable_hash_combine() local 53 hashing::detail::stable_hash_append(Hash, A); in stable_hash_combine() 54 hashing::detail::stable_hash_append(Hash, B); in stable_hash_combine() 55 return Hash; in stable_hash_combine() 60 stable_hash Hash = hashing::detail::FNV_OFFSET_64; in stable_hash_combine() local [all …]
|
| /openbsd-src/gnu/usr.bin/perl/ext/Hash-Util-FieldHash/t/ |
| H A D | 01_load.t | 6 # see that Hash::Util::FieldHash and Hash::Util load and export what 10 use_ok( 'Hash::Util'); 11 ok( defined( &Hash::Util::lock_keys), "Hash::Util::lock_keys found"); 12 ok( !defined( &Hash::Util::FieldHash::fieldhashes), 13 "Hash::Util::FieldHash not loaded", 19 use Hash::Util qw( lock_keys); 21 ok( defined( &lock_keys), "lock_keys imported from Hash::Util"); 24 use Hash::Util qw( fieldhashes); 26 ok( defined( &Hash::Util::FieldHash::fieldhashes), 27 "Hash::Util::FieldHash loaded", [all …]
|
| H A D | 02_function.t | 7 use Hash::Util::FieldHash qw( :all); 8 my $ob_reg = Hash::Util::FieldHash::_ob_reg; 23 Hash::Util::FieldHash::_fieldhash \ %h, $fieldhash_mode; 35 Hash::Util::FieldHash::idhash my %h; 71 Hash::Util::FieldHash::_fieldhash $h, $fieldhash_mode; 85 Hash::Util::FieldHash::_fieldhash \ my( %h), $fieldhash_mode; 99 Hash::Util::FieldHash::_fieldhash \ %f, $fieldhash_mode; 100 Hash::Util::FieldHash::_fieldhash \ %g, $fieldhash_mode; 120 Hash::Util::FieldHash::_fieldhash \ %h, $fieldhash_mode; 131 Hash [all...] |
| /openbsd-src/gnu/llvm/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | Hash.cpp | 57 uint32_t Hash = 0xb170a1bf; in hashStringV2() local 65 Hash += Item; in hashStringV2() 66 Hash += (Hash << 10); in hashStringV2() 67 Hash ^= (Hash >> 6); in hashStringV2() 71 Hash += Item; in hashStringV2() 72 Hash += (Hash << 10); in hashStringV2() 73 Hash ^= (Hash >> 6); in hashStringV2() 76 return Hash * 1664525U + 1013904223U; in hashStringV2()
|
| /openbsd-src/gnu/usr.bin/perl/ext/XS-APItest/t/ |
| H A D | hash.t | 5 use Tie::Hash; 42 is (XS::APItest::Hash::store(\%h, chr 258, 1), $result); 59 XS::APItest::Hash::store($strtab, 'Boom!', 1) 77 is_deeply([&XS::APItest::Hash::test_hv_free_ent], [2,2,1,1], 79 is_deeply([&XS::APItest::Hash::test_hv_delayfree_ent], [2,2,2,1], 84 my $got = XS::APItest::Hash::test_share_unshare_pvn($in); 89 foreach ([\&XS::APItest::Hash::rot13_hash, \&rot13, "rot 13"], 90 [\&XS::APItest::Hash::bitflip_hash, \&bitflip, "bitflip"], 104 XS::APItest::Hash::bitflip_hash(\%hash); 158 is (XS::APItest::Hash::common({hv => \%hash, [all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | CachedHashString.h | 32 uint32_t Hash; variable 39 CachedHashStringRef(StringRef S, uint32_t Hash) in CachedHashStringRef() argument 40 : P(S.data()), Size(S.size()), Hash(Hash) { in CachedHashStringRef() 47 uint32_t hash() const { return Hash; } in hash() 77 uint32_t Hash; 91 : P(EmptyOrTombstonePtr), Size(0), Hash(0) { 104 CachedHashString(StringRef S, uint32_t Hash) 105 : P(new char[S.size()]), Size(S.size()), Hash(Hash) { 112 : Size(Other.Size), Hash(Other.Hash) { 127 : P(Other.P), Size(Other.Size), Hash(Other.Hash) { [all …]
|
| /openbsd-src/gnu/llvm/clang/lib/AST/ |
| H A D | ODRHash.cpp | 252 ODRHash &Hash; member in __anoncf944ab10111::ODRDeclVisitor 255 ODRDeclVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash) in ODRDeclVisitor() argument 256 : ID(ID), Hash(Hash) {} in ODRDeclVisitor() 259 Hash.AddBoolean(S); in AddStmt() 261 Hash.AddStmt(S); in AddStmt() 266 Hash.AddBoolean(II); in AddIdentifierInfo() 268 Hash.AddIdentifierInfo(II); in AddIdentifierInfo() 273 Hash.AddQualType(T); in AddQualType() 277 Hash.AddBoolean(D); in AddDecl() 279 Hash.AddDecl(D); in AddDecl() [all …]
|
| /openbsd-src/gnu/usr.bin/perl/t/re/ |
| H A D | reg_nc_tie.t | 58 is(Tie::Hash::NamedCapture::FETCH(undef, undef), undef, 'FETCH with undef'); 59 eval {Tie::Hash::NamedCapture::STORE(undef, undef, undef)}; 61 eval {Tie::Hash::NamedCapture::DELETE(undef, undef)}; 64 eval {Tie::Hash::NamedCapture::CLEAR(undef)}; 66 is(Tie::Hash::NamedCapture::EXISTS(undef, undef), undef, 'EXISTS with undef'); 67 is(Tie::Hash::NamedCapture::FIRSTKEY(undef), undef, 'FIRSTKEY with undef'); 68 is(Tie::Hash::NamedCapture::NEXTKEY(undef, undef), undef, 'NEXTKEY with undef'); 69 is(Tie::Hash::NamedCapture::SCALAR(undef), undef, 'SCALAR with undef'); 84 like($@, qr/Usage: Tie::Hash::NamedCapture::$method\(\Q$error\E\)/,
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/DebugInfo/CodeView/ |
| H A D | TypeHashing.h | 35 hash_code Hash; member 86 ::memcpy(Hash.data(), H.data(), 8); in GloballyHashedType() 88 std::array<uint8_t, 8> Hash; member 90 bool empty() const { return *(const uint64_t*)Hash.data() == 0; } in empty() 94 return L.Hash == R.Hash; 99 return !(L.Hash == R.Hash); 192 return Val.Hash; 197 if (LHS.Hash != RHS.Hash) 212 return *reinterpret_cast<const unsigned *>(Val.Hash.data()); 225 write_hex(Stream, V.Hash, HexPrintStyle::Upper, 8); [all …]
|
| /openbsd-src/lib/libcrypto/rsa/ |
| H A D | rsa_pss.c | 75 RSA_verify_PKCS1_PSS(RSA *rsa, const unsigned char *mHash, const EVP_MD *Hash, in RSA_verify_PKCS1_PSS() argument 78 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen); in RSA_verify_PKCS1_PSS() 84 const EVP_MD *Hash, const EVP_MD *mgf1Hash, const unsigned char *EM, in RSA_verify_PKCS1_PSS_mgf1() argument 99 mgf1Hash = Hash; in RSA_verify_PKCS1_PSS_mgf1() 101 hLen = EVP_MD_size(Hash); in RSA_verify_PKCS1_PSS_mgf1() 161 if (!EVP_DigestInit_ex(md_ctx, Hash, NULL) || in RSA_verify_PKCS1_PSS_mgf1() 188 const unsigned char *mHash, const EVP_MD *Hash, int sLen) in RSA_padding_add_PKCS1_PSS() argument 190 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen); in RSA_padding_add_PKCS1_PSS() 196 const unsigned char *mHash, const EVP_MD *Hash, const EVP_MD *mgf1Hash, in RSA_padding_add_PKCS1_PSS_mgf1() argument 209 mgf1Hash = Hash; in RSA_padding_add_PKCS1_PSS_mgf1() [all …]
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/scudo/standalone/ |
| H A D | stack_depot.h | 91 u32 Hash = B.get(); in insert() local 93 u32 Pos = Hash & TabMask; in insert() 96 u64 Id = (u64(End - Begin) << 33) | (u64(Hash) << 1) | 1; in insert() 98 return Hash; in insert() 109 return Hash; in insert() 115 bool find(u32 Hash, uptr *RingPosPtr, uptr *SizePtr) const { in find() argument 116 u32 Pos = Hash & TabMask; in find() 121 u64 HashWithTagBit = (u64(Hash) << 1) | 1; in find() 134 return B.get() == Hash; in find()
|
| /openbsd-src/gnu/llvm/llvm/lib/ObjectYAML/ |
| H A D | CodeViewYAMLTypeHashing.cpp | 37 ScalarTraits<BinaryRef>::output(GH.Hash, Ctx, OS); in output() 42 return ScalarTraits<BinaryRef>::input(Scalar, Ctx, GH.Hash); in input() 77 SmallString<8> Hash; in toDebugH() local 79 Hash.clear(); in toDebugH() 80 raw_svector_ostream OS(Hash); in toDebugH() 81 H.Hash.writeAsBinary(OS); in toDebugH() 82 assert((Hash.size() == 8) && "Invalid hash size!"); in toDebugH() 83 cantFail(Writer.writeFixedString(Hash)); in toDebugH()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.gb/ |
| H A D | scope11.C | 8 class Hash { 10 Hash (int); 22 operator Hash (); 25 IPAddress::operator Hash () in Hash() function 27 return Hash (_i); in Hash()
|
| /openbsd-src/gnu/usr.bin/perl/t/op/ |
| H A D | each.t | 68 require Hash::Util; 69 sub Hash::Util::num_buckets (\%); 71 my $size = Hash::Util::num_buckets(%h); 73 my $newsize = Hash::Util::num_buckets(%h); 76 $size = Hash::Util::num_buckets(%h); 79 $size = Hash::Util::num_buckets(%h); 83 $size = Hash::Util::num_buckets(%h); 114 require Hash::Util; 115 sub Hash::Util::num_buckets (\%); 117 my $size = Hash::Util::num_buckets(%hash); [all …]
|
| /openbsd-src/gnu/usr.bin/perl/ext/Hash-Util-FieldHash/lib/Hash/Util/ |
| H A D | FieldHash.pm | 1 package Hash::Util::FieldHash; 34 return $_ if Hash::Util::FieldHash::_fieldhash( $_, 0); 35 return $_ if Hash::Util::FieldHash::_fieldhash( $_, 2) == 2; 43 return $_ if Hash::Util::FieldHash::_fieldhash( $_, 0); 44 return $_ if Hash::Util::FieldHash::_fieldhash( $_, 1) == 1; 57 Hash::Util::FieldHash - Support for Inside-Out Classes 62 use Hash::Util qw(fieldhash fieldhashes); 73 use Hash::Util::FieldHash qw(idhash register); 82 use Hash::Util::FieldHash qw(id register); 92 C<Hash [all...] |
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfileProbe.cpp | 53 uint64_t Hash = 0; in getCallStackHash() local 56 Hash ^= MD5Hash(std::to_string(InlinedAt->getLine())); in getCallStackHash() 57 Hash ^= MD5Hash(std::to_string(InlinedAt->getColumn())); in getCallStackHash() 63 Hash ^= MD5Hash(Name); in getCallStackHash() 66 return Hash; in getCallStackHash() 141 uint64_t Hash = computeCallStackHash(I); in collectProbeFactors() local 142 ProbeFactors[{Probe->Id, Hash}] += Probe->Factor; in collectProbeFactors() 178 auto Hash = in PseudoProbeManager() local 180 GUIDToProbeDescMap.try_emplace(GUID, PseudoProbeDescriptor(GUID, Hash)); in PseudoProbeManager() 370 auto Hash = getFunctionHash(); in instrumentOneFunc() local [all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/BinaryFormat/ |
| H A D | WasmTraits.h | 73 unsigned Hash = hash_value(Limits.Flags); 74 Hash = hash_combine(Hash, Limits.Minimum); 76 Hash = hash_combine(Hash, Limits.Maximum); 78 return Hash;
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 249 for (const auto &Hash : Bucket) { in emitHashes() local 250 uint32_t HashValue = Hash->HashValue; in emitHashes() 265 for (auto *Hash : Buckets[i]) { in emitOffsets() local 266 uint32_t HashValue = Hash->HashValue; in emitOffsets() 271 Asm->emitLabelDifference(Hash->Sym, Base, Asm->getDwarfOffsetByteSize()); in emitOffsets() 330 for (const auto &Hash : Bucket) { in emitData() local 334 PrevHash != Hash->HashValue) in emitData() 337 Asm->OutStreamer->emitLabel(Hash->Sym); in emitData() 338 Asm->OutStreamer->AddComment(Hash->Name.getString()); in emitData() 339 Asm->emitDwarfStringOffset(Hash->Name); in emitData() [all …]
|
| H A D | ByteStreamer.h | 71 DIEHash &Hash; 73 HashingByteStreamer(DIEHash &H) : Hash(H) {} in HashingByteStreamer() 75 Hash.update(Byte); in emitInt8() 78 Hash.addSLEB128(DWord); in emitSLEB128() 82 Hash.addULEB128(DWord); in emitULEB128() 85 Hash.hashRawTypeReference(D); in emitDIERef()
|
| H A D | DIEHash.cpp | 44 Hash.update(Str); in addString() 45 Hash.update(ArrayRef((uint8_t)'\0')); in addString() 59 Hash.update(Byte); in addULEB128() 73 Hash.update(Byte); in addSLEB128() 233 Hash.update((uint64_t)V.getDIEInteger().getValue()); in hashBlockData() 392 Hash.update(ArrayRef((uint8_t)'\0')); in computeHash() 404 Hash.update(DWOName); in computeCUSignature() 410 Hash.final(Result); in computeCUSignature() 434 Hash.final(Result); in computeTypeSignature()
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/ubsan/ |
| H A D | ubsan_type_hash_itanium.cpp | 223 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) { in checkDynamicType() argument 228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() 229 if (*Bucket == Hash) { in checkDynamicType() 230 __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] = Hash; in checkDynamicType() 254 __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] = Hash; in checkDynamicType() 255 *Bucket = Hash; in checkDynamicType()
|
| /openbsd-src/gnu/usr.bin/binutils-2.17/bfd/doc/ |
| H A D | hash.texi | 1 @section Hash Tables 2 @cindex Hash tables 13 with the string. Hash tables were implemented in this way, 23 * Creating and Freeing a Hash Table:: 25 * Traversing a Hash Table:: 26 * Deriving a New Hash Table Type:: 29 @node Creating and Freeing a Hash Table, Looking Up or Entering a String, Hash Tables, Hash Tables 45 a New Hash Table Type}, for why you would want to use a 62 …node Looking Up or Entering a String, Traversing a Hash Table, Creating and Freeing a Hash Table, … 89 @node Traversing a Hash Table, Deriving a New Hash Table Type, Looking Up or Entering a String, Has… [all …]
|
| /openbsd-src/gnu/usr.bin/binutils/bfd/doc/ |
| H A D | hash.texi | 1 @section Hash Tables 2 @cindex Hash tables 13 with the string. Hash tables were implemented in this way, 23 * Creating and Freeing a Hash Table:: 25 * Traversing a Hash Table:: 26 * Deriving a New Hash Table Type:: 29 @node Creating and Freeing a Hash Table, Looking Up or Entering a String, Hash Tables, Hash Tables 45 a New Hash Table Type}, for why you would want to use a 58 …node Looking Up or Entering a String, Traversing a Hash Table, Creating and Freeing a Hash Table, … 85 @node Traversing a Hash Table, Deriving a New Hash Table Type, Looking Up or Entering a String, Has… [all …]
|
| /openbsd-src/gnu/llvm/llvm/tools/obj2yaml/ |
| H A D | dxcontainer2yaml.cpp | 32 Obj->Header.Hash.push_back(Byte); in dumpDXContainer() 71 std::optional<dxbc::ShaderHash> Hash = Container.getShaderHash(); in dumpDXContainer() local 72 if (Hash && Hash->isPopulated()) in dumpDXContainer() 73 NewPart.Hash = DXContainerYAML::ShaderHash(*Hash); in dumpDXContainer()
|
| /openbsd-src/gnu/llvm/llvm/lib/IR/ |
| H A D | StructuralHash.cpp | 25 uint64_t Hash = 0x6acaa36bef8325c5ULL; member in details::StructuralHash 27 void update(uint64_t V) { Hash = hashing::detail::hash_16_bytes(Hash, V); } in update() 64 uint64_t getHash() const { return Hash; } in getHash()
|