Lines Matching refs:nbState
319 int nbState; /* the number of states */
1012 ret->nbState = 0;
1026 ret->nbState = 0;
1058 if (states->nbState >= states->maxState) {
1074 states->tabState[states->nbState++] = state;
1098 if (states->nbState >= states->maxState) {
1114 for (i = 0; i < states->nbState; i++) {
1120 states->tabState[states->nbState++] = state;
1202 if ((ctxt->freeState != NULL) && (ctxt->freeState->nbState > 0)) {
1203 ctxt->freeState->nbState--;
1204 ret = ctxt->freeState->tabState[ctxt->freeState->nbState];
1284 if ((ctxt->freeState != NULL) && (ctxt->freeState->nbState > 0)) {
1285 ctxt->freeState->nbState--;
1286 ret = ctxt->freeState->tabState[ctxt->freeState->nbState];
8107 for (i = 0; i < ctxt->states->nbState; i++) {
8124 for (i = 0; i < ctxt->states->nbState; i++) {
9286 for (j = 0; j < ctxt->states->nbState; j++) {
9317 if (ctxt->states->nbState > 0) {
9324 ctxt->states->tabState[ctxt->states->nbState - 1];
9325 ctxt->states->tabState[ctxt->states->nbState - 1] = NULL;
9328 for (j = 0; j < ctxt->states->nbState ; j++) {
9550 (ctxt->states->nbState <= 0))
9553 for (i = 0; i < ctxt->states->nbState; i++) {
9586 (ctxt->states->nbState <= 0))
9590 if ((best >= 0) && (best < ctxt->states->nbState)) {
9806 for (i = 0; i < ctxt->states->nbState; i++) {
9823 for (i = 0; i < ctxt->states->nbState; i++) {
9863 for (i = 0; i < ctxt->states->nbState; i++) {
9879 for (i = 0; i < ctxt->states->nbState; i++) {
10002 for (j = 0; j < ctxt->states->nbState; j++) {
10015 base = res->nbState;
10019 for (i = 0; i < states->nbState; i++) {
10033 for (j = 0; j < ctxt->states->nbState;
10064 base = res->nbState;
10072 for (j = 0; j < ctxt->states->nbState; j++) {
10095 if (res->nbState - base == 1) {
10103 res->nbState - base);
10110 states->nbState = 0;
10111 for (i = base; i < res->nbState; i++)
10201 for (i = 0; i < ctxt->states->nbState; i++) {
10438 if ((ctxt->states == NULL) || (ctxt->states->nbState == 1)) {
10449 if ((ctxt->states != NULL) && (ctxt->states->nbState == 1)) {
10463 for (i = 0; i < states->nbState; i++) {
10495 for (k = 0; k < ctxt->states->nbState; k++)
10507 for (k = 0; k < ctxt->states->nbState; k++)
10521 states->nbState = j;
10588 for (i = 0; i < ctxt->states->nbState; i++) {
10694 for (k = 0; k < ctxt->freeState->nbState; k++) {
