1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
* Copyright (c) 2011 Guillermo Ramos <0xwille@gmail.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Should you need to contact me, the author, you can mail your message to
* <0xwille@gmail.com>
*/
#include <linux/errno.h>
#include <linux/list.h>
#include <linux/slab.h>
#include "khashmap.h"
static inline struct khashmap *khm_search(struct khashmap *head, int value)
{
struct list_head *list;
struct khashmap *node;
list_for_each(list, &head->l) {
node = list_entry(list, struct khashmap, l);
if (node->value == value)
return node;
}
return NULL;
}
void khm_display(struct khashmap *head)
{
struct khashmap *node;
struct list_head *list;
int i = 0;
int limit = 10;
printk(KERN_ALERT "Displaying...");
list_for_each(list, &head->l) {
node = list_entry(list, struct khashmap, l);
printk(KERN_ALERT " N%d (%p) v=%d d=%s\n", i++, node,
node->value, (char*)node->data);
if (i >= limit)
break;
}
}
inline struct khashmap *khm_create(void)
{
struct khashmap *head;
head = kmalloc(sizeof(struct khashmap), GFP_KERNEL);
if (!head)
return NULL;
INIT_LIST_HEAD(&head->l);
return head;
}
void khm_destroy(struct khashmap *head)
{
struct khashmap *node;
struct list_head *list = head->l.next;
while (list != &head->l) {
node = list_entry(list, struct khashmap, l);
list = list->next;
kfree(node);
}
kfree(head);
}
int khm_insert(struct khashmap *head, int value, void *data)
{
struct khashmap *new;
// Key already exists
if (khm_search(head, value))
return -EINVAL;
new = khm_create();
if (!new)
return -ENOMEM;
new->value = value;
new->data = data;
list_add_tail(&new->l, &head->l);
return 0;
}
int khm_delete(struct khashmap *head, int value)
{
struct khashmap *node = khm_search(head, value);
if (node) {
list_del(&node->l);
kfree(node);
return 0;
} else {
return -EINVAL;
}
}
void *khm_get(struct khashmap *head, int value)
{
struct khashmap *node = khm_search(head, value);
if (node)
return node->data;
else
return NULL;
}
void khm_set(struct khashmap *head, int value, void *data)
{
struct khashmap *node = khm_search(head, value);
if (node)
node->data = data;
}
|
