/freebsd-10.0-release/contrib/ldns/ldns/ |
H A D | rbtree.h | 2 * rbtree.h -- generic red-black tree 52 * the rbtree. This allows easy casting between an rbnode_t and the 61 /** parent in rbtree, RBTREE_NULL for root */ 106 * @param rbtree The tree to free 108 void ldns_rbtree_free(ldns_rbtree_t *rbtree); 112 * @param rbtree: uninitialised memory for new tree, returned empty. 115 void ldns_rbtree_init(ldns_rbtree_t *rbtree, int (*cmpf)(const void *, const void *)); 119 * @param rbtree: tree to insert to. 123 ldns_rbnode_t *ldns_rbtree_insert(ldns_rbtree_t *rbtree, ldns_rbnode_t *data); 128 * \param[out] rbtree tre [all...] |
H A D | ldns.h | 122 #include <ldns/rbtree.h>
|
H A D | dnssec_zone.h | 11 #include <ldns/rbtree.h> 389 * Frees the given zone structure, and its rbtree of dnssec_names 396 * Frees the given zone structure, and its rbtree of dnssec_names 416 * Prints the rbtree of ldns_dnssec_name structures to the file descriptor 425 * Prints the rbtree of ldns_dnssec_name structures to the file descriptor
|
/freebsd-10.0-release/contrib/unbound/util/ |
H A D | rbtree.h | 2 * rbtree.h -- generic red-black tree 48 * the rbtree. This allows easy casting between an rbnode_t and the 56 /** parent in rbtree, RBTREE_NULL for root */ 99 * @param rbtree: uninitialised memory for new tree, returned empty. 102 void rbtree_init(rbtree_t *rbtree, int (*cmpf)(const void *, const void *)); 106 * @param rbtree: tree to insert to. 110 rbnode_t *rbtree_insert(rbtree_t *rbtree, rbnode_t *data); 114 * @param rbtree: tree to delete from. 119 rbnode_t *rbtree_delete(rbtree_t *rbtree, const void *key); 123 * @param rbtree [all...] |
H A D | rbtree.c | 2 * rbtree.c -- generic red black tree 45 #include "util/rbtree.h" 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); 79 rbtree_t *rbtree; local 82 rbtree = (rbtree_t *) malloc(sizeof(rbtree_t)); 83 if (!rbtree) { 88 rbtree_init(rbtree, cmp 94 rbtree_init(rbtree_t *rbtree, int (*cmpf)(const void *, const void *)) argument 107 rbtree_rotate_left(rbtree_t *rbtree, rbnode_t *node) argument 134 rbtree_rotate_right(rbtree_t *rbtree, rbnode_t *node) argument 157 rbtree_insert_fixup(rbtree_t *rbtree, rbnode_t *node) argument 227 rbtree_insert(rbtree_t *rbtree, rbnode_t *data) argument 280 rbtree_search(rbtree_t *rbtree, const void *key) argument 304 change_parent_ptr(rbtree_t* rbtree, rbnode_t* parent, rbnode_t* old, rbnode_t* new) argument 326 rbtree_delete(rbtree_t *rbtree, const void *key) argument 403 rbtree_delete_fixup(rbtree_t* rbtree, rbnode_t* child, rbnode_t* child_parent) argument 507 rbtree_find_less_equal(rbtree_t *rbtree, const void *key, rbnode_t **result) argument 544 rbtree_first(rbtree_t *rbtree) argument 553 rbtree_last(rbtree_t *rbtree) argument [all...] |
/freebsd-10.0-release/contrib/jemalloc/include/jemalloc/internal/ |
H A D | rb.h | 164 a_prefix##new(a_rbt_type *rbtree); \ 166 a_prefix##first(a_rbt_type *rbtree); \ 168 a_prefix##last(a_rbt_type *rbtree); \ 170 a_prefix##next(a_rbt_type *rbtree, a_type *node); \ 172 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \ 174 a_prefix##search(a_rbt_type *rbtree, a_type *key); \ 176 a_prefix##nsearch(a_rbt_type *rbtree, a_type *key); \ 178 a_prefix##psearch(a_rbt_type *rbtree, a_type *key); \ 180 a_prefix##insert(a_rbt_type *rbtree, a_type *node); \ 182 a_prefix##remove(a_rbt_type *rbtree, a_typ [all...] |
/freebsd-10.0-release/contrib/ldns/ |
H A D | rbtree.c | 2 * rbtree.c -- generic red black tree 45 #include <ldns/rbtree.h> 65 static void ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node); 67 static void ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node); 69 static void ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node); 71 static void ldns_rbtree_delete_fixup(ldns_rbtree_t* rbtree, ldns_rbnode_t* child, ldns_rbnode_t* child_parent); 82 ldns_rbtree_t *rbtree; local 85 rbtree = (ldns_rbtree_t *) LDNS_MALLOC(ldns_rbtree_t); 86 if (!rbtree) { 91 ldns_rbtree_init(rbtree, cmp 97 ldns_rbtree_init(ldns_rbtree_t *rbtree, int (*cmpf)(const void *, const void *)) argument 106 ldns_rbtree_free(ldns_rbtree_t *rbtree) argument 116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) argument 143 ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) argument 166 ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) argument 229 ldns_rbtree_insert_vref(ldns_rbnode_t *data, void *rbtree) argument 242 ldns_rbtree_insert(ldns_rbtree_t *rbtree, ldns_rbnode_t *data) argument 294 ldns_rbtree_search(ldns_rbtree_t *rbtree, const void *key) argument 318 change_parent_ptr(ldns_rbtree_t* rbtree, ldns_rbnode_t* parent, ldns_rbnode_t* old, ldns_rbnode_t* new) argument 336 ldns_rbtree_delete(ldns_rbtree_t *rbtree, const void *key) argument 413 ldns_rbtree_delete_fixup(ldns_rbtree_t* rbtree, ldns_rbnode_t* child, ldns_rbnode_t* child_parent) argument 514 ldns_rbtree_find_less_equal(ldns_rbtree_t *rbtree, const void *key, ldns_rbnode_t **result) argument 548 ldns_rbtree_first(ldns_rbtree_t *rbtree) argument 559 ldns_rbtree_last(ldns_rbtree_t *rbtree) argument [all...] |
/freebsd-10.0-release/lib/libldns/ |
H A D | Makefile | 15 keys.c net.c packet.c parse.c rbtree.c rdata.c resolver.c rr.c \
|
/freebsd-10.0-release/lib/libunbound/ |
H A D | Makefile | 22 outside_network.c packed_rrset.c random.c rbtree.c regional.c \
|
/freebsd-10.0-release/contrib/libarchive/libarchive/ |
H A D | archive_write_set_format_mtree.c | 73 struct archive_rb_tree rbtree; member in struct:dir_info 838 __archive_rb_tree_init(&me->dir_info->rbtree, &rb_ops); 1104 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) { 1130 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) { 1948 &(parent->dir_info->rbtree), child_name); 2022 &(mtree->cur_dirent->dir_info->rbtree), 2026 &(mtree->cur_dirent->dir_info->rbtree), 2098 &(dent->dir_info->rbtree), 2141 &(dent->dir_info->rbtree), 2144 &(dent->dir_info->rbtree), fil [all...] |
H A D | archive_write_set_format_xar.c | 185 struct archive_rb_tree rbtree; member in struct:file 1907 __archive_rb_tree_init(&(file->rbtree), &rb_ops); 1964 &(parent->rbtree), (struct archive_rb_node *)child)) 1982 &(parent->rbtree), child_name); 2224 &(xar->cur_dirent->rbtree), 2335 &(dent->rbtree), file->basename.s);
|
H A D | archive_write_set_format_iso9660.c | 226 struct archive_rb_tree rbtree; member in struct:isoent 883 struct archive_rb_tree rbtree; member in struct:idr 5107 __archive_rb_tree_init(&(isoent->rbtree), &rb_ops); 5229 &(parent->rbtree), (struct archive_rb_node *)child)) 5254 &(parent->rbtree), (struct archive_rb_node *)child)) 5296 __archive_rb_tree_remove_node(&(parent->rbtree), 5568 &(iso9660->cur_dirent->rbtree), 5678 &(dent->rbtree), isoent->file->basename.s); 5724 &(isoent->rbtree), child_name); 5850 __archive_rb_tree_init(&(idr->rbtree), rbt_op [all...] |
H A D | archive_write_set_format_7zip.c | 214 struct archive_rb_tree rbtree;/* for empty files */ member in struct:_7zip 307 __archive_rb_tree_init(&(zip->rbtree), &rb_ops); 446 if (!__archive_rb_tree_insert_node(&(zip->rbtree), 746 ARCHIVE_RB_TREE_FOREACH(n, &(zip->rbtree)) {
|
/freebsd-10.0-release/sys/ofed/drivers/infiniband/hw/mlx4/ |
H A D | mlx4_ib.h | 49 #include <linux/rbtree.h>
|
/freebsd-10.0-release/sys/ofed/include/linux/ |
H A D | linux_compat.c | 63 #include <linux/rbtree.h>
|
/freebsd-10.0-release/sys/ofed/drivers/infiniband/core/ |
H A D | iwcm.c | 42 #include <linux/rbtree.h>
|
H A D | local_sa.c | 36 #include <linux/rbtree.h>
|
H A D | cm.c | 43 #include <linux/rbtree.h>
|
/freebsd-10.0-release/sys/ofed/drivers/net/mlx4/ |
H A D | mlx4.h | 42 #include <linux/rbtree.h>
|
/freebsd-10.0-release/sys/ofed/include/rdma/ |
H A D | ib_verbs.h | 54 #include <linux/rbtree.h>
|