Lines Matching refs:rn_dupedkey
199 x = x->rn_dupedkey;
271 t = t->rn_dupedkey;
287 t = t->rn_dupedkey;
288 for (; t; t = t->rn_dupedkey)
327 x = x->rn_dupedkey;
593 t = t->rn_dupedkey)
638 for (xp = x; x; xp = x, x = x->rn_dupedkey) {
680 tt->rn_dupedkey = x;
689 tt->rn_dupedkey = x;
690 x->rn_p->rn_dupedkey = tt;
695 tt->rn_dupedkey = x->rn_dupedkey;
696 x->rn_dupedkey = tt;
698 if (tt->rn_dupedkey)
699 tt->rn_dupedkey->rn_p = tt;
709 * - leaf nodes with possible rn_dupedkey list
731 for (mp = &tp->rn_mklist; x; xx = x, x = x->rn_dupedkey) {
844 if (tt->rn_dupedkey == NULL ||
845 tt->rn_dupedkey->rn_mklist != m) {
850 m->rm_leaf = tt->rn_dupedkey;
919 * the radix leaf node (where th rn_dupedkey list starts) so
935 * make tt point to the start of the rn_dupedkey list of multipath
945 if ((tt = tt->rn_dupedkey) == NULL)
962 if (saved_tt->rn_dupedkey) {
964 x = saved_tt->rn_dupedkey;
976 dupedkey_tt = tt->rn_dupedkey;
977 tp->rn_dupedkey = tt->rn_dupedkey;
978 if (tt->rn_dupedkey)
979 tt->rn_dupedkey->rn_p = tp;
992 /* non-rn_dupedkey case, remove tt and tp node from the tree */
1017 for (m = tp->rn_mklist; m && x; x = x->rn_dupedkey)
1046 /* no rn_dupedkey list so no need to fixup multipath chains */
1080 base = rn->rn_dupedkey;