Home
last modified time | relevance | path

Searched full:hash (Results 1 – 25 of 2375) sorted by relevance

12345678910>>...95

/llvm-project/llvm/utils/git/
H A Drequirements.txt8 --hash=sha256:922820b53db7a7257ffbda3f597266d435245903d80737e34f8a45ff3e3230d8 \
9 --hash=sha256:bec941d2aa8195e248a60b31ff9f0558284cf01a52591ceda73ea9afffd69fd9
14 --hash=sha256:045d61c734659cc045141be4bae381a41d89b741f795af1dd018bfb532fd0df8 \
15 --hash=sha256:0984a4925a435b1da406122d4d7968dd861c1385afe3b45ba82b750f229811e2 \
16 --hash=sha256:0e2b1fac190ae3ebfe37b979cc1ce69c81f4e4fe5746bb401dca63a9062cdaf1 \
17 --hash=sha256:0f048dcf80db46f0098ccac01132761580d28e28bc0f78ae0d58048063317e15 \
18 --hash=sha256:1257bdabf294dceb59f5e70c64a3e2f462c30c7ad68092d01bbbfb1c16b1ba36 \
19 --hash=sha256:1c39c6016c32bc48dd54561950ebd6836e1670f2ae46128f67cf49e789c52824 \
20 --hash=sha256:1d599671f396c4723d016dbddb72fe8e0397082b0a77a4fab8028923bec050e8 \
21 --hash
[all...]
/llvm-project/llvm/docs/
H A Drequirements-hashed.txt8 --hash=sha256:1ee19aca801bbabb5ba3f5f258e4422dfa86f82f3e9cefb0859b283cdd7f62a3 \
9 --hash=sha256:a27a4a084d5e690e16e01e03ad2b2e552c61a65469419b907243193de1a84ae2
12 --hash=sha256:6919867db036398ba21eb5c7a0f6b28ab8cbc3ae7a73a44ebe34ae74a4e7d363 \
13 --hash=sha256:efb1a25b7118e67ce3a259bed20545c29cb68be8ad2c784c83689981b7a57287
16 --hash=sha256:492bbc69dca35d12daac71c4db1bfff0c876c00ef4a2ffacce226d4638eb72da \
17 --hash=sha256:bd2520ca0d9d7d12694a53d44ac482d181b4ec1888909b035a3dbf40d0f57d4a
20 --hash=sha256:9b469f3a900bf28dc19b8cfbf8019bf47f7fdd1a65a1d4ffb98fc14166beb4d1 \
21 --hash=sha256:e036ab49d5b79556f99cfc2d9320b34cfbe5be05c5871b51de9329f0603b0474
24 --hash=sha256:06435b539f889b1f6f4ac1758871aae42dc3a8c0e24ac9e60c2384973ad73027 \
25 --hash
[all...]
/llvm-project/llvm/test/tools/llvm-readobj/ELF/
H A Dhash-symbols.test1 ## Check llvm-readelf is able to dump the content of hash sections correctly.
3 ## Check the output when both .hash and .gnu.hash sections are present.
6 # RUN: llvm-readelf --hash-symbols %t1-32.so \
7 # RUN: | FileCheck %s --strict-whitespace --match-full-lines --check-prefix HASH-32
10 # RUN: llvm-readelf --hash-symbols %t1-64.so | FileCheck %s --check-prefix HASH-64
12 # HASH-32: Symbol table of .hash for image:
13 # HASH-32-NEXT: Num Buc: Value Size Type Bind Vis Ndx Name
14 # HASH-32-NEXT: 1 0: 00000000 0 NOTYPE GLOBAL DEFAULT UND ccc
15 # HASH-32-NEXT: 5 0: 00001001 0 NOTYPE WEAK DEFAULT 1 bbb
16 # HASH-32-NEXT: 3 0: 00000001 0 NOTYPE GLOBAL DEFAULT ABS ddd
[all …]
H A Dhash-table.test1 ## Check how the SHT_HASH section is dumped with --hash-table.
6 # RUN: llvm-readobj --hash-table %t.x64 | FileCheck %s --check-prefix=HASH
7 # RUN: llvm-readelf --hash-table %t.x64 | FileCheck %s --check-prefix=HASH
9 # RUN: llvm-readobj --hash-table %t.x32 | FileCheck %s --check-prefix=HASH
10 # RUN: llvm-readelf --hash-table %t.x32 | FileCheck %s --check-prefix=HASH
12 # HASH: HashTable {
13 # HASH-NEXT: Num Buckets: 2
14 # HASH-NEXT: Num Chains: 3
15 # HASH-NEXT: Buckets: [1, 2]
16 # HASH-NEXT: Chains: [3, 4, 5]
[all …]
H A Dhash-histogram.test1 ## Here we test the --elf-hash-histogram command line option.
3 ## This test case checks how we built histograms for hash sections.
6 # RUN: llvm-readelf --elf-hash-histogram %t1-32.o | FileCheck %s --check-prefix=HIST
13 # RUN: llvm-readelf --elf-hash-histogram %t1-64.o | FileCheck %s --check-prefix=HIST
16 # RUN: llvm-readobj --elf-hash-histogram %t1-32.o | FileCheck %s --check-prefix=LLVM-HIST
17 # RUN: llvm-readobj --elf-hash-histogram %t1-64.o | FileCheck %s --check-prefix=LLVM-HIST
25 # HIST-NEXT: Histogram for `.gnu.hash' bucket list length (total of 3 buckets)
98 - Name: .hash
103 - Name: .gnu.hash
119 ## sizeof(.hash) == 0x28.
[all …]
H A Dgnuhash.test1 ## Check how the GNU Hash section is dumped with --gnu-hash-table.
6 # RUN: llvm-readobj --gnu-hash-table %t.x64 | FileCheck %s
7 # RUN: llvm-readelf --gnu-hash-table %t.x64 | FileCheck %s
9 # RUN: llvm-readobj --gnu-hash-table %t.x32 | FileCheck %s
10 # RUN: llvm-readelf --gnu-hash-table %t.x32 | FileCheck %s
28 - Name: .gnu.hash
36 ## The number of hash buckets. The value of 3 is no-op.
62 FirstSec: .gnu.hash
68 # RUN: llvm-readobj --gnu-hash-table %t.nodynsym 2>&1 | FileCheck %s -DFILE=%t.nodynsym --check-pre…
69 # RUN: llvm-readelf --gnu-hash-table %t.nodynsym 2>&1 | FileCheck %s -DFILE=%t.nodynsym --check-pre…
[all …]
/llvm-project/libcxx/test/support/
H A Dpoisoned_hash_helper.h22 template <class Hash, class Key, class Res = decltype(std::declval<Hash&>()(std::declval<Key>()))>
30 template <class Hash, class Key>
32 return can_hash_impl<Hash, Key>(0);
49 // Test that the specified Hash meets the requirements of an enabled hash
50 template <class Key, class Hash = std::hash<Key>>
52 static_assert(std::is_destructible<Hash>::value, "");
54 // Enabled hash requirement
[all...]
H A Ddeduction_guides_sfinae_checks.h271 // - a bad hash functor (an integral type in place of a hash);
272 // - an allocator in place of a hash functor;
279 using Hash = std::hash<int>; in UnorderedContainerDeductionGuidesSfinaeAway() local
307 // (iter, iter, buckets, hash) in UnorderedContainerDeductionGuidesSfinaeAway()
309 // Cannot deduce from (BAD_iter, BAD_iter, buckets, hash) in UnorderedContainerDeductionGuidesSfinaeAway()
310 static_assert(SFINAEs_away<Container, BadIter, BadIter, std::size_t, Hash>); in UnorderedContainerDeductionGuidesSfinaeAway()
312 SFINAEs_away<Container, OutputIter, OutputIter, std::size_t, Hash>); in UnorderedContainerDeductionGuidesSfinaeAway()
318 // (iter, iter, buckets, hash, pred) in UnorderedContainerDeductionGuidesSfinaeAway()
320 // Cannot deduce from (BAD_iter, BAD_iter, buckets, hash, pred) in UnorderedContainerDeductionGuidesSfinaeAway()
321 static_assert(SFINAEs_away<Container, BadIter, BadIter, std::size_t, Hash, Pred>); in UnorderedContainerDeductionGuidesSfinaeAway()
[all …]
/llvm-project/lld/test/ELF/linkerscript/
H A Ddiscard-gnu-hash.s4 # RUN: ld.lld --hash-style both -shared -o %t %t.o
6 # CHECK: .gnu.hash
7 # CHECK: .hash
10 # CHECK: (HASH)
12 # RUN: echo "SECTIONS { /DISCARD/ : { *(.hash) } }" > %t.script
13 # RUN: ld.lld --hash-style both -shared -o %t -T %t.script %t.o
14 # RUN: llvm-readelf -S -d %t | FileCheck %s --check-prefix=HASH
15 # HASH-NOT: .hash
16 # HASH: .gnu.hash
17 # HASH-NOT: .hash
[all …]
/llvm-project/clang/test/Profile/Inputs/
H A Dcxx-hash-v2.proftext2 # Func Hash:
11 # Func Hash:
20 # Func Hash:
29 # Func Hash:
38 # Func Hash:
48 # Func Hash:
60 # Func Hash:
72 # Func Hash:
81 # Func Hash:
91 # Func Hash:
[all …]
/llvm-project/llvm/include/llvm/ADT/
H A DStableHashing.h26 /// An opaque object representing a stable hash code. It can be serialized,
67 // Generates a consistent hash value for a given input name across different in stable_hash_combine()
70 // computes a hash of this stable name. For instance, `foo.llvm.1234` would have in stable_hash_combine()
71 // the same hash as `foo.llvm.5678. in stable_hash_combine()
36 stable_hash_append(stable_hash & Hash,const char Value) stable_hash_append() argument
41 stable_hash_append(stable_hash & Hash,stable_hash Value) stable_hash_append() argument
52 stable_hash Hash = hashing::detail::FNV_OFFSET_64; stable_hash_combine() local
60 stable_hash Hash = hashing::detail::FNV_OFFSET_64; stable_hash_combine() local
69 stable_hash Hash = hashing::detail::FNV_OFFSET_64; stable_hash_combine() local
86 stable_hash Hash = hashing::detail::FNV_OFFSET_64; stable_hash_combine_range() local
93 stable_hash Hash = hashing::detail::FNV_OFFSET_64; stable_hash_combine_array() local
104 stable_hash Hash = hashing::detail::FNV_OFFSET_64; stable_hash_combine_string() local
H A DCachedHashString.h11 /// owning and not-owning string types that store their hash in addition to
28 /// A container which contains a StringRef plus a precomputed hash.
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() function
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!");
60 return S.hash();
64 return LHS.hash() == RHS.hash() &&
[all …]
/llvm-project/llvm/test/tools/llvm-cov/Inputs/
H A Dmcdc-const-folding.proftext2 # Func Hash:
17 # Func Hash:
32 # Func Hash:
47 # Func Hash:
62 # Func Hash:
77 # Func Hash:
92 # Func Hash:
107 # Func Hash:
122 # Func Hash:
139 # Func Hash:
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/
H A Ddeduct.pass.cpp14 // class Hash = hash<iter-value-type<InputIterator>>,
18 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
20 // Hash, Pred, Allocator>;
22 // template<class T, class Hash = hash<T>,
25 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
26 // -> unordered_set<T, Hash, Pred, Allocator>;
31 // hash<iter-value-type<InputIterator>>,
35 // template<class InputIterator, class Hash, class Allocator>
37 // Hash, Allocator)
38 // -> unordered_set<iter-value-type<InputIterator>, Hash,
[all …]
H A Ddeduct.verify.cpp14 // class Hash = hash<iter-value-type<InputIterator>>,
18 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
20 // Hash, Pred, Allocator>;
22 // template<class T, class Hash = hash<T>,
25 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
26 // -> unordered_set<T, Hash, Pred, Allocator>;
31 // hash<iter-value-type<InputIterator>>,
35 // template<class InputIterator, class Hash, class Allocator>
37 // Hash, Allocator)
38 // -> unordered_set<iter-value-type<InputIterator>, Hash,
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Ddeduct.pass.cpp14 // class Hash = hash<iter-value-type<InputIterator>>,
18 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
20 // Hash, Pred, Allocator>;
22 // template<class T, class Hash = hash<T>,
25 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
26 // -> unordered_multiset<T, Hash, Pred, Allocator>;
31 // hash<iter-value-type<InputIterator>>,
35 // template<class InputIterator, class Hash, class Allocator>
37 // Hash, Allocator)
38 // -> unordered_multiset<iter-value-type<InputIterator>, Hash,
[all …]
H A Ddeduct.verify.cpp14 // class Hash = hash<iter-value-type<InputIterator>>,
18 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
20 // Hash, Pred, Allocator>;
22 // template<class T, class Hash = hash<T>,
25 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
26 // -> unordered_multiset<T, Hash, Pred, Allocator>;
31 // hash<iter-value-type<InputIterator>>,
35 // template<class InputIterator, class Hash, class Allocator>
37 // Hash, Allocator)
38 // -> unordered_multiset<iter-value-type<InputIterator>, Hash,
[all …]
/llvm-project/llvm/test/Bitcode/
H A Dmodule_hash.ll1 ; Check per module hash.
2 ; RUN: opt -module-hash %s -o - | llvm-bcanalyzer -dump -check-hash=foo | FileCheck %s --check-pr…
3 ; MOD1: <HASH op0={{[0-9]*}} op1={{[0-9]*}} op2={{[0-9]*}} op3={{[0-9]*}} op4={{[0-9]*}} (match)/>
4 ; RUN: opt -module-hash %p/Inputs/module_hash.ll -o - | llvm-bcanalyzer -dump -check-hash=bar | F…
5 ; MOD2: <HASH op0={{[0-9]*}} op1={{[0-9]*}} op2={{[0-9]*}} op3={{[0-9]*}} op4={{[0-9]*}} (match)/>
7 ; Check that the hash matches in the combined index.
10 ; RUN: opt -module-hash -module-summary %s -o %t.m1.bc
11 ; RUN: opt -module-hash -module-summary %p/Inputs/module_hash.ll -o %t.m2.bc
14 ; RUN: llvm-bcanalyzer -dump %t.m1.bc | grep '<HASH' > %t.hash
15 ; RUN: llvm-bcanalyzer -dump %t.m2.bc | grep '<HASH' >> %t.hash
[all …]
/llvm-project/llvm/test/Transforms/PGOProfile/Inputs/
H A Dcspgo.proftext4 # Func Hash:
13 # Func Hash:
22 # Func Hash:
30 # Func Hash:
38 # Func Hash:
47 # Func Hash:
56 # Func Hash:
73 # Func Hash:
82 # Func Hash:
94 # Func Hash:
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
H A Ddeduct.pass.cpp13 // class Hash = hash<iter-key-type<InputIterator>>,
17 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
18 // -> unordered_map<iter-key-type<InputIterator>, iter-mapped-type<InputIterator>, Hash, Pred,
21 // template<class Key, class T, class Hash = hash<Key>,
24 // typename see below::size_type = see below, Hash = Hash(),
26 // -> unordered_map<Key, T, Hash, Pred, Allocator>;
31 // hash<iter-key-type<InputIterator>>,
37 // hash<iter-key-type<InputIterator>>,
40 // template<class InputIterator, class Hash, class Allocator>
41 // unordered_map(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
[all …]
H A Ddeduct.verify.cpp14 // class Hash = hash<iter-key-type<InputIterator>>,
18 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
19 // -> unordered_map<iter-key-type<InputIterator>, iter-mapped-type<InputIterator>, Hash, Pred,
22 // template<class Key, class T, class Hash = hash<Key>,
25 // typename see below::size_type = see below, Hash = Hash(),
27 // -> unordered_map<Key, T, Hash, Pred, Allocator>;
32 // hash<iter-key-type<InputIterator>>,
38 // hash<iter-key-type<InputIterator>>,
41 // template<class InputIterator, class Hash, class Allocator>
42 // unordered_map(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
H A Ddeduct.pass.cpp13 // class Hash = hash<iter-key-type<InputIterator>>,
17 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
18 // -> unordered_multimap<iter-key-type<InputIterator>, iter-mapped-type<InputIterator>, Hash, Pre…
21 // template<class Key, class T, class Hash = hash<Key>,
24 // typename see below::size_type = see below, Hash = Hash(),
26 // -> unordered_multimap<Key, T, Hash, Pred, Allocator>;
31 // hash<iter-key-type<InputIterator>>,
37 // hash<iter-key-type<InputIterator>>,
40 // template<class InputIterator, class Hash, class Allocator>
41 // unordered_multimap(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
[all …]
H A Ddeduct.verify.cpp14 // class Hash = hash<iter-key-type<InputIterator>>,
18 // Hash = Hash(), Pred = Pred(), Allocator = Allocator())
19 // -> unordered_multimap<iter-key-type<InputIterator>, iter-mapped-type<InputIterator>, Hash, Pre…
22 // template<class Key, class T, class Hash = hash<Key>,
25 // typename see below::size_type = see below, Hash = Hash(),
27 // -> unordered_multimap<Key, T, Hash, Pred, Allocator>;
32 // hash<iter-key-type<InputIterator>>,
38 // hash<iter-key-type<InputIterator>>,
41 // template<class InputIterator, class Hash, class Allocator>
42 // unordered_multimap(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
[all …]
/llvm-project/compiler-rt/test/fuzzer/
H A DSimpleHashTest.cpp17 uint32_t Hash = 0x12039854; in simple_hash() local
19 Hash += Data[i]; in simple_hash()
20 Hash += (Hash << 10); in simple_hash()
21 Hash ^= (Hash >> 6); in simple_hash()
23 Hash += (Hash << 3); in simple_hash()
24 Hash ^= (Hash >> 11); in simple_hash()
25 Hash += (Hash << 15); in simple_hash()
26 return Hash; in simple_hash()
33 uint32_t Hash = simple_hash(&Data[0], Size - 4); in LLVMFuzzerTestOneInput() local
35 if (Hash != Want) in LLVMFuzzerTestOneInput()
[all …]
/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DHash.cpp1 //===- Hash.cpp - PDB Hash Functions --------------------------------------===//
9 #include "llvm/DebugInfo/PDB/Native/Hash.h"
19 // Used for name hash table and TPI/IPI hashes.
33 // Maximum of 3 bytes left. Hash a 2 byte word if possible, then hash the in hashStringV1()
42 // hash possible odd byte in hashStringV1()
55 // Used for name hash table.
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()
[all …]

12345678910>>...95