Lines Matching refs:nbState
320 int nbState; /* the number of states */
1014 ret->nbState = 0;
1028 ret->nbState = 0;
1060 if (states->nbState >= states->maxState) {
1076 states->tabState[states->nbState++] = state;
1100 if (states->nbState >= states->maxState) {
1116 for (i = 0; i < states->nbState; i++) {
1122 states->tabState[states->nbState++] = state;
1204 if ((ctxt->freeState != NULL) && (ctxt->freeState->nbState > 0)) {
1205 ctxt->freeState->nbState--;
1206 ret = ctxt->freeState->tabState[ctxt->freeState->nbState];
1286 if ((ctxt->freeState != NULL) && (ctxt->freeState->nbState > 0)) {
1287 ctxt->freeState->nbState--;
1288 ret = ctxt->freeState->tabState[ctxt->freeState->nbState];
8231 for (i = 0; i < ctxt->states->nbState; i++) {
8248 for (i = 0; i < ctxt->states->nbState; i++) {
9442 for (j = 0; j < ctxt->states->nbState; j++) {
9473 if (ctxt->states->nbState > 0) {
9480 ctxt->states->tabState[ctxt->states->nbState - 1];
9481 ctxt->states->tabState[ctxt->states->nbState - 1] = NULL;
9482 ctxt->states->nbState--;
9485 for (j = 0; j < ctxt->states->nbState ; j++) {
9712 (ctxt->states->nbState <= 0))
9715 for (i = 0; i < ctxt->states->nbState; i++) {
9748 (ctxt->states->nbState <= 0))
9752 if ((best >= 0) && (best < ctxt->states->nbState)) {
9968 for (i = 0; i < ctxt->states->nbState; i++) {
9985 for (i = 0; i < ctxt->states->nbState; i++) {
10025 for (i = 0; i < ctxt->states->nbState; i++) {
10041 for (i = 0; i < ctxt->states->nbState; i++) {
10164 for (j = 0; j < ctxt->states->nbState; j++) {
10174 base = res->nbState;
10178 for (i = 0; i < states->nbState; i++) {
10192 for (j = 0; j < ctxt->states->nbState;
10220 base = res->nbState;
10228 for (j = 0; j < ctxt->states->nbState; j++) {
10249 if (res->nbState - base == 1) {
10257 res->nbState - base);
10264 states->nbState = 0;
10265 for (i = base; i < res->nbState; i++)
10354 for (i = 0; i < ctxt->states->nbState; i++) {
10591 if ((ctxt->states == NULL) || (ctxt->states->nbState == 1)) {
10602 if ((ctxt->states != NULL) && (ctxt->states->nbState == 1)) {
10616 for (i = 0; i < states->nbState; i++) {
10648 for (k = 0; k < ctxt->states->nbState; k++)
10660 for (k = 0; k < ctxt->states->nbState; k++)
10674 states->nbState = j;
10741 for (i = 0; i < ctxt->states->nbState; i++) {
10901 for (k = 0; k < ctxt->freeState->nbState; k++) {
