/*
 * Copyright (c) 2009, Rambler media
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * 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.
 *
 * THIS SOFTWARE IS PROVIDED BY Rambler media ''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 Rambler 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.
 */

#include "config.h"
#include "hash.h"

#define HASH_TABLE_MIN_SIZE 19
#define HASH_TABLE_MAX_SIZE 13845163

/*
 * Performs a lookup in the hash table.  Virtually all hash operations
 * will use this function internally.
 */
static inline struct rspamd_hash_node **
rspamd_hash_lookup_node (rspamd_hash_t *hash, gconstpointer  key, guint *hash_return)
{
	struct rspamd_hash_node **node_ptr, *node;
	guint hash_value;
	hash_value = (* hash->hash_func) (key);

	if (hash->shared) {
		memory_pool_rlock_rwlock (hash->lock);
	}
	node_ptr = &hash->nodes[hash_value % hash->size];

	if (hash_return)
		*hash_return = hash_value;

	/* Hash table lookup needs to be fast.
	*  We therefore remove the extra conditional of testing
	*  whether to call the key_equal_func or not from
	*  the inner loop.
	*
	*  Additional optimisation: first check if our full hash
	*  values are equal so we can avoid calling the full-blown
	*  key equality function in most cases.
	*/
	if (hash->key_equal_func) {
		while ((node = *node_ptr)) {
			if (node->key_hash == hash_value && hash->key_equal_func (node->key, key)) {
            	break;
			}
			node_ptr = &(*node_ptr)->next;
		}
	} else {
		while ((node = *node_ptr)) {
			if (node->key == key) {
				break;
			}
			node_ptr = &(*node_ptr)->next;
		}
	}
	if (hash->shared) {
		memory_pool_runlock_rwlock (hash->lock);
	}
	return node_ptr;
}

/*
 * Removes a node from the hash table and updates the node count.
 * No table resize is performed.
 */
static void
rspamd_hash_remove_node (rspamd_hash_t *hash, struct rspamd_hash_node ***node_ptr_ptr)
{
	struct rspamd_hash_node **node_ptr, *node;

	if (hash->shared) {
		memory_pool_wlock_rwlock (hash->lock);
	}
	node_ptr = *node_ptr_ptr;
	node = *node_ptr;
	
	*node_ptr = node->next;
	
	hash->nnodes--;
	if (hash->shared) {
		memory_pool_wunlock_rwlock (hash->lock);
	}
}

/*
 * Resizes the hash table to the optimal size based on the number of
 * nodes currently held.
 */
static void
rspamd_hash_resize (rspamd_hash_t *hash)
{
	struct rspamd_hash_node **new_nodes;
	struct rspamd_hash_node *node, *next;
	guint hash_val;
	gint new_size, i;

	new_size = g_spaced_primes_closest (hash->nnodes);
	new_size = CLAMP (new_size, HASH_TABLE_MIN_SIZE, HASH_TABLE_MAX_SIZE);

	new_nodes = memory_pool_alloc (hash->pool, sizeof (struct rspamd_hash_node *) * new_size);

	if (hash->shared) {
		memory_pool_wlock_rwlock (hash->lock);
	}

	for (i = 0; i < hash->size; i++) {
		for (node = hash->nodes[i]; node; node = next) {
			next = node->next;
			hash_val = node->key_hash % new_size;
			node->next = new_nodes[hash_val];
			new_nodes[hash_val] = node;
		}
	}

	hash->nodes = new_nodes;
	hash->size = new_size;

	if (hash->shared) {
		memory_pool_wunlock_rwlock (hash->lock);
	}
}

/*
 * Resizes the hash table, if needed.
 */
static inline void
rspamd_hash_maybe_resize (rspamd_hash_t *hash)
{
	gint nnodes = hash->nnodes;
	gint size = hash->size;
	
	if ((size >= 3 * nnodes && size > HASH_TABLE_MIN_SIZE) ||
			(3 * size <= nnodes && size < HASH_TABLE_MAX_SIZE)) {
		rspamd_hash_resize (hash);
	}
}

