/*
 * Copyright (C) 2010 spy
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
#ifndef __HASH_H__
#define __HASH_H__

#include <sys/types.h>

typedef struct hash_node {
    const char      *n_key;     /* hash key */
    struct hash_node    *n_next;    /* next node */
    struct hash_node    *n_prev;    /* previous node */
} hash_node_t;

typedef struct hash_table {
    const char      *t_name;    /* name */
    size_t          t_off;      /* offset to node data */
    size_t          t_size;     /* table size in elements */
    size_t          t_nelem;    /* number of nodes */
    boolean_t       t_nocase;   /* case-insensitive flag */
    int         t_salt;     /* hash salt */
    hash_node_t     *t_nodes;   /* node list */
    hash_node_t     *t_table;   /* table array */
} hash_table_t;

void hash_init(hash_table_t *tp, const char *name, size_t off, size_t size,
           boolean_t nocase);
void hash_fini(hash_table_t *tp);
void hash_node_init(hash_node_t *np, const char *key);
void hash_table_rehash(hash_table_t *tp, int salt);
void hash_insert(hash_table_t *tp, hash_node_t *np);
void hash_remove(hash_table_t *tp, hash_node_t *np);
void *hash_find(hash_table_t *tp, const char *key);

#endif  /* __HASH_H__ */