HomeSort by relevance Sort by last modified time
    Searched refs:nbStep (Results 1 - 2 of 2) sorted by null

  /external/libxml2/
pattern.c 102 int nbStep; /* number of steps in the automata */
170 int nbStep;
245 for (i = 0;i < comp->nbStep;i++) {
351 if (comp->nbStep >= comp->maxStep) {
363 comp->steps[comp->nbStep].op = op;
364 comp->steps[comp->nbStep].value = value;
365 comp->steps[comp->nbStep].value2 = value2;
366 comp->nbStep++;
380 int j = comp->nbStep - 1;
414 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR))
    [all...]
xpath.c 943 int nbStep; /* Number of steps in this expression */
999 cur->nbStep = 0;
1030 for (i = 0; i < comp->nbStep; i++) {
1042 for (i = 0; i < comp->nbStep; i++) {
1091 if (comp->nbStep >= comp->maxStep) {
1108 comp->last = comp->nbStep;
1109 comp->steps[comp->nbStep].ch1 = ch1;
1110 comp->steps[comp->nbStep].ch2 = ch2;
1111 comp->steps[comp->nbStep].op = op;
1112 comp->steps[comp->nbStep].value = value
    [all...]

Completed in 72 milliseconds