Lines Matching defs:leaf
154 /* path points to leaf/index in inode body */
181 /* path points to leaf/index in inode body */
382 /* leaf entries */
570 * If this is a leaf block, cache all of its entries
624 * If this is a leaf block or we've reached the end of
690 ext_debug(inode, "Displaying leaf extents\n");
721 ext_debug(inode, "move %d:%llu:[%d]%d in new leaf %llu\n",
824 * this leaf is empty:
825 * we get such a leaf in split/add case
957 /* if not an empty leaf */
1050 * - allocates all needed blocks (new leaf and all intermediate index blocks)
1079 /* if current leaf will be split, then we should use
1087 ext_debug(inode, "leaf will be split."
1088 " next leaf starts at %d\n",
1092 ext_debug(inode, "leaf will be added."
1093 " next leaf starts at %d\n",
1114 ext_debug(inode, "allocate %d blocks for indexes/leaf\n", depth - at);
1123 /* initialize new leaf */
1148 /* move remainder of path[depth] to the new leaf */
1181 /* correct old leaf */
1309 * - moves top-level data (index block or leaf) into the new block
1348 /* move top-level index/leaf into new block */
1395 * finds empty index and adds new leaf.
1422 * entry: create all needed subtree and add new leaf */
1590 /* next allocated block in this leaf */
1657 /* leaf */
1673 * returns first allocated block from next leaf or EXT_MAX_BLOCKS
1682 /* zero-tree has no leaf blocks at all */
1702 * if leaf gets modified and modified extent is first in the leaf,
1730 /* we correct tree if first leaf got modified only */
1841 * an extent tree with a single extent tree leaf block into the inode.
1966 * creating new leaf in the no-space case.
2076 /* probably next leaf has space for us? */
2082 ext_debug(inode, "next leaf block - %u\n", next);
2090 ext_debug(inode, "next leaf isn't full(%d)\n",
2095 ext_debug(inode, "next leaf has no free space(%d,%d)\n",
2100 * There is no free space in the found leaf.
2101 * We're gonna add a new leaf in the tree.
2120 /* there is no extent in this leaf, create first one */
2121 ext_debug(inode, "first extent in the leaf: %u:%llu:[%d]%d\n",
2309 ext4_fsblk_t leaf;
2314 leaf = ext4_idx_pblock(path->p_idx);
2333 ext_debug(inode, "index is empty, remove it, free block %llu\n", leaf);
2334 trace_ext4_ext_rm_idx(inode, leaf);
2336 ext4_free_blocks(handle, inode, NULL, leaf, 1,
2368 /* probably there is space in leaf? */
2373 * There are some space in the leaf tree, no
2374 * need to account for leaf block credit
2390 * How many index/leaf blocks need to change/allocate to add @extents extents?
2393 * index/leaf need to be changed in case of the tree split.
2585 * @path: The path to the leaf
2612 ext_debug(inode, "truncate since %u in leaf to %u\n", start, end);
2682 * 3 for leaf, sb, and inode plus 2 (bmap and group
2732 * we need to remove it from the leaf
2767 * the leaf, free the partial cluster if it isn't shared with the
2788 /* if this leaf is free, then we should
2962 /* this is leaf block */
3245 * path may lead to new leaf, not to original leaf any more
3369 * result in split of original leaf or extent zeroout.
4119 * consistent leaf must not be empty;
4304 /* try to insert new extent into found leaf and return */
5051 /* leaf + sb + inode */
5714 /* ext4_split_extent_at() may result in leaf extent split,
5740 /* ext4_split_extent_at() may result in leaf extent split,
5835 * A consistent leaf must not be empty. This situation is possible,