Searched refs:nbStep (Results 1 – 5 of 5) sorted by relevance
99 int nbStep; /* number of steps in the automata */ member167 int nbStep; member242 for (i = 0;i < comp->nbStep;i++) { in xmlFreePattern()347 if (comp->nbStep >= comp->maxStep) { in xmlPatternAdd()359 comp->steps[comp->nbStep].op = op; in xmlPatternAdd()360 comp->steps[comp->nbStep].value = value; in xmlPatternAdd()361 comp->steps[comp->nbStep].value2 = value2; in xmlPatternAdd()362 comp->nbStep++; in xmlPatternAdd()376 int j = comp->nbStep - 1;410 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR)) { in xmlReversePattern()[all …]
574 int nbStep; /* Number of steps in this expression */ member630 cur->nbStep = 0; in xmlXPathNewCompExpr()661 for (i = 0; i < comp->nbStep; i++) { in xmlXPathFreeCompExpr()673 for (i = 0; i < comp->nbStep; i++) { in xmlXPathFreeCompExpr()722 if (comp->nbStep >= comp->maxStep) { in xmlXPathCompExprAdd()735 comp->last = comp->nbStep; in xmlXPathCompExprAdd()736 comp->steps[comp->nbStep].rewriteType = 0; in xmlXPathCompExprAdd()737 comp->steps[comp->nbStep].ch1 = ch1; in xmlXPathCompExprAdd()738 comp->steps[comp->nbStep].ch2 = ch2; in xmlXPathCompExprAdd()739 comp->steps[comp->nbStep].op = op; in xmlXPathCompExprAdd()[all …]
102 int nbStep; /* number of steps in the automata */ member170 int nbStep; member245 for (i = 0;i < comp->nbStep;i++) { in xmlFreePattern()351 if (comp->nbStep >= comp->maxStep) { 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()366 comp->nbStep++; in xmlPatternAdd()380 int j = comp->nbStep - 1;414 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR)) { in xmlReversePattern()[all …]
652 int nbStep; /* Number of steps in this expression */ member708 cur->nbStep = 0; in xmlXPathNewCompExpr()739 for (i = 0; i < comp->nbStep; i++) { in xmlXPathFreeCompExpr()751 for (i = 0; i < comp->nbStep; i++) { in xmlXPathFreeCompExpr()800 if (comp->nbStep >= comp->maxStep) { in xmlXPathCompExprAdd()817 comp->last = comp->nbStep; in xmlXPathCompExprAdd()818 comp->steps[comp->nbStep].ch1 = ch1; in xmlXPathCompExprAdd()819 comp->steps[comp->nbStep].ch2 = ch2; in xmlXPathCompExprAdd()820 comp->steps[comp->nbStep].op = op; in xmlXPathCompExprAdd()821 comp->steps[comp->nbStep].value = value; in xmlXPathCompExprAdd()[all …]
109 int nbStep; member154 cur->nbStep = 0; in xsltNewCompMatch()186 for (i = 0;i < comp->nbStep;i++) { in xsltFreeCompMatch()234 for (ix = 0; ix < comp->nbStep; ix++) { in xsltNormalizeCompSteps()296 if (comp->nbStep >= comp->maxStep) { in xsltCompMatchAdd()311 comp->steps[comp->nbStep].op = op; in xsltCompMatchAdd()312 comp->steps[comp->nbStep].value = value; in xsltCompMatchAdd()313 comp->steps[comp->nbStep].value2 = value2; in xsltCompMatchAdd()314 comp->steps[comp->nbStep].value3 = NULL; in xsltCompMatchAdd()315 comp->steps[comp->nbStep].comp = NULL; in xsltCompMatchAdd()[all …]