1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
6 * Extent allocs and frees
8 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
27 #include <linux/types.h>
28 #include <linux/slab.h>
29 #include <linux/highmem.h>
30 #include <linux/swap.h>
31 #include <linux/quotaops.h>
33 #define MLOG_MASK_PREFIX ML_DISK_ALLOC
34 #include <cluster/masklog.h>
40 #include "blockcheck.h"
42 #include "extent_map.h"
45 #include "localalloc.h"
52 #include "refcounttree.h"
54 #include "buffer_head_io.h"
56 enum ocfs2_contig_type
{
63 static enum ocfs2_contig_type
64 ocfs2_extent_rec_contig(struct super_block
*sb
,
65 struct ocfs2_extent_rec
*ext
,
66 struct ocfs2_extent_rec
*insert_rec
);
68 * Operations for a specific extent tree type.
70 * To implement an on-disk btree (extent tree) type in ocfs2, add
71 * an ocfs2_extent_tree_operations structure and the matching
72 * ocfs2_init_<thingy>_extent_tree() function. That's pretty much it
73 * for the allocation portion of the extent tree.
75 struct ocfs2_extent_tree_operations
{
77 * last_eb_blk is the block number of the right most leaf extent
78 * block. Most on-disk structures containing an extent tree store
79 * this value for fast access. The ->eo_set_last_eb_blk() and
80 * ->eo_get_last_eb_blk() operations access this value. They are
83 void (*eo_set_last_eb_blk
)(struct ocfs2_extent_tree
*et
,
85 u64 (*eo_get_last_eb_blk
)(struct ocfs2_extent_tree
*et
);
88 * The on-disk structure usually keeps track of how many total
89 * clusters are stored in this extent tree. This function updates
90 * that value. new_clusters is the delta, and must be
91 * added to the total. Required.
93 void (*eo_update_clusters
)(struct ocfs2_extent_tree
*et
,
97 * If this extent tree is supported by an extent map, insert
98 * a record into the map.
100 void (*eo_extent_map_insert
)(struct ocfs2_extent_tree
*et
,
101 struct ocfs2_extent_rec
*rec
);
104 * If this extent tree is supported by an extent map, truncate the
107 void (*eo_extent_map_truncate
)(struct ocfs2_extent_tree
*et
,
111 * If ->eo_insert_check() exists, it is called before rec is
112 * inserted into the extent tree. It is optional.
114 int (*eo_insert_check
)(struct ocfs2_extent_tree
*et
,
115 struct ocfs2_extent_rec
*rec
);
116 int (*eo_sanity_check
)(struct ocfs2_extent_tree
*et
);
119 * --------------------------------------------------------------
120 * The remaining are internal to ocfs2_extent_tree and don't have
125 * ->eo_fill_root_el() takes et->et_object and sets et->et_root_el.
128 void (*eo_fill_root_el
)(struct ocfs2_extent_tree
*et
);
131 * ->eo_fill_max_leaf_clusters sets et->et_max_leaf_clusters if
132 * it exists. If it does not, et->et_max_leaf_clusters is set
133 * to 0 (unlimited). Optional.
135 void (*eo_fill_max_leaf_clusters
)(struct ocfs2_extent_tree
*et
);
138 * ->eo_extent_contig test whether the 2 ocfs2_extent_rec
139 * are contiguous or not. Optional. Don't need to set it if use
140 * ocfs2_extent_rec as the tree leaf.
142 enum ocfs2_contig_type
143 (*eo_extent_contig
)(struct ocfs2_extent_tree
*et
,
144 struct ocfs2_extent_rec
*ext
,
145 struct ocfs2_extent_rec
*insert_rec
);
150 * Pre-declare ocfs2_dinode_et_ops so we can use it as a sanity check
153 static u64
ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree
*et
);
154 static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
156 static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree
*et
,
158 static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree
*et
,
159 struct ocfs2_extent_rec
*rec
);
160 static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree
*et
,
162 static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree
*et
,
163 struct ocfs2_extent_rec
*rec
);
164 static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree
*et
);
165 static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree
*et
);
166 static struct ocfs2_extent_tree_operations ocfs2_dinode_et_ops
= {
167 .eo_set_last_eb_blk
= ocfs2_dinode_set_last_eb_blk
,
168 .eo_get_last_eb_blk
= ocfs2_dinode_get_last_eb_blk
,
169 .eo_update_clusters
= ocfs2_dinode_update_clusters
,
170 .eo_extent_map_insert
= ocfs2_dinode_extent_map_insert
,
171 .eo_extent_map_truncate
= ocfs2_dinode_extent_map_truncate
,
172 .eo_insert_check
= ocfs2_dinode_insert_check
,
173 .eo_sanity_check
= ocfs2_dinode_sanity_check
,
174 .eo_fill_root_el
= ocfs2_dinode_fill_root_el
,
177 static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
180 struct ocfs2_dinode
*di
= et
->et_object
;
182 BUG_ON(et
->et_ops
!= &ocfs2_dinode_et_ops
);
183 di
->i_last_eb_blk
= cpu_to_le64(blkno
);
186 static u64
ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree
*et
)
188 struct ocfs2_dinode
*di
= et
->et_object
;
190 BUG_ON(et
->et_ops
!= &ocfs2_dinode_et_ops
);
191 return le64_to_cpu(di
->i_last_eb_blk
);
194 static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree
*et
,
197 struct ocfs2_inode_info
*oi
= cache_info_to_inode(et
->et_ci
);
198 struct ocfs2_dinode
*di
= et
->et_object
;
200 le32_add_cpu(&di
->i_clusters
, clusters
);
201 spin_lock(&oi
->ip_lock
);
202 oi
->ip_clusters
= le32_to_cpu(di
->i_clusters
);
203 spin_unlock(&oi
->ip_lock
);
206 static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree
*et
,
207 struct ocfs2_extent_rec
*rec
)
209 struct inode
*inode
= &cache_info_to_inode(et
->et_ci
)->vfs_inode
;
211 ocfs2_extent_map_insert_rec(inode
, rec
);
214 static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree
*et
,
217 struct inode
*inode
= &cache_info_to_inode(et
->et_ci
)->vfs_inode
;
219 ocfs2_extent_map_trunc(inode
, clusters
);
222 static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree
*et
,
223 struct ocfs2_extent_rec
*rec
)
225 struct ocfs2_inode_info
*oi
= cache_info_to_inode(et
->et_ci
);
226 struct ocfs2_super
*osb
= OCFS2_SB(oi
->vfs_inode
.i_sb
);
228 BUG_ON(oi
->ip_dyn_features
& OCFS2_INLINE_DATA_FL
);
229 mlog_bug_on_msg(!ocfs2_sparse_alloc(osb
) &&
230 (oi
->ip_clusters
!= le32_to_cpu(rec
->e_cpos
)),
231 "Device %s, asking for sparse allocation: inode %llu, "
232 "cpos %u, clusters %u\n",
234 (unsigned long long)oi
->ip_blkno
,
235 rec
->e_cpos
, oi
->ip_clusters
);
240 static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree
*et
)
242 struct ocfs2_dinode
*di
= et
->et_object
;
244 BUG_ON(et
->et_ops
!= &ocfs2_dinode_et_ops
);
245 BUG_ON(!OCFS2_IS_VALID_DINODE(di
));
250 static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree
*et
)
252 struct ocfs2_dinode
*di
= et
->et_object
;
254 et
->et_root_el
= &di
->id2
.i_list
;
258 static void ocfs2_xattr_value_fill_root_el(struct ocfs2_extent_tree
*et
)
260 struct ocfs2_xattr_value_buf
*vb
= et
->et_object
;
262 et
->et_root_el
= &vb
->vb_xv
->xr_list
;
265 static void ocfs2_xattr_value_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
268 struct ocfs2_xattr_value_buf
*vb
= et
->et_object
;
270 vb
->vb_xv
->xr_last_eb_blk
= cpu_to_le64(blkno
);
273 static u64
ocfs2_xattr_value_get_last_eb_blk(struct ocfs2_extent_tree
*et
)
275 struct ocfs2_xattr_value_buf
*vb
= et
->et_object
;
277 return le64_to_cpu(vb
->vb_xv
->xr_last_eb_blk
);
280 static void ocfs2_xattr_value_update_clusters(struct ocfs2_extent_tree
*et
,
283 struct ocfs2_xattr_value_buf
*vb
= et
->et_object
;
285 le32_add_cpu(&vb
->vb_xv
->xr_clusters
, clusters
);
288 static struct ocfs2_extent_tree_operations ocfs2_xattr_value_et_ops
= {
289 .eo_set_last_eb_blk
= ocfs2_xattr_value_set_last_eb_blk
,
290 .eo_get_last_eb_blk
= ocfs2_xattr_value_get_last_eb_blk
,
291 .eo_update_clusters
= ocfs2_xattr_value_update_clusters
,
292 .eo_fill_root_el
= ocfs2_xattr_value_fill_root_el
,
295 static void ocfs2_xattr_tree_fill_root_el(struct ocfs2_extent_tree
*et
)
297 struct ocfs2_xattr_block
*xb
= et
->et_object
;
299 et
->et_root_el
= &xb
->xb_attrs
.xb_root
.xt_list
;
302 static void ocfs2_xattr_tree_fill_max_leaf_clusters(struct ocfs2_extent_tree
*et
)
304 struct super_block
*sb
= ocfs2_metadata_cache_get_super(et
->et_ci
);
305 et
->et_max_leaf_clusters
=
306 ocfs2_clusters_for_bytes(sb
, OCFS2_MAX_XATTR_TREE_LEAF_SIZE
);
309 static void ocfs2_xattr_tree_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
312 struct ocfs2_xattr_block
*xb
= et
->et_object
;
313 struct ocfs2_xattr_tree_root
*xt
= &xb
->xb_attrs
.xb_root
;
315 xt
->xt_last_eb_blk
= cpu_to_le64(blkno
);
318 static u64
ocfs2_xattr_tree_get_last_eb_blk(struct ocfs2_extent_tree
*et
)
320 struct ocfs2_xattr_block
*xb
= et
->et_object
;
321 struct ocfs2_xattr_tree_root
*xt
= &xb
->xb_attrs
.xb_root
;
323 return le64_to_cpu(xt
->xt_last_eb_blk
);
326 static void ocfs2_xattr_tree_update_clusters(struct ocfs2_extent_tree
*et
,
329 struct ocfs2_xattr_block
*xb
= et
->et_object
;
331 le32_add_cpu(&xb
->xb_attrs
.xb_root
.xt_clusters
, clusters
);
334 static struct ocfs2_extent_tree_operations ocfs2_xattr_tree_et_ops
= {
335 .eo_set_last_eb_blk
= ocfs2_xattr_tree_set_last_eb_blk
,
336 .eo_get_last_eb_blk
= ocfs2_xattr_tree_get_last_eb_blk
,
337 .eo_update_clusters
= ocfs2_xattr_tree_update_clusters
,
338 .eo_fill_root_el
= ocfs2_xattr_tree_fill_root_el
,
339 .eo_fill_max_leaf_clusters
= ocfs2_xattr_tree_fill_max_leaf_clusters
,
342 static void ocfs2_dx_root_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
345 struct ocfs2_dx_root_block
*dx_root
= et
->et_object
;
347 dx_root
->dr_last_eb_blk
= cpu_to_le64(blkno
);
350 static u64
ocfs2_dx_root_get_last_eb_blk(struct ocfs2_extent_tree
*et
)
352 struct ocfs2_dx_root_block
*dx_root
= et
->et_object
;
354 return le64_to_cpu(dx_root
->dr_last_eb_blk
);
357 static void ocfs2_dx_root_update_clusters(struct ocfs2_extent_tree
*et
,
360 struct ocfs2_dx_root_block
*dx_root
= et
->et_object
;
362 le32_add_cpu(&dx_root
->dr_clusters
, clusters
);
365 static int ocfs2_dx_root_sanity_check(struct ocfs2_extent_tree
*et
)
367 struct ocfs2_dx_root_block
*dx_root
= et
->et_object
;
369 BUG_ON(!OCFS2_IS_VALID_DX_ROOT(dx_root
));
374 static void ocfs2_dx_root_fill_root_el(struct ocfs2_extent_tree
*et
)
376 struct ocfs2_dx_root_block
*dx_root
= et
->et_object
;
378 et
->et_root_el
= &dx_root
->dr_list
;
381 static struct ocfs2_extent_tree_operations ocfs2_dx_root_et_ops
= {
382 .eo_set_last_eb_blk
= ocfs2_dx_root_set_last_eb_blk
,
383 .eo_get_last_eb_blk
= ocfs2_dx_root_get_last_eb_blk
,
384 .eo_update_clusters
= ocfs2_dx_root_update_clusters
,
385 .eo_sanity_check
= ocfs2_dx_root_sanity_check
,
386 .eo_fill_root_el
= ocfs2_dx_root_fill_root_el
,
389 static void ocfs2_refcount_tree_fill_root_el(struct ocfs2_extent_tree
*et
)
391 struct ocfs2_refcount_block
*rb
= et
->et_object
;
393 et
->et_root_el
= &rb
->rf_list
;
396 static void ocfs2_refcount_tree_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
399 struct ocfs2_refcount_block
*rb
= et
->et_object
;
401 rb
->rf_last_eb_blk
= cpu_to_le64(blkno
);
404 static u64
ocfs2_refcount_tree_get_last_eb_blk(struct ocfs2_extent_tree
*et
)
406 struct ocfs2_refcount_block
*rb
= et
->et_object
;
408 return le64_to_cpu(rb
->rf_last_eb_blk
);
411 static void ocfs2_refcount_tree_update_clusters(struct ocfs2_extent_tree
*et
,
414 struct ocfs2_refcount_block
*rb
= et
->et_object
;
416 le32_add_cpu(&rb
->rf_clusters
, clusters
);
419 static enum ocfs2_contig_type
420 ocfs2_refcount_tree_extent_contig(struct ocfs2_extent_tree
*et
,
421 struct ocfs2_extent_rec
*ext
,
422 struct ocfs2_extent_rec
*insert_rec
)
427 static struct ocfs2_extent_tree_operations ocfs2_refcount_tree_et_ops
= {
428 .eo_set_last_eb_blk
= ocfs2_refcount_tree_set_last_eb_blk
,
429 .eo_get_last_eb_blk
= ocfs2_refcount_tree_get_last_eb_blk
,
430 .eo_update_clusters
= ocfs2_refcount_tree_update_clusters
,
431 .eo_fill_root_el
= ocfs2_refcount_tree_fill_root_el
,
432 .eo_extent_contig
= ocfs2_refcount_tree_extent_contig
,
435 static void __ocfs2_init_extent_tree(struct ocfs2_extent_tree
*et
,
436 struct ocfs2_caching_info
*ci
,
437 struct buffer_head
*bh
,
438 ocfs2_journal_access_func access
,
440 struct ocfs2_extent_tree_operations
*ops
)
445 et
->et_root_journal_access
= access
;
447 obj
= (void *)bh
->b_data
;
450 et
->et_ops
->eo_fill_root_el(et
);
451 if (!et
->et_ops
->eo_fill_max_leaf_clusters
)
452 et
->et_max_leaf_clusters
= 0;
454 et
->et_ops
->eo_fill_max_leaf_clusters(et
);
457 void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree
*et
,
458 struct ocfs2_caching_info
*ci
,
459 struct buffer_head
*bh
)
461 __ocfs2_init_extent_tree(et
, ci
, bh
, ocfs2_journal_access_di
,
462 NULL
, &ocfs2_dinode_et_ops
);
465 void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree
*et
,
466 struct ocfs2_caching_info
*ci
,
467 struct buffer_head
*bh
)
469 __ocfs2_init_extent_tree(et
, ci
, bh
, ocfs2_journal_access_xb
,
470 NULL
, &ocfs2_xattr_tree_et_ops
);
473 void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree
*et
,
474 struct ocfs2_caching_info
*ci
,
475 struct ocfs2_xattr_value_buf
*vb
)
477 __ocfs2_init_extent_tree(et
, ci
, vb
->vb_bh
, vb
->vb_access
, vb
,
478 &ocfs2_xattr_value_et_ops
);
481 void ocfs2_init_dx_root_extent_tree(struct ocfs2_extent_tree
*et
,
482 struct ocfs2_caching_info
*ci
,
483 struct buffer_head
*bh
)
485 __ocfs2_init_extent_tree(et
, ci
, bh
, ocfs2_journal_access_dr
,
486 NULL
, &ocfs2_dx_root_et_ops
);
489 void ocfs2_init_refcount_extent_tree(struct ocfs2_extent_tree
*et
,
490 struct ocfs2_caching_info
*ci
,
491 struct buffer_head
*bh
)
493 __ocfs2_init_extent_tree(et
, ci
, bh
, ocfs2_journal_access_rb
,
494 NULL
, &ocfs2_refcount_tree_et_ops
);
497 static inline void ocfs2_et_set_last_eb_blk(struct ocfs2_extent_tree
*et
,
500 et
->et_ops
->eo_set_last_eb_blk(et
, new_last_eb_blk
);
503 static inline u64
ocfs2_et_get_last_eb_blk(struct ocfs2_extent_tree
*et
)
505 return et
->et_ops
->eo_get_last_eb_blk(et
);
508 static inline void ocfs2_et_update_clusters(struct ocfs2_extent_tree
*et
,
511 et
->et_ops
->eo_update_clusters(et
, clusters
);
514 static inline void ocfs2_et_extent_map_insert(struct ocfs2_extent_tree
*et
,
515 struct ocfs2_extent_rec
*rec
)
517 if (et
->et_ops
->eo_extent_map_insert
)
518 et
->et_ops
->eo_extent_map_insert(et
, rec
);
521 static inline void ocfs2_et_extent_map_truncate(struct ocfs2_extent_tree
*et
,
524 if (et
->et_ops
->eo_extent_map_truncate
)
525 et
->et_ops
->eo_extent_map_truncate(et
, clusters
);
528 static inline int ocfs2_et_root_journal_access(handle_t
*handle
,
529 struct ocfs2_extent_tree
*et
,
532 return et
->et_root_journal_access(handle
, et
->et_ci
, et
->et_root_bh
,
536 static inline enum ocfs2_contig_type
537 ocfs2_et_extent_contig(struct ocfs2_extent_tree
*et
,
538 struct ocfs2_extent_rec
*rec
,
539 struct ocfs2_extent_rec
*insert_rec
)
541 if (et
->et_ops
->eo_extent_contig
)
542 return et
->et_ops
->eo_extent_contig(et
, rec
, insert_rec
);
544 return ocfs2_extent_rec_contig(
545 ocfs2_metadata_cache_get_super(et
->et_ci
),
549 static inline int ocfs2_et_insert_check(struct ocfs2_extent_tree
*et
,
550 struct ocfs2_extent_rec
*rec
)
554 if (et
->et_ops
->eo_insert_check
)
555 ret
= et
->et_ops
->eo_insert_check(et
, rec
);
559 static inline int ocfs2_et_sanity_check(struct ocfs2_extent_tree
*et
)
563 if (et
->et_ops
->eo_sanity_check
)
564 ret
= et
->et_ops
->eo_sanity_check(et
);
568 static void ocfs2_free_truncate_context(struct ocfs2_truncate_context
*tc
);
569 static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt
*ctxt
,
570 struct ocfs2_extent_block
*eb
);
571 static void ocfs2_adjust_rightmost_records(handle_t
*handle
,
572 struct ocfs2_extent_tree
*et
,
573 struct ocfs2_path
*path
,
574 struct ocfs2_extent_rec
*insert_rec
);
576 * Reset the actual path elements so that we can re-use the structure
577 * to build another path. Generally, this involves freeing the buffer
580 void ocfs2_reinit_path(struct ocfs2_path
*path
, int keep_root
)
582 int i
, start
= 0, depth
= 0;
583 struct ocfs2_path_item
*node
;
588 for(i
= start
; i
< path_num_items(path
); i
++) {
589 node
= &path
->p_node
[i
];
597 * Tree depth may change during truncate, or insert. If we're
598 * keeping the root extent list, then make sure that our path
599 * structure reflects the proper depth.
602 depth
= le16_to_cpu(path_root_el(path
)->l_tree_depth
);
604 path_root_access(path
) = NULL
;
606 path
->p_tree_depth
= depth
;
609 void ocfs2_free_path(struct ocfs2_path
*path
)
612 ocfs2_reinit_path(path
, 0);
618 * All the elements of src into dest. After this call, src could be freed
619 * without affecting dest.
621 * Both paths should have the same root. Any non-root elements of dest
624 static void ocfs2_cp_path(struct ocfs2_path
*dest
, struct ocfs2_path
*src
)
628 BUG_ON(path_root_bh(dest
) != path_root_bh(src
));
629 BUG_ON(path_root_el(dest
) != path_root_el(src
));
630 BUG_ON(path_root_access(dest
) != path_root_access(src
));
632 ocfs2_reinit_path(dest
, 1);
634 for(i
= 1; i
< OCFS2_MAX_PATH_DEPTH
; i
++) {
635 dest
->p_node
[i
].bh
= src
->p_node
[i
].bh
;
636 dest
->p_node
[i
].el
= src
->p_node
[i
].el
;
638 if (dest
->p_node
[i
].bh
)
639 get_bh(dest
->p_node
[i
].bh
);
644 * Make the *dest path the same as src and re-initialize src path to
647 static void ocfs2_mv_path(struct ocfs2_path
*dest
, struct ocfs2_path
*src
)
651 BUG_ON(path_root_bh(dest
) != path_root_bh(src
));
652 BUG_ON(path_root_access(dest
) != path_root_access(src
));
654 for(i
= 1; i
< OCFS2_MAX_PATH_DEPTH
; i
++) {
655 brelse(dest
->p_node
[i
].bh
);
657 dest
->p_node
[i
].bh
= src
->p_node
[i
].bh
;
658 dest
->p_node
[i
].el
= src
->p_node
[i
].el
;
660 src
->p_node
[i
].bh
= NULL
;
661 src
->p_node
[i
].el
= NULL
;
666 * Insert an extent block at given index.
668 * This will not take an additional reference on eb_bh.
670 static inline void ocfs2_path_insert_eb(struct ocfs2_path
*path
, int index
,
671 struct buffer_head
*eb_bh
)
673 struct ocfs2_extent_block
*eb
= (struct ocfs2_extent_block
*)eb_bh
->b_data
;
676 * Right now, no root bh is an extent block, so this helps
677 * catch code errors with dinode trees. The assertion can be
678 * safely removed if we ever need to insert extent block
679 * structures at the root.
683 path
->p_node
[index
].bh
= eb_bh
;
684 path
->p_node
[index
].el
= &eb
->h_list
;
687 static struct ocfs2_path
*ocfs2_new_path(struct buffer_head
*root_bh
,
688 struct ocfs2_extent_list
*root_el
,
689 ocfs2_journal_access_func access
)
691 struct ocfs2_path
*path
;
693 BUG_ON(le16_to_cpu(root_el
->l_tree_depth
) >= OCFS2_MAX_PATH_DEPTH
);
695 path
= kzalloc(sizeof(*path
), GFP_NOFS
);
697 path
->p_tree_depth
= le16_to_cpu(root_el
->l_tree_depth
);
699 path_root_bh(path
) = root_bh
;
700 path_root_el(path
) = root_el
;
701 path_root_access(path
) = access
;
707 struct ocfs2_path
*ocfs2_new_path_from_path(struct ocfs2_path
*path
)
709 return ocfs2_new_path(path_root_bh(path
), path_root_el(path
),
710 path_root_access(path
));
713 struct ocfs2_path
*ocfs2_new_path_from_et(struct ocfs2_extent_tree
*et
)
715 return ocfs2_new_path(et
->et_root_bh
, et
->et_root_el
,
716 et
->et_root_journal_access
);
720 * Journal the buffer at depth idx. All idx>0 are extent_blocks,
721 * otherwise it's the root_access function.
723 * I don't like the way this function's name looks next to
724 * ocfs2_journal_access_path(), but I don't have a better one.
726 int ocfs2_path_bh_journal_access(handle_t
*handle
,
727 struct ocfs2_caching_info
*ci
,
728 struct ocfs2_path
*path
,
731 ocfs2_journal_access_func access
= path_root_access(path
);
734 access
= ocfs2_journal_access
;
737 access
= ocfs2_journal_access_eb
;
739 return access(handle
, ci
, path
->p_node
[idx
].bh
,
740 OCFS2_JOURNAL_ACCESS_WRITE
);
744 * Convenience function to journal all components in a path.
746 int ocfs2_journal_access_path(struct ocfs2_caching_info
*ci
,
748 struct ocfs2_path
*path
)
755 for(i
= 0; i
< path_num_items(path
); i
++) {
756 ret
= ocfs2_path_bh_journal_access(handle
, ci
, path
, i
);
768 * Return the index of the extent record which contains cluster #v_cluster.
769 * -1 is returned if it was not found.
771 * Should work fine on interior and exterior nodes.
773 int ocfs2_search_extent_list(struct ocfs2_extent_list
*el
, u32 v_cluster
)
777 struct ocfs2_extent_rec
*rec
;
778 u32 rec_end
, rec_start
, clusters
;
780 for(i
= 0; i
< le16_to_cpu(el
->l_next_free_rec
); i
++) {
781 rec
= &el
->l_recs
[i
];
783 rec_start
= le32_to_cpu(rec
->e_cpos
);
784 clusters
= ocfs2_rec_clusters(el
, rec
);
786 rec_end
= rec_start
+ clusters
;
788 if (v_cluster
>= rec_start
&& v_cluster
< rec_end
) {
798 * NOTE: ocfs2_block_extent_contig(), ocfs2_extents_adjacent() and
799 * ocfs2_extent_rec_contig only work properly against leaf nodes!
801 static int ocfs2_block_extent_contig(struct super_block
*sb
,
802 struct ocfs2_extent_rec
*ext
,
805 u64 blk_end
= le64_to_cpu(ext
->e_blkno
);
807 blk_end
+= ocfs2_clusters_to_blocks(sb
,
808 le16_to_cpu(ext
->e_leaf_clusters
));
810 return blkno
== blk_end
;
813 static int ocfs2_extents_adjacent(struct ocfs2_extent_rec
*left
,
814 struct ocfs2_extent_rec
*right
)
818 left_range
= le32_to_cpu(left
->e_cpos
) +
819 le16_to_cpu(left
->e_leaf_clusters
);
821 return (left_range
== le32_to_cpu(right
->e_cpos
));
824 static enum ocfs2_contig_type
825 ocfs2_extent_rec_contig(struct super_block
*sb
,
826 struct ocfs2_extent_rec
*ext
,
827 struct ocfs2_extent_rec
*insert_rec
)
829 u64 blkno
= le64_to_cpu(insert_rec
->e_blkno
);
832 * Refuse to coalesce extent records with different flag
833 * fields - we don't want to mix unwritten extents with user
836 if (ext
->e_flags
!= insert_rec
->e_flags
)
839 if (ocfs2_extents_adjacent(ext
, insert_rec
) &&
840 ocfs2_block_extent_contig(sb
, ext
, blkno
))
843 blkno
= le64_to_cpu(ext
->e_blkno
);
844 if (ocfs2_extents_adjacent(insert_rec
, ext
) &&
845 ocfs2_block_extent_contig(sb
, insert_rec
, blkno
))
852 * NOTE: We can have pretty much any combination of contiguousness and
855 * The usefulness of APPEND_TAIL is more in that it lets us know that
856 * we'll have to update the path to that leaf.
858 enum ocfs2_append_type
{
863 enum ocfs2_split_type
{
869 struct ocfs2_insert_type
{
870 enum ocfs2_split_type ins_split
;
871 enum ocfs2_append_type ins_appending
;
872 enum ocfs2_contig_type ins_contig
;
873 int ins_contig_index
;
877 struct ocfs2_merge_ctxt
{
878 enum ocfs2_contig_type c_contig_type
;
879 int c_has_empty_extent
;
880 int c_split_covers_rec
;
883 static int ocfs2_validate_extent_block(struct super_block
*sb
,
884 struct buffer_head
*bh
)
887 struct ocfs2_extent_block
*eb
=
888 (struct ocfs2_extent_block
*)bh
->b_data
;
890 mlog(0, "Validating extent block %llu\n",
891 (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",
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 "
923 (unsigned long long)bh
->b_blocknr
,
924 (unsigned long long)le64_to_cpu(eb
->h_blkno
));
928 if (le32_to_cpu(eb
->h_fs_generation
) != OCFS2_SB(sb
)->fs_generation
) {
930 "Extent block #%llu has an invalid "
931 "h_fs_generation of #%u",
932 (unsigned long long)bh
->b_blocknr
,
933 le32_to_cpu(eb
->h_fs_generation
));
940 int ocfs2_read_extent_block(struct ocfs2_caching_info
*ci
, u64 eb_blkno
,
941 struct buffer_head
**bh
)
944 struct buffer_head
*tmp
= *bh
;
946 rc
= ocfs2_read_block(ci
, eb_blkno
, &tmp
,
947 ocfs2_validate_extent_block
);
949 /* If ocfs2_read_block() got us a new bh, pass it up. */
958 * How many free extents have we got before we need more meta data?
960 int ocfs2_num_free_extents(struct ocfs2_super
*osb
,
961 struct ocfs2_extent_tree
*et
)
964 struct ocfs2_extent_list
*el
= NULL
;
965 struct ocfs2_extent_block
*eb
;
966 struct buffer_head
*eb_bh
= NULL
;
972 last_eb_blk
= ocfs2_et_get_last_eb_blk(et
);
975 retval
= ocfs2_read_extent_block(et
->et_ci
, last_eb_blk
,
981 eb
= (struct ocfs2_extent_block
*) eb_bh
->b_data
;
985 BUG_ON(el
->l_tree_depth
!= 0);
987 retval
= le16_to_cpu(el
->l_count
) - le16_to_cpu(el
->l_next_free_rec
);
995 /* expects array to already be allocated
997 * sets h_signature, h_blkno, h_suballoc_bit, h_suballoc_slot, and
1000 static int ocfs2_create_new_meta_bhs(handle_t
*handle
,
1001 struct ocfs2_extent_tree
*et
,
1003 struct ocfs2_alloc_context
*meta_ac
,
1004 struct buffer_head
*bhs
[])
1006 int count
, status
, i
;
1007 u16 suballoc_bit_start
;
1010 struct ocfs2_super
*osb
=
1011 OCFS2_SB(ocfs2_metadata_cache_get_super(et
->et_ci
));
1012 struct ocfs2_extent_block
*eb
;
1017 while (count
< wanted
) {
1018 status
= ocfs2_claim_metadata(osb
,
1022 &suballoc_bit_start
,
1030 for(i
= count
; i
< (num_got
+ count
); i
++) {
1031 bhs
[i
] = sb_getblk(osb
->sb
, first_blkno
);
1032 if (bhs
[i
] == NULL
) {
1037 ocfs2_set_new_buffer_uptodate(et
->et_ci
, bhs
[i
]);
1039 status
= ocfs2_journal_access_eb(handle
, et
->et_ci
,
1041 OCFS2_JOURNAL_ACCESS_CREATE
);
1047 memset(bhs
[i
]->b_data
, 0, osb
->sb
->s_blocksize
);
1048 eb
= (struct ocfs2_extent_block
*) bhs
[i
]->b_data
;
1049 /* Ok, setup the minimal stuff here. */
1050 strcpy(eb
->h_signature
, OCFS2_EXTENT_BLOCK_SIGNATURE
);
1051 eb
->h_blkno
= cpu_to_le64(first_blkno
);
1052 eb
->h_fs_generation
= cpu_to_le32(osb
->fs_generation
);
1053 eb
->h_suballoc_slot
= cpu_to_le16(osb
->slot_num
);
1054 eb
->h_suballoc_bit
= cpu_to_le16(suballoc_bit_start
);
1055 eb
->h_list
.l_count
=
1056 cpu_to_le16(ocfs2_extent_recs_per_eb(osb
->sb
));
1058 suballoc_bit_start
++;
1061 /* We'll also be dirtied by the caller, so
1062 * this isn't absolutely necessary. */
1063 status
= ocfs2_journal_dirty(handle
, bhs
[i
]);
1076 for(i
= 0; i
< wanted
; i
++) {
1086 * Helper function for ocfs2_add_branch() and ocfs2_shift_tree_depth().
1088 * Returns the sum of the rightmost extent rec logical offset and
1091 * ocfs2_add_branch() uses this to determine what logical cluster
1092 * value should be populated into the leftmost new branch records.
1094 * ocfs2_shift_tree_depth() uses this to determine the # clusters
1095 * value for the new topmost tree record.
1097 static inline u32
ocfs2_sum_rightmost_rec(struct ocfs2_extent_list
*el
)
1101 i
= le16_to_cpu(el
->l_next_free_rec
) - 1;
1103 return le32_to_cpu(el
->l_recs
[i
].e_cpos
) +
1104 ocfs2_rec_clusters(el
, &el
->l_recs
[i
]);
1108 * Change range of the branches in the right most path according to the leaf
1109 * extent block's rightmost record.
1111 static int ocfs2_adjust_rightmost_branch(handle_t
*handle
,
1112 struct ocfs2_extent_tree
*et
)
1115 struct ocfs2_path
*path
= NULL
;
1116 struct ocfs2_extent_list
*el
;
1117 struct ocfs2_extent_rec
*rec
;
1119 path
= ocfs2_new_path_from_et(et
);
1125 status
= ocfs2_find_path(et
->et_ci
, path
, UINT_MAX
);
1131 status
= ocfs2_extend_trans(handle
, path_num_items(path
) +
1132 handle
->h_buffer_credits
);
1138 status
= ocfs2_journal_access_path(et
->et_ci
, handle
, path
);
1144 el
= path_leaf_el(path
);
1145 rec
= &el
->l_recs
[le32_to_cpu(el
->l_next_free_rec
) - 1];
1147 ocfs2_adjust_rightmost_records(handle
, et
, path
, rec
);
1150 ocfs2_free_path(path
);
1155 * Add an entire tree branch to our inode. eb_bh is the extent block
1156 * to start at, if we don't want to start the branch at the root
1159 * last_eb_bh is required as we have to update it's next_leaf pointer
1160 * for the new last extent block.
1162 * the new branch will be 'empty' in the sense that every block will
1163 * contain a single record with cluster count == 0.
1165 static int ocfs2_add_branch(handle_t
*handle
,
1166 struct ocfs2_extent_tree
*et
,
1167 struct buffer_head
*eb_bh
,
1168 struct buffer_head
**last_eb_bh
,
1169 struct ocfs2_alloc_context
*meta_ac
)
1171 int status
, new_blocks
, i
;
1172 u64 next_blkno
, new_last_eb_blk
;
1173 struct buffer_head
*bh
;
1174 struct buffer_head
**new_eb_bhs
= NULL
;
1175 struct ocfs2_extent_block
*eb
;
1176 struct ocfs2_extent_list
*eb_el
;
1177 struct ocfs2_extent_list
*el
;
1178 u32 new_cpos
, root_end
;
1182 BUG_ON(!last_eb_bh
|| !*last_eb_bh
);
1185 eb
= (struct ocfs2_extent_block
*) eb_bh
->b_data
;
1188 el
= et
->et_root_el
;
1190 /* we never add a branch to a leaf. */
1191 BUG_ON(!el
->l_tree_depth
);
1193 new_blocks
= le16_to_cpu(el
->l_tree_depth
);
1195 eb
= (struct ocfs2_extent_block
*)(*last_eb_bh
)->b_data
;
1196 new_cpos
= ocfs2_sum_rightmost_rec(&eb
->h_list
);
1197 root_end
= ocfs2_sum_rightmost_rec(et
->et_root_el
);
1200 * If there is a gap before the root end and the real end
1201 * of the righmost leaf block, we need to remove the gap
1202 * between new_cpos and root_end first so that the tree
1203 * is consistent after we add a new branch(it will start
1206 if (root_end
> new_cpos
) {
1207 mlog(0, "adjust the cluster end from %u to %u\n",
1208 root_end
, new_cpos
);
1209 status
= ocfs2_adjust_rightmost_branch(handle
, et
);
1216 /* allocate the number of new eb blocks we need */
1217 new_eb_bhs
= kcalloc(new_blocks
, sizeof(struct buffer_head
*),
1225 status
= ocfs2_create_new_meta_bhs(handle
, et
, new_blocks
,
1226 meta_ac
, new_eb_bhs
);
1232 /* Note: new_eb_bhs[new_blocks - 1] is the guy which will be
1233 * linked with the rest of the tree.
1234 * conversly, new_eb_bhs[0] is the new bottommost leaf.
1236 * when we leave the loop, new_last_eb_blk will point to the
1237 * newest leaf, and next_blkno will point to the topmost extent
1239 next_blkno
= new_last_eb_blk
= 0;
1240 for(i
= 0; i
< new_blocks
; i
++) {
1242 eb
= (struct ocfs2_extent_block
*) bh
->b_data
;
1243 /* ocfs2_create_new_meta_bhs() should create it right! */
1244 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb
));
1245 eb_el
= &eb
->h_list
;
1247 status
= ocfs2_journal_access_eb(handle
, et
->et_ci
, bh
,
1248 OCFS2_JOURNAL_ACCESS_CREATE
);
1254 eb
->h_next_leaf_blk
= 0;
1255 eb_el
->l_tree_depth
= cpu_to_le16(i
);
1256 eb_el
->l_next_free_rec
= cpu_to_le16(1);
1258 * This actually counts as an empty extent as
1261 eb_el
->l_recs
[0].e_cpos
= cpu_to_le32(new_cpos
);
1262 eb_el
->l_recs
[0].e_blkno
= cpu_to_le64(next_blkno
);
1264 * eb_el isn't always an interior node, but even leaf
1265 * nodes want a zero'd flags and reserved field so
1266 * this gets the whole 32 bits regardless of use.
1268 eb_el
->l_recs
[0].e_int_clusters
= cpu_to_le32(0);
1269 if (!eb_el
->l_tree_depth
)
1270 new_last_eb_blk
= le64_to_cpu(eb
->h_blkno
);
1272 status
= ocfs2_journal_dirty(handle
, bh
);
1278 next_blkno
= le64_to_cpu(eb
->h_blkno
);
1281 /* This is a bit hairy. We want to update up to three blocks
1282 * here without leaving any of them in an inconsistent state
1283 * in case of error. We don't have to worry about
1284 * journal_dirty erroring as it won't unless we've aborted the
1285 * handle (in which case we would never be here) so reserving
1286 * the write with journal_access is all we need to do. */
1287 status
= ocfs2_journal_access_eb(handle
, et
->et_ci
, *last_eb_bh
,
1288 OCFS2_JOURNAL_ACCESS_WRITE
);
1293 status
= ocfs2_et_root_journal_access(handle
, et
,
1294 OCFS2_JOURNAL_ACCESS_WRITE
);
1300 status
= ocfs2_journal_access_eb(handle
, et
->et_ci
, eb_bh
,
1301 OCFS2_JOURNAL_ACCESS_WRITE
);
1308 /* Link the new branch into the rest of the tree (el will
1309 * either be on the root_bh, or the extent block passed in. */
1310 i
= le16_to_cpu(el
->l_next_free_rec
);
1311 el
->l_recs
[i
].e_blkno
= cpu_to_le64(next_blkno
);
1312 el
->l_recs
[i
].e_cpos
= cpu_to_le32(new_cpos
);
1313 el
->l_recs
[i
].e_int_clusters
= 0;
1314 le16_add_cpu(&el
->l_next_free_rec
, 1);
1316 /* fe needs a new last extent block pointer, as does the
1317 * next_leaf on the previously last-extent-block. */
1318 ocfs2_et_set_last_eb_blk(et
, new_last_eb_blk
);
1320 eb
= (struct ocfs2_extent_block
*) (*last_eb_bh
)->b_data
;
1321 eb
->h_next_leaf_blk
= cpu_to_le64(new_last_eb_blk
);
1323 status
= ocfs2_journal_dirty(handle
, *last_eb_bh
);
1326 status
= ocfs2_journal_dirty(handle
, et
->et_root_bh
);
1330 status
= ocfs2_journal_dirty(handle
, eb_bh
);
1336 * Some callers want to track the rightmost leaf so pass it
1339 brelse(*last_eb_bh
);
1340 get_bh(new_eb_bhs
[0]);
1341 *last_eb_bh
= new_eb_bhs
[0];
1346 for (i
= 0; i
< new_blocks
; i
++)
1347 brelse(new_eb_bhs
[i
]);
1356 * adds another level to the allocation tree.
1357 * returns back the new extent block so you can add a branch to it
1360 static int ocfs2_shift_tree_depth(handle_t
*handle
,
1361 struct ocfs2_extent_tree
*et
,
1362 struct ocfs2_alloc_context
*meta_ac
,
1363 struct buffer_head
**ret_new_eb_bh
)
1367 struct buffer_head
*new_eb_bh
= NULL
;
1368 struct ocfs2_extent_block
*eb
;
1369 struct ocfs2_extent_list
*root_el
;
1370 struct ocfs2_extent_list
*eb_el
;
1374 status
= ocfs2_create_new_meta_bhs(handle
, et
, 1, meta_ac
,
1381 eb
= (struct ocfs2_extent_block
*) new_eb_bh
->b_data
;
1382 /* ocfs2_create_new_meta_bhs() should create it right! */
1383 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb
));
1385 eb_el
= &eb
->h_list
;
1386 root_el
= et
->et_root_el
;
1388 status
= ocfs2_journal_access_eb(handle
, et
->et_ci
, new_eb_bh
,
1389 OCFS2_JOURNAL_ACCESS_CREATE
);
1395 /* copy the root extent list data into the new extent block */
1396 eb_el
->l_tree_depth
= root_el
->l_tree_depth
;
1397 eb_el
->l_next_free_rec
= root_el
->l_next_free_rec
;
1398 for (i
= 0; i
< le16_to_cpu(root_el
->l_next_free_rec
); i
++)
1399 eb_el
->l_recs
[i
] = root_el
->l_recs
[i
];
1401 status
= ocfs2_journal_dirty(handle
, new_eb_bh
);
1407 status
= ocfs2_et_root_journal_access(handle
, et
,
1408 OCFS2_JOURNAL_ACCESS_WRITE
);
1414 new_clusters
= ocfs2_sum_rightmost_rec(eb_el
);
1416 /* update root_bh now */
1417 le16_add_cpu(&root_el
->l_tree_depth
, 1);
1418 root_el
->l_recs
[0].e_cpos
= 0;
1419 root_el
->l_recs
[0].e_blkno
= eb
->h_blkno
;
1420 root_el
->l_recs
[0].e_int_clusters
= cpu_to_le32(new_clusters
);
1421 for (i
= 1; i
< le16_to_cpu(root_el
->l_next_free_rec
); i
++)
1422 memset(&root_el
->l_recs
[i
], 0, sizeof(struct ocfs2_extent_rec
));
1423 root_el
->l_next_free_rec
= cpu_to_le16(1);
1425 /* If this is our 1st tree depth shift, then last_eb_blk
1426 * becomes the allocated extent block */
1427 if (root_el
->l_tree_depth
== cpu_to_le16(1))
1428 ocfs2_et_set_last_eb_blk(et
, le64_to_cpu(eb
->h_blkno
));
1430 status
= ocfs2_journal_dirty(handle
, et
->et_root_bh
);
1436 *ret_new_eb_bh
= new_eb_bh
;
1447 * Should only be called when there is no space left in any of the
1448 * leaf nodes. What we want to do is find the lowest tree depth
1449 * non-leaf extent block with room for new records. There are three
1450 * valid results of this search:
1452 * 1) a lowest extent block is found, then we pass it back in
1453 * *lowest_eb_bh and return '0'
1455 * 2) the search fails to find anything, but the root_el has room. We
1456 * pass NULL back in *lowest_eb_bh, but still return '0'
1458 * 3) the search fails to find anything AND the root_el is full, in
1459 * which case we return > 0
1461 * return status < 0 indicates an error.
1463 static int ocfs2_find_branch_target(struct ocfs2_extent_tree
*et
,
1464 struct buffer_head
**target_bh
)
1468 struct ocfs2_extent_block
*eb
;
1469 struct ocfs2_extent_list
*el
;
1470 struct buffer_head
*bh
= NULL
;
1471 struct buffer_head
*lowest_bh
= NULL
;
1477 el
= et
->et_root_el
;
1479 while(le16_to_cpu(el
->l_tree_depth
) > 1) {
1480 if (le16_to_cpu(el
->l_next_free_rec
) == 0) {
1481 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
1482 "Owner %llu has empty "
1483 "extent list (next_free_rec == 0)",
1484 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
));
1488 i
= le16_to_cpu(el
->l_next_free_rec
) - 1;
1489 blkno
= le64_to_cpu(el
->l_recs
[i
].e_blkno
);
1491 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
1492 "Owner %llu has extent "
1493 "list where extent # %d has no physical "
1495 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
), i
);
1503 status
= ocfs2_read_extent_block(et
->et_ci
, blkno
, &bh
);
1509 eb
= (struct ocfs2_extent_block
*) bh
->b_data
;
1512 if (le16_to_cpu(el
->l_next_free_rec
) <
1513 le16_to_cpu(el
->l_count
)) {
1520 /* If we didn't find one and the fe doesn't have any room,
1521 * then return '1' */
1522 el
= et
->et_root_el
;
1523 if (!lowest_bh
&& (el
->l_next_free_rec
== el
->l_count
))
1526 *target_bh
= lowest_bh
;
1535 * Grow a b-tree so that it has more records.
1537 * We might shift the tree depth in which case existing paths should
1538 * be considered invalid.
1540 * Tree depth after the grow is returned via *final_depth.
1542 * *last_eb_bh will be updated by ocfs2_add_branch().
1544 static int ocfs2_grow_tree(handle_t
*handle
, struct ocfs2_extent_tree
*et
,
1545 int *final_depth
, struct buffer_head
**last_eb_bh
,
1546 struct ocfs2_alloc_context
*meta_ac
)
1549 struct ocfs2_extent_list
*el
= et
->et_root_el
;
1550 int depth
= le16_to_cpu(el
->l_tree_depth
);
1551 struct buffer_head
*bh
= NULL
;
1553 BUG_ON(meta_ac
== NULL
);
1555 shift
= ocfs2_find_branch_target(et
, &bh
);
1562 /* We traveled all the way to the bottom of the allocation tree
1563 * and didn't find room for any more extents - we need to add
1564 * another tree level */
1567 mlog(0, "need to shift tree depth (current = %d)\n", depth
);
1569 /* ocfs2_shift_tree_depth will return us a buffer with
1570 * the new extent block (so we can pass that to
1571 * ocfs2_add_branch). */
1572 ret
= ocfs2_shift_tree_depth(handle
, et
, meta_ac
, &bh
);
1580 * Special case: we have room now if we shifted from
1581 * tree_depth 0, so no more work needs to be done.
1583 * We won't be calling add_branch, so pass
1584 * back *last_eb_bh as the new leaf. At depth
1585 * zero, it should always be null so there's
1586 * no reason to brelse.
1588 BUG_ON(*last_eb_bh
);
1595 /* call ocfs2_add_branch to add the final part of the tree with
1597 mlog(0, "add branch. bh = %p\n", bh
);
1598 ret
= ocfs2_add_branch(handle
, et
, bh
, last_eb_bh
,
1607 *final_depth
= depth
;
1613 * This function will discard the rightmost extent record.
1615 static void ocfs2_shift_records_right(struct ocfs2_extent_list
*el
)
1617 int next_free
= le16_to_cpu(el
->l_next_free_rec
);
1618 int count
= le16_to_cpu(el
->l_count
);
1619 unsigned int num_bytes
;
1622 /* This will cause us to go off the end of our extent list. */
1623 BUG_ON(next_free
>= count
);
1625 num_bytes
= sizeof(struct ocfs2_extent_rec
) * next_free
;
1627 memmove(&el
->l_recs
[1], &el
->l_recs
[0], num_bytes
);
1630 static void ocfs2_rotate_leaf(struct ocfs2_extent_list
*el
,
1631 struct ocfs2_extent_rec
*insert_rec
)
1633 int i
, insert_index
, next_free
, has_empty
, num_bytes
;
1634 u32 insert_cpos
= le32_to_cpu(insert_rec
->e_cpos
);
1635 struct ocfs2_extent_rec
*rec
;
1637 next_free
= le16_to_cpu(el
->l_next_free_rec
);
1638 has_empty
= ocfs2_is_empty_extent(&el
->l_recs
[0]);
1642 /* The tree code before us didn't allow enough room in the leaf. */
1643 BUG_ON(el
->l_next_free_rec
== el
->l_count
&& !has_empty
);
1646 * The easiest way to approach this is to just remove the
1647 * empty extent and temporarily decrement next_free.
1651 * If next_free was 1 (only an empty extent), this
1652 * loop won't execute, which is fine. We still want
1653 * the decrement above to happen.
1655 for(i
= 0; i
< (next_free
- 1); i
++)
1656 el
->l_recs
[i
] = el
->l_recs
[i
+1];
1662 * Figure out what the new record index should be.
1664 for(i
= 0; i
< next_free
; i
++) {
1665 rec
= &el
->l_recs
[i
];
1667 if (insert_cpos
< le32_to_cpu(rec
->e_cpos
))
1672 mlog(0, "ins %u: index %d, has_empty %d, next_free %d, count %d\n",
1673 insert_cpos
, insert_index
, has_empty
, next_free
, le16_to_cpu(el
->l_count
));
1675 BUG_ON(insert_index
< 0);
1676 BUG_ON(insert_index
>= le16_to_cpu(el
->l_count
));
1677 BUG_ON(insert_index
> next_free
);
1680 * No need to memmove if we're just adding to the tail.
1682 if (insert_index
!= next_free
) {
1683 BUG_ON(next_free
>= le16_to_cpu(el
->l_count
));
1685 num_bytes
= next_free
- insert_index
;
1686 num_bytes
*= sizeof(struct ocfs2_extent_rec
);
1687 memmove(&el
->l_recs
[insert_index
+ 1],
1688 &el
->l_recs
[insert_index
],
1693 * Either we had an empty extent, and need to re-increment or
1694 * there was no empty extent on a non full rightmost leaf node,
1695 * in which case we still need to increment.
1698 el
->l_next_free_rec
= cpu_to_le16(next_free
);
1700 * Make sure none of the math above just messed up our tree.
1702 BUG_ON(le16_to_cpu(el
->l_next_free_rec
) > le16_to_cpu(el
->l_count
));
1704 el
->l_recs
[insert_index
] = *insert_rec
;
1708 static void ocfs2_remove_empty_extent(struct ocfs2_extent_list
*el
)
1710 int size
, num_recs
= le16_to_cpu(el
->l_next_free_rec
);
1712 BUG_ON(num_recs
== 0);
1714 if (ocfs2_is_empty_extent(&el
->l_recs
[0])) {
1716 size
= num_recs
* sizeof(struct ocfs2_extent_rec
);
1717 memmove(&el
->l_recs
[0], &el
->l_recs
[1], size
);
1718 memset(&el
->l_recs
[num_recs
], 0,
1719 sizeof(struct ocfs2_extent_rec
));
1720 el
->l_next_free_rec
= cpu_to_le16(num_recs
);
1725 * Create an empty extent record .
1727 * l_next_free_rec may be updated.
1729 * If an empty extent already exists do nothing.
1731 static void ocfs2_create_empty_extent(struct ocfs2_extent_list
*el
)
1733 int next_free
= le16_to_cpu(el
->l_next_free_rec
);
1735 BUG_ON(le16_to_cpu(el
->l_tree_depth
) != 0);
1740 if (ocfs2_is_empty_extent(&el
->l_recs
[0]))
1743 mlog_bug_on_msg(el
->l_count
== el
->l_next_free_rec
,
1744 "Asked to create an empty extent in a full list:\n"
1745 "count = %u, tree depth = %u",
1746 le16_to_cpu(el
->l_count
),
1747 le16_to_cpu(el
->l_tree_depth
));
1749 ocfs2_shift_records_right(el
);
1752 le16_add_cpu(&el
->l_next_free_rec
, 1);
1753 memset(&el
->l_recs
[0], 0, sizeof(struct ocfs2_extent_rec
));
1757 * For a rotation which involves two leaf nodes, the "root node" is
1758 * the lowest level tree node which contains a path to both leafs. This
1759 * resulting set of information can be used to form a complete "subtree"
1761 * This function is passed two full paths from the dinode down to a
1762 * pair of adjacent leaves. It's task is to figure out which path
1763 * index contains the subtree root - this can be the root index itself
1764 * in a worst-case rotation.
1766 * The array index of the subtree root is passed back.
1768 static int ocfs2_find_subtree_root(struct ocfs2_extent_tree
*et
,
1769 struct ocfs2_path
*left
,
1770 struct ocfs2_path
*right
)
1775 * Check that the caller passed in two paths from the same tree.
1777 BUG_ON(path_root_bh(left
) != path_root_bh(right
));
1783 * The caller didn't pass two adjacent paths.
1785 mlog_bug_on_msg(i
> left
->p_tree_depth
,
1786 "Owner %llu, left depth %u, right depth %u\n"
1787 "left leaf blk %llu, right leaf blk %llu\n",
1788 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
1789 left
->p_tree_depth
, right
->p_tree_depth
,
1790 (unsigned long long)path_leaf_bh(left
)->b_blocknr
,
1791 (unsigned long long)path_leaf_bh(right
)->b_blocknr
);
1792 } while (left
->p_node
[i
].bh
->b_blocknr
==
1793 right
->p_node
[i
].bh
->b_blocknr
);
1798 typedef void (path_insert_t
)(void *, struct buffer_head
*);
1801 * Traverse a btree path in search of cpos, starting at root_el.
1803 * This code can be called with a cpos larger than the tree, in which
1804 * case it will return the rightmost path.
1806 static int __ocfs2_find_path(struct ocfs2_caching_info
*ci
,
1807 struct ocfs2_extent_list
*root_el
, u32 cpos
,
1808 path_insert_t
*func
, void *data
)
1813 struct buffer_head
*bh
= NULL
;
1814 struct ocfs2_extent_block
*eb
;
1815 struct ocfs2_extent_list
*el
;
1816 struct ocfs2_extent_rec
*rec
;
1819 while (el
->l_tree_depth
) {
1820 if (le16_to_cpu(el
->l_next_free_rec
) == 0) {
1821 ocfs2_error(ocfs2_metadata_cache_get_super(ci
),
1822 "Owner %llu has empty extent list at "
1824 (unsigned long long)ocfs2_metadata_cache_owner(ci
),
1825 le16_to_cpu(el
->l_tree_depth
));
1831 for(i
= 0; i
< le16_to_cpu(el
->l_next_free_rec
) - 1; i
++) {
1832 rec
= &el
->l_recs
[i
];
1835 * In the case that cpos is off the allocation
1836 * tree, this should just wind up returning the
1839 range
= le32_to_cpu(rec
->e_cpos
) +
1840 ocfs2_rec_clusters(el
, rec
);
1841 if (cpos
>= le32_to_cpu(rec
->e_cpos
) && cpos
< range
)
1845 blkno
= le64_to_cpu(el
->l_recs
[i
].e_blkno
);
1847 ocfs2_error(ocfs2_metadata_cache_get_super(ci
),
1848 "Owner %llu has bad blkno in extent list "
1849 "at depth %u (index %d)\n",
1850 (unsigned long long)ocfs2_metadata_cache_owner(ci
),
1851 le16_to_cpu(el
->l_tree_depth
), i
);
1858 ret
= ocfs2_read_extent_block(ci
, blkno
, &bh
);
1864 eb
= (struct ocfs2_extent_block
*) bh
->b_data
;
1867 if (le16_to_cpu(el
->l_next_free_rec
) >
1868 le16_to_cpu(el
->l_count
)) {
1869 ocfs2_error(ocfs2_metadata_cache_get_super(ci
),
1870 "Owner %llu has bad count in extent list "
1871 "at block %llu (next free=%u, count=%u)\n",
1872 (unsigned long long)ocfs2_metadata_cache_owner(ci
),
1873 (unsigned long long)bh
->b_blocknr
,
1874 le16_to_cpu(el
->l_next_free_rec
),
1875 le16_to_cpu(el
->l_count
));
1886 * Catch any trailing bh that the loop didn't handle.
1894 * Given an initialized path (that is, it has a valid root extent
1895 * list), this function will traverse the btree in search of the path
1896 * which would contain cpos.
1898 * The path traveled is recorded in the path structure.
1900 * Note that this will not do any comparisons on leaf node extent
1901 * records, so it will work fine in the case that we just added a tree
1904 struct find_path_data
{
1906 struct ocfs2_path
*path
;
1908 static void find_path_ins(void *data
, struct buffer_head
*bh
)
1910 struct find_path_data
*fp
= data
;
1913 ocfs2_path_insert_eb(fp
->path
, fp
->index
, bh
);
1916 int ocfs2_find_path(struct ocfs2_caching_info
*ci
,
1917 struct ocfs2_path
*path
, u32 cpos
)
1919 struct find_path_data data
;
1923 return __ocfs2_find_path(ci
, path_root_el(path
), cpos
,
1924 find_path_ins
, &data
);
1927 static void find_leaf_ins(void *data
, struct buffer_head
*bh
)
1929 struct ocfs2_extent_block
*eb
=(struct ocfs2_extent_block
*)bh
->b_data
;
1930 struct ocfs2_extent_list
*el
= &eb
->h_list
;
1931 struct buffer_head
**ret
= data
;
1933 /* We want to retain only the leaf block. */
1934 if (le16_to_cpu(el
->l_tree_depth
) == 0) {
1940 * Find the leaf block in the tree which would contain cpos. No
1941 * checking of the actual leaf is done.
1943 * Some paths want to call this instead of allocating a path structure
1944 * and calling ocfs2_find_path().
1946 * This function doesn't handle non btree extent lists.
1948 int ocfs2_find_leaf(struct ocfs2_caching_info
*ci
,
1949 struct ocfs2_extent_list
*root_el
, u32 cpos
,
1950 struct buffer_head
**leaf_bh
)
1953 struct buffer_head
*bh
= NULL
;
1955 ret
= __ocfs2_find_path(ci
, root_el
, cpos
, find_leaf_ins
, &bh
);
1967 * Adjust the adjacent records (left_rec, right_rec) involved in a rotation.
1969 * Basically, we've moved stuff around at the bottom of the tree and
1970 * we need to fix up the extent records above the changes to reflect
1973 * left_rec: the record on the left.
1974 * left_child_el: is the child list pointed to by left_rec
1975 * right_rec: the record to the right of left_rec
1976 * right_child_el: is the child list pointed to by right_rec
1978 * By definition, this only works on interior nodes.
1980 static void ocfs2_adjust_adjacent_records(struct ocfs2_extent_rec
*left_rec
,
1981 struct ocfs2_extent_list
*left_child_el
,
1982 struct ocfs2_extent_rec
*right_rec
,
1983 struct ocfs2_extent_list
*right_child_el
)
1985 u32 left_clusters
, right_end
;
1988 * Interior nodes never have holes. Their cpos is the cpos of
1989 * the leftmost record in their child list. Their cluster
1990 * count covers the full theoretical range of their child list
1991 * - the range between their cpos and the cpos of the record
1992 * immediately to their right.
1994 left_clusters
= le32_to_cpu(right_child_el
->l_recs
[0].e_cpos
);
1995 if (!ocfs2_rec_clusters(right_child_el
, &right_child_el
->l_recs
[0])) {
1996 BUG_ON(right_child_el
->l_tree_depth
);
1997 BUG_ON(le16_to_cpu(right_child_el
->l_next_free_rec
) <= 1);
1998 left_clusters
= le32_to_cpu(right_child_el
->l_recs
[1].e_cpos
);
2000 left_clusters
-= le32_to_cpu(left_rec
->e_cpos
);
2001 left_rec
->e_int_clusters
= cpu_to_le32(left_clusters
);
2004 * Calculate the rightmost cluster count boundary before
2005 * moving cpos - we will need to adjust clusters after
2006 * updating e_cpos to keep the same highest cluster count.
2008 right_end
= le32_to_cpu(right_rec
->e_cpos
);
2009 right_end
+= le32_to_cpu(right_rec
->e_int_clusters
);
2011 right_rec
->e_cpos
= left_rec
->e_cpos
;
2012 le32_add_cpu(&right_rec
->e_cpos
, left_clusters
);
2014 right_end
-= le32_to_cpu(right_rec
->e_cpos
);
2015 right_rec
->e_int_clusters
= cpu_to_le32(right_end
);
2019 * Adjust the adjacent root node records involved in a
2020 * rotation. left_el_blkno is passed in as a key so that we can easily
2021 * find it's index in the root list.
2023 static void ocfs2_adjust_root_records(struct ocfs2_extent_list
*root_el
,
2024 struct ocfs2_extent_list
*left_el
,
2025 struct ocfs2_extent_list
*right_el
,
2030 BUG_ON(le16_to_cpu(root_el
->l_tree_depth
) <=
2031 le16_to_cpu(left_el
->l_tree_depth
));
2033 for(i
= 0; i
< le16_to_cpu(root_el
->l_next_free_rec
) - 1; i
++) {
2034 if (le64_to_cpu(root_el
->l_recs
[i
].e_blkno
) == left_el_blkno
)
2039 * The path walking code should have never returned a root and
2040 * two paths which are not adjacent.
2042 BUG_ON(i
>= (le16_to_cpu(root_el
->l_next_free_rec
) - 1));
2044 ocfs2_adjust_adjacent_records(&root_el
->l_recs
[i
], left_el
,
2045 &root_el
->l_recs
[i
+ 1], right_el
);
2049 * We've changed a leaf block (in right_path) and need to reflect that
2050 * change back up the subtree.
2052 * This happens in multiple places:
2053 * - When we've moved an extent record from the left path leaf to the right
2054 * path leaf to make room for an empty extent in the left path leaf.
2055 * - When our insert into the right path leaf is at the leftmost edge
2056 * and requires an update of the path immediately to it's left. This
2057 * can occur at the end of some types of rotation and appending inserts.
2058 * - When we've adjusted the last extent record in the left path leaf and the
2059 * 1st extent record in the right path leaf during cross extent block merge.
2061 static void ocfs2_complete_edge_insert(handle_t
*handle
,
2062 struct ocfs2_path
*left_path
,
2063 struct ocfs2_path
*right_path
,
2067 struct ocfs2_extent_list
*el
, *left_el
, *right_el
;
2068 struct ocfs2_extent_rec
*left_rec
, *right_rec
;
2069 struct buffer_head
*root_bh
= left_path
->p_node
[subtree_index
].bh
;
2072 * Update the counts and position values within all the
2073 * interior nodes to reflect the leaf rotation we just did.
2075 * The root node is handled below the loop.
2077 * We begin the loop with right_el and left_el pointing to the
2078 * leaf lists and work our way up.
2080 * NOTE: within this loop, left_el and right_el always refer
2081 * to the *child* lists.
2083 left_el
= path_leaf_el(left_path
);
2084 right_el
= path_leaf_el(right_path
);
2085 for(i
= left_path
->p_tree_depth
- 1; i
> subtree_index
; i
--) {
2086 mlog(0, "Adjust records at index %u\n", i
);
2089 * One nice property of knowing that all of these
2090 * nodes are below the root is that we only deal with
2091 * the leftmost right node record and the rightmost
2094 el
= left_path
->p_node
[i
].el
;
2095 idx
= le16_to_cpu(left_el
->l_next_free_rec
) - 1;
2096 left_rec
= &el
->l_recs
[idx
];
2098 el
= right_path
->p_node
[i
].el
;
2099 right_rec
= &el
->l_recs
[0];
2101 ocfs2_adjust_adjacent_records(left_rec
, left_el
, right_rec
,
2104 ret
= ocfs2_journal_dirty(handle
, left_path
->p_node
[i
].bh
);
2108 ret
= ocfs2_journal_dirty(handle
, right_path
->p_node
[i
].bh
);
2113 * Setup our list pointers now so that the current
2114 * parents become children in the next iteration.
2116 left_el
= left_path
->p_node
[i
].el
;
2117 right_el
= right_path
->p_node
[i
].el
;
2121 * At the root node, adjust the two adjacent records which
2122 * begin our path to the leaves.
2125 el
= left_path
->p_node
[subtree_index
].el
;
2126 left_el
= left_path
->p_node
[subtree_index
+ 1].el
;
2127 right_el
= right_path
->p_node
[subtree_index
+ 1].el
;
2129 ocfs2_adjust_root_records(el
, left_el
, right_el
,
2130 left_path
->p_node
[subtree_index
+ 1].bh
->b_blocknr
);
2132 root_bh
= left_path
->p_node
[subtree_index
].bh
;
2134 ret
= ocfs2_journal_dirty(handle
, root_bh
);
2139 static int ocfs2_rotate_subtree_right(handle_t
*handle
,
2140 struct ocfs2_extent_tree
*et
,
2141 struct ocfs2_path
*left_path
,
2142 struct ocfs2_path
*right_path
,
2146 struct buffer_head
*right_leaf_bh
;
2147 struct buffer_head
*left_leaf_bh
= NULL
;
2148 struct buffer_head
*root_bh
;
2149 struct ocfs2_extent_list
*right_el
, *left_el
;
2150 struct ocfs2_extent_rec move_rec
;
2152 left_leaf_bh
= path_leaf_bh(left_path
);
2153 left_el
= path_leaf_el(left_path
);
2155 if (left_el
->l_next_free_rec
!= left_el
->l_count
) {
2156 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
2157 "Inode %llu has non-full interior leaf node %llu"
2159 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
2160 (unsigned long long)left_leaf_bh
->b_blocknr
,
2161 le16_to_cpu(left_el
->l_next_free_rec
));
2166 * This extent block may already have an empty record, so we
2167 * return early if so.
2169 if (ocfs2_is_empty_extent(&left_el
->l_recs
[0]))
2172 root_bh
= left_path
->p_node
[subtree_index
].bh
;
2173 BUG_ON(root_bh
!= right_path
->p_node
[subtree_index
].bh
);
2175 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, right_path
,
2182 for(i
= subtree_index
+ 1; i
< path_num_items(right_path
); i
++) {
2183 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
2190 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
2198 right_leaf_bh
= path_leaf_bh(right_path
);
2199 right_el
= path_leaf_el(right_path
);
2201 /* This is a code error, not a disk corruption. */
2202 mlog_bug_on_msg(!right_el
->l_next_free_rec
, "Inode %llu: Rotate fails "
2203 "because rightmost leaf block %llu is empty\n",
2204 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
2205 (unsigned long long)right_leaf_bh
->b_blocknr
);
2207 ocfs2_create_empty_extent(right_el
);
2209 ret
= ocfs2_journal_dirty(handle
, right_leaf_bh
);
2215 /* Do the copy now. */
2216 i
= le16_to_cpu(left_el
->l_next_free_rec
) - 1;
2217 move_rec
= left_el
->l_recs
[i
];
2218 right_el
->l_recs
[0] = move_rec
;
2221 * Clear out the record we just copied and shift everything
2222 * over, leaving an empty extent in the left leaf.
2224 * We temporarily subtract from next_free_rec so that the
2225 * shift will lose the tail record (which is now defunct).
2227 le16_add_cpu(&left_el
->l_next_free_rec
, -1);
2228 ocfs2_shift_records_right(left_el
);
2229 memset(&left_el
->l_recs
[0], 0, sizeof(struct ocfs2_extent_rec
));
2230 le16_add_cpu(&left_el
->l_next_free_rec
, 1);
2232 ret
= ocfs2_journal_dirty(handle
, left_leaf_bh
);
2238 ocfs2_complete_edge_insert(handle
, left_path
, right_path
,
2246 * Given a full path, determine what cpos value would return us a path
2247 * containing the leaf immediately to the left of the current one.
2249 * Will return zero if the path passed in is already the leftmost path.
2251 static int ocfs2_find_cpos_for_left_leaf(struct super_block
*sb
,
2252 struct ocfs2_path
*path
, u32
*cpos
)
2256 struct ocfs2_extent_list
*el
;
2258 BUG_ON(path
->p_tree_depth
== 0);
2262 blkno
= path_leaf_bh(path
)->b_blocknr
;
2264 /* Start at the tree node just above the leaf and work our way up. */
2265 i
= path
->p_tree_depth
- 1;
2267 el
= path
->p_node
[i
].el
;
2270 * Find the extent record just before the one in our
2273 for(j
= 0; j
< le16_to_cpu(el
->l_next_free_rec
); j
++) {
2274 if (le64_to_cpu(el
->l_recs
[j
].e_blkno
) == blkno
) {
2278 * We've determined that the
2279 * path specified is already
2280 * the leftmost one - return a
2286 * The leftmost record points to our
2287 * leaf - we need to travel up the
2293 *cpos
= le32_to_cpu(el
->l_recs
[j
- 1].e_cpos
);
2294 *cpos
= *cpos
+ ocfs2_rec_clusters(el
,
2295 &el
->l_recs
[j
- 1]);
2302 * If we got here, we never found a valid node where
2303 * the tree indicated one should be.
2306 "Invalid extent tree at extent block %llu\n",
2307 (unsigned long long)blkno
);
2312 blkno
= path
->p_node
[i
].bh
->b_blocknr
;
2321 * Extend the transaction by enough credits to complete the rotation,
2322 * and still leave at least the original number of credits allocated
2323 * to this transaction.
2325 static int ocfs2_extend_rotate_transaction(handle_t
*handle
, int subtree_depth
,
2327 struct ocfs2_path
*path
)
2329 int credits
= (path
->p_tree_depth
- subtree_depth
) * 2 + 1 + op_credits
;
2331 if (handle
->h_buffer_credits
< credits
)
2332 return ocfs2_extend_trans(handle
, credits
);
2338 * Trap the case where we're inserting into the theoretical range past
2339 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2340 * whose cpos is less than ours into the right leaf.
2342 * It's only necessary to look at the rightmost record of the left
2343 * leaf because the logic that calls us should ensure that the
2344 * theoretical ranges in the path components above the leaves are
2347 static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path
*left_path
,
2350 struct ocfs2_extent_list
*left_el
;
2351 struct ocfs2_extent_rec
*rec
;
2354 left_el
= path_leaf_el(left_path
);
2355 next_free
= le16_to_cpu(left_el
->l_next_free_rec
);
2356 rec
= &left_el
->l_recs
[next_free
- 1];
2358 if (insert_cpos
> le32_to_cpu(rec
->e_cpos
))
2363 static int ocfs2_leftmost_rec_contains(struct ocfs2_extent_list
*el
, u32 cpos
)
2365 int next_free
= le16_to_cpu(el
->l_next_free_rec
);
2367 struct ocfs2_extent_rec
*rec
;
2372 rec
= &el
->l_recs
[0];
2373 if (ocfs2_is_empty_extent(rec
)) {
2377 rec
= &el
->l_recs
[1];
2380 range
= le32_to_cpu(rec
->e_cpos
) + ocfs2_rec_clusters(el
, rec
);
2381 if (cpos
>= le32_to_cpu(rec
->e_cpos
) && cpos
< range
)
2387 * Rotate all the records in a btree right one record, starting at insert_cpos.
2389 * The path to the rightmost leaf should be passed in.
2391 * The array is assumed to be large enough to hold an entire path (tree depth).
2393 * Upon succesful return from this function:
2395 * - The 'right_path' array will contain a path to the leaf block
2396 * whose range contains e_cpos.
2397 * - That leaf block will have a single empty extent in list index 0.
2398 * - In the case that the rotation requires a post-insert update,
2399 * *ret_left_path will contain a valid path which can be passed to
2400 * ocfs2_insert_path().
2402 static int ocfs2_rotate_tree_right(handle_t
*handle
,
2403 struct ocfs2_extent_tree
*et
,
2404 enum ocfs2_split_type split
,
2406 struct ocfs2_path
*right_path
,
2407 struct ocfs2_path
**ret_left_path
)
2409 int ret
, start
, orig_credits
= handle
->h_buffer_credits
;
2411 struct ocfs2_path
*left_path
= NULL
;
2412 struct super_block
*sb
= ocfs2_metadata_cache_get_super(et
->et_ci
);
2414 *ret_left_path
= NULL
;
2416 left_path
= ocfs2_new_path_from_path(right_path
);
2423 ret
= ocfs2_find_cpos_for_left_leaf(sb
, right_path
, &cpos
);
2429 mlog(0, "Insert: %u, first left path cpos: %u\n", insert_cpos
, cpos
);
2432 * What we want to do here is:
2434 * 1) Start with the rightmost path.
2436 * 2) Determine a path to the leaf block directly to the left
2439 * 3) Determine the 'subtree root' - the lowest level tree node
2440 * which contains a path to both leaves.
2442 * 4) Rotate the subtree.
2444 * 5) Find the next subtree by considering the left path to be
2445 * the new right path.
2447 * The check at the top of this while loop also accepts
2448 * insert_cpos == cpos because cpos is only a _theoretical_
2449 * value to get us the left path - insert_cpos might very well
2450 * be filling that hole.
2452 * Stop at a cpos of '0' because we either started at the
2453 * leftmost branch (i.e., a tree with one branch and a
2454 * rotation inside of it), or we've gone as far as we can in
2455 * rotating subtrees.
2457 while (cpos
&& insert_cpos
<= cpos
) {
2458 mlog(0, "Rotating a tree: ins. cpos: %u, left path cpos: %u\n",
2461 ret
= ocfs2_find_path(et
->et_ci
, left_path
, cpos
);
2467 mlog_bug_on_msg(path_leaf_bh(left_path
) ==
2468 path_leaf_bh(right_path
),
2469 "Owner %llu: error during insert of %u "
2470 "(left path cpos %u) results in two identical "
2471 "paths ending at %llu\n",
2472 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
2474 (unsigned long long)
2475 path_leaf_bh(left_path
)->b_blocknr
);
2477 if (split
== SPLIT_NONE
&&
2478 ocfs2_rotate_requires_path_adjustment(left_path
,
2482 * We've rotated the tree as much as we
2483 * should. The rest is up to
2484 * ocfs2_insert_path() to complete, after the
2485 * record insertion. We indicate this
2486 * situation by returning the left path.
2488 * The reason we don't adjust the records here
2489 * before the record insert is that an error
2490 * later might break the rule where a parent
2491 * record e_cpos will reflect the actual
2492 * e_cpos of the 1st nonempty record of the
2495 *ret_left_path
= left_path
;
2499 start
= ocfs2_find_subtree_root(et
, left_path
, right_path
);
2501 mlog(0, "Subtree root at index %d (blk %llu, depth %d)\n",
2503 (unsigned long long) right_path
->p_node
[start
].bh
->b_blocknr
,
2504 right_path
->p_tree_depth
);
2506 ret
= ocfs2_extend_rotate_transaction(handle
, start
,
2507 orig_credits
, right_path
);
2513 ret
= ocfs2_rotate_subtree_right(handle
, et
, left_path
,
2520 if (split
!= SPLIT_NONE
&&
2521 ocfs2_leftmost_rec_contains(path_leaf_el(right_path
),
2524 * A rotate moves the rightmost left leaf
2525 * record over to the leftmost right leaf
2526 * slot. If we're doing an extent split
2527 * instead of a real insert, then we have to
2528 * check that the extent to be split wasn't
2529 * just moved over. If it was, then we can
2530 * exit here, passing left_path back -
2531 * ocfs2_split_extent() is smart enough to
2532 * search both leaves.
2534 *ret_left_path
= left_path
;
2539 * There is no need to re-read the next right path
2540 * as we know that it'll be our current left
2541 * path. Optimize by copying values instead.
2543 ocfs2_mv_path(right_path
, left_path
);
2545 ret
= ocfs2_find_cpos_for_left_leaf(sb
, right_path
, &cpos
);
2553 ocfs2_free_path(left_path
);
2559 static int ocfs2_update_edge_lengths(handle_t
*handle
,
2560 struct ocfs2_extent_tree
*et
,
2561 int subtree_index
, struct ocfs2_path
*path
)
2564 struct ocfs2_extent_rec
*rec
;
2565 struct ocfs2_extent_list
*el
;
2566 struct ocfs2_extent_block
*eb
;
2570 * In normal tree rotation process, we will never touch the
2571 * tree branch above subtree_index and ocfs2_extend_rotate_transaction
2572 * doesn't reserve the credits for them either.
2574 * But we do have a special case here which will update the rightmost
2575 * records for all the bh in the path.
2576 * So we have to allocate extra credits and access them.
2578 ret
= ocfs2_extend_trans(handle
,
2579 handle
->h_buffer_credits
+ subtree_index
);
2585 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, path
);
2591 /* Path should always be rightmost. */
2592 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(path
)->b_data
;
2593 BUG_ON(eb
->h_next_leaf_blk
!= 0ULL);
2596 BUG_ON(le16_to_cpu(el
->l_next_free_rec
) == 0);
2597 idx
= le16_to_cpu(el
->l_next_free_rec
) - 1;
2598 rec
= &el
->l_recs
[idx
];
2599 range
= le32_to_cpu(rec
->e_cpos
) + ocfs2_rec_clusters(el
, rec
);
2601 for (i
= 0; i
< path
->p_tree_depth
; i
++) {
2602 el
= path
->p_node
[i
].el
;
2603 idx
= le16_to_cpu(el
->l_next_free_rec
) - 1;
2604 rec
= &el
->l_recs
[idx
];
2606 rec
->e_int_clusters
= cpu_to_le32(range
);
2607 le32_add_cpu(&rec
->e_int_clusters
, -le32_to_cpu(rec
->e_cpos
));
2609 ocfs2_journal_dirty(handle
, path
->p_node
[i
].bh
);
2615 static void ocfs2_unlink_path(handle_t
*handle
,
2616 struct ocfs2_extent_tree
*et
,
2617 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
2618 struct ocfs2_path
*path
, int unlink_start
)
2621 struct ocfs2_extent_block
*eb
;
2622 struct ocfs2_extent_list
*el
;
2623 struct buffer_head
*bh
;
2625 for(i
= unlink_start
; i
< path_num_items(path
); i
++) {
2626 bh
= path
->p_node
[i
].bh
;
2628 eb
= (struct ocfs2_extent_block
*)bh
->b_data
;
2630 * Not all nodes might have had their final count
2631 * decremented by the caller - handle this here.
2634 if (le16_to_cpu(el
->l_next_free_rec
) > 1) {
2636 "Inode %llu, attempted to remove extent block "
2637 "%llu with %u records\n",
2638 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
2639 (unsigned long long)le64_to_cpu(eb
->h_blkno
),
2640 le16_to_cpu(el
->l_next_free_rec
));
2642 ocfs2_journal_dirty(handle
, bh
);
2643 ocfs2_remove_from_cache(et
->et_ci
, bh
);
2647 el
->l_next_free_rec
= 0;
2648 memset(&el
->l_recs
[0], 0, sizeof(struct ocfs2_extent_rec
));
2650 ocfs2_journal_dirty(handle
, bh
);
2652 ret
= ocfs2_cache_extent_block_free(dealloc
, eb
);
2656 ocfs2_remove_from_cache(et
->et_ci
, bh
);
2660 static void ocfs2_unlink_subtree(handle_t
*handle
,
2661 struct ocfs2_extent_tree
*et
,
2662 struct ocfs2_path
*left_path
,
2663 struct ocfs2_path
*right_path
,
2665 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
2668 struct buffer_head
*root_bh
= left_path
->p_node
[subtree_index
].bh
;
2669 struct ocfs2_extent_list
*root_el
= left_path
->p_node
[subtree_index
].el
;
2670 struct ocfs2_extent_list
*el
;
2671 struct ocfs2_extent_block
*eb
;
2673 el
= path_leaf_el(left_path
);
2675 eb
= (struct ocfs2_extent_block
*)right_path
->p_node
[subtree_index
+ 1].bh
->b_data
;
2677 for(i
= 1; i
< le16_to_cpu(root_el
->l_next_free_rec
); i
++)
2678 if (root_el
->l_recs
[i
].e_blkno
== eb
->h_blkno
)
2681 BUG_ON(i
>= le16_to_cpu(root_el
->l_next_free_rec
));
2683 memset(&root_el
->l_recs
[i
], 0, sizeof(struct ocfs2_extent_rec
));
2684 le16_add_cpu(&root_el
->l_next_free_rec
, -1);
2686 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(left_path
)->b_data
;
2687 eb
->h_next_leaf_blk
= 0;
2689 ocfs2_journal_dirty(handle
, root_bh
);
2690 ocfs2_journal_dirty(handle
, path_leaf_bh(left_path
));
2692 ocfs2_unlink_path(handle
, et
, dealloc
, right_path
,
2696 static int ocfs2_rotate_subtree_left(handle_t
*handle
,
2697 struct ocfs2_extent_tree
*et
,
2698 struct ocfs2_path
*left_path
,
2699 struct ocfs2_path
*right_path
,
2701 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
2704 int ret
, i
, del_right_subtree
= 0, right_has_empty
= 0;
2705 struct buffer_head
*root_bh
, *et_root_bh
= path_root_bh(right_path
);
2706 struct ocfs2_extent_list
*right_leaf_el
, *left_leaf_el
;
2707 struct ocfs2_extent_block
*eb
;
2711 right_leaf_el
= path_leaf_el(right_path
);
2712 left_leaf_el
= path_leaf_el(left_path
);
2713 root_bh
= left_path
->p_node
[subtree_index
].bh
;
2714 BUG_ON(root_bh
!= right_path
->p_node
[subtree_index
].bh
);
2716 if (!ocfs2_is_empty_extent(&left_leaf_el
->l_recs
[0]))
2719 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(right_path
)->b_data
;
2720 if (ocfs2_is_empty_extent(&right_leaf_el
->l_recs
[0])) {
2722 * It's legal for us to proceed if the right leaf is
2723 * the rightmost one and it has an empty extent. There
2724 * are two cases to handle - whether the leaf will be
2725 * empty after removal or not. If the leaf isn't empty
2726 * then just remove the empty extent up front. The
2727 * next block will handle empty leaves by flagging
2730 * Non rightmost leaves will throw -EAGAIN and the
2731 * caller can manually move the subtree and retry.
2734 if (eb
->h_next_leaf_blk
!= 0ULL)
2737 if (le16_to_cpu(right_leaf_el
->l_next_free_rec
) > 1) {
2738 ret
= ocfs2_journal_access_eb(handle
, et
->et_ci
,
2739 path_leaf_bh(right_path
),
2740 OCFS2_JOURNAL_ACCESS_WRITE
);
2746 ocfs2_remove_empty_extent(right_leaf_el
);
2748 right_has_empty
= 1;
2751 if (eb
->h_next_leaf_blk
== 0ULL &&
2752 le16_to_cpu(right_leaf_el
->l_next_free_rec
) == 1) {
2754 * We have to update i_last_eb_blk during the meta
2757 ret
= ocfs2_et_root_journal_access(handle
, et
,
2758 OCFS2_JOURNAL_ACCESS_WRITE
);
2764 del_right_subtree
= 1;
2768 * Getting here with an empty extent in the right path implies
2769 * that it's the rightmost path and will be deleted.
2771 BUG_ON(right_has_empty
&& !del_right_subtree
);
2773 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, right_path
,
2780 for(i
= subtree_index
+ 1; i
< path_num_items(right_path
); i
++) {
2781 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
2788 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
2796 if (!right_has_empty
) {
2798 * Only do this if we're moving a real
2799 * record. Otherwise, the action is delayed until
2800 * after removal of the right path in which case we
2801 * can do a simple shift to remove the empty extent.
2803 ocfs2_rotate_leaf(left_leaf_el
, &right_leaf_el
->l_recs
[0]);
2804 memset(&right_leaf_el
->l_recs
[0], 0,
2805 sizeof(struct ocfs2_extent_rec
));
2807 if (eb
->h_next_leaf_blk
== 0ULL) {
2809 * Move recs over to get rid of empty extent, decrease
2810 * next_free. This is allowed to remove the last
2811 * extent in our leaf (setting l_next_free_rec to
2812 * zero) - the delete code below won't care.
2814 ocfs2_remove_empty_extent(right_leaf_el
);
2817 ret
= ocfs2_journal_dirty(handle
, path_leaf_bh(left_path
));
2820 ret
= ocfs2_journal_dirty(handle
, path_leaf_bh(right_path
));
2824 if (del_right_subtree
) {
2825 ocfs2_unlink_subtree(handle
, et
, left_path
, right_path
,
2826 subtree_index
, dealloc
);
2827 ret
= ocfs2_update_edge_lengths(handle
, et
, subtree_index
,
2834 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(left_path
)->b_data
;
2835 ocfs2_et_set_last_eb_blk(et
, le64_to_cpu(eb
->h_blkno
));
2838 * Removal of the extent in the left leaf was skipped
2839 * above so we could delete the right path
2842 if (right_has_empty
)
2843 ocfs2_remove_empty_extent(left_leaf_el
);
2845 ret
= ocfs2_journal_dirty(handle
, et_root_bh
);
2851 ocfs2_complete_edge_insert(handle
, left_path
, right_path
,
2859 * Given a full path, determine what cpos value would return us a path
2860 * containing the leaf immediately to the right of the current one.
2862 * Will return zero if the path passed in is already the rightmost path.
2864 * This looks similar, but is subtly different to
2865 * ocfs2_find_cpos_for_left_leaf().
2867 static int ocfs2_find_cpos_for_right_leaf(struct super_block
*sb
,
2868 struct ocfs2_path
*path
, u32
*cpos
)
2872 struct ocfs2_extent_list
*el
;
2876 if (path
->p_tree_depth
== 0)
2879 blkno
= path_leaf_bh(path
)->b_blocknr
;
2881 /* Start at the tree node just above the leaf and work our way up. */
2882 i
= path
->p_tree_depth
- 1;
2886 el
= path
->p_node
[i
].el
;
2889 * Find the extent record just after the one in our
2892 next_free
= le16_to_cpu(el
->l_next_free_rec
);
2893 for(j
= 0; j
< le16_to_cpu(el
->l_next_free_rec
); j
++) {
2894 if (le64_to_cpu(el
->l_recs
[j
].e_blkno
) == blkno
) {
2895 if (j
== (next_free
- 1)) {
2898 * We've determined that the
2899 * path specified is already
2900 * the rightmost one - return a
2906 * The rightmost record points to our
2907 * leaf - we need to travel up the
2913 *cpos
= le32_to_cpu(el
->l_recs
[j
+ 1].e_cpos
);
2919 * If we got here, we never found a valid node where
2920 * the tree indicated one should be.
2923 "Invalid extent tree at extent block %llu\n",
2924 (unsigned long long)blkno
);
2929 blkno
= path
->p_node
[i
].bh
->b_blocknr
;
2937 static int ocfs2_rotate_rightmost_leaf_left(handle_t
*handle
,
2938 struct ocfs2_extent_tree
*et
,
2939 struct ocfs2_path
*path
)
2942 struct buffer_head
*bh
= path_leaf_bh(path
);
2943 struct ocfs2_extent_list
*el
= path_leaf_el(path
);
2945 if (!ocfs2_is_empty_extent(&el
->l_recs
[0]))
2948 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, path
,
2949 path_num_items(path
) - 1);
2955 ocfs2_remove_empty_extent(el
);
2957 ret
= ocfs2_journal_dirty(handle
, bh
);
2965 static int __ocfs2_rotate_tree_left(handle_t
*handle
,
2966 struct ocfs2_extent_tree
*et
,
2968 struct ocfs2_path
*path
,
2969 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
2970 struct ocfs2_path
**empty_extent_path
)
2972 int ret
, subtree_root
, deleted
;
2974 struct ocfs2_path
*left_path
= NULL
;
2975 struct ocfs2_path
*right_path
= NULL
;
2976 struct super_block
*sb
= ocfs2_metadata_cache_get_super(et
->et_ci
);
2978 BUG_ON(!ocfs2_is_empty_extent(&(path_leaf_el(path
)->l_recs
[0])));
2980 *empty_extent_path
= NULL
;
2982 ret
= ocfs2_find_cpos_for_right_leaf(sb
, path
, &right_cpos
);
2988 left_path
= ocfs2_new_path_from_path(path
);
2995 ocfs2_cp_path(left_path
, path
);
2997 right_path
= ocfs2_new_path_from_path(path
);
3004 while (right_cpos
) {
3005 ret
= ocfs2_find_path(et
->et_ci
, right_path
, right_cpos
);
3011 subtree_root
= ocfs2_find_subtree_root(et
, left_path
,
3014 mlog(0, "Subtree root at index %d (blk %llu, depth %d)\n",
3016 (unsigned long long)
3017 right_path
->p_node
[subtree_root
].bh
->b_blocknr
,
3018 right_path
->p_tree_depth
);
3020 ret
= ocfs2_extend_rotate_transaction(handle
, subtree_root
,
3021 orig_credits
, left_path
);
3028 * Caller might still want to make changes to the
3029 * tree root, so re-add it to the journal here.
3031 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
3038 ret
= ocfs2_rotate_subtree_left(handle
, et
, left_path
,
3039 right_path
, subtree_root
,
3041 if (ret
== -EAGAIN
) {
3043 * The rotation has to temporarily stop due to
3044 * the right subtree having an empty
3045 * extent. Pass it back to the caller for a
3048 *empty_extent_path
= right_path
;
3058 * The subtree rotate might have removed records on
3059 * the rightmost edge. If so, then rotation is
3065 ocfs2_mv_path(left_path
, right_path
);
3067 ret
= ocfs2_find_cpos_for_right_leaf(sb
, left_path
,
3076 ocfs2_free_path(right_path
);
3077 ocfs2_free_path(left_path
);
3082 static int ocfs2_remove_rightmost_path(handle_t
*handle
,
3083 struct ocfs2_extent_tree
*et
,
3084 struct ocfs2_path
*path
,
3085 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
3087 int ret
, subtree_index
;
3089 struct ocfs2_path
*left_path
= NULL
;
3090 struct ocfs2_extent_block
*eb
;
3091 struct ocfs2_extent_list
*el
;
3094 ret
= ocfs2_et_sanity_check(et
);
3098 * There's two ways we handle this depending on
3099 * whether path is the only existing one.
3101 ret
= ocfs2_extend_rotate_transaction(handle
, 0,
3102 handle
->h_buffer_credits
,
3109 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, path
);
3115 ret
= ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et
->et_ci
),
3124 * We have a path to the left of this one - it needs
3127 left_path
= ocfs2_new_path_from_path(path
);
3134 ret
= ocfs2_find_path(et
->et_ci
, left_path
, cpos
);
3140 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, left_path
);
3146 subtree_index
= ocfs2_find_subtree_root(et
, left_path
, path
);
3148 ocfs2_unlink_subtree(handle
, et
, left_path
, path
,
3149 subtree_index
, dealloc
);
3150 ret
= ocfs2_update_edge_lengths(handle
, et
, subtree_index
,
3157 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(left_path
)->b_data
;
3158 ocfs2_et_set_last_eb_blk(et
, le64_to_cpu(eb
->h_blkno
));
3161 * 'path' is also the leftmost path which
3162 * means it must be the only one. This gets
3163 * handled differently because we want to
3164 * revert the root back to having extents
3167 ocfs2_unlink_path(handle
, et
, dealloc
, path
, 1);
3169 el
= et
->et_root_el
;
3170 el
->l_tree_depth
= 0;
3171 el
->l_next_free_rec
= 0;
3172 memset(&el
->l_recs
[0], 0, sizeof(struct ocfs2_extent_rec
));
3174 ocfs2_et_set_last_eb_blk(et
, 0);
3177 ocfs2_journal_dirty(handle
, path_root_bh(path
));
3180 ocfs2_free_path(left_path
);
3185 * Left rotation of btree records.
3187 * In many ways, this is (unsurprisingly) the opposite of right
3188 * rotation. We start at some non-rightmost path containing an empty
3189 * extent in the leaf block. The code works its way to the rightmost
3190 * path by rotating records to the left in every subtree.
3192 * This is used by any code which reduces the number of extent records
3193 * in a leaf. After removal, an empty record should be placed in the
3194 * leftmost list position.
3196 * This won't handle a length update of the rightmost path records if
3197 * the rightmost tree leaf record is removed so the caller is
3198 * responsible for detecting and correcting that.
3200 static int ocfs2_rotate_tree_left(handle_t
*handle
,
3201 struct ocfs2_extent_tree
*et
,
3202 struct ocfs2_path
*path
,
3203 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
3205 int ret
, orig_credits
= handle
->h_buffer_credits
;
3206 struct ocfs2_path
*tmp_path
= NULL
, *restart_path
= NULL
;
3207 struct ocfs2_extent_block
*eb
;
3208 struct ocfs2_extent_list
*el
;
3210 el
= path_leaf_el(path
);
3211 if (!ocfs2_is_empty_extent(&el
->l_recs
[0]))
3214 if (path
->p_tree_depth
== 0) {
3215 rightmost_no_delete
:
3217 * Inline extents. This is trivially handled, so do
3220 ret
= ocfs2_rotate_rightmost_leaf_left(handle
, et
, path
);
3227 * Handle rightmost branch now. There's several cases:
3228 * 1) simple rotation leaving records in there. That's trivial.
3229 * 2) rotation requiring a branch delete - there's no more
3230 * records left. Two cases of this:
3231 * a) There are branches to the left.
3232 * b) This is also the leftmost (the only) branch.
3234 * 1) is handled via ocfs2_rotate_rightmost_leaf_left()
3235 * 2a) we need the left branch so that we can update it with the unlink
3236 * 2b) we need to bring the root back to inline extents.
3239 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(path
)->b_data
;
3241 if (eb
->h_next_leaf_blk
== 0) {
3243 * This gets a bit tricky if we're going to delete the
3244 * rightmost path. Get the other cases out of the way
3247 if (le16_to_cpu(el
->l_next_free_rec
) > 1)
3248 goto rightmost_no_delete
;
3250 if (le16_to_cpu(el
->l_next_free_rec
) == 0) {
3252 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
3253 "Owner %llu has empty extent block at %llu",
3254 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
3255 (unsigned long long)le64_to_cpu(eb
->h_blkno
));
3260 * XXX: The caller can not trust "path" any more after
3261 * this as it will have been deleted. What do we do?
3263 * In theory the rotate-for-merge code will never get
3264 * here because it'll always ask for a rotate in a
3268 ret
= ocfs2_remove_rightmost_path(handle
, et
, path
,
3276 * Now we can loop, remembering the path we get from -EAGAIN
3277 * and restarting from there.
3280 ret
= __ocfs2_rotate_tree_left(handle
, et
, orig_credits
, path
,
3281 dealloc
, &restart_path
);
3282 if (ret
&& ret
!= -EAGAIN
) {
3287 while (ret
== -EAGAIN
) {
3288 tmp_path
= restart_path
;
3289 restart_path
= NULL
;
3291 ret
= __ocfs2_rotate_tree_left(handle
, et
, orig_credits
,
3294 if (ret
&& ret
!= -EAGAIN
) {
3299 ocfs2_free_path(tmp_path
);
3307 ocfs2_free_path(tmp_path
);
3308 ocfs2_free_path(restart_path
);
3312 static void ocfs2_cleanup_merge(struct ocfs2_extent_list
*el
,
3315 struct ocfs2_extent_rec
*rec
= &el
->l_recs
[index
];
3318 if (rec
->e_leaf_clusters
== 0) {
3320 * We consumed all of the merged-from record. An empty
3321 * extent cannot exist anywhere but the 1st array
3322 * position, so move things over if the merged-from
3323 * record doesn't occupy that position.
3325 * This creates a new empty extent so the caller
3326 * should be smart enough to have removed any existing
3330 BUG_ON(ocfs2_is_empty_extent(&el
->l_recs
[0]));
3331 size
= index
* sizeof(struct ocfs2_extent_rec
);
3332 memmove(&el
->l_recs
[1], &el
->l_recs
[0], size
);
3336 * Always memset - the caller doesn't check whether it
3337 * created an empty extent, so there could be junk in
3340 memset(&el
->l_recs
[0], 0, sizeof(struct ocfs2_extent_rec
));
3344 static int ocfs2_get_right_path(struct ocfs2_extent_tree
*et
,
3345 struct ocfs2_path
*left_path
,
3346 struct ocfs2_path
**ret_right_path
)
3350 struct ocfs2_path
*right_path
= NULL
;
3351 struct ocfs2_extent_list
*left_el
;
3353 *ret_right_path
= NULL
;
3355 /* This function shouldn't be called for non-trees. */
3356 BUG_ON(left_path
->p_tree_depth
== 0);
3358 left_el
= path_leaf_el(left_path
);
3359 BUG_ON(left_el
->l_next_free_rec
!= left_el
->l_count
);
3361 ret
= ocfs2_find_cpos_for_right_leaf(ocfs2_metadata_cache_get_super(et
->et_ci
),
3362 left_path
, &right_cpos
);
3368 /* This function shouldn't be called for the rightmost leaf. */
3369 BUG_ON(right_cpos
== 0);
3371 right_path
= ocfs2_new_path_from_path(left_path
);
3378 ret
= ocfs2_find_path(et
->et_ci
, right_path
, right_cpos
);
3384 *ret_right_path
= right_path
;
3387 ocfs2_free_path(right_path
);
3392 * Remove split_rec clusters from the record at index and merge them
3393 * onto the beginning of the record "next" to it.
3394 * For index < l_count - 1, the next means the extent rec at index + 1.
3395 * For index == l_count - 1, the "next" means the 1st extent rec of the
3396 * next extent block.
3398 static int ocfs2_merge_rec_right(struct ocfs2_path
*left_path
,
3400 struct ocfs2_extent_tree
*et
,
3401 struct ocfs2_extent_rec
*split_rec
,
3404 int ret
, next_free
, i
;
3405 unsigned int split_clusters
= le16_to_cpu(split_rec
->e_leaf_clusters
);
3406 struct ocfs2_extent_rec
*left_rec
;
3407 struct ocfs2_extent_rec
*right_rec
;
3408 struct ocfs2_extent_list
*right_el
;
3409 struct ocfs2_path
*right_path
= NULL
;
3410 int subtree_index
= 0;
3411 struct ocfs2_extent_list
*el
= path_leaf_el(left_path
);
3412 struct buffer_head
*bh
= path_leaf_bh(left_path
);
3413 struct buffer_head
*root_bh
= NULL
;
3415 BUG_ON(index
>= le16_to_cpu(el
->l_next_free_rec
));
3416 left_rec
= &el
->l_recs
[index
];
3418 if (index
== le16_to_cpu(el
->l_next_free_rec
) - 1 &&
3419 le16_to_cpu(el
->l_next_free_rec
) == le16_to_cpu(el
->l_count
)) {
3420 /* we meet with a cross extent block merge. */
3421 ret
= ocfs2_get_right_path(et
, left_path
, &right_path
);
3427 right_el
= path_leaf_el(right_path
);
3428 next_free
= le16_to_cpu(right_el
->l_next_free_rec
);
3429 BUG_ON(next_free
<= 0);
3430 right_rec
= &right_el
->l_recs
[0];
3431 if (ocfs2_is_empty_extent(right_rec
)) {
3432 BUG_ON(next_free
<= 1);
3433 right_rec
= &right_el
->l_recs
[1];
3436 BUG_ON(le32_to_cpu(left_rec
->e_cpos
) +
3437 le16_to_cpu(left_rec
->e_leaf_clusters
) !=
3438 le32_to_cpu(right_rec
->e_cpos
));
3440 subtree_index
= ocfs2_find_subtree_root(et
, left_path
,
3443 ret
= ocfs2_extend_rotate_transaction(handle
, subtree_index
,
3444 handle
->h_buffer_credits
,
3451 root_bh
= left_path
->p_node
[subtree_index
].bh
;
3452 BUG_ON(root_bh
!= right_path
->p_node
[subtree_index
].bh
);
3454 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, right_path
,
3461 for (i
= subtree_index
+ 1;
3462 i
< path_num_items(right_path
); i
++) {
3463 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
3470 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
3479 BUG_ON(index
== le16_to_cpu(el
->l_next_free_rec
) - 1);
3480 right_rec
= &el
->l_recs
[index
+ 1];
3483 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, left_path
,
3484 path_num_items(left_path
) - 1);
3490 le16_add_cpu(&left_rec
->e_leaf_clusters
, -split_clusters
);
3492 le32_add_cpu(&right_rec
->e_cpos
, -split_clusters
);
3493 le64_add_cpu(&right_rec
->e_blkno
,
3494 -ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et
->et_ci
),
3496 le16_add_cpu(&right_rec
->e_leaf_clusters
, split_clusters
);
3498 ocfs2_cleanup_merge(el
, index
);
3500 ret
= ocfs2_journal_dirty(handle
, bh
);
3505 ret
= ocfs2_journal_dirty(handle
, path_leaf_bh(right_path
));
3509 ocfs2_complete_edge_insert(handle
, left_path
, right_path
,
3514 ocfs2_free_path(right_path
);
3518 static int ocfs2_get_left_path(struct ocfs2_extent_tree
*et
,
3519 struct ocfs2_path
*right_path
,
3520 struct ocfs2_path
**ret_left_path
)
3524 struct ocfs2_path
*left_path
= NULL
;
3526 *ret_left_path
= NULL
;
3528 /* This function shouldn't be called for non-trees. */
3529 BUG_ON(right_path
->p_tree_depth
== 0);
3531 ret
= ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et
->et_ci
),
3532 right_path
, &left_cpos
);
3538 /* This function shouldn't be called for the leftmost leaf. */
3539 BUG_ON(left_cpos
== 0);
3541 left_path
= ocfs2_new_path_from_path(right_path
);
3548 ret
= ocfs2_find_path(et
->et_ci
, left_path
, left_cpos
);
3554 *ret_left_path
= left_path
;
3557 ocfs2_free_path(left_path
);
3562 * Remove split_rec clusters from the record at index and merge them
3563 * onto the tail of the record "before" it.
3564 * For index > 0, the "before" means the extent rec at index - 1.
3566 * For index == 0, the "before" means the last record of the previous
3567 * extent block. And there is also a situation that we may need to
3568 * remove the rightmost leaf extent block in the right_path and change
3569 * the right path to indicate the new rightmost path.
3571 static int ocfs2_merge_rec_left(struct ocfs2_path
*right_path
,
3573 struct ocfs2_extent_tree
*et
,
3574 struct ocfs2_extent_rec
*split_rec
,
3575 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
3578 int ret
, i
, subtree_index
= 0, has_empty_extent
= 0;
3579 unsigned int split_clusters
= le16_to_cpu(split_rec
->e_leaf_clusters
);
3580 struct ocfs2_extent_rec
*left_rec
;
3581 struct ocfs2_extent_rec
*right_rec
;
3582 struct ocfs2_extent_list
*el
= path_leaf_el(right_path
);
3583 struct buffer_head
*bh
= path_leaf_bh(right_path
);
3584 struct buffer_head
*root_bh
= NULL
;
3585 struct ocfs2_path
*left_path
= NULL
;
3586 struct ocfs2_extent_list
*left_el
;
3590 right_rec
= &el
->l_recs
[index
];
3592 /* we meet with a cross extent block merge. */
3593 ret
= ocfs2_get_left_path(et
, right_path
, &left_path
);
3599 left_el
= path_leaf_el(left_path
);
3600 BUG_ON(le16_to_cpu(left_el
->l_next_free_rec
) !=
3601 le16_to_cpu(left_el
->l_count
));
3603 left_rec
= &left_el
->l_recs
[
3604 le16_to_cpu(left_el
->l_next_free_rec
) - 1];
3605 BUG_ON(le32_to_cpu(left_rec
->e_cpos
) +
3606 le16_to_cpu(left_rec
->e_leaf_clusters
) !=
3607 le32_to_cpu(split_rec
->e_cpos
));
3609 subtree_index
= ocfs2_find_subtree_root(et
, left_path
,
3612 ret
= ocfs2_extend_rotate_transaction(handle
, subtree_index
,
3613 handle
->h_buffer_credits
,
3620 root_bh
= left_path
->p_node
[subtree_index
].bh
;
3621 BUG_ON(root_bh
!= right_path
->p_node
[subtree_index
].bh
);
3623 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, right_path
,
3630 for (i
= subtree_index
+ 1;
3631 i
< path_num_items(right_path
); i
++) {
3632 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
3639 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
,
3647 left_rec
= &el
->l_recs
[index
- 1];
3648 if (ocfs2_is_empty_extent(&el
->l_recs
[0]))
3649 has_empty_extent
= 1;
3652 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, right_path
,
3653 path_num_items(right_path
) - 1);
3659 if (has_empty_extent
&& index
== 1) {
3661 * The easy case - we can just plop the record right in.
3663 *left_rec
= *split_rec
;
3665 has_empty_extent
= 0;
3667 le16_add_cpu(&left_rec
->e_leaf_clusters
, split_clusters
);
3669 le32_add_cpu(&right_rec
->e_cpos
, split_clusters
);
3670 le64_add_cpu(&right_rec
->e_blkno
,
3671 ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et
->et_ci
),
3673 le16_add_cpu(&right_rec
->e_leaf_clusters
, -split_clusters
);
3675 ocfs2_cleanup_merge(el
, index
);
3677 ret
= ocfs2_journal_dirty(handle
, bh
);
3682 ret
= ocfs2_journal_dirty(handle
, path_leaf_bh(left_path
));
3687 * In the situation that the right_rec is empty and the extent
3688 * block is empty also, ocfs2_complete_edge_insert can't handle
3689 * it and we need to delete the right extent block.
3691 if (le16_to_cpu(right_rec
->e_leaf_clusters
) == 0 &&
3692 le16_to_cpu(el
->l_next_free_rec
) == 1) {
3694 ret
= ocfs2_remove_rightmost_path(handle
, et
,
3702 /* Now the rightmost extent block has been deleted.
3703 * So we use the new rightmost path.
3705 ocfs2_mv_path(right_path
, left_path
);
3708 ocfs2_complete_edge_insert(handle
, left_path
,
3709 right_path
, subtree_index
);
3713 ocfs2_free_path(left_path
);
3717 static int ocfs2_try_to_merge_extent(handle_t
*handle
,
3718 struct ocfs2_extent_tree
*et
,
3719 struct ocfs2_path
*path
,
3721 struct ocfs2_extent_rec
*split_rec
,
3722 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
3723 struct ocfs2_merge_ctxt
*ctxt
)
3726 struct ocfs2_extent_list
*el
= path_leaf_el(path
);
3727 struct ocfs2_extent_rec
*rec
= &el
->l_recs
[split_index
];
3729 BUG_ON(ctxt
->c_contig_type
== CONTIG_NONE
);
3731 if (ctxt
->c_split_covers_rec
&& ctxt
->c_has_empty_extent
) {
3733 * The merge code will need to create an empty
3734 * extent to take the place of the newly
3735 * emptied slot. Remove any pre-existing empty
3736 * extents - having more than one in a leaf is
3739 ret
= ocfs2_rotate_tree_left(handle
, et
, path
, dealloc
);
3745 rec
= &el
->l_recs
[split_index
];
3748 if (ctxt
->c_contig_type
== CONTIG_LEFTRIGHT
) {
3750 * Left-right contig implies this.
3752 BUG_ON(!ctxt
->c_split_covers_rec
);
3755 * Since the leftright insert always covers the entire
3756 * extent, this call will delete the insert record
3757 * entirely, resulting in an empty extent record added to
3760 * Since the adding of an empty extent shifts
3761 * everything back to the right, there's no need to
3762 * update split_index here.
3764 * When the split_index is zero, we need to merge it to the
3765 * prevoius extent block. It is more efficient and easier
3766 * if we do merge_right first and merge_left later.
3768 ret
= ocfs2_merge_rec_right(path
, handle
, et
, split_rec
,
3776 * We can only get this from logic error above.
3778 BUG_ON(!ocfs2_is_empty_extent(&el
->l_recs
[0]));
3780 /* The merge left us with an empty extent, remove it. */
3781 ret
= ocfs2_rotate_tree_left(handle
, et
, path
, dealloc
);
3787 rec
= &el
->l_recs
[split_index
];
3790 * Note that we don't pass split_rec here on purpose -
3791 * we've merged it into the rec already.
3793 ret
= ocfs2_merge_rec_left(path
, handle
, et
, rec
,
3794 dealloc
, split_index
);
3801 ret
= ocfs2_rotate_tree_left(handle
, et
, path
, dealloc
);
3803 * Error from this last rotate is not critical, so
3804 * print but don't bubble it up.
3811 * Merge a record to the left or right.
3813 * 'contig_type' is relative to the existing record,
3814 * so for example, if we're "right contig", it's to
3815 * the record on the left (hence the left merge).
3817 if (ctxt
->c_contig_type
== CONTIG_RIGHT
) {
3818 ret
= ocfs2_merge_rec_left(path
, handle
, et
,
3826 ret
= ocfs2_merge_rec_right(path
, handle
,
3835 if (ctxt
->c_split_covers_rec
) {
3837 * The merge may have left an empty extent in
3838 * our leaf. Try to rotate it away.
3840 ret
= ocfs2_rotate_tree_left(handle
, et
, path
,
3852 static void ocfs2_subtract_from_rec(struct super_block
*sb
,
3853 enum ocfs2_split_type split
,
3854 struct ocfs2_extent_rec
*rec
,
3855 struct ocfs2_extent_rec
*split_rec
)
3859 len_blocks
= ocfs2_clusters_to_blocks(sb
,
3860 le16_to_cpu(split_rec
->e_leaf_clusters
));
3862 if (split
== SPLIT_LEFT
) {
3864 * Region is on the left edge of the existing
3867 le32_add_cpu(&rec
->e_cpos
,
3868 le16_to_cpu(split_rec
->e_leaf_clusters
));
3869 le64_add_cpu(&rec
->e_blkno
, len_blocks
);
3870 le16_add_cpu(&rec
->e_leaf_clusters
,
3871 -le16_to_cpu(split_rec
->e_leaf_clusters
));
3874 * Region is on the right edge of the existing
3877 le16_add_cpu(&rec
->e_leaf_clusters
,
3878 -le16_to_cpu(split_rec
->e_leaf_clusters
));
3883 * Do the final bits of extent record insertion at the target leaf
3884 * list. If this leaf is part of an allocation tree, it is assumed
3885 * that the tree above has been prepared.
3887 static void ocfs2_insert_at_leaf(struct ocfs2_extent_tree
*et
,
3888 struct ocfs2_extent_rec
*insert_rec
,
3889 struct ocfs2_extent_list
*el
,
3890 struct ocfs2_insert_type
*insert
)
3892 int i
= insert
->ins_contig_index
;
3894 struct ocfs2_extent_rec
*rec
;
3896 BUG_ON(le16_to_cpu(el
->l_tree_depth
) != 0);
3898 if (insert
->ins_split
!= SPLIT_NONE
) {
3899 i
= ocfs2_search_extent_list(el
, le32_to_cpu(insert_rec
->e_cpos
));
3901 rec
= &el
->l_recs
[i
];
3902 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et
->et_ci
),
3903 insert
->ins_split
, rec
,
3909 * Contiguous insert - either left or right.
3911 if (insert
->ins_contig
!= CONTIG_NONE
) {
3912 rec
= &el
->l_recs
[i
];
3913 if (insert
->ins_contig
== CONTIG_LEFT
) {
3914 rec
->e_blkno
= insert_rec
->e_blkno
;
3915 rec
->e_cpos
= insert_rec
->e_cpos
;
3917 le16_add_cpu(&rec
->e_leaf_clusters
,
3918 le16_to_cpu(insert_rec
->e_leaf_clusters
));
3923 * Handle insert into an empty leaf.
3925 if (le16_to_cpu(el
->l_next_free_rec
) == 0 ||
3926 ((le16_to_cpu(el
->l_next_free_rec
) == 1) &&
3927 ocfs2_is_empty_extent(&el
->l_recs
[0]))) {
3928 el
->l_recs
[0] = *insert_rec
;
3929 el
->l_next_free_rec
= cpu_to_le16(1);
3936 if (insert
->ins_appending
== APPEND_TAIL
) {
3937 i
= le16_to_cpu(el
->l_next_free_rec
) - 1;
3938 rec
= &el
->l_recs
[i
];
3939 range
= le32_to_cpu(rec
->e_cpos
)
3940 + le16_to_cpu(rec
->e_leaf_clusters
);
3941 BUG_ON(le32_to_cpu(insert_rec
->e_cpos
) < range
);
3943 mlog_bug_on_msg(le16_to_cpu(el
->l_next_free_rec
) >=
3944 le16_to_cpu(el
->l_count
),
3945 "owner %llu, depth %u, count %u, next free %u, "
3946 "rec.cpos %u, rec.clusters %u, "
3947 "insert.cpos %u, insert.clusters %u\n",
3948 ocfs2_metadata_cache_owner(et
->et_ci
),
3949 le16_to_cpu(el
->l_tree_depth
),
3950 le16_to_cpu(el
->l_count
),
3951 le16_to_cpu(el
->l_next_free_rec
),
3952 le32_to_cpu(el
->l_recs
[i
].e_cpos
),
3953 le16_to_cpu(el
->l_recs
[i
].e_leaf_clusters
),
3954 le32_to_cpu(insert_rec
->e_cpos
),
3955 le16_to_cpu(insert_rec
->e_leaf_clusters
));
3957 el
->l_recs
[i
] = *insert_rec
;
3958 le16_add_cpu(&el
->l_next_free_rec
, 1);
3964 * Ok, we have to rotate.
3966 * At this point, it is safe to assume that inserting into an
3967 * empty leaf and appending to a leaf have both been handled
3970 * This leaf needs to have space, either by the empty 1st
3971 * extent record, or by virtue of an l_next_rec < l_count.
3973 ocfs2_rotate_leaf(el
, insert_rec
);
3976 static void ocfs2_adjust_rightmost_records(handle_t
*handle
,
3977 struct ocfs2_extent_tree
*et
,
3978 struct ocfs2_path
*path
,
3979 struct ocfs2_extent_rec
*insert_rec
)
3981 int ret
, i
, next_free
;
3982 struct buffer_head
*bh
;
3983 struct ocfs2_extent_list
*el
;
3984 struct ocfs2_extent_rec
*rec
;
3987 * Update everything except the leaf block.
3989 for (i
= 0; i
< path
->p_tree_depth
; i
++) {
3990 bh
= path
->p_node
[i
].bh
;
3991 el
= path
->p_node
[i
].el
;
3993 next_free
= le16_to_cpu(el
->l_next_free_rec
);
3994 if (next_free
== 0) {
3995 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
3996 "Owner %llu has a bad extent list",
3997 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
));
4002 rec
= &el
->l_recs
[next_free
- 1];
4004 rec
->e_int_clusters
= insert_rec
->e_cpos
;
4005 le32_add_cpu(&rec
->e_int_clusters
,
4006 le16_to_cpu(insert_rec
->e_leaf_clusters
));
4007 le32_add_cpu(&rec
->e_int_clusters
,
4008 -le32_to_cpu(rec
->e_cpos
));
4010 ret
= ocfs2_journal_dirty(handle
, bh
);
4017 static int ocfs2_append_rec_to_path(handle_t
*handle
,
4018 struct ocfs2_extent_tree
*et
,
4019 struct ocfs2_extent_rec
*insert_rec
,
4020 struct ocfs2_path
*right_path
,
4021 struct ocfs2_path
**ret_left_path
)
4024 struct ocfs2_extent_list
*el
;
4025 struct ocfs2_path
*left_path
= NULL
;
4027 *ret_left_path
= NULL
;
4030 * This shouldn't happen for non-trees. The extent rec cluster
4031 * count manipulation below only works for interior nodes.
4033 BUG_ON(right_path
->p_tree_depth
== 0);
4036 * If our appending insert is at the leftmost edge of a leaf,
4037 * then we might need to update the rightmost records of the
4040 el
= path_leaf_el(right_path
);
4041 next_free
= le16_to_cpu(el
->l_next_free_rec
);
4042 if (next_free
== 0 ||
4043 (next_free
== 1 && ocfs2_is_empty_extent(&el
->l_recs
[0]))) {
4046 ret
= ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et
->et_ci
),
4047 right_path
, &left_cpos
);
4053 mlog(0, "Append may need a left path update. cpos: %u, "
4054 "left_cpos: %u\n", le32_to_cpu(insert_rec
->e_cpos
),
4058 * No need to worry if the append is already in the
4062 left_path
= ocfs2_new_path_from_path(right_path
);
4069 ret
= ocfs2_find_path(et
->et_ci
, left_path
,
4077 * ocfs2_insert_path() will pass the left_path to the
4083 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, right_path
);
4089 ocfs2_adjust_rightmost_records(handle
, et
, right_path
, insert_rec
);
4091 *ret_left_path
= left_path
;
4095 ocfs2_free_path(left_path
);
4100 static void ocfs2_split_record(struct ocfs2_extent_tree
*et
,
4101 struct ocfs2_path
*left_path
,
4102 struct ocfs2_path
*right_path
,
4103 struct ocfs2_extent_rec
*split_rec
,
4104 enum ocfs2_split_type split
)
4107 u32 cpos
= le32_to_cpu(split_rec
->e_cpos
);
4108 struct ocfs2_extent_list
*left_el
= NULL
, *right_el
, *insert_el
, *el
;
4109 struct ocfs2_extent_rec
*rec
, *tmprec
;
4111 right_el
= path_leaf_el(right_path
);
4113 left_el
= path_leaf_el(left_path
);
4116 insert_el
= right_el
;
4117 index
= ocfs2_search_extent_list(el
, cpos
);
4119 if (index
== 0 && left_path
) {
4120 BUG_ON(ocfs2_is_empty_extent(&el
->l_recs
[0]));
4123 * This typically means that the record
4124 * started in the left path but moved to the
4125 * right as a result of rotation. We either
4126 * move the existing record to the left, or we
4127 * do the later insert there.
4129 * In this case, the left path should always
4130 * exist as the rotate code will have passed
4131 * it back for a post-insert update.
4134 if (split
== SPLIT_LEFT
) {
4136 * It's a left split. Since we know
4137 * that the rotate code gave us an
4138 * empty extent in the left path, we
4139 * can just do the insert there.
4141 insert_el
= left_el
;
4144 * Right split - we have to move the
4145 * existing record over to the left
4146 * leaf. The insert will be into the
4147 * newly created empty extent in the
4150 tmprec
= &right_el
->l_recs
[index
];
4151 ocfs2_rotate_leaf(left_el
, tmprec
);
4154 memset(tmprec
, 0, sizeof(*tmprec
));
4155 index
= ocfs2_search_extent_list(left_el
, cpos
);
4156 BUG_ON(index
== -1);
4161 BUG_ON(!ocfs2_is_empty_extent(&left_el
->l_recs
[0]));
4163 * Left path is easy - we can just allow the insert to
4167 insert_el
= left_el
;
4168 index
= ocfs2_search_extent_list(el
, cpos
);
4169 BUG_ON(index
== -1);
4172 rec
= &el
->l_recs
[index
];
4173 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et
->et_ci
),
4174 split
, rec
, split_rec
);
4175 ocfs2_rotate_leaf(insert_el
, split_rec
);
4179 * This function only does inserts on an allocation b-tree. For tree
4180 * depth = 0, ocfs2_insert_at_leaf() is called directly.
4182 * right_path is the path we want to do the actual insert
4183 * in. left_path should only be passed in if we need to update that
4184 * portion of the tree after an edge insert.
4186 static int ocfs2_insert_path(handle_t
*handle
,
4187 struct ocfs2_extent_tree
*et
,
4188 struct ocfs2_path
*left_path
,
4189 struct ocfs2_path
*right_path
,
4190 struct ocfs2_extent_rec
*insert_rec
,
4191 struct ocfs2_insert_type
*insert
)
4193 int ret
, subtree_index
;
4194 struct buffer_head
*leaf_bh
= path_leaf_bh(right_path
);
4197 int credits
= handle
->h_buffer_credits
;
4200 * There's a chance that left_path got passed back to
4201 * us without being accounted for in the
4202 * journal. Extend our transaction here to be sure we
4203 * can change those blocks.
4205 credits
+= left_path
->p_tree_depth
;
4207 ret
= ocfs2_extend_trans(handle
, credits
);
4213 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, left_path
);
4221 * Pass both paths to the journal. The majority of inserts
4222 * will be touching all components anyway.
4224 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, right_path
);
4230 if (insert
->ins_split
!= SPLIT_NONE
) {
4232 * We could call ocfs2_insert_at_leaf() for some types
4233 * of splits, but it's easier to just let one separate
4234 * function sort it all out.
4236 ocfs2_split_record(et
, left_path
, right_path
,
4237 insert_rec
, insert
->ins_split
);
4240 * Split might have modified either leaf and we don't
4241 * have a guarantee that the later edge insert will
4242 * dirty this for us.
4245 ret
= ocfs2_journal_dirty(handle
,
4246 path_leaf_bh(left_path
));
4250 ocfs2_insert_at_leaf(et
, insert_rec
, path_leaf_el(right_path
),
4253 ret
= ocfs2_journal_dirty(handle
, leaf_bh
);
4259 * The rotate code has indicated that we need to fix
4260 * up portions of the tree after the insert.
4262 * XXX: Should we extend the transaction here?
4264 subtree_index
= ocfs2_find_subtree_root(et
, left_path
,
4266 ocfs2_complete_edge_insert(handle
, left_path
, right_path
,
4275 static int ocfs2_do_insert_extent(handle_t
*handle
,
4276 struct ocfs2_extent_tree
*et
,
4277 struct ocfs2_extent_rec
*insert_rec
,
4278 struct ocfs2_insert_type
*type
)
4280 int ret
, rotate
= 0;
4282 struct ocfs2_path
*right_path
= NULL
;
4283 struct ocfs2_path
*left_path
= NULL
;
4284 struct ocfs2_extent_list
*el
;
4286 el
= et
->et_root_el
;
4288 ret
= ocfs2_et_root_journal_access(handle
, et
,
4289 OCFS2_JOURNAL_ACCESS_WRITE
);
4295 if (le16_to_cpu(el
->l_tree_depth
) == 0) {
4296 ocfs2_insert_at_leaf(et
, insert_rec
, el
, type
);
4297 goto out_update_clusters
;
4300 right_path
= ocfs2_new_path_from_et(et
);
4308 * Determine the path to start with. Rotations need the
4309 * rightmost path, everything else can go directly to the
4312 cpos
= le32_to_cpu(insert_rec
->e_cpos
);
4313 if (type
->ins_appending
== APPEND_NONE
&&
4314 type
->ins_contig
== CONTIG_NONE
) {
4319 ret
= ocfs2_find_path(et
->et_ci
, right_path
, cpos
);
4326 * Rotations and appends need special treatment - they modify
4327 * parts of the tree's above them.
4329 * Both might pass back a path immediate to the left of the
4330 * one being inserted to. This will be cause
4331 * ocfs2_insert_path() to modify the rightmost records of
4332 * left_path to account for an edge insert.
4334 * XXX: When modifying this code, keep in mind that an insert
4335 * can wind up skipping both of these two special cases...
4338 ret
= ocfs2_rotate_tree_right(handle
, et
, type
->ins_split
,
4339 le32_to_cpu(insert_rec
->e_cpos
),
4340 right_path
, &left_path
);
4347 * ocfs2_rotate_tree_right() might have extended the
4348 * transaction without re-journaling our tree root.
4350 ret
= ocfs2_et_root_journal_access(handle
, et
,
4351 OCFS2_JOURNAL_ACCESS_WRITE
);
4356 } else if (type
->ins_appending
== APPEND_TAIL
4357 && type
->ins_contig
!= CONTIG_LEFT
) {
4358 ret
= ocfs2_append_rec_to_path(handle
, et
, insert_rec
,
4359 right_path
, &left_path
);
4366 ret
= ocfs2_insert_path(handle
, et
, left_path
, right_path
,
4373 out_update_clusters
:
4374 if (type
->ins_split
== SPLIT_NONE
)
4375 ocfs2_et_update_clusters(et
,
4376 le16_to_cpu(insert_rec
->e_leaf_clusters
));
4378 ret
= ocfs2_journal_dirty(handle
, et
->et_root_bh
);
4383 ocfs2_free_path(left_path
);
4384 ocfs2_free_path(right_path
);
4389 static enum ocfs2_contig_type
4390 ocfs2_figure_merge_contig_type(struct ocfs2_extent_tree
*et
,
4391 struct ocfs2_path
*path
,
4392 struct ocfs2_extent_list
*el
, int index
,
4393 struct ocfs2_extent_rec
*split_rec
)
4396 enum ocfs2_contig_type ret
= CONTIG_NONE
;
4397 u32 left_cpos
, right_cpos
;
4398 struct ocfs2_extent_rec
*rec
= NULL
;
4399 struct ocfs2_extent_list
*new_el
;
4400 struct ocfs2_path
*left_path
= NULL
, *right_path
= NULL
;
4401 struct buffer_head
*bh
;
4402 struct ocfs2_extent_block
*eb
;
4403 struct super_block
*sb
= ocfs2_metadata_cache_get_super(et
->et_ci
);
4406 rec
= &el
->l_recs
[index
- 1];
4407 } else if (path
->p_tree_depth
> 0) {
4408 status
= ocfs2_find_cpos_for_left_leaf(sb
, path
, &left_cpos
);
4412 if (left_cpos
!= 0) {
4413 left_path
= ocfs2_new_path_from_path(path
);
4417 status
= ocfs2_find_path(et
->et_ci
, left_path
,
4422 new_el
= path_leaf_el(left_path
);
4424 if (le16_to_cpu(new_el
->l_next_free_rec
) !=
4425 le16_to_cpu(new_el
->l_count
)) {
4426 bh
= path_leaf_bh(left_path
);
4427 eb
= (struct ocfs2_extent_block
*)bh
->b_data
;
4429 "Extent block #%llu has an "
4430 "invalid l_next_free_rec of "
4431 "%d. It should have "
4432 "matched the l_count of %d",
4433 (unsigned long long)le64_to_cpu(eb
->h_blkno
),
4434 le16_to_cpu(new_el
->l_next_free_rec
),
4435 le16_to_cpu(new_el
->l_count
));
4439 rec
= &new_el
->l_recs
[
4440 le16_to_cpu(new_el
->l_next_free_rec
) - 1];
4445 * We're careful to check for an empty extent record here -
4446 * the merge code will know what to do if it sees one.
4449 if (index
== 1 && ocfs2_is_empty_extent(rec
)) {
4450 if (split_rec
->e_cpos
== el
->l_recs
[index
].e_cpos
)
4453 ret
= ocfs2_et_extent_contig(et
, rec
, split_rec
);
4458 if (index
< (le16_to_cpu(el
->l_next_free_rec
) - 1))
4459 rec
= &el
->l_recs
[index
+ 1];
4460 else if (le16_to_cpu(el
->l_next_free_rec
) == le16_to_cpu(el
->l_count
) &&
4461 path
->p_tree_depth
> 0) {
4462 status
= ocfs2_find_cpos_for_right_leaf(sb
, path
, &right_cpos
);
4466 if (right_cpos
== 0)
4469 right_path
= ocfs2_new_path_from_path(path
);
4473 status
= ocfs2_find_path(et
->et_ci
, right_path
, right_cpos
);
4477 new_el
= path_leaf_el(right_path
);
4478 rec
= &new_el
->l_recs
[0];
4479 if (ocfs2_is_empty_extent(rec
)) {
4480 if (le16_to_cpu(new_el
->l_next_free_rec
) <= 1) {
4481 bh
= path_leaf_bh(right_path
);
4482 eb
= (struct ocfs2_extent_block
*)bh
->b_data
;
4484 "Extent block #%llu has an "
4485 "invalid l_next_free_rec of %d",
4486 (unsigned long long)le64_to_cpu(eb
->h_blkno
),
4487 le16_to_cpu(new_el
->l_next_free_rec
));
4491 rec
= &new_el
->l_recs
[1];
4496 enum ocfs2_contig_type contig_type
;
4498 contig_type
= ocfs2_et_extent_contig(et
, rec
, split_rec
);
4500 if (contig_type
== CONTIG_LEFT
&& ret
== CONTIG_RIGHT
)
4501 ret
= CONTIG_LEFTRIGHT
;
4502 else if (ret
== CONTIG_NONE
)
4508 ocfs2_free_path(left_path
);
4510 ocfs2_free_path(right_path
);
4515 static void ocfs2_figure_contig_type(struct ocfs2_extent_tree
*et
,
4516 struct ocfs2_insert_type
*insert
,
4517 struct ocfs2_extent_list
*el
,
4518 struct ocfs2_extent_rec
*insert_rec
)
4521 enum ocfs2_contig_type contig_type
= CONTIG_NONE
;
4523 BUG_ON(le16_to_cpu(el
->l_tree_depth
) != 0);
4525 for(i
= 0; i
< le16_to_cpu(el
->l_next_free_rec
); i
++) {
4526 contig_type
= ocfs2_et_extent_contig(et
, &el
->l_recs
[i
],
4528 if (contig_type
!= CONTIG_NONE
) {
4529 insert
->ins_contig_index
= i
;
4533 insert
->ins_contig
= contig_type
;
4535 if (insert
->ins_contig
!= CONTIG_NONE
) {
4536 struct ocfs2_extent_rec
*rec
=
4537 &el
->l_recs
[insert
->ins_contig_index
];
4538 unsigned int len
= le16_to_cpu(rec
->e_leaf_clusters
) +
4539 le16_to_cpu(insert_rec
->e_leaf_clusters
);
4542 * Caller might want us to limit the size of extents, don't
4543 * calculate contiguousness if we might exceed that limit.
4545 if (et
->et_max_leaf_clusters
&&
4546 (len
> et
->et_max_leaf_clusters
))
4547 insert
->ins_contig
= CONTIG_NONE
;
4552 * This should only be called against the righmost leaf extent list.
4554 * ocfs2_figure_appending_type() will figure out whether we'll have to
4555 * insert at the tail of the rightmost leaf.
4557 * This should also work against the root extent list for tree's with 0
4558 * depth. If we consider the root extent list to be the rightmost leaf node
4559 * then the logic here makes sense.
4561 static void ocfs2_figure_appending_type(struct ocfs2_insert_type
*insert
,
4562 struct ocfs2_extent_list
*el
,
4563 struct ocfs2_extent_rec
*insert_rec
)
4566 u32 cpos
= le32_to_cpu(insert_rec
->e_cpos
);
4567 struct ocfs2_extent_rec
*rec
;
4569 insert
->ins_appending
= APPEND_NONE
;
4571 BUG_ON(le16_to_cpu(el
->l_tree_depth
) != 0);
4573 if (!el
->l_next_free_rec
)
4574 goto set_tail_append
;
4576 if (ocfs2_is_empty_extent(&el
->l_recs
[0])) {
4577 /* Were all records empty? */
4578 if (le16_to_cpu(el
->l_next_free_rec
) == 1)
4579 goto set_tail_append
;
4582 i
= le16_to_cpu(el
->l_next_free_rec
) - 1;
4583 rec
= &el
->l_recs
[i
];
4586 (le32_to_cpu(rec
->e_cpos
) + le16_to_cpu(rec
->e_leaf_clusters
)))
4587 goto set_tail_append
;
4592 insert
->ins_appending
= APPEND_TAIL
;
4596 * Helper function called at the begining of an insert.
4598 * This computes a few things that are commonly used in the process of
4599 * inserting into the btree:
4600 * - Whether the new extent is contiguous with an existing one.
4601 * - The current tree depth.
4602 * - Whether the insert is an appending one.
4603 * - The total # of free records in the tree.
4605 * All of the information is stored on the ocfs2_insert_type
4608 static int ocfs2_figure_insert_type(struct ocfs2_extent_tree
*et
,
4609 struct buffer_head
**last_eb_bh
,
4610 struct ocfs2_extent_rec
*insert_rec
,
4612 struct ocfs2_insert_type
*insert
)
4615 struct ocfs2_extent_block
*eb
;
4616 struct ocfs2_extent_list
*el
;
4617 struct ocfs2_path
*path
= NULL
;
4618 struct buffer_head
*bh
= NULL
;
4620 insert
->ins_split
= SPLIT_NONE
;
4622 el
= et
->et_root_el
;
4623 insert
->ins_tree_depth
= le16_to_cpu(el
->l_tree_depth
);
4625 if (el
->l_tree_depth
) {
4627 * If we have tree depth, we read in the
4628 * rightmost extent block ahead of time as
4629 * ocfs2_figure_insert_type() and ocfs2_add_branch()
4630 * may want it later.
4632 ret
= ocfs2_read_extent_block(et
->et_ci
,
4633 ocfs2_et_get_last_eb_blk(et
),
4639 eb
= (struct ocfs2_extent_block
*) bh
->b_data
;
4644 * Unless we have a contiguous insert, we'll need to know if
4645 * there is room left in our allocation tree for another
4648 * XXX: This test is simplistic, we can search for empty
4649 * extent records too.
4651 *free_records
= le16_to_cpu(el
->l_count
) -
4652 le16_to_cpu(el
->l_next_free_rec
);
4654 if (!insert
->ins_tree_depth
) {
4655 ocfs2_figure_contig_type(et
, insert
, el
, insert_rec
);
4656 ocfs2_figure_appending_type(insert
, el
, insert_rec
);
4660 path
= ocfs2_new_path_from_et(et
);
4668 * In the case that we're inserting past what the tree
4669 * currently accounts for, ocfs2_find_path() will return for
4670 * us the rightmost tree path. This is accounted for below in
4671 * the appending code.
4673 ret
= ocfs2_find_path(et
->et_ci
, path
, le32_to_cpu(insert_rec
->e_cpos
));
4679 el
= path_leaf_el(path
);
4682 * Now that we have the path, there's two things we want to determine:
4683 * 1) Contiguousness (also set contig_index if this is so)
4685 * 2) Are we doing an append? We can trivially break this up
4686 * into two types of appends: simple record append, or a
4687 * rotate inside the tail leaf.
4689 ocfs2_figure_contig_type(et
, insert
, el
, insert_rec
);
4692 * The insert code isn't quite ready to deal with all cases of
4693 * left contiguousness. Specifically, if it's an insert into
4694 * the 1st record in a leaf, it will require the adjustment of
4695 * cluster count on the last record of the path directly to it's
4696 * left. For now, just catch that case and fool the layers
4697 * above us. This works just fine for tree_depth == 0, which
4698 * is why we allow that above.
4700 if (insert
->ins_contig
== CONTIG_LEFT
&&
4701 insert
->ins_contig_index
== 0)
4702 insert
->ins_contig
= CONTIG_NONE
;
4705 * Ok, so we can simply compare against last_eb to figure out
4706 * whether the path doesn't exist. This will only happen in
4707 * the case that we're doing a tail append, so maybe we can
4708 * take advantage of that information somehow.
4710 if (ocfs2_et_get_last_eb_blk(et
) ==
4711 path_leaf_bh(path
)->b_blocknr
) {
4713 * Ok, ocfs2_find_path() returned us the rightmost
4714 * tree path. This might be an appending insert. There are
4716 * 1) We're doing a true append at the tail:
4717 * -This might even be off the end of the leaf
4718 * 2) We're "appending" by rotating in the tail
4720 ocfs2_figure_appending_type(insert
, el
, insert_rec
);
4724 ocfs2_free_path(path
);
4734 * Insert an extent into a btree.
4736 * The caller needs to update the owning btree's cluster count.
4738 int ocfs2_insert_extent(handle_t
*handle
,
4739 struct ocfs2_extent_tree
*et
,
4744 struct ocfs2_alloc_context
*meta_ac
)
4747 int uninitialized_var(free_records
);
4748 struct buffer_head
*last_eb_bh
= NULL
;
4749 struct ocfs2_insert_type insert
= {0, };
4750 struct ocfs2_extent_rec rec
;
4752 mlog(0, "add %u clusters at position %u to owner %llu\n",
4754 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
));
4756 memset(&rec
, 0, sizeof(rec
));
4757 rec
.e_cpos
= cpu_to_le32(cpos
);
4758 rec
.e_blkno
= cpu_to_le64(start_blk
);
4759 rec
.e_leaf_clusters
= cpu_to_le16(new_clusters
);
4760 rec
.e_flags
= flags
;
4761 status
= ocfs2_et_insert_check(et
, &rec
);
4767 status
= ocfs2_figure_insert_type(et
, &last_eb_bh
, &rec
,
4768 &free_records
, &insert
);
4774 mlog(0, "Insert.appending: %u, Insert.Contig: %u, "
4775 "Insert.contig_index: %d, Insert.free_records: %d, "
4776 "Insert.tree_depth: %d\n",
4777 insert
.ins_appending
, insert
.ins_contig
, insert
.ins_contig_index
,
4778 free_records
, insert
.ins_tree_depth
);
4780 if (insert
.ins_contig
== CONTIG_NONE
&& free_records
== 0) {
4781 status
= ocfs2_grow_tree(handle
, et
,
4782 &insert
.ins_tree_depth
, &last_eb_bh
,
4790 /* Finally, we can add clusters. This might rotate the tree for us. */
4791 status
= ocfs2_do_insert_extent(handle
, et
, &rec
, &insert
);
4795 ocfs2_et_extent_map_insert(et
, &rec
);
4805 * Allcate and add clusters into the extent b-tree.
4806 * The new clusters(clusters_to_add) will be inserted at logical_offset.
4807 * The extent b-tree's root is specified by et, and
4808 * it is not limited to the file storage. Any extent tree can use this
4809 * function if it implements the proper ocfs2_extent_tree.
4811 int ocfs2_add_clusters_in_btree(handle_t
*handle
,
4812 struct ocfs2_extent_tree
*et
,
4813 u32
*logical_offset
,
4814 u32 clusters_to_add
,
4816 struct ocfs2_alloc_context
*data_ac
,
4817 struct ocfs2_alloc_context
*meta_ac
,
4818 enum ocfs2_alloc_restarted
*reason_ret
)
4822 enum ocfs2_alloc_restarted reason
= RESTART_NONE
;
4823 u32 bit_off
, num_bits
;
4826 struct ocfs2_super
*osb
=
4827 OCFS2_SB(ocfs2_metadata_cache_get_super(et
->et_ci
));
4829 BUG_ON(!clusters_to_add
);
4832 flags
= OCFS2_EXT_UNWRITTEN
;
4834 free_extents
= ocfs2_num_free_extents(osb
, et
);
4835 if (free_extents
< 0) {
4836 status
= free_extents
;
4841 /* there are two cases which could cause us to EAGAIN in the
4842 * we-need-more-metadata case:
4843 * 1) we haven't reserved *any*
4844 * 2) we are so fragmented, we've needed to add metadata too
4846 if (!free_extents
&& !meta_ac
) {
4847 mlog(0, "we haven't reserved any metadata!\n");
4849 reason
= RESTART_META
;
4851 } else if ((!free_extents
)
4852 && (ocfs2_alloc_context_bits_left(meta_ac
)
4853 < ocfs2_extend_meta_needed(et
->et_root_el
))) {
4854 mlog(0, "filesystem is really fragmented...\n");
4856 reason
= RESTART_META
;
4860 status
= __ocfs2_claim_clusters(osb
, handle
, data_ac
, 1,
4861 clusters_to_add
, &bit_off
, &num_bits
);
4863 if (status
!= -ENOSPC
)
4868 BUG_ON(num_bits
> clusters_to_add
);
4870 /* reserve our write early -- insert_extent may update the tree root */
4871 status
= ocfs2_et_root_journal_access(handle
, et
,
4872 OCFS2_JOURNAL_ACCESS_WRITE
);
4878 block
= ocfs2_clusters_to_blocks(osb
->sb
, bit_off
);
4879 mlog(0, "Allocating %u clusters at block %u for owner %llu\n",
4881 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
));
4882 status
= ocfs2_insert_extent(handle
, et
, *logical_offset
, block
,
4883 num_bits
, flags
, meta_ac
);
4889 status
= ocfs2_journal_dirty(handle
, et
->et_root_bh
);
4895 clusters_to_add
-= num_bits
;
4896 *logical_offset
+= num_bits
;
4898 if (clusters_to_add
) {
4899 mlog(0, "need to alloc once more, wanted = %u\n",
4902 reason
= RESTART_TRANS
;
4908 *reason_ret
= reason
;
4912 static void ocfs2_make_right_split_rec(struct super_block
*sb
,
4913 struct ocfs2_extent_rec
*split_rec
,
4915 struct ocfs2_extent_rec
*rec
)
4917 u32 rec_cpos
= le32_to_cpu(rec
->e_cpos
);
4918 u32 rec_range
= rec_cpos
+ le16_to_cpu(rec
->e_leaf_clusters
);
4920 memset(split_rec
, 0, sizeof(struct ocfs2_extent_rec
));
4922 split_rec
->e_cpos
= cpu_to_le32(cpos
);
4923 split_rec
->e_leaf_clusters
= cpu_to_le16(rec_range
- cpos
);
4925 split_rec
->e_blkno
= rec
->e_blkno
;
4926 le64_add_cpu(&split_rec
->e_blkno
,
4927 ocfs2_clusters_to_blocks(sb
, cpos
- rec_cpos
));
4929 split_rec
->e_flags
= rec
->e_flags
;
4932 static int ocfs2_split_and_insert(handle_t
*handle
,
4933 struct ocfs2_extent_tree
*et
,
4934 struct ocfs2_path
*path
,
4935 struct buffer_head
**last_eb_bh
,
4937 struct ocfs2_extent_rec
*orig_split_rec
,
4938 struct ocfs2_alloc_context
*meta_ac
)
4941 unsigned int insert_range
, rec_range
, do_leftright
= 0;
4942 struct ocfs2_extent_rec tmprec
;
4943 struct ocfs2_extent_list
*rightmost_el
;
4944 struct ocfs2_extent_rec rec
;
4945 struct ocfs2_extent_rec split_rec
= *orig_split_rec
;
4946 struct ocfs2_insert_type insert
;
4947 struct ocfs2_extent_block
*eb
;
4951 * Store a copy of the record on the stack - it might move
4952 * around as the tree is manipulated below.
4954 rec
= path_leaf_el(path
)->l_recs
[split_index
];
4956 rightmost_el
= et
->et_root_el
;
4958 depth
= le16_to_cpu(rightmost_el
->l_tree_depth
);
4960 BUG_ON(!(*last_eb_bh
));
4961 eb
= (struct ocfs2_extent_block
*) (*last_eb_bh
)->b_data
;
4962 rightmost_el
= &eb
->h_list
;
4965 if (le16_to_cpu(rightmost_el
->l_next_free_rec
) ==
4966 le16_to_cpu(rightmost_el
->l_count
)) {
4967 ret
= ocfs2_grow_tree(handle
, et
,
4968 &depth
, last_eb_bh
, meta_ac
);
4975 memset(&insert
, 0, sizeof(struct ocfs2_insert_type
));
4976 insert
.ins_appending
= APPEND_NONE
;
4977 insert
.ins_contig
= CONTIG_NONE
;
4978 insert
.ins_tree_depth
= depth
;
4980 insert_range
= le32_to_cpu(split_rec
.e_cpos
) +
4981 le16_to_cpu(split_rec
.e_leaf_clusters
);
4982 rec_range
= le32_to_cpu(rec
.e_cpos
) +
4983 le16_to_cpu(rec
.e_leaf_clusters
);
4985 if (split_rec
.e_cpos
== rec
.e_cpos
) {
4986 insert
.ins_split
= SPLIT_LEFT
;
4987 } else if (insert_range
== rec_range
) {
4988 insert
.ins_split
= SPLIT_RIGHT
;
4991 * Left/right split. We fake this as a right split
4992 * first and then make a second pass as a left split.
4994 insert
.ins_split
= SPLIT_RIGHT
;
4996 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et
->et_ci
),
4997 &tmprec
, insert_range
, &rec
);
5001 BUG_ON(do_leftright
);
5005 ret
= ocfs2_do_insert_extent(handle
, et
, &split_rec
, &insert
);
5011 if (do_leftright
== 1) {
5013 struct ocfs2_extent_list
*el
;
5016 split_rec
= *orig_split_rec
;
5018 ocfs2_reinit_path(path
, 1);
5020 cpos
= le32_to_cpu(split_rec
.e_cpos
);
5021 ret
= ocfs2_find_path(et
->et_ci
, path
, cpos
);
5027 el
= path_leaf_el(path
);
5028 split_index
= ocfs2_search_extent_list(el
, cpos
);
5036 static int ocfs2_replace_extent_rec(handle_t
*handle
,
5037 struct ocfs2_extent_tree
*et
,
5038 struct ocfs2_path
*path
,
5039 struct ocfs2_extent_list
*el
,
5041 struct ocfs2_extent_rec
*split_rec
)
5045 ret
= ocfs2_path_bh_journal_access(handle
, et
->et_ci
, path
,
5046 path_num_items(path
) - 1);
5052 el
->l_recs
[split_index
] = *split_rec
;
5054 ocfs2_journal_dirty(handle
, path_leaf_bh(path
));
5060 * Split part or all of the extent record at split_index in the leaf
5061 * pointed to by path. Merge with the contiguous extent record if needed.
5063 * Care is taken to handle contiguousness so as to not grow the tree.
5065 * meta_ac is not strictly necessary - we only truly need it if growth
5066 * of the tree is required. All other cases will degrade into a less
5067 * optimal tree layout.
5069 * last_eb_bh should be the rightmost leaf block for any extent
5070 * btree. Since a split may grow the tree or a merge might shrink it,
5071 * the caller cannot trust the contents of that buffer after this call.
5073 * This code is optimized for readability - several passes might be
5074 * made over certain portions of the tree. All of those blocks will
5075 * have been brought into cache (and pinned via the journal), so the
5076 * extra overhead is not expressed in terms of disk reads.
5078 int ocfs2_split_extent(handle_t
*handle
,
5079 struct ocfs2_extent_tree
*et
,
5080 struct ocfs2_path
*path
,
5082 struct ocfs2_extent_rec
*split_rec
,
5083 struct ocfs2_alloc_context
*meta_ac
,
5084 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
5087 struct ocfs2_extent_list
*el
= path_leaf_el(path
);
5088 struct buffer_head
*last_eb_bh
= NULL
;
5089 struct ocfs2_extent_rec
*rec
= &el
->l_recs
[split_index
];
5090 struct ocfs2_merge_ctxt ctxt
;
5091 struct ocfs2_extent_list
*rightmost_el
;
5093 if (le32_to_cpu(rec
->e_cpos
) > le32_to_cpu(split_rec
->e_cpos
) ||
5094 ((le32_to_cpu(rec
->e_cpos
) + le16_to_cpu(rec
->e_leaf_clusters
)) <
5095 (le32_to_cpu(split_rec
->e_cpos
) + le16_to_cpu(split_rec
->e_leaf_clusters
)))) {
5101 ctxt
.c_contig_type
= ocfs2_figure_merge_contig_type(et
, path
, el
,
5106 * The core merge / split code wants to know how much room is
5107 * left in this allocation tree, so we pass the
5108 * rightmost extent list.
5110 if (path
->p_tree_depth
) {
5111 struct ocfs2_extent_block
*eb
;
5113 ret
= ocfs2_read_extent_block(et
->et_ci
,
5114 ocfs2_et_get_last_eb_blk(et
),
5121 eb
= (struct ocfs2_extent_block
*) last_eb_bh
->b_data
;
5122 rightmost_el
= &eb
->h_list
;
5124 rightmost_el
= path_root_el(path
);
5126 if (rec
->e_cpos
== split_rec
->e_cpos
&&
5127 rec
->e_leaf_clusters
== split_rec
->e_leaf_clusters
)
5128 ctxt
.c_split_covers_rec
= 1;
5130 ctxt
.c_split_covers_rec
= 0;
5132 ctxt
.c_has_empty_extent
= ocfs2_is_empty_extent(&el
->l_recs
[0]);
5134 mlog(0, "index: %d, contig: %u, has_empty: %u, split_covers: %u\n",
5135 split_index
, ctxt
.c_contig_type
, ctxt
.c_has_empty_extent
,
5136 ctxt
.c_split_covers_rec
);
5138 if (ctxt
.c_contig_type
== CONTIG_NONE
) {
5139 if (ctxt
.c_split_covers_rec
)
5140 ret
= ocfs2_replace_extent_rec(handle
, et
, path
, el
,
5141 split_index
, split_rec
);
5143 ret
= ocfs2_split_and_insert(handle
, et
, path
,
5144 &last_eb_bh
, split_index
,
5145 split_rec
, meta_ac
);
5149 ret
= ocfs2_try_to_merge_extent(handle
, et
, path
,
5150 split_index
, split_rec
,
5162 * Change the flags of the already-existing extent at cpos for len clusters.
5164 * new_flags: the flags we want to set.
5165 * clear_flags: the flags we want to clear.
5166 * phys: the new physical offset we want this new extent starts from.
5168 * If the existing extent is larger than the request, initiate a
5169 * split. An attempt will be made at merging with adjacent extents.
5171 * The caller is responsible for passing down meta_ac if we'll need it.
5173 int ocfs2_change_extent_flag(handle_t
*handle
,
5174 struct ocfs2_extent_tree
*et
,
5175 u32 cpos
, u32 len
, u32 phys
,
5176 struct ocfs2_alloc_context
*meta_ac
,
5177 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
5178 int new_flags
, int clear_flags
)
5181 struct super_block
*sb
= ocfs2_metadata_cache_get_super(et
->et_ci
);
5182 u64 start_blkno
= ocfs2_clusters_to_blocks(sb
, phys
);
5183 struct ocfs2_extent_rec split_rec
;
5184 struct ocfs2_path
*left_path
= NULL
;
5185 struct ocfs2_extent_list
*el
;
5186 struct ocfs2_extent_rec
*rec
;
5188 left_path
= ocfs2_new_path_from_et(et
);
5195 ret
= ocfs2_find_path(et
->et_ci
, left_path
, cpos
);
5200 el
= path_leaf_el(left_path
);
5202 index
= ocfs2_search_extent_list(el
, cpos
);
5203 if (index
== -1 || index
>= le16_to_cpu(el
->l_next_free_rec
)) {
5205 "Owner %llu has an extent at cpos %u which can no "
5206 "longer be found.\n",
5207 (unsigned long long)
5208 ocfs2_metadata_cache_owner(et
->et_ci
), cpos
);
5214 rec
= &el
->l_recs
[index
];
5215 if (new_flags
&& (rec
->e_flags
& new_flags
)) {
5216 mlog(ML_ERROR
, "Owner %llu tried to set %d flags on an "
5217 "extent that already had them",
5218 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5223 if (clear_flags
&& !(rec
->e_flags
& clear_flags
)) {
5224 mlog(ML_ERROR
, "Owner %llu tried to clear %d flags on an "
5225 "extent that didn't have them",
5226 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5231 memset(&split_rec
, 0, sizeof(struct ocfs2_extent_rec
));
5232 split_rec
.e_cpos
= cpu_to_le32(cpos
);
5233 split_rec
.e_leaf_clusters
= cpu_to_le16(len
);
5234 split_rec
.e_blkno
= cpu_to_le64(start_blkno
);
5235 split_rec
.e_flags
= rec
->e_flags
;
5237 split_rec
.e_flags
|= new_flags
;
5239 split_rec
.e_flags
&= ~clear_flags
;
5241 ret
= ocfs2_split_extent(handle
, et
, left_path
,
5242 index
, &split_rec
, meta_ac
,
5248 ocfs2_free_path(left_path
);
5254 * Mark the already-existing extent at cpos as written for len clusters.
5255 * This removes the unwritten extent flag.
5257 * If the existing extent is larger than the request, initiate a
5258 * split. An attempt will be made at merging with adjacent extents.
5260 * The caller is responsible for passing down meta_ac if we'll need it.
5262 int ocfs2_mark_extent_written(struct inode
*inode
,
5263 struct ocfs2_extent_tree
*et
,
5264 handle_t
*handle
, u32 cpos
, u32 len
, u32 phys
,
5265 struct ocfs2_alloc_context
*meta_ac
,
5266 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
5270 mlog(0, "Inode %lu cpos %u, len %u, phys clusters %u\n",
5271 inode
->i_ino
, cpos
, len
, phys
);
5273 if (!ocfs2_writes_unwritten_extents(OCFS2_SB(inode
->i_sb
))) {
5274 ocfs2_error(inode
->i_sb
, "Inode %llu has unwritten extents "
5275 "that are being written to, but the feature bit "
5276 "is not set in the super block.",
5277 (unsigned long long)OCFS2_I(inode
)->ip_blkno
);
5283 * XXX: This should be fixed up so that we just re-insert the
5284 * next extent records.
5286 ocfs2_et_extent_map_truncate(et
, 0);
5288 ret
= ocfs2_change_extent_flag(handle
, et
, cpos
,
5289 len
, phys
, meta_ac
, dealloc
,
5290 0, OCFS2_EXT_UNWRITTEN
);
5298 static int ocfs2_split_tree(handle_t
*handle
, struct ocfs2_extent_tree
*et
,
5299 struct ocfs2_path
*path
,
5300 int index
, u32 new_range
,
5301 struct ocfs2_alloc_context
*meta_ac
)
5303 int ret
, depth
, credits
= handle
->h_buffer_credits
;
5304 struct buffer_head
*last_eb_bh
= NULL
;
5305 struct ocfs2_extent_block
*eb
;
5306 struct ocfs2_extent_list
*rightmost_el
, *el
;
5307 struct ocfs2_extent_rec split_rec
;
5308 struct ocfs2_extent_rec
*rec
;
5309 struct ocfs2_insert_type insert
;
5312 * Setup the record to split before we grow the tree.
5314 el
= path_leaf_el(path
);
5315 rec
= &el
->l_recs
[index
];
5316 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et
->et_ci
),
5317 &split_rec
, new_range
, rec
);
5319 depth
= path
->p_tree_depth
;
5321 ret
= ocfs2_read_extent_block(et
->et_ci
,
5322 ocfs2_et_get_last_eb_blk(et
),
5329 eb
= (struct ocfs2_extent_block
*) last_eb_bh
->b_data
;
5330 rightmost_el
= &eb
->h_list
;
5332 rightmost_el
= path_leaf_el(path
);
5334 credits
+= path
->p_tree_depth
+
5335 ocfs2_extend_meta_needed(et
->et_root_el
);
5336 ret
= ocfs2_extend_trans(handle
, credits
);
5342 if (le16_to_cpu(rightmost_el
->l_next_free_rec
) ==
5343 le16_to_cpu(rightmost_el
->l_count
)) {
5344 ret
= ocfs2_grow_tree(handle
, et
, &depth
, &last_eb_bh
,
5352 memset(&insert
, 0, sizeof(struct ocfs2_insert_type
));
5353 insert
.ins_appending
= APPEND_NONE
;
5354 insert
.ins_contig
= CONTIG_NONE
;
5355 insert
.ins_split
= SPLIT_RIGHT
;
5356 insert
.ins_tree_depth
= depth
;
5358 ret
= ocfs2_do_insert_extent(handle
, et
, &split_rec
, &insert
);
5367 static int ocfs2_truncate_rec(handle_t
*handle
,
5368 struct ocfs2_extent_tree
*et
,
5369 struct ocfs2_path
*path
, int index
,
5370 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
5374 u32 left_cpos
, rec_range
, trunc_range
;
5375 int wants_rotate
= 0, is_rightmost_tree_rec
= 0;
5376 struct super_block
*sb
= ocfs2_metadata_cache_get_super(et
->et_ci
);
5377 struct ocfs2_path
*left_path
= NULL
;
5378 struct ocfs2_extent_list
*el
= path_leaf_el(path
);
5379 struct ocfs2_extent_rec
*rec
;
5380 struct ocfs2_extent_block
*eb
;
5382 if (ocfs2_is_empty_extent(&el
->l_recs
[0]) && index
> 0) {
5383 ret
= ocfs2_rotate_tree_left(handle
, et
, path
, dealloc
);
5392 if (index
== (le16_to_cpu(el
->l_next_free_rec
) - 1) &&
5393 path
->p_tree_depth
) {
5395 * Check whether this is the rightmost tree record. If
5396 * we remove all of this record or part of its right
5397 * edge then an update of the record lengths above it
5400 eb
= (struct ocfs2_extent_block
*)path_leaf_bh(path
)->b_data
;
5401 if (eb
->h_next_leaf_blk
== 0)
5402 is_rightmost_tree_rec
= 1;
5405 rec
= &el
->l_recs
[index
];
5406 if (index
== 0 && path
->p_tree_depth
&&
5407 le32_to_cpu(rec
->e_cpos
) == cpos
) {
5409 * Changing the leftmost offset (via partial or whole
5410 * record truncate) of an interior (or rightmost) path
5411 * means we have to update the subtree that is formed
5412 * by this leaf and the one to it's left.
5414 * There are two cases we can skip:
5415 * 1) Path is the leftmost one in our btree.
5416 * 2) The leaf is rightmost and will be empty after
5417 * we remove the extent record - the rotate code
5418 * knows how to update the newly formed edge.
5421 ret
= ocfs2_find_cpos_for_left_leaf(sb
, path
, &left_cpos
);
5427 if (left_cpos
&& le16_to_cpu(el
->l_next_free_rec
) > 1) {
5428 left_path
= ocfs2_new_path_from_path(path
);
5435 ret
= ocfs2_find_path(et
->et_ci
, left_path
,
5444 ret
= ocfs2_extend_rotate_transaction(handle
, 0,
5445 handle
->h_buffer_credits
,
5452 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, path
);
5458 ret
= ocfs2_journal_access_path(et
->et_ci
, handle
, left_path
);
5464 rec_range
= le32_to_cpu(rec
->e_cpos
) + ocfs2_rec_clusters(el
, rec
);
5465 trunc_range
= cpos
+ len
;
5467 if (le32_to_cpu(rec
->e_cpos
) == cpos
&& rec_range
== trunc_range
) {
5470 memset(rec
, 0, sizeof(*rec
));
5471 ocfs2_cleanup_merge(el
, index
);
5474 next_free
= le16_to_cpu(el
->l_next_free_rec
);
5475 if (is_rightmost_tree_rec
&& next_free
> 1) {
5477 * We skip the edge update if this path will
5478 * be deleted by the rotate code.
5480 rec
= &el
->l_recs
[next_free
- 1];
5481 ocfs2_adjust_rightmost_records(handle
, et
, path
,
5484 } else if (le32_to_cpu(rec
->e_cpos
) == cpos
) {
5485 /* Remove leftmost portion of the record. */
5486 le32_add_cpu(&rec
->e_cpos
, len
);
5487 le64_add_cpu(&rec
->e_blkno
, ocfs2_clusters_to_blocks(sb
, len
));
5488 le16_add_cpu(&rec
->e_leaf_clusters
, -len
);
5489 } else if (rec_range
== trunc_range
) {
5490 /* Remove rightmost portion of the record */
5491 le16_add_cpu(&rec
->e_leaf_clusters
, -len
);
5492 if (is_rightmost_tree_rec
)
5493 ocfs2_adjust_rightmost_records(handle
, et
, path
, rec
);
5495 /* Caller should have trapped this. */
5496 mlog(ML_ERROR
, "Owner %llu: Invalid record truncate: (%u, %u) "
5498 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5499 le32_to_cpu(rec
->e_cpos
),
5500 le16_to_cpu(rec
->e_leaf_clusters
), cpos
, len
);
5507 subtree_index
= ocfs2_find_subtree_root(et
, left_path
, path
);
5508 ocfs2_complete_edge_insert(handle
, left_path
, path
,
5512 ocfs2_journal_dirty(handle
, path_leaf_bh(path
));
5514 ret
= ocfs2_rotate_tree_left(handle
, et
, path
, dealloc
);
5521 ocfs2_free_path(left_path
);
5525 int ocfs2_remove_extent(handle_t
*handle
,
5526 struct ocfs2_extent_tree
*et
,
5528 struct ocfs2_alloc_context
*meta_ac
,
5529 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
5532 u32 rec_range
, trunc_range
;
5533 struct ocfs2_extent_rec
*rec
;
5534 struct ocfs2_extent_list
*el
;
5535 struct ocfs2_path
*path
= NULL
;
5538 * XXX: Why are we truncating to 0 instead of wherever this
5541 ocfs2_et_extent_map_truncate(et
, 0);
5543 path
= ocfs2_new_path_from_et(et
);
5550 ret
= ocfs2_find_path(et
->et_ci
, path
, cpos
);
5556 el
= path_leaf_el(path
);
5557 index
= ocfs2_search_extent_list(el
, cpos
);
5558 if (index
== -1 || index
>= le16_to_cpu(el
->l_next_free_rec
)) {
5559 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
5560 "Owner %llu has an extent at cpos %u which can no "
5561 "longer be found.\n",
5562 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5569 * We have 3 cases of extent removal:
5570 * 1) Range covers the entire extent rec
5571 * 2) Range begins or ends on one edge of the extent rec
5572 * 3) Range is in the middle of the extent rec (no shared edges)
5574 * For case 1 we remove the extent rec and left rotate to
5577 * For case 2 we just shrink the existing extent rec, with a
5578 * tree update if the shrinking edge is also the edge of an
5581 * For case 3 we do a right split to turn the extent rec into
5582 * something case 2 can handle.
5584 rec
= &el
->l_recs
[index
];
5585 rec_range
= le32_to_cpu(rec
->e_cpos
) + ocfs2_rec_clusters(el
, rec
);
5586 trunc_range
= cpos
+ len
;
5588 BUG_ON(cpos
< le32_to_cpu(rec
->e_cpos
) || trunc_range
> rec_range
);
5590 mlog(0, "Owner %llu, remove (cpos %u, len %u). Existing index %d "
5591 "(cpos %u, len %u)\n",
5592 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5594 le32_to_cpu(rec
->e_cpos
), ocfs2_rec_clusters(el
, rec
));
5596 if (le32_to_cpu(rec
->e_cpos
) == cpos
|| rec_range
== trunc_range
) {
5597 ret
= ocfs2_truncate_rec(handle
, et
, path
, index
, dealloc
,
5604 ret
= ocfs2_split_tree(handle
, et
, path
, index
,
5605 trunc_range
, meta_ac
);
5612 * The split could have manipulated the tree enough to
5613 * move the record location, so we have to look for it again.
5615 ocfs2_reinit_path(path
, 1);
5617 ret
= ocfs2_find_path(et
->et_ci
, path
, cpos
);
5623 el
= path_leaf_el(path
);
5624 index
= ocfs2_search_extent_list(el
, cpos
);
5625 if (index
== -1 || index
>= le16_to_cpu(el
->l_next_free_rec
)) {
5626 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
5627 "Owner %llu: split at cpos %u lost record.",
5628 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5635 * Double check our values here. If anything is fishy,
5636 * it's easier to catch it at the top level.
5638 rec
= &el
->l_recs
[index
];
5639 rec_range
= le32_to_cpu(rec
->e_cpos
) +
5640 ocfs2_rec_clusters(el
, rec
);
5641 if (rec_range
!= trunc_range
) {
5642 ocfs2_error(ocfs2_metadata_cache_get_super(et
->et_ci
),
5643 "Owner %llu: error after split at cpos %u"
5644 "trunc len %u, existing record is (%u,%u)",
5645 (unsigned long long)ocfs2_metadata_cache_owner(et
->et_ci
),
5646 cpos
, len
, le32_to_cpu(rec
->e_cpos
),
5647 ocfs2_rec_clusters(el
, rec
));
5652 ret
= ocfs2_truncate_rec(handle
, et
, path
, index
, dealloc
,
5661 ocfs2_free_path(path
);
5665 int ocfs2_remove_btree_range(struct inode
*inode
,
5666 struct ocfs2_extent_tree
*et
,
5667 u32 cpos
, u32 phys_cpos
, u32 len
,
5668 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
5671 u64 phys_blkno
= ocfs2_clusters_to_blocks(inode
->i_sb
, phys_cpos
);
5672 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5673 struct inode
*tl_inode
= osb
->osb_tl_inode
;
5675 struct ocfs2_alloc_context
*meta_ac
= NULL
;
5677 ret
= ocfs2_lock_allocators(inode
, et
, 0, 1, NULL
, &meta_ac
);
5683 mutex_lock(&tl_inode
->i_mutex
);
5685 if (ocfs2_truncate_log_needs_flush(osb
)) {
5686 ret
= __ocfs2_flush_truncate_log(osb
);
5693 handle
= ocfs2_start_trans(osb
, ocfs2_remove_extent_credits(osb
->sb
));
5694 if (IS_ERR(handle
)) {
5695 ret
= PTR_ERR(handle
);
5700 ret
= ocfs2_et_root_journal_access(handle
, et
,
5701 OCFS2_JOURNAL_ACCESS_WRITE
);
5707 vfs_dq_free_space_nodirty(inode
,
5708 ocfs2_clusters_to_bytes(inode
->i_sb
, len
));
5710 ret
= ocfs2_remove_extent(handle
, et
, cpos
, len
, meta_ac
, dealloc
);
5716 ocfs2_et_update_clusters(et
, -len
);
5718 ret
= ocfs2_journal_dirty(handle
, et
->et_root_bh
);
5724 ret
= ocfs2_truncate_log_append(osb
, handle
, phys_blkno
, len
);
5729 ocfs2_commit_trans(osb
, handle
);
5731 mutex_unlock(&tl_inode
->i_mutex
);
5734 ocfs2_free_alloc_context(meta_ac
);
5739 int ocfs2_truncate_log_needs_flush(struct ocfs2_super
*osb
)
5741 struct buffer_head
*tl_bh
= osb
->osb_tl_bh
;
5742 struct ocfs2_dinode
*di
;
5743 struct ocfs2_truncate_log
*tl
;
5745 di
= (struct ocfs2_dinode
*) tl_bh
->b_data
;
5746 tl
= &di
->id2
.i_dealloc
;
5748 mlog_bug_on_msg(le16_to_cpu(tl
->tl_used
) > le16_to_cpu(tl
->tl_count
),
5749 "slot %d, invalid truncate log parameters: used = "
5750 "%u, count = %u\n", osb
->slot_num
,
5751 le16_to_cpu(tl
->tl_used
), le16_to_cpu(tl
->tl_count
));
5752 return le16_to_cpu(tl
->tl_used
) == le16_to_cpu(tl
->tl_count
);
5755 static int ocfs2_truncate_log_can_coalesce(struct ocfs2_truncate_log
*tl
,
5756 unsigned int new_start
)
5758 unsigned int tail_index
;
5759 unsigned int current_tail
;
5761 /* No records, nothing to coalesce */
5762 if (!le16_to_cpu(tl
->tl_used
))
5765 tail_index
= le16_to_cpu(tl
->tl_used
) - 1;
5766 current_tail
= le32_to_cpu(tl
->tl_recs
[tail_index
].t_start
);
5767 current_tail
+= le32_to_cpu(tl
->tl_recs
[tail_index
].t_clusters
);
5769 return current_tail
== new_start
;
5772 int ocfs2_truncate_log_append(struct ocfs2_super
*osb
,
5775 unsigned int num_clusters
)
5778 unsigned int start_cluster
, tl_count
;
5779 struct inode
*tl_inode
= osb
->osb_tl_inode
;
5780 struct buffer_head
*tl_bh
= osb
->osb_tl_bh
;
5781 struct ocfs2_dinode
*di
;
5782 struct ocfs2_truncate_log
*tl
;
5784 mlog_entry("start_blk = %llu, num_clusters = %u\n",
5785 (unsigned long long)start_blk
, num_clusters
);
5787 BUG_ON(mutex_trylock(&tl_inode
->i_mutex
));
5789 start_cluster
= ocfs2_blocks_to_clusters(osb
->sb
, start_blk
);
5791 di
= (struct ocfs2_dinode
*) tl_bh
->b_data
;
5793 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5794 * by the underlying call to ocfs2_read_inode_block(), so any
5795 * corruption is a code bug */
5796 BUG_ON(!OCFS2_IS_VALID_DINODE(di
));
5798 tl
= &di
->id2
.i_dealloc
;
5799 tl_count
= le16_to_cpu(tl
->tl_count
);
5800 mlog_bug_on_msg(tl_count
> ocfs2_truncate_recs_per_inode(osb
->sb
) ||
5802 "Truncate record count on #%llu invalid "
5803 "wanted %u, actual %u\n",
5804 (unsigned long long)OCFS2_I(tl_inode
)->ip_blkno
,
5805 ocfs2_truncate_recs_per_inode(osb
->sb
),
5806 le16_to_cpu(tl
->tl_count
));
5808 /* Caller should have known to flush before calling us. */
5809 index
= le16_to_cpu(tl
->tl_used
);
5810 if (index
>= tl_count
) {
5816 status
= ocfs2_journal_access_di(handle
, INODE_CACHE(tl_inode
), tl_bh
,
5817 OCFS2_JOURNAL_ACCESS_WRITE
);
5823 mlog(0, "Log truncate of %u clusters starting at cluster %u to "
5824 "%llu (index = %d)\n", num_clusters
, start_cluster
,
5825 (unsigned long long)OCFS2_I(tl_inode
)->ip_blkno
, index
);
5827 if (ocfs2_truncate_log_can_coalesce(tl
, start_cluster
)) {
5829 * Move index back to the record we are coalescing with.
5830 * ocfs2_truncate_log_can_coalesce() guarantees nonzero
5834 num_clusters
+= le32_to_cpu(tl
->tl_recs
[index
].t_clusters
);
5835 mlog(0, "Coalesce with index %u (start = %u, clusters = %u)\n",
5836 index
, le32_to_cpu(tl
->tl_recs
[index
].t_start
),
5839 tl
->tl_recs
[index
].t_start
= cpu_to_le32(start_cluster
);
5840 tl
->tl_used
= cpu_to_le16(index
+ 1);
5842 tl
->tl_recs
[index
].t_clusters
= cpu_to_le32(num_clusters
);
5844 status
= ocfs2_journal_dirty(handle
, tl_bh
);
5855 static int ocfs2_replay_truncate_records(struct ocfs2_super
*osb
,
5857 struct inode
*data_alloc_inode
,
5858 struct buffer_head
*data_alloc_bh
)
5862 unsigned int num_clusters
;
5864 struct ocfs2_truncate_rec rec
;
5865 struct ocfs2_dinode
*di
;
5866 struct ocfs2_truncate_log
*tl
;
5867 struct inode
*tl_inode
= osb
->osb_tl_inode
;
5868 struct buffer_head
*tl_bh
= osb
->osb_tl_bh
;
5872 di
= (struct ocfs2_dinode
*) tl_bh
->b_data
;
5873 tl
= &di
->id2
.i_dealloc
;
5874 i
= le16_to_cpu(tl
->tl_used
) - 1;
5876 /* Caller has given us at least enough credits to
5877 * update the truncate log dinode */
5878 status
= ocfs2_journal_access_di(handle
, INODE_CACHE(tl_inode
), tl_bh
,
5879 OCFS2_JOURNAL_ACCESS_WRITE
);
5885 tl
->tl_used
= cpu_to_le16(i
);
5887 status
= ocfs2_journal_dirty(handle
, tl_bh
);
5893 /* TODO: Perhaps we can calculate the bulk of the
5894 * credits up front rather than extending like
5896 status
= ocfs2_extend_trans(handle
,
5897 OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC
);
5903 rec
= tl
->tl_recs
[i
];
5904 start_blk
= ocfs2_clusters_to_blocks(data_alloc_inode
->i_sb
,
5905 le32_to_cpu(rec
.t_start
));
5906 num_clusters
= le32_to_cpu(rec
.t_clusters
);
5908 /* if start_blk is not set, we ignore the record as
5911 mlog(0, "free record %d, start = %u, clusters = %u\n",
5912 i
, le32_to_cpu(rec
.t_start
), num_clusters
);
5914 status
= ocfs2_free_clusters(handle
, data_alloc_inode
,
5915 data_alloc_bh
, start_blk
,
5930 /* Expects you to already be holding tl_inode->i_mutex */
5931 int __ocfs2_flush_truncate_log(struct ocfs2_super
*osb
)
5934 unsigned int num_to_flush
;
5936 struct inode
*tl_inode
= osb
->osb_tl_inode
;
5937 struct inode
*data_alloc_inode
= NULL
;
5938 struct buffer_head
*tl_bh
= osb
->osb_tl_bh
;
5939 struct buffer_head
*data_alloc_bh
= NULL
;
5940 struct ocfs2_dinode
*di
;
5941 struct ocfs2_truncate_log
*tl
;
5945 BUG_ON(mutex_trylock(&tl_inode
->i_mutex
));
5947 di
= (struct ocfs2_dinode
*) tl_bh
->b_data
;
5949 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5950 * by the underlying call to ocfs2_read_inode_block(), so any
5951 * corruption is a code bug */
5952 BUG_ON(!OCFS2_IS_VALID_DINODE(di
));
5954 tl
= &di
->id2
.i_dealloc
;
5955 num_to_flush
= le16_to_cpu(tl
->tl_used
);
5956 mlog(0, "Flush %u records from truncate log #%llu\n",
5957 num_to_flush
, (unsigned long long)OCFS2_I(tl_inode
)->ip_blkno
);
5958 if (!num_to_flush
) {
5963 data_alloc_inode
= ocfs2_get_system_file_inode(osb
,
5964 GLOBAL_BITMAP_SYSTEM_INODE
,
5965 OCFS2_INVALID_SLOT
);
5966 if (!data_alloc_inode
) {
5968 mlog(ML_ERROR
, "Could not get bitmap inode!\n");
5972 mutex_lock(&data_alloc_inode
->i_mutex
);
5974 status
= ocfs2_inode_lock(data_alloc_inode
, &data_alloc_bh
, 1);
5980 handle
= ocfs2_start_trans(osb
, OCFS2_TRUNCATE_LOG_UPDATE
);
5981 if (IS_ERR(handle
)) {
5982 status
= PTR_ERR(handle
);
5987 status
= ocfs2_replay_truncate_records(osb
, handle
, data_alloc_inode
,
5992 ocfs2_commit_trans(osb
, handle
);
5995 brelse(data_alloc_bh
);
5996 ocfs2_inode_unlock(data_alloc_inode
, 1);
5999 mutex_unlock(&data_alloc_inode
->i_mutex
);
6000 iput(data_alloc_inode
);
6007 int ocfs2_flush_truncate_log(struct ocfs2_super
*osb
)
6010 struct inode
*tl_inode
= osb
->osb_tl_inode
;
6012 mutex_lock(&tl_inode
->i_mutex
);
6013 status
= __ocfs2_flush_truncate_log(osb
);
6014 mutex_unlock(&tl_inode
->i_mutex
);
6019 static void ocfs2_truncate_log_worker(struct work_struct
*work
)
6022 struct ocfs2_super
*osb
=
6023 container_of(work
, struct ocfs2_super
,
6024 osb_truncate_log_wq
.work
);
6028 status
= ocfs2_flush_truncate_log(osb
);
6032 ocfs2_init_inode_steal_slot(osb
);
6037 #define OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL (2 * HZ)
6038 void ocfs2_schedule_truncate_log_flush(struct ocfs2_super
*osb
,
6041 if (osb
->osb_tl_inode
) {
6042 /* We want to push off log flushes while truncates are
6045 cancel_delayed_work(&osb
->osb_truncate_log_wq
);
6047 queue_delayed_work(ocfs2_wq
, &osb
->osb_truncate_log_wq
,
6048 OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL
);
6052 static int ocfs2_get_truncate_log_info(struct ocfs2_super
*osb
,
6054 struct inode
**tl_inode
,
6055 struct buffer_head
**tl_bh
)
6058 struct inode
*inode
= NULL
;
6059 struct buffer_head
*bh
= NULL
;
6061 inode
= ocfs2_get_system_file_inode(osb
,
6062 TRUNCATE_LOG_SYSTEM_INODE
,
6066 mlog(ML_ERROR
, "Could not get load truncate log inode!\n");
6070 status
= ocfs2_read_inode_block(inode
, &bh
);
6084 /* called during the 1st stage of node recovery. we stamp a clean
6085 * truncate log and pass back a copy for processing later. if the
6086 * truncate log does not require processing, a *tl_copy is set to
6088 int ocfs2_begin_truncate_log_recovery(struct ocfs2_super
*osb
,
6090 struct ocfs2_dinode
**tl_copy
)
6093 struct inode
*tl_inode
= NULL
;
6094 struct buffer_head
*tl_bh
= NULL
;
6095 struct ocfs2_dinode
*di
;
6096 struct ocfs2_truncate_log
*tl
;
6100 mlog(0, "recover truncate log from slot %d\n", slot_num
);
6102 status
= ocfs2_get_truncate_log_info(osb
, slot_num
, &tl_inode
, &tl_bh
);
6108 di
= (struct ocfs2_dinode
*) tl_bh
->b_data
;
6110 /* tl_bh is loaded from ocfs2_get_truncate_log_info(). It's
6111 * validated by the underlying call to ocfs2_read_inode_block(),
6112 * so any corruption is a code bug */
6113 BUG_ON(!OCFS2_IS_VALID_DINODE(di
));
6115 tl
= &di
->id2
.i_dealloc
;
6116 if (le16_to_cpu(tl
->tl_used
)) {
6117 mlog(0, "We'll have %u logs to recover\n",
6118 le16_to_cpu(tl
->tl_used
));
6120 *tl_copy
= kmalloc(tl_bh
->b_size
, GFP_KERNEL
);
6127 /* Assuming the write-out below goes well, this copy
6128 * will be passed back to recovery for processing. */
6129 memcpy(*tl_copy
, tl_bh
->b_data
, tl_bh
->b_size
);
6131 /* All we need to do to clear the truncate log is set
6135 ocfs2_compute_meta_ecc(osb
->sb
, tl_bh
->b_data
, &di
->i_check
);
6136 status
= ocfs2_write_block(osb
, tl_bh
, INODE_CACHE(tl_inode
));
6148 if (status
< 0 && (*tl_copy
)) {
6157 int ocfs2_complete_truncate_log_recovery(struct ocfs2_super
*osb
,
6158 struct ocfs2_dinode
*tl_copy
)
6162 unsigned int clusters
, num_recs
, start_cluster
;
6165 struct inode
*tl_inode
= osb
->osb_tl_inode
;
6166 struct ocfs2_truncate_log
*tl
;
6170 if (OCFS2_I(tl_inode
)->ip_blkno
== le64_to_cpu(tl_copy
->i_blkno
)) {
6171 mlog(ML_ERROR
, "Asked to recover my own truncate log!\n");
6175 tl
= &tl_copy
->id2
.i_dealloc
;
6176 num_recs
= le16_to_cpu(tl
->tl_used
);
6177 mlog(0, "cleanup %u records from %llu\n", num_recs
,
6178 (unsigned long long)le64_to_cpu(tl_copy
->i_blkno
));
6180 mutex_lock(&tl_inode
->i_mutex
);
6181 for(i
= 0; i
< num_recs
; i
++) {
6182 if (ocfs2_truncate_log_needs_flush(osb
)) {
6183 status
= __ocfs2_flush_truncate_log(osb
);
6190 handle
= ocfs2_start_trans(osb
, OCFS2_TRUNCATE_LOG_UPDATE
);
6191 if (IS_ERR(handle
)) {
6192 status
= PTR_ERR(handle
);
6197 clusters
= le32_to_cpu(tl
->tl_recs
[i
].t_clusters
);
6198 start_cluster
= le32_to_cpu(tl
->tl_recs
[i
].t_start
);
6199 start_blk
= ocfs2_clusters_to_blocks(osb
->sb
, start_cluster
);
6201 status
= ocfs2_truncate_log_append(osb
, handle
,
6202 start_blk
, clusters
);
6203 ocfs2_commit_trans(osb
, handle
);
6211 mutex_unlock(&tl_inode
->i_mutex
);
6217 void ocfs2_truncate_log_shutdown(struct ocfs2_super
*osb
)
6220 struct inode
*tl_inode
= osb
->osb_tl_inode
;
6225 cancel_delayed_work(&osb
->osb_truncate_log_wq
);
6226 flush_workqueue(ocfs2_wq
);
6228 status
= ocfs2_flush_truncate_log(osb
);
6232 brelse(osb
->osb_tl_bh
);
6233 iput(osb
->osb_tl_inode
);
6239 int ocfs2_truncate_log_init(struct ocfs2_super
*osb
)
6242 struct inode
*tl_inode
= NULL
;
6243 struct buffer_head
*tl_bh
= NULL
;
6247 status
= ocfs2_get_truncate_log_info(osb
,
6254 /* ocfs2_truncate_log_shutdown keys on the existence of
6255 * osb->osb_tl_inode so we don't set any of the osb variables
6256 * until we're sure all is well. */
6257 INIT_DELAYED_WORK(&osb
->osb_truncate_log_wq
,
6258 ocfs2_truncate_log_worker
);
6259 osb
->osb_tl_bh
= tl_bh
;
6260 osb
->osb_tl_inode
= tl_inode
;
6267 * Delayed de-allocation of suballocator blocks.
6269 * Some sets of block de-allocations might involve multiple suballocator inodes.
6271 * The locking for this can get extremely complicated, especially when
6272 * the suballocator inodes to delete from aren't known until deep
6273 * within an unrelated codepath.
6275 * ocfs2_extent_block structures are a good example of this - an inode
6276 * btree could have been grown by any number of nodes each allocating
6277 * out of their own suballoc inode.
6279 * These structures allow the delay of block de-allocation until a
6280 * later time, when locking of multiple cluster inodes won't cause
6285 * Describe a single bit freed from a suballocator. For the block
6286 * suballocators, it represents one block. For the global cluster
6287 * allocator, it represents some clusters and free_bit indicates
6290 struct ocfs2_cached_block_free
{
6291 struct ocfs2_cached_block_free
*free_next
;
6293 unsigned int free_bit
;
6296 struct ocfs2_per_slot_free_list
{
6297 struct ocfs2_per_slot_free_list
*f_next_suballocator
;
6300 struct ocfs2_cached_block_free
*f_first
;
6303 static int ocfs2_free_cached_blocks(struct ocfs2_super
*osb
,
6306 struct ocfs2_cached_block_free
*head
)
6311 struct inode
*inode
;
6312 struct buffer_head
*di_bh
= NULL
;
6313 struct ocfs2_cached_block_free
*tmp
;
6315 inode
= ocfs2_get_system_file_inode(osb
, sysfile_type
, slot
);
6322 mutex_lock(&inode
->i_mutex
);
6324 ret
= ocfs2_inode_lock(inode
, &di_bh
, 1);
6330 handle
= ocfs2_start_trans(osb
, OCFS2_SUBALLOC_FREE
);
6331 if (IS_ERR(handle
)) {
6332 ret
= PTR_ERR(handle
);
6338 bg_blkno
= ocfs2_which_suballoc_group(head
->free_blk
,
6340 mlog(0, "Free bit: (bit %u, blkno %llu)\n",
6341 head
->free_bit
, (unsigned long long)head
->free_blk
);
6343 ret
= ocfs2_free_suballoc_bits(handle
, inode
, di_bh
,
6344 head
->free_bit
, bg_blkno
, 1);
6350 ret
= ocfs2_extend_trans(handle
, OCFS2_SUBALLOC_FREE
);
6357 head
= head
->free_next
;
6362 ocfs2_commit_trans(osb
, handle
);
6365 ocfs2_inode_unlock(inode
, 1);
6368 mutex_unlock(&inode
->i_mutex
);
6372 /* Premature exit may have left some dangling items. */
6374 head
= head
->free_next
;
6381 int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt
*ctxt
,
6382 u64 blkno
, unsigned int bit
)
6385 struct ocfs2_cached_block_free
*item
;
6387 item
= kmalloc(sizeof(*item
), GFP_NOFS
);
6394 mlog(0, "Insert clusters: (bit %u, blk %llu)\n",
6395 bit
, (unsigned long long)blkno
);
6397 item
->free_blk
= blkno
;
6398 item
->free_bit
= bit
;
6399 item
->free_next
= ctxt
->c_global_allocator
;
6401 ctxt
->c_global_allocator
= item
;
6405 static int ocfs2_free_cached_clusters(struct ocfs2_super
*osb
,
6406 struct ocfs2_cached_block_free
*head
)
6408 struct ocfs2_cached_block_free
*tmp
;
6409 struct inode
*tl_inode
= osb
->osb_tl_inode
;
6413 mutex_lock(&tl_inode
->i_mutex
);
6416 if (ocfs2_truncate_log_needs_flush(osb
)) {
6417 ret
= __ocfs2_flush_truncate_log(osb
);
6424 handle
= ocfs2_start_trans(osb
, OCFS2_TRUNCATE_LOG_UPDATE
);
6425 if (IS_ERR(handle
)) {
6426 ret
= PTR_ERR(handle
);
6431 ret
= ocfs2_truncate_log_append(osb
, handle
, head
->free_blk
,
6434 ocfs2_commit_trans(osb
, handle
);
6436 head
= head
->free_next
;
6445 mutex_unlock(&tl_inode
->i_mutex
);
6448 /* Premature exit may have left some dangling items. */
6450 head
= head
->free_next
;
6457 int ocfs2_run_deallocs(struct ocfs2_super
*osb
,
6458 struct ocfs2_cached_dealloc_ctxt
*ctxt
)
6461 struct ocfs2_per_slot_free_list
*fl
;
6466 while (ctxt
->c_first_suballocator
) {
6467 fl
= ctxt
->c_first_suballocator
;
6470 mlog(0, "Free items: (type %u, slot %d)\n",
6471 fl
->f_inode_type
, fl
->f_slot
);
6472 ret2
= ocfs2_free_cached_blocks(osb
,
6482 ctxt
->c_first_suballocator
= fl
->f_next_suballocator
;
6486 if (ctxt
->c_global_allocator
) {
6487 ret2
= ocfs2_free_cached_clusters(osb
,
6488 ctxt
->c_global_allocator
);
6494 ctxt
->c_global_allocator
= NULL
;
6500 static struct ocfs2_per_slot_free_list
*
6501 ocfs2_find_per_slot_free_list(int type
,
6503 struct ocfs2_cached_dealloc_ctxt
*ctxt
)
6505 struct ocfs2_per_slot_free_list
*fl
= ctxt
->c_first_suballocator
;
6508 if (fl
->f_inode_type
== type
&& fl
->f_slot
== slot
)
6511 fl
= fl
->f_next_suballocator
;
6514 fl
= kmalloc(sizeof(*fl
), GFP_NOFS
);
6516 fl
->f_inode_type
= type
;
6519 fl
->f_next_suballocator
= ctxt
->c_first_suballocator
;
6521 ctxt
->c_first_suballocator
= fl
;
6526 int ocfs2_cache_block_dealloc(struct ocfs2_cached_dealloc_ctxt
*ctxt
,
6527 int type
, int slot
, u64 blkno
,
6531 struct ocfs2_per_slot_free_list
*fl
;
6532 struct ocfs2_cached_block_free
*item
;
6534 fl
= ocfs2_find_per_slot_free_list(type
, slot
, ctxt
);
6541 item
= kmalloc(sizeof(*item
), GFP_NOFS
);
6548 mlog(0, "Insert: (type %d, slot %u, bit %u, blk %llu)\n",
6549 type
, slot
, bit
, (unsigned long long)blkno
);
6551 item
->free_blk
= blkno
;
6552 item
->free_bit
= bit
;
6553 item
->free_next
= fl
->f_first
;
6562 static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt
*ctxt
,
6563 struct ocfs2_extent_block
*eb
)
6565 return ocfs2_cache_block_dealloc(ctxt
, EXTENT_ALLOC_SYSTEM_INODE
,
6566 le16_to_cpu(eb
->h_suballoc_slot
),
6567 le64_to_cpu(eb
->h_blkno
),
6568 le16_to_cpu(eb
->h_suballoc_bit
));
6571 /* This function will figure out whether the currently last extent
6572 * block will be deleted, and if it will, what the new last extent
6573 * block will be so we can update his h_next_leaf_blk field, as well
6574 * as the dinodes i_last_eb_blk */
6575 static int ocfs2_find_new_last_ext_blk(struct inode
*inode
,
6576 unsigned int clusters_to_del
,
6577 struct ocfs2_path
*path
,
6578 struct buffer_head
**new_last_eb
)
6580 int next_free
, ret
= 0;
6582 struct ocfs2_extent_rec
*rec
;
6583 struct ocfs2_extent_block
*eb
;
6584 struct ocfs2_extent_list
*el
;
6585 struct buffer_head
*bh
= NULL
;
6587 *new_last_eb
= NULL
;
6589 /* we have no tree, so of course, no last_eb. */
6590 if (!path
->p_tree_depth
)
6593 /* trunc to zero special case - this makes tree_depth = 0
6594 * regardless of what it is. */
6595 if (OCFS2_I(inode
)->ip_clusters
== clusters_to_del
)
6598 el
= path_leaf_el(path
);
6599 BUG_ON(!el
->l_next_free_rec
);
6602 * Make sure that this extent list will actually be empty
6603 * after we clear away the data. We can shortcut out if
6604 * there's more than one non-empty extent in the
6605 * list. Otherwise, a check of the remaining extent is
6608 next_free
= le16_to_cpu(el
->l_next_free_rec
);
6610 if (ocfs2_is_empty_extent(&el
->l_recs
[0])) {
6614 /* We may have a valid extent in index 1, check it. */
6616 rec
= &el
->l_recs
[1];
6619 * Fall through - no more nonempty extents, so we want
6620 * to delete this leaf.
6626 rec
= &el
->l_recs
[0];
6631 * Check it we'll only be trimming off the end of this
6634 if (le16_to_cpu(rec
->e_leaf_clusters
) > clusters_to_del
)
6638 ret
= ocfs2_find_cpos_for_left_leaf(inode
->i_sb
, path
, &cpos
);
6644 ret
= ocfs2_find_leaf(INODE_CACHE(inode
), path_root_el(path
), cpos
, &bh
);
6650 eb
= (struct ocfs2_extent_block
*) bh
->b_data
;
6653 /* ocfs2_find_leaf() gets the eb from ocfs2_read_extent_block().
6654 * Any corruption is a code bug. */
6655 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb
));
6658 get_bh(*new_last_eb
);
6659 mlog(0, "returning block %llu, (cpos: %u)\n",
6660 (unsigned long long)le64_to_cpu(eb
->h_blkno
), cpos
);
6668 * Trim some clusters off the rightmost edge of a tree. Only called
6671 * The caller needs to:
6672 * - start journaling of each path component.
6673 * - compute and fully set up any new last ext block
6675 static int ocfs2_trim_tree(struct inode
*inode
, struct ocfs2_path
*path
,
6676 handle_t
*handle
, struct ocfs2_truncate_context
*tc
,
6677 u32 clusters_to_del
, u64
*delete_start
, u8
*flags
)
6679 int ret
, i
, index
= path
->p_tree_depth
;
6682 struct buffer_head
*bh
;
6683 struct ocfs2_extent_list
*el
;
6684 struct ocfs2_extent_rec
*rec
;
6689 while (index
>= 0) {
6690 bh
= path
->p_node
[index
].bh
;
6691 el
= path
->p_node
[index
].el
;
6693 mlog(0, "traveling tree (index = %d, block = %llu)\n",
6694 index
, (unsigned long long)bh
->b_blocknr
);
6696 BUG_ON(le16_to_cpu(el
->l_next_free_rec
) == 0);
6699 (path
->p_tree_depth
- le16_to_cpu(el
->l_tree_depth
))) {
6700 ocfs2_error(inode
->i_sb
,
6701 "Inode %lu has invalid ext. block %llu",
6703 (unsigned long long)bh
->b_blocknr
);
6709 i
= le16_to_cpu(el
->l_next_free_rec
) - 1;
6710 rec
= &el
->l_recs
[i
];
6712 mlog(0, "Extent list before: record %d: (%u, %u, %llu), "
6713 "next = %u\n", i
, le32_to_cpu(rec
->e_cpos
),
6714 ocfs2_rec_clusters(el
, rec
),
6715 (unsigned long long)le64_to_cpu(rec
->e_blkno
),
6716 le16_to_cpu(el
->l_next_free_rec
));
6718 BUG_ON(ocfs2_rec_clusters(el
, rec
) < clusters_to_del
);
6720 if (le16_to_cpu(el
->l_tree_depth
) == 0) {
6722 * If the leaf block contains a single empty
6723 * extent and no records, we can just remove
6726 if (i
== 0 && ocfs2_is_empty_extent(rec
)) {
6728 sizeof(struct ocfs2_extent_rec
));
6729 el
->l_next_free_rec
= cpu_to_le16(0);
6735 * Remove any empty extents by shifting things
6736 * left. That should make life much easier on
6737 * the code below. This condition is rare
6738 * enough that we shouldn't see a performance
6741 if (ocfs2_is_empty_extent(&el
->l_recs
[0])) {
6742 le16_add_cpu(&el
->l_next_free_rec
, -1);
6745 i
< le16_to_cpu(el
->l_next_free_rec
); i
++)
6746 el
->l_recs
[i
] = el
->l_recs
[i
+ 1];
6748 memset(&el
->l_recs
[i
], 0,
6749 sizeof(struct ocfs2_extent_rec
));
6752 * We've modified our extent list. The
6753 * simplest way to handle this change
6754 * is to being the search from the
6757 goto find_tail_record
;
6760 le16_add_cpu(&rec
->e_leaf_clusters
, -clusters_to_del
);
6763 * We'll use "new_edge" on our way back up the
6764 * tree to know what our rightmost cpos is.
6766 new_edge
= le16_to_cpu(rec
->e_leaf_clusters
);
6767 new_edge
+= le32_to_cpu(rec
->e_cpos
);
6770 * The caller will use this to delete data blocks.
6772 *delete_start
= le64_to_cpu(rec
->e_blkno
)
6773 + ocfs2_clusters_to_blocks(inode
->i_sb
,
6774 le16_to_cpu(rec
->e_leaf_clusters
));
6775 *flags
= rec
->e_flags
;
6778 * If it's now empty, remove this record.
6780 if (le16_to_cpu(rec
->e_leaf_clusters
) == 0) {
6782 sizeof(struct ocfs2_extent_rec
));
6783 le16_add_cpu(&el
->l_next_free_rec
, -1);
6786 if (le64_to_cpu(rec
->e_blkno
) == deleted_eb
) {
6788 sizeof(struct ocfs2_extent_rec
));
6789 le16_add_cpu(&el
->l_next_free_rec
, -1);
6794 /* Can this actually happen? */
6795 if (le16_to_cpu(el
->l_next_free_rec
) == 0)
6799 * We never actually deleted any clusters
6800 * because our leaf was empty. There's no
6801 * reason to adjust the rightmost edge then.
6806 rec
->e_int_clusters
= cpu_to_le32(new_edge
);
6807 le32_add_cpu(&rec
->e_int_clusters
,
6808 -le32_to_cpu(rec
->e_cpos
));
6811 * A deleted child record should have been
6814 BUG_ON(le32_to_cpu(rec
->e_int_clusters
) == 0);
6818 ret
= ocfs2_journal_dirty(handle
, bh
);
6824 mlog(0, "extent list container %llu, after: record %d: "
6825 "(%u, %u, %llu), next = %u.\n",
6826 (unsigned long long)bh
->b_blocknr
, i
,
6827 le32_to_cpu(rec
->e_cpos
), ocfs2_rec_clusters(el
, rec
),
6828 (unsigned long long)le64_to_cpu(rec
->e_blkno
),
6829 le16_to_cpu(el
->l_next_free_rec
));
6832 * We must be careful to only attempt delete of an
6833 * extent block (and not the root inode block).
6835 if (index
> 0 && le16_to_cpu(el
->l_next_free_rec
) == 0) {
6836 struct ocfs2_extent_block
*eb
=
6837 (struct ocfs2_extent_block
*)bh
->b_data
;
6840 * Save this for use when processing the
6843 deleted_eb
= le64_to_cpu(eb
->h_blkno
);
6845 mlog(0, "deleting this extent block.\n");
6847 ocfs2_remove_from_cache(INODE_CACHE(inode
), bh
);
6849 BUG_ON(ocfs2_rec_clusters(el
, &el
->l_recs
[0]));
6850 BUG_ON(le32_to_cpu(el
->l_recs
[0].e_cpos
));
6851 BUG_ON(le64_to_cpu(el
->l_recs
[0].e_blkno
));
6853 ret
= ocfs2_cache_extent_block_free(&tc
->tc_dealloc
, eb
);
6854 /* An error here is not fatal. */
6869 static int ocfs2_do_truncate(struct ocfs2_super
*osb
,
6870 unsigned int clusters_to_del
,
6871 struct inode
*inode
,
6872 struct buffer_head
*fe_bh
,
6874 struct ocfs2_truncate_context
*tc
,
6875 struct ocfs2_path
*path
,
6876 struct ocfs2_alloc_context
*meta_ac
)
6879 struct ocfs2_dinode
*fe
;
6880 struct ocfs2_extent_block
*last_eb
= NULL
;
6881 struct ocfs2_extent_list
*el
;
6882 struct buffer_head
*last_eb_bh
= NULL
;
6886 fe
= (struct ocfs2_dinode
*) fe_bh
->b_data
;
6888 status
= ocfs2_find_new_last_ext_blk(inode
, clusters_to_del
,
6896 * Each component will be touched, so we might as well journal
6897 * here to avoid having to handle errors later.
6899 status
= ocfs2_journal_access_path(INODE_CACHE(inode
), handle
, path
);
6906 status
= ocfs2_journal_access_eb(handle
, INODE_CACHE(inode
), last_eb_bh
,
6907 OCFS2_JOURNAL_ACCESS_WRITE
);
6913 last_eb
= (struct ocfs2_extent_block
*) last_eb_bh
->b_data
;
6916 el
= &(fe
->id2
.i_list
);
6919 * Lower levels depend on this never happening, but it's best
6920 * to check it up here before changing the tree.
6922 if (el
->l_tree_depth
&& el
->l_recs
[0].e_int_clusters
== 0) {
6923 ocfs2_error(inode
->i_sb
,
6924 "Inode %lu has an empty extent record, depth %u\n",
6925 inode
->i_ino
, le16_to_cpu(el
->l_tree_depth
));
6930 vfs_dq_free_space_nodirty(inode
,
6931 ocfs2_clusters_to_bytes(osb
->sb
, clusters_to_del
));
6932 spin_lock(&OCFS2_I(inode
)->ip_lock
);
6933 OCFS2_I(inode
)->ip_clusters
= le32_to_cpu(fe
->i_clusters
) -
6935 spin_unlock(&OCFS2_I(inode
)->ip_lock
);
6936 le32_add_cpu(&fe
->i_clusters
, -clusters_to_del
);
6937 inode
->i_blocks
= ocfs2_inode_sector_count(inode
);
6939 status
= ocfs2_trim_tree(inode
, path
, handle
, tc
,
6940 clusters_to_del
, &delete_blk
, &rec_flags
);
6946 if (le32_to_cpu(fe
->i_clusters
) == 0) {
6947 /* trunc to zero is a special case. */
6948 el
->l_tree_depth
= 0;
6949 fe
->i_last_eb_blk
= 0;
6951 fe
->i_last_eb_blk
= last_eb
->h_blkno
;
6953 status
= ocfs2_journal_dirty(handle
, fe_bh
);
6960 /* If there will be a new last extent block, then by
6961 * definition, there cannot be any leaves to the right of
6963 last_eb
->h_next_leaf_blk
= 0;
6964 status
= ocfs2_journal_dirty(handle
, last_eb_bh
);
6972 if (rec_flags
& OCFS2_EXT_REFCOUNTED
)
6973 status
= ocfs2_decrease_refcount(inode
, handle
,
6974 ocfs2_blocks_to_clusters(osb
->sb
,
6976 clusters_to_del
, meta_ac
,
6979 status
= ocfs2_truncate_log_append(osb
, handle
,
6994 static int ocfs2_zero_func(handle_t
*handle
, struct buffer_head
*bh
)
6996 set_buffer_uptodate(bh
);
6997 mark_buffer_dirty(bh
);
7001 static void ocfs2_map_and_dirty_page(struct inode
*inode
, handle_t
*handle
,
7002 unsigned int from
, unsigned int to
,
7003 struct page
*page
, int zero
, u64
*phys
)
7005 int ret
, partial
= 0;
7007 ret
= ocfs2_map_page_blocks(page
, phys
, inode
, from
, to
, 0);
7012 zero_user_segment(page
, from
, to
);
7015 * Need to set the buffers we zero'd into uptodate
7016 * here if they aren't - ocfs2_map_page_blocks()
7017 * might've skipped some
7019 ret
= walk_page_buffers(handle
, page_buffers(page
),
7024 else if (ocfs2_should_order_data(inode
)) {
7025 ret
= ocfs2_jbd2_file_inode(handle
, inode
);
7031 SetPageUptodate(page
);
7033 flush_dcache_page(page
);
7036 static void ocfs2_zero_cluster_pages(struct inode
*inode
, loff_t start
,
7037 loff_t end
, struct page
**pages
,
7038 int numpages
, u64 phys
, handle_t
*handle
)
7042 unsigned int from
, to
= PAGE_CACHE_SIZE
;
7043 struct super_block
*sb
= inode
->i_sb
;
7045 BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(sb
)));
7050 to
= PAGE_CACHE_SIZE
;
7051 for(i
= 0; i
< numpages
; i
++) {
7054 from
= start
& (PAGE_CACHE_SIZE
- 1);
7055 if ((end
>> PAGE_CACHE_SHIFT
) == page
->index
)
7056 to
= end
& (PAGE_CACHE_SIZE
- 1);
7058 BUG_ON(from
> PAGE_CACHE_SIZE
);
7059 BUG_ON(to
> PAGE_CACHE_SIZE
);
7061 ocfs2_map_and_dirty_page(inode
, handle
, from
, to
, page
, 1,
7064 start
= (page
->index
+ 1) << PAGE_CACHE_SHIFT
;
7068 ocfs2_unlock_and_free_pages(pages
, numpages
);
7071 static int ocfs2_grab_eof_pages(struct inode
*inode
, loff_t start
, loff_t end
,
7072 struct page
**pages
, int *num
)
7074 int numpages
, ret
= 0;
7075 struct super_block
*sb
= inode
->i_sb
;
7076 struct address_space
*mapping
= inode
->i_mapping
;
7077 unsigned long index
;
7078 loff_t last_page_bytes
;
7080 BUG_ON(start
> end
);
7082 BUG_ON(start
>> OCFS2_SB(sb
)->s_clustersize_bits
!=
7083 (end
- 1) >> OCFS2_SB(sb
)->s_clustersize_bits
);
7086 last_page_bytes
= PAGE_ALIGN(end
);
7087 index
= start
>> PAGE_CACHE_SHIFT
;
7089 pages
[numpages
] = grab_cache_page(mapping
, index
);
7090 if (!pages
[numpages
]) {
7098 } while (index
< (last_page_bytes
>> PAGE_CACHE_SHIFT
));
7103 ocfs2_unlock_and_free_pages(pages
, numpages
);
7113 * Zero the area past i_size but still within an allocated
7114 * cluster. This avoids exposing nonzero data on subsequent file
7117 * We need to call this before i_size is updated on the inode because
7118 * otherwise block_write_full_page() will skip writeout of pages past
7119 * i_size. The new_i_size parameter is passed for this reason.
7121 int ocfs2_zero_range_for_truncate(struct inode
*inode
, handle_t
*handle
,
7122 u64 range_start
, u64 range_end
)
7124 int ret
= 0, numpages
;
7125 struct page
**pages
= NULL
;
7127 unsigned int ext_flags
;
7128 struct super_block
*sb
= inode
->i_sb
;
7131 * File systems which don't support sparse files zero on every
7134 if (!ocfs2_sparse_alloc(OCFS2_SB(sb
)))
7137 pages
= kcalloc(ocfs2_pages_per_cluster(sb
),
7138 sizeof(struct page
*), GFP_NOFS
);
7139 if (pages
== NULL
) {
7145 if (range_start
== range_end
)
7148 ret
= ocfs2_extent_map_get_blocks(inode
,
7149 range_start
>> sb
->s_blocksize_bits
,
7150 &phys
, NULL
, &ext_flags
);
7157 * Tail is a hole, or is marked unwritten. In either case, we
7158 * can count on read and write to return/push zero's.
7160 if (phys
== 0 || ext_flags
& OCFS2_EXT_UNWRITTEN
)
7163 ret
= ocfs2_grab_eof_pages(inode
, range_start
, range_end
, pages
,
7170 ocfs2_zero_cluster_pages(inode
, range_start
, range_end
, pages
,
7171 numpages
, phys
, handle
);
7174 * Initiate writeout of the pages we zero'd here. We don't
7175 * wait on them - the truncate_inode_pages() call later will
7178 ret
= do_sync_mapping_range(inode
->i_mapping
, range_start
,
7179 range_end
- 1, SYNC_FILE_RANGE_WRITE
);
7190 static void ocfs2_zero_dinode_id2_with_xattr(struct inode
*inode
,
7191 struct ocfs2_dinode
*di
)
7193 unsigned int blocksize
= 1 << inode
->i_sb
->s_blocksize_bits
;
7194 unsigned int xattrsize
= le16_to_cpu(di
->i_xattr_inline_size
);
7196 if (le16_to_cpu(di
->i_dyn_features
) & OCFS2_INLINE_XATTR_FL
)
7197 memset(&di
->id2
, 0, blocksize
-
7198 offsetof(struct ocfs2_dinode
, id2
) -
7201 memset(&di
->id2
, 0, blocksize
-
7202 offsetof(struct ocfs2_dinode
, id2
));
7205 void ocfs2_dinode_new_extent_list(struct inode
*inode
,
7206 struct ocfs2_dinode
*di
)
7208 ocfs2_zero_dinode_id2_with_xattr(inode
, di
);
7209 di
->id2
.i_list
.l_tree_depth
= 0;
7210 di
->id2
.i_list
.l_next_free_rec
= 0;
7211 di
->id2
.i_list
.l_count
= cpu_to_le16(
7212 ocfs2_extent_recs_per_inode_with_xattr(inode
->i_sb
, di
));
7215 void ocfs2_set_inode_data_inline(struct inode
*inode
, struct ocfs2_dinode
*di
)
7217 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
7218 struct ocfs2_inline_data
*idata
= &di
->id2
.i_data
;
7220 spin_lock(&oi
->ip_lock
);
7221 oi
->ip_dyn_features
|= OCFS2_INLINE_DATA_FL
;
7222 di
->i_dyn_features
= cpu_to_le16(oi
->ip_dyn_features
);
7223 spin_unlock(&oi
->ip_lock
);
7226 * We clear the entire i_data structure here so that all
7227 * fields can be properly initialized.
7229 ocfs2_zero_dinode_id2_with_xattr(inode
, di
);
7231 idata
->id_count
= cpu_to_le16(
7232 ocfs2_max_inline_data_with_xattr(inode
->i_sb
, di
));
7235 int ocfs2_convert_inline_data_to_extents(struct inode
*inode
,
7236 struct buffer_head
*di_bh
)
7238 int ret
, i
, has_data
, num_pages
= 0;
7240 u64
uninitialized_var(block
);
7241 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
7242 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
7243 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
7244 struct ocfs2_alloc_context
*data_ac
= NULL
;
7245 struct page
**pages
= NULL
;
7246 loff_t end
= osb
->s_clustersize
;
7247 struct ocfs2_extent_tree et
;
7250 has_data
= i_size_read(inode
) ? 1 : 0;
7253 pages
= kcalloc(ocfs2_pages_per_cluster(osb
->sb
),
7254 sizeof(struct page
*), GFP_NOFS
);
7255 if (pages
== NULL
) {
7261 ret
= ocfs2_reserve_clusters(osb
, 1, &data_ac
);
7268 handle
= ocfs2_start_trans(osb
,
7269 ocfs2_inline_to_extents_credits(osb
->sb
));
7270 if (IS_ERR(handle
)) {
7271 ret
= PTR_ERR(handle
);
7276 ret
= ocfs2_journal_access_di(handle
, INODE_CACHE(inode
), di_bh
,
7277 OCFS2_JOURNAL_ACCESS_WRITE
);
7285 unsigned int page_end
;
7288 if (vfs_dq_alloc_space_nodirty(inode
,
7289 ocfs2_clusters_to_bytes(osb
->sb
, 1))) {
7295 ret
= ocfs2_claim_clusters(osb
, handle
, data_ac
, 1, &bit_off
,
7303 * Save two copies, one for insert, and one that can
7304 * be changed by ocfs2_map_and_dirty_page() below.
7306 block
= phys
= ocfs2_clusters_to_blocks(inode
->i_sb
, bit_off
);
7309 * Non sparse file systems zero on extend, so no need
7312 if (!ocfs2_sparse_alloc(osb
) &&
7313 PAGE_CACHE_SIZE
< osb
->s_clustersize
)
7314 end
= PAGE_CACHE_SIZE
;
7316 ret
= ocfs2_grab_eof_pages(inode
, 0, end
, pages
, &num_pages
);
7323 * This should populate the 1st page for us and mark
7326 ret
= ocfs2_read_inline_data(inode
, pages
[0], di_bh
);
7332 page_end
= PAGE_CACHE_SIZE
;
7333 if (PAGE_CACHE_SIZE
> osb
->s_clustersize
)
7334 page_end
= osb
->s_clustersize
;
7336 for (i
= 0; i
< num_pages
; i
++)
7337 ocfs2_map_and_dirty_page(inode
, handle
, 0, page_end
,
7338 pages
[i
], i
> 0, &phys
);
7341 spin_lock(&oi
->ip_lock
);
7342 oi
->ip_dyn_features
&= ~OCFS2_INLINE_DATA_FL
;
7343 di
->i_dyn_features
= cpu_to_le16(oi
->ip_dyn_features
);
7344 spin_unlock(&oi
->ip_lock
);
7346 ocfs2_dinode_new_extent_list(inode
, di
);
7348 ocfs2_journal_dirty(handle
, di_bh
);
7352 * An error at this point should be extremely rare. If
7353 * this proves to be false, we could always re-build
7354 * the in-inode data from our pages.
7356 ocfs2_init_dinode_extent_tree(&et
, INODE_CACHE(inode
), di_bh
);
7357 ret
= ocfs2_insert_extent(handle
, &et
, 0, block
, 1, 0, NULL
);
7363 inode
->i_blocks
= ocfs2_inode_sector_count(inode
);
7367 if (ret
< 0 && did_quota
)
7368 vfs_dq_free_space_nodirty(inode
,
7369 ocfs2_clusters_to_bytes(osb
->sb
, 1));
7371 ocfs2_commit_trans(osb
, handle
);
7375 ocfs2_free_alloc_context(data_ac
);
7379 ocfs2_unlock_and_free_pages(pages
, num_pages
);
7387 * It is expected, that by the time you call this function,
7388 * inode->i_size and fe->i_size have been adjusted.
7390 * WARNING: This will kfree the truncate context
7392 int ocfs2_commit_truncate(struct ocfs2_super
*osb
,
7393 struct inode
*inode
,
7394 struct buffer_head
*fe_bh
,
7395 struct ocfs2_truncate_context
*tc
)
7397 int status
, i
, credits
, tl_sem
= 0;
7398 u32 clusters_to_del
, new_highest_cpos
, range
;
7400 struct ocfs2_extent_list
*el
;
7401 handle_t
*handle
= NULL
;
7402 struct inode
*tl_inode
= osb
->osb_tl_inode
;
7403 struct ocfs2_path
*path
= NULL
;
7404 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)fe_bh
->b_data
;
7405 struct ocfs2_alloc_context
*meta_ac
= NULL
;
7406 struct ocfs2_refcount_tree
*ref_tree
= NULL
;
7410 new_highest_cpos
= ocfs2_clusters_for_bytes(osb
->sb
,
7411 i_size_read(inode
));
7413 path
= ocfs2_new_path(fe_bh
, &di
->id2
.i_list
,
7414 ocfs2_journal_access_di
);
7421 ocfs2_extent_map_trunc(inode
, new_highest_cpos
);
7425 * Check that we still have allocation to delete.
7427 if (OCFS2_I(inode
)->ip_clusters
== 0) {
7435 * Truncate always works against the rightmost tree branch.
7437 status
= ocfs2_find_path(INODE_CACHE(inode
), path
, UINT_MAX
);
7443 mlog(0, "inode->ip_clusters = %u, tree_depth = %u\n",
7444 OCFS2_I(inode
)->ip_clusters
, path
->p_tree_depth
);
7447 * By now, el will point to the extent list on the bottom most
7448 * portion of this tree. Only the tail record is considered in
7451 * We handle the following cases, in order:
7452 * - empty extent: delete the remaining branch
7453 * - remove the entire record
7454 * - remove a partial record
7455 * - no record needs to be removed (truncate has completed)
7457 el
= path_leaf_el(path
);
7458 if (le16_to_cpu(el
->l_next_free_rec
) == 0) {
7459 ocfs2_error(inode
->i_sb
,
7460 "Inode %llu has empty extent block at %llu\n",
7461 (unsigned long long)OCFS2_I(inode
)->ip_blkno
,
7462 (unsigned long long)path_leaf_bh(path
)->b_blocknr
);
7467 i
= le16_to_cpu(el
->l_next_free_rec
) - 1;
7468 range
= le32_to_cpu(el
->l_recs
[i
].e_cpos
) +
7469 ocfs2_rec_clusters(el
, &el
->l_recs
[i
]);
7470 if (i
== 0 && ocfs2_is_empty_extent(&el
->l_recs
[i
])) {
7471 clusters_to_del
= 0;
7472 } else if (le32_to_cpu(el
->l_recs
[i
].e_cpos
) >= new_highest_cpos
) {
7473 clusters_to_del
= ocfs2_rec_clusters(el
, &el
->l_recs
[i
]);
7474 blkno
= le64_to_cpu(el
->l_recs
[i
].e_blkno
);
7475 } else if (range
> new_highest_cpos
) {
7476 clusters_to_del
= (ocfs2_rec_clusters(el
, &el
->l_recs
[i
]) +
7477 le32_to_cpu(el
->l_recs
[i
].e_cpos
)) -
7479 blkno
= le64_to_cpu(el
->l_recs
[i
].e_blkno
) +
7480 ocfs2_clusters_to_blocks(inode
->i_sb
,
7481 ocfs2_rec_clusters(el
, &el
->l_recs
[i
]) -
7488 mlog(0, "clusters_to_del = %u in this pass, tail blk=%llu\n",
7489 clusters_to_del
, (unsigned long long)path_leaf_bh(path
)->b_blocknr
);
7491 if (el
->l_recs
[i
].e_flags
& OCFS2_EXT_REFCOUNTED
&& clusters_to_del
) {
7492 BUG_ON(!(OCFS2_I(inode
)->ip_dyn_features
&
7493 OCFS2_HAS_REFCOUNT_FL
));
7495 status
= ocfs2_lock_refcount_tree(osb
,
7496 le64_to_cpu(di
->i_refcount_loc
),
7497 1, &ref_tree
, NULL
);
7503 status
= ocfs2_prepare_refcount_change_for_del(inode
, fe_bh
,
7514 mutex_lock(&tl_inode
->i_mutex
);
7516 /* ocfs2_truncate_log_needs_flush guarantees us at least one
7517 * record is free for use. If there isn't any, we flush to get
7518 * an empty truncate log. */
7519 if (ocfs2_truncate_log_needs_flush(osb
)) {
7520 status
= __ocfs2_flush_truncate_log(osb
);
7527 credits
+= ocfs2_calc_tree_trunc_credits(osb
->sb
, clusters_to_del
,
7528 (struct ocfs2_dinode
*)fe_bh
->b_data
,
7530 handle
= ocfs2_start_trans(osb
, credits
);
7531 if (IS_ERR(handle
)) {
7532 status
= PTR_ERR(handle
);
7538 status
= ocfs2_do_truncate(osb
, clusters_to_del
, inode
, fe_bh
, handle
,
7545 mutex_unlock(&tl_inode
->i_mutex
);
7548 ocfs2_commit_trans(osb
, handle
);
7551 ocfs2_reinit_path(path
, 1);
7554 ocfs2_free_alloc_context(meta_ac
);
7559 ocfs2_unlock_refcount_tree(osb
, ref_tree
, 1);
7564 * The check above will catch the case where we've truncated
7565 * away all allocation.
7571 ocfs2_schedule_truncate_log_flush(osb
, 1);
7574 mutex_unlock(&tl_inode
->i_mutex
);
7577 ocfs2_commit_trans(osb
, handle
);
7580 ocfs2_free_alloc_context(meta_ac
);
7583 ocfs2_unlock_refcount_tree(osb
, ref_tree
, 1);
7585 ocfs2_run_deallocs(osb
, &tc
->tc_dealloc
);
7587 ocfs2_free_path(path
);
7589 /* This will drop the ext_alloc cluster lock for us */
7590 ocfs2_free_truncate_context(tc
);
7597 * Expects the inode to already be locked.
7599 int ocfs2_prepare_truncate(struct ocfs2_super
*osb
,
7600 struct inode
*inode
,
7601 struct buffer_head
*fe_bh
,
7602 struct ocfs2_truncate_context
**tc
)
7605 unsigned int new_i_clusters
;
7606 struct ocfs2_dinode
*fe
;
7607 struct ocfs2_extent_block
*eb
;
7608 struct buffer_head
*last_eb_bh
= NULL
;
7614 new_i_clusters
= ocfs2_clusters_for_bytes(osb
->sb
,
7615 i_size_read(inode
));
7616 fe
= (struct ocfs2_dinode
*) fe_bh
->b_data
;
7618 mlog(0, "fe->i_clusters = %u, new_i_clusters = %u, fe->i_size ="
7619 "%llu\n", le32_to_cpu(fe
->i_clusters
), new_i_clusters
,
7620 (unsigned long long)le64_to_cpu(fe
->i_size
));
7622 *tc
= kzalloc(sizeof(struct ocfs2_truncate_context
), GFP_KERNEL
);
7628 ocfs2_init_dealloc_ctxt(&(*tc
)->tc_dealloc
);
7630 if (fe
->id2
.i_list
.l_tree_depth
) {
7631 status
= ocfs2_read_extent_block(INODE_CACHE(inode
),
7632 le64_to_cpu(fe
->i_last_eb_blk
),
7638 eb
= (struct ocfs2_extent_block
*) last_eb_bh
->b_data
;
7641 (*tc
)->tc_last_eb_bh
= last_eb_bh
;
7647 ocfs2_free_truncate_context(*tc
);
7655 * 'start' is inclusive, 'end' is not.
7657 int ocfs2_truncate_inline(struct inode
*inode
, struct buffer_head
*di_bh
,
7658 unsigned int start
, unsigned int end
, int trunc
)
7661 unsigned int numbytes
;
7663 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
7664 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
7665 struct ocfs2_inline_data
*idata
= &di
->id2
.i_data
;
7667 if (end
> i_size_read(inode
))
7668 end
= i_size_read(inode
);
7670 BUG_ON(start
>= end
);
7672 if (!(OCFS2_I(inode
)->ip_dyn_features
& OCFS2_INLINE_DATA_FL
) ||
7673 !(le16_to_cpu(di
->i_dyn_features
) & OCFS2_INLINE_DATA_FL
) ||
7674 !ocfs2_supports_inline_data(osb
)) {
7675 ocfs2_error(inode
->i_sb
,
7676 "Inline data flags for inode %llu don't agree! "
7677 "Disk: 0x%x, Memory: 0x%x, Superblock: 0x%x\n",
7678 (unsigned long long)OCFS2_I(inode
)->ip_blkno
,
7679 le16_to_cpu(di
->i_dyn_features
),
7680 OCFS2_I(inode
)->ip_dyn_features
,
7681 osb
->s_feature_incompat
);
7686 handle
= ocfs2_start_trans(osb
, OCFS2_INODE_UPDATE_CREDITS
);
7687 if (IS_ERR(handle
)) {
7688 ret
= PTR_ERR(handle
);
7693 ret
= ocfs2_journal_access_di(handle
, INODE_CACHE(inode
), di_bh
,
7694 OCFS2_JOURNAL_ACCESS_WRITE
);
7700 numbytes
= end
- start
;
7701 memset(idata
->id_data
+ start
, 0, numbytes
);
7704 * No need to worry about the data page here - it's been
7705 * truncated already and inline data doesn't need it for
7706 * pushing zero's to disk, so we'll let readpage pick it up
7710 i_size_write(inode
, start
);
7711 di
->i_size
= cpu_to_le64(start
);
7714 inode
->i_blocks
= ocfs2_inode_sector_count(inode
);
7715 inode
->i_ctime
= inode
->i_mtime
= CURRENT_TIME
;
7717 di
->i_ctime
= di
->i_mtime
= cpu_to_le64(inode
->i_ctime
.tv_sec
);
7718 di
->i_ctime_nsec
= di
->i_mtime_nsec
= cpu_to_le32(inode
->i_ctime
.tv_nsec
);
7720 ocfs2_journal_dirty(handle
, di_bh
);
7723 ocfs2_commit_trans(osb
, handle
);
7729 static void ocfs2_free_truncate_context(struct ocfs2_truncate_context
*tc
)
7732 * The caller is responsible for completing deallocation
7733 * before freeing the context.
7735 if (tc
->tc_dealloc
.c_first_suballocator
!= NULL
)
7737 "Truncate completion has non-empty dealloc context\n");
7739 brelse(tc
->tc_last_eb_bh
);