Searched refs:rn_dupedkey (Results 1 – 5 of 5) sorted by relevance
263 x = x->rn_dupedkey; in rn_lookup()345 t = t->rn_dupedkey; in rn_match()364 t = t->rn_dupedkey; in rn_match()365 for (; t != NULL; t = t->rn_dupedkey) { in rn_match()397 x = x->rn_dupedkey; in rn_match()749 for (t = tt; tt != NULL; t = tt, tt = tt->rn_dupedkey) { in rn_addroute()762 (tt = nodes)->rn_dupedkey = t; in rn_addroute()772 (tt = nodes)->rn_dupedkey = t->rn_dupedkey; in rn_addroute()773 t->rn_dupedkey = tt; in rn_addroute()775 if (tt->rn_dupedkey != NULL) /* parent */ in rn_addroute()[all …]
78 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey macro
1690 if (rn->rn_dupedkey != NULL) { in rttable_walk_entry()1699 while ((rn1 = rn1->rn_dupedkey) != NULL) { in rttable_walk_entry()
270 if ((rn = rnode.rn_dupedkey) != NULL) in size_cols_tree()449 rnode.rn_dupedkey ? " =>\n" : "\n"); in p_tree()460 if ((rn = rnode.rn_dupedkey) != NULL) in p_tree()811 if (rt->rt_nodes[0].rn_dupedkey) in p_rtentry()
357 rn = rn->rn_dupedkey; in bootpboot_p_tree()