Rev 1335 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1335 | Rev 1392 | ||
---|---|---|---|
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 | #ifndef __HASH_TABLE_H__ |
29 | #ifndef __HASH_TABLE_H__ |
30 | #define __HASH_TABLE_H__ |
30 | #define __HASH_TABLE_H__ |
31 | 31 | ||
32 | #include <libadt/list.h> |
32 | #include <libadt/list.h> |
33 | #include <unistd.h> |
33 | #include <unistd.h> |
34 | 34 | ||
35 | typedef unsigned long hash_count_t; |
35 | typedef unsigned long hash_count_t; |
36 | typedef unsigned long hash_index_t; |
36 | typedef unsigned long hash_index_t; |
37 | typedef struct hash_table hash_table_t; |
37 | typedef struct hash_table hash_table_t; |
38 | typedef struct hash_table_operations hash_table_operations_t; |
38 | typedef struct hash_table_operations hash_table_operations_t; |
39 | 39 | ||
40 | /** Hash table structure. */ |
40 | /** Hash table structure. */ |
41 | struct hash_table { |
41 | struct hash_table { |
42 | link_t *entry; |
42 | link_t *entry; |
43 | hash_count_t entries; |
43 | hash_count_t entries; |
44 | hash_count_t max_keys; |
44 | hash_count_t max_keys; |
45 | hash_table_operations_t *op; |
45 | hash_table_operations_t *op; |
46 | }; |
46 | }; |
47 | 47 | ||
48 | /** Set of operations for hash table. */ |
48 | /** Set of operations for hash table. */ |
49 | struct hash_table_operations { |
49 | struct hash_table_operations { |
50 | /** Hash function. |
50 | /** Hash function. |
51 | * |
51 | * |
52 | * @param key Array of keys needed to compute hash index. All keys must be passed. |
52 | * @param key Array of keys needed to compute hash index. All keys must be passed. |
53 | * |
53 | * |
54 | * @return Index into hash table. |
54 | * @return Index into hash table. |
55 | */ |
55 | */ |
56 | hash_index_t (* hash)(unsigned long key[]); |
56 | hash_index_t (* hash)(unsigned long key[]); |
57 | 57 | ||
58 | /** Hash table item comparison function. |
58 | /** Hash table item comparison function. |
59 | * |
59 | * |
60 | * @param key Array of keys that will be compared with item. It is not necessary to pass all keys. |
60 | * @param key Array of keys that will be compared with item. It is not necessary to pass all keys. |
61 | * |
61 | * |
62 | * @return true if the keys match, false otherwise. |
62 | * @return true if the keys match, false otherwise. |
63 | */ |
63 | */ |
64 | int (*compare)(unsigned long key[], hash_count_t keys, link_t *item); |
64 | int (*compare)(unsigned long key[], hash_count_t keys, link_t *item); |
65 | 65 | ||
66 | /** Hash table item removal callback. |
66 | /** Hash table item removal callback. |
67 | * |
67 | * |
68 | * @param item Item that was removed from the hash table. |
68 | * @param item Item that was removed from the hash table. |
69 | */ |
69 | */ |
70 | void (*remove_callback)(link_t *item); |
70 | void (*remove_callback)(link_t *item); |
71 | }; |
71 | }; |
72 | 72 | ||
73 | #define hash_table_get_instance(item, type, member) list_get_instance((item), type, member) |
73 | #define hash_table_get_instance(item, type, member) list_get_instance((item), type, member) |
74 | 74 | ||
75 | extern int hash_table_create(hash_table_t *h, hash_count_t m, hash_count_t max_keys, hash_table_operations_t *op); |
75 | extern int hash_table_create(hash_table_t *h, hash_count_t m, hash_count_t max_keys, hash_table_operations_t *op); |
76 | extern void hash_table_insert(hash_table_t *h, unsigned long key[], link_t *item); |
76 | extern void hash_table_insert(hash_table_t *h, unsigned long key[], link_t *item); |
77 | extern link_t *hash_table_find(hash_table_t *h, unsigned long key[]); |
77 | extern link_t *hash_table_find(hash_table_t *h, unsigned long key[]); |
78 | extern void hash_table_remove(hash_table_t *h, unsigned long key[], hash_count_t keys); |
78 | extern void hash_table_remove(hash_table_t *h, unsigned long key[], hash_count_t keys); |
79 | 79 | ||
80 | #endif |
80 | #endif |
81 | 81 |