Cross Reference: /external/libxml2/xpath.c

Lines Matching defs:ch1
931     int ch1;			/* First child */
1074  * @ch1: first child index
1088 xmlXPathCompExprAdd(xmlXPathCompExprPtr comp, int ch1, int ch2,
1109     comp->steps[comp->nbStep].ch1 = ch1;
1159     tmp = op->ch1;
1160     op->ch1 = op->ch2;
1177 #define PUSH_BINARY_EXPR(op, ch1, ch2, val, val2)			\
1178 xmlXPathCompExprAdd(ctxt->comp, (ch1), (ch2), (op),			\
1647     if (op->ch1 >= 0)
1648 	xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch1], depth + 1);
11669     if (op->ch1 != -1) {
11674 	if (comp->steps[op->ch1].op != XPATH_OP_PREDICATE) {
11680 	    &comp->steps[op->ch1], set, contextSize, hasNsNodes);
11827     if (op->ch1 != -1) {
11829 	if (comp->steps[op->ch1].op != XPATH_OP_PREDICATE) {
11835 	    &comp->steps[op->ch1], set, contextSize, hasNsNodes);
12031     * If not -1, then ch1 will point to:
12262     *   ROOT                               -- op->ch1
12264     *     PREDICATE                          -- predOp->ch1 = [parent::bar]
12281 	    if (predOp->ch1 != -1) {
12285 		predOp = &ctxt->comp->steps[predOp->ch1];
12734                 xmlXPathCompOpEvalFirst(ctxt, &comp->steps[op->ch1],
12777             if (op->ch1 != -1)
12778                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
12787             if (op->ch1 != -1)
12788                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
12796                 if (op->ch1 == -1)
12799                 total = xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
12811             if (op->ch1 != -1)
12813                     xmlXPathCompOpEvalFirst(ctxt, &comp->steps[op->ch1],
12866                 xmlXPathCompOpEvalLast(ctxt, &comp->steps[op->ch1], last);
12912             if (op->ch1 != -1)
12913                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
12922             if (op->ch1 != -1)
12923                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
12931                 if (op->ch1 == -1)
12934                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
12946             if (op->ch1 != -1)
12948                     xmlXPathCompOpEvalLast(ctxt, &comp->steps[op->ch1],
12981     if ((op->ch1 != -1) && (op->ch2 != -1) &&
12982 	(comp->steps[op->ch1].op == XPATH_OP_SORT) &&
12984 	int f = comp->steps[op->ch2].ch1;
12997 		    &comp->steps[op->ch1],
13022     if (op->ch1 != -1)
13023 	total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13291             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13317             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13343             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13362             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13378             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13404             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13424             total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13453             if (op->ch1 != -1)
13454                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13463             if (op->ch1 != -1)
13464                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13472                 if (op->ch1 == -1)
13475                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13489                 if (op->ch1 != -1)
13491                         xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13527                 if (op->ch1 != -1) {
13529                         xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13597             if (op->ch1 != -1) {
13598                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13627                 if ((op->ch1 != -1) && (op->ch2 != -1) &&
13638                     ((comp->steps[op->ch1].op == XPATH_OP_SORT) || /* 18 */
13639 		     (comp->steps[op->ch1].op == XPATH_OP_FILTER)) && /* 17 */
13641 		    (comp->steps[op->ch1].op == XPATH_OP_SORT) &&
13653                                                     &comp->steps[op->ch1],
13671                 if ((op->ch1 != -1) && (op->ch2 != -1) &&
13672                     (comp->steps[op->ch1].op == XPATH_OP_SORT) &&
13674                     int f = comp->steps[op->ch2].ch1;
13687                                                    &comp->steps[op->ch1],
13721                 if (op->ch1 != -1)
13723                         xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13976             if (op->ch1 != -1)
13977                 total += xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
13997                 if (op->ch1 != -1)
13999                         xmlXPathCompOpEval(ctxt, &comp->steps[op->ch1]);
14186             if (op->ch1 != -1) {
14187 		op = &ctxt->comp->steps[op->ch1];
14192 	    if (op->ch1 == -1)
14195             xmlXPathCompOpEval(ctxt, &ctxt->comp->steps[op->ch1]);
14743         (op->ch1 != -1) &&
14746         xmlXPathStepOpPtr prevop = &comp->steps[op->ch1];
14768                     op->ch1   = prevop->ch1;
14778                     op->ch1   = prevop->ch1;
14788     if (op->ch1 != -1)
14789         xmlXPathOptimizeExpression(comp, &comp->steps[op->ch1]);