/fuchsia/zircon/system/ulib/zircon-internal/include/lib/zircon-internal/ |
H A D | fnv1hash.h | 40 uint32_t hash = FNV32_OFFSET_BASIS; local 41 hash = (hash ^ (n & 0xFF)) * FNV32_PRIME; n >>= 8; 42 hash = (hash ^ (n & 0xFF)) * FNV32_PRIME; n >>= 8; 43 hash = (hash ^ (n & 0xFF)) * FNV32_PRIME; n >>= 8; 44 hash = (hash ^ n) * FNV32_PRIME; 45 return ((hash >> bit [all...] |
/fuchsia/zircon/system/ulib/fvm/ |
H A D | fvm.cpp | 40 // Validate the metadata's hash value. 46 reinterpret_cast<const void*>(header->hash + sizeof(header->hash)); 47 uint8_t empty_hash[sizeof(header->hash)]; 52 digest.Update(metadata, offsetof(fvm::fvm_t, hash)); 55 metadata_size - (offsetof(fvm::fvm_t, hash) + sizeof(header->hash))); 57 return digest == header->hash; 90 memset(header->hash, 0, sizeof(header->hash)); [all...] |
/fuchsia/zircon/third_party/ulib/jemalloc/include/jemalloc/internal/ |
H A D | ckh_structs.h | 27 * Minimum and current number of hash table buckets. There are 34 ckh_hash_t *hash; member in struct:ckh_s
|
H A D | ckh_externs.h | 6 bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
|
H A D | hash_inlines.h | 5 * The following hash function is based on MurmurHash3, placed into the public 16 void hash(const void *key, size_t len, const uint32_t seed, 321 hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) function
|
H A D | private_namespace.h | 222 #define hash JEMALLOC_N(hash) macro
|
H A D | private_unnamespace.h | 222 #undef hash macro
|
/fuchsia/zircon/third_party/ulib/cryptolib/include/lib/crypto/ |
H A D | cryptolib.h | 46 // Returns 1 if OK. Trashes hash. 50 struct clHASH_CTX* hash /* not const! */); 52 // Generic hash interface ---------------------------------------- 60 const uint8_t* _2Kpkcs15hashpad; // hash of 2K bit padding. 79 clHASH_CTX hash; member in struct:clHMAC_CTX 83 #define clHMAC_update(ctx, data, len) clHASH_update(&(ctx)->hash, data, len) 84 #define clHMAC_size(ctx) clHASH_size(&(ctx)->hash)
|
/fuchsia/zircon/third_party/ulib/musl/src/network/ |
H A D | if_nameindex.c | 21 unsigned int hash[IFADDRS_HASH_SIZE]; member in struct:ifnameindexctx 52 i = ctx->hash[bucket]; 77 map->hash_next = ctx->hash[bucket]; 78 ctx->hash[bucket] = ctx->num;
|
H A D | getifaddrs.c | 43 struct ifaddrs_storage* hash[IFADDRS_HASH_SIZE]; member in struct:ifaddrs_ctx 122 for (ifs0 = ctx->hash[ifa->ifa_index % IFADDRS_HASH_SIZE]; ifs0; ifs0 = ifs0->hash_next) 161 ifs->hash_next = ctx->hash[bucket]; 162 ctx->hash[bucket] = ifs;
|
/fuchsia/zircon/third_party/ulib/cryptolib/ |
H A D | cryptolib.c | 70 clHASH_init(&ctx->hash); 71 clHASH_update(&ctx->hash, key, len); 72 memcpy(&ctx->opad[0], clHASH_final(&ctx->hash), clHASH_size(&ctx->hash)); 81 clHASH_init(&ctx->hash); 82 clHASH_update(&ctx->hash, ctx->opad, sizeof(ctx->opad)); // hash ipad 91 memcpy(digest, clHASH_final(&ctx->hash), sizeof(digest)); 92 clHASH_init(&ctx->hash); 93 clHASH_update(&ctx->hash, ct 436 clRSA2K_verify(const clBignumModulus* key, const uint8_t* signature, const int len, clHASH_CTX* hash) argument [all...] |
/fuchsia/zircon/third_party/ulib/jemalloc/src/ |
H A D | ckh.c | 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash 14 * alternative to traditional hash tables. In Proceedings of the 7th 18 * This implementation uses precisely two hash functions because that is the 77 ckh->hash(key, hashes); 160 ckh->hash(key, hashes); 202 ckh->hash(key, hashes); 221 * Try to rebuild the hash table from scratch by inserting all items from the 355 ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash, argument 363 assert(hash ! [all...] |
H A D | prof.c | 77 * Global hash of (prof_bt_t *)-->(prof_gctx_t *). This is the master data 1834 hash(bt->vec, bt->len * sizeof(void *), 0x94122f33U, r_hash);
|
/fuchsia/zircon/third_party/ulib/ngunwind/src/dwarf/ |
H A D | Gparser.c | 528 cache->hash[i] = -1; 567 hash (unw_word_t ip) function 595 index = cache->hash[hash (ip)]; 630 /* remove the old rs from the hash table (if it's there): */ 633 index = hash (rs->ip); 634 tmp = cache->buckets + cache->hash[index]; 643 cache->hash[index] = tmp->coll_chain; 649 /* old rs wasn't in the hash-table */ 655 /* enter new rs in the hash tabl [all...] |
/fuchsia/zircon/system/ulib/fvm/include/fvm/ |
H A D | fvm.h | 35 uint8_t hash[SHA256_DIGEST_LENGTH]; member in struct:fvm::__anon1135 150 // Update's the metadata's hash field to accurately reflect
|
/fuchsia/zircon/system/ulib/inet6/ |
H A D | inet6.c | 150 static_assert(MAC_TBL_BUCKETS == 256, "hash algorithms must be updated"); 151 uint32_t hash = fnv1a32(ip, sizeof(*ip)); local 152 return ((hash >> 8) ^ hash) & 0xff;
|
/fuchsia/zircon/third_party/ulib/ngunwind/include/ngunwind/ |
H A D | dwarf.h | 245 unsigned short coll_chain; /* used for hash collisions */ 321 /* hash table that maps instruction pointer to rs index: */ 322 unsigned short hash[DWARF_UNW_HASH_SIZE]; member in struct:dwarf_rs_cache
|
/fuchsia/zircon/system/ulib/intel-hda/include/intel-hda/utils/ |
H A D | intel-audio-dsp-ipc.h | 510 uint8_t hash[32]; member in struct:audio::intel_hda::ModuleEntry
|
/fuchsia/zircon/make/ |
H A D | engine.mk | 220 --hash-style=gnu --eh-frame-hdr
|