Home
last modified time | relevance | path

Searched refs:hash_table (Results 1 – 25 of 30) sorted by relevance

12

/freebsd/contrib/xz/src/liblzma/lz/
H A Dlz_encoder_hash.h32 # define hash_table lzma_crc32_table[0] macro
37 # define hash_table lzma_lz_hash_table macro
64 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
70 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
75 ^ (hash_table[cur[3]] << 5)) & mf->hash_mask
81 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
86 ^ hash_table[cur[3]] << 5); \
88 = (hash_4_value ^ (hash_table[cur[4]] << 3)) \
102 ^ hash_table[cur[1]]) & 0xFFFF
106 = (hash_table[cur[0]] ^ cur[1]) & HASH_2_MASK
[all …]
/freebsd/usr.bin/top/
H A Dusername.c46 #define is_empty_hash(x) (hash_table[x].name[0] == 0)
53 static struct hash_el hash_table[Table_size]; variable
62 if (is_empty_hash(hashindex) || (hash_table[hashindex].uid != uid)) in username()
67 return(hash_table[hashindex].name); in username()
107 if (hash_table[hashindex].uid == uid) in enter_user()
112 hash_table[hashindex].uid = uid; in enter_user()
113 (void) strncpy(hash_table[hashindex].name, name, MAXLOGNAME - 1); in enter_user()
/freebsd/contrib/ncurses/ncurses/tinfo/
H A Dmake_hash.c115 HashValue * hash_table, in _nc_make_hash_table() argument
123 hash_table[i] = UNUSED; in _nc_make_hash_table()
128 if (hash_table[hashvalue] >= 0) in _nc_make_hash_table()
131 if (hash_table[hashvalue] != UNUSED) { in _nc_make_hash_table()
132 table[i].ute_link = hash_table[hashvalue]; in _nc_make_hash_table()
134 hash_table[hashvalue] = (HashValue) i; in _nc_make_hash_table()
251 HashValue *hash_table; in main() local
270 hash_table = typeCalloc(HashValue, HASHTABSIZE); in main()
281 || hash_table == NULL) { in main()
358 _nc_make_hash_table(name_table, hash_table, tablesize); in main()
[all …]
H A Dcomp_hash.c56 const HashValue * hash_table) in NCURSES_EXPORT()
58 bool termcap = (hash_table != _nc_get_hash_table(FALSE)); in NCURSES_EXPORT()
/freebsd/crypto/krb5/src/kdc/
H A Dt_replay.c168 assert_ptr_equal(k5_hashtab_get(hash_table, req.data, req.length), e); in test_insert_entry()
184 assert_ptr_equal(k5_hashtab_get(hash_table, req.data, req.length), e); in test_insert_entry_no_response()
202 assert_ptr_equal(k5_hashtab_get(hash_table, req1.data, req1.length), e1); in test_insert_entry_multiple()
210 assert_ptr_equal(k5_hashtab_get(hash_table, req2.data, req2.length), e2); in test_insert_entry_multiple()
232 assert_null(k5_hashtab_get(hash_table, req.data, req.length)); in test_discard_entry()
247 assert_null(k5_hashtab_get(hash_table, req.data, req.length)); in test_discard_entry_no_response()
266 assert_null(k5_hashtab_get(hash_table, req.data, req.length)); in test_kdc_remove_lookaside()
296 assert_ptr_equal(k5_hashtab_get(hash_table, req1.data, req1.length), e); in test_kdc_remove_lookaside_unknown()
315 assert_null(k5_hashtab_get(hash_table, req2.data, req2.length)); in test_kdc_remove_lookaside_multiple()
316 assert_ptr_equal(k5_hashtab_get(hash_table, req1.data, req1.length), e1); in test_kdc_remove_lookaside_multiple()
[all …]
H A Dreplay.c50 static struct k5_hashtab *hash_table; variable
94 ret = k5_hashtab_add(hash_table, entry->req_packet.data, in insert_entry()
120 k5_hashtab_remove(hash_table, entry->req_packet.data, in discard_entry()
139 ret = k5_hashtab_create(seed, 8192, &hash_table); in kdc_init_lookaside()
152 e = k5_hashtab_get(hash_table, req_packet->data, req_packet->length); in kdc_remove_lookaside()
174 e = k5_hashtab_get(hash_table, req_packet->data, req_packet->length); in kdc_check_lookaside()
228 k5_hashtab_free(hash_table); in kdc_free_lookaside()
/freebsd/crypto/krb5/src/lib/krb5/rcache/
H A Dmemrcache.c48 struct k5_hashtab *hash_table; member
68 ret = k5_hashtab_add(mrc->hash_table, entry->tag.data, entry->tag.length, in insert_entry()
89 k5_hashtab_remove(mrc->hash_table, entry->tag.data, entry->tag.length); in discard_entry()
113 ret = k5_hashtab_create(seed, 64, &mrc->hash_table); in k5_memrcache_create()
137 e = k5_hashtab_get(mrc->hash_table, tag->data, tag->length); in k5_memrcache_store()
163 k5_hashtab_free(mrc->hash_table); in k5_memrcache_free()
/freebsd/sbin/dhclient/
H A Dhash.c50 struct hash_table *
53 struct hash_table *rv = new_hash_table(DEFAULT_HASH_SIZE); in new_hash()
78 void add_hash(struct hash_table *table, const unsigned char *name, int len, in add_hash()
104 hash_lookup(struct hash_table *table, unsigned char *name, int len) in hash_lookup()
H A Dalloc.c59 struct hash_table *
62 struct hash_table *rval; in new_hash_table()
64 rval = calloc(1, sizeof(struct hash_table) - in new_hash_table()
H A Ddhcpd.h242 struct hash_table { struct
301 struct hash_table *new_hash_table(int);
332 struct hash_table *new_hash(void);
333 void add_hash(struct hash_table *, const unsigned char *, int, unsigned char *);
334 void *hash_lookup(struct hash_table *, unsigned char *, int);
340 extern struct hash_table universe_hash;
H A Dtree.h59 struct hash_table *hash;
H A Dtables.c428 struct hash_table universe_hash;
/freebsd/contrib/flex/src/
H A Dsym.c49 typedef struct hash_entry **hash_table; typedef
62 static int addsym(char[], char *, int, hash_table, int);
63 static struct hash_entry *findsym (const char *sym, hash_table table,
73 static int addsym (char sym[], char *str_def, int int_def, hash_table table, int table_size) in addsym()
138 static struct hash_entry *findsym (const char *sym, hash_table table, int table_size) in findsym()
/freebsd/crypto/openssl/apps/
H A Drehash.c102 static BUCKET *hash_table[257]; variable
128 unsigned int ndx = (type + hash) % OSSL_NELEM(hash_table); in add_entry()
130 for (bp = hash_table[ndx]; bp; bp = bp->next) in add_entry()
136 bp->next = hash_table[ndx]; in add_entry()
139 hash_table[ndx] = bp; in add_entry()
414 for (i = 0; i < OSSL_NELEM(hash_table); i++) { in do_dir()
415 for (bp = hash_table[i]; bp; bp = nextbp) { in do_dir()
477 hash_table[i] = NULL; in do_dir()
/freebsd/contrib/ncurses/ncurses/
H A Dreport_hashing.c44 const HashValue *hash_table = _nc_get_hash_table(termcap); in check_names() local
48 entry_ptr = _nc_find_entry(table[n], hash_table); in check_names()
H A Dllib-ltinfow215 const HashValue *hash_table)
H A Dllib-ltinfo203 const HashValue *hash_table)
H A Dllib-ltinfot208 const HashValue *hash_table)
/freebsd/contrib/llvm-project/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/
H A DAppleObjCRuntimeV2.cpp1464 const RemoteNXMapTable &hash_table) { in UpdateSignature() argument
1465 m_count = hash_table.GetCount(); in UpdateSignature()
1466 m_num_buckets = hash_table.GetBucketCount(); in UpdateSignature()
1467 m_buckets_ptr = hash_table.GetBucketDataPointer(); in UpdateSignature()
1472 RemoteNXMapTable &hash_table) { in NeedsUpdate() argument
1473 if (!hash_table.ParseHeader(process, runtime->GetISAHashTablePointer())) { in NeedsUpdate()
1479 if (m_count == hash_table.GetCount() && in NeedsUpdate()
1480 m_num_buckets == hash_table.GetBucketCount() && in NeedsUpdate()
1481 m_buckets_ptr == hash_table.GetBucketDataPointer()) { in NeedsUpdate()
1990 RemoteNXMapTable &hash_table) { in UpdateISAToDescriptorMap() argument
[all …]
H A DAppleObjCRuntimeV2.h120 RemoteNXMapTable &hash_table);
122 void UpdateSignature(const RemoteNXMapTable &hash_table);
336 UpdateISAToDescriptorMap(RemoteNXMapTable &hash_table);
/freebsd/contrib/ntp/ntpq/
H A Dntpq-subs.c372 static mru ** hash_table; variable
2502 for (mon = hash_table[hash]; mon != NULL; mon = mon->hlink) in add_mru()
2515 UNLINK_SLIST(unlinked, hash_table[hash], mon, hlink, mru); in add_mru()
2522 LINK_SLIST(hash_table[hash], add, hlink); in add_mru()
2611 cb = NTP_HASH_SIZE * sizeof(*hash_table); in collect_mru_list()
2612 INSIST(NULL == hash_table); in collect_mru_list()
2613 hash_table = emalloc_zero(cb); in collect_mru_list()
2659 UNLINK_SLIST(unlinked, hash_table[hash], in collect_mru_list()
2758 for (recent = hash_table[hash]; in collect_mru_list()
3001 free(hash_table);
[all...]
/freebsd/sys/contrib/openzfs/module/zfs/
H A Ddbuf_stats.c143 for (db = h->hash_table[dsh->idx]; db != NULL; db = db->db_hash_next) { in dbuf_stats_hash_table_data()
H A Ddbuf.c355 for (db = h->hash_table[idx]; db != NULL; db = db->db_hash_next) { in dbuf_find()
411 for (dbf = h->hash_table[idx], i = 0; dbf != NULL; in dbuf_hash_insert()
432 db->db_hash_next = h->hash_table[idx]; in dbuf_hash_insert()
433 h->hash_table[idx] = db; in dbuf_hash_insert()
500 dbp = &h->hash_table[idx]; in dbuf_hash_remove()
507 if (h->hash_table[idx] && in dbuf_hash_remove()
508 h->hash_table[idx]->db_hash_next == NULL) in dbuf_hash_remove()
961 h->hash_table = NULL; in dbuf_init()
962 while (h->hash_table == NULL) { in dbuf_init()
965 h->hash_table = vmem_zalloc(hsize * sizeof (void *), KM_SLEEP); in dbuf_init()
[all …]
/freebsd/sys/contrib/openzfs/include/sys/
H A Ddbuf.h338 dmu_buf_impl_t **hash_table; member
/freebsd/contrib/llvm-project/llvm/tools/llvm-readobj/
H A DOpts.td60 def hash_table : FF<"hash-table", "Display .hash section">, Group<grp_elf>;

12