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()
246 if (comp->steps != NULL) { in xmlFreePatternInternal()
249 op = &comp->steps[i]; in xmlFreePatternInternal()
256 xmlFree(comp->steps); in xmlFreePatternInternal()
356 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlPatternAdd()
363 comp->steps = temp; in xmlPatternAdd()
366 comp->steps[comp->nbStep].op = op; in xmlPatternAdd()
367 comp->steps[comp->nbStep].value = value; in xmlPatternAdd()
368 comp->steps[comp->nbStep].value2 = value2; in xmlPatternAdd()
378 * reverse the two top steps.
389 tmp = comp->steps[i].value;
390 comp->steps[i].value = comp->steps[j].value;
391 comp->steps[j].value = tmp;
392 tmp = comp->steps[i].value2;
393 comp->steps[i].value2 = comp->steps[j].value2;
394 comp->steps[j].value2 = tmp;
395 op = comp->steps[i].op;
396 comp->steps[i].op = comp->steps[j].op;
397 comp->steps[j].op = op;
417 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR)) { in xmlReversePattern()
419 comp->steps[i].value = comp->steps[j].value; in xmlReversePattern()
420 comp->steps[i].value2 = comp->steps[j].value2; in xmlReversePattern()
421 comp->steps[i].op = comp->steps[j].op; in xmlReversePattern()
427 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlReversePattern()
434 comp->steps = temp; in xmlReversePattern()
442 tmp = comp->steps[i].value; in xmlReversePattern()
443 comp->steps[i].value = comp->steps[j].value; in xmlReversePattern()
444 comp->steps[j].value = tmp; in xmlReversePattern()
445 tmp = comp->steps[i].value2; in xmlReversePattern()
446 comp->steps[i].value2 = comp->steps[j].value2; in xmlReversePattern()
447 comp->steps[j].value2 = tmp; in xmlReversePattern()
448 op = comp->steps[i].op; in xmlReversePattern()
449 comp->steps[i].op = comp->steps[j].op; in xmlReversePattern()
450 comp->steps[j].op = op; in xmlReversePattern()
454 comp->steps[comp->nbStep].value = NULL; in xmlReversePattern()
455 comp->steps[comp->nbStep].value2 = NULL; in xmlReversePattern()
456 comp->steps[comp->nbStep++].op = XML_OP_END; in xmlReversePattern()
510 step = &comp->steps[i]; in xmlPatMatch()
622 step = &comp->steps[i]; in xmlPatMatch()
1381 * Process steps. in xmlCompileIDCXPathPath()
1439 printf("Stream: %d steps\n", stream->nbStep); in xmlDebugStreamComp()
1441 if (stream->steps[i].ns != NULL) { in xmlDebugStreamComp()
1442 printf("{%s}", stream->steps[i].ns); in xmlDebugStreamComp()
1444 if (stream->steps[i].name == NULL) { in xmlDebugStreamComp()
1447 printf("%s ", stream->steps[i].name); in xmlDebugStreamComp()
1449 if (stream->steps[i].flags & XML_STREAM_STEP_ROOT) in xmlDebugStreamComp()
1451 if (stream->steps[i].flags & XML_STREAM_STEP_DESC) in xmlDebugStreamComp()
1453 if (stream->steps[i].flags & XML_STREAM_STEP_FINAL) in xmlDebugStreamComp()
1477 if (ctxt->comp->steps[ctxt->states[2 * i]].flags & in xmlDebugStreamCtxt()
1488 * @size: the number of expected steps
1508 cur->steps = (xmlStreamStepPtr) xmlMalloc(size * sizeof(xmlStreamStep)); in xmlNewStreamComp()
1509 if (cur->steps == NULL) { in xmlNewStreamComp()
1529 if (comp->steps != NULL) in xmlFreeStreamComp()
1530 xmlFree(comp->steps); in xmlFreeStreamComp()
1554 cur = (xmlStreamStepPtr) xmlRealloc(comp->steps, in xmlStreamCompAddStep()
1561 comp->steps = cur; in xmlStreamCompAddStep()
1564 cur = &comp->steps[comp->nbStep++]; in xmlStreamCompAddStep()
1586 if ((comp == NULL) || (comp->steps == NULL)) in xmlStreamCompile()
1592 (comp->steps[0].op == XML_OP_ELEM) && in xmlStreamCompile()
1593 (comp->steps[0].value == NULL) && in xmlStreamCompile()
1594 (comp->steps[0].value2 == NULL)) { in xmlStreamCompile()
1598 /* Note that the stream will have no steps in this case. */ in xmlStreamCompile()
1617 step = comp->steps[i]; in xmlStreamCompile()
1675 stream->steps[prevs].flags |= XML_STREAM_STEP_IN_SET; in xmlStreamCompile()
1735 if ((stream->steps[0].flags & XML_STREAM_STEP_DESC) == 0) in xmlStreamCompile()
1736 stream->steps[0].flags |= XML_STREAM_STEP_DESC; in xmlStreamCompile()
1741 stream->steps[s].flags |= XML_STREAM_STEP_FINAL; in xmlStreamCompile()
1743 stream->steps[0].flags |= XML_STREAM_STEP_ROOT; in xmlStreamCompile()
1889 (comp->steps[0].nodeType == XML_STREAM_ANY_NODE) && in xmlStreamPushInternal()
1890 (comp->steps[0].flags & XML_STREAM_STEP_DESC)) in xmlStreamPushInternal()
1897 } else if (comp->steps[0].flags & XML_STREAM_STEP_ROOT) { in xmlStreamPushInternal()
1995 desc = comp->steps[stepNr].flags & XML_STREAM_STEP_DESC; in xmlStreamPushInternal()
2002 step = comp->steps[stepNr]; in xmlStreamPushInternal()
2098 step = comp->steps[0]; in xmlStreamPushInternal()
2560 if (comp->stream->steps[i].flags & XML_STREAM_STEP_DESC) in xmlPatternMaxDepth()