Home
last modified time | relevance | path

Searched refs:hash (Results 801 - 825 of 4317) sorted by relevance

1...<<31323334353637383940>>...173

/third_party/mbedtls/programs/pkey/
H A Dpk_sign.c44 unsigned char hash[32]; in main() local
94 * Compute the SHA-256 hash of the input file, in main()
95 * then calculate the signature of the hash. in main()
102 argv[2], hash)) != 0) { in main()
107 if ((ret = mbedtls_pk_sign(&pk, MBEDTLS_MD_SHA256, hash, 0, in main()
H A Dpk_verify.c40 unsigned char hash[32]; in main() local
89 * Compute the SHA-256 hash of the input file and in main()
97 argv[2], hash)) != 0) { in main()
102 if ((ret = mbedtls_pk_verify(&pk, MBEDTLS_MD_SHA256, hash, 0, in main()
/third_party/node/test/node-api/test_policy/
H A Dtest_policy.js16 function hash(algo, body) { function
55 integrity: `sha256-${hash('sha256', depBody)}`,
59 integrity: `sha256akjsalkjdlaskjdk-${hash('sha256', depBody)}`,
/third_party/node/test/parallel/
H A Dtest-url-parse-query.js26 hash: '#frag',
50 hash: null,
64 hash: null,
H A Dtest-webcrypto-util.js16 const algorithm = { name: 'ECDSA', hash: 'SHA-256' }; property
18 assert.deepStrictEqual(algorithm, { name: 'ECDSA', hash: 'SHA-256' });
/third_party/lwip/src/netif/ppp/
H A Dchap-md5.c67 unsigned char hash[MD5_HASH_SIZE]; in chap_md5_verify_response() local
75 /* Generate hash of ID, secret, challenge */ in chap_md5_verify_response()
81 lwip_md5_finish(&ctx, hash); in chap_md5_verify_response()
84 /* Test if our hash matches the peer's response */ in chap_md5_verify_response()
85 if (memcmp(hash, response, MD5_HASH_SIZE) == 0) { in chap_md5_verify_response()
/third_party/mesa3d/src/gallium/drivers/iris/
H A Diris_border_color.c38 * colors are the same (typically black or white), we maintain a hash
109 uint32_t hash = color_hash(color); in iris_upload_border_color() local
114 _mesa_hash_table_search_pre_hashed(pool->ht, hash, color); in iris_upload_border_color()
134 _mesa_hash_table_insert_pre_hashed(pool->ht, hash, pool->map + offset, in iris_upload_border_color()
/third_party/skia/third_party/externals/swiftshader/src/Device/
H A DVertexProcessor.hpp91 uint32_t hash; member
114 struct hash<sw::VertexProcessor::State> struct
118 return state.hash; in operator ()()
/third_party/vk-gl-cts/modules/internal/
H A DditImageIOTests.cpp64 const deUint32 hash = deMemoryHash(texture.getAccess().getDataPtr(), imageSize); in iterate() local
66 if (hash != m_expectedHash) in iterate()
68 m_testCtx.getLog() << TestLog::Message << "ERROR: expected hash " << tcu::toHex(m_expectedHash) << ", got " << tcu::toHex(hash) << TestLog::EndMessage; in iterate()
/kernel/linux/linux-5.10/net/unix/
H A Daf_unix.c128 unsigned long hash = (unsigned long)addr; in unix_sockets_unbound() local
130 hash ^= hash >> 16; in unix_sockets_unbound()
131 hash ^= hash >> 8; in unix_sockets_unbound()
132 hash %= UNIX_HASH_SIZE; in unix_sockets_unbound()
133 return &unix_socket_table[UNIX_HASH_SIZE + hash]; in unix_sockets_unbound()
136 #define UNIX_ABSTRACT(sk) (unix_sk(sk)->addr->hash < UNIX_HASH_SIZE)
168 * hash table is protected with spinlock unix_table_lock
174 unsigned int hash in unix_hash_fold() local
279 __unix_find_socket_byname(struct net *net, struct sockaddr_un *sunname, int len, int type, unsigned int hash) __unix_find_socket_byname() argument
298 unix_find_socket_byname(struct net *net, struct sockaddr_un *sunname, int len, int type, unsigned int hash) unix_find_socket_byname() argument
948 unix_find_other(struct net *net, struct sockaddr_un *sunname, int len, int type, unsigned int hash, int *error) unix_find_other() argument
1040 unsigned int hash; unix_bind() local
1153 unsigned int hash; unix_dgram_connect() local
1258 unsigned int hash; unix_stream_connect() local
1692 unsigned int hash; unix_dgram_sendmsg() local
[all...]
/third_party/rust/crates/libc/src/unix/linux_like/
H A Dmod.rs283 impl ::hash::Hash for epoll_event {
284 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
287 events.hash(state); in hash()
288 u64.hash(state); in hash()
311 impl ::hash::Hash for sockaddr_un {
312 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
313 self.sun_family.hash(state); in hash()
314 self.sun_path.hash(stat in hash()
342 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
398 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
430 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dsharded_mutex.h12 * where the mutex is looked up from a hash value. This can lead to collisions
24 static inline struct mutex *sharded_mutex__get_mutex(struct sharded_mutex *sm, size_t hash) in sharded_mutex__get_mutex() argument
26 return &sm->mutexes[hash_bits(hash, sm->cap_bits)]; in sharded_mutex__get_mutex()
/third_party/node/deps/openssl/openssl/crypto/lhash/
H A Dlhash_local.h16 unsigned long hash; member
22 OPENSSL_LH_HASHFUNC hash; member
/third_party/openssl/crypto/lhash/
H A Dlhash_local.h16 unsigned long hash; member
22 OPENSSL_LH_HASHFUNC hash; member
/base/global/resource_management/frameworks/resmgr/include/
H A Dtheme_pack_resource.h52 std::size_t h1 = std::hash<std::string>()(theme.bundleName); in operator ()()
53 std::size_t h2 = std::hash<std::string>()(theme.moduleName); in operator ()()
54 std::size_t h3 = std::hash<int32_t>()(theme.resType); in operator ()()
55 std::size_t h4 = std::hash<std::string>()(theme.resName); in operator ()()
56 std::size_t h5 = std::hash<std::string>()(theme.abilityName); in operator ()()
/foundation/multimedia/media_library/frameworks/innerkitsimpl/test/unittest/medialibrary_common_utils_test/src/
H A Dmedialibrary_common_utils_test.cpp77 unsigned char hash[64] = ""; in HWTEST_F() local
80 MediaLibraryCommonUtils::Char2Hex(hash, len, hexStr); in HWTEST_F()
86 unsigned char hash[64] = ""; in HWTEST_F() local
89 int32_t ret = MediaLibraryCommonUtils::GenKey(hash, len, key); in HWTEST_F()
92 ret = MediaLibraryCommonUtils::GenKey(hash, lenTest, key); in HWTEST_F()
/kernel/linux/linux-5.10/arch/mips/cavium-octeon/crypto/
H A Docteon-sha512.c23 #include <crypto/internal/hash.h>
171 static int octeon_sha512_final(struct shash_desc *desc, u8 *hash) in octeon_sha512_final() argument
176 __be64 *dst = (__be64 *)hash; in octeon_sha512_final()
212 static int octeon_sha384_final(struct shash_desc *desc, u8 *hash) in octeon_sha384_final() argument
218 memcpy(hash, D, 48); in octeon_sha384_final()
/kernel/linux/linux-6.6/arch/mips/cavium-octeon/crypto/
H A Docteon-sha512.c24 #include <crypto/internal/hash.h>
138 static int octeon_sha512_final(struct shash_desc *desc, u8 *hash) in octeon_sha512_final() argument
143 __be64 *dst = (__be64 *)hash; in octeon_sha512_final()
179 static int octeon_sha384_final(struct shash_desc *desc, u8 *hash) in octeon_sha384_final() argument
185 memcpy(hash, D, 48); in octeon_sha384_final()
/kernel/linux/linux-5.10/net/netfilter/
H A Dxt_RATEEST.c24 struct hlist_head hash[RATEEST_HSIZE]; member
43 hlist_add_head(&est->list, &xn->hash[h]); in xt_rateest_hash_insert()
53 hlist_for_each_entry(est, &xn->hash[h], list) { in __xt_rateest_lookup()
199 for (i = 0; i < ARRAY_SIZE(xn->hash); i++) in xt_rateest_net_init()
200 INIT_HLIST_HEAD(&xn->hash[i]); in xt_rateest_net_init()
/kernel/linux/linux-5.10/fs/dlm/
H A Ddir.c25 * We use the upper 16 bits of the hash value to select the directory node.
26 * Low bits are used for distribution of rsb's among hash buckets on each node.
29 * num_nodes to the hash value. This value in the desired range is used as an
33 int dlm_hash2nodeid(struct dlm_ls *ls, uint32_t hash) in dlm_hash2nodeid() argument
40 node = (hash >> 16) % ls->ls_total_weight; in dlm_hash2nodeid()
201 uint32_t hash, bucket; in find_rsb_root() local
204 hash = jhash(name, len, 0); in find_rsb_root()
205 bucket = hash & (ls->ls_rsbtbl_size - 1); in find_rsb_root()
/kernel/linux/linux-5.10/lib/
H A Ddigsig.c22 #include <crypto/hash.h>
196 * Normally hash of the content is used as a data for this function.
205 unsigned char hash[SHA1_DIGEST_SIZE]; in digsig_verify() local
244 crypto_shash_final(desc, hash); in digsig_verify()
250 hash, sizeof(hash)); in digsig_verify()
/kernel/linux/linux-5.10/fs/unicode/
H A Dutf8-core.c134 unsigned long hash = init_name_hash(salt); in utf8_casefold_hash() local
142 hash = partial_name_hash((unsigned char)c, hash); in utf8_casefold_hash()
144 str->hash = end_name_hash(hash); in utf8_casefold_hash()
/kernel/linux/linux-6.6/fs/dlm/
H A Ddir.c25 * We use the upper 16 bits of the hash value to select the directory node.
26 * Low bits are used for distribution of rsb's among hash buckets on each node.
29 * num_nodes to the hash value. This value in the desired range is used as an
33 int dlm_hash2nodeid(struct dlm_ls *ls, uint32_t hash) in dlm_hash2nodeid() argument
40 node = (hash >> 16) % ls->ls_total_weight; in dlm_hash2nodeid()
203 uint32_t hash, bucket; in find_rsb_root() local
206 hash = jhash(name, len, 0); in find_rsb_root()
207 bucket = hash & (ls->ls_rsbtbl_size - 1); in find_rsb_root()
/kernel/linux/linux-6.6/fs/unicode/
H A Dutf8-core.c126 unsigned long hash = init_name_hash(salt); in utf8_casefold_hash() local
134 hash = partial_name_hash((unsigned char)c, hash); in utf8_casefold_hash()
136 str->hash = end_name_hash(hash); in utf8_casefold_hash()
/kernel/linux/linux-6.6/net/netfilter/
H A Dxt_RATEEST.c24 struct hlist_head hash[RATEEST_HSIZE]; member
43 hlist_add_head(&est->list, &xn->hash[h]); in xt_rateest_hash_insert()
53 hlist_for_each_entry(est, &xn->hash[h], list) { in __xt_rateest_lookup()
200 for (i = 0; i < ARRAY_SIZE(xn->hash); i++) in xt_rateest_net_init()
201 INIT_HLIST_HEAD(&xn->hash[i]); in xt_rateest_net_init()

Completed in 14 milliseconds

1...<<31323334353637383940>>...173