Lines Matching refs:depth
369 * Allocate the array used to hold the widest values per depth
701 static void compute_bounding_box_subtree (tree, w, depth)
704 int depth;
715 if (depth >= tree->tree.n_largest) {
717 &tree->tree.n_largest, depth + 1);
720 if (tree->tree.largest[depth] < newwidth)
721 tree->tree.largest[depth] = newwidth;
743 compute_bounding_box_subtree (tree, child, depth + 1);
815 static void arrange_subtree (tree, w, depth, x, y)
818 int depth;
867 newx = x + tree->tree.largest[depth];
868 if (depth > 0) newx += tree->tree.hpad;
872 newy = y + tree->tree.largest[depth];
873 if (depth > 0) newy += tree->tree.vpad;
882 arrange_subtree (tree, child, depth + 1, newx, newy);
954 * Do a depth-first search computing the width and height of the bounding