Searched refs:nbStep (Results 1 – 2 of 2) sorted by relevance
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 …]
932 int nbStep; /* Number of steps in this expression */ member990 cur->nbStep = 0; in xmlXPathNewCompExpr()1021 for (i = 0; i < comp->nbStep; i++) { in xmlXPathFreeCompExpr()1033 for (i = 0; i < comp->nbStep; i++) { in xmlXPathFreeCompExpr()1082 if (comp->nbStep >= comp->maxStep) { in xmlXPathCompExprAdd()1099 comp->last = comp->nbStep; in xmlXPathCompExprAdd()1100 comp->steps[comp->nbStep].ch1 = ch1; in xmlXPathCompExprAdd()1101 comp->steps[comp->nbStep].ch2 = ch2; in xmlXPathCompExprAdd()1102 comp->steps[comp->nbStep].op = op; in xmlXPathCompExprAdd()1103 comp->steps[comp->nbStep].value = value; in xmlXPathCompExprAdd()[all …]