Searched refs:nbstates (Results 1 - 5 of 5) sorted by relevance

/external/chromium_org/third_party/libxml/src/
H A Dpattern.c145 int nbstates; member in struct:_xmlStepStates
463 states->nbstates = 0;
466 else if (states->maxstates <= states->nbstates) {
476 states->states[states->nbstates].step = step;
477 states->states[states->nbstates++].node = node;
689 if (states.nbstates <= 0) {
693 states.nbstates--;
694 i = states.states[states.nbstates].step;
695 node = states.states[states.nbstates].node;
H A Dxmlregexp.c281 int nbstates; member in struct:_xmlRegexp
454 int i, j, nbstates = 0, nbatoms = 0; local
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));
574 transdata = (void **) xmlMalloc(nbstates * nbatoms *
578 nbstates * nbatoms * sizeof(void *));
627 for (i = 0;i < nbstates;
[all...]
/external/libxml2/
H A Dpattern.c148 int nbstates; member in struct:_xmlStepStates
467 states->nbstates = 0;
470 else if (states->maxstates <= states->nbstates) {
480 states->states[states->nbstates].step = step;
481 states->states[states->nbstates++].node = node;
693 if (states.nbstates <= 0) {
697 states.nbstates--;
698 i = states.states[states.nbstates].step;
699 node = states.states[states.nbstates].node;
H A Dxmlregexp.c285 int nbstates; member in struct:_xmlRegexp
458 int i, j, nbstates = 0, nbatoms = 0; local
482 stateRemap[i] = nbstates;
483 nbstates++;
489 printf("Final: %d states\n", nbstates);
543 transitions = (int *) xmlMalloc((nbstates + 1) *
552 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
578 transdata = (void **) xmlMalloc(nbstates * nbatoms *
582 nbstates * nbatoms * sizeof(void *));
631 for (i = 0;i < nbstates;
[all...]
/external/chromium_org/third_party/libxslt/libxslt/
H A Dpattern.c78 int nbstates; member in struct:_xsltStepStates
482 states->nbstates = 0;
485 else if (states->maxstates <= states->nbstates) {
499 states->states[states->nbstates].step = step;
500 states->states[states->nbstates++].node = node;
1180 if (states.nbstates <= 0) {
1184 states.nbstates--;
1185 i = states.states[states.nbstates].step;
1186 node = states.states[states.nbstates].node;

Completed in 6850 milliseconds