331 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()  local
333 	t->rn_l = tt; t->rn_off = b >> 3;  in rn_newpair()
334 	tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t;  in rn_newpair()
335 	tt->rn_flags = t->rn_flags = RNF_ACTIVE;  in rn_newpair()
337 	tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;  in rn_newpair()
338 	tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;  in rn_newpair()
355 	struct radix_node *tt;  in rn_insert()  local
392 	t = rn_newpair(v_arg, b, nodes); tt = t->rn_l;  in rn_insert()
401 		t->rn_r = tt; t->rn_l = x;  in rn_insert()
408 	return (tt);  in rn_insert()
497 rn_new_radix_mask(struct radix_node *tt,  in rn_new_radix_mask()  argument
508 	m->rm_b = tt->rn_b;  in rn_new_radix_mask()
509 	m->rm_flags = tt->rn_flags;  in rn_new_radix_mask()
510 	if (tt->rn_flags & RNF_NORMAL)  in rn_new_radix_mask()
511 		m->rm_leaf = tt;  in rn_new_radix_mask()
513 		m->rm_mask = tt->rn_mask;  in rn_new_radix_mask()
515 	tt->rn_mklist = m;  in rn_new_radix_mask()
526 	struct radix_node *t, *x = 0, *tt;  in rn_addroute()  local
550 	saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);  in rn_addroute()
552 		for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {  in rn_addroute()
553 			if (tt->rn_mask == netmask)  in rn_addroute()
556 			    (tt->rn_mask &&  in rn_addroute()
557 			     ((b_leaf < tt->rn_b) || /* index(netmask) > node */  in rn_addroute()
558 			       rn_refines(netmask, tt->rn_mask) ||  in rn_addroute()
559 			       rn_lexobetter(netmask, tt->rn_mask))))  in rn_addroute()
572 		if (tt == saved_tt) {  in rn_addroute()
575 			(tt = treenodes)->rn_dupedkey = t;  in rn_addroute()
576 			tt->rn_flags = t->rn_flags;  in rn_addroute()
577 			tt->rn_p = x = t->rn_p;  in rn_addroute()
578 			if (x->rn_l == t) x->rn_l = tt; else x->rn_r = tt;  in rn_addroute()
579 			saved_tt = tt; x = xx;  in rn_addroute()
581 			(tt = treenodes)->rn_dupedkey = t->rn_dupedkey;  in rn_addroute()
582 			t->rn_dupedkey = tt;  in rn_addroute()
585 		t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;  in rn_addroute()
586 		tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;  in rn_addroute()
588 		tt->rn_key = (caddr_t) v;  in rn_addroute()
589 		tt->rn_b = -1;  in rn_addroute()
590 		tt->rn_flags = RNF_ACTIVE;  in rn_addroute()
596 		tt->rn_mask = netmask;  in rn_addroute()
597 		tt->rn_b = x->rn_b;  in rn_addroute()
598 		tt->rn_flags |= x->rn_flags & RNF_NORMAL;  in rn_addroute()
624 		return tt; /* can't lift at all */  in rn_addroute()
625 	b_leaf = tt->rn_b;  in rn_addroute()
643 			if (tt->rn_flags & RNF_NORMAL) {  in rn_addroute()
646 				return tt;  in rn_addroute()
652 			tt->rn_mklist = m;  in rn_addroute()
653 			return tt;  in rn_addroute()
658 	*mp = rn_new_radix_mask(tt, *mp);  in rn_addroute()
659 	return tt;  in rn_addroute()
667 	struct radix_node *t, *p, *x, *tt;  in rn_delete()  local
676 	tt = rn_search(v, x);  in rn_delete()
679 	saved_tt = tt;  in rn_delete()
681 	if (tt == 0 ||  in rn_delete()
682 	    Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))  in rn_delete()
691 		while (tt->rn_mask != netmask)  in rn_delete()
692 			if ((tt = tt->rn_dupedkey) == 0)  in rn_delete()
695 	if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)  in rn_delete()
697 	if (tt->rn_flags & RNF_NORMAL) {  in rn_delete()
698 		if (m->rm_leaf != tt || m->rm_refs > 0) {  in rn_delete()
703 		if (m->rm_mask != tt->rn_mask) {  in rn_delete()
710 	b = -1 - tt->rn_b;  in rn_delete()
726 		if (tt->rn_flags & RNF_NORMAL)  in rn_delete()
733 	if (tt->rn_flags & RNF_ROOT)  in rn_delete()
737 	for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}  in rn_delete()
738 	if (t) t->rn_ybro = tt->rn_ybro;  in rn_delete()
740 	t = tt->rn_p;  in rn_delete()
742 		if (tt == saved_tt) {  in rn_delete()
744 			if (t->rn_l == tt) t->rn_l = x; else t->rn_r = x;  in rn_delete()
746 			for (x = p = saved_tt; p && p->rn_dupedkey != tt;)  in rn_delete()
748 			if (p) p->rn_dupedkey = tt->rn_dupedkey;  in rn_delete()
751 		t = tt + 1;  in rn_delete()
763 	if (t->rn_l == tt) x = t->rn_r; else x = t->rn_l;  in rn_delete()
797 	x = tt + 1;  in rn_delete()
809 	tt->rn_flags &= ~RNF_ACTIVE;  in rn_delete()
810 	tt[1].rn_flags &= ~RNF_ACTIVE;  in rn_delete()
811 	return (tt);  in rn_delete()
856 	struct radix_node *t, *tt, *ttt;  in rn_inithead()  local
866 	tt = t->rn_l;  in rn_inithead()
867 	tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;  in rn_inithead()
868 	tt->rn_b = -1 - off;  in rn_inithead()
869 	*ttt = *tt;  in rn_inithead()