forked from ns1/pktvisor-v1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
dnsctxt.c
279 lines (239 loc) · 7.65 KB
/
dnsctxt.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
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
/*
* Copyright 2015 NSONE, Inc.
*/
#include <stdio.h>
#include <arpa/inet.h>
#include "dnsctxt.h"
// uthash LRU: https://gist.github.com/jehiah/900846
void dnsctxt_init(struct dnsctxt *ctxt, uint32_t local_net, uint8_t local_bits) {
ctxt->source_table = NULL;
ctxt->dest_table = NULL;
ctxt->malformed_table = NULL;
ctxt->src_port_table = NULL;
ctxt->query_name2_table = NULL;
ctxt->query_name3_table = NULL;
ctxt->nxdomain_table = NULL;
ctxt->refused_table = NULL;
ctxt->geo_asn_table = NULL;
ctxt->geo_loc_table = NULL;
ctxt->have_geo_asn = 0;
ctxt->have_geo_loc = 0;
ctxt->local_net = local_net;
ctxt->local_bits = local_bits;
ctxt->seen = 0;
ctxt->incoming = 0;
ctxt->cnt_query = 0;
ctxt->cnt_reply = 0;
ctxt->cnt_status_noerror = 0;
ctxt->cnt_status_srvfail = 0;
ctxt->cnt_status_nxdomain = 0;
ctxt->cnt_status_refused = 0;
ctxt->cnt_malformed = 0;
ctxt->cnt_edns = 0;
}
void dnsctxt_free(struct dnsctxt *ctxt) {
struct int32_entry *entry, *tmp_entry;
struct str_entry *sentry, *tmp_sentry;
// XXX make this a macro
HASH_ITER(hh, ctxt->source_table, entry, tmp_entry) {
HASH_DELETE(hh, ctxt->source_table, entry);
free(entry);
}
HASH_ITER(hh, ctxt->dest_table, entry, tmp_entry) {
HASH_DELETE(hh, ctxt->dest_table, entry);
free(entry);
}
HASH_ITER(hh, ctxt->malformed_table, entry, tmp_entry) {
HASH_DELETE(hh, ctxt->malformed_table, entry);
free(entry);
}
HASH_ITER(hh, ctxt->src_port_table, entry, tmp_entry) {
HASH_DELETE(hh, ctxt->src_port_table, entry);
free(entry);
}
HASH_ITER(hh, ctxt->query_name2_table, sentry, tmp_sentry) {
HASH_DELETE(hh, ctxt->query_name2_table, sentry);
free(sentry);
}
HASH_ITER(hh, ctxt->query_name3_table, sentry, tmp_sentry) {
HASH_DELETE(hh, ctxt->query_name3_table, sentry);
free(sentry);
}
HASH_ITER(hh, ctxt->nxdomain_table, sentry, tmp_sentry) {
HASH_DELETE(hh, ctxt->nxdomain_table, sentry);
free(sentry);
}
HASH_ITER(hh, ctxt->refused_table, sentry, tmp_sentry) {
HASH_DELETE(hh, ctxt->refused_table, sentry);
free(sentry);
}
HASH_ITER(hh, ctxt->geo_asn_table, sentry, tmp_sentry) {
HASH_DELETE(hh, ctxt->geo_asn_table, sentry);
free(sentry);
}
HASH_ITER(hh, ctxt->geo_loc_table, sentry, tmp_sentry) {
HASH_DELETE(hh, ctxt->geo_loc_table, sentry);
free(sentry);
}
}
int sort_int_by_count(void *a, void *b) {
struct int32_entry *left = (struct int32_entry *)a;
struct int32_entry *right = (struct int32_entry *)b;
if (left->count == right->count)
return 0;
else if (left->count > right->count)
return -1;
else
return 1;
}
// XXX could be macro from int version
int sort_str_by_count(void *a, void *b) {
struct str_entry *left = (struct str_entry *)a;
struct str_entry *right = (struct str_entry *)b;
if (left->count == right->count)
return 0;
else if (left->count > right->count)
return -1;
else
return 1;
}
void _print_table_int(struct int32_entry *table, int size) {
struct int32_entry *entry, *tmp_entry;
unsigned int i = 0;
if (!table)
return;
HASH_SORT(table, sort_int_by_count);
HASH_ITER(hh, table, entry, tmp_entry) {
printf("%u %lu\n", entry->key, entry->count);
if (++i >= size)
break;
}
}
void _print_table_ip(struct int32_entry *table, int size) {
struct int32_entry *entry, *tmp_entry;
char ip[INET_ADDRSTRLEN];
unsigned int i = 0;
if (!table)
return;
HASH_SORT(table, sort_int_by_count);
HASH_ITER(hh, table, entry, tmp_entry) {
inet_ntop(AF_INET, &entry->key, ip, sizeof(ip));
printf("%16s %lu\n", ip, entry->count);
if (++i >= size)
break;
}
}
void _print_table_str(struct str_entry *table, int size) {
struct str_entry *entry, *tmp_entry;
unsigned int i = 0;
if (!table)
return;
HASH_SORT(table, sort_str_by_count);
HASH_ITER(hh, table, entry, tmp_entry) {
printf("%20s %lu\n", entry->key, entry->count);
if (++i >= size)
break;
}
}
void dnsctxt_table_summary(struct dnsctxt *ctxt, int size) {
printf("\nIncoming Sources IPs\n");
_print_table_ip(ctxt->source_table, size);
printf("\nIncoming Query Types\n");
_print_table_str(ctxt->qtype_table, size);
printf("\nIncoming Source Ports\n");
_print_table_int(ctxt->src_port_table, size);
printf("\nOutgoing Destinations IPs\n");
_print_table_ip(ctxt->dest_table, size);
printf("\nMalformed DNS Incoming Source IPs\n");
_print_table_ip(ctxt->malformed_table, size);
printf("\nQueried Names (2)\n");
_print_table_str(ctxt->query_name2_table, size);
printf("\nQueried Names (3)\n");
_print_table_str(ctxt->query_name3_table, size);
printf("\nNXDOMAIN Names\n");
_print_table_str(ctxt->nxdomain_table, size);
printf("\nREFUSED Names\n");
_print_table_str(ctxt->refused_table, size);
printf("\nGEO ASN\n");
_print_table_str(ctxt->geo_asn_table, size);
printf("\nGEO Location\n");
_print_table_str(ctxt->geo_loc_table, size);
}
struct int32_entry *lru_get_int(struct int32_entry **table, uint32_t key)
{
struct int32_entry *entry;
if (!*table)
return NULL;
HASH_FIND(hh, *table, &key, sizeof(uint32_t), entry);
if (entry) {
// remove it (so the subsequent add will throw it on the front of the list)
HASH_DELETE(hh, *table, entry);
HASH_ADD(hh, *table, key, sizeof(uint32_t), entry);
return entry;
}
return NULL;
}
void lru_add_int(struct int32_entry **table, uint32_t key)
{
struct int32_entry *entry, *tmp_entry;
entry = malloc(sizeof(struct int32_entry));
entry->key = key;
entry->count = 1;
HASH_ADD(hh, *table, key, sizeof(uint32_t), entry);
// prune the cache
if (HASH_COUNT(*table) >= MAX_LRU_SIZE) {
HASH_ITER(hh, *table, entry, tmp_entry) {
// prune the first entry (loop is based on insertion order so this deletes the oldest item)
HASH_DELETE(hh, *table, entry);
free(entry);
break;
}
}
}
struct str_entry *lru_get_str(struct str_entry **table, char *key)
{
struct str_entry *entry;
if (!*table)
return NULL;
HASH_FIND_STR(*table, key, entry);
if (entry) {
// remove it (so the subsequent add will throw it on the front of the list)
HASH_DELETE(hh, *table, entry);
HASH_ADD_STR(*table, key, entry);
return entry;
}
return NULL;
}
void lru_add_str(struct str_entry **table, char *key)
{
struct str_entry *entry, *tmp_entry;
entry = malloc(sizeof(struct str_entry));
strncpy(entry->key, key, MAX_DNAME_LEN);
entry->count = 1;
HASH_ADD_STR(*table, key, entry);
// prune the cache
if (HASH_COUNT(*table) >= MAX_LRU_SIZE) {
HASH_ITER(hh, *table, entry, tmp_entry) {
// prune the first entry (loop is based on insertion order so this deletes the oldest item)
HASH_DELETE(hh, *table, entry);
free(entry);
break;
}
}
}
void dnsctxt_count_ip(struct int32_entry **table, uint32_t key) {
struct int32_entry *entry = lru_get_int(table, key);
if (entry) {
entry->count++;
return;
}
lru_add_int(table, key);
}
void dnsctxt_count_name(struct str_entry **table, char *name) {
struct str_entry *entry = lru_get_str(table, name);
if (entry) {
entry->count++;
return;
}
lru_add_str(table, name);
}