rn_dupedkey
x = x->rn_dupedkey;
if (t->rn_dupedkey) {
t = t->rn_dupedkey;
t = t->rn_dupedkey;
for (; t; t = t->rn_dupedkey) {
x = x->rn_dupedkey;
for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
(tt = treenodes)->rn_dupedkey = t;
(tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
t->rn_dupedkey = tt;
for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
if ((tt = tt->rn_dupedkey) == 0)
if ((dupedkey = saved_tt->rn_dupedkey)) {
for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
p = p->rn_dupedkey;
if (p) p->rn_dupedkey = tt->rn_dupedkey;
for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
base = rn->rn_dupedkey;
rn = rn->rn_dupedkey;
base = rn->rn_dupedkey;
x = x->rn_dupedkey;
if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey)
t = t->rn_dupedkey;
t = t->rn_dupedkey;
for (; t; t = t->rn_dupedkey)
x = x->rn_dupedkey;
for (dup = rn; dup != NULL; dup = dup->rn_dupedkey) {
for (t = tt; tt != NULL; t = tt, tt = tt->rn_dupedkey) {
(tt = treenodes)->rn_dupedkey = t;
(tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
t->rn_dupedkey = tt;
if (tt->rn_dupedkey)
tt->rn_dupedkey->rn_p = tt;
for (mp = &t->rn_mklist; x != NULL; x = x->rn_dupedkey) {
if ((tt = tt->rn_dupedkey) == NULL)
dupedkey = saved_tt->rn_dupedkey;
p != NULL && p->rn_dupedkey != tt;)
p = p->rn_dupedkey;
p->rn_dupedkey = tt->rn_dupedkey;
if (tt->rn_dupedkey != NULL)
tt->rn_dupedkey->rn_p = p;
x = x->rn_dupedkey) {
base = rn->rn_dupedkey;
rnode.rn_dupedkey ? " =>\n" : "\n");
if ((rn = rnode.rn_dupedkey) != NULL)
rt->rt_nodes[0].rn_dupedkey ? " =>" : "");