Home | History | Annotate | Download | only in re2c

Lines Matching refs:ub

88 	g->span[i].ub = g->span[j].ub;
96 s->ub = 0;
100 if((s->ub - lb) > 1)
101 s->ub = b->ub;
104 if(s->ub){
105 lb = s->ub; ++s;
109 s->ub = b->ub;
112 s->ub = e[-1].ub; ++s;
121 for(; lb < b->ub; ++lb) bm[lb] |= m;
122 lb = b->ub;
131 printSpan(o, lb, b->ub);
132 lb = b->ub;
142 for(; b1 < e1 && b1->to != s1; ++b1) lb1 = b1->ub;
143 for(; b2 < e2 && b2->to != s2; ++b2) lb2 = b2->ub;
146 if(lb1 != lb2 || b1->ub != b2->ub) return 0;
198 void BitMap_gen(FILE *o, unsigned int lb, unsigned int ub){
201 unsigned int n = ub - lb;
397 while(n >= 3 && s[2].to == bg && (s[1].ub - s[0].ub) == 1){
400 genIf(o, "!=", s[0].ub, readCh);
407 genIf(o, "==", s[0].ub, readCh);
418 genIf(o, ">=", s[0].ub, readCh);
425 genIf(o, "<=", s[0].ub - 1, readCh);
440 if(lb < s->ub){
443 if(++lb == s->ub)
481 genCases(o, (*s)[-1].ub, *s);
485 genCases(o, (*s)[-1].ub, *s);
507 genIf(o, "<=", s[h-1].ub - 1, readCh);
533 util = (top[-1].ub - bot[0].ub)/(g->nSpans - 2);
535 if(bot[0].ub > (top[0].ub - top[-1].ub)){
536 util = (top[0].ub - bot[0].ub)/(g->nSpans - 1);
538 util = top[-1].ub/(g->nSpans - 1);
599 if(f->ub == b->ub){
606 x->ub = f->ub;
611 while(f->ub < b->ub){
618 x->ub = f->ub;
621 while(b->ub < f->ub){
628 x->ub = b->ub;
757 s->go.span[0].ub = d->ubChar;