HomeSort by: relevance | last modified time | path
    Searched refs:hashes (Results 1 - 25 of 86) sorted by relevancy

1 2 3 4

  /src/tests/lib/libc/stdlib/
t_mi_vector_hash.c 50 uint32_t hashes[3]; member in struct:testvector
75 uint32_t hashes[3]; local
82 mi_vector_hash(buf + j, len, 0, hashes);
83 ATF_CHECK_EQ(hashes[0], testv[i].hashes[0]);
84 ATF_CHECK_EQ(hashes[1], testv[i].hashes[1]);
85 ATF_CHECK_EQ(hashes[2], testv[i].hashes[2]);
  /src/external/bsd/jemalloc.old/dist/test/unit/
hash.c 64 VARIABLE_ARRAY(uint8_t, hashes, hashes_size);
70 memset(hashes, 0, hashes_size);
83 memcpy(&hashes[i*hashbytes], &out, hashbytes);
88 memcpy(&hashes[i*hashbytes], out, hashbytes);
93 memcpy(&hashes[i*hashbytes], out, hashbytes);
102 uint32_t out = hash_x86_32(hashes, hashes_size, 0);
107 hash_x86_128(hashes, hashes_size, 0, out);
112 hash_x64_128(hashes, hashes_size, 0, out);
  /src/external/bsd/jemalloc/dist/test/unit/
hash.c 72 VARIABLE_ARRAY_UNSAFE(uint8_t, hashes, hashes_size);
78 memset(hashes, 0, hashes_size);
91 memcpy(&hashes[i * hashbytes], &out, hashbytes);
97 memcpy(&hashes[i * hashbytes], out, hashbytes);
103 memcpy(&hashes[i * hashbytes], out, hashbytes);
114 uint32_t out = hash_x86_32(hashes, hashes_size, 0);
120 hash_x86_128(hashes, hashes_size, 0, out);
126 hash_x64_128(hashes, hashes_size, 0, out);
  /src/common/lib/libc/cdb/
