Searched refs:radix (Results 1 - 7 of 7) sorted by relevance

/bind-9.11.3/lib/isc/
H A Dradix.c13 * Id: radix.c,v 1.10.2.1 1999/11/29 05:16:24 masaki Exp
22 #include <isc/radix.h>
38 _clear_radix(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func);
137 isc_radix_tree_t *radix; local
141 radix = isc_mem_get(mctx, sizeof(isc_radix_tree_t));
142 if (radix == NULL)
145 radix->mctx = NULL;
146 isc_mem_attach(mctx, &radix->mctx);
147 radix->maxbits = maxbits;
148 radix
163 _clear_radix(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func) argument
209 isc_radix_destroy(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func) argument
220 isc_radix_process(isc_radix_tree_t *radix, isc_radix_processfunc_t func) argument
232 isc_radix_search(isc_radix_tree_t *radix, isc_radix_node_t **target, isc_prefix_t *prefix) argument
301 isc_radix_insert(isc_radix_tree_t *radix, isc_radix_node_t **target, isc_radix_node_t *source, isc_prefix_t *prefix) argument
613 isc_radix_remove(isc_radix_tree_t *radix, isc_radix_node_t *node) argument
[all...]
/bind-9.11.3/lib/isc/tests/
H A Dradix_test.c13 #include <isc/radix.h>
26 atf_tc_set_md_var(tc, "descr", "test radix seaching");
29 isc_radix_tree_t *radix = NULL; local
41 result = isc_radix_create(mctx, &radix, 32);
49 result = isc_radix_insert(radix, &node, NULL, &prefix);
59 result = isc_radix_insert(radix, &node, NULL, &prefix);
69 result = isc_radix_search(radix, &node, &prefix);
75 isc_radix_destroy(radix, NULL);
/bind-9.11.3/lib/dns/
H A Diptable.c12 #include <isc/radix.h>
20 * Create a new IP table and the underlying radix structure
33 tab->radix = NULL;
36 result = isc_radix_create(mctx, &tab->radix, RADIX_MAXBITS);
72 INSIST(tab->radix);
76 result = isc_radix_insert(tab->radix, &node, NULL, &pfx);
114 RADIX_WALK (source->radix->head, node) {
116 result = isc_radix_insert (tab->radix, &new_node, node, NULL);
140 tab->radix->num_added_node += max_node;
167 if (dtab->radix !
[all...]
H A Dacl.c136 acl->iptable->radix == NULL ||
137 acl->iptable->radix->head == NULL ||
138 acl->iptable->radix->head->prefix == NULL)
144 if (acl->iptable->radix->head->prefix->bitlen == 0 &&
145 acl->iptable->radix->head->data[0] != NULL &&
146 acl->iptable->radix->head->data[0] ==
147 acl->iptable->radix->head->data[1] &&
148 *(isc_boolean_t *) (acl->iptable->radix->head->data[0]) == pos)
174 * For a match with a positive ACL element or iptable radix entry,
176 * element or radix entr
[all...]
/bind-9.11.3/lib/dns/include/dns/
H A Diptable.h16 #include <isc/radix.h>
24 isc_radix_tree_t *radix; member in struct:dns_iptable
40 * Create a new IP table and the underlying radix structure
H A Dacl.h82 #define node_count iptable->radix->num_added_node
/bind-9.11.3/lib/isc/include/isc/
H A Dradix.h11 * Id: radix.h,v 1.6 1999/08/03 03:32:53 masaki Exp
69 * We need "first match" when we search the radix tree to preserve
76 * An IPv4 prefix and an IPv6 prefix may share a radix tree node if they
98 isc_prefix_t *prefix; /* who we are in radix tree */
119 isc_radix_search(isc_radix_tree_t *radix, isc_radix_node_t **target,
122 * Search 'radix' for the best match to 'prefix'.
126 * \li 'radix' to be valid.
136 isc_radix_insert(isc_radix_tree_t *radix, isc_radix_node_t **target,
139 * Insert 'source' or 'prefix' into the radix tree 'radix'
[all...]

Completed in 15 milliseconds