Lines Matching defs:depth
362 * compute depth to root
1246 xmlXPathDebugDumpNode(FILE *output, xmlNodePtr cur, int depth) {
1250 for (i = 0;((i < depth) && (i < 25));i++)
1265 xmlDebugDumpAttr(output, (xmlAttrPtr)cur, depth);
1267 xmlDebugDumpOneNode(output, cur, depth);
1270 xmlXPathDebugDumpNodeList(FILE *output, xmlNodePtr cur, int depth) {
1275 for (i = 0;((i < depth) && (i < 25));i++)
1288 depth);
1293 xmlXPathDebugDumpNodeSet(FILE *output, xmlNodeSetPtr cur, int depth) {
1297 for (i = 0;((i < depth) && (i < 25));i++)
1313 xmlXPathDebugDumpNode(output, cur->nodeTab[i], depth + 1);
1319 xmlXPathDebugDumpValueTree(FILE *output, xmlNodeSetPtr cur, int depth) {
1323 for (i = 0;((i < depth) && (i < 25));i++)
1336 xmlXPathDebugDumpNodeList(output, cur->nodeTab[0]->children, depth + 1);
1340 xmlXPathDebugDumpLocationSet(FILE *output, xmlLocationSetPtr cur, int depth) {
1344 for (i = 0;((i < depth) && (i < 25));i++)
1358 xmlXPathDebugDumpObject(output, cur->locTab[i], depth + 1);
1367 * @depth: indentation level
1372 xmlXPathDebugDumpObject(FILE *output, xmlXPathObjectPtr cur, int depth) {
1378 for (i = 0;((i < depth) && (i < 25));i++)
1395 xmlXPathDebugDumpNodeSet(output, cur->nodesetval, depth);
1399 xmlXPathDebugDumpValueTree(output, cur->nodesetval, depth);
1431 xmlXPathDebugDumpNode(output, (xmlNodePtr) cur->user, depth + 1);
1443 depth + 1);
1452 depth + 1);
1459 depth + 1);
1467 (xmlLocationSetPtr) cur->user, depth);
1478 xmlXPathStepOpPtr op, int depth) {
1482 for (i = 0;((i < depth) && (i < 25));i++)
1648 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch1], depth + 1);
1650 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch2], depth + 1);
1657 * @depth: the indentation level.
1663 int depth) {
1669 for (i = 0;((i < depth) && (i < 25));i++)
1678 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[i], depth + 1);
2860 xmlXPathErrMemory(NULL, "XPath stack depth limit reached\n");
3342 * compute depth to root
14259 int ret, depth;
14280 printf("stream eval: depth %d from root %d\n", max_depth, from_root);
14368 depth = 0;
14399 if ((cur->children == NULL) || (depth >= max_depth)) {
14414 if ((cur->children != NULL) && (depth < max_depth)) {
14420 depth++;
14441 depth--;
14460 } while ((cur != NULL) && (depth >= 0));
