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
|
/*
* netsniff-ng - the packet sniffing beast
* Copyright 2011 Daniel Borkmann.
* Subject to the GPL, version 2.
*/
#include <stdint.h>
#include <string.h>
#include <netinet/in.h>
#include "patricia.h"
#include "locking.h"
#include "trie.h"
#include "ipv4.h"
#include "ipv6.h"
static struct patricia_node *tree = NULL;
static struct rwlock tree_lock;
void trie_addr_lookup(char *buff, size_t len, int ipv4, int *fd,
struct sockaddr_storage *addr, size_t *alen)
{
void *data;
size_t dlen;
struct ipv4hdr *hdr4 = (void *) buff;
struct ipv6hdr *hdr6 = (void *) buff;
data = ipv4 ? (void *) &hdr4->h_daddr : (void *) &hdr6->daddr;
dlen = ipv4 ? sizeof(hdr4->h_daddr) : sizeof(hdr6->daddr);
if (unlikely((ipv4 && ((struct ipv4hdr *) buff)->h_version != 4) ||
(!ipv4 && ((struct ipv6hdr *) buff)->version != 6))) {
memset(addr, 0, sizeof(*addr));
(*alen) = 0;
(*fd) = -1;
return;
}
rwlock_rd_lock(&tree_lock);
(*fd) = ptree_search_data_exact(data, dlen, addr, alen, tree);
rwlock_unlock(&tree_lock);
}
int trie_addr_maybe_update(char *buff, size_t len, int ipv4, int fd,
struct sockaddr_storage *addr, size_t alen)
{
int ret;
void *data;
size_t dlen;
struct ipv4hdr *hdr4 = (void *) buff;
struct ipv6hdr *hdr6 = (void *) buff;
data = ipv4 ? (void *) &hdr4->h_saddr : (void *) &hdr6->saddr;
dlen = ipv4 ? sizeof(hdr4->h_saddr) : sizeof(hdr6->saddr);
if (unlikely((ipv4 && ((struct ipv4hdr *) buff)->h_version != 4) ||
(!ipv4 && ((struct ipv6hdr *) buff)->version != 6)))
return -1;
rwlock_wr_lock(&tree_lock);
ret = ptree_add_entry(data, dlen, fd, addr, alen, &tree);
rwlock_unlock(&tree_lock);
return ret;
}
void trie_addr_remove(int fd)
{
int found = 1;
struct patricia_node *n = NULL;
rwlock_wr_lock(&tree_lock);
while (found) {
ptree_get_key(fd, tree, &n);
if (n) {
ptree_del_entry(n->key, n->klen, &tree);
n = NULL;
} else
found = 0;
}
rwlock_unlock(&tree_lock);
}
void trie_addr_remove_addr(struct sockaddr_storage *addr, size_t alen)
{
int found = 1;
struct patricia_node *n = NULL;
rwlock_wr_lock(&tree_lock);
while (found) {
ptree_get_key_addr(addr, alen, tree, &n);
if (n) {
ptree_del_entry(n->key, n->klen, &tree);
n = NULL;
} else
found = 0;
}
rwlock_unlock(&tree_lock);
}
void trie_init(void)
{
rwlock_init(&tree_lock);
}
void trie_cleanup(void)
{
rwlock_wr_lock(&tree_lock);
ptree_free(tree);
rwlock_unlock(&tree_lock);
rwlock_destroy(&tree_lock);
}
|
