Lines Matching refs:nbstates
260 int nbStates;
274 int nbStates;
285 int nbstates;
440 ret->nbStates = ctxt->nbStates;
458 int i, j, nbstates = 0, nbatoms = 0;
474 stateRemap = xmlMalloc(ret->nbStates * sizeof(int));
480 for (i = 0;i < ret->nbStates;i++) {
482 stateRemap[i] = nbstates;
483 nbstates++;
489 printf("Final: %d states\n", nbstates);
543 transitions = (int *) xmlMalloc((nbstates + 1) *
552 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
560 for (i = 0;i < ret->nbStates;i++) {
578 transdata = (void **) xmlMalloc(nbstates * nbatoms *
582 nbstates * nbatoms * sizeof(void *));
631 for (i = 0;i < nbstates;i++) {
643 for (i = 0;i < ret->nbStates;i++)
648 ret->nbStates = 0;
661 ret->nbstates = nbstates;
667 ctxt->nbStates = 0;
923 for (i = 0;i < ctxt->nbStates;i++)
1193 fprintf(output, "%d states:", ctxt->nbStates);
1199 for (i = 0;i < ctxt->nbStates; i++) {
1438 } else if (ctxt->nbStates >= ctxt->maxStates) {
1450 state->no = ctxt->nbStates;
1451 ctxt->states[ctxt->nbStates++] = state;
1864 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
1936 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
1957 for (statenr = ctxt->nbStates - 1;statenr >= 0;statenr--) {
2000 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2018 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2051 for (statenr = 1;statenr < ctxt->nbStates;statenr++) {
2062 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2663 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2705 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
3717 if ((target > 0) && (target <= comp->nbstates)) {
4240 if ((target > 0) && (target <= comp->nbstates) &&
4249 if ((target > 0) && (target <= comp->nbstates) &&
5428 fprintf(output, "%d states:", regexp->nbStates);
5430 for (i = 0;i < regexp->nbStates; i++) {
5528 for (i = 0;i < am->nbStates;i++)
5534 am->nbStates = comp->nbStates;
5561 for (i = 0;i < regexp->nbStates;i++)