Lines Matching refs:nbState
321 int nbState; /* the number of states */
1015 ret->nbState = 0;
1029 ret->nbState = 0;
1061 if (states->nbState >= states->maxState) {
1077 states->tabState[states->nbState++] = state;
1101 if (states->nbState >= states->maxState) {
1117 for (i = 0; i < states->nbState; i++) {
1123 states->tabState[states->nbState++] = state;
1205 if ((ctxt->freeState != NULL) && (ctxt->freeState->nbState > 0)) {
1206 ctxt->freeState->nbState--;
1207 ret = ctxt->freeState->tabState[ctxt->freeState->nbState];
1287 if ((ctxt->freeState != NULL) && (ctxt->freeState->nbState > 0)) {
1288 ctxt->freeState->nbState--;
1289 ret = ctxt->freeState->tabState[ctxt->freeState->nbState];
8239 for (i = 0; i < ctxt->states->nbState; i++) {
8256 for (i = 0; i < ctxt->states->nbState; i++) {
9467 for (j = 0; j < ctxt->states->nbState; j++) {
9498 if (ctxt->states->nbState > 0) {
9505 ctxt->states->tabState[ctxt->states->nbState - 1];
9506 ctxt->states->tabState[ctxt->states->nbState - 1] = NULL;
9507 ctxt->states->nbState--;
9510 for (j = 0; j < ctxt->states->nbState ; j++) {
9737 (ctxt->states->nbState <= 0))
9740 for (i = 0; i < ctxt->states->nbState; i++) {
9773 (ctxt->states->nbState <= 0))
9777 if ((best >= 0) && (best < ctxt->states->nbState)) {
9993 for (i = 0; i < ctxt->states->nbState; i++) {
10010 for (i = 0; i < ctxt->states->nbState; i++) {
10050 for (i = 0; i < ctxt->states->nbState; i++) {
10066 for (i = 0; i < ctxt->states->nbState; i++) {
10189 for (j = 0; j < ctxt->states->nbState; j++) {
10199 base = res->nbState;
10203 for (i = 0; i < states->nbState; i++) {
10217 for (j = 0; j < ctxt->states->nbState;
10245 base = res->nbState;
10253 for (j = 0; j < ctxt->states->nbState; j++) {
10274 if (res->nbState - base == 1) {
10282 res->nbState - base);
10289 states->nbState = 0;
10290 for (i = base; i < res->nbState; i++)
10379 for (i = 0; i < ctxt->states->nbState; i++) {
10616 if ((ctxt->states == NULL) || (ctxt->states->nbState == 1)) {
10627 if ((ctxt->states != NULL) && (ctxt->states->nbState == 1)) {
10641 for (i = 0; i < states->nbState; i++) {
10673 for (k = 0; k < ctxt->states->nbState; k++)
10685 for (k = 0; k < ctxt->states->nbState; k++)
10699 states->nbState = j;
10766 for (i = 0; i < ctxt->states->nbState; i++) {
10926 for (k = 0; k < ctxt->freeState->nbState; k++) {
