Home
last modified time | relevance | path

Searched refs:rbtree (Results 1 – 18 of 18) sorted by relevance

/freebsd/contrib/ldns/
H A Drbtree.c65 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* ch…
82 ldns_rbtree_t *rbtree; in ldns_rbtree_create() local
85 rbtree = (ldns_rbtree_t *) LDNS_MALLOC(ldns_rbtree_t); in ldns_rbtree_create()
86 if (!rbtree) { in ldns_rbtree_create()
91 ldns_rbtree_init(rbtree, cmpf); in ldns_rbtree_create()
93 return rbtree; in ldns_rbtree_create()
97 ldns_rbtree_init(ldns_rbtree_t *rbtree, int (*cmpf)(const void *, const void *)) in ldns_rbtree_init() argument
[all …]
H A DMakefile.in92 …r.lo host2str.lo host2wire.lo keys.lo net.lo packet.lo parse.lo radix.lo rbtree.lo rdata.lo resolv…
97 …h higher.h host2str.h host2wire.h keys.h ldns.h packet.h parse.h radix.h rbtree.h rdata.h resolver…
590 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \
598 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \
606 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \
614 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \
623 …$(srcdir)/ldns/rbtree.h $(srcdir)/ldns/host2str.h $(srcdir)/ldns/dnssec_verify.h $(srcdir)/ldns/dn…
631 …$(srcdir)/ldns/rbtree.h $(srcdir)/ldns/host2str.h $(srcdir)/ldns/dnssec_verify.h $(srcdir)/ldns/dn…
639 …$(srcdir)/ldns/rbtree.h $(srcdir)/ldns/host2str.h $(srcdir)/ldns/dnssec_verify.h $(srcdir)/ldns/dn…
647 …$(srcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree…
[all …]
H A DChangelog603 * Fixed comment in rbtree.h about being first member and data ptr.
832 rbtree and links signatures and NSEC(3) records directly to their
/freebsd/contrib/unbound/util/
H A Drbtree.c62 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; in rbtree_create() local
83 rbtree = (rbtree_type *) malloc(sizeof(rbtree_type)); in rbtree_create()
84 if (!rbtree) { in rbtree_create()
89 rbtree_init(rbtree, cmpf); in rbtree_create()
91 return rbtree; in rbtree_create()
95 rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *)) in rbtree_init() argument
[all …]
H A Drbtree.h102 void rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *));
110 rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
119 rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);
127 rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
138 int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
146 rbnode_type *rbtree_first(rbtree_type *rbtree);
153 rbnode_type *rbtree_last(rbtree_type *rbtree);
160 rbnode_type *rbtree_next(rbnode_type *rbtree);
167 rbnode_type *rbtree_previous(rbnode_type *rbtree);
173 #define RBTREE_FOR(node, type, rbtree) \ argument
[all …]
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Drb.h188 a_prefix##new(a_rbt_type *rbtree); \
190 a_prefix##empty(a_rbt_type *rbtree); \
192 a_prefix##first(a_rbt_type *rbtree); \
194 a_prefix##last(a_rbt_type *rbtree); \
196 a_prefix##next(a_rbt_type *rbtree, a_type *node); \
198 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
200 a_prefix##search(a_rbt_type *rbtree, const a_type *key); \
202 a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key); \
204 a_prefix##psearch(a_rbt_type *rbtree, const a_type *key); \
206 a_prefix##insert(a_rbt_type *rbtree, a_typ
[all...]
/freebsd/contrib/ldns/ldns/
H A Drbtree.h108 void ldns_rbtree_free(ldns_rbtree_t *rbtree);
115 void ldns_rbtree_init(ldns_rbtree_t *rbtree, int (*cmpf)(const void *, const void *));
123 ldns_rbnode_t *ldns_rbtree_insert(ldns_rbtree_t *rbtree, ldns_rbnode_t *data);
131 void ldns_rbtree_insert_vref(ldns_rbnode_t *data, void *rbtree);
140 ldns_rbnode_t *ldns_rbtree_delete(ldns_rbtree_t *rbtree, const void *key);
148 ldns_rbnode_t *ldns_rbtree_search(ldns_rbtree_t *rbtree, const void *key);
159 int ldns_rbtree_find_less_equal(ldns_rbtree_t *rbtree, const void *key,
167 ldns_rbnode_t *ldns_rbtree_first(const ldns_rbtree_t *rbtree);
174 ldns_rbnode_t *ldns_rbtree_last(const ldns_rbtree_t *rbtree);
181 ldns_rbnode_t *ldns_rbtree_next(ldns_rbnode_t *rbtree);
[all …]
/freebsd/contrib/unbound/
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 \
486 $(srcdir)/util/rbtree.h $(srcdir)/services/modstack.h
732 $(srcdir)/util/rbtree.h $(srcdir)/util/rtt.h $(srcdir)/util/netevent.h $(srcdir)/dnscrypt/dnscrypt.h \
751 $(srcdir)/sldns/sbuffer.h $(srcdir)/services/localzone.h $(srcdir)/util/rbtree.h \
764 $(srcdir)/util/fptr_wlist.h $(srcdir)/util/tube.h $(srcdir)/services/mesh.h $(srcdir)/util/rbtree.h \
779 $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_fwd.h $(srcdir)/iterator/iter_donotq.h \
794 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree.h $(srcdir)/util/regional.h $(srcdir)/util/log.h \
797 $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_delegpt.h $(srcdir)/util/log.h $(srcdir)/util/config_file.h \
801 $(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree
[all...]
/freebsd/lib/libldns/
H A DMakefile15 host2wire.c keys.c net.c packet.c parse.c radix.c rbtree.c rdata.c \
/freebsd/contrib/libarchive/libarchive/
H A Darchive_write_set_format_mtree.c73 struct archive_rb_tree rbtree; member
831 __archive_rb_tree_init(&me->dir_info->rbtree, &rb_ops); in mtree_entry_new()
1154 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) { in write_mtree_entry_tree()
1180 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) { in write_mtree_entry_tree()
2037 &(parent->dir_info->rbtree), child_name); in mtree_entry_find_child()
2111 &(mtree->cur_dirent->dir_info->rbtree), in mtree_entry_tree_add()
2115 &(mtree->cur_dirent->dir_info->rbtree), in mtree_entry_tree_add()
2187 &(dent->dir_info->rbtree), in mtree_entry_tree_add()
2234 &(dent->dir_info->rbtree), in mtree_entry_tree_add()
2237 &(dent->dir_info->rbtree), file->basename.s); in mtree_entry_tree_add()
H A Darchive_read_support_format_mtree.c114 struct archive_rb_tree rbtree; member
285 __archive_rb_tree_init(&mtree->rbtree, &rb_ops); in archive_read_support_format_mtree()
992 if (!__archive_rb_tree_insert_node(&mtree->rbtree, &entry->rbnode)) { in process_add_entry()
995 &mtree->rbtree, entry->name); in process_add_entry()
1207 &mtree->rbtree, mentry->name); in parse_file()
H A Darchive_write_set_format_iso9660.c226 struct archive_rb_tree rbtree; member
883 struct archive_rb_tree rbtree; member
5121 __archive_rb_tree_init(&(isoent->rbtree), &rb_ops); in isoent_new()
5243 &(parent->rbtree), (struct archive_rb_node *)child)) in isoent_add_child_head()
5268 &(parent->rbtree), (struct archive_rb_node *)child)) in isoent_add_child_tail()
5310 __archive_rb_tree_remove_node(&(parent->rbtree), in isoent_remove_child()
5582 &(iso9660->cur_dirent->rbtree), in isoent_tree()
5698 &(dent->rbtree), isoent->file->basename.s); in isoent_tree()
5744 &(isoent->rbtree), child_name); in isoent_find_child()
5870 __archive_rb_tree_init(&(idr->rbtree), rbt_ops); in idr_start()
[all …]
H A Darchive_write_set_format_xar.c208 struct archive_rb_tree rbtree; member
2008 __archive_rb_tree_init(&(file->rbtree), &rb_ops); in file_new()
2066 &(parent->rbtree), (struct archive_rb_node *)child)) in file_add_child_tail()
2084 &(parent->rbtree), child_name); in file_find_child()
2326 &(xar->cur_dirent->rbtree), in file_tree()
2437 &(dent->rbtree), file->basename.s); in file_tree()
H A Darchive_write_set_format_7zip.c252 struct archive_rb_tree rbtree;/* for empty files */ member
367 __archive_rb_tree_init(&(zip->rbtree), &rb_ops); in archive_write_set_format_7zip()
579 if (!__archive_rb_tree_insert_node(&(zip->rbtree), in _7z_write_header()
891 ARCHIVE_RB_TREE_FOREACH(n, &(zip->rbtree)) { in _7z_close()
/freebsd/lib/libunbound/
H A DMakefile25 random.c rbtree.c redis.c \
/freebsd/contrib/unbound/contrib/
H A Dunbound-fuzzme.patch96 + $(srcdir)/util/rbtree.h $(srcdir)/util/rtt.h $(srcdir)/util/data/msgreply.h $(srcdir)/util/fptr_w…
/freebsd/contrib/unbound/doc/
H A DTODO10 o delegpt use rbtree for ns-list, to avoid slowdown for very large NS sets.
H A DChangelog2508 - Workaround for #439: prevent loops in the reuse rbtree.
2721 - Fix when use free buffer to initialize rbtree for stream reuse.
10201 in the negative cache rbtree (upcoming 1.1 feature). (Thanks to
12539 - fixed rbtree cleanup with postorder traverse.
12612 - copied over rbtree implementation from NSD (BSD licensed too).