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) == NULL) {
if ((dupedkey = saved_tt->rn_dupedkey) != NULL) {
for (x = p = saved_tt; p && p->rn_dupedkey != tt; )
p = p->rn_dupedkey;
p->rn_dupedkey = tt->rn_dupedkey;
for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
base = rn->rn_dupedkey;
for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
base = rn->rn_dupedkey;
x = x->rn_dupedkey;
t = t->rn_dupedkey;
if (t->rn_dupedkey == NULL &&
t = t->rn_dupedkey;
for (; t != NULL; 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;
if (tt->rn_dupedkey)
tt->rn_dupedkey->rn_parent = tt;
for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
if ((tt = tt->rn_dupedkey) == 0)
dupedkey = saved_tt->rn_dupedkey;
for (x = p = saved_tt; p && p->rn_dupedkey != tt; )
p = p->rn_dupedkey;
p->rn_dupedkey = tt->rn_dupedkey;
if (tt->rn_dupedkey) /* parent */
tt->rn_dupedkey->rn_parent = p;