Lines Matching defs:states
227 /* knowing states ponting to us can speed things up */
255 xmlRegStatePtr *states;
268 xmlRegStatePtr *states;
314 * A stack of rollback states
431 ret->states = ctxt->states;
457 * 1/ counting the effective number of states left
470 if (ret->states[i] != NULL) {
478 printf("Final: %d states\n", nbstates);
557 state = ret->states[i];
580 * states then it means the automata is not determinist and
631 if (ret->states != NULL) {
633 xmlRegFreeState(ret->states[i]);
634 xmlFree(ret->states);
636 ret->states = NULL;
657 ctxt->states = NULL;
911 if (ctxt->states != NULL) {
913 xmlRegFreeState(ctxt->states[i]);
914 xmlFree(ctxt->states);
1182 fprintf(output, "%d states:", ctxt->nbStates);
1189 xmlRegPrintState(output, ctxt->states[i]);
1420 ctxt->states = (xmlRegStatePtr *) xmlMalloc(ctxt->maxStates *
1422 if (ctxt->states == NULL) {
1430 tmp = (xmlRegStatePtr *) xmlRealloc(ctxt->states, ctxt->maxStates *
1437 ctxt->states = tmp;
1440 ctxt->states[ctxt->nbStates++] = state;
1600 * to avoid explosion in the number of states in the
1764 from = ctxt->states[fromnr];
1767 to = ctxt->states[tonr];
1794 ctxt->states[newto],
1817 ctxt->states[newto],
1821 ctxt->states[newto], counter, -1);
1849 state = ctxt->states[statenr];
1875 tmp = ctxt->states[state->transTo[i]];
1884 ctxt->states[newto],
1891 ctxt->states[newto]->type = XML_REGEXP_FINAL_STATE;
1913 if (ctxt->states == NULL) return;
1917 * states.
1921 state = ctxt->states[statenr];
1927 ctxt->states[statenr] = NULL;
1936 * Mark sink states too.
1937 * Process from the latests states backward to the start when
1942 state = ctxt->states[statenr];
1985 state = ctxt->states[statenr];
2000 * Use this pass to detect unreachable states too
2003 state = ctxt->states[statenr];
2007 state = ctxt->states[0];
2014 * Mark all states reachable from the current reachable state
2022 if (ctxt->states[newto] == NULL)
2024 if (ctxt->states[newto]->reached == XML_REGEXP_MARK_NORMAL) {
2025 ctxt->states[newto]->reached = XML_REGEXP_MARK_START;
2026 target = ctxt->states[newto];
2036 state = ctxt->states[statenr];
2047 state = ctxt->states[statenr];
2053 ctxt->states[statenr] = NULL;
2100 * pushing too many states when evaluating.
2580 res = xmlFARecurseDeterminism(ctxt, ctxt->states[t1->to],
2626 state = ctxt->states[statenr];
2658 * Check for all states that there aren't 2 transitions
2662 state = ctxt->states[statenr];
2697 ret = xmlFARecurseDeterminism(ctxt, ctxt->states[t1->to],
3149 exec->state = comp->states[0];
3231 xmlRegStatePtr to = comp->states[trans->to];
3380 exec->state = comp->states[trans->to];
3455 if ((comp->compact == NULL) && (comp->states == NULL))
3472 exec->state = comp->states[0];
3882 xmlRegStatePtr to = exec->comp->states[trans->to];
3977 if ((exec->comp->states[trans->to] != NULL) &&
3978 (exec->comp->states[trans->to]->type ==
3991 exec->state = exec->comp->states[trans->to];
4260 if ((exec->comp->states[trans->to] != NULL) &&
4261 (exec->comp->states[trans->to]->type !=
4287 if ((exec->comp->states[trans->to] != NULL) &&
4288 (exec->comp->states[trans->to]->type ==
4424 xmlRegStatePtr to = exec->comp->states[trans->to];
4502 exec->state = exec->comp->states[trans->to];
5364 fprintf(output, "%d states:", regexp->nbStates);
5367 xmlRegPrintState(output, regexp->states[i]);
5461 if (am->states != NULL) {
5465 xmlRegFreeState(am->states[i]);
5466 xmlFree(am->states);
5471 am->states = comp->states;
5475 am->states = NULL;
5494 if (regexp->states != NULL) {
5496 xmlRegFreeState(regexp->states[i]);
5497 xmlFree(regexp->states);