Searched refs:hashtable (Results 1 - 19 of 19) sorted by relevance

/freebsd-10.0-release/contrib/libstdc++/include/backward/
H A Dhashtable.h64 #include <ext/hashtable.h>
70 using __gnu_cxx::hashtable;
H A Dhash_map.h64 using __gnu_cxx::hashtable;
H A Dhash_set.h64 using __gnu_cxx::hashtable;
/freebsd-10.0-release/usr.bin/grep/regex/
H A Dhashtable.h27 } hashtable; typedef in typeref:struct:__anon11430
29 void hashtable_free(hashtable *);
30 int hashtable_get(hashtable *, const void *, void *);
31 hashtable *hashtable_init(size_t, size_t, size_t);
32 int hashtable_put(hashtable *, const void *, const void *);
33 int hashtable_remove(hashtable *, const void *);
H A Dhashtable.c36 #include "hashtable.h"
61 hashtable
64 hashtable *tbl;
69 tbl = malloc(sizeof(hashtable));
93 * Places the key-value pair to the hashtable tbl.
105 hashtable_put(hashtable *tbl, const void *key, const void *value)
111 DPRINT(("hashtable_put: hashtable is full\n"));
179 **hashtable_lookup(const hashtable *tbl, const void *key)
207 hashtable_get(hashtable *tbl, const void *key, void *value)
214 DPRINT(("hashtable_get: entry is not available in the hashtable\
[all...]
H A Dtre-fastmatch.h7 #include <hashtable.h>
12 #include "hashtable.h"
/freebsd-10.0-release/libexec/bootpd/
H A Dhash.c133 hash_Reset(hashtable, free_data)
134 hash_tbl *hashtable;
140 bucketptr = hashtable->table;
141 for (i = 0; i < hashtable->size; i++) {
145 hashtable->bucketnum = 0;
146 hashtable->member = (hashtable->table)[0];
160 * adjust the hashcode for the size of each hashtable.
196 hash_Exists(hashtable, hashcode, compare, key)
197 hash_tbl *hashtable;
[all...]
/freebsd-10.0-release/contrib/libstdc++/include/ext/
H A Dhashtable.h57 /** @file ext/hashtable.h
96 class hashtable;
110 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
161 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
237 class hashtable;
242 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
243 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
247 // a hashtable unconditionally has a member variable to hold its
255 class hashtable class
325 hashtable(size_typ function in class:hashtable
332 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
339 hashtable(const hashtable& __ht) function in class:hashtable
693 operator ==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1, const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2) argument
734 operator !=(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1, const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2) argument
[all...]
/freebsd-10.0-release/sys/nfs/
H A Dnfs_fha.h40 struct fha_hash_entry_list *hashtable; member in struct:fha_global
H A Dnfs_fha.c60 softc->g_fha.hashtable = hashinit(256, M_NFS_FHA,
121 hashdestroy(softc->g_fha.hashtable, M_NFS_FHA, softc->g_fha.hashmask);
235 LIST_FOREACH(fhe, &softc->g_fha.hashtable[fh % softc->g_fha.hashmask],
248 &softc->g_fha.hashtable[fh % softc->g_fha.hashmask], link)
254 &softc->g_fha.hashtable[fh % softc->g_fha.hashmask],
513 if (!LIST_EMPTY(&softc->g_fha.hashtable[i]))
522 LIST_FOREACH(fhe, &softc->g_fha.hashtable[i], link) {
/freebsd-10.0-release/sys/netgraph/
H A Dng_etf.c151 struct filterhead hashtable[HASHSIZE]; member in struct:ETF
158 struct filterhead *chain = etfp->hashtable + HASH(ethertype);
185 LIST_INIT((privdata->hashtable + i));
315 * hashtable ready for matching.
326 LIST_INSERT_HEAD( etfp->hashtable
458 fil1 = LIST_FIRST(&etfp->hashtable[i]);
/freebsd-10.0-release/contrib/binutils/gas/
H A Dhash.c450 char *hashtable[TABLES];
489 for (pp = hashtable; pp < hashtable + TABLES; pp++)
492 pp - hashtable, *pp);
508 printf ("? display all hashtable control block addresses\n");
510 printf ("d die: destroy hashtable\n");
515 printf ("n new hashtable\n");
537 h = hashtable[number] = (char *) hash_new ();
603 h = hashtable[number];
449 char *hashtable[TABLES]; variable
/freebsd-10.0-release/contrib/unbound/util/data/
H A Dmsgparse.h119 struct rrset_parse* hashtable[PARSE_TABLE_SIZE]; member in struct:msg_parse
277 * Lookup in msg hashtable to find a rrset.
278 * @param msg: with the hashtable.
294 * @param msg: with hashtable.
H A Dmsgparse.c76 p->rrset_bucket_next = msg->hashtable[hash & (PARSE_TABLE_SIZE-1)];
77 msg->hashtable[hash & (PARSE_TABLE_SIZE-1)] = p;
217 struct rrset_parse* p = msg->hashtable[h & (PARSE_TABLE_SIZE-1)];
260 p = &msg->hashtable[ rrset->hash & (PARSE_TABLE_SIZE-1) ];
414 dataset->rrset_bucket_next = msg->hashtable[hash&(PARSE_TABLE_SIZE-1)];
415 msg->hashtable[hash&(PARSE_TABLE_SIZE-1)] = dataset;
485 /* find by hashing and lookup in hashtable */
/freebsd-10.0-release/usr.bin/grep/
H A DMakefile20 SRCS+= fastmatch.c hashtable.c tre-compile.c tre-fastmatch.c xmalloc.c
/freebsd-10.0-release/contrib/binutils/bfd/
H A Decoff.c3022 bfd_byte *hashtable;
3090 hashtable = bfd_zalloc (abfd, symdefsize);
3091 if (!hashtable)
3116 if (H_GET_32 (abfd, (hashtable + (hash * 8) + 4)) != 0)
3124 if (H_GET_32 (abfd, (hashtable + (srch * 8) + 4)) == 0)
3132 H_PUT_32 (abfd, map[i].namidx, (hashtable + hash * 8));
3133 H_PUT_32 (abfd, firstreal, (hashtable + hash * 8 + 4));
3136 if (bfd_bwrite ((void *) hashtable, symdefsize, abfd) != symdefsize)
3139 bfd_release (abfd, hashtable);
3733 const bfd_byte *hashtable;
3014 bfd_byte *hashtable; local
3724 const bfd_byte *hashtable; local
[all...]
/freebsd-10.0-release/gnu/lib/libstdc++/
H A DMakefile137 function.h hash_map.h hash_set.h hashtable.h heap.h iostream.h \
147 hash_map hash_set hash_fun.h hashtable.h iterator \
161 functional_iterate.h hashtable hashtable_policy.h inttypes.h \
/freebsd-10.0-release/sys/dev/tsec/
H A Dif_tsec.c1877 uint32_t hashtable[8] = { 0, 0, 0, 0, 0, 0, 0, 0 }; local
1901 hashtable[(h >> 5)] |= 1 << (0x1F - (h & 0x1F));
1906 TSEC_WRITE(sc, TSEC_REG_GADDR(i), hashtable[i]);
/freebsd-10.0-release/contrib/libstdc++/include/
H A DMakefile.am177 ${backward_srcdir}/hashtable.h \
531 ${ext_srcdir}/hashtable.h \
586 ${tr1_srcdir}/hashtable \

Completed in 145 milliseconds