Home
last modified time | relevance | path

Searched refs:hash (Results 2201 - 2225 of 4046) sorted by relevance

1...<<81828384858687888990>>...162

/third_party/ffmpeg/libavformat/
H A Drtmpproto.c110 char* swfhash; ///< SHA256 hash of the decompressed SWF file (32 bytes)
111 int swfhash_len; ///< length of the SHA256 hash
114 char* swfverify; ///< URL to player swf file, compute hash/size automatically
115 char swfverification[42]; ///< hash of the SWF verification
1177 /* Compute the SHA256 hash of the SWF player file. */ in rtmp_calc_swfhash()
1284 /* Generate SWFVerification token (SHA256 HMAC hash of decompressed SWF, in rtmp_handshake()
1610 uint8_t hash[16]; in do_adobe_auth() local
1611 char hashstr[AV_BASE64_SIZE(sizeof(hash))], challenge2[10]; in do_adobe_auth()
1622 av_md5_final(md5, hash); in do_adobe_auth()
1623 av_base64_encode(hashstr, sizeof(hashstr), hash, in do_adobe_auth()
1648 uint8_t hash[16]; do_llnw_auth() local
[all...]
/third_party/python/Lib/test/
H A Dtest_builtin.py962 hash(None)
963 self.assertEqual(hash(1), hash(1))
964 self.assertEqual(hash(1), hash(1.0))
965 hash('spam')
966 self.assertEqual(hash('spam'), hash(b'spam'))
967 hash((0,1,2,3))
969 hash(
[all...]
/third_party/icu/icu4c/source/common/
H A Ducurr.cpp32 #include "hash.h"
112 // Constructor. hash stores the equivalence relationships; s is the string
114 inline EquivIterator(const icu::Hashtable& hash, const icu::UnicodeString& s) in EquivIterator() argument
115 : _hash(hash) { in EquivIterator()
146 // relations in hash accordingly.
150 icu::Hashtable* hash, UErrorCode &status) { in makeEquivalent()
158 icu::EquivIterator leftIter(*hash, lhs); in makeEquivalent()
159 icu::EquivIterator rightIter(*hash, rhs); in makeEquivalent()
202 hash->put(lhs, (void *) newFirstLeft, status); in makeEquivalent()
203 hash in makeEquivalent()
147 makeEquivalent( const icu::UnicodeString &lhs, const icu::UnicodeString &rhs, icu::Hashtable* hash, UErrorCode &status) makeEquivalent() argument
209 countEquivalent(const icu::Hashtable &hash, const icu::UnicodeString &s) countEquivalent() argument
2204 populateCurrSymbolsEquiv(icu::Hashtable *hash, UErrorCode &status) populateCurrSymbolsEquiv() argument
[all...]
/third_party/node/deps/icu-small/source/common/
H A Ducurr.cpp35 #include "hash.h"
115 // Constructor. hash stores the equivalence relationships; s is the string
117 inline EquivIterator(const icu::Hashtable& hash, const icu::UnicodeString& s) in EquivIterator() argument
118 : _hash(hash) { in EquivIterator()
149 // relations in hash accordingly.
153 icu::Hashtable* hash, UErrorCode &status) { in makeEquivalent()
161 icu::EquivIterator leftIter(*hash, lhs); in makeEquivalent()
162 icu::EquivIterator rightIter(*hash, rhs); in makeEquivalent()
205 hash->put(lhs, (void *) newFirstLeft, status); in makeEquivalent()
206 hash in makeEquivalent()
150 makeEquivalent( const icu::UnicodeString &lhs, const icu::UnicodeString &rhs, icu::Hashtable* hash, UErrorCode &status) makeEquivalent() argument
212 countEquivalent(const icu::Hashtable &hash, const icu::UnicodeString &s) countEquivalent() argument
2230 populateCurrSymbolsEquiv(icu::Hashtable *hash, UErrorCode &status) populateCurrSymbolsEquiv() argument
[all...]
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-debug.cc31 #include "src/objects/hash-table-inl.h"
339 CHECK_GT(hash(), 0); in SymbolVerify()
1435 CHECK_EQ(swiss_table::H2(name.hash()), ctrl); in SwissNameDictionaryVerify()
1648 CHECK_NE(hash(), 0); in ModuleVerify()
2084 uint32_t hash = key.hash(); in IsSortedNoDuplicates() local
2085 if (hash < current) { in IsSortedNoDuplicates()
2089 current = hash; in IsSortedNoDuplicates()
2103 uint32_t hash = key.hash(); in IsSortedNoDuplicates() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ducurr.cpp32 #include "hash.h"
112 // Constructor. hash stores the equivalence relationships; s is the string
114 inline EquivIterator(const icu::Hashtable& hash, const icu::UnicodeString& s) in EquivIterator() argument
115 : _hash(hash) { in EquivIterator()
146 // relations in hash accordingly.
150 icu::Hashtable* hash, UErrorCode &status) { in makeEquivalent()
158 icu::EquivIterator leftIter(*hash, lhs); in makeEquivalent()
159 icu::EquivIterator rightIter(*hash, rhs); in makeEquivalent()
202 hash->put(lhs, (void *) newFirstLeft, status); in makeEquivalent()
203 hash in makeEquivalent()
147 makeEquivalent( const icu::UnicodeString &lhs, const icu::UnicodeString &rhs, icu::Hashtable* hash, UErrorCode &status) makeEquivalent() argument
209 countEquivalent(const icu::Hashtable &hash, const icu::UnicodeString &s) countEquivalent() argument
2178 populateCurrSymbolsEquiv(icu::Hashtable *hash, UErrorCode &status) populateCurrSymbolsEquiv() argument
[all...]
/base/security/huks/interfaces/inner_api/huks_standard/source/
H A Dhks_api.c474 const struct HksBlob *srcData, struct HksBlob *hash) in HksHash()
478 if ((paramSet == NULL) || (srcData == NULL) || (hash == NULL)) { in HksHash()
481 int32_t ret = HksLocalHash(paramSet, srcData, hash); in HksHash()
487 (void)hash; in HksHash()
473 HksHash(const struct HksParamSet *paramSet, const struct HksBlob *srcData, struct HksBlob *hash) HksHash() argument
/kernel/linux/linux-5.10/crypto/
H A Dvmac.c39 #include <crypto/internal/hash.h>
66 u64 polytmp[2*VMAC_TAG_LEN/64]; /* running total of L2-hash */
137 * Here these two hash functions are defined multiple time; once for
397 /* L1 and L2-hash one or more VMAC_NHBYTES-byte blocks */
541 /* L1 and L2-hash the final block if needed */ in vhash_final()
557 /* L3-hash the 128-bit output of L2-hash */ in vhash_final()
566 u64 hash, pad; in vmac_final() local
581 hash = vhash_final(tctx, dctx); in vmac_final()
592 put_unaligned_be64(hash in vmac_final()
[all...]
/kernel/linux/linux-5.10/scripts/gcc-plugins/
H A Drandomize_layout_plugin.c69 unsigned long hash = 0; in name_hash() local
72 hash = partial_name_hash(*name++, hash); in name_hash()
73 return (unsigned int)hash; in name_hash()
/kernel/linux/linux-5.10/fs/hfsplus/
H A Dbnode.c405 int size, block, i, hash; in __hfs_bnode_create() local
429 hash = hfs_bnode_hash(cnid); in __hfs_bnode_create()
430 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
431 tree->node_hash[hash] = node; in __hfs_bnode_create()
/kernel/linux/linux-5.10/fs/nfsd/
H A Dnfs4layouts.c75 list_for_each_entry(old, &nfsd_devid_hash[i], hash) { in nfsd4_alloc_devid_map()
88 list_add_tail_rcu(&map->hash, &nfsd_devid_hash[devid_hashfn(map->idx)]); in nfsd4_alloc_devid_map()
103 list_for_each_entry_rcu(map, &nfsd_devid_hash[devid_hashfn(idx)], hash) in nfsd4_find_devid_map()
783 list_for_each_entry_safe(map, n, &nfsd_devid_hash[i], hash) in nfsd4_exit_pnfs()
/kernel/linux/linux-5.10/net/ieee802154/
H A Dsocket.c403 .hash = raw_hash,
966 .hash = dgram_hash,
1048 if (sk->sk_prot->hash) { in ieee802154_create()
1049 rc = sk->sk_prot->hash(sk); in ieee802154_create()
/kernel/linux/linux-5.10/net/netfilter/
H A Dnf_conntrack_expect.c24 #include <net/netns/hash.h>
81 unsigned int hash, seed; in nf_ct_expect_dst_hash() local
87 hash = jhash2(tuple->dst.u3.all, ARRAY_SIZE(tuple->dst.u3.all), in nf_ct_expect_dst_hash()
91 return reciprocal_scale(hash, nf_ct_expect_hsize); in nf_ct_expect_dst_hash()
178 /* If master is not in hash table yet (ie. packet hasn't left in nf_ct_find_expectation()
376 /* two references : one for hash insert, one for the timer */ in nf_ct_expect_insert()
/kernel/linux/linux-6.6/fs/nfsd/
H A Dnfs4layouts.c75 list_for_each_entry(old, &nfsd_devid_hash[i], hash) { in nfsd4_alloc_devid_map()
88 list_add_tail_rcu(&map->hash, &nfsd_devid_hash[devid_hashfn(map->idx)]); in nfsd4_alloc_devid_map()
103 list_for_each_entry_rcu(map, &nfsd_devid_hash[devid_hashfn(idx)], hash) in nfsd4_find_devid_map()
784 list_for_each_entry_safe(map, n, &nfsd_devid_hash[i], hash) in nfsd4_exit_pnfs()
/kernel/linux/linux-6.6/fs/hfsplus/
H A Dbnode.c398 int size, block, i, hash; in __hfs_bnode_create() local
422 hash = hfs_bnode_hash(cnid); in __hfs_bnode_create()
423 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
424 tree->node_hash[hash] = node; in __hfs_bnode_create()
/kernel/linux/linux-6.6/arch/x86/kernel/cpu/sgx/
H A Dioctl.c460 void *hash) in __sgx_get_key_hash()
466 return crypto_shash_digest(shash, modulus, SGX_MODULUS_SIZE, hash); in __sgx_get_key_hash()
469 static int sgx_get_key_hash(const void *modulus, void *hash) in sgx_get_key_hash() argument
478 ret = __sgx_get_key_hash(tfm, modulus, hash); in sgx_get_key_hash()
459 __sgx_get_key_hash(struct crypto_shash *tfm, const void *modulus, void *hash) __sgx_get_key_hash() argument
/kernel/linux/linux-6.6/crypto/
H A Dvmac.c40 #include <crypto/internal/hash.h>
67 u64 polytmp[2*VMAC_TAG_LEN/64]; /* running total of L2-hash */
138 * Here these two hash functions are defined multiple time; once for
398 /* L1 and L2-hash one or more VMAC_NHBYTES-byte blocks */
542 /* L1 and L2-hash the final block if needed */ in vhash_final()
558 /* L3-hash the 128-bit output of L2-hash */ in vhash_final()
567 u64 hash, pad; in vmac_final() local
582 hash = vhash_final(tctx, dctx); in vmac_final()
593 put_unaligned_be64(hash in vmac_final()
[all...]
/kernel/linux/linux-6.6/scripts/gcc-plugins/
H A Drandomize_layout_plugin.c51 unsigned long hash = 0; in name_hash() local
54 hash = partial_name_hash(*name++, hash); in name_hash()
55 return (unsigned int)hash; in name_hash()
/kernel/linux/linux-6.6/security/keys/trusted-keys/
H A Dtrusted_tpm1.c18 #include <crypto/hash.h>
725 {Opt_hash, "hash=%s"},
750 opt->hash = tpm2 ? HASH_ALGO_SHA256 : HASH_ALGO_SHA1; in getoptions()
791 * passwords (although it can take a hash as well) in getoptions()
832 opt->hash = i; in getoptions()
844 digest_len = hash_digest_size[opt->hash]; in getoptions()
/kernel/linux/linux-6.6/net/ieee802154/
H A Dsocket.c402 .hash = raw_hash,
963 .hash = dgram_hash,
1044 if (sk->sk_prot->hash) { in ieee802154_create()
1045 rc = sk->sk_prot->hash(sk); in ieee802154_create()
/kernel/linux/linux-6.6/net/netfilter/
H A Dnf_conntrack_expect.c24 #include <net/netns/hash.h>
91 u32 hash; in nf_ct_expect_dst_hash() local
103 hash = siphash(&combined, sizeof(combined), &nf_ct_expect_hashrnd); in nf_ct_expect_dst_hash()
105 return reciprocal_scale(hash, nf_ct_expect_hsize); in nf_ct_expect_dst_hash()
194 /* If master is not in hash table yet (ie. packet hasn't left in nf_ct_find_expectation()
393 /* two references : one for hash insert, one for the timer */ in nf_ct_expect_insert()
/third_party/curl/lib/
H A Dhostip.c50 #include "hash.h"
312 dns = NULL; /* the memory deallocation is being handled by the hash */ in fetch_addr()
338 dns = NULL; /* the memory deallocation is being handled by the hash */ in fetch_addr()
1080 void Curl_init_dnscache(struct Curl_hash *hash, int size) in Curl_init_dnscache() argument
1082 Curl_hash_init(hash, size, Curl_hash_str, Curl_str_key_compare, in Curl_init_dnscache()
1094 struct Curl_hash *hash) in Curl_hostcache_clean()
1099 Curl_hash_clean(hash); in Curl_hostcache_clean()
1093 Curl_hostcache_clean(struct Curl_easy *data, struct Curl_hash *hash) Curl_hostcache_clean() argument
/third_party/gn/src/gn/
H A Dxcode_writer.cc353 std::string hash = base::SHA1HashString(buffer.str()); variable
354 DCHECK_EQ(hash.size() % 4, 0u);
357 const uint32_t* ptr = reinterpret_cast<const uint32_t*>(hash.data());
358 for (size_t i = 0; i < hash.size() / 4; i++)
/third_party/mbedtls/3rdparty/p256-m/p256-m/
H A Dp256-m.c1287 * Import integer mod n (Montgomery domain) from hash
1324 const uint8_t *hash, size_t hlen) in p256_ecdsa_sign()
1362 /* 4. Skipped - we take the hash as an input, not the message */ in p256_ecdsa_sign()
1364 /* 5. Derive an integer from the hash */ in p256_ecdsa_sign()
1365 ecdsa_m256_from_hash(t3, hash, hlen); /* t3 = e */ in p256_ecdsa_sign()
1398 const uint8_t *hash, size_t hlen) in p256_ecdsa_verify()
1416 /* 2. Skipped - we take the hash as an input, not the message */ in p256_ecdsa_verify()
1418 /* 3. Derive an integer from the hash */ in p256_ecdsa_verify()
1420 ecdsa_m256_from_hash(e, hash, hlen); in p256_ecdsa_verify()
1323 p256_ecdsa_sign(uint8_t sig[64], const uint8_t priv[32], const uint8_t *hash, size_t hlen) p256_ecdsa_sign() argument
1397 p256_ecdsa_verify(const uint8_t sig[64], const uint8_t pub[64], const uint8_t *hash, size_t hlen) p256_ecdsa_verify() argument
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_pipeline_cache.c132 radv_hash_shaders(unsigned char *hash, const struct radv_pipeline_stage *stages, in radv_hash_shaders() argument
151 _mesa_sha1_final(&ctx, hash); in radv_hash_shaders()
155 radv_hash_rt_shaders(unsigned char *hash, const VkRayTracingPipelineCreateInfoKHR *pCreateInfo, in radv_hash_rt_shaders() argument
205 _mesa_sha1_final(&ctx, hash); in radv_hash_rt_shaders()
229 unreachable("hash table should never be full"); in radv_pipeline_cache_search_unlocked()
305 /* Failing to grow that hash table isn't fatal, but may mean we don't in radv_pipeline_cache_add_entry()

Completed in 38 milliseconds

1...<<81828384858687888990>>...162