Home
last modified time | relevance | path

Searched refs:hash (Results 1001 - 1025 of 2318) sorted by relevance

1...<<41424344454647484950>>...93

/third_party/node/deps/v8/src/inspector/
H A Dv8-debugger-script.cc83 String16Builder hash; in calculateHash() local
85 hash.appendUnsignedAsHex(static_cast<uint32_t>(hashes[i])); in calculateHash()
86 return hash.toString(); in calculateHash()
257 const String16& hash() const override {
/third_party/mesa3d/src/gallium/auxiliary/tgsi/
H A Dtgsi_sanity.c546 regs_hash_destroy(struct cso_hash *hash) in regs_hash_destroy() argument
548 struct cso_hash_iter iter = cso_hash_first_node(hash); in regs_hash_destroy()
551 iter = cso_hash_erase(hash, iter); in regs_hash_destroy()
555 cso_hash_deinit(hash); in regs_hash_destroy()
/third_party/openssl/test/
H A Dtls13secretstest.c136 /* Give a hash of the currently set handshake */
236 unsigned char hash[EVP_MAX_MD_SIZE]; in test_secret() local
241 if (!ssl_handshake_hash(s, hash, sizeof(hash), &hashsize)) { in test_secret()
242 TEST_error("Failed to get hash"); in test_secret()
246 if (!tls13_hkdf_expand(s, md, prk, label, labellen, hash, hashsize, in test_secret()
350 * hash. in test_handshake_secrets()
/third_party/protobuf/csharp/src/Google.Protobuf/Collections/
H A DRepeatedField.cs507 /// Returns a hash code for this instance.
510 /// A hash code for this instance, suitable for use in hashing algorithms and data structures like a hash table.
514 int hash = 0; in GetHashCode()
517 hash = hash * 31 + array[i].GetHashCode(); in GetHashCode()
519 return hash; in GetHashCode()
/third_party/skia/third_party/externals/swiftshader/tests/regres/cmd/export_to_sheets/
H A Dmain.go133 hash := change.Hash.String()
134 if _, found := hashIndices[hash]; found {
145 data, err := git.Show(path, hash)
173 fmt.Printf("Adding test data at %v to %v\n", hash[:8], sheetName)
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DFoldingSet.h9 // This file defines a hash set that can be used to remove duplication of nodes
34 /// This class is implemented as a single-link chained hash table, where the
107 /// structure is an array of buckets. Each bucket is indexed by the hash of
171 /// GrowHashTable - Double the size of the hash table and rehash everything.
174 /// GrowBucketCount - resize the hash table and rehash everything.
190 /// this function to compute a hash value for the given node.
235 // ComputeHash - Compute a hash value for X, using TempID to
237 // just calls Profile and does a regular hash computation.
285 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeIDRef,
304 /// hash valu
422 bucket_begin(unsigned hash) bucket_begin() argument
426 bucket_end(unsigned hash) bucket_end() argument
[all...]
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DLiteralByteStringTest.java479 int hash = stringUnderTest.hashCode(); in testHashCode()
480 assertEquals(classUnderTest + " must have expected hashCode", expectedHashCode, hash); in testHashCode()
497 // This test would fail if the expected hash were 1. It's not. in testPartialHash()
498 int hash = stringUnderTest.partialHash(stringUnderTest.size(), 0, stringUnderTest.size()); in testPartialHash()
500 classUnderTest + ".partialHash() must yield expected hashCode", expectedHashCode, hash); in testPartialHash()
/third_party/pulseaudio/src/pulsecore/
H A Ddatabase-simple.c73 unsigned hash = 0; in hash_func() local
81 hash = 31 * hash + (unsigned) *c; in hash_func()
85 return hash; in hash_func()
/third_party/rust/crates/rust-openssl/openssl/src/
H A Dpkcs5.rs9 use crate::hash::MessageDigest;
95 hash: MessageDigest, in pbkdf2_hmac()
106 hash.as_ptr(), in pbkdf2_hmac()
149 use crate::hash::MessageDigest;
/base/hiviewdfx/hiview/core/param_update/include/
H A Dlog_sign_tools.h44 static int CalcFileSha(const std::string& path, unsigned char *hash, size_t outLen);
/foundation/graphic/graphic_3d/lume/LumeFont/src/
H A Dfont_buffer.h33 FontBuffer(FontManager* fontMgr, uint64_t hash, BASE_NS::array_view<const uint8_t> bytes);
44 uint64_t hash_; // path hash as map key in font mgr
/foundation/communication/dsoftbus/core/bus_center/utils/include/
H A Dlnn_map.h30 uint32_t hash; member
/foundation/communication/dsoftbus/tests/core/bus_center/lnn/lane_link_conflict/
H A Dlnn_lane_link_conflict_deps_mock.h34 virtual int32_t SoftBusGenerateStrHash(const unsigned char *str, uint32_t len, unsigned char *hash) = 0;
/foundation/communication/netstack/interfaces/innerkits/rust/ylong_http_client/src/reqwest_impl/
H A Dutil.rs20 use std::hash::{BuildHasher, Hasher};
/foundation/filemanagement/app_file_service/utils/include/b_json/
H A Db_report_entity.h33 std::string hash; member
/foundation/communication/dsoftbus/adapter/common/include/
H A Dsoftbus_aes_encrypt.h56 const EncryptKey *randomKey, const uint8_t *rootKey, uint32_t rootKeyLen, uint8_t *hash, uint32_t hashLen);
/third_party/libcoap/include/coap3/
H A Dcoap_crypto_internal.h124 * Create a HMAC hash of the provided data.
127 * @param key The key to use for the hash.
128 * @param data The data to hash.
141 * Create a hash of the provided data.
143 * @param alg The hash algorithm.
144 * @param data The data to hash.
145 * @param hash Where to put the hash result if successful.
149 * created hash.
153 coap_bin_const_t **hash);
[all...]
/third_party/mesa3d/src/gallium/winsys/radeon/drm/
H A Dradeon_drm_bo.h62 uint32_t hash; member
/third_party/node/src/
H A Dcleanup_queue.cc44 return std::hash<void*>()(cb.arg_); in operator ()()
/third_party/nghttp2/lib/
H A Dnghttp2_map.h42 uint32_t hash; member
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_map.h42 uint32_t hash; member
/third_party/node/deps/nghttp2/lib/
H A Dnghttp2_map.h42 uint32_t hash; member
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_map.h43 uint32_t hash; member
/third_party/node/deps/v8/src/objects/
H A Dlookup-cache-inl.h20 uint32_t name_hash = name.hash(); in Hash()
/third_party/rust/crates/cxx/gen/build/src/syntax/
H A Dinstantiate.rs3 use std::hash::{Hash, Hasher};
65 fn hash<H: Hasher>(&self, hasher: &mut H) { in hash() functions
66 self.rust.hash(hasher); in hash()

Completed in 11 milliseconds

1...<<41424344454647484950>>...93