| /dragonfly/contrib/ldns/ |
| H A D | rbtree.c | 82 ldns_rbtree_t *rbtree; in ldns_rbtree_create() local
86 if (!rbtree) { in ldns_rbtree_create()
93 return rbtree; in ldns_rbtree_create()
101 rbtree->count = 0; in ldns_rbtree_init()
102 rbtree->cmp = cmpf; in ldns_rbtree_init()
108 LDNS_FREE(rbtree); in ldns_rbtree_free()
132 rbtree->root = right; in ldns_rbtree_rotate_left()
159 rbtree->root = left; in ldns_rbtree_rotate_right()
270 rbtree->count++; in ldns_rbtree_insert()
322 if(rbtree->root == old) rbtree->root = new; in change_parent_ptr()
[all …]
|
| /dragonfly/contrib/ldns/ldns/ |
| H A D | rbtree.h | 108 void ldns_rbtree_free(ldns_rbtree_t *rbtree);
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);
188 ldns_rbnode_t *ldns_rbtree_previous(ldns_rbnode_t *rbtree);
207 #define LDNS_RBTREE_FOR(node, type, rbtree) \ argument
[all …]
|
| /dragonfly/test/debug/ |
| H A D | h2chains.c | 111 cp = (uintptr_t)hmp.vchain.core.rbtree.rbh_root; in main()
119 cp = (uintptr_t)hmp.fchain.core.rbtree.rbh_root; in main()
158 if (chain.core.rbtree.rbh_root) in h2chainscan()
160 (uintptr_t)chain.core.rbtree.rbh_root, in h2chainscan()
|
| /dragonfly/sys/kern/ |
| H A D | kern_sysref.c | 70 struct sysref_rb_tree rbtree; member
83 RB_INIT(&sa->rbtree); in sysrefbootinit()
122 sysref_rb_tree_RB_INSERT(&sa->rbtree, sr); in sysref_init()
225 sysref_rb_tree_RB_INSERT(&sa->rbtree, sr); in sysref_ctor()
259 sysref_rb_tree_RB_REMOVE(&sa->rbtree, sr); in sysref_dtor()
|
| /dragonfly/lib/libldns/ |
| H A D | Makefile | 13 edns.c packet.c parse.c rbtree.c rdata.c resolver.c \
40 rbtree.h \
|
| /dragonfly/contrib/libarchive/libarchive/ |
| H A 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()
|
| H A 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()
993 if (!__archive_rb_tree_insert_node(&mtree->rbtree, &entry->rbnode)) { in process_add_entry()
996 &mtree->rbtree, entry->name); in process_add_entry()
1206 &mtree->rbtree, mentry->name); in parse_file()
|
| H A 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()
|
| H A 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()
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()
5886 &(idr->rbtree), idrent->isoent); in idr_register()
5925 &(idr->rbtree), &(n->rbnode))); in idr_resolve()
[all …]
|
| H A 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()
|
| /dragonfly/sys/vfs/hammer2/ |
| H A D | hammer2_chain.c | 245 RB_INIT(&chain->core.rbtree); /* live chains */ in hammer2_chain_init()
313 xchain = RB_INSERT(hammer2_chain_tree, &parent->core.rbtree, chain); in hammer2_chain_insert()
624 &parent->core.rbtree, chain); in hammer2_chain_lastdrop()
672 KKASSERT(RB_EMPTY(&chain->core.rbtree) && in hammer2_chain_lastdrop()
1941 RB_SCAN(hammer2_chain_tree, &parent->core.rbtree, in hammer2_chain_find()
2314 KKASSERT(chain->core.live_count == 0 && RB_EMPTY(&chain->core.rbtree)); in hammer2_chain_repchange()
3556 RB_REMOVE(hammer2_chain_tree, &parent->core.rbtree, chain); in _hammer2_chain_delete_helper()
3623 RB_REMOVE(hammer2_chain_tree, &parent->core.rbtree, chain); in _hammer2_chain_delete_helper()
4095 if (chain->core.live_count == 0 && RB_EMPTY(&chain->core.rbtree)) { in hammer2_chain_indirect_maintenance()
5902 if (RB_EMPTY(&chain->core.rbtree)) { in hammer2_dump_chain()
[all …]
|
| H A D | hammer2_flush.c | 611 RB_SCAN(hammer2_chain_tree, &chain->core.rbtree, in hammer2_flush_core()
615 RB_SCAN(hammer2_chain_tree, &chain->core.rbtree, in hammer2_flush_core()
|
| H A D | hammer2.h | 240 struct hammer2_chain_tree rbtree; /* sub-chains */ member
|
| H A D | hammer2_vfsops.c | 701 if (chain && !RB_EMPTY(&chain->core.rbtree)) { in hammer2_pfsfree()
|
| /dragonfly/usr.sbin/makefs/hammer2/ |
| H A D | hammer2_chain.c | 251 RB_INIT(&chain->core.rbtree); /* live chains */ in hammer2_chain_init()
319 xchain = RB_INSERT(hammer2_chain_tree, &parent->core.rbtree, chain); in hammer2_chain_insert()
630 &parent->core.rbtree, chain); in hammer2_chain_lastdrop()
678 KKASSERT(RB_EMPTY(&chain->core.rbtree) && in hammer2_chain_lastdrop()
1947 RB_SCAN(hammer2_chain_tree, &parent->core.rbtree, in hammer2_chain_find()
2320 KKASSERT(chain->core.live_count == 0 && RB_EMPTY(&chain->core.rbtree)); in hammer2_chain_repchange()
3562 RB_REMOVE(hammer2_chain_tree, &parent->core.rbtree, chain); in _hammer2_chain_delete_helper()
3629 RB_REMOVE(hammer2_chain_tree, &parent->core.rbtree, chain); in _hammer2_chain_delete_helper()
4101 if (chain->core.live_count == 0 && RB_EMPTY(&chain->core.rbtree)) { in hammer2_chain_indirect_maintenance()
5914 if (RB_EMPTY(&chain->core.rbtree)) { in hammer2_dump_chain()
[all …]
|
| H A D | hammer2_flush.c | 615 RB_SCAN(hammer2_chain_tree, &chain->core.rbtree, in hammer2_flush_core()
619 RB_SCAN(hammer2_chain_tree, &chain->core.rbtree, in hammer2_flush_core()
|
| H A D | hammer2.h | 279 struct hammer2_chain_tree rbtree; /* sub-chains */ member
|
| H A D | hammer2_vfsops.c | 733 if (chain && !RB_EMPTY(&chain->core.rbtree)) { in hammer2_pfsfree()
|