| /freebsd-12-stable/contrib/ldns/ |
| D | rbtree.c | 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* 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 …]
|
| D | Makefile.in | 78 …r.lo host2str.lo host2wire.lo keys.lo net.lo packet.lo parse.lo radix.lo rbtree.lo rdata.lo resolv… 83 …h higher.h host2str.h host2wire.h keys.h ldns.h packet.h parse.h radix.h rbtree.h rdata.h resolver… 542 …$(srcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree… 550 …$(srcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree… 558 …$(srcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree… 566 …$(srcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree… 574 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \ 582 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \ 590 …rcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree.h \ 599 …$(srcdir)/ldns/resolver.h $(srcdir)/ldns/tsig.h $(srcdir)/ldns/dnssec_zone.h $(srcdir)/ldns/rbtree… [all …]
|
| D | Changelog | 440 * Fixed comment in rbtree.h about being first member and data ptr. 669 rbtree and links signatures and NSEC(3) records directly to their
|
| /freebsd-12-stable/contrib/unbound/util/ |
| D | rbtree.c | 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; 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 …]
|
| D | rbtree.h | 102 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-12-stable/contrib/jemalloc/include/jemalloc/internal/ |
| D | rb.h | 169 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_type *node); \ [all …]
|
| /freebsd-12-stable/contrib/ldns/ldns/ |
| D | rbtree.h | 108 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-12-stable/contrib/unbound/ |
| D | Makefile.in | 130 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… 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.… 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/… 782 …$(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_delegpt.h $(srcdir)/util/log.h $(srcdir)/util/conf… 786 …$(srcdir)/util/storage/dnstree.h $(srcdir)/util/rbtree.h $(srcdir)/iterator/iter_delegpt.h $(srcdi… [all …]
|
| /freebsd-12-stable/lib/libldns/ |
| D | Makefile | 16 keys.c net.c packet.c parse.c radix.c rbtree.c rdata.c resolver.c \
|
| /freebsd-12-stable/contrib/libarchive/libarchive/ |
| D | archive_write_set_format_mtree.c | 74 struct archive_rb_tree rbtree; member 831 __archive_rb_tree_init(&me->dir_info->rbtree, &rb_ops); in mtree_entry_new() 1106 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) { in write_mtree_entry_tree() 1132 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) { in write_mtree_entry_tree() 1959 &(parent->dir_info->rbtree), child_name); in mtree_entry_find_child() 2033 &(mtree->cur_dirent->dir_info->rbtree), in mtree_entry_tree_add() 2037 &(mtree->cur_dirent->dir_info->rbtree), in mtree_entry_tree_add() 2109 &(dent->dir_info->rbtree), in mtree_entry_tree_add() 2152 &(dent->dir_info->rbtree), in mtree_entry_tree_add() 2155 &(dent->dir_info->rbtree), file->basename.s); in mtree_entry_tree_add()
|
| D | archive_read_support_format_mtree.c | 115 struct archive_rb_tree rbtree; member 286 __archive_rb_tree_init(&mtree->rbtree, &rb_ops); in archive_read_support_format_mtree() 996 if (!__archive_rb_tree_insert_node(&mtree->rbtree, &entry->rbnode)) { in process_add_entry() 999 &mtree->rbtree, entry->name); in process_add_entry() 1211 &mtree->rbtree, mentry->name); in parse_file()
|
| D | archive_write_set_format_xar.c | 185 struct archive_rb_tree rbtree; member 1969 __archive_rb_tree_init(&(file->rbtree), &rb_ops); in file_new() 2027 &(parent->rbtree), (struct archive_rb_node *)child)) in file_add_child_tail() 2045 &(parent->rbtree), child_name); in file_find_child() 2287 &(xar->cur_dirent->rbtree), in file_tree() 2398 &(dent->rbtree), file->basename.s); in file_tree()
|
| D | archive_write_set_format_iso9660.c | 226 struct archive_rb_tree rbtree; member 883 struct archive_rb_tree rbtree; member 5120 __archive_rb_tree_init(&(isoent->rbtree), &rb_ops); in isoent_new() 5242 &(parent->rbtree), (struct archive_rb_node *)child)) in isoent_add_child_head() 5267 &(parent->rbtree), (struct archive_rb_node *)child)) in isoent_add_child_tail() 5309 __archive_rb_tree_remove_node(&(parent->rbtree), in isoent_remove_child() 5581 &(iso9660->cur_dirent->rbtree), in isoent_tree() 5691 &(dent->rbtree), isoent->file->basename.s); in isoent_tree() 5737 &(isoent->rbtree), child_name); in isoent_find_child() 5863 __archive_rb_tree_init(&(idr->rbtree), rbt_ops); in idr_start() [all …]
|
| D | archive_write_set_format_7zip.c | 215 struct archive_rb_tree rbtree;/* for empty files */ member 308 __archive_rb_tree_init(&(zip->rbtree), &rb_ops); in archive_write_set_format_7zip() 448 if (!__archive_rb_tree_insert_node(&(zip->rbtree), in _7z_write_header() 748 ARCHIVE_RB_TREE_FOREACH(n, &(zip->rbtree)) { in _7z_close()
|
| /freebsd-12-stable/lib/libunbound/ |
| D | Makefile | 27 random.c rbtree.c redis.c \
|
| /freebsd-12-stable/contrib/unbound/doc/ |
| D | TODO | 10 o delegpt use rbtree for ns-list, to avoid slowdown for very large NS sets.
|
| D | Changelog | 1512 - Workaround for #439: prevent loops in the reuse rbtree. 1725 - Fix when use free buffer to initialize rbtree for stream reuse. 9205 in the negative cache rbtree (upcoming 1.1 feature). (Thanks to 11543 - fixed rbtree cleanup with postorder traverse. 11616 - copied over rbtree implementation from NSD (BSD licensed too).
|
| /freebsd-12-stable/contrib/unbound/contrib/ |
| D | unbound-fuzzme.patch | 96 + $(srcdir)/util/rbtree.h $(srcdir)/util/rtt.h $(srcdir)/util/data/msgreply.h $(srcdir)/util/fptr_w…
|