Home | History | Annotate | Download | only in routed

Lines Matching defs:tt

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