1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
6 * Extent allocs and frees
8 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
27 #include <linux/types.h>
28 #include <linux/slab.h>
29 #include <linux/highmem.h>
30 #include <linux/swap.h>
31 #include <linux/quotaops.h>
33 #define MLOG_MASK_PREFIX ML_DISK_ALLOC
34 #include <cluster/masklog.h>
40 #include "blockcheck.h"
42 #include "extent_map.h"
45 #include "localalloc.h"
53 #include "buffer_head_io.h"
57 * Operations for a specific extent tree type.
59 * To implement an on-disk btree (extent tree) type in ocfs2, add
60 * an ocfs2_extent_tree_operations structure and the matching
61 * ocfs2_init_<thingy>_extent_tree() function. That's pretty much it
62 * for the allocation portion of the extent tree.
64 struct ocfs2_extent_tree_operations {
66 * last_eb_blk is the block number of the right most leaf extent
67 * block. Most on-disk structures containing an extent tree store
68 * this value for fast access. The ->eo_set_last_eb_blk() and
69 * ->eo_get_last_eb_blk() operations access this value. They are
72 void (*eo_set_last_eb_blk)(struct ocfs2_extent_tree *et,
74 u64 (*eo_get_last_eb_blk)(struct ocfs2_extent_tree *et);
77 * The on-disk structure usually keeps track of how many total
78 * clusters are stored in this extent tree. This function updates
79 * that value. new_clusters is the delta, and must be
80 * added to the total. Required.
82 void (*eo_update_clusters)(struct ocfs2_extent_tree *et,
86 * If ->eo_insert_check() exists, it is called before rec is
87 * inserted into the extent tree. It is optional.
89 int (*eo_insert_check)(struct ocfs2_extent_tree *et,
90 struct ocfs2_extent_rec *rec);
91 int (*eo_sanity_check)(struct ocfs2_extent_tree *et);
94 * --------------------------------------------------------------
95 * The remaining are internal to ocfs2_extent_tree and don't have
100 * ->eo_fill_root_el() takes et->et_object and sets et->et_root_el.
103 void (*eo_fill_root_el)(struct ocfs2_extent_tree *et);
106 * ->eo_fill_max_leaf_clusters sets et->et_max_leaf_clusters if
107 * it exists. If it does not, et->et_max_leaf_clusters is set
108 * to 0 (unlimited). Optional.
110 void (*eo_fill_max_leaf_clusters)(struct ocfs2_extent_tree *et);
115 * Pre-declare ocfs2_dinode_et_ops so we can use it as a sanity check
118 static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et);
119 static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
121 static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
123 static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
124 struct ocfs2_extent_rec *rec);
125 static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et);
126 static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et);
127 static struct ocfs2_extent_tree_operations ocfs2_dinode_et_ops = {
128 .eo_set_last_eb_blk = ocfs2_dinode_set_last_eb_blk,
129 .eo_get_last_eb_blk = ocfs2_dinode_get_last_eb_blk,
130 .eo_update_clusters = ocfs2_dinode_update_clusters,
131 .eo_insert_check = ocfs2_dinode_insert_check,
132 .eo_sanity_check = ocfs2_dinode_sanity_check,
133 .eo_fill_root_el = ocfs2_dinode_fill_root_el,
136 static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
139 struct ocfs2_dinode *di = et->et_object;
141 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
142 di->i_last_eb_blk = cpu_to_le64(blkno);
145 static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et)
147 struct ocfs2_dinode *di = et->et_object;
149 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
150 return le64_to_cpu(di->i_last_eb_blk);
153 static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
156 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
157 struct ocfs2_dinode *di = et->et_object;
159 le32_add_cpu(&di->i_clusters, clusters);
160 spin_lock(&oi->ip_lock);
161 oi->ip_clusters = le32_to_cpu(di->i_clusters);
162 spin_unlock(&oi->ip_lock);
165 static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
166 struct ocfs2_extent_rec *rec)
168 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
169 struct ocfs2_super *osb = OCFS2_SB(oi->vfs_inode.i_sb);
171 BUG_ON(oi->ip_dyn_features & OCFS2_INLINE_DATA_FL);
172 mlog_bug_on_msg(!ocfs2_sparse_alloc(osb) &&
173 (oi->ip_clusters != le32_to_cpu(rec->e_cpos)),
174 "Device %s, asking for sparse allocation: inode %llu, "
175 "cpos %u, clusters %u\n",
177 (unsigned long long)oi->ip_blkno,
178 rec->e_cpos, oi->ip_clusters);
183 static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et)
185 struct ocfs2_dinode *di = et->et_object;
187 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
188 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
193 static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et)
195 struct ocfs2_dinode *di = et->et_object;
197 et->et_root_el = &di->id2.i_list;
201 static void ocfs2_xattr_value_fill_root_el(struct ocfs2_extent_tree *et)
203 struct ocfs2_xattr_value_buf *vb = et->et_object;
205 et->et_root_el = &vb->vb_xv->xr_list;
208 static void ocfs2_xattr_value_set_last_eb_blk(struct ocfs2_extent_tree *et,
211 struct ocfs2_xattr_value_buf *vb = et->et_object;
213 vb->vb_xv->xr_last_eb_blk = cpu_to_le64(blkno);
216 static u64 ocfs2_xattr_value_get_last_eb_blk(struct ocfs2_extent_tree *et)
218 struct ocfs2_xattr_value_buf *vb = et->et_object;
220 return le64_to_cpu(vb->vb_xv->xr_last_eb_blk);
223 static void ocfs2_xattr_value_update_clusters(struct ocfs2_extent_tree *et,
226 struct ocfs2_xattr_value_buf *vb = et->et_object;
228 le32_add_cpu(&vb->vb_xv->xr_clusters, clusters);
231 static struct ocfs2_extent_tree_operations ocfs2_xattr_value_et_ops = {
232 .eo_set_last_eb_blk = ocfs2_xattr_value_set_last_eb_blk,
233 .eo_get_last_eb_blk = ocfs2_xattr_value_get_last_eb_blk,
234 .eo_update_clusters = ocfs2_xattr_value_update_clusters,
235 .eo_fill_root_el = ocfs2_xattr_value_fill_root_el,
238 static void ocfs2_xattr_tree_fill_root_el(struct ocfs2_extent_tree *et)
240 struct ocfs2_xattr_block *xb = et->et_object;
242 et->et_root_el = &xb->xb_attrs.xb_root.xt_list;
245 static void ocfs2_xattr_tree_fill_max_leaf_clusters(struct ocfs2_extent_tree *et)
247 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
248 et->et_max_leaf_clusters =
249 ocfs2_clusters_for_bytes(sb, OCFS2_MAX_XATTR_TREE_LEAF_SIZE);
252 static void ocfs2_xattr_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
255 struct ocfs2_xattr_block *xb = et->et_object;
256 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
258 xt->xt_last_eb_blk = cpu_to_le64(blkno);
261 static u64 ocfs2_xattr_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
263 struct ocfs2_xattr_block *xb = et->et_object;
264 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
266 return le64_to_cpu(xt->xt_last_eb_blk);
269 static void ocfs2_xattr_tree_update_clusters(struct ocfs2_extent_tree *et,
272 struct ocfs2_xattr_block *xb = et->et_object;
274 le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, clusters);
277 static struct ocfs2_extent_tree_operations ocfs2_xattr_tree_et_ops = {
278 .eo_set_last_eb_blk = ocfs2_xattr_tree_set_last_eb_blk,
279 .eo_get_last_eb_blk = ocfs2_xattr_tree_get_last_eb_blk,
280 .eo_update_clusters = ocfs2_xattr_tree_update_clusters,
281 .eo_fill_root_el = ocfs2_xattr_tree_fill_root_el,
282 .eo_fill_max_leaf_clusters = ocfs2_xattr_tree_fill_max_leaf_clusters,
285 static void ocfs2_dx_root_set_last_eb_blk(struct ocfs2_extent_tree *et,
288 struct ocfs2_dx_root_block *dx_root = et->et_object;
290 dx_root->dr_last_eb_blk = cpu_to_le64(blkno);
293 static u64 ocfs2_dx_root_get_last_eb_blk(struct ocfs2_extent_tree *et)
295 struct ocfs2_dx_root_block *dx_root = et->et_object;
297 return le64_to_cpu(dx_root->dr_last_eb_blk);
300 static void ocfs2_dx_root_update_clusters(struct ocfs2_extent_tree *et,
303 struct ocfs2_dx_root_block *dx_root = et->et_object;
305 le32_add_cpu(&dx_root->dr_clusters, clusters);
308 static int ocfs2_dx_root_sanity_check(struct ocfs2_extent_tree *et)
310 struct ocfs2_dx_root_block *dx_root = et->et_object;
312 BUG_ON(!OCFS2_IS_VALID_DX_ROOT(dx_root));
317 static void ocfs2_dx_root_fill_root_el(struct ocfs2_extent_tree *et)
319 struct ocfs2_dx_root_block *dx_root = et->et_object;
321 et->et_root_el = &dx_root->dr_list;
324 static struct ocfs2_extent_tree_operations ocfs2_dx_root_et_ops = {
325 .eo_set_last_eb_blk = ocfs2_dx_root_set_last_eb_blk,
326 .eo_get_last_eb_blk = ocfs2_dx_root_get_last_eb_blk,
327 .eo_update_clusters = ocfs2_dx_root_update_clusters,
328 .eo_sanity_check = ocfs2_dx_root_sanity_check,
329 .eo_fill_root_el = ocfs2_dx_root_fill_root_el,
332 static void __ocfs2_init_extent_tree(struct ocfs2_extent_tree *et,
334 struct buffer_head *bh,
335 ocfs2_journal_access_func access,
337 struct ocfs2_extent_tree_operations *ops)
341 et->et_ci = INODE_CACHE(inode);
342 et->et_root_journal_access = access;
344 obj = (void *)bh->b_data;
347 et->et_ops->eo_fill_root_el(et);
348 if (!et->et_ops->eo_fill_max_leaf_clusters)
349 et->et_max_leaf_clusters = 0;
351 et->et_ops->eo_fill_max_leaf_clusters(et);
354 void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et,
356 struct buffer_head *bh)
358 __ocfs2_init_extent_tree(et, inode, bh, ocfs2_journal_access_di,
359 NULL, &ocfs2_dinode_et_ops);
362 void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et,
364 struct buffer_head *bh)
366 __ocfs2_init_extent_tree(et, inode, bh, ocfs2_journal_access_xb,
367 NULL, &ocfs2_xattr_tree_et_ops);
370 void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et,
372 struct ocfs2_xattr_value_buf *vb)
374 __ocfs2_init_extent_tree(et, inode, vb->vb_bh, vb->vb_access, vb,
375 &ocfs2_xattr_value_et_ops);
378 void ocfs2_init_dx_root_extent_tree(struct ocfs2_extent_tree *et,
380 struct buffer_head *bh)
382 __ocfs2_init_extent_tree(et, inode, bh, ocfs2_journal_access_dr,
383 NULL, &ocfs2_dx_root_et_ops);
386 static inline void ocfs2_et_set_last_eb_blk(struct ocfs2_extent_tree *et,
389 et->et_ops->eo_set_last_eb_blk(et, new_last_eb_blk);
392 static inline u64 ocfs2_et_get_last_eb_blk(struct ocfs2_extent_tree *et)
394 return et->et_ops->eo_get_last_eb_blk(et);
397 static inline void ocfs2_et_update_clusters(struct ocfs2_extent_tree *et,
400 et->et_ops->eo_update_clusters(et, clusters);
403 static inline int ocfs2_et_root_journal_access(handle_t *handle,
404 struct ocfs2_extent_tree *et,
407 return et->et_root_journal_access(handle, et->et_ci, et->et_root_bh,
411 static inline int ocfs2_et_insert_check(struct ocfs2_extent_tree *et,
412 struct ocfs2_extent_rec *rec)
416 if (et->et_ops->eo_insert_check)
417 ret = et->et_ops->eo_insert_check(et, rec);
421 static inline int ocfs2_et_sanity_check(struct ocfs2_extent_tree *et)
425 if (et->et_ops->eo_sanity_check)
426 ret = et->et_ops->eo_sanity_check(et);
430 static void ocfs2_free_truncate_context(struct ocfs2_truncate_context *tc);
431 static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
432 struct ocfs2_extent_block *eb);
435 * Structures which describe a path through a btree, and functions to
438 * The idea here is to be as generic as possible with the tree
441 struct ocfs2_path_item {
442 struct buffer_head *bh;
443 struct ocfs2_extent_list *el;
446 #define OCFS2_MAX_PATH_DEPTH 5
450 ocfs2_journal_access_func p_root_access;
451 struct ocfs2_path_item p_node[OCFS2_MAX_PATH_DEPTH];
454 #define path_root_bh(_path) ((_path)->p_node[0].bh)
455 #define path_root_el(_path) ((_path)->p_node[0].el)
456 #define path_root_access(_path)((_path)->p_root_access)
457 #define path_leaf_bh(_path) ((_path)->p_node[(_path)->p_tree_depth].bh)
458 #define path_leaf_el(_path) ((_path)->p_node[(_path)->p_tree_depth].el)
459 #define path_num_items(_path) ((_path)->p_tree_depth + 1)
461 static int ocfs2_find_path(struct ocfs2_caching_info *ci,
462 struct ocfs2_path *path, u32 cpos);
463 static void ocfs2_adjust_rightmost_records(struct inode *inode,
465 struct ocfs2_path *path,
466 struct ocfs2_extent_rec *insert_rec);
468 * Reset the actual path elements so that we can re-use the structure
469 * to build another path. Generally, this involves freeing the buffer
472 static void ocfs2_reinit_path(struct ocfs2_path *path, int keep_root)
474 int i, start = 0, depth = 0;
475 struct ocfs2_path_item *node;
480 for(i = start; i < path_num_items(path); i++) {
481 node = &path->p_node[i];
489 * Tree depth may change during truncate, or insert. If we're
490 * keeping the root extent list, then make sure that our path
491 * structure reflects the proper depth.
494 depth = le16_to_cpu(path_root_el(path)->l_tree_depth);
496 path_root_access(path) = NULL;
498 path->p_tree_depth = depth;
501 static void ocfs2_free_path(struct ocfs2_path *path)
504 ocfs2_reinit_path(path, 0);
510 * All the elements of src into dest. After this call, src could be freed
511 * without affecting dest.
513 * Both paths should have the same root. Any non-root elements of dest
516 static void ocfs2_cp_path(struct ocfs2_path *dest, struct ocfs2_path *src)
520 BUG_ON(path_root_bh(dest) != path_root_bh(src));
521 BUG_ON(path_root_el(dest) != path_root_el(src));
522 BUG_ON(path_root_access(dest) != path_root_access(src));
524 ocfs2_reinit_path(dest, 1);
526 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
527 dest->p_node[i].bh = src->p_node[i].bh;
528 dest->p_node[i].el = src->p_node[i].el;
530 if (dest->p_node[i].bh)
531 get_bh(dest->p_node[i].bh);
536 * Make the *dest path the same as src and re-initialize src path to
539 static void ocfs2_mv_path(struct ocfs2_path *dest, struct ocfs2_path *src)
543 BUG_ON(path_root_bh(dest) != path_root_bh(src));
544 BUG_ON(path_root_access(dest) != path_root_access(src));
546 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
547 brelse(dest->p_node[i].bh);
549 dest->p_node[i].bh = src->p_node[i].bh;
550 dest->p_node[i].el = src->p_node[i].el;
552 src->p_node[i].bh = NULL;
553 src->p_node[i].el = NULL;
558 * Insert an extent block at given index.
560 * This will not take an additional reference on eb_bh.
562 static inline void ocfs2_path_insert_eb(struct ocfs2_path *path, int index,
563 struct buffer_head *eb_bh)
565 struct ocfs2_extent_block *eb = (struct ocfs2_extent_block *)eb_bh->b_data;
568 * Right now, no root bh is an extent block, so this helps
569 * catch code errors with dinode trees. The assertion can be
570 * safely removed if we ever need to insert extent block
571 * structures at the root.
575 path->p_node[index].bh = eb_bh;
576 path->p_node[index].el = &eb->h_list;
579 static struct ocfs2_path *ocfs2_new_path(struct buffer_head *root_bh,
580 struct ocfs2_extent_list *root_el,
581 ocfs2_journal_access_func access)
583 struct ocfs2_path *path;
585 BUG_ON(le16_to_cpu(root_el->l_tree_depth) >= OCFS2_MAX_PATH_DEPTH);
587 path = kzalloc(sizeof(*path), GFP_NOFS);
589 path->p_tree_depth = le16_to_cpu(root_el->l_tree_depth);
591 path_root_bh(path) = root_bh;
592 path_root_el(path) = root_el;
593 path_root_access(path) = access;
599 static struct ocfs2_path *ocfs2_new_path_from_path(struct ocfs2_path *path)
601 return ocfs2_new_path(path_root_bh(path), path_root_el(path),
602 path_root_access(path));
605 static struct ocfs2_path *ocfs2_new_path_from_et(struct ocfs2_extent_tree *et)
607 return ocfs2_new_path(et->et_root_bh, et->et_root_el,
608 et->et_root_journal_access);
612 * Journal the buffer at depth idx. All idx>0 are extent_blocks,
613 * otherwise it's the root_access function.
615 * I don't like the way this function's name looks next to
616 * ocfs2_journal_access_path(), but I don't have a better one.
618 static int ocfs2_path_bh_journal_access(handle_t *handle,
619 struct ocfs2_caching_info *ci,
620 struct ocfs2_path *path,
623 ocfs2_journal_access_func access = path_root_access(path);
626 access = ocfs2_journal_access;
629 access = ocfs2_journal_access_eb;
631 return access(handle, ci, path->p_node[idx].bh,
632 OCFS2_JOURNAL_ACCESS_WRITE);
636 * Convenience function to journal all components in a path.
638 static int ocfs2_journal_access_path(struct ocfs2_caching_info *ci,
640 struct ocfs2_path *path)
647 for(i = 0; i < path_num_items(path); i++) {
648 ret = ocfs2_path_bh_journal_access(handle, ci, path, i);
660 * Return the index of the extent record which contains cluster #v_cluster.
661 * -1 is returned if it was not found.
663 * Should work fine on interior and exterior nodes.
665 int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster)
669 struct ocfs2_extent_rec *rec;
670 u32 rec_end, rec_start, clusters;
672 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
673 rec = &el->l_recs[i];
675 rec_start = le32_to_cpu(rec->e_cpos);
676 clusters = ocfs2_rec_clusters(el, rec);
678 rec_end = rec_start + clusters;
680 if (v_cluster >= rec_start && v_cluster < rec_end) {
689 enum ocfs2_contig_type {
698 * NOTE: ocfs2_block_extent_contig(), ocfs2_extents_adjacent() and
699 * ocfs2_extent_contig only work properly against leaf nodes!
701 static int ocfs2_block_extent_contig(struct super_block *sb,
702 struct ocfs2_extent_rec *ext,
705 u64 blk_end = le64_to_cpu(ext->e_blkno);
707 blk_end += ocfs2_clusters_to_blocks(sb,
708 le16_to_cpu(ext->e_leaf_clusters));
710 return blkno == blk_end;
713 static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left,
714 struct ocfs2_extent_rec *right)
718 left_range = le32_to_cpu(left->e_cpos) +
719 le16_to_cpu(left->e_leaf_clusters);
721 return (left_range == le32_to_cpu(right->e_cpos));
724 static enum ocfs2_contig_type
725 ocfs2_extent_contig(struct inode *inode,
726 struct ocfs2_extent_rec *ext,
727 struct ocfs2_extent_rec *insert_rec)
729 u64 blkno = le64_to_cpu(insert_rec->e_blkno);
732 * Refuse to coalesce extent records with different flag
733 * fields - we don't want to mix unwritten extents with user
736 if (ext->e_flags != insert_rec->e_flags)
739 if (ocfs2_extents_adjacent(ext, insert_rec) &&
740 ocfs2_block_extent_contig(inode->i_sb, ext, blkno))
743 blkno = le64_to_cpu(ext->e_blkno);
744 if (ocfs2_extents_adjacent(insert_rec, ext) &&
745 ocfs2_block_extent_contig(inode->i_sb, insert_rec, blkno))
752 * NOTE: We can have pretty much any combination of contiguousness and
755 * The usefulness of APPEND_TAIL is more in that it lets us know that
756 * we'll have to update the path to that leaf.
758 enum ocfs2_append_type {
763 enum ocfs2_split_type {
769 struct ocfs2_insert_type {
770 enum ocfs2_split_type ins_split;
771 enum ocfs2_append_type ins_appending;
772 enum ocfs2_contig_type ins_contig;
773 int ins_contig_index;
777 struct ocfs2_merge_ctxt {
778 enum ocfs2_contig_type c_contig_type;
779 int c_has_empty_extent;
780 int c_split_covers_rec;
783 static int ocfs2_validate_extent_block(struct super_block *sb,
784 struct buffer_head *bh)
787 struct ocfs2_extent_block *eb =
788 (struct ocfs2_extent_block *)bh->b_data;
790 mlog(0, "Validating extent block %llu\n",
791 (unsigned long long)bh->b_blocknr);
793 BUG_ON(!buffer_uptodate(bh));
796 * If the ecc fails, we return the error but otherwise
797 * leave the filesystem running. We know any error is
798 * local to this block.
800 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &eb->h_check);
802 mlog(ML_ERROR, "Checksum failed for extent block %llu\n",
803 (unsigned long long)bh->b_blocknr);
808 * Errors after here are fatal.
811 if (!OCFS2_IS_VALID_EXTENT_BLOCK(eb)) {
813 "Extent block #%llu has bad signature %.*s",
814 (unsigned long long)bh->b_blocknr, 7,
819 if (le64_to_cpu(eb->h_blkno) != bh->b_blocknr) {
821 "Extent block #%llu has an invalid h_blkno "
823 (unsigned long long)bh->b_blocknr,
824 (unsigned long long)le64_to_cpu(eb->h_blkno));
828 if (le32_to_cpu(eb->h_fs_generation) != OCFS2_SB(sb)->fs_generation) {
830 "Extent block #%llu has an invalid "
831 "h_fs_generation of #%u",
832 (unsigned long long)bh->b_blocknr,
833 le32_to_cpu(eb->h_fs_generation));
840 int ocfs2_read_extent_block(struct ocfs2_caching_info *ci, u64 eb_blkno,
841 struct buffer_head **bh)
844 struct buffer_head *tmp = *bh;
846 rc = ocfs2_read_block(ci, eb_blkno, &tmp,
847 ocfs2_validate_extent_block);
849 /* If ocfs2_read_block() got us a new bh, pass it up. */
858 * How many free extents have we got before we need more meta data?
860 int ocfs2_num_free_extents(struct ocfs2_super *osb,
861 struct ocfs2_extent_tree *et)
864 struct ocfs2_extent_list *el = NULL;
865 struct ocfs2_extent_block *eb;
866 struct buffer_head *eb_bh = NULL;
872 last_eb_blk = ocfs2_et_get_last_eb_blk(et);
875 retval = ocfs2_read_extent_block(et->et_ci, last_eb_blk,
881 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
885 BUG_ON(el->l_tree_depth != 0);
887 retval = le16_to_cpu(el->l_count) - le16_to_cpu(el->l_next_free_rec);
895 /* expects array to already be allocated
897 * sets h_signature, h_blkno, h_suballoc_bit, h_suballoc_slot, and
900 static int ocfs2_create_new_meta_bhs(handle_t *handle,
901 struct ocfs2_extent_tree *et,
903 struct ocfs2_alloc_context *meta_ac,
904 struct buffer_head *bhs[])
906 int count, status, i;
907 u16 suballoc_bit_start;
910 struct ocfs2_super *osb =
911 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
912 struct ocfs2_extent_block *eb;
917 while (count < wanted) {
918 status = ocfs2_claim_metadata(osb,
930 for(i = count; i < (num_got + count); i++) {
931 bhs[i] = sb_getblk(osb->sb, first_blkno);
932 if (bhs[i] == NULL) {
937 ocfs2_set_new_buffer_uptodate(et->et_ci, bhs[i]);
939 status = ocfs2_journal_access_eb(handle, et->et_ci,
941 OCFS2_JOURNAL_ACCESS_CREATE);
947 memset(bhs[i]->b_data, 0, osb->sb->s_blocksize);
948 eb = (struct ocfs2_extent_block *) bhs[i]->b_data;
949 /* Ok, setup the minimal stuff here. */
950 strcpy(eb->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE);
951 eb->h_blkno = cpu_to_le64(first_blkno);
952 eb->h_fs_generation = cpu_to_le32(osb->fs_generation);
953 eb->h_suballoc_slot = cpu_to_le16(osb->slot_num);
954 eb->h_suballoc_bit = cpu_to_le16(suballoc_bit_start);
956 cpu_to_le16(ocfs2_extent_recs_per_eb(osb->sb));
958 suballoc_bit_start++;
961 /* We'll also be dirtied by the caller, so
962 * this isn't absolutely necessary. */
963 status = ocfs2_journal_dirty(handle, bhs[i]);
976 for(i = 0; i < wanted; i++) {
986 * Helper function for ocfs2_add_branch() and ocfs2_shift_tree_depth().
988 * Returns the sum of the rightmost extent rec logical offset and
991 * ocfs2_add_branch() uses this to determine what logical cluster
992 * value should be populated into the leftmost new branch records.
994 * ocfs2_shift_tree_depth() uses this to determine the # clusters
995 * value for the new topmost tree record.
997 static inline u32 ocfs2_sum_rightmost_rec(struct ocfs2_extent_list *el)
1001 i = le16_to_cpu(el->l_next_free_rec) - 1;
1003 return le32_to_cpu(el->l_recs[i].e_cpos) +
1004 ocfs2_rec_clusters(el, &el->l_recs[i]);
1008 * Change range of the branches in the right most path according to the leaf
1009 * extent block's rightmost record.
1011 static int ocfs2_adjust_rightmost_branch(handle_t *handle,
1012 struct inode *inode,
1013 struct ocfs2_extent_tree *et)
1016 struct ocfs2_path *path = NULL;
1017 struct ocfs2_extent_list *el;
1018 struct ocfs2_extent_rec *rec;
1020 path = ocfs2_new_path_from_et(et);
1026 status = ocfs2_find_path(et->et_ci, path, UINT_MAX);
1032 status = ocfs2_extend_trans(handle, path_num_items(path) +
1033 handle->h_buffer_credits);
1039 status = ocfs2_journal_access_path(INODE_CACHE(inode), handle, path);
1045 el = path_leaf_el(path);
1046 rec = &el->l_recs[le32_to_cpu(el->l_next_free_rec) - 1];
1048 ocfs2_adjust_rightmost_records(inode, handle, path, rec);
1051 ocfs2_free_path(path);
1056 * Add an entire tree branch to our inode. eb_bh is the extent block
1057 * to start at, if we don't want to start the branch at the dinode
1060 * last_eb_bh is required as we have to update it's next_leaf pointer
1061 * for the new last extent block.
1063 * the new branch will be 'empty' in the sense that every block will
1064 * contain a single record with cluster count == 0.
1066 static int ocfs2_add_branch(struct ocfs2_super *osb,
1068 struct inode *inode,
1069 struct ocfs2_extent_tree *et,
1070 struct buffer_head *eb_bh,
1071 struct buffer_head **last_eb_bh,
1072 struct ocfs2_alloc_context *meta_ac)
1074 int status, new_blocks, i;
1075 u64 next_blkno, new_last_eb_blk;
1076 struct buffer_head *bh;
1077 struct buffer_head **new_eb_bhs = NULL;
1078 struct ocfs2_extent_block *eb;
1079 struct ocfs2_extent_list *eb_el;
1080 struct ocfs2_extent_list *el;
1081 u32 new_cpos, root_end;
1085 BUG_ON(!last_eb_bh || !*last_eb_bh);
1088 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
1091 el = et->et_root_el;
1093 /* we never add a branch to a leaf. */
1094 BUG_ON(!el->l_tree_depth);
1096 new_blocks = le16_to_cpu(el->l_tree_depth);
1098 eb = (struct ocfs2_extent_block *)(*last_eb_bh)->b_data;
1099 new_cpos = ocfs2_sum_rightmost_rec(&eb->h_list);
1100 root_end = ocfs2_sum_rightmost_rec(et->et_root_el);
1103 * If there is a gap before the root end and the real end
1104 * of the righmost leaf block, we need to remove the gap
1105 * between new_cpos and root_end first so that the tree
1106 * is consistent after we add a new branch(it will start
1109 if (root_end > new_cpos) {
1110 mlog(0, "adjust the cluster end from %u to %u\n",
1111 root_end, new_cpos);
1112 status = ocfs2_adjust_rightmost_branch(handle, inode, et);
1119 /* allocate the number of new eb blocks we need */
1120 new_eb_bhs = kcalloc(new_blocks, sizeof(struct buffer_head *),
1128 status = ocfs2_create_new_meta_bhs(handle, et, new_blocks,
1129 meta_ac, new_eb_bhs);
1135 /* Note: new_eb_bhs[new_blocks - 1] is the guy which will be
1136 * linked with the rest of the tree.
1137 * conversly, new_eb_bhs[0] is the new bottommost leaf.
1139 * when we leave the loop, new_last_eb_blk will point to the
1140 * newest leaf, and next_blkno will point to the topmost extent
1142 next_blkno = new_last_eb_blk = 0;
1143 for(i = 0; i < new_blocks; i++) {
1145 eb = (struct ocfs2_extent_block *) bh->b_data;
1146 /* ocfs2_create_new_meta_bhs() should create it right! */
1147 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1148 eb_el = &eb->h_list;
1150 status = ocfs2_journal_access_eb(handle, INODE_CACHE(inode), bh,
1151 OCFS2_JOURNAL_ACCESS_CREATE);
1157 eb->h_next_leaf_blk = 0;
1158 eb_el->l_tree_depth = cpu_to_le16(i);
1159 eb_el->l_next_free_rec = cpu_to_le16(1);
1161 * This actually counts as an empty extent as
1164 eb_el->l_recs[0].e_cpos = cpu_to_le32(new_cpos);
1165 eb_el->l_recs[0].e_blkno = cpu_to_le64(next_blkno);
1167 * eb_el isn't always an interior node, but even leaf
1168 * nodes want a zero'd flags and reserved field so
1169 * this gets the whole 32 bits regardless of use.
1171 eb_el->l_recs[0].e_int_clusters = cpu_to_le32(0);
1172 if (!eb_el->l_tree_depth)
1173 new_last_eb_blk = le64_to_cpu(eb->h_blkno);
1175 status = ocfs2_journal_dirty(handle, bh);
1181 next_blkno = le64_to_cpu(eb->h_blkno);
1184 /* This is a bit hairy. We want to update up to three blocks
1185 * here without leaving any of them in an inconsistent state
1186 * in case of error. We don't have to worry about
1187 * journal_dirty erroring as it won't unless we've aborted the
1188 * handle (in which case we would never be here) so reserving
1189 * the write with journal_access is all we need to do. */
1190 status = ocfs2_journal_access_eb(handle, INODE_CACHE(inode), *last_eb_bh,
1191 OCFS2_JOURNAL_ACCESS_WRITE);
1196 status = ocfs2_et_root_journal_access(handle, et,
1197 OCFS2_JOURNAL_ACCESS_WRITE);
1203 status = ocfs2_journal_access_eb(handle, INODE_CACHE(inode), eb_bh,
1204 OCFS2_JOURNAL_ACCESS_WRITE);
1211 /* Link the new branch into the rest of the tree (el will
1212 * either be on the root_bh, or the extent block passed in. */
1213 i = le16_to_cpu(el->l_next_free_rec);
1214 el->l_recs[i].e_blkno = cpu_to_le64(next_blkno);
1215 el->l_recs[i].e_cpos = cpu_to_le32(new_cpos);
1216 el->l_recs[i].e_int_clusters = 0;
1217 le16_add_cpu(&el->l_next_free_rec, 1);
1219 /* fe needs a new last extent block pointer, as does the
1220 * next_leaf on the previously last-extent-block. */
1221 ocfs2_et_set_last_eb_blk(et, new_last_eb_blk);
1223 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
1224 eb->h_next_leaf_blk = cpu_to_le64(new_last_eb_blk);
1226 status = ocfs2_journal_dirty(handle, *last_eb_bh);
1229 status = ocfs2_journal_dirty(handle, et->et_root_bh);
1233 status = ocfs2_journal_dirty(handle, eb_bh);
1239 * Some callers want to track the rightmost leaf so pass it
1242 brelse(*last_eb_bh);
1243 get_bh(new_eb_bhs[0]);
1244 *last_eb_bh = new_eb_bhs[0];
1249 for (i = 0; i < new_blocks; i++)
1250 brelse(new_eb_bhs[i]);
1259 * adds another level to the allocation tree.
1260 * returns back the new extent block so you can add a branch to it
1263 static int ocfs2_shift_tree_depth(struct ocfs2_super *osb,
1265 struct inode *inode,
1266 struct ocfs2_extent_tree *et,
1267 struct ocfs2_alloc_context *meta_ac,
1268 struct buffer_head **ret_new_eb_bh)
1272 struct buffer_head *new_eb_bh = NULL;
1273 struct ocfs2_extent_block *eb;
1274 struct ocfs2_extent_list *root_el;
1275 struct ocfs2_extent_list *eb_el;
1279 status = ocfs2_create_new_meta_bhs(handle, et, 1, meta_ac,
1286 eb = (struct ocfs2_extent_block *) new_eb_bh->b_data;
1287 /* ocfs2_create_new_meta_bhs() should create it right! */
1288 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1290 eb_el = &eb->h_list;
1291 root_el = et->et_root_el;
1293 status = ocfs2_journal_access_eb(handle, INODE_CACHE(inode), new_eb_bh,
1294 OCFS2_JOURNAL_ACCESS_CREATE);
1300 /* copy the root extent list data into the new extent block */
1301 eb_el->l_tree_depth = root_el->l_tree_depth;
1302 eb_el->l_next_free_rec = root_el->l_next_free_rec;
1303 for (i = 0; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1304 eb_el->l_recs[i] = root_el->l_recs[i];
1306 status = ocfs2_journal_dirty(handle, new_eb_bh);
1312 status = ocfs2_et_root_journal_access(handle, et,
1313 OCFS2_JOURNAL_ACCESS_WRITE);
1319 new_clusters = ocfs2_sum_rightmost_rec(eb_el);
1321 /* update root_bh now */
1322 le16_add_cpu(&root_el->l_tree_depth, 1);
1323 root_el->l_recs[0].e_cpos = 0;
1324 root_el->l_recs[0].e_blkno = eb->h_blkno;
1325 root_el->l_recs[0].e_int_clusters = cpu_to_le32(new_clusters);
1326 for (i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1327 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
1328 root_el->l_next_free_rec = cpu_to_le16(1);
1330 /* If this is our 1st tree depth shift, then last_eb_blk
1331 * becomes the allocated extent block */
1332 if (root_el->l_tree_depth == cpu_to_le16(1))
1333 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
1335 status = ocfs2_journal_dirty(handle, et->et_root_bh);
1341 *ret_new_eb_bh = new_eb_bh;
1352 * Should only be called when there is no space left in any of the
1353 * leaf nodes. What we want to do is find the lowest tree depth
1354 * non-leaf extent block with room for new records. There are three
1355 * valid results of this search:
1357 * 1) a lowest extent block is found, then we pass it back in
1358 * *lowest_eb_bh and return '0'
1360 * 2) the search fails to find anything, but the root_el has room. We
1361 * pass NULL back in *lowest_eb_bh, but still return '0'
1363 * 3) the search fails to find anything AND the root_el is full, in
1364 * which case we return > 0
1366 * return status < 0 indicates an error.
1368 static int ocfs2_find_branch_target(struct ocfs2_super *osb,
1369 struct ocfs2_extent_tree *et,
1370 struct buffer_head **target_bh)
1374 struct ocfs2_extent_block *eb;
1375 struct ocfs2_extent_list *el;
1376 struct buffer_head *bh = NULL;
1377 struct buffer_head *lowest_bh = NULL;
1383 el = et->et_root_el;
1385 while(le16_to_cpu(el->l_tree_depth) > 1) {
1386 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1387 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1388 "Owner %llu has empty "
1389 "extent list (next_free_rec == 0)",
1390 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
1394 i = le16_to_cpu(el->l_next_free_rec) - 1;
1395 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1397 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1398 "Owner %llu has extent "
1399 "list where extent # %d has no physical "
1401 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), i);
1409 status = ocfs2_read_extent_block(et->et_ci, blkno, &bh);
1415 eb = (struct ocfs2_extent_block *) bh->b_data;
1418 if (le16_to_cpu(el->l_next_free_rec) <
1419 le16_to_cpu(el->l_count)) {
1426 /* If we didn't find one and the fe doesn't have any room,
1427 * then return '1' */
1428 el = et->et_root_el;
1429 if (!lowest_bh && (el->l_next_free_rec == el->l_count))
1432 *target_bh = lowest_bh;
1441 * Grow a b-tree so that it has more records.
1443 * We might shift the tree depth in which case existing paths should
1444 * be considered invalid.
1446 * Tree depth after the grow is returned via *final_depth.
1448 * *last_eb_bh will be updated by ocfs2_add_branch().
1450 static int ocfs2_grow_tree(struct inode *inode, handle_t *handle,
1451 struct ocfs2_extent_tree *et, int *final_depth,
1452 struct buffer_head **last_eb_bh,
1453 struct ocfs2_alloc_context *meta_ac)
1456 struct ocfs2_extent_list *el = et->et_root_el;
1457 int depth = le16_to_cpu(el->l_tree_depth);
1458 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1459 struct buffer_head *bh = NULL;
1461 BUG_ON(meta_ac == NULL);
1463 shift = ocfs2_find_branch_target(osb, et, &bh);
1470 /* We traveled all the way to the bottom of the allocation tree
1471 * and didn't find room for any more extents - we need to add
1472 * another tree level */
1475 mlog(0, "need to shift tree depth (current = %d)\n", depth);
1477 /* ocfs2_shift_tree_depth will return us a buffer with
1478 * the new extent block (so we can pass that to
1479 * ocfs2_add_branch). */
1480 ret = ocfs2_shift_tree_depth(osb, handle, inode, et,
1489 * Special case: we have room now if we shifted from
1490 * tree_depth 0, so no more work needs to be done.
1492 * We won't be calling add_branch, so pass
1493 * back *last_eb_bh as the new leaf. At depth
1494 * zero, it should always be null so there's
1495 * no reason to brelse.
1497 BUG_ON(*last_eb_bh);
1504 /* call ocfs2_add_branch to add the final part of the tree with
1506 mlog(0, "add branch. bh = %p\n", bh);
1507 ret = ocfs2_add_branch(osb, handle, inode, et, bh, last_eb_bh,
1516 *final_depth = depth;
1522 * This function will discard the rightmost extent record.
1524 static void ocfs2_shift_records_right(struct ocfs2_extent_list *el)
1526 int next_free = le16_to_cpu(el->l_next_free_rec);
1527 int count = le16_to_cpu(el->l_count);
1528 unsigned int num_bytes;
1531 /* This will cause us to go off the end of our extent list. */
1532 BUG_ON(next_free >= count);
1534 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1536 memmove(&el->l_recs[1], &el->l_recs[0], num_bytes);
1539 static void ocfs2_rotate_leaf(struct ocfs2_extent_list *el,
1540 struct ocfs2_extent_rec *insert_rec)
1542 int i, insert_index, next_free, has_empty, num_bytes;
1543 u32 insert_cpos = le32_to_cpu(insert_rec->e_cpos);
1544 struct ocfs2_extent_rec *rec;
1546 next_free = le16_to_cpu(el->l_next_free_rec);
1547 has_empty = ocfs2_is_empty_extent(&el->l_recs[0]);
1551 /* The tree code before us didn't allow enough room in the leaf. */
1552 BUG_ON(el->l_next_free_rec == el->l_count && !has_empty);
1555 * The easiest way to approach this is to just remove the
1556 * empty extent and temporarily decrement next_free.
1560 * If next_free was 1 (only an empty extent), this
1561 * loop won't execute, which is fine. We still want
1562 * the decrement above to happen.
1564 for(i = 0; i < (next_free - 1); i++)
1565 el->l_recs[i] = el->l_recs[i+1];
1571 * Figure out what the new record index should be.
1573 for(i = 0; i < next_free; i++) {
1574 rec = &el->l_recs[i];
1576 if (insert_cpos < le32_to_cpu(rec->e_cpos))
1581 mlog(0, "ins %u: index %d, has_empty %d, next_free %d, count %d\n",
1582 insert_cpos, insert_index, has_empty, next_free, le16_to_cpu(el->l_count));
1584 BUG_ON(insert_index < 0);
1585 BUG_ON(insert_index >= le16_to_cpu(el->l_count));
1586 BUG_ON(insert_index > next_free);
1589 * No need to memmove if we're just adding to the tail.
1591 if (insert_index != next_free) {
1592 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1594 num_bytes = next_free - insert_index;
1595 num_bytes *= sizeof(struct ocfs2_extent_rec);
1596 memmove(&el->l_recs[insert_index + 1],
1597 &el->l_recs[insert_index],
1602 * Either we had an empty extent, and need to re-increment or
1603 * there was no empty extent on a non full rightmost leaf node,
1604 * in which case we still need to increment.
1607 el->l_next_free_rec = cpu_to_le16(next_free);
1609 * Make sure none of the math above just messed up our tree.
1611 BUG_ON(le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count));
1613 el->l_recs[insert_index] = *insert_rec;
1617 static void ocfs2_remove_empty_extent(struct ocfs2_extent_list *el)
1619 int size, num_recs = le16_to_cpu(el->l_next_free_rec);
1621 BUG_ON(num_recs == 0);
1623 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
1625 size = num_recs * sizeof(struct ocfs2_extent_rec);
1626 memmove(&el->l_recs[0], &el->l_recs[1], size);
1627 memset(&el->l_recs[num_recs], 0,
1628 sizeof(struct ocfs2_extent_rec));
1629 el->l_next_free_rec = cpu_to_le16(num_recs);
1634 * Create an empty extent record .
1636 * l_next_free_rec may be updated.
1638 * If an empty extent already exists do nothing.
1640 static void ocfs2_create_empty_extent(struct ocfs2_extent_list *el)
1642 int next_free = le16_to_cpu(el->l_next_free_rec);
1644 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
1649 if (ocfs2_is_empty_extent(&el->l_recs[0]))
1652 mlog_bug_on_msg(el->l_count == el->l_next_free_rec,
1653 "Asked to create an empty extent in a full list:\n"
1654 "count = %u, tree depth = %u",
1655 le16_to_cpu(el->l_count),
1656 le16_to_cpu(el->l_tree_depth));
1658 ocfs2_shift_records_right(el);
1661 le16_add_cpu(&el->l_next_free_rec, 1);
1662 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
1666 * For a rotation which involves two leaf nodes, the "root node" is
1667 * the lowest level tree node which contains a path to both leafs. This
1668 * resulting set of information can be used to form a complete "subtree"
1670 * This function is passed two full paths from the dinode down to a
1671 * pair of adjacent leaves. It's task is to figure out which path
1672 * index contains the subtree root - this can be the root index itself
1673 * in a worst-case rotation.
1675 * The array index of the subtree root is passed back.
1677 static int ocfs2_find_subtree_root(struct ocfs2_extent_tree *et,
1678 struct ocfs2_path *left,
1679 struct ocfs2_path *right)
1684 * Check that the caller passed in two paths from the same tree.
1686 BUG_ON(path_root_bh(left) != path_root_bh(right));
1692 * The caller didn't pass two adjacent paths.
1694 mlog_bug_on_msg(i > left->p_tree_depth,
1695 "Owner %llu, left depth %u, right depth %u\n"
1696 "left leaf blk %llu, right leaf blk %llu\n",
1697 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
1698 left->p_tree_depth, right->p_tree_depth,
1699 (unsigned long long)path_leaf_bh(left)->b_blocknr,
1700 (unsigned long long)path_leaf_bh(right)->b_blocknr);
1701 } while (left->p_node[i].bh->b_blocknr ==
1702 right->p_node[i].bh->b_blocknr);
1707 typedef void (path_insert_t)(void *, struct buffer_head *);
1710 * Traverse a btree path in search of cpos, starting at root_el.
1712 * This code can be called with a cpos larger than the tree, in which
1713 * case it will return the rightmost path.
1715 static int __ocfs2_find_path(struct ocfs2_caching_info *ci,
1716 struct ocfs2_extent_list *root_el, u32 cpos,
1717 path_insert_t *func, void *data)
1722 struct buffer_head *bh = NULL;
1723 struct ocfs2_extent_block *eb;
1724 struct ocfs2_extent_list *el;
1725 struct ocfs2_extent_rec *rec;
1728 while (el->l_tree_depth) {
1729 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1730 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1731 "Owner %llu has empty extent list at "
1733 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1734 le16_to_cpu(el->l_tree_depth));
1740 for(i = 0; i < le16_to_cpu(el->l_next_free_rec) - 1; i++) {
1741 rec = &el->l_recs[i];
1744 * In the case that cpos is off the allocation
1745 * tree, this should just wind up returning the
1748 range = le32_to_cpu(rec->e_cpos) +
1749 ocfs2_rec_clusters(el, rec);
1750 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
1754 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1756 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1757 "Owner %llu has bad blkno in extent list "
1758 "at depth %u (index %d)\n",
1759 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1760 le16_to_cpu(el->l_tree_depth), i);
1767 ret = ocfs2_read_extent_block(ci, blkno, &bh);
1773 eb = (struct ocfs2_extent_block *) bh->b_data;
1776 if (le16_to_cpu(el->l_next_free_rec) >
1777 le16_to_cpu(el->l_count)) {
1778 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1779 "Owner %llu has bad count in extent list "
1780 "at block %llu (next free=%u, count=%u)\n",
1781 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1782 (unsigned long long)bh->b_blocknr,
1783 le16_to_cpu(el->l_next_free_rec),
1784 le16_to_cpu(el->l_count));
1795 * Catch any trailing bh that the loop didn't handle.
1803 * Given an initialized path (that is, it has a valid root extent
1804 * list), this function will traverse the btree in search of the path
1805 * which would contain cpos.
1807 * The path traveled is recorded in the path structure.
1809 * Note that this will not do any comparisons on leaf node extent
1810 * records, so it will work fine in the case that we just added a tree
1813 struct find_path_data {
1815 struct ocfs2_path *path;
1817 static void find_path_ins(void *data, struct buffer_head *bh)
1819 struct find_path_data *fp = data;
1822 ocfs2_path_insert_eb(fp->path, fp->index, bh);
1825 static int ocfs2_find_path(struct ocfs2_caching_info *ci,
1826 struct ocfs2_path *path, u32 cpos)
1828 struct find_path_data data;
1832 return __ocfs2_find_path(ci, path_root_el(path), cpos,
1833 find_path_ins, &data);
1836 static void find_leaf_ins(void *data, struct buffer_head *bh)
1838 struct ocfs2_extent_block *eb =(struct ocfs2_extent_block *)bh->b_data;
1839 struct ocfs2_extent_list *el = &eb->h_list;
1840 struct buffer_head **ret = data;
1842 /* We want to retain only the leaf block. */
1843 if (le16_to_cpu(el->l_tree_depth) == 0) {
1849 * Find the leaf block in the tree which would contain cpos. No
1850 * checking of the actual leaf is done.
1852 * Some paths want to call this instead of allocating a path structure
1853 * and calling ocfs2_find_path().
1855 * This function doesn't handle non btree extent lists.
1857 int ocfs2_find_leaf(struct ocfs2_caching_info *ci,
1858 struct ocfs2_extent_list *root_el, u32 cpos,
1859 struct buffer_head **leaf_bh)
1862 struct buffer_head *bh = NULL;
1864 ret = __ocfs2_find_path(ci, root_el, cpos, find_leaf_ins, &bh);
1876 * Adjust the adjacent records (left_rec, right_rec) involved in a rotation.
1878 * Basically, we've moved stuff around at the bottom of the tree and
1879 * we need to fix up the extent records above the changes to reflect
1882 * left_rec: the record on the left.
1883 * left_child_el: is the child list pointed to by left_rec
1884 * right_rec: the record to the right of left_rec
1885 * right_child_el: is the child list pointed to by right_rec
1887 * By definition, this only works on interior nodes.
1889 static void ocfs2_adjust_adjacent_records(struct ocfs2_extent_rec *left_rec,
1890 struct ocfs2_extent_list *left_child_el,
1891 struct ocfs2_extent_rec *right_rec,
1892 struct ocfs2_extent_list *right_child_el)
1894 u32 left_clusters, right_end;
1897 * Interior nodes never have holes. Their cpos is the cpos of
1898 * the leftmost record in their child list. Their cluster
1899 * count covers the full theoretical range of their child list
1900 * - the range between their cpos and the cpos of the record
1901 * immediately to their right.
1903 left_clusters = le32_to_cpu(right_child_el->l_recs[0].e_cpos);
1904 if (!ocfs2_rec_clusters(right_child_el, &right_child_el->l_recs[0])) {
1905 BUG_ON(right_child_el->l_tree_depth);
1906 BUG_ON(le16_to_cpu(right_child_el->l_next_free_rec) <= 1);
1907 left_clusters = le32_to_cpu(right_child_el->l_recs[1].e_cpos);
1909 left_clusters -= le32_to_cpu(left_rec->e_cpos);
1910 left_rec->e_int_clusters = cpu_to_le32(left_clusters);
1913 * Calculate the rightmost cluster count boundary before
1914 * moving cpos - we will need to adjust clusters after
1915 * updating e_cpos to keep the same highest cluster count.
1917 right_end = le32_to_cpu(right_rec->e_cpos);
1918 right_end += le32_to_cpu(right_rec->e_int_clusters);
1920 right_rec->e_cpos = left_rec->e_cpos;
1921 le32_add_cpu(&right_rec->e_cpos, left_clusters);
1923 right_end -= le32_to_cpu(right_rec->e_cpos);
1924 right_rec->e_int_clusters = cpu_to_le32(right_end);
1928 * Adjust the adjacent root node records involved in a
1929 * rotation. left_el_blkno is passed in as a key so that we can easily
1930 * find it's index in the root list.
1932 static void ocfs2_adjust_root_records(struct ocfs2_extent_list *root_el,
1933 struct ocfs2_extent_list *left_el,
1934 struct ocfs2_extent_list *right_el,
1939 BUG_ON(le16_to_cpu(root_el->l_tree_depth) <=
1940 le16_to_cpu(left_el->l_tree_depth));
1942 for(i = 0; i < le16_to_cpu(root_el->l_next_free_rec) - 1; i++) {
1943 if (le64_to_cpu(root_el->l_recs[i].e_blkno) == left_el_blkno)
1948 * The path walking code should have never returned a root and
1949 * two paths which are not adjacent.
1951 BUG_ON(i >= (le16_to_cpu(root_el->l_next_free_rec) - 1));
1953 ocfs2_adjust_adjacent_records(&root_el->l_recs[i], left_el,
1954 &root_el->l_recs[i + 1], right_el);
1958 * We've changed a leaf block (in right_path) and need to reflect that
1959 * change back up the subtree.
1961 * This happens in multiple places:
1962 * - When we've moved an extent record from the left path leaf to the right
1963 * path leaf to make room for an empty extent in the left path leaf.
1964 * - When our insert into the right path leaf is at the leftmost edge
1965 * and requires an update of the path immediately to it's left. This
1966 * can occur at the end of some types of rotation and appending inserts.
1967 * - When we've adjusted the last extent record in the left path leaf and the
1968 * 1st extent record in the right path leaf during cross extent block merge.
1970 static void ocfs2_complete_edge_insert(handle_t *handle,
1971 struct ocfs2_path *left_path,
1972 struct ocfs2_path *right_path,
1976 struct ocfs2_extent_list *el, *left_el, *right_el;
1977 struct ocfs2_extent_rec *left_rec, *right_rec;
1978 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
1981 * Update the counts and position values within all the
1982 * interior nodes to reflect the leaf rotation we just did.
1984 * The root node is handled below the loop.
1986 * We begin the loop with right_el and left_el pointing to the
1987 * leaf lists and work our way up.
1989 * NOTE: within this loop, left_el and right_el always refer
1990 * to the *child* lists.
1992 left_el = path_leaf_el(left_path);
1993 right_el = path_leaf_el(right_path);
1994 for(i = left_path->p_tree_depth - 1; i > subtree_index; i--) {
1995 mlog(0, "Adjust records at index %u\n", i);
1998 * One nice property of knowing that all of these
1999 * nodes are below the root is that we only deal with
2000 * the leftmost right node record and the rightmost
2003 el = left_path->p_node[i].el;
2004 idx = le16_to_cpu(left_el->l_next_free_rec) - 1;
2005 left_rec = &el->l_recs[idx];
2007 el = right_path->p_node[i].el;
2008 right_rec = &el->l_recs[0];
2010 ocfs2_adjust_adjacent_records(left_rec, left_el, right_rec,
2013 ret = ocfs2_journal_dirty(handle, left_path->p_node[i].bh);
2017 ret = ocfs2_journal_dirty(handle, right_path->p_node[i].bh);
2022 * Setup our list pointers now so that the current
2023 * parents become children in the next iteration.
2025 left_el = left_path->p_node[i].el;
2026 right_el = right_path->p_node[i].el;
2030 * At the root node, adjust the two adjacent records which
2031 * begin our path to the leaves.
2034 el = left_path->p_node[subtree_index].el;
2035 left_el = left_path->p_node[subtree_index + 1].el;
2036 right_el = right_path->p_node[subtree_index + 1].el;
2038 ocfs2_adjust_root_records(el, left_el, right_el,
2039 left_path->p_node[subtree_index + 1].bh->b_blocknr);
2041 root_bh = left_path->p_node[subtree_index].bh;
2043 ret = ocfs2_journal_dirty(handle, root_bh);
2048 static int ocfs2_rotate_subtree_right(handle_t *handle,
2049 struct ocfs2_extent_tree *et,
2050 struct ocfs2_path *left_path,
2051 struct ocfs2_path *right_path,
2055 struct buffer_head *right_leaf_bh;
2056 struct buffer_head *left_leaf_bh = NULL;
2057 struct buffer_head *root_bh;
2058 struct ocfs2_extent_list *right_el, *left_el;
2059 struct ocfs2_extent_rec move_rec;
2061 left_leaf_bh = path_leaf_bh(left_path);
2062 left_el = path_leaf_el(left_path);
2064 if (left_el->l_next_free_rec != left_el->l_count) {
2065 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
2066 "Inode %llu has non-full interior leaf node %llu"
2068 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2069 (unsigned long long)left_leaf_bh->b_blocknr,
2070 le16_to_cpu(left_el->l_next_free_rec));
2075 * This extent block may already have an empty record, so we
2076 * return early if so.
2078 if (ocfs2_is_empty_extent(&left_el->l_recs[0]))
2081 root_bh = left_path->p_node[subtree_index].bh;
2082 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2084 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2091 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2092 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2099 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2107 right_leaf_bh = path_leaf_bh(right_path);
2108 right_el = path_leaf_el(right_path);
2110 /* This is a code error, not a disk corruption. */
2111 mlog_bug_on_msg(!right_el->l_next_free_rec, "Inode %llu: Rotate fails "
2112 "because rightmost leaf block %llu is empty\n",
2113 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2114 (unsigned long long)right_leaf_bh->b_blocknr);
2116 ocfs2_create_empty_extent(right_el);
2118 ret = ocfs2_journal_dirty(handle, right_leaf_bh);
2124 /* Do the copy now. */
2125 i = le16_to_cpu(left_el->l_next_free_rec) - 1;
2126 move_rec = left_el->l_recs[i];
2127 right_el->l_recs[0] = move_rec;
2130 * Clear out the record we just copied and shift everything
2131 * over, leaving an empty extent in the left leaf.
2133 * We temporarily subtract from next_free_rec so that the
2134 * shift will lose the tail record (which is now defunct).
2136 le16_add_cpu(&left_el->l_next_free_rec, -1);
2137 ocfs2_shift_records_right(left_el);
2138 memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2139 le16_add_cpu(&left_el->l_next_free_rec, 1);
2141 ret = ocfs2_journal_dirty(handle, left_leaf_bh);
2147 ocfs2_complete_edge_insert(handle, left_path, right_path,
2155 * Given a full path, determine what cpos value would return us a path
2156 * containing the leaf immediately to the left of the current one.
2158 * Will return zero if the path passed in is already the leftmost path.
2160 static int ocfs2_find_cpos_for_left_leaf(struct super_block *sb,
2161 struct ocfs2_path *path, u32 *cpos)
2165 struct ocfs2_extent_list *el;
2167 BUG_ON(path->p_tree_depth == 0);
2171 blkno = path_leaf_bh(path)->b_blocknr;
2173 /* Start at the tree node just above the leaf and work our way up. */
2174 i = path->p_tree_depth - 1;
2176 el = path->p_node[i].el;
2179 * Find the extent record just before the one in our
2182 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2183 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2187 * We've determined that the
2188 * path specified is already
2189 * the leftmost one - return a
2195 * The leftmost record points to our
2196 * leaf - we need to travel up the
2202 *cpos = le32_to_cpu(el->l_recs[j - 1].e_cpos);
2203 *cpos = *cpos + ocfs2_rec_clusters(el,
2204 &el->l_recs[j - 1]);
2211 * If we got here, we never found a valid node where
2212 * the tree indicated one should be.
2215 "Invalid extent tree at extent block %llu\n",
2216 (unsigned long long)blkno);
2221 blkno = path->p_node[i].bh->b_blocknr;
2230 * Extend the transaction by enough credits to complete the rotation,
2231 * and still leave at least the original number of credits allocated
2232 * to this transaction.
2234 static int ocfs2_extend_rotate_transaction(handle_t *handle, int subtree_depth,
2236 struct ocfs2_path *path)
2238 int credits = (path->p_tree_depth - subtree_depth) * 2 + 1 + op_credits;
2240 if (handle->h_buffer_credits < credits)
2241 return ocfs2_extend_trans(handle, credits);
2247 * Trap the case where we're inserting into the theoretical range past
2248 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2249 * whose cpos is less than ours into the right leaf.
2251 * It's only necessary to look at the rightmost record of the left
2252 * leaf because the logic that calls us should ensure that the
2253 * theoretical ranges in the path components above the leaves are
2256 static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path,
2259 struct ocfs2_extent_list *left_el;
2260 struct ocfs2_extent_rec *rec;
2263 left_el = path_leaf_el(left_path);
2264 next_free = le16_to_cpu(left_el->l_next_free_rec);
2265 rec = &left_el->l_recs[next_free - 1];
2267 if (insert_cpos > le32_to_cpu(rec->e_cpos))
2272 static int ocfs2_leftmost_rec_contains(struct ocfs2_extent_list *el, u32 cpos)
2274 int next_free = le16_to_cpu(el->l_next_free_rec);
2276 struct ocfs2_extent_rec *rec;
2281 rec = &el->l_recs[0];
2282 if (ocfs2_is_empty_extent(rec)) {
2286 rec = &el->l_recs[1];
2289 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2290 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
2296 * Rotate all the records in a btree right one record, starting at insert_cpos.
2298 * The path to the rightmost leaf should be passed in.
2300 * The array is assumed to be large enough to hold an entire path (tree depth).
2302 * Upon succesful return from this function:
2304 * - The 'right_path' array will contain a path to the leaf block
2305 * whose range contains e_cpos.
2306 * - That leaf block will have a single empty extent in list index 0.
2307 * - In the case that the rotation requires a post-insert update,
2308 * *ret_left_path will contain a valid path which can be passed to
2309 * ocfs2_insert_path().
2311 static int ocfs2_rotate_tree_right(handle_t *handle,
2312 struct ocfs2_extent_tree *et,
2313 enum ocfs2_split_type split,
2315 struct ocfs2_path *right_path,
2316 struct ocfs2_path **ret_left_path)
2318 int ret, start, orig_credits = handle->h_buffer_credits;
2320 struct ocfs2_path *left_path = NULL;
2321 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2323 *ret_left_path = NULL;
2325 left_path = ocfs2_new_path_from_path(right_path);
2332 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2338 mlog(0, "Insert: %u, first left path cpos: %u\n", insert_cpos, cpos);
2341 * What we want to do here is:
2343 * 1) Start with the rightmost path.
2345 * 2) Determine a path to the leaf block directly to the left
2348 * 3) Determine the 'subtree root' - the lowest level tree node
2349 * which contains a path to both leaves.
2351 * 4) Rotate the subtree.
2353 * 5) Find the next subtree by considering the left path to be
2354 * the new right path.
2356 * The check at the top of this while loop also accepts
2357 * insert_cpos == cpos because cpos is only a _theoretical_
2358 * value to get us the left path - insert_cpos might very well
2359 * be filling that hole.
2361 * Stop at a cpos of '0' because we either started at the
2362 * leftmost branch (i.e., a tree with one branch and a
2363 * rotation inside of it), or we've gone as far as we can in
2364 * rotating subtrees.
2366 while (cpos && insert_cpos <= cpos) {
2367 mlog(0, "Rotating a tree: ins. cpos: %u, left path cpos: %u\n",
2370 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
2376 mlog_bug_on_msg(path_leaf_bh(left_path) ==
2377 path_leaf_bh(right_path),
2378 "Owner %llu: error during insert of %u "
2379 "(left path cpos %u) results in two identical "
2380 "paths ending at %llu\n",
2381 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2383 (unsigned long long)
2384 path_leaf_bh(left_path)->b_blocknr);
2386 if (split == SPLIT_NONE &&
2387 ocfs2_rotate_requires_path_adjustment(left_path,
2391 * We've rotated the tree as much as we
2392 * should. The rest is up to
2393 * ocfs2_insert_path() to complete, after the
2394 * record insertion. We indicate this
2395 * situation by returning the left path.
2397 * The reason we don't adjust the records here
2398 * before the record insert is that an error
2399 * later might break the rule where a parent
2400 * record e_cpos will reflect the actual
2401 * e_cpos of the 1st nonempty record of the
2404 *ret_left_path = left_path;
2408 start = ocfs2_find_subtree_root(et, left_path, right_path);
2410 mlog(0, "Subtree root at index %d (blk %llu, depth %d)\n",
2412 (unsigned long long) right_path->p_node[start].bh->b_blocknr,
2413 right_path->p_tree_depth);
2415 ret = ocfs2_extend_rotate_transaction(handle, start,
2416 orig_credits, right_path);
2422 ret = ocfs2_rotate_subtree_right(handle, et, left_path,
2429 if (split != SPLIT_NONE &&
2430 ocfs2_leftmost_rec_contains(path_leaf_el(right_path),
2433 * A rotate moves the rightmost left leaf
2434 * record over to the leftmost right leaf
2435 * slot. If we're doing an extent split
2436 * instead of a real insert, then we have to
2437 * check that the extent to be split wasn't
2438 * just moved over. If it was, then we can
2439 * exit here, passing left_path back -
2440 * ocfs2_split_extent() is smart enough to
2441 * search both leaves.
2443 *ret_left_path = left_path;
2448 * There is no need to re-read the next right path
2449 * as we know that it'll be our current left
2450 * path. Optimize by copying values instead.
2452 ocfs2_mv_path(right_path, left_path);
2454 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2462 ocfs2_free_path(left_path);
2468 static int ocfs2_update_edge_lengths(handle_t *handle,
2469 struct ocfs2_extent_tree *et,
2470 int subtree_index, struct ocfs2_path *path)
2473 struct ocfs2_extent_rec *rec;
2474 struct ocfs2_extent_list *el;
2475 struct ocfs2_extent_block *eb;
2479 * In normal tree rotation process, we will never touch the
2480 * tree branch above subtree_index and ocfs2_extend_rotate_transaction
2481 * doesn't reserve the credits for them either.
2483 * But we do have a special case here which will update the rightmost
2484 * records for all the bh in the path.
2485 * So we have to allocate extra credits and access them.
2487 ret = ocfs2_extend_trans(handle,
2488 handle->h_buffer_credits + subtree_index);
2494 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
2500 /* Path should always be rightmost. */
2501 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
2502 BUG_ON(eb->h_next_leaf_blk != 0ULL);
2505 BUG_ON(le16_to_cpu(el->l_next_free_rec) == 0);
2506 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2507 rec = &el->l_recs[idx];
2508 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2510 for (i = 0; i < path->p_tree_depth; i++) {
2511 el = path->p_node[i].el;
2512 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2513 rec = &el->l_recs[idx];
2515 rec->e_int_clusters = cpu_to_le32(range);
2516 le32_add_cpu(&rec->e_int_clusters, -le32_to_cpu(rec->e_cpos));
2518 ocfs2_journal_dirty(handle, path->p_node[i].bh);
2524 static void ocfs2_unlink_path(handle_t *handle,
2525 struct ocfs2_extent_tree *et,
2526 struct ocfs2_cached_dealloc_ctxt *dealloc,
2527 struct ocfs2_path *path, int unlink_start)
2530 struct ocfs2_extent_block *eb;
2531 struct ocfs2_extent_list *el;
2532 struct buffer_head *bh;
2534 for(i = unlink_start; i < path_num_items(path); i++) {
2535 bh = path->p_node[i].bh;
2537 eb = (struct ocfs2_extent_block *)bh->b_data;
2539 * Not all nodes might have had their final count
2540 * decremented by the caller - handle this here.
2543 if (le16_to_cpu(el->l_next_free_rec) > 1) {
2545 "Inode %llu, attempted to remove extent block "
2546 "%llu with %u records\n",
2547 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2548 (unsigned long long)le64_to_cpu(eb->h_blkno),
2549 le16_to_cpu(el->l_next_free_rec));
2551 ocfs2_journal_dirty(handle, bh);
2552 ocfs2_remove_from_cache(et->et_ci, bh);
2556 el->l_next_free_rec = 0;
2557 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2559 ocfs2_journal_dirty(handle, bh);
2561 ret = ocfs2_cache_extent_block_free(dealloc, eb);
2565 ocfs2_remove_from_cache(et->et_ci, bh);
2569 static void ocfs2_unlink_subtree(handle_t *handle,
2570 struct ocfs2_extent_tree *et,
2571 struct ocfs2_path *left_path,
2572 struct ocfs2_path *right_path,
2574 struct ocfs2_cached_dealloc_ctxt *dealloc)
2577 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2578 struct ocfs2_extent_list *root_el = left_path->p_node[subtree_index].el;
2579 struct ocfs2_extent_list *el;
2580 struct ocfs2_extent_block *eb;
2582 el = path_leaf_el(left_path);
2584 eb = (struct ocfs2_extent_block *)right_path->p_node[subtree_index + 1].bh->b_data;
2586 for(i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
2587 if (root_el->l_recs[i].e_blkno == eb->h_blkno)
2590 BUG_ON(i >= le16_to_cpu(root_el->l_next_free_rec));
2592 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
2593 le16_add_cpu(&root_el->l_next_free_rec, -1);
2595 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2596 eb->h_next_leaf_blk = 0;
2598 ocfs2_journal_dirty(handle, root_bh);
2599 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2601 ocfs2_unlink_path(handle, et, dealloc, right_path,
2605 static int ocfs2_rotate_subtree_left(handle_t *handle,
2606 struct ocfs2_extent_tree *et,
2607 struct ocfs2_path *left_path,
2608 struct ocfs2_path *right_path,
2610 struct ocfs2_cached_dealloc_ctxt *dealloc,
2613 int ret, i, del_right_subtree = 0, right_has_empty = 0;
2614 struct buffer_head *root_bh, *et_root_bh = path_root_bh(right_path);
2615 struct ocfs2_extent_list *right_leaf_el, *left_leaf_el;
2616 struct ocfs2_extent_block *eb;
2620 right_leaf_el = path_leaf_el(right_path);
2621 left_leaf_el = path_leaf_el(left_path);
2622 root_bh = left_path->p_node[subtree_index].bh;
2623 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2625 if (!ocfs2_is_empty_extent(&left_leaf_el->l_recs[0]))
2628 eb = (struct ocfs2_extent_block *)path_leaf_bh(right_path)->b_data;
2629 if (ocfs2_is_empty_extent(&right_leaf_el->l_recs[0])) {
2631 * It's legal for us to proceed if the right leaf is
2632 * the rightmost one and it has an empty extent. There
2633 * are two cases to handle - whether the leaf will be
2634 * empty after removal or not. If the leaf isn't empty
2635 * then just remove the empty extent up front. The
2636 * next block will handle empty leaves by flagging
2639 * Non rightmost leaves will throw -EAGAIN and the
2640 * caller can manually move the subtree and retry.
2643 if (eb->h_next_leaf_blk != 0ULL)
2646 if (le16_to_cpu(right_leaf_el->l_next_free_rec) > 1) {
2647 ret = ocfs2_journal_access_eb(handle, et->et_ci,
2648 path_leaf_bh(right_path),
2649 OCFS2_JOURNAL_ACCESS_WRITE);
2655 ocfs2_remove_empty_extent(right_leaf_el);
2657 right_has_empty = 1;
2660 if (eb->h_next_leaf_blk == 0ULL &&
2661 le16_to_cpu(right_leaf_el->l_next_free_rec) == 1) {
2663 * We have to update i_last_eb_blk during the meta
2666 ret = ocfs2_et_root_journal_access(handle, et,
2667 OCFS2_JOURNAL_ACCESS_WRITE);
2673 del_right_subtree = 1;
2677 * Getting here with an empty extent in the right path implies
2678 * that it's the rightmost path and will be deleted.
2680 BUG_ON(right_has_empty && !del_right_subtree);
2682 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2689 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2690 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2697 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2705 if (!right_has_empty) {
2707 * Only do this if we're moving a real
2708 * record. Otherwise, the action is delayed until
2709 * after removal of the right path in which case we
2710 * can do a simple shift to remove the empty extent.
2712 ocfs2_rotate_leaf(left_leaf_el, &right_leaf_el->l_recs[0]);
2713 memset(&right_leaf_el->l_recs[0], 0,
2714 sizeof(struct ocfs2_extent_rec));
2716 if (eb->h_next_leaf_blk == 0ULL) {
2718 * Move recs over to get rid of empty extent, decrease
2719 * next_free. This is allowed to remove the last
2720 * extent in our leaf (setting l_next_free_rec to
2721 * zero) - the delete code below won't care.
2723 ocfs2_remove_empty_extent(right_leaf_el);
2726 ret = ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2729 ret = ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
2733 if (del_right_subtree) {
2734 ocfs2_unlink_subtree(handle, et, left_path, right_path,
2735 subtree_index, dealloc);
2736 ret = ocfs2_update_edge_lengths(handle, et, subtree_index,
2743 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2744 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
2747 * Removal of the extent in the left leaf was skipped
2748 * above so we could delete the right path
2751 if (right_has_empty)
2752 ocfs2_remove_empty_extent(left_leaf_el);
2754 ret = ocfs2_journal_dirty(handle, et_root_bh);
2760 ocfs2_complete_edge_insert(handle, left_path, right_path,
2768 * Given a full path, determine what cpos value would return us a path
2769 * containing the leaf immediately to the right of the current one.
2771 * Will return zero if the path passed in is already the rightmost path.
2773 * This looks similar, but is subtly different to
2774 * ocfs2_find_cpos_for_left_leaf().
2776 static int ocfs2_find_cpos_for_right_leaf(struct super_block *sb,
2777 struct ocfs2_path *path, u32 *cpos)
2781 struct ocfs2_extent_list *el;
2785 if (path->p_tree_depth == 0)
2788 blkno = path_leaf_bh(path)->b_blocknr;
2790 /* Start at the tree node just above the leaf and work our way up. */
2791 i = path->p_tree_depth - 1;
2795 el = path->p_node[i].el;
2798 * Find the extent record just after the one in our
2801 next_free = le16_to_cpu(el->l_next_free_rec);
2802 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2803 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2804 if (j == (next_free - 1)) {
2807 * We've determined that the
2808 * path specified is already
2809 * the rightmost one - return a
2815 * The rightmost record points to our
2816 * leaf - we need to travel up the
2822 *cpos = le32_to_cpu(el->l_recs[j + 1].e_cpos);
2828 * If we got here, we never found a valid node where
2829 * the tree indicated one should be.
2832 "Invalid extent tree at extent block %llu\n",
2833 (unsigned long long)blkno);
2838 blkno = path->p_node[i].bh->b_blocknr;
2846 static int ocfs2_rotate_rightmost_leaf_left(struct inode *inode,
2848 struct ocfs2_path *path)
2851 struct buffer_head *bh = path_leaf_bh(path);
2852 struct ocfs2_extent_list *el = path_leaf_el(path);
2854 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
2857 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode), path,
2858 path_num_items(path) - 1);
2864 ocfs2_remove_empty_extent(el);
2866 ret = ocfs2_journal_dirty(handle, bh);
2874 static int __ocfs2_rotate_tree_left(struct inode *inode,
2875 handle_t *handle, int orig_credits,
2876 struct ocfs2_path *path,
2877 struct ocfs2_cached_dealloc_ctxt *dealloc,
2878 struct ocfs2_path **empty_extent_path,
2879 struct ocfs2_extent_tree *et)
2881 int ret, subtree_root, deleted;
2883 struct ocfs2_path *left_path = NULL;
2884 struct ocfs2_path *right_path = NULL;
2886 BUG_ON(!ocfs2_is_empty_extent(&(path_leaf_el(path)->l_recs[0])));
2888 *empty_extent_path = NULL;
2890 ret = ocfs2_find_cpos_for_right_leaf(inode->i_sb, path,
2897 left_path = ocfs2_new_path_from_path(path);
2904 ocfs2_cp_path(left_path, path);
2906 right_path = ocfs2_new_path_from_path(path);
2913 while (right_cpos) {
2914 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
2920 subtree_root = ocfs2_find_subtree_root(et, left_path,
2923 mlog(0, "Subtree root at index %d (blk %llu, depth %d)\n",
2925 (unsigned long long)
2926 right_path->p_node[subtree_root].bh->b_blocknr,
2927 right_path->p_tree_depth);
2929 ret = ocfs2_extend_rotate_transaction(handle, subtree_root,
2930 orig_credits, left_path);
2937 * Caller might still want to make changes to the
2938 * tree root, so re-add it to the journal here.
2940 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode),
2947 ret = ocfs2_rotate_subtree_left(handle, et, left_path,
2948 right_path, subtree_root,
2950 if (ret == -EAGAIN) {
2952 * The rotation has to temporarily stop due to
2953 * the right subtree having an empty
2954 * extent. Pass it back to the caller for a
2957 *empty_extent_path = right_path;
2967 * The subtree rotate might have removed records on
2968 * the rightmost edge. If so, then rotation is
2974 ocfs2_mv_path(left_path, right_path);
2976 ret = ocfs2_find_cpos_for_right_leaf(inode->i_sb, left_path,
2985 ocfs2_free_path(right_path);
2986 ocfs2_free_path(left_path);
2991 static int ocfs2_remove_rightmost_path(struct inode *inode, handle_t *handle,
2992 struct ocfs2_path *path,
2993 struct ocfs2_cached_dealloc_ctxt *dealloc,
2994 struct ocfs2_extent_tree *et)
2996 int ret, subtree_index;
2998 struct ocfs2_path *left_path = NULL;
2999 struct ocfs2_extent_block *eb;
3000 struct ocfs2_extent_list *el;
3003 ret = ocfs2_et_sanity_check(et);
3007 * There's two ways we handle this depending on
3008 * whether path is the only existing one.
3010 ret = ocfs2_extend_rotate_transaction(handle, 0,
3011 handle->h_buffer_credits,
3018 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
3024 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3033 * We have a path to the left of this one - it needs
3036 left_path = ocfs2_new_path_from_path(path);
3043 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
3049 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
3055 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
3057 ocfs2_unlink_subtree(handle, et, left_path, path,
3058 subtree_index, dealloc);
3059 ret = ocfs2_update_edge_lengths(handle, et, subtree_index,
3066 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
3067 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
3070 * 'path' is also the leftmost path which
3071 * means it must be the only one. This gets
3072 * handled differently because we want to
3073 * revert the inode back to having extents
3076 ocfs2_unlink_path(handle, et, dealloc, path, 1);
3078 el = et->et_root_el;
3079 el->l_tree_depth = 0;
3080 el->l_next_free_rec = 0;
3081 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3083 ocfs2_et_set_last_eb_blk(et, 0);
3086 ocfs2_journal_dirty(handle, path_root_bh(path));
3089 ocfs2_free_path(left_path);
3094 * Left rotation of btree records.
3096 * In many ways, this is (unsurprisingly) the opposite of right
3097 * rotation. We start at some non-rightmost path containing an empty
3098 * extent in the leaf block. The code works its way to the rightmost
3099 * path by rotating records to the left in every subtree.
3101 * This is used by any code which reduces the number of extent records
3102 * in a leaf. After removal, an empty record should be placed in the
3103 * leftmost list position.
3105 * This won't handle a length update of the rightmost path records if
3106 * the rightmost tree leaf record is removed so the caller is
3107 * responsible for detecting and correcting that.
3109 static int ocfs2_rotate_tree_left(struct inode *inode, handle_t *handle,
3110 struct ocfs2_path *path,
3111 struct ocfs2_cached_dealloc_ctxt *dealloc,
3112 struct ocfs2_extent_tree *et)
3114 int ret, orig_credits = handle->h_buffer_credits;
3115 struct ocfs2_path *tmp_path = NULL, *restart_path = NULL;
3116 struct ocfs2_extent_block *eb;
3117 struct ocfs2_extent_list *el;
3119 el = path_leaf_el(path);
3120 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
3123 if (path->p_tree_depth == 0) {
3124 rightmost_no_delete:
3126 * Inline extents. This is trivially handled, so do
3129 ret = ocfs2_rotate_rightmost_leaf_left(inode, handle,
3137 * Handle rightmost branch now. There's several cases:
3138 * 1) simple rotation leaving records in there. That's trivial.
3139 * 2) rotation requiring a branch delete - there's no more
3140 * records left. Two cases of this:
3141 * a) There are branches to the left.
3142 * b) This is also the leftmost (the only) branch.
3144 * 1) is handled via ocfs2_rotate_rightmost_leaf_left()
3145 * 2a) we need the left branch so that we can update it with the unlink
3146 * 2b) we need to bring the inode back to inline extents.
3149 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
3151 if (eb->h_next_leaf_blk == 0) {
3153 * This gets a bit tricky if we're going to delete the
3154 * rightmost path. Get the other cases out of the way
3157 if (le16_to_cpu(el->l_next_free_rec) > 1)
3158 goto rightmost_no_delete;
3160 if (le16_to_cpu(el->l_next_free_rec) == 0) {
3162 ocfs2_error(inode->i_sb,
3163 "Inode %llu has empty extent block at %llu",
3164 (unsigned long long)OCFS2_I(inode)->ip_blkno,
3165 (unsigned long long)le64_to_cpu(eb->h_blkno));
3170 * XXX: The caller can not trust "path" any more after
3171 * this as it will have been deleted. What do we do?
3173 * In theory the rotate-for-merge code will never get
3174 * here because it'll always ask for a rotate in a
3178 ret = ocfs2_remove_rightmost_path(inode, handle, path,
3186 * Now we can loop, remembering the path we get from -EAGAIN
3187 * and restarting from there.
3190 ret = __ocfs2_rotate_tree_left(inode, handle, orig_credits, path,
3191 dealloc, &restart_path, et);
3192 if (ret && ret != -EAGAIN) {
3197 while (ret == -EAGAIN) {
3198 tmp_path = restart_path;
3199 restart_path = NULL;
3201 ret = __ocfs2_rotate_tree_left(inode, handle, orig_credits,
3204 if (ret && ret != -EAGAIN) {
3209 ocfs2_free_path(tmp_path);
3217 ocfs2_free_path(tmp_path);
3218 ocfs2_free_path(restart_path);
3222 static void ocfs2_cleanup_merge(struct ocfs2_extent_list *el,
3225 struct ocfs2_extent_rec *rec = &el->l_recs[index];
3228 if (rec->e_leaf_clusters == 0) {
3230 * We consumed all of the merged-from record. An empty
3231 * extent cannot exist anywhere but the 1st array
3232 * position, so move things over if the merged-from
3233 * record doesn't occupy that position.
3235 * This creates a new empty extent so the caller
3236 * should be smart enough to have removed any existing
3240 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
3241 size = index * sizeof(struct ocfs2_extent_rec);
3242 memmove(&el->l_recs[1], &el->l_recs[0], size);
3246 * Always memset - the caller doesn't check whether it
3247 * created an empty extent, so there could be junk in
3250 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3254 static int ocfs2_get_right_path(struct inode *inode,
3255 struct ocfs2_path *left_path,
3256 struct ocfs2_path **ret_right_path)
3260 struct ocfs2_path *right_path = NULL;
3261 struct ocfs2_extent_list *left_el;
3263 *ret_right_path = NULL;
3265 /* This function shouldn't be called for non-trees. */
3266 BUG_ON(left_path->p_tree_depth == 0);
3268 left_el = path_leaf_el(left_path);
3269 BUG_ON(left_el->l_next_free_rec != left_el->l_count);
3271 ret = ocfs2_find_cpos_for_right_leaf(inode->i_sb, left_path,
3278 /* This function shouldn't be called for the rightmost leaf. */
3279 BUG_ON(right_cpos == 0);
3281 right_path = ocfs2_new_path_from_path(left_path);
3288 ret = ocfs2_find_path(INODE_CACHE(inode), right_path, right_cpos);
3294 *ret_right_path = right_path;
3297 ocfs2_free_path(right_path);
3302 * Remove split_rec clusters from the record at index and merge them
3303 * onto the beginning of the record "next" to it.
3304 * For index < l_count - 1, the next means the extent rec at index + 1.
3305 * For index == l_count - 1, the "next" means the 1st extent rec of the
3306 * next extent block.
3308 static int ocfs2_merge_rec_right(struct inode *inode,
3309 struct ocfs2_path *left_path,
3311 struct ocfs2_extent_tree *et,
3312 struct ocfs2_extent_rec *split_rec,
3315 int ret, next_free, i;
3316 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3317 struct ocfs2_extent_rec *left_rec;
3318 struct ocfs2_extent_rec *right_rec;
3319 struct ocfs2_extent_list *right_el;
3320 struct ocfs2_path *right_path = NULL;
3321 int subtree_index = 0;
3322 struct ocfs2_extent_list *el = path_leaf_el(left_path);
3323 struct buffer_head *bh = path_leaf_bh(left_path);
3324 struct buffer_head *root_bh = NULL;
3326 BUG_ON(index >= le16_to_cpu(el->l_next_free_rec));
3327 left_rec = &el->l_recs[index];
3329 if (index == le16_to_cpu(el->l_next_free_rec) - 1 &&
3330 le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count)) {
3331 /* we meet with a cross extent block merge. */
3332 ret = ocfs2_get_right_path(inode, left_path, &right_path);
3338 right_el = path_leaf_el(right_path);
3339 next_free = le16_to_cpu(right_el->l_next_free_rec);
3340 BUG_ON(next_free <= 0);
3341 right_rec = &right_el->l_recs[0];
3342 if (ocfs2_is_empty_extent(right_rec)) {
3343 BUG_ON(next_free <= 1);
3344 right_rec = &right_el->l_recs[1];
3347 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3348 le16_to_cpu(left_rec->e_leaf_clusters) !=
3349 le32_to_cpu(right_rec->e_cpos));
3351 subtree_index = ocfs2_find_subtree_root(et, left_path,
3354 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3355 handle->h_buffer_credits,
3362 root_bh = left_path->p_node[subtree_index].bh;
3363 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3365 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3372 for (i = subtree_index + 1;
3373 i < path_num_items(right_path); i++) {
3374 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3381 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3390 BUG_ON(index == le16_to_cpu(el->l_next_free_rec) - 1);
3391 right_rec = &el->l_recs[index + 1];
3394 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, left_path,
3395 path_num_items(left_path) - 1);
3401 le16_add_cpu(&left_rec->e_leaf_clusters, -split_clusters);
3403 le32_add_cpu(&right_rec->e_cpos, -split_clusters);
3404 le64_add_cpu(&right_rec->e_blkno,
3405 -ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3407 le16_add_cpu(&right_rec->e_leaf_clusters, split_clusters);
3409 ocfs2_cleanup_merge(el, index);
3411 ret = ocfs2_journal_dirty(handle, bh);
3416 ret = ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
3420 ocfs2_complete_edge_insert(handle, left_path, right_path,
3425 ocfs2_free_path(right_path);
3429 static int ocfs2_get_left_path(struct inode *inode,
3430 struct ocfs2_path *right_path,
3431 struct ocfs2_path **ret_left_path)
3435 struct ocfs2_path *left_path = NULL;
3437 *ret_left_path = NULL;
3439 /* This function shouldn't be called for non-trees. */
3440 BUG_ON(right_path->p_tree_depth == 0);
3442 ret = ocfs2_find_cpos_for_left_leaf(inode->i_sb,
3443 right_path, &left_cpos);
3449 /* This function shouldn't be called for the leftmost leaf. */
3450 BUG_ON(left_cpos == 0);
3452 left_path = ocfs2_new_path_from_path(right_path);
3459 ret = ocfs2_find_path(INODE_CACHE(inode), left_path, left_cpos);
3465 *ret_left_path = left_path;
3468 ocfs2_free_path(left_path);
3473 * Remove split_rec clusters from the record at index and merge them
3474 * onto the tail of the record "before" it.
3475 * For index > 0, the "before" means the extent rec at index - 1.
3477 * For index == 0, the "before" means the last record of the previous
3478 * extent block. And there is also a situation that we may need to
3479 * remove the rightmost leaf extent block in the right_path and change
3480 * the right path to indicate the new rightmost path.
3482 static int ocfs2_merge_rec_left(struct inode *inode,
3483 struct ocfs2_path *right_path,
3485 struct ocfs2_extent_rec *split_rec,
3486 struct ocfs2_cached_dealloc_ctxt *dealloc,
3487 struct ocfs2_extent_tree *et,
3490 int ret, i, subtree_index = 0, has_empty_extent = 0;
3491 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3492 struct ocfs2_extent_rec *left_rec;
3493 struct ocfs2_extent_rec *right_rec;
3494 struct ocfs2_extent_list *el = path_leaf_el(right_path);
3495 struct buffer_head *bh = path_leaf_bh(right_path);
3496 struct buffer_head *root_bh = NULL;
3497 struct ocfs2_path *left_path = NULL;
3498 struct ocfs2_extent_list *left_el;
3502 right_rec = &el->l_recs[index];
3504 /* we meet with a cross extent block merge. */
3505 ret = ocfs2_get_left_path(inode, right_path, &left_path);
3511 left_el = path_leaf_el(left_path);
3512 BUG_ON(le16_to_cpu(left_el->l_next_free_rec) !=
3513 le16_to_cpu(left_el->l_count));
3515 left_rec = &left_el->l_recs[
3516 le16_to_cpu(left_el->l_next_free_rec) - 1];
3517 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3518 le16_to_cpu(left_rec->e_leaf_clusters) !=
3519 le32_to_cpu(split_rec->e_cpos));
3521 subtree_index = ocfs2_find_subtree_root(et, left_path,
3524 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3525 handle->h_buffer_credits,
3532 root_bh = left_path->p_node[subtree_index].bh;
3533 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3535 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode), right_path,
3542 for (i = subtree_index + 1;
3543 i < path_num_items(right_path); i++) {
3544 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode),
3551 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode),
3559 left_rec = &el->l_recs[index - 1];
3560 if (ocfs2_is_empty_extent(&el->l_recs[0]))
3561 has_empty_extent = 1;
3564 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode), right_path,
3565 path_num_items(right_path) - 1);
3571 if (has_empty_extent && index == 1) {
3573 * The easy case - we can just plop the record right in.
3575 *left_rec = *split_rec;
3577 has_empty_extent = 0;
3579 le16_add_cpu(&left_rec->e_leaf_clusters, split_clusters);
3581 le32_add_cpu(&right_rec->e_cpos, split_clusters);
3582 le64_add_cpu(&right_rec->e_blkno,
3583 ocfs2_clusters_to_blocks(inode->i_sb, split_clusters));
3584 le16_add_cpu(&right_rec->e_leaf_clusters, -split_clusters);
3586 ocfs2_cleanup_merge(el, index);
3588 ret = ocfs2_journal_dirty(handle, bh);
3593 ret = ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
3598 * In the situation that the right_rec is empty and the extent
3599 * block is empty also, ocfs2_complete_edge_insert can't handle
3600 * it and we need to delete the right extent block.
3602 if (le16_to_cpu(right_rec->e_leaf_clusters) == 0 &&
3603 le16_to_cpu(el->l_next_free_rec) == 1) {
3605 ret = ocfs2_remove_rightmost_path(inode, handle,
3613 /* Now the rightmost extent block has been deleted.
3614 * So we use the new rightmost path.
3616 ocfs2_mv_path(right_path, left_path);
3619 ocfs2_complete_edge_insert(handle, left_path,
3620 right_path, subtree_index);
3624 ocfs2_free_path(left_path);
3628 static int ocfs2_try_to_merge_extent(struct inode *inode,
3630 struct ocfs2_path *path,
3632 struct ocfs2_extent_rec *split_rec,
3633 struct ocfs2_cached_dealloc_ctxt *dealloc,
3634 struct ocfs2_merge_ctxt *ctxt,
3635 struct ocfs2_extent_tree *et)
3639 struct ocfs2_extent_list *el = path_leaf_el(path);
3640 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
3642 BUG_ON(ctxt->c_contig_type == CONTIG_NONE);
3644 if (ctxt->c_split_covers_rec && ctxt->c_has_empty_extent) {
3646 * The merge code will need to create an empty
3647 * extent to take the place of the newly
3648 * emptied slot. Remove any pre-existing empty
3649 * extents - having more than one in a leaf is
3652 ret = ocfs2_rotate_tree_left(inode, handle, path,
3659 rec = &el->l_recs[split_index];
3662 if (ctxt->c_contig_type == CONTIG_LEFTRIGHT) {
3664 * Left-right contig implies this.
3666 BUG_ON(!ctxt->c_split_covers_rec);
3669 * Since the leftright insert always covers the entire
3670 * extent, this call will delete the insert record
3671 * entirely, resulting in an empty extent record added to
3674 * Since the adding of an empty extent shifts
3675 * everything back to the right, there's no need to
3676 * update split_index here.
3678 * When the split_index is zero, we need to merge it to the
3679 * prevoius extent block. It is more efficient and easier
3680 * if we do merge_right first and merge_left later.
3682 ret = ocfs2_merge_rec_right(inode, path,
3683 handle, et, split_rec,
3691 * We can only get this from logic error above.
3693 BUG_ON(!ocfs2_is_empty_extent(&el->l_recs[0]));
3695 /* The merge left us with an empty extent, remove it. */
3696 ret = ocfs2_rotate_tree_left(inode, handle, path,
3703 rec = &el->l_recs[split_index];
3706 * Note that we don't pass split_rec here on purpose -
3707 * we've merged it into the rec already.
3709 ret = ocfs2_merge_rec_left(inode, path,
3719 ret = ocfs2_rotate_tree_left(inode, handle, path,
3722 * Error from this last rotate is not critical, so
3723 * print but don't bubble it up.
3730 * Merge a record to the left or right.
3732 * 'contig_type' is relative to the existing record,
3733 * so for example, if we're "right contig", it's to
3734 * the record on the left (hence the left merge).
3736 if (ctxt->c_contig_type == CONTIG_RIGHT) {
3737 ret = ocfs2_merge_rec_left(inode,
3747 ret = ocfs2_merge_rec_right(inode, path, handle,
3756 if (ctxt->c_split_covers_rec) {
3758 * The merge may have left an empty extent in
3759 * our leaf. Try to rotate it away.
3761 ret = ocfs2_rotate_tree_left(inode, handle, path,
3773 static void ocfs2_subtract_from_rec(struct super_block *sb,
3774 enum ocfs2_split_type split,
3775 struct ocfs2_extent_rec *rec,
3776 struct ocfs2_extent_rec *split_rec)
3780 len_blocks = ocfs2_clusters_to_blocks(sb,
3781 le16_to_cpu(split_rec->e_leaf_clusters));
3783 if (split == SPLIT_LEFT) {
3785 * Region is on the left edge of the existing
3788 le32_add_cpu(&rec->e_cpos,
3789 le16_to_cpu(split_rec->e_leaf_clusters));
3790 le64_add_cpu(&rec->e_blkno, len_blocks);
3791 le16_add_cpu(&rec->e_leaf_clusters,
3792 -le16_to_cpu(split_rec->e_leaf_clusters));
3795 * Region is on the right edge of the existing
3798 le16_add_cpu(&rec->e_leaf_clusters,
3799 -le16_to_cpu(split_rec->e_leaf_clusters));
3804 * Do the final bits of extent record insertion at the target leaf
3805 * list. If this leaf is part of an allocation tree, it is assumed
3806 * that the tree above has been prepared.
3808 static void ocfs2_insert_at_leaf(struct ocfs2_extent_rec *insert_rec,
3809 struct ocfs2_extent_list *el,
3810 struct ocfs2_insert_type *insert,
3811 struct inode *inode)
3813 int i = insert->ins_contig_index;
3815 struct ocfs2_extent_rec *rec;
3817 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
3819 if (insert->ins_split != SPLIT_NONE) {
3820 i = ocfs2_search_extent_list(el, le32_to_cpu(insert_rec->e_cpos));
3822 rec = &el->l_recs[i];
3823 ocfs2_subtract_from_rec(inode->i_sb, insert->ins_split, rec,
3829 * Contiguous insert - either left or right.
3831 if (insert->ins_contig != CONTIG_NONE) {
3832 rec = &el->l_recs[i];
3833 if (insert->ins_contig == CONTIG_LEFT) {
3834 rec->e_blkno = insert_rec->e_blkno;
3835 rec->e_cpos = insert_rec->e_cpos;
3837 le16_add_cpu(&rec->e_leaf_clusters,
3838 le16_to_cpu(insert_rec->e_leaf_clusters));
3843 * Handle insert into an empty leaf.
3845 if (le16_to_cpu(el->l_next_free_rec) == 0 ||
3846 ((le16_to_cpu(el->l_next_free_rec) == 1) &&
3847 ocfs2_is_empty_extent(&el->l_recs[0]))) {
3848 el->l_recs[0] = *insert_rec;
3849 el->l_next_free_rec = cpu_to_le16(1);
3856 if (insert->ins_appending == APPEND_TAIL) {
3857 i = le16_to_cpu(el->l_next_free_rec) - 1;
3858 rec = &el->l_recs[i];
3859 range = le32_to_cpu(rec->e_cpos)
3860 + le16_to_cpu(rec->e_leaf_clusters);
3861 BUG_ON(le32_to_cpu(insert_rec->e_cpos) < range);
3863 mlog_bug_on_msg(le16_to_cpu(el->l_next_free_rec) >=
3864 le16_to_cpu(el->l_count),
3865 "inode %lu, depth %u, count %u, next free %u, "
3866 "rec.cpos %u, rec.clusters %u, "
3867 "insert.cpos %u, insert.clusters %u\n",
3869 le16_to_cpu(el->l_tree_depth),
3870 le16_to_cpu(el->l_count),
3871 le16_to_cpu(el->l_next_free_rec),
3872 le32_to_cpu(el->l_recs[i].e_cpos),
3873 le16_to_cpu(el->l_recs[i].e_leaf_clusters),
3874 le32_to_cpu(insert_rec->e_cpos),
3875 le16_to_cpu(insert_rec->e_leaf_clusters));
3877 el->l_recs[i] = *insert_rec;
3878 le16_add_cpu(&el->l_next_free_rec, 1);
3884 * Ok, we have to rotate.
3886 * At this point, it is safe to assume that inserting into an
3887 * empty leaf and appending to a leaf have both been handled
3890 * This leaf needs to have space, either by the empty 1st
3891 * extent record, or by virtue of an l_next_rec < l_count.
3893 ocfs2_rotate_leaf(el, insert_rec);
3896 static void ocfs2_adjust_rightmost_records(struct inode *inode,
3898 struct ocfs2_path *path,
3899 struct ocfs2_extent_rec *insert_rec)
3901 int ret, i, next_free;
3902 struct buffer_head *bh;
3903 struct ocfs2_extent_list *el;
3904 struct ocfs2_extent_rec *rec;
3907 * Update everything except the leaf block.
3909 for (i = 0; i < path->p_tree_depth; i++) {
3910 bh = path->p_node[i].bh;
3911 el = path->p_node[i].el;
3913 next_free = le16_to_cpu(el->l_next_free_rec);
3914 if (next_free == 0) {
3915 ocfs2_error(inode->i_sb,
3916 "Dinode %llu has a bad extent list",
3917 (unsigned long long)OCFS2_I(inode)->ip_blkno);
3922 rec = &el->l_recs[next_free - 1];
3924 rec->e_int_clusters = insert_rec->e_cpos;
3925 le32_add_cpu(&rec->e_int_clusters,
3926 le16_to_cpu(insert_rec->e_leaf_clusters));
3927 le32_add_cpu(&rec->e_int_clusters,
3928 -le32_to_cpu(rec->e_cpos));
3930 ret = ocfs2_journal_dirty(handle, bh);
3937 static int ocfs2_append_rec_to_path(struct inode *inode, handle_t *handle,
3938 struct ocfs2_extent_rec *insert_rec,
3939 struct ocfs2_path *right_path,
3940 struct ocfs2_path **ret_left_path)
3943 struct ocfs2_extent_list *el;
3944 struct ocfs2_path *left_path = NULL;
3946 *ret_left_path = NULL;
3949 * This shouldn't happen for non-trees. The extent rec cluster
3950 * count manipulation below only works for interior nodes.
3952 BUG_ON(right_path->p_tree_depth == 0);
3955 * If our appending insert is at the leftmost edge of a leaf,
3956 * then we might need to update the rightmost records of the
3959 el = path_leaf_el(right_path);
3960 next_free = le16_to_cpu(el->l_next_free_rec);
3961 if (next_free == 0 ||
3962 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
3965 ret = ocfs2_find_cpos_for_left_leaf(inode->i_sb, right_path,
3972 mlog(0, "Append may need a left path update. cpos: %u, "
3973 "left_cpos: %u\n", le32_to_cpu(insert_rec->e_cpos),
3977 * No need to worry if the append is already in the
3981 left_path = ocfs2_new_path_from_path(right_path);
3988 ret = ocfs2_find_path(INODE_CACHE(inode), left_path,
3996 * ocfs2_insert_path() will pass the left_path to the
4002 ret = ocfs2_journal_access_path(INODE_CACHE(inode), handle, right_path);
4008 ocfs2_adjust_rightmost_records(inode, handle, right_path, insert_rec);
4010 *ret_left_path = left_path;
4014 ocfs2_free_path(left_path);
4019 static void ocfs2_split_record(struct inode *inode,
4020 struct ocfs2_path *left_path,
4021 struct ocfs2_path *right_path,
4022 struct ocfs2_extent_rec *split_rec,
4023 enum ocfs2_split_type split)
4026 u32 cpos = le32_to_cpu(split_rec->e_cpos);
4027 struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el;
4028 struct ocfs2_extent_rec *rec, *tmprec;
4030 right_el = path_leaf_el(right_path);
4032 left_el = path_leaf_el(left_path);
4035 insert_el = right_el;
4036 index = ocfs2_search_extent_list(el, cpos);
4038 if (index == 0 && left_path) {
4039 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
4042 * This typically means that the record
4043 * started in the left path but moved to the
4044 * right as a result of rotation. We either
4045 * move the existing record to the left, or we
4046 * do the later insert there.
4048 * In this case, the left path should always
4049 * exist as the rotate code will have passed
4050 * it back for a post-insert update.
4053 if (split == SPLIT_LEFT) {
4055 * It's a left split. Since we know
4056 * that the rotate code gave us an
4057 * empty extent in the left path, we
4058 * can just do the insert there.
4060 insert_el = left_el;
4063 * Right split - we have to move the
4064 * existing record over to the left
4065 * leaf. The insert will be into the
4066 * newly created empty extent in the
4069 tmprec = &right_el->l_recs[index];
4070 ocfs2_rotate_leaf(left_el, tmprec);
4073 memset(tmprec, 0, sizeof(*tmprec));
4074 index = ocfs2_search_extent_list(left_el, cpos);
4075 BUG_ON(index == -1);
4080 BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0]));
4082 * Left path is easy - we can just allow the insert to
4086 insert_el = left_el;
4087 index = ocfs2_search_extent_list(el, cpos);
4088 BUG_ON(index == -1);
4091 rec = &el->l_recs[index];
4092 ocfs2_subtract_from_rec(inode->i_sb, split, rec, split_rec);
4093 ocfs2_rotate_leaf(insert_el, split_rec);
4097 * This function only does inserts on an allocation b-tree. For tree
4098 * depth = 0, ocfs2_insert_at_leaf() is called directly.
4100 * right_path is the path we want to do the actual insert
4101 * in. left_path should only be passed in if we need to update that
4102 * portion of the tree after an edge insert.
4104 static int ocfs2_insert_path(struct inode *inode,
4106 struct ocfs2_extent_tree *et,
4107 struct ocfs2_path *left_path,
4108 struct ocfs2_path *right_path,
4109 struct ocfs2_extent_rec *insert_rec,
4110 struct ocfs2_insert_type *insert)
4112 int ret, subtree_index;
4113 struct buffer_head *leaf_bh = path_leaf_bh(right_path);
4116 int credits = handle->h_buffer_credits;
4119 * There's a chance that left_path got passed back to
4120 * us without being accounted for in the
4121 * journal. Extend our transaction here to be sure we
4122 * can change those blocks.
4124 credits += left_path->p_tree_depth;
4126 ret = ocfs2_extend_trans(handle, credits);
4132 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
4140 * Pass both paths to the journal. The majority of inserts
4141 * will be touching all components anyway.
4143 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4149 if (insert->ins_split != SPLIT_NONE) {
4151 * We could call ocfs2_insert_at_leaf() for some types
4152 * of splits, but it's easier to just let one separate
4153 * function sort it all out.
4155 ocfs2_split_record(inode, left_path, right_path,
4156 insert_rec, insert->ins_split);
4159 * Split might have modified either leaf and we don't
4160 * have a guarantee that the later edge insert will
4161 * dirty this for us.
4164 ret = ocfs2_journal_dirty(handle,
4165 path_leaf_bh(left_path));
4169 ocfs2_insert_at_leaf(insert_rec, path_leaf_el(right_path),
4172 ret = ocfs2_journal_dirty(handle, leaf_bh);
4178 * The rotate code has indicated that we need to fix
4179 * up portions of the tree after the insert.
4181 * XXX: Should we extend the transaction here?
4183 subtree_index = ocfs2_find_subtree_root(et, left_path,
4185 ocfs2_complete_edge_insert(handle, left_path, right_path,
4194 static int ocfs2_do_insert_extent(struct inode *inode,
4196 struct ocfs2_extent_tree *et,
4197 struct ocfs2_extent_rec *insert_rec,
4198 struct ocfs2_insert_type *type)
4200 int ret, rotate = 0;
4202 struct ocfs2_path *right_path = NULL;
4203 struct ocfs2_path *left_path = NULL;
4204 struct ocfs2_extent_list *el;
4206 el = et->et_root_el;
4208 ret = ocfs2_et_root_journal_access(handle, et,
4209 OCFS2_JOURNAL_ACCESS_WRITE);
4215 if (le16_to_cpu(el->l_tree_depth) == 0) {
4216 ocfs2_insert_at_leaf(insert_rec, el, type, inode);
4217 goto out_update_clusters;
4220 right_path = ocfs2_new_path_from_et(et);
4228 * Determine the path to start with. Rotations need the
4229 * rightmost path, everything else can go directly to the
4232 cpos = le32_to_cpu(insert_rec->e_cpos);
4233 if (type->ins_appending == APPEND_NONE &&
4234 type->ins_contig == CONTIG_NONE) {
4239 ret = ocfs2_find_path(et->et_ci, right_path, cpos);
4246 * Rotations and appends need special treatment - they modify
4247 * parts of the tree's above them.
4249 * Both might pass back a path immediate to the left of the
4250 * one being inserted to. This will be cause
4251 * ocfs2_insert_path() to modify the rightmost records of
4252 * left_path to account for an edge insert.
4254 * XXX: When modifying this code, keep in mind that an insert
4255 * can wind up skipping both of these two special cases...
4258 ret = ocfs2_rotate_tree_right(handle, et, type->ins_split,
4259 le32_to_cpu(insert_rec->e_cpos),
4260 right_path, &left_path);
4267 * ocfs2_rotate_tree_right() might have extended the
4268 * transaction without re-journaling our tree root.
4270 ret = ocfs2_et_root_journal_access(handle, et,
4271 OCFS2_JOURNAL_ACCESS_WRITE);
4276 } else if (type->ins_appending == APPEND_TAIL
4277 && type->ins_contig != CONTIG_LEFT) {
4278 ret = ocfs2_append_rec_to_path(inode, handle, insert_rec,
4279 right_path, &left_path);
4286 ret = ocfs2_insert_path(inode, handle, et, left_path, right_path,
4293 out_update_clusters:
4294 if (type->ins_split == SPLIT_NONE)
4295 ocfs2_et_update_clusters(et,
4296 le16_to_cpu(insert_rec->e_leaf_clusters));
4298 ret = ocfs2_journal_dirty(handle, et->et_root_bh);
4303 ocfs2_free_path(left_path);
4304 ocfs2_free_path(right_path);
4309 static enum ocfs2_contig_type
4310 ocfs2_figure_merge_contig_type(struct inode *inode, struct ocfs2_path *path,
4311 struct ocfs2_extent_list *el, int index,
4312 struct ocfs2_extent_rec *split_rec)
4315 enum ocfs2_contig_type ret = CONTIG_NONE;
4316 u32 left_cpos, right_cpos;
4317 struct ocfs2_extent_rec *rec = NULL;
4318 struct ocfs2_extent_list *new_el;
4319 struct ocfs2_path *left_path = NULL, *right_path = NULL;
4320 struct buffer_head *bh;
4321 struct ocfs2_extent_block *eb;
4324 rec = &el->l_recs[index - 1];
4325 } else if (path->p_tree_depth > 0) {
4326 status = ocfs2_find_cpos_for_left_leaf(inode->i_sb,
4331 if (left_cpos != 0) {
4332 left_path = ocfs2_new_path_from_path(path);
4336 status = ocfs2_find_path(INODE_CACHE(inode),
4337 left_path, left_cpos);
4341 new_el = path_leaf_el(left_path);
4343 if (le16_to_cpu(new_el->l_next_free_rec) !=
4344 le16_to_cpu(new_el->l_count)) {
4345 bh = path_leaf_bh(left_path);
4346 eb = (struct ocfs2_extent_block *)bh->b_data;
4347 ocfs2_error(inode->i_sb,
4348 "Extent block #%llu has an "
4349 "invalid l_next_free_rec of "
4350 "%d. It should have "
4351 "matched the l_count of %d",
4352 (unsigned long long)le64_to_cpu(eb->h_blkno),
4353 le16_to_cpu(new_el->l_next_free_rec),
4354 le16_to_cpu(new_el->l_count));
4358 rec = &new_el->l_recs[
4359 le16_to_cpu(new_el->l_next_free_rec) - 1];
4364 * We're careful to check for an empty extent record here -
4365 * the merge code will know what to do if it sees one.
4368 if (index == 1 && ocfs2_is_empty_extent(rec)) {
4369 if (split_rec->e_cpos == el->l_recs[index].e_cpos)
4372 ret = ocfs2_extent_contig(inode, rec, split_rec);
4377 if (index < (le16_to_cpu(el->l_next_free_rec) - 1))
4378 rec = &el->l_recs[index + 1];
4379 else if (le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count) &&
4380 path->p_tree_depth > 0) {
4381 status = ocfs2_find_cpos_for_right_leaf(inode->i_sb,
4386 if (right_cpos == 0)
4389 right_path = ocfs2_new_path_from_path(path);
4393 status = ocfs2_find_path(INODE_CACHE(inode), right_path, right_cpos);
4397 new_el = path_leaf_el(right_path);
4398 rec = &new_el->l_recs[0];
4399 if (ocfs2_is_empty_extent(rec)) {
4400 if (le16_to_cpu(new_el->l_next_free_rec) <= 1) {
4401 bh = path_leaf_bh(right_path);
4402 eb = (struct ocfs2_extent_block *)bh->b_data;
4403 ocfs2_error(inode->i_sb,
4404 "Extent block #%llu has an "
4405 "invalid l_next_free_rec of %d",
4406 (unsigned long long)le64_to_cpu(eb->h_blkno),
4407 le16_to_cpu(new_el->l_next_free_rec));
4411 rec = &new_el->l_recs[1];
4416 enum ocfs2_contig_type contig_type;
4418 contig_type = ocfs2_extent_contig(inode, rec, split_rec);
4420 if (contig_type == CONTIG_LEFT && ret == CONTIG_RIGHT)
4421 ret = CONTIG_LEFTRIGHT;
4422 else if (ret == CONTIG_NONE)
4428 ocfs2_free_path(left_path);
4430 ocfs2_free_path(right_path);
4435 static void ocfs2_figure_contig_type(struct inode *inode,
4436 struct ocfs2_insert_type *insert,
4437 struct ocfs2_extent_list *el,
4438 struct ocfs2_extent_rec *insert_rec,
4439 struct ocfs2_extent_tree *et)
4442 enum ocfs2_contig_type contig_type = CONTIG_NONE;
4444 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4446 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
4447 contig_type = ocfs2_extent_contig(inode, &el->l_recs[i],
4449 if (contig_type != CONTIG_NONE) {
4450 insert->ins_contig_index = i;
4454 insert->ins_contig = contig_type;
4456 if (insert->ins_contig != CONTIG_NONE) {
4457 struct ocfs2_extent_rec *rec =
4458 &el->l_recs[insert->ins_contig_index];
4459 unsigned int len = le16_to_cpu(rec->e_leaf_clusters) +
4460 le16_to_cpu(insert_rec->e_leaf_clusters);
4463 * Caller might want us to limit the size of extents, don't
4464 * calculate contiguousness if we might exceed that limit.
4466 if (et->et_max_leaf_clusters &&
4467 (len > et->et_max_leaf_clusters))
4468 insert->ins_contig = CONTIG_NONE;
4473 * This should only be called against the righmost leaf extent list.
4475 * ocfs2_figure_appending_type() will figure out whether we'll have to
4476 * insert at the tail of the rightmost leaf.
4478 * This should also work against the root extent list for tree's with 0
4479 * depth. If we consider the root extent list to be the rightmost leaf node
4480 * then the logic here makes sense.
4482 static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert,
4483 struct ocfs2_extent_list *el,
4484 struct ocfs2_extent_rec *insert_rec)
4487 u32 cpos = le32_to_cpu(insert_rec->e_cpos);
4488 struct ocfs2_extent_rec *rec;
4490 insert->ins_appending = APPEND_NONE;
4492 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4494 if (!el->l_next_free_rec)
4495 goto set_tail_append;
4497 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
4498 /* Were all records empty? */
4499 if (le16_to_cpu(el->l_next_free_rec) == 1)
4500 goto set_tail_append;
4503 i = le16_to_cpu(el->l_next_free_rec) - 1;
4504 rec = &el->l_recs[i];
4507 (le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)))
4508 goto set_tail_append;
4513 insert->ins_appending = APPEND_TAIL;
4517 * Helper function called at the begining of an insert.
4519 * This computes a few things that are commonly used in the process of
4520 * inserting into the btree:
4521 * - Whether the new extent is contiguous with an existing one.
4522 * - The current tree depth.
4523 * - Whether the insert is an appending one.
4524 * - The total # of free records in the tree.
4526 * All of the information is stored on the ocfs2_insert_type
4529 static int ocfs2_figure_insert_type(struct inode *inode,
4530 struct ocfs2_extent_tree *et,
4531 struct buffer_head **last_eb_bh,
4532 struct ocfs2_extent_rec *insert_rec,
4534 struct ocfs2_insert_type *insert)
4537 struct ocfs2_extent_block *eb;
4538 struct ocfs2_extent_list *el;
4539 struct ocfs2_path *path = NULL;
4540 struct buffer_head *bh = NULL;
4542 insert->ins_split = SPLIT_NONE;
4544 el = et->et_root_el;
4545 insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth);
4547 if (el->l_tree_depth) {
4549 * If we have tree depth, we read in the
4550 * rightmost extent block ahead of time as
4551 * ocfs2_figure_insert_type() and ocfs2_add_branch()
4552 * may want it later.
4554 ret = ocfs2_read_extent_block(et->et_ci,
4555 ocfs2_et_get_last_eb_blk(et),
4561 eb = (struct ocfs2_extent_block *) bh->b_data;
4566 * Unless we have a contiguous insert, we'll need to know if
4567 * there is room left in our allocation tree for another
4570 * XXX: This test is simplistic, we can search for empty
4571 * extent records too.
4573 *free_records = le16_to_cpu(el->l_count) -
4574 le16_to_cpu(el->l_next_free_rec);
4576 if (!insert->ins_tree_depth) {
4577 ocfs2_figure_contig_type(inode, insert, el, insert_rec, et);
4578 ocfs2_figure_appending_type(insert, el, insert_rec);
4582 path = ocfs2_new_path_from_et(et);
4590 * In the case that we're inserting past what the tree
4591 * currently accounts for, ocfs2_find_path() will return for
4592 * us the rightmost tree path. This is accounted for below in
4593 * the appending code.
4595 ret = ocfs2_find_path(et->et_ci, path, le32_to_cpu(insert_rec->e_cpos));
4601 el = path_leaf_el(path);
4604 * Now that we have the path, there's two things we want to determine:
4605 * 1) Contiguousness (also set contig_index if this is so)
4607 * 2) Are we doing an append? We can trivially break this up
4608 * into two types of appends: simple record append, or a
4609 * rotate inside the tail leaf.
4611 ocfs2_figure_contig_type(inode, insert, el, insert_rec, et);
4614 * The insert code isn't quite ready to deal with all cases of
4615 * left contiguousness. Specifically, if it's an insert into
4616 * the 1st record in a leaf, it will require the adjustment of
4617 * cluster count on the last record of the path directly to it's
4618 * left. For now, just catch that case and fool the layers
4619 * above us. This works just fine for tree_depth == 0, which
4620 * is why we allow that above.
4622 if (insert->ins_contig == CONTIG_LEFT &&
4623 insert->ins_contig_index == 0)
4624 insert->ins_contig = CONTIG_NONE;
4627 * Ok, so we can simply compare against last_eb to figure out
4628 * whether the path doesn't exist. This will only happen in
4629 * the case that we're doing a tail append, so maybe we can
4630 * take advantage of that information somehow.
4632 if (ocfs2_et_get_last_eb_blk(et) ==
4633 path_leaf_bh(path)->b_blocknr) {
4635 * Ok, ocfs2_find_path() returned us the rightmost
4636 * tree path. This might be an appending insert. There are
4638 * 1) We're doing a true append at the tail:
4639 * -This might even be off the end of the leaf
4640 * 2) We're "appending" by rotating in the tail
4642 ocfs2_figure_appending_type(insert, el, insert_rec);
4646 ocfs2_free_path(path);
4656 * Insert an extent into an inode btree.
4658 * The caller needs to update fe->i_clusters
4660 int ocfs2_insert_extent(struct ocfs2_super *osb,
4662 struct inode *inode,
4663 struct ocfs2_extent_tree *et,
4668 struct ocfs2_alloc_context *meta_ac)
4671 int uninitialized_var(free_records);
4672 struct buffer_head *last_eb_bh = NULL;
4673 struct ocfs2_insert_type insert = {0, };
4674 struct ocfs2_extent_rec rec;
4676 mlog(0, "add %u clusters at position %u to inode %llu\n",
4677 new_clusters, cpos, (unsigned long long)OCFS2_I(inode)->ip_blkno);
4679 memset(&rec, 0, sizeof(rec));
4680 rec.e_cpos = cpu_to_le32(cpos);
4681 rec.e_blkno = cpu_to_le64(start_blk);
4682 rec.e_leaf_clusters = cpu_to_le16(new_clusters);
4683 rec.e_flags = flags;
4684 status = ocfs2_et_insert_check(et, &rec);
4690 status = ocfs2_figure_insert_type(inode, et, &last_eb_bh, &rec,
4691 &free_records, &insert);
4697 mlog(0, "Insert.appending: %u, Insert.Contig: %u, "
4698 "Insert.contig_index: %d, Insert.free_records: %d, "
4699 "Insert.tree_depth: %d\n",
4700 insert.ins_appending, insert.ins_contig, insert.ins_contig_index,
4701 free_records, insert.ins_tree_depth);
4703 if (insert.ins_contig == CONTIG_NONE && free_records == 0) {
4704 status = ocfs2_grow_tree(inode, handle, et,
4705 &insert.ins_tree_depth, &last_eb_bh,
4713 /* Finally, we can add clusters. This might rotate the tree for us. */
4714 status = ocfs2_do_insert_extent(inode, handle, et, &rec, &insert);
4717 else if (et->et_ops == &ocfs2_dinode_et_ops)
4718 ocfs2_extent_map_insert_rec(inode, &rec);
4728 * Allcate and add clusters into the extent b-tree.
4729 * The new clusters(clusters_to_add) will be inserted at logical_offset.
4730 * The extent b-tree's root is specified by et, and
4731 * it is not limited to the file storage. Any extent tree can use this
4732 * function if it implements the proper ocfs2_extent_tree.
4734 int ocfs2_add_clusters_in_btree(struct ocfs2_super *osb,
4735 struct inode *inode,
4736 u32 *logical_offset,
4737 u32 clusters_to_add,
4739 struct ocfs2_extent_tree *et,
4741 struct ocfs2_alloc_context *data_ac,
4742 struct ocfs2_alloc_context *meta_ac,
4743 enum ocfs2_alloc_restarted *reason_ret)
4747 enum ocfs2_alloc_restarted reason = RESTART_NONE;
4748 u32 bit_off, num_bits;
4752 BUG_ON(!clusters_to_add);
4755 flags = OCFS2_EXT_UNWRITTEN;
4757 free_extents = ocfs2_num_free_extents(osb, et);
4758 if (free_extents < 0) {
4759 status = free_extents;
4764 /* there are two cases which could cause us to EAGAIN in the
4765 * we-need-more-metadata case:
4766 * 1) we haven't reserved *any*
4767 * 2) we are so fragmented, we've needed to add metadata too
4769 if (!free_extents && !meta_ac) {
4770 mlog(0, "we haven't reserved any metadata!\n");
4772 reason = RESTART_META;
4774 } else if ((!free_extents)
4775 && (ocfs2_alloc_context_bits_left(meta_ac)
4776 < ocfs2_extend_meta_needed(et->et_root_el))) {
4777 mlog(0, "filesystem is really fragmented...\n");
4779 reason = RESTART_META;
4783 status = __ocfs2_claim_clusters(osb, handle, data_ac, 1,
4784 clusters_to_add, &bit_off, &num_bits);
4786 if (status != -ENOSPC)
4791 BUG_ON(num_bits > clusters_to_add);
4793 /* reserve our write early -- insert_extent may update the tree root */
4794 status = ocfs2_et_root_journal_access(handle, et,
4795 OCFS2_JOURNAL_ACCESS_WRITE);
4801 block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
4802 mlog(0, "Allocating %u clusters at block %u for inode %llu\n",
4803 num_bits, bit_off, (unsigned long long)OCFS2_I(inode)->ip_blkno);
4804 status = ocfs2_insert_extent(osb, handle, inode, et,
4805 *logical_offset, block,
4806 num_bits, flags, meta_ac);
4812 status = ocfs2_journal_dirty(handle, et->et_root_bh);
4818 clusters_to_add -= num_bits;
4819 *logical_offset += num_bits;
4821 if (clusters_to_add) {
4822 mlog(0, "need to alloc once more, wanted = %u\n",
4825 reason = RESTART_TRANS;
4831 *reason_ret = reason;
4835 static void ocfs2_make_right_split_rec(struct super_block *sb,
4836 struct ocfs2_extent_rec *split_rec,
4838 struct ocfs2_extent_rec *rec)
4840 u32 rec_cpos = le32_to_cpu(rec->e_cpos);
4841 u32 rec_range = rec_cpos + le16_to_cpu(rec->e_leaf_clusters);
4843 memset(split_rec, 0, sizeof(struct ocfs2_extent_rec));
4845 split_rec->e_cpos = cpu_to_le32(cpos);
4846 split_rec->e_leaf_clusters = cpu_to_le16(rec_range - cpos);
4848 split_rec->e_blkno = rec->e_blkno;
4849 le64_add_cpu(&split_rec->e_blkno,
4850 ocfs2_clusters_to_blocks(sb, cpos - rec_cpos));
4852 split_rec->e_flags = rec->e_flags;
4855 static int ocfs2_split_and_insert(struct inode *inode,
4857 struct ocfs2_path *path,
4858 struct ocfs2_extent_tree *et,
4859 struct buffer_head **last_eb_bh,
4861 struct ocfs2_extent_rec *orig_split_rec,
4862 struct ocfs2_alloc_context *meta_ac)
4865 unsigned int insert_range, rec_range, do_leftright = 0;
4866 struct ocfs2_extent_rec tmprec;
4867 struct ocfs2_extent_list *rightmost_el;
4868 struct ocfs2_extent_rec rec;
4869 struct ocfs2_extent_rec split_rec = *orig_split_rec;
4870 struct ocfs2_insert_type insert;
4871 struct ocfs2_extent_block *eb;
4875 * Store a copy of the record on the stack - it might move
4876 * around as the tree is manipulated below.
4878 rec = path_leaf_el(path)->l_recs[split_index];
4880 rightmost_el = et->et_root_el;
4882 depth = le16_to_cpu(rightmost_el->l_tree_depth);
4884 BUG_ON(!(*last_eb_bh));
4885 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
4886 rightmost_el = &eb->h_list;
4889 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
4890 le16_to_cpu(rightmost_el->l_count)) {
4891 ret = ocfs2_grow_tree(inode, handle, et,
4892 &depth, last_eb_bh, meta_ac);
4899 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
4900 insert.ins_appending = APPEND_NONE;
4901 insert.ins_contig = CONTIG_NONE;
4902 insert.ins_tree_depth = depth;
4904 insert_range = le32_to_cpu(split_rec.e_cpos) +
4905 le16_to_cpu(split_rec.e_leaf_clusters);
4906 rec_range = le32_to_cpu(rec.e_cpos) +
4907 le16_to_cpu(rec.e_leaf_clusters);
4909 if (split_rec.e_cpos == rec.e_cpos) {
4910 insert.ins_split = SPLIT_LEFT;
4911 } else if (insert_range == rec_range) {
4912 insert.ins_split = SPLIT_RIGHT;
4915 * Left/right split. We fake this as a right split
4916 * first and then make a second pass as a left split.
4918 insert.ins_split = SPLIT_RIGHT;
4920 ocfs2_make_right_split_rec(inode->i_sb, &tmprec, insert_range,
4925 BUG_ON(do_leftright);
4929 ret = ocfs2_do_insert_extent(inode, handle, et, &split_rec, &insert);
4935 if (do_leftright == 1) {
4937 struct ocfs2_extent_list *el;
4940 split_rec = *orig_split_rec;
4942 ocfs2_reinit_path(path, 1);
4944 cpos = le32_to_cpu(split_rec.e_cpos);
4945 ret = ocfs2_find_path(et->et_ci, path, cpos);
4951 el = path_leaf_el(path);
4952 split_index = ocfs2_search_extent_list(el, cpos);
4960 static int ocfs2_replace_extent_rec(struct inode *inode,
4962 struct ocfs2_path *path,
4963 struct ocfs2_extent_list *el,
4965 struct ocfs2_extent_rec *split_rec)
4969 ret = ocfs2_path_bh_journal_access(handle, INODE_CACHE(inode), path,
4970 path_num_items(path) - 1);
4976 el->l_recs[split_index] = *split_rec;
4978 ocfs2_journal_dirty(handle, path_leaf_bh(path));
4984 * Mark part or all of the extent record at split_index in the leaf
4985 * pointed to by path as written. This removes the unwritten
4988 * Care is taken to handle contiguousness so as to not grow the tree.
4990 * meta_ac is not strictly necessary - we only truly need it if growth
4991 * of the tree is required. All other cases will degrade into a less
4992 * optimal tree layout.
4994 * last_eb_bh should be the rightmost leaf block for any extent
4995 * btree. Since a split may grow the tree or a merge might shrink it,
4996 * the caller cannot trust the contents of that buffer after this call.
4998 * This code is optimized for readability - several passes might be
4999 * made over certain portions of the tree. All of those blocks will
5000 * have been brought into cache (and pinned via the journal), so the
5001 * extra overhead is not expressed in terms of disk reads.
5003 static int __ocfs2_mark_extent_written(struct inode *inode,
5004 struct ocfs2_extent_tree *et,
5006 struct ocfs2_path *path,
5008 struct ocfs2_extent_rec *split_rec,
5009 struct ocfs2_alloc_context *meta_ac,
5010 struct ocfs2_cached_dealloc_ctxt *dealloc)
5013 struct ocfs2_extent_list *el = path_leaf_el(path);
5014 struct buffer_head *last_eb_bh = NULL;
5015 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
5016 struct ocfs2_merge_ctxt ctxt;
5017 struct ocfs2_extent_list *rightmost_el;
5019 if (!(rec->e_flags & OCFS2_EXT_UNWRITTEN)) {
5025 if (le32_to_cpu(rec->e_cpos) > le32_to_cpu(split_rec->e_cpos) ||
5026 ((le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)) <
5027 (le32_to_cpu(split_rec->e_cpos) + le16_to_cpu(split_rec->e_leaf_clusters)))) {
5033 ctxt.c_contig_type = ocfs2_figure_merge_contig_type(inode, path, el,
5038 * The core merge / split code wants to know how much room is
5039 * left in this inodes allocation tree, so we pass the
5040 * rightmost extent list.
5042 if (path->p_tree_depth) {
5043 struct ocfs2_extent_block *eb;
5045 ret = ocfs2_read_extent_block(et->et_ci,
5046 ocfs2_et_get_last_eb_blk(et),
5053 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5054 rightmost_el = &eb->h_list;
5056 rightmost_el = path_root_el(path);
5058 if (rec->e_cpos == split_rec->e_cpos &&
5059 rec->e_leaf_clusters == split_rec->e_leaf_clusters)
5060 ctxt.c_split_covers_rec = 1;
5062 ctxt.c_split_covers_rec = 0;
5064 ctxt.c_has_empty_extent = ocfs2_is_empty_extent(&el->l_recs[0]);
5066 mlog(0, "index: %d, contig: %u, has_empty: %u, split_covers: %u\n",
5067 split_index, ctxt.c_contig_type, ctxt.c_has_empty_extent,
5068 ctxt.c_split_covers_rec);
5070 if (ctxt.c_contig_type == CONTIG_NONE) {
5071 if (ctxt.c_split_covers_rec)
5072 ret = ocfs2_replace_extent_rec(inode, handle,
5074 split_index, split_rec);
5076 ret = ocfs2_split_and_insert(inode, handle, path, et,
5077 &last_eb_bh, split_index,
5078 split_rec, meta_ac);
5082 ret = ocfs2_try_to_merge_extent(inode, handle, path,
5083 split_index, split_rec,
5084 dealloc, &ctxt, et);
5095 * Mark the already-existing extent at cpos as written for len clusters.
5097 * If the existing extent is larger than the request, initiate a
5098 * split. An attempt will be made at merging with adjacent extents.
5100 * The caller is responsible for passing down meta_ac if we'll need it.
5102 int ocfs2_mark_extent_written(struct inode *inode,
5103 struct ocfs2_extent_tree *et,
5104 handle_t *handle, u32 cpos, u32 len, u32 phys,
5105 struct ocfs2_alloc_context *meta_ac,
5106 struct ocfs2_cached_dealloc_ctxt *dealloc)
5109 u64 start_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys);
5110 struct ocfs2_extent_rec split_rec;
5111 struct ocfs2_path *left_path = NULL;
5112 struct ocfs2_extent_list *el;
5114 mlog(0, "Inode %lu cpos %u, len %u, phys %u (%llu)\n",
5115 inode->i_ino, cpos, len, phys, (unsigned long long)start_blkno);
5117 if (!ocfs2_writes_unwritten_extents(OCFS2_SB(inode->i_sb))) {
5118 ocfs2_error(inode->i_sb, "Inode %llu has unwritten extents "
5119 "that are being written to, but the feature bit "
5120 "is not set in the super block.",
5121 (unsigned long long)OCFS2_I(inode)->ip_blkno);
5127 * XXX: This should be fixed up so that we just re-insert the
5128 * next extent records.
5130 * XXX: This is a hack on the extent tree, maybe it should be
5133 if (et->et_ops == &ocfs2_dinode_et_ops)
5134 ocfs2_extent_map_trunc(inode, 0);
5136 left_path = ocfs2_new_path_from_et(et);
5143 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
5148 el = path_leaf_el(left_path);
5150 index = ocfs2_search_extent_list(el, cpos);
5151 if (index == -1 || index >= le16_to_cpu(el->l_next_free_rec)) {
5152 ocfs2_error(inode->i_sb,
5153 "Inode %llu has an extent at cpos %u which can no "
5154 "longer be found.\n",
5155 (unsigned long long)OCFS2_I(inode)->ip_blkno, cpos);
5160 memset(&split_rec, 0, sizeof(struct ocfs2_extent_rec));
5161 split_rec.e_cpos = cpu_to_le32(cpos);
5162 split_rec.e_leaf_clusters = cpu_to_le16(len);
5163 split_rec.e_blkno = cpu_to_le64(start_blkno);
5164 split_rec.e_flags = path_leaf_el(left_path)->l_recs[index].e_flags;
5165 split_rec.e_flags &= ~OCFS2_EXT_UNWRITTEN;
5167 ret = __ocfs2_mark_extent_written(inode, et, handle, left_path,
5168 index, &split_rec, meta_ac,
5174 ocfs2_free_path(left_path);
5178 static int ocfs2_split_tree(struct inode *inode, struct ocfs2_extent_tree *et,
5179 handle_t *handle, struct ocfs2_path *path,
5180 int index, u32 new_range,
5181 struct ocfs2_alloc_context *meta_ac)
5183 int ret, depth, credits = handle->h_buffer_credits;
5184 struct buffer_head *last_eb_bh = NULL;
5185 struct ocfs2_extent_block *eb;
5186 struct ocfs2_extent_list *rightmost_el, *el;
5187 struct ocfs2_extent_rec split_rec;
5188 struct ocfs2_extent_rec *rec;
5189 struct ocfs2_insert_type insert;
5192 * Setup the record to split before we grow the tree.
5194 el = path_leaf_el(path);
5195 rec = &el->l_recs[index];
5196 ocfs2_make_right_split_rec(inode->i_sb, &split_rec, new_range, rec);
5198 depth = path->p_tree_depth;
5200 ret = ocfs2_read_extent_block(et->et_ci,
5201 ocfs2_et_get_last_eb_blk(et),
5208 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5209 rightmost_el = &eb->h_list;
5211 rightmost_el = path_leaf_el(path);
5213 credits += path->p_tree_depth +
5214 ocfs2_extend_meta_needed(et->et_root_el);
5215 ret = ocfs2_extend_trans(handle, credits);
5221 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
5222 le16_to_cpu(rightmost_el->l_count)) {
5223 ret = ocfs2_grow_tree(inode, handle, et, &depth, &last_eb_bh,
5231 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
5232 insert.ins_appending = APPEND_NONE;
5233 insert.ins_contig = CONTIG_NONE;
5234 insert.ins_split = SPLIT_RIGHT;
5235 insert.ins_tree_depth = depth;
5237 ret = ocfs2_do_insert_extent(inode, handle, et, &split_rec, &insert);
5246 static int ocfs2_truncate_rec(struct inode *inode, handle_t *handle,
5247 struct ocfs2_path *path, int index,
5248 struct ocfs2_cached_dealloc_ctxt *dealloc,
5250 struct ocfs2_extent_tree *et)
5253 u32 left_cpos, rec_range, trunc_range;
5254 int wants_rotate = 0, is_rightmost_tree_rec = 0;
5255 struct super_block *sb = inode->i_sb;
5256 struct ocfs2_path *left_path = NULL;
5257 struct ocfs2_extent_list *el = path_leaf_el(path);
5258 struct ocfs2_extent_rec *rec;
5259 struct ocfs2_extent_block *eb;
5261 if (ocfs2_is_empty_extent(&el->l_recs[0]) && index > 0) {
5262 ret = ocfs2_rotate_tree_left(inode, handle, path, dealloc, et);
5271 if (index == (le16_to_cpu(el->l_next_free_rec) - 1) &&
5272 path->p_tree_depth) {
5274 * Check whether this is the rightmost tree record. If
5275 * we remove all of this record or part of its right
5276 * edge then an update of the record lengths above it
5279 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
5280 if (eb->h_next_leaf_blk == 0)
5281 is_rightmost_tree_rec = 1;
5284 rec = &el->l_recs[index];
5285 if (index == 0 && path->p_tree_depth &&
5286 le32_to_cpu(rec->e_cpos) == cpos) {
5288 * Changing the leftmost offset (via partial or whole
5289 * record truncate) of an interior (or rightmost) path
5290 * means we have to update the subtree that is formed
5291 * by this leaf and the one to it's left.
5293 * There are two cases we can skip:
5294 * 1) Path is the leftmost one in our inode tree.
5295 * 2) The leaf is rightmost and will be empty after
5296 * we remove the extent record - the rotate code
5297 * knows how to update the newly formed edge.
5300 ret = ocfs2_find_cpos_for_left_leaf(inode->i_sb, path,
5307 if (left_cpos && le16_to_cpu(el->l_next_free_rec) > 1) {
5308 left_path = ocfs2_new_path_from_path(path);
5315 ret = ocfs2_find_path(et->et_ci, left_path,
5324 ret = ocfs2_extend_rotate_transaction(handle, 0,
5325 handle->h_buffer_credits,
5332 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
5338 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
5344 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5345 trunc_range = cpos + len;
5347 if (le32_to_cpu(rec->e_cpos) == cpos && rec_range == trunc_range) {
5350 memset(rec, 0, sizeof(*rec));
5351 ocfs2_cleanup_merge(el, index);
5354 next_free = le16_to_cpu(el->l_next_free_rec);
5355 if (is_rightmost_tree_rec && next_free > 1) {
5357 * We skip the edge update if this path will
5358 * be deleted by the rotate code.
5360 rec = &el->l_recs[next_free - 1];
5361 ocfs2_adjust_rightmost_records(inode, handle, path,
5364 } else if (le32_to_cpu(rec->e_cpos) == cpos) {
5365 /* Remove leftmost portion of the record. */
5366 le32_add_cpu(&rec->e_cpos, len);
5367 le64_add_cpu(&rec->e_blkno, ocfs2_clusters_to_blocks(sb, len));
5368 le16_add_cpu(&rec->e_leaf_clusters, -len);
5369 } else if (rec_range == trunc_range) {
5370 /* Remove rightmost portion of the record */
5371 le16_add_cpu(&rec->e_leaf_clusters, -len);
5372 if (is_rightmost_tree_rec)
5373 ocfs2_adjust_rightmost_records(inode, handle, path, rec);
5375 /* Caller should have trapped this. */
5376 mlog(ML_ERROR, "Inode %llu: Invalid record truncate: (%u, %u) "
5377 "(%u, %u)\n", (unsigned long long)OCFS2_I(inode)->ip_blkno,
5378 le32_to_cpu(rec->e_cpos),
5379 le16_to_cpu(rec->e_leaf_clusters), cpos, len);
5386 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
5387 ocfs2_complete_edge_insert(handle, left_path, path,
5391 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5393 ret = ocfs2_rotate_tree_left(inode, handle, path, dealloc, et);
5400 ocfs2_free_path(left_path);
5404 int ocfs2_remove_extent(struct inode *inode,
5405 struct ocfs2_extent_tree *et,
5406 u32 cpos, u32 len, handle_t *handle,
5407 struct ocfs2_alloc_context *meta_ac,
5408 struct ocfs2_cached_dealloc_ctxt *dealloc)
5411 u32 rec_range, trunc_range;
5412 struct ocfs2_extent_rec *rec;
5413 struct ocfs2_extent_list *el;
5414 struct ocfs2_path *path = NULL;
5416 ocfs2_extent_map_trunc(inode, 0);
5418 path = ocfs2_new_path_from_et(et);
5425 ret = ocfs2_find_path(et->et_ci, path, cpos);
5431 el = path_leaf_el(path);
5432 index = ocfs2_search_extent_list(el, cpos);
5433 if (index == -1 || index >= le16_to_cpu(el->l_next_free_rec)) {
5434 ocfs2_error(inode->i_sb,
5435 "Inode %llu has an extent at cpos %u which can no "
5436 "longer be found.\n",
5437 (unsigned long long)OCFS2_I(inode)->ip_blkno, cpos);
5443 * We have 3 cases of extent removal:
5444 * 1) Range covers the entire extent rec
5445 * 2) Range begins or ends on one edge of the extent rec
5446 * 3) Range is in the middle of the extent rec (no shared edges)
5448 * For case 1 we remove the extent rec and left rotate to
5451 * For case 2 we just shrink the existing extent rec, with a
5452 * tree update if the shrinking edge is also the edge of an
5455 * For case 3 we do a right split to turn the extent rec into
5456 * something case 2 can handle.
5458 rec = &el->l_recs[index];
5459 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5460 trunc_range = cpos + len;
5462 BUG_ON(cpos < le32_to_cpu(rec->e_cpos) || trunc_range > rec_range);
5464 mlog(0, "Inode %llu, remove (cpos %u, len %u). Existing index %d "
5465 "(cpos %u, len %u)\n",
5466 (unsigned long long)OCFS2_I(inode)->ip_blkno, cpos, len, index,
5467 le32_to_cpu(rec->e_cpos), ocfs2_rec_clusters(el, rec));
5469 if (le32_to_cpu(rec->e_cpos) == cpos || rec_range == trunc_range) {
5470 ret = ocfs2_truncate_rec(inode, handle, path, index, dealloc,
5477 ret = ocfs2_split_tree(inode, et, handle, path, index,
5478 trunc_range, meta_ac);
5485 * The split could have manipulated the tree enough to
5486 * move the record location, so we have to look for it again.
5488 ocfs2_reinit_path(path, 1);
5490 ret = ocfs2_find_path(et->et_ci, path, cpos);
5496 el = path_leaf_el(path);
5497 index = ocfs2_search_extent_list(el, cpos);
5498 if (index == -1 || index >= le16_to_cpu(el->l_next_free_rec)) {
5499 ocfs2_error(inode->i_sb,
5500 "Inode %llu: split at cpos %u lost record.",
5501 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5508 * Double check our values here. If anything is fishy,
5509 * it's easier to catch it at the top level.
5511 rec = &el->l_recs[index];
5512 rec_range = le32_to_cpu(rec->e_cpos) +
5513 ocfs2_rec_clusters(el, rec);
5514 if (rec_range != trunc_range) {
5515 ocfs2_error(inode->i_sb,
5516 "Inode %llu: error after split at cpos %u"
5517 "trunc len %u, existing record is (%u,%u)",
5518 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5519 cpos, len, le32_to_cpu(rec->e_cpos),
5520 ocfs2_rec_clusters(el, rec));
5525 ret = ocfs2_truncate_rec(inode, handle, path, index, dealloc,
5534 ocfs2_free_path(path);
5538 int ocfs2_remove_btree_range(struct inode *inode,
5539 struct ocfs2_extent_tree *et,
5540 u32 cpos, u32 phys_cpos, u32 len,
5541 struct ocfs2_cached_dealloc_ctxt *dealloc)
5544 u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
5545 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5546 struct inode *tl_inode = osb->osb_tl_inode;
5548 struct ocfs2_alloc_context *meta_ac = NULL;
5550 ret = ocfs2_lock_allocators(inode, et, 0, 1, NULL, &meta_ac);
5556 mutex_lock(&tl_inode->i_mutex);
5558 if (ocfs2_truncate_log_needs_flush(osb)) {
5559 ret = __ocfs2_flush_truncate_log(osb);
5566 handle = ocfs2_start_trans(osb, ocfs2_remove_extent_credits(osb->sb));
5567 if (IS_ERR(handle)) {
5568 ret = PTR_ERR(handle);
5573 ret = ocfs2_et_root_journal_access(handle, et,
5574 OCFS2_JOURNAL_ACCESS_WRITE);
5580 vfs_dq_free_space_nodirty(inode,
5581 ocfs2_clusters_to_bytes(inode->i_sb, len));
5583 ret = ocfs2_remove_extent(inode, et, cpos, len, handle, meta_ac,
5590 ocfs2_et_update_clusters(et, -len);
5592 ret = ocfs2_journal_dirty(handle, et->et_root_bh);
5598 ret = ocfs2_truncate_log_append(osb, handle, phys_blkno, len);
5603 ocfs2_commit_trans(osb, handle);
5605 mutex_unlock(&tl_inode->i_mutex);
5608 ocfs2_free_alloc_context(meta_ac);
5613 int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb)
5615 struct buffer_head *tl_bh = osb->osb_tl_bh;
5616 struct ocfs2_dinode *di;
5617 struct ocfs2_truncate_log *tl;
5619 di = (struct ocfs2_dinode *) tl_bh->b_data;
5620 tl = &di->id2.i_dealloc;
5622 mlog_bug_on_msg(le16_to_cpu(tl->tl_used) > le16_to_cpu(tl->tl_count),
5623 "slot %d, invalid truncate log parameters: used = "
5624 "%u, count = %u\n", osb->slot_num,
5625 le16_to_cpu(tl->tl_used), le16_to_cpu(tl->tl_count));
5626 return le16_to_cpu(tl->tl_used) == le16_to_cpu(tl->tl_count);
5629 static int ocfs2_truncate_log_can_coalesce(struct ocfs2_truncate_log *tl,
5630 unsigned int new_start)
5632 unsigned int tail_index;
5633 unsigned int current_tail;
5635 /* No records, nothing to coalesce */
5636 if (!le16_to_cpu(tl->tl_used))
5639 tail_index = le16_to_cpu(tl->tl_used) - 1;
5640 current_tail = le32_to_cpu(tl->tl_recs[tail_index].t_start);
5641 current_tail += le32_to_cpu(tl->tl_recs[tail_index].t_clusters);
5643 return current_tail == new_start;
5646 int ocfs2_truncate_log_append(struct ocfs2_super *osb,
5649 unsigned int num_clusters)
5652 unsigned int start_cluster, tl_count;
5653 struct inode *tl_inode = osb->osb_tl_inode;
5654 struct buffer_head *tl_bh = osb->osb_tl_bh;
5655 struct ocfs2_dinode *di;
5656 struct ocfs2_truncate_log *tl;
5658 mlog_entry("start_blk = %llu, num_clusters = %u\n",
5659 (unsigned long long)start_blk, num_clusters);
5661 BUG_ON(mutex_trylock(&tl_inode->i_mutex));
5663 start_cluster = ocfs2_blocks_to_clusters(osb->sb, start_blk);
5665 di = (struct ocfs2_dinode *) tl_bh->b_data;
5667 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5668 * by the underlying call to ocfs2_read_inode_block(), so any
5669 * corruption is a code bug */
5670 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
5672 tl = &di->id2.i_dealloc;
5673 tl_count = le16_to_cpu(tl->tl_count);
5674 mlog_bug_on_msg(tl_count > ocfs2_truncate_recs_per_inode(osb->sb) ||
5676 "Truncate record count on #%llu invalid "
5677 "wanted %u, actual %u\n",
5678 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5679 ocfs2_truncate_recs_per_inode(osb->sb),
5680 le16_to_cpu(tl->tl_count));
5682 /* Caller should have known to flush before calling us. */
5683 index = le16_to_cpu(tl->tl_used);
5684 if (index >= tl_count) {
5690 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5691 OCFS2_JOURNAL_ACCESS_WRITE);
5697 mlog(0, "Log truncate of %u clusters starting at cluster %u to "
5698 "%llu (index = %d)\n", num_clusters, start_cluster,
5699 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, index);
5701 if (ocfs2_truncate_log_can_coalesce(tl, start_cluster)) {
5703 * Move index back to the record we are coalescing with.
5704 * ocfs2_truncate_log_can_coalesce() guarantees nonzero
5708 num_clusters += le32_to_cpu(tl->tl_recs[index].t_clusters);
5709 mlog(0, "Coalesce with index %u (start = %u, clusters = %u)\n",
5710 index, le32_to_cpu(tl->tl_recs[index].t_start),
5713 tl->tl_recs[index].t_start = cpu_to_le32(start_cluster);
5714 tl->tl_used = cpu_to_le16(index + 1);
5716 tl->tl_recs[index].t_clusters = cpu_to_le32(num_clusters);
5718 status = ocfs2_journal_dirty(handle, tl_bh);
5729 static int ocfs2_replay_truncate_records(struct ocfs2_super *osb,
5731 struct inode *data_alloc_inode,
5732 struct buffer_head *data_alloc_bh)
5736 unsigned int num_clusters;
5738 struct ocfs2_truncate_rec rec;
5739 struct ocfs2_dinode *di;
5740 struct ocfs2_truncate_log *tl;
5741 struct inode *tl_inode = osb->osb_tl_inode;
5742 struct buffer_head *tl_bh = osb->osb_tl_bh;
5746 di = (struct ocfs2_dinode *) tl_bh->b_data;
5747 tl = &di->id2.i_dealloc;
5748 i = le16_to_cpu(tl->tl_used) - 1;
5750 /* Caller has given us at least enough credits to
5751 * update the truncate log dinode */
5752 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5753 OCFS2_JOURNAL_ACCESS_WRITE);
5759 tl->tl_used = cpu_to_le16(i);
5761 status = ocfs2_journal_dirty(handle, tl_bh);
5767 /* TODO: Perhaps we can calculate the bulk of the
5768 * credits up front rather than extending like
5770 status = ocfs2_extend_trans(handle,
5771 OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC);
5777 rec = tl->tl_recs[i];
5778 start_blk = ocfs2_clusters_to_blocks(data_alloc_inode->i_sb,
5779 le32_to_cpu(rec.t_start));
5780 num_clusters = le32_to_cpu(rec.t_clusters);
5782 /* if start_blk is not set, we ignore the record as
5785 mlog(0, "free record %d, start = %u, clusters = %u\n",
5786 i, le32_to_cpu(rec.t_start), num_clusters);
5788 status = ocfs2_free_clusters(handle, data_alloc_inode,
5789 data_alloc_bh, start_blk,
5804 /* Expects you to already be holding tl_inode->i_mutex */
5805 int __ocfs2_flush_truncate_log(struct ocfs2_super *osb)
5808 unsigned int num_to_flush;
5810 struct inode *tl_inode = osb->osb_tl_inode;
5811 struct inode *data_alloc_inode = NULL;
5812 struct buffer_head *tl_bh = osb->osb_tl_bh;
5813 struct buffer_head *data_alloc_bh = NULL;
5814 struct ocfs2_dinode *di;
5815 struct ocfs2_truncate_log *tl;
5819 BUG_ON(mutex_trylock(&tl_inode->i_mutex));
5821 di = (struct ocfs2_dinode *) tl_bh->b_data;
5823 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5824 * by the underlying call to ocfs2_read_inode_block(), so any
5825 * corruption is a code bug */
5826 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
5828 tl = &di->id2.i_dealloc;
5829 num_to_flush = le16_to_cpu(tl->tl_used);
5830 mlog(0, "Flush %u records from truncate log #%llu\n",
5831 num_to_flush, (unsigned long long)OCFS2_I(tl_inode)->ip_blkno);
5832 if (!num_to_flush) {
5837 data_alloc_inode = ocfs2_get_system_file_inode(osb,
5838 GLOBAL_BITMAP_SYSTEM_INODE,
5839 OCFS2_INVALID_SLOT);
5840 if (!data_alloc_inode) {
5842 mlog(ML_ERROR, "Could not get bitmap inode!\n");
5846 mutex_lock(&data_alloc_inode->i_mutex);
5848 status = ocfs2_inode_lock(data_alloc_inode, &data_alloc_bh, 1);
5854 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
5855 if (IS_ERR(handle)) {
5856 status = PTR_ERR(handle);
5861 status = ocfs2_replay_truncate_records(osb, handle, data_alloc_inode,
5866 ocfs2_commit_trans(osb, handle);
5869 brelse(data_alloc_bh);
5870 ocfs2_inode_unlock(data_alloc_inode, 1);
5873 mutex_unlock(&data_alloc_inode->i_mutex);
5874 iput(data_alloc_inode);
5881 int ocfs2_flush_truncate_log(struct ocfs2_super *osb)
5884 struct inode *tl_inode = osb->osb_tl_inode;
5886 mutex_lock(&tl_inode->i_mutex);
5887 status = __ocfs2_flush_truncate_log(osb);
5888 mutex_unlock(&tl_inode->i_mutex);
5893 static void ocfs2_truncate_log_worker(struct work_struct *work)
5896 struct ocfs2_super *osb =
5897 container_of(work, struct ocfs2_super,
5898 osb_truncate_log_wq.work);
5902 status = ocfs2_flush_truncate_log(osb);
5906 ocfs2_init_inode_steal_slot(osb);
5911 #define OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL (2 * HZ)
5912 void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
5915 if (osb->osb_tl_inode) {
5916 /* We want to push off log flushes while truncates are
5919 cancel_delayed_work(&osb->osb_truncate_log_wq);
5921 queue_delayed_work(ocfs2_wq, &osb->osb_truncate_log_wq,
5922 OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL);
5926 static int ocfs2_get_truncate_log_info(struct ocfs2_super *osb,
5928 struct inode **tl_inode,
5929 struct buffer_head **tl_bh)
5932 struct inode *inode = NULL;
5933 struct buffer_head *bh = NULL;
5935 inode = ocfs2_get_system_file_inode(osb,
5936 TRUNCATE_LOG_SYSTEM_INODE,
5940 mlog(ML_ERROR, "Could not get load truncate log inode!\n");
5944 status = ocfs2_read_inode_block(inode, &bh);
5958 /* called during the 1st stage of node recovery. we stamp a clean
5959 * truncate log and pass back a copy for processing later. if the
5960 * truncate log does not require processing, a *tl_copy is set to
5962 int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
5964 struct ocfs2_dinode **tl_copy)
5967 struct inode *tl_inode = NULL;
5968 struct buffer_head *tl_bh = NULL;
5969 struct ocfs2_dinode *di;
5970 struct ocfs2_truncate_log *tl;
5974 mlog(0, "recover truncate log from slot %d\n", slot_num);
5976 status = ocfs2_get_truncate_log_info(osb, slot_num, &tl_inode, &tl_bh);
5982 di = (struct ocfs2_dinode *) tl_bh->b_data;
5984 /* tl_bh is loaded from ocfs2_get_truncate_log_info(). It's
5985 * validated by the underlying call to ocfs2_read_inode_block(),
5986 * so any corruption is a code bug */
5987 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
5989 tl = &di->id2.i_dealloc;
5990 if (le16_to_cpu(tl->tl_used)) {
5991 mlog(0, "We'll have %u logs to recover\n",
5992 le16_to_cpu(tl->tl_used));
5994 *tl_copy = kmalloc(tl_bh->b_size, GFP_KERNEL);
6001 /* Assuming the write-out below goes well, this copy
6002 * will be passed back to recovery for processing. */
6003 memcpy(*tl_copy, tl_bh->b_data, tl_bh->b_size);
6005 /* All we need to do to clear the truncate log is set
6009 ocfs2_compute_meta_ecc(osb->sb, tl_bh->b_data, &di->i_check);
6010 status = ocfs2_write_block(osb, tl_bh, INODE_CACHE(tl_inode));
6022 if (status < 0 && (*tl_copy)) {
6031 int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
6032 struct ocfs2_dinode *tl_copy)
6036 unsigned int clusters, num_recs, start_cluster;
6039 struct inode *tl_inode = osb->osb_tl_inode;
6040 struct ocfs2_truncate_log *tl;
6044 if (OCFS2_I(tl_inode)->ip_blkno == le64_to_cpu(tl_copy->i_blkno)) {
6045 mlog(ML_ERROR, "Asked to recover my own truncate log!\n");
6049 tl = &tl_copy->id2.i_dealloc;
6050 num_recs = le16_to_cpu(tl->tl_used);
6051 mlog(0, "cleanup %u records from %llu\n", num_recs,
6052 (unsigned long long)le64_to_cpu(tl_copy->i_blkno));
6054 mutex_lock(&tl_inode->i_mutex);
6055 for(i = 0; i < num_recs; i++) {
6056 if (ocfs2_truncate_log_needs_flush(osb)) {
6057 status = __ocfs2_flush_truncate_log(osb);
6064 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6065 if (IS_ERR(handle)) {
6066 status = PTR_ERR(handle);
6071 clusters = le32_to_cpu(tl->tl_recs[i].t_clusters);
6072 start_cluster = le32_to_cpu(tl->tl_recs[i].t_start);
6073 start_blk = ocfs2_clusters_to_blocks(osb->sb, start_cluster);
6075 status = ocfs2_truncate_log_append(osb, handle,
6076 start_blk, clusters);
6077 ocfs2_commit_trans(osb, handle);
6085 mutex_unlock(&tl_inode->i_mutex);
6091 void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb)
6094 struct inode *tl_inode = osb->osb_tl_inode;
6099 cancel_delayed_work(&osb->osb_truncate_log_wq);
6100 flush_workqueue(ocfs2_wq);
6102 status = ocfs2_flush_truncate_log(osb);
6106 brelse(osb->osb_tl_bh);
6107 iput(osb->osb_tl_inode);
6113 int ocfs2_truncate_log_init(struct ocfs2_super *osb)
6116 struct inode *tl_inode = NULL;
6117 struct buffer_head *tl_bh = NULL;
6121 status = ocfs2_get_truncate_log_info(osb,
6128 /* ocfs2_truncate_log_shutdown keys on the existence of
6129 * osb->osb_tl_inode so we don't set any of the osb variables
6130 * until we're sure all is well. */
6131 INIT_DELAYED_WORK(&osb->osb_truncate_log_wq,
6132 ocfs2_truncate_log_worker);
6133 osb->osb_tl_bh = tl_bh;
6134 osb->osb_tl_inode = tl_inode;
6141 * Delayed de-allocation of suballocator blocks.
6143 * Some sets of block de-allocations might involve multiple suballocator inodes.
6145 * The locking for this can get extremely complicated, especially when
6146 * the suballocator inodes to delete from aren't known until deep
6147 * within an unrelated codepath.
6149 * ocfs2_extent_block structures are a good example of this - an inode
6150 * btree could have been grown by any number of nodes each allocating
6151 * out of their own suballoc inode.
6153 * These structures allow the delay of block de-allocation until a
6154 * later time, when locking of multiple cluster inodes won't cause
6159 * Describe a single bit freed from a suballocator. For the block
6160 * suballocators, it represents one block. For the global cluster
6161 * allocator, it represents some clusters and free_bit indicates
6164 struct ocfs2_cached_block_free {
6165 struct ocfs2_cached_block_free *free_next;
6167 unsigned int free_bit;
6170 struct ocfs2_per_slot_free_list {
6171 struct ocfs2_per_slot_free_list *f_next_suballocator;
6174 struct ocfs2_cached_block_free *f_first;
6177 static int ocfs2_free_cached_blocks(struct ocfs2_super *osb,
6180 struct ocfs2_cached_block_free *head)
6185 struct inode *inode;
6186 struct buffer_head *di_bh = NULL;
6187 struct ocfs2_cached_block_free *tmp;
6189 inode = ocfs2_get_system_file_inode(osb, sysfile_type, slot);
6196 mutex_lock(&inode->i_mutex);
6198 ret = ocfs2_inode_lock(inode, &di_bh, 1);
6204 handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
6205 if (IS_ERR(handle)) {
6206 ret = PTR_ERR(handle);
6212 bg_blkno = ocfs2_which_suballoc_group(head->free_blk,
6214 mlog(0, "Free bit: (bit %u, blkno %llu)\n",
6215 head->free_bit, (unsigned long long)head->free_blk);
6217 ret = ocfs2_free_suballoc_bits(handle, inode, di_bh,
6218 head->free_bit, bg_blkno, 1);
6224 ret = ocfs2_extend_trans(handle, OCFS2_SUBALLOC_FREE);
6231 head = head->free_next;
6236 ocfs2_commit_trans(osb, handle);
6239 ocfs2_inode_unlock(inode, 1);
6242 mutex_unlock(&inode->i_mutex);
6246 /* Premature exit may have left some dangling items. */
6248 head = head->free_next;
6255 int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6256 u64 blkno, unsigned int bit)
6259 struct ocfs2_cached_block_free *item;
6261 item = kmalloc(sizeof(*item), GFP_NOFS);
6268 mlog(0, "Insert clusters: (bit %u, blk %llu)\n",
6269 bit, (unsigned long long)blkno);
6271 item->free_blk = blkno;
6272 item->free_bit = bit;
6273 item->free_next = ctxt->c_global_allocator;
6275 ctxt->c_global_allocator = item;
6279 static int ocfs2_free_cached_clusters(struct ocfs2_super *osb,
6280 struct ocfs2_cached_block_free *head)
6282 struct ocfs2_cached_block_free *tmp;
6283 struct inode *tl_inode = osb->osb_tl_inode;
6287 mutex_lock(&tl_inode->i_mutex);
6290 if (ocfs2_truncate_log_needs_flush(osb)) {
6291 ret = __ocfs2_flush_truncate_log(osb);
6298 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6299 if (IS_ERR(handle)) {
6300 ret = PTR_ERR(handle);
6305 ret = ocfs2_truncate_log_append(osb, handle, head->free_blk,
6308 ocfs2_commit_trans(osb, handle);
6310 head = head->free_next;
6319 mutex_unlock(&tl_inode->i_mutex);
6322 /* Premature exit may have left some dangling items. */
6324 head = head->free_next;
6331 int ocfs2_run_deallocs(struct ocfs2_super *osb,
6332 struct ocfs2_cached_dealloc_ctxt *ctxt)
6335 struct ocfs2_per_slot_free_list *fl;
6340 while (ctxt->c_first_suballocator) {
6341 fl = ctxt->c_first_suballocator;
6344 mlog(0, "Free items: (type %u, slot %d)\n",
6345 fl->f_inode_type, fl->f_slot);
6346 ret2 = ocfs2_free_cached_blocks(osb,
6356 ctxt->c_first_suballocator = fl->f_next_suballocator;
6360 if (ctxt->c_global_allocator) {
6361 ret2 = ocfs2_free_cached_clusters(osb,
6362 ctxt->c_global_allocator);
6368 ctxt->c_global_allocator = NULL;
6374 static struct ocfs2_per_slot_free_list *
6375 ocfs2_find_per_slot_free_list(int type,
6377 struct ocfs2_cached_dealloc_ctxt *ctxt)
6379 struct ocfs2_per_slot_free_list *fl = ctxt->c_first_suballocator;
6382 if (fl->f_inode_type == type && fl->f_slot == slot)
6385 fl = fl->f_next_suballocator;
6388 fl = kmalloc(sizeof(*fl), GFP_NOFS);
6390 fl->f_inode_type = type;
6393 fl->f_next_suballocator = ctxt->c_first_suballocator;
6395 ctxt->c_first_suballocator = fl;
6400 static int ocfs2_cache_block_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6401 int type, int slot, u64 blkno,
6405 struct ocfs2_per_slot_free_list *fl;
6406 struct ocfs2_cached_block_free *item;
6408 fl = ocfs2_find_per_slot_free_list(type, slot, ctxt);
6415 item = kmalloc(sizeof(*item), GFP_NOFS);
6422 mlog(0, "Insert: (type %d, slot %u, bit %u, blk %llu)\n",
6423 type, slot, bit, (unsigned long long)blkno);
6425 item->free_blk = blkno;
6426 item->free_bit = bit;
6427 item->free_next = fl->f_first;
6436 static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
6437 struct ocfs2_extent_block *eb)
6439 return ocfs2_cache_block_dealloc(ctxt, EXTENT_ALLOC_SYSTEM_INODE,
6440 le16_to_cpu(eb->h_suballoc_slot),
6441 le64_to_cpu(eb->h_blkno),
6442 le16_to_cpu(eb->h_suballoc_bit));
6445 /* This function will figure out whether the currently last extent
6446 * block will be deleted, and if it will, what the new last extent
6447 * block will be so we can update his h_next_leaf_blk field, as well
6448 * as the dinodes i_last_eb_blk */
6449 static int ocfs2_find_new_last_ext_blk(struct inode *inode,
6450 unsigned int clusters_to_del,
6451 struct ocfs2_path *path,
6452 struct buffer_head **new_last_eb)
6454 int next_free, ret = 0;
6456 struct ocfs2_extent_rec *rec;
6457 struct ocfs2_extent_block *eb;
6458 struct ocfs2_extent_list *el;
6459 struct buffer_head *bh = NULL;
6461 *new_last_eb = NULL;
6463 /* we have no tree, so of course, no last_eb. */
6464 if (!path->p_tree_depth)
6467 /* trunc to zero special case - this makes tree_depth = 0
6468 * regardless of what it is. */
6469 if (OCFS2_I(inode)->ip_clusters == clusters_to_del)
6472 el = path_leaf_el(path);
6473 BUG_ON(!el->l_next_free_rec);
6476 * Make sure that this extent list will actually be empty
6477 * after we clear away the data. We can shortcut out if
6478 * there's more than one non-empty extent in the
6479 * list. Otherwise, a check of the remaining extent is
6482 next_free = le16_to_cpu(el->l_next_free_rec);
6484 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
6488 /* We may have a valid extent in index 1, check it. */
6490 rec = &el->l_recs[1];
6493 * Fall through - no more nonempty extents, so we want
6494 * to delete this leaf.
6500 rec = &el->l_recs[0];
6505 * Check it we'll only be trimming off the end of this
6508 if (le16_to_cpu(rec->e_leaf_clusters) > clusters_to_del)
6512 ret = ocfs2_find_cpos_for_left_leaf(inode->i_sb, path, &cpos);
6518 ret = ocfs2_find_leaf(INODE_CACHE(inode), path_root_el(path), cpos, &bh);
6524 eb = (struct ocfs2_extent_block *) bh->b_data;
6527 /* ocfs2_find_leaf() gets the eb from ocfs2_read_extent_block().
6528 * Any corruption is a code bug. */
6529 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
6532 get_bh(*new_last_eb);
6533 mlog(0, "returning block %llu, (cpos: %u)\n",
6534 (unsigned long long)le64_to_cpu(eb->h_blkno), cpos);
6542 * Trim some clusters off the rightmost edge of a tree. Only called
6545 * The caller needs to:
6546 * - start journaling of each path component.
6547 * - compute and fully set up any new last ext block
6549 static int ocfs2_trim_tree(struct inode *inode, struct ocfs2_path *path,
6550 handle_t *handle, struct ocfs2_truncate_context *tc,
6551 u32 clusters_to_del, u64 *delete_start)
6553 int ret, i, index = path->p_tree_depth;
6556 struct buffer_head *bh;
6557 struct ocfs2_extent_list *el;
6558 struct ocfs2_extent_rec *rec;
6562 while (index >= 0) {
6563 bh = path->p_node[index].bh;
6564 el = path->p_node[index].el;
6566 mlog(0, "traveling tree (index = %d, block = %llu)\n",
6567 index, (unsigned long long)bh->b_blocknr);
6569 BUG_ON(le16_to_cpu(el->l_next_free_rec) == 0);
6572 (path->p_tree_depth - le16_to_cpu(el->l_tree_depth))) {
6573 ocfs2_error(inode->i_sb,
6574 "Inode %lu has invalid ext. block %llu",
6576 (unsigned long long)bh->b_blocknr);
6582 i = le16_to_cpu(el->l_next_free_rec) - 1;
6583 rec = &el->l_recs[i];
6585 mlog(0, "Extent list before: record %d: (%u, %u, %llu), "
6586 "next = %u\n", i, le32_to_cpu(rec->e_cpos),
6587 ocfs2_rec_clusters(el, rec),
6588 (unsigned long long)le64_to_cpu(rec->e_blkno),
6589 le16_to_cpu(el->l_next_free_rec));
6591 BUG_ON(ocfs2_rec_clusters(el, rec) < clusters_to_del);
6593 if (le16_to_cpu(el->l_tree_depth) == 0) {
6595 * If the leaf block contains a single empty
6596 * extent and no records, we can just remove
6599 if (i == 0 && ocfs2_is_empty_extent(rec)) {
6601 sizeof(struct ocfs2_extent_rec));
6602 el->l_next_free_rec = cpu_to_le16(0);
6608 * Remove any empty extents by shifting things
6609 * left. That should make life much easier on
6610 * the code below. This condition is rare
6611 * enough that we shouldn't see a performance
6614 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
6615 le16_add_cpu(&el->l_next_free_rec, -1);
6618 i < le16_to_cpu(el->l_next_free_rec); i++)
6619 el->l_recs[i] = el->l_recs[i + 1];
6621 memset(&el->l_recs[i], 0,
6622 sizeof(struct ocfs2_extent_rec));
6625 * We've modified our extent list. The
6626 * simplest way to handle this change
6627 * is to being the search from the
6630 goto find_tail_record;
6633 le16_add_cpu(&rec->e_leaf_clusters, -clusters_to_del);
6636 * We'll use "new_edge" on our way back up the
6637 * tree to know what our rightmost cpos is.
6639 new_edge = le16_to_cpu(rec->e_leaf_clusters);
6640 new_edge += le32_to_cpu(rec->e_cpos);
6643 * The caller will use this to delete data blocks.
6645 *delete_start = le64_to_cpu(rec->e_blkno)
6646 + ocfs2_clusters_to_blocks(inode->i_sb,
6647 le16_to_cpu(rec->e_leaf_clusters));
6650 * If it's now empty, remove this record.
6652 if (le16_to_cpu(rec->e_leaf_clusters) == 0) {
6654 sizeof(struct ocfs2_extent_rec));
6655 le16_add_cpu(&el->l_next_free_rec, -1);
6658 if (le64_to_cpu(rec->e_blkno) == deleted_eb) {
6660 sizeof(struct ocfs2_extent_rec));
6661 le16_add_cpu(&el->l_next_free_rec, -1);
6666 /* Can this actually happen? */
6667 if (le16_to_cpu(el->l_next_free_rec) == 0)
6671 * We never actually deleted any clusters
6672 * because our leaf was empty. There's no
6673 * reason to adjust the rightmost edge then.
6678 rec->e_int_clusters = cpu_to_le32(new_edge);
6679 le32_add_cpu(&rec->e_int_clusters,
6680 -le32_to_cpu(rec->e_cpos));
6683 * A deleted child record should have been
6686 BUG_ON(le32_to_cpu(rec->e_int_clusters) == 0);
6690 ret = ocfs2_journal_dirty(handle, bh);
6696 mlog(0, "extent list container %llu, after: record %d: "
6697 "(%u, %u, %llu), next = %u.\n",
6698 (unsigned long long)bh->b_blocknr, i,
6699 le32_to_cpu(rec->e_cpos), ocfs2_rec_clusters(el, rec),
6700 (unsigned long long)le64_to_cpu(rec->e_blkno),
6701 le16_to_cpu(el->l_next_free_rec));
6704 * We must be careful to only attempt delete of an
6705 * extent block (and not the root inode block).
6707 if (index > 0 && le16_to_cpu(el->l_next_free_rec) == 0) {
6708 struct ocfs2_extent_block *eb =
6709 (struct ocfs2_extent_block *)bh->b_data;
6712 * Save this for use when processing the
6715 deleted_eb = le64_to_cpu(eb->h_blkno);
6717 mlog(0, "deleting this extent block.\n");
6719 ocfs2_remove_from_cache(INODE_CACHE(inode), bh);
6721 BUG_ON(ocfs2_rec_clusters(el, &el->l_recs[0]));
6722 BUG_ON(le32_to_cpu(el->l_recs[0].e_cpos));
6723 BUG_ON(le64_to_cpu(el->l_recs[0].e_blkno));
6725 ret = ocfs2_cache_extent_block_free(&tc->tc_dealloc, eb);
6726 /* An error here is not fatal. */
6741 static int ocfs2_do_truncate(struct ocfs2_super *osb,
6742 unsigned int clusters_to_del,
6743 struct inode *inode,
6744 struct buffer_head *fe_bh,
6746 struct ocfs2_truncate_context *tc,
6747 struct ocfs2_path *path)
6750 struct ocfs2_dinode *fe;
6751 struct ocfs2_extent_block *last_eb = NULL;
6752 struct ocfs2_extent_list *el;
6753 struct buffer_head *last_eb_bh = NULL;
6756 fe = (struct ocfs2_dinode *) fe_bh->b_data;
6758 status = ocfs2_find_new_last_ext_blk(inode, clusters_to_del,
6766 * Each component will be touched, so we might as well journal
6767 * here to avoid having to handle errors later.
6769 status = ocfs2_journal_access_path(INODE_CACHE(inode), handle, path);
6776 status = ocfs2_journal_access_eb(handle, INODE_CACHE(inode), last_eb_bh,
6777 OCFS2_JOURNAL_ACCESS_WRITE);
6783 last_eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
6786 el = &(fe->id2.i_list);
6789 * Lower levels depend on this never happening, but it's best
6790 * to check it up here before changing the tree.
6792 if (el->l_tree_depth && el->l_recs[0].e_int_clusters == 0) {
6793 ocfs2_error(inode->i_sb,
6794 "Inode %lu has an empty extent record, depth %u\n",
6795 inode->i_ino, le16_to_cpu(el->l_tree_depth));
6800 vfs_dq_free_space_nodirty(inode,
6801 ocfs2_clusters_to_bytes(osb->sb, clusters_to_del));
6802 spin_lock(&OCFS2_I(inode)->ip_lock);
6803 OCFS2_I(inode)->ip_clusters = le32_to_cpu(fe->i_clusters) -
6805 spin_unlock(&OCFS2_I(inode)->ip_lock);
6806 le32_add_cpu(&fe->i_clusters, -clusters_to_del);
6807 inode->i_blocks = ocfs2_inode_sector_count(inode);
6809 status = ocfs2_trim_tree(inode, path, handle, tc,
6810 clusters_to_del, &delete_blk);
6816 if (le32_to_cpu(fe->i_clusters) == 0) {
6817 /* trunc to zero is a special case. */
6818 el->l_tree_depth = 0;
6819 fe->i_last_eb_blk = 0;
6821 fe->i_last_eb_blk = last_eb->h_blkno;
6823 status = ocfs2_journal_dirty(handle, fe_bh);
6830 /* If there will be a new last extent block, then by
6831 * definition, there cannot be any leaves to the right of
6833 last_eb->h_next_leaf_blk = 0;
6834 status = ocfs2_journal_dirty(handle, last_eb_bh);
6842 status = ocfs2_truncate_log_append(osb, handle, delete_blk,
6856 static int ocfs2_zero_func(handle_t *handle, struct buffer_head *bh)
6858 set_buffer_uptodate(bh);
6859 mark_buffer_dirty(bh);
6863 static void ocfs2_map_and_dirty_page(struct inode *inode, handle_t *handle,
6864 unsigned int from, unsigned int to,
6865 struct page *page, int zero, u64 *phys)
6867 int ret, partial = 0;
6869 ret = ocfs2_map_page_blocks(page, phys, inode, from, to, 0);
6874 zero_user_segment(page, from, to);
6877 * Need to set the buffers we zero'd into uptodate
6878 * here if they aren't - ocfs2_map_page_blocks()
6879 * might've skipped some
6881 ret = walk_page_buffers(handle, page_buffers(page),
6886 else if (ocfs2_should_order_data(inode)) {
6887 ret = ocfs2_jbd2_file_inode(handle, inode);
6893 SetPageUptodate(page);
6895 flush_dcache_page(page);
6898 static void ocfs2_zero_cluster_pages(struct inode *inode, loff_t start,
6899 loff_t end, struct page **pages,
6900 int numpages, u64 phys, handle_t *handle)
6904 unsigned int from, to = PAGE_CACHE_SIZE;
6905 struct super_block *sb = inode->i_sb;
6907 BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(sb)));
6912 to = PAGE_CACHE_SIZE;
6913 for(i = 0; i < numpages; i++) {
6916 from = start & (PAGE_CACHE_SIZE - 1);
6917 if ((end >> PAGE_CACHE_SHIFT) == page->index)
6918 to = end & (PAGE_CACHE_SIZE - 1);
6920 BUG_ON(from > PAGE_CACHE_SIZE);
6921 BUG_ON(to > PAGE_CACHE_SIZE);
6923 ocfs2_map_and_dirty_page(inode, handle, from, to, page, 1,
6926 start = (page->index + 1) << PAGE_CACHE_SHIFT;
6930 ocfs2_unlock_and_free_pages(pages, numpages);
6933 static int ocfs2_grab_eof_pages(struct inode *inode, loff_t start, loff_t end,
6934 struct page **pages, int *num)
6936 int numpages, ret = 0;
6937 struct super_block *sb = inode->i_sb;
6938 struct address_space *mapping = inode->i_mapping;
6939 unsigned long index;
6940 loff_t last_page_bytes;
6942 BUG_ON(start > end);
6944 BUG_ON(start >> OCFS2_SB(sb)->s_clustersize_bits !=
6945 (end - 1) >> OCFS2_SB(sb)->s_clustersize_bits);
6948 last_page_bytes = PAGE_ALIGN(end);
6949 index = start >> PAGE_CACHE_SHIFT;
6951 pages[numpages] = grab_cache_page(mapping, index);
6952 if (!pages[numpages]) {
6960 } while (index < (last_page_bytes >> PAGE_CACHE_SHIFT));
6965 ocfs2_unlock_and_free_pages(pages, numpages);
6975 * Zero the area past i_size but still within an allocated
6976 * cluster. This avoids exposing nonzero data on subsequent file
6979 * We need to call this before i_size is updated on the inode because
6980 * otherwise block_write_full_page() will skip writeout of pages past
6981 * i_size. The new_i_size parameter is passed for this reason.
6983 int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
6984 u64 range_start, u64 range_end)
6986 int ret = 0, numpages;
6987 struct page **pages = NULL;
6989 unsigned int ext_flags;
6990 struct super_block *sb = inode->i_sb;
6993 * File systems which don't support sparse files zero on every
6996 if (!ocfs2_sparse_alloc(OCFS2_SB(sb)))
6999 pages = kcalloc(ocfs2_pages_per_cluster(sb),
7000 sizeof(struct page *), GFP_NOFS);
7001 if (pages == NULL) {
7007 if (range_start == range_end)
7010 ret = ocfs2_extent_map_get_blocks(inode,
7011 range_start >> sb->s_blocksize_bits,
7012 &phys, NULL, &ext_flags);
7019 * Tail is a hole, or is marked unwritten. In either case, we
7020 * can count on read and write to return/push zero's.
7022 if (phys == 0 || ext_flags & OCFS2_EXT_UNWRITTEN)
7025 ret = ocfs2_grab_eof_pages(inode, range_start, range_end, pages,
7032 ocfs2_zero_cluster_pages(inode, range_start, range_end, pages,
7033 numpages, phys, handle);
7036 * Initiate writeout of the pages we zero'd here. We don't
7037 * wait on them - the truncate_inode_pages() call later will
7040 ret = do_sync_mapping_range(inode->i_mapping, range_start,
7041 range_end - 1, SYNC_FILE_RANGE_WRITE);
7052 static void ocfs2_zero_dinode_id2_with_xattr(struct inode *inode,
7053 struct ocfs2_dinode *di)
7055 unsigned int blocksize = 1 << inode->i_sb->s_blocksize_bits;
7056 unsigned int xattrsize = le16_to_cpu(di->i_xattr_inline_size);
7058 if (le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_XATTR_FL)
7059 memset(&di->id2, 0, blocksize -
7060 offsetof(struct ocfs2_dinode, id2) -
7063 memset(&di->id2, 0, blocksize -
7064 offsetof(struct ocfs2_dinode, id2));
7067 void ocfs2_dinode_new_extent_list(struct inode *inode,
7068 struct ocfs2_dinode *di)
7070 ocfs2_zero_dinode_id2_with_xattr(inode, di);
7071 di->id2.i_list.l_tree_depth = 0;
7072 di->id2.i_list.l_next_free_rec = 0;
7073 di->id2.i_list.l_count = cpu_to_le16(
7074 ocfs2_extent_recs_per_inode_with_xattr(inode->i_sb, di));
7077 void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di)
7079 struct ocfs2_inode_info *oi = OCFS2_I(inode);
7080 struct ocfs2_inline_data *idata = &di->id2.i_data;
7082 spin_lock(&oi->ip_lock);
7083 oi->ip_dyn_features |= OCFS2_INLINE_DATA_FL;
7084 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
7085 spin_unlock(&oi->ip_lock);
7088 * We clear the entire i_data structure here so that all
7089 * fields can be properly initialized.
7091 ocfs2_zero_dinode_id2_with_xattr(inode, di);
7093 idata->id_count = cpu_to_le16(
7094 ocfs2_max_inline_data_with_xattr(inode->i_sb, di));
7097 int ocfs2_convert_inline_data_to_extents(struct inode *inode,
7098 struct buffer_head *di_bh)
7100 int ret, i, has_data, num_pages = 0;
7102 u64 uninitialized_var(block);
7103 struct ocfs2_inode_info *oi = OCFS2_I(inode);
7104 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7105 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7106 struct ocfs2_alloc_context *data_ac = NULL;
7107 struct page **pages = NULL;
7108 loff_t end = osb->s_clustersize;
7109 struct ocfs2_extent_tree et;
7112 has_data = i_size_read(inode) ? 1 : 0;
7115 pages = kcalloc(ocfs2_pages_per_cluster(osb->sb),
7116 sizeof(struct page *), GFP_NOFS);
7117 if (pages == NULL) {
7123 ret = ocfs2_reserve_clusters(osb, 1, &data_ac);
7130 handle = ocfs2_start_trans(osb,
7131 ocfs2_inline_to_extents_credits(osb->sb));
7132 if (IS_ERR(handle)) {
7133 ret = PTR_ERR(handle);
7138 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
7139 OCFS2_JOURNAL_ACCESS_WRITE);
7147 unsigned int page_end;
7150 if (vfs_dq_alloc_space_nodirty(inode,
7151 ocfs2_clusters_to_bytes(osb->sb, 1))) {
7157 ret = ocfs2_claim_clusters(osb, handle, data_ac, 1, &bit_off,
7165 * Save two copies, one for insert, and one that can
7166 * be changed by ocfs2_map_and_dirty_page() below.
7168 block = phys = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
7171 * Non sparse file systems zero on extend, so no need
7174 if (!ocfs2_sparse_alloc(osb) &&
7175 PAGE_CACHE_SIZE < osb->s_clustersize)
7176 end = PAGE_CACHE_SIZE;
7178 ret = ocfs2_grab_eof_pages(inode, 0, end, pages, &num_pages);
7185 * This should populate the 1st page for us and mark
7188 ret = ocfs2_read_inline_data(inode, pages[0], di_bh);
7194 page_end = PAGE_CACHE_SIZE;
7195 if (PAGE_CACHE_SIZE > osb->s_clustersize)
7196 page_end = osb->s_clustersize;
7198 for (i = 0; i < num_pages; i++)
7199 ocfs2_map_and_dirty_page(inode, handle, 0, page_end,
7200 pages[i], i > 0, &phys);
7203 spin_lock(&oi->ip_lock);
7204 oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL;
7205 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
7206 spin_unlock(&oi->ip_lock);
7208 ocfs2_dinode_new_extent_list(inode, di);
7210 ocfs2_journal_dirty(handle, di_bh);
7214 * An error at this point should be extremely rare. If
7215 * this proves to be false, we could always re-build
7216 * the in-inode data from our pages.
7218 ocfs2_init_dinode_extent_tree(&et, inode, di_bh);
7219 ret = ocfs2_insert_extent(osb, handle, inode, &et,
7220 0, block, 1, 0, NULL);
7226 inode->i_blocks = ocfs2_inode_sector_count(inode);
7230 if (ret < 0 && did_quota)
7231 vfs_dq_free_space_nodirty(inode,
7232 ocfs2_clusters_to_bytes(osb->sb, 1));
7234 ocfs2_commit_trans(osb, handle);
7238 ocfs2_free_alloc_context(data_ac);
7242 ocfs2_unlock_and_free_pages(pages, num_pages);
7250 * It is expected, that by the time you call this function,
7251 * inode->i_size and fe->i_size have been adjusted.
7253 * WARNING: This will kfree the truncate context
7255 int ocfs2_commit_truncate(struct ocfs2_super *osb,
7256 struct inode *inode,
7257 struct buffer_head *fe_bh,
7258 struct ocfs2_truncate_context *tc)
7260 int status, i, credits, tl_sem = 0;
7261 u32 clusters_to_del, new_highest_cpos, range;
7262 struct ocfs2_extent_list *el;
7263 handle_t *handle = NULL;
7264 struct inode *tl_inode = osb->osb_tl_inode;
7265 struct ocfs2_path *path = NULL;
7266 struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
7270 new_highest_cpos = ocfs2_clusters_for_bytes(osb->sb,
7271 i_size_read(inode));
7273 path = ocfs2_new_path(fe_bh, &di->id2.i_list,
7274 ocfs2_journal_access_di);
7281 ocfs2_extent_map_trunc(inode, new_highest_cpos);
7285 * Check that we still have allocation to delete.
7287 if (OCFS2_I(inode)->ip_clusters == 0) {
7293 * Truncate always works against the rightmost tree branch.
7295 status = ocfs2_find_path(INODE_CACHE(inode), path, UINT_MAX);
7301 mlog(0, "inode->ip_clusters = %u, tree_depth = %u\n",
7302 OCFS2_I(inode)->ip_clusters, path->p_tree_depth);
7305 * By now, el will point to the extent list on the bottom most
7306 * portion of this tree. Only the tail record is considered in
7309 * We handle the following cases, in order:
7310 * - empty extent: delete the remaining branch
7311 * - remove the entire record
7312 * - remove a partial record
7313 * - no record needs to be removed (truncate has completed)
7315 el = path_leaf_el(path);
7316 if (le16_to_cpu(el->l_next_free_rec) == 0) {
7317 ocfs2_error(inode->i_sb,
7318 "Inode %llu has empty extent block at %llu\n",
7319 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7320 (unsigned long long)path_leaf_bh(path)->b_blocknr);
7325 i = le16_to_cpu(el->l_next_free_rec) - 1;
7326 range = le32_to_cpu(el->l_recs[i].e_cpos) +
7327 ocfs2_rec_clusters(el, &el->l_recs[i]);
7328 if (i == 0 && ocfs2_is_empty_extent(&el->l_recs[i])) {
7329 clusters_to_del = 0;
7330 } else if (le32_to_cpu(el->l_recs[i].e_cpos) >= new_highest_cpos) {
7331 clusters_to_del = ocfs2_rec_clusters(el, &el->l_recs[i]);
7332 } else if (range > new_highest_cpos) {
7333 clusters_to_del = (ocfs2_rec_clusters(el, &el->l_recs[i]) +
7334 le32_to_cpu(el->l_recs[i].e_cpos)) -
7341 mlog(0, "clusters_to_del = %u in this pass, tail blk=%llu\n",
7342 clusters_to_del, (unsigned long long)path_leaf_bh(path)->b_blocknr);
7344 mutex_lock(&tl_inode->i_mutex);
7346 /* ocfs2_truncate_log_needs_flush guarantees us at least one
7347 * record is free for use. If there isn't any, we flush to get
7348 * an empty truncate log. */
7349 if (ocfs2_truncate_log_needs_flush(osb)) {
7350 status = __ocfs2_flush_truncate_log(osb);
7357 credits = ocfs2_calc_tree_trunc_credits(osb->sb, clusters_to_del,
7358 (struct ocfs2_dinode *)fe_bh->b_data,
7360 handle = ocfs2_start_trans(osb, credits);
7361 if (IS_ERR(handle)) {
7362 status = PTR_ERR(handle);
7368 status = ocfs2_do_truncate(osb, clusters_to_del, inode, fe_bh, handle,
7375 mutex_unlock(&tl_inode->i_mutex);
7378 ocfs2_commit_trans(osb, handle);
7381 ocfs2_reinit_path(path, 1);
7384 * The check above will catch the case where we've truncated
7385 * away all allocation.
7391 ocfs2_schedule_truncate_log_flush(osb, 1);
7394 mutex_unlock(&tl_inode->i_mutex);
7397 ocfs2_commit_trans(osb, handle);
7399 ocfs2_run_deallocs(osb, &tc->tc_dealloc);
7401 ocfs2_free_path(path);
7403 /* This will drop the ext_alloc cluster lock for us */
7404 ocfs2_free_truncate_context(tc);
7411 * Expects the inode to already be locked.
7413 int ocfs2_prepare_truncate(struct ocfs2_super *osb,
7414 struct inode *inode,
7415 struct buffer_head *fe_bh,
7416 struct ocfs2_truncate_context **tc)
7419 unsigned int new_i_clusters;
7420 struct ocfs2_dinode *fe;
7421 struct ocfs2_extent_block *eb;
7422 struct buffer_head *last_eb_bh = NULL;
7428 new_i_clusters = ocfs2_clusters_for_bytes(osb->sb,
7429 i_size_read(inode));
7430 fe = (struct ocfs2_dinode *) fe_bh->b_data;
7432 mlog(0, "fe->i_clusters = %u, new_i_clusters = %u, fe->i_size ="
7433 "%llu\n", le32_to_cpu(fe->i_clusters), new_i_clusters,
7434 (unsigned long long)le64_to_cpu(fe->i_size));
7436 *tc = kzalloc(sizeof(struct ocfs2_truncate_context), GFP_KERNEL);
7442 ocfs2_init_dealloc_ctxt(&(*tc)->tc_dealloc);
7444 if (fe->id2.i_list.l_tree_depth) {
7445 status = ocfs2_read_extent_block(INODE_CACHE(inode),
7446 le64_to_cpu(fe->i_last_eb_blk),
7452 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
7455 (*tc)->tc_last_eb_bh = last_eb_bh;
7461 ocfs2_free_truncate_context(*tc);
7469 * 'start' is inclusive, 'end' is not.
7471 int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
7472 unsigned int start, unsigned int end, int trunc)
7475 unsigned int numbytes;
7477 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7478 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7479 struct ocfs2_inline_data *idata = &di->id2.i_data;
7481 if (end > i_size_read(inode))
7482 end = i_size_read(inode);
7484 BUG_ON(start >= end);
7486 if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) ||
7487 !(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL) ||
7488 !ocfs2_supports_inline_data(osb)) {
7489 ocfs2_error(inode->i_sb,
7490 "Inline data flags for inode %llu don't agree! "
7491 "Disk: 0x%x, Memory: 0x%x, Superblock: 0x%x\n",
7492 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7493 le16_to_cpu(di->i_dyn_features),
7494 OCFS2_I(inode)->ip_dyn_features,
7495 osb->s_feature_incompat);
7500 handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
7501 if (IS_ERR(handle)) {
7502 ret = PTR_ERR(handle);
7507 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
7508 OCFS2_JOURNAL_ACCESS_WRITE);
7514 numbytes = end - start;
7515 memset(idata->id_data + start, 0, numbytes);
7518 * No need to worry about the data page here - it's been
7519 * truncated already and inline data doesn't need it for
7520 * pushing zero's to disk, so we'll let readpage pick it up
7524 i_size_write(inode, start);
7525 di->i_size = cpu_to_le64(start);
7528 inode->i_blocks = ocfs2_inode_sector_count(inode);
7529 inode->i_ctime = inode->i_mtime = CURRENT_TIME;
7531 di->i_ctime = di->i_mtime = cpu_to_le64(inode->i_ctime.tv_sec);
7532 di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
7534 ocfs2_journal_dirty(handle, di_bh);
7537 ocfs2_commit_trans(osb, handle);
7543 static void ocfs2_free_truncate_context(struct ocfs2_truncate_context *tc)
7546 * The caller is responsible for completing deallocation
7547 * before freeing the context.
7549 if (tc->tc_dealloc.c_first_suballocator != NULL)
7551 "Truncate completion has non-empty dealloc context\n");
7553 brelse(tc->tc_last_eb_bh);