RB_TREE_MIN
for (node = RB_TREE_MIN(&env_tree); node != NULL; node = next) {
tchunk = RB_TREE_MIN(&old_chunks);
if ((run = RB_TREE_MIN(&bin->runs)) != NULL) {
KASSERT(RB_TREE_MIN(&pmap->pm_tables) == NULL);
KASSERT(RB_TREE_MIN(&VM_PAGE_TO_PP(ptp)->pp_rb) == NULL);
pve = RB_TREE_MIN(tree);
for (i = 0, sc0 = RB_TREE_MIN(&ugenif.tree);
udf_node = RB_TREE_MIN(&ump->udf_node_tree);
for (udf_node = RB_TREE_MIN(&ump->udf_node_tree);
KASSERT(RB_TREE_MIN(&futex_tab.oa) == NULL);
KASSERT(RB_TREE_MIN(&futex_tab.va) == NULL);
KASSERT(RB_TREE_MIN(&vi->vi_nc_tree) == NULL);
while ((ncp = RB_TREE_MIN(&dvi->vi_nc_tree)) != NULL) {
KASSERT(RB_TREE_MIN(&nfsd_tree) == NULL);
for ((N) = RB_TREE_MIN(T); (N); (N) = RB_TREE_NEXT((T), (N)))
for ((N) = RB_TREE_MIN(T); \
frag = (struct chfs_node_frag *)RB_TREE_MIN(tree);
this = (struct chfs_node_frag *)RB_TREE_MIN(fragtree);
this = (struct chfs_node_frag *)RB_TREE_MIN(fragtree);
return (uvm_physseg_t) RB_TREE_MIN(&(uvm_physseg_graph.rb_tree));
while ((S = RB_TREE_MIN(&F->active)) != NULL) {
return RB_TREE_MIN(&labels_tree);
while((lma = RB_TREE_MIN(&p->label_mapping_tree)) != NULL) {
return RB_TREE_MIN(&p->label_mapping_tree);