Lines Matching defs:states
220 /* knowing states ponting to us can speed things up */
248 xmlRegStatePtr *states;
261 xmlRegStatePtr *states;
307 * A stack of rollback states
424 ret->states = ctxt->states;
450 * 1/ counting the effective number of states left
463 if (ret->states[i] != NULL) {
471 printf("Final: %d states\n", nbstates);
550 state = ret->states[i];
573 * states then it means the automata is not determinist and
624 if (ret->states != NULL) {
626 xmlRegFreeState(ret->states[i]);
627 xmlFree(ret->states);
629 ret->states = NULL;
650 ctxt->states = NULL;
828 if (ctxt->states != NULL) {
830 xmlRegFreeState(ctxt->states[i]);
831 xmlFree(ctxt->states);
1099 fprintf(output, "%d states:", ctxt->nbStates);
1106 xmlRegPrintState(output, ctxt->states[i]);
1337 ctxt->states = (xmlRegStatePtr *) xmlMalloc(ctxt->maxStates *
1339 if (ctxt->states == NULL) {
1347 tmp = (xmlRegStatePtr *) xmlRealloc(ctxt->states, ctxt->maxStates *
1354 ctxt->states = tmp;
1357 ctxt->states[ctxt->nbStates++] = state;
1622 from = ctxt->states[fromnr];
1625 to = ctxt->states[tonr];
1652 ctxt->states[newto],
1675 ctxt->states[newto],
1679 ctxt->states[newto], counter, -1);
1707 state = ctxt->states[statenr];
1731 tmp = ctxt->states[state->transTo[i]];
1739 xmlRegStateAddTransTo(ctxt, ctxt->states[newto],
1746 tmp = ctxt->states[i];
1759 ctxt->states[newto]->type = XML_REGEXP_FINAL_STATE;
1780 if (ctxt->states == NULL) return;
1789 * mark sink states too.
1792 state = ctxt->states[statenr];
1834 state = ctxt->states[statenr];
1849 * Use this pass to detect unreachable states too
1852 state = ctxt->states[statenr];
1856 state = ctxt->states[0];
1863 * Mark all states reachable from the current reachable state
1871 if (ctxt->states[newto] == NULL)
1873 if (ctxt->states[newto]->reached == XML_REGEXP_MARK_NORMAL) {
1874 ctxt->states[newto]->reached = XML_REGEXP_MARK_START;
1875 target = ctxt->states[newto];
1885 state = ctxt->states[statenr];
1896 state = ctxt->states[statenr];
1902 ctxt->states[statenr] = NULL;
1949 * pushing too many states when evaluating.
2429 res = xmlFARecurseDeterminism(ctxt, ctxt->states[t1->to],
2475 state = ctxt->states[statenr];
2507 * Check for all states that there aren't 2 transitions
2511 state = ctxt->states[statenr];
2546 ret = xmlFARecurseDeterminism(ctxt, ctxt->states[t1->to],
2997 exec->state = comp->states[0];
3078 xmlRegStatePtr to = comp->states[trans->to];
3209 exec->state = comp->states[trans->to];
3284 if ((comp->compact == NULL) && (comp->states == NULL))
3301 exec->state = comp->states[0];
3711 xmlRegStatePtr to = exec->comp->states[trans->to];
3806 if ((exec->comp->states[trans->to] != NULL) &&
3807 (exec->comp->states[trans->to]->type ==
3820 exec->state = exec->comp->states[trans->to];
4089 if ((exec->comp->states[trans->to] != NULL) &&
4090 (exec->comp->states[trans->to]->type !=
4116 if ((exec->comp->states[trans->to] != NULL) &&
4117 (exec->comp->states[trans->to]->type ==
4253 xmlRegStatePtr to = exec->comp->states[trans->to];
4331 exec->state = exec->comp->states[trans->to];
5243 fprintf(output, "%d states:", regexp->nbStates);
5246 xmlRegPrintState(output, regexp->states[i]);
5336 if (am->states != NULL) {
5340 xmlRegFreeState(am->states[i]);
5341 xmlFree(am->states);
5346 am->states = comp->states;
5350 am->states = NULL;
5369 if (regexp->states != NULL) {
5371 xmlRegFreeState(regexp->states[i]);
5372 xmlFree(regexp->states);