Lines Matching defs:depth
955 xmlXPathDebugDumpNode(FILE *output, xmlNodePtr cur, int depth) {
959 for (i = 0;((i < depth) && (i < 25));i++)
974 xmlDebugDumpAttr(output, (xmlAttrPtr)cur, depth);
976 xmlDebugDumpOneNode(output, cur, depth);
979 xmlXPathDebugDumpNodeList(FILE *output, xmlNodePtr cur, int depth) {
984 for (i = 0;((i < depth) && (i < 25));i++)
997 xmlDebugDumpOneNode(output, tmp, depth);
1002 xmlXPathDebugDumpNodeSet(FILE *output, xmlNodeSetPtr cur, int depth) {
1006 for (i = 0;((i < depth) && (i < 25));i++)
1022 xmlXPathDebugDumpNode(output, cur->nodeTab[i], depth + 1);
1028 xmlXPathDebugDumpValueTree(FILE *output, xmlNodeSetPtr cur, int depth) {
1032 for (i = 0;((i < depth) && (i < 25));i++)
1045 xmlXPathDebugDumpNodeList(output, cur->nodeTab[0]->children, depth + 1);
1049 xmlXPathDebugDumpLocationSet(FILE *output, xmlLocationSetPtr cur, int depth) {
1053 for (i = 0;((i < depth) && (i < 25));i++)
1067 xmlXPathDebugDumpObject(output, cur->locTab[i], depth + 1);
1076 * @depth: indentation level
1081 xmlXPathDebugDumpObject(FILE *output, xmlXPathObjectPtr cur, int depth) {
1087 for (i = 0;((i < depth) && (i < 25));i++)
1104 xmlXPathDebugDumpNodeSet(output, cur->nodesetval, depth);
1108 xmlXPathDebugDumpValueTree(output, cur->nodesetval, depth);
1140 xmlXPathDebugDumpNode(output, (xmlNodePtr) cur->user, depth + 1);
1152 depth + 1);
1161 depth + 1);
1168 depth + 1);
1176 (xmlLocationSetPtr) cur->user, depth);
1187 xmlXPathStepOpPtr op, int depth) {
1191 for (i = 0;((i < depth) && (i < 25));i++)
1357 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch1], depth + 1);
1359 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch2], depth + 1);
1366 * @depth: the indentation level.
1372 int depth) {
1378 for (i = 0;((i < depth) && (i < 25));i++)
1387 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[i], depth + 1);
2569 xmlXPathErrMemory(NULL, "XPath stack depth limit reached\n");
3045 * compute depth to root
3337 * compute depth to root
14239 int ret, depth;
14260 printf("stream eval: depth %d from root %d\n", max_depth, from_root);
14348 depth = 0;
14379 if ((cur->children == NULL) || (depth >= max_depth)) {
14394 if ((cur->children != NULL) && (depth < max_depth)) {
14400 depth++;
14421 depth--;
14440 } while ((cur != NULL) && (depth >= 0));
