Lines Matching refs:top
285 struct radix_node *saved_t, *top = t;
290 * Open code rn_search(v, top) to avoid overhead of extra
375 } while (t != top);
432 struct radix_node *top = head->rnh_treetop;
433 int head_off = top->rn_offset, vlen = LEN(v);
434 struct radix_node *t = rn_search(v_arg, top);
456 x = top;
605 struct radix_node *saved_tt, *top = head->rnh_treetop;
619 x = rn_addmask(netmask, head->rnh_masks, 0, top->rn_offset);
737 } while (b <= t->rn_bit && x != top);
778 struct radix_node *dupedkey, *saved_tt, *top;
789 top = x;
827 } while (b <= t->rn_bit && x != top);
1037 * At the top of the tree, no need to traverse the right