Lines Matching full:steps
102 int nbStep; /* number of steps in the automata */
103 int maxStep; /* allocated number of steps */
104 xmlStreamStepPtr steps; /* the array of steps */ member
172 xmlStepOpPtr steps; /* ops for computation */ member
214 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp)); in xmlNewPattern()
215 if (cur->steps == NULL) { in xmlNewPattern()
243 if (comp->steps != NULL) { in xmlFreePattern()
246 op = &comp->steps[i]; in xmlFreePattern()
253 xmlFree(comp->steps); in xmlFreePattern()
353 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlPatternAdd()
360 comp->steps = temp; in xmlPatternAdd()
363 comp->steps[comp->nbStep].op = op; in xmlPatternAdd()
364 comp->steps[comp->nbStep].value = value; in xmlPatternAdd()
365 comp->steps[comp->nbStep].value2 = value2; in xmlPatternAdd()
375 * reverse the two top steps.
386 tmp = comp->steps[i].value;
387 comp->steps[i].value = comp->steps[j].value;
388 comp->steps[j].value = tmp;
389 tmp = comp->steps[i].value2;
390 comp->steps[i].value2 = comp->steps[j].value2;
391 comp->steps[j].value2 = tmp;
392 op = comp->steps[i].op;
393 comp->steps[i].op = comp->steps[j].op;
394 comp->steps[j].op = op;
414 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR)) { in xmlReversePattern()
416 comp->steps[i].value = comp->steps[j].value; in xmlReversePattern()
417 comp->steps[i].value2 = comp->steps[j].value2; in xmlReversePattern()
418 comp->steps[i].op = comp->steps[j].op; in xmlReversePattern()
424 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlReversePattern()
431 comp->steps = temp; in xmlReversePattern()
439 tmp = comp->steps[i].value; in xmlReversePattern()
440 comp->steps[i].value = comp->steps[j].value; in xmlReversePattern()
441 comp->steps[j].value = tmp; in xmlReversePattern()
442 tmp = comp->steps[i].value2; in xmlReversePattern()
443 comp->steps[i].value2 = comp->steps[j].value2; in xmlReversePattern()
444 comp->steps[j].value2 = tmp; in xmlReversePattern()
445 op = comp->steps[i].op; in xmlReversePattern()
446 comp->steps[i].op = comp->steps[j].op; in xmlReversePattern()
447 comp->steps[j].op = op; in xmlReversePattern()
451 comp->steps[comp->nbStep].value = NULL; in xmlReversePattern()
452 comp->steps[comp->nbStep].value2 = NULL; in xmlReversePattern()
453 comp->steps[comp->nbStep++].op = XML_OP_END; in xmlReversePattern()
507 step = &comp->steps[i]; in xmlPatMatch()
619 step = &comp->steps[i]; in xmlPatMatch()
1378 * Process steps. in xmlCompileIDCXPathPath()
1436 printf("Stream: %d steps\n", stream->nbStep); in xmlDebugStreamComp()
1438 if (stream->steps[i].ns != NULL) { in xmlDebugStreamComp()
1439 printf("{%s}", stream->steps[i].ns); in xmlDebugStreamComp()
1441 if (stream->steps[i].name == NULL) { in xmlDebugStreamComp()
1444 printf("%s ", stream->steps[i].name); in xmlDebugStreamComp()
1446 if (stream->steps[i].flags & XML_STREAM_STEP_ROOT) in xmlDebugStreamComp()
1448 if (stream->steps[i].flags & XML_STREAM_STEP_DESC) in xmlDebugStreamComp()
1450 if (stream->steps[i].flags & XML_STREAM_STEP_FINAL) in xmlDebugStreamComp()
1474 if (ctxt->comp->steps[ctxt->states[2 * i]].flags & in xmlDebugStreamCtxt()
1485 * @size: the number of expected steps
1505 cur->steps = (xmlStreamStepPtr) xmlMalloc(size * sizeof(xmlStreamStep)); in xmlNewStreamComp()
1506 if (cur->steps == NULL) { in xmlNewStreamComp()
1526 if (comp->steps != NULL) in xmlFreeStreamComp()
1527 xmlFree(comp->steps); in xmlFreeStreamComp()
1551 cur = (xmlStreamStepPtr) xmlRealloc(comp->steps, in xmlStreamCompAddStep()
1558 comp->steps = cur; in xmlStreamCompAddStep()
1561 cur = &comp->steps[comp->nbStep++]; in xmlStreamCompAddStep()
1583 if ((comp == NULL) || (comp->steps == NULL)) in xmlStreamCompile()
1589 (comp->steps[0].op == XML_OP_ELEM) && in xmlStreamCompile()
1590 (comp->steps[0].value == NULL) && in xmlStreamCompile()
1591 (comp->steps[0].value2 == NULL)) { in xmlStreamCompile()
1595 /* Note that the stream will have no steps in this case. */ in xmlStreamCompile()
1614 step = comp->steps[i]; in xmlStreamCompile()
1672 stream->steps[prevs].flags |= XML_STREAM_STEP_IN_SET; in xmlStreamCompile()
1732 if ((stream->steps[0].flags & XML_STREAM_STEP_DESC) == 0) in xmlStreamCompile()
1733 stream->steps[0].flags |= XML_STREAM_STEP_DESC; in xmlStreamCompile()
1738 stream->steps[s].flags |= XML_STREAM_STEP_FINAL; in xmlStreamCompile()
1740 stream->steps[0].flags |= XML_STREAM_STEP_ROOT; in xmlStreamCompile()
1886 (comp->steps[0].nodeType == XML_STREAM_ANY_NODE) && in xmlStreamPushInternal()
1887 (comp->steps[0].flags & XML_STREAM_STEP_DESC)) in xmlStreamPushInternal()
1894 } else if (comp->steps[0].flags & XML_STREAM_STEP_ROOT) { in xmlStreamPushInternal()
1992 desc = comp->steps[stepNr].flags & XML_STREAM_STEP_DESC; in xmlStreamPushInternal()
1999 step = comp->steps[stepNr]; in xmlStreamPushInternal()
2095 step = comp->steps[0]; in xmlStreamPushInternal()
2557 if (comp->stream->steps[i].flags & XML_STREAM_STEP_DESC) in xmlPatternMaxDepth()