Searched refs:hash (Results 351 - 375 of 630) sorted by relevance

<<11121314151617181920>>

/freebsd-10.2-release/contrib/llvm/lib/AsmParser/
H A DLLToken.h33 hash, // # enumerator in enum:llvm::lltok::Kind
/freebsd-10.2-release/contrib/wpa/src/crypto/
H A Dcrypto.h25 * md4_vector - MD4 hash for data vector
29 * @mac: Buffer for the hash
35 * md5_vector - MD5 hash for data vector
39 * @mac: Buffer for the hash
46 * sha1_vector - SHA-1 hash for data vector
50 * @mac: Buffer for the hash
72 * sha256_vector - SHA256 hash for data vector
76 * @mac: Buffer for the hash
144 * crypto_hash_init - Initialize hash/HMAC function
146 * @key: Key for keyed hash (
[all...]
H A Dtls.h59 const u8 *hash; member in struct:tls_event_data::__anon4902
/freebsd-10.2-release/contrib/wpa/src/eap_peer/
H A Deap_i.h340 const u8 * eap_get_config_password2(struct eap_sm *sm, size_t *len, int *hash);
H A Deap_aka.c352 u8 hash[SHA256_MAC_LEN]; local
365 /* Checkcode is SHA1/SHA256 hash over all EAP-AKA/Identity packets. */
371 sha256_vector(1, &addr, &len, hash);
374 sha1_vector(1, &addr, &len, hash);
376 eap_sim_msg_add(msg, EAP_SIM_AT_CHECKCODE, 0, hash,
387 u8 hash[SHA256_MAC_LEN]; local
413 /* Checkcode is SHA1/SHA256 hash over all EAP-AKA/Identity packets. */
418 sha256_vector(1, &addr, &len, hash);
421 sha1_vector(1, &addr, &len, hash);
423 if (os_memcmp(hash, checkcod
[all...]
/freebsd-10.2-release/contrib/wpa/src/tls/
H A Dtlsv1_common.h217 tls_hash hash; member in struct:tls_cipher_suite
/freebsd-10.2-release/contrib/xz/src/liblzma/lz/
H A Dlz_encoder.h99 uint32_t *hash; member in struct:lzma_mf_s
121 /// Number of elements in hash[]
/freebsd-10.2-release/lib/libc/db/hash/
H A Dhash.h32 * @(#)hash.h 8.3 (Berkeley) 5/31/94
33 * $FreeBSD: releng/10.2/lib/libc/db/hash/hash.h 206178 2010-04-05 10:12:21Z avg $
63 int32_t magic; /* Magic NO for hash tables */
79 int32_t nkeys; /* Number of keys in hash table */
81 int32_t h_charkey; /* value of hash(CHARKEY) */
95 (*hash)(const void *, size_t); member in struct:htab
H A Dndbm.c37 __FBSDID("$FreeBSD: releng/10.2/lib/libc/db/hash/ndbm.c 165903 2007-01-09 00:28:16Z imp $");
51 #include "hash.h"
70 info.hash = NULL;
/freebsd-10.2-release/sbin/routed/
H A Dinput.c948 u_char hash[RIP_AUTH_PW_LEN]; local
989 /* Given a good hash value, these are not security
1010 "MD5 RIPv2 hash has %#x"
1020 MD5Final(hash, &md5_ctx);
1021 if (!memcmp(hash, na2->au.au_pw, sizeof(hash)))
/freebsd-10.2-release/sbin/routed/rtquery/
H A Drtquery.c606 u_char hash[RIP_AUTH_MD5_KEY_LEN]; local
750 MD5Final(hash, &md5_ctx);
751 (void)printf(" %s hash\n",
752 memcmp(hash, na->au.au_pw,
753 sizeof(hash))
/freebsd-10.2-release/contrib/binutils/bfd/
H A Delf64-sparc.c444 if (info->hash->creator != abfd->xvec
473 bfd_link_hash_lookup (info->hash, *namep, FALSE, FALSE, FALSE);
487 p->name = bfd_hash_allocate (&info->hash->table,
513 && info->hash->creator == abfd->xvec)
536 which we cannot easily keep in the symbol hash table. */
792 4, /* hash-table entry size. */
H A Di386linux.c147 /* We don't need a special hash table entry structure, but we do need
149 hash table. */
191 /* Routine to create an entry in an Linux link hash table. */
221 /* Create a Linux link hash table. */
249 /* Look up an entry in a Linux link hash table. */
256 /* Traverse a Linux link hash table. */
264 /* Get the Linux link hash table from the info structure. This is
267 #define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash))
280 f = (struct fixup *) bfd_hash_allocate (&info->hash->table,
324 /* Function to add a single symbol to the linker hash tabl
[all...]
H A Dsparclinux.c147 /* We don't need a special hash table entry structure, but we do need
149 hash table. */
191 /* Routine to create an entry in an Linux link hash table. */
221 /* Create a Linux link hash table. */
249 /* Look up an entry in a Linux link hash table. */
256 /* Traverse a Linux link hash table. */
264 /* Get the Linux link hash table from the info structure. This is
267 #define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash))
280 f = (struct fixup *) bfd_hash_allocate (&info->hash->table,
324 /* Function to add a single symbol to the linker hash tabl
[all...]
/freebsd-10.2-release/contrib/binutils/opcodes/
H A Dsparc-dis.c391 /* Build a hash table from the opcode table.
413 int hash = HASH_INSN (opcode_table[i]->match); local
416 h->next = hash_table[hash];
418 hash_table[hash] = h;
419 ++hash_count[hash];
436 printf ("Opcode hash table stats: min %d, max %d, ave %f\n",
/freebsd-10.2-release/sys/dev/drm/
H A Ddrm_hashtab.c33 * Simple open hash tab implementation.
42 #include <sys/hash.h>
52 DRM_ERROR("Out of memory for hash table\n");
/freebsd-10.2-release/sys/dev/drm2/
H A Ddrm_hashtab.c33 * Simple open hash tab implementation.
42 #include <sys/hash.h>
52 DRM_ERROR("Out of memory for hash table\n");
/freebsd-10.2-release/sys/geom/
H A Dgeom_bsd.c483 u_char hash[16]; local
585 error = g_getattr("BSD::labelsum", cp, &hash);
586 if (!error && !bcmp(ms->labelsum, hash, sizeof(hash)))
/freebsd-10.2-release/sys/netinet/
H A Dip_mroute.c206 * Pending timeouts are stored in a hash table, the key being the
1052 u_long hash = 0; local
1076 hash = MFCHASH(mfccp->mfcc_origin, mfccp->mfcc_mcastgrp);
1077 LIST_FOREACH(rt, &V_mfchashtbl[hash], mfc_hash) {
1092 V_nexpire[hash]--;
1111 LIST_FOREACH(rt, &V_mfchashtbl[hash], mfc_hash) {
1116 V_nexpire[hash]--;
1137 /* insert new entry at head of hash chain */
1138 LIST_INSERT_HEAD(&V_mfchashtbl[hash], rt, mfc_hash);
1284 u_long hash; local
[all...]
/freebsd-10.2-release/sys/dev/mxge/
H A Dmxge_mcp.h65 /* Place hash value at the top so it gets written before length.
68 uint32_t hash; member in struct:mcp_slot_8
74 /* Two bits of length in mcp_slot are used to indicate hash type. */
340 * data1 = hash type
/freebsd-10.2-release/sys/sys/
H A Dumtx.h196 int hash; member in struct:umtx_key
/freebsd-10.2-release/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/sys/
H A Dzap_leaf.h45 * block size (1<<l->l_bs) - hash entry size (2) * number of hash
71 * The leaf hash table has block size / 2^5 (32) number of entries,
80 * The chunks start immediately after the hash table. The end of the
81 * hash table is at l_hash + HASH_NUMENTRIES, which we simply cast to a
107 uint64_t lh_prefix; /* hash prefix of this leaf */
120 * The header is followed by a hash table with
121 * ZAP_LEAF_HASH_NUMENTRIES(zap) entries. The hash table is
134 uint16_t le_next; /* next entry in hash chain */
140 uint64_t le_hash; /* hash valu
[all...]
/freebsd-10.2-release/gnu/usr.bin/grep/
H A Ddfa.h242 int hash; /* Hash of the positions of this state. */ member in struct:__anon5666
/freebsd-10.2-release/sys/fs/tmpfs/
H A Dtmpfs_subr.c350 uint32_t hash; local
352 hash = fnv_32_buf(name, len, FNV1_32_INIT + len) & TMPFS_DIRCOOKIE_MASK;
354 hash &= 0xf;
356 if (hash < TMPFS_DIRCOOKIE_MIN)
357 hash += TMPFS_DIRCOOKIE_MIN;
359 return (hash);
778 tmpfs_dir_xlookup_hash(struct tmpfs_node *dnode, uint32_t hash) argument
782 dekey.td_hash = hash;
856 uint32_t hash; local
863 hash
[all...]
/freebsd-10.2-release/contrib/subversion/subversion/include/
H A Dsvn_diff.h125 * Return a "token" in @a *token. Return a hash of "token" in @a *hash.
126 * Leave @a token and @a hash untouched when the datasource is exhausted.
128 svn_error_t *(*datasource_get_next_token)(apr_uint32_t *hash, void **token,
165 svn_error_t *(*datasource_get_next_token)(apr_uint32_t *hash, void **token,
1074 * A hash table keyed by property names containing svn_prop_patch_t

Completed in 182 milliseconds

<<11121314151617181920>>