Subversion Repositories HelenOS-historic

Rev

Rev 1335 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
996 cejka 1
/*
2
 * Copyright (C) 2006 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
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
15
 *   derived from this software without specific prior written permission.
16
 *
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
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
29
#ifndef __HASH_TABLE_H__
30
#define __HASH_TABLE_H__
31
 
1335 jermar 32
#include <libadt/list.h>
996 cejka 33
#include <unistd.h>
34
 
35
typedef unsigned long hash_count_t;
36
typedef unsigned long hash_index_t;
37
typedef struct hash_table hash_table_t;
38
typedef struct hash_table_operations hash_table_operations_t;
39
 
40
/** Hash table structure. */
41
struct hash_table {
42
    link_t *entry;
43
    hash_count_t entries;
44
    hash_count_t max_keys;
45
    hash_table_operations_t *op;
46
};
47
 
48
/** Set of operations for hash table. */
49
struct hash_table_operations {
50
    /** Hash function.
51
     *
52
     * @param key Array of keys needed to compute hash index. All keys must be passed.
53
     *
54
     * @return Index into hash table.
55
     */
997 cejka 56
    hash_index_t (* hash)(unsigned long key[]);
996 cejka 57
 
58
    /** Hash table item comparison function.
59
     *
60
     * @param key Array of keys that will be compared with item. It is not necessary to pass all keys.
61
     *
62
     * @return true if the keys match, false otherwise.
63
     */
997 cejka 64
    int (*compare)(unsigned long key[], hash_count_t keys, link_t *item);
996 cejka 65
 
66
    /** Hash table item removal callback.
67
     *
68
     * @param item Item that was removed from the hash table.
69
     */
70
    void (*remove_callback)(link_t *item);
71
};
72
 
73
#define hash_table_get_instance(item, type, member) list_get_instance((item), type, member)
74
 
997 cejka 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);
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);
996 cejka 79
 
80
#endif