amxc_htable.c File Reference

Ambiorix hash table API implementation. More...

#include <stdlib.h>
#include <string.h>
#include <amxc/amxc_hash.h>
#include <amxc/amxc_htable.h>
#include <amxc/amxc_macros.h>

Go to the source code of this file.

Functions
static void	amxc_htable_insert_it (amxc_htable_t *const htable, amxc_htable_it_t *const it)
static int	amxc_htable_grow (amxc_htable_t *const htable, size_t hint)
static void	amxc_htable_it_delete_func (amxc_array_it_t *const it)
int	amxc_htable_new (amxc_htable_t **htable, const size_t reserve)
	Allocates a hash table. More...
static int	amxc_htable_cmp_keys (amxc_array_it_t *it1, amxc_array_it_t *it2)
void	amxc_htable_delete (amxc_htable_t **htable, amxc_htable_it_delete_t func)
	Frees the previously allocated hash table. More...
int	amxc_htable_init (amxc_htable_t *const htable, const size_t reserve)
	Initializes a hash table. More...
void	amxc_htable_clean (amxc_htable_t *const htable, amxc_htable_it_delete_t func)
	Removes all items from the hash table. More...
void	amxc_htable_set_hash_func (amxc_htable_t *const htable, amxc_htable_hash_func_t func)
	Sets the hash function for the hash table. More...
unsigned int	amxc_htable_key2index (const amxc_htable_t *const htable, const char *const key)
	Converts a key into an index. More...
int	amxc_htable_insert (amxc_htable_t *const htable, const char *const key, amxc_htable_it_t *const it)
	Inserts an item in the hash table. More...
amxc_htable_it_t *	amxc_htable_get (const amxc_htable_t *const htable, const char *const key)
	Gets a hash table iterator from the hash table. More...
amxc_htable_it_t *	amxc_htable_take (amxc_htable_t *const htable, const char *const key)
	Removes a hash table iterator from the hash table. More...
amxc_htable_it_t *	amxc_htable_get_first (const amxc_htable_t *const htable)
	Gets the first item stored in the table. More...
amxc_htable_it_t *	amxc_htable_get_last (const amxc_htable_t *const htable)
	Gets the last item stored in the table. More...
amxc_array_t *	amxc_htable_get_sorted_keys (const amxc_htable_t *const htable)
	Creates an array containing all keys of the hash table. More...
int	amxc_htable_move (amxc_htable_t *const dest, amxc_htable_t *const src)
	Moves all items from one hash table to another hash table. More...

Detailed Description

Ambiorix hash table API implementation.

Definition in file amxc_htable.c.

Function Documentation

amxc_htable_cmp_keys()

static int amxc_htable_cmp_keys ( amxc_array_it_t *  it1, amxc_array_it_t *  it2  )

static

Definition at line 165 of file amxc_htable.c.

                                                                            {
    const char* key1 = (const char*) amxc_array_it_get_data(it1);
    const char* key2 = (const char*) amxc_array_it_get_data(it2);
    return strcmp(key1 == NULL? "":key1, key2 == NULL? "":key2);
}

amxc_htable_grow()

static int amxc_htable_grow ( amxc_htable_t *const  htable, size_t  hint  )

static

Definition at line 85 of file amxc_htable.c.

                                                                      {
    int retval = -1;
    size_t capacity = htable->table.items;
    amxc_array_it_t* temp = htable->table.buffer;
    size_t start_bucket = htable->table.first_used;
    size_t end_bucket = htable->table.last_used;
 
    htable->table.buffer = NULL;
    htable->table.first_used = 0;
    htable->table.last_used = 0;
    htable->table.items = 0;
    htable->items = 0;
 
    when_null(temp, exit);
 
    if(hint != 0) {
        retval = amxc_array_grow(&htable->table, capacity + hint);
    } else {
        retval = amxc_array_grow(&htable->table, capacity > 1024 ? capacity + 1024 : 2 * capacity);
    }
    when_failed(retval, exit);
 
    for(size_t i = start_bucket; i <= end_bucket; i++) {
        amxc_htable_it_t* hit = (amxc_htable_it_t*) temp[i].data;
        amxc_htable_it_t* next = NULL;
        if(hit == NULL) {
            continue;
        }
        hit->ait = NULL;
        next = hit->next;
        hit->next = NULL;
        amxc_htable_insert_it(htable, hit);
        while(next) {
            hit = next;
            hit->ait = NULL;
            next = hit->next;
            hit->next = NULL;
            amxc_htable_insert_it(htable, hit);
        }
    }
    free(temp);
 
exit:
    return retval;
}

amxc_htable_insert_it()

static void amxc_htable_insert_it ( amxc_htable_t *const  htable, amxc_htable_it_t *const  it  )

static

Definition at line 68 of file amxc_htable.c.

                                                              {
    unsigned int index = 0;
    amxc_array_it_t* ait = NULL;
 
    amxc_htable_it_take(it);
    index = amxc_htable_key2index(htable, it->key);
    ait = amxc_array_get_at(&htable->table, index);
    // insert item
    if((ait != NULL) && (ait->data != NULL)) {
        it->next = (amxc_htable_it_t*) ait->data;
    }
    amxc_array_it_set_data(ait, it);
    it->ait = ait;
    htable->items++;
}

amxc_htable_it_delete_func()

static void amxc_htable_it_delete_func ( amxc_array_it_t *const  it )

static

Definition at line 131 of file amxc_htable.c.

                                                                  {
    amxc_htable_t* htable = (amxc_htable_t*) it->array;
    amxc_htable_it_t* current = (amxc_htable_it_t*) it->data;
 
    while(current != NULL) {
        amxc_htable_it_t* next = current->next;
        char* key = current->key;
        current->key = NULL;
        amxc_htable_it_take(current);
        if(htable->it_del != NULL) {
            htable->it_del(key, current);
        }
        free(key);
        current = next;
    }
}