Cross Reference: /vbox/src/libs/libxml2-2.6.31/xmlregexp.c

Lines Matching refs: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;
1598 		 * to avoid explosion in the number of states in the
1743     from = ctxt->states[fromnr];
1746     to = ctxt->states[tonr];
1773 					ctxt->states[newto], 
1796 				    ctxt->states[newto], 
1800 				    ctxt->states[newto], counter, -1);
1828 	state = ctxt->states[statenr];
1854 		    tmp = ctxt->states[state->transTo[i]];
1863 			    			ctxt->states[newto],
1870 		    ctxt->states[newto]->type = XML_REGEXP_FINAL_STATE;
1892     if (ctxt->states == NULL) return;
1896      * states.
1900 	state = ctxt->states[statenr];
1906 	    ctxt->states[statenr] = NULL;
1915      * Mark sink states too.
1916      * Process from the latests states backward to the start when
1921 	state = ctxt->states[statenr];
1964 	    state = ctxt->states[statenr];
1979      * Use this pass to detect unreachable states too
1982 	state = ctxt->states[statenr];
1986     state = ctxt->states[0];
1993 	 * Mark all states reachable from the current reachable state
2001 		if (ctxt->states[newto] == NULL)
2003 		if (ctxt->states[newto]->reached == XML_REGEXP_MARK_NORMAL) {
2004 		    ctxt->states[newto]->reached = XML_REGEXP_MARK_START;
2005 		    target = ctxt->states[newto];
2015 		state = ctxt->states[statenr];
2026 	state = ctxt->states[statenr];
2032 	    ctxt->states[statenr] = NULL;
2079 	 * pushing too many states when evaluating.
2559 	    res = xmlFARecurseDeterminism(ctxt, ctxt->states[t1->to],
2605 	state = ctxt->states[statenr];
2637      * Check for all states that there aren't 2 transitions
2641 	state = ctxt->states[statenr];
2676 		    ret = xmlFARecurseDeterminism(ctxt, ctxt->states[t1->to],
3128     exec->state = comp->states[0];
3209 		    xmlRegStatePtr to = comp->states[trans->to];
3358 		exec->state = comp->states[trans->to];
3433     if ((comp->compact == NULL) && (comp->states == NULL))
3450 	exec->state = comp->states[0];
3860 		    xmlRegStatePtr to = exec->comp->states[trans->to];
3955                 if ((exec->comp->states[trans->to] != NULL) &&
3956 		    (exec->comp->states[trans->to]->type ==
3969 		exec->state = exec->comp->states[trans->to];
4238                 if ((exec->comp->states[trans->to] != NULL) &&
4239 		    (exec->comp->states[trans->to]->type !=
4265                 if ((exec->comp->states[trans->to] != NULL) &&
4266 		    (exec->comp->states[trans->to]->type ==
4402 		    xmlRegStatePtr to = exec->comp->states[trans->to];
4480 		exec->state = exec->comp->states[trans->to];
5406     fprintf(output, "%d states:", regexp->nbStates);
5409 	xmlRegPrintState(output, regexp->states[i]);
5503     if (am->states != NULL) {
5507 	    xmlRegFreeState(am->states[i]);
5508 	xmlFree(am->states);
5513     am->states = comp->states;
5517     am->states = NULL;
5536     if (regexp->states != NULL) {
5538 	    xmlRegFreeState(regexp->states[i]);
5539 	xmlFree(regexp->states);