Lines Matching full:steps
131 int nbStep; /* number of steps in the automata */
132 int maxStep; /* allocated number of steps */
133 xmlStreamStepPtr steps; /* the array of steps */ member
201 xmlStepOpPtr steps; /* ops for computation */ member
243 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp)); in xmlNewPattern()
244 if (cur->steps == NULL) { in xmlNewPattern()
272 if (comp->steps != NULL) { in xmlFreePattern()
275 op = &comp->steps[i]; in xmlFreePattern()
282 xmlFree(comp->steps); in xmlFreePattern()
382 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlPatternAdd()
389 comp->steps = temp; in xmlPatternAdd()
392 comp->steps[comp->nbStep].op = op; in xmlPatternAdd()
393 comp->steps[comp->nbStep].value = value; in xmlPatternAdd()
394 comp->steps[comp->nbStep].value2 = value2; in xmlPatternAdd()
404 * reverse the two top steps.
415 tmp = comp->steps[i].value;
416 comp->steps[i].value = comp->steps[j].value;
417 comp->steps[j].value = tmp;
418 tmp = comp->steps[i].value2;
419 comp->steps[i].value2 = comp->steps[j].value2;
420 comp->steps[j].value2 = tmp;
421 op = comp->steps[i].op;
422 comp->steps[i].op = comp->steps[j].op;
423 comp->steps[j].op = op;
443 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR)) { in xmlReversePattern()
445 comp->steps[i].value = comp->steps[j].value; in xmlReversePattern()
446 comp->steps[i].value2 = comp->steps[j].value2; in xmlReversePattern()
447 comp->steps[i].op = comp->steps[j].op; in xmlReversePattern()
453 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlReversePattern()
460 comp->steps = temp; in xmlReversePattern()
468 tmp = comp->steps[i].value; in xmlReversePattern()
469 comp->steps[i].value = comp->steps[j].value; in xmlReversePattern()
470 comp->steps[j].value = tmp; in xmlReversePattern()
471 tmp = comp->steps[i].value2; in xmlReversePattern()
472 comp->steps[i].value2 = comp->steps[j].value2; in xmlReversePattern()
473 comp->steps[j].value2 = tmp; in xmlReversePattern()
474 op = comp->steps[i].op; in xmlReversePattern()
475 comp->steps[i].op = comp->steps[j].op; in xmlReversePattern()
476 comp->steps[j].op = op; in xmlReversePattern()
480 comp->steps[comp->nbStep].value = NULL; in xmlReversePattern()
481 comp->steps[comp->nbStep].value2 = NULL; in xmlReversePattern()
482 comp->steps[comp->nbStep++].op = XML_OP_END; in xmlReversePattern()
536 step = &comp->steps[i]; in xmlPatMatch()
648 step = &comp->steps[i]; in xmlPatMatch()
1407 * Process steps. in xmlCompileIDCXPathPath()
1465 printf("Stream: %d steps\n", stream->nbStep); in xmlDebugStreamComp()
1467 if (stream->steps[i].ns != NULL) { in xmlDebugStreamComp()
1468 printf("{%s}", stream->steps[i].ns); in xmlDebugStreamComp()
1470 if (stream->steps[i].name == NULL) { in xmlDebugStreamComp()
1473 printf("%s ", stream->steps[i].name); in xmlDebugStreamComp()
1475 if (stream->steps[i].flags & XML_STREAM_STEP_ROOT) in xmlDebugStreamComp()
1477 if (stream->steps[i].flags & XML_STREAM_STEP_DESC) in xmlDebugStreamComp()
1479 if (stream->steps[i].flags & XML_STREAM_STEP_FINAL) in xmlDebugStreamComp()
1503 if (ctxt->comp->steps[ctxt->states[2 * i]].flags & in xmlDebugStreamCtxt()
1514 * @size: the number of expected steps
1534 cur->steps = (xmlStreamStepPtr) xmlMalloc(size * sizeof(xmlStreamStep)); in xmlNewStreamComp()
1535 if (cur->steps == NULL) { in xmlNewStreamComp()
1555 if (comp->steps != NULL) in xmlFreeStreamComp()
1556 xmlFree(comp->steps); in xmlFreeStreamComp()
1580 cur = (xmlStreamStepPtr) xmlRealloc(comp->steps, in xmlStreamCompAddStep()
1587 comp->steps = cur; in xmlStreamCompAddStep()
1590 cur = &comp->steps[comp->nbStep++]; in xmlStreamCompAddStep()
1612 if ((comp == NULL) || (comp->steps == NULL)) in xmlStreamCompile()
1618 (comp->steps[0].op == XML_OP_ELEM) && in xmlStreamCompile()
1619 (comp->steps[0].value == NULL) && in xmlStreamCompile()
1620 (comp->steps[0].value2 == NULL)) { in xmlStreamCompile()
1624 /* Note that the stream will have no steps in this case. */ in xmlStreamCompile()
1643 step = comp->steps[i]; in xmlStreamCompile()
1701 stream->steps[prevs].flags |= XML_STREAM_STEP_IN_SET; in xmlStreamCompile()
1761 if ((stream->steps[0].flags & XML_STREAM_STEP_DESC) == 0) in xmlStreamCompile()
1762 stream->steps[0].flags |= XML_STREAM_STEP_DESC; in xmlStreamCompile()
1767 stream->steps[s].flags |= XML_STREAM_STEP_FINAL; in xmlStreamCompile()
1769 stream->steps[0].flags |= XML_STREAM_STEP_ROOT; in xmlStreamCompile()
1915 (comp->steps[0].nodeType == XML_STREAM_ANY_NODE) && in xmlStreamPushInternal()
1916 (comp->steps[0].flags & XML_STREAM_STEP_DESC)) in xmlStreamPushInternal()
1923 } else if (comp->steps[0].flags & XML_STREAM_STEP_ROOT) { in xmlStreamPushInternal()
2021 desc = comp->steps[stepNr].flags & XML_STREAM_STEP_DESC; in xmlStreamPushInternal()
2028 step = comp->steps[stepNr]; in xmlStreamPushInternal()
2124 step = comp->steps[0]; in xmlStreamPushInternal()
2586 if (comp->stream->steps[i].flags & XML_STREAM_STEP_DESC) in xmlPatternMaxDepth()