Home
last modified time | relevance | path

Searched refs:hash (Results 776 - 800 of 2239) sorted by relevance

1...<<31323334353637383940>>...90

/third_party/mesa3d/src/compiler/nir/
H A Dnir_lower_goto_ifs.c106 * Hash set ordering is non-deterministic. We hash based on pointers and so,
279 _mesa_set_add_pre_hashed(reachable, entry->hash, entry->key); in fork_reachable()
463 if (_mesa_set_search_pre_hashed(remaining, entry->hash, in inside_outside()
468 if (_mesa_set_search_pre_hashed(loop_heads, entry->hash, in inside_outside()
475 _mesa_set_add_pre_hashed(outside, child_entry->hash, in inside_outside()
485 _mesa_set_add_pre_hashed(loop_heads, entry->hash, entry->key); in inside_outside()
712 entry->hash, entry->key)) { in organize_levels()
733 _mesa_set_add_pre_hashed(prev_frontier, entry->hash, in organize_levels()
744 _mesa_set_add_pre_hashed(skip_targets, entry->hash, entry->key); in organize_levels()
/third_party/lz4/lib/
H A Dxxhash.c89 * The check costs one initial branch per hash;
261 * 32-bit hash functions
561 * These functions allow transformation of hash result into and from its canonical format.
562 * This way, hash values can be written into a file or buffer, remaining comparable across different systems.
565 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash) in XXH32_canonicalFromHash() argument
568 if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash); in XXH32_canonicalFromHash()
569 memcpy(dst, &hash, sizeof(*dst)); in XXH32_canonicalFromHash()
581 * 64-bit hash functions
1018 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash) in XXH64_canonicalFromHash() argument
[all...]
/third_party/node/deps/openssl/openssl/apps/
H A Dpasswd.c781 char *hash = NULL; in do_passwd() local
828 /* now compute password hash */ in do_passwd()
830 hash = md5crypt(passwd, (mode == passwd_md5 ? "1" : "apr1"), *salt_p); in do_passwd()
832 hash = md5crypt(passwd, "", *salt_p); in do_passwd()
834 hash = shacrypt(passwd, (mode == passwd_sha256 ? "5" : "6"), *salt_p); in do_passwd()
835 assert(hash != NULL); in do_passwd()
838 BIO_printf(out, "%s\t%s\n", passwd, hash); in do_passwd()
840 BIO_printf(out, "%s\t%s\n", hash, passwd); in do_passwd()
842 BIO_printf(out, "%s\n", hash); in do_passwd()
/third_party/rust/crates/libc/src/unix/linux_like/linux/musl/b32/arm/
H A Dmod.rs214 impl ::hash::Hash for ucontext_t {
215 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
216 self.uc_flags.hash(state); in hash()
217 self.uc_link.hash(state); in hash()
218 self.uc_stack.hash(state); in hash()
219 self.uc_mcontext.hash(state); in hash()
220 self.uc_sigmask.hash(state); in hash()
/third_party/openssl/apps/
H A Dpasswd.c781 char *hash = NULL; in do_passwd() local
828 /* now compute password hash */ in do_passwd()
830 hash = md5crypt(passwd, (mode == passwd_md5 ? "1" : "apr1"), *salt_p); in do_passwd()
832 hash = md5crypt(passwd, "", *salt_p); in do_passwd()
834 hash = shacrypt(passwd, (mode == passwd_sha256 ? "5" : "6"), *salt_p); in do_passwd()
835 assert(hash != NULL); in do_passwd()
838 BIO_printf(out, "%s\t%s\n", passwd, hash); in do_passwd()
840 BIO_printf(out, "%s\t%s\n", hash, passwd); in do_passwd()
842 BIO_printf(out, "%s\n", hash); in do_passwd()
/third_party/skia/third_party/externals/angle2/src/common/third_party/xxhash/
H A Dxxhash.c89 * The check costs one initial branch per hash;
261 * 32-bit hash functions
561 * These functions allow transformation of hash result into and from its canonical format.
562 * This way, hash values can be written into a file or buffer, remaining comparable across different systems.
565 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash) in XXH32_canonicalFromHash() argument
568 if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash); in XXH32_canonicalFromHash()
569 memcpy(dst, &hash, sizeof(*dst)); in XXH32_canonicalFromHash()
581 * 64-bit hash functions
1018 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash) in XXH64_canonicalFromHash() argument
[all...]
/third_party/protobuf/ruby/ext/google/protobuf_c/
H A Dmessage.c136 VALUE hash = rb_hash_new(); in ruby_wrapper_type() local
137 rb_hash_aset(hash, rb_str_new2("value"), value); in ruby_wrapper_type()
139 VALUE args[1] = {hash}; in ruby_wrapper_type()
402 const upb_fielddef* f, VALUE hash) { in create_submsg_from_hash()
403 VALUE args[1] = { hash }; in create_submsg_from_hash()
419 "Expected string or symbols as hash keys when initializing proto from hash."); in Message_initialize_kwarg()
497 rb_raise(rb_eArgError, "Expected hash arguments."); in Message_initialize()
572 * Message.hash => hash_value
574 * Returns a hash valu
401 create_submsg_from_hash(const MessageLayout* layout, const upb_fielddef* f, VALUE hash) create_submsg_from_hash() argument
613 VALUE hash = rb_hash_new(); Message_to_h() local
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/p2p/
H A Dp2p_build.c447 const u8 *hash, u8 hash_count) in p2ps_wildcard_hash()
450 const u8 *test = hash; in p2ps_wildcard_hash()
595 u8 hash_count, const u8 *hash, in p2p_buf_add_service_instance()
604 if (!adv_list || !hash || !hash_count) in p2p_buf_add_service_instance()
607 wpa_hexdump(MSG_DEBUG, "P2PS: Probe Request service hash values", in p2p_buf_add_service_instance()
608 hash, hash_count * P2PS_HASH_LEN); in p2p_buf_add_service_instance()
609 p2ps_wildcard = p2ps_wildcard_hash(p2p, hash, hash_count) && in p2p_buf_add_service_instance()
640 const u8 *test = hash; in p2p_buf_add_service_instance()
644 /* exact name hash match */ in p2p_buf_add_service_instance()
645 if (os_memcmp(test, adv->hash, P2PS_HASH_LE in p2p_buf_add_service_instance()
446 p2ps_wildcard_hash(struct p2p_data *p2p, const u8 *hash, u8 hash_count) p2ps_wildcard_hash() argument
594 p2p_buf_add_service_instance(struct wpabuf *buf, struct p2p_data *p2p, u8 hash_count, const u8 *hash, struct p2ps_advertisement *adv_list) p2p_buf_add_service_instance() argument
[all...]
/third_party/vk-gl-cts/modules/gles2/functional/
H A Des2fDrawTests.cpp670 deUint32 hash = spec.hash(); in init() local
672 hash = (hash << 2) ^ (deUint32)spec.attribs[attrNdx].hash(); in init()
674 if (insertedHashes.find(hash) == insertedHashes.end() && in init()
675 !de::contains(DE_ARRAY_BEGIN(disallowedCases), DE_ARRAY_END(disallowedCases), hash)) in init()
681 insertedHashes.insert(hash); in init()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/p2p/
H A Dp2p_build.c447 const u8 *hash, u8 hash_count) in p2ps_wildcard_hash()
450 const u8 *test = hash; in p2ps_wildcard_hash()
595 u8 hash_count, const u8 *hash, in p2p_buf_add_service_instance()
604 if (!adv_list || !hash || !hash_count) in p2p_buf_add_service_instance()
607 wpa_hexdump(MSG_DEBUG, "P2PS: Probe Request service hash values", in p2p_buf_add_service_instance()
608 hash, hash_count * P2PS_HASH_LEN); in p2p_buf_add_service_instance()
609 p2ps_wildcard = p2ps_wildcard_hash(p2p, hash, hash_count) && in p2p_buf_add_service_instance()
640 const u8 *test = hash; in p2p_buf_add_service_instance()
644 /* exact name hash match */ in p2p_buf_add_service_instance()
645 if (os_memcmp(test, adv->hash, P2PS_HASH_LE in p2p_buf_add_service_instance()
446 p2ps_wildcard_hash(struct p2p_data *p2p, const u8 *hash, u8 hash_count) p2ps_wildcard_hash() argument
594 p2p_buf_add_service_instance(struct wpabuf *buf, struct p2p_data *p2p, u8 hash_count, const u8 *hash, struct p2ps_advertisement *adv_list) p2p_buf_add_service_instance() argument
[all...]
/foundation/arkui/ace_engine/frameworks/core/components/hyperlink/
H A Dhyperlink_resources.cpp42 // method hash is hyperlink@(id)method#HWJS-=-#(method)#HWJS-?-# in MakeMethodHash()
133 auto releaseTask = [id = id_, hash = hash_, weakRes] { in ReleasePluginResource()
141 resRegister->ReleaseResource(hash); in ReleasePluginResource()
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/syncer/src/device/multiver/
H A Dvalue_slice_sync.h34 void SetValueSliceHash(ValueSliceHash &hash);
36 void GetValueSliceHash(ValueSliceHash &hash) const;
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/adapter/account/src/
H A Daccount_delegate_impl.cpp116 bool AccountDelegateImpl::RegisterHashFunc(HashFunc hash) in RegisterHashFunc() argument
118 hash_ = hash; in RegisterHashFunc()
/third_party/elfio/elfio/
H A Delfio_versym.hpp136 Elf_Word& hash, in get_entry()
158 hash = veraux->vna_hash; in get_entry()
133 get_entry( Elf_Word no, Elf_Half& version, std::string& file_name, Elf_Word& hash, Elf_Half& flags, Elf_Half& other, std::string& dep_name ) const get_entry() argument
/third_party/gn/src/base/files/
H A Dfile_path.h382 struct hash<base::FilePath> { struct
386 return hash<base::FilePath::StringType>()(f.value()); in operator ()()
/third_party/curl/lib/
H A Dhostip.h28 #include "hash.h"
132 void Curl_init_dnscache(struct Curl_hash *hash, int hashsize);
217 void Curl_hostcache_clean(struct Curl_easy *data, struct Curl_hash *hash);
/third_party/mbedtls/include/psa/
H A Dcrypto_builtin_composites.h48 /** The hash context. */
107 /* Context structure for the Mbed TLS interruptible sign hash implementation. */
120 uint8_t MBEDTLS_PRIVATE(hash)[PSA_BITS_TO_BYTES(PSA_VENDOR_ECC_MAX_CURVE_BITS)];
140 /* Context structure for the Mbed TLS interruptible verify hash
152 uint8_t MBEDTLS_PRIVATE(hash)[PSA_BITS_TO_BYTES(PSA_VENDOR_ECC_MAX_CURVE_BITS)];
/third_party/mesa3d/src/gallium/drivers/zink/
H A Dzink_state.h33 uint32_t hash; member
93 uint32_t hash; member
/third_party/node/lib/internal/crypto/
H A Dpbkdf2.js101 const { iterations, hash, salt } = algorithm;
122 raw, salt, iterations, length / 8, normalizeHashName(hash.name),
/third_party/node/doc/api_assets/
H A Dapi.js131 link.hash = location.hash;
182 // Make link to other versions of the doc open to the same hash target (if it exists).
/third_party/node/deps/v8/src/wasm/
H A Dcanonical-types.h76 struct hash { struct
111 std::unordered_map<CanonicalGroup, uint32_t, CanonicalGroup::hash>
/third_party/node/doc/api/assets/
H A Dapi.js131 link.hash = location.hash;
182 // Make link to other versions of the doc open to the same hash target (if it exists).
/third_party/node/test/fixtures/wpt/common/
H A DPrefixedLocalStorage.js32 var hash = (i === -1) ? '' : uri.substr(i);
38 return uri + hash;
/third_party/node/deps/npm/node_modules/@sigstore/verify/dist/timestamp/
H A Dmerkle.js39 message: 'invalid hash count',
44 // The entry's hash is the leaf hash
48 // Calculated hash should match the root hash in the inclusion proof
52 message: 'calculated root hash does not match inclusion proof',
66 // Computes a subtree hash for a node on or below the tree's right border.
68 // and seed is the initial hash of the node specified by the index.
79 // Computes a subtree hash for nodes along the tree's right border.
101 return core_1.crypto.hash(RFC6962_NODE_HASH_PREFI
[all...]
/third_party/node/deps/npm/node_modules/imurmurhash/
H A Dimurmurhash.js25 m.hash(key);
33 // Incrementally add a string to this hash
37 MurmurHash3.prototype.hash = function(key) {
93 // Get the result of this hash
95 // @return {number} The 32-bit hash
120 // Reset the hash object for reuse

Completed in 21 milliseconds

1...<<31323334353637383940>>...90