185     int		 topf, topg, toph, v;  in Cudd_bddIteConstant()  local
210     comple = bddVarToCanonical(dd, &f, &g, &h, &topf, &topg, &toph);  in Cudd_bddIteConstant()
221     if (topf < v && cuddT(f) == one && cuddE(f) == zero) {  in Cudd_bddIteConstant()
226     if (topf <= v) {  in Cudd_bddIteConstant()
227 	v = ddMin(topf, v);		/* v = top_var(F,G,H) */  in Cudd_bddIteConstant()
626     int topf, topg, res;  in Cudd_bddLeq()  local
669     topf = dd->perm[F->index];  in Cudd_bddLeq()
671     if (topf <= topg) {  in Cudd_bddLeq()
680     if (topg <= topf) {  in Cudd_bddLeq()
724     int		 topf, topg, toph, v;  in cuddBddIteRecur()  local
771     comple = bddVarToCanonicalSimple(dd, &f, &g, &h, &topf, &topg, &toph);  in cuddBddIteRecur()
778     if (topf < v && cuddT(f) == one && cuddE(f) == zero) {  in cuddBddIteRecur()
793     if (topf <= v) {  in cuddBddIteRecur()
794 	v = ddMin(topf, v);	/* v = top_var(F,G,H) */  in cuddBddIteRecur()
863     int topf, topg;  in cuddBddIntersectRecur()  local
885     topf = dd->perm[F->index];  in cuddBddIntersectRecur()
890     if (topf <= topg) {  in cuddBddIntersectRecur()
903     if (topg <= topf) {  in cuddBddIntersectRecur()
977     int topf, topg;  in cuddBddAndRecur()  local
1019     topf = manager->perm[F->index];  in cuddBddAndRecur()
1023     if (topf <= topg) {  in cuddBddAndRecur()
1036     if (topg <= topf) {  in cuddBddAndRecur()
1107     int topf, topg;  in cuddBddXorRecur()  local
1142     topf = manager->perm[f->index];  in cuddBddXorRecur()
1147     if (topf <= topg) {  in cuddBddXorRecur()
1156     if (topg <= topf) {  in cuddBddXorRecur()
1268     int		topf, topg, toph;  in bddVarToCanonical()  local
1277     topf = cuddI(dd,F->index);  in bddVarToCanonical()
1284 	if ((topf > toph) || (topf == toph && f > h)) {  in bddVarToCanonical()
1295 	if ((topf > topg) || (topf == topg && f > g)) {  in bddVarToCanonical()
1306 	if ((topf > topg) || (topf == topg && f > g)) {  in bddVarToCanonical()