Home
last modified time | relevance | path

Searched refs:hash (Results 926 - 950 of 2318) sorted by relevance

1...<<31323334353637383940>>...93

/third_party/mesa3d/src/gallium/winsys/virgl/vtest/
H A Dvirgl_vtest_winsys.c420 unsigned hash = res->res_handle & (sizeof(cbuf->is_handle_added)-1); in virgl_vtest_lookup_res() local
423 if (cbuf->is_handle_added[hash]) { in virgl_vtest_lookup_res()
424 i = cbuf->reloc_indices_hashlist[hash]; in virgl_vtest_lookup_res()
430 cbuf->reloc_indices_hashlist[hash] = i; in virgl_vtest_lookup_res()
454 unsigned hash = res->res_handle & (sizeof(cbuf->is_handle_added)-1); in virgl_vtest_add_res() local
472 cbuf->is_handle_added[hash] = TRUE; in virgl_vtest_add_res()
474 cbuf->reloc_indices_hashlist[hash] = cbuf->cres; in virgl_vtest_add_res()
/third_party/libwebsockets/lib/tls/openssl/
H A Dopenssl-client.c733 uint8_t hash[32]; local
772 * For that reason, use a hash to fingerprint the context configuration
826 len = sizeof(hash);
827 EVP_DigestFinal_ex(mdctx, hash, &len);
836 if (!memcmp(hash, tcr->hash, len)) {
887 memcpy(tcr->hash, hash, len);
/third_party/python/Lib/
H A Ddataclasses.py279 'hash',
287 def __init__(self, default, default_factory, init, repr, hash, compare,
295 self.hash = hash
312 f'hash={self.hash!r},'
369 hash=None, compare=True, metadata=None, kw_only=MISSING):
376 object's repr(). If hash is true, the field will be included in the
377 object's hash(). If compare is true, the field will be used in
388 return Field(default, default_factory, init, repr, hash, compar
[all...]
/third_party/skia/third_party/externals/brotli/research/
H A Ddurchschlag.cc285 TextIdx hash = 0; in durchschlag_prepare() local
290 hash = (((hash << lShift) | (hash >> rShift)) & hashMask) ^ v; in durchschlag_prepare()
302 TextIdx bucket = (((hash << lShift) | (hash >> rShift)) & hashMask) ^ v; in durchschlag_prepare()
304 hash = bucket ^ (((v << lShiftX) | (v >> rShiftX)) & hashMask); in durchschlag_prepare()
/third_party/protobuf/src/google/protobuf/
H A Dmap_field.h802 struct hash<::PROTOBUF_NAMESPACE_ID::MapKey> { struct
812 return hash<std::string>()(map_key.GetStringValue()); in operator ()()
815 return hash<decltype(value)>()(value); in operator ()()
819 return hash<decltype(value)>()(map_key.GetInt32Value()); in operator ()()
823 return hash<decltype(value)>()(map_key.GetUInt64Value()); in operator ()()
827 return hash<decltype(value)>()(map_key.GetUInt32Value()); in operator ()()
830 return hash<bool>()(map_key.GetBoolValue()); in operator ()()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dbtree_benchmark.cc38 #include "absl/hash/hash.h"
442 #define STL_UNORDERED_TYPES_CUSTOM_HASH(value, hash) \
443 using stl_unordered_set_##value = std::unordered_set<value, hash>; \
444 using stl_unordered_map_##value = std::unordered_map<value, intptr_t, hash>; \
445 using flat_hash_set_##value = flat_hash_set<value, hash>; \
446 using flat_hash_map_##value = flat_hash_map<value, intptr_t, hash>; \
447 using stl_unordered_multiset_##value = std::unordered_multiset<value, hash>; \
449 std::unordered_multimap<value, intptr_t, hash>
/third_party/vk-gl-cts/modules/gles3/stress/
H A Des3sDrawTests.cpp598 deUint32 hash = spec.hash(); in init() local
600 hash = (hash << 2) ^ (deUint32)spec.attribs[attrNdx].hash(); in init()
602 if (insertedHashes.find(hash) == insertedHashes.end()) in init()
608 insertedHashes.insert(hash); in init()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/common/
H A Ddpp_reconfig.c23 static void dpp_build_attr_csign_key_hash(struct wpabuf *msg, const u8 *hash) in dpp_build_attr_csign_key_hash() argument
25 if (hash) { in dpp_build_attr_csign_key_hash()
29 wpabuf_put_data(msg, hash, SHA256_MAC_LEN); in dpp_build_attr_csign_key_hash()
43 u8 hash[SHA256_MAC_LEN]; in dpp_build_reconfig_announcement() local
75 res = sha256_vector(1, addr, len, hash); in dpp_build_reconfig_announcement()
80 hash, SHA256_MAC_LEN); in dpp_build_reconfig_announcement()
101 dpp_build_attr_csign_key_hash(msg, hash); in dpp_build_reconfig_announcement()
/base/global/i18n/frameworks/intl/src/
H A Dsignature_verifier.cpp243 int SignatureVerifier::CalcFileShaOriginal(const std::string& filePath, unsigned char* hash) in CalcFileShaOriginal() argument
245 if (filePath.empty() || hash == nullptr || !IsLegalPath(filePath)) { in CalcFileShaOriginal()
259 SHA256_Final(hash, &ctx); in CalcFileShaOriginal()
/base/security/device_auth/services/identity_manager/src/
H A Didentity_pin.c244 uint8_t hash[SHA256_LEN] = { 0 }; in AuthGeneratePskUsePin() local
245 Uint8Buff hashBuf = { hash, sizeof(hash) }; in AuthGeneratePskUsePin()
/foundation/graphic/graphic_2d/rosen/modules/render_service_base/src/render/
H A Drs_fly_out_shader_filter.cpp44 hash_ = SkOpts::hash(&type_, sizeof(type_), 0); in RSFlyOutShaderFilter()
45 hash_ = SkOpts::hash(&degree_, sizeof(degree_), hash_); in RSFlyOutShaderFilter()
46 hash_ = SkOpts::hash(&flyMode_, sizeof(flyMode_), hash_); in RSFlyOutShaderFilter()
/foundation/multimedia/media_library/frameworks/utils/src/
H A Dmedialibrary_common_utils.cpp80 unsigned char hash[SHA256_DIGEST_LENGTH] = ""; in GenKey() local
84 SHA256_Final(hash, &ctx); in GenKey()
86 /* here we translate sha256 hash to hexadecimal. each 8-bit char will be presented by two characters([0-9a-f]) */ in GenKey()
87 Char2Hex(hash, SHA256_DIGEST_LENGTH, key); in GenKey()
/third_party/icu/icu4c/source/i18n/
H A Dscriptset.cpp167 int32_t hash = 0; in hashCode() local
169 hash ^= bits[i]; in hashCode()
171 return hash; in hashCode()
/third_party/lzma/CPP/7zip/UI/Common/
H A DArchiveExtractCallback.h65 // used for hash arcs only, when we open external files
462 void SetHashMethods(IHashCalc *hash)
464 if (!hash)
468 _hashStreamSpec->_hash = hash;
/third_party/jinja2/
H A Dbccache.py153 """Returns the unique hash key for this template name."""
154 hash = sha1(name.encode("utf-8"))
157 hash.update(f"|{filename}".encode())
159 return hash.hexdigest()
/third_party/mesa3d/src/etnaviv/drm/
H A Detnaviv_cmd_stream.c178 uint32_t hash = _mesa_hash_pointer(bo); in bo2idx() local
182 entry = _mesa_hash_table_search_pre_hashed(priv->bo_table, hash, bo); in bo2idx()
188 _mesa_hash_table_insert_pre_hashed(priv->bo_table, hash, bo, in bo2idx()
/third_party/mesa3d/src/compiler/glsl/
H A Dgl_nir_lower_samplers_as_deref.c199 uint32_t hash = _mesa_hash_string(name); in lower_deref() local
201 _mesa_hash_table_search_pre_hashed(state->remap_table, hash, name); in lower_deref()
216 _mesa_hash_table_insert_pre_hashed(state->remap_table, hash, name, var); in lower_deref()
/third_party/node/lib/internal/process/
H A Dpre_execution.js562 const hash = createHash(algorithm);
563 hash.update(src);
564 const digest = hash.digest();
/third_party/node/test/pummel/
H A Dtest-policy-integrity-parent-no-package-json.js27 function hash(algo, body) { function
265 integrities: hash('sha256', ''),
283 integrities: hash('sha256', parentBody[parentFormat]),
/third_party/node/deps/cares/src/lib/
H A Dares__htable.c37 ares__htable_hashfunc_t hash; member
46 * hash collisions we would have O(log n) worst case insert and search
48 * support sort). That said, risk with a random hash seed is near zero,
60 * doesn't have to be super secure, just quick. Likelihood of a hash in ares__htable_generate_seed()
119 htable->hash = hash_func; in ares__htable_create()
168 * the hash of the function reduced to the size of the bucket list.
169 * We are doing "hash & (size - 1)" since we are guaranteeing a power of
170 * 2 for size. This is equivalent to "hash % size", but should be more
172 #define HASH_IDX(h, key) h->hash(key, h->seed) & (h->size - 1)
206 * new hash arra in ares__htable_expand()
[all...]
/third_party/mesa3d/src/mesa/main/
H A Dhash.c2 * \file hash.c
3 * Generic hash table.
6 * buffer objects, etc. The hash functions are thread-safe.
39 #include "hash.h"
46 * Create a new hash table.
48 * \return pointer to a new, empty hash table.
77 * Delete a hash table.
78 * Frees each entry on the hash table and then the hash table structure itself.
82 * \param table the hash tabl
185 uint32_t hash = uint_hash(key); _mesa_HashInsert_unlocked() local
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dscriptset.cpp167 int32_t hash = 0; in hashCode() local
169 hash ^= bits[i]; in hashCode()
171 return hash; in hashCode()
/third_party/node/deps/v8/src/diagnostics/
H A Dbasic-block-profiler.cc40 void BasicBlockProfilerData::SetHash(int hash) { hash_ = hash; }
91 hash_ = js_heap_data.hash(); in CopyFromJSHeap()
/third_party/node/deps/v8/src/objects/
H A Dswiss-name-dictionary.h16 #include "src/objects/swiss-hash-table-helpers.h"
41 // identity hash: 4 bytes, raw int32_t
45 // For each logical bucket of the hash table, contains the corresponding key
50 // entry in the hash table, the 7 lowest bits of the key's hash. The first
139 inline void SetHash(int hash);
290 inline int FindFirstEmpty(uint32_t hash);
323 static inline swiss_table::ProbeSequence<Group::kWidth> probe(uint32_t hash,
H A Djs-weak-refs-inl.h42 // lookup is keyed on the token's identity hash instead of the token itself. in RegisterWeakCellWithUnregisterToken()
81 // If the token doesn't have a hash, it was not used as a key inside any hash in RemoveUnregisterToken()
83 Object hash = unregister_token.GetHash(); in RemoveUnregisterToken() local
84 if (hash.IsUndefined(isolate)) { in RemoveUnregisterToken()
87 uint32_t key = Smi::ToInt(hash); in RemoveUnregisterToken()
121 // weak_cell has a different unregister token with the same key (hash in RemoveUnregisterToken()

Completed in 20 milliseconds

1...<<31323334353637383940>>...93