Searched refs:hashing (Results 1 – 25 of 47) sorted by relevance
12
23 size_t llvm::hashing::detail::fixed_seed_override = 0;28 hashing::detail::fixed_seed_override = fixed_value; in set_fixed_execution_hash_seed()
142 namespace hashing {481 return ::llvm::hashing::detail::hash_combine_range_impl(first, last);486 namespace hashing {604 ::llvm::hashing::detail::hash_combine_recursive_helper helper;610 namespace hashing {634 return ::llvm::hashing::detail::hash_integer_value(641 return ::llvm::hashing::detail::hash_integer_value(
1 Like MARK, i.e. set the fwmark, but the mark is calculated from hashing4 and used to calculate the hashing.
11 Specify the hashing mode. Has to be one of
4 ; This test exercises MDNode hashing. For the nodes to be correctly uniqued,
13 module also provides such disk-based string-to-string mappings based on hashing,
160 hashing. Naive algorithms such as ``sha1(password)`` are not resistant against161 brute-force attacks. A good password hashing function must be tunable, slow, and
86 Links from NIST to various information on secure hashing.
97 @Benchmark byte hashing(int reps) { in hashing() method in MessageDigestAlgorithmBenchmark
1 // Test checking that we're hashing a system version file in the
274 bt2 d * 9.5 + 4MB Binary Tree with 2 bytes hashing.275 bt3 d * 11.5 + 4MB Binary Tree with 3 bytes hashing.276 bt4 d * 11.5 + 4MB Binary Tree with 4 bytes hashing.277 hc4 d * 7.5 + 4MB Hash Chain with 4 bytes hashing.
131 F0 - Ciphers without hashing algo
98 - very very slight tuning of the hashing function.
66 // Number of buckets used for hashing charactergrams.
41 namespace hashing { namespace
262 %"struct.llvm::hashing::detail::hash_combine_recursive_helper" = type { [64 x i8], %"struct.llvm::h…263 %"struct.llvm::hashing::detail::hash_state" = type { i64, i64, i64, i64, i64, i64, i64, i64 }
138 introduce hashing and other helpers, but it is still just an optimization, and147 them in special hash-table. Functions with equal hash are equal. Good hashing150 Lookup-up time would be small, but such approach adds some delay due to hashing165 cases total "hashing" time was greater than total "logarithmical-search" time.
256 # (hashing) which gcc turns into a multiply by 33818641 and
108 1. OpenSSL deals with run-time relocations by not hashing parts of the module's data.
428 ``CallSiteTypeId`` hashing will result in weaker CFI checks that would
362 r6341 r6424 Vfd n-i-bz ExeContext hashing fix
182 using the string hashing feature (see `hash` attribute in the
558 Its purpose is to allow repeatable hashing, such as for selftests for the