buddy/src/reorder.c

171    BddTree *this=t, *first=t;
191       if (first == this)
192 	 first = this->prev;
205    return first;
211    BddTree *this, *first=t;
238 	 if (first == this)
239 	    first = this->prev;
253    return first;
260 static BddTree *reorder_swapwin3(BddTree *this, BddTree **first)
279 	    *first = this->prev;
346 	    *first = this->prev;
355 	    *first = this->prev->prev;
365 	    *first = this->prev;
374 	    *first = this->prev->prev;
384 	    *first = this->prev;
396    BddTree *this=t, *first=t;
407       this = reorder_swapwin3(this, &first);
420    return first;
426    BddTree *this=t, *first=t;
438       this = first;
442 	 this = reorder_swapwin3(this, &first);
459    return first;
488       int first = 1;
493 		(reorder_nodenum() <= maxAllowed || first))
495 	    first = 0;
521 		(reorder_nodenum() <= maxAllowed  ||  first))
523 	    first = 0;
605       /* Find first block */
653       for (v=this->first ; v<=this->last ; v++)
680    BddTree *first=t;
693       first = reorder_sift(first);
697    return first;
725       /* Find first block */
745    int leftsize = left->last - left->first;
746    int rightsize = right->last - right->first;
1760       qsort(t->seq, t->last-t->first+1, sizeof(int), varseqCmp);
1817    top->first = 0;
2110 int bdd_intaddvarblock(int first, int last, int fixed) *}
2113 	   In the second form the argument {\tt first} is the first variable
2120 	   the block 0-9 is added as the first block and then the block 0-6.
2131 	   most blocks first and then recursively downwards.
2143    int first, last;
2150    first = last = v[0];
2154       if (v[n] < first)
2155 	 first = v[n];
2160    if ((t=bddtree_addrange(vartree, first,last, fixed,blockid)) == NULL)
2168 int bdd_intaddvarblock(int first, int last, int fixed)
2172    if (first < 0  ||  first >= bddvarnum  ||  last < 0  ||  last >= bddvarnum)
2175    if ((t=bddtree_addrange(vartree, first,last, fixed,blockid)) == NULL)
2221            This shows 5 variable blocks. The first one added is block zero,