Lines Matching defs:top
279 struct radix_node *saved_t, *top = t;
284 * Open code rn_search(v, top) to avoid overhead of extra
328 /* Hit the top; have to give up */
387 } while (t != top);
425 struct radix_node *top = head->rnh_treetop;
426 int head_off = top->rn_offset, vlen = (int)*((u_char *)v);
427 struct radix_node *t = rn_search(v_arg, top);
451 struct radix_node *p, *x = top;
601 struct radix_node *saved_tt, *top = head->rnh_treetop;
615 if ((x = rn_addmask(netmask, 0, top->rn_offset)) == 0)
715 } while (b <= t->rn_bit && x != top);
754 struct radix_node *dupedkey, *saved_tt, *top;
765 top = x;
802 } while (b <= t->rn_bit && x != top);
959 * from the top of tree.
1033 * At the top of the tree, no need to traverse the right
1052 /* If one or more nodes got deleted, restart from top */
1079 * from the top of tree.
1105 /* If one or more nodes got deleted, restart from top */