Lines Matching defs:depth
875 xmlXPathDebugDumpNode(FILE *output, xmlNodePtr cur, int depth) {
879 for (i = 0;((i < depth) && (i < 25));i++)
894 xmlDebugDumpAttr(output, (xmlAttrPtr)cur, depth);
896 xmlDebugDumpOneNode(output, cur, depth);
899 xmlXPathDebugDumpNodeList(FILE *output, xmlNodePtr cur, int depth) {
904 for (i = 0;((i < depth) && (i < 25));i++)
917 xmlDebugDumpOneNode(output, tmp, depth);
922 xmlXPathDebugDumpNodeSet(FILE *output, xmlNodeSetPtr cur, int depth) {
926 for (i = 0;((i < depth) && (i < 25));i++)
942 xmlXPathDebugDumpNode(output, cur->nodeTab[i], depth + 1);
948 xmlXPathDebugDumpValueTree(FILE *output, xmlNodeSetPtr cur, int depth) {
952 for (i = 0;((i < depth) && (i < 25));i++)
965 xmlXPathDebugDumpNodeList(output, cur->nodeTab[0]->children, depth + 1);
969 xmlXPathDebugDumpLocationSet(FILE *output, xmlLocationSetPtr cur, int depth) {
973 for (i = 0;((i < depth) && (i < 25));i++)
987 xmlXPathDebugDumpObject(output, cur->locTab[i], depth + 1);
996 * @depth: indentation level
1001 xmlXPathDebugDumpObject(FILE *output, xmlXPathObjectPtr cur, int depth) {
1007 for (i = 0;((i < depth) && (i < 25));i++)
1024 xmlXPathDebugDumpNodeSet(output, cur->nodesetval, depth);
1028 xmlXPathDebugDumpValueTree(output, cur->nodesetval, depth);
1060 xmlXPathDebugDumpNode(output, (xmlNodePtr) cur->user, depth + 1);
1072 depth + 1);
1081 depth + 1);
1088 depth + 1);
1096 (xmlLocationSetPtr) cur->user, depth);
1107 xmlXPathStepOpPtr op, int depth) {
1111 for (i = 0;((i < depth) && (i < 25));i++)
1277 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch1], depth + 1);
1279 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[op->ch2], depth + 1);
1286 * @depth: the indentation level.
1292 int depth) {
1298 for (i = 0;((i < depth) && (i < 25));i++)
1307 xmlXPathDebugDumpStepOp(output, comp, &comp->steps[i], depth + 1);
2955 * compute depth to root
3247 * compute depth to root
14156 int ret, depth;
14177 printf("stream eval: depth %d from root %d\n", max_depth, from_root);
14265 depth = 0;
14292 if ((cur->children == NULL) || (depth >= max_depth)) {
14306 if ((cur->children != NULL) && (depth < max_depth)) {
14312 depth++;
14333 depth--;
14352 } while ((cur != NULL) && (depth >= 0));
