Lines Matching refs:depth
77 static void iterateTestsWithLevel( const TestNode *root, int depth,
318 * @param depth The depth of this tree (0=root)
319 * @param nodeList an array of MAXTESTS depth that's used for keeping track of where we are. nodeList[depth] points to the 'parent' at depth depth.
323 int depth,
335 if(depth<2) {
342 /* record the current root node, and increment depth. */
343 nodeList[depth++] = root;
344 /* depth is now the depth of root's children. */
347 for ( i=0;i<(depth-1);i++ )
355 INDENT_LEVEL = depth-1;
378 INDENT_LEVEL = depth; /* depth of subitems */
392 INDENT_LEVEL = depth-1; /* depth of root */
410 int spaces = FLAG_INDENT-(depth-1);
417 int spaces = FLAG_INDENT-(strlen(root->name)+depth);
430 INDENT_LEVEL = depth-1; /* root */
437 INDENT_LEVEL = depth;
443 INDENT_LEVEL=depth-1;
445 INDENT_LEVEL=depth;
448 iterateTestsWithLevel ( root->child, depth, nodeList, mode );
451 INDENT_LEVEL=depth-1;
453 if((depth>1) && (ERROR_COUNT > myERROR_COUNT)) {
455 } else if((GLOBAL_PRINT_COUNT-myGLOBAL_PRINT_COUNT)>PAGE_SIZE_LIMIT || (depth<1)) {
466 depth--;
469 if(depth<2) {
479 if ( depth != 0 ) { /* DO NOT iterate over siblings of the root. TODO: why not? */
480 iterateTestsWithLevel ( root->sibling, depth, nodeList, mode );
