Lines Matching defs:first
53 int low = t->first;
55 for (n=t->first ; n<=t->last ; n++)
59 for (n=t->first ; n<=t->last ; n++)
70 t->first = t->last = -1;
93 int first, int last, int fixed, int id)
95 if (first < 0 || last < 0 || last < first)
103 t->first = first;
105 t->seq = NEW(int,last-first+1);
113 if (first == t->first && last == t->last)
117 if (last < t->first)
122 tnew->first = first;
125 tnew->seq = NEW(int,last-first+1);
134 if (first > t->last)
136 t->next = bddtree_addrange_rec(t->next, t, first, last, fixed, id);
141 if (first >= t->first && last <= t->last)
144 bddtree_addrange_rec(t->nextlevel,NULL,first,last,fixed,id);
149 if (first <= t->first)
157 if (last >= this->first && last < this->last)
160 if (this->next == NULL || last < this->next->first)
165 tnew->first = first;
168 tnew->seq = NEW(int,last-first+1);
189 BddTree *bddtree_addrange(BddTree *t, int first, int last, int fixed,int id)
191 return bddtree_addrange_rec(t,NULL,first,last,fixed,id);