Home
last modified time | relevance | path

Searched refs:nbstates (Results 1 – 2 of 2) sorted by relevance

/external/libxml2/
Dpattern.c148 int nbstates; member
467 states->nbstates = 0; in xmlPatPushState()
470 else if (states->maxstates <= states->nbstates) { in xmlPatPushState()
480 states->states[states->nbstates].step = step; in xmlPatPushState()
481 states->states[states->nbstates++].node = node; in xmlPatPushState()
693 if (states.nbstates <= 0) { in xmlPatMatch()
697 states.nbstates--; in xmlPatMatch()
698 i = states.states[states.nbstates].step; in xmlPatMatch()
699 node = states.states[states.nbstates].node; in xmlPatMatch()
Dxmlregexp.c285 int nbstates; member
458 int i, j, nbstates = 0, nbatoms = 0; in xmlRegEpxFromParse() local
482 stateRemap[i] = nbstates; in xmlRegEpxFromParse()
483 nbstates++; in xmlRegEpxFromParse()
489 printf("Final: %d states\n", nbstates); in xmlRegEpxFromParse()
543 transitions = (int *) xmlMalloc((nbstates + 1) * in xmlRegEpxFromParse()
552 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int)); in xmlRegEpxFromParse()
578 transdata = (void **) xmlMalloc(nbstates * nbatoms * in xmlRegEpxFromParse()
582 nbstates * nbatoms * sizeof(void *)); in xmlRegEpxFromParse()
631 for (i = 0;i < nbstates;i++) { in xmlRegEpxFromParse()
[all …]