Searched refs:hash (Results 126 - 150 of 630) sorted by relevance

1234567891011>>

/freebsd-10.2-release/usr.bin/sockstat/
H A Dsockstat.c299 int hash, vflag; local
404 hash = (int)((uintptr_t)sock->socket % HASHSIZE);
405 sock->next = sockhash[hash];
406 sockhash[hash] = sock;
514 hash = (int)((uintptr_t)sock->socket % HASHSIZE);
515 sock->next = sockhash[hash];
516 sockhash[hash] = sock;
541 int hash, retry, vflag; local
674 hash = (int)((uintptr_t)sock->socket % HASHSIZE);
675 sock->next = sockhash[hash];
692 int hash, retry; local
907 int hash; local
989 int hash, n, pos; local
[all...]
/freebsd-10.2-release/usr.bin/xlint/lint2/
H A Dhash.c1 /* $NetBSD: hash.c,v 1.7 2002/01/21 19:49:52 tv Exp $ */
36 __RCSID("$NetBSD: hash.c,v 1.7 2002/01/21 19:49:52 tv Exp $");
38 __FBSDID("$FreeBSD: releng/10.2/usr.bin/xlint/lint2/hash.c 148723 2005-08-05 09:07:42Z stefanf $");
41 * XXX Really need a generalized hash table package
52 /* pointer to hash table, initialized in inithash() */
55 static int hash(const char *);
58 * Initialize hash table.
71 * Compute hash value from a string.
74 hash(const char *s) function
88 * Look for a hash tabl
[all...]
/freebsd-10.2-release/usr.sbin/IPXrouted/
H A Dtrace.c445 struct sap_hash *hash; local
449 for (hash = sh; hash < &sh[SAPHASHSIZ]; hash++, x++) {
451 sap = hash->forw;
452 for (; sap != (struct sap_entry *)hash; sap = sap->forw) {
471 struct rthash *hash; local
479 for (hash = rh; hash < &rh[ROUTEHASHSIZ]; hash
[all...]
/freebsd-10.2-release/contrib/ntp/lib/isc/tests/
H A Disctest.h25 #include <isc/hash.h>
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_fs_fs/
H A Dlock.c46 /* Names of hash keys used to store a lock for writing to disk. */
65 /* Set *DIGEST to the MD5 hash of STR. */
86 hash_store(apr_hash_t *hash,
97 apr_hash_set(hash, key, key_len,
105 hash_fetch(apr_hash_t *hash,
109 svn_string_t *str = svn_hash_gets(hash, key);
178 apr_hash_t *hash = apr_hash_make(pool);
193 hash_store(hash, PATH_KEY, sizeof(PATH_KEY)-1,
195 hash_store(hash, TOKEN_KEY, sizeof(TOKEN_KEY)-1,
197 hash_store(hash, OWNER_KE
85 hash_store(apr_hash_t *hash, const char *key, apr_ssize_t key_len, const char *value, apr_ssize_t value_len, apr_pool_t *pool) argument
104 hash_fetch(apr_hash_t *hash, const char *key, apr_pool_t *pool) argument
176 apr_hash_t *hash = apr_hash_make(pool); local
252 apr_hash_t *hash; local
[all...]
H A Drep-cache-db.sql27 hash TEXT NOT NULL PRIMARY KEY,
40 WHERE hash = ?1
43 INSERT OR FAIL INTO rep_cache (hash, revision, offset, size, expanded_size)
47 SELECT hash, revision, offset, size, expanded_size
/freebsd-10.2-release/crypto/heimdal/appl/ftp/ftp/
H A Dftp_var.h49 extern int hash; /* print # for each buffer transferred */
H A Dglobals.c8 int hash; /* print # for each buffer transferred */ variable
/freebsd-10.2-release/contrib/netbsd-tests/lib/libc/hash/
H A Dt_sha2.c71 const char *hash; member in struct:testvector
200 ATF_CHECK_STREQ(test256[i].hash, output);
227 ATF_CHECK_STREQ(test384[i].hash, output);
254 ATF_CHECK_STREQ(test512[i].hash, output);
/freebsd-10.2-release/contrib/binutils/bfd/
H A Dgenlink.h34 /* The generic linker uses a hash table which is a derived class of
35 the standard linker hash table, just as the other backend specific
36 linkers do. Do not confuse the generic linker hash table with the
37 standard BFD linker hash table it is built upon. */
39 /* Generic linker hash table entries. */
50 /* Generic linker hash table. */
57 /* Look up an entry in a generic link hash table. */
63 /* Traverse a generic link hash table. */
71 /* Get the generic link hash table from the info structure. This is
75 ((struct generic_link_hash_table *) ((p)->hash))
[all...]
/freebsd-10.2-release/contrib/amd/amd/
H A Dinfo_file.c112 char *hash; local
129 hash = strchr(key_val, '#');
130 if (hash)
131 *hash = '\0';
/freebsd-10.2-release/contrib/apr-util/include/
H A Dapr_md5.h165 * @param hash The password to validate against
168 const char *hash);
/freebsd-10.2-release/sys/dev/random/
H A Dhash.c29 __FBSDID("$FreeBSD: releng/10.2/sys/dev/random/hash.c 255362 2013-09-07 14:15:13Z markm $");
37 #include <dev/random/hash.h>
39 /* Initialise the hash */
46 /* Iterate the hash */
53 /* Conclude by returning the hash in the supplied <*buf> which must be
/freebsd-10.2-release/sys/crypto/via/
H A Dpadlock_hash.c62 * the padding and calculate hash automatically.
80 static void padlock_sha1_final(uint8_t *hash, struct padlock_sha_ctx *ctx);
81 static void padlock_sha256_final(uint8_t *hash, struct padlock_sha_ctx *ctx);
199 padlock_sha1_final(uint8_t *hash, struct padlock_sha_ctx *ctx) argument
202 padlock_do_sha1(ctx->psc_buf, hash, ctx->psc_offset);
207 padlock_sha256_final(uint8_t *hash, struct padlock_sha_ctx *ctx) argument
210 padlock_do_sha256(ctx->psc_buf, hash, ctx->psc_offset);
279 * Compute keyed-hash authenticator.
285 u_char hash[HASH_MAX_LEN]; local
299 axf->Final(hash,
[all...]
/freebsd-10.2-release/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugPubnamesSet.h91 typedef std::unordered_multimap<const char*, uint32_t, std::hash<const char*>, CStringEqualBinaryPredicate> cstr_to_index_mmap;
93 typedef __gnu_cxx::hash_multimap<const char*, uint32_t, __gnu_cxx::hash<const char*>, CStringEqualBinaryPredicate> cstr_to_index_mmap;
/freebsd-10.2-release/contrib/subversion/subversion/include/private/
H A Dsvn_subr_private.h233 * @defgroup svn_hash_misc Miscellaneous hash APIs
245 /** Find the value of a @a key in @a hash, return the value.
247 * If @a hash is @c NULL or if the @a key cannot be found, the
253 svn_hash__get_cstring(apr_hash_t *hash,
266 svn_hash__get_bool(apr_hash_t *hash,
273 * @defgroup svn_hash_create Create optimized APR hash tables
277 /** Returns a hash table, allocated in @a pool, with the same ordering of
279 * a faster hash function implementation.
294 * Allocate the resulting hash from @a pool, but allocate its keys and
/freebsd-10.2-release/crypto/openssl/engines/vendor_defns/
H A Dhw_ubsec.h92 int hash, unsigned char *data,
102 int hash, unsigned char *data,
/freebsd-10.2-release/libexec/mknetid/
H A Dhash.c37 #include "hash.h"
41 "$FreeBSD: releng/10.2/libexec/mknetid/hash.c 108470 2002-12-30 21:18:15Z schweikh $";
45 * This hash function is stolen directly from the
51 * OZ's original sdbm hash
54 hash(const void *keyarg, size_t len) function
99 * Generate a hash value for a given key (character string).
108 return(hash((void *)key, strlen(key)) & HASH_MASK);
111 /* Find an entry in the hash table (may be hanging off a linked list). */
/freebsd-10.2-release/sys/geom/bde/
H A Dg_bde_lock.c106 * We include (and shuffle) an extra hash field in the stored version for
107 * identification and versioning purposes. This field contains the MD5 hash
109 * sector byte-sequence substituting zero bytes for the hash field.
150 u_char *hash, *p; local
155 hash = NULL;
200 hash = p;
207 if (hash == NULL)
212 MD5Final(hash, &c);
221 u_char hash[16], hash2[16]; local
280 MD5Final(hash,
[all...]
/freebsd-10.2-release/sys/netinet/
H A Din_pcbgroup.c96 * with TCAMs or hardware hash tables. This might require connections to
181 * Given a hash of whatever the covered tuple might be, return a pcbgroup
185 in_pcbgroup_getbucket(struct inpcbinfo *pcbinfo, uint32_t hash) argument
188 return (hash % pcbinfo->ipi_npcbgroups);
192 * Map a (hashtype, hash) tuple into a connection group, or NULL if the hash
196 in_pcbgroup_byhash(struct inpcbinfo *pcbinfo, u_int hashtype, uint32_t hash) argument
214 uint32_t hash; local
218 hash = faddr.s_addr ^ fport;
222 hash
[all...]
/freebsd-10.2-release/crypto/heimdal/lib/gssapi/krb5/
H A D8003.c179 unsigned char hash[16]; local
193 if(length != sizeof(hash)) {
202 if(hash_input_chan_bindings(input_chan_bindings, hash) != 0) {
206 if(ct_memcmp(hash, p, sizeof(hash)) != 0) {
212 p += sizeof(hash);
H A Dget_mic.c51 u_char hash[16]; local
89 EVP_DigestFinal_ex(md5, hash, NULL);
95 DES_cbc_cksum ((void *)hash, (void *)hash, sizeof(hash),
97 memcpy (p - 8, hash, 8); /* SGN_CKSUM */
/freebsd-10.2-release/contrib/wpa/src/wps/
H A Dwps_attr_process.c19 u8 hash[SHA256_MAC_LEN]; local
42 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 2, addr, len, hash);
44 if (os_memcmp(hash, authenticator, WPS_AUTHENTICATOR_LEN) != 0) {
56 u8 hash[SHA256_MAC_LEN]; local
73 hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, head, len, hash);
74 if (os_memcmp(hash, key_wrap_auth, WPS_KWA_LEN) != 0) {
/freebsd-10.2-release/contrib/tcsh/
H A Dtc.printf.c70 int flush_left = 0, f_width = 0, prec = INF, hash = 0; local
118 hash = 1;
185 hash = 1;
219 if (hash)
230 if (hash) {
314 flush_left = 0, f_width = 0, prec = INF, hash = 0;
/freebsd-10.2-release/contrib/gcc/
H A Dcselib.c71 - for everything else, we compute a hash value and go through the hash
72 table. Since different rtx's can still have the same hash value,
94 /* Number of useless values before we remove them from the hash table. */
200 /* Remove all entries from the hash table. Also used during
225 /* The equality test for our hash table. The first argument ENTRY is a table
250 /* We don't guarantee that distinct rtx's have different hash values,
259 /* The hash function for our hash table. The value is always computed with
261 hash valu
585 unsigned int hash = 0; local
[all...]

Completed in 135 milliseconds

1234567891011>>