| /freebsd-11.0-release/contrib/unbound/util/ |
| H A D | rbtree.h | 74 typedef struct rbtree_t rbtree_t; typedef in typeref:struct:rbtree_t
76 struct rbtree_t { struct
95 rbtree_t *rbtree_create(int (*cmpf)(const void *, const void *));
102 void rbtree_init(rbtree_t *rbtree, int (*cmpf)(const void *, const void *));
110 rbnode_t *rbtree_insert(rbtree_t *rbtree, rbnode_t *data);
119 rbnode_t *rbtree_delete(rbtree_t *rbtree, const void *key);
127 rbnode_t *rbtree_search(rbtree_t *rbtree, const void *key);
138 int rbtree_find_less_equal(rbtree_t *rbtree, const void *key,
146 rbnode_t *rbtree_first(rbtree_t *rbtre
[all...] |
| H A D | rbtree.c | 62 static void rbtree_rotate_left(rbtree_t *rbtree, rbnode_t *node);
64 static void rbtree_rotate_right(rbtree_t *rbtree, rbnode_t *node);
66 static void rbtree_insert_fixup(rbtree_t *rbtree, rbnode_t *node);
68 static void rbtree_delete_fixup(rbtree_t* rbtree, rbnode_t* child, rbnode_t* child_parent);
76 rbtree_t *
79 rbtree_t *rbtree;
82 rbtree = (rbtree_t *) malloc(sizeof(rbtree_t));
94 rbtree_init(rbtree_t *rbtree, int (*cmpf)(const void *, const void *))
107 rbtree_rotate_left(rbtree_t *rbtre
[all...] |
| H A D | mini_event.h | 99 rbtree_t* times;
|
| H A D | winsock_event.h | 135 rbtree_t* times;
|
| /freebsd-11.0-release/contrib/unbound/util/storage/ |
| H A D | dnstree.h | 52 * The tree itself is a rbtree_t.
74 * The tree itself is a rbtree_t.
94 void name_tree_init(rbtree_t* tree);
108 int name_tree_insert(rbtree_t* tree, struct name_tree_node* node,
116 void name_tree_init_parents(rbtree_t* tree);
127 struct name_tree_node* name_tree_find(rbtree_t* tree, uint8_t* name,
139 struct name_tree_node* name_tree_lookup(rbtree_t* tree, uint8_t* name,
148 int name_tree_next_root(rbtree_t* tree, uint16_t* dclass);
154 void addr_tree_init(rbtree_t* tree);
166 int addr_tree_insert(rbtree_t* tre
[all...] |
| H A D | dnstree.c | 74 void name_tree_init(rbtree_t* tree)
79 void addr_tree_init(rbtree_t* tree)
84 int name_tree_insert(rbtree_t* tree, struct name_tree_node* node,
96 int addr_tree_insert(rbtree_t* tree, struct addr_tree_node* node,
107 void addr_tree_init_parents(rbtree_t* tree)
133 void name_tree_init_parents(rbtree_t* tree)
159 struct name_tree_node* name_tree_find(rbtree_t* tree, uint8_t* name,
171 struct name_tree_node* name_tree_lookup(rbtree_t* tree, uint8_t* name,
203 struct addr_tree_node* addr_tree_lookup(rbtree_t* tree,
235 name_tree_next_root(rbtree_t* tre
[all...] |
| /freebsd-11.0-release/contrib/unbound/iterator/ |
| H A D | iter_priv.h | 63 rbtree_t a;
70 rbtree_t n;
|
| H A D | iter_donotq.h | 61 rbtree_t tree;
|
| H A D | iter_hints.h | 62 rbtree_t tree;
|
| H A D | iterator.h | 54 struct rbtree_t;
101 struct rbtree_t* caps_white;
|
| H A D | iter_fwd.h | 60 rbtree_t* tree;
|
| H A D | iter_utils.c | 111 caps_white_apply_cfg(rbtree_t* ntree, struct config_file* cfg)
|
| /freebsd-11.0-release/contrib/unbound/daemon/ |
| H A D | acl_list.h | 78 rbtree_t tree;
|
| /freebsd-11.0-release/contrib/unbound/validator/ |
| H A D | val_sigcrypt.h | 50 struct rbtree_t;
280 struct rbtree_t** sortree, char** reason);
305 struct rbtree_t** sortree, int* buf_canon, char** reason);
|
| H A D | val_neg.h | 72 rbtree_t tree;
117 rbtree_t tree;
|
| H A D | autotrust.h | 129 rbtree_t probe;
|
| H A D | val_anchor.h | 69 rbtree_t* tree;
|
| H A D | val_nsec3.c | 626 nsec3_hash_name(rbtree_t* table, struct regional* region, sldns_buffer* buf,
733 rbtree_t* ct, uint8_t* nm, size_t nmlen,
826 rbtree_t* ct, uint8_t* nm, size_t nmlen,
872 rbtree_t* ct, struct query_info* qinfo, struct ce_response* ce)
939 rbtree_t* ct, struct query_info* qinfo, int prove_does_not_exist,
1019 rbtree_t* ct, struct query_info* qinfo)
1065 rbtree_t ct;
1089 rbtree_t* ct, struct query_info* qinfo)
1224 rbtree_t ct;
1243 rbtree_t c
[all...] |
| H A D | val_nsec3.h | 274 int nsec3_hash_name(rbtree_t* table, struct regional* region,
|
| H A D | val_sigcrypt.c | 486 rbtree_t* sortree = NULL;
554 rbtree_t* sortree = NULL;
588 struct rbtree_t** sortree, char** reason)
888 rbtree_t* sortree, struct canon_rr* rrs)
1046 struct rbtree_t sortree1, sortree2;
1123 struct rbtree_t** sortree)
1132 *sortree = (struct rbtree_t*)regional_alloc(region,
1133 sizeof(rbtree_t));
1307 struct rbtree_t** sortree, int* buf_canon, char** reason)
|
| /freebsd-11.0-release/contrib/unbound/services/ |
| H A D | mesh.h | 86 rbtree_t run;
88 rbtree_t all;
169 rbtree_t super_set;
172 rbtree_t sub_set;
|
| H A D | localzone.h | 88 rbtree_t ztree;
124 rbtree_t data;
|
| H A D | outside_network.h | 122 rbtree_t* pending;
124 rbtree_t* serviced;
|
| /freebsd-11.0-release/contrib/unbound/libunbound/ |
| H A D | context.h | 132 rbtree_t queries;
|
| /freebsd-11.0-release/contrib/unbound/services/cache/ |
| H A D | infra.h | 115 rbtree_t domain_limits;
|