/third_party/libfuse/lib/ |
H A D | fuse.c | 512 uint64_t hash = ((uint32_t) ino * 2654435761U) % f->id_table.size; in id_hash() local 513 uint64_t oldhash = hash % (f->id_table.size / 2); in id_hash() 518 return hash; in id_hash() 523 size_t hash = id_hash(f, nodeid); in get_node_nocheck() local 526 for (node = f->id_table.array[hash]; node != NULL; node = node->id_next) in get_node_nocheck() 650 size_t hash; in rehash_id() local 655 hash = t->split; in rehash_id() 657 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) { in rehash_id() 661 if (newhash != hash) { in rehash_id() 676 size_t hash in hash_id() local 688 uint64_t hash = parent; name_hash() local 733 size_t hash = name_hash(f, node->parent->nodeid, node->name); unhash_name() local 763 size_t hash; rehash_name() local 790 size_t hash = name_hash(f, parentid, name); hash_name() local 849 size_t hash = name_hash(f, parent, name); lookup_node() local [all...] |
/device/soc/hisilicon/hi3516dv300/sdk_linux/drv/interdrv/common/cipher/src/drv/cipher_v1.0/drivers/crypto/include/ |
H A D | cryp_hash.h | 25 /* Initialize crypto of hash. */ 28 /* Deinitialize crypto of hash. */ 32 * \brief Create hash handle 40 * \brief Clear hash context 53 * \param ctx hash handle to be destroy 54 * \param chunk hash message to update 55 * \param length length of hash message 56 * \param src source of hash message 64 * \param hash HASH checksum result 67 typedef hi_s32 (*func_hash_finish)(hi_void *ctx, hi_void *hash, hi_u3 [all...] |
/device/soc/hisilicon/hi3861v100/sdk_liteos/boot/loaderboot/include/ |
H A D | efuse_opt.h | 32 hi_u8 hash[SHA_256_LENGTH]; /* hash of configuration file. */ member
|
/device/soc/rockchip/rk3588/hardware/mpp/include/ |
H A D | dictionary.h | 57 hash function. 65 unsigned * hash ; /** List of hash values for keys */ member 75 @brief Compute the hash key for a string. 79 This hash function has been taken from an Article in Dr Dobbs Journal.
|
/third_party/libunwind/libunwind/include/tdep-ia64/ |
H A D | script.h | 55 unsigned short coll_chain; /* used for hash collisions */ 68 /* hash table that maps instruction pointer to script index: */ 69 unsigned short hash[IA64_UNW_HASH_SIZE]; member
|
/third_party/node/deps/v8/src/wasm/ |
H A D | signature-map.h | 47 std::unordered_map<FunctionSig, uint32_t, base::hash<FunctionSig>> map_;
|
/third_party/node/deps/npm/node_modules/@sigstore/verify/dist/tlog/ |
H A D | hashedrekord.js | 45 const tlogDigest = tlogEntry.spec.data.hash?.value || '';
|
/third_party/node/deps/npm/node_modules/@sigstore/sign/dist/witness/tsa/ |
H A D | client.js | 32 artifactHash: util_1.crypto.hash(signature).toString('base64'),
|
/third_party/python/Include/cpython/ |
H A D | weakrefobject.h | 20 /* A cache for wr_object's hash code. As usual for hashes, this is -1 21 * if the hash code isn't known yet. 23 Py_hash_t hash; member
|
/third_party/python/Modules/_decimal/tests/ |
H A D | bignum.py | 13 # hash values to use for positive and negative infinities, and nans 40 h2 = hash(d)
|
/third_party/skia/third_party/externals/tint/src/inspector/ |
H A D | sampler_texture_pair.h | 54 /// Custom std::hash specialization for tint::inspector::SamplerTexturePair so 58 class hash<tint::inspector::SamplerTexturePair> { class 60 /// @param stp the texture pair to create a hash for 61 /// @return the hash value
|
/third_party/skia/third_party/externals/tint/src/sem/ |
H A D | binding_point.h | 22 #include "src/utils/hash.h" 54 /// Custom std::hash specialization for tint::sem::BindingPoint so 58 class hash<tint::sem::BindingPoint> { class 60 /// @param binding_point the binding point to create a hash for 61 /// @return the hash value
|
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/tls/ |
H A D | pkcs1.h | 27 const u8 *hash, size_t hash_len);
|
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/ |
H A D | pkcs1.h | 27 const u8 *hash, size_t hash_len);
|
/third_party/mesa3d/src/microsoft/vulkan/ |
H A D | dzn_pipeline.c | 79 uint8_t hash[SHA1_DIGEST_LENGTH]; member 106 const void *hash, 133 const void *hash, in dzn_cached_blob_create() 145 memcpy(blob->hash, hash, sizeof(blob->hash)); in dzn_cached_blob_create() 149 blob->hash, sizeof(blob->hash)); in dzn_cached_blob_create() 194 const uint8_t *hash, in dzn_pipeline_get_nir_shader() 205 *nir = vk_pipeline_cache_lookup_nir(cache, hash, SHA1_DIGEST_LENGT in dzn_pipeline_get_nir_shader() 132 dzn_cached_blob_create(struct vk_device *device, const void *hash, const void *data, size_t data_size) dzn_cached_blob_create() argument 191 dzn_pipeline_get_nir_shader(struct dzn_device *device, const struct dzn_pipeline_layout *layout, struct vk_pipeline_cache *cache, const uint8_t *hash, const VkPipelineShaderStageCreateInfo *stage_info, gl_shader_stage stage, enum dxil_spirv_yz_flip_mode yz_flip_mode, uint16_t y_flip_mask, uint16_t z_flip_mask, bool force_sample_rate_shading, enum pipe_format *vi_conversions, const nir_shader_compiler_options *nir_opts, nir_shader **nir) dzn_pipeline_get_nir_shader() argument [all...] |
/third_party/python/Lib/test/ |
H A D | test_weakref.py | 60 return hash(self.arg) 481 hash(weakref.proxy(obj)) 488 hash(weakref.proxy(obj)) 903 # Alive weakrefs hash the same as the underlying object 908 self.assertEqual(hash(a), hash(42)) 912 # - retain their hash is they were hashed when alive; 914 self.assertEqual(hash(a), hash(42)) 915 self.assertRaises(TypeError, hash, [all...] |
/third_party/pulseaudio/src/modules/bluetooth/ |
H A D | bluez5-util.c | 1097 unsigned hash; in pa_a2dp_codec_id_hash_func() local 1100 hash = p->codec_id; in pa_a2dp_codec_id_hash_func() 1101 hash = 31 * hash + ((p->vendor_id >> 0) & 0xFF); in pa_a2dp_codec_id_hash_func() 1102 hash = 31 * hash + ((p->vendor_id >> 8) & 0xFF); in pa_a2dp_codec_id_hash_func() 1103 hash = 31 * hash + ((p->vendor_id >> 16) & 0xFF); in pa_a2dp_codec_id_hash_func() 1104 hash = 31 * hash in pa_a2dp_codec_id_hash_func() [all...] |
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/eap_peer/ |
H A D | eap.c | 806 u8 hash[SHA256_MAC_LEN]; in eap_peer_build_erp_reauth_start() local 843 wpabuf_head(msg), wpabuf_len(msg), hash) < 0) { in eap_peer_build_erp_reauth_start() 847 wpabuf_put_data(msg, hash, 16); in eap_peer_build_erp_reauth_start() 1196 * unfortunately, such implementations exist. Use SHA1 hash as in eap_peer_req_is_duplicate() 1839 u8 hash[SHA256_MAC_LEN]; in eap_peer_finish() local 1927 end - ((const u8 *) hdr) - hash_len, hash) < 0) in eap_peer_finish() 1929 if (os_memcmp(end - hash_len, hash, hash_len) != 0) { in eap_peer_finish() 2135 if (data->peer_cert.hash) { in eap_peer_sm_tls_event() 2140 data->peer_cert.hash, in eap_peer_sm_tls_event() 2867 * @hash 2872 eap_get_config_password2(struct eap_sm *sm, size_t *len, int *hash) eap_get_config_password2() argument [all...] |
/third_party/ntfs-3g/libfuse-lite/ |
H A D | fuse.c | 258 size_t hash = nodeid % f->id_table_size; in get_node_nocheck() local 261 for (node = f->id_table[hash]; node != NULL; node = node->id_next) in get_node_nocheck() 287 size_t hash = node->nodeid % f->id_table_size; in unhash_id() local 288 struct node **nodep = &f->id_table[hash]; in unhash_id() 299 size_t hash = node->nodeid % f->id_table_size; in hash_id() local 300 node->id_next = f->id_table[hash]; in hash_id() 301 f->id_table[hash] = node; in hash_id() 307 unsigned int hash = *name; in name_hash() local 309 if (hash) in name_hash() 311 hash in name_hash() 321 size_t hash = name_hash(f, node->parent->nodeid, node->name); unhash_name() local 343 size_t hash = name_hash(f, parentid, name); hash_name() local 388 size_t hash = name_hash(f, parent, name); lookup_node() local [all...] |
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/wps/ |
H A D | wps_registrar.c | 38 int pk_hash_provided_oob; /* whether own PK hash was provided OOB */ 1479 u8 *hash; in wps_build_r_hash() local 1498 hash = wpabuf_put(msg, SHA256_MAC_LEN); in wps_build_r_hash() 1508 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); in wps_build_r_hash() 1509 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash1", hash, SHA256_MAC_LEN); in wps_build_r_hash() 1514 hash = wpabuf_put(msg, SHA256_MAC_LEN); in wps_build_r_hash() 1518 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); in wps_build_r_hash() 1519 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash2", hash, SHA256_MAC_LEN); in wps_build_r_hash() 1930 * Use abbreviated handshake since public key hash allowed in wps_build_m2() 2297 u8 hash[SHA256_MAC_LE in wps_process_e_snonce1() local 2337 u8 hash[SHA256_MAC_LEN]; wps_process_e_snonce2() local 2704 u8 hash[WPS_HASH_LEN]; wps_process_m1() local 3731 const u8 *pos, *hash, *dev_pw; wps_registrar_add_nfc_password_token() local [all...] |
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/wps/ |
H A D | wps_registrar.c | 39 int pk_hash_provided_oob; /* whether own PK hash was provided OOB */ 1457 u8 *hash; in wps_build_r_hash() local 1476 hash = wpabuf_put(msg, SHA256_MAC_LEN); in wps_build_r_hash() 1486 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); in wps_build_r_hash() 1487 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash1", hash, SHA256_MAC_LEN); in wps_build_r_hash() 1492 hash = wpabuf_put(msg, SHA256_MAC_LEN); in wps_build_r_hash() 1496 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); in wps_build_r_hash() 1497 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash2", hash, SHA256_MAC_LEN); in wps_build_r_hash() 1921 * Use abbreviated handshake since public key hash allowed in wps_build_m2() 2288 u8 hash[SHA256_MAC_LE in wps_process_e_snonce1() local 2328 u8 hash[SHA256_MAC_LEN]; wps_process_e_snonce2() local 2695 u8 hash[WPS_HASH_LEN]; wps_process_m1() local 3752 const u8 *pos, *hash, *dev_pw; wps_registrar_add_nfc_password_token() local [all...] |
/third_party/gn/src/gn/ |
H A D | hash_table_base.h | 30 // good hash function (which is the case of all C++ standard libraries 41 // used if the hash table instantiation requires deletion support 49 // if the corresponding node matches a 'free' entry in the hash 59 // Note that if your hash table does not need deletion support, 78 // Use NodeLookup() to look for an existing item in the hash table. 79 // This takes the item's hash value, and a templated callable to 92 // hash value to it), then call UpdateAfterInsertion(), which 104 // a hash value and an owning pointer in each node: 107 // size_t hash; 142 // size_t hash 455 NodeLookup(size_t hash, NODE_EQUAL node_equal) const NodeLookup() argument [all...] |
/third_party/libbpf/src/ |
H A D | hashmap.c | 4 * Generic non-thread safe hash map implementation. 131 const long key, size_t hash, in hashmap_find_entry() 140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry() 130 hashmap_find_entry(const struct hashmap *map, const long key, size_t hash, struct hashmap_entry ***pprev, struct hashmap_entry **entry) hashmap_find_entry() argument
|
/third_party/node/lib/internal/crypto/ |
H A D | ec.js | 284 function ecdsaSignVerify(key, data, { name, hash }, signature) { 291 const hashname = normalizeHashName(hash.name);
|
/third_party/node/deps/v8/tools/release/ |
H A D | test_mergeinfo.py | 76 def _get_branches(self, hash): 77 return mergeinfo.get_branches_for_commit(self.base_dir, hash)
|