hash_table
k5_hashtab_remove(hash_table, entry->req_packet.data,
ret = k5_hashtab_create(seed, 8192, &hash_table);
e = k5_hashtab_get(hash_table, req_packet->data, req_packet->length);
e = k5_hashtab_get(hash_table, req_packet->data, req_packet->length);
k5_hashtab_free(hash_table);
static struct k5_hashtab *hash_table;
ret = k5_hashtab_add(hash_table, entry->req_packet.data,
assert_ptr_equal(k5_hashtab_get(hash_table, req.data, req.length), e);
assert_ptr_equal(k5_hashtab_get(hash_table, req.data, req.length), e);
assert_ptr_equal(k5_hashtab_get(hash_table, req1.data, req1.length), e1);
assert_ptr_equal(k5_hashtab_get(hash_table, req2.data, req2.length), e2);
assert_null(k5_hashtab_get(hash_table, req.data, req.length));
assert_null(k5_hashtab_get(hash_table, req.data, req.length));
assert_null(k5_hashtab_get(hash_table, req.data, req.length));
assert_ptr_equal(k5_hashtab_get(hash_table, req1.data, req1.length), e);
assert_null(k5_hashtab_get(hash_table, req2.data, req2.length));
assert_ptr_equal(k5_hashtab_get(hash_table, req1.data, req1.length), e1);
assert_null(k5_hashtab_get(hash_table, req1.data, req1.length));
hash_ent = k5_hashtab_get(hash_table, req.data, req.length);
hash_ent = k5_hashtab_get(hash_table, req.data, req.length);
hash1_ent = k5_hashtab_get(hash_table, req1.data, req1.length);
hash2_ent = k5_hashtab_get(hash_table, req2.data, req2.length);
hash1_ent = k5_hashtab_get(hash_table, req1.data, req1.length);
e = k5_hashtab_get(hash_table, req1.data, req1.length);
assert_null(k5_hashtab_get(hash_table, req1.data, req1.length));
hash2_ent = k5_hashtab_get(hash_table, req2.data, req2.length);
ret = k5_hashtab_create(seed, 64, &mrc->hash_table);
e = k5_hashtab_get(mrc->hash_table, tag->data, tag->length);
k5_hashtab_free(mrc->hash_table);
struct k5_hashtab *hash_table;
ret = k5_hashtab_add(mrc->hash_table, entry->tag.data, entry->tag.length,
k5_hashtab_remove(mrc->hash_table, entry->tag.data, entry->tag.length);
static BUCKET *hash_table[257];
unsigned int ndx = (type + hash) % OSSL_NELEM(hash_table);
for (bp = hash_table[ndx]; bp; bp = bp->next)
bp->next = hash_table[ndx];
hash_table[ndx] = bp;
for (i = 0; i < OSSL_NELEM(hash_table); i++) {
for (bp = hash_table[i]; bp; bp = nextbp) {
hash_table[i] = NULL;
struct hash_table *
struct hash_table *rval;
rval = calloc(1, sizeof(struct hash_table) -
struct hash_table *new_hash_table(int);
struct hash_table *new_hash(void);
void add_hash(struct hash_table *, const unsigned char *, int, unsigned char *);
void *hash_lookup(struct hash_table *, unsigned char *, int);
extern struct hash_table universe_hash;
hash_lookup(struct hash_table *table, unsigned char *name, int len)
struct hash_table *
struct hash_table *rv = new_hash_table(DEFAULT_HASH_SIZE);
void add_hash(struct hash_table *table, const unsigned char *name, int len,
struct hash_table universe_hash;
struct hash_table *hash;
if (hash_table[hashindex].uid == uid)
hash_table[hashindex].uid = uid;
(void) strncpy(hash_table[hashindex].name, name, MAXLOGNAME - 1);
#define is_empty_hash(x) (hash_table[x].name[0] == 0)
static struct hash_el hash_table[Table_size];
if (is_empty_hash(hashindex) || (hash_table[hashindex].uid != uid))
return(hash_table[hashindex].name);