Searched refs:hash (Results 426 - 450 of 630) sorted by relevance

<<11121314151617181920>>

/freebsd-10.2-release/contrib/tnftp/src/
H A Dftp_var.h180 #define HASHBYTES 1024 /* default mark for `hash' command */
207 GLOBAL int hash; /* print # for each buffer transferred */ variable
/freebsd-10.2-release/contrib/unbound/services/cache/
H A Ddns.c109 hashvalue_t hash, struct reply_info* rep, time_t leeway, int pside,
136 if(!(e = query_info_entrysetup(qinfo, rep, hash))) {
140 slabhash_insert(env->msg_cache, hash, &e->entry, rep, env->alloc);
608 ck->entry.hash = rrset_key_hash(&ck->rk);
108 dns_cache_store_msg(struct module_env* env, struct query_info* qinfo, hashvalue_t hash, struct reply_info* rep, time_t leeway, int pside, struct reply_info* qrep, struct regional* region) argument
/freebsd-10.2-release/contrib/gdb/include/
H A Dbfdlink.h45 /* Describes the type of hash table entry structure being used.
46 Different hash table structure have different fields and so
55 /* These are the possible types of an entry in the BFD link hash
78 /* The linking routines use a hash table which uses this structure for
83 /* Base hash table entry structure. */
95 the link hash table itself. As symbols are defined, they need
152 /* This is the link hash table. It is a derived class of
157 /* The hash table itself. */
159 /* The back end which created this hash table. This indicates the
160 type of the entries in the hash tabl
330 struct bfd_link_hash_table *hash; member in struct:bfd_link_info
[all...]
/freebsd-10.2-release/contrib/binutils/bfd/
H A Dlibxcoff.h103 /* Look up an entry in an XCOFF link hash table. */
109 /* Traverse an XCOFF link hash table. */
116 /* Get the XCOFF link hash table from the info structure. This is
118 #define xcoff_hash_table(p) ((struct xcoff_link_hash_table *) ((p)->hash))
162 /* Get the XCOFF hash table entries for a BFD. */
/freebsd-10.2-release/contrib/libarchive/libarchive/
H A Darchive_crypto.c65 if (!CryptCreateHash(ctx->cryptProv, algId, 0, 0, &ctx->hash)) {
84 CryptHashData(ctx->hash,
98 CryptGetHashParam(ctx->hash, HP_HASHVAL, buf, &siglen, 0);
99 CryptDestroyHash(ctx->hash);
H A Darchive_crypto_private.h150 HCRYPTHASH hash; member in struct:__anon1639
/freebsd-10.2-release/contrib/binutils/include/
H A Dbfdlink.h45 /* Describes the type of hash table entry structure being used.
46 Different hash table structure have different fields and so
55 /* These are the possible types of an entry in the BFD link hash
78 /* The linking routines use a hash table which uses this structure for
83 /* Base hash table entry structure. */
103 the link hash table itself. As symbols are defined, they need
156 /* This is the link hash table. It is a derived class of
161 /* The hash table itself. */
163 /* The back end which created this hash table. This indicates the
164 type of the entries in the hash tabl
380 struct bfd_link_hash_table *hash; member in struct:bfd_link_info
[all...]
/freebsd-10.2-release/sys/dev/cxgbe/
H A Dt4_l2t.c92 * presently in the hash table. We need to remove it.
95 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) {
143 * explicitly freed and while busy they are not on any hash chain, so normal
/freebsd-10.2-release/sys/dev/drm2/ttm/
H A Dttm_lock.c317 lock->base.hash.key, TTM_REF_USAGE);
/freebsd-10.2-release/sys/ofed/drivers/net/mlx4/
H A Dutils.c38 #include <sys/hash.h>
H A Dmcg.c108 u16 *hash, u8 op_mod)
118 *hash = imm;
660 * If GID is found in MGM or MGM is empty, *index = *hash, *prev = -1
664 * previous entry in hash chain and *mgm holds AMGM entry.
667 * entry in hash chain and *mgm holds end of hash chain.
678 u16 hash; local
689 err = mlx4_GID_HASH(dev, mailbox, &hash, op_mod);
696 GID_PRINT_ARGS(gid), hash);
699 *index = hash;
107 mlx4_GID_HASH(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox, u16 *hash, u8 op_mod) argument
[all...]
/freebsd-10.2-release/sys/rpc/
H A Dreplay.c32 #include <sys/hash.h>
/freebsd-10.2-release/usr.bin/mail/
H A Dcmd2.c458 h = hash(field);
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Format/
H A DTokenAnnotator.cpp504 if (CurrentToken->is(tok::hash)) {
734 PreviousNotConst->Previous->is(tok::hash);
1219 return Left.is(tok::hash);
1220 if (Left.isOneOf(tok::hashhash, tok::hash))
1221 return Right.is(tok::hash);
1316 if (Right.is(tok::hash) && Left.is(tok::identifier) && Left.TokenText == "L")
1375 Line.First->is(tok::hash))
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_subr/
H A Dmergeinfo.c664 parse_revision_line(const char **input, const char *end, svn_mergeinfo_t hash, argument
712 existing_rangelist = apr_hash_get(hash, pathname, klen);
717 apr_hash_set(hash, apr_pstrmemdup(apr_hash_pool_get(hash), pathname, klen),
718 klen, svn_rangelist_dup(rangelist, apr_hash_pool_get(hash)));
725 parse_top(const char **input, const char *end, svn_mergeinfo_t hash, argument
733 SVN_ERR(parse_revision_line(input, end, hash, iterpool));
1746 * Otherwise, add new hash entry. */
1840 ### mergeinfo hash has inheritable mergeinfo, and in the other
2569 good measure, (re)store it in the hash
[all...]
/freebsd-10.2-release/sys/netinet/
H A Dtcp_syncache.c165 "Per-bucket hash limit for syncache");
249 printf("WARNING: syncache hash size is not a power of 2.\n");
260 /* Allocate the hash table. */
268 /* Initialize the hash buckets. */
301 /* Cleanup hash buckets: stop timers, free entries, destroy locks. */
708 /* Insert new socket into PCB hash list. */
732 * Install in the reservation hash table for now, but don't yet
740 * put the PCB on the hash lists.
1602 * strong hash (MAC) value and a few bits of TCP SYN options in the ISS
1606 * The available space of 32 bits to store the hash an
1745 uint32_t iss, hash; local
1810 uint32_t hash; local
[all...]
/freebsd-10.2-release/contrib/ntp/ntpq/
H A Dntpq-subs.c293 mru * hlink; /* next in hash table bucket */
2387 * add_mru Add and entry to mru list, hash table, and allocate
2396 u_short hash; local
2401 hash = NTP_HASH_ADDR(&add->addr);
2403 for (mon = hash_table[hash]; mon != NULL; mon = mon->hlink)
2416 UNLINK_SLIST(unlinked, hash_table[hash], mon, hlink, mru);
2423 LINK_SLIST(hash_table[hash], add, hlink);
2502 u_short hash; local
2559 hash = NTP_HASH_ADDR(&recent->addr);
2560 UNLINK_SLIST(unlinked, hash_table[hash],
[all...]
/freebsd-10.2-release/contrib/ntp/lib/isc/win32/
H A Dlibisc.mak136 -@erase "$(INTDIR)\hash.obj"
251 "$(INTDIR)\hash.obj" \
348 -@erase "$(INTDIR)\hash.obj"
349 -@erase "$(INTDIR)\hash.sbr"
520 "$(INTDIR)\hash.sbr" \
608 "$(INTDIR)\hash.obj" \
1297 SOURCE=..\hash.c
1302 "$(INTDIR)\hash.obj" : $(SOURCE) "$(INTDIR)"
1309 "$(INTDIR)\hash.obj" "$(INTDIR)\hash
[all...]
/freebsd-10.2-release/sys/netgraph/
H A Dng_l2tp.c406 uint16_t hash; local
435 hash = SESSHASH(hpriv->conf.session_id);
436 LIST_INSERT_HEAD(&priv->sesshash[hash], hpriv, sessions);
709 uint16_t hash = SESSHASH(sid); local
712 LIST_FOREACH(hpriv, &privp->sesshash[hash], sessions) {
/freebsd-10.2-release/sys/net80211/
H A Dieee80211_node.c1149 int hash; local
1162 hash = IEEE80211_NODE_HASH(ic, macaddr);
1180 LIST_INSERT_HEAD(&nt->nt_hash[hash], ni, ni_hash);
1329 int hash; local
1333 hash = IEEE80211_NODE_HASH(nt->nt_ic, macaddr);
1334 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1379 int hash; local
1383 hash = IEEE80211_NODE_HASH(nt->nt_ic, macaddr);
1384 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1868 * in the mapping table even if it's not in the hash
[all...]
/freebsd-10.2-release/crypto/openssl/ssl/
H A Dssl_lib.c448 * find if there's a session in the hash table that would conflict with
1686 * NB: If this function (or indeed the hash function which uses a sort of
3289 EVP_MD_CTX *ssl_replace_hash(EVP_MD_CTX **hash, const EVP_MD *md) argument
3291 ssl_clear_hash_ctx(hash);
3292 *hash = EVP_MD_CTX_create();
3294 EVP_DigestInit_ex(*hash, md, NULL);
3295 return *hash;
3298 void ssl_clear_hash_ctx(EVP_MD_CTX **hash) argument
3301 if (*hash)
3302 EVP_MD_CTX_destroy(*hash);
[all...]
/freebsd-10.2-release/contrib/libpcap/
H A Doptimize.c545 u_int hash; local
549 hash = (u_int)code ^ (v0 << 4) ^ (v1 << 8);
550 hash %= MODULUS;
552 for (p = hashtbl[hash]; p; p = p->next)
567 p->next = hashtbl[hash];
568 hashtbl[hash] = p;
/freebsd-10.2-release/contrib/binutils/ld/
H A Dpe-dll.c630 blhe = bfd_link_hash_lookup (info->hash, name,
791 blhe = bfd_link_hash_lookup (info->hash,
1010 blhe = bfd_link_hash_lookup (info->hash,
2324 name_thunk_sym = bfd_link_hash_lookup (link_info.hash, buf, 0, 0, 1);
2503 blhe = bfd_link_hash_lookup (link_info->hash, name,
2517 blhe = bfd_link_hash_lookup (link_info->hash, name,
/freebsd-10.2-release/sys/boot/zfs/
H A Dzfsimpl.c1378 uint64_t hash; local
1400 hash = zap_hash(zh.zap_salt, name);
1405 off_t off = ptrtbl[hash >> (64 - zh.zap_ptrtbl.zt_shift)] << zl.l_bs;
1415 * Make sure this chunk matches our hash.
1419 != hash >> (64 - zl.l_phys->l_hdr.lh_prefix_len))
1426 int h = (hash >> shift) & ((1 << ZAP_LEAF_HASH_SHIFT(&zl)) - 1);
1431 while (zc->l_entry.le_hash != hash) {
/freebsd-10.2-release/sys/dev/drm2/
H A Ddrm_bufs.c151 static int drm_map_handle(struct drm_device *dev, struct drm_hash_item *hash, argument
167 hash->key = user_token >> PAGE_SHIFT;
168 ret = drm_ht_insert_item(&dev->map_hash, hash);
187 * hash value we use are equal to those in the original
194 return drm_ht_just_insert_please(&dev->map_hash, hash,
436 ret = drm_map_handle(dev, &list->hash, user_token, 0,
447 list->user_token = list->hash.key << PAGE_SHIFT;

Completed in 423 milliseconds

<<11121314151617181920>>