c6c8fea297
B.A.T.M.A.N. (better approach to mobile ad-hoc networking) is a routing protocol for multi-hop ad-hoc mesh networks. The networks may be wired or wireless. See http://www.open-mesh.org/ for more information and user space tools. Signed-off-by: Sven Eckelmann <sven@narfation.org> Signed-off-by: David S. Miller <davem@davemloft.net>
62 lines
1.4 KiB
C
62 lines
1.4 KiB
C
/*
|
|
* Copyright (C) 2006-2010 B.A.T.M.A.N. contributors:
|
|
*
|
|
* Simon Wunderlich, Marek Lindner
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of version 2 of the GNU General Public
|
|
* License as published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
* 02110-1301, USA
|
|
*
|
|
*/
|
|
|
|
#include "main.h"
|
|
#include "hash.h"
|
|
|
|
/* clears the hash */
|
|
static void hash_init(struct hashtable_t *hash)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0 ; i < hash->size; i++)
|
|
INIT_HLIST_HEAD(&hash->table[i]);
|
|
}
|
|
|
|
/* free only the hashtable and the hash itself. */
|
|
void hash_destroy(struct hashtable_t *hash)
|
|
{
|
|
kfree(hash->table);
|
|
kfree(hash);
|
|
}
|
|
|
|
/* allocates and clears the hash */
|
|
struct hashtable_t *hash_new(int size)
|
|
{
|
|
struct hashtable_t *hash;
|
|
|
|
hash = kmalloc(sizeof(struct hashtable_t) , GFP_ATOMIC);
|
|
|
|
if (!hash)
|
|
return NULL;
|
|
|
|
hash->size = size;
|
|
hash->table = kmalloc(sizeof(struct element_t *) * size, GFP_ATOMIC);
|
|
|
|
if (!hash->table) {
|
|
kfree(hash);
|
|
return NULL;
|
|
}
|
|
|
|
hash_init(hash);
|
|
|
|
return hash;
|
|
}
|