Lines Matching defs:depth
117 // 3) The maximum depth in the node graph from the beginning of the block
706 int d1 = depth(s1);
707 int d2 = depth(s2);
722 int shal_depth = depth(shallow);
723 assert(shal_depth <= depth(deep), "must be");
730 if (shal_depth < depth(pred) && !independent_path(shallow, pred, dp+1)) {
1655 // Do a depth first walk over out edges
1741 // Compute max depth for expressions from beginning of block
1751 int d_orig = depth(n);
1756 d_in = MAX2(d_in, depth(pred));
2212 char* SuperWord::blank(uint depth) {
2214 assert(depth < 101, "too deep");
2215 for (uint i = 0; i < depth; i++) blanks[i] = ' ';
2216 blanks[depth] = '\0';