| /src/usr.sbin/bootp/common/ |
| hash.c | 126 hash_Reset(hash_tbl *hashtable, hash_freefp free_data)
131 bucketptr = hashtable->table;
132 for (i = 0; i < hashtable->size; i++) {
136 hashtable->bucketnum = 0;
137 hashtable->member = (hashtable->table)[0];
151 * adjust the hashcode for the size of each hashtable.
185 hash_Exists(hash_tbl *hashtable, unsigned int hashcode, hash_cmpfp compare,
190 memberptr = (hashtable->table)[hashcode % (hashtable->size)]
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 0 // Hashtable implementation used by containers -*- C++ -*-
51 /** @file backward/hashtable.h
59 // Hashtable class, used to implement the hashed associative containers
82 class hashtable;
96 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
147 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
239 class hashtable;
244 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
245 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
249 // a hashtable unconditionally has a member variable to hold it
257 class hashtable class
332 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
339 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
346 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 0 // Hashtable implementation used by containers -*- C++ -*-
51 /** @file backward/hashtable.h
59 // Hashtable class, used to implement the hashed associative containers
82 class hashtable;
96 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
147 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
239 class hashtable;
244 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
245 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
249 // a hashtable unconditionally has a member variable to hold it
257 class hashtable class
332 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
339 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
346 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/ |
| amdgpu_sync.h | 29 #include <linux/hashtable.h>
|
| /src/sys/external/bsd/drm2/dist/drm/amd/amdkfd/ |
| kfd_events.h | 29 #include <linux/hashtable.h>
|
| kfd_priv.h | 28 #include <linux/hashtable.h>
|
| /src/external/mit/xorg/server/xorg-server/Xext/ |
| Makefile | 12 SRCS+= hashtable.c xres.c
|
| /src/crypto/external/apache2/openssl/dist/crypto/encode_decode/ |
| decoder_pkey.c | 678 LHASH_OF(DECODER_CACHE_ENTRY) *hashtable;
775 cache->hashtable = lh_DECODER_CACHE_ENTRY_new(decoder_cache_entry_hash,
777 if (cache->hashtable == NULL) {
790 lh_DECODER_CACHE_ENTRY_doall(cache->hashtable, decoder_cache_entry_free);
791 lh_DECODER_CACHE_ENTRY_free(cache->hashtable);
813 lh_DECODER_CACHE_ENTRY_doall(cache->hashtable, decoder_cache_entry_free);
814 lh_DECODER_CACHE_ENTRY_flush(cache->hashtable);
862 res = lh_DECODER_CACHE_ENTRY_retrieve(cache->hashtable, &cacheent);
940 res = lh_DECODER_CACHE_ENTRY_retrieve(cache->hashtable, &cacheent);
942 (void)lh_DECODER_CACHE_ENTRY_insert(cache->hashtable, newcache)
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| rbt.c | 67 dns_rbtnode_t **hashtable[2]; member in struct:dns_rbt
306 if (rbt->hashtable[0] != NULL) {
309 if (rbt->hashtable[1] != NULL) {
416 * using the hashtable and have realized your folly, please
425 * lend itself to be optimized using the hashtable:
431 * hashtable, so at least in that subtree, a BST O(log N) lookup
436 * to look for a match in the hashtable for all superdomains in
439 * of which is a hashtable lookup involving dns_name_equal()
779 * the hashtable. We can get one of 3 results
841 for (hnode = rbt->hashtable[hindex][hash]
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/python/libstdcxx/v6/ |
| printers.py | 1042 def __init__(self, hashtable):
1043 self.buckets = hashtable['_M_buckets']
1045 self.bucket_count = hashtable['_M_bucket_count']
1046 self.node_type = find_type(hashtable.type, '_Node').pointer()
1074 def __init__(self, hashtable):
1075 self.node = hashtable['_M_before_begin']['_M_nxt']
1076 valtype = hashtable.type.template_argument(1)
1077 cached = hashtable.type.template_argument(9).template_argument(0)
1102 def hashtable(self): member in class:Tr1UnorderedSetPrinter
1108 count = self.hashtable()['_M_element_count'
1129 def hashtable(self): member in class:Tr1UnorderedMapPrinter
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| rbt.c | 98 dns_rbtnode_t **hashtable; member in struct:dns_rbt
1035 rbt->hashtable = NULL;
1080 if (rbt->hashtable != NULL) {
1082 isc_mem_put(rbt->mctx, rbt->hashtable, size);
1214 * using the hashtable and have realized your folly, please
1223 * lend itself to be optimized using the hashtable:
1229 * hashtable, so at least in that subtree, a BST O(log N) lookup
1234 * to look for a match in the hashtable for all superdomains in
1237 * of which is a hashtable lookup involving dns_name_equal()
1621 * the hashtable. We can get one of 3 result
[all...] |
| /src/external/bsd/unbound/dist/util/data/ |
| msgparse.h | 165 struct rrset_parse* hashtable[PARSE_TABLE_SIZE]; member in struct:msg_parse
375 * Lookup in msg hashtable to find a rrset.
376 * @param msg: with the hashtable.
392 * @param msg: with hashtable.
|
| msgparse.c | 91 p->rrset_bucket_next = msg->hashtable[hash & (PARSE_TABLE_SIZE-1)];
92 msg->hashtable[hash & (PARSE_TABLE_SIZE-1)] = p;
232 struct rrset_parse* p = msg->hashtable[h & (PARSE_TABLE_SIZE-1)];
275 p = &msg->hashtable[ rrset->hash & (PARSE_TABLE_SIZE-1) ];
429 dataset->rrset_bucket_next = msg->hashtable[hash&(PARSE_TABLE_SIZE-1)];
430 msg->hashtable[hash&(PARSE_TABLE_SIZE-1)] = dataset;
500 /* find by hashing and lookup in hashtable */
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-profile.cc | 74 histogram_pool. During construction a separate hashtable is kept to lookup
80 /* Hashtable support for storing SSA names hashed by their SSA_NAME_VAR. */
101 HASHTABLE is the on-side hash kept to avoid duplicates. */
104 account_time_size (hash_table<histogram_hash> *hashtable,
109 histogram_entry **val = hashtable->find_slot (&key, INSERT);
266 hash_table<histogram_hash> hashtable (10);
331 account_time_size (&hashtable, histogram,
505 hash_table<histogram_hash> hashtable (10);
527 account_time_size (&hashtable, histogram,
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-profile.cc | 72 histogram_pool. During construction a separate hashtable is kept to lookup
78 /* Hashtable support for storing SSA names hashed by their SSA_NAME_VAR. */
99 HASHTABLE is the on-side hash kept to avoid duplicates. */
102 account_time_size (hash_table<histogram_hash> *hashtable,
107 histogram_entry **val = hashtable->find_slot (&key, INSERT);
264 hash_table<histogram_hash> hashtable (10);
329 account_time_size (&hashtable, histogram,
504 hash_table<histogram_hash> hashtable (10);
526 account_time_size (&hashtable, histogram,
|
| /src/crypto/external/apache2/openssl/dist/fuzz/ |
| hashtable.c | 12 * Test hashtable operation.
18 #include <internal/hashtable.h>
|
| /src/external/gpl3/binutils/dist/bfd/ |
| ecoff.c | 3115 bfd_byte *hashtable;
3183 hashtable = (bfd_byte *) bfd_zalloc (abfd, symdefsize);
3184 if (!hashtable)
3209 if (H_GET_32 (abfd, (hashtable + (hash * 8) + 4)) != 0)
3217 if (H_GET_32 (abfd, (hashtable + (srch * 8) + 4)) == 0)
3225 H_PUT_32 (abfd, map[i].namidx, (hashtable + hash * 8));
3226 H_PUT_32 (abfd, firstreal, (hashtable + hash * 8 + 4));
3229 if (bfd_write (hashtable, symdefsize, abfd) != symdefsize)
3232 bfd_release (abfd, hashtable);
3613 const bfd_byte *hashtable;
3107 bfd_byte *hashtable; local
3604 const bfd_byte *hashtable; local
[all...] |
| /src/external/gpl3/binutils.old/dist/bfd/ |
| ecoff.c | 3105 bfd_byte *hashtable;
3173 hashtable = (bfd_byte *) bfd_zalloc (abfd, symdefsize);
3174 if (!hashtable)
3199 if (H_GET_32 (abfd, (hashtable + (hash * 8) + 4)) != 0)
3207 if (H_GET_32 (abfd, (hashtable + (srch * 8) + 4)) == 0)
3215 H_PUT_32 (abfd, map[i].namidx, (hashtable + hash * 8));
3216 H_PUT_32 (abfd, firstreal, (hashtable + hash * 8 + 4));
3219 if (bfd_write (hashtable, symdefsize, abfd) != symdefsize)
3222 bfd_release (abfd, hashtable);
3603 const bfd_byte *hashtable;
3097 bfd_byte *hashtable; local
3594 const bfd_byte *hashtable; local
[all...] |
| /src/external/gpl3/gdb.old/dist/bfd/ |
| ecoff.c | 3117 bfd_byte *hashtable;
3185 hashtable = (bfd_byte *) bfd_zalloc (abfd, symdefsize);
3186 if (!hashtable)
3211 if (H_GET_32 (abfd, (hashtable + (hash * 8) + 4)) != 0)
3219 if (H_GET_32 (abfd, (hashtable + (srch * 8) + 4)) == 0)
3227 H_PUT_32 (abfd, map[i].namidx, (hashtable + hash * 8));
3228 H_PUT_32 (abfd, firstreal, (hashtable + hash * 8 + 4));
3231 if (bfd_write (hashtable, symdefsize, abfd) != symdefsize)
3234 bfd_release (abfd, hashtable);
3615 const bfd_byte *hashtable;
3109 bfd_byte *hashtable; local
3606 const bfd_byte *hashtable; local
[all...] |
| /src/external/gpl3/gdb/dist/bfd/ |
| ecoff.c | 3105 bfd_byte *hashtable;
3173 hashtable = (bfd_byte *) bfd_zalloc (abfd, symdefsize);
3174 if (!hashtable)
3199 if (H_GET_32 (abfd, (hashtable + (hash * 8) + 4)) != 0)
3207 if (H_GET_32 (abfd, (hashtable + (srch * 8) + 4)) == 0)
3215 H_PUT_32 (abfd, map[i].namidx, (hashtable + hash * 8));
3216 H_PUT_32 (abfd, firstreal, (hashtable + hash * 8 + 4));
3219 if (bfd_write (hashtable, symdefsize, abfd) != symdefsize)
3222 bfd_release (abfd, hashtable);
3603 const bfd_byte *hashtable;
3097 bfd_byte *hashtable; local
3594 const bfd_byte *hashtable; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gt/ |
| intel_engine.h | 9 #include <linux/hashtable.h>
|
| intel_engine_types.h | 14 #include <linux/hashtable.h>
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/python/libstdcxx/v6/ |
| printers.py | 1127 def __init__(self, hashtable):
1128 self._buckets = hashtable['_M_buckets']
1130 self._bucket_count = hashtable['_M_bucket_count']
1131 self._node_type = find_type(hashtable.type, '_Node').pointer()
1159 def __init__(self, hashtable):
1160 self._node = hashtable['_M_before_begin']['_M_nxt']
1161 valtype = hashtable.type.template_argument(1)
1162 cached = hashtable.type.template_argument(9).template_argument(0)
|
| /src/crypto/external/apache2/openssl/dist/test/ |
| lhash_test.c | 19 #include <internal/hashtable.h>
268 TEST_info("hashtable int foreach encountered a not found condition");
274 TEST_info("hashtable int foreach %zu", i);
290 TEST_info("hashtable couldn't find entry %d to delete\n",
437 TEST_info("hashtable stress out of memory %d", i);
445 TEST_info("hashtable unable to insert element %d\n", *p);
462 TEST_info("hashtable didn't delete key %d\n", j);
469 TEST_info("hashtable didn't get key %d\n", j);
481 TEST_info("hashtable stress runs in %ld.%ld seconds", delta.tv_sec, delta.tv_usec);
607 worker_exits[num] = "Read unexpected value from hashtable";
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/hashtable/ |
| hashtable.c | 12 * This hashtable uses a hopscotch algorithm to do indexing. The data structure
55 #include <internal/hashtable.h>
|