cdbr.c 279 uint32_t hashes[3], idx; local
286 mi_vector_hash(key, key_len, cdbr->seed, hashes);
288 hashes[0] = fast_remainder32(hashes[0], cdbr->entries_index,
291 hashes[1] = fast_remainder32(hashes[1], cdbr->entries_index,
294 hashes[2] = fast_remainder32(hashes[2], cdbr->entries_index,
298 idx = get_uintX(cdbr->hash_base, hashes[0], cdbr->index_size);
299 idx += get_uintX(cdbr->hash_base, hashes[1], cdbr->index_size)
    [all...]
  /src/crypto/external/bsd/openssl.old/dist/crypto/x509/
by_dir.c 33 STACK_OF(BY_DIR_HASH) *hashes;
139 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
195 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
197 if (ent->dir == NULL || ent->hashes == NULL) {
262 if (type == X509_LU_CRL && ent->hashes) {
265 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
267 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
349 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
350 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
362 if (!sk_BY_DIR_HASH_push(ent->hashes, hent))
    [all...]
  /src/lib/libc/cdb/
cdbw.c 131 uint32_t hashes[3]; local
247 uint32_t hashes[3]; local
256 mi_vector_hash(key, keylen, 0, hashes);
258 head = cdbw->hash + (hashes[0] & (cdbw->hash_size - 1));
262 if (key_hash->hashes[0] != hashes[0])
264 if (key_hash->hashes[1] != hashes[1])
266 if (key_hash->hashes[2] != hashes[2]
429 uint32_t hashes[3]; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-streamer.h 53 /* The node hashes (if available). */
54 vec<hashval_t> hashes; member in struct:streamer_tree_cache_d
104 return cache->hashes[ix];
tree-streamer.cc 117 if (cache->hashes.exists ())
119 if (cache->hashes.length () == ix)
120 cache->hashes.safe_push (hash);
122 cache->hashes[ix] = hash;
197 if (cache->hashes.exists ())
411 cache->hashes.create (165);
433 c->hashes.release ();
  /src/external/gpl3/gcc/dist/gcc/
tree-streamer.cc 117 if (cache->hashes.exists ())
119 if (cache->hashes.length () == ix)
120 cache->hashes.safe_push (hash);
122 cache->hashes[ix] = hash;
197 if (cache->hashes.exists ())
411 cache->hashes.create (165);
433 c->hashes.release ();
tree-streamer.h 53 /* The node hashes (if available). */
54 vec<hashval_t> hashes; member in struct:streamer_tree_cache_d
104 return cache->hashes[ix];
  /src/external/bsd/jemalloc.old/dist/src/
ckh.c 19 * fewest that can work, and supporting multiple hashes is an implementation
25 * #hashes | 1 | 2 | 4 | 8 |
81 size_t hashes[2], bucket, cell; local
85 ckh->hash(key, hashes);
88 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
95 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
137 size_t hashes[2], bucket, tbucket; local
149 * were an item for which both hashes indicated the same
167 ckh->hash(key, hashes);
168 tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1)
205 size_t hashes[2], bucket; local
    [all...]
  /src/external/bsd/jemalloc/dist/src/
ckh.c 19 * fewest that can work, and supporting multiple hashes is an implementation
25 * #hashes | 1 | 2 | 4 | 8 |
81 size_t hashes[2], bucket, cell; local
85 ckh->hash(key, hashes);
88 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
95 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
137 size_t hashes[2], bucket, tbucket; local
149 * were an item for which both hashes indicated the same
170 ckh->hash(key, hashes);
171 tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1)
208 size_t hashes[2], bucket; local
    [all...]
  /src/common/lib/libc/stdlib/
mi_vector_hash.c 85 uint32_t hashes[3])
179 hashes[0] = a;
180 hashes[1] = b;
181 hashes[2] = c;
  /src/crypto/external/apache2/openssl/dist/crypto/x509/
by_dir.c 42 STACK_OF(BY_DIR_HASH) *hashes;
152 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
206 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
208 if (ent->dir == NULL || ent->hashes == NULL) {
274 if (type == X509_LU_CRL && ent->hashes) {
278 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
280 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
375 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
376 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
387 if (!sk_BY_DIR_HASH_push(ent->hashes, hent))
    [all...]
  /src/crypto/external/bsd/openssl/dist/crypto/x509/
by_dir.c 42 STACK_OF(BY_DIR_HASH) *hashes;
154 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
210 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
212 if (ent->dir == NULL || ent->hashes == NULL) {
278 if (type == X509_LU_CRL && ent->hashes) {
282 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
284 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
372 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
373 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
385 if (!sk_BY_DIR_HASH_push(ent->hashes, hent))
    [all...]
  /src/usr.bin/cksum/
cksum.c 121 } hashes[] = { variable in typeref:struct:hash
178 for (hash = hashes; hash->hashname != NULL; hash++)
202 while (hashes[i].hashname != NULL) {
203 if (!strcasecmp(hashes[i].hashname, optarg)) {
204 hash = &hashes[i];
349 for (nhash = hashes ;
  /src/sys/dev/usb/
if_udav.c 565 uint8_t hashes[8]; local
588 memset(hashes, 0x00, sizeof(hashes));
589 hashes[7] |= 0x80; /* broadcast address */
590 udav_csr_write(un, UDAV_MAR, hashes, sizeof(hashes));
606 hashes[h>>3] |= 1 << (h & 0x7);
616 udav_csr_write(un, UDAV_MAR, hashes, sizeof(hashes));
  /src/external/mpl/bind/dist/bin/tests/system/sig0/
tests_sig0.py 19 from cryptography.hazmat.primitives import hashes namespace
93 sig_rdata_pre_sig + msg_bytes, padding.PKCS1v15(), hashes.SHA256()
  /src/usr.sbin/syslogd/
sign.h 77 * the hashes in every SB are grouped into n divisions:
78 * * the 1st hashcount/n hashes are sent for the 1st time
79 * * the 2nd hashcount/n hashes are sent for the 2nd time
81 * * the n-th hashcount/n hashes are sent for the n-th time
104 /* the maximum number of hashes pec signature block */
106 /* number of hashes in one signature block */
134 /* queue of C-Strings (here used for hashes) */
154 struct string_queue_head hashes; member in struct:signature_group_t
sign.c 304 * signature group get hashes and need memory for them
321 STAILQ_INIT(&(x)->hashes); \
467 if (!STAILQ_EMPTY(&sg->hashes)) {
469 * for the last few message hashes */
523 && STAILQ_EMPTY(&sg->hashes)))
617 * if force==true then simply send all available hashes, e.g. on shutdown
619 * sliding window checks implicitly assume that new hashes are appended
631 size_t sg_num_hashes = 0; /* hashes in SG queue */
632 size_t hashes_in_sb = 0; /* number of hashes in current SB */
633 size_t hashes_sent = 0; /* count of hashes sent *
    [all...]
  /src/usr.bin/nbperf/
graph2.c 179 uint32_t hashes[NBPERF_MAX_HASH_SIZE]; local
196 nbperf->keys[i], nbperf->keylens[i], hashes);
199 e->vertices[j] = hashes[j] % graph->v;
  /src/external/bsd/openldap/dist/servers/slapd/
passwd.c 64 char **hashes, idNul; local
267 hashes = default_passwd_hash;
270 hashes = (char **)defhash;
274 for ( i=0; hashes[i]; i++ ) {
275 slap_passwd_hash_type( &qpw->rs_new, &hash, hashes[i], &rs->sr_text );
293 if ( hashes[i] ) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/
GlobalTypeTableBuilder.h 68 ArrayRef<GloballyHashedType> hashes() const;
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
hash.h 312 uint64_t hashes[2]; local
313 hash_x86_128(key, (int)len, seed, hashes);
314 r_hash[0] = (size_t)hashes[0];
315 r_hash[1] = (size_t)hashes[1];
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
hash.h 312 uint64_t hashes[2]; local
313 hash_x86_128(key, (int)len, seed, hashes);
314 r_hash[0] = (size_t)hashes[0];
315 r_hash[1] = (size_t)hashes[1];

Completed in 25 milliseconds

1 2 3 4