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>
32 #include <linux/blkdev.h>
33 #include <linux/sched/signal.h>
35 #include <cluster/masklog.h>
41 #include "blockcheck.h"
43 #include "extent_map.h"
46 #include "localalloc.h"
53 #include "refcounttree.h"
54 #include "ocfs2_trace.h"
56 #include "buffer_head_io.h"
58 enum ocfs2_contig_type {
65 static enum ocfs2_contig_type
66 ocfs2_extent_rec_contig(struct super_block *sb,
67 struct ocfs2_extent_rec *ext,
68 struct ocfs2_extent_rec *insert_rec);
70 * Operations for a specific extent tree type.
72 * To implement an on-disk btree (extent tree) type in ocfs2, add
73 * an ocfs2_extent_tree_operations structure and the matching
74 * ocfs2_init_<thingy>_extent_tree() function. That's pretty much it
75 * for the allocation portion of the extent tree.
77 struct ocfs2_extent_tree_operations {
79 * last_eb_blk is the block number of the right most leaf extent
80 * block. Most on-disk structures containing an extent tree store
81 * this value for fast access. The ->eo_set_last_eb_blk() and
82 * ->eo_get_last_eb_blk() operations access this value. They are
85 void (*eo_set_last_eb_blk)(struct ocfs2_extent_tree *et,
87 u64 (*eo_get_last_eb_blk)(struct ocfs2_extent_tree *et);
90 * The on-disk structure usually keeps track of how many total
91 * clusters are stored in this extent tree. This function updates
92 * that value. new_clusters is the delta, and must be
93 * added to the total. Required.
95 void (*eo_update_clusters)(struct ocfs2_extent_tree *et,
99 * If this extent tree is supported by an extent map, insert
100 * a record into the map.
102 void (*eo_extent_map_insert)(struct ocfs2_extent_tree *et,
103 struct ocfs2_extent_rec *rec);
106 * If this extent tree is supported by an extent map, truncate the
109 void (*eo_extent_map_truncate)(struct ocfs2_extent_tree *et,
113 * If ->eo_insert_check() exists, it is called before rec is
114 * inserted into the extent tree. It is optional.
116 int (*eo_insert_check)(struct ocfs2_extent_tree *et,
117 struct ocfs2_extent_rec *rec);
118 int (*eo_sanity_check)(struct ocfs2_extent_tree *et);
121 * --------------------------------------------------------------
122 * The remaining are internal to ocfs2_extent_tree and don't have
127 * ->eo_fill_root_el() takes et->et_object and sets et->et_root_el.
130 void (*eo_fill_root_el)(struct ocfs2_extent_tree *et);
133 * ->eo_fill_max_leaf_clusters sets et->et_max_leaf_clusters if
134 * it exists. If it does not, et->et_max_leaf_clusters is set
135 * to 0 (unlimited). Optional.
137 void (*eo_fill_max_leaf_clusters)(struct ocfs2_extent_tree *et);
140 * ->eo_extent_contig test whether the 2 ocfs2_extent_rec
141 * are contiguous or not. Optional. Don't need to set it if use
142 * ocfs2_extent_rec as the tree leaf.
144 enum ocfs2_contig_type
145 (*eo_extent_contig)(struct ocfs2_extent_tree *et,
146 struct ocfs2_extent_rec *ext,
147 struct ocfs2_extent_rec *insert_rec);
152 * Pre-declare ocfs2_dinode_et_ops so we can use it as a sanity check
155 static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et);
156 static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
158 static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
160 static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et,
161 struct ocfs2_extent_rec *rec);
162 static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et,
164 static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
165 struct ocfs2_extent_rec *rec);
166 static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et);
167 static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et);
168 static const struct ocfs2_extent_tree_operations ocfs2_dinode_et_ops = {
169 .eo_set_last_eb_blk = ocfs2_dinode_set_last_eb_blk,
170 .eo_get_last_eb_blk = ocfs2_dinode_get_last_eb_blk,
171 .eo_update_clusters = ocfs2_dinode_update_clusters,
172 .eo_extent_map_insert = ocfs2_dinode_extent_map_insert,
173 .eo_extent_map_truncate = ocfs2_dinode_extent_map_truncate,
174 .eo_insert_check = ocfs2_dinode_insert_check,
175 .eo_sanity_check = ocfs2_dinode_sanity_check,
176 .eo_fill_root_el = ocfs2_dinode_fill_root_el,
179 static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
182 struct ocfs2_dinode *di = et->et_object;
184 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
185 di->i_last_eb_blk = cpu_to_le64(blkno);
188 static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et)
190 struct ocfs2_dinode *di = et->et_object;
192 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
193 return le64_to_cpu(di->i_last_eb_blk);
196 static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
199 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
200 struct ocfs2_dinode *di = et->et_object;
202 le32_add_cpu(&di->i_clusters, clusters);
203 spin_lock(&oi->ip_lock);
204 oi->ip_clusters = le32_to_cpu(di->i_clusters);
205 spin_unlock(&oi->ip_lock);
208 static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et,
209 struct ocfs2_extent_rec *rec)
211 struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode;
213 ocfs2_extent_map_insert_rec(inode, rec);
216 static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et,
219 struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode;
221 ocfs2_extent_map_trunc(inode, clusters);
224 static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
225 struct ocfs2_extent_rec *rec)
227 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
228 struct ocfs2_super *osb = OCFS2_SB(oi->vfs_inode.i_sb);
230 BUG_ON(oi->ip_dyn_features & OCFS2_INLINE_DATA_FL);
231 mlog_bug_on_msg(!ocfs2_sparse_alloc(osb) &&
232 (oi->ip_clusters != le32_to_cpu(rec->e_cpos)),
233 "Device %s, asking for sparse allocation: inode %llu, "
234 "cpos %u, clusters %u\n",
236 (unsigned long long)oi->ip_blkno,
237 rec->e_cpos, oi->ip_clusters);
242 static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et)
244 struct ocfs2_dinode *di = et->et_object;
246 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
247 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
252 static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et)
254 struct ocfs2_dinode *di = et->et_object;
256 et->et_root_el = &di->id2.i_list;
260 static void ocfs2_xattr_value_fill_root_el(struct ocfs2_extent_tree *et)
262 struct ocfs2_xattr_value_buf *vb = et->et_object;
264 et->et_root_el = &vb->vb_xv->xr_list;
267 static void ocfs2_xattr_value_set_last_eb_blk(struct ocfs2_extent_tree *et,
270 struct ocfs2_xattr_value_buf *vb = et->et_object;
272 vb->vb_xv->xr_last_eb_blk = cpu_to_le64(blkno);
275 static u64 ocfs2_xattr_value_get_last_eb_blk(struct ocfs2_extent_tree *et)
277 struct ocfs2_xattr_value_buf *vb = et->et_object;
279 return le64_to_cpu(vb->vb_xv->xr_last_eb_blk);
282 static void ocfs2_xattr_value_update_clusters(struct ocfs2_extent_tree *et,
285 struct ocfs2_xattr_value_buf *vb = et->et_object;
287 le32_add_cpu(&vb->vb_xv->xr_clusters, clusters);
290 static const struct ocfs2_extent_tree_operations ocfs2_xattr_value_et_ops = {
291 .eo_set_last_eb_blk = ocfs2_xattr_value_set_last_eb_blk,
292 .eo_get_last_eb_blk = ocfs2_xattr_value_get_last_eb_blk,
293 .eo_update_clusters = ocfs2_xattr_value_update_clusters,
294 .eo_fill_root_el = ocfs2_xattr_value_fill_root_el,
297 static void ocfs2_xattr_tree_fill_root_el(struct ocfs2_extent_tree *et)
299 struct ocfs2_xattr_block *xb = et->et_object;
301 et->et_root_el = &xb->xb_attrs.xb_root.xt_list;
304 static void ocfs2_xattr_tree_fill_max_leaf_clusters(struct ocfs2_extent_tree *et)
306 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
307 et->et_max_leaf_clusters =
308 ocfs2_clusters_for_bytes(sb, OCFS2_MAX_XATTR_TREE_LEAF_SIZE);
311 static void ocfs2_xattr_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
314 struct ocfs2_xattr_block *xb = et->et_object;
315 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
317 xt->xt_last_eb_blk = cpu_to_le64(blkno);
320 static u64 ocfs2_xattr_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
322 struct ocfs2_xattr_block *xb = et->et_object;
323 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
325 return le64_to_cpu(xt->xt_last_eb_blk);
328 static void ocfs2_xattr_tree_update_clusters(struct ocfs2_extent_tree *et,
331 struct ocfs2_xattr_block *xb = et->et_object;
333 le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, clusters);
336 static const struct ocfs2_extent_tree_operations ocfs2_xattr_tree_et_ops = {
337 .eo_set_last_eb_blk = ocfs2_xattr_tree_set_last_eb_blk,
338 .eo_get_last_eb_blk = ocfs2_xattr_tree_get_last_eb_blk,
339 .eo_update_clusters = ocfs2_xattr_tree_update_clusters,
340 .eo_fill_root_el = ocfs2_xattr_tree_fill_root_el,
341 .eo_fill_max_leaf_clusters = ocfs2_xattr_tree_fill_max_leaf_clusters,
344 static void ocfs2_dx_root_set_last_eb_blk(struct ocfs2_extent_tree *et,
347 struct ocfs2_dx_root_block *dx_root = et->et_object;
349 dx_root->dr_last_eb_blk = cpu_to_le64(blkno);
352 static u64 ocfs2_dx_root_get_last_eb_blk(struct ocfs2_extent_tree *et)
354 struct ocfs2_dx_root_block *dx_root = et->et_object;
356 return le64_to_cpu(dx_root->dr_last_eb_blk);
359 static void ocfs2_dx_root_update_clusters(struct ocfs2_extent_tree *et,
362 struct ocfs2_dx_root_block *dx_root = et->et_object;
364 le32_add_cpu(&dx_root->dr_clusters, clusters);
367 static int ocfs2_dx_root_sanity_check(struct ocfs2_extent_tree *et)
369 struct ocfs2_dx_root_block *dx_root = et->et_object;
371 BUG_ON(!OCFS2_IS_VALID_DX_ROOT(dx_root));
376 static void ocfs2_dx_root_fill_root_el(struct ocfs2_extent_tree *et)
378 struct ocfs2_dx_root_block *dx_root = et->et_object;
380 et->et_root_el = &dx_root->dr_list;
383 static const struct ocfs2_extent_tree_operations ocfs2_dx_root_et_ops = {
384 .eo_set_last_eb_blk = ocfs2_dx_root_set_last_eb_blk,
385 .eo_get_last_eb_blk = ocfs2_dx_root_get_last_eb_blk,
386 .eo_update_clusters = ocfs2_dx_root_update_clusters,
387 .eo_sanity_check = ocfs2_dx_root_sanity_check,
388 .eo_fill_root_el = ocfs2_dx_root_fill_root_el,
391 static void ocfs2_refcount_tree_fill_root_el(struct ocfs2_extent_tree *et)
393 struct ocfs2_refcount_block *rb = et->et_object;
395 et->et_root_el = &rb->rf_list;
398 static void ocfs2_refcount_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
401 struct ocfs2_refcount_block *rb = et->et_object;
403 rb->rf_last_eb_blk = cpu_to_le64(blkno);
406 static u64 ocfs2_refcount_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
408 struct ocfs2_refcount_block *rb = et->et_object;
410 return le64_to_cpu(rb->rf_last_eb_blk);
413 static void ocfs2_refcount_tree_update_clusters(struct ocfs2_extent_tree *et,
416 struct ocfs2_refcount_block *rb = et->et_object;
418 le32_add_cpu(&rb->rf_clusters, clusters);
421 static enum ocfs2_contig_type
422 ocfs2_refcount_tree_extent_contig(struct ocfs2_extent_tree *et,
423 struct ocfs2_extent_rec *ext,
424 struct ocfs2_extent_rec *insert_rec)
429 static const struct ocfs2_extent_tree_operations ocfs2_refcount_tree_et_ops = {
430 .eo_set_last_eb_blk = ocfs2_refcount_tree_set_last_eb_blk,
431 .eo_get_last_eb_blk = ocfs2_refcount_tree_get_last_eb_blk,
432 .eo_update_clusters = ocfs2_refcount_tree_update_clusters,
433 .eo_fill_root_el = ocfs2_refcount_tree_fill_root_el,
434 .eo_extent_contig = ocfs2_refcount_tree_extent_contig,
437 static void __ocfs2_init_extent_tree(struct ocfs2_extent_tree *et,
438 struct ocfs2_caching_info *ci,
439 struct buffer_head *bh,
440 ocfs2_journal_access_func access,
442 const struct ocfs2_extent_tree_operations *ops)
447 et->et_root_journal_access = access;
449 obj = (void *)bh->b_data;
452 et->et_ops->eo_fill_root_el(et);
453 if (!et->et_ops->eo_fill_max_leaf_clusters)
454 et->et_max_leaf_clusters = 0;
456 et->et_ops->eo_fill_max_leaf_clusters(et);
459 void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et,
460 struct ocfs2_caching_info *ci,
461 struct buffer_head *bh)
463 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_di,
464 NULL, &ocfs2_dinode_et_ops);
467 void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et,
468 struct ocfs2_caching_info *ci,
469 struct buffer_head *bh)
471 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_xb,
472 NULL, &ocfs2_xattr_tree_et_ops);
475 void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et,
476 struct ocfs2_caching_info *ci,
477 struct ocfs2_xattr_value_buf *vb)
479 __ocfs2_init_extent_tree(et, ci, vb->vb_bh, vb->vb_access, vb,
480 &ocfs2_xattr_value_et_ops);
483 void ocfs2_init_dx_root_extent_tree(struct ocfs2_extent_tree *et,
484 struct ocfs2_caching_info *ci,
485 struct buffer_head *bh)
487 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_dr,
488 NULL, &ocfs2_dx_root_et_ops);
491 void ocfs2_init_refcount_extent_tree(struct ocfs2_extent_tree *et,
492 struct ocfs2_caching_info *ci,
493 struct buffer_head *bh)
495 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_rb,
496 NULL, &ocfs2_refcount_tree_et_ops);
499 static inline void ocfs2_et_set_last_eb_blk(struct ocfs2_extent_tree *et,
502 et->et_ops->eo_set_last_eb_blk(et, new_last_eb_blk);
505 static inline u64 ocfs2_et_get_last_eb_blk(struct ocfs2_extent_tree *et)
507 return et->et_ops->eo_get_last_eb_blk(et);
510 static inline void ocfs2_et_update_clusters(struct ocfs2_extent_tree *et,
513 et->et_ops->eo_update_clusters(et, clusters);
516 static inline void ocfs2_et_extent_map_insert(struct ocfs2_extent_tree *et,
517 struct ocfs2_extent_rec *rec)
519 if (et->et_ops->eo_extent_map_insert)
520 et->et_ops->eo_extent_map_insert(et, rec);
523 static inline void ocfs2_et_extent_map_truncate(struct ocfs2_extent_tree *et,
526 if (et->et_ops->eo_extent_map_truncate)
527 et->et_ops->eo_extent_map_truncate(et, clusters);
530 static inline int ocfs2_et_root_journal_access(handle_t *handle,
531 struct ocfs2_extent_tree *et,
534 return et->et_root_journal_access(handle, et->et_ci, et->et_root_bh,
538 static inline enum ocfs2_contig_type
539 ocfs2_et_extent_contig(struct ocfs2_extent_tree *et,
540 struct ocfs2_extent_rec *rec,
541 struct ocfs2_extent_rec *insert_rec)
543 if (et->et_ops->eo_extent_contig)
544 return et->et_ops->eo_extent_contig(et, rec, insert_rec);
546 return ocfs2_extent_rec_contig(
547 ocfs2_metadata_cache_get_super(et->et_ci),
551 static inline int ocfs2_et_insert_check(struct ocfs2_extent_tree *et,
552 struct ocfs2_extent_rec *rec)
556 if (et->et_ops->eo_insert_check)
557 ret = et->et_ops->eo_insert_check(et, rec);
561 static inline int ocfs2_et_sanity_check(struct ocfs2_extent_tree *et)
565 if (et->et_ops->eo_sanity_check)
566 ret = et->et_ops->eo_sanity_check(et);
570 static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
571 struct ocfs2_extent_block *eb);
572 static void ocfs2_adjust_rightmost_records(handle_t *handle,
573 struct ocfs2_extent_tree *et,
574 struct ocfs2_path *path,
575 struct ocfs2_extent_rec *insert_rec);
577 * Reset the actual path elements so that we can re-use the structure
578 * to build another path. Generally, this involves freeing the buffer
581 void ocfs2_reinit_path(struct ocfs2_path *path, int keep_root)
583 int i, start = 0, depth = 0;
584 struct ocfs2_path_item *node;
589 for(i = start; i < path_num_items(path); i++) {
590 node = &path->p_node[i];
598 * Tree depth may change during truncate, or insert. If we're
599 * keeping the root extent list, then make sure that our path
600 * structure reflects the proper depth.
603 depth = le16_to_cpu(path_root_el(path)->l_tree_depth);
605 path_root_access(path) = NULL;
607 path->p_tree_depth = depth;
610 void ocfs2_free_path(struct ocfs2_path *path)
613 ocfs2_reinit_path(path, 0);
619 * All the elements of src into dest. After this call, src could be freed
620 * without affecting dest.
622 * Both paths should have the same root. Any non-root elements of dest
625 static void ocfs2_cp_path(struct ocfs2_path *dest, struct ocfs2_path *src)
629 BUG_ON(path_root_bh(dest) != path_root_bh(src));
630 BUG_ON(path_root_el(dest) != path_root_el(src));
631 BUG_ON(path_root_access(dest) != path_root_access(src));
633 ocfs2_reinit_path(dest, 1);
635 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
636 dest->p_node[i].bh = src->p_node[i].bh;
637 dest->p_node[i].el = src->p_node[i].el;
639 if (dest->p_node[i].bh)
640 get_bh(dest->p_node[i].bh);
645 * Make the *dest path the same as src and re-initialize src path to
648 static void ocfs2_mv_path(struct ocfs2_path *dest, struct ocfs2_path *src)
652 BUG_ON(path_root_bh(dest) != path_root_bh(src));
653 BUG_ON(path_root_access(dest) != path_root_access(src));
655 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
656 brelse(dest->p_node[i].bh);
658 dest->p_node[i].bh = src->p_node[i].bh;
659 dest->p_node[i].el = src->p_node[i].el;
661 src->p_node[i].bh = NULL;
662 src->p_node[i].el = NULL;
667 * Insert an extent block at given index.
669 * This will not take an additional reference on eb_bh.
671 static inline void ocfs2_path_insert_eb(struct ocfs2_path *path, int index,
672 struct buffer_head *eb_bh)
674 struct ocfs2_extent_block *eb = (struct ocfs2_extent_block *)eb_bh->b_data;
677 * Right now, no root bh is an extent block, so this helps
678 * catch code errors with dinode trees. The assertion can be
679 * safely removed if we ever need to insert extent block
680 * structures at the root.
684 path->p_node[index].bh = eb_bh;
685 path->p_node[index].el = &eb->h_list;
688 static struct ocfs2_path *ocfs2_new_path(struct buffer_head *root_bh,
689 struct ocfs2_extent_list *root_el,
690 ocfs2_journal_access_func access)
692 struct ocfs2_path *path;
694 BUG_ON(le16_to_cpu(root_el->l_tree_depth) >= OCFS2_MAX_PATH_DEPTH);
696 path = kzalloc(sizeof(*path), GFP_NOFS);
698 path->p_tree_depth = le16_to_cpu(root_el->l_tree_depth);
700 path_root_bh(path) = root_bh;
701 path_root_el(path) = root_el;
702 path_root_access(path) = access;
708 struct ocfs2_path *ocfs2_new_path_from_path(struct ocfs2_path *path)
710 return ocfs2_new_path(path_root_bh(path), path_root_el(path),
711 path_root_access(path));
714 struct ocfs2_path *ocfs2_new_path_from_et(struct ocfs2_extent_tree *et)
716 return ocfs2_new_path(et->et_root_bh, et->et_root_el,
717 et->et_root_journal_access);
721 * Journal the buffer at depth idx. All idx>0 are extent_blocks,
722 * otherwise it's the root_access function.
724 * I don't like the way this function's name looks next to
725 * ocfs2_journal_access_path(), but I don't have a better one.
727 int ocfs2_path_bh_journal_access(handle_t *handle,
728 struct ocfs2_caching_info *ci,
729 struct ocfs2_path *path,
732 ocfs2_journal_access_func access = path_root_access(path);
735 access = ocfs2_journal_access;
738 access = ocfs2_journal_access_eb;
740 return access(handle, ci, path->p_node[idx].bh,
741 OCFS2_JOURNAL_ACCESS_WRITE);
745 * Convenience function to journal all components in a path.
747 int ocfs2_journal_access_path(struct ocfs2_caching_info *ci,
749 struct ocfs2_path *path)
756 for(i = 0; i < path_num_items(path); i++) {
757 ret = ocfs2_path_bh_journal_access(handle, ci, path, i);
769 * Return the index of the extent record which contains cluster #v_cluster.
770 * -1 is returned if it was not found.
772 * Should work fine on interior and exterior nodes.
774 int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster)
778 struct ocfs2_extent_rec *rec;
779 u32 rec_end, rec_start, clusters;
781 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
782 rec = &el->l_recs[i];
784 rec_start = le32_to_cpu(rec->e_cpos);
785 clusters = ocfs2_rec_clusters(el, rec);
787 rec_end = rec_start + clusters;
789 if (v_cluster >= rec_start && v_cluster < rec_end) {
799 * NOTE: ocfs2_block_extent_contig(), ocfs2_extents_adjacent() and
800 * ocfs2_extent_rec_contig only work properly against leaf nodes!
802 static int ocfs2_block_extent_contig(struct super_block *sb,
803 struct ocfs2_extent_rec *ext,
806 u64 blk_end = le64_to_cpu(ext->e_blkno);
808 blk_end += ocfs2_clusters_to_blocks(sb,
809 le16_to_cpu(ext->e_leaf_clusters));
811 return blkno == blk_end;
814 static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left,
815 struct ocfs2_extent_rec *right)
819 left_range = le32_to_cpu(left->e_cpos) +
820 le16_to_cpu(left->e_leaf_clusters);
822 return (left_range == le32_to_cpu(right->e_cpos));
825 static enum ocfs2_contig_type
826 ocfs2_extent_rec_contig(struct super_block *sb,
827 struct ocfs2_extent_rec *ext,
828 struct ocfs2_extent_rec *insert_rec)
830 u64 blkno = le64_to_cpu(insert_rec->e_blkno);
833 * Refuse to coalesce extent records with different flag
834 * fields - we don't want to mix unwritten extents with user
837 if (ext->e_flags != insert_rec->e_flags)
840 if (ocfs2_extents_adjacent(ext, insert_rec) &&
841 ocfs2_block_extent_contig(sb, ext, blkno))
844 blkno = le64_to_cpu(ext->e_blkno);
845 if (ocfs2_extents_adjacent(insert_rec, ext) &&
846 ocfs2_block_extent_contig(sb, insert_rec, blkno))
853 * NOTE: We can have pretty much any combination of contiguousness and
856 * The usefulness of APPEND_TAIL is more in that it lets us know that
857 * we'll have to update the path to that leaf.
859 enum ocfs2_append_type {
864 enum ocfs2_split_type {
870 struct ocfs2_insert_type {
871 enum ocfs2_split_type ins_split;
872 enum ocfs2_append_type ins_appending;
873 enum ocfs2_contig_type ins_contig;
874 int ins_contig_index;
878 struct ocfs2_merge_ctxt {
879 enum ocfs2_contig_type c_contig_type;
880 int c_has_empty_extent;
881 int c_split_covers_rec;
884 static int ocfs2_validate_extent_block(struct super_block *sb,
885 struct buffer_head *bh)
888 struct ocfs2_extent_block *eb =
889 (struct ocfs2_extent_block *)bh->b_data;
891 trace_ocfs2_validate_extent_block((unsigned long long)bh->b_blocknr);
893 BUG_ON(!buffer_uptodate(bh));
896 * If the ecc fails, we return the error but otherwise
897 * leave the filesystem running. We know any error is
898 * local to this block.
900 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &eb->h_check);
902 mlog(ML_ERROR, "Checksum failed for extent block %llu\n",
903 (unsigned long long)bh->b_blocknr);
908 * Errors after here are fatal.
911 if (!OCFS2_IS_VALID_EXTENT_BLOCK(eb)) {
913 "Extent block #%llu has bad signature %.*s\n",
914 (unsigned long long)bh->b_blocknr, 7,
919 if (le64_to_cpu(eb->h_blkno) != bh->b_blocknr) {
921 "Extent block #%llu has an invalid h_blkno of %llu\n",
922 (unsigned long long)bh->b_blocknr,
923 (unsigned long long)le64_to_cpu(eb->h_blkno));
927 if (le32_to_cpu(eb->h_fs_generation) != OCFS2_SB(sb)->fs_generation) {
929 "Extent block #%llu has an invalid h_fs_generation of #%u\n",
930 (unsigned long long)bh->b_blocknr,
931 le32_to_cpu(eb->h_fs_generation));
938 int ocfs2_read_extent_block(struct ocfs2_caching_info *ci, u64 eb_blkno,
939 struct buffer_head **bh)
942 struct buffer_head *tmp = *bh;
944 rc = ocfs2_read_block(ci, eb_blkno, &tmp,
945 ocfs2_validate_extent_block);
947 /* If ocfs2_read_block() got us a new bh, pass it up. */
956 * How many free extents have we got before we need more meta data?
958 int ocfs2_num_free_extents(struct ocfs2_extent_tree *et)
961 struct ocfs2_extent_list *el = NULL;
962 struct ocfs2_extent_block *eb;
963 struct buffer_head *eb_bh = NULL;
967 last_eb_blk = ocfs2_et_get_last_eb_blk(et);
970 retval = ocfs2_read_extent_block(et->et_ci, last_eb_blk,
976 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
980 BUG_ON(el->l_tree_depth != 0);
982 retval = le16_to_cpu(el->l_count) - le16_to_cpu(el->l_next_free_rec);
986 trace_ocfs2_num_free_extents(retval);
990 /* expects array to already be allocated
992 * sets h_signature, h_blkno, h_suballoc_bit, h_suballoc_slot, and
995 static int ocfs2_create_new_meta_bhs(handle_t *handle,
996 struct ocfs2_extent_tree *et,
998 struct ocfs2_alloc_context *meta_ac,
999 struct buffer_head *bhs[])
1001 int count, status, i;
1002 u16 suballoc_bit_start;
1004 u64 suballoc_loc, first_blkno;
1005 struct ocfs2_super *osb =
1006 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
1007 struct ocfs2_extent_block *eb;
1010 while (count < wanted) {
1011 status = ocfs2_claim_metadata(handle,
1015 &suballoc_bit_start,
1023 for(i = count; i < (num_got + count); i++) {
1024 bhs[i] = sb_getblk(osb->sb, first_blkno);
1025 if (bhs[i] == NULL) {
1030 ocfs2_set_new_buffer_uptodate(et->et_ci, bhs[i]);
1032 status = ocfs2_journal_access_eb(handle, et->et_ci,
1034 OCFS2_JOURNAL_ACCESS_CREATE);
1040 memset(bhs[i]->b_data, 0, osb->sb->s_blocksize);
1041 eb = (struct ocfs2_extent_block *) bhs[i]->b_data;
1042 /* Ok, setup the minimal stuff here. */
1043 strcpy(eb->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE);
1044 eb->h_blkno = cpu_to_le64(first_blkno);
1045 eb->h_fs_generation = cpu_to_le32(osb->fs_generation);
1046 eb->h_suballoc_slot =
1047 cpu_to_le16(meta_ac->ac_alloc_slot);
1048 eb->h_suballoc_loc = cpu_to_le64(suballoc_loc);
1049 eb->h_suballoc_bit = cpu_to_le16(suballoc_bit_start);
1050 eb->h_list.l_count =
1051 cpu_to_le16(ocfs2_extent_recs_per_eb(osb->sb));
1053 suballoc_bit_start++;
1056 /* We'll also be dirtied by the caller, so
1057 * this isn't absolutely necessary. */
1058 ocfs2_journal_dirty(handle, bhs[i]);
1067 for(i = 0; i < wanted; i++) {
1077 * Helper function for ocfs2_add_branch() and ocfs2_shift_tree_depth().
1079 * Returns the sum of the rightmost extent rec logical offset and
1082 * ocfs2_add_branch() uses this to determine what logical cluster
1083 * value should be populated into the leftmost new branch records.
1085 * ocfs2_shift_tree_depth() uses this to determine the # clusters
1086 * value for the new topmost tree record.
1088 static inline u32 ocfs2_sum_rightmost_rec(struct ocfs2_extent_list *el)
1092 i = le16_to_cpu(el->l_next_free_rec) - 1;
1094 return le32_to_cpu(el->l_recs[i].e_cpos) +
1095 ocfs2_rec_clusters(el, &el->l_recs[i]);
1099 * Change range of the branches in the right most path according to the leaf
1100 * extent block's rightmost record.
1102 static int ocfs2_adjust_rightmost_branch(handle_t *handle,
1103 struct ocfs2_extent_tree *et)
1106 struct ocfs2_path *path = NULL;
1107 struct ocfs2_extent_list *el;
1108 struct ocfs2_extent_rec *rec;
1110 path = ocfs2_new_path_from_et(et);
1116 status = ocfs2_find_path(et->et_ci, path, UINT_MAX);
1122 status = ocfs2_extend_trans(handle, path_num_items(path));
1128 status = ocfs2_journal_access_path(et->et_ci, handle, path);
1134 el = path_leaf_el(path);
1135 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec) - 1];
1137 ocfs2_adjust_rightmost_records(handle, et, path, rec);
1140 ocfs2_free_path(path);
1145 * Add an entire tree branch to our inode. eb_bh is the extent block
1146 * to start at, if we don't want to start the branch at the root
1149 * last_eb_bh is required as we have to update it's next_leaf pointer
1150 * for the new last extent block.
1152 * the new branch will be 'empty' in the sense that every block will
1153 * contain a single record with cluster count == 0.
1155 static int ocfs2_add_branch(handle_t *handle,
1156 struct ocfs2_extent_tree *et,
1157 struct buffer_head *eb_bh,
1158 struct buffer_head **last_eb_bh,
1159 struct ocfs2_alloc_context *meta_ac)
1161 int status, new_blocks, i;
1162 u64 next_blkno, new_last_eb_blk;
1163 struct buffer_head *bh;
1164 struct buffer_head **new_eb_bhs = NULL;
1165 struct ocfs2_extent_block *eb;
1166 struct ocfs2_extent_list *eb_el;
1167 struct ocfs2_extent_list *el;
1168 u32 new_cpos, root_end;
1170 BUG_ON(!last_eb_bh || !*last_eb_bh);
1173 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
1176 el = et->et_root_el;
1178 /* we never add a branch to a leaf. */
1179 BUG_ON(!el->l_tree_depth);
1181 new_blocks = le16_to_cpu(el->l_tree_depth);
1183 eb = (struct ocfs2_extent_block *)(*last_eb_bh)->b_data;
1184 new_cpos = ocfs2_sum_rightmost_rec(&eb->h_list);
1185 root_end = ocfs2_sum_rightmost_rec(et->et_root_el);
1188 * If there is a gap before the root end and the real end
1189 * of the righmost leaf block, we need to remove the gap
1190 * between new_cpos and root_end first so that the tree
1191 * is consistent after we add a new branch(it will start
1194 if (root_end > new_cpos) {
1195 trace_ocfs2_adjust_rightmost_branch(
1196 (unsigned long long)
1197 ocfs2_metadata_cache_owner(et->et_ci),
1198 root_end, new_cpos);
1200 status = ocfs2_adjust_rightmost_branch(handle, et);
1207 /* allocate the number of new eb blocks we need */
1208 new_eb_bhs = kcalloc(new_blocks, sizeof(struct buffer_head *),
1216 status = ocfs2_create_new_meta_bhs(handle, et, new_blocks,
1217 meta_ac, new_eb_bhs);
1223 /* Note: new_eb_bhs[new_blocks - 1] is the guy which will be
1224 * linked with the rest of the tree.
1225 * conversly, new_eb_bhs[0] is the new bottommost leaf.
1227 * when we leave the loop, new_last_eb_blk will point to the
1228 * newest leaf, and next_blkno will point to the topmost extent
1230 next_blkno = new_last_eb_blk = 0;
1231 for(i = 0; i < new_blocks; i++) {
1233 eb = (struct ocfs2_extent_block *) bh->b_data;
1234 /* ocfs2_create_new_meta_bhs() should create it right! */
1235 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1236 eb_el = &eb->h_list;
1238 status = ocfs2_journal_access_eb(handle, et->et_ci, bh,
1239 OCFS2_JOURNAL_ACCESS_CREATE);
1245 eb->h_next_leaf_blk = 0;
1246 eb_el->l_tree_depth = cpu_to_le16(i);
1247 eb_el->l_next_free_rec = cpu_to_le16(1);
1249 * This actually counts as an empty extent as
1252 eb_el->l_recs[0].e_cpos = cpu_to_le32(new_cpos);
1253 eb_el->l_recs[0].e_blkno = cpu_to_le64(next_blkno);
1255 * eb_el isn't always an interior node, but even leaf
1256 * nodes want a zero'd flags and reserved field so
1257 * this gets the whole 32 bits regardless of use.
1259 eb_el->l_recs[0].e_int_clusters = cpu_to_le32(0);
1260 if (!eb_el->l_tree_depth)
1261 new_last_eb_blk = le64_to_cpu(eb->h_blkno);
1263 ocfs2_journal_dirty(handle, bh);
1264 next_blkno = le64_to_cpu(eb->h_blkno);
1267 /* This is a bit hairy. We want to update up to three blocks
1268 * here without leaving any of them in an inconsistent state
1269 * in case of error. We don't have to worry about
1270 * journal_dirty erroring as it won't unless we've aborted the
1271 * handle (in which case we would never be here) so reserving
1272 * the write with journal_access is all we need to do. */
1273 status = ocfs2_journal_access_eb(handle, et->et_ci, *last_eb_bh,
1274 OCFS2_JOURNAL_ACCESS_WRITE);
1279 status = ocfs2_et_root_journal_access(handle, et,
1280 OCFS2_JOURNAL_ACCESS_WRITE);
1286 status = ocfs2_journal_access_eb(handle, et->et_ci, eb_bh,
1287 OCFS2_JOURNAL_ACCESS_WRITE);
1294 /* Link the new branch into the rest of the tree (el will
1295 * either be on the root_bh, or the extent block passed in. */
1296 i = le16_to_cpu(el->l_next_free_rec);
1297 el->l_recs[i].e_blkno = cpu_to_le64(next_blkno);
1298 el->l_recs[i].e_cpos = cpu_to_le32(new_cpos);
1299 el->l_recs[i].e_int_clusters = 0;
1300 le16_add_cpu(&el->l_next_free_rec, 1);
1302 /* fe needs a new last extent block pointer, as does the
1303 * next_leaf on the previously last-extent-block. */
1304 ocfs2_et_set_last_eb_blk(et, new_last_eb_blk);
1306 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
1307 eb->h_next_leaf_blk = cpu_to_le64(new_last_eb_blk);
1309 ocfs2_journal_dirty(handle, *last_eb_bh);
1310 ocfs2_journal_dirty(handle, et->et_root_bh);
1312 ocfs2_journal_dirty(handle, eb_bh);
1315 * Some callers want to track the rightmost leaf so pass it
1318 brelse(*last_eb_bh);
1319 get_bh(new_eb_bhs[0]);
1320 *last_eb_bh = new_eb_bhs[0];
1325 for (i = 0; i < new_blocks; i++)
1326 brelse(new_eb_bhs[i]);
1334 * adds another level to the allocation tree.
1335 * returns back the new extent block so you can add a branch to it
1338 static int ocfs2_shift_tree_depth(handle_t *handle,
1339 struct ocfs2_extent_tree *et,
1340 struct ocfs2_alloc_context *meta_ac,
1341 struct buffer_head **ret_new_eb_bh)
1345 struct buffer_head *new_eb_bh = NULL;
1346 struct ocfs2_extent_block *eb;
1347 struct ocfs2_extent_list *root_el;
1348 struct ocfs2_extent_list *eb_el;
1350 status = ocfs2_create_new_meta_bhs(handle, et, 1, meta_ac,
1357 eb = (struct ocfs2_extent_block *) new_eb_bh->b_data;
1358 /* ocfs2_create_new_meta_bhs() should create it right! */
1359 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1361 eb_el = &eb->h_list;
1362 root_el = et->et_root_el;
1364 status = ocfs2_journal_access_eb(handle, et->et_ci, new_eb_bh,
1365 OCFS2_JOURNAL_ACCESS_CREATE);
1371 /* copy the root extent list data into the new extent block */
1372 eb_el->l_tree_depth = root_el->l_tree_depth;
1373 eb_el->l_next_free_rec = root_el->l_next_free_rec;
1374 for (i = 0; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1375 eb_el->l_recs[i] = root_el->l_recs[i];
1377 ocfs2_journal_dirty(handle, new_eb_bh);
1379 status = ocfs2_et_root_journal_access(handle, et,
1380 OCFS2_JOURNAL_ACCESS_WRITE);
1386 new_clusters = ocfs2_sum_rightmost_rec(eb_el);
1388 /* update root_bh now */
1389 le16_add_cpu(&root_el->l_tree_depth, 1);
1390 root_el->l_recs[0].e_cpos = 0;
1391 root_el->l_recs[0].e_blkno = eb->h_blkno;
1392 root_el->l_recs[0].e_int_clusters = cpu_to_le32(new_clusters);
1393 for (i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1394 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
1395 root_el->l_next_free_rec = cpu_to_le16(1);
1397 /* If this is our 1st tree depth shift, then last_eb_blk
1398 * becomes the allocated extent block */
1399 if (root_el->l_tree_depth == cpu_to_le16(1))
1400 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
1402 ocfs2_journal_dirty(handle, et->et_root_bh);
1404 *ret_new_eb_bh = new_eb_bh;
1414 * Should only be called when there is no space left in any of the
1415 * leaf nodes. What we want to do is find the lowest tree depth
1416 * non-leaf extent block with room for new records. There are three
1417 * valid results of this search:
1419 * 1) a lowest extent block is found, then we pass it back in
1420 * *lowest_eb_bh and return '0'
1422 * 2) the search fails to find anything, but the root_el has room. We
1423 * pass NULL back in *lowest_eb_bh, but still return '0'
1425 * 3) the search fails to find anything AND the root_el is full, in
1426 * which case we return > 0
1428 * return status < 0 indicates an error.
1430 static int ocfs2_find_branch_target(struct ocfs2_extent_tree *et,
1431 struct buffer_head **target_bh)
1435 struct ocfs2_extent_block *eb;
1436 struct ocfs2_extent_list *el;
1437 struct buffer_head *bh = NULL;
1438 struct buffer_head *lowest_bh = NULL;
1442 el = et->et_root_el;
1444 while(le16_to_cpu(el->l_tree_depth) > 1) {
1445 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1446 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1447 "Owner %llu has empty extent list (next_free_rec == 0)\n",
1448 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
1452 i = le16_to_cpu(el->l_next_free_rec) - 1;
1453 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1455 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1456 "Owner %llu has extent list where extent # %d has no physical block start\n",
1457 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), i);
1465 status = ocfs2_read_extent_block(et->et_ci, blkno, &bh);
1471 eb = (struct ocfs2_extent_block *) bh->b_data;
1474 if (le16_to_cpu(el->l_next_free_rec) <
1475 le16_to_cpu(el->l_count)) {
1482 /* If we didn't find one and the fe doesn't have any room,
1483 * then return '1' */
1484 el = et->et_root_el;
1485 if (!lowest_bh && (el->l_next_free_rec == el->l_count))
1488 *target_bh = lowest_bh;
1496 * Grow a b-tree so that it has more records.
1498 * We might shift the tree depth in which case existing paths should
1499 * be considered invalid.
1501 * Tree depth after the grow is returned via *final_depth.
1503 * *last_eb_bh will be updated by ocfs2_add_branch().
1505 static int ocfs2_grow_tree(handle_t *handle, struct ocfs2_extent_tree *et,
1506 int *final_depth, struct buffer_head **last_eb_bh,
1507 struct ocfs2_alloc_context *meta_ac)
1510 struct ocfs2_extent_list *el = et->et_root_el;
1511 int depth = le16_to_cpu(el->l_tree_depth);
1512 struct buffer_head *bh = NULL;
1514 BUG_ON(meta_ac == NULL);
1516 shift = ocfs2_find_branch_target(et, &bh);
1523 /* We traveled all the way to the bottom of the allocation tree
1524 * and didn't find room for any more extents - we need to add
1525 * another tree level */
1528 trace_ocfs2_grow_tree(
1529 (unsigned long long)
1530 ocfs2_metadata_cache_owner(et->et_ci),
1533 /* ocfs2_shift_tree_depth will return us a buffer with
1534 * the new extent block (so we can pass that to
1535 * ocfs2_add_branch). */
1536 ret = ocfs2_shift_tree_depth(handle, et, meta_ac, &bh);
1544 * Special case: we have room now if we shifted from
1545 * tree_depth 0, so no more work needs to be done.
1547 * We won't be calling add_branch, so pass
1548 * back *last_eb_bh as the new leaf. At depth
1549 * zero, it should always be null so there's
1550 * no reason to brelse.
1552 BUG_ON(*last_eb_bh);
1559 /* call ocfs2_add_branch to add the final part of the tree with
1561 ret = ocfs2_add_branch(handle, et, bh, last_eb_bh,
1570 *final_depth = depth;
1576 * This function will discard the rightmost extent record.
1578 static void ocfs2_shift_records_right(struct ocfs2_extent_list *el)
1580 int next_free = le16_to_cpu(el->l_next_free_rec);
1581 int count = le16_to_cpu(el->l_count);
1582 unsigned int num_bytes;
1585 /* This will cause us to go off the end of our extent list. */
1586 BUG_ON(next_free >= count);
1588 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1590 memmove(&el->l_recs[1], &el->l_recs[0], num_bytes);
1593 static void ocfs2_rotate_leaf(struct ocfs2_extent_list *el,
1594 struct ocfs2_extent_rec *insert_rec)
1596 int i, insert_index, next_free, has_empty, num_bytes;
1597 u32 insert_cpos = le32_to_cpu(insert_rec->e_cpos);
1598 struct ocfs2_extent_rec *rec;
1600 next_free = le16_to_cpu(el->l_next_free_rec);
1601 has_empty = ocfs2_is_empty_extent(&el->l_recs[0]);
1605 /* The tree code before us didn't allow enough room in the leaf. */
1606 BUG_ON(el->l_next_free_rec == el->l_count && !has_empty);
1609 * The easiest way to approach this is to just remove the
1610 * empty extent and temporarily decrement next_free.
1614 * If next_free was 1 (only an empty extent), this
1615 * loop won't execute, which is fine. We still want
1616 * the decrement above to happen.
1618 for(i = 0; i < (next_free - 1); i++)
1619 el->l_recs[i] = el->l_recs[i+1];
1625 * Figure out what the new record index should be.
1627 for(i = 0; i < next_free; i++) {
1628 rec = &el->l_recs[i];
1630 if (insert_cpos < le32_to_cpu(rec->e_cpos))
1635 trace_ocfs2_rotate_leaf(insert_cpos, insert_index,
1636 has_empty, next_free,
1637 le16_to_cpu(el->l_count));
1639 BUG_ON(insert_index < 0);
1640 BUG_ON(insert_index >= le16_to_cpu(el->l_count));
1641 BUG_ON(insert_index > next_free);
1644 * No need to memmove if we're just adding to the tail.
1646 if (insert_index != next_free) {
1647 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1649 num_bytes = next_free - insert_index;
1650 num_bytes *= sizeof(struct ocfs2_extent_rec);
1651 memmove(&el->l_recs[insert_index + 1],
1652 &el->l_recs[insert_index],
1657 * Either we had an empty extent, and need to re-increment or
1658 * there was no empty extent on a non full rightmost leaf node,
1659 * in which case we still need to increment.
1662 el->l_next_free_rec = cpu_to_le16(next_free);
1664 * Make sure none of the math above just messed up our tree.
1666 BUG_ON(le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count));
1668 el->l_recs[insert_index] = *insert_rec;
1672 static void ocfs2_remove_empty_extent(struct ocfs2_extent_list *el)
1674 int size, num_recs = le16_to_cpu(el->l_next_free_rec);
1676 BUG_ON(num_recs == 0);
1678 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
1680 size = num_recs * sizeof(struct ocfs2_extent_rec);
1681 memmove(&el->l_recs[0], &el->l_recs[1], size);
1682 memset(&el->l_recs[num_recs], 0,
1683 sizeof(struct ocfs2_extent_rec));
1684 el->l_next_free_rec = cpu_to_le16(num_recs);
1689 * Create an empty extent record .
1691 * l_next_free_rec may be updated.
1693 * If an empty extent already exists do nothing.
1695 static void ocfs2_create_empty_extent(struct ocfs2_extent_list *el)
1697 int next_free = le16_to_cpu(el->l_next_free_rec);
1699 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
1704 if (ocfs2_is_empty_extent(&el->l_recs[0]))
1707 mlog_bug_on_msg(el->l_count == el->l_next_free_rec,
1708 "Asked to create an empty extent in a full list:\n"
1709 "count = %u, tree depth = %u",
1710 le16_to_cpu(el->l_count),
1711 le16_to_cpu(el->l_tree_depth));
1713 ocfs2_shift_records_right(el);
1716 le16_add_cpu(&el->l_next_free_rec, 1);
1717 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
1721 * For a rotation which involves two leaf nodes, the "root node" is
1722 * the lowest level tree node which contains a path to both leafs. This
1723 * resulting set of information can be used to form a complete "subtree"
1725 * This function is passed two full paths from the dinode down to a
1726 * pair of adjacent leaves. It's task is to figure out which path
1727 * index contains the subtree root - this can be the root index itself
1728 * in a worst-case rotation.
1730 * The array index of the subtree root is passed back.
1732 int ocfs2_find_subtree_root(struct ocfs2_extent_tree *et,
1733 struct ocfs2_path *left,
1734 struct ocfs2_path *right)
1739 * Check that the caller passed in two paths from the same tree.
1741 BUG_ON(path_root_bh(left) != path_root_bh(right));
1747 * The caller didn't pass two adjacent paths.
1749 mlog_bug_on_msg(i > left->p_tree_depth,
1750 "Owner %llu, left depth %u, right depth %u\n"
1751 "left leaf blk %llu, right leaf blk %llu\n",
1752 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
1753 left->p_tree_depth, right->p_tree_depth,
1754 (unsigned long long)path_leaf_bh(left)->b_blocknr,
1755 (unsigned long long)path_leaf_bh(right)->b_blocknr);
1756 } while (left->p_node[i].bh->b_blocknr ==
1757 right->p_node[i].bh->b_blocknr);
1762 typedef void (path_insert_t)(void *, struct buffer_head *);
1765 * Traverse a btree path in search of cpos, starting at root_el.
1767 * This code can be called with a cpos larger than the tree, in which
1768 * case it will return the rightmost path.
1770 static int __ocfs2_find_path(struct ocfs2_caching_info *ci,
1771 struct ocfs2_extent_list *root_el, u32 cpos,
1772 path_insert_t *func, void *data)
1777 struct buffer_head *bh = NULL;
1778 struct ocfs2_extent_block *eb;
1779 struct ocfs2_extent_list *el;
1780 struct ocfs2_extent_rec *rec;
1783 while (el->l_tree_depth) {
1784 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1785 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1786 "Owner %llu has empty extent list at depth %u\n",
1787 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1788 le16_to_cpu(el->l_tree_depth));
1794 for(i = 0; i < le16_to_cpu(el->l_next_free_rec) - 1; i++) {
1795 rec = &el->l_recs[i];
1798 * In the case that cpos is off the allocation
1799 * tree, this should just wind up returning the
1802 range = le32_to_cpu(rec->e_cpos) +
1803 ocfs2_rec_clusters(el, rec);
1804 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
1808 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1810 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1811 "Owner %llu has bad blkno in extent list at depth %u (index %d)\n",
1812 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1813 le16_to_cpu(el->l_tree_depth), i);
1820 ret = ocfs2_read_extent_block(ci, blkno, &bh);
1826 eb = (struct ocfs2_extent_block *) bh->b_data;
1829 if (le16_to_cpu(el->l_next_free_rec) >
1830 le16_to_cpu(el->l_count)) {
1831 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1832 "Owner %llu has bad count in extent list at block %llu (next free=%u, count=%u)\n",
1833 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1834 (unsigned long long)bh->b_blocknr,
1835 le16_to_cpu(el->l_next_free_rec),
1836 le16_to_cpu(el->l_count));
1847 * Catch any trailing bh that the loop didn't handle.
1855 * Given an initialized path (that is, it has a valid root extent
1856 * list), this function will traverse the btree in search of the path
1857 * which would contain cpos.
1859 * The path traveled is recorded in the path structure.
1861 * Note that this will not do any comparisons on leaf node extent
1862 * records, so it will work fine in the case that we just added a tree
1865 struct find_path_data {
1867 struct ocfs2_path *path;
1869 static void find_path_ins(void *data, struct buffer_head *bh)
1871 struct find_path_data *fp = data;
1874 ocfs2_path_insert_eb(fp->path, fp->index, bh);
1877 int ocfs2_find_path(struct ocfs2_caching_info *ci,
1878 struct ocfs2_path *path, u32 cpos)
1880 struct find_path_data data;
1884 return __ocfs2_find_path(ci, path_root_el(path), cpos,
1885 find_path_ins, &data);
1888 static void find_leaf_ins(void *data, struct buffer_head *bh)
1890 struct ocfs2_extent_block *eb =(struct ocfs2_extent_block *)bh->b_data;
1891 struct ocfs2_extent_list *el = &eb->h_list;
1892 struct buffer_head **ret = data;
1894 /* We want to retain only the leaf block. */
1895 if (le16_to_cpu(el->l_tree_depth) == 0) {
1901 * Find the leaf block in the tree which would contain cpos. No
1902 * checking of the actual leaf is done.
1904 * Some paths want to call this instead of allocating a path structure
1905 * and calling ocfs2_find_path().
1907 * This function doesn't handle non btree extent lists.
1909 int ocfs2_find_leaf(struct ocfs2_caching_info *ci,
1910 struct ocfs2_extent_list *root_el, u32 cpos,
1911 struct buffer_head **leaf_bh)
1914 struct buffer_head *bh = NULL;
1916 ret = __ocfs2_find_path(ci, root_el, cpos, find_leaf_ins, &bh);
1928 * Adjust the adjacent records (left_rec, right_rec) involved in a rotation.
1930 * Basically, we've moved stuff around at the bottom of the tree and
1931 * we need to fix up the extent records above the changes to reflect
1934 * left_rec: the record on the left.
1935 * right_rec: the record to the right of left_rec
1936 * right_child_el: is the child list pointed to by right_rec
1938 * By definition, this only works on interior nodes.
1940 static void ocfs2_adjust_adjacent_records(struct ocfs2_extent_rec *left_rec,
1941 struct ocfs2_extent_rec *right_rec,
1942 struct ocfs2_extent_list *right_child_el)
1944 u32 left_clusters, right_end;
1947 * Interior nodes never have holes. Their cpos is the cpos of
1948 * the leftmost record in their child list. Their cluster
1949 * count covers the full theoretical range of their child list
1950 * - the range between their cpos and the cpos of the record
1951 * immediately to their right.
1953 left_clusters = le32_to_cpu(right_child_el->l_recs[0].e_cpos);
1954 if (!ocfs2_rec_clusters(right_child_el, &right_child_el->l_recs[0])) {
1955 BUG_ON(right_child_el->l_tree_depth);
1956 BUG_ON(le16_to_cpu(right_child_el->l_next_free_rec) <= 1);
1957 left_clusters = le32_to_cpu(right_child_el->l_recs[1].e_cpos);
1959 left_clusters -= le32_to_cpu(left_rec->e_cpos);
1960 left_rec->e_int_clusters = cpu_to_le32(left_clusters);
1963 * Calculate the rightmost cluster count boundary before
1964 * moving cpos - we will need to adjust clusters after
1965 * updating e_cpos to keep the same highest cluster count.
1967 right_end = le32_to_cpu(right_rec->e_cpos);
1968 right_end += le32_to_cpu(right_rec->e_int_clusters);
1970 right_rec->e_cpos = left_rec->e_cpos;
1971 le32_add_cpu(&right_rec->e_cpos, left_clusters);
1973 right_end -= le32_to_cpu(right_rec->e_cpos);
1974 right_rec->e_int_clusters = cpu_to_le32(right_end);
1978 * Adjust the adjacent root node records involved in a
1979 * rotation. left_el_blkno is passed in as a key so that we can easily
1980 * find it's index in the root list.
1982 static void ocfs2_adjust_root_records(struct ocfs2_extent_list *root_el,
1983 struct ocfs2_extent_list *left_el,
1984 struct ocfs2_extent_list *right_el,
1989 BUG_ON(le16_to_cpu(root_el->l_tree_depth) <=
1990 le16_to_cpu(left_el->l_tree_depth));
1992 for(i = 0; i < le16_to_cpu(root_el->l_next_free_rec) - 1; i++) {
1993 if (le64_to_cpu(root_el->l_recs[i].e_blkno) == left_el_blkno)
1998 * The path walking code should have never returned a root and
1999 * two paths which are not adjacent.
2001 BUG_ON(i >= (le16_to_cpu(root_el->l_next_free_rec) - 1));
2003 ocfs2_adjust_adjacent_records(&root_el->l_recs[i],
2004 &root_el->l_recs[i + 1], right_el);
2008 * We've changed a leaf block (in right_path) and need to reflect that
2009 * change back up the subtree.
2011 * This happens in multiple places:
2012 * - When we've moved an extent record from the left path leaf to the right
2013 * path leaf to make room for an empty extent in the left path leaf.
2014 * - When our insert into the right path leaf is at the leftmost edge
2015 * and requires an update of the path immediately to it's left. This
2016 * can occur at the end of some types of rotation and appending inserts.
2017 * - When we've adjusted the last extent record in the left path leaf and the
2018 * 1st extent record in the right path leaf during cross extent block merge.
2020 static void ocfs2_complete_edge_insert(handle_t *handle,
2021 struct ocfs2_path *left_path,
2022 struct ocfs2_path *right_path,
2026 struct ocfs2_extent_list *el, *left_el, *right_el;
2027 struct ocfs2_extent_rec *left_rec, *right_rec;
2028 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2031 * Update the counts and position values within all the
2032 * interior nodes to reflect the leaf rotation we just did.
2034 * The root node is handled below the loop.
2036 * We begin the loop with right_el and left_el pointing to the
2037 * leaf lists and work our way up.
2039 * NOTE: within this loop, left_el and right_el always refer
2040 * to the *child* lists.
2042 left_el = path_leaf_el(left_path);
2043 right_el = path_leaf_el(right_path);
2044 for(i = left_path->p_tree_depth - 1; i > subtree_index; i--) {
2045 trace_ocfs2_complete_edge_insert(i);
2048 * One nice property of knowing that all of these
2049 * nodes are below the root is that we only deal with
2050 * the leftmost right node record and the rightmost
2053 el = left_path->p_node[i].el;
2054 idx = le16_to_cpu(left_el->l_next_free_rec) - 1;
2055 left_rec = &el->l_recs[idx];
2057 el = right_path->p_node[i].el;
2058 right_rec = &el->l_recs[0];
2060 ocfs2_adjust_adjacent_records(left_rec, right_rec, right_el);
2062 ocfs2_journal_dirty(handle, left_path->p_node[i].bh);
2063 ocfs2_journal_dirty(handle, right_path->p_node[i].bh);
2066 * Setup our list pointers now so that the current
2067 * parents become children in the next iteration.
2069 left_el = left_path->p_node[i].el;
2070 right_el = right_path->p_node[i].el;
2074 * At the root node, adjust the two adjacent records which
2075 * begin our path to the leaves.
2078 el = left_path->p_node[subtree_index].el;
2079 left_el = left_path->p_node[subtree_index + 1].el;
2080 right_el = right_path->p_node[subtree_index + 1].el;
2082 ocfs2_adjust_root_records(el, left_el, right_el,
2083 left_path->p_node[subtree_index + 1].bh->b_blocknr);
2085 root_bh = left_path->p_node[subtree_index].bh;
2087 ocfs2_journal_dirty(handle, root_bh);
2090 static int ocfs2_rotate_subtree_right(handle_t *handle,
2091 struct ocfs2_extent_tree *et,
2092 struct ocfs2_path *left_path,
2093 struct ocfs2_path *right_path,
2097 struct buffer_head *right_leaf_bh;
2098 struct buffer_head *left_leaf_bh = NULL;
2099 struct buffer_head *root_bh;
2100 struct ocfs2_extent_list *right_el, *left_el;
2101 struct ocfs2_extent_rec move_rec;
2103 left_leaf_bh = path_leaf_bh(left_path);
2104 left_el = path_leaf_el(left_path);
2106 if (left_el->l_next_free_rec != left_el->l_count) {
2107 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
2108 "Inode %llu has non-full interior leaf node %llu (next free = %u)\n",
2109 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2110 (unsigned long long)left_leaf_bh->b_blocknr,
2111 le16_to_cpu(left_el->l_next_free_rec));
2116 * This extent block may already have an empty record, so we
2117 * return early if so.
2119 if (ocfs2_is_empty_extent(&left_el->l_recs[0]))
2122 root_bh = left_path->p_node[subtree_index].bh;
2123 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2125 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2132 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2133 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2140 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2148 right_leaf_bh = path_leaf_bh(right_path);
2149 right_el = path_leaf_el(right_path);
2151 /* This is a code error, not a disk corruption. */
2152 mlog_bug_on_msg(!right_el->l_next_free_rec, "Inode %llu: Rotate fails "
2153 "because rightmost leaf block %llu is empty\n",
2154 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2155 (unsigned long long)right_leaf_bh->b_blocknr);
2157 ocfs2_create_empty_extent(right_el);
2159 ocfs2_journal_dirty(handle, right_leaf_bh);
2161 /* Do the copy now. */
2162 i = le16_to_cpu(left_el->l_next_free_rec) - 1;
2163 move_rec = left_el->l_recs[i];
2164 right_el->l_recs[0] = move_rec;
2167 * Clear out the record we just copied and shift everything
2168 * over, leaving an empty extent in the left leaf.
2170 * We temporarily subtract from next_free_rec so that the
2171 * shift will lose the tail record (which is now defunct).
2173 le16_add_cpu(&left_el->l_next_free_rec, -1);
2174 ocfs2_shift_records_right(left_el);
2175 memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2176 le16_add_cpu(&left_el->l_next_free_rec, 1);
2178 ocfs2_journal_dirty(handle, left_leaf_bh);
2180 ocfs2_complete_edge_insert(handle, left_path, right_path,
2188 * Given a full path, determine what cpos value would return us a path
2189 * containing the leaf immediately to the left of the current one.
2191 * Will return zero if the path passed in is already the leftmost path.
2193 int ocfs2_find_cpos_for_left_leaf(struct super_block *sb,
2194 struct ocfs2_path *path, u32 *cpos)
2198 struct ocfs2_extent_list *el;
2200 BUG_ON(path->p_tree_depth == 0);
2204 blkno = path_leaf_bh(path)->b_blocknr;
2206 /* Start at the tree node just above the leaf and work our way up. */
2207 i = path->p_tree_depth - 1;
2209 el = path->p_node[i].el;
2212 * Find the extent record just before the one in our
2215 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2216 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2220 * We've determined that the
2221 * path specified is already
2222 * the leftmost one - return a
2228 * The leftmost record points to our
2229 * leaf - we need to travel up the
2235 *cpos = le32_to_cpu(el->l_recs[j - 1].e_cpos);
2236 *cpos = *cpos + ocfs2_rec_clusters(el,
2237 &el->l_recs[j - 1]);
2244 * If we got here, we never found a valid node where
2245 * the tree indicated one should be.
2247 ocfs2_error(sb, "Invalid extent tree at extent block %llu\n",
2248 (unsigned long long)blkno);
2253 blkno = path->p_node[i].bh->b_blocknr;
2262 * Extend the transaction by enough credits to complete the rotation,
2263 * and still leave at least the original number of credits allocated
2264 * to this transaction.
2266 static int ocfs2_extend_rotate_transaction(handle_t *handle, int subtree_depth,
2268 struct ocfs2_path *path)
2271 int credits = (path->p_tree_depth - subtree_depth) * 2 + 1 + op_credits;
2273 if (handle->h_buffer_credits < credits)
2274 ret = ocfs2_extend_trans(handle,
2275 credits - handle->h_buffer_credits);
2281 * Trap the case where we're inserting into the theoretical range past
2282 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2283 * whose cpos is less than ours into the right leaf.
2285 * It's only necessary to look at the rightmost record of the left
2286 * leaf because the logic that calls us should ensure that the
2287 * theoretical ranges in the path components above the leaves are
2290 static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path,
2293 struct ocfs2_extent_list *left_el;
2294 struct ocfs2_extent_rec *rec;
2297 left_el = path_leaf_el(left_path);
2298 next_free = le16_to_cpu(left_el->l_next_free_rec);
2299 rec = &left_el->l_recs[next_free - 1];
2301 if (insert_cpos > le32_to_cpu(rec->e_cpos))
2306 static int ocfs2_leftmost_rec_contains(struct ocfs2_extent_list *el, u32 cpos)
2308 int next_free = le16_to_cpu(el->l_next_free_rec);
2310 struct ocfs2_extent_rec *rec;
2315 rec = &el->l_recs[0];
2316 if (ocfs2_is_empty_extent(rec)) {
2320 rec = &el->l_recs[1];
2323 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2324 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
2330 * Rotate all the records in a btree right one record, starting at insert_cpos.
2332 * The path to the rightmost leaf should be passed in.
2334 * The array is assumed to be large enough to hold an entire path (tree depth).
2336 * Upon successful return from this function:
2338 * - The 'right_path' array will contain a path to the leaf block
2339 * whose range contains e_cpos.
2340 * - That leaf block will have a single empty extent in list index 0.
2341 * - In the case that the rotation requires a post-insert update,
2342 * *ret_left_path will contain a valid path which can be passed to
2343 * ocfs2_insert_path().
2345 static int ocfs2_rotate_tree_right(handle_t *handle,
2346 struct ocfs2_extent_tree *et,
2347 enum ocfs2_split_type split,
2349 struct ocfs2_path *right_path,
2350 struct ocfs2_path **ret_left_path)
2352 int ret, start, orig_credits = handle->h_buffer_credits;
2354 struct ocfs2_path *left_path = NULL;
2355 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2357 *ret_left_path = NULL;
2359 left_path = ocfs2_new_path_from_path(right_path);
2366 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2372 trace_ocfs2_rotate_tree_right(
2373 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2377 * What we want to do here is:
2379 * 1) Start with the rightmost path.
2381 * 2) Determine a path to the leaf block directly to the left
2384 * 3) Determine the 'subtree root' - the lowest level tree node
2385 * which contains a path to both leaves.
2387 * 4) Rotate the subtree.
2389 * 5) Find the next subtree by considering the left path to be
2390 * the new right path.
2392 * The check at the top of this while loop also accepts
2393 * insert_cpos == cpos because cpos is only a _theoretical_
2394 * value to get us the left path - insert_cpos might very well
2395 * be filling that hole.
2397 * Stop at a cpos of '0' because we either started at the
2398 * leftmost branch (i.e., a tree with one branch and a
2399 * rotation inside of it), or we've gone as far as we can in
2400 * rotating subtrees.
2402 while (cpos && insert_cpos <= cpos) {
2403 trace_ocfs2_rotate_tree_right(
2404 (unsigned long long)
2405 ocfs2_metadata_cache_owner(et->et_ci),
2408 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
2414 mlog_bug_on_msg(path_leaf_bh(left_path) ==
2415 path_leaf_bh(right_path),
2416 "Owner %llu: error during insert of %u "
2417 "(left path cpos %u) results in two identical "
2418 "paths ending at %llu\n",
2419 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2421 (unsigned long long)
2422 path_leaf_bh(left_path)->b_blocknr);
2424 if (split == SPLIT_NONE &&
2425 ocfs2_rotate_requires_path_adjustment(left_path,
2429 * We've rotated the tree as much as we
2430 * should. The rest is up to
2431 * ocfs2_insert_path() to complete, after the
2432 * record insertion. We indicate this
2433 * situation by returning the left path.
2435 * The reason we don't adjust the records here
2436 * before the record insert is that an error
2437 * later might break the rule where a parent
2438 * record e_cpos will reflect the actual
2439 * e_cpos of the 1st nonempty record of the
2442 *ret_left_path = left_path;
2446 start = ocfs2_find_subtree_root(et, left_path, right_path);
2448 trace_ocfs2_rotate_subtree(start,
2449 (unsigned long long)
2450 right_path->p_node[start].bh->b_blocknr,
2451 right_path->p_tree_depth);
2453 ret = ocfs2_extend_rotate_transaction(handle, start,
2454 orig_credits, right_path);
2460 ret = ocfs2_rotate_subtree_right(handle, et, left_path,
2467 if (split != SPLIT_NONE &&
2468 ocfs2_leftmost_rec_contains(path_leaf_el(right_path),
2471 * A rotate moves the rightmost left leaf
2472 * record over to the leftmost right leaf
2473 * slot. If we're doing an extent split
2474 * instead of a real insert, then we have to
2475 * check that the extent to be split wasn't
2476 * just moved over. If it was, then we can
2477 * exit here, passing left_path back -
2478 * ocfs2_split_extent() is smart enough to
2479 * search both leaves.
2481 *ret_left_path = left_path;
2486 * There is no need to re-read the next right path
2487 * as we know that it'll be our current left
2488 * path. Optimize by copying values instead.
2490 ocfs2_mv_path(right_path, left_path);
2492 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2500 ocfs2_free_path(left_path);
2506 static int ocfs2_update_edge_lengths(handle_t *handle,
2507 struct ocfs2_extent_tree *et,
2508 struct ocfs2_path *path)
2511 struct ocfs2_extent_rec *rec;
2512 struct ocfs2_extent_list *el;
2513 struct ocfs2_extent_block *eb;
2516 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
2522 /* Path should always be rightmost. */
2523 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
2524 BUG_ON(eb->h_next_leaf_blk != 0ULL);
2527 BUG_ON(le16_to_cpu(el->l_next_free_rec) == 0);
2528 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2529 rec = &el->l_recs[idx];
2530 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2532 for (i = 0; i < path->p_tree_depth; i++) {
2533 el = path->p_node[i].el;
2534 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2535 rec = &el->l_recs[idx];
2537 rec->e_int_clusters = cpu_to_le32(range);
2538 le32_add_cpu(&rec->e_int_clusters, -le32_to_cpu(rec->e_cpos));
2540 ocfs2_journal_dirty(handle, path->p_node[i].bh);
2546 static void ocfs2_unlink_path(handle_t *handle,
2547 struct ocfs2_extent_tree *et,
2548 struct ocfs2_cached_dealloc_ctxt *dealloc,
2549 struct ocfs2_path *path, int unlink_start)
2552 struct ocfs2_extent_block *eb;
2553 struct ocfs2_extent_list *el;
2554 struct buffer_head *bh;
2556 for(i = unlink_start; i < path_num_items(path); i++) {
2557 bh = path->p_node[i].bh;
2559 eb = (struct ocfs2_extent_block *)bh->b_data;
2561 * Not all nodes might have had their final count
2562 * decremented by the caller - handle this here.
2565 if (le16_to_cpu(el->l_next_free_rec) > 1) {
2567 "Inode %llu, attempted to remove extent block "
2568 "%llu with %u records\n",
2569 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2570 (unsigned long long)le64_to_cpu(eb->h_blkno),
2571 le16_to_cpu(el->l_next_free_rec));
2573 ocfs2_journal_dirty(handle, bh);
2574 ocfs2_remove_from_cache(et->et_ci, bh);
2578 el->l_next_free_rec = 0;
2579 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2581 ocfs2_journal_dirty(handle, bh);
2583 ret = ocfs2_cache_extent_block_free(dealloc, eb);
2587 ocfs2_remove_from_cache(et->et_ci, bh);
2591 static void ocfs2_unlink_subtree(handle_t *handle,
2592 struct ocfs2_extent_tree *et,
2593 struct ocfs2_path *left_path,
2594 struct ocfs2_path *right_path,
2596 struct ocfs2_cached_dealloc_ctxt *dealloc)
2599 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2600 struct ocfs2_extent_list *root_el = left_path->p_node[subtree_index].el;
2601 struct ocfs2_extent_list *el;
2602 struct ocfs2_extent_block *eb;
2604 el = path_leaf_el(left_path);
2606 eb = (struct ocfs2_extent_block *)right_path->p_node[subtree_index + 1].bh->b_data;
2608 for(i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
2609 if (root_el->l_recs[i].e_blkno == eb->h_blkno)
2612 BUG_ON(i >= le16_to_cpu(root_el->l_next_free_rec));
2614 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
2615 le16_add_cpu(&root_el->l_next_free_rec, -1);
2617 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2618 eb->h_next_leaf_blk = 0;
2620 ocfs2_journal_dirty(handle, root_bh);
2621 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2623 ocfs2_unlink_path(handle, et, dealloc, right_path,
2627 static int ocfs2_rotate_subtree_left(handle_t *handle,
2628 struct ocfs2_extent_tree *et,
2629 struct ocfs2_path *left_path,
2630 struct ocfs2_path *right_path,
2632 struct ocfs2_cached_dealloc_ctxt *dealloc,
2635 int ret, i, del_right_subtree = 0, right_has_empty = 0;
2636 struct buffer_head *root_bh, *et_root_bh = path_root_bh(right_path);
2637 struct ocfs2_extent_list *right_leaf_el, *left_leaf_el;
2638 struct ocfs2_extent_block *eb;
2642 right_leaf_el = path_leaf_el(right_path);
2643 left_leaf_el = path_leaf_el(left_path);
2644 root_bh = left_path->p_node[subtree_index].bh;
2645 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2647 if (!ocfs2_is_empty_extent(&left_leaf_el->l_recs[0]))
2650 eb = (struct ocfs2_extent_block *)path_leaf_bh(right_path)->b_data;
2651 if (ocfs2_is_empty_extent(&right_leaf_el->l_recs[0])) {
2653 * It's legal for us to proceed if the right leaf is
2654 * the rightmost one and it has an empty extent. There
2655 * are two cases to handle - whether the leaf will be
2656 * empty after removal or not. If the leaf isn't empty
2657 * then just remove the empty extent up front. The
2658 * next block will handle empty leaves by flagging
2661 * Non rightmost leaves will throw -EAGAIN and the
2662 * caller can manually move the subtree and retry.
2665 if (eb->h_next_leaf_blk != 0ULL)
2668 if (le16_to_cpu(right_leaf_el->l_next_free_rec) > 1) {
2669 ret = ocfs2_journal_access_eb(handle, et->et_ci,
2670 path_leaf_bh(right_path),
2671 OCFS2_JOURNAL_ACCESS_WRITE);
2677 ocfs2_remove_empty_extent(right_leaf_el);
2679 right_has_empty = 1;
2682 if (eb->h_next_leaf_blk == 0ULL &&
2683 le16_to_cpu(right_leaf_el->l_next_free_rec) == 1) {
2685 * We have to update i_last_eb_blk during the meta
2688 ret = ocfs2_et_root_journal_access(handle, et,
2689 OCFS2_JOURNAL_ACCESS_WRITE);
2695 del_right_subtree = 1;
2699 * Getting here with an empty extent in the right path implies
2700 * that it's the rightmost path and will be deleted.
2702 BUG_ON(right_has_empty && !del_right_subtree);
2704 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2711 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2712 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2719 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2727 if (!right_has_empty) {
2729 * Only do this if we're moving a real
2730 * record. Otherwise, the action is delayed until
2731 * after removal of the right path in which case we
2732 * can do a simple shift to remove the empty extent.
2734 ocfs2_rotate_leaf(left_leaf_el, &right_leaf_el->l_recs[0]);
2735 memset(&right_leaf_el->l_recs[0], 0,
2736 sizeof(struct ocfs2_extent_rec));
2738 if (eb->h_next_leaf_blk == 0ULL) {
2740 * Move recs over to get rid of empty extent, decrease
2741 * next_free. This is allowed to remove the last
2742 * extent in our leaf (setting l_next_free_rec to
2743 * zero) - the delete code below won't care.
2745 ocfs2_remove_empty_extent(right_leaf_el);
2748 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2749 ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
2751 if (del_right_subtree) {
2752 ocfs2_unlink_subtree(handle, et, left_path, right_path,
2753 subtree_index, dealloc);
2754 ret = ocfs2_update_edge_lengths(handle, et, left_path);
2760 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2761 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
2764 * Removal of the extent in the left leaf was skipped
2765 * above so we could delete the right path
2768 if (right_has_empty)
2769 ocfs2_remove_empty_extent(left_leaf_el);
2771 ocfs2_journal_dirty(handle, et_root_bh);
2775 ocfs2_complete_edge_insert(handle, left_path, right_path,
2783 * Given a full path, determine what cpos value would return us a path
2784 * containing the leaf immediately to the right of the current one.
2786 * Will return zero if the path passed in is already the rightmost path.
2788 * This looks similar, but is subtly different to
2789 * ocfs2_find_cpos_for_left_leaf().
2791 int ocfs2_find_cpos_for_right_leaf(struct super_block *sb,
2792 struct ocfs2_path *path, u32 *cpos)
2796 struct ocfs2_extent_list *el;
2800 if (path->p_tree_depth == 0)
2803 blkno = path_leaf_bh(path)->b_blocknr;
2805 /* Start at the tree node just above the leaf and work our way up. */
2806 i = path->p_tree_depth - 1;
2810 el = path->p_node[i].el;
2813 * Find the extent record just after the one in our
2816 next_free = le16_to_cpu(el->l_next_free_rec);
2817 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2818 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2819 if (j == (next_free - 1)) {
2822 * We've determined that the
2823 * path specified is already
2824 * the rightmost one - return a
2830 * The rightmost record points to our
2831 * leaf - we need to travel up the
2837 *cpos = le32_to_cpu(el->l_recs[j + 1].e_cpos);
2843 * If we got here, we never found a valid node where
2844 * the tree indicated one should be.
2846 ocfs2_error(sb, "Invalid extent tree at extent block %llu\n",
2847 (unsigned long long)blkno);
2852 blkno = path->p_node[i].bh->b_blocknr;
2860 static int ocfs2_rotate_rightmost_leaf_left(handle_t *handle,
2861 struct ocfs2_extent_tree *et,
2862 struct ocfs2_path *path)
2865 struct buffer_head *bh = path_leaf_bh(path);
2866 struct ocfs2_extent_list *el = path_leaf_el(path);
2868 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
2871 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path,
2872 path_num_items(path) - 1);
2878 ocfs2_remove_empty_extent(el);
2879 ocfs2_journal_dirty(handle, bh);
2885 static int __ocfs2_rotate_tree_left(handle_t *handle,
2886 struct ocfs2_extent_tree *et,
2888 struct ocfs2_path *path,
2889 struct ocfs2_cached_dealloc_ctxt *dealloc,
2890 struct ocfs2_path **empty_extent_path)
2892 int ret, subtree_root, deleted;
2894 struct ocfs2_path *left_path = NULL;
2895 struct ocfs2_path *right_path = NULL;
2896 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2898 if (!ocfs2_is_empty_extent(&(path_leaf_el(path)->l_recs[0])))
2901 *empty_extent_path = NULL;
2903 ret = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos);
2909 left_path = ocfs2_new_path_from_path(path);
2916 ocfs2_cp_path(left_path, path);
2918 right_path = ocfs2_new_path_from_path(path);
2925 while (right_cpos) {
2926 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
2932 subtree_root = ocfs2_find_subtree_root(et, left_path,
2935 trace_ocfs2_rotate_subtree(subtree_root,
2936 (unsigned long long)
2937 right_path->p_node[subtree_root].bh->b_blocknr,
2938 right_path->p_tree_depth);
2940 ret = ocfs2_extend_rotate_transaction(handle, 0,
2941 orig_credits, left_path);
2948 * Caller might still want to make changes to the
2949 * tree root, so re-add it to the journal here.
2951 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2958 ret = ocfs2_rotate_subtree_left(handle, et, left_path,
2959 right_path, subtree_root,
2961 if (ret == -EAGAIN) {
2963 * The rotation has to temporarily stop due to
2964 * the right subtree having an empty
2965 * extent. Pass it back to the caller for a
2968 *empty_extent_path = right_path;
2978 * The subtree rotate might have removed records on
2979 * the rightmost edge. If so, then rotation is
2985 ocfs2_mv_path(left_path, right_path);
2987 ret = ocfs2_find_cpos_for_right_leaf(sb, left_path,
2996 ocfs2_free_path(right_path);
2997 ocfs2_free_path(left_path);
3002 static int ocfs2_remove_rightmost_path(handle_t *handle,
3003 struct ocfs2_extent_tree *et,
3004 struct ocfs2_path *path,
3005 struct ocfs2_cached_dealloc_ctxt *dealloc)
3007 int ret, subtree_index;
3009 struct ocfs2_path *left_path = NULL;
3010 struct ocfs2_extent_block *eb;
3011 struct ocfs2_extent_list *el;
3013 ret = ocfs2_et_sanity_check(et);
3017 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
3023 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3032 * We have a path to the left of this one - it needs
3035 left_path = ocfs2_new_path_from_path(path);
3042 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
3048 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
3054 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
3056 ocfs2_unlink_subtree(handle, et, left_path, path,
3057 subtree_index, dealloc);
3058 ret = ocfs2_update_edge_lengths(handle, et, left_path);
3064 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
3065 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
3068 * 'path' is also the leftmost path which
3069 * means it must be the only one. This gets
3070 * handled differently because we want to
3071 * revert the root back to having extents
3074 ocfs2_unlink_path(handle, et, dealloc, path, 1);
3076 el = et->et_root_el;
3077 el->l_tree_depth = 0;
3078 el->l_next_free_rec = 0;
3079 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3081 ocfs2_et_set_last_eb_blk(et, 0);
3084 ocfs2_journal_dirty(handle, path_root_bh(path));
3087 ocfs2_free_path(left_path);
3091 static int ocfs2_remove_rightmost_empty_extent(struct ocfs2_super *osb,
3092 struct ocfs2_extent_tree *et,
3093 struct ocfs2_path *path,
3094 struct ocfs2_cached_dealloc_ctxt *dealloc)
3098 int credits = path->p_tree_depth * 2 + 1;
3100 handle = ocfs2_start_trans(osb, credits);
3101 if (IS_ERR(handle)) {
3102 ret = PTR_ERR(handle);
3107 ret = ocfs2_remove_rightmost_path(handle, et, path, dealloc);
3111 ocfs2_commit_trans(osb, handle);
3116 * Left rotation of btree records.
3118 * In many ways, this is (unsurprisingly) the opposite of right
3119 * rotation. We start at some non-rightmost path containing an empty
3120 * extent in the leaf block. The code works its way to the rightmost
3121 * path by rotating records to the left in every subtree.
3123 * This is used by any code which reduces the number of extent records
3124 * in a leaf. After removal, an empty record should be placed in the
3125 * leftmost list position.
3127 * This won't handle a length update of the rightmost path records if
3128 * the rightmost tree leaf record is removed so the caller is
3129 * responsible for detecting and correcting that.
3131 static int ocfs2_rotate_tree_left(handle_t *handle,
3132 struct ocfs2_extent_tree *et,
3133 struct ocfs2_path *path,
3134 struct ocfs2_cached_dealloc_ctxt *dealloc)
3136 int ret, orig_credits = handle->h_buffer_credits;
3137 struct ocfs2_path *tmp_path = NULL, *restart_path = NULL;
3138 struct ocfs2_extent_block *eb;
3139 struct ocfs2_extent_list *el;
3141 el = path_leaf_el(path);
3142 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
3145 if (path->p_tree_depth == 0) {
3146 rightmost_no_delete:
3148 * Inline extents. This is trivially handled, so do
3151 ret = ocfs2_rotate_rightmost_leaf_left(handle, et, path);
3158 * Handle rightmost branch now. There's several cases:
3159 * 1) simple rotation leaving records in there. That's trivial.
3160 * 2) rotation requiring a branch delete - there's no more
3161 * records left. Two cases of this:
3162 * a) There are branches to the left.
3163 * b) This is also the leftmost (the only) branch.
3165 * 1) is handled via ocfs2_rotate_rightmost_leaf_left()
3166 * 2a) we need the left branch so that we can update it with the unlink
3167 * 2b) we need to bring the root back to inline extents.
3170 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
3172 if (eb->h_next_leaf_blk == 0) {
3174 * This gets a bit tricky if we're going to delete the
3175 * rightmost path. Get the other cases out of the way
3178 if (le16_to_cpu(el->l_next_free_rec) > 1)
3179 goto rightmost_no_delete;
3181 if (le16_to_cpu(el->l_next_free_rec) == 0) {
3183 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
3184 "Owner %llu has empty extent block at %llu\n",
3185 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
3186 (unsigned long long)le64_to_cpu(eb->h_blkno));
3191 * XXX: The caller can not trust "path" any more after
3192 * this as it will have been deleted. What do we do?
3194 * In theory the rotate-for-merge code will never get
3195 * here because it'll always ask for a rotate in a
3199 ret = ocfs2_remove_rightmost_path(handle, et, path,
3207 * Now we can loop, remembering the path we get from -EAGAIN
3208 * and restarting from there.
3211 ret = __ocfs2_rotate_tree_left(handle, et, orig_credits, path,
3212 dealloc, &restart_path);
3213 if (ret && ret != -EAGAIN) {
3218 while (ret == -EAGAIN) {
3219 tmp_path = restart_path;
3220 restart_path = NULL;
3222 ret = __ocfs2_rotate_tree_left(handle, et, orig_credits,
3225 if (ret && ret != -EAGAIN) {
3230 ocfs2_free_path(tmp_path);
3238 ocfs2_free_path(tmp_path);
3239 ocfs2_free_path(restart_path);
3243 static void ocfs2_cleanup_merge(struct ocfs2_extent_list *el,
3246 struct ocfs2_extent_rec *rec = &el->l_recs[index];
3249 if (rec->e_leaf_clusters == 0) {
3251 * We consumed all of the merged-from record. An empty
3252 * extent cannot exist anywhere but the 1st array
3253 * position, so move things over if the merged-from
3254 * record doesn't occupy that position.
3256 * This creates a new empty extent so the caller
3257 * should be smart enough to have removed any existing
3261 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
3262 size = index * sizeof(struct ocfs2_extent_rec);
3263 memmove(&el->l_recs[1], &el->l_recs[0], size);
3267 * Always memset - the caller doesn't check whether it
3268 * created an empty extent, so there could be junk in
3271 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3275 static int ocfs2_get_right_path(struct ocfs2_extent_tree *et,
3276 struct ocfs2_path *left_path,
3277 struct ocfs2_path **ret_right_path)
3281 struct ocfs2_path *right_path = NULL;
3282 struct ocfs2_extent_list *left_el;
3284 *ret_right_path = NULL;
3286 /* This function shouldn't be called for non-trees. */
3287 BUG_ON(left_path->p_tree_depth == 0);
3289 left_el = path_leaf_el(left_path);
3290 BUG_ON(left_el->l_next_free_rec != left_el->l_count);
3292 ret = ocfs2_find_cpos_for_right_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3293 left_path, &right_cpos);
3299 /* This function shouldn't be called for the rightmost leaf. */
3300 BUG_ON(right_cpos == 0);
3302 right_path = ocfs2_new_path_from_path(left_path);
3309 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
3315 *ret_right_path = right_path;
3318 ocfs2_free_path(right_path);
3323 * Remove split_rec clusters from the record at index and merge them
3324 * onto the beginning of the record "next" to it.
3325 * For index < l_count - 1, the next means the extent rec at index + 1.
3326 * For index == l_count - 1, the "next" means the 1st extent rec of the
3327 * next extent block.
3329 static int ocfs2_merge_rec_right(struct ocfs2_path *left_path,
3331 struct ocfs2_extent_tree *et,
3332 struct ocfs2_extent_rec *split_rec,
3335 int ret, next_free, i;
3336 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3337 struct ocfs2_extent_rec *left_rec;
3338 struct ocfs2_extent_rec *right_rec;
3339 struct ocfs2_extent_list *right_el;
3340 struct ocfs2_path *right_path = NULL;
3341 int subtree_index = 0;
3342 struct ocfs2_extent_list *el = path_leaf_el(left_path);
3343 struct buffer_head *bh = path_leaf_bh(left_path);
3344 struct buffer_head *root_bh = NULL;
3346 BUG_ON(index >= le16_to_cpu(el->l_next_free_rec));
3347 left_rec = &el->l_recs[index];
3349 if (index == le16_to_cpu(el->l_next_free_rec) - 1 &&
3350 le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count)) {
3351 /* we meet with a cross extent block merge. */
3352 ret = ocfs2_get_right_path(et, left_path, &right_path);
3358 right_el = path_leaf_el(right_path);
3359 next_free = le16_to_cpu(right_el->l_next_free_rec);
3360 BUG_ON(next_free <= 0);
3361 right_rec = &right_el->l_recs[0];
3362 if (ocfs2_is_empty_extent(right_rec)) {
3363 BUG_ON(next_free <= 1);
3364 right_rec = &right_el->l_recs[1];
3367 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3368 le16_to_cpu(left_rec->e_leaf_clusters) !=
3369 le32_to_cpu(right_rec->e_cpos));
3371 subtree_index = ocfs2_find_subtree_root(et, left_path,
3374 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3375 handle->h_buffer_credits,
3382 root_bh = left_path->p_node[subtree_index].bh;
3383 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3385 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3392 for (i = subtree_index + 1;
3393 i < path_num_items(right_path); i++) {
3394 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3401 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3410 BUG_ON(index == le16_to_cpu(el->l_next_free_rec) - 1);
3411 right_rec = &el->l_recs[index + 1];
3414 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, left_path,
3415 path_num_items(left_path) - 1);
3421 le16_add_cpu(&left_rec->e_leaf_clusters, -split_clusters);
3423 le32_add_cpu(&right_rec->e_cpos, -split_clusters);
3424 le64_add_cpu(&right_rec->e_blkno,
3425 -ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3427 le16_add_cpu(&right_rec->e_leaf_clusters, split_clusters);
3429 ocfs2_cleanup_merge(el, index);
3431 ocfs2_journal_dirty(handle, bh);
3433 ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
3434 ocfs2_complete_edge_insert(handle, left_path, right_path,
3438 ocfs2_free_path(right_path);
3442 static int ocfs2_get_left_path(struct ocfs2_extent_tree *et,
3443 struct ocfs2_path *right_path,
3444 struct ocfs2_path **ret_left_path)
3448 struct ocfs2_path *left_path = NULL;
3450 *ret_left_path = NULL;
3452 /* This function shouldn't be called for non-trees. */
3453 BUG_ON(right_path->p_tree_depth == 0);
3455 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3456 right_path, &left_cpos);
3462 /* This function shouldn't be called for the leftmost leaf. */
3463 BUG_ON(left_cpos == 0);
3465 left_path = ocfs2_new_path_from_path(right_path);
3472 ret = ocfs2_find_path(et->et_ci, left_path, left_cpos);
3478 *ret_left_path = left_path;
3481 ocfs2_free_path(left_path);
3486 * Remove split_rec clusters from the record at index and merge them
3487 * onto the tail of the record "before" it.
3488 * For index > 0, the "before" means the extent rec at index - 1.
3490 * For index == 0, the "before" means the last record of the previous
3491 * extent block. And there is also a situation that we may need to
3492 * remove the rightmost leaf extent block in the right_path and change
3493 * the right path to indicate the new rightmost path.
3495 static int ocfs2_merge_rec_left(struct ocfs2_path *right_path,
3497 struct ocfs2_extent_tree *et,
3498 struct ocfs2_extent_rec *split_rec,
3499 struct ocfs2_cached_dealloc_ctxt *dealloc,
3502 int ret, i, subtree_index = 0, has_empty_extent = 0;
3503 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3504 struct ocfs2_extent_rec *left_rec;
3505 struct ocfs2_extent_rec *right_rec;
3506 struct ocfs2_extent_list *el = path_leaf_el(right_path);
3507 struct buffer_head *bh = path_leaf_bh(right_path);
3508 struct buffer_head *root_bh = NULL;
3509 struct ocfs2_path *left_path = NULL;
3510 struct ocfs2_extent_list *left_el;
3514 right_rec = &el->l_recs[index];
3516 /* we meet with a cross extent block merge. */
3517 ret = ocfs2_get_left_path(et, right_path, &left_path);
3523 left_el = path_leaf_el(left_path);
3524 BUG_ON(le16_to_cpu(left_el->l_next_free_rec) !=
3525 le16_to_cpu(left_el->l_count));
3527 left_rec = &left_el->l_recs[
3528 le16_to_cpu(left_el->l_next_free_rec) - 1];
3529 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3530 le16_to_cpu(left_rec->e_leaf_clusters) !=
3531 le32_to_cpu(split_rec->e_cpos));
3533 subtree_index = ocfs2_find_subtree_root(et, left_path,
3536 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3537 handle->h_buffer_credits,
3544 root_bh = left_path->p_node[subtree_index].bh;
3545 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3547 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3554 for (i = subtree_index + 1;
3555 i < path_num_items(right_path); i++) {
3556 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3563 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3571 left_rec = &el->l_recs[index - 1];
3572 if (ocfs2_is_empty_extent(&el->l_recs[0]))
3573 has_empty_extent = 1;
3576 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3577 path_num_items(right_path) - 1);
3583 if (has_empty_extent && index == 1) {
3585 * The easy case - we can just plop the record right in.
3587 *left_rec = *split_rec;
3589 has_empty_extent = 0;
3591 le16_add_cpu(&left_rec->e_leaf_clusters, split_clusters);
3593 le32_add_cpu(&right_rec->e_cpos, split_clusters);
3594 le64_add_cpu(&right_rec->e_blkno,
3595 ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3597 le16_add_cpu(&right_rec->e_leaf_clusters, -split_clusters);
3599 ocfs2_cleanup_merge(el, index);
3601 ocfs2_journal_dirty(handle, bh);
3603 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
3606 * In the situation that the right_rec is empty and the extent
3607 * block is empty also, ocfs2_complete_edge_insert can't handle
3608 * it and we need to delete the right extent block.
3610 if (le16_to_cpu(right_rec->e_leaf_clusters) == 0 &&
3611 le16_to_cpu(el->l_next_free_rec) == 1) {
3612 /* extend credit for ocfs2_remove_rightmost_path */
3613 ret = ocfs2_extend_rotate_transaction(handle, 0,
3614 handle->h_buffer_credits,
3621 ret = ocfs2_remove_rightmost_path(handle, et,
3629 /* Now the rightmost extent block has been deleted.
3630 * So we use the new rightmost path.
3632 ocfs2_mv_path(right_path, left_path);
3635 ocfs2_complete_edge_insert(handle, left_path,
3636 right_path, subtree_index);
3639 ocfs2_free_path(left_path);
3643 static int ocfs2_try_to_merge_extent(handle_t *handle,
3644 struct ocfs2_extent_tree *et,
3645 struct ocfs2_path *path,
3647 struct ocfs2_extent_rec *split_rec,
3648 struct ocfs2_cached_dealloc_ctxt *dealloc,
3649 struct ocfs2_merge_ctxt *ctxt)
3652 struct ocfs2_extent_list *el = path_leaf_el(path);
3653 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
3655 BUG_ON(ctxt->c_contig_type == CONTIG_NONE);
3657 if (ctxt->c_split_covers_rec && ctxt->c_has_empty_extent) {
3658 /* extend credit for ocfs2_remove_rightmost_path */
3659 ret = ocfs2_extend_rotate_transaction(handle, 0,
3660 handle->h_buffer_credits,
3667 * The merge code will need to create an empty
3668 * extent to take the place of the newly
3669 * emptied slot. Remove any pre-existing empty
3670 * extents - having more than one in a leaf is
3673 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3679 rec = &el->l_recs[split_index];
3682 if (ctxt->c_contig_type == CONTIG_LEFTRIGHT) {
3684 * Left-right contig implies this.
3686 BUG_ON(!ctxt->c_split_covers_rec);
3689 * Since the leftright insert always covers the entire
3690 * extent, this call will delete the insert record
3691 * entirely, resulting in an empty extent record added to
3694 * Since the adding of an empty extent shifts
3695 * everything back to the right, there's no need to
3696 * update split_index here.
3698 * When the split_index is zero, we need to merge it to the
3699 * prevoius extent block. It is more efficient and easier
3700 * if we do merge_right first and merge_left later.
3702 ret = ocfs2_merge_rec_right(path, handle, et, split_rec,
3710 * We can only get this from logic error above.
3712 BUG_ON(!ocfs2_is_empty_extent(&el->l_recs[0]));
3714 /* extend credit for ocfs2_remove_rightmost_path */
3715 ret = ocfs2_extend_rotate_transaction(handle, 0,
3716 handle->h_buffer_credits,
3723 /* The merge left us with an empty extent, remove it. */
3724 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3730 rec = &el->l_recs[split_index];
3733 * Note that we don't pass split_rec here on purpose -
3734 * we've merged it into the rec already.
3736 ret = ocfs2_merge_rec_left(path, handle, et, rec,
3737 dealloc, split_index);
3744 /* extend credit for ocfs2_remove_rightmost_path */
3745 ret = ocfs2_extend_rotate_transaction(handle, 0,
3746 handle->h_buffer_credits,
3753 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3755 * Error from this last rotate is not critical, so
3756 * print but don't bubble it up.
3763 * Merge a record to the left or right.
3765 * 'contig_type' is relative to the existing record,
3766 * so for example, if we're "right contig", it's to
3767 * the record on the left (hence the left merge).
3769 if (ctxt->c_contig_type == CONTIG_RIGHT) {
3770 ret = ocfs2_merge_rec_left(path, handle, et,
3778 ret = ocfs2_merge_rec_right(path, handle,
3787 if (ctxt->c_split_covers_rec) {
3788 /* extend credit for ocfs2_remove_rightmost_path */
3789 ret = ocfs2_extend_rotate_transaction(handle, 0,
3790 handle->h_buffer_credits,
3799 * The merge may have left an empty extent in
3800 * our leaf. Try to rotate it away.
3802 ret = ocfs2_rotate_tree_left(handle, et, path,
3814 static void ocfs2_subtract_from_rec(struct super_block *sb,
3815 enum ocfs2_split_type split,
3816 struct ocfs2_extent_rec *rec,
3817 struct ocfs2_extent_rec *split_rec)
3821 len_blocks = ocfs2_clusters_to_blocks(sb,
3822 le16_to_cpu(split_rec->e_leaf_clusters));
3824 if (split == SPLIT_LEFT) {
3826 * Region is on the left edge of the existing
3829 le32_add_cpu(&rec->e_cpos,
3830 le16_to_cpu(split_rec->e_leaf_clusters));
3831 le64_add_cpu(&rec->e_blkno, len_blocks);
3832 le16_add_cpu(&rec->e_leaf_clusters,
3833 -le16_to_cpu(split_rec->e_leaf_clusters));
3836 * Region is on the right edge of the existing
3839 le16_add_cpu(&rec->e_leaf_clusters,
3840 -le16_to_cpu(split_rec->e_leaf_clusters));
3845 * Do the final bits of extent record insertion at the target leaf
3846 * list. If this leaf is part of an allocation tree, it is assumed
3847 * that the tree above has been prepared.
3849 static void ocfs2_insert_at_leaf(struct ocfs2_extent_tree *et,
3850 struct ocfs2_extent_rec *insert_rec,
3851 struct ocfs2_extent_list *el,
3852 struct ocfs2_insert_type *insert)
3854 int i = insert->ins_contig_index;
3856 struct ocfs2_extent_rec *rec;
3858 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
3860 if (insert->ins_split != SPLIT_NONE) {
3861 i = ocfs2_search_extent_list(el, le32_to_cpu(insert_rec->e_cpos));
3863 rec = &el->l_recs[i];
3864 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci),
3865 insert->ins_split, rec,
3871 * Contiguous insert - either left or right.
3873 if (insert->ins_contig != CONTIG_NONE) {
3874 rec = &el->l_recs[i];
3875 if (insert->ins_contig == CONTIG_LEFT) {
3876 rec->e_blkno = insert_rec->e_blkno;
3877 rec->e_cpos = insert_rec->e_cpos;
3879 le16_add_cpu(&rec->e_leaf_clusters,
3880 le16_to_cpu(insert_rec->e_leaf_clusters));
3885 * Handle insert into an empty leaf.
3887 if (le16_to_cpu(el->l_next_free_rec) == 0 ||
3888 ((le16_to_cpu(el->l_next_free_rec) == 1) &&
3889 ocfs2_is_empty_extent(&el->l_recs[0]))) {
3890 el->l_recs[0] = *insert_rec;
3891 el->l_next_free_rec = cpu_to_le16(1);
3898 if (insert->ins_appending == APPEND_TAIL) {
3899 i = le16_to_cpu(el->l_next_free_rec) - 1;
3900 rec = &el->l_recs[i];
3901 range = le32_to_cpu(rec->e_cpos)
3902 + le16_to_cpu(rec->e_leaf_clusters);
3903 BUG_ON(le32_to_cpu(insert_rec->e_cpos) < range);
3905 mlog_bug_on_msg(le16_to_cpu(el->l_next_free_rec) >=
3906 le16_to_cpu(el->l_count),
3907 "owner %llu, depth %u, count %u, next free %u, "
3908 "rec.cpos %u, rec.clusters %u, "
3909 "insert.cpos %u, insert.clusters %u\n",
3910 ocfs2_metadata_cache_owner(et->et_ci),
3911 le16_to_cpu(el->l_tree_depth),
3912 le16_to_cpu(el->l_count),
3913 le16_to_cpu(el->l_next_free_rec),
3914 le32_to_cpu(el->l_recs[i].e_cpos),
3915 le16_to_cpu(el->l_recs[i].e_leaf_clusters),
3916 le32_to_cpu(insert_rec->e_cpos),
3917 le16_to_cpu(insert_rec->e_leaf_clusters));
3919 el->l_recs[i] = *insert_rec;
3920 le16_add_cpu(&el->l_next_free_rec, 1);
3926 * Ok, we have to rotate.
3928 * At this point, it is safe to assume that inserting into an
3929 * empty leaf and appending to a leaf have both been handled
3932 * This leaf needs to have space, either by the empty 1st
3933 * extent record, or by virtue of an l_next_rec < l_count.
3935 ocfs2_rotate_leaf(el, insert_rec);
3938 static void ocfs2_adjust_rightmost_records(handle_t *handle,
3939 struct ocfs2_extent_tree *et,
3940 struct ocfs2_path *path,
3941 struct ocfs2_extent_rec *insert_rec)
3943 int ret, i, next_free;
3944 struct buffer_head *bh;
3945 struct ocfs2_extent_list *el;
3946 struct ocfs2_extent_rec *rec;
3949 * Update everything except the leaf block.
3951 for (i = 0; i < path->p_tree_depth; i++) {
3952 bh = path->p_node[i].bh;
3953 el = path->p_node[i].el;
3955 next_free = le16_to_cpu(el->l_next_free_rec);
3956 if (next_free == 0) {
3957 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
3958 "Owner %llu has a bad extent list\n",
3959 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
3964 rec = &el->l_recs[next_free - 1];
3966 rec->e_int_clusters = insert_rec->e_cpos;
3967 le32_add_cpu(&rec->e_int_clusters,
3968 le16_to_cpu(insert_rec->e_leaf_clusters));
3969 le32_add_cpu(&rec->e_int_clusters,
3970 -le32_to_cpu(rec->e_cpos));
3972 ocfs2_journal_dirty(handle, bh);
3976 static int ocfs2_append_rec_to_path(handle_t *handle,
3977 struct ocfs2_extent_tree *et,
3978 struct ocfs2_extent_rec *insert_rec,
3979 struct ocfs2_path *right_path,
3980 struct ocfs2_path **ret_left_path)
3983 struct ocfs2_extent_list *el;
3984 struct ocfs2_path *left_path = NULL;
3986 *ret_left_path = NULL;
3989 * This shouldn't happen for non-trees. The extent rec cluster
3990 * count manipulation below only works for interior nodes.
3992 BUG_ON(right_path->p_tree_depth == 0);
3995 * If our appending insert is at the leftmost edge of a leaf,
3996 * then we might need to update the rightmost records of the
3999 el = path_leaf_el(right_path);
4000 next_free = le16_to_cpu(el->l_next_free_rec);
4001 if (next_free == 0 ||
4002 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
4005 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
4006 right_path, &left_cpos);
4012 trace_ocfs2_append_rec_to_path(
4013 (unsigned long long)
4014 ocfs2_metadata_cache_owner(et->et_ci),
4015 le32_to_cpu(insert_rec->e_cpos),
4019 * No need to worry if the append is already in the
4023 left_path = ocfs2_new_path_from_path(right_path);
4030 ret = ocfs2_find_path(et->et_ci, left_path,
4038 * ocfs2_insert_path() will pass the left_path to the
4044 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4050 ocfs2_adjust_rightmost_records(handle, et, right_path, insert_rec);
4052 *ret_left_path = left_path;
4056 ocfs2_free_path(left_path);
4061 static void ocfs2_split_record(struct ocfs2_extent_tree *et,
4062 struct ocfs2_path *left_path,
4063 struct ocfs2_path *right_path,
4064 struct ocfs2_extent_rec *split_rec,
4065 enum ocfs2_split_type split)
4068 u32 cpos = le32_to_cpu(split_rec->e_cpos);
4069 struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el;
4070 struct ocfs2_extent_rec *rec, *tmprec;
4072 right_el = path_leaf_el(right_path);
4074 left_el = path_leaf_el(left_path);
4077 insert_el = right_el;
4078 index = ocfs2_search_extent_list(el, cpos);
4080 if (index == 0 && left_path) {
4081 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
4084 * This typically means that the record
4085 * started in the left path but moved to the
4086 * right as a result of rotation. We either
4087 * move the existing record to the left, or we
4088 * do the later insert there.
4090 * In this case, the left path should always
4091 * exist as the rotate code will have passed
4092 * it back for a post-insert update.
4095 if (split == SPLIT_LEFT) {
4097 * It's a left split. Since we know
4098 * that the rotate code gave us an
4099 * empty extent in the left path, we
4100 * can just do the insert there.
4102 insert_el = left_el;
4105 * Right split - we have to move the
4106 * existing record over to the left
4107 * leaf. The insert will be into the
4108 * newly created empty extent in the
4111 tmprec = &right_el->l_recs[index];
4112 ocfs2_rotate_leaf(left_el, tmprec);
4115 memset(tmprec, 0, sizeof(*tmprec));
4116 index = ocfs2_search_extent_list(left_el, cpos);
4117 BUG_ON(index == -1);
4122 BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0]));
4124 * Left path is easy - we can just allow the insert to
4128 insert_el = left_el;
4129 index = ocfs2_search_extent_list(el, cpos);
4130 BUG_ON(index == -1);
4133 rec = &el->l_recs[index];
4134 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci),
4135 split, rec, split_rec);
4136 ocfs2_rotate_leaf(insert_el, split_rec);
4140 * This function only does inserts on an allocation b-tree. For tree
4141 * depth = 0, ocfs2_insert_at_leaf() is called directly.
4143 * right_path is the path we want to do the actual insert
4144 * in. left_path should only be passed in if we need to update that
4145 * portion of the tree after an edge insert.
4147 static int ocfs2_insert_path(handle_t *handle,
4148 struct ocfs2_extent_tree *et,
4149 struct ocfs2_path *left_path,
4150 struct ocfs2_path *right_path,
4151 struct ocfs2_extent_rec *insert_rec,
4152 struct ocfs2_insert_type *insert)
4154 int ret, subtree_index;
4155 struct buffer_head *leaf_bh = path_leaf_bh(right_path);
4159 * There's a chance that left_path got passed back to
4160 * us without being accounted for in the
4161 * journal. Extend our transaction here to be sure we
4162 * can change those blocks.
4164 ret = ocfs2_extend_trans(handle, left_path->p_tree_depth);
4170 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
4178 * Pass both paths to the journal. The majority of inserts
4179 * will be touching all components anyway.
4181 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4187 if (insert->ins_split != SPLIT_NONE) {
4189 * We could call ocfs2_insert_at_leaf() for some types
4190 * of splits, but it's easier to just let one separate
4191 * function sort it all out.
4193 ocfs2_split_record(et, left_path, right_path,
4194 insert_rec, insert->ins_split);
4197 * Split might have modified either leaf and we don't
4198 * have a guarantee that the later edge insert will
4199 * dirty this for us.
4202 ocfs2_journal_dirty(handle,
4203 path_leaf_bh(left_path));
4205 ocfs2_insert_at_leaf(et, insert_rec, path_leaf_el(right_path),
4208 ocfs2_journal_dirty(handle, leaf_bh);
4212 * The rotate code has indicated that we need to fix
4213 * up portions of the tree after the insert.
4215 * XXX: Should we extend the transaction here?
4217 subtree_index = ocfs2_find_subtree_root(et, left_path,
4219 ocfs2_complete_edge_insert(handle, left_path, right_path,
4228 static int ocfs2_do_insert_extent(handle_t *handle,
4229 struct ocfs2_extent_tree *et,
4230 struct ocfs2_extent_rec *insert_rec,
4231 struct ocfs2_insert_type *type)
4233 int ret, rotate = 0;
4235 struct ocfs2_path *right_path = NULL;
4236 struct ocfs2_path *left_path = NULL;
4237 struct ocfs2_extent_list *el;
4239 el = et->et_root_el;
4241 ret = ocfs2_et_root_journal_access(handle, et,
4242 OCFS2_JOURNAL_ACCESS_WRITE);
4248 if (le16_to_cpu(el->l_tree_depth) == 0) {
4249 ocfs2_insert_at_leaf(et, insert_rec, el, type);
4250 goto out_update_clusters;
4253 right_path = ocfs2_new_path_from_et(et);
4261 * Determine the path to start with. Rotations need the
4262 * rightmost path, everything else can go directly to the
4265 cpos = le32_to_cpu(insert_rec->e_cpos);
4266 if (type->ins_appending == APPEND_NONE &&
4267 type->ins_contig == CONTIG_NONE) {
4272 ret = ocfs2_find_path(et->et_ci, right_path, cpos);
4279 * Rotations and appends need special treatment - they modify
4280 * parts of the tree's above them.
4282 * Both might pass back a path immediate to the left of the
4283 * one being inserted to. This will be cause
4284 * ocfs2_insert_path() to modify the rightmost records of
4285 * left_path to account for an edge insert.
4287 * XXX: When modifying this code, keep in mind that an insert
4288 * can wind up skipping both of these two special cases...
4291 ret = ocfs2_rotate_tree_right(handle, et, type->ins_split,
4292 le32_to_cpu(insert_rec->e_cpos),
4293 right_path, &left_path);
4300 * ocfs2_rotate_tree_right() might have extended the
4301 * transaction without re-journaling our tree root.
4303 ret = ocfs2_et_root_journal_access(handle, et,
4304 OCFS2_JOURNAL_ACCESS_WRITE);
4309 } else if (type->ins_appending == APPEND_TAIL
4310 && type->ins_contig != CONTIG_LEFT) {
4311 ret = ocfs2_append_rec_to_path(handle, et, insert_rec,
4312 right_path, &left_path);
4319 ret = ocfs2_insert_path(handle, et, left_path, right_path,
4326 out_update_clusters:
4327 if (type->ins_split == SPLIT_NONE)
4328 ocfs2_et_update_clusters(et,
4329 le16_to_cpu(insert_rec->e_leaf_clusters));
4331 ocfs2_journal_dirty(handle, et->et_root_bh);
4334 ocfs2_free_path(left_path);
4335 ocfs2_free_path(right_path);
4340 static int ocfs2_figure_merge_contig_type(struct ocfs2_extent_tree *et,
4341 struct ocfs2_path *path,
4342 struct ocfs2_extent_list *el, int index,
4343 struct ocfs2_extent_rec *split_rec,
4344 struct ocfs2_merge_ctxt *ctxt)
4347 enum ocfs2_contig_type ret = CONTIG_NONE;
4348 u32 left_cpos, right_cpos;
4349 struct ocfs2_extent_rec *rec = NULL;
4350 struct ocfs2_extent_list *new_el;
4351 struct ocfs2_path *left_path = NULL, *right_path = NULL;
4352 struct buffer_head *bh;
4353 struct ocfs2_extent_block *eb;
4354 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
4357 rec = &el->l_recs[index - 1];
4358 } else if (path->p_tree_depth > 0) {
4359 status = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos);
4363 if (left_cpos != 0) {
4364 left_path = ocfs2_new_path_from_path(path);
4371 status = ocfs2_find_path(et->et_ci, left_path,
4374 goto free_left_path;
4376 new_el = path_leaf_el(left_path);
4378 if (le16_to_cpu(new_el->l_next_free_rec) !=
4379 le16_to_cpu(new_el->l_count)) {
4380 bh = path_leaf_bh(left_path);
4381 eb = (struct ocfs2_extent_block *)bh->b_data;
4383 "Extent block #%llu has an invalid l_next_free_rec of %d. It should have matched the l_count of %d\n",
4384 (unsigned long long)le64_to_cpu(eb->h_blkno),
4385 le16_to_cpu(new_el->l_next_free_rec),
4386 le16_to_cpu(new_el->l_count));
4388 goto free_left_path;
4390 rec = &new_el->l_recs[
4391 le16_to_cpu(new_el->l_next_free_rec) - 1];
4396 * We're careful to check for an empty extent record here -
4397 * the merge code will know what to do if it sees one.
4400 if (index == 1 && ocfs2_is_empty_extent(rec)) {
4401 if (split_rec->e_cpos == el->l_recs[index].e_cpos)
4404 ret = ocfs2_et_extent_contig(et, rec, split_rec);
4409 if (index < (le16_to_cpu(el->l_next_free_rec) - 1))
4410 rec = &el->l_recs[index + 1];
4411 else if (le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count) &&
4412 path->p_tree_depth > 0) {
4413 status = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos);
4415 goto free_left_path;
4417 if (right_cpos == 0)
4418 goto free_left_path;
4420 right_path = ocfs2_new_path_from_path(path);
4424 goto free_left_path;
4427 status = ocfs2_find_path(et->et_ci, right_path, right_cpos);
4429 goto free_right_path;
4431 new_el = path_leaf_el(right_path);
4432 rec = &new_el->l_recs[0];
4433 if (ocfs2_is_empty_extent(rec)) {
4434 if (le16_to_cpu(new_el->l_next_free_rec) <= 1) {
4435 bh = path_leaf_bh(right_path);
4436 eb = (struct ocfs2_extent_block *)bh->b_data;
4438 "Extent block #%llu has an invalid l_next_free_rec of %d\n",
4439 (unsigned long long)le64_to_cpu(eb->h_blkno),
4440 le16_to_cpu(new_el->l_next_free_rec));
4442 goto free_right_path;
4444 rec = &new_el->l_recs[1];
4449 enum ocfs2_contig_type contig_type;
4451 contig_type = ocfs2_et_extent_contig(et, rec, split_rec);
4453 if (contig_type == CONTIG_LEFT && ret == CONTIG_RIGHT)
4454 ret = CONTIG_LEFTRIGHT;
4455 else if (ret == CONTIG_NONE)
4460 ocfs2_free_path(right_path);
4462 ocfs2_free_path(left_path);
4465 ctxt->c_contig_type = ret;
4470 static void ocfs2_figure_contig_type(struct ocfs2_extent_tree *et,
4471 struct ocfs2_insert_type *insert,
4472 struct ocfs2_extent_list *el,
4473 struct ocfs2_extent_rec *insert_rec)
4476 enum ocfs2_contig_type contig_type = CONTIG_NONE;
4478 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4480 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
4481 contig_type = ocfs2_et_extent_contig(et, &el->l_recs[i],
4483 if (contig_type != CONTIG_NONE) {
4484 insert->ins_contig_index = i;
4488 insert->ins_contig = contig_type;
4490 if (insert->ins_contig != CONTIG_NONE) {
4491 struct ocfs2_extent_rec *rec =
4492 &el->l_recs[insert->ins_contig_index];
4493 unsigned int len = le16_to_cpu(rec->e_leaf_clusters) +
4494 le16_to_cpu(insert_rec->e_leaf_clusters);
4497 * Caller might want us to limit the size of extents, don't
4498 * calculate contiguousness if we might exceed that limit.
4500 if (et->et_max_leaf_clusters &&
4501 (len > et->et_max_leaf_clusters))
4502 insert->ins_contig = CONTIG_NONE;
4507 * This should only be called against the righmost leaf extent list.
4509 * ocfs2_figure_appending_type() will figure out whether we'll have to
4510 * insert at the tail of the rightmost leaf.
4512 * This should also work against the root extent list for tree's with 0
4513 * depth. If we consider the root extent list to be the rightmost leaf node
4514 * then the logic here makes sense.
4516 static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert,
4517 struct ocfs2_extent_list *el,
4518 struct ocfs2_extent_rec *insert_rec)
4521 u32 cpos = le32_to_cpu(insert_rec->e_cpos);
4522 struct ocfs2_extent_rec *rec;
4524 insert->ins_appending = APPEND_NONE;
4526 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4528 if (!el->l_next_free_rec)
4529 goto set_tail_append;
4531 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
4532 /* Were all records empty? */
4533 if (le16_to_cpu(el->l_next_free_rec) == 1)
4534 goto set_tail_append;
4537 i = le16_to_cpu(el->l_next_free_rec) - 1;
4538 rec = &el->l_recs[i];
4541 (le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)))
4542 goto set_tail_append;
4547 insert->ins_appending = APPEND_TAIL;
4551 * Helper function called at the beginning of an insert.
4553 * This computes a few things that are commonly used in the process of
4554 * inserting into the btree:
4555 * - Whether the new extent is contiguous with an existing one.
4556 * - The current tree depth.
4557 * - Whether the insert is an appending one.
4558 * - The total # of free records in the tree.
4560 * All of the information is stored on the ocfs2_insert_type
4563 static int ocfs2_figure_insert_type(struct ocfs2_extent_tree *et,
4564 struct buffer_head **last_eb_bh,
4565 struct ocfs2_extent_rec *insert_rec,
4567 struct ocfs2_insert_type *insert)
4570 struct ocfs2_extent_block *eb;
4571 struct ocfs2_extent_list *el;
4572 struct ocfs2_path *path = NULL;
4573 struct buffer_head *bh = NULL;
4575 insert->ins_split = SPLIT_NONE;
4577 el = et->et_root_el;
4578 insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth);
4580 if (el->l_tree_depth) {
4582 * If we have tree depth, we read in the
4583 * rightmost extent block ahead of time as
4584 * ocfs2_figure_insert_type() and ocfs2_add_branch()
4585 * may want it later.
4587 ret = ocfs2_read_extent_block(et->et_ci,
4588 ocfs2_et_get_last_eb_blk(et),
4594 eb = (struct ocfs2_extent_block *) bh->b_data;
4599 * Unless we have a contiguous insert, we'll need to know if
4600 * there is room left in our allocation tree for another
4603 * XXX: This test is simplistic, we can search for empty
4604 * extent records too.
4606 *free_records = le16_to_cpu(el->l_count) -
4607 le16_to_cpu(el->l_next_free_rec);
4609 if (!insert->ins_tree_depth) {
4610 ocfs2_figure_contig_type(et, insert, el, insert_rec);
4611 ocfs2_figure_appending_type(insert, el, insert_rec);
4615 path = ocfs2_new_path_from_et(et);
4623 * In the case that we're inserting past what the tree
4624 * currently accounts for, ocfs2_find_path() will return for
4625 * us the rightmost tree path. This is accounted for below in
4626 * the appending code.
4628 ret = ocfs2_find_path(et->et_ci, path, le32_to_cpu(insert_rec->e_cpos));
4634 el = path_leaf_el(path);
4637 * Now that we have the path, there's two things we want to determine:
4638 * 1) Contiguousness (also set contig_index if this is so)
4640 * 2) Are we doing an append? We can trivially break this up
4641 * into two types of appends: simple record append, or a
4642 * rotate inside the tail leaf.
4644 ocfs2_figure_contig_type(et, insert, el, insert_rec);
4647 * The insert code isn't quite ready to deal with all cases of
4648 * left contiguousness. Specifically, if it's an insert into
4649 * the 1st record in a leaf, it will require the adjustment of
4650 * cluster count on the last record of the path directly to it's
4651 * left. For now, just catch that case and fool the layers
4652 * above us. This works just fine for tree_depth == 0, which
4653 * is why we allow that above.
4655 if (insert->ins_contig == CONTIG_LEFT &&
4656 insert->ins_contig_index == 0)
4657 insert->ins_contig = CONTIG_NONE;
4660 * Ok, so we can simply compare against last_eb to figure out
4661 * whether the path doesn't exist. This will only happen in
4662 * the case that we're doing a tail append, so maybe we can
4663 * take advantage of that information somehow.
4665 if (ocfs2_et_get_last_eb_blk(et) ==
4666 path_leaf_bh(path)->b_blocknr) {
4668 * Ok, ocfs2_find_path() returned us the rightmost
4669 * tree path. This might be an appending insert. There are
4671 * 1) We're doing a true append at the tail:
4672 * -This might even be off the end of the leaf
4673 * 2) We're "appending" by rotating in the tail
4675 ocfs2_figure_appending_type(insert, el, insert_rec);
4679 ocfs2_free_path(path);
4689 * Insert an extent into a btree.
4691 * The caller needs to update the owning btree's cluster count.
4693 int ocfs2_insert_extent(handle_t *handle,
4694 struct ocfs2_extent_tree *et,
4699 struct ocfs2_alloc_context *meta_ac)
4702 int uninitialized_var(free_records);
4703 struct buffer_head *last_eb_bh = NULL;
4704 struct ocfs2_insert_type insert = {0, };
4705 struct ocfs2_extent_rec rec;
4707 trace_ocfs2_insert_extent_start(
4708 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
4709 cpos, new_clusters);
4711 memset(&rec, 0, sizeof(rec));
4712 rec.e_cpos = cpu_to_le32(cpos);
4713 rec.e_blkno = cpu_to_le64(start_blk);
4714 rec.e_leaf_clusters = cpu_to_le16(new_clusters);
4715 rec.e_flags = flags;
4716 status = ocfs2_et_insert_check(et, &rec);
4722 status = ocfs2_figure_insert_type(et, &last_eb_bh, &rec,
4723 &free_records, &insert);
4729 trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig,
4730 insert.ins_contig_index, free_records,
4731 insert.ins_tree_depth);
4733 if (insert.ins_contig == CONTIG_NONE && free_records == 0) {
4734 status = ocfs2_grow_tree(handle, et,
4735 &insert.ins_tree_depth, &last_eb_bh,
4743 /* Finally, we can add clusters. This might rotate the tree for us. */
4744 status = ocfs2_do_insert_extent(handle, et, &rec, &insert);
4748 ocfs2_et_extent_map_insert(et, &rec);
4757 * Allcate and add clusters into the extent b-tree.
4758 * The new clusters(clusters_to_add) will be inserted at logical_offset.
4759 * The extent b-tree's root is specified by et, and
4760 * it is not limited to the file storage. Any extent tree can use this
4761 * function if it implements the proper ocfs2_extent_tree.
4763 int ocfs2_add_clusters_in_btree(handle_t *handle,
4764 struct ocfs2_extent_tree *et,
4765 u32 *logical_offset,
4766 u32 clusters_to_add,
4768 struct ocfs2_alloc_context *data_ac,
4769 struct ocfs2_alloc_context *meta_ac,
4770 enum ocfs2_alloc_restarted *reason_ret)
4772 int status = 0, err = 0;
4775 enum ocfs2_alloc_restarted reason = RESTART_NONE;
4776 u32 bit_off, num_bits;
4779 struct ocfs2_super *osb =
4780 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
4782 BUG_ON(!clusters_to_add);
4785 flags = OCFS2_EXT_UNWRITTEN;
4787 free_extents = ocfs2_num_free_extents(et);
4788 if (free_extents < 0) {
4789 status = free_extents;
4794 /* there are two cases which could cause us to EAGAIN in the
4795 * we-need-more-metadata case:
4796 * 1) we haven't reserved *any*
4797 * 2) we are so fragmented, we've needed to add metadata too
4799 if (!free_extents && !meta_ac) {
4802 reason = RESTART_META;
4804 } else if ((!free_extents)
4805 && (ocfs2_alloc_context_bits_left(meta_ac)
4806 < ocfs2_extend_meta_needed(et->et_root_el))) {
4809 reason = RESTART_META;
4813 status = __ocfs2_claim_clusters(handle, data_ac, 1,
4814 clusters_to_add, &bit_off, &num_bits);
4816 if (status != -ENOSPC)
4821 BUG_ON(num_bits > clusters_to_add);
4823 /* reserve our write early -- insert_extent may update the tree root */
4824 status = ocfs2_et_root_journal_access(handle, et,
4825 OCFS2_JOURNAL_ACCESS_WRITE);
4832 block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
4833 trace_ocfs2_add_clusters_in_btree(
4834 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
4836 status = ocfs2_insert_extent(handle, et, *logical_offset, block,
4837 num_bits, flags, meta_ac);
4844 ocfs2_journal_dirty(handle, et->et_root_bh);
4846 clusters_to_add -= num_bits;
4847 *logical_offset += num_bits;
4849 if (clusters_to_add) {
4850 err = clusters_to_add;
4852 reason = RESTART_TRANS;
4857 if (data_ac->ac_which == OCFS2_AC_USE_LOCAL)
4858 ocfs2_free_local_alloc_bits(osb, handle, data_ac,
4861 ocfs2_free_clusters(handle,
4864 ocfs2_clusters_to_blocks(osb->sb, bit_off),
4870 *reason_ret = reason;
4871 trace_ocfs2_add_clusters_in_btree_ret(status, reason, err);
4875 static void ocfs2_make_right_split_rec(struct super_block *sb,
4876 struct ocfs2_extent_rec *split_rec,
4878 struct ocfs2_extent_rec *rec)
4880 u32 rec_cpos = le32_to_cpu(rec->e_cpos);
4881 u32 rec_range = rec_cpos + le16_to_cpu(rec->e_leaf_clusters);
4883 memset(split_rec, 0, sizeof(struct ocfs2_extent_rec));
4885 split_rec->e_cpos = cpu_to_le32(cpos);
4886 split_rec->e_leaf_clusters = cpu_to_le16(rec_range - cpos);
4888 split_rec->e_blkno = rec->e_blkno;
4889 le64_add_cpu(&split_rec->e_blkno,
4890 ocfs2_clusters_to_blocks(sb, cpos - rec_cpos));
4892 split_rec->e_flags = rec->e_flags;
4895 static int ocfs2_split_and_insert(handle_t *handle,
4896 struct ocfs2_extent_tree *et,
4897 struct ocfs2_path *path,
4898 struct buffer_head **last_eb_bh,
4900 struct ocfs2_extent_rec *orig_split_rec,
4901 struct ocfs2_alloc_context *meta_ac)
4904 unsigned int insert_range, rec_range, do_leftright = 0;
4905 struct ocfs2_extent_rec tmprec;
4906 struct ocfs2_extent_list *rightmost_el;
4907 struct ocfs2_extent_rec rec;
4908 struct ocfs2_extent_rec split_rec = *orig_split_rec;
4909 struct ocfs2_insert_type insert;
4910 struct ocfs2_extent_block *eb;
4914 * Store a copy of the record on the stack - it might move
4915 * around as the tree is manipulated below.
4917 rec = path_leaf_el(path)->l_recs[split_index];
4919 rightmost_el = et->et_root_el;
4921 depth = le16_to_cpu(rightmost_el->l_tree_depth);
4923 BUG_ON(!(*last_eb_bh));
4924 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
4925 rightmost_el = &eb->h_list;
4928 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
4929 le16_to_cpu(rightmost_el->l_count)) {
4930 ret = ocfs2_grow_tree(handle, et,
4931 &depth, last_eb_bh, meta_ac);
4938 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
4939 insert.ins_appending = APPEND_NONE;
4940 insert.ins_contig = CONTIG_NONE;
4941 insert.ins_tree_depth = depth;
4943 insert_range = le32_to_cpu(split_rec.e_cpos) +
4944 le16_to_cpu(split_rec.e_leaf_clusters);
4945 rec_range = le32_to_cpu(rec.e_cpos) +
4946 le16_to_cpu(rec.e_leaf_clusters);
4948 if (split_rec.e_cpos == rec.e_cpos) {
4949 insert.ins_split = SPLIT_LEFT;
4950 } else if (insert_range == rec_range) {
4951 insert.ins_split = SPLIT_RIGHT;
4954 * Left/right split. We fake this as a right split
4955 * first and then make a second pass as a left split.
4957 insert.ins_split = SPLIT_RIGHT;
4959 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci),
4960 &tmprec, insert_range, &rec);
4964 BUG_ON(do_leftright);
4968 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
4974 if (do_leftright == 1) {
4976 struct ocfs2_extent_list *el;
4979 split_rec = *orig_split_rec;
4981 ocfs2_reinit_path(path, 1);
4983 cpos = le32_to_cpu(split_rec.e_cpos);
4984 ret = ocfs2_find_path(et->et_ci, path, cpos);
4990 el = path_leaf_el(path);
4991 split_index = ocfs2_search_extent_list(el, cpos);
4992 if (split_index == -1) {
4993 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
4994 "Owner %llu has an extent at cpos %u which can no longer be found\n",
4995 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5007 static int ocfs2_replace_extent_rec(handle_t *handle,
5008 struct ocfs2_extent_tree *et,
5009 struct ocfs2_path *path,
5010 struct ocfs2_extent_list *el,
5012 struct ocfs2_extent_rec *split_rec)
5016 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path,
5017 path_num_items(path) - 1);
5023 el->l_recs[split_index] = *split_rec;
5025 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5031 * Split part or all of the extent record at split_index in the leaf
5032 * pointed to by path. Merge with the contiguous extent record if needed.
5034 * Care is taken to handle contiguousness so as to not grow the tree.
5036 * meta_ac is not strictly necessary - we only truly need it if growth
5037 * of the tree is required. All other cases will degrade into a less
5038 * optimal tree layout.
5040 * last_eb_bh should be the rightmost leaf block for any extent
5041 * btree. Since a split may grow the tree or a merge might shrink it,
5042 * the caller cannot trust the contents of that buffer after this call.
5044 * This code is optimized for readability - several passes might be
5045 * made over certain portions of the tree. All of those blocks will
5046 * have been brought into cache (and pinned via the journal), so the
5047 * extra overhead is not expressed in terms of disk reads.
5049 int ocfs2_split_extent(handle_t *handle,
5050 struct ocfs2_extent_tree *et,
5051 struct ocfs2_path *path,
5053 struct ocfs2_extent_rec *split_rec,
5054 struct ocfs2_alloc_context *meta_ac,
5055 struct ocfs2_cached_dealloc_ctxt *dealloc)
5058 struct ocfs2_extent_list *el = path_leaf_el(path);
5059 struct buffer_head *last_eb_bh = NULL;
5060 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
5061 struct ocfs2_merge_ctxt ctxt;
5062 struct ocfs2_extent_list *rightmost_el;
5064 if (le32_to_cpu(rec->e_cpos) > le32_to_cpu(split_rec->e_cpos) ||
5065 ((le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)) <
5066 (le32_to_cpu(split_rec->e_cpos) + le16_to_cpu(split_rec->e_leaf_clusters)))) {
5072 ret = ocfs2_figure_merge_contig_type(et, path, el,
5082 * The core merge / split code wants to know how much room is
5083 * left in this allocation tree, so we pass the
5084 * rightmost extent list.
5086 if (path->p_tree_depth) {
5087 struct ocfs2_extent_block *eb;
5089 ret = ocfs2_read_extent_block(et->et_ci,
5090 ocfs2_et_get_last_eb_blk(et),
5097 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5098 rightmost_el = &eb->h_list;
5100 rightmost_el = path_root_el(path);
5102 if (rec->e_cpos == split_rec->e_cpos &&
5103 rec->e_leaf_clusters == split_rec->e_leaf_clusters)
5104 ctxt.c_split_covers_rec = 1;
5106 ctxt.c_split_covers_rec = 0;
5108 ctxt.c_has_empty_extent = ocfs2_is_empty_extent(&el->l_recs[0]);
5110 trace_ocfs2_split_extent(split_index, ctxt.c_contig_type,
5111 ctxt.c_has_empty_extent,
5112 ctxt.c_split_covers_rec);
5114 if (ctxt.c_contig_type == CONTIG_NONE) {
5115 if (ctxt.c_split_covers_rec)
5116 ret = ocfs2_replace_extent_rec(handle, et, path, el,
5117 split_index, split_rec);
5119 ret = ocfs2_split_and_insert(handle, et, path,
5120 &last_eb_bh, split_index,
5121 split_rec, meta_ac);
5125 ret = ocfs2_try_to_merge_extent(handle, et, path,
5126 split_index, split_rec,
5138 * Change the flags of the already-existing extent at cpos for len clusters.
5140 * new_flags: the flags we want to set.
5141 * clear_flags: the flags we want to clear.
5142 * phys: the new physical offset we want this new extent starts from.
5144 * If the existing extent is larger than the request, initiate a
5145 * split. An attempt will be made at merging with adjacent extents.
5147 * The caller is responsible for passing down meta_ac if we'll need it.
5149 int ocfs2_change_extent_flag(handle_t *handle,
5150 struct ocfs2_extent_tree *et,
5151 u32 cpos, u32 len, u32 phys,
5152 struct ocfs2_alloc_context *meta_ac,
5153 struct ocfs2_cached_dealloc_ctxt *dealloc,
5154 int new_flags, int clear_flags)
5157 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
5158 u64 start_blkno = ocfs2_clusters_to_blocks(sb, phys);
5159 struct ocfs2_extent_rec split_rec;
5160 struct ocfs2_path *left_path = NULL;
5161 struct ocfs2_extent_list *el;
5162 struct ocfs2_extent_rec *rec;
5164 left_path = ocfs2_new_path_from_et(et);
5171 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
5176 el = path_leaf_el(left_path);
5178 index = ocfs2_search_extent_list(el, cpos);
5181 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5182 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5189 rec = &el->l_recs[index];
5190 if (new_flags && (rec->e_flags & new_flags)) {
5191 mlog(ML_ERROR, "Owner %llu tried to set %d flags on an "
5192 "extent that already had them\n",
5193 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5198 if (clear_flags && !(rec->e_flags & clear_flags)) {
5199 mlog(ML_ERROR, "Owner %llu tried to clear %d flags on an "
5200 "extent that didn't have them\n",
5201 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5206 memset(&split_rec, 0, sizeof(struct ocfs2_extent_rec));
5207 split_rec.e_cpos = cpu_to_le32(cpos);
5208 split_rec.e_leaf_clusters = cpu_to_le16(len);
5209 split_rec.e_blkno = cpu_to_le64(start_blkno);
5210 split_rec.e_flags = rec->e_flags;
5212 split_rec.e_flags |= new_flags;
5214 split_rec.e_flags &= ~clear_flags;
5216 ret = ocfs2_split_extent(handle, et, left_path,
5217 index, &split_rec, meta_ac,
5223 ocfs2_free_path(left_path);
5229 * Mark the already-existing extent at cpos as written for len clusters.
5230 * This removes the unwritten extent flag.
5232 * If the existing extent is larger than the request, initiate a
5233 * split. An attempt will be made at merging with adjacent extents.
5235 * The caller is responsible for passing down meta_ac if we'll need it.
5237 int ocfs2_mark_extent_written(struct inode *inode,
5238 struct ocfs2_extent_tree *et,
5239 handle_t *handle, u32 cpos, u32 len, u32 phys,
5240 struct ocfs2_alloc_context *meta_ac,
5241 struct ocfs2_cached_dealloc_ctxt *dealloc)
5245 trace_ocfs2_mark_extent_written(
5246 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5249 if (!ocfs2_writes_unwritten_extents(OCFS2_SB(inode->i_sb))) {
5250 ocfs2_error(inode->i_sb, "Inode %llu has unwritten extents that are being written to, but the feature bit is not set in the super block\n",
5251 (unsigned long long)OCFS2_I(inode)->ip_blkno);
5257 * XXX: This should be fixed up so that we just re-insert the
5258 * next extent records.
5260 ocfs2_et_extent_map_truncate(et, 0);
5262 ret = ocfs2_change_extent_flag(handle, et, cpos,
5263 len, phys, meta_ac, dealloc,
5264 0, OCFS2_EXT_UNWRITTEN);
5272 static int ocfs2_split_tree(handle_t *handle, struct ocfs2_extent_tree *et,
5273 struct ocfs2_path *path,
5274 int index, u32 new_range,
5275 struct ocfs2_alloc_context *meta_ac)
5277 int ret, depth, credits;
5278 struct buffer_head *last_eb_bh = NULL;
5279 struct ocfs2_extent_block *eb;
5280 struct ocfs2_extent_list *rightmost_el, *el;
5281 struct ocfs2_extent_rec split_rec;
5282 struct ocfs2_extent_rec *rec;
5283 struct ocfs2_insert_type insert;
5286 * Setup the record to split before we grow the tree.
5288 el = path_leaf_el(path);
5289 rec = &el->l_recs[index];
5290 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci),
5291 &split_rec, new_range, rec);
5293 depth = path->p_tree_depth;
5295 ret = ocfs2_read_extent_block(et->et_ci,
5296 ocfs2_et_get_last_eb_blk(et),
5303 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5304 rightmost_el = &eb->h_list;
5306 rightmost_el = path_leaf_el(path);
5308 credits = path->p_tree_depth +
5309 ocfs2_extend_meta_needed(et->et_root_el);
5310 ret = ocfs2_extend_trans(handle, credits);
5316 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
5317 le16_to_cpu(rightmost_el->l_count)) {
5318 ret = ocfs2_grow_tree(handle, et, &depth, &last_eb_bh,
5326 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
5327 insert.ins_appending = APPEND_NONE;
5328 insert.ins_contig = CONTIG_NONE;
5329 insert.ins_split = SPLIT_RIGHT;
5330 insert.ins_tree_depth = depth;
5332 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
5341 static int ocfs2_truncate_rec(handle_t *handle,
5342 struct ocfs2_extent_tree *et,
5343 struct ocfs2_path *path, int index,
5344 struct ocfs2_cached_dealloc_ctxt *dealloc,
5348 u32 left_cpos, rec_range, trunc_range;
5349 int is_rightmost_tree_rec = 0;
5350 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
5351 struct ocfs2_path *left_path = NULL;
5352 struct ocfs2_extent_list *el = path_leaf_el(path);
5353 struct ocfs2_extent_rec *rec;
5354 struct ocfs2_extent_block *eb;
5356 if (ocfs2_is_empty_extent(&el->l_recs[0]) && index > 0) {
5357 /* extend credit for ocfs2_remove_rightmost_path */
5358 ret = ocfs2_extend_rotate_transaction(handle, 0,
5359 handle->h_buffer_credits,
5366 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
5375 if (index == (le16_to_cpu(el->l_next_free_rec) - 1) &&
5376 path->p_tree_depth) {
5378 * Check whether this is the rightmost tree record. If
5379 * we remove all of this record or part of its right
5380 * edge then an update of the record lengths above it
5383 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
5384 if (eb->h_next_leaf_blk == 0)
5385 is_rightmost_tree_rec = 1;
5388 rec = &el->l_recs[index];
5389 if (index == 0 && path->p_tree_depth &&
5390 le32_to_cpu(rec->e_cpos) == cpos) {
5392 * Changing the leftmost offset (via partial or whole
5393 * record truncate) of an interior (or rightmost) path
5394 * means we have to update the subtree that is formed
5395 * by this leaf and the one to it's left.
5397 * There are two cases we can skip:
5398 * 1) Path is the leftmost one in our btree.
5399 * 2) The leaf is rightmost and will be empty after
5400 * we remove the extent record - the rotate code
5401 * knows how to update the newly formed edge.
5404 ret = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos);
5410 if (left_cpos && le16_to_cpu(el->l_next_free_rec) > 1) {
5411 left_path = ocfs2_new_path_from_path(path);
5418 ret = ocfs2_find_path(et->et_ci, left_path,
5427 ret = ocfs2_extend_rotate_transaction(handle, 0,
5428 handle->h_buffer_credits,
5435 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
5441 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
5447 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5448 trunc_range = cpos + len;
5450 if (le32_to_cpu(rec->e_cpos) == cpos && rec_range == trunc_range) {
5453 memset(rec, 0, sizeof(*rec));
5454 ocfs2_cleanup_merge(el, index);
5456 next_free = le16_to_cpu(el->l_next_free_rec);
5457 if (is_rightmost_tree_rec && next_free > 1) {
5459 * We skip the edge update if this path will
5460 * be deleted by the rotate code.
5462 rec = &el->l_recs[next_free - 1];
5463 ocfs2_adjust_rightmost_records(handle, et, path,
5466 } else if (le32_to_cpu(rec->e_cpos) == cpos) {
5467 /* Remove leftmost portion of the record. */
5468 le32_add_cpu(&rec->e_cpos, len);
5469 le64_add_cpu(&rec->e_blkno, ocfs2_clusters_to_blocks(sb, len));
5470 le16_add_cpu(&rec->e_leaf_clusters, -len);
5471 } else if (rec_range == trunc_range) {
5472 /* Remove rightmost portion of the record */
5473 le16_add_cpu(&rec->e_leaf_clusters, -len);
5474 if (is_rightmost_tree_rec)
5475 ocfs2_adjust_rightmost_records(handle, et, path, rec);
5477 /* Caller should have trapped this. */
5478 mlog(ML_ERROR, "Owner %llu: Invalid record truncate: (%u, %u) "
5480 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5481 le32_to_cpu(rec->e_cpos),
5482 le16_to_cpu(rec->e_leaf_clusters), cpos, len);
5489 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
5490 ocfs2_complete_edge_insert(handle, left_path, path,
5494 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5496 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
5503 ocfs2_free_path(left_path);
5507 int ocfs2_remove_extent(handle_t *handle,
5508 struct ocfs2_extent_tree *et,
5510 struct ocfs2_alloc_context *meta_ac,
5511 struct ocfs2_cached_dealloc_ctxt *dealloc)
5514 u32 rec_range, trunc_range;
5515 struct ocfs2_extent_rec *rec;
5516 struct ocfs2_extent_list *el;
5517 struct ocfs2_path *path = NULL;
5520 * XXX: Why are we truncating to 0 instead of wherever this
5523 ocfs2_et_extent_map_truncate(et, 0);
5525 path = ocfs2_new_path_from_et(et);
5532 ret = ocfs2_find_path(et->et_ci, path, cpos);
5538 el = path_leaf_el(path);
5539 index = ocfs2_search_extent_list(el, cpos);
5541 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5542 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5543 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5550 * We have 3 cases of extent removal:
5551 * 1) Range covers the entire extent rec
5552 * 2) Range begins or ends on one edge of the extent rec
5553 * 3) Range is in the middle of the extent rec (no shared edges)
5555 * For case 1 we remove the extent rec and left rotate to
5558 * For case 2 we just shrink the existing extent rec, with a
5559 * tree update if the shrinking edge is also the edge of an
5562 * For case 3 we do a right split to turn the extent rec into
5563 * something case 2 can handle.
5565 rec = &el->l_recs[index];
5566 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5567 trunc_range = cpos + len;
5569 BUG_ON(cpos < le32_to_cpu(rec->e_cpos) || trunc_range > rec_range);
5571 trace_ocfs2_remove_extent(
5572 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5573 cpos, len, index, le32_to_cpu(rec->e_cpos),
5574 ocfs2_rec_clusters(el, rec));
5576 if (le32_to_cpu(rec->e_cpos) == cpos || rec_range == trunc_range) {
5577 ret = ocfs2_truncate_rec(handle, et, path, index, dealloc,
5584 ret = ocfs2_split_tree(handle, et, path, index,
5585 trunc_range, meta_ac);
5592 * The split could have manipulated the tree enough to
5593 * move the record location, so we have to look for it again.
5595 ocfs2_reinit_path(path, 1);
5597 ret = ocfs2_find_path(et->et_ci, path, cpos);
5603 el = path_leaf_el(path);
5604 index = ocfs2_search_extent_list(el, cpos);
5606 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5607 "Owner %llu: split at cpos %u lost record\n",
5608 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5615 * Double check our values here. If anything is fishy,
5616 * it's easier to catch it at the top level.
5618 rec = &el->l_recs[index];
5619 rec_range = le32_to_cpu(rec->e_cpos) +
5620 ocfs2_rec_clusters(el, rec);
5621 if (rec_range != trunc_range) {
5622 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5623 "Owner %llu: error after split at cpos %u trunc len %u, existing record is (%u,%u)\n",
5624 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5625 cpos, len, le32_to_cpu(rec->e_cpos),
5626 ocfs2_rec_clusters(el, rec));
5631 ret = ocfs2_truncate_rec(handle, et, path, index, dealloc,
5640 ocfs2_free_path(path);
5645 * ocfs2_reserve_blocks_for_rec_trunc() would look basically the
5646 * same as ocfs2_lock_alloctors(), except for it accepts a blocks
5647 * number to reserve some extra blocks, and it only handles meta
5650 * Currently, only ocfs2_remove_btree_range() uses it for truncating
5651 * and punching holes.
5653 static int ocfs2_reserve_blocks_for_rec_trunc(struct inode *inode,
5654 struct ocfs2_extent_tree *et,
5655 u32 extents_to_split,
5656 struct ocfs2_alloc_context **ac,
5659 int ret = 0, num_free_extents;
5660 unsigned int max_recs_needed = 2 * extents_to_split;
5661 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5665 num_free_extents = ocfs2_num_free_extents(et);
5666 if (num_free_extents < 0) {
5667 ret = num_free_extents;
5672 if (!num_free_extents ||
5673 (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed))
5674 extra_blocks += ocfs2_extend_meta_needed(et->et_root_el);
5677 ret = ocfs2_reserve_new_metadata_blocks(osb, extra_blocks, ac);
5688 ocfs2_free_alloc_context(*ac);
5696 int ocfs2_remove_btree_range(struct inode *inode,
5697 struct ocfs2_extent_tree *et,
5698 u32 cpos, u32 phys_cpos, u32 len, int flags,
5699 struct ocfs2_cached_dealloc_ctxt *dealloc,
5700 u64 refcount_loc, bool refcount_tree_locked)
5702 int ret, credits = 0, extra_blocks = 0;
5703 u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
5704 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5705 struct inode *tl_inode = osb->osb_tl_inode;
5707 struct ocfs2_alloc_context *meta_ac = NULL;
5708 struct ocfs2_refcount_tree *ref_tree = NULL;
5710 if ((flags & OCFS2_EXT_REFCOUNTED) && len) {
5711 BUG_ON(!ocfs2_is_refcount_inode(inode));
5713 if (!refcount_tree_locked) {
5714 ret = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
5722 ret = ocfs2_prepare_refcount_change_for_del(inode,
5734 ret = ocfs2_reserve_blocks_for_rec_trunc(inode, et, 1, &meta_ac,
5741 inode_lock(tl_inode);
5743 if (ocfs2_truncate_log_needs_flush(osb)) {
5744 ret = __ocfs2_flush_truncate_log(osb);
5751 handle = ocfs2_start_trans(osb,
5752 ocfs2_remove_extent_credits(osb->sb) + credits);
5753 if (IS_ERR(handle)) {
5754 ret = PTR_ERR(handle);
5759 ret = ocfs2_et_root_journal_access(handle, et,
5760 OCFS2_JOURNAL_ACCESS_WRITE);
5766 dquot_free_space_nodirty(inode,
5767 ocfs2_clusters_to_bytes(inode->i_sb, len));
5769 ret = ocfs2_remove_extent(handle, et, cpos, len, meta_ac, dealloc);
5775 ocfs2_et_update_clusters(et, -len);
5776 ocfs2_update_inode_fsync_trans(handle, inode, 1);
5778 ocfs2_journal_dirty(handle, et->et_root_bh);
5781 if (flags & OCFS2_EXT_REFCOUNTED)
5782 ret = ocfs2_decrease_refcount(inode, handle,
5783 ocfs2_blocks_to_clusters(osb->sb,
5788 ret = ocfs2_truncate_log_append(osb, handle,
5796 ocfs2_commit_trans(osb, handle);
5798 inode_unlock(tl_inode);
5801 ocfs2_free_alloc_context(meta_ac);
5804 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
5809 int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb)
5811 struct buffer_head *tl_bh = osb->osb_tl_bh;
5812 struct ocfs2_dinode *di;
5813 struct ocfs2_truncate_log *tl;
5815 di = (struct ocfs2_dinode *) tl_bh->b_data;
5816 tl = &di->id2.i_dealloc;
5818 mlog_bug_on_msg(le16_to_cpu(tl->tl_used) > le16_to_cpu(tl->tl_count),
5819 "slot %d, invalid truncate log parameters: used = "
5820 "%u, count = %u\n", osb->slot_num,
5821 le16_to_cpu(tl->tl_used), le16_to_cpu(tl->tl_count));
5822 return le16_to_cpu(tl->tl_used) == le16_to_cpu(tl->tl_count);
5825 static int ocfs2_truncate_log_can_coalesce(struct ocfs2_truncate_log *tl,
5826 unsigned int new_start)
5828 unsigned int tail_index;
5829 unsigned int current_tail;
5831 /* No records, nothing to coalesce */
5832 if (!le16_to_cpu(tl->tl_used))
5835 tail_index = le16_to_cpu(tl->tl_used) - 1;
5836 current_tail = le32_to_cpu(tl->tl_recs[tail_index].t_start);
5837 current_tail += le32_to_cpu(tl->tl_recs[tail_index].t_clusters);
5839 return current_tail == new_start;
5842 int ocfs2_truncate_log_append(struct ocfs2_super *osb,
5845 unsigned int num_clusters)
5848 unsigned int start_cluster, tl_count;
5849 struct inode *tl_inode = osb->osb_tl_inode;
5850 struct buffer_head *tl_bh = osb->osb_tl_bh;
5851 struct ocfs2_dinode *di;
5852 struct ocfs2_truncate_log *tl;
5854 BUG_ON(inode_trylock(tl_inode));
5856 start_cluster = ocfs2_blocks_to_clusters(osb->sb, start_blk);
5858 di = (struct ocfs2_dinode *) tl_bh->b_data;
5860 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5861 * by the underlying call to ocfs2_read_inode_block(), so any
5862 * corruption is a code bug */
5863 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
5865 tl = &di->id2.i_dealloc;
5866 tl_count = le16_to_cpu(tl->tl_count);
5867 mlog_bug_on_msg(tl_count > ocfs2_truncate_recs_per_inode(osb->sb) ||
5869 "Truncate record count on #%llu invalid "
5870 "wanted %u, actual %u\n",
5871 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5872 ocfs2_truncate_recs_per_inode(osb->sb),
5873 le16_to_cpu(tl->tl_count));
5875 /* Caller should have known to flush before calling us. */
5876 index = le16_to_cpu(tl->tl_used);
5877 if (index >= tl_count) {
5883 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5884 OCFS2_JOURNAL_ACCESS_WRITE);
5890 trace_ocfs2_truncate_log_append(
5891 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, index,
5892 start_cluster, num_clusters);
5893 if (ocfs2_truncate_log_can_coalesce(tl, start_cluster)) {
5895 * Move index back to the record we are coalescing with.
5896 * ocfs2_truncate_log_can_coalesce() guarantees nonzero
5900 num_clusters += le32_to_cpu(tl->tl_recs[index].t_clusters);
5901 trace_ocfs2_truncate_log_append(
5902 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5903 index, le32_to_cpu(tl->tl_recs[index].t_start),
5906 tl->tl_recs[index].t_start = cpu_to_le32(start_cluster);
5907 tl->tl_used = cpu_to_le16(index + 1);
5909 tl->tl_recs[index].t_clusters = cpu_to_le32(num_clusters);
5911 ocfs2_journal_dirty(handle, tl_bh);
5913 osb->truncated_clusters += num_clusters;
5918 static int ocfs2_replay_truncate_records(struct ocfs2_super *osb,
5919 struct inode *data_alloc_inode,
5920 struct buffer_head *data_alloc_bh)
5924 unsigned int num_clusters;
5926 struct ocfs2_truncate_rec rec;
5927 struct ocfs2_dinode *di;
5928 struct ocfs2_truncate_log *tl;
5929 struct inode *tl_inode = osb->osb_tl_inode;
5930 struct buffer_head *tl_bh = osb->osb_tl_bh;
5933 di = (struct ocfs2_dinode *) tl_bh->b_data;
5934 tl = &di->id2.i_dealloc;
5935 i = le16_to_cpu(tl->tl_used) - 1;
5937 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC);
5938 if (IS_ERR(handle)) {
5939 status = PTR_ERR(handle);
5944 /* Caller has given us at least enough credits to
5945 * update the truncate log dinode */
5946 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5947 OCFS2_JOURNAL_ACCESS_WRITE);
5953 tl->tl_used = cpu_to_le16(i);
5955 ocfs2_journal_dirty(handle, tl_bh);
5957 rec = tl->tl_recs[i];
5958 start_blk = ocfs2_clusters_to_blocks(data_alloc_inode->i_sb,
5959 le32_to_cpu(rec.t_start));
5960 num_clusters = le32_to_cpu(rec.t_clusters);
5962 /* if start_blk is not set, we ignore the record as
5965 trace_ocfs2_replay_truncate_records(
5966 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5967 i, le32_to_cpu(rec.t_start), num_clusters);
5969 status = ocfs2_free_clusters(handle, data_alloc_inode,
5970 data_alloc_bh, start_blk,
5978 ocfs2_commit_trans(osb, handle);
5982 osb->truncated_clusters = 0;
5988 /* Expects you to already be holding tl_inode->i_mutex */
5989 int __ocfs2_flush_truncate_log(struct ocfs2_super *osb)
5992 unsigned int num_to_flush;
5993 struct inode *tl_inode = osb->osb_tl_inode;
5994 struct inode *data_alloc_inode = NULL;
5995 struct buffer_head *tl_bh = osb->osb_tl_bh;
5996 struct buffer_head *data_alloc_bh = NULL;
5997 struct ocfs2_dinode *di;
5998 struct ocfs2_truncate_log *tl;
6000 BUG_ON(inode_trylock(tl_inode));
6002 di = (struct ocfs2_dinode *) tl_bh->b_data;
6004 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
6005 * by the underlying call to ocfs2_read_inode_block(), so any
6006 * corruption is a code bug */
6007 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
6009 tl = &di->id2.i_dealloc;
6010 num_to_flush = le16_to_cpu(tl->tl_used);
6011 trace_ocfs2_flush_truncate_log(
6012 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
6014 if (!num_to_flush) {
6019 data_alloc_inode = ocfs2_get_system_file_inode(osb,
6020 GLOBAL_BITMAP_SYSTEM_INODE,
6021 OCFS2_INVALID_SLOT);
6022 if (!data_alloc_inode) {
6024 mlog(ML_ERROR, "Could not get bitmap inode!\n");
6028 inode_lock(data_alloc_inode);
6030 status = ocfs2_inode_lock(data_alloc_inode, &data_alloc_bh, 1);
6036 status = ocfs2_replay_truncate_records(osb, data_alloc_inode,
6041 brelse(data_alloc_bh);
6042 ocfs2_inode_unlock(data_alloc_inode, 1);
6045 inode_unlock(data_alloc_inode);
6046 iput(data_alloc_inode);
6052 int ocfs2_flush_truncate_log(struct ocfs2_super *osb)
6055 struct inode *tl_inode = osb->osb_tl_inode;
6057 inode_lock(tl_inode);
6058 status = __ocfs2_flush_truncate_log(osb);
6059 inode_unlock(tl_inode);
6064 static void ocfs2_truncate_log_worker(struct work_struct *work)
6067 struct ocfs2_super *osb =
6068 container_of(work, struct ocfs2_super,
6069 osb_truncate_log_wq.work);
6071 status = ocfs2_flush_truncate_log(osb);
6075 ocfs2_init_steal_slots(osb);
6078 #define OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL (2 * HZ)
6079 void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
6082 if (osb->osb_tl_inode &&
6083 atomic_read(&osb->osb_tl_disable) == 0) {
6084 /* We want to push off log flushes while truncates are
6087 cancel_delayed_work(&osb->osb_truncate_log_wq);
6089 queue_delayed_work(osb->ocfs2_wq, &osb->osb_truncate_log_wq,
6090 OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL);
6095 * Try to flush truncate logs if we can free enough clusters from it.
6096 * As for return value, "< 0" means error, "0" no space and "1" means
6097 * we have freed enough spaces and let the caller try to allocate again.
6099 int ocfs2_try_to_free_truncate_log(struct ocfs2_super *osb,
6100 unsigned int needed)
6104 unsigned int truncated_clusters;
6106 inode_lock(osb->osb_tl_inode);
6107 truncated_clusters = osb->truncated_clusters;
6108 inode_unlock(osb->osb_tl_inode);
6111 * Check whether we can succeed in allocating if we free
6114 if (truncated_clusters < needed)
6117 ret = ocfs2_flush_truncate_log(osb);
6123 if (jbd2_journal_start_commit(osb->journal->j_journal, &target)) {
6124 jbd2_log_wait_commit(osb->journal->j_journal, target);
6131 static int ocfs2_get_truncate_log_info(struct ocfs2_super *osb,
6133 struct inode **tl_inode,
6134 struct buffer_head **tl_bh)
6137 struct inode *inode = NULL;
6138 struct buffer_head *bh = NULL;
6140 inode = ocfs2_get_system_file_inode(osb,
6141 TRUNCATE_LOG_SYSTEM_INODE,
6145 mlog(ML_ERROR, "Could not get load truncate log inode!\n");
6149 status = ocfs2_read_inode_block(inode, &bh);
6162 /* called during the 1st stage of node recovery. we stamp a clean
6163 * truncate log and pass back a copy for processing later. if the
6164 * truncate log does not require processing, a *tl_copy is set to
6166 int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
6168 struct ocfs2_dinode **tl_copy)
6171 struct inode *tl_inode = NULL;
6172 struct buffer_head *tl_bh = NULL;
6173 struct ocfs2_dinode *di;
6174 struct ocfs2_truncate_log *tl;
6178 trace_ocfs2_begin_truncate_log_recovery(slot_num);
6180 status = ocfs2_get_truncate_log_info(osb, slot_num, &tl_inode, &tl_bh);
6186 di = (struct ocfs2_dinode *) tl_bh->b_data;
6188 /* tl_bh is loaded from ocfs2_get_truncate_log_info(). It's
6189 * validated by the underlying call to ocfs2_read_inode_block(),
6190 * so any corruption is a code bug */
6191 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
6193 tl = &di->id2.i_dealloc;
6194 if (le16_to_cpu(tl->tl_used)) {
6195 trace_ocfs2_truncate_log_recovery_num(le16_to_cpu(tl->tl_used));
6197 *tl_copy = kmalloc(tl_bh->b_size, GFP_KERNEL);
6204 /* Assuming the write-out below goes well, this copy
6205 * will be passed back to recovery for processing. */
6206 memcpy(*tl_copy, tl_bh->b_data, tl_bh->b_size);
6208 /* All we need to do to clear the truncate log is set
6212 ocfs2_compute_meta_ecc(osb->sb, tl_bh->b_data, &di->i_check);
6213 status = ocfs2_write_block(osb, tl_bh, INODE_CACHE(tl_inode));
6233 int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
6234 struct ocfs2_dinode *tl_copy)
6238 unsigned int clusters, num_recs, start_cluster;
6241 struct inode *tl_inode = osb->osb_tl_inode;
6242 struct ocfs2_truncate_log *tl;
6244 if (OCFS2_I(tl_inode)->ip_blkno == le64_to_cpu(tl_copy->i_blkno)) {
6245 mlog(ML_ERROR, "Asked to recover my own truncate log!\n");
6249 tl = &tl_copy->id2.i_dealloc;
6250 num_recs = le16_to_cpu(tl->tl_used);
6251 trace_ocfs2_complete_truncate_log_recovery(
6252 (unsigned long long)le64_to_cpu(tl_copy->i_blkno),
6255 inode_lock(tl_inode);
6256 for(i = 0; i < num_recs; i++) {
6257 if (ocfs2_truncate_log_needs_flush(osb)) {
6258 status = __ocfs2_flush_truncate_log(osb);
6265 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6266 if (IS_ERR(handle)) {
6267 status = PTR_ERR(handle);
6272 clusters = le32_to_cpu(tl->tl_recs[i].t_clusters);
6273 start_cluster = le32_to_cpu(tl->tl_recs[i].t_start);
6274 start_blk = ocfs2_clusters_to_blocks(osb->sb, start_cluster);
6276 status = ocfs2_truncate_log_append(osb, handle,
6277 start_blk, clusters);
6278 ocfs2_commit_trans(osb, handle);
6286 inode_unlock(tl_inode);
6291 void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb)
6294 struct inode *tl_inode = osb->osb_tl_inode;
6296 atomic_set(&osb->osb_tl_disable, 1);
6299 cancel_delayed_work(&osb->osb_truncate_log_wq);
6300 flush_workqueue(osb->ocfs2_wq);
6302 status = ocfs2_flush_truncate_log(osb);
6306 brelse(osb->osb_tl_bh);
6307 iput(osb->osb_tl_inode);
6311 int ocfs2_truncate_log_init(struct ocfs2_super *osb)
6314 struct inode *tl_inode = NULL;
6315 struct buffer_head *tl_bh = NULL;
6317 status = ocfs2_get_truncate_log_info(osb,
6324 /* ocfs2_truncate_log_shutdown keys on the existence of
6325 * osb->osb_tl_inode so we don't set any of the osb variables
6326 * until we're sure all is well. */
6327 INIT_DELAYED_WORK(&osb->osb_truncate_log_wq,
6328 ocfs2_truncate_log_worker);
6329 atomic_set(&osb->osb_tl_disable, 0);
6330 osb->osb_tl_bh = tl_bh;
6331 osb->osb_tl_inode = tl_inode;
6337 * Delayed de-allocation of suballocator blocks.
6339 * Some sets of block de-allocations might involve multiple suballocator inodes.
6341 * The locking for this can get extremely complicated, especially when
6342 * the suballocator inodes to delete from aren't known until deep
6343 * within an unrelated codepath.
6345 * ocfs2_extent_block structures are a good example of this - an inode
6346 * btree could have been grown by any number of nodes each allocating
6347 * out of their own suballoc inode.
6349 * These structures allow the delay of block de-allocation until a
6350 * later time, when locking of multiple cluster inodes won't cause
6355 * Describe a single bit freed from a suballocator. For the block
6356 * suballocators, it represents one block. For the global cluster
6357 * allocator, it represents some clusters and free_bit indicates
6360 struct ocfs2_cached_block_free {
6361 struct ocfs2_cached_block_free *free_next;
6364 unsigned int free_bit;
6367 struct ocfs2_per_slot_free_list {
6368 struct ocfs2_per_slot_free_list *f_next_suballocator;
6371 struct ocfs2_cached_block_free *f_first;
6374 static int ocfs2_free_cached_blocks(struct ocfs2_super *osb,
6377 struct ocfs2_cached_block_free *head)
6382 struct inode *inode;
6383 struct buffer_head *di_bh = NULL;
6384 struct ocfs2_cached_block_free *tmp;
6386 inode = ocfs2_get_system_file_inode(osb, sysfile_type, slot);
6395 ret = ocfs2_inode_lock(inode, &di_bh, 1);
6403 bg_blkno = head->free_bg;
6405 bg_blkno = ocfs2_which_suballoc_group(head->free_blk,
6407 handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
6408 if (IS_ERR(handle)) {
6409 ret = PTR_ERR(handle);
6414 trace_ocfs2_free_cached_blocks(
6415 (unsigned long long)head->free_blk, head->free_bit);
6417 ret = ocfs2_free_suballoc_bits(handle, inode, di_bh,
6418 head->free_bit, bg_blkno, 1);
6422 ocfs2_commit_trans(osb, handle);
6425 head = head->free_next;
6430 ocfs2_inode_unlock(inode, 1);
6433 inode_unlock(inode);
6437 /* Premature exit may have left some dangling items. */
6439 head = head->free_next;
6446 int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6447 u64 blkno, unsigned int bit)
6450 struct ocfs2_cached_block_free *item;
6452 item = kzalloc(sizeof(*item), GFP_NOFS);
6459 trace_ocfs2_cache_cluster_dealloc((unsigned long long)blkno, bit);
6461 item->free_blk = blkno;
6462 item->free_bit = bit;
6463 item->free_next = ctxt->c_global_allocator;
6465 ctxt->c_global_allocator = item;
6469 static int ocfs2_free_cached_clusters(struct ocfs2_super *osb,
6470 struct ocfs2_cached_block_free *head)
6472 struct ocfs2_cached_block_free *tmp;
6473 struct inode *tl_inode = osb->osb_tl_inode;
6477 inode_lock(tl_inode);
6480 if (ocfs2_truncate_log_needs_flush(osb)) {
6481 ret = __ocfs2_flush_truncate_log(osb);
6488 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6489 if (IS_ERR(handle)) {
6490 ret = PTR_ERR(handle);
6495 ret = ocfs2_truncate_log_append(osb, handle, head->free_blk,
6498 ocfs2_commit_trans(osb, handle);
6500 head = head->free_next;
6509 inode_unlock(tl_inode);
6512 /* Premature exit may have left some dangling items. */
6514 head = head->free_next;
6521 int ocfs2_run_deallocs(struct ocfs2_super *osb,
6522 struct ocfs2_cached_dealloc_ctxt *ctxt)
6525 struct ocfs2_per_slot_free_list *fl;
6530 while (ctxt->c_first_suballocator) {
6531 fl = ctxt->c_first_suballocator;
6534 trace_ocfs2_run_deallocs(fl->f_inode_type,
6536 ret2 = ocfs2_free_cached_blocks(osb,
6546 ctxt->c_first_suballocator = fl->f_next_suballocator;
6550 if (ctxt->c_global_allocator) {
6551 ret2 = ocfs2_free_cached_clusters(osb,
6552 ctxt->c_global_allocator);
6558 ctxt->c_global_allocator = NULL;
6564 static struct ocfs2_per_slot_free_list *
6565 ocfs2_find_per_slot_free_list(int type,
6567 struct ocfs2_cached_dealloc_ctxt *ctxt)
6569 struct ocfs2_per_slot_free_list *fl = ctxt->c_first_suballocator;
6572 if (fl->f_inode_type == type && fl->f_slot == slot)
6575 fl = fl->f_next_suballocator;
6578 fl = kmalloc(sizeof(*fl), GFP_NOFS);
6580 fl->f_inode_type = type;
6583 fl->f_next_suballocator = ctxt->c_first_suballocator;
6585 ctxt->c_first_suballocator = fl;
6590 int ocfs2_cache_block_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6591 int type, int slot, u64 suballoc,
6592 u64 blkno, unsigned int bit)
6595 struct ocfs2_per_slot_free_list *fl;
6596 struct ocfs2_cached_block_free *item;
6598 fl = ocfs2_find_per_slot_free_list(type, slot, ctxt);
6605 item = kzalloc(sizeof(*item), GFP_NOFS);
6612 trace_ocfs2_cache_block_dealloc(type, slot,
6613 (unsigned long long)suballoc,
6614 (unsigned long long)blkno, bit);
6616 item->free_bg = suballoc;
6617 item->free_blk = blkno;
6618 item->free_bit = bit;
6619 item->free_next = fl->f_first;
6628 static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
6629 struct ocfs2_extent_block *eb)
6631 return ocfs2_cache_block_dealloc(ctxt, EXTENT_ALLOC_SYSTEM_INODE,
6632 le16_to_cpu(eb->h_suballoc_slot),
6633 le64_to_cpu(eb->h_suballoc_loc),
6634 le64_to_cpu(eb->h_blkno),
6635 le16_to_cpu(eb->h_suballoc_bit));
6638 static int ocfs2_zero_func(handle_t *handle, struct buffer_head *bh)
6640 set_buffer_uptodate(bh);
6641 mark_buffer_dirty(bh);
6645 void ocfs2_map_and_dirty_page(struct inode *inode, handle_t *handle,
6646 unsigned int from, unsigned int to,
6647 struct page *page, int zero, u64 *phys)
6649 int ret, partial = 0;
6651 ret = ocfs2_map_page_blocks(page, phys, inode, from, to, 0);
6656 zero_user_segment(page, from, to);
6659 * Need to set the buffers we zero'd into uptodate
6660 * here if they aren't - ocfs2_map_page_blocks()
6661 * might've skipped some
6663 ret = walk_page_buffers(handle, page_buffers(page),
6668 else if (ocfs2_should_order_data(inode)) {
6669 ret = ocfs2_jbd2_file_inode(handle, inode);
6675 SetPageUptodate(page);
6677 flush_dcache_page(page);
6680 static void ocfs2_zero_cluster_pages(struct inode *inode, loff_t start,
6681 loff_t end, struct page **pages,
6682 int numpages, u64 phys, handle_t *handle)
6686 unsigned int from, to = PAGE_SIZE;
6687 struct super_block *sb = inode->i_sb;
6689 BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(sb)));
6695 for(i = 0; i < numpages; i++) {
6698 from = start & (PAGE_SIZE - 1);
6699 if ((end >> PAGE_SHIFT) == page->index)
6700 to = end & (PAGE_SIZE - 1);
6702 BUG_ON(from > PAGE_SIZE);
6703 BUG_ON(to > PAGE_SIZE);
6705 ocfs2_map_and_dirty_page(inode, handle, from, to, page, 1,
6708 start = (page->index + 1) << PAGE_SHIFT;
6712 ocfs2_unlock_and_free_pages(pages, numpages);
6715 int ocfs2_grab_pages(struct inode *inode, loff_t start, loff_t end,
6716 struct page **pages, int *num)
6718 int numpages, ret = 0;
6719 struct address_space *mapping = inode->i_mapping;
6720 unsigned long index;
6721 loff_t last_page_bytes;
6723 BUG_ON(start > end);
6726 last_page_bytes = PAGE_ALIGN(end);
6727 index = start >> PAGE_SHIFT;
6729 pages[numpages] = find_or_create_page(mapping, index, GFP_NOFS);
6730 if (!pages[numpages]) {
6738 } while (index < (last_page_bytes >> PAGE_SHIFT));
6743 ocfs2_unlock_and_free_pages(pages, numpages);
6752 static int ocfs2_grab_eof_pages(struct inode *inode, loff_t start, loff_t end,
6753 struct page **pages, int *num)
6755 struct super_block *sb = inode->i_sb;
6757 BUG_ON(start >> OCFS2_SB(sb)->s_clustersize_bits !=
6758 (end - 1) >> OCFS2_SB(sb)->s_clustersize_bits);
6760 return ocfs2_grab_pages(inode, start, end, pages, num);
6764 * Zero the area past i_size but still within an allocated
6765 * cluster. This avoids exposing nonzero data on subsequent file
6768 * We need to call this before i_size is updated on the inode because
6769 * otherwise block_write_full_page() will skip writeout of pages past
6770 * i_size. The new_i_size parameter is passed for this reason.
6772 int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
6773 u64 range_start, u64 range_end)
6775 int ret = 0, numpages;
6776 struct page **pages = NULL;
6778 unsigned int ext_flags;
6779 struct super_block *sb = inode->i_sb;
6782 * File systems which don't support sparse files zero on every
6785 if (!ocfs2_sparse_alloc(OCFS2_SB(sb)))
6788 pages = kcalloc(ocfs2_pages_per_cluster(sb),
6789 sizeof(struct page *), GFP_NOFS);
6790 if (pages == NULL) {
6796 if (range_start == range_end)
6799 ret = ocfs2_extent_map_get_blocks(inode,
6800 range_start >> sb->s_blocksize_bits,
6801 &phys, NULL, &ext_flags);
6808 * Tail is a hole, or is marked unwritten. In either case, we
6809 * can count on read and write to return/push zero's.
6811 if (phys == 0 || ext_flags & OCFS2_EXT_UNWRITTEN)
6814 ret = ocfs2_grab_eof_pages(inode, range_start, range_end, pages,
6821 ocfs2_zero_cluster_pages(inode, range_start, range_end, pages,
6822 numpages, phys, handle);
6825 * Initiate writeout of the pages we zero'd here. We don't
6826 * wait on them - the truncate_inode_pages() call later will
6829 ret = filemap_fdatawrite_range(inode->i_mapping, range_start,
6840 static void ocfs2_zero_dinode_id2_with_xattr(struct inode *inode,
6841 struct ocfs2_dinode *di)
6843 unsigned int blocksize = 1 << inode->i_sb->s_blocksize_bits;
6844 unsigned int xattrsize = le16_to_cpu(di->i_xattr_inline_size);
6846 if (le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_XATTR_FL)
6847 memset(&di->id2, 0, blocksize -
6848 offsetof(struct ocfs2_dinode, id2) -
6851 memset(&di->id2, 0, blocksize -
6852 offsetof(struct ocfs2_dinode, id2));
6855 void ocfs2_dinode_new_extent_list(struct inode *inode,
6856 struct ocfs2_dinode *di)
6858 ocfs2_zero_dinode_id2_with_xattr(inode, di);
6859 di->id2.i_list.l_tree_depth = 0;
6860 di->id2.i_list.l_next_free_rec = 0;
6861 di->id2.i_list.l_count = cpu_to_le16(
6862 ocfs2_extent_recs_per_inode_with_xattr(inode->i_sb, di));
6865 void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di)
6867 struct ocfs2_inode_info *oi = OCFS2_I(inode);
6868 struct ocfs2_inline_data *idata = &di->id2.i_data;
6870 spin_lock(&oi->ip_lock);
6871 oi->ip_dyn_features |= OCFS2_INLINE_DATA_FL;
6872 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
6873 spin_unlock(&oi->ip_lock);
6876 * We clear the entire i_data structure here so that all
6877 * fields can be properly initialized.
6879 ocfs2_zero_dinode_id2_with_xattr(inode, di);
6881 idata->id_count = cpu_to_le16(
6882 ocfs2_max_inline_data_with_xattr(inode->i_sb, di));
6885 int ocfs2_convert_inline_data_to_extents(struct inode *inode,
6886 struct buffer_head *di_bh)
6888 int ret, has_data, num_pages = 0;
6892 u64 uninitialized_var(block);
6893 struct ocfs2_inode_info *oi = OCFS2_I(inode);
6894 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6895 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
6896 struct ocfs2_alloc_context *data_ac = NULL;
6897 struct page *page = NULL;
6898 struct ocfs2_extent_tree et;
6901 has_data = i_size_read(inode) ? 1 : 0;
6904 ret = ocfs2_reserve_clusters(osb, 1, &data_ac);
6911 handle = ocfs2_start_trans(osb,
6912 ocfs2_inline_to_extents_credits(osb->sb));
6913 if (IS_ERR(handle)) {
6914 ret = PTR_ERR(handle);
6919 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
6920 OCFS2_JOURNAL_ACCESS_WRITE);
6927 unsigned int page_end = min_t(unsigned, PAGE_SIZE,
6928 osb->s_clustersize);
6931 ret = dquot_alloc_space_nodirty(inode,
6932 ocfs2_clusters_to_bytes(osb->sb, 1));
6937 data_ac->ac_resv = &OCFS2_I(inode)->ip_la_data_resv;
6939 ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off,
6947 * Save two copies, one for insert, and one that can
6948 * be changed by ocfs2_map_and_dirty_page() below.
6950 block = phys = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
6952 ret = ocfs2_grab_eof_pages(inode, 0, page_end, &page,
6961 * This should populate the 1st page for us and mark
6964 ret = ocfs2_read_inline_data(inode, page, di_bh);
6971 ocfs2_map_and_dirty_page(inode, handle, 0, page_end, page, 0,
6975 spin_lock(&oi->ip_lock);
6976 oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL;
6977 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
6978 spin_unlock(&oi->ip_lock);
6980 ocfs2_update_inode_fsync_trans(handle, inode, 1);
6981 ocfs2_dinode_new_extent_list(inode, di);
6983 ocfs2_journal_dirty(handle, di_bh);
6987 * An error at this point should be extremely rare. If
6988 * this proves to be false, we could always re-build
6989 * the in-inode data from our pages.
6991 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
6992 ret = ocfs2_insert_extent(handle, &et, 0, block, 1, 0, NULL);
6999 inode->i_blocks = ocfs2_inode_sector_count(inode);
7004 ocfs2_unlock_and_free_pages(&page, num_pages);
7007 if (ret < 0 && did_quota)
7008 dquot_free_space_nodirty(inode,
7009 ocfs2_clusters_to_bytes(osb->sb, 1));
7012 if (data_ac->ac_which == OCFS2_AC_USE_LOCAL)
7013 ocfs2_free_local_alloc_bits(osb, handle, data_ac,
7016 ocfs2_free_clusters(handle,
7019 ocfs2_clusters_to_blocks(osb->sb, bit_off),
7023 ocfs2_commit_trans(osb, handle);
7027 ocfs2_free_alloc_context(data_ac);
7032 * It is expected, that by the time you call this function,
7033 * inode->i_size and fe->i_size have been adjusted.
7035 * WARNING: This will kfree the truncate context
7037 int ocfs2_commit_truncate(struct ocfs2_super *osb,
7038 struct inode *inode,
7039 struct buffer_head *di_bh)
7041 int status = 0, i, flags = 0;
7042 u32 new_highest_cpos, range, trunc_cpos, trunc_len, phys_cpos, coff;
7044 struct ocfs2_extent_list *el;
7045 struct ocfs2_extent_rec *rec;
7046 struct ocfs2_path *path = NULL;
7047 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7048 struct ocfs2_extent_list *root_el = &(di->id2.i_list);
7049 u64 refcount_loc = le64_to_cpu(di->i_refcount_loc);
7050 struct ocfs2_extent_tree et;
7051 struct ocfs2_cached_dealloc_ctxt dealloc;
7052 struct ocfs2_refcount_tree *ref_tree = NULL;
7054 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
7055 ocfs2_init_dealloc_ctxt(&dealloc);
7057 new_highest_cpos = ocfs2_clusters_for_bytes(osb->sb,
7058 i_size_read(inode));
7060 path = ocfs2_new_path(di_bh, &di->id2.i_list,
7061 ocfs2_journal_access_di);
7068 ocfs2_extent_map_trunc(inode, new_highest_cpos);
7072 * Check that we still have allocation to delete.
7074 if (OCFS2_I(inode)->ip_clusters == 0) {
7080 * Truncate always works against the rightmost tree branch.
7082 status = ocfs2_find_path(INODE_CACHE(inode), path, UINT_MAX);
7088 trace_ocfs2_commit_truncate(
7089 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7091 OCFS2_I(inode)->ip_clusters,
7092 path->p_tree_depth);
7095 * By now, el will point to the extent list on the bottom most
7096 * portion of this tree. Only the tail record is considered in
7099 * We handle the following cases, in order:
7100 * - empty extent: delete the remaining branch
7101 * - remove the entire record
7102 * - remove a partial record
7103 * - no record needs to be removed (truncate has completed)
7105 el = path_leaf_el(path);
7106 if (le16_to_cpu(el->l_next_free_rec) == 0) {
7107 ocfs2_error(inode->i_sb,
7108 "Inode %llu has empty extent block at %llu\n",
7109 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7110 (unsigned long long)path_leaf_bh(path)->b_blocknr);
7115 i = le16_to_cpu(el->l_next_free_rec) - 1;
7116 rec = &el->l_recs[i];
7117 flags = rec->e_flags;
7118 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
7120 if (i == 0 && ocfs2_is_empty_extent(rec)) {
7122 * Lower levels depend on this never happening, but it's best
7123 * to check it up here before changing the tree.
7125 if (root_el->l_tree_depth && rec->e_int_clusters == 0) {
7126 mlog(ML_ERROR, "Inode %lu has an empty "
7127 "extent record, depth %u\n", inode->i_ino,
7128 le16_to_cpu(root_el->l_tree_depth));
7129 status = ocfs2_remove_rightmost_empty_extent(osb,
7130 &et, path, &dealloc);
7136 ocfs2_reinit_path(path, 1);
7139 trunc_cpos = le32_to_cpu(rec->e_cpos);
7143 } else if (le32_to_cpu(rec->e_cpos) >= new_highest_cpos) {
7145 * Truncate entire record.
7147 trunc_cpos = le32_to_cpu(rec->e_cpos);
7148 trunc_len = ocfs2_rec_clusters(el, rec);
7149 blkno = le64_to_cpu(rec->e_blkno);
7150 } else if (range > new_highest_cpos) {
7152 * Partial truncate. it also should be
7153 * the last truncate we're doing.
7155 trunc_cpos = new_highest_cpos;
7156 trunc_len = range - new_highest_cpos;
7157 coff = new_highest_cpos - le32_to_cpu(rec->e_cpos);
7158 blkno = le64_to_cpu(rec->e_blkno) +
7159 ocfs2_clusters_to_blocks(inode->i_sb, coff);
7162 * Truncate completed, leave happily.
7168 phys_cpos = ocfs2_blocks_to_clusters(inode->i_sb, blkno);
7170 if ((flags & OCFS2_EXT_REFCOUNTED) && trunc_len && !ref_tree) {
7171 status = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
7179 status = ocfs2_remove_btree_range(inode, &et, trunc_cpos,
7180 phys_cpos, trunc_len, flags, &dealloc,
7181 refcount_loc, true);
7187 ocfs2_reinit_path(path, 1);
7190 * The check above will catch the case where we've truncated
7191 * away all allocation.
7197 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
7199 ocfs2_schedule_truncate_log_flush(osb, 1);
7201 ocfs2_run_deallocs(osb, &dealloc);
7203 ocfs2_free_path(path);
7209 * 'start' is inclusive, 'end' is not.
7211 int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
7212 unsigned int start, unsigned int end, int trunc)
7215 unsigned int numbytes;
7217 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7218 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7219 struct ocfs2_inline_data *idata = &di->id2.i_data;
7221 /* No need to punch hole beyond i_size. */
7222 if (start >= i_size_read(inode))
7225 if (end > i_size_read(inode))
7226 end = i_size_read(inode);
7228 BUG_ON(start > end);
7230 if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) ||
7231 !(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL) ||
7232 !ocfs2_supports_inline_data(osb)) {
7233 ocfs2_error(inode->i_sb,
7234 "Inline data flags for inode %llu don't agree! Disk: 0x%x, Memory: 0x%x, Superblock: 0x%x\n",
7235 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7236 le16_to_cpu(di->i_dyn_features),
7237 OCFS2_I(inode)->ip_dyn_features,
7238 osb->s_feature_incompat);
7243 handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
7244 if (IS_ERR(handle)) {
7245 ret = PTR_ERR(handle);
7250 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
7251 OCFS2_JOURNAL_ACCESS_WRITE);
7257 numbytes = end - start;
7258 memset(idata->id_data + start, 0, numbytes);
7261 * No need to worry about the data page here - it's been
7262 * truncated already and inline data doesn't need it for
7263 * pushing zero's to disk, so we'll let readpage pick it up
7267 i_size_write(inode, start);
7268 di->i_size = cpu_to_le64(start);
7271 inode->i_blocks = ocfs2_inode_sector_count(inode);
7272 inode->i_ctime = inode->i_mtime = current_time(inode);
7274 di->i_ctime = di->i_mtime = cpu_to_le64(inode->i_ctime.tv_sec);
7275 di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
7277 ocfs2_update_inode_fsync_trans(handle, inode, 1);
7278 ocfs2_journal_dirty(handle, di_bh);
7281 ocfs2_commit_trans(osb, handle);
7287 static int ocfs2_trim_extent(struct super_block *sb,
7288 struct ocfs2_group_desc *gd,
7289 u64 group, u32 start, u32 count)
7291 u64 discard, bcount;
7292 struct ocfs2_super *osb = OCFS2_SB(sb);
7294 bcount = ocfs2_clusters_to_blocks(sb, count);
7295 discard = ocfs2_clusters_to_blocks(sb, start);
7298 * For the first cluster group, the gd->bg_blkno is not at the start
7299 * of the group, but at an offset from the start. If we add it while
7300 * calculating discard for first group, we will wrongly start fstrim a
7301 * few blocks after the desried start block and the range can cross
7302 * over into the next cluster group. So, add it only if this is not
7303 * the first cluster group.
7305 if (group != osb->first_cluster_group_blkno)
7306 discard += le64_to_cpu(gd->bg_blkno);
7308 trace_ocfs2_trim_extent(sb, (unsigned long long)discard, bcount);
7310 return sb_issue_discard(sb, discard, bcount, GFP_NOFS, 0);
7313 static int ocfs2_trim_group(struct super_block *sb,
7314 struct ocfs2_group_desc *gd, u64 group,
7315 u32 start, u32 max, u32 minbits)
7317 int ret = 0, count = 0, next;
7318 void *bitmap = gd->bg_bitmap;
7320 if (le16_to_cpu(gd->bg_free_bits_count) < minbits)
7323 trace_ocfs2_trim_group((unsigned long long)le64_to_cpu(gd->bg_blkno),
7324 start, max, minbits);
7326 while (start < max) {
7327 start = ocfs2_find_next_zero_bit(bitmap, max, start);
7330 next = ocfs2_find_next_bit(bitmap, max, start);
7332 if ((next - start) >= minbits) {
7333 ret = ocfs2_trim_extent(sb, gd, group,
7334 start, next - start);
7339 count += next - start;
7343 if (fatal_signal_pending(current)) {
7344 count = -ERESTARTSYS;
7348 if ((le16_to_cpu(gd->bg_free_bits_count) - count) < minbits)
7358 int ocfs2_trim_fs(struct super_block *sb, struct fstrim_range *range)
7360 struct ocfs2_super *osb = OCFS2_SB(sb);
7361 u64 start, len, trimmed, first_group, last_group, group;
7363 u32 first_bit, last_bit, minlen;
7364 struct buffer_head *main_bm_bh = NULL;
7365 struct inode *main_bm_inode = NULL;
7366 struct buffer_head *gd_bh = NULL;
7367 struct ocfs2_dinode *main_bm;
7368 struct ocfs2_group_desc *gd = NULL;
7370 start = range->start >> osb->s_clustersize_bits;
7371 len = range->len >> osb->s_clustersize_bits;
7372 minlen = range->minlen >> osb->s_clustersize_bits;
7374 if (minlen >= osb->bitmap_cpg || range->len < sb->s_blocksize)
7377 main_bm_inode = ocfs2_get_system_file_inode(osb,
7378 GLOBAL_BITMAP_SYSTEM_INODE,
7379 OCFS2_INVALID_SLOT);
7380 if (!main_bm_inode) {
7386 inode_lock(main_bm_inode);
7388 ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 0);
7393 main_bm = (struct ocfs2_dinode *)main_bm_bh->b_data;
7395 if (start >= le32_to_cpu(main_bm->i_clusters)) {
7400 len = range->len >> osb->s_clustersize_bits;
7401 if (start + len > le32_to_cpu(main_bm->i_clusters))
7402 len = le32_to_cpu(main_bm->i_clusters) - start;
7404 trace_ocfs2_trim_fs(start, len, minlen);
7406 /* Determine first and last group to examine based on start and len */
7407 first_group = ocfs2_which_cluster_group(main_bm_inode, start);
7408 if (first_group == osb->first_cluster_group_blkno)
7411 first_bit = start - ocfs2_blocks_to_clusters(sb, first_group);
7412 last_group = ocfs2_which_cluster_group(main_bm_inode, start + len - 1);
7413 last_bit = osb->bitmap_cpg;
7416 for (group = first_group; group <= last_group;) {
7417 if (first_bit + len >= osb->bitmap_cpg)
7418 last_bit = osb->bitmap_cpg;
7420 last_bit = first_bit + len;
7422 ret = ocfs2_read_group_descriptor(main_bm_inode,
7430 gd = (struct ocfs2_group_desc *)gd_bh->b_data;
7431 cnt = ocfs2_trim_group(sb, gd, group,
7432 first_bit, last_bit, minlen);
7442 len -= osb->bitmap_cpg - first_bit;
7444 if (group == osb->first_cluster_group_blkno)
7445 group = ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg);
7447 group += ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg);
7449 range->len = trimmed * sb->s_blocksize;
7451 ocfs2_inode_unlock(main_bm_inode, 0);
7454 inode_unlock(main_bm_inode);
7455 iput(main_bm_inode);