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
|
/*
* Copyright 2025 Vsevolod Stakhov
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef RADIX_H
#define RADIX_H
#include "config.h"
#include "mem_pool.h"
#include "util.h"
#define RADIX_NO_VALUE (uintptr_t) -1
#ifdef __cplusplus
extern "C" {
#endif
typedef struct radix_tree_compressed radix_compressed_t;
/**
* Insert new key to the radix trie
* @param tree radix trie
* @param key key to insert (bitstring)
* @param keylen length of the key (in bytes)
* @param masklen length of mask that should be applied to the key (in bits)
* @param value opaque value pointer
* @return previous value of the key or `RADIX_NO_VALUE`
*/
uintptr_t
radix_insert_compressed(radix_compressed_t *tree,
const uint8_t *key, gsize keylen,
gsize masklen,
uintptr_t value);
/**
* Insert new address to the radix trie (works for IPv4 or IPv6 addresses)
* @param tree radix trie
* @param addr address to insert
* @param value opaque value pointer
* @return previous value of the key or `RADIX_NO_VALUE`
*/
uintptr_t
radix_insert_compressed_addr(radix_compressed_t *tree,
const rspamd_inet_addr_t *addr,
uintptr_t value);
/**
* Find a key in a radix trie
* @param tree radix trie
* @param key key to find (bitstring)
* @param keylen length of a key
* @return opaque pointer or `RADIX_NO_VALUE` if no value has been found
*/
uintptr_t radix_find_compressed(radix_compressed_t *tree, const uint8_t *key,
gsize keylen);
/**
* Find specified address in tree (works for IPv4 or IPv6 addresses)
* @param tree
* @param addr
* @return
*/
uintptr_t radix_find_compressed_addr(radix_compressed_t *tree,
const rspamd_inet_addr_t *addr);
/**
* Destroy the complete radix trie
* @param tree
*/
void radix_destroy_compressed(radix_compressed_t *tree);
/**
* Create new radix trie
* @return
*/
radix_compressed_t *radix_create_compressed(const char *tree_name);
radix_compressed_t *radix_create_compressed_with_pool(rspamd_mempool_t *pool, const char *tree_name);
/**
* 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
*/
int rspamd_radix_add_iplist(const char *list, const char *separators,
radix_compressed_t *tree, gconstpointer value,
gboolean resolve, const char *tree_name);
/**
* Generic version of @see rspamd_radix_add_iplist. This function creates tree
* if `tree` is NULL.
*/
gboolean
radix_add_generic_iplist(const char *ip_list,
radix_compressed_t **tree,
gboolean resolve,
const char *tree_name);
/**
* Returns number of elements in the tree
* @param tree
* @return
*/
gsize radix_get_size(radix_compressed_t *tree);
/**
* Return string that describes this radix tree (memory, nodes, compression etc)
* @param tree
* @return constant string
*/
const char *radix_get_info(radix_compressed_t *tree);
/**
* Returns memory pool associated with the radix tree
*/
rspamd_mempool_t *radix_get_pool(radix_compressed_t *tree);
#ifdef __cplusplus
}
#endif
#endif
|
