Searched refs:rbtree (Results 1 - 23 of 23) sorted by relevance

/freebsd-10-stable/contrib/ldns/ldns/
H A Drbtree.h2 * 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 Dldns.h123 #include <ldns/rbtree.h>
H A Ddnssec_zone.h11 #include <ldns/rbtree.h>
397 * Frees the given zone structure, and its rbtree of dnssec_names
404 * Frees the given zone structure, and its rbtree of dnssec_names
424 * Prints the rbtree of ldns_dnssec_name structures to the file descriptor
433 * Prints the rbtree of ldns_dnssec_name structures to the file descriptor
/freebsd-10-stable/contrib/unbound/util/
H A Drbtree.h2 * 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 Drbtree.c2 * 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-stable/contrib/jemalloc/include/jemalloc/internal/
H A Drb.h164 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-stable/contrib/ldns/
H A Drbtree.c2 * 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-stable/lib/libldns/
H A DMakefile15 keys.c net.c packet.c parse.c radix.c rbtree.c rdata.c resolver.c \
/freebsd-10-stable/lib/libunbound/
H A DMakefile23 parseutil.c random.c rbtree.c reallocarray.c regional.c rrdef.c \
/freebsd-10-stable/contrib/unbound/
H A DMakefile.in107 util/netevent.c util/net_help.c util/random.c util/rbtree.c util/regional.c \
121 random.lo rbtree.lo regional.lo rtt.lo dnstree.lo lookup3.lo lruhash.lo \
388 $(srcdir)/util/rbtree.h $(srcdir)/services/modstack.h
607 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree.h $(srcdir)/util/rtt.h $(srcdir)/util/storage/slabhash.h \
643 $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_fwd.h $(srcdir)/iterator/iter_donotq.h \
655 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree.h $(srcdir)/util/regional.h $(srcdir)/util/log.h \
658 $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_delegpt.h $(srcdir)/util/log.h $(srcdir)/util/config_file.h \
662 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_delegpt.h $(srcdir)/util/log.h \
667 $(srcdir)/util/rbtree.h $(srcdir)/util/regional.h $(srcdir)/util/log.h $(srcdir)/util/config_file.h \
680 $(srcdir)/iterator/iter_priv.h $(srcdir)/util/rbtree
[all...]
/freebsd-10-stable/contrib/libarchive/libarchive/
H A Darchive_write_set_format_mtree.c74 struct archive_rb_tree rbtree; member in struct:dir_info
831 __archive_rb_tree_init(&me->dir_info->rbtree, &rb_ops);
1106 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) {
1132 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) {
1959 &(parent->dir_info->rbtree), child_name);
2033 &(mtree->cur_dirent->dir_info->rbtree),
2037 &(mtree->cur_dirent->dir_info->rbtree),
2109 &(dent->dir_info->rbtree),
2152 &(dent->dir_info->rbtree),
2155 &(dent->dir_info->rbtree), fil
[all...]
H A Darchive_read_support_format_mtree.c115 struct archive_rb_tree rbtree; member in struct:mtree
265 __archive_rb_tree_init(&mtree->rbtree, &rb_ops);
975 if (!__archive_rb_tree_insert_node(&mtree->rbtree, &entry->rbnode)) {
978 &mtree->rbtree, entry->name);
1188 &mtree->rbtree, mentry->name);
H A Darchive_write_set_format_xar.c185 struct archive_rb_tree rbtree; member in struct:file
1969 __archive_rb_tree_init(&(file->rbtree), &rb_ops);
2027 &(parent->rbtree), (struct archive_rb_node *)child))
2045 &(parent->rbtree), child_name);
2287 &(xar->cur_dirent->rbtree),
2398 &(dent->rbtree), file->basename.s);
H A Darchive_write_set_format_iso9660.c226 struct archive_rb_tree rbtree; member in struct:isoent
883 struct archive_rb_tree rbtree; member in struct:idr
5120 __archive_rb_tree_init(&(isoent->rbtree), &rb_ops);
5242 &(parent->rbtree), (struct archive_rb_node *)child))
5267 &(parent->rbtree), (struct archive_rb_node *)child))
5309 __archive_rb_tree_remove_node(&(parent->rbtree),
5581 &(iso9660->cur_dirent->rbtree),
5691 &(dent->rbtree), isoent->file->basename.s);
5737 &(isoent->rbtree), child_name);
5863 __archive_rb_tree_init(&(idr->rbtree), rbt_op
[all...]
H A Darchive_write_set_format_7zip.c215 struct archive_rb_tree rbtree;/* for empty files */ member in struct:_7zip
308 __archive_rb_tree_init(&(zip->rbtree), &rb_ops);
448 if (!__archive_rb_tree_insert_node(&(zip->rbtree),
748 ARCHIVE_RB_TREE_FOREACH(n, &(zip->rbtree)) {
/freebsd-10-stable/sys/ofed/drivers/infiniband/hw/mlx4/
H A Dmlx4_ib.h50 #include <linux/rbtree.h>
/freebsd-10-stable/sys/dev/mlx5/
H A Ddriver.h35 #include <linux/rbtree.h>
/freebsd-10-stable/sys/ofed/drivers/infiniband/core/
H A Dlocal_sa.c36 #include <linux/rbtree.h>
H A Diwcm.c45 #include <linux/rbtree.h>
H A Dcm.c43 #include <linux/rbtree.h>
/freebsd-10-stable/sys/ofed/include/linux/
H A Dlinux_compat.c74 #include <linux/rbtree.h>
/freebsd-10-stable/sys/ofed/drivers/net/mlx4/
H A Dmlx4.h42 #include <linux/rbtree.h>
/freebsd-10-stable/sys/ofed/include/rdma/
H A Dib_verbs.h53 #include <linux/rbtree.h>

Completed in 199 milliseconds