u_hash_table.h File Reference

Include dependency graph for u_hash_table.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
struct hash_table *	hash_table_create (unsigned(*hash)(void *key), int(*compare)(void *key1, void *key2))
	Create an hash table.
enum pipe_error	hash_table_set (struct hash_table *ht, void *key, void *value)
void *	hash_table_get (struct hash_table *ht, void *key)
void	hash_table_remove (struct hash_table *ht, void *key)
void	hash_table_clear (struct hash_table *ht)
enum pipe_error	hash_table_foreach (struct hash_table *ht, enum pipe_error(*callback)(void *key, void *value, void *data), void *data)
void	hash_table_destroy (struct hash_table *ht)

---

Function Documentation

void hash_table_clear

(

struct hash_table *

ht

)

Definition at line 222 of file u_hash_table.c.

References assert, hash_table::cso, cso_hash_first_node(), cso_hash_iter_is_null(), cso_hash_iter_key(), cso_hash_take(), and FREE.

{
   struct cso_hash_iter iter;
   struct hash_table_item *item;

   assert(ht);
   
   iter = cso_hash_first_node(ht->cso);
   while (!cso_hash_iter_is_null(iter)) {
      item = (struct hash_table_item *)cso_hash_take(ht->cso, cso_hash_iter_key(iter));
      FREE(item);
      iter = cso_hash_first_node(ht->cso);
   }
}

struct hash_table* hash_table_create	(	unsigned(*)(void *key)	hash,
		int(*)(void *key1, void *key2)	compare
	)			[read]

Create an hash table.

Parameters:

	hash	hash function
	compare	should return 0 for two equal keys.

Definition at line 79 of file u_hash_table.c.

References hash_table::compare, hash_table::cso, cso_hash_create(), FREE, hash_table::hash, and MALLOC_STRUCT.

{
   struct hash_table *ht;
   
   ht = MALLOC_STRUCT(hash_table);
   if(!ht)
      return NULL;
   
   ht->cso = cso_hash_create();
   if(!ht->cso) {
      FREE(ht);
      return NULL;
   }
   
   ht->hash = hash;
   ht->compare = compare;
   
   return ht;
}

void hash_table_destroy

(

struct hash_table *

ht

)

Definition at line 263 of file u_hash_table.c.

References assert, hash_table::cso, cso_hash_delete(), cso_hash_first_node(), cso_hash_iter_data(), cso_hash_iter_is_null(), cso_hash_iter_next(), and FREE.

{
   struct cso_hash_iter iter;
   struct hash_table_item *item;
   
   assert(ht);
   
   iter = cso_hash_first_node(ht->cso);
   while (!cso_hash_iter_is_null(iter)) {
      item = (struct hash_table_item *)cso_hash_iter_data(iter);
      FREE(item);
      iter = cso_hash_iter_next(iter);
   }

   cso_hash_delete(ht->cso);
   
   FREE(ht);
}

enum pipe_error hash_table_foreach	(	struct hash_table *	ht,
		enum pipe_error(*)(void *key, void *value, void *data)	callback,
		void *	data
	)

Definition at line 239 of file u_hash_table.c.

References assert, hash_table::cso, cso_hash_first_node(), cso_hash_iter_data(), cso_hash_iter_is_null(), cso_hash_iter_next(), hash_table_item::key, PIPE_OK, and hash_table_item::value.

{
   struct cso_hash_iter iter;
   struct hash_table_item *item;
   enum pipe_error result;
   
   assert(ht);
   
   iter = cso_hash_first_node(ht->cso);
   while (!cso_hash_iter_is_null(iter)) {
      item = (struct hash_table_item *)cso_hash_iter_data(iter);
      result = callback(item->key, item->value, data);
      if(result != PIPE_OK)
         return result;
      iter = cso_hash_iter_next(iter);
   }

   return PIPE_OK;
}

void* hash_table_get	(	struct hash_table *	ht,
		void *	key
	)

Definition at line 179 of file u_hash_table.c.

References assert, hash_table::hash, hash_table_find_item(), and hash_table_item::value.

{
   unsigned key_hash;
   struct hash_table_item *item;

   assert(ht);

   key_hash = ht->hash(key);

   item = hash_table_find_item(ht, key, key_hash);
   if(!item)
      return NULL;
   
   return item->value;
}

void hash_table_remove	(	struct hash_table *	ht,
		void *	key
	)

Definition at line 198 of file u_hash_table.c.

References assert, hash_table::cso, cso_hash_erase(), cso_hash_iter_is_null(), FREE, hash_table::hash, hash_table_find_iter(), and hash_table_item().

{
   unsigned key_hash;
   struct cso_hash_iter iter;
   struct hash_table_item *item;

   assert(ht);

   key_hash = ht->hash(key);

   iter = hash_table_find_iter(ht, key, key_hash);
   if(cso_hash_iter_is_null(iter))
      return;
   
   item = hash_table_item(iter);
   assert(item);
   FREE(item);
   
   cso_hash_erase(ht->cso, iter);
}

enum pipe_error hash_table_set	(	struct hash_table *	ht,
		void *	key,
		void *	value
	)

Definition at line 142 of file u_hash_table.c.

References assert, hash_table::cso, cso_hash_insert(), cso_hash_iter_is_null(), FREE, hash_table::hash, hash_table_find_item(), hash_table_item::key, MALLOC_STRUCT, PIPE_ERROR_OUT_OF_MEMORY, PIPE_OK, and hash_table_item::value.

{
   unsigned key_hash;
   struct hash_table_item *item;
   struct cso_hash_iter iter;

   assert(ht);

   key_hash = ht->hash(key);

   item = hash_table_find_item(ht, key, key_hash);
   if(item) {
      /* TODO: key/value destruction? */
      item->value = value;
      return PIPE_OK;
   }
   
   item = MALLOC_STRUCT(hash_table_item);
   if(!item)
      return PIPE_ERROR_OUT_OF_MEMORY;
   
   item->key = key;
   item->value = value;
   
   iter = cso_hash_insert(ht->cso, key_hash, item);
   if(cso_hash_iter_is_null(iter)) {
      FREE(item);
      return PIPE_ERROR_OUT_OF_MEMORY;
   }

   return PIPE_OK;
}

---