WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/adt/hash_table.c


/*
 * Copyright (C) 2006 Jakub Jermar
 * 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.
 * - 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.
 */
 
/**
 * @file    hash_table.c
 * @brief   Implementation of generic chained hash table.
 *
 * This file contains implementation of generic chained hash table.
 */
 
#include <adt/hash_table.h>
#include <adt/list.h>
#include <typedefs.h>
#include <arch/types.h>
#include <debug.h>
#include <mm/slab.h>
#include <memstr.h>
 
/** Create chained hash table.
 *
 * @param h Hash table structure. Will be initialized by this call.
 * @param m Number of slots in the hash table.
 * @param max_keys Maximal number of keys needed to identify an item.
 * @param op Hash table operations structure.
 */
void hash_table_create(hash_table_t *h, count_t m, count_t max_keys, hash_table_operations_t *op)
{
    int i;
 
    ASSERT(h);
    ASSERT(op && op->hash && op->compare);
    ASSERT(max_keys > 0);
   
    h->entry = malloc(m * sizeof(link_t), 0);
    if (!h->entry) {
        panic("cannot allocate memory for hash table\n");
    }
    memsetb((__address) h->entry, m * sizeof(link_t), 0);
   
    for (i = 0; i < m; i++)
        list_initialize(&h->entry[i]);
   
    h->entries = m;
    h->max_keys = max_keys;
    h->op = op;
}
 
/** Insert item into hash table.
 *
 * @param h Hash table.
 * @param hey Array of all keys necessary to compute hash index.
 * @param item Item to be inserted into the hash table.
 */
void hash_table_insert(hash_table_t *h, __native key[], link_t *item)
{
    index_t chain;
 
    ASSERT(item);
    ASSERT(h && h->op && h->op->hash && h->op->compare);
 
    chain = h->op->hash(key);
    ASSERT(chain < h->entries);
   
    list_append(item, &h->entry[chain]);
}
 
/** Search hash table for an item matching keys.
 *
 * @param h Hash table.
 * @param key Array of all keys needed to compute hash index.
 *
 * @return Matching item on success, NULL if there is no such item.
 */
link_t *hash_table_find(hash_table_t *h, __native key[])
{
    link_t *cur;
    index_t chain;
 
    ASSERT(h && h->op && h->op->hash && h->op->compare);
 
    chain = h->op->hash(key);
    ASSERT(chain < h->entries);
   
 
 
 
 
    for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) {
        if (h->op->compare(key, h->max_keys, cur)) {
            /*
             * The entry is there.
             */
            return cur;
        }
    }
   
    return NULL;
}
 
/** Remove all matching items from hash table.
 *
 * For each removed item, h->remove_callback() is called.
 *
 * @param h Hash table.
 * @param key Array of keys that will be compared against items of the hash table.
 * @param keys Number of keys in the key array.
 */
void hash_table_remove(hash_table_t *h, __native key[], count_t keys)
{
    index_t chain;
    link_t *cur;
 
    ASSERT(h && h->op && h->op->hash && h->op->compare && h->op->remove_callback);
    ASSERT(keys <= h->max_keys);
   
    if (keys == h->max_keys) {
 
        /*
         * All keys are known, hash_table_find() can be used to find the entry.
         */
   
        cur = hash_table_find(h, key);
        if (cur) {
            list_remove(cur);
            h->op->remove_callback(cur);
        }
        return;
    }
   
    /*
     * Fewer keys were passed.
     * Any partially matching entries are to be removed.
     */
    for (chain = 0; chain < h->entries; chain++) {
        for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) {
            if (h->op->compare(key, keys, cur)) {
                link_t *hlp;
               
                hlp = cur;
                cur = cur->prev;
               
                list_remove(hlp);
                h->op->remove_callback(hlp);
               
                continue;
            }
        }
    }
}
 

