Cross Reference: /external/libxml2/relaxng.c

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];
8232         for (i = 0; i < ctxt->states->nbState; i++) {
8249         for (i = 0; i < ctxt->states->nbState; i++) {
9443             for (j = 0; j < ctxt->states->nbState; j++) {
9474             if (ctxt->states->nbState > 0) {
9481 			ctxt->states->tabState[ctxt->states->nbState - 1];
9482                     ctxt->states->tabState[ctxt->states->nbState - 1] = NULL;
9483                     ctxt->states->nbState--;
9486             for (j = 0; j < ctxt->states->nbState ; j++) {
9713         (ctxt->states->nbState <= 0))
9716     for (i = 0; i < ctxt->states->nbState; i++) {
9749         (ctxt->states->nbState <= 0))
9753     if ((best >= 0) && (best < ctxt->states->nbState)) {
9969                     for (i = 0; i < ctxt->states->nbState; i++) {
9986                     for (i = 0; i < ctxt->states->nbState; i++) {
10026                     for (i = 0; i < ctxt->states->nbState; i++) {
10042                     for (i = 0; i < ctxt->states->nbState; i++) {
10165                     for (j = 0; j < ctxt->states->nbState; j++) {
10175                     base = res->nbState;
10179                         for (i = 0; i < states->nbState; i++) {
10193                                     for (j = 0; j < ctxt->states->nbState;
10221                             base = res->nbState;
10229                                 for (j = 0; j < ctxt->states->nbState; j++) {
10250                         if (res->nbState - base == 1) {
10258                                                     res->nbState - base);
10265                             states->nbState = 0;
10266                             for (i = base; i < res->nbState; i++)
10355                             for (i = 0; i < ctxt->states->nbState; i++) {
10592     if ((ctxt->states == NULL) || (ctxt->states->nbState == 1)) {
10603         if ((ctxt->states != NULL) && (ctxt->states->nbState == 1)) {
10617     for (i = 0; i < states->nbState; i++) {
10649                     for (k = 0; k < ctxt->states->nbState; k++)
10661                 for (k = 0; k < ctxt->states->nbState; k++)
10675         states->nbState = j;
10742         for (i = 0; i < ctxt->states->nbState; i++) {
10902         for (k = 0; k < ctxt->freeState->nbState; k++) {