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
|
#ifndef RADIX_H
#define RADIX_H
#include "config.h"
#include "mem_pool.h"
#include "util.h"
#define RADIX_NO_VALUE (uintptr_t)-1
typedef struct radix_tree_compressed radix_compressed_t;
#ifdef LEGACY_RADIX
typedef struct radix_node_s radix_node_t;
typedef struct radix_tree_s radix_tree_t;
enum radix_insert_type {
RADIX_INSERT,
RADIX_ADD,
RADIX_REPLACE
};
typedef gboolean (*radix_tree_traverse_func)(guint32 key, guint32 mask,
uintptr_t value, void *user_data);
/**
* Create new radix tree
*/
radix_tree_t * radix_tree_create (void);
/**
* Insert value to radix tree
* returns: 1 if value already exists
* 0 if operation was successfull
* -1 if there was some error
*/
gint radix32tree_insert (radix_tree_t *tree,
guint32 key,
guint32 mask,
uintptr_t value);
/**
* Add value to radix tree or insert it if value does not exists
* returns: value if value already exists and was added
* 0 if value was inserted
* -1 if there was some error
*/
uintptr_t radix32tree_add (radix_tree_t *tree,
guint32 key,
guint32 mask,
uintptr_t value);
/**
* Replace value in radix tree or insert it if value does not exists
* returns: 1 if value already exists and was replaced
* 0 if value was inserted
* -1 if there was some error
*/
gint radix32tree_replace (radix_tree_t *tree,
guint32 key,
guint32 mask,
uintptr_t value);
/**
* Delete value from radix tree
* returns: 1 if value does not exist
* 0 if value was deleted
* -1 if there was some error
*/
gint radix32tree_delete (radix_tree_t *tree, guint32 key, guint32 mask);
/**
* Find value in radix tree
* returns: value if value was found
* RADIX_NO_VALUE if value was not found
*/
uintptr_t radix32tree_find (radix_tree_t *tree, guint32 key);
/**
* Find specified address in tree (works only for ipv4 addresses)
* @param tree
* @param addr
* @return
*/
uintptr_t radix32_tree_find_addr (radix_tree_t *tree, rspamd_inet_addr_t *addr);
/**
* Traverse via the whole tree calling specified callback
*/
void radix32tree_traverse (radix_tree_t *tree,
radix_tree_traverse_func func,
void *user_data);
/**
* Frees radix tree
*/
void radix_tree_free (radix_tree_t *tree);
#endif
uintptr_t
radix_insert_compressed (radix_compressed_t * tree,
guint8 *key, gsize keylen,
gsize masklen,
uintptr_t value);
uintptr_t radix_find_compressed (radix_compressed_t * tree, guint8 *key,
gsize keylen);
/**
* Find specified address in tree (works for any address)
* @param tree
* @param addr
* @return
*/
uintptr_t radix_find_compressed_addr (radix_compressed_t *tree,
rspamd_inet_addr_t *addr);
void radix_destroy_compressed (radix_compressed_t *tree);
radix_compressed_t *radix_create_compressed (void);
/**
* Insert list of ip addresses and masks to the radix tree
* @param list string line of addresses
* @param separators string of characters used as separators
* @param tree target tree
* @return number of elements inserted
*/
gint rspamd_radix_add_iplist (const gchar *list, const gchar *separators,
radix_compressed_t *tree);
/**
* Generic version of @see rspamd_radix_add_iplist. This function creates tree
* if `tree` is NULL.
*/
gboolean radix_add_generic_iplist (const gchar *ip_list,
radix_compressed_t **tree);
#endif
|
