forked from kevoreilly/capemon
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lookup.c
72 lines (63 loc) · 1.62 KB
/
lookup.c
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
/*
Cuckoo Sandbox - Automated Malware Analysis
Copyright (C) 2010-2014 Cuckoo Sandbox Developers
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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "ntapi.h"
#include "lookup.h"
void lookup_free(lookup_t *d)
{
// TODO
}
void *lookup_add(lookup_t *d, ULONG_PTR id, unsigned int size)
{
entry_t *t = (entry_t *) calloc(1, sizeof(entry_t) + size);
memset(t, 0, sizeof(*t));
t->next = d->root;
t->id = id;
t->size = size;
d->root = t;
return t->data;
}
void *lookup_get(lookup_t *d, ULONG_PTR id, unsigned int *size)
{
entry_t *p;
for (p = d->root; p != NULL; p = p->next) {
if (p->id == id) {
void *data;
if (size != NULL)
*size = p->size;
data = p->data;
return data;
}
}
return NULL;
}
void lookup_del(lookup_t *d, ULONG_PTR id)
{
entry_t *p;
entry_t *last;
p = d->root;
// edge case; we want to delete the first entry
if (p != NULL && p->id == id) {
entry_t *t = p->next;
free(d->root);
d->root = t;
return;
}
for (last = NULL; p != NULL; last = p, p = p->next)
if (p->id == id) {
last->next = p->next;
free(p);
break;
}
}