Rev 1248	Rev 1337
1	/*	1	/*
2	* Copyright (C) 2006 Jakub Jermar	2	* Copyright (C) 2006 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/**	29	/**
30	* @file hash_table.c	30	* @file hash_table.c
31	* @brief Implementation of generic chained hash table.	31	* @brief Implementation of generic chained hash table.
32	*	32	*
33	* This file contains implementation of generic chained hash table.	33	* This file contains implementation of generic chained hash table.
34	*/	34	*/
35		35
36	#include <adt/hash_table.h>	36	#include <adt/hash_table.h>
37	#include <adt/list.h>	37	#include <adt/list.h>
38	#include <typedefs.h>	38	#include <typedefs.h>
39	#include <arch/types.h>	39	#include <arch/types.h>
40	#include <debug.h>	40	#include <debug.h>
41	#include <mm/slab.h>	41	#include <mm/slab.h>
42	#include <memstr.h>	42	#include <memstr.h>
43		43
44	/** Create chained hash table.	44	/** Create chained hash table.
45	*	45	*
46	* @param h Hash table structure. Will be initialized by this call.	46	* @param h Hash table structure. Will be initialized by this call.
47	* @param m Number of slots in the hash table.	47	* @param m Number of slots in the hash table.
48	* @param max_keys Maximal number of keys needed to identify an item.	48	* @param max_keys Maximal number of keys needed to identify an item.
49	* @param op Hash table operations structure.	49	* @param op Hash table operations structure.
50	*/	50	*/
51	void hash_table_create(hash_table_t h, count_t m, count_t max_keys, hash_table_operations_t op)	51	void hash_table_create(hash_table_t h, count_t m, count_t max_keys, hash_table_operations_t op)
52	{	52	{
53	int i;	53	int i;
54		54
55	ASSERT(h);	55	ASSERT(h);
56	ASSERT(op && op->hash && op->compare);	56	ASSERT(op && op->hash && op->compare);
57	ASSERT(max_keys > 0);	57	ASSERT(max_keys > 0);
58		58
59	h->entry = malloc(m * sizeof(link_t), 0);	59	h->entry = malloc(m * sizeof(link_t), 0);
60	if (!h->entry) {	60	if (!h->entry) {
61	panic("cannot allocate memory for hash table\n");	61	panic("cannot allocate memory for hash table\n");
62	}	62	}
63	memsetb((__address) h->entry, m * sizeof(link_t), 0);	63	memsetb((__address) h->entry, m * sizeof(link_t), 0);
64		64
65	for (i = 0; i < m; i++)	65	for (i = 0; i < m; i++)
66	list_initialize(&h->entry[i]);	66	list_initialize(&h->entry[i]);
67		67
68	h->entries = m;	68	h->entries = m;
69	h->max_keys = max_keys;	69	h->max_keys = max_keys;
70	h->op = op;	70	h->op = op;
71	}	71	}
72		72
73	/** Insert item into hash table.	73	/** Insert item into hash table.
74	*	74	*
75	* @param h Hash table.	75	* @param h Hash table.
76	* @param hey Array of all keys necessary to compute hash index.	76	* @param hey Array of all keys necessary to compute hash index.
77	* @param item Item to be inserted into the hash table.	77	* @param item Item to be inserted into the hash table.
78	*/	78	*/
79	void hash_table_insert(hash_table_t h, __native key[], link_t item)	79	void hash_table_insert(hash_table_t h, __native key[], link_t item)
80	{	80	{
81	index_t chain;	81	index_t chain;
82		82
83	ASSERT(item);	83	ASSERT(item);
84	ASSERT(h && h->op && h->op->hash && h->op->compare);	84	ASSERT(h && h->op && h->op->hash && h->op->compare);
85		85
86	chain = h->op->hash(key);	86	chain = h->op->hash(key);
87	ASSERT(chain < h->entries);	87	ASSERT(chain < h->entries);
88		88
89	list_append(item, &h->entry[chain]);	89	list_append(item, &h->entry[chain]);
90	}	90	}
91		91
92	/** Search hash table for an item matching keys.	92	/** Search hash table for an item matching keys.
93	*	93	*
94	* @param h Hash table.	94	* @param h Hash table.
95	* @param key Array of all keys needed to compute hash index.	95	* @param key Array of all keys needed to compute hash index.
96	*	96	*
97	* @return Matching item on success, NULL if there is no such item.	97	* @return Matching item on success, NULL if there is no such item.
98	*/	98	*/
99	link_t hash_table_find(hash_table_t h, __native key[])	99	link_t hash_table_find(hash_table_t h, __native key[])
100	{	100	{
101	link_t *cur;	101	link_t *cur;
102	index_t chain;	102	index_t chain;
103		103
104	ASSERT(h && h->op && h->op->hash && h->op->compare);	104	ASSERT(h && h->op && h->op->hash && h->op->compare);
105		105
106	chain = h->op->hash(key);	106	chain = h->op->hash(key);
107	ASSERT(chain < h->entries);	107	ASSERT(chain < h->entries);
108		108
109	/*	-
110	* The hash table is not redundant.	-
111	* Check if the keys are not in place already.	-
112	*/	-
113	for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) {	109	for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) {
114	if (h->op->compare(key, h->max_keys, cur)) {	110	if (h->op->compare(key, h->max_keys, cur)) {
115	/*	111	/*
116	* The entry is there.	112	* The entry is there.
117	*/	113	*/
118	return cur;	114	return cur;
119	}	115	}
120	}	116	}
121		117
122	return NULL;	118	return NULL;
123	}	119	}
124		120
125	/** Remove all matching items from hash table.	121	/** Remove all matching items from hash table.
126	*	122	*
127	* For each removed item, h->remove_callback() is called.	123	* For each removed item, h->remove_callback() is called.
128	*	124	*
129	* @param h Hash table.	125	* @param h Hash table.
130	* @param key Array of keys that will be compared against items of the hash table.	126	* @param key Array of keys that will be compared against items of the hash table.
131	* @param keys Number of keys in the key array.	127	* @param keys Number of keys in the key array.
132	*/	128	*/
133	void hash_table_remove(hash_table_t *h, __native key[], count_t keys)	129	void hash_table_remove(hash_table_t *h, __native key[], count_t keys)
134	{	130	{
135	index_t chain;	131	index_t chain;
136	link_t *cur;	132	link_t *cur;
137		133
138	ASSERT(h && h->op && h->op->hash && h->op->compare && h->op->remove_callback);	134	ASSERT(h && h->op && h->op->hash && h->op->compare && h->op->remove_callback);
139	ASSERT(keys <= h->max_keys);	135	ASSERT(keys <= h->max_keys);
140		136
141	if (keys == h->max_keys) {	137	if (keys == h->max_keys) {
142		138
143	/*	139	/*
144	* All keys are known, hash_table_find() can be used to find the entry.	140	* All keys are known, hash_table_find() can be used to find the entry.
145	*/	141	*/
146		142
147	cur = hash_table_find(h, key);	143	cur = hash_table_find(h, key);
148	if (cur) {	144	if (cur) {
149	list_remove(cur);	145	list_remove(cur);
150	h->op->remove_callback(cur);	146	h->op->remove_callback(cur);
151	}	147	}
152	return;	148	return;
153	}	149	}
154		150
155	/*	151	/*
156	* Fewer keys were passed.	152	* Fewer keys were passed.
157	* Any partially matching entries are to be removed.	153	* Any partially matching entries are to be removed.
158	*/	154	*/
159	for (chain = 0; chain < h->entries; chain++) {	155	for (chain = 0; chain < h->entries; chain++) {
160	for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) {	156	for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) {
161	if (h->op->compare(key, keys, cur)) {	157	if (h->op->compare(key, keys, cur)) {
162	link_t *hlp;	158	link_t *hlp;
163		159
164	hlp = cur;	160	hlp = cur;
165	cur = cur->prev;	161	cur = cur->prev;
166		162
167	list_remove(hlp);	163	list_remove(hlp);
168	h->op->remove_callback(hlp);	164	h->op->remove_callback(hlp);
169		165
170	continue;	166	continue;
171	}	167	}
172	}	168	}
173	}	169	}
174	}	170	}
175		171

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/adt/hash_table.c – Rev 1248 → 1337