Lines Matching defs:nelem
1386 for (i = 0; i < src->nelem; ++i)
1388 dst->nelem = src->nelem;
1401 for (i = 0; i < s->nelem && p.index < s->elems[i].index; ++i)
1403 if (i < s->nelem && p.index == s->elems[i].index)
1408 ++s->nelem;
1409 while (i < s->nelem)
1425 m->nelem = 0;
1426 while (i < s1->nelem && j < s2->nelem)
1428 m->elems[m->nelem++] = s1->elems[i++];
1430 m->elems[m->nelem++] = s2->elems[j++];
1433 m->elems[m->nelem] = s1->elems[i++];
1434 m->elems[m->nelem++].constraint |= s2->elems[j++].constraint;
1436 while (i < s1->nelem)
1437 m->elems[m->nelem++] = s1->elems[i++];
1438 while (j < s2->nelem)
1439 m->elems[m->nelem++] = s2->elems[j++];
1448 for (i = 0; i < s->nelem; ++i)
1451 if (i < s->nelem)
1452 for (--s->nelem; i < s->nelem; ++i)
1470 for (i = 0; i < s->nelem; ++i)
1476 if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem
1479 for (j = 0; j < s->nelem; ++j)
1484 if (j == s->nelem)
1491 MALLOC(d->states[i].elems.elems, position, s->nelem);
1500 d->states[i].mbps.nelem = 0;
1502 for (j = 0; j < s->nelem; ++j)
1541 for (i = 0; i < s->nelem; ++i)
1582 for (j = 0; j < d->follows[old.index].nelem; ++j)
1711 tmp.nelem = nfirstpos[-1];
1718 nalloc[pos[j].index], merged.nelem - 1);
1731 tmp.nelem = nfirstpos[-1];
1738 nalloc[pos[j].index], merged.nelem - 1);
1839 for (j = d->follows[i].nelem - 1; j >= 0; --j)
1848 if (d->follows[i].nelem < merged.nelem)
1849 REALLOC(d->follows[i].elems, position, merged.nelem);
1855 merged.nelem = 0;
1862 for (i = 0; i < merged.nelem; ++i)
1951 for (i = 0; i < d->states[s].elems.nelem; ++i)
1966 if (d->states[s].mbps.nelem == 0)
1969 d->states[s].elems.nelem);
2045 grps[j].elems[grps[j].nelem++] = pos;
2060 grps[ngrps].nelem = 1;
2076 for (i = 0; i < d->states[0].elems.nelem; ++i)
2103 follows.nelem = 0;
2107 for (j = 0; j < grps[i].nelem; ++j)
2108 for (k = 0; k < d->follows[grps[i].elems[j].index].nelem; ++k)
2133 for (j = 0; j < follows.nelem; ++j)
2151 for (j = 0; j < d->states[0].elems.nelem; ++j)
2157 for (j = 0; j < follows.nelem; ++j)
2166 for (j = 0; j < follows.nelem; ++j)
2561 MALLOC(rarray, int, d->states[s].mbps.nelem);
2562 for (i = 0; i < d->states[s].mbps.nelem; ++i)
2612 if (match_lens == NULL && d->states[s].mbps.nelem != 0)
2619 for (i = 0; i < d->states[s].mbps.nelem ; i++)
2622 for (j = 0; j < d->follows[d->states[s].mbps.elems[i].index].nelem;
2644 int nelem = d->states[s].mbps.nelem; /* Just a alias. */
2650 if (nelem > 0)
2657 for (i = 0; i < nelem; i++)
2666 if (nelem == 0 || maxlen == 0)
2683 follows.nelem = 0;
2698 follows.nelem = 0;
2701 for (i = 0; i < nelem ; i++)
2705 j < d->follows[d->states[s1].mbps.elems[i].index].nelem; j++)
2815 if (d->states[s].mbps.nelem != 0)
2880 if (d->states[s].mbps.nelem != 0)