Lines Matching refs:nSpans
84 for(j = 1; j < g->nSpans; ++j){
90 g->nSpans = i + 1;
94 Span *s = g->span, *b = base->span, *e = &b[base->nSpans];
113 g->nSpans = s - g->span;
117 Span *b = g->span, *e = &b[g->nSpans];
127 Span *b = g->span, *e = &b[g->nSpans];
137 Span *b1 = g1->span, *e1 = &b1[g1->nSpans];
139 Span *b2 = g2->span, *e2 = &b2[g2->nSpans];
436 doLinear(o, 0, g->span, g->nSpans, from, next, readCh);
452 if(g->nSpans <= 2){
455 State *def = g->span[g->nSpans-1].to;
456 Span **sP = malloc(sizeof(Span*)*(g->nSpans-1)), **r, **s, **t;
460 for(i = 0; i < g->nSpans; ++i)
518 doBinary(o, 0, g->span, g->nSpans, from, next, readCh);
523 if(g->nSpans == 0)
529 if(g->nSpans > 8){
530 Span *bot = &g->span[0], *top = &g->span[g->nSpans-1];
533 util = (top[-1].ub - bot[0].ub)/(g->nSpans - 2);
536 util = (top[0].ub - bot[0].ub)/(g->nSpans - 1);
538 util = top[-1].ub/(g->nSpans - 1);
546 if(g->nSpans > 5){
557 for(i = 0; i < g->nSpans; ++i){
563 go.span = malloc(sizeof(Span)*g->nSpans);
595 unsigned int nf = fg->go.nSpans, nb = bg->go.nSpans;
676 for(i = 0; i < x->go.nSpans; ++i){
694 for(i = 0; i < s->go.nSpans; ++i){
715 for(i = 0; i < s->go.nSpans; ++i){
755 s->go.nSpans = 1;
802 for(i = 0; i < s->go.nSpans; ++i)
830 for(i = 0; i < s->go.nSpans; ++i)
845 for(i = 0; i < s->go.nSpans; ++i){
862 for(i = 0; i < s->go.nSpans; ++i){
865 unsigned int nSpans;
867 nSpans = merge(span, s, to);
868 if(nSpans < s->go.nSpans){
870 s->go.nSpans = nSpans;
871 s->go.span = malloc(sizeof(Span)*nSpans);
872 memcpy(s->go.span, span, nSpans*sizeof(Span));
