| /netbsd-src/sys/sys/ |
| H A D | rbtree.h | 48 #define RB_DIR_RIGHT 1 macro
51 #define rb_right rb_nodes[RB_DIR_RIGHT]
77 (((rb)->rb_info & RB_FLAG_POSITION) ? RB_DIR_RIGHT : RB_DIR_LEFT)
78 #define RB_RIGHT_P(rb) (RB_POSITION(rb) == RB_DIR_RIGHT)
103 #define RB_TREE_MAX(T) rb_tree_iterate((T), NULL, RB_DIR_RIGHT)
104 #define RB_TREE_NEXT(T, N) rb_tree_iterate((T), (N), RB_DIR_RIGHT)
|
| /netbsd-src/common/lib/libc/gen/ |
| H A D | rb.c | 109 rbt->rbt_minmax[RB_DIR_RIGHT] = rbt->rbt_root; /* maximum node */ in rb_tree_init()
227 if (position == RB_DIR_RIGHT) in rb_tree_insert_node()
259 rbt->rbt_minmax[RB_DIR_RIGHT] = self; in rb_tree_insert_node()
263 KASSERT(position == RB_DIR_LEFT || position == RB_DIR_RIGHT); in rb_tree_insert_node()
337 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT); in rb_tree_reparent_nodes()
416 KASSERT(RB_DIR_RIGHT == 1 && RB_DIR_LEFT == 0); in rb_tree_insert_rebalance()
532 rbt->rbt_minmax[RB_DIR_RIGHT] = father; in rb_tree_prune_node()
712 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT); in rb_tree_prune_blackred_branch()
789 which = RB_LEFT_SENTINEL_P(self) ? RB_DIR_RIGHT : RB_DIR_LEFT; in rb_tree_remove_node()
818 KASSERT(which == RB_DIR_LEFT || which == RB_DIR_RIGHT); in rb_tree_removal_rebalance()
[all …]
|
| /netbsd-src/external/bsd/libarchive/dist/libarchive/ |
| H A D | archive_rb.c | 40 #define RB_DIR_RIGHT 1 macro
43 #define rb_right rb_nodes[RB_DIR_RIGHT]
63 (((rb)->rb_info & RB_FLAG_POSITION) ? RB_DIR_RIGHT : RB_DIR_LEFT)
64 #define RB_RIGHT_P(rb) (RB_POSITION(rb) == RB_DIR_RIGHT)
529 which = RB_LEFT_SENTINEL_P(self) ? RB_DIR_RIGHT : RB_DIR_LEFT; in __archive_rb_tree_remove_node()
|
| /netbsd-src/usr.sbin/ldpd/ |
| H A D | label.c | 223 lnext = rb_tree_iterate(&labels_tree, l, RB_DIR_RIGHT); in del_all_peer_labels()
324 return rb_tree_iterate(&labels_tree, l, RB_DIR_RIGHT); in label_get_right()
|
| H A D | ldp_peer.c | 581 RB_DIR_RIGHT); in ldp_peer_lm_right()
|
| /netbsd-src/sys/external/bsd/drm2/include/linux/ |
| H A D | interval_tree.h | 141 next = rb_tree_iterate(&root->rb_root.rbr_tree, node, RB_DIR_RIGHT); in interval_tree_iter_next()
|
| H A D | interval_tree_generic.h | 125 RB_DIR_RIGHT); \
|
| /netbsd-src/sys/ufs/chfs/ |
| H A D | chfs_readinode.c | 373 struct rb_node *next = rb_tree_iterate(&rii->tdi_root, this, RB_DIR_RIGHT); in chfs_add_tmp_dnode_to_tree()
421 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_RIGHT); in chfs_add_tmp_dnode_to_tree()
456 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_RIGHT); in chfs_add_tmp_dnode_to_tree()
460 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_RIGHT); in chfs_add_tmp_dnode_to_tree()
|
| H A D | chfs.h | 264 #define frag_next(tree, frag) (struct chfs_node_frag *)rb_tree_iterate(tree, frag, RB_DIR_RIGHT)
|
| /netbsd-src/lib/libc/stdlib/ |
| H A D | _env.c | 223 next = rb_tree_iterate(&env_tree, node, RB_DIR_RIGHT); in __scrubenv()
|
| /netbsd-src/sys/external/bsd/ipf/netinet/ |
| H A D | ipf_rb.h | 51 while ((rb = rb_tree_iterate(head, NULL, RB_DIR_RIGHT)) != NULL) {\
60 # define RBI_ISEMPTY(_h) (rb_tree_iterate(_h, NULL, RB_DIR_RIGHT) == NULL)
|
| /netbsd-src/sys/external/bsd/drm2/linux/ |
| H A D | linux_idr.c | 370 search = rb_tree_iterate(&idr->idr_tree, search, RB_DIR_RIGHT); in idr_alloc()
|
| /netbsd-src/sys/fs/msdosfs/ |
| H A D | msdosfs_denode.c | 731 nfhp = rb_tree_iterate(&fh_rbtree, fhp, RB_DIR_RIGHT); in msdosfs_fh_destroy()
|
| /netbsd-src/external/bsd/dhcpcd/dist/src/ |
| H A D | route.c | 53 #define RB_TREE_NEXT(T, N) rb_tree_iterate((T), (N), RB_DIR_RIGHT)
|
| /netbsd-src/sys/uvm/ |
| H A D | uvm_physseg.c | 429 RB_DIR_RIGHT); in uvm_physseg_get_next()
|
| H A D | uvm_map.c | 623 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_RIGHT); in _uvm_tree_sanity()
|
| /netbsd-src/sys/fs/udf/ |
| H A D | udf_subr.c | 6429 udf_node, RB_DIR_RIGHT); in udf_sync_pass()
6541 udf_node, RB_DIR_RIGHT); in udf_do_sync()
|