Lines Matching defs:top
276 struct radix_node *top = head->rnh_treetop;
277 int head_off = top->rn_offset, vlen = (int)LEN(v);
278 register struct radix_node *t = rn_search(v_arg, top);
304 register struct radix_node *p, *x = top;
411 * At the top of the tree, no need to traverse the right
514 struct radix_node *saved_t, *top = t;
519 * Open code rn_search(v, top) to avoid overhead of extra
607 } while (t != top);
699 struct radix_node *saved_tt, *top = head->rnh_treetop;
713 if ((x = rn_addmask(netmask, 0, top->rn_offset)) == 0)
811 } while (b <= t->rn_bit && x != top);
850 struct radix_node *dupedkey, *saved_tt, *top;
861 top = x;
898 } while (b <= t->rn_bit && x != top);