Lines Matching refs:nbstates
256 int nbStates;
270 int nbStates;
281 int nbstates;
436 ret->nbStates = ctxt->nbStates;
454 int i, j, nbstates = 0, nbatoms = 0;
470 stateRemap = xmlMalloc(ret->nbStates * sizeof(int));
476 for (i = 0;i < ret->nbStates;i++) {
478 stateRemap[i] = nbstates;
479 nbstates++;
485 printf("Final: %d states\n", nbstates);
539 transitions = (int *) xmlMalloc((nbstates + 1) *
548 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
556 for (i = 0;i < ret->nbStates;i++) {
574 transdata = (void **) xmlMalloc(nbstates * nbatoms *
578 nbstates * nbatoms * sizeof(void *));
627 for (i = 0;i < nbstates;i++) {
639 for (i = 0;i < ret->nbStates;i++)
644 ret->nbStates = 0;
657 ret->nbstates = nbstates;
663 ctxt->nbStates = 0;
919 for (i = 0;i < ctxt->nbStates;i++)
1189 fprintf(output, "%d states:", ctxt->nbStates);
1195 for (i = 0;i < ctxt->nbStates; i++) {
1434 } else if (ctxt->nbStates >= ctxt->maxStates) {
1446 state->no = ctxt->nbStates;
1447 ctxt->states[ctxt->nbStates++] = state;
1860 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
1932 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
1953 for (statenr = ctxt->nbStates - 1;statenr >= 0;statenr--) {
1996 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2014 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2047 for (statenr = 1;statenr < ctxt->nbStates;statenr++) {
2058 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2655 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
2697 for (statenr = 0;statenr < ctxt->nbStates;statenr++) {
3707 if ((target > 0) && (target <= comp->nbstates)) {
4230 if ((target > 0) && (target <= comp->nbstates) &&
4239 if ((target > 0) && (target <= comp->nbstates) &&
5414 fprintf(output, "%d states:", regexp->nbStates);
5416 for (i = 0;i < regexp->nbStates; i++) {
5514 for (i = 0;i < am->nbStates;i++)
5520 am->nbStates = comp->nbStates;
5547 for (i = 0;i < regexp->nbStates;i++)