#include <hash.h>

Collaboration diagram for hash:

Data Fields
unsigned int	width
	Number of bits - hash array must be 2^width long.

hash_func_T	func

struct list_head	hash [1]
	Must be at end !

Related Symbols
(Note that these are not member symbols.)
struct hash *	init_hash8 (void)

void	free_hash (struct hash **hashp)

struct hash_item *	add_hash_item (struct hash hash, const char key, unsigned int keylen, void *value)

struct hash_item *	get_hash_item (struct hash hash, const char key, unsigned int keylen)

void	del_hash_item (struct hash hash, struct hash_item item)
	Delete item from hash.

#define	foreach_hash_item(item, hash_table, iterator)

Friends And Related Symbol Documentation

◆ add_hash_item()

struct hash_item * add_hash_item	(	struct hash *	hash,
		const char *	key,
		unsigned int	keylen,
		void *	value
	)

If key and/or value were dynamically allocated, think about freeing them. This function doesn't do that.

for (iterator = 0; iterator < (1 << (hash_table).width); iterator++) \

foreach (item, (hash_table).hash[iterator])

unsigned int width

Number of bits - hash array must be 2^width long.

Definition hash.h:25

void free_hash ( struct hash ** hashp )

struct hash_item * get_hash_item	(	struct hash *	hash,
		const char *	key,
		unsigned int	keylen
	)

struct hash * init_hash8 ( void )

struct list_head hash::hash[1]

Must be at end !

unsigned int hash::width

Number of bits - hash array must be 2^width long.

The documentation for this struct was generated from the following files: