Home
last modified time | relevance | path

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

12345678910>>...208

/third_party/rust/crates/syn/src/gen/
Dhash.rs7 use std::hash::{Hash, Hasher};
10 impl Hash for Abi {
11 fn hash<H>(&self, state: &mut H) in hash() method
15 self.name.hash(state); in hash()
20 impl Hash for AngleBracketedGenericArguments {
21 fn hash<H>(&self, state: &mut H) in hash() method
25 self.colon2_token.hash(state); in hash()
26 self.args.hash(state); in hash()
31 impl Hash for Arm {
32 fn hash<H>(&self, state: &mut H) in hash() method
[all …]
/third_party/node/deps/v8/bazel/
Drequirements.txt8 --hash=sha256:077ce6014f7b40d03b47d1f1ca4b0fc8328a692bd284016f806ed0eaca390ad8 \
9 --hash=sha256:611bb273cd68f3b993fabdc4064fc858c5b47a973cb5aa7999ec1ba405c87cd7
12 --hash=sha256:01a9b8ea66f1658938f65b93a85ebe8bc016e6769611be228d797c9d998dd298 \
13 --hash=sha256:023cb26ec21ece8dc3907c0e8320058b2e0cb3c55cf9564da612bc325bed5e64 \
14 --hash=sha256:0446679737af14f45767963a1a9ef7620189912317d095f2d9ffa183a4d25d2b \
15 --hash=sha256:04635854b943835a6ea959e948d19dcd311762c5c0c6e1f0e16ee57022669194 \
16 --hash=sha256:0717a7390a68be14b8c793ba258e075c6f4ca819f15edfc2a3a027c823718567 \
17 --hash=sha256:0955295dd5eec6cb6cc2fe1698f4c6d84af2e92de33fbcac4111913cd100a6ff \
18 --hash=sha256:0d4b31cc67ab36e3392bbf3862cfbadac3db12bdd8b02a2731f509ed5b829724 \
19 --hash=sha256:10f82115e21dc0dfec9ab5c0223652f7197feb168c940f3ef61563fc2d6beb74 \
[all …]
/third_party/mbedtls/tests/suites/
Dtest_suite_psa_crypto_hash.data1 PSA hash finish: SHA-1 Test Vector NIST CAVS #1
5 PSA hash finish: SHA-1 Test Vector NIST CAVS #2
9 PSA hash finish: SHA-1 Test Vector NIST CAVS #3
13 PSA hash finish: SHA-1 Test Vector NIST CAVS #4
17 PSA hash finish: SHA-1 Test Vector NIST CAVS #5
21 PSA hash finish: SHA-1 Test Vector NIST CAVS #6
25 PSA hash finish: SHA-1 Test Vector NIST CAVS #7
29 PSA hash finish: SHA-1 Test Vector NIST CAVS #8
33 PSA hash finish: SHA-1 Test Vector NIST CAVS #9
37 PSA hash finish: SHA-1 Test Vector NIST CAVS #10
[all …]
Dtest_suite_ecdsa.function80 data_t *hash, char *r_str, char *s_str,
116 TEST_ASSERT(mbedtls_ecdsa_sign(&grp, &r, &s, &d, hash->x, hash->len,
125 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len,
129 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len,
136 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len, &Q,
138 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len, &Q,
140 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len, &Q,
146 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len, &Q,
148 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len, &Q,
150 TEST_EQUAL(mbedtls_ecdsa_verify(&grp, hash->x, hash->len, &Q,
[all …]
/third_party/libabigail/src/
Dabg-hash.cc13 #include "abg-hash.h"
48 /// Compute a stable string hash.
50 /// std::hash has no portability or stability guarantees so is
60 /// @param str the string to hash.
62 /// @return an unsigned 32 bit hash value.
68 uint32_t hash = offset_basis; in fnv_hash() local
72 hash = hash ^ byte; in fnv_hash()
73 hash = hash * prime; in fnv_hash()
75 return hash; in fnv_hash()
89 /// Hash function for an instance of @ref type_base.
[all …]
/third_party/mesa3d/src/compiler/nir/
Dnir_instr_set.c86 #define HASH(hash, data) XXH32(&(data), sizeof(data), hash) argument
89 hash_src(uint32_t hash, const nir_src *src) in hash_src() argument
92 hash = HASH(hash, src->ssa); in hash_src()
93 return hash; in hash_src()
97 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components) in hash_alu_src() argument
99 hash = HASH(hash, src->abs); in hash_alu_src()
100 hash = HASH(hash, src->negate); in hash_alu_src()
103 hash = HASH(hash, src->swizzle[i]); in hash_alu_src()
105 hash = hash_src(hash, &src->src); in hash_alu_src()
106 return hash; in hash_alu_src()
[all …]
/third_party/typescript/tests/baselines/reference/
DtaggedPrimitiveNarrowing.types2 type Hash = string & { __hash: true };
3 >Hash : string & { __hash: true; }
7 function getHashLength(hash: Hash): number {
8 >getHashLength : (hash: Hash) => number
9 >hash : Hash
11 if (typeof hash !== "string") {
12 >typeof hash !== "string" : boolean
13 >typeof hash : "string" | "number" | "bigint" | "boolean" | "symbol" | "undefined" | "object" | "fu…
14 >hash : Hash
17 throw new Error("This doesn't look like a hash");
[all …]
DtaggedPrimitiveNarrowing.symbols2 type Hash = string & { __hash: true };
3 >Hash : Symbol(Hash, Decl(taggedPrimitiveNarrowing.ts, 0, 0))
6 function getHashLength(hash: Hash): number {
8 >hash : Symbol(hash, Decl(taggedPrimitiveNarrowing.ts, 2, 23))
9 >Hash : Symbol(Hash, Decl(taggedPrimitiveNarrowing.ts, 0, 0))
11 if (typeof hash !== "string") {
12 >hash : Symbol(hash, Decl(taggedPrimitiveNarrowing.ts, 2, 23))
14 throw new Error("This doesn't look like a hash");
17 return hash.length;
18 >hash.length : Symbol(String.length, Decl(lib.es5.d.ts, --, --))
[all …]
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/
Dcso_hash.c77 cso_hash_create_node(struct cso_hash *hash, in cso_hash_create_node() argument
91 ++hash->size; in cso_hash_create_node()
95 static void cso_data_rehash(struct cso_hash *hash, int hint) in cso_data_rehash() argument
101 hash->userNumBits = (short)hint; in cso_data_rehash()
102 while (primeForNumBits(hint) < (hash->size >> 1)) in cso_data_rehash()
108 if (hash->numBits != hint) { in cso_data_rehash()
109 struct cso_node *e = (struct cso_node *)hash; in cso_data_rehash()
110 struct cso_node **oldBuckets = hash->buckets; in cso_data_rehash()
111 int oldNumBuckets = hash->numBuckets; in cso_data_rehash()
114 hash->numBits = (short)hint; in cso_data_rehash()
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
Dhash_function_defaults_test.cc46 TEST(Hash, Int32) { in TEST() argument
47 hash_default_hash<int32_t> hash; in TEST() local
48 auto h = hash(1); in TEST()
49 EXPECT_EQ(h, hash(1u)); in TEST()
50 EXPECT_EQ(h, hash(char{1})); in TEST()
51 EXPECT_EQ(h, hash(true)); in TEST()
52 EXPECT_EQ(h, hash(double{1.1})); in TEST()
53 EXPECT_NE(h, hash(2u)); in TEST()
54 EXPECT_NE(h, hash(char{2})); in TEST()
55 EXPECT_NE(h, hash(false)); in TEST()
[all …]
/third_party/vk-gl-cts/framework/delibs/depool/
DdePoolHash.h23 * \brief Memory pool hash class.
45 * \brief Declare a template pool hash class interface.
46 * \param TYPENAME Type name of the declared hash.
50 * This macro declares the interface for a hash. For the implementation of
51 * the hash, see DE_IMPLEMENT_POOL_HASH. Usually this macro is put into the
56 * The functions for operating the hash are:
60 * Hash* Hash_create (deMemPool* pool);
61 * int Hash_getNumElements (const Hash* hash);
62 * Value* Hash_find (Hash* hash, Key key);
63 * deBool Hash_insert (Hash* hash, Key key, Value value);
[all …]
/third_party/icu/icu4c/source/test/cintltst/
Dchashtst.c34 static void _put(UHashtable* hash,
39 static void _get(UHashtable* hash,
43 static void _remove(UHashtable* hash,
109 UHashtable *hash; in TestBasic() local
111 hash = uhash_open(hashChars, isEqualChars, NULL, &status); in TestBasic()
114 u_errorName(status), hash); in TestBasic()
117 if (hash == NULL) { in TestBasic()
121 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); in TestBasic()
123 _put(hash, one, 1, 0); in TestBasic()
124 _put(hash, omega, 24, 0); in TestBasic()
[all …]
/third_party/mesa3d/src/panfrost/bifrost/
Dbi_opt_cse.c37 HASH(uint32_t hash, unsigned data) in HASH() argument
39 return XXH32(&data, sizeof(data), hash); in HASH()
43 hash_index(uint32_t hash, bi_index index) in hash_index() argument
45 hash = HASH(hash, index.value); in hash_index()
46 hash = HASH(hash, index.abs); in hash_index()
47 hash = HASH(hash, index.neg); in hash_index()
48 hash = HASH(hash, index.swizzle); in hash_index()
49 hash = HASH(hash, index.offset); in hash_index()
50 hash = HASH(hash, index.reg); in hash_index()
51 hash = HASH(hash, index.type); in hash_index()
[all …]
/third_party/skia/third_party/externals/freetype/src/base/
Dfthash.c56 /* Mocklisp hash function. */ in hash_str_lookup()
71 /* Mocklisp hash function. */ in hash_num_lookup()
106 FT_Hash hash ) in hash_bucket() argument
109 FT_Hashnode* bp = hash->table; in hash_bucket()
113 res = (hash->lookup)( &key ); in hash_bucket()
115 ndp = bp + ( res % hash->size ); in hash_bucket()
118 if ( (hash->compare)( &(*ndp)->key, &key ) ) in hash_bucket()
123 ndp = bp + ( hash->size - 1 ); in hash_bucket()
131 hash_rehash( FT_Hash hash, in hash_rehash() argument
134 FT_Hashnode* obp = hash->table; in hash_rehash()
[all …]
/third_party/icu/icu4c/source/common/
Duhash.cpp22 /* This hashtable is implemented as a double hash. All elements are
24 * resolution (no linked list, etc.). When there is a hash collision
26 * using a secondary hash. The secondary hash is an increment
27 * computed as a hash function (a different one) of the primary
28 * hashcode. This increment is added to the initial hash value to
29 * obtain further slots assigned to the same hash code. For this to
122 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) UPRV_BLOCK_MACRO_BEGIN { \ argument
123 if (hash->keyDeleter != NULL && keypointer != NULL) { \
124 (*hash->keyDeleter)(keypointer); \
126 if (hash->valueDeleter != NULL && valuepointer != NULL) { \
[all …]
/third_party/node/deps/icu-small/source/common/
Duhash.cpp22 /* This hashtable is implemented as a double hash. All elements are
24 * resolution (no linked list, etc.). When there is a hash collision
26 * using a secondary hash. The secondary hash is an increment
27 * computed as a hash function (a different one) of the primary
28 * hashcode. This increment is added to the initial hash value to
29 * obtain further slots assigned to the same hash code. For this to
122 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) UPRV_BLOCK_MACRO_BEGIN { \ argument
123 if (hash->keyDeleter != nullptr && keypointer != nullptr) { \
124 (*hash->keyDeleter)(keypointer); \
126 if (hash->valueDeleter != nullptr && valuepointer != nullptr) { \
[all …]
/third_party/skia/third_party/externals/icu/source/common/
Duhash.cpp22 /* This hashtable is implemented as a double hash. All elements are
24 * resolution (no linked list, etc.). When there is a hash collision
26 * using a secondary hash. The secondary hash is an increment
27 * computed as a hash function (a different one) of the primary
28 * hashcode. This increment is added to the initial hash value to
29 * obtain further slots assigned to the same hash code. For this to
122 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) UPRV_BLOCK_MACRO_BEGIN { \ argument
123 if (hash->keyDeleter != NULL && keypointer != NULL) { \
124 (*hash->keyDeleter)(keypointer); \
126 if (hash->valueDeleter != NULL && valuepointer != NULL) { \
[all …]
/third_party/json/tests/src/
Dunit-hash.cpp17 TEST_CASE("hash<nlohmann::json>")
21 // std::hash may differ between compilers.
26 hashes.insert(std::hash<json> {}(json(nullptr)));
29 hashes.insert(std::hash<json> {}(json(true)));
30 hashes.insert(std::hash<json> {}(json(false)));
33 hashes.insert(std::hash<json> {}(json("")));
34 hashes.insert(std::hash<json> {}(json("foo")));
37 hashes.insert(std::hash<json> {}(json(0)));
38 hashes.insert(std::hash<json> {}(json(static_cast<unsigned>(0))));
40 hashes.insert(std::hash<json> {}(json(-1)));
[all …]
/third_party/rust/crates/libc/src/unix/haiku/
Dx86_64.rs96 impl ::hash::Hash for fpu_state {
97 fn hash<H: ::hash::Hasher>(&self, state: &mut H) {
98 self.control.hash(state);
99 self.status.hash(state);
100 self.tag.hash(state);
101 self.opcode.hash(state);
102 self.rip.hash(state);
103 self.rdp.hash(state);
104 self.mxcsr.hash(state);
105 self.mscsr_mask.hash(state);
[all …]
/third_party/rust/crates/memchr/src/memmem/
Drabinkarp.rs7 to compute a needle hash and zip through the haystack when compared to
45 /// a pre-computed needle hash.
55 let mut hash = Hash::from_bytes_fwd(&haystack[..needle.len()]); in find_with() localVariable
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with()
76 /// a pre-computed needle hash.
85 let mut hash = in rfind_with() localVariable
86 Hash::from_bytes_rev(&haystack[haystack.len() - needle.len()..]); in rfind_with()
88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with()
94 hash.roll( in rfind_with()
[all …]
/third_party/ffmpeg/libavutil/
Dhash.h34 * @defgroup lavu_hash Hash Functions
36 * Hash functions useful in multimedia.
38 * Hash functions are widely used in multimedia, from error checking and
40 * implementations of a variety of hash functions that may be useful for
46 * An abstraction layer for all hash functions supported by libavutil.
48 * If your application needs to support a wide range of different hash
50 * reusable API for @ref lavu_hash "all hash functions" implemented in libavutil.
51 * If you just need to use one particular hash function, use the @ref lavu_hash
52 * "individual hash" directly.
66 * // Allocate a hash context
[all …]
/third_party/skia/modules/skparagraph/src/
DParagraphCache.cpp51 explicit ParagraphCacheKey(uint32_t hash) : fHash(hash) {} in ParagraphCacheKey() argument
55 uint32_t hash() const { return fHash; } in hash() function in skia::textlayout::ParagraphCacheKey
60 static uint32_t mix(uint32_t hash, uint32_t data);
110 // criteria to apply the layout cache, should presumably hash it, same
111 // hash could be used to check if the entry has cached layout available
122 uint32_t ParagraphCacheKey::mix(uint32_t hash, uint32_t data) { in mix() argument
123 hash += data; in mix()
124 hash += (hash << 10); in mix()
125 hash ^= (hash >> 6); in mix()
126 return hash; in mix()
[all …]
/third_party/rust/crates/cxx/syntax/
Dimpls.rs4 use std::hash::{Hash, Hasher};
42 impl Hash for Type {
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() method
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
[all …]
/third_party/skia/third_party/externals/tint/src/utils/
Dhash_test.cc15 #include "src/utils/hash.h"
26 EXPECT_EQ(Hash(123), Hash(123)); in TEST()
27 EXPECT_NE(Hash(123), Hash(321)); in TEST()
28 EXPECT_EQ(Hash(123, 456), Hash(123, 456)); in TEST()
29 EXPECT_NE(Hash(123, 456), Hash(456, 123)); in TEST()
30 EXPECT_NE(Hash(123, 456), Hash(123)); in TEST()
31 EXPECT_EQ(Hash(123, 456, false), Hash(123, 456, false)); in TEST()
32 EXPECT_NE(Hash(123, 456, false), Hash(123, 456)); in TEST()
33 EXPECT_EQ(Hash(std::string("hello")), Hash(std::string("hello"))); in TEST()
34 EXPECT_NE(Hash(std::string("hello")), Hash(std::string("world"))); in TEST()
[all …]
/third_party/skia/tests/
DChecksumTest.cpp23 // Hash of nullptr is always 0. in DEF_TEST()
24 REPORTER_ASSERT(r, SkOpts::hash(nullptr, 0) == 0); in DEF_TEST()
26 const uint32_t hash = SkOpts::hash(data, kBytes); in DEF_TEST() local
28 REPORTER_ASSERT(r, hash == SkOpts::hash(data, kBytes)); in DEF_TEST()
30 // Changing any single element should change the hash. in DEF_TEST()
34 const uint32_t tweakedHash = SkOpts::hash(tweaked, kBytes); in DEF_TEST()
35 REPORTER_ASSERT(r, tweakedHash != hash); in DEF_TEST()
36 REPORTER_ASSERT(r, tweakedHash == SkOpts::hash(tweaked, kBytes)); in DEF_TEST()
48 // We noticed a few workloads that would cause hash collisions due to the way in DEF_TEST()
51 // One of these two workloads ought to cause an unintentional hash collision on very similar in DEF_TEST()
[all …]

12345678910>>...208