Lines Matching defs:depth
575 int i, start = 0, depth = 0;
590 * Tree depth may change during truncate, or insert. If we're
592 * structure reflects the proper depth.
595 depth = le16_to_cpu(path_root_el(path)->l_tree_depth);
599 path->p_tree_depth = depth;
713 * Journal the buffer at depth idx. All idx>0 are extent_blocks,
1416 /* If this is our 1st tree depth shift, then last_eb_blk
1434 * leaf nodes. What we want to do is find the lowest tree depth
1515 * We might shift the tree depth in which case existing paths should
1518 * Tree depth after the grow is returned via *final_depth.
1528 int depth = le16_to_cpu(el->l_tree_depth);
1548 depth);
1558 depth++;
1559 if (depth == 1) {
1565 * back *last_eb_bh as the new leaf. At depth
1585 *final_depth = depth;
1724 "count = %u, tree depth = %u",
1765 "Owner %llu, left depth %u, right depth %u\n"
1801 "Owner %llu has empty extent list at depth %u\n",
1826 "Owner %llu has bad blkno in extent list at depth %u (index %d)\n",
2349 * The array is assumed to be large enough to hold an entire path (tree depth).
3916 "owner %llu, depth %u, count %u, next free %u, "
4149 * depth = 0, ocfs2_insert_at_leaf() is called directly.
4519 * depth. If we consider the root extent list to be the rightmost leaf node
4562 * - The current tree depth.
4588 * If we have tree depth, we read in the
4909 int ret = 0, depth;
4927 depth = le16_to_cpu(rightmost_el->l_tree_depth);
4928 if (depth) {
4937 &depth, last_eb_bh, meta_ac);
4947 insert.ins_tree_depth = depth;
5276 int ret, depth, credits;
5292 depth = path->p_tree_depth;
5293 if (depth > 0) {
5317 ret = ocfs2_grow_tree(handle, et, &depth, &last_eb_bh,
5329 insert.ins_tree_depth = depth;
7294 "extent record, depth %u\n", inode->i_ino,