/* Create new hash in specified pool */
rspamd_hash_t* 
rspamd_hash_new (memory_pool_t *pool, GHashFunc hash_func, GEqualFunc key_equal_func)
{
	rspamd_hash_t* hash;

	hash = memory_pool_alloc (pool, sizeof (rspamd_hash_t));
	hash->size               = HASH_TABLE_MIN_SIZE;
	hash->nnodes             = 0;
	hash->hash_func          = hash_func ? hash_func : g_direct_hash;
	hash->key_equal_func     = key_equal_func;
	hash->nodes              = memory_pool_alloc0 (pool, sizeof (struct rspamd_hash_node*) * hash->size);
	hash->shared             = 0;
	hash->pool               = pool;
	
	return hash;
}

/* 
 * Create new hash in specified pool using shared memory 
 */
rspamd_hash_t* 
rspamd_hash_new_shared (memory_pool_t *pool, GHashFunc hash_func, GEqualFunc key_equal_func)
{
	rspamd_hash_t* hash;

	hash = memory_pool_alloc_shared (pool, sizeof (rspamd_hash_t));
	hash->size               = HASH_TABLE_MIN_SIZE;
	hash->nnodes             = 0;
	hash->hash_func          = hash_func ? hash_func : g_direct_hash;
	hash->key_equal_func     = key_equal_func;
	hash->nodes              = memory_pool_alloc0 (pool, sizeof (struct rspamd_hash_node*) * hash->size);
	hash->shared             = 1;
	/* Get mutex from pool for locking on insert/remove operations */
	hash->lock               = memory_pool_get_rwlock (pool);
	hash->pool               = pool;
	
	return hash;
}

/* 
 * Insert item in hash 
 */
void 
rspamd_hash_insert (rspamd_hash_t *hash, gpointer key, gpointer value)
{
	struct rspamd_hash_node **node_ptr, *node;
	guint key_hash;

	g_return_if_fail (hash != NULL);
  	node_ptr = rspamd_hash_lookup_node (hash, key, &key_hash);

	if (hash->shared) {
		memory_pool_wlock_rwlock (hash->lock);
	}
	if ((node = *node_ptr)) {
		node->key = key;
		node->value = value;
	}
	else {
		if (hash->shared) {
			node = memory_pool_alloc_shared (hash->pool, sizeof (struct rspamd_hash_node));
		}
		else {
			node = memory_pool_alloc (hash->pool, sizeof (struct rspamd_hash_node));
		}
		
		node->key = key;
		node->value = value;
		node->key_hash = key_hash;
		node->next = NULL;
		
		*node_ptr = node;
		hash->nnodes ++;
		rspamd_hash_maybe_resize (hash);

    }
	if (hash->shared) {
		memory_pool_wunlock_rwlock (hash->lock);
	}

}

/* 
 * Remove item from hash 
 */
gboolean 
rspamd_hash_remove (rspamd_hash_t *hash, gpointer key)
{
	struct rspamd_hash_node **node_ptr;

	g_return_val_if_fail (hash != NULL, FALSE);

	node_ptr = rspamd_hash_lookup_node (hash, key, NULL);
	if (*node_ptr == NULL)
		return FALSE;

	rspamd_hash_remove_node (hash, &node_ptr);
	rspamd_hash_maybe_resize (hash);

	return TRUE;
}

/* 
 * Lookup item from hash 
 */
gpointer 
rspamd_hash_lookup (rspamd_hash_t *hash, gpointer key)
{
	struct rspamd_hash_node *node;
	g_return_val_if_fail (hash != NULL, NULL);
	
	node = *rspamd_hash_lookup_node (hash, key, NULL);
	
	return node ? node->value : NULL;
}

/* 
 * Iterate throught hash 
 */
void 
rspamd_hash_foreach (rspamd_hash_t *hash, GHFunc func, gpointer user_data)
{
	struct rspamd_hash_node *node;
	gint i;
	
	g_return_if_fail (hash != NULL);
	g_return_if_fail (func != NULL);

	if (hash->shared) {
		memory_pool_rlock_rwlock (hash->lock);
	}
	for (i = 0; i < hash->size; i++) {
		for (node = hash->nodes[i]; node; node = node->next) {
			(* func) (node->key, node->value, user_data);
		}
	}
	if (hash->shared) {
		memory_pool_runlock_rwlock (hash->lock);
	}
}

/*
 * vi:ts=4
 */