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

  /external/chromium_org/third_party/libxml/src/
pattern.c 99 int nbStep; /* number of steps in the automata */
167 int nbStep;
242 for (i = 0;i < comp->nbStep;i++) {
347 if (comp->nbStep >= comp->maxStep) {
359 comp->steps[comp->nbStep].op = op;
360 comp->steps[comp->nbStep].value = value;
361 comp->steps[comp->nbStep].value2 = value2;
362 comp->nbStep++;
376 int j = comp->nbStep - 1;
410 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR))
    [all...]
xpath.c 574 int nbStep; /* Number of steps in this expression */
630 cur->nbStep = 0;
661 for (i = 0; i < comp->nbStep; i++) {
673 for (i = 0; i < comp->nbStep; i++) {
722 if (comp->nbStep >= comp->maxStep) {
735 comp->last = comp->nbStep;
736 comp->steps[comp->nbStep].rewriteType = 0;
737 comp->steps[comp->nbStep].ch1 = ch1;
738 comp->steps[comp->nbStep].ch2 = ch2;
739 comp->steps[comp->nbStep].op = op
    [all...]
  /external/libxml2/
pattern.c 99 int nbStep; /* number of steps in the automata */
167 int nbStep;
242 for (i = 0;i < comp->nbStep;i++) {
347 if (comp->nbStep >= comp->maxStep) {
359 comp->steps[comp->nbStep].op = op;
360 comp->steps[comp->nbStep].value = value;
361 comp->steps[comp->nbStep].value2 = value2;
362 comp->nbStep++;
376 int j = comp->nbStep - 1;
410 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR))
    [all...]
xpath.c 575 int nbStep; /* Number of steps in this expression */
631 cur->nbStep = 0;
662 for (i = 0; i < comp->nbStep; i++) {
674 for (i = 0; i < comp->nbStep; i++) {
723 if (comp->nbStep >= comp->maxStep) {
736 comp->last = comp->nbStep;
737 comp->steps[comp->nbStep].rewriteType = 0;
738 comp->steps[comp->nbStep].ch1 = ch1;
739 comp->steps[comp->nbStep].ch2 = ch2;
740 comp->steps[comp->nbStep].op = op
    [all...]
  /external/chromium_org/third_party/libxslt/libxslt/
pattern.c 109 int nbStep;
154 cur->nbStep = 0;
186 for (i = 0;i < comp->nbStep;i++) {
234 for (ix = 0; ix < comp->nbStep; ix++) {
296 if (comp->nbStep >= comp->maxStep) {
311 comp->steps[comp->nbStep].op = op;
312 comp->steps[comp->nbStep].value = value;
313 comp->steps[comp->nbStep].value2 = value2;
314 comp->steps[comp->nbStep].value3 = NULL;
315 comp->steps[comp->nbStep].comp = NULL
    [all...]
  /external/libxslt/libxslt/
pattern.c 109 int nbStep;
154 cur->nbStep = 0;
186 for (i = 0;i < comp->nbStep;i++) {
234 for (ix = 0; ix < comp->nbStep; ix++) {
296 if (comp->nbStep >= comp->maxStep) {
311 comp->steps[comp->nbStep].op = op;
312 comp->steps[comp->nbStep].value = value;
313 comp->steps[comp->nbStep].value2 = value2;
314 comp->steps[comp->nbStep].value3 = NULL;
315 comp->steps[comp->nbStep].comp = NULL
    [all...]

Completed in 44 milliseconds