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

1234

/netbsd-current/external/bsd/nsd/dist/
H A Drbtree.h2 * rbtree.h -- generic red-black tree
17 * the rbtree. This allows easy casting between an rbnode_type and the
32 typedef struct rbtree rbtree_type;
33 struct rbtree { struct
49 /* rbtree.c */
51 rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
54 rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);
55 rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
58 int rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result);
59 rbnode_type *rbtree_first(rbtree_type *rbtree);
[all...]
H A Drbtree.c2 * rbtree.c -- generic red black tree
15 #include "rbtree.h"
28 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
29 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
30 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
31 static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent);
42 rbtree_type *rbtree; local
45 rbtree = (rbtree_type *) region_alloc(region, sizeof(rbtree_type));
46 if (!rbtree) {
51 rbtree
64 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) argument
91 rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node) argument
114 rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node) argument
184 rbtree_insert(rbtree_type *rbtree, rbnode_type *data) argument
236 rbtree_search(rbtree_type *rbtree, const void *key) argument
258 change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent, rbnode_type* old, rbnode_type* new) argument
279 rbtree_delete(rbtree_type *rbtree, const void *key) argument
356 rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent) argument
460 rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result) argument
496 rbtree_first(rbtree_type *rbtree) argument
505 rbtree_last(rbtree_type *rbtree) argument
[all...]
H A DMakefile.in82 COMMON_OBJ=answer.o axfr.o ixfr.o ixfrcreate.o buffer.o configlexer.o configparser.o dname.o dns.o edns.o iterated_hash.o lookup3.o namedb.o nsec3.o options.o packet.o query.o rbtree.o radtree.o rdata.o region-allocator.o rrl.o siphash.o tsig.o tsig-openssl.o udb.o util.o bitset.o popen3.o proxy_protocol.o
363 $(srcdir)/util.h $(srcdir)/options.h $(srcdir)/rbtree.h \
370 $(srcdir)/dns.h $(srcdir)/radtree.h $(srcdir)/rbtree.h \
421 $(srcdir)/dname.h $(srcdir)/buffer.h $(srcdir)/region-allocator.h $(srcdir)/util.h $(srcdir)/radtree.h $(srcdir)/rbtree.h $(srcdir)/packet.h \
425 $(srcdir)/radtree.h $(srcdir)/rbtree.h $(srcdir)/packet.h $(srcdir)/tsig.h $(srcdir)/options.h $(srcdir)/ixfr.h
430 $(srcdir)/region-allocator.h $(srcdir)/rbtree.h configparser.h
432 $(srcdir)/region-allocator.h $(srcdir)/rbtree.h $(srcdir)/util.h $(srcdir)/dname.h $(srcdir)/buffer.h $(srcdir)/tsig.h $(srcdir)/rrl.h $(srcdir)/query.h \
435 $(srcdir)/buffer.h $(srcdir)/region-allocator.h $(srcdir)/util.h $(srcdir)/radtree.h $(srcdir)/rbtree.h $(srcdir)/options.h $(srcdir)/rdata.h \
439 $(srcdir)/region-allocator.h $(srcdir)/util.h $(srcdir)/dns.h $(srcdir)/radtree.h $(srcdir)/rbtree.h $(srcdir)/udb.h \
441 difffile.o: $(srcdir)/difffile.c config.h $(srcdir)/compat/cpuset.h $(srcdir)/difffile.h $(srcdir)/rbtree
[all...]
/netbsd-current/external/bsd/unbound/dist/util/
H A Drbtree.h2 * rbtree.h -- generic red-black tree
48 * the rbtree. This allows easy casting between an rbnode_type 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_type *rbtree, int (*cmpf)(const void *, const void *));
106 * @param rbtree: tree to insert to.
110 rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
114 * @param rbtree: tree to delete from.
119 rbnode_type *rbtree_delete(rbtree_type *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_type *rbtree, rbnode_type *node);
64 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
66 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
68 static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
80 rbtree_type *rbtree; local
83 rbtree = (rbtree_type *) malloc(sizeof(rbtree_type));
84 if (!rbtree) {
89 rbtree_init(rbtree, cmp
95 rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *)) argument
108 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) argument
135 rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node) argument
158 rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node) argument
228 rbtree_insert(rbtree_type *rbtree, rbnode_type *data) argument
281 rbtree_search(rbtree_type *rbtree, const void *key) argument
305 change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent, rbnode_type* old, rbnode_type* new) argument
329 rbtree_delete(rbtree_type *rbtree, const void *key) argument
406 rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent) argument
511 rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result) argument
549 rbtree_first(rbtree_type *rbtree) argument
558 rbtree_last(rbtree_type *rbtree) argument
[all...]
/netbsd-current/external/bsd/jemalloc/include/jemalloc/internal/
H A Drb.h169 a_prefix##new(a_rbt_type *rbtree); \
171 a_prefix##empty(a_rbt_type *rbtree); \
173 a_prefix##first(a_rbt_type *rbtree); \
175 a_prefix##last(a_rbt_type *rbtree); \
177 a_prefix##next(a_rbt_type *rbtree, a_type *node); \
179 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
181 a_prefix##search(a_rbt_type *rbtree, const a_type *key); \
183 a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key); \
185 a_prefix##psearch(a_rbt_type *rbtree, const a_type *key); \
187 a_prefix##insert(a_rbt_type *rbtree, a_typ
[all...]
/netbsd-current/external/bsd/jemalloc/dist/include/jemalloc/internal/
H A Drb.h169 a_prefix##new(a_rbt_type *rbtree); \
171 a_prefix##empty(a_rbt_type *rbtree); \
173 a_prefix##first(a_rbt_type *rbtree); \
175 a_prefix##last(a_rbt_type *rbtree); \
177 a_prefix##next(a_rbt_type *rbtree, a_type *node); \
179 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
181 a_prefix##search(a_rbt_type *rbtree, const a_type *key); \
183 a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key); \
185 a_prefix##psearch(a_rbt_type *rbtree, const a_type *key); \
187 a_prefix##insert(a_rbt_type *rbtree, a_typ
[all...]
/netbsd-current/sys/external/bsd/drm2/dist/drm/i915/
H A Di915_priolist_types.h13 #include <linux/rbtree.h>
H A Di915_active_types.h16 #include <linux/rbtree.h>
H A Di915_vma_types.h31 #include <linux/rbtree.h>
/netbsd-current/sys/external/bsd/drm2/include/linux/
H A Dmodule.h42 #include <linux/rbtree.h>
H A Dxarray.h32 #include <sys/rbtree.h>
H A Dww_mutex.h38 #include <sys/rbtree.h>
H A Dinterval_tree.h43 #include <linux/rbtree.h>
H A Didr.h37 #include <sys/rbtree.h>
/netbsd-current/usr.sbin/ldpd/
H A Dlabel.h35 #include <sys/rbtree.h>
/netbsd-current/sys/arch/x86/include/
H A Dpmap_pv.h34 #include <sys/rbtree.h>
/netbsd-current/sys/external/bsd/drm2/dist/drm/i915/gem/
H A Di915_gem_context_types.h18 #include <linux/rbtree.h>
164 * handles_vma: rbtree to look up our context specific obj/vma for
/netbsd-current/sys/external/bsd/drm2/include/drm/
H A Ddrm_encoder_slave.h36 #include <sys/rbtree.h>
H A Ddrm_vma_manager.h37 #include <sys/rbtree.h>
/netbsd-current/external/bsd/nsd/lib/libnsd/
H A DMakefile34 rbtree.c \
/netbsd-current/share/man/man3/
H A DMakefile13 makedev.3 offsetof.3 param.3 paths.3 queue.3 rbtree.3 sigevent.3 \
233 MLINKS+=rbtree.3 rb_tree_init.3 \
234 rbtree.3 rb_tree_insert_node.3 \
235 rbtree.3 rb_tree_find_node.3 \
236 rbtree.3 rb_tree_find_node_geq.3 \
237 rbtree.3 rb_tree_find_node_leq.3 \
238 rbtree.3 rb_tree_iterate.3
/netbsd-current/external/bsd/dhcpcd/dist/src/
H A Droute.h33 #include <sys/rbtree.h>
/netbsd-current/external/bsd/unbound/dist/
H A DMakefile.in130 util/netevent.c util/net_help.c util/random.c util/rbtree.c util/regional.c \
149 random.lo rbtree.lo regional.lo rtt.lo dnstree.lo lookup3.lo lruhash.lo \
478 $(srcdir)/util/rbtree.h $(srcdir)/services/modstack.h
717 $(srcdir)/util/rbtree.h $(srcdir)/util/rtt.h $(srcdir)/util/netevent.h $(srcdir)/dnscrypt/dnscrypt.h \
736 $(srcdir)/sldns/sbuffer.h $(srcdir)/services/localzone.h $(srcdir)/util/rbtree.h \
749 $(srcdir)/util/fptr_wlist.h $(srcdir)/util/tube.h $(srcdir)/services/mesh.h $(srcdir)/util/rbtree.h \
764 $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_fwd.h $(srcdir)/iterator/iter_donotq.h \
779 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree.h $(srcdir)/util/regional.h $(srcdir)/util/log.h \
782 $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_delegpt.h $(srcdir)/util/log.h $(srcdir)/util/config_file.h \
786 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/container/
H A Dutil.d139 import std.container.array, std.container.rbtree, std.container.slist;
159 import std.container.rbtree;

Completed in 160 milliseconds

1234