-
Notifications
You must be signed in to change notification settings - Fork 909
/
ip_tree.c
419 lines (345 loc) · 9.71 KB
/
ip_tree.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
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
/*
* Copyright (C) 2001-2003 FhG Fokus
*
* This file is part of Kamailio, a free SIP server.
*
* Kamailio 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
*
* Kamailio 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include "../../dprint.h"
#include "../../mem/shm_mem.h"
#include "ip_tree.h"
static struct ip_tree* root = 0;
static inline struct ip_node* prv_get_tree_branch(unsigned char b)
{
return root->entries[b].node;
}
/* locks a tree branch */
static inline void prv_lock_tree_branch(unsigned char b)
{
lock_set_get( root->entry_lock_set, root->entries[b].lock_idx);
}
/* unlocks a tree branch */
static inline void prv_unlock_tree_branch(unsigned char b)
{
lock_set_release( root->entry_lock_set, root->entries[b].lock_idx);
}
/* wrapper functions */
struct ip_node* get_tree_branch(unsigned char b)
{
return prv_get_tree_branch(b);
}
void lock_tree_branch(unsigned char b)
{
prv_lock_tree_branch(b);
}
void unlock_tree_branch(unsigned char b)
{
prv_unlock_tree_branch(b);
}
/* size must be a power of 2 */
static gen_lock_set_t* init_lock_set(int *size)
{
gen_lock_set_t *lset;
lset=0; /* kill warnings */
for( ; *size ; *size=((*size)>>1) ) {
LM_INFO("probing %d set size\n", *size);
/* create a lock set */
lset = lock_set_alloc( *size );
if (lset==0) {
LM_INFO("cannot get %d locks\n", *size);
continue;
}
/* init lock set */
if (lock_set_init(lset)==0) {
LM_INFO("cannot init %d locks\n", *size);
lock_set_dealloc( lset );
lset = 0;
continue;
}
/* alloc and init succesfull */
break;
}
if (*size==0) {
LM_ERR("cannot get a lock set\n");
return 0;
}
return lset;
}
/* Builds and Inits a new IP tree */
int init_ip_tree(int maximum_hits)
{
int size;
int i;
/* create the root */
root = (struct ip_tree*)shm_malloc(sizeof(struct ip_tree));
if (root==0) {
LM_ERR("shm malloc failed\n");
goto error;
}
memset( root, 0, sizeof(struct ip_tree));
/* init lock set */
size = MAX_IP_BRANCHES;
root->entry_lock_set = init_lock_set( &size );
if (root->entry_lock_set==0) {
LM_ERR("failed to create locks\n");
goto error;
}
/* assign to each branch a lock */
for(i=0;i<MAX_IP_BRANCHES;i++) {
root->entries[i].node = 0;
root->entries[i].lock_idx = i % size;
}
root->max_hits = maximum_hits;
return 0;
error:
if (root)
shm_free(root);
return -1;
}
unsigned int get_max_hits() { return root != 0 ? root->max_hits : -1; }
/* destroy an ip_node and all nodes under it; the nodes must be first removed
* from any other lists/timers */
static inline void destroy_ip_node(struct ip_node *node)
{
struct ip_node *foo, *bar;
foo = node->kids;
while (foo){
bar = foo;
foo = foo->next;
destroy_ip_node(bar);
}
shm_free(node);
}
/* destroy and free the IP tree */
void destroy_ip_tree(void)
{
int i;
if (root==0)
return;
/* destroy and free the lock set */
if (root->entry_lock_set) {
lock_set_destroy(root->entry_lock_set);
lock_set_dealloc(root->entry_lock_set);
}
/* destroy all the nodes */
for(i=0;i<MAX_IP_BRANCHES;i++)
if (root->entries[i].node)
destroy_ip_node(root->entries[i].node);
shm_free( root );
root = 0;
return;
}
/* builds a new ip_node corresponding to a byte value */
static inline struct ip_node *new_ip_node(unsigned char byte)
{
struct ip_node *new_node;
new_node = (struct ip_node*)shm_malloc(sizeof(struct ip_node));
if (!new_node) {
LM_ERR("no more shm mem\n");
return 0;
}
memset( new_node, 0, sizeof(struct ip_node));
new_node->byte = byte;
return new_node;
}
/* splits from the current node (dad) a new child */
struct ip_node *split_node(struct ip_node* dad, unsigned char byte)
{
struct ip_node *new_node;
/* create a new node */
if ( (new_node=new_ip_node(byte))==0 )
return 0;
/* the child node inherits a part of his father hits */
if (dad->hits[CURR_POS]>=1)
new_node->hits[CURR_POS] = (dad->hits[CURR_POS])-1;
if (dad->leaf_hits[CURR_POS]>=1)
new_node->leaf_hits[PREV_POS] = (dad->leaf_hits[PREV_POS])-1;
/* link the child into father's kids list -> insert it at the beginning,
* is much faster */
if (dad->kids) {
dad->kids->prev = new_node;
new_node->next = dad->kids;
}
dad->kids = new_node;
new_node->branch = dad->branch;
new_node->prev = dad;
return new_node;
}
#define is_hot_non_leaf(_node) \
( (_node)->hits[PREV_POS]>=root->max_hits>>2 ||\
(_node)->hits[CURR_POS]>=root->max_hits>>2 ||\
(((_node)->hits[PREV_POS]+(_node)->hits[CURR_POS])>>1)>=\
root->max_hits>>2 )
#define is_hot_leaf(_node) \
( (_node)->leaf_hits[PREV_POS]>=root->max_hits ||\
(_node)->leaf_hits[CURR_POS]>=root->max_hits ||\
(((_node)->leaf_hits[PREV_POS]+(_node)->leaf_hits[CURR_POS])>>1)>=\
root->max_hits )
#define is_warm_leaf(_node) \
( (_node)->hits[CURR_POS]>=root->max_hits>>2 )
#define MAX_TYPE_VAL(_x) \
(( (1<<(8*sizeof(_x)-1))-1 )|( (1<<(8*sizeof(_x)-1)) ))
int is_node_hot_leaf(struct ip_node *node)
{
return is_hot_leaf(node);
}
/*! \brief Used by the rpc function */
char *node_status_array[] = {"", "WARM", "HOT", "ALL"};
node_status_t node_status(struct ip_node *node)
{
if ( is_hot_leaf(node) )
return NODE_STATUS_HOT;
if ( is_warm_leaf(node) )
return NODE_STATUS_WARM;
return NODE_STATUS_OK;
}
/* mark with one more hit the given IP address - */
struct ip_node* mark_node(unsigned char *ip,int ip_len,
struct ip_node **father,unsigned char *flag)
{
struct ip_node *node;
struct ip_node *kid;
int byte_pos;
kid = root->entries[ ip[0] ].node;
node = 0;
byte_pos = 0;
LM_DBG("search on branch %d (top=%p)\n", ip[0],kid);
/* search into the ip tree the longest prefix matching the given IP */
while (kid && byte_pos<ip_len) {
while (kid && kid->byte!=(unsigned char)ip[byte_pos]) {
kid = kid->next;
}
if (kid) {
node = kid;
kid = kid->kids;
byte_pos++;
}
}
LM_DBG("only first %d were matched!\n",byte_pos);
*flag = 0;
*father = 0;
/* what have we found? */
if (byte_pos==ip_len) {
/* we found the entire address */
node->flags |= NODE_IPLEAF_FLAG;
/* increment it, but be careful not to overflow the value */
if(node->leaf_hits[CURR_POS]<MAX_TYPE_VAL(node->leaf_hits[CURR_POS])-1)
node->leaf_hits[CURR_POS]++;
/* becoming red node? */
if ( (node->flags&NODE_ISRED_FLAG)==0 ) {
if (is_hot_leaf(node) ) {
*flag |= RED_NODE|NEWRED_NODE;
node->flags |= NODE_ISRED_FLAG;
}
} else {
*flag |= RED_NODE;
}
} else if (byte_pos==0) {
/* we hit an empty branch in the IP tree */
assert(node==0);
/* add a new node containing the start byte of the IP address */
if ( (node=new_ip_node(ip[0]))==0)
return 0;
node->hits[CURR_POS] = 1;
node->branch = ip[0];
*flag = NEW_NODE ;
/* set this node as root of the branch starting with first byte of IP*/
root->entries[ ip[0] ].node = node;
} else{
/* only a non-empty prefix of the IP was found */
if ( node->hits[CURR_POS]<MAX_TYPE_VAL(node->hits[CURR_POS])-1 )
node->hits[CURR_POS]++;
if ( is_hot_non_leaf(node) ) {
/* we have to split the node */
*flag = NEW_NODE ;
LM_DBG("splitting node %p [%d]\n",node,node->byte);
*father = node;
node = split_node(node,ip[byte_pos]);
} else {
/* to reduce memory usage, force to expire non-leaf nodes if they
* have just a few hits -> basically, don't update the timer for
* them the nr of hits is small */
if ( !is_warm_leaf(node) )
*flag = NO_UPDATE;
}
}
return node;
}
/* remove and destroy a IP node along with its subtree */
void remove_node(struct ip_node *node)
{
LM_DBG("destroying node %p\n",node);
/* is it a branch root node? (these nodes have no prev (father)) */
if (node->prev==0) {
assert(root->entries[node->byte].node==node);
root->entries[node->byte].node = 0;
} else {
/* unlink it from kids list */
if (node->prev->kids==node)
/* it's the head of the list! */
node->prev->kids = node->next;
else
/* it's somewhere in the list */
node->prev->next = node->next;
if (node->next)
node->next->prev = node->prev;
}
/* destroy the node */
node->next = node->prev = 0;
destroy_ip_node(node);
}
static void print_node(struct ip_node *node,int sp, FILE *f)
{
struct ip_node *foo;
/* print current node */
if (!f) {
DBG("[l%d] node %p; brh=%d byte=%d flags=%d, hits={%d,%d} , "
"leaf_hits={%d,%d]\n",
sp, node, node->branch, node->byte, node->flags,
node->hits[PREV_POS],node->hits[CURR_POS],
node->leaf_hits[PREV_POS],node->leaf_hits[CURR_POS]);
} else {
fprintf(f,"[l%d] node %p; brh=%d byte=%d flags=%d, hits={%d,%d} , "
"leaf_hits={%d,%d]\n",
sp, node, node->branch, node->byte, node->flags,
node->hits[PREV_POS],node->hits[CURR_POS],
node->leaf_hits[PREV_POS],node->leaf_hits[CURR_POS]);
}
/* print all the kids */
foo = node->kids;
while(foo){
print_node(foo,sp+1,f);
foo = foo->next;
}
}
void print_tree( FILE *f )
{
int i;
DBG("DEBUG:pike:print_tree: printing IP tree\n");
for(i=0;i<MAX_IP_BRANCHES;i++) {
if (prv_get_tree_branch(i)==0)
continue;
prv_lock_tree_branch(i);
if (prv_get_tree_branch(i))
print_node( prv_get_tree_branch(i), 0, f);
prv_unlock_tree_branch(i);
}
}