Searched refs:nbstates (Results 1 - 6 of 6) sorted by relevance
/external/chromium_org/third_party/libxml/src/ |
H A D | pattern.c | 145 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 D | xmlregexp.c | 281 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 D | pattern.c | 145 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 D | xmlregexp.c | 281 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/chromium_org/third_party/libxslt/libxslt/ |
H A D | pattern.c | 78 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;
|
/external/libxslt/libxslt/ |
H A D | pattern.c | 78 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 320 milliseconds