Loading...
1/* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
3 *
4 * alloc.c
5 *
6 * Extent allocs and frees
7 *
8 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
9 *
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.
14 *
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.
19 *
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.
24 */
25
26#include <linux/fs.h>
27#include <linux/types.h>
28#include <linux/slab.h>
29#include <linux/highmem.h>
30#include <linux/swap.h>
31#include <linux/quotaops.h>
32#include <linux/blkdev.h>
33
34#include <cluster/masklog.h>
35
36#include "ocfs2.h"
37
38#include "alloc.h"
39#include "aops.h"
40#include "blockcheck.h"
41#include "dlmglue.h"
42#include "extent_map.h"
43#include "inode.h"
44#include "journal.h"
45#include "localalloc.h"
46#include "suballoc.h"
47#include "sysfile.h"
48#include "file.h"
49#include "super.h"
50#include "uptodate.h"
51#include "xattr.h"
52#include "refcounttree.h"
53#include "ocfs2_trace.h"
54
55#include "buffer_head_io.h"
56
57enum ocfs2_contig_type {
58 CONTIG_NONE = 0,
59 CONTIG_LEFT,
60 CONTIG_RIGHT,
61 CONTIG_LEFTRIGHT,
62};
63
64static enum ocfs2_contig_type
65 ocfs2_extent_rec_contig(struct super_block *sb,
66 struct ocfs2_extent_rec *ext,
67 struct ocfs2_extent_rec *insert_rec);
68/*
69 * Operations for a specific extent tree type.
70 *
71 * To implement an on-disk btree (extent tree) type in ocfs2, add
72 * an ocfs2_extent_tree_operations structure and the matching
73 * ocfs2_init_<thingy>_extent_tree() function. That's pretty much it
74 * for the allocation portion of the extent tree.
75 */
76struct ocfs2_extent_tree_operations {
77 /*
78 * last_eb_blk is the block number of the right most leaf extent
79 * block. Most on-disk structures containing an extent tree store
80 * this value for fast access. The ->eo_set_last_eb_blk() and
81 * ->eo_get_last_eb_blk() operations access this value. They are
82 * both required.
83 */
84 void (*eo_set_last_eb_blk)(struct ocfs2_extent_tree *et,
85 u64 blkno);
86 u64 (*eo_get_last_eb_blk)(struct ocfs2_extent_tree *et);
87
88 /*
89 * The on-disk structure usually keeps track of how many total
90 * clusters are stored in this extent tree. This function updates
91 * that value. new_clusters is the delta, and must be
92 * added to the total. Required.
93 */
94 void (*eo_update_clusters)(struct ocfs2_extent_tree *et,
95 u32 new_clusters);
96
97 /*
98 * If this extent tree is supported by an extent map, insert
99 * a record into the map.
100 */
101 void (*eo_extent_map_insert)(struct ocfs2_extent_tree *et,
102 struct ocfs2_extent_rec *rec);
103
104 /*
105 * If this extent tree is supported by an extent map, truncate the
106 * map to clusters,
107 */
108 void (*eo_extent_map_truncate)(struct ocfs2_extent_tree *et,
109 u32 clusters);
110
111 /*
112 * If ->eo_insert_check() exists, it is called before rec is
113 * inserted into the extent tree. It is optional.
114 */
115 int (*eo_insert_check)(struct ocfs2_extent_tree *et,
116 struct ocfs2_extent_rec *rec);
117 int (*eo_sanity_check)(struct ocfs2_extent_tree *et);
118
119 /*
120 * --------------------------------------------------------------
121 * The remaining are internal to ocfs2_extent_tree and don't have
122 * accessor functions
123 */
124
125 /*
126 * ->eo_fill_root_el() takes et->et_object and sets et->et_root_el.
127 * It is required.
128 */
129 void (*eo_fill_root_el)(struct ocfs2_extent_tree *et);
130
131 /*
132 * ->eo_fill_max_leaf_clusters sets et->et_max_leaf_clusters if
133 * it exists. If it does not, et->et_max_leaf_clusters is set
134 * to 0 (unlimited). Optional.
135 */
136 void (*eo_fill_max_leaf_clusters)(struct ocfs2_extent_tree *et);
137
138 /*
139 * ->eo_extent_contig test whether the 2 ocfs2_extent_rec
140 * are contiguous or not. Optional. Don't need to set it if use
141 * ocfs2_extent_rec as the tree leaf.
142 */
143 enum ocfs2_contig_type
144 (*eo_extent_contig)(struct ocfs2_extent_tree *et,
145 struct ocfs2_extent_rec *ext,
146 struct ocfs2_extent_rec *insert_rec);
147};
148
149
150/*
151 * Pre-declare ocfs2_dinode_et_ops so we can use it as a sanity check
152 * in the methods.
153 */
154static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et);
155static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
156 u64 blkno);
157static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
158 u32 clusters);
159static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et,
160 struct ocfs2_extent_rec *rec);
161static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et,
162 u32 clusters);
163static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
164 struct ocfs2_extent_rec *rec);
165static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et);
166static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et);
167static const struct ocfs2_extent_tree_operations ocfs2_dinode_et_ops = {
168 .eo_set_last_eb_blk = ocfs2_dinode_set_last_eb_blk,
169 .eo_get_last_eb_blk = ocfs2_dinode_get_last_eb_blk,
170 .eo_update_clusters = ocfs2_dinode_update_clusters,
171 .eo_extent_map_insert = ocfs2_dinode_extent_map_insert,
172 .eo_extent_map_truncate = ocfs2_dinode_extent_map_truncate,
173 .eo_insert_check = ocfs2_dinode_insert_check,
174 .eo_sanity_check = ocfs2_dinode_sanity_check,
175 .eo_fill_root_el = ocfs2_dinode_fill_root_el,
176};
177
178static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
179 u64 blkno)
180{
181 struct ocfs2_dinode *di = et->et_object;
182
183 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
184 di->i_last_eb_blk = cpu_to_le64(blkno);
185}
186
187static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et)
188{
189 struct ocfs2_dinode *di = et->et_object;
190
191 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
192 return le64_to_cpu(di->i_last_eb_blk);
193}
194
195static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
196 u32 clusters)
197{
198 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
199 struct ocfs2_dinode *di = et->et_object;
200
201 le32_add_cpu(&di->i_clusters, clusters);
202 spin_lock(&oi->ip_lock);
203 oi->ip_clusters = le32_to_cpu(di->i_clusters);
204 spin_unlock(&oi->ip_lock);
205}
206
207static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et,
208 struct ocfs2_extent_rec *rec)
209{
210 struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode;
211
212 ocfs2_extent_map_insert_rec(inode, rec);
213}
214
215static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et,
216 u32 clusters)
217{
218 struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode;
219
220 ocfs2_extent_map_trunc(inode, clusters);
221}
222
223static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
224 struct ocfs2_extent_rec *rec)
225{
226 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
227 struct ocfs2_super *osb = OCFS2_SB(oi->vfs_inode.i_sb);
228
229 BUG_ON(oi->ip_dyn_features & OCFS2_INLINE_DATA_FL);
230 mlog_bug_on_msg(!ocfs2_sparse_alloc(osb) &&
231 (oi->ip_clusters != le32_to_cpu(rec->e_cpos)),
232 "Device %s, asking for sparse allocation: inode %llu, "
233 "cpos %u, clusters %u\n",
234 osb->dev_str,
235 (unsigned long long)oi->ip_blkno,
236 rec->e_cpos, oi->ip_clusters);
237
238 return 0;
239}
240
241static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et)
242{
243 struct ocfs2_dinode *di = et->et_object;
244
245 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
246 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
247
248 return 0;
249}
250
251static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et)
252{
253 struct ocfs2_dinode *di = et->et_object;
254
255 et->et_root_el = &di->id2.i_list;
256}
257
258
259static void ocfs2_xattr_value_fill_root_el(struct ocfs2_extent_tree *et)
260{
261 struct ocfs2_xattr_value_buf *vb = et->et_object;
262
263 et->et_root_el = &vb->vb_xv->xr_list;
264}
265
266static void ocfs2_xattr_value_set_last_eb_blk(struct ocfs2_extent_tree *et,
267 u64 blkno)
268{
269 struct ocfs2_xattr_value_buf *vb = et->et_object;
270
271 vb->vb_xv->xr_last_eb_blk = cpu_to_le64(blkno);
272}
273
274static u64 ocfs2_xattr_value_get_last_eb_blk(struct ocfs2_extent_tree *et)
275{
276 struct ocfs2_xattr_value_buf *vb = et->et_object;
277
278 return le64_to_cpu(vb->vb_xv->xr_last_eb_blk);
279}
280
281static void ocfs2_xattr_value_update_clusters(struct ocfs2_extent_tree *et,
282 u32 clusters)
283{
284 struct ocfs2_xattr_value_buf *vb = et->et_object;
285
286 le32_add_cpu(&vb->vb_xv->xr_clusters, clusters);
287}
288
289static const struct ocfs2_extent_tree_operations ocfs2_xattr_value_et_ops = {
290 .eo_set_last_eb_blk = ocfs2_xattr_value_set_last_eb_blk,
291 .eo_get_last_eb_blk = ocfs2_xattr_value_get_last_eb_blk,
292 .eo_update_clusters = ocfs2_xattr_value_update_clusters,
293 .eo_fill_root_el = ocfs2_xattr_value_fill_root_el,
294};
295
296static void ocfs2_xattr_tree_fill_root_el(struct ocfs2_extent_tree *et)
297{
298 struct ocfs2_xattr_block *xb = et->et_object;
299
300 et->et_root_el = &xb->xb_attrs.xb_root.xt_list;
301}
302
303static void ocfs2_xattr_tree_fill_max_leaf_clusters(struct ocfs2_extent_tree *et)
304{
305 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
306 et->et_max_leaf_clusters =
307 ocfs2_clusters_for_bytes(sb, OCFS2_MAX_XATTR_TREE_LEAF_SIZE);
308}
309
310static void ocfs2_xattr_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
311 u64 blkno)
312{
313 struct ocfs2_xattr_block *xb = et->et_object;
314 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
315
316 xt->xt_last_eb_blk = cpu_to_le64(blkno);
317}
318
319static u64 ocfs2_xattr_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
320{
321 struct ocfs2_xattr_block *xb = et->et_object;
322 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
323
324 return le64_to_cpu(xt->xt_last_eb_blk);
325}
326
327static void ocfs2_xattr_tree_update_clusters(struct ocfs2_extent_tree *et,
328 u32 clusters)
329{
330 struct ocfs2_xattr_block *xb = et->et_object;
331
332 le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, clusters);
333}
334
335static const struct ocfs2_extent_tree_operations ocfs2_xattr_tree_et_ops = {
336 .eo_set_last_eb_blk = ocfs2_xattr_tree_set_last_eb_blk,
337 .eo_get_last_eb_blk = ocfs2_xattr_tree_get_last_eb_blk,
338 .eo_update_clusters = ocfs2_xattr_tree_update_clusters,
339 .eo_fill_root_el = ocfs2_xattr_tree_fill_root_el,
340 .eo_fill_max_leaf_clusters = ocfs2_xattr_tree_fill_max_leaf_clusters,
341};
342
343static void ocfs2_dx_root_set_last_eb_blk(struct ocfs2_extent_tree *et,
344 u64 blkno)
345{
346 struct ocfs2_dx_root_block *dx_root = et->et_object;
347
348 dx_root->dr_last_eb_blk = cpu_to_le64(blkno);
349}
350
351static u64 ocfs2_dx_root_get_last_eb_blk(struct ocfs2_extent_tree *et)
352{
353 struct ocfs2_dx_root_block *dx_root = et->et_object;
354
355 return le64_to_cpu(dx_root->dr_last_eb_blk);
356}
357
358static void ocfs2_dx_root_update_clusters(struct ocfs2_extent_tree *et,
359 u32 clusters)
360{
361 struct ocfs2_dx_root_block *dx_root = et->et_object;
362
363 le32_add_cpu(&dx_root->dr_clusters, clusters);
364}
365
366static int ocfs2_dx_root_sanity_check(struct ocfs2_extent_tree *et)
367{
368 struct ocfs2_dx_root_block *dx_root = et->et_object;
369
370 BUG_ON(!OCFS2_IS_VALID_DX_ROOT(dx_root));
371
372 return 0;
373}
374
375static void ocfs2_dx_root_fill_root_el(struct ocfs2_extent_tree *et)
376{
377 struct ocfs2_dx_root_block *dx_root = et->et_object;
378
379 et->et_root_el = &dx_root->dr_list;
380}
381
382static const struct ocfs2_extent_tree_operations ocfs2_dx_root_et_ops = {
383 .eo_set_last_eb_blk = ocfs2_dx_root_set_last_eb_blk,
384 .eo_get_last_eb_blk = ocfs2_dx_root_get_last_eb_blk,
385 .eo_update_clusters = ocfs2_dx_root_update_clusters,
386 .eo_sanity_check = ocfs2_dx_root_sanity_check,
387 .eo_fill_root_el = ocfs2_dx_root_fill_root_el,
388};
389
390static void ocfs2_refcount_tree_fill_root_el(struct ocfs2_extent_tree *et)
391{
392 struct ocfs2_refcount_block *rb = et->et_object;
393
394 et->et_root_el = &rb->rf_list;
395}
396
397static void ocfs2_refcount_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
398 u64 blkno)
399{
400 struct ocfs2_refcount_block *rb = et->et_object;
401
402 rb->rf_last_eb_blk = cpu_to_le64(blkno);
403}
404
405static u64 ocfs2_refcount_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
406{
407 struct ocfs2_refcount_block *rb = et->et_object;
408
409 return le64_to_cpu(rb->rf_last_eb_blk);
410}
411
412static void ocfs2_refcount_tree_update_clusters(struct ocfs2_extent_tree *et,
413 u32 clusters)
414{
415 struct ocfs2_refcount_block *rb = et->et_object;
416
417 le32_add_cpu(&rb->rf_clusters, clusters);
418}
419
420static enum ocfs2_contig_type
421ocfs2_refcount_tree_extent_contig(struct ocfs2_extent_tree *et,
422 struct ocfs2_extent_rec *ext,
423 struct ocfs2_extent_rec *insert_rec)
424{
425 return CONTIG_NONE;
426}
427
428static const struct ocfs2_extent_tree_operations ocfs2_refcount_tree_et_ops = {
429 .eo_set_last_eb_blk = ocfs2_refcount_tree_set_last_eb_blk,
430 .eo_get_last_eb_blk = ocfs2_refcount_tree_get_last_eb_blk,
431 .eo_update_clusters = ocfs2_refcount_tree_update_clusters,
432 .eo_fill_root_el = ocfs2_refcount_tree_fill_root_el,
433 .eo_extent_contig = ocfs2_refcount_tree_extent_contig,
434};
435
436static void __ocfs2_init_extent_tree(struct ocfs2_extent_tree *et,
437 struct ocfs2_caching_info *ci,
438 struct buffer_head *bh,
439 ocfs2_journal_access_func access,
440 void *obj,
441 const struct ocfs2_extent_tree_operations *ops)
442{
443 et->et_ops = ops;
444 et->et_root_bh = bh;
445 et->et_ci = ci;
446 et->et_root_journal_access = access;
447 if (!obj)
448 obj = (void *)bh->b_data;
449 et->et_object = obj;
450
451 et->et_ops->eo_fill_root_el(et);
452 if (!et->et_ops->eo_fill_max_leaf_clusters)
453 et->et_max_leaf_clusters = 0;
454 else
455 et->et_ops->eo_fill_max_leaf_clusters(et);
456}
457
458void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et,
459 struct ocfs2_caching_info *ci,
460 struct buffer_head *bh)
461{
462 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_di,
463 NULL, &ocfs2_dinode_et_ops);
464}
465
466void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et,
467 struct ocfs2_caching_info *ci,
468 struct buffer_head *bh)
469{
470 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_xb,
471 NULL, &ocfs2_xattr_tree_et_ops);
472}
473
474void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et,
475 struct ocfs2_caching_info *ci,
476 struct ocfs2_xattr_value_buf *vb)
477{
478 __ocfs2_init_extent_tree(et, ci, vb->vb_bh, vb->vb_access, vb,
479 &ocfs2_xattr_value_et_ops);
480}
481
482void ocfs2_init_dx_root_extent_tree(struct ocfs2_extent_tree *et,
483 struct ocfs2_caching_info *ci,
484 struct buffer_head *bh)
485{
486 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_dr,
487 NULL, &ocfs2_dx_root_et_ops);
488}
489
490void ocfs2_init_refcount_extent_tree(struct ocfs2_extent_tree *et,
491 struct ocfs2_caching_info *ci,
492 struct buffer_head *bh)
493{
494 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_rb,
495 NULL, &ocfs2_refcount_tree_et_ops);
496}
497
498static inline void ocfs2_et_set_last_eb_blk(struct ocfs2_extent_tree *et,
499 u64 new_last_eb_blk)
500{
501 et->et_ops->eo_set_last_eb_blk(et, new_last_eb_blk);
502}
503
504static inline u64 ocfs2_et_get_last_eb_blk(struct ocfs2_extent_tree *et)
505{
506 return et->et_ops->eo_get_last_eb_blk(et);
507}
508
509static inline void ocfs2_et_update_clusters(struct ocfs2_extent_tree *et,
510 u32 clusters)
511{
512 et->et_ops->eo_update_clusters(et, clusters);
513}
514
515static inline void ocfs2_et_extent_map_insert(struct ocfs2_extent_tree *et,
516 struct ocfs2_extent_rec *rec)
517{
518 if (et->et_ops->eo_extent_map_insert)
519 et->et_ops->eo_extent_map_insert(et, rec);
520}
521
522static inline void ocfs2_et_extent_map_truncate(struct ocfs2_extent_tree *et,
523 u32 clusters)
524{
525 if (et->et_ops->eo_extent_map_truncate)
526 et->et_ops->eo_extent_map_truncate(et, clusters);
527}
528
529static inline int ocfs2_et_root_journal_access(handle_t *handle,
530 struct ocfs2_extent_tree *et,
531 int type)
532{
533 return et->et_root_journal_access(handle, et->et_ci, et->et_root_bh,
534 type);
535}
536
537static inline enum ocfs2_contig_type
538 ocfs2_et_extent_contig(struct ocfs2_extent_tree *et,
539 struct ocfs2_extent_rec *rec,
540 struct ocfs2_extent_rec *insert_rec)
541{
542 if (et->et_ops->eo_extent_contig)
543 return et->et_ops->eo_extent_contig(et, rec, insert_rec);
544
545 return ocfs2_extent_rec_contig(
546 ocfs2_metadata_cache_get_super(et->et_ci),
547 rec, insert_rec);
548}
549
550static inline int ocfs2_et_insert_check(struct ocfs2_extent_tree *et,
551 struct ocfs2_extent_rec *rec)
552{
553 int ret = 0;
554
555 if (et->et_ops->eo_insert_check)
556 ret = et->et_ops->eo_insert_check(et, rec);
557 return ret;
558}
559
560static inline int ocfs2_et_sanity_check(struct ocfs2_extent_tree *et)
561{
562 int ret = 0;
563
564 if (et->et_ops->eo_sanity_check)
565 ret = et->et_ops->eo_sanity_check(et);
566 return ret;
567}
568
569static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
570 struct ocfs2_extent_block *eb);
571static 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);
575/*
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
578 * heads.
579 */
580void ocfs2_reinit_path(struct ocfs2_path *path, int keep_root)
581{
582 int i, start = 0, depth = 0;
583 struct ocfs2_path_item *node;
584
585 if (keep_root)
586 start = 1;
587
588 for(i = start; i < path_num_items(path); i++) {
589 node = &path->p_node[i];
590
591 brelse(node->bh);
592 node->bh = NULL;
593 node->el = NULL;
594 }
595
596 /*
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.
600 */
601 if (keep_root)
602 depth = le16_to_cpu(path_root_el(path)->l_tree_depth);
603 else
604 path_root_access(path) = NULL;
605
606 path->p_tree_depth = depth;
607}
608
609void ocfs2_free_path(struct ocfs2_path *path)
610{
611 if (path) {
612 ocfs2_reinit_path(path, 0);
613 kfree(path);
614 }
615}
616
617/*
618 * All the elements of src into dest. After this call, src could be freed
619 * without affecting dest.
620 *
621 * Both paths should have the same root. Any non-root elements of dest
622 * will be freed.
623 */
624static void ocfs2_cp_path(struct ocfs2_path *dest, struct ocfs2_path *src)
625{
626 int i;
627
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));
631
632 ocfs2_reinit_path(dest, 1);
633
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;
637
638 if (dest->p_node[i].bh)
639 get_bh(dest->p_node[i].bh);
640 }
641}
642
643/*
644 * Make the *dest path the same as src and re-initialize src path to
645 * have a root only.
646 */
647static void ocfs2_mv_path(struct ocfs2_path *dest, struct ocfs2_path *src)
648{
649 int i;
650
651 BUG_ON(path_root_bh(dest) != path_root_bh(src));
652 BUG_ON(path_root_access(dest) != path_root_access(src));
653
654 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
655 brelse(dest->p_node[i].bh);
656
657 dest->p_node[i].bh = src->p_node[i].bh;
658 dest->p_node[i].el = src->p_node[i].el;
659
660 src->p_node[i].bh = NULL;
661 src->p_node[i].el = NULL;
662 }
663}
664
665/*
666 * Insert an extent block at given index.
667 *
668 * This will not take an additional reference on eb_bh.
669 */
670static inline void ocfs2_path_insert_eb(struct ocfs2_path *path, int index,
671 struct buffer_head *eb_bh)
672{
673 struct ocfs2_extent_block *eb = (struct ocfs2_extent_block *)eb_bh->b_data;
674
675 /*
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.
680 */
681 BUG_ON(index == 0);
682
683 path->p_node[index].bh = eb_bh;
684 path->p_node[index].el = &eb->h_list;
685}
686
687static struct ocfs2_path *ocfs2_new_path(struct buffer_head *root_bh,
688 struct ocfs2_extent_list *root_el,
689 ocfs2_journal_access_func access)
690{
691 struct ocfs2_path *path;
692
693 BUG_ON(le16_to_cpu(root_el->l_tree_depth) >= OCFS2_MAX_PATH_DEPTH);
694
695 path = kzalloc(sizeof(*path), GFP_NOFS);
696 if (path) {
697 path->p_tree_depth = le16_to_cpu(root_el->l_tree_depth);
698 get_bh(root_bh);
699 path_root_bh(path) = root_bh;
700 path_root_el(path) = root_el;
701 path_root_access(path) = access;
702 }
703
704 return path;
705}
706
707struct ocfs2_path *ocfs2_new_path_from_path(struct ocfs2_path *path)
708{
709 return ocfs2_new_path(path_root_bh(path), path_root_el(path),
710 path_root_access(path));
711}
712
713struct ocfs2_path *ocfs2_new_path_from_et(struct ocfs2_extent_tree *et)
714{
715 return ocfs2_new_path(et->et_root_bh, et->et_root_el,
716 et->et_root_journal_access);
717}
718
719/*
720 * Journal the buffer at depth idx. All idx>0 are extent_blocks,
721 * otherwise it's the root_access function.
722 *
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.
725 */
726int ocfs2_path_bh_journal_access(handle_t *handle,
727 struct ocfs2_caching_info *ci,
728 struct ocfs2_path *path,
729 int idx)
730{
731 ocfs2_journal_access_func access = path_root_access(path);
732
733 if (!access)
734 access = ocfs2_journal_access;
735
736 if (idx)
737 access = ocfs2_journal_access_eb;
738
739 return access(handle, ci, path->p_node[idx].bh,
740 OCFS2_JOURNAL_ACCESS_WRITE);
741}
742
743/*
744 * Convenience function to journal all components in a path.
745 */
746int ocfs2_journal_access_path(struct ocfs2_caching_info *ci,
747 handle_t *handle,
748 struct ocfs2_path *path)
749{
750 int i, ret = 0;
751
752 if (!path)
753 goto out;
754
755 for(i = 0; i < path_num_items(path); i++) {
756 ret = ocfs2_path_bh_journal_access(handle, ci, path, i);
757 if (ret < 0) {
758 mlog_errno(ret);
759 goto out;
760 }
761 }
762
763out:
764 return ret;
765}
766
767/*
768 * Return the index of the extent record which contains cluster #v_cluster.
769 * -1 is returned if it was not found.
770 *
771 * Should work fine on interior and exterior nodes.
772 */
773int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster)
774{
775 int ret = -1;
776 int i;
777 struct ocfs2_extent_rec *rec;
778 u32 rec_end, rec_start, clusters;
779
780 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
781 rec = &el->l_recs[i];
782
783 rec_start = le32_to_cpu(rec->e_cpos);
784 clusters = ocfs2_rec_clusters(el, rec);
785
786 rec_end = rec_start + clusters;
787
788 if (v_cluster >= rec_start && v_cluster < rec_end) {
789 ret = i;
790 break;
791 }
792 }
793
794 return ret;
795}
796
797/*
798 * NOTE: ocfs2_block_extent_contig(), ocfs2_extents_adjacent() and
799 * ocfs2_extent_rec_contig only work properly against leaf nodes!
800 */
801static int ocfs2_block_extent_contig(struct super_block *sb,
802 struct ocfs2_extent_rec *ext,
803 u64 blkno)
804{
805 u64 blk_end = le64_to_cpu(ext->e_blkno);
806
807 blk_end += ocfs2_clusters_to_blocks(sb,
808 le16_to_cpu(ext->e_leaf_clusters));
809
810 return blkno == blk_end;
811}
812
813static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left,
814 struct ocfs2_extent_rec *right)
815{
816 u32 left_range;
817
818 left_range = le32_to_cpu(left->e_cpos) +
819 le16_to_cpu(left->e_leaf_clusters);
820
821 return (left_range == le32_to_cpu(right->e_cpos));
822}
823
824static 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)
828{
829 u64 blkno = le64_to_cpu(insert_rec->e_blkno);
830
831 /*
832 * Refuse to coalesce extent records with different flag
833 * fields - we don't want to mix unwritten extents with user
834 * data.
835 */
836 if (ext->e_flags != insert_rec->e_flags)
837 return CONTIG_NONE;
838
839 if (ocfs2_extents_adjacent(ext, insert_rec) &&
840 ocfs2_block_extent_contig(sb, ext, blkno))
841 return CONTIG_RIGHT;
842
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))
846 return CONTIG_LEFT;
847
848 return CONTIG_NONE;
849}
850
851/*
852 * NOTE: We can have pretty much any combination of contiguousness and
853 * appending.
854 *
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.
857 */
858enum ocfs2_append_type {
859 APPEND_NONE = 0,
860 APPEND_TAIL,
861};
862
863enum ocfs2_split_type {
864 SPLIT_NONE = 0,
865 SPLIT_LEFT,
866 SPLIT_RIGHT,
867};
868
869struct 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;
874 int ins_tree_depth;
875};
876
877struct ocfs2_merge_ctxt {
878 enum ocfs2_contig_type c_contig_type;
879 int c_has_empty_extent;
880 int c_split_covers_rec;
881};
882
883static int ocfs2_validate_extent_block(struct super_block *sb,
884 struct buffer_head *bh)
885{
886 int rc;
887 struct ocfs2_extent_block *eb =
888 (struct ocfs2_extent_block *)bh->b_data;
889
890 trace_ocfs2_validate_extent_block((unsigned long long)bh->b_blocknr);
891
892 BUG_ON(!buffer_uptodate(bh));
893
894 /*
895 * If the ecc fails, we return the error but otherwise
896 * leave the filesystem running. We know any error is
897 * local to this block.
898 */
899 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &eb->h_check);
900 if (rc) {
901 mlog(ML_ERROR, "Checksum failed for extent block %llu\n",
902 (unsigned long long)bh->b_blocknr);
903 return rc;
904 }
905
906 /*
907 * Errors after here are fatal.
908 */
909
910 if (!OCFS2_IS_VALID_EXTENT_BLOCK(eb)) {
911 rc = ocfs2_error(sb,
912 "Extent block #%llu has bad signature %.*s\n",
913 (unsigned long long)bh->b_blocknr, 7,
914 eb->h_signature);
915 goto bail;
916 }
917
918 if (le64_to_cpu(eb->h_blkno) != bh->b_blocknr) {
919 rc = ocfs2_error(sb,
920 "Extent block #%llu has an invalid h_blkno of %llu\n",
921 (unsigned long long)bh->b_blocknr,
922 (unsigned long long)le64_to_cpu(eb->h_blkno));
923 goto bail;
924 }
925
926 if (le32_to_cpu(eb->h_fs_generation) != OCFS2_SB(sb)->fs_generation) {
927 rc = ocfs2_error(sb,
928 "Extent block #%llu has an invalid h_fs_generation of #%u\n",
929 (unsigned long long)bh->b_blocknr,
930 le32_to_cpu(eb->h_fs_generation));
931 goto bail;
932 }
933bail:
934 return rc;
935}
936
937int ocfs2_read_extent_block(struct ocfs2_caching_info *ci, u64 eb_blkno,
938 struct buffer_head **bh)
939{
940 int rc;
941 struct buffer_head *tmp = *bh;
942
943 rc = ocfs2_read_block(ci, eb_blkno, &tmp,
944 ocfs2_validate_extent_block);
945
946 /* If ocfs2_read_block() got us a new bh, pass it up. */
947 if (!rc && !*bh)
948 *bh = tmp;
949
950 return rc;
951}
952
953
954/*
955 * How many free extents have we got before we need more meta data?
956 */
957int ocfs2_num_free_extents(struct ocfs2_super *osb,
958 struct ocfs2_extent_tree *et)
959{
960 int retval;
961 struct ocfs2_extent_list *el = NULL;
962 struct ocfs2_extent_block *eb;
963 struct buffer_head *eb_bh = NULL;
964 u64 last_eb_blk = 0;
965
966 el = et->et_root_el;
967 last_eb_blk = ocfs2_et_get_last_eb_blk(et);
968
969 if (last_eb_blk) {
970 retval = ocfs2_read_extent_block(et->et_ci, last_eb_blk,
971 &eb_bh);
972 if (retval < 0) {
973 mlog_errno(retval);
974 goto bail;
975 }
976 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
977 el = &eb->h_list;
978 }
979
980 BUG_ON(el->l_tree_depth != 0);
981
982 retval = le16_to_cpu(el->l_count) - le16_to_cpu(el->l_next_free_rec);
983bail:
984 brelse(eb_bh);
985
986 trace_ocfs2_num_free_extents(retval);
987 return retval;
988}
989
990/* expects array to already be allocated
991 *
992 * sets h_signature, h_blkno, h_suballoc_bit, h_suballoc_slot, and
993 * l_count for you
994 */
995static int ocfs2_create_new_meta_bhs(handle_t *handle,
996 struct ocfs2_extent_tree *et,
997 int wanted,
998 struct ocfs2_alloc_context *meta_ac,
999 struct buffer_head *bhs[])
1000{
1001 int count, status, i;
1002 u16 suballoc_bit_start;
1003 u32 num_got;
1004 u64 suballoc_loc, first_blkno;
1005 struct ocfs2_super *osb =
1006 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
1007 struct ocfs2_extent_block *eb;
1008
1009 count = 0;
1010 while (count < wanted) {
1011 status = ocfs2_claim_metadata(handle,
1012 meta_ac,
1013 wanted - count,
1014 &suballoc_loc,
1015 &suballoc_bit_start,
1016 &num_got,
1017 &first_blkno);
1018 if (status < 0) {
1019 mlog_errno(status);
1020 goto bail;
1021 }
1022
1023 for(i = count; i < (num_got + count); i++) {
1024 bhs[i] = sb_getblk(osb->sb, first_blkno);
1025 if (bhs[i] == NULL) {
1026 status = -ENOMEM;
1027 mlog_errno(status);
1028 goto bail;
1029 }
1030 ocfs2_set_new_buffer_uptodate(et->et_ci, bhs[i]);
1031
1032 status = ocfs2_journal_access_eb(handle, et->et_ci,
1033 bhs[i],
1034 OCFS2_JOURNAL_ACCESS_CREATE);
1035 if (status < 0) {
1036 mlog_errno(status);
1037 goto bail;
1038 }
1039
1040 memset(bhs[i]->b_data, 0, osb->sb->s_blocksize);
1041 eb = (struct ocfs2_extent_block *) bhs[i]->b_data;
1042 /* Ok, setup the minimal stuff here. */
1043 strcpy(eb->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE);
1044 eb->h_blkno = cpu_to_le64(first_blkno);
1045 eb->h_fs_generation = cpu_to_le32(osb->fs_generation);
1046 eb->h_suballoc_slot =
1047 cpu_to_le16(meta_ac->ac_alloc_slot);
1048 eb->h_suballoc_loc = cpu_to_le64(suballoc_loc);
1049 eb->h_suballoc_bit = cpu_to_le16(suballoc_bit_start);
1050 eb->h_list.l_count =
1051 cpu_to_le16(ocfs2_extent_recs_per_eb(osb->sb));
1052
1053 suballoc_bit_start++;
1054 first_blkno++;
1055
1056 /* We'll also be dirtied by the caller, so
1057 * this isn't absolutely necessary. */
1058 ocfs2_journal_dirty(handle, bhs[i]);
1059 }
1060
1061 count += num_got;
1062 }
1063
1064 status = 0;
1065bail:
1066 if (status < 0) {
1067 for(i = 0; i < wanted; i++) {
1068 brelse(bhs[i]);
1069 bhs[i] = NULL;
1070 }
1071 mlog_errno(status);
1072 }
1073 return status;
1074}
1075
1076/*
1077 * Helper function for ocfs2_add_branch() and ocfs2_shift_tree_depth().
1078 *
1079 * Returns the sum of the rightmost extent rec logical offset and
1080 * cluster count.
1081 *
1082 * ocfs2_add_branch() uses this to determine what logical cluster
1083 * value should be populated into the leftmost new branch records.
1084 *
1085 * ocfs2_shift_tree_depth() uses this to determine the # clusters
1086 * value for the new topmost tree record.
1087 */
1088static inline u32 ocfs2_sum_rightmost_rec(struct ocfs2_extent_list *el)
1089{
1090 int i;
1091
1092 i = le16_to_cpu(el->l_next_free_rec) - 1;
1093
1094 return le32_to_cpu(el->l_recs[i].e_cpos) +
1095 ocfs2_rec_clusters(el, &el->l_recs[i]);
1096}
1097
1098/*
1099 * Change range of the branches in the right most path according to the leaf
1100 * extent block's rightmost record.
1101 */
1102static int ocfs2_adjust_rightmost_branch(handle_t *handle,
1103 struct ocfs2_extent_tree *et)
1104{
1105 int status;
1106 struct ocfs2_path *path = NULL;
1107 struct ocfs2_extent_list *el;
1108 struct ocfs2_extent_rec *rec;
1109
1110 path = ocfs2_new_path_from_et(et);
1111 if (!path) {
1112 status = -ENOMEM;
1113 return status;
1114 }
1115
1116 status = ocfs2_find_path(et->et_ci, path, UINT_MAX);
1117 if (status < 0) {
1118 mlog_errno(status);
1119 goto out;
1120 }
1121
1122 status = ocfs2_extend_trans(handle, path_num_items(path));
1123 if (status < 0) {
1124 mlog_errno(status);
1125 goto out;
1126 }
1127
1128 status = ocfs2_journal_access_path(et->et_ci, handle, path);
1129 if (status < 0) {
1130 mlog_errno(status);
1131 goto out;
1132 }
1133
1134 el = path_leaf_el(path);
1135 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec) - 1];
1136
1137 ocfs2_adjust_rightmost_records(handle, et, path, rec);
1138
1139out:
1140 ocfs2_free_path(path);
1141 return status;
1142}
1143
1144/*
1145 * Add an entire tree branch to our inode. eb_bh is the extent block
1146 * to start at, if we don't want to start the branch at the root
1147 * structure.
1148 *
1149 * last_eb_bh is required as we have to update it's next_leaf pointer
1150 * for the new last extent block.
1151 *
1152 * the new branch will be 'empty' in the sense that every block will
1153 * contain a single record with cluster count == 0.
1154 */
1155static int ocfs2_add_branch(handle_t *handle,
1156 struct ocfs2_extent_tree *et,
1157 struct buffer_head *eb_bh,
1158 struct buffer_head **last_eb_bh,
1159 struct ocfs2_alloc_context *meta_ac)
1160{
1161 int status, new_blocks, i;
1162 u64 next_blkno, new_last_eb_blk;
1163 struct buffer_head *bh;
1164 struct buffer_head **new_eb_bhs = NULL;
1165 struct ocfs2_extent_block *eb;
1166 struct ocfs2_extent_list *eb_el;
1167 struct ocfs2_extent_list *el;
1168 u32 new_cpos, root_end;
1169
1170 BUG_ON(!last_eb_bh || !*last_eb_bh);
1171
1172 if (eb_bh) {
1173 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
1174 el = &eb->h_list;
1175 } else
1176 el = et->et_root_el;
1177
1178 /* we never add a branch to a leaf. */
1179 BUG_ON(!el->l_tree_depth);
1180
1181 new_blocks = le16_to_cpu(el->l_tree_depth);
1182
1183 eb = (struct ocfs2_extent_block *)(*last_eb_bh)->b_data;
1184 new_cpos = ocfs2_sum_rightmost_rec(&eb->h_list);
1185 root_end = ocfs2_sum_rightmost_rec(et->et_root_el);
1186
1187 /*
1188 * If there is a gap before the root end and the real end
1189 * of the righmost leaf block, we need to remove the gap
1190 * between new_cpos and root_end first so that the tree
1191 * is consistent after we add a new branch(it will start
1192 * from new_cpos).
1193 */
1194 if (root_end > new_cpos) {
1195 trace_ocfs2_adjust_rightmost_branch(
1196 (unsigned long long)
1197 ocfs2_metadata_cache_owner(et->et_ci),
1198 root_end, new_cpos);
1199
1200 status = ocfs2_adjust_rightmost_branch(handle, et);
1201 if (status) {
1202 mlog_errno(status);
1203 goto bail;
1204 }
1205 }
1206
1207 /* allocate the number of new eb blocks we need */
1208 new_eb_bhs = kcalloc(new_blocks, sizeof(struct buffer_head *),
1209 GFP_KERNEL);
1210 if (!new_eb_bhs) {
1211 status = -ENOMEM;
1212 mlog_errno(status);
1213 goto bail;
1214 }
1215
1216 status = ocfs2_create_new_meta_bhs(handle, et, new_blocks,
1217 meta_ac, new_eb_bhs);
1218 if (status < 0) {
1219 mlog_errno(status);
1220 goto bail;
1221 }
1222
1223 /* Note: new_eb_bhs[new_blocks - 1] is the guy which will be
1224 * linked with the rest of the tree.
1225 * conversly, new_eb_bhs[0] is the new bottommost leaf.
1226 *
1227 * when we leave the loop, new_last_eb_blk will point to the
1228 * newest leaf, and next_blkno will point to the topmost extent
1229 * block. */
1230 next_blkno = new_last_eb_blk = 0;
1231 for(i = 0; i < new_blocks; i++) {
1232 bh = new_eb_bhs[i];
1233 eb = (struct ocfs2_extent_block *) bh->b_data;
1234 /* ocfs2_create_new_meta_bhs() should create it right! */
1235 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1236 eb_el = &eb->h_list;
1237
1238 status = ocfs2_journal_access_eb(handle, et->et_ci, bh,
1239 OCFS2_JOURNAL_ACCESS_CREATE);
1240 if (status < 0) {
1241 mlog_errno(status);
1242 goto bail;
1243 }
1244
1245 eb->h_next_leaf_blk = 0;
1246 eb_el->l_tree_depth = cpu_to_le16(i);
1247 eb_el->l_next_free_rec = cpu_to_le16(1);
1248 /*
1249 * This actually counts as an empty extent as
1250 * c_clusters == 0
1251 */
1252 eb_el->l_recs[0].e_cpos = cpu_to_le32(new_cpos);
1253 eb_el->l_recs[0].e_blkno = cpu_to_le64(next_blkno);
1254 /*
1255 * eb_el isn't always an interior node, but even leaf
1256 * nodes want a zero'd flags and reserved field so
1257 * this gets the whole 32 bits regardless of use.
1258 */
1259 eb_el->l_recs[0].e_int_clusters = cpu_to_le32(0);
1260 if (!eb_el->l_tree_depth)
1261 new_last_eb_blk = le64_to_cpu(eb->h_blkno);
1262
1263 ocfs2_journal_dirty(handle, bh);
1264 next_blkno = le64_to_cpu(eb->h_blkno);
1265 }
1266
1267 /* This is a bit hairy. We want to update up to three blocks
1268 * here without leaving any of them in an inconsistent state
1269 * in case of error. We don't have to worry about
1270 * journal_dirty erroring as it won't unless we've aborted the
1271 * handle (in which case we would never be here) so reserving
1272 * the write with journal_access is all we need to do. */
1273 status = ocfs2_journal_access_eb(handle, et->et_ci, *last_eb_bh,
1274 OCFS2_JOURNAL_ACCESS_WRITE);
1275 if (status < 0) {
1276 mlog_errno(status);
1277 goto bail;
1278 }
1279 status = ocfs2_et_root_journal_access(handle, et,
1280 OCFS2_JOURNAL_ACCESS_WRITE);
1281 if (status < 0) {
1282 mlog_errno(status);
1283 goto bail;
1284 }
1285 if (eb_bh) {
1286 status = ocfs2_journal_access_eb(handle, et->et_ci, eb_bh,
1287 OCFS2_JOURNAL_ACCESS_WRITE);
1288 if (status < 0) {
1289 mlog_errno(status);
1290 goto bail;
1291 }
1292 }
1293
1294 /* Link the new branch into the rest of the tree (el will
1295 * either be on the root_bh, or the extent block passed in. */
1296 i = le16_to_cpu(el->l_next_free_rec);
1297 el->l_recs[i].e_blkno = cpu_to_le64(next_blkno);
1298 el->l_recs[i].e_cpos = cpu_to_le32(new_cpos);
1299 el->l_recs[i].e_int_clusters = 0;
1300 le16_add_cpu(&el->l_next_free_rec, 1);
1301
1302 /* fe needs a new last extent block pointer, as does the
1303 * next_leaf on the previously last-extent-block. */
1304 ocfs2_et_set_last_eb_blk(et, new_last_eb_blk);
1305
1306 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
1307 eb->h_next_leaf_blk = cpu_to_le64(new_last_eb_blk);
1308
1309 ocfs2_journal_dirty(handle, *last_eb_bh);
1310 ocfs2_journal_dirty(handle, et->et_root_bh);
1311 if (eb_bh)
1312 ocfs2_journal_dirty(handle, eb_bh);
1313
1314 /*
1315 * Some callers want to track the rightmost leaf so pass it
1316 * back here.
1317 */
1318 brelse(*last_eb_bh);
1319 get_bh(new_eb_bhs[0]);
1320 *last_eb_bh = new_eb_bhs[0];
1321
1322 status = 0;
1323bail:
1324 if (new_eb_bhs) {
1325 for (i = 0; i < new_blocks; i++)
1326 brelse(new_eb_bhs[i]);
1327 kfree(new_eb_bhs);
1328 }
1329
1330 return status;
1331}
1332
1333/*
1334 * adds another level to the allocation tree.
1335 * returns back the new extent block so you can add a branch to it
1336 * after this call.
1337 */
1338static int ocfs2_shift_tree_depth(handle_t *handle,
1339 struct ocfs2_extent_tree *et,
1340 struct ocfs2_alloc_context *meta_ac,
1341 struct buffer_head **ret_new_eb_bh)
1342{
1343 int status, i;
1344 u32 new_clusters;
1345 struct buffer_head *new_eb_bh = NULL;
1346 struct ocfs2_extent_block *eb;
1347 struct ocfs2_extent_list *root_el;
1348 struct ocfs2_extent_list *eb_el;
1349
1350 status = ocfs2_create_new_meta_bhs(handle, et, 1, meta_ac,
1351 &new_eb_bh);
1352 if (status < 0) {
1353 mlog_errno(status);
1354 goto bail;
1355 }
1356
1357 eb = (struct ocfs2_extent_block *) new_eb_bh->b_data;
1358 /* ocfs2_create_new_meta_bhs() should create it right! */
1359 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1360
1361 eb_el = &eb->h_list;
1362 root_el = et->et_root_el;
1363
1364 status = ocfs2_journal_access_eb(handle, et->et_ci, new_eb_bh,
1365 OCFS2_JOURNAL_ACCESS_CREATE);
1366 if (status < 0) {
1367 mlog_errno(status);
1368 goto bail;
1369 }
1370
1371 /* copy the root extent list data into the new extent block */
1372 eb_el->l_tree_depth = root_el->l_tree_depth;
1373 eb_el->l_next_free_rec = root_el->l_next_free_rec;
1374 for (i = 0; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1375 eb_el->l_recs[i] = root_el->l_recs[i];
1376
1377 ocfs2_journal_dirty(handle, new_eb_bh);
1378
1379 status = ocfs2_et_root_journal_access(handle, et,
1380 OCFS2_JOURNAL_ACCESS_WRITE);
1381 if (status < 0) {
1382 mlog_errno(status);
1383 goto bail;
1384 }
1385
1386 new_clusters = ocfs2_sum_rightmost_rec(eb_el);
1387
1388 /* update root_bh now */
1389 le16_add_cpu(&root_el->l_tree_depth, 1);
1390 root_el->l_recs[0].e_cpos = 0;
1391 root_el->l_recs[0].e_blkno = eb->h_blkno;
1392 root_el->l_recs[0].e_int_clusters = cpu_to_le32(new_clusters);
1393 for (i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1394 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
1395 root_el->l_next_free_rec = cpu_to_le16(1);
1396
1397 /* If this is our 1st tree depth shift, then last_eb_blk
1398 * becomes the allocated extent block */
1399 if (root_el->l_tree_depth == cpu_to_le16(1))
1400 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
1401
1402 ocfs2_journal_dirty(handle, et->et_root_bh);
1403
1404 *ret_new_eb_bh = new_eb_bh;
1405 new_eb_bh = NULL;
1406 status = 0;
1407bail:
1408 brelse(new_eb_bh);
1409
1410 return status;
1411}
1412
1413/*
1414 * Should only be called when there is no space left in any of the
1415 * leaf nodes. What we want to do is find the lowest tree depth
1416 * non-leaf extent block with room for new records. There are three
1417 * valid results of this search:
1418 *
1419 * 1) a lowest extent block is found, then we pass it back in
1420 * *lowest_eb_bh and return '0'
1421 *
1422 * 2) the search fails to find anything, but the root_el has room. We
1423 * pass NULL back in *lowest_eb_bh, but still return '0'
1424 *
1425 * 3) the search fails to find anything AND the root_el is full, in
1426 * which case we return > 0
1427 *
1428 * return status < 0 indicates an error.
1429 */
1430static int ocfs2_find_branch_target(struct ocfs2_extent_tree *et,
1431 struct buffer_head **target_bh)
1432{
1433 int status = 0, i;
1434 u64 blkno;
1435 struct ocfs2_extent_block *eb;
1436 struct ocfs2_extent_list *el;
1437 struct buffer_head *bh = NULL;
1438 struct buffer_head *lowest_bh = NULL;
1439
1440 *target_bh = NULL;
1441
1442 el = et->et_root_el;
1443
1444 while(le16_to_cpu(el->l_tree_depth) > 1) {
1445 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1446 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1447 "Owner %llu has empty extent list (next_free_rec == 0)\n",
1448 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
1449 status = -EIO;
1450 goto bail;
1451 }
1452 i = le16_to_cpu(el->l_next_free_rec) - 1;
1453 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1454 if (!blkno) {
1455 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1456 "Owner %llu has extent list where extent # %d has no physical block start\n",
1457 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), i);
1458 status = -EIO;
1459 goto bail;
1460 }
1461
1462 brelse(bh);
1463 bh = NULL;
1464
1465 status = ocfs2_read_extent_block(et->et_ci, blkno, &bh);
1466 if (status < 0) {
1467 mlog_errno(status);
1468 goto bail;
1469 }
1470
1471 eb = (struct ocfs2_extent_block *) bh->b_data;
1472 el = &eb->h_list;
1473
1474 if (le16_to_cpu(el->l_next_free_rec) <
1475 le16_to_cpu(el->l_count)) {
1476 brelse(lowest_bh);
1477 lowest_bh = bh;
1478 get_bh(lowest_bh);
1479 }
1480 }
1481
1482 /* If we didn't find one and the fe doesn't have any room,
1483 * then return '1' */
1484 el = et->et_root_el;
1485 if (!lowest_bh && (el->l_next_free_rec == el->l_count))
1486 status = 1;
1487
1488 *target_bh = lowest_bh;
1489bail:
1490 brelse(bh);
1491
1492 return status;
1493}
1494
1495/*
1496 * Grow a b-tree so that it has more records.
1497 *
1498 * We might shift the tree depth in which case existing paths should
1499 * be considered invalid.
1500 *
1501 * Tree depth after the grow is returned via *final_depth.
1502 *
1503 * *last_eb_bh will be updated by ocfs2_add_branch().
1504 */
1505static int ocfs2_grow_tree(handle_t *handle, struct ocfs2_extent_tree *et,
1506 int *final_depth, struct buffer_head **last_eb_bh,
1507 struct ocfs2_alloc_context *meta_ac)
1508{
1509 int ret, shift;
1510 struct ocfs2_extent_list *el = et->et_root_el;
1511 int depth = le16_to_cpu(el->l_tree_depth);
1512 struct buffer_head *bh = NULL;
1513
1514 BUG_ON(meta_ac == NULL);
1515
1516 shift = ocfs2_find_branch_target(et, &bh);
1517 if (shift < 0) {
1518 ret = shift;
1519 mlog_errno(ret);
1520 goto out;
1521 }
1522
1523 /* We traveled all the way to the bottom of the allocation tree
1524 * and didn't find room for any more extents - we need to add
1525 * another tree level */
1526 if (shift) {
1527 BUG_ON(bh);
1528 trace_ocfs2_grow_tree(
1529 (unsigned long long)
1530 ocfs2_metadata_cache_owner(et->et_ci),
1531 depth);
1532
1533 /* ocfs2_shift_tree_depth will return us a buffer with
1534 * the new extent block (so we can pass that to
1535 * ocfs2_add_branch). */
1536 ret = ocfs2_shift_tree_depth(handle, et, meta_ac, &bh);
1537 if (ret < 0) {
1538 mlog_errno(ret);
1539 goto out;
1540 }
1541 depth++;
1542 if (depth == 1) {
1543 /*
1544 * Special case: we have room now if we shifted from
1545 * tree_depth 0, so no more work needs to be done.
1546 *
1547 * We won't be calling add_branch, so pass
1548 * back *last_eb_bh as the new leaf. At depth
1549 * zero, it should always be null so there's
1550 * no reason to brelse.
1551 */
1552 BUG_ON(*last_eb_bh);
1553 get_bh(bh);
1554 *last_eb_bh = bh;
1555 goto out;
1556 }
1557 }
1558
1559 /* call ocfs2_add_branch to add the final part of the tree with
1560 * the new data. */
1561 ret = ocfs2_add_branch(handle, et, bh, last_eb_bh,
1562 meta_ac);
1563 if (ret < 0) {
1564 mlog_errno(ret);
1565 goto out;
1566 }
1567
1568out:
1569 if (final_depth)
1570 *final_depth = depth;
1571 brelse(bh);
1572 return ret;
1573}
1574
1575/*
1576 * This function will discard the rightmost extent record.
1577 */
1578static void ocfs2_shift_records_right(struct ocfs2_extent_list *el)
1579{
1580 int next_free = le16_to_cpu(el->l_next_free_rec);
1581 int count = le16_to_cpu(el->l_count);
1582 unsigned int num_bytes;
1583
1584 BUG_ON(!next_free);
1585 /* This will cause us to go off the end of our extent list. */
1586 BUG_ON(next_free >= count);
1587
1588 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1589
1590 memmove(&el->l_recs[1], &el->l_recs[0], num_bytes);
1591}
1592
1593static void ocfs2_rotate_leaf(struct ocfs2_extent_list *el,
1594 struct ocfs2_extent_rec *insert_rec)
1595{
1596 int i, insert_index, next_free, has_empty, num_bytes;
1597 u32 insert_cpos = le32_to_cpu(insert_rec->e_cpos);
1598 struct ocfs2_extent_rec *rec;
1599
1600 next_free = le16_to_cpu(el->l_next_free_rec);
1601 has_empty = ocfs2_is_empty_extent(&el->l_recs[0]);
1602
1603 BUG_ON(!next_free);
1604
1605 /* The tree code before us didn't allow enough room in the leaf. */
1606 BUG_ON(el->l_next_free_rec == el->l_count && !has_empty);
1607
1608 /*
1609 * The easiest way to approach this is to just remove the
1610 * empty extent and temporarily decrement next_free.
1611 */
1612 if (has_empty) {
1613 /*
1614 * If next_free was 1 (only an empty extent), this
1615 * loop won't execute, which is fine. We still want
1616 * the decrement above to happen.
1617 */
1618 for(i = 0; i < (next_free - 1); i++)
1619 el->l_recs[i] = el->l_recs[i+1];
1620
1621 next_free--;
1622 }
1623
1624 /*
1625 * Figure out what the new record index should be.
1626 */
1627 for(i = 0; i < next_free; i++) {
1628 rec = &el->l_recs[i];
1629
1630 if (insert_cpos < le32_to_cpu(rec->e_cpos))
1631 break;
1632 }
1633 insert_index = i;
1634
1635 trace_ocfs2_rotate_leaf(insert_cpos, insert_index,
1636 has_empty, next_free,
1637 le16_to_cpu(el->l_count));
1638
1639 BUG_ON(insert_index < 0);
1640 BUG_ON(insert_index >= le16_to_cpu(el->l_count));
1641 BUG_ON(insert_index > next_free);
1642
1643 /*
1644 * No need to memmove if we're just adding to the tail.
1645 */
1646 if (insert_index != next_free) {
1647 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1648
1649 num_bytes = next_free - insert_index;
1650 num_bytes *= sizeof(struct ocfs2_extent_rec);
1651 memmove(&el->l_recs[insert_index + 1],
1652 &el->l_recs[insert_index],
1653 num_bytes);
1654 }
1655
1656 /*
1657 * Either we had an empty extent, and need to re-increment or
1658 * there was no empty extent on a non full rightmost leaf node,
1659 * in which case we still need to increment.
1660 */
1661 next_free++;
1662 el->l_next_free_rec = cpu_to_le16(next_free);
1663 /*
1664 * Make sure none of the math above just messed up our tree.
1665 */
1666 BUG_ON(le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count));
1667
1668 el->l_recs[insert_index] = *insert_rec;
1669
1670}
1671
1672static void ocfs2_remove_empty_extent(struct ocfs2_extent_list *el)
1673{
1674 int size, num_recs = le16_to_cpu(el->l_next_free_rec);
1675
1676 BUG_ON(num_recs == 0);
1677
1678 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
1679 num_recs--;
1680 size = num_recs * sizeof(struct ocfs2_extent_rec);
1681 memmove(&el->l_recs[0], &el->l_recs[1], size);
1682 memset(&el->l_recs[num_recs], 0,
1683 sizeof(struct ocfs2_extent_rec));
1684 el->l_next_free_rec = cpu_to_le16(num_recs);
1685 }
1686}
1687
1688/*
1689 * Create an empty extent record .
1690 *
1691 * l_next_free_rec may be updated.
1692 *
1693 * If an empty extent already exists do nothing.
1694 */
1695static void ocfs2_create_empty_extent(struct ocfs2_extent_list *el)
1696{
1697 int next_free = le16_to_cpu(el->l_next_free_rec);
1698
1699 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
1700
1701 if (next_free == 0)
1702 goto set_and_inc;
1703
1704 if (ocfs2_is_empty_extent(&el->l_recs[0]))
1705 return;
1706
1707 mlog_bug_on_msg(el->l_count == el->l_next_free_rec,
1708 "Asked to create an empty extent in a full list:\n"
1709 "count = %u, tree depth = %u",
1710 le16_to_cpu(el->l_count),
1711 le16_to_cpu(el->l_tree_depth));
1712
1713 ocfs2_shift_records_right(el);
1714
1715set_and_inc:
1716 le16_add_cpu(&el->l_next_free_rec, 1);
1717 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
1718}
1719
1720/*
1721 * For a rotation which involves two leaf nodes, the "root node" is
1722 * the lowest level tree node which contains a path to both leafs. This
1723 * resulting set of information can be used to form a complete "subtree"
1724 *
1725 * This function is passed two full paths from the dinode down to a
1726 * pair of adjacent leaves. It's task is to figure out which path
1727 * index contains the subtree root - this can be the root index itself
1728 * in a worst-case rotation.
1729 *
1730 * The array index of the subtree root is passed back.
1731 */
1732int ocfs2_find_subtree_root(struct ocfs2_extent_tree *et,
1733 struct ocfs2_path *left,
1734 struct ocfs2_path *right)
1735{
1736 int i = 0;
1737
1738 /*
1739 * Check that the caller passed in two paths from the same tree.
1740 */
1741 BUG_ON(path_root_bh(left) != path_root_bh(right));
1742
1743 do {
1744 i++;
1745
1746 /*
1747 * The caller didn't pass two adjacent paths.
1748 */
1749 mlog_bug_on_msg(i > left->p_tree_depth,
1750 "Owner %llu, left depth %u, right depth %u\n"
1751 "left leaf blk %llu, right leaf blk %llu\n",
1752 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
1753 left->p_tree_depth, right->p_tree_depth,
1754 (unsigned long long)path_leaf_bh(left)->b_blocknr,
1755 (unsigned long long)path_leaf_bh(right)->b_blocknr);
1756 } while (left->p_node[i].bh->b_blocknr ==
1757 right->p_node[i].bh->b_blocknr);
1758
1759 return i - 1;
1760}
1761
1762typedef void (path_insert_t)(void *, struct buffer_head *);
1763
1764/*
1765 * Traverse a btree path in search of cpos, starting at root_el.
1766 *
1767 * This code can be called with a cpos larger than the tree, in which
1768 * case it will return the rightmost path.
1769 */
1770static int __ocfs2_find_path(struct ocfs2_caching_info *ci,
1771 struct ocfs2_extent_list *root_el, u32 cpos,
1772 path_insert_t *func, void *data)
1773{
1774 int i, ret = 0;
1775 u32 range;
1776 u64 blkno;
1777 struct buffer_head *bh = NULL;
1778 struct ocfs2_extent_block *eb;
1779 struct ocfs2_extent_list *el;
1780 struct ocfs2_extent_rec *rec;
1781
1782 el = root_el;
1783 while (el->l_tree_depth) {
1784 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1785 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1786 "Owner %llu has empty extent list at depth %u\n",
1787 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1788 le16_to_cpu(el->l_tree_depth));
1789 ret = -EROFS;
1790 goto out;
1791
1792 }
1793
1794 for(i = 0; i < le16_to_cpu(el->l_next_free_rec) - 1; i++) {
1795 rec = &el->l_recs[i];
1796
1797 /*
1798 * In the case that cpos is off the allocation
1799 * tree, this should just wind up returning the
1800 * rightmost record.
1801 */
1802 range = le32_to_cpu(rec->e_cpos) +
1803 ocfs2_rec_clusters(el, rec);
1804 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
1805 break;
1806 }
1807
1808 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1809 if (blkno == 0) {
1810 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1811 "Owner %llu has bad blkno in extent list at depth %u (index %d)\n",
1812 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1813 le16_to_cpu(el->l_tree_depth), i);
1814 ret = -EROFS;
1815 goto out;
1816 }
1817
1818 brelse(bh);
1819 bh = NULL;
1820 ret = ocfs2_read_extent_block(ci, blkno, &bh);
1821 if (ret) {
1822 mlog_errno(ret);
1823 goto out;
1824 }
1825
1826 eb = (struct ocfs2_extent_block *) bh->b_data;
1827 el = &eb->h_list;
1828
1829 if (le16_to_cpu(el->l_next_free_rec) >
1830 le16_to_cpu(el->l_count)) {
1831 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1832 "Owner %llu has bad count in extent list at block %llu (next free=%u, count=%u)\n",
1833 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1834 (unsigned long long)bh->b_blocknr,
1835 le16_to_cpu(el->l_next_free_rec),
1836 le16_to_cpu(el->l_count));
1837 ret = -EROFS;
1838 goto out;
1839 }
1840
1841 if (func)
1842 func(data, bh);
1843 }
1844
1845out:
1846 /*
1847 * Catch any trailing bh that the loop didn't handle.
1848 */
1849 brelse(bh);
1850
1851 return ret;
1852}
1853
1854/*
1855 * Given an initialized path (that is, it has a valid root extent
1856 * list), this function will traverse the btree in search of the path
1857 * which would contain cpos.
1858 *
1859 * The path traveled is recorded in the path structure.
1860 *
1861 * Note that this will not do any comparisons on leaf node extent
1862 * records, so it will work fine in the case that we just added a tree
1863 * branch.
1864 */
1865struct find_path_data {
1866 int index;
1867 struct ocfs2_path *path;
1868};
1869static void find_path_ins(void *data, struct buffer_head *bh)
1870{
1871 struct find_path_data *fp = data;
1872
1873 get_bh(bh);
1874 ocfs2_path_insert_eb(fp->path, fp->index, bh);
1875 fp->index++;
1876}
1877int ocfs2_find_path(struct ocfs2_caching_info *ci,
1878 struct ocfs2_path *path, u32 cpos)
1879{
1880 struct find_path_data data;
1881
1882 data.index = 1;
1883 data.path = path;
1884 return __ocfs2_find_path(ci, path_root_el(path), cpos,
1885 find_path_ins, &data);
1886}
1887
1888static void find_leaf_ins(void *data, struct buffer_head *bh)
1889{
1890 struct ocfs2_extent_block *eb =(struct ocfs2_extent_block *)bh->b_data;
1891 struct ocfs2_extent_list *el = &eb->h_list;
1892 struct buffer_head **ret = data;
1893
1894 /* We want to retain only the leaf block. */
1895 if (le16_to_cpu(el->l_tree_depth) == 0) {
1896 get_bh(bh);
1897 *ret = bh;
1898 }
1899}
1900/*
1901 * Find the leaf block in the tree which would contain cpos. No
1902 * checking of the actual leaf is done.
1903 *
1904 * Some paths want to call this instead of allocating a path structure
1905 * and calling ocfs2_find_path().
1906 *
1907 * This function doesn't handle non btree extent lists.
1908 */
1909int ocfs2_find_leaf(struct ocfs2_caching_info *ci,
1910 struct ocfs2_extent_list *root_el, u32 cpos,
1911 struct buffer_head **leaf_bh)
1912{
1913 int ret;
1914 struct buffer_head *bh = NULL;
1915
1916 ret = __ocfs2_find_path(ci, root_el, cpos, find_leaf_ins, &bh);
1917 if (ret) {
1918 mlog_errno(ret);
1919 goto out;
1920 }
1921
1922 *leaf_bh = bh;
1923out:
1924 return ret;
1925}
1926
1927/*
1928 * Adjust the adjacent records (left_rec, right_rec) involved in a rotation.
1929 *
1930 * Basically, we've moved stuff around at the bottom of the tree and
1931 * we need to fix up the extent records above the changes to reflect
1932 * the new changes.
1933 *
1934 * left_rec: the record on the left.
1935 * left_child_el: is the child list pointed to by left_rec
1936 * right_rec: the record to the right of left_rec
1937 * right_child_el: is the child list pointed to by right_rec
1938 *
1939 * By definition, this only works on interior nodes.
1940 */
1941static void ocfs2_adjust_adjacent_records(struct ocfs2_extent_rec *left_rec,
1942 struct ocfs2_extent_list *left_child_el,
1943 struct ocfs2_extent_rec *right_rec,
1944 struct ocfs2_extent_list *right_child_el)
1945{
1946 u32 left_clusters, right_end;
1947
1948 /*
1949 * Interior nodes never have holes. Their cpos is the cpos of
1950 * the leftmost record in their child list. Their cluster
1951 * count covers the full theoretical range of their child list
1952 * - the range between their cpos and the cpos of the record
1953 * immediately to their right.
1954 */
1955 left_clusters = le32_to_cpu(right_child_el->l_recs[0].e_cpos);
1956 if (!ocfs2_rec_clusters(right_child_el, &right_child_el->l_recs[0])) {
1957 BUG_ON(right_child_el->l_tree_depth);
1958 BUG_ON(le16_to_cpu(right_child_el->l_next_free_rec) <= 1);
1959 left_clusters = le32_to_cpu(right_child_el->l_recs[1].e_cpos);
1960 }
1961 left_clusters -= le32_to_cpu(left_rec->e_cpos);
1962 left_rec->e_int_clusters = cpu_to_le32(left_clusters);
1963
1964 /*
1965 * Calculate the rightmost cluster count boundary before
1966 * moving cpos - we will need to adjust clusters after
1967 * updating e_cpos to keep the same highest cluster count.
1968 */
1969 right_end = le32_to_cpu(right_rec->e_cpos);
1970 right_end += le32_to_cpu(right_rec->e_int_clusters);
1971
1972 right_rec->e_cpos = left_rec->e_cpos;
1973 le32_add_cpu(&right_rec->e_cpos, left_clusters);
1974
1975 right_end -= le32_to_cpu(right_rec->e_cpos);
1976 right_rec->e_int_clusters = cpu_to_le32(right_end);
1977}
1978
1979/*
1980 * Adjust the adjacent root node records involved in a
1981 * rotation. left_el_blkno is passed in as a key so that we can easily
1982 * find it's index in the root list.
1983 */
1984static void ocfs2_adjust_root_records(struct ocfs2_extent_list *root_el,
1985 struct ocfs2_extent_list *left_el,
1986 struct ocfs2_extent_list *right_el,
1987 u64 left_el_blkno)
1988{
1989 int i;
1990
1991 BUG_ON(le16_to_cpu(root_el->l_tree_depth) <=
1992 le16_to_cpu(left_el->l_tree_depth));
1993
1994 for(i = 0; i < le16_to_cpu(root_el->l_next_free_rec) - 1; i++) {
1995 if (le64_to_cpu(root_el->l_recs[i].e_blkno) == left_el_blkno)
1996 break;
1997 }
1998
1999 /*
2000 * The path walking code should have never returned a root and
2001 * two paths which are not adjacent.
2002 */
2003 BUG_ON(i >= (le16_to_cpu(root_el->l_next_free_rec) - 1));
2004
2005 ocfs2_adjust_adjacent_records(&root_el->l_recs[i], left_el,
2006 &root_el->l_recs[i + 1], right_el);
2007}
2008
2009/*
2010 * We've changed a leaf block (in right_path) and need to reflect that
2011 * change back up the subtree.
2012 *
2013 * This happens in multiple places:
2014 * - When we've moved an extent record from the left path leaf to the right
2015 * path leaf to make room for an empty extent in the left path leaf.
2016 * - When our insert into the right path leaf is at the leftmost edge
2017 * and requires an update of the path immediately to it's left. This
2018 * can occur at the end of some types of rotation and appending inserts.
2019 * - When we've adjusted the last extent record in the left path leaf and the
2020 * 1st extent record in the right path leaf during cross extent block merge.
2021 */
2022static void ocfs2_complete_edge_insert(handle_t *handle,
2023 struct ocfs2_path *left_path,
2024 struct ocfs2_path *right_path,
2025 int subtree_index)
2026{
2027 int i, idx;
2028 struct ocfs2_extent_list *el, *left_el, *right_el;
2029 struct ocfs2_extent_rec *left_rec, *right_rec;
2030 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2031
2032 /*
2033 * Update the counts and position values within all the
2034 * interior nodes to reflect the leaf rotation we just did.
2035 *
2036 * The root node is handled below the loop.
2037 *
2038 * We begin the loop with right_el and left_el pointing to the
2039 * leaf lists and work our way up.
2040 *
2041 * NOTE: within this loop, left_el and right_el always refer
2042 * to the *child* lists.
2043 */
2044 left_el = path_leaf_el(left_path);
2045 right_el = path_leaf_el(right_path);
2046 for(i = left_path->p_tree_depth - 1; i > subtree_index; i--) {
2047 trace_ocfs2_complete_edge_insert(i);
2048
2049 /*
2050 * One nice property of knowing that all of these
2051 * nodes are below the root is that we only deal with
2052 * the leftmost right node record and the rightmost
2053 * left node record.
2054 */
2055 el = left_path->p_node[i].el;
2056 idx = le16_to_cpu(left_el->l_next_free_rec) - 1;
2057 left_rec = &el->l_recs[idx];
2058
2059 el = right_path->p_node[i].el;
2060 right_rec = &el->l_recs[0];
2061
2062 ocfs2_adjust_adjacent_records(left_rec, left_el, right_rec,
2063 right_el);
2064
2065 ocfs2_journal_dirty(handle, left_path->p_node[i].bh);
2066 ocfs2_journal_dirty(handle, right_path->p_node[i].bh);
2067
2068 /*
2069 * Setup our list pointers now so that the current
2070 * parents become children in the next iteration.
2071 */
2072 left_el = left_path->p_node[i].el;
2073 right_el = right_path->p_node[i].el;
2074 }
2075
2076 /*
2077 * At the root node, adjust the two adjacent records which
2078 * begin our path to the leaves.
2079 */
2080
2081 el = left_path->p_node[subtree_index].el;
2082 left_el = left_path->p_node[subtree_index + 1].el;
2083 right_el = right_path->p_node[subtree_index + 1].el;
2084
2085 ocfs2_adjust_root_records(el, left_el, right_el,
2086 left_path->p_node[subtree_index + 1].bh->b_blocknr);
2087
2088 root_bh = left_path->p_node[subtree_index].bh;
2089
2090 ocfs2_journal_dirty(handle, root_bh);
2091}
2092
2093static int ocfs2_rotate_subtree_right(handle_t *handle,
2094 struct ocfs2_extent_tree *et,
2095 struct ocfs2_path *left_path,
2096 struct ocfs2_path *right_path,
2097 int subtree_index)
2098{
2099 int ret, i;
2100 struct buffer_head *right_leaf_bh;
2101 struct buffer_head *left_leaf_bh = NULL;
2102 struct buffer_head *root_bh;
2103 struct ocfs2_extent_list *right_el, *left_el;
2104 struct ocfs2_extent_rec move_rec;
2105
2106 left_leaf_bh = path_leaf_bh(left_path);
2107 left_el = path_leaf_el(left_path);
2108
2109 if (left_el->l_next_free_rec != left_el->l_count) {
2110 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
2111 "Inode %llu has non-full interior leaf node %llu (next free = %u)\n",
2112 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2113 (unsigned long long)left_leaf_bh->b_blocknr,
2114 le16_to_cpu(left_el->l_next_free_rec));
2115 return -EROFS;
2116 }
2117
2118 /*
2119 * This extent block may already have an empty record, so we
2120 * return early if so.
2121 */
2122 if (ocfs2_is_empty_extent(&left_el->l_recs[0]))
2123 return 0;
2124
2125 root_bh = left_path->p_node[subtree_index].bh;
2126 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2127
2128 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2129 subtree_index);
2130 if (ret) {
2131 mlog_errno(ret);
2132 goto out;
2133 }
2134
2135 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2136 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2137 right_path, i);
2138 if (ret) {
2139 mlog_errno(ret);
2140 goto out;
2141 }
2142
2143 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2144 left_path, i);
2145 if (ret) {
2146 mlog_errno(ret);
2147 goto out;
2148 }
2149 }
2150
2151 right_leaf_bh = path_leaf_bh(right_path);
2152 right_el = path_leaf_el(right_path);
2153
2154 /* This is a code error, not a disk corruption. */
2155 mlog_bug_on_msg(!right_el->l_next_free_rec, "Inode %llu: Rotate fails "
2156 "because rightmost leaf block %llu is empty\n",
2157 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2158 (unsigned long long)right_leaf_bh->b_blocknr);
2159
2160 ocfs2_create_empty_extent(right_el);
2161
2162 ocfs2_journal_dirty(handle, right_leaf_bh);
2163
2164 /* Do the copy now. */
2165 i = le16_to_cpu(left_el->l_next_free_rec) - 1;
2166 move_rec = left_el->l_recs[i];
2167 right_el->l_recs[0] = move_rec;
2168
2169 /*
2170 * Clear out the record we just copied and shift everything
2171 * over, leaving an empty extent in the left leaf.
2172 *
2173 * We temporarily subtract from next_free_rec so that the
2174 * shift will lose the tail record (which is now defunct).
2175 */
2176 le16_add_cpu(&left_el->l_next_free_rec, -1);
2177 ocfs2_shift_records_right(left_el);
2178 memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2179 le16_add_cpu(&left_el->l_next_free_rec, 1);
2180
2181 ocfs2_journal_dirty(handle, left_leaf_bh);
2182
2183 ocfs2_complete_edge_insert(handle, left_path, right_path,
2184 subtree_index);
2185
2186out:
2187 return ret;
2188}
2189
2190/*
2191 * Given a full path, determine what cpos value would return us a path
2192 * containing the leaf immediately to the left of the current one.
2193 *
2194 * Will return zero if the path passed in is already the leftmost path.
2195 */
2196int ocfs2_find_cpos_for_left_leaf(struct super_block *sb,
2197 struct ocfs2_path *path, u32 *cpos)
2198{
2199 int i, j, ret = 0;
2200 u64 blkno;
2201 struct ocfs2_extent_list *el;
2202
2203 BUG_ON(path->p_tree_depth == 0);
2204
2205 *cpos = 0;
2206
2207 blkno = path_leaf_bh(path)->b_blocknr;
2208
2209 /* Start at the tree node just above the leaf and work our way up. */
2210 i = path->p_tree_depth - 1;
2211 while (i >= 0) {
2212 el = path->p_node[i].el;
2213
2214 /*
2215 * Find the extent record just before the one in our
2216 * path.
2217 */
2218 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2219 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2220 if (j == 0) {
2221 if (i == 0) {
2222 /*
2223 * We've determined that the
2224 * path specified is already
2225 * the leftmost one - return a
2226 * cpos of zero.
2227 */
2228 goto out;
2229 }
2230 /*
2231 * The leftmost record points to our
2232 * leaf - we need to travel up the
2233 * tree one level.
2234 */
2235 goto next_node;
2236 }
2237
2238 *cpos = le32_to_cpu(el->l_recs[j - 1].e_cpos);
2239 *cpos = *cpos + ocfs2_rec_clusters(el,
2240 &el->l_recs[j - 1]);
2241 *cpos = *cpos - 1;
2242 goto out;
2243 }
2244 }
2245
2246 /*
2247 * If we got here, we never found a valid node where
2248 * the tree indicated one should be.
2249 */
2250 ocfs2_error(sb, "Invalid extent tree at extent block %llu\n",
2251 (unsigned long long)blkno);
2252 ret = -EROFS;
2253 goto out;
2254
2255next_node:
2256 blkno = path->p_node[i].bh->b_blocknr;
2257 i--;
2258 }
2259
2260out:
2261 return ret;
2262}
2263
2264/*
2265 * Extend the transaction by enough credits to complete the rotation,
2266 * and still leave at least the original number of credits allocated
2267 * to this transaction.
2268 */
2269static int ocfs2_extend_rotate_transaction(handle_t *handle, int subtree_depth,
2270 int op_credits,
2271 struct ocfs2_path *path)
2272{
2273 int ret = 0;
2274 int credits = (path->p_tree_depth - subtree_depth) * 2 + 1 + op_credits;
2275
2276 if (handle->h_buffer_credits < credits)
2277 ret = ocfs2_extend_trans(handle,
2278 credits - handle->h_buffer_credits);
2279
2280 return ret;
2281}
2282
2283/*
2284 * Trap the case where we're inserting into the theoretical range past
2285 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2286 * whose cpos is less than ours into the right leaf.
2287 *
2288 * It's only necessary to look at the rightmost record of the left
2289 * leaf because the logic that calls us should ensure that the
2290 * theoretical ranges in the path components above the leaves are
2291 * correct.
2292 */
2293static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path,
2294 u32 insert_cpos)
2295{
2296 struct ocfs2_extent_list *left_el;
2297 struct ocfs2_extent_rec *rec;
2298 int next_free;
2299
2300 left_el = path_leaf_el(left_path);
2301 next_free = le16_to_cpu(left_el->l_next_free_rec);
2302 rec = &left_el->l_recs[next_free - 1];
2303
2304 if (insert_cpos > le32_to_cpu(rec->e_cpos))
2305 return 1;
2306 return 0;
2307}
2308
2309static int ocfs2_leftmost_rec_contains(struct ocfs2_extent_list *el, u32 cpos)
2310{
2311 int next_free = le16_to_cpu(el->l_next_free_rec);
2312 unsigned int range;
2313 struct ocfs2_extent_rec *rec;
2314
2315 if (next_free == 0)
2316 return 0;
2317
2318 rec = &el->l_recs[0];
2319 if (ocfs2_is_empty_extent(rec)) {
2320 /* Empty list. */
2321 if (next_free == 1)
2322 return 0;
2323 rec = &el->l_recs[1];
2324 }
2325
2326 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2327 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
2328 return 1;
2329 return 0;
2330}
2331
2332/*
2333 * Rotate all the records in a btree right one record, starting at insert_cpos.
2334 *
2335 * The path to the rightmost leaf should be passed in.
2336 *
2337 * The array is assumed to be large enough to hold an entire path (tree depth).
2338 *
2339 * Upon successful return from this function:
2340 *
2341 * - The 'right_path' array will contain a path to the leaf block
2342 * whose range contains e_cpos.
2343 * - That leaf block will have a single empty extent in list index 0.
2344 * - In the case that the rotation requires a post-insert update,
2345 * *ret_left_path will contain a valid path which can be passed to
2346 * ocfs2_insert_path().
2347 */
2348static int ocfs2_rotate_tree_right(handle_t *handle,
2349 struct ocfs2_extent_tree *et,
2350 enum ocfs2_split_type split,
2351 u32 insert_cpos,
2352 struct ocfs2_path *right_path,
2353 struct ocfs2_path **ret_left_path)
2354{
2355 int ret, start, orig_credits = handle->h_buffer_credits;
2356 u32 cpos;
2357 struct ocfs2_path *left_path = NULL;
2358 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2359
2360 *ret_left_path = NULL;
2361
2362 left_path = ocfs2_new_path_from_path(right_path);
2363 if (!left_path) {
2364 ret = -ENOMEM;
2365 mlog_errno(ret);
2366 goto out;
2367 }
2368
2369 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2370 if (ret) {
2371 mlog_errno(ret);
2372 goto out;
2373 }
2374
2375 trace_ocfs2_rotate_tree_right(
2376 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2377 insert_cpos, cpos);
2378
2379 /*
2380 * What we want to do here is:
2381 *
2382 * 1) Start with the rightmost path.
2383 *
2384 * 2) Determine a path to the leaf block directly to the left
2385 * of that leaf.
2386 *
2387 * 3) Determine the 'subtree root' - the lowest level tree node
2388 * which contains a path to both leaves.
2389 *
2390 * 4) Rotate the subtree.
2391 *
2392 * 5) Find the next subtree by considering the left path to be
2393 * the new right path.
2394 *
2395 * The check at the top of this while loop also accepts
2396 * insert_cpos == cpos because cpos is only a _theoretical_
2397 * value to get us the left path - insert_cpos might very well
2398 * be filling that hole.
2399 *
2400 * Stop at a cpos of '0' because we either started at the
2401 * leftmost branch (i.e., a tree with one branch and a
2402 * rotation inside of it), or we've gone as far as we can in
2403 * rotating subtrees.
2404 */
2405 while (cpos && insert_cpos <= cpos) {
2406 trace_ocfs2_rotate_tree_right(
2407 (unsigned long long)
2408 ocfs2_metadata_cache_owner(et->et_ci),
2409 insert_cpos, cpos);
2410
2411 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
2412 if (ret) {
2413 mlog_errno(ret);
2414 goto out;
2415 }
2416
2417 mlog_bug_on_msg(path_leaf_bh(left_path) ==
2418 path_leaf_bh(right_path),
2419 "Owner %llu: error during insert of %u "
2420 "(left path cpos %u) results in two identical "
2421 "paths ending at %llu\n",
2422 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2423 insert_cpos, cpos,
2424 (unsigned long long)
2425 path_leaf_bh(left_path)->b_blocknr);
2426
2427 if (split == SPLIT_NONE &&
2428 ocfs2_rotate_requires_path_adjustment(left_path,
2429 insert_cpos)) {
2430
2431 /*
2432 * We've rotated the tree as much as we
2433 * should. The rest is up to
2434 * ocfs2_insert_path() to complete, after the
2435 * record insertion. We indicate this
2436 * situation by returning the left path.
2437 *
2438 * The reason we don't adjust the records here
2439 * before the record insert is that an error
2440 * later might break the rule where a parent
2441 * record e_cpos will reflect the actual
2442 * e_cpos of the 1st nonempty record of the
2443 * child list.
2444 */
2445 *ret_left_path = left_path;
2446 goto out_ret_path;
2447 }
2448
2449 start = ocfs2_find_subtree_root(et, left_path, right_path);
2450
2451 trace_ocfs2_rotate_subtree(start,
2452 (unsigned long long)
2453 right_path->p_node[start].bh->b_blocknr,
2454 right_path->p_tree_depth);
2455
2456 ret = ocfs2_extend_rotate_transaction(handle, start,
2457 orig_credits, right_path);
2458 if (ret) {
2459 mlog_errno(ret);
2460 goto out;
2461 }
2462
2463 ret = ocfs2_rotate_subtree_right(handle, et, left_path,
2464 right_path, start);
2465 if (ret) {
2466 mlog_errno(ret);
2467 goto out;
2468 }
2469
2470 if (split != SPLIT_NONE &&
2471 ocfs2_leftmost_rec_contains(path_leaf_el(right_path),
2472 insert_cpos)) {
2473 /*
2474 * A rotate moves the rightmost left leaf
2475 * record over to the leftmost right leaf
2476 * slot. If we're doing an extent split
2477 * instead of a real insert, then we have to
2478 * check that the extent to be split wasn't
2479 * just moved over. If it was, then we can
2480 * exit here, passing left_path back -
2481 * ocfs2_split_extent() is smart enough to
2482 * search both leaves.
2483 */
2484 *ret_left_path = left_path;
2485 goto out_ret_path;
2486 }
2487
2488 /*
2489 * There is no need to re-read the next right path
2490 * as we know that it'll be our current left
2491 * path. Optimize by copying values instead.
2492 */
2493 ocfs2_mv_path(right_path, left_path);
2494
2495 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2496 if (ret) {
2497 mlog_errno(ret);
2498 goto out;
2499 }
2500 }
2501
2502out:
2503 ocfs2_free_path(left_path);
2504
2505out_ret_path:
2506 return ret;
2507}
2508
2509static int ocfs2_update_edge_lengths(handle_t *handle,
2510 struct ocfs2_extent_tree *et,
2511 int subtree_index, struct ocfs2_path *path)
2512{
2513 int i, idx, ret;
2514 struct ocfs2_extent_rec *rec;
2515 struct ocfs2_extent_list *el;
2516 struct ocfs2_extent_block *eb;
2517 u32 range;
2518
2519 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
2520 if (ret) {
2521 mlog_errno(ret);
2522 goto out;
2523 }
2524
2525 /* Path should always be rightmost. */
2526 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
2527 BUG_ON(eb->h_next_leaf_blk != 0ULL);
2528
2529 el = &eb->h_list;
2530 BUG_ON(le16_to_cpu(el->l_next_free_rec) == 0);
2531 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2532 rec = &el->l_recs[idx];
2533 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2534
2535 for (i = 0; i < path->p_tree_depth; i++) {
2536 el = path->p_node[i].el;
2537 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2538 rec = &el->l_recs[idx];
2539
2540 rec->e_int_clusters = cpu_to_le32(range);
2541 le32_add_cpu(&rec->e_int_clusters, -le32_to_cpu(rec->e_cpos));
2542
2543 ocfs2_journal_dirty(handle, path->p_node[i].bh);
2544 }
2545out:
2546 return ret;
2547}
2548
2549static void ocfs2_unlink_path(handle_t *handle,
2550 struct ocfs2_extent_tree *et,
2551 struct ocfs2_cached_dealloc_ctxt *dealloc,
2552 struct ocfs2_path *path, int unlink_start)
2553{
2554 int ret, i;
2555 struct ocfs2_extent_block *eb;
2556 struct ocfs2_extent_list *el;
2557 struct buffer_head *bh;
2558
2559 for(i = unlink_start; i < path_num_items(path); i++) {
2560 bh = path->p_node[i].bh;
2561
2562 eb = (struct ocfs2_extent_block *)bh->b_data;
2563 /*
2564 * Not all nodes might have had their final count
2565 * decremented by the caller - handle this here.
2566 */
2567 el = &eb->h_list;
2568 if (le16_to_cpu(el->l_next_free_rec) > 1) {
2569 mlog(ML_ERROR,
2570 "Inode %llu, attempted to remove extent block "
2571 "%llu with %u records\n",
2572 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2573 (unsigned long long)le64_to_cpu(eb->h_blkno),
2574 le16_to_cpu(el->l_next_free_rec));
2575
2576 ocfs2_journal_dirty(handle, bh);
2577 ocfs2_remove_from_cache(et->et_ci, bh);
2578 continue;
2579 }
2580
2581 el->l_next_free_rec = 0;
2582 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2583
2584 ocfs2_journal_dirty(handle, bh);
2585
2586 ret = ocfs2_cache_extent_block_free(dealloc, eb);
2587 if (ret)
2588 mlog_errno(ret);
2589
2590 ocfs2_remove_from_cache(et->et_ci, bh);
2591 }
2592}
2593
2594static void ocfs2_unlink_subtree(handle_t *handle,
2595 struct ocfs2_extent_tree *et,
2596 struct ocfs2_path *left_path,
2597 struct ocfs2_path *right_path,
2598 int subtree_index,
2599 struct ocfs2_cached_dealloc_ctxt *dealloc)
2600{
2601 int i;
2602 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2603 struct ocfs2_extent_list *root_el = left_path->p_node[subtree_index].el;
2604 struct ocfs2_extent_list *el;
2605 struct ocfs2_extent_block *eb;
2606
2607 el = path_leaf_el(left_path);
2608
2609 eb = (struct ocfs2_extent_block *)right_path->p_node[subtree_index + 1].bh->b_data;
2610
2611 for(i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
2612 if (root_el->l_recs[i].e_blkno == eb->h_blkno)
2613 break;
2614
2615 BUG_ON(i >= le16_to_cpu(root_el->l_next_free_rec));
2616
2617 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
2618 le16_add_cpu(&root_el->l_next_free_rec, -1);
2619
2620 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2621 eb->h_next_leaf_blk = 0;
2622
2623 ocfs2_journal_dirty(handle, root_bh);
2624 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2625
2626 ocfs2_unlink_path(handle, et, dealloc, right_path,
2627 subtree_index + 1);
2628}
2629
2630static int ocfs2_rotate_subtree_left(handle_t *handle,
2631 struct ocfs2_extent_tree *et,
2632 struct ocfs2_path *left_path,
2633 struct ocfs2_path *right_path,
2634 int subtree_index,
2635 struct ocfs2_cached_dealloc_ctxt *dealloc,
2636 int *deleted)
2637{
2638 int ret, i, del_right_subtree = 0, right_has_empty = 0;
2639 struct buffer_head *root_bh, *et_root_bh = path_root_bh(right_path);
2640 struct ocfs2_extent_list *right_leaf_el, *left_leaf_el;
2641 struct ocfs2_extent_block *eb;
2642
2643 *deleted = 0;
2644
2645 right_leaf_el = path_leaf_el(right_path);
2646 left_leaf_el = path_leaf_el(left_path);
2647 root_bh = left_path->p_node[subtree_index].bh;
2648 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2649
2650 if (!ocfs2_is_empty_extent(&left_leaf_el->l_recs[0]))
2651 return 0;
2652
2653 eb = (struct ocfs2_extent_block *)path_leaf_bh(right_path)->b_data;
2654 if (ocfs2_is_empty_extent(&right_leaf_el->l_recs[0])) {
2655 /*
2656 * It's legal for us to proceed if the right leaf is
2657 * the rightmost one and it has an empty extent. There
2658 * are two cases to handle - whether the leaf will be
2659 * empty after removal or not. If the leaf isn't empty
2660 * then just remove the empty extent up front. The
2661 * next block will handle empty leaves by flagging
2662 * them for unlink.
2663 *
2664 * Non rightmost leaves will throw -EAGAIN and the
2665 * caller can manually move the subtree and retry.
2666 */
2667
2668 if (eb->h_next_leaf_blk != 0ULL)
2669 return -EAGAIN;
2670
2671 if (le16_to_cpu(right_leaf_el->l_next_free_rec) > 1) {
2672 ret = ocfs2_journal_access_eb(handle, et->et_ci,
2673 path_leaf_bh(right_path),
2674 OCFS2_JOURNAL_ACCESS_WRITE);
2675 if (ret) {
2676 mlog_errno(ret);
2677 goto out;
2678 }
2679
2680 ocfs2_remove_empty_extent(right_leaf_el);
2681 } else
2682 right_has_empty = 1;
2683 }
2684
2685 if (eb->h_next_leaf_blk == 0ULL &&
2686 le16_to_cpu(right_leaf_el->l_next_free_rec) == 1) {
2687 /*
2688 * We have to update i_last_eb_blk during the meta
2689 * data delete.
2690 */
2691 ret = ocfs2_et_root_journal_access(handle, et,
2692 OCFS2_JOURNAL_ACCESS_WRITE);
2693 if (ret) {
2694 mlog_errno(ret);
2695 goto out;
2696 }
2697
2698 del_right_subtree = 1;
2699 }
2700
2701 /*
2702 * Getting here with an empty extent in the right path implies
2703 * that it's the rightmost path and will be deleted.
2704 */
2705 BUG_ON(right_has_empty && !del_right_subtree);
2706
2707 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2708 subtree_index);
2709 if (ret) {
2710 mlog_errno(ret);
2711 goto out;
2712 }
2713
2714 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2715 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2716 right_path, i);
2717 if (ret) {
2718 mlog_errno(ret);
2719 goto out;
2720 }
2721
2722 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2723 left_path, i);
2724 if (ret) {
2725 mlog_errno(ret);
2726 goto out;
2727 }
2728 }
2729
2730 if (!right_has_empty) {
2731 /*
2732 * Only do this if we're moving a real
2733 * record. Otherwise, the action is delayed until
2734 * after removal of the right path in which case we
2735 * can do a simple shift to remove the empty extent.
2736 */
2737 ocfs2_rotate_leaf(left_leaf_el, &right_leaf_el->l_recs[0]);
2738 memset(&right_leaf_el->l_recs[0], 0,
2739 sizeof(struct ocfs2_extent_rec));
2740 }
2741 if (eb->h_next_leaf_blk == 0ULL) {
2742 /*
2743 * Move recs over to get rid of empty extent, decrease
2744 * next_free. This is allowed to remove the last
2745 * extent in our leaf (setting l_next_free_rec to
2746 * zero) - the delete code below won't care.
2747 */
2748 ocfs2_remove_empty_extent(right_leaf_el);
2749 }
2750
2751 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2752 ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
2753
2754 if (del_right_subtree) {
2755 ocfs2_unlink_subtree(handle, et, left_path, right_path,
2756 subtree_index, dealloc);
2757 ret = ocfs2_update_edge_lengths(handle, et, subtree_index,
2758 left_path);
2759 if (ret) {
2760 mlog_errno(ret);
2761 goto out;
2762 }
2763
2764 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2765 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
2766
2767 /*
2768 * Removal of the extent in the left leaf was skipped
2769 * above so we could delete the right path
2770 * 1st.
2771 */
2772 if (right_has_empty)
2773 ocfs2_remove_empty_extent(left_leaf_el);
2774
2775 ocfs2_journal_dirty(handle, et_root_bh);
2776
2777 *deleted = 1;
2778 } else
2779 ocfs2_complete_edge_insert(handle, left_path, right_path,
2780 subtree_index);
2781
2782out:
2783 return ret;
2784}
2785
2786/*
2787 * Given a full path, determine what cpos value would return us a path
2788 * containing the leaf immediately to the right of the current one.
2789 *
2790 * Will return zero if the path passed in is already the rightmost path.
2791 *
2792 * This looks similar, but is subtly different to
2793 * ocfs2_find_cpos_for_left_leaf().
2794 */
2795int ocfs2_find_cpos_for_right_leaf(struct super_block *sb,
2796 struct ocfs2_path *path, u32 *cpos)
2797{
2798 int i, j, ret = 0;
2799 u64 blkno;
2800 struct ocfs2_extent_list *el;
2801
2802 *cpos = 0;
2803
2804 if (path->p_tree_depth == 0)
2805 return 0;
2806
2807 blkno = path_leaf_bh(path)->b_blocknr;
2808
2809 /* Start at the tree node just above the leaf and work our way up. */
2810 i = path->p_tree_depth - 1;
2811 while (i >= 0) {
2812 int next_free;
2813
2814 el = path->p_node[i].el;
2815
2816 /*
2817 * Find the extent record just after the one in our
2818 * path.
2819 */
2820 next_free = le16_to_cpu(el->l_next_free_rec);
2821 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2822 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2823 if (j == (next_free - 1)) {
2824 if (i == 0) {
2825 /*
2826 * We've determined that the
2827 * path specified is already
2828 * the rightmost one - return a
2829 * cpos of zero.
2830 */
2831 goto out;
2832 }
2833 /*
2834 * The rightmost record points to our
2835 * leaf - we need to travel up the
2836 * tree one level.
2837 */
2838 goto next_node;
2839 }
2840
2841 *cpos = le32_to_cpu(el->l_recs[j + 1].e_cpos);
2842 goto out;
2843 }
2844 }
2845
2846 /*
2847 * If we got here, we never found a valid node where
2848 * the tree indicated one should be.
2849 */
2850 ocfs2_error(sb, "Invalid extent tree at extent block %llu\n",
2851 (unsigned long long)blkno);
2852 ret = -EROFS;
2853 goto out;
2854
2855next_node:
2856 blkno = path->p_node[i].bh->b_blocknr;
2857 i--;
2858 }
2859
2860out:
2861 return ret;
2862}
2863
2864static int ocfs2_rotate_rightmost_leaf_left(handle_t *handle,
2865 struct ocfs2_extent_tree *et,
2866 struct ocfs2_path *path)
2867{
2868 int ret;
2869 struct buffer_head *bh = path_leaf_bh(path);
2870 struct ocfs2_extent_list *el = path_leaf_el(path);
2871
2872 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
2873 return 0;
2874
2875 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path,
2876 path_num_items(path) - 1);
2877 if (ret) {
2878 mlog_errno(ret);
2879 goto out;
2880 }
2881
2882 ocfs2_remove_empty_extent(el);
2883 ocfs2_journal_dirty(handle, bh);
2884
2885out:
2886 return ret;
2887}
2888
2889static int __ocfs2_rotate_tree_left(handle_t *handle,
2890 struct ocfs2_extent_tree *et,
2891 int orig_credits,
2892 struct ocfs2_path *path,
2893 struct ocfs2_cached_dealloc_ctxt *dealloc,
2894 struct ocfs2_path **empty_extent_path)
2895{
2896 int ret, subtree_root, deleted;
2897 u32 right_cpos;
2898 struct ocfs2_path *left_path = NULL;
2899 struct ocfs2_path *right_path = NULL;
2900 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2901
2902 if (!ocfs2_is_empty_extent(&(path_leaf_el(path)->l_recs[0])))
2903 return 0;
2904
2905 *empty_extent_path = NULL;
2906
2907 ret = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos);
2908 if (ret) {
2909 mlog_errno(ret);
2910 goto out;
2911 }
2912
2913 left_path = ocfs2_new_path_from_path(path);
2914 if (!left_path) {
2915 ret = -ENOMEM;
2916 mlog_errno(ret);
2917 goto out;
2918 }
2919
2920 ocfs2_cp_path(left_path, path);
2921
2922 right_path = ocfs2_new_path_from_path(path);
2923 if (!right_path) {
2924 ret = -ENOMEM;
2925 mlog_errno(ret);
2926 goto out;
2927 }
2928
2929 while (right_cpos) {
2930 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
2931 if (ret) {
2932 mlog_errno(ret);
2933 goto out;
2934 }
2935
2936 subtree_root = ocfs2_find_subtree_root(et, left_path,
2937 right_path);
2938
2939 trace_ocfs2_rotate_subtree(subtree_root,
2940 (unsigned long long)
2941 right_path->p_node[subtree_root].bh->b_blocknr,
2942 right_path->p_tree_depth);
2943
2944 ret = ocfs2_extend_rotate_transaction(handle, 0,
2945 orig_credits, left_path);
2946 if (ret) {
2947 mlog_errno(ret);
2948 goto out;
2949 }
2950
2951 /*
2952 * Caller might still want to make changes to the
2953 * tree root, so re-add it to the journal here.
2954 */
2955 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2956 left_path, 0);
2957 if (ret) {
2958 mlog_errno(ret);
2959 goto out;
2960 }
2961
2962 ret = ocfs2_rotate_subtree_left(handle, et, left_path,
2963 right_path, subtree_root,
2964 dealloc, &deleted);
2965 if (ret == -EAGAIN) {
2966 /*
2967 * The rotation has to temporarily stop due to
2968 * the right subtree having an empty
2969 * extent. Pass it back to the caller for a
2970 * fixup.
2971 */
2972 *empty_extent_path = right_path;
2973 right_path = NULL;
2974 goto out;
2975 }
2976 if (ret) {
2977 mlog_errno(ret);
2978 goto out;
2979 }
2980
2981 /*
2982 * The subtree rotate might have removed records on
2983 * the rightmost edge. If so, then rotation is
2984 * complete.
2985 */
2986 if (deleted)
2987 break;
2988
2989 ocfs2_mv_path(left_path, right_path);
2990
2991 ret = ocfs2_find_cpos_for_right_leaf(sb, left_path,
2992 &right_cpos);
2993 if (ret) {
2994 mlog_errno(ret);
2995 goto out;
2996 }
2997 }
2998
2999out:
3000 ocfs2_free_path(right_path);
3001 ocfs2_free_path(left_path);
3002
3003 return ret;
3004}
3005
3006static int ocfs2_remove_rightmost_path(handle_t *handle,
3007 struct ocfs2_extent_tree *et,
3008 struct ocfs2_path *path,
3009 struct ocfs2_cached_dealloc_ctxt *dealloc)
3010{
3011 int ret, subtree_index;
3012 u32 cpos;
3013 struct ocfs2_path *left_path = NULL;
3014 struct ocfs2_extent_block *eb;
3015 struct ocfs2_extent_list *el;
3016
3017 ret = ocfs2_et_sanity_check(et);
3018 if (ret)
3019 goto out;
3020
3021 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
3022 if (ret) {
3023 mlog_errno(ret);
3024 goto out;
3025 }
3026
3027 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3028 path, &cpos);
3029 if (ret) {
3030 mlog_errno(ret);
3031 goto out;
3032 }
3033
3034 if (cpos) {
3035 /*
3036 * We have a path to the left of this one - it needs
3037 * an update too.
3038 */
3039 left_path = ocfs2_new_path_from_path(path);
3040 if (!left_path) {
3041 ret = -ENOMEM;
3042 mlog_errno(ret);
3043 goto out;
3044 }
3045
3046 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
3047 if (ret) {
3048 mlog_errno(ret);
3049 goto out;
3050 }
3051
3052 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
3053 if (ret) {
3054 mlog_errno(ret);
3055 goto out;
3056 }
3057
3058 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
3059
3060 ocfs2_unlink_subtree(handle, et, left_path, path,
3061 subtree_index, dealloc);
3062 ret = ocfs2_update_edge_lengths(handle, et, subtree_index,
3063 left_path);
3064 if (ret) {
3065 mlog_errno(ret);
3066 goto out;
3067 }
3068
3069 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
3070 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
3071 } else {
3072 /*
3073 * 'path' is also the leftmost path which
3074 * means it must be the only one. This gets
3075 * handled differently because we want to
3076 * revert the root back to having extents
3077 * in-line.
3078 */
3079 ocfs2_unlink_path(handle, et, dealloc, path, 1);
3080
3081 el = et->et_root_el;
3082 el->l_tree_depth = 0;
3083 el->l_next_free_rec = 0;
3084 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3085
3086 ocfs2_et_set_last_eb_blk(et, 0);
3087 }
3088
3089 ocfs2_journal_dirty(handle, path_root_bh(path));
3090
3091out:
3092 ocfs2_free_path(left_path);
3093 return ret;
3094}
3095
3096static int ocfs2_remove_rightmost_empty_extent(struct ocfs2_super *osb,
3097 struct ocfs2_extent_tree *et,
3098 struct ocfs2_path *path,
3099 struct ocfs2_cached_dealloc_ctxt *dealloc)
3100{
3101 handle_t *handle;
3102 int ret;
3103 int credits = path->p_tree_depth * 2 + 1;
3104
3105 handle = ocfs2_start_trans(osb, credits);
3106 if (IS_ERR(handle)) {
3107 ret = PTR_ERR(handle);
3108 mlog_errno(ret);
3109 return ret;
3110 }
3111
3112 ret = ocfs2_remove_rightmost_path(handle, et, path, dealloc);
3113 if (ret)
3114 mlog_errno(ret);
3115
3116 ocfs2_commit_trans(osb, handle);
3117 return ret;
3118}
3119
3120/*
3121 * Left rotation of btree records.
3122 *
3123 * In many ways, this is (unsurprisingly) the opposite of right
3124 * rotation. We start at some non-rightmost path containing an empty
3125 * extent in the leaf block. The code works its way to the rightmost
3126 * path by rotating records to the left in every subtree.
3127 *
3128 * This is used by any code which reduces the number of extent records
3129 * in a leaf. After removal, an empty record should be placed in the
3130 * leftmost list position.
3131 *
3132 * This won't handle a length update of the rightmost path records if
3133 * the rightmost tree leaf record is removed so the caller is
3134 * responsible for detecting and correcting that.
3135 */
3136static int ocfs2_rotate_tree_left(handle_t *handle,
3137 struct ocfs2_extent_tree *et,
3138 struct ocfs2_path *path,
3139 struct ocfs2_cached_dealloc_ctxt *dealloc)
3140{
3141 int ret, orig_credits = handle->h_buffer_credits;
3142 struct ocfs2_path *tmp_path = NULL, *restart_path = NULL;
3143 struct ocfs2_extent_block *eb;
3144 struct ocfs2_extent_list *el;
3145
3146 el = path_leaf_el(path);
3147 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
3148 return 0;
3149
3150 if (path->p_tree_depth == 0) {
3151rightmost_no_delete:
3152 /*
3153 * Inline extents. This is trivially handled, so do
3154 * it up front.
3155 */
3156 ret = ocfs2_rotate_rightmost_leaf_left(handle, et, path);
3157 if (ret)
3158 mlog_errno(ret);
3159 goto out;
3160 }
3161
3162 /*
3163 * Handle rightmost branch now. There's several cases:
3164 * 1) simple rotation leaving records in there. That's trivial.
3165 * 2) rotation requiring a branch delete - there's no more
3166 * records left. Two cases of this:
3167 * a) There are branches to the left.
3168 * b) This is also the leftmost (the only) branch.
3169 *
3170 * 1) is handled via ocfs2_rotate_rightmost_leaf_left()
3171 * 2a) we need the left branch so that we can update it with the unlink
3172 * 2b) we need to bring the root back to inline extents.
3173 */
3174
3175 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
3176 el = &eb->h_list;
3177 if (eb->h_next_leaf_blk == 0) {
3178 /*
3179 * This gets a bit tricky if we're going to delete the
3180 * rightmost path. Get the other cases out of the way
3181 * 1st.
3182 */
3183 if (le16_to_cpu(el->l_next_free_rec) > 1)
3184 goto rightmost_no_delete;
3185
3186 if (le16_to_cpu(el->l_next_free_rec) == 0) {
3187 ret = -EIO;
3188 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
3189 "Owner %llu has empty extent block at %llu\n",
3190 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
3191 (unsigned long long)le64_to_cpu(eb->h_blkno));
3192 goto out;
3193 }
3194
3195 /*
3196 * XXX: The caller can not trust "path" any more after
3197 * this as it will have been deleted. What do we do?
3198 *
3199 * In theory the rotate-for-merge code will never get
3200 * here because it'll always ask for a rotate in a
3201 * nonempty list.
3202 */
3203
3204 ret = ocfs2_remove_rightmost_path(handle, et, path,
3205 dealloc);
3206 if (ret)
3207 mlog_errno(ret);
3208 goto out;
3209 }
3210
3211 /*
3212 * Now we can loop, remembering the path we get from -EAGAIN
3213 * and restarting from there.
3214 */
3215try_rotate:
3216 ret = __ocfs2_rotate_tree_left(handle, et, orig_credits, path,
3217 dealloc, &restart_path);
3218 if (ret && ret != -EAGAIN) {
3219 mlog_errno(ret);
3220 goto out;
3221 }
3222
3223 while (ret == -EAGAIN) {
3224 tmp_path = restart_path;
3225 restart_path = NULL;
3226
3227 ret = __ocfs2_rotate_tree_left(handle, et, orig_credits,
3228 tmp_path, dealloc,
3229 &restart_path);
3230 if (ret && ret != -EAGAIN) {
3231 mlog_errno(ret);
3232 goto out;
3233 }
3234
3235 ocfs2_free_path(tmp_path);
3236 tmp_path = NULL;
3237
3238 if (ret == 0)
3239 goto try_rotate;
3240 }
3241
3242out:
3243 ocfs2_free_path(tmp_path);
3244 ocfs2_free_path(restart_path);
3245 return ret;
3246}
3247
3248static void ocfs2_cleanup_merge(struct ocfs2_extent_list *el,
3249 int index)
3250{
3251 struct ocfs2_extent_rec *rec = &el->l_recs[index];
3252 unsigned int size;
3253
3254 if (rec->e_leaf_clusters == 0) {
3255 /*
3256 * We consumed all of the merged-from record. An empty
3257 * extent cannot exist anywhere but the 1st array
3258 * position, so move things over if the merged-from
3259 * record doesn't occupy that position.
3260 *
3261 * This creates a new empty extent so the caller
3262 * should be smart enough to have removed any existing
3263 * ones.
3264 */
3265 if (index > 0) {
3266 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
3267 size = index * sizeof(struct ocfs2_extent_rec);
3268 memmove(&el->l_recs[1], &el->l_recs[0], size);
3269 }
3270
3271 /*
3272 * Always memset - the caller doesn't check whether it
3273 * created an empty extent, so there could be junk in
3274 * the other fields.
3275 */
3276 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3277 }
3278}
3279
3280static int ocfs2_get_right_path(struct ocfs2_extent_tree *et,
3281 struct ocfs2_path *left_path,
3282 struct ocfs2_path **ret_right_path)
3283{
3284 int ret;
3285 u32 right_cpos;
3286 struct ocfs2_path *right_path = NULL;
3287 struct ocfs2_extent_list *left_el;
3288
3289 *ret_right_path = NULL;
3290
3291 /* This function shouldn't be called for non-trees. */
3292 BUG_ON(left_path->p_tree_depth == 0);
3293
3294 left_el = path_leaf_el(left_path);
3295 BUG_ON(left_el->l_next_free_rec != left_el->l_count);
3296
3297 ret = ocfs2_find_cpos_for_right_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3298 left_path, &right_cpos);
3299 if (ret) {
3300 mlog_errno(ret);
3301 goto out;
3302 }
3303
3304 /* This function shouldn't be called for the rightmost leaf. */
3305 BUG_ON(right_cpos == 0);
3306
3307 right_path = ocfs2_new_path_from_path(left_path);
3308 if (!right_path) {
3309 ret = -ENOMEM;
3310 mlog_errno(ret);
3311 goto out;
3312 }
3313
3314 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
3315 if (ret) {
3316 mlog_errno(ret);
3317 goto out;
3318 }
3319
3320 *ret_right_path = right_path;
3321out:
3322 if (ret)
3323 ocfs2_free_path(right_path);
3324 return ret;
3325}
3326
3327/*
3328 * Remove split_rec clusters from the record at index and merge them
3329 * onto the beginning of the record "next" to it.
3330 * For index < l_count - 1, the next means the extent rec at index + 1.
3331 * For index == l_count - 1, the "next" means the 1st extent rec of the
3332 * next extent block.
3333 */
3334static int ocfs2_merge_rec_right(struct ocfs2_path *left_path,
3335 handle_t *handle,
3336 struct ocfs2_extent_tree *et,
3337 struct ocfs2_extent_rec *split_rec,
3338 int index)
3339{
3340 int ret, next_free, i;
3341 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3342 struct ocfs2_extent_rec *left_rec;
3343 struct ocfs2_extent_rec *right_rec;
3344 struct ocfs2_extent_list *right_el;
3345 struct ocfs2_path *right_path = NULL;
3346 int subtree_index = 0;
3347 struct ocfs2_extent_list *el = path_leaf_el(left_path);
3348 struct buffer_head *bh = path_leaf_bh(left_path);
3349 struct buffer_head *root_bh = NULL;
3350
3351 BUG_ON(index >= le16_to_cpu(el->l_next_free_rec));
3352 left_rec = &el->l_recs[index];
3353
3354 if (index == le16_to_cpu(el->l_next_free_rec) - 1 &&
3355 le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count)) {
3356 /* we meet with a cross extent block merge. */
3357 ret = ocfs2_get_right_path(et, left_path, &right_path);
3358 if (ret) {
3359 mlog_errno(ret);
3360 return ret;
3361 }
3362
3363 right_el = path_leaf_el(right_path);
3364 next_free = le16_to_cpu(right_el->l_next_free_rec);
3365 BUG_ON(next_free <= 0);
3366 right_rec = &right_el->l_recs[0];
3367 if (ocfs2_is_empty_extent(right_rec)) {
3368 BUG_ON(next_free <= 1);
3369 right_rec = &right_el->l_recs[1];
3370 }
3371
3372 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3373 le16_to_cpu(left_rec->e_leaf_clusters) !=
3374 le32_to_cpu(right_rec->e_cpos));
3375
3376 subtree_index = ocfs2_find_subtree_root(et, left_path,
3377 right_path);
3378
3379 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3380 handle->h_buffer_credits,
3381 right_path);
3382 if (ret) {
3383 mlog_errno(ret);
3384 goto out;
3385 }
3386
3387 root_bh = left_path->p_node[subtree_index].bh;
3388 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3389
3390 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3391 subtree_index);
3392 if (ret) {
3393 mlog_errno(ret);
3394 goto out;
3395 }
3396
3397 for (i = subtree_index + 1;
3398 i < path_num_items(right_path); i++) {
3399 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3400 right_path, i);
3401 if (ret) {
3402 mlog_errno(ret);
3403 goto out;
3404 }
3405
3406 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3407 left_path, i);
3408 if (ret) {
3409 mlog_errno(ret);
3410 goto out;
3411 }
3412 }
3413
3414 } else {
3415 BUG_ON(index == le16_to_cpu(el->l_next_free_rec) - 1);
3416 right_rec = &el->l_recs[index + 1];
3417 }
3418
3419 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, left_path,
3420 path_num_items(left_path) - 1);
3421 if (ret) {
3422 mlog_errno(ret);
3423 goto out;
3424 }
3425
3426 le16_add_cpu(&left_rec->e_leaf_clusters, -split_clusters);
3427
3428 le32_add_cpu(&right_rec->e_cpos, -split_clusters);
3429 le64_add_cpu(&right_rec->e_blkno,
3430 -ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3431 split_clusters));
3432 le16_add_cpu(&right_rec->e_leaf_clusters, split_clusters);
3433
3434 ocfs2_cleanup_merge(el, index);
3435
3436 ocfs2_journal_dirty(handle, bh);
3437 if (right_path) {
3438 ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
3439 ocfs2_complete_edge_insert(handle, left_path, right_path,
3440 subtree_index);
3441 }
3442out:
3443 ocfs2_free_path(right_path);
3444 return ret;
3445}
3446
3447static int ocfs2_get_left_path(struct ocfs2_extent_tree *et,
3448 struct ocfs2_path *right_path,
3449 struct ocfs2_path **ret_left_path)
3450{
3451 int ret;
3452 u32 left_cpos;
3453 struct ocfs2_path *left_path = NULL;
3454
3455 *ret_left_path = NULL;
3456
3457 /* This function shouldn't be called for non-trees. */
3458 BUG_ON(right_path->p_tree_depth == 0);
3459
3460 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3461 right_path, &left_cpos);
3462 if (ret) {
3463 mlog_errno(ret);
3464 goto out;
3465 }
3466
3467 /* This function shouldn't be called for the leftmost leaf. */
3468 BUG_ON(left_cpos == 0);
3469
3470 left_path = ocfs2_new_path_from_path(right_path);
3471 if (!left_path) {
3472 ret = -ENOMEM;
3473 mlog_errno(ret);
3474 goto out;
3475 }
3476
3477 ret = ocfs2_find_path(et->et_ci, left_path, left_cpos);
3478 if (ret) {
3479 mlog_errno(ret);
3480 goto out;
3481 }
3482
3483 *ret_left_path = left_path;
3484out:
3485 if (ret)
3486 ocfs2_free_path(left_path);
3487 return ret;
3488}
3489
3490/*
3491 * Remove split_rec clusters from the record at index and merge them
3492 * onto the tail of the record "before" it.
3493 * For index > 0, the "before" means the extent rec at index - 1.
3494 *
3495 * For index == 0, the "before" means the last record of the previous
3496 * extent block. And there is also a situation that we may need to
3497 * remove the rightmost leaf extent block in the right_path and change
3498 * the right path to indicate the new rightmost path.
3499 */
3500static int ocfs2_merge_rec_left(struct ocfs2_path *right_path,
3501 handle_t *handle,
3502 struct ocfs2_extent_tree *et,
3503 struct ocfs2_extent_rec *split_rec,
3504 struct ocfs2_cached_dealloc_ctxt *dealloc,
3505 int index)
3506{
3507 int ret, i, subtree_index = 0, has_empty_extent = 0;
3508 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3509 struct ocfs2_extent_rec *left_rec;
3510 struct ocfs2_extent_rec *right_rec;
3511 struct ocfs2_extent_list *el = path_leaf_el(right_path);
3512 struct buffer_head *bh = path_leaf_bh(right_path);
3513 struct buffer_head *root_bh = NULL;
3514 struct ocfs2_path *left_path = NULL;
3515 struct ocfs2_extent_list *left_el;
3516
3517 BUG_ON(index < 0);
3518
3519 right_rec = &el->l_recs[index];
3520 if (index == 0) {
3521 /* we meet with a cross extent block merge. */
3522 ret = ocfs2_get_left_path(et, right_path, &left_path);
3523 if (ret) {
3524 mlog_errno(ret);
3525 return ret;
3526 }
3527
3528 left_el = path_leaf_el(left_path);
3529 BUG_ON(le16_to_cpu(left_el->l_next_free_rec) !=
3530 le16_to_cpu(left_el->l_count));
3531
3532 left_rec = &left_el->l_recs[
3533 le16_to_cpu(left_el->l_next_free_rec) - 1];
3534 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3535 le16_to_cpu(left_rec->e_leaf_clusters) !=
3536 le32_to_cpu(split_rec->e_cpos));
3537
3538 subtree_index = ocfs2_find_subtree_root(et, left_path,
3539 right_path);
3540
3541 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3542 handle->h_buffer_credits,
3543 left_path);
3544 if (ret) {
3545 mlog_errno(ret);
3546 goto out;
3547 }
3548
3549 root_bh = left_path->p_node[subtree_index].bh;
3550 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3551
3552 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3553 subtree_index);
3554 if (ret) {
3555 mlog_errno(ret);
3556 goto out;
3557 }
3558
3559 for (i = subtree_index + 1;
3560 i < path_num_items(right_path); i++) {
3561 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3562 right_path, i);
3563 if (ret) {
3564 mlog_errno(ret);
3565 goto out;
3566 }
3567
3568 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3569 left_path, i);
3570 if (ret) {
3571 mlog_errno(ret);
3572 goto out;
3573 }
3574 }
3575 } else {
3576 left_rec = &el->l_recs[index - 1];
3577 if (ocfs2_is_empty_extent(&el->l_recs[0]))
3578 has_empty_extent = 1;
3579 }
3580
3581 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3582 path_num_items(right_path) - 1);
3583 if (ret) {
3584 mlog_errno(ret);
3585 goto out;
3586 }
3587
3588 if (has_empty_extent && index == 1) {
3589 /*
3590 * The easy case - we can just plop the record right in.
3591 */
3592 *left_rec = *split_rec;
3593
3594 has_empty_extent = 0;
3595 } else
3596 le16_add_cpu(&left_rec->e_leaf_clusters, split_clusters);
3597
3598 le32_add_cpu(&right_rec->e_cpos, split_clusters);
3599 le64_add_cpu(&right_rec->e_blkno,
3600 ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3601 split_clusters));
3602 le16_add_cpu(&right_rec->e_leaf_clusters, -split_clusters);
3603
3604 ocfs2_cleanup_merge(el, index);
3605
3606 ocfs2_journal_dirty(handle, bh);
3607 if (left_path) {
3608 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
3609
3610 /*
3611 * In the situation that the right_rec is empty and the extent
3612 * block is empty also, ocfs2_complete_edge_insert can't handle
3613 * it and we need to delete the right extent block.
3614 */
3615 if (le16_to_cpu(right_rec->e_leaf_clusters) == 0 &&
3616 le16_to_cpu(el->l_next_free_rec) == 1) {
3617 /* extend credit for ocfs2_remove_rightmost_path */
3618 ret = ocfs2_extend_rotate_transaction(handle, 0,
3619 handle->h_buffer_credits,
3620 right_path);
3621 if (ret) {
3622 mlog_errno(ret);
3623 goto out;
3624 }
3625
3626 ret = ocfs2_remove_rightmost_path(handle, et,
3627 right_path,
3628 dealloc);
3629 if (ret) {
3630 mlog_errno(ret);
3631 goto out;
3632 }
3633
3634 /* Now the rightmost extent block has been deleted.
3635 * So we use the new rightmost path.
3636 */
3637 ocfs2_mv_path(right_path, left_path);
3638 left_path = NULL;
3639 } else
3640 ocfs2_complete_edge_insert(handle, left_path,
3641 right_path, subtree_index);
3642 }
3643out:
3644 ocfs2_free_path(left_path);
3645 return ret;
3646}
3647
3648static int ocfs2_try_to_merge_extent(handle_t *handle,
3649 struct ocfs2_extent_tree *et,
3650 struct ocfs2_path *path,
3651 int split_index,
3652 struct ocfs2_extent_rec *split_rec,
3653 struct ocfs2_cached_dealloc_ctxt *dealloc,
3654 struct ocfs2_merge_ctxt *ctxt)
3655{
3656 int ret = 0;
3657 struct ocfs2_extent_list *el = path_leaf_el(path);
3658 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
3659
3660 BUG_ON(ctxt->c_contig_type == CONTIG_NONE);
3661
3662 if (ctxt->c_split_covers_rec && ctxt->c_has_empty_extent) {
3663 /* extend credit for ocfs2_remove_rightmost_path */
3664 ret = ocfs2_extend_rotate_transaction(handle, 0,
3665 handle->h_buffer_credits,
3666 path);
3667 if (ret) {
3668 mlog_errno(ret);
3669 goto out;
3670 }
3671 /*
3672 * The merge code will need to create an empty
3673 * extent to take the place of the newly
3674 * emptied slot. Remove any pre-existing empty
3675 * extents - having more than one in a leaf is
3676 * illegal.
3677 */
3678 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3679 if (ret) {
3680 mlog_errno(ret);
3681 goto out;
3682 }
3683 split_index--;
3684 rec = &el->l_recs[split_index];
3685 }
3686
3687 if (ctxt->c_contig_type == CONTIG_LEFTRIGHT) {
3688 /*
3689 * Left-right contig implies this.
3690 */
3691 BUG_ON(!ctxt->c_split_covers_rec);
3692
3693 /*
3694 * Since the leftright insert always covers the entire
3695 * extent, this call will delete the insert record
3696 * entirely, resulting in an empty extent record added to
3697 * the extent block.
3698 *
3699 * Since the adding of an empty extent shifts
3700 * everything back to the right, there's no need to
3701 * update split_index here.
3702 *
3703 * When the split_index is zero, we need to merge it to the
3704 * prevoius extent block. It is more efficient and easier
3705 * if we do merge_right first and merge_left later.
3706 */
3707 ret = ocfs2_merge_rec_right(path, handle, et, split_rec,
3708 split_index);
3709 if (ret) {
3710 mlog_errno(ret);
3711 goto out;
3712 }
3713
3714 /*
3715 * We can only get this from logic error above.
3716 */
3717 BUG_ON(!ocfs2_is_empty_extent(&el->l_recs[0]));
3718
3719 /* extend credit for ocfs2_remove_rightmost_path */
3720 ret = ocfs2_extend_rotate_transaction(handle, 0,
3721 handle->h_buffer_credits,
3722 path);
3723 if (ret) {
3724 mlog_errno(ret);
3725 goto out;
3726 }
3727
3728 /* The merge left us with an empty extent, remove it. */
3729 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3730 if (ret) {
3731 mlog_errno(ret);
3732 goto out;
3733 }
3734
3735 rec = &el->l_recs[split_index];
3736
3737 /*
3738 * Note that we don't pass split_rec here on purpose -
3739 * we've merged it into the rec already.
3740 */
3741 ret = ocfs2_merge_rec_left(path, handle, et, rec,
3742 dealloc, split_index);
3743
3744 if (ret) {
3745 mlog_errno(ret);
3746 goto out;
3747 }
3748
3749 /* extend credit for ocfs2_remove_rightmost_path */
3750 ret = ocfs2_extend_rotate_transaction(handle, 0,
3751 handle->h_buffer_credits,
3752 path);
3753 if (ret) {
3754 mlog_errno(ret);
3755 goto out;
3756 }
3757
3758 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3759 /*
3760 * Error from this last rotate is not critical, so
3761 * print but don't bubble it up.
3762 */
3763 if (ret)
3764 mlog_errno(ret);
3765 ret = 0;
3766 } else {
3767 /*
3768 * Merge a record to the left or right.
3769 *
3770 * 'contig_type' is relative to the existing record,
3771 * so for example, if we're "right contig", it's to
3772 * the record on the left (hence the left merge).
3773 */
3774 if (ctxt->c_contig_type == CONTIG_RIGHT) {
3775 ret = ocfs2_merge_rec_left(path, handle, et,
3776 split_rec, dealloc,
3777 split_index);
3778 if (ret) {
3779 mlog_errno(ret);
3780 goto out;
3781 }
3782 } else {
3783 ret = ocfs2_merge_rec_right(path, handle,
3784 et, split_rec,
3785 split_index);
3786 if (ret) {
3787 mlog_errno(ret);
3788 goto out;
3789 }
3790 }
3791
3792 if (ctxt->c_split_covers_rec) {
3793 /* extend credit for ocfs2_remove_rightmost_path */
3794 ret = ocfs2_extend_rotate_transaction(handle, 0,
3795 handle->h_buffer_credits,
3796 path);
3797 if (ret) {
3798 mlog_errno(ret);
3799 ret = 0;
3800 goto out;
3801 }
3802
3803 /*
3804 * The merge may have left an empty extent in
3805 * our leaf. Try to rotate it away.
3806 */
3807 ret = ocfs2_rotate_tree_left(handle, et, path,
3808 dealloc);
3809 if (ret)
3810 mlog_errno(ret);
3811 ret = 0;
3812 }
3813 }
3814
3815out:
3816 return ret;
3817}
3818
3819static void ocfs2_subtract_from_rec(struct super_block *sb,
3820 enum ocfs2_split_type split,
3821 struct ocfs2_extent_rec *rec,
3822 struct ocfs2_extent_rec *split_rec)
3823{
3824 u64 len_blocks;
3825
3826 len_blocks = ocfs2_clusters_to_blocks(sb,
3827 le16_to_cpu(split_rec->e_leaf_clusters));
3828
3829 if (split == SPLIT_LEFT) {
3830 /*
3831 * Region is on the left edge of the existing
3832 * record.
3833 */
3834 le32_add_cpu(&rec->e_cpos,
3835 le16_to_cpu(split_rec->e_leaf_clusters));
3836 le64_add_cpu(&rec->e_blkno, len_blocks);
3837 le16_add_cpu(&rec->e_leaf_clusters,
3838 -le16_to_cpu(split_rec->e_leaf_clusters));
3839 } else {
3840 /*
3841 * Region is on the right edge of the existing
3842 * record.
3843 */
3844 le16_add_cpu(&rec->e_leaf_clusters,
3845 -le16_to_cpu(split_rec->e_leaf_clusters));
3846 }
3847}
3848
3849/*
3850 * Do the final bits of extent record insertion at the target leaf
3851 * list. If this leaf is part of an allocation tree, it is assumed
3852 * that the tree above has been prepared.
3853 */
3854static void ocfs2_insert_at_leaf(struct ocfs2_extent_tree *et,
3855 struct ocfs2_extent_rec *insert_rec,
3856 struct ocfs2_extent_list *el,
3857 struct ocfs2_insert_type *insert)
3858{
3859 int i = insert->ins_contig_index;
3860 unsigned int range;
3861 struct ocfs2_extent_rec *rec;
3862
3863 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
3864
3865 if (insert->ins_split != SPLIT_NONE) {
3866 i = ocfs2_search_extent_list(el, le32_to_cpu(insert_rec->e_cpos));
3867 BUG_ON(i == -1);
3868 rec = &el->l_recs[i];
3869 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci),
3870 insert->ins_split, rec,
3871 insert_rec);
3872 goto rotate;
3873 }
3874
3875 /*
3876 * Contiguous insert - either left or right.
3877 */
3878 if (insert->ins_contig != CONTIG_NONE) {
3879 rec = &el->l_recs[i];
3880 if (insert->ins_contig == CONTIG_LEFT) {
3881 rec->e_blkno = insert_rec->e_blkno;
3882 rec->e_cpos = insert_rec->e_cpos;
3883 }
3884 le16_add_cpu(&rec->e_leaf_clusters,
3885 le16_to_cpu(insert_rec->e_leaf_clusters));
3886 return;
3887 }
3888
3889 /*
3890 * Handle insert into an empty leaf.
3891 */
3892 if (le16_to_cpu(el->l_next_free_rec) == 0 ||
3893 ((le16_to_cpu(el->l_next_free_rec) == 1) &&
3894 ocfs2_is_empty_extent(&el->l_recs[0]))) {
3895 el->l_recs[0] = *insert_rec;
3896 el->l_next_free_rec = cpu_to_le16(1);
3897 return;
3898 }
3899
3900 /*
3901 * Appending insert.
3902 */
3903 if (insert->ins_appending == APPEND_TAIL) {
3904 i = le16_to_cpu(el->l_next_free_rec) - 1;
3905 rec = &el->l_recs[i];
3906 range = le32_to_cpu(rec->e_cpos)
3907 + le16_to_cpu(rec->e_leaf_clusters);
3908 BUG_ON(le32_to_cpu(insert_rec->e_cpos) < range);
3909
3910 mlog_bug_on_msg(le16_to_cpu(el->l_next_free_rec) >=
3911 le16_to_cpu(el->l_count),
3912 "owner %llu, depth %u, count %u, next free %u, "
3913 "rec.cpos %u, rec.clusters %u, "
3914 "insert.cpos %u, insert.clusters %u\n",
3915 ocfs2_metadata_cache_owner(et->et_ci),
3916 le16_to_cpu(el->l_tree_depth),
3917 le16_to_cpu(el->l_count),
3918 le16_to_cpu(el->l_next_free_rec),
3919 le32_to_cpu(el->l_recs[i].e_cpos),
3920 le16_to_cpu(el->l_recs[i].e_leaf_clusters),
3921 le32_to_cpu(insert_rec->e_cpos),
3922 le16_to_cpu(insert_rec->e_leaf_clusters));
3923 i++;
3924 el->l_recs[i] = *insert_rec;
3925 le16_add_cpu(&el->l_next_free_rec, 1);
3926 return;
3927 }
3928
3929rotate:
3930 /*
3931 * Ok, we have to rotate.
3932 *
3933 * At this point, it is safe to assume that inserting into an
3934 * empty leaf and appending to a leaf have both been handled
3935 * above.
3936 *
3937 * This leaf needs to have space, either by the empty 1st
3938 * extent record, or by virtue of an l_next_rec < l_count.
3939 */
3940 ocfs2_rotate_leaf(el, insert_rec);
3941}
3942
3943static void ocfs2_adjust_rightmost_records(handle_t *handle,
3944 struct ocfs2_extent_tree *et,
3945 struct ocfs2_path *path,
3946 struct ocfs2_extent_rec *insert_rec)
3947{
3948 int ret, i, next_free;
3949 struct buffer_head *bh;
3950 struct ocfs2_extent_list *el;
3951 struct ocfs2_extent_rec *rec;
3952
3953 /*
3954 * Update everything except the leaf block.
3955 */
3956 for (i = 0; i < path->p_tree_depth; i++) {
3957 bh = path->p_node[i].bh;
3958 el = path->p_node[i].el;
3959
3960 next_free = le16_to_cpu(el->l_next_free_rec);
3961 if (next_free == 0) {
3962 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
3963 "Owner %llu has a bad extent list\n",
3964 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
3965 ret = -EIO;
3966 return;
3967 }
3968
3969 rec = &el->l_recs[next_free - 1];
3970
3971 rec->e_int_clusters = insert_rec->e_cpos;
3972 le32_add_cpu(&rec->e_int_clusters,
3973 le16_to_cpu(insert_rec->e_leaf_clusters));
3974 le32_add_cpu(&rec->e_int_clusters,
3975 -le32_to_cpu(rec->e_cpos));
3976
3977 ocfs2_journal_dirty(handle, bh);
3978 }
3979}
3980
3981static int ocfs2_append_rec_to_path(handle_t *handle,
3982 struct ocfs2_extent_tree *et,
3983 struct ocfs2_extent_rec *insert_rec,
3984 struct ocfs2_path *right_path,
3985 struct ocfs2_path **ret_left_path)
3986{
3987 int ret, next_free;
3988 struct ocfs2_extent_list *el;
3989 struct ocfs2_path *left_path = NULL;
3990
3991 *ret_left_path = NULL;
3992
3993 /*
3994 * This shouldn't happen for non-trees. The extent rec cluster
3995 * count manipulation below only works for interior nodes.
3996 */
3997 BUG_ON(right_path->p_tree_depth == 0);
3998
3999 /*
4000 * If our appending insert is at the leftmost edge of a leaf,
4001 * then we might need to update the rightmost records of the
4002 * neighboring path.
4003 */
4004 el = path_leaf_el(right_path);
4005 next_free = le16_to_cpu(el->l_next_free_rec);
4006 if (next_free == 0 ||
4007 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
4008 u32 left_cpos;
4009
4010 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
4011 right_path, &left_cpos);
4012 if (ret) {
4013 mlog_errno(ret);
4014 goto out;
4015 }
4016
4017 trace_ocfs2_append_rec_to_path(
4018 (unsigned long long)
4019 ocfs2_metadata_cache_owner(et->et_ci),
4020 le32_to_cpu(insert_rec->e_cpos),
4021 left_cpos);
4022
4023 /*
4024 * No need to worry if the append is already in the
4025 * leftmost leaf.
4026 */
4027 if (left_cpos) {
4028 left_path = ocfs2_new_path_from_path(right_path);
4029 if (!left_path) {
4030 ret = -ENOMEM;
4031 mlog_errno(ret);
4032 goto out;
4033 }
4034
4035 ret = ocfs2_find_path(et->et_ci, left_path,
4036 left_cpos);
4037 if (ret) {
4038 mlog_errno(ret);
4039 goto out;
4040 }
4041
4042 /*
4043 * ocfs2_insert_path() will pass the left_path to the
4044 * journal for us.
4045 */
4046 }
4047 }
4048
4049 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4050 if (ret) {
4051 mlog_errno(ret);
4052 goto out;
4053 }
4054
4055 ocfs2_adjust_rightmost_records(handle, et, right_path, insert_rec);
4056
4057 *ret_left_path = left_path;
4058 ret = 0;
4059out:
4060 if (ret != 0)
4061 ocfs2_free_path(left_path);
4062
4063 return ret;
4064}
4065
4066static void ocfs2_split_record(struct ocfs2_extent_tree *et,
4067 struct ocfs2_path *left_path,
4068 struct ocfs2_path *right_path,
4069 struct ocfs2_extent_rec *split_rec,
4070 enum ocfs2_split_type split)
4071{
4072 int index;
4073 u32 cpos = le32_to_cpu(split_rec->e_cpos);
4074 struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el;
4075 struct ocfs2_extent_rec *rec, *tmprec;
4076
4077 right_el = path_leaf_el(right_path);
4078 if (left_path)
4079 left_el = path_leaf_el(left_path);
4080
4081 el = right_el;
4082 insert_el = right_el;
4083 index = ocfs2_search_extent_list(el, cpos);
4084 if (index != -1) {
4085 if (index == 0 && left_path) {
4086 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
4087
4088 /*
4089 * This typically means that the record
4090 * started in the left path but moved to the
4091 * right as a result of rotation. We either
4092 * move the existing record to the left, or we
4093 * do the later insert there.
4094 *
4095 * In this case, the left path should always
4096 * exist as the rotate code will have passed
4097 * it back for a post-insert update.
4098 */
4099
4100 if (split == SPLIT_LEFT) {
4101 /*
4102 * It's a left split. Since we know
4103 * that the rotate code gave us an
4104 * empty extent in the left path, we
4105 * can just do the insert there.
4106 */
4107 insert_el = left_el;
4108 } else {
4109 /*
4110 * Right split - we have to move the
4111 * existing record over to the left
4112 * leaf. The insert will be into the
4113 * newly created empty extent in the
4114 * right leaf.
4115 */
4116 tmprec = &right_el->l_recs[index];
4117 ocfs2_rotate_leaf(left_el, tmprec);
4118 el = left_el;
4119
4120 memset(tmprec, 0, sizeof(*tmprec));
4121 index = ocfs2_search_extent_list(left_el, cpos);
4122 BUG_ON(index == -1);
4123 }
4124 }
4125 } else {
4126 BUG_ON(!left_path);
4127 BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0]));
4128 /*
4129 * Left path is easy - we can just allow the insert to
4130 * happen.
4131 */
4132 el = left_el;
4133 insert_el = left_el;
4134 index = ocfs2_search_extent_list(el, cpos);
4135 BUG_ON(index == -1);
4136 }
4137
4138 rec = &el->l_recs[index];
4139 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci),
4140 split, rec, split_rec);
4141 ocfs2_rotate_leaf(insert_el, split_rec);
4142}
4143
4144/*
4145 * This function only does inserts on an allocation b-tree. For tree
4146 * depth = 0, ocfs2_insert_at_leaf() is called directly.
4147 *
4148 * right_path is the path we want to do the actual insert
4149 * in. left_path should only be passed in if we need to update that
4150 * portion of the tree after an edge insert.
4151 */
4152static int ocfs2_insert_path(handle_t *handle,
4153 struct ocfs2_extent_tree *et,
4154 struct ocfs2_path *left_path,
4155 struct ocfs2_path *right_path,
4156 struct ocfs2_extent_rec *insert_rec,
4157 struct ocfs2_insert_type *insert)
4158{
4159 int ret, subtree_index;
4160 struct buffer_head *leaf_bh = path_leaf_bh(right_path);
4161
4162 if (left_path) {
4163 /*
4164 * There's a chance that left_path got passed back to
4165 * us without being accounted for in the
4166 * journal. Extend our transaction here to be sure we
4167 * can change those blocks.
4168 */
4169 ret = ocfs2_extend_trans(handle, left_path->p_tree_depth);
4170 if (ret < 0) {
4171 mlog_errno(ret);
4172 goto out;
4173 }
4174
4175 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
4176 if (ret < 0) {
4177 mlog_errno(ret);
4178 goto out;
4179 }
4180 }
4181
4182 /*
4183 * Pass both paths to the journal. The majority of inserts
4184 * will be touching all components anyway.
4185 */
4186 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4187 if (ret < 0) {
4188 mlog_errno(ret);
4189 goto out;
4190 }
4191
4192 if (insert->ins_split != SPLIT_NONE) {
4193 /*
4194 * We could call ocfs2_insert_at_leaf() for some types
4195 * of splits, but it's easier to just let one separate
4196 * function sort it all out.
4197 */
4198 ocfs2_split_record(et, left_path, right_path,
4199 insert_rec, insert->ins_split);
4200
4201 /*
4202 * Split might have modified either leaf and we don't
4203 * have a guarantee that the later edge insert will
4204 * dirty this for us.
4205 */
4206 if (left_path)
4207 ocfs2_journal_dirty(handle,
4208 path_leaf_bh(left_path));
4209 } else
4210 ocfs2_insert_at_leaf(et, insert_rec, path_leaf_el(right_path),
4211 insert);
4212
4213 ocfs2_journal_dirty(handle, leaf_bh);
4214
4215 if (left_path) {
4216 /*
4217 * The rotate code has indicated that we need to fix
4218 * up portions of the tree after the insert.
4219 *
4220 * XXX: Should we extend the transaction here?
4221 */
4222 subtree_index = ocfs2_find_subtree_root(et, left_path,
4223 right_path);
4224 ocfs2_complete_edge_insert(handle, left_path, right_path,
4225 subtree_index);
4226 }
4227
4228 ret = 0;
4229out:
4230 return ret;
4231}
4232
4233static int ocfs2_do_insert_extent(handle_t *handle,
4234 struct ocfs2_extent_tree *et,
4235 struct ocfs2_extent_rec *insert_rec,
4236 struct ocfs2_insert_type *type)
4237{
4238 int ret, rotate = 0;
4239 u32 cpos;
4240 struct ocfs2_path *right_path = NULL;
4241 struct ocfs2_path *left_path = NULL;
4242 struct ocfs2_extent_list *el;
4243
4244 el = et->et_root_el;
4245
4246 ret = ocfs2_et_root_journal_access(handle, et,
4247 OCFS2_JOURNAL_ACCESS_WRITE);
4248 if (ret) {
4249 mlog_errno(ret);
4250 goto out;
4251 }
4252
4253 if (le16_to_cpu(el->l_tree_depth) == 0) {
4254 ocfs2_insert_at_leaf(et, insert_rec, el, type);
4255 goto out_update_clusters;
4256 }
4257
4258 right_path = ocfs2_new_path_from_et(et);
4259 if (!right_path) {
4260 ret = -ENOMEM;
4261 mlog_errno(ret);
4262 goto out;
4263 }
4264
4265 /*
4266 * Determine the path to start with. Rotations need the
4267 * rightmost path, everything else can go directly to the
4268 * target leaf.
4269 */
4270 cpos = le32_to_cpu(insert_rec->e_cpos);
4271 if (type->ins_appending == APPEND_NONE &&
4272 type->ins_contig == CONTIG_NONE) {
4273 rotate = 1;
4274 cpos = UINT_MAX;
4275 }
4276
4277 ret = ocfs2_find_path(et->et_ci, right_path, cpos);
4278 if (ret) {
4279 mlog_errno(ret);
4280 goto out;
4281 }
4282
4283 /*
4284 * Rotations and appends need special treatment - they modify
4285 * parts of the tree's above them.
4286 *
4287 * Both might pass back a path immediate to the left of the
4288 * one being inserted to. This will be cause
4289 * ocfs2_insert_path() to modify the rightmost records of
4290 * left_path to account for an edge insert.
4291 *
4292 * XXX: When modifying this code, keep in mind that an insert
4293 * can wind up skipping both of these two special cases...
4294 */
4295 if (rotate) {
4296 ret = ocfs2_rotate_tree_right(handle, et, type->ins_split,
4297 le32_to_cpu(insert_rec->e_cpos),
4298 right_path, &left_path);
4299 if (ret) {
4300 mlog_errno(ret);
4301 goto out;
4302 }
4303
4304 /*
4305 * ocfs2_rotate_tree_right() might have extended the
4306 * transaction without re-journaling our tree root.
4307 */
4308 ret = ocfs2_et_root_journal_access(handle, et,
4309 OCFS2_JOURNAL_ACCESS_WRITE);
4310 if (ret) {
4311 mlog_errno(ret);
4312 goto out;
4313 }
4314 } else if (type->ins_appending == APPEND_TAIL
4315 && type->ins_contig != CONTIG_LEFT) {
4316 ret = ocfs2_append_rec_to_path(handle, et, insert_rec,
4317 right_path, &left_path);
4318 if (ret) {
4319 mlog_errno(ret);
4320 goto out;
4321 }
4322 }
4323
4324 ret = ocfs2_insert_path(handle, et, left_path, right_path,
4325 insert_rec, type);
4326 if (ret) {
4327 mlog_errno(ret);
4328 goto out;
4329 }
4330
4331out_update_clusters:
4332 if (type->ins_split == SPLIT_NONE)
4333 ocfs2_et_update_clusters(et,
4334 le16_to_cpu(insert_rec->e_leaf_clusters));
4335
4336 ocfs2_journal_dirty(handle, et->et_root_bh);
4337
4338out:
4339 ocfs2_free_path(left_path);
4340 ocfs2_free_path(right_path);
4341
4342 return ret;
4343}
4344
4345static int ocfs2_figure_merge_contig_type(struct ocfs2_extent_tree *et,
4346 struct ocfs2_path *path,
4347 struct ocfs2_extent_list *el, int index,
4348 struct ocfs2_extent_rec *split_rec,
4349 struct ocfs2_merge_ctxt *ctxt)
4350{
4351 int status = 0;
4352 enum ocfs2_contig_type ret = CONTIG_NONE;
4353 u32 left_cpos, right_cpos;
4354 struct ocfs2_extent_rec *rec = NULL;
4355 struct ocfs2_extent_list *new_el;
4356 struct ocfs2_path *left_path = NULL, *right_path = NULL;
4357 struct buffer_head *bh;
4358 struct ocfs2_extent_block *eb;
4359 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
4360
4361 if (index > 0) {
4362 rec = &el->l_recs[index - 1];
4363 } else if (path->p_tree_depth > 0) {
4364 status = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos);
4365 if (status)
4366 goto exit;
4367
4368 if (left_cpos != 0) {
4369 left_path = ocfs2_new_path_from_path(path);
4370 if (!left_path) {
4371 status = -ENOMEM;
4372 mlog_errno(status);
4373 goto exit;
4374 }
4375
4376 status = ocfs2_find_path(et->et_ci, left_path,
4377 left_cpos);
4378 if (status)
4379 goto free_left_path;
4380
4381 new_el = path_leaf_el(left_path);
4382
4383 if (le16_to_cpu(new_el->l_next_free_rec) !=
4384 le16_to_cpu(new_el->l_count)) {
4385 bh = path_leaf_bh(left_path);
4386 eb = (struct ocfs2_extent_block *)bh->b_data;
4387 ocfs2_error(sb,
4388 "Extent block #%llu has an invalid l_next_free_rec of %d. It should have matched the l_count of %d\n",
4389 (unsigned long long)le64_to_cpu(eb->h_blkno),
4390 le16_to_cpu(new_el->l_next_free_rec),
4391 le16_to_cpu(new_el->l_count));
4392 status = -EINVAL;
4393 goto free_left_path;
4394 }
4395 rec = &new_el->l_recs[
4396 le16_to_cpu(new_el->l_next_free_rec) - 1];
4397 }
4398 }
4399
4400 /*
4401 * We're careful to check for an empty extent record here -
4402 * the merge code will know what to do if it sees one.
4403 */
4404 if (rec) {
4405 if (index == 1 && ocfs2_is_empty_extent(rec)) {
4406 if (split_rec->e_cpos == el->l_recs[index].e_cpos)
4407 ret = CONTIG_RIGHT;
4408 } else {
4409 ret = ocfs2_et_extent_contig(et, rec, split_rec);
4410 }
4411 }
4412
4413 rec = NULL;
4414 if (index < (le16_to_cpu(el->l_next_free_rec) - 1))
4415 rec = &el->l_recs[index + 1];
4416 else if (le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count) &&
4417 path->p_tree_depth > 0) {
4418 status = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos);
4419 if (status)
4420 goto free_left_path;
4421
4422 if (right_cpos == 0)
4423 goto free_left_path;
4424
4425 right_path = ocfs2_new_path_from_path(path);
4426 if (!right_path) {
4427 status = -ENOMEM;
4428 mlog_errno(status);
4429 goto free_left_path;
4430 }
4431
4432 status = ocfs2_find_path(et->et_ci, right_path, right_cpos);
4433 if (status)
4434 goto free_right_path;
4435
4436 new_el = path_leaf_el(right_path);
4437 rec = &new_el->l_recs[0];
4438 if (ocfs2_is_empty_extent(rec)) {
4439 if (le16_to_cpu(new_el->l_next_free_rec) <= 1) {
4440 bh = path_leaf_bh(right_path);
4441 eb = (struct ocfs2_extent_block *)bh->b_data;
4442 ocfs2_error(sb,
4443 "Extent block #%llu has an invalid l_next_free_rec of %d\n",
4444 (unsigned long long)le64_to_cpu(eb->h_blkno),
4445 le16_to_cpu(new_el->l_next_free_rec));
4446 status = -EINVAL;
4447 goto free_right_path;
4448 }
4449 rec = &new_el->l_recs[1];
4450 }
4451 }
4452
4453 if (rec) {
4454 enum ocfs2_contig_type contig_type;
4455
4456 contig_type = ocfs2_et_extent_contig(et, rec, split_rec);
4457
4458 if (contig_type == CONTIG_LEFT && ret == CONTIG_RIGHT)
4459 ret = CONTIG_LEFTRIGHT;
4460 else if (ret == CONTIG_NONE)
4461 ret = contig_type;
4462 }
4463
4464free_right_path:
4465 ocfs2_free_path(right_path);
4466free_left_path:
4467 ocfs2_free_path(left_path);
4468exit:
4469 if (status == 0)
4470 ctxt->c_contig_type = ret;
4471
4472 return status;
4473}
4474
4475static void ocfs2_figure_contig_type(struct ocfs2_extent_tree *et,
4476 struct ocfs2_insert_type *insert,
4477 struct ocfs2_extent_list *el,
4478 struct ocfs2_extent_rec *insert_rec)
4479{
4480 int i;
4481 enum ocfs2_contig_type contig_type = CONTIG_NONE;
4482
4483 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4484
4485 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
4486 contig_type = ocfs2_et_extent_contig(et, &el->l_recs[i],
4487 insert_rec);
4488 if (contig_type != CONTIG_NONE) {
4489 insert->ins_contig_index = i;
4490 break;
4491 }
4492 }
4493 insert->ins_contig = contig_type;
4494
4495 if (insert->ins_contig != CONTIG_NONE) {
4496 struct ocfs2_extent_rec *rec =
4497 &el->l_recs[insert->ins_contig_index];
4498 unsigned int len = le16_to_cpu(rec->e_leaf_clusters) +
4499 le16_to_cpu(insert_rec->e_leaf_clusters);
4500
4501 /*
4502 * Caller might want us to limit the size of extents, don't
4503 * calculate contiguousness if we might exceed that limit.
4504 */
4505 if (et->et_max_leaf_clusters &&
4506 (len > et->et_max_leaf_clusters))
4507 insert->ins_contig = CONTIG_NONE;
4508 }
4509}
4510
4511/*
4512 * This should only be called against the righmost leaf extent list.
4513 *
4514 * ocfs2_figure_appending_type() will figure out whether we'll have to
4515 * insert at the tail of the rightmost leaf.
4516 *
4517 * This should also work against the root extent list for tree's with 0
4518 * depth. If we consider the root extent list to be the rightmost leaf node
4519 * then the logic here makes sense.
4520 */
4521static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert,
4522 struct ocfs2_extent_list *el,
4523 struct ocfs2_extent_rec *insert_rec)
4524{
4525 int i;
4526 u32 cpos = le32_to_cpu(insert_rec->e_cpos);
4527 struct ocfs2_extent_rec *rec;
4528
4529 insert->ins_appending = APPEND_NONE;
4530
4531 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4532
4533 if (!el->l_next_free_rec)
4534 goto set_tail_append;
4535
4536 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
4537 /* Were all records empty? */
4538 if (le16_to_cpu(el->l_next_free_rec) == 1)
4539 goto set_tail_append;
4540 }
4541
4542 i = le16_to_cpu(el->l_next_free_rec) - 1;
4543 rec = &el->l_recs[i];
4544
4545 if (cpos >=
4546 (le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)))
4547 goto set_tail_append;
4548
4549 return;
4550
4551set_tail_append:
4552 insert->ins_appending = APPEND_TAIL;
4553}
4554
4555/*
4556 * Helper function called at the beginning of an insert.
4557 *
4558 * This computes a few things that are commonly used in the process of
4559 * inserting into the btree:
4560 * - Whether the new extent is contiguous with an existing one.
4561 * - The current tree depth.
4562 * - Whether the insert is an appending one.
4563 * - The total # of free records in the tree.
4564 *
4565 * All of the information is stored on the ocfs2_insert_type
4566 * structure.
4567 */
4568static int ocfs2_figure_insert_type(struct ocfs2_extent_tree *et,
4569 struct buffer_head **last_eb_bh,
4570 struct ocfs2_extent_rec *insert_rec,
4571 int *free_records,
4572 struct ocfs2_insert_type *insert)
4573{
4574 int ret;
4575 struct ocfs2_extent_block *eb;
4576 struct ocfs2_extent_list *el;
4577 struct ocfs2_path *path = NULL;
4578 struct buffer_head *bh = NULL;
4579
4580 insert->ins_split = SPLIT_NONE;
4581
4582 el = et->et_root_el;
4583 insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth);
4584
4585 if (el->l_tree_depth) {
4586 /*
4587 * If we have tree depth, we read in the
4588 * rightmost extent block ahead of time as
4589 * ocfs2_figure_insert_type() and ocfs2_add_branch()
4590 * may want it later.
4591 */
4592 ret = ocfs2_read_extent_block(et->et_ci,
4593 ocfs2_et_get_last_eb_blk(et),
4594 &bh);
4595 if (ret) {
4596 mlog_errno(ret);
4597 goto out;
4598 }
4599 eb = (struct ocfs2_extent_block *) bh->b_data;
4600 el = &eb->h_list;
4601 }
4602
4603 /*
4604 * Unless we have a contiguous insert, we'll need to know if
4605 * there is room left in our allocation tree for another
4606 * extent record.
4607 *
4608 * XXX: This test is simplistic, we can search for empty
4609 * extent records too.
4610 */
4611 *free_records = le16_to_cpu(el->l_count) -
4612 le16_to_cpu(el->l_next_free_rec);
4613
4614 if (!insert->ins_tree_depth) {
4615 ocfs2_figure_contig_type(et, insert, el, insert_rec);
4616 ocfs2_figure_appending_type(insert, el, insert_rec);
4617 return 0;
4618 }
4619
4620 path = ocfs2_new_path_from_et(et);
4621 if (!path) {
4622 ret = -ENOMEM;
4623 mlog_errno(ret);
4624 goto out;
4625 }
4626
4627 /*
4628 * In the case that we're inserting past what the tree
4629 * currently accounts for, ocfs2_find_path() will return for
4630 * us the rightmost tree path. This is accounted for below in
4631 * the appending code.
4632 */
4633 ret = ocfs2_find_path(et->et_ci, path, le32_to_cpu(insert_rec->e_cpos));
4634 if (ret) {
4635 mlog_errno(ret);
4636 goto out;
4637 }
4638
4639 el = path_leaf_el(path);
4640
4641 /*
4642 * Now that we have the path, there's two things we want to determine:
4643 * 1) Contiguousness (also set contig_index if this is so)
4644 *
4645 * 2) Are we doing an append? We can trivially break this up
4646 * into two types of appends: simple record append, or a
4647 * rotate inside the tail leaf.
4648 */
4649 ocfs2_figure_contig_type(et, insert, el, insert_rec);
4650
4651 /*
4652 * The insert code isn't quite ready to deal with all cases of
4653 * left contiguousness. Specifically, if it's an insert into
4654 * the 1st record in a leaf, it will require the adjustment of
4655 * cluster count on the last record of the path directly to it's
4656 * left. For now, just catch that case and fool the layers
4657 * above us. This works just fine for tree_depth == 0, which
4658 * is why we allow that above.
4659 */
4660 if (insert->ins_contig == CONTIG_LEFT &&
4661 insert->ins_contig_index == 0)
4662 insert->ins_contig = CONTIG_NONE;
4663
4664 /*
4665 * Ok, so we can simply compare against last_eb to figure out
4666 * whether the path doesn't exist. This will only happen in
4667 * the case that we're doing a tail append, so maybe we can
4668 * take advantage of that information somehow.
4669 */
4670 if (ocfs2_et_get_last_eb_blk(et) ==
4671 path_leaf_bh(path)->b_blocknr) {
4672 /*
4673 * Ok, ocfs2_find_path() returned us the rightmost
4674 * tree path. This might be an appending insert. There are
4675 * two cases:
4676 * 1) We're doing a true append at the tail:
4677 * -This might even be off the end of the leaf
4678 * 2) We're "appending" by rotating in the tail
4679 */
4680 ocfs2_figure_appending_type(insert, el, insert_rec);
4681 }
4682
4683out:
4684 ocfs2_free_path(path);
4685
4686 if (ret == 0)
4687 *last_eb_bh = bh;
4688 else
4689 brelse(bh);
4690 return ret;
4691}
4692
4693/*
4694 * Insert an extent into a btree.
4695 *
4696 * The caller needs to update the owning btree's cluster count.
4697 */
4698int ocfs2_insert_extent(handle_t *handle,
4699 struct ocfs2_extent_tree *et,
4700 u32 cpos,
4701 u64 start_blk,
4702 u32 new_clusters,
4703 u8 flags,
4704 struct ocfs2_alloc_context *meta_ac)
4705{
4706 int status;
4707 int uninitialized_var(free_records);
4708 struct buffer_head *last_eb_bh = NULL;
4709 struct ocfs2_insert_type insert = {0, };
4710 struct ocfs2_extent_rec rec;
4711
4712 trace_ocfs2_insert_extent_start(
4713 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
4714 cpos, new_clusters);
4715
4716 memset(&rec, 0, sizeof(rec));
4717 rec.e_cpos = cpu_to_le32(cpos);
4718 rec.e_blkno = cpu_to_le64(start_blk);
4719 rec.e_leaf_clusters = cpu_to_le16(new_clusters);
4720 rec.e_flags = flags;
4721 status = ocfs2_et_insert_check(et, &rec);
4722 if (status) {
4723 mlog_errno(status);
4724 goto bail;
4725 }
4726
4727 status = ocfs2_figure_insert_type(et, &last_eb_bh, &rec,
4728 &free_records, &insert);
4729 if (status < 0) {
4730 mlog_errno(status);
4731 goto bail;
4732 }
4733
4734 trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig,
4735 insert.ins_contig_index, free_records,
4736 insert.ins_tree_depth);
4737
4738 if (insert.ins_contig == CONTIG_NONE && free_records == 0) {
4739 status = ocfs2_grow_tree(handle, et,
4740 &insert.ins_tree_depth, &last_eb_bh,
4741 meta_ac);
4742 if (status) {
4743 mlog_errno(status);
4744 goto bail;
4745 }
4746 }
4747
4748 /* Finally, we can add clusters. This might rotate the tree for us. */
4749 status = ocfs2_do_insert_extent(handle, et, &rec, &insert);
4750 if (status < 0)
4751 mlog_errno(status);
4752 else
4753 ocfs2_et_extent_map_insert(et, &rec);
4754
4755bail:
4756 brelse(last_eb_bh);
4757
4758 return status;
4759}
4760
4761/*
4762 * Allcate and add clusters into the extent b-tree.
4763 * The new clusters(clusters_to_add) will be inserted at logical_offset.
4764 * The extent b-tree's root is specified by et, and
4765 * it is not limited to the file storage. Any extent tree can use this
4766 * function if it implements the proper ocfs2_extent_tree.
4767 */
4768int ocfs2_add_clusters_in_btree(handle_t *handle,
4769 struct ocfs2_extent_tree *et,
4770 u32 *logical_offset,
4771 u32 clusters_to_add,
4772 int mark_unwritten,
4773 struct ocfs2_alloc_context *data_ac,
4774 struct ocfs2_alloc_context *meta_ac,
4775 enum ocfs2_alloc_restarted *reason_ret)
4776{
4777 int status = 0, err = 0;
4778 int need_free = 0;
4779 int free_extents;
4780 enum ocfs2_alloc_restarted reason = RESTART_NONE;
4781 u32 bit_off, num_bits;
4782 u64 block;
4783 u8 flags = 0;
4784 struct ocfs2_super *osb =
4785 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
4786
4787 BUG_ON(!clusters_to_add);
4788
4789 if (mark_unwritten)
4790 flags = OCFS2_EXT_UNWRITTEN;
4791
4792 free_extents = ocfs2_num_free_extents(osb, et);
4793 if (free_extents < 0) {
4794 status = free_extents;
4795 mlog_errno(status);
4796 goto leave;
4797 }
4798
4799 /* there are two cases which could cause us to EAGAIN in the
4800 * we-need-more-metadata case:
4801 * 1) we haven't reserved *any*
4802 * 2) we are so fragmented, we've needed to add metadata too
4803 * many times. */
4804 if (!free_extents && !meta_ac) {
4805 err = -1;
4806 status = -EAGAIN;
4807 reason = RESTART_META;
4808 goto leave;
4809 } else if ((!free_extents)
4810 && (ocfs2_alloc_context_bits_left(meta_ac)
4811 < ocfs2_extend_meta_needed(et->et_root_el))) {
4812 err = -2;
4813 status = -EAGAIN;
4814 reason = RESTART_META;
4815 goto leave;
4816 }
4817
4818 status = __ocfs2_claim_clusters(handle, data_ac, 1,
4819 clusters_to_add, &bit_off, &num_bits);
4820 if (status < 0) {
4821 if (status != -ENOSPC)
4822 mlog_errno(status);
4823 goto leave;
4824 }
4825
4826 BUG_ON(num_bits > clusters_to_add);
4827
4828 /* reserve our write early -- insert_extent may update the tree root */
4829 status = ocfs2_et_root_journal_access(handle, et,
4830 OCFS2_JOURNAL_ACCESS_WRITE);
4831 if (status < 0) {
4832 mlog_errno(status);
4833 need_free = 1;
4834 goto bail;
4835 }
4836
4837 block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
4838 trace_ocfs2_add_clusters_in_btree(
4839 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
4840 bit_off, num_bits);
4841 status = ocfs2_insert_extent(handle, et, *logical_offset, block,
4842 num_bits, flags, meta_ac);
4843 if (status < 0) {
4844 mlog_errno(status);
4845 need_free = 1;
4846 goto bail;
4847 }
4848
4849 ocfs2_journal_dirty(handle, et->et_root_bh);
4850
4851 clusters_to_add -= num_bits;
4852 *logical_offset += num_bits;
4853
4854 if (clusters_to_add) {
4855 err = clusters_to_add;
4856 status = -EAGAIN;
4857 reason = RESTART_TRANS;
4858 }
4859
4860bail:
4861 if (need_free) {
4862 if (data_ac->ac_which == OCFS2_AC_USE_LOCAL)
4863 ocfs2_free_local_alloc_bits(osb, handle, data_ac,
4864 bit_off, num_bits);
4865 else
4866 ocfs2_free_clusters(handle,
4867 data_ac->ac_inode,
4868 data_ac->ac_bh,
4869 ocfs2_clusters_to_blocks(osb->sb, bit_off),
4870 num_bits);
4871 }
4872
4873leave:
4874 if (reason_ret)
4875 *reason_ret = reason;
4876 trace_ocfs2_add_clusters_in_btree_ret(status, reason, err);
4877 return status;
4878}
4879
4880static void ocfs2_make_right_split_rec(struct super_block *sb,
4881 struct ocfs2_extent_rec *split_rec,
4882 u32 cpos,
4883 struct ocfs2_extent_rec *rec)
4884{
4885 u32 rec_cpos = le32_to_cpu(rec->e_cpos);
4886 u32 rec_range = rec_cpos + le16_to_cpu(rec->e_leaf_clusters);
4887
4888 memset(split_rec, 0, sizeof(struct ocfs2_extent_rec));
4889
4890 split_rec->e_cpos = cpu_to_le32(cpos);
4891 split_rec->e_leaf_clusters = cpu_to_le16(rec_range - cpos);
4892
4893 split_rec->e_blkno = rec->e_blkno;
4894 le64_add_cpu(&split_rec->e_blkno,
4895 ocfs2_clusters_to_blocks(sb, cpos - rec_cpos));
4896
4897 split_rec->e_flags = rec->e_flags;
4898}
4899
4900static int ocfs2_split_and_insert(handle_t *handle,
4901 struct ocfs2_extent_tree *et,
4902 struct ocfs2_path *path,
4903 struct buffer_head **last_eb_bh,
4904 int split_index,
4905 struct ocfs2_extent_rec *orig_split_rec,
4906 struct ocfs2_alloc_context *meta_ac)
4907{
4908 int ret = 0, depth;
4909 unsigned int insert_range, rec_range, do_leftright = 0;
4910 struct ocfs2_extent_rec tmprec;
4911 struct ocfs2_extent_list *rightmost_el;
4912 struct ocfs2_extent_rec rec;
4913 struct ocfs2_extent_rec split_rec = *orig_split_rec;
4914 struct ocfs2_insert_type insert;
4915 struct ocfs2_extent_block *eb;
4916
4917leftright:
4918 /*
4919 * Store a copy of the record on the stack - it might move
4920 * around as the tree is manipulated below.
4921 */
4922 rec = path_leaf_el(path)->l_recs[split_index];
4923
4924 rightmost_el = et->et_root_el;
4925
4926 depth = le16_to_cpu(rightmost_el->l_tree_depth);
4927 if (depth) {
4928 BUG_ON(!(*last_eb_bh));
4929 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
4930 rightmost_el = &eb->h_list;
4931 }
4932
4933 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
4934 le16_to_cpu(rightmost_el->l_count)) {
4935 ret = ocfs2_grow_tree(handle, et,
4936 &depth, last_eb_bh, meta_ac);
4937 if (ret) {
4938 mlog_errno(ret);
4939 goto out;
4940 }
4941 }
4942
4943 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
4944 insert.ins_appending = APPEND_NONE;
4945 insert.ins_contig = CONTIG_NONE;
4946 insert.ins_tree_depth = depth;
4947
4948 insert_range = le32_to_cpu(split_rec.e_cpos) +
4949 le16_to_cpu(split_rec.e_leaf_clusters);
4950 rec_range = le32_to_cpu(rec.e_cpos) +
4951 le16_to_cpu(rec.e_leaf_clusters);
4952
4953 if (split_rec.e_cpos == rec.e_cpos) {
4954 insert.ins_split = SPLIT_LEFT;
4955 } else if (insert_range == rec_range) {
4956 insert.ins_split = SPLIT_RIGHT;
4957 } else {
4958 /*
4959 * Left/right split. We fake this as a right split
4960 * first and then make a second pass as a left split.
4961 */
4962 insert.ins_split = SPLIT_RIGHT;
4963
4964 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci),
4965 &tmprec, insert_range, &rec);
4966
4967 split_rec = tmprec;
4968
4969 BUG_ON(do_leftright);
4970 do_leftright = 1;
4971 }
4972
4973 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
4974 if (ret) {
4975 mlog_errno(ret);
4976 goto out;
4977 }
4978
4979 if (do_leftright == 1) {
4980 u32 cpos;
4981 struct ocfs2_extent_list *el;
4982
4983 do_leftright++;
4984 split_rec = *orig_split_rec;
4985
4986 ocfs2_reinit_path(path, 1);
4987
4988 cpos = le32_to_cpu(split_rec.e_cpos);
4989 ret = ocfs2_find_path(et->et_ci, path, cpos);
4990 if (ret) {
4991 mlog_errno(ret);
4992 goto out;
4993 }
4994
4995 el = path_leaf_el(path);
4996 split_index = ocfs2_search_extent_list(el, cpos);
4997 if (split_index == -1) {
4998 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
4999 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5000 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5001 cpos);
5002 ret = -EROFS;
5003 goto out;
5004 }
5005 goto leftright;
5006 }
5007out:
5008
5009 return ret;
5010}
5011
5012static int ocfs2_replace_extent_rec(handle_t *handle,
5013 struct ocfs2_extent_tree *et,
5014 struct ocfs2_path *path,
5015 struct ocfs2_extent_list *el,
5016 int split_index,
5017 struct ocfs2_extent_rec *split_rec)
5018{
5019 int ret;
5020
5021 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path,
5022 path_num_items(path) - 1);
5023 if (ret) {
5024 mlog_errno(ret);
5025 goto out;
5026 }
5027
5028 el->l_recs[split_index] = *split_rec;
5029
5030 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5031out:
5032 return ret;
5033}
5034
5035/*
5036 * Split part or all of the extent record at split_index in the leaf
5037 * pointed to by path. Merge with the contiguous extent record if needed.
5038 *
5039 * Care is taken to handle contiguousness so as to not grow the tree.
5040 *
5041 * meta_ac is not strictly necessary - we only truly need it if growth
5042 * of the tree is required. All other cases will degrade into a less
5043 * optimal tree layout.
5044 *
5045 * last_eb_bh should be the rightmost leaf block for any extent
5046 * btree. Since a split may grow the tree or a merge might shrink it,
5047 * the caller cannot trust the contents of that buffer after this call.
5048 *
5049 * This code is optimized for readability - several passes might be
5050 * made over certain portions of the tree. All of those blocks will
5051 * have been brought into cache (and pinned via the journal), so the
5052 * extra overhead is not expressed in terms of disk reads.
5053 */
5054int ocfs2_split_extent(handle_t *handle,
5055 struct ocfs2_extent_tree *et,
5056 struct ocfs2_path *path,
5057 int split_index,
5058 struct ocfs2_extent_rec *split_rec,
5059 struct ocfs2_alloc_context *meta_ac,
5060 struct ocfs2_cached_dealloc_ctxt *dealloc)
5061{
5062 int ret = 0;
5063 struct ocfs2_extent_list *el = path_leaf_el(path);
5064 struct buffer_head *last_eb_bh = NULL;
5065 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
5066 struct ocfs2_merge_ctxt ctxt;
5067 struct ocfs2_extent_list *rightmost_el;
5068
5069 if (le32_to_cpu(rec->e_cpos) > le32_to_cpu(split_rec->e_cpos) ||
5070 ((le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)) <
5071 (le32_to_cpu(split_rec->e_cpos) + le16_to_cpu(split_rec->e_leaf_clusters)))) {
5072 ret = -EIO;
5073 mlog_errno(ret);
5074 goto out;
5075 }
5076
5077 ret = ocfs2_figure_merge_contig_type(et, path, el,
5078 split_index,
5079 split_rec,
5080 &ctxt);
5081 if (ret) {
5082 mlog_errno(ret);
5083 goto out;
5084 }
5085
5086 /*
5087 * The core merge / split code wants to know how much room is
5088 * left in this allocation tree, so we pass the
5089 * rightmost extent list.
5090 */
5091 if (path->p_tree_depth) {
5092 struct ocfs2_extent_block *eb;
5093
5094 ret = ocfs2_read_extent_block(et->et_ci,
5095 ocfs2_et_get_last_eb_blk(et),
5096 &last_eb_bh);
5097 if (ret) {
5098 mlog_errno(ret);
5099 goto out;
5100 }
5101
5102 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5103 rightmost_el = &eb->h_list;
5104 } else
5105 rightmost_el = path_root_el(path);
5106
5107 if (rec->e_cpos == split_rec->e_cpos &&
5108 rec->e_leaf_clusters == split_rec->e_leaf_clusters)
5109 ctxt.c_split_covers_rec = 1;
5110 else
5111 ctxt.c_split_covers_rec = 0;
5112
5113 ctxt.c_has_empty_extent = ocfs2_is_empty_extent(&el->l_recs[0]);
5114
5115 trace_ocfs2_split_extent(split_index, ctxt.c_contig_type,
5116 ctxt.c_has_empty_extent,
5117 ctxt.c_split_covers_rec);
5118
5119 if (ctxt.c_contig_type == CONTIG_NONE) {
5120 if (ctxt.c_split_covers_rec)
5121 ret = ocfs2_replace_extent_rec(handle, et, path, el,
5122 split_index, split_rec);
5123 else
5124 ret = ocfs2_split_and_insert(handle, et, path,
5125 &last_eb_bh, split_index,
5126 split_rec, meta_ac);
5127 if (ret)
5128 mlog_errno(ret);
5129 } else {
5130 ret = ocfs2_try_to_merge_extent(handle, et, path,
5131 split_index, split_rec,
5132 dealloc, &ctxt);
5133 if (ret)
5134 mlog_errno(ret);
5135 }
5136
5137out:
5138 brelse(last_eb_bh);
5139 return ret;
5140}
5141
5142/*
5143 * Change the flags of the already-existing extent at cpos for len clusters.
5144 *
5145 * new_flags: the flags we want to set.
5146 * clear_flags: the flags we want to clear.
5147 * phys: the new physical offset we want this new extent starts from.
5148 *
5149 * If the existing extent is larger than the request, initiate a
5150 * split. An attempt will be made at merging with adjacent extents.
5151 *
5152 * The caller is responsible for passing down meta_ac if we'll need it.
5153 */
5154int ocfs2_change_extent_flag(handle_t *handle,
5155 struct ocfs2_extent_tree *et,
5156 u32 cpos, u32 len, u32 phys,
5157 struct ocfs2_alloc_context *meta_ac,
5158 struct ocfs2_cached_dealloc_ctxt *dealloc,
5159 int new_flags, int clear_flags)
5160{
5161 int ret, index;
5162 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
5163 u64 start_blkno = ocfs2_clusters_to_blocks(sb, phys);
5164 struct ocfs2_extent_rec split_rec;
5165 struct ocfs2_path *left_path = NULL;
5166 struct ocfs2_extent_list *el;
5167 struct ocfs2_extent_rec *rec;
5168
5169 left_path = ocfs2_new_path_from_et(et);
5170 if (!left_path) {
5171 ret = -ENOMEM;
5172 mlog_errno(ret);
5173 goto out;
5174 }
5175
5176 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
5177 if (ret) {
5178 mlog_errno(ret);
5179 goto out;
5180 }
5181 el = path_leaf_el(left_path);
5182
5183 index = ocfs2_search_extent_list(el, cpos);
5184 if (index == -1) {
5185 ocfs2_error(sb,
5186 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5187 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5188 cpos);
5189 ret = -EROFS;
5190 goto out;
5191 }
5192
5193 ret = -EIO;
5194 rec = &el->l_recs[index];
5195 if (new_flags && (rec->e_flags & new_flags)) {
5196 mlog(ML_ERROR, "Owner %llu tried to set %d flags on an "
5197 "extent that already had them\n",
5198 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5199 new_flags);
5200 goto out;
5201 }
5202
5203 if (clear_flags && !(rec->e_flags & clear_flags)) {
5204 mlog(ML_ERROR, "Owner %llu tried to clear %d flags on an "
5205 "extent that didn't have them\n",
5206 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5207 clear_flags);
5208 goto out;
5209 }
5210
5211 memset(&split_rec, 0, sizeof(struct ocfs2_extent_rec));
5212 split_rec.e_cpos = cpu_to_le32(cpos);
5213 split_rec.e_leaf_clusters = cpu_to_le16(len);
5214 split_rec.e_blkno = cpu_to_le64(start_blkno);
5215 split_rec.e_flags = rec->e_flags;
5216 if (new_flags)
5217 split_rec.e_flags |= new_flags;
5218 if (clear_flags)
5219 split_rec.e_flags &= ~clear_flags;
5220
5221 ret = ocfs2_split_extent(handle, et, left_path,
5222 index, &split_rec, meta_ac,
5223 dealloc);
5224 if (ret)
5225 mlog_errno(ret);
5226
5227out:
5228 ocfs2_free_path(left_path);
5229 return ret;
5230
5231}
5232
5233/*
5234 * Mark the already-existing extent at cpos as written for len clusters.
5235 * This removes the unwritten extent flag.
5236 *
5237 * If the existing extent is larger than the request, initiate a
5238 * split. An attempt will be made at merging with adjacent extents.
5239 *
5240 * The caller is responsible for passing down meta_ac if we'll need it.
5241 */
5242int ocfs2_mark_extent_written(struct inode *inode,
5243 struct ocfs2_extent_tree *et,
5244 handle_t *handle, u32 cpos, u32 len, u32 phys,
5245 struct ocfs2_alloc_context *meta_ac,
5246 struct ocfs2_cached_dealloc_ctxt *dealloc)
5247{
5248 int ret;
5249
5250 trace_ocfs2_mark_extent_written(
5251 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5252 cpos, len, phys);
5253
5254 if (!ocfs2_writes_unwritten_extents(OCFS2_SB(inode->i_sb))) {
5255 ocfs2_error(inode->i_sb, "Inode %llu has unwritten extents that are being written to, but the feature bit is not set in the super block\n",
5256 (unsigned long long)OCFS2_I(inode)->ip_blkno);
5257 ret = -EROFS;
5258 goto out;
5259 }
5260
5261 /*
5262 * XXX: This should be fixed up so that we just re-insert the
5263 * next extent records.
5264 */
5265 ocfs2_et_extent_map_truncate(et, 0);
5266
5267 ret = ocfs2_change_extent_flag(handle, et, cpos,
5268 len, phys, meta_ac, dealloc,
5269 0, OCFS2_EXT_UNWRITTEN);
5270 if (ret)
5271 mlog_errno(ret);
5272
5273out:
5274 return ret;
5275}
5276
5277static int ocfs2_split_tree(handle_t *handle, struct ocfs2_extent_tree *et,
5278 struct ocfs2_path *path,
5279 int index, u32 new_range,
5280 struct ocfs2_alloc_context *meta_ac)
5281{
5282 int ret, depth, credits;
5283 struct buffer_head *last_eb_bh = NULL;
5284 struct ocfs2_extent_block *eb;
5285 struct ocfs2_extent_list *rightmost_el, *el;
5286 struct ocfs2_extent_rec split_rec;
5287 struct ocfs2_extent_rec *rec;
5288 struct ocfs2_insert_type insert;
5289
5290 /*
5291 * Setup the record to split before we grow the tree.
5292 */
5293 el = path_leaf_el(path);
5294 rec = &el->l_recs[index];
5295 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci),
5296 &split_rec, new_range, rec);
5297
5298 depth = path->p_tree_depth;
5299 if (depth > 0) {
5300 ret = ocfs2_read_extent_block(et->et_ci,
5301 ocfs2_et_get_last_eb_blk(et),
5302 &last_eb_bh);
5303 if (ret < 0) {
5304 mlog_errno(ret);
5305 goto out;
5306 }
5307
5308 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5309 rightmost_el = &eb->h_list;
5310 } else
5311 rightmost_el = path_leaf_el(path);
5312
5313 credits = path->p_tree_depth +
5314 ocfs2_extend_meta_needed(et->et_root_el);
5315 ret = ocfs2_extend_trans(handle, credits);
5316 if (ret) {
5317 mlog_errno(ret);
5318 goto out;
5319 }
5320
5321 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
5322 le16_to_cpu(rightmost_el->l_count)) {
5323 ret = ocfs2_grow_tree(handle, et, &depth, &last_eb_bh,
5324 meta_ac);
5325 if (ret) {
5326 mlog_errno(ret);
5327 goto out;
5328 }
5329 }
5330
5331 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
5332 insert.ins_appending = APPEND_NONE;
5333 insert.ins_contig = CONTIG_NONE;
5334 insert.ins_split = SPLIT_RIGHT;
5335 insert.ins_tree_depth = depth;
5336
5337 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
5338 if (ret)
5339 mlog_errno(ret);
5340
5341out:
5342 brelse(last_eb_bh);
5343 return ret;
5344}
5345
5346static int ocfs2_truncate_rec(handle_t *handle,
5347 struct ocfs2_extent_tree *et,
5348 struct ocfs2_path *path, int index,
5349 struct ocfs2_cached_dealloc_ctxt *dealloc,
5350 u32 cpos, u32 len)
5351{
5352 int ret;
5353 u32 left_cpos, rec_range, trunc_range;
5354 int is_rightmost_tree_rec = 0;
5355 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
5356 struct ocfs2_path *left_path = NULL;
5357 struct ocfs2_extent_list *el = path_leaf_el(path);
5358 struct ocfs2_extent_rec *rec;
5359 struct ocfs2_extent_block *eb;
5360
5361 if (ocfs2_is_empty_extent(&el->l_recs[0]) && index > 0) {
5362 /* extend credit for ocfs2_remove_rightmost_path */
5363 ret = ocfs2_extend_rotate_transaction(handle, 0,
5364 handle->h_buffer_credits,
5365 path);
5366 if (ret) {
5367 mlog_errno(ret);
5368 goto out;
5369 }
5370
5371 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
5372 if (ret) {
5373 mlog_errno(ret);
5374 goto out;
5375 }
5376
5377 index--;
5378 }
5379
5380 if (index == (le16_to_cpu(el->l_next_free_rec) - 1) &&
5381 path->p_tree_depth) {
5382 /*
5383 * Check whether this is the rightmost tree record. If
5384 * we remove all of this record or part of its right
5385 * edge then an update of the record lengths above it
5386 * will be required.
5387 */
5388 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
5389 if (eb->h_next_leaf_blk == 0)
5390 is_rightmost_tree_rec = 1;
5391 }
5392
5393 rec = &el->l_recs[index];
5394 if (index == 0 && path->p_tree_depth &&
5395 le32_to_cpu(rec->e_cpos) == cpos) {
5396 /*
5397 * Changing the leftmost offset (via partial or whole
5398 * record truncate) of an interior (or rightmost) path
5399 * means we have to update the subtree that is formed
5400 * by this leaf and the one to it's left.
5401 *
5402 * There are two cases we can skip:
5403 * 1) Path is the leftmost one in our btree.
5404 * 2) The leaf is rightmost and will be empty after
5405 * we remove the extent record - the rotate code
5406 * knows how to update the newly formed edge.
5407 */
5408
5409 ret = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos);
5410 if (ret) {
5411 mlog_errno(ret);
5412 goto out;
5413 }
5414
5415 if (left_cpos && le16_to_cpu(el->l_next_free_rec) > 1) {
5416 left_path = ocfs2_new_path_from_path(path);
5417 if (!left_path) {
5418 ret = -ENOMEM;
5419 mlog_errno(ret);
5420 goto out;
5421 }
5422
5423 ret = ocfs2_find_path(et->et_ci, left_path,
5424 left_cpos);
5425 if (ret) {
5426 mlog_errno(ret);
5427 goto out;
5428 }
5429 }
5430 }
5431
5432 ret = ocfs2_extend_rotate_transaction(handle, 0,
5433 handle->h_buffer_credits,
5434 path);
5435 if (ret) {
5436 mlog_errno(ret);
5437 goto out;
5438 }
5439
5440 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
5441 if (ret) {
5442 mlog_errno(ret);
5443 goto out;
5444 }
5445
5446 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
5447 if (ret) {
5448 mlog_errno(ret);
5449 goto out;
5450 }
5451
5452 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5453 trunc_range = cpos + len;
5454
5455 if (le32_to_cpu(rec->e_cpos) == cpos && rec_range == trunc_range) {
5456 int next_free;
5457
5458 memset(rec, 0, sizeof(*rec));
5459 ocfs2_cleanup_merge(el, index);
5460
5461 next_free = le16_to_cpu(el->l_next_free_rec);
5462 if (is_rightmost_tree_rec && next_free > 1) {
5463 /*
5464 * We skip the edge update if this path will
5465 * be deleted by the rotate code.
5466 */
5467 rec = &el->l_recs[next_free - 1];
5468 ocfs2_adjust_rightmost_records(handle, et, path,
5469 rec);
5470 }
5471 } else if (le32_to_cpu(rec->e_cpos) == cpos) {
5472 /* Remove leftmost portion of the record. */
5473 le32_add_cpu(&rec->e_cpos, len);
5474 le64_add_cpu(&rec->e_blkno, ocfs2_clusters_to_blocks(sb, len));
5475 le16_add_cpu(&rec->e_leaf_clusters, -len);
5476 } else if (rec_range == trunc_range) {
5477 /* Remove rightmost portion of the record */
5478 le16_add_cpu(&rec->e_leaf_clusters, -len);
5479 if (is_rightmost_tree_rec)
5480 ocfs2_adjust_rightmost_records(handle, et, path, rec);
5481 } else {
5482 /* Caller should have trapped this. */
5483 mlog(ML_ERROR, "Owner %llu: Invalid record truncate: (%u, %u) "
5484 "(%u, %u)\n",
5485 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5486 le32_to_cpu(rec->e_cpos),
5487 le16_to_cpu(rec->e_leaf_clusters), cpos, len);
5488 BUG();
5489 }
5490
5491 if (left_path) {
5492 int subtree_index;
5493
5494 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
5495 ocfs2_complete_edge_insert(handle, left_path, path,
5496 subtree_index);
5497 }
5498
5499 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5500
5501 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
5502 if (ret) {
5503 mlog_errno(ret);
5504 goto out;
5505 }
5506
5507out:
5508 ocfs2_free_path(left_path);
5509 return ret;
5510}
5511
5512int ocfs2_remove_extent(handle_t *handle,
5513 struct ocfs2_extent_tree *et,
5514 u32 cpos, u32 len,
5515 struct ocfs2_alloc_context *meta_ac,
5516 struct ocfs2_cached_dealloc_ctxt *dealloc)
5517{
5518 int ret, index;
5519 u32 rec_range, trunc_range;
5520 struct ocfs2_extent_rec *rec;
5521 struct ocfs2_extent_list *el;
5522 struct ocfs2_path *path = NULL;
5523
5524 /*
5525 * XXX: Why are we truncating to 0 instead of wherever this
5526 * affects us?
5527 */
5528 ocfs2_et_extent_map_truncate(et, 0);
5529
5530 path = ocfs2_new_path_from_et(et);
5531 if (!path) {
5532 ret = -ENOMEM;
5533 mlog_errno(ret);
5534 goto out;
5535 }
5536
5537 ret = ocfs2_find_path(et->et_ci, path, cpos);
5538 if (ret) {
5539 mlog_errno(ret);
5540 goto out;
5541 }
5542
5543 el = path_leaf_el(path);
5544 index = ocfs2_search_extent_list(el, cpos);
5545 if (index == -1) {
5546 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5547 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5548 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5549 cpos);
5550 ret = -EROFS;
5551 goto out;
5552 }
5553
5554 /*
5555 * We have 3 cases of extent removal:
5556 * 1) Range covers the entire extent rec
5557 * 2) Range begins or ends on one edge of the extent rec
5558 * 3) Range is in the middle of the extent rec (no shared edges)
5559 *
5560 * For case 1 we remove the extent rec and left rotate to
5561 * fill the hole.
5562 *
5563 * For case 2 we just shrink the existing extent rec, with a
5564 * tree update if the shrinking edge is also the edge of an
5565 * extent block.
5566 *
5567 * For case 3 we do a right split to turn the extent rec into
5568 * something case 2 can handle.
5569 */
5570 rec = &el->l_recs[index];
5571 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5572 trunc_range = cpos + len;
5573
5574 BUG_ON(cpos < le32_to_cpu(rec->e_cpos) || trunc_range > rec_range);
5575
5576 trace_ocfs2_remove_extent(
5577 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5578 cpos, len, index, le32_to_cpu(rec->e_cpos),
5579 ocfs2_rec_clusters(el, rec));
5580
5581 if (le32_to_cpu(rec->e_cpos) == cpos || rec_range == trunc_range) {
5582 ret = ocfs2_truncate_rec(handle, et, path, index, dealloc,
5583 cpos, len);
5584 if (ret) {
5585 mlog_errno(ret);
5586 goto out;
5587 }
5588 } else {
5589 ret = ocfs2_split_tree(handle, et, path, index,
5590 trunc_range, meta_ac);
5591 if (ret) {
5592 mlog_errno(ret);
5593 goto out;
5594 }
5595
5596 /*
5597 * The split could have manipulated the tree enough to
5598 * move the record location, so we have to look for it again.
5599 */
5600 ocfs2_reinit_path(path, 1);
5601
5602 ret = ocfs2_find_path(et->et_ci, path, cpos);
5603 if (ret) {
5604 mlog_errno(ret);
5605 goto out;
5606 }
5607
5608 el = path_leaf_el(path);
5609 index = ocfs2_search_extent_list(el, cpos);
5610 if (index == -1) {
5611 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5612 "Owner %llu: split at cpos %u lost record\n",
5613 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5614 cpos);
5615 ret = -EROFS;
5616 goto out;
5617 }
5618
5619 /*
5620 * Double check our values here. If anything is fishy,
5621 * it's easier to catch it at the top level.
5622 */
5623 rec = &el->l_recs[index];
5624 rec_range = le32_to_cpu(rec->e_cpos) +
5625 ocfs2_rec_clusters(el, rec);
5626 if (rec_range != trunc_range) {
5627 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5628 "Owner %llu: error after split at cpos %u trunc len %u, existing record is (%u,%u)\n",
5629 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5630 cpos, len, le32_to_cpu(rec->e_cpos),
5631 ocfs2_rec_clusters(el, rec));
5632 ret = -EROFS;
5633 goto out;
5634 }
5635
5636 ret = ocfs2_truncate_rec(handle, et, path, index, dealloc,
5637 cpos, len);
5638 if (ret) {
5639 mlog_errno(ret);
5640 goto out;
5641 }
5642 }
5643
5644out:
5645 ocfs2_free_path(path);
5646 return ret;
5647}
5648
5649/*
5650 * ocfs2_reserve_blocks_for_rec_trunc() would look basically the
5651 * same as ocfs2_lock_alloctors(), except for it accepts a blocks
5652 * number to reserve some extra blocks, and it only handles meta
5653 * data allocations.
5654 *
5655 * Currently, only ocfs2_remove_btree_range() uses it for truncating
5656 * and punching holes.
5657 */
5658static int ocfs2_reserve_blocks_for_rec_trunc(struct inode *inode,
5659 struct ocfs2_extent_tree *et,
5660 u32 extents_to_split,
5661 struct ocfs2_alloc_context **ac,
5662 int extra_blocks)
5663{
5664 int ret = 0, num_free_extents;
5665 unsigned int max_recs_needed = 2 * extents_to_split;
5666 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5667
5668 *ac = NULL;
5669
5670 num_free_extents = ocfs2_num_free_extents(osb, et);
5671 if (num_free_extents < 0) {
5672 ret = num_free_extents;
5673 mlog_errno(ret);
5674 goto out;
5675 }
5676
5677 if (!num_free_extents ||
5678 (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed))
5679 extra_blocks += ocfs2_extend_meta_needed(et->et_root_el);
5680
5681 if (extra_blocks) {
5682 ret = ocfs2_reserve_new_metadata_blocks(osb, extra_blocks, ac);
5683 if (ret < 0) {
5684 if (ret != -ENOSPC)
5685 mlog_errno(ret);
5686 goto out;
5687 }
5688 }
5689
5690out:
5691 if (ret) {
5692 if (*ac) {
5693 ocfs2_free_alloc_context(*ac);
5694 *ac = NULL;
5695 }
5696 }
5697
5698 return ret;
5699}
5700
5701int ocfs2_remove_btree_range(struct inode *inode,
5702 struct ocfs2_extent_tree *et,
5703 u32 cpos, u32 phys_cpos, u32 len, int flags,
5704 struct ocfs2_cached_dealloc_ctxt *dealloc,
5705 u64 refcount_loc, bool refcount_tree_locked)
5706{
5707 int ret, credits = 0, extra_blocks = 0;
5708 u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
5709 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5710 struct inode *tl_inode = osb->osb_tl_inode;
5711 handle_t *handle;
5712 struct ocfs2_alloc_context *meta_ac = NULL;
5713 struct ocfs2_refcount_tree *ref_tree = NULL;
5714
5715 if ((flags & OCFS2_EXT_REFCOUNTED) && len) {
5716 BUG_ON(!ocfs2_is_refcount_inode(inode));
5717
5718 if (!refcount_tree_locked) {
5719 ret = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
5720 &ref_tree, NULL);
5721 if (ret) {
5722 mlog_errno(ret);
5723 goto bail;
5724 }
5725 }
5726
5727 ret = ocfs2_prepare_refcount_change_for_del(inode,
5728 refcount_loc,
5729 phys_blkno,
5730 len,
5731 &credits,
5732 &extra_blocks);
5733 if (ret < 0) {
5734 mlog_errno(ret);
5735 goto bail;
5736 }
5737 }
5738
5739 ret = ocfs2_reserve_blocks_for_rec_trunc(inode, et, 1, &meta_ac,
5740 extra_blocks);
5741 if (ret) {
5742 mlog_errno(ret);
5743 goto bail;
5744 }
5745
5746 inode_lock(tl_inode);
5747
5748 if (ocfs2_truncate_log_needs_flush(osb)) {
5749 ret = __ocfs2_flush_truncate_log(osb);
5750 if (ret < 0) {
5751 mlog_errno(ret);
5752 goto out;
5753 }
5754 }
5755
5756 handle = ocfs2_start_trans(osb,
5757 ocfs2_remove_extent_credits(osb->sb) + credits);
5758 if (IS_ERR(handle)) {
5759 ret = PTR_ERR(handle);
5760 mlog_errno(ret);
5761 goto out;
5762 }
5763
5764 ret = ocfs2_et_root_journal_access(handle, et,
5765 OCFS2_JOURNAL_ACCESS_WRITE);
5766 if (ret) {
5767 mlog_errno(ret);
5768 goto out_commit;
5769 }
5770
5771 dquot_free_space_nodirty(inode,
5772 ocfs2_clusters_to_bytes(inode->i_sb, len));
5773
5774 ret = ocfs2_remove_extent(handle, et, cpos, len, meta_ac, dealloc);
5775 if (ret) {
5776 mlog_errno(ret);
5777 goto out_commit;
5778 }
5779
5780 ocfs2_et_update_clusters(et, -len);
5781 ocfs2_update_inode_fsync_trans(handle, inode, 1);
5782
5783 ocfs2_journal_dirty(handle, et->et_root_bh);
5784
5785 if (phys_blkno) {
5786 if (flags & OCFS2_EXT_REFCOUNTED)
5787 ret = ocfs2_decrease_refcount(inode, handle,
5788 ocfs2_blocks_to_clusters(osb->sb,
5789 phys_blkno),
5790 len, meta_ac,
5791 dealloc, 1);
5792 else
5793 ret = ocfs2_truncate_log_append(osb, handle,
5794 phys_blkno, len);
5795 if (ret)
5796 mlog_errno(ret);
5797
5798 }
5799
5800out_commit:
5801 ocfs2_commit_trans(osb, handle);
5802out:
5803 inode_unlock(tl_inode);
5804bail:
5805 if (meta_ac)
5806 ocfs2_free_alloc_context(meta_ac);
5807
5808 if (ref_tree)
5809 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
5810
5811 return ret;
5812}
5813
5814int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb)
5815{
5816 struct buffer_head *tl_bh = osb->osb_tl_bh;
5817 struct ocfs2_dinode *di;
5818 struct ocfs2_truncate_log *tl;
5819
5820 di = (struct ocfs2_dinode *) tl_bh->b_data;
5821 tl = &di->id2.i_dealloc;
5822
5823 mlog_bug_on_msg(le16_to_cpu(tl->tl_used) > le16_to_cpu(tl->tl_count),
5824 "slot %d, invalid truncate log parameters: used = "
5825 "%u, count = %u\n", osb->slot_num,
5826 le16_to_cpu(tl->tl_used), le16_to_cpu(tl->tl_count));
5827 return le16_to_cpu(tl->tl_used) == le16_to_cpu(tl->tl_count);
5828}
5829
5830static int ocfs2_truncate_log_can_coalesce(struct ocfs2_truncate_log *tl,
5831 unsigned int new_start)
5832{
5833 unsigned int tail_index;
5834 unsigned int current_tail;
5835
5836 /* No records, nothing to coalesce */
5837 if (!le16_to_cpu(tl->tl_used))
5838 return 0;
5839
5840 tail_index = le16_to_cpu(tl->tl_used) - 1;
5841 current_tail = le32_to_cpu(tl->tl_recs[tail_index].t_start);
5842 current_tail += le32_to_cpu(tl->tl_recs[tail_index].t_clusters);
5843
5844 return current_tail == new_start;
5845}
5846
5847int ocfs2_truncate_log_append(struct ocfs2_super *osb,
5848 handle_t *handle,
5849 u64 start_blk,
5850 unsigned int num_clusters)
5851{
5852 int status, index;
5853 unsigned int start_cluster, tl_count;
5854 struct inode *tl_inode = osb->osb_tl_inode;
5855 struct buffer_head *tl_bh = osb->osb_tl_bh;
5856 struct ocfs2_dinode *di;
5857 struct ocfs2_truncate_log *tl;
5858
5859 BUG_ON(inode_trylock(tl_inode));
5860
5861 start_cluster = ocfs2_blocks_to_clusters(osb->sb, start_blk);
5862
5863 di = (struct ocfs2_dinode *) tl_bh->b_data;
5864
5865 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5866 * by the underlying call to ocfs2_read_inode_block(), so any
5867 * corruption is a code bug */
5868 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
5869
5870 tl = &di->id2.i_dealloc;
5871 tl_count = le16_to_cpu(tl->tl_count);
5872 mlog_bug_on_msg(tl_count > ocfs2_truncate_recs_per_inode(osb->sb) ||
5873 tl_count == 0,
5874 "Truncate record count on #%llu invalid "
5875 "wanted %u, actual %u\n",
5876 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5877 ocfs2_truncate_recs_per_inode(osb->sb),
5878 le16_to_cpu(tl->tl_count));
5879
5880 /* Caller should have known to flush before calling us. */
5881 index = le16_to_cpu(tl->tl_used);
5882 if (index >= tl_count) {
5883 status = -ENOSPC;
5884 mlog_errno(status);
5885 goto bail;
5886 }
5887
5888 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5889 OCFS2_JOURNAL_ACCESS_WRITE);
5890 if (status < 0) {
5891 mlog_errno(status);
5892 goto bail;
5893 }
5894
5895 trace_ocfs2_truncate_log_append(
5896 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, index,
5897 start_cluster, num_clusters);
5898 if (ocfs2_truncate_log_can_coalesce(tl, start_cluster)) {
5899 /*
5900 * Move index back to the record we are coalescing with.
5901 * ocfs2_truncate_log_can_coalesce() guarantees nonzero
5902 */
5903 index--;
5904
5905 num_clusters += le32_to_cpu(tl->tl_recs[index].t_clusters);
5906 trace_ocfs2_truncate_log_append(
5907 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5908 index, le32_to_cpu(tl->tl_recs[index].t_start),
5909 num_clusters);
5910 } else {
5911 tl->tl_recs[index].t_start = cpu_to_le32(start_cluster);
5912 tl->tl_used = cpu_to_le16(index + 1);
5913 }
5914 tl->tl_recs[index].t_clusters = cpu_to_le32(num_clusters);
5915
5916 ocfs2_journal_dirty(handle, tl_bh);
5917
5918 osb->truncated_clusters += num_clusters;
5919bail:
5920 return status;
5921}
5922
5923static int ocfs2_replay_truncate_records(struct ocfs2_super *osb,
5924 struct inode *data_alloc_inode,
5925 struct buffer_head *data_alloc_bh)
5926{
5927 int status = 0;
5928 int i;
5929 unsigned int num_clusters;
5930 u64 start_blk;
5931 struct ocfs2_truncate_rec rec;
5932 struct ocfs2_dinode *di;
5933 struct ocfs2_truncate_log *tl;
5934 struct inode *tl_inode = osb->osb_tl_inode;
5935 struct buffer_head *tl_bh = osb->osb_tl_bh;
5936 handle_t *handle;
5937
5938 di = (struct ocfs2_dinode *) tl_bh->b_data;
5939 tl = &di->id2.i_dealloc;
5940 i = le16_to_cpu(tl->tl_used) - 1;
5941 while (i >= 0) {
5942 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC);
5943 if (IS_ERR(handle)) {
5944 status = PTR_ERR(handle);
5945 mlog_errno(status);
5946 goto bail;
5947 }
5948
5949 /* Caller has given us at least enough credits to
5950 * update the truncate log dinode */
5951 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5952 OCFS2_JOURNAL_ACCESS_WRITE);
5953 if (status < 0) {
5954 mlog_errno(status);
5955 goto bail;
5956 }
5957
5958 tl->tl_used = cpu_to_le16(i);
5959
5960 ocfs2_journal_dirty(handle, tl_bh);
5961
5962 rec = tl->tl_recs[i];
5963 start_blk = ocfs2_clusters_to_blocks(data_alloc_inode->i_sb,
5964 le32_to_cpu(rec.t_start));
5965 num_clusters = le32_to_cpu(rec.t_clusters);
5966
5967 /* if start_blk is not set, we ignore the record as
5968 * invalid. */
5969 if (start_blk) {
5970 trace_ocfs2_replay_truncate_records(
5971 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5972 i, le32_to_cpu(rec.t_start), num_clusters);
5973
5974 status = ocfs2_free_clusters(handle, data_alloc_inode,
5975 data_alloc_bh, start_blk,
5976 num_clusters);
5977 if (status < 0) {
5978 mlog_errno(status);
5979 goto bail;
5980 }
5981 }
5982
5983 ocfs2_commit_trans(osb, handle);
5984 i--;
5985 }
5986
5987 osb->truncated_clusters = 0;
5988
5989bail:
5990 return status;
5991}
5992
5993/* Expects you to already be holding tl_inode->i_mutex */
5994int __ocfs2_flush_truncate_log(struct ocfs2_super *osb)
5995{
5996 int status;
5997 unsigned int num_to_flush;
5998 struct inode *tl_inode = osb->osb_tl_inode;
5999 struct inode *data_alloc_inode = NULL;
6000 struct buffer_head *tl_bh = osb->osb_tl_bh;
6001 struct buffer_head *data_alloc_bh = NULL;
6002 struct ocfs2_dinode *di;
6003 struct ocfs2_truncate_log *tl;
6004
6005 BUG_ON(inode_trylock(tl_inode));
6006
6007 di = (struct ocfs2_dinode *) tl_bh->b_data;
6008
6009 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
6010 * by the underlying call to ocfs2_read_inode_block(), so any
6011 * corruption is a code bug */
6012 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
6013
6014 tl = &di->id2.i_dealloc;
6015 num_to_flush = le16_to_cpu(tl->tl_used);
6016 trace_ocfs2_flush_truncate_log(
6017 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
6018 num_to_flush);
6019 if (!num_to_flush) {
6020 status = 0;
6021 goto out;
6022 }
6023
6024 data_alloc_inode = ocfs2_get_system_file_inode(osb,
6025 GLOBAL_BITMAP_SYSTEM_INODE,
6026 OCFS2_INVALID_SLOT);
6027 if (!data_alloc_inode) {
6028 status = -EINVAL;
6029 mlog(ML_ERROR, "Could not get bitmap inode!\n");
6030 goto out;
6031 }
6032
6033 inode_lock(data_alloc_inode);
6034
6035 status = ocfs2_inode_lock(data_alloc_inode, &data_alloc_bh, 1);
6036 if (status < 0) {
6037 mlog_errno(status);
6038 goto out_mutex;
6039 }
6040
6041 status = ocfs2_replay_truncate_records(osb, data_alloc_inode,
6042 data_alloc_bh);
6043 if (status < 0)
6044 mlog_errno(status);
6045
6046 brelse(data_alloc_bh);
6047 ocfs2_inode_unlock(data_alloc_inode, 1);
6048
6049out_mutex:
6050 inode_unlock(data_alloc_inode);
6051 iput(data_alloc_inode);
6052
6053out:
6054 return status;
6055}
6056
6057int ocfs2_flush_truncate_log(struct ocfs2_super *osb)
6058{
6059 int status;
6060 struct inode *tl_inode = osb->osb_tl_inode;
6061
6062 inode_lock(tl_inode);
6063 status = __ocfs2_flush_truncate_log(osb);
6064 inode_unlock(tl_inode);
6065
6066 return status;
6067}
6068
6069static void ocfs2_truncate_log_worker(struct work_struct *work)
6070{
6071 int status;
6072 struct ocfs2_super *osb =
6073 container_of(work, struct ocfs2_super,
6074 osb_truncate_log_wq.work);
6075
6076 status = ocfs2_flush_truncate_log(osb);
6077 if (status < 0)
6078 mlog_errno(status);
6079 else
6080 ocfs2_init_steal_slots(osb);
6081}
6082
6083#define OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL (2 * HZ)
6084void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
6085 int cancel)
6086{
6087 if (osb->osb_tl_inode &&
6088 atomic_read(&osb->osb_tl_disable) == 0) {
6089 /* We want to push off log flushes while truncates are
6090 * still running. */
6091 if (cancel)
6092 cancel_delayed_work(&osb->osb_truncate_log_wq);
6093
6094 queue_delayed_work(osb->ocfs2_wq, &osb->osb_truncate_log_wq,
6095 OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL);
6096 }
6097}
6098
6099/*
6100 * Try to flush truncate logs if we can free enough clusters from it.
6101 * As for return value, "< 0" means error, "0" no space and "1" means
6102 * we have freed enough spaces and let the caller try to allocate again.
6103 */
6104int ocfs2_try_to_free_truncate_log(struct ocfs2_super *osb,
6105 unsigned int needed)
6106{
6107 tid_t target;
6108 int ret = 0;
6109 unsigned int truncated_clusters;
6110
6111 inode_lock(osb->osb_tl_inode);
6112 truncated_clusters = osb->truncated_clusters;
6113 inode_unlock(osb->osb_tl_inode);
6114
6115 /*
6116 * Check whether we can succeed in allocating if we free
6117 * the truncate log.
6118 */
6119 if (truncated_clusters < needed)
6120 goto out;
6121
6122 ret = ocfs2_flush_truncate_log(osb);
6123 if (ret) {
6124 mlog_errno(ret);
6125 goto out;
6126 }
6127
6128 if (jbd2_journal_start_commit(osb->journal->j_journal, &target)) {
6129 jbd2_log_wait_commit(osb->journal->j_journal, target);
6130 ret = 1;
6131 }
6132out:
6133 return ret;
6134}
6135
6136static int ocfs2_get_truncate_log_info(struct ocfs2_super *osb,
6137 int slot_num,
6138 struct inode **tl_inode,
6139 struct buffer_head **tl_bh)
6140{
6141 int status;
6142 struct inode *inode = NULL;
6143 struct buffer_head *bh = NULL;
6144
6145 inode = ocfs2_get_system_file_inode(osb,
6146 TRUNCATE_LOG_SYSTEM_INODE,
6147 slot_num);
6148 if (!inode) {
6149 status = -EINVAL;
6150 mlog(ML_ERROR, "Could not get load truncate log inode!\n");
6151 goto bail;
6152 }
6153
6154 status = ocfs2_read_inode_block(inode, &bh);
6155 if (status < 0) {
6156 iput(inode);
6157 mlog_errno(status);
6158 goto bail;
6159 }
6160
6161 *tl_inode = inode;
6162 *tl_bh = bh;
6163bail:
6164 return status;
6165}
6166
6167/* called during the 1st stage of node recovery. we stamp a clean
6168 * truncate log and pass back a copy for processing later. if the
6169 * truncate log does not require processing, a *tl_copy is set to
6170 * NULL. */
6171int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
6172 int slot_num,
6173 struct ocfs2_dinode **tl_copy)
6174{
6175 int status;
6176 struct inode *tl_inode = NULL;
6177 struct buffer_head *tl_bh = NULL;
6178 struct ocfs2_dinode *di;
6179 struct ocfs2_truncate_log *tl;
6180
6181 *tl_copy = NULL;
6182
6183 trace_ocfs2_begin_truncate_log_recovery(slot_num);
6184
6185 status = ocfs2_get_truncate_log_info(osb, slot_num, &tl_inode, &tl_bh);
6186 if (status < 0) {
6187 mlog_errno(status);
6188 goto bail;
6189 }
6190
6191 di = (struct ocfs2_dinode *) tl_bh->b_data;
6192
6193 /* tl_bh is loaded from ocfs2_get_truncate_log_info(). It's
6194 * validated by the underlying call to ocfs2_read_inode_block(),
6195 * so any corruption is a code bug */
6196 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
6197
6198 tl = &di->id2.i_dealloc;
6199 if (le16_to_cpu(tl->tl_used)) {
6200 trace_ocfs2_truncate_log_recovery_num(le16_to_cpu(tl->tl_used));
6201
6202 *tl_copy = kmalloc(tl_bh->b_size, GFP_KERNEL);
6203 if (!(*tl_copy)) {
6204 status = -ENOMEM;
6205 mlog_errno(status);
6206 goto bail;
6207 }
6208
6209 /* Assuming the write-out below goes well, this copy
6210 * will be passed back to recovery for processing. */
6211 memcpy(*tl_copy, tl_bh->b_data, tl_bh->b_size);
6212
6213 /* All we need to do to clear the truncate log is set
6214 * tl_used. */
6215 tl->tl_used = 0;
6216
6217 ocfs2_compute_meta_ecc(osb->sb, tl_bh->b_data, &di->i_check);
6218 status = ocfs2_write_block(osb, tl_bh, INODE_CACHE(tl_inode));
6219 if (status < 0) {
6220 mlog_errno(status);
6221 goto bail;
6222 }
6223 }
6224
6225bail:
6226 iput(tl_inode);
6227 brelse(tl_bh);
6228
6229 if (status < 0) {
6230 kfree(*tl_copy);
6231 *tl_copy = NULL;
6232 mlog_errno(status);
6233 }
6234
6235 return status;
6236}
6237
6238int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
6239 struct ocfs2_dinode *tl_copy)
6240{
6241 int status = 0;
6242 int i;
6243 unsigned int clusters, num_recs, start_cluster;
6244 u64 start_blk;
6245 handle_t *handle;
6246 struct inode *tl_inode = osb->osb_tl_inode;
6247 struct ocfs2_truncate_log *tl;
6248
6249 if (OCFS2_I(tl_inode)->ip_blkno == le64_to_cpu(tl_copy->i_blkno)) {
6250 mlog(ML_ERROR, "Asked to recover my own truncate log!\n");
6251 return -EINVAL;
6252 }
6253
6254 tl = &tl_copy->id2.i_dealloc;
6255 num_recs = le16_to_cpu(tl->tl_used);
6256 trace_ocfs2_complete_truncate_log_recovery(
6257 (unsigned long long)le64_to_cpu(tl_copy->i_blkno),
6258 num_recs);
6259
6260 inode_lock(tl_inode);
6261 for(i = 0; i < num_recs; i++) {
6262 if (ocfs2_truncate_log_needs_flush(osb)) {
6263 status = __ocfs2_flush_truncate_log(osb);
6264 if (status < 0) {
6265 mlog_errno(status);
6266 goto bail_up;
6267 }
6268 }
6269
6270 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6271 if (IS_ERR(handle)) {
6272 status = PTR_ERR(handle);
6273 mlog_errno(status);
6274 goto bail_up;
6275 }
6276
6277 clusters = le32_to_cpu(tl->tl_recs[i].t_clusters);
6278 start_cluster = le32_to_cpu(tl->tl_recs[i].t_start);
6279 start_blk = ocfs2_clusters_to_blocks(osb->sb, start_cluster);
6280
6281 status = ocfs2_truncate_log_append(osb, handle,
6282 start_blk, clusters);
6283 ocfs2_commit_trans(osb, handle);
6284 if (status < 0) {
6285 mlog_errno(status);
6286 goto bail_up;
6287 }
6288 }
6289
6290bail_up:
6291 inode_unlock(tl_inode);
6292
6293 return status;
6294}
6295
6296void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb)
6297{
6298 int status;
6299 struct inode *tl_inode = osb->osb_tl_inode;
6300
6301 atomic_set(&osb->osb_tl_disable, 1);
6302
6303 if (tl_inode) {
6304 cancel_delayed_work(&osb->osb_truncate_log_wq);
6305 flush_workqueue(osb->ocfs2_wq);
6306
6307 status = ocfs2_flush_truncate_log(osb);
6308 if (status < 0)
6309 mlog_errno(status);
6310
6311 brelse(osb->osb_tl_bh);
6312 iput(osb->osb_tl_inode);
6313 }
6314}
6315
6316int ocfs2_truncate_log_init(struct ocfs2_super *osb)
6317{
6318 int status;
6319 struct inode *tl_inode = NULL;
6320 struct buffer_head *tl_bh = NULL;
6321
6322 status = ocfs2_get_truncate_log_info(osb,
6323 osb->slot_num,
6324 &tl_inode,
6325 &tl_bh);
6326 if (status < 0)
6327 mlog_errno(status);
6328
6329 /* ocfs2_truncate_log_shutdown keys on the existence of
6330 * osb->osb_tl_inode so we don't set any of the osb variables
6331 * until we're sure all is well. */
6332 INIT_DELAYED_WORK(&osb->osb_truncate_log_wq,
6333 ocfs2_truncate_log_worker);
6334 atomic_set(&osb->osb_tl_disable, 0);
6335 osb->osb_tl_bh = tl_bh;
6336 osb->osb_tl_inode = tl_inode;
6337
6338 return status;
6339}
6340
6341/*
6342 * Delayed de-allocation of suballocator blocks.
6343 *
6344 * Some sets of block de-allocations might involve multiple suballocator inodes.
6345 *
6346 * The locking for this can get extremely complicated, especially when
6347 * the suballocator inodes to delete from aren't known until deep
6348 * within an unrelated codepath.
6349 *
6350 * ocfs2_extent_block structures are a good example of this - an inode
6351 * btree could have been grown by any number of nodes each allocating
6352 * out of their own suballoc inode.
6353 *
6354 * These structures allow the delay of block de-allocation until a
6355 * later time, when locking of multiple cluster inodes won't cause
6356 * deadlock.
6357 */
6358
6359/*
6360 * Describe a single bit freed from a suballocator. For the block
6361 * suballocators, it represents one block. For the global cluster
6362 * allocator, it represents some clusters and free_bit indicates
6363 * clusters number.
6364 */
6365struct ocfs2_cached_block_free {
6366 struct ocfs2_cached_block_free *free_next;
6367 u64 free_bg;
6368 u64 free_blk;
6369 unsigned int free_bit;
6370};
6371
6372struct ocfs2_per_slot_free_list {
6373 struct ocfs2_per_slot_free_list *f_next_suballocator;
6374 int f_inode_type;
6375 int f_slot;
6376 struct ocfs2_cached_block_free *f_first;
6377};
6378
6379static int ocfs2_free_cached_blocks(struct ocfs2_super *osb,
6380 int sysfile_type,
6381 int slot,
6382 struct ocfs2_cached_block_free *head)
6383{
6384 int ret;
6385 u64 bg_blkno;
6386 handle_t *handle;
6387 struct inode *inode;
6388 struct buffer_head *di_bh = NULL;
6389 struct ocfs2_cached_block_free *tmp;
6390
6391 inode = ocfs2_get_system_file_inode(osb, sysfile_type, slot);
6392 if (!inode) {
6393 ret = -EINVAL;
6394 mlog_errno(ret);
6395 goto out;
6396 }
6397
6398 inode_lock(inode);
6399
6400 ret = ocfs2_inode_lock(inode, &di_bh, 1);
6401 if (ret) {
6402 mlog_errno(ret);
6403 goto out_mutex;
6404 }
6405
6406 while (head) {
6407 if (head->free_bg)
6408 bg_blkno = head->free_bg;
6409 else
6410 bg_blkno = ocfs2_which_suballoc_group(head->free_blk,
6411 head->free_bit);
6412 handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
6413 if (IS_ERR(handle)) {
6414 ret = PTR_ERR(handle);
6415 mlog_errno(ret);
6416 goto out_unlock;
6417 }
6418
6419 trace_ocfs2_free_cached_blocks(
6420 (unsigned long long)head->free_blk, head->free_bit);
6421
6422 ret = ocfs2_free_suballoc_bits(handle, inode, di_bh,
6423 head->free_bit, bg_blkno, 1);
6424 if (ret)
6425 mlog_errno(ret);
6426
6427 ocfs2_commit_trans(osb, handle);
6428
6429 tmp = head;
6430 head = head->free_next;
6431 kfree(tmp);
6432 }
6433
6434out_unlock:
6435 ocfs2_inode_unlock(inode, 1);
6436 brelse(di_bh);
6437out_mutex:
6438 inode_unlock(inode);
6439 iput(inode);
6440out:
6441 while(head) {
6442 /* Premature exit may have left some dangling items. */
6443 tmp = head;
6444 head = head->free_next;
6445 kfree(tmp);
6446 }
6447
6448 return ret;
6449}
6450
6451int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6452 u64 blkno, unsigned int bit)
6453{
6454 int ret = 0;
6455 struct ocfs2_cached_block_free *item;
6456
6457 item = kzalloc(sizeof(*item), GFP_NOFS);
6458 if (item == NULL) {
6459 ret = -ENOMEM;
6460 mlog_errno(ret);
6461 return ret;
6462 }
6463
6464 trace_ocfs2_cache_cluster_dealloc((unsigned long long)blkno, bit);
6465
6466 item->free_blk = blkno;
6467 item->free_bit = bit;
6468 item->free_next = ctxt->c_global_allocator;
6469
6470 ctxt->c_global_allocator = item;
6471 return ret;
6472}
6473
6474static int ocfs2_free_cached_clusters(struct ocfs2_super *osb,
6475 struct ocfs2_cached_block_free *head)
6476{
6477 struct ocfs2_cached_block_free *tmp;
6478 struct inode *tl_inode = osb->osb_tl_inode;
6479 handle_t *handle;
6480 int ret = 0;
6481
6482 inode_lock(tl_inode);
6483
6484 while (head) {
6485 if (ocfs2_truncate_log_needs_flush(osb)) {
6486 ret = __ocfs2_flush_truncate_log(osb);
6487 if (ret < 0) {
6488 mlog_errno(ret);
6489 break;
6490 }
6491 }
6492
6493 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6494 if (IS_ERR(handle)) {
6495 ret = PTR_ERR(handle);
6496 mlog_errno(ret);
6497 break;
6498 }
6499
6500 ret = ocfs2_truncate_log_append(osb, handle, head->free_blk,
6501 head->free_bit);
6502
6503 ocfs2_commit_trans(osb, handle);
6504 tmp = head;
6505 head = head->free_next;
6506 kfree(tmp);
6507
6508 if (ret < 0) {
6509 mlog_errno(ret);
6510 break;
6511 }
6512 }
6513
6514 inode_unlock(tl_inode);
6515
6516 while (head) {
6517 /* Premature exit may have left some dangling items. */
6518 tmp = head;
6519 head = head->free_next;
6520 kfree(tmp);
6521 }
6522
6523 return ret;
6524}
6525
6526int ocfs2_run_deallocs(struct ocfs2_super *osb,
6527 struct ocfs2_cached_dealloc_ctxt *ctxt)
6528{
6529 int ret = 0, ret2;
6530 struct ocfs2_per_slot_free_list *fl;
6531
6532 if (!ctxt)
6533 return 0;
6534
6535 while (ctxt->c_first_suballocator) {
6536 fl = ctxt->c_first_suballocator;
6537
6538 if (fl->f_first) {
6539 trace_ocfs2_run_deallocs(fl->f_inode_type,
6540 fl->f_slot);
6541 ret2 = ocfs2_free_cached_blocks(osb,
6542 fl->f_inode_type,
6543 fl->f_slot,
6544 fl->f_first);
6545 if (ret2)
6546 mlog_errno(ret2);
6547 if (!ret)
6548 ret = ret2;
6549 }
6550
6551 ctxt->c_first_suballocator = fl->f_next_suballocator;
6552 kfree(fl);
6553 }
6554
6555 if (ctxt->c_global_allocator) {
6556 ret2 = ocfs2_free_cached_clusters(osb,
6557 ctxt->c_global_allocator);
6558 if (ret2)
6559 mlog_errno(ret2);
6560 if (!ret)
6561 ret = ret2;
6562
6563 ctxt->c_global_allocator = NULL;
6564 }
6565
6566 return ret;
6567}
6568
6569static struct ocfs2_per_slot_free_list *
6570ocfs2_find_per_slot_free_list(int type,
6571 int slot,
6572 struct ocfs2_cached_dealloc_ctxt *ctxt)
6573{
6574 struct ocfs2_per_slot_free_list *fl = ctxt->c_first_suballocator;
6575
6576 while (fl) {
6577 if (fl->f_inode_type == type && fl->f_slot == slot)
6578 return fl;
6579
6580 fl = fl->f_next_suballocator;
6581 }
6582
6583 fl = kmalloc(sizeof(*fl), GFP_NOFS);
6584 if (fl) {
6585 fl->f_inode_type = type;
6586 fl->f_slot = slot;
6587 fl->f_first = NULL;
6588 fl->f_next_suballocator = ctxt->c_first_suballocator;
6589
6590 ctxt->c_first_suballocator = fl;
6591 }
6592 return fl;
6593}
6594
6595int ocfs2_cache_block_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6596 int type, int slot, u64 suballoc,
6597 u64 blkno, unsigned int bit)
6598{
6599 int ret;
6600 struct ocfs2_per_slot_free_list *fl;
6601 struct ocfs2_cached_block_free *item;
6602
6603 fl = ocfs2_find_per_slot_free_list(type, slot, ctxt);
6604 if (fl == NULL) {
6605 ret = -ENOMEM;
6606 mlog_errno(ret);
6607 goto out;
6608 }
6609
6610 item = kzalloc(sizeof(*item), GFP_NOFS);
6611 if (item == NULL) {
6612 ret = -ENOMEM;
6613 mlog_errno(ret);
6614 goto out;
6615 }
6616
6617 trace_ocfs2_cache_block_dealloc(type, slot,
6618 (unsigned long long)suballoc,
6619 (unsigned long long)blkno, bit);
6620
6621 item->free_bg = suballoc;
6622 item->free_blk = blkno;
6623 item->free_bit = bit;
6624 item->free_next = fl->f_first;
6625
6626 fl->f_first = item;
6627
6628 ret = 0;
6629out:
6630 return ret;
6631}
6632
6633static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
6634 struct ocfs2_extent_block *eb)
6635{
6636 return ocfs2_cache_block_dealloc(ctxt, EXTENT_ALLOC_SYSTEM_INODE,
6637 le16_to_cpu(eb->h_suballoc_slot),
6638 le64_to_cpu(eb->h_suballoc_loc),
6639 le64_to_cpu(eb->h_blkno),
6640 le16_to_cpu(eb->h_suballoc_bit));
6641}
6642
6643static int ocfs2_zero_func(handle_t *handle, struct buffer_head *bh)
6644{
6645 set_buffer_uptodate(bh);
6646 mark_buffer_dirty(bh);
6647 return 0;
6648}
6649
6650void ocfs2_map_and_dirty_page(struct inode *inode, handle_t *handle,
6651 unsigned int from, unsigned int to,
6652 struct page *page, int zero, u64 *phys)
6653{
6654 int ret, partial = 0;
6655
6656 ret = ocfs2_map_page_blocks(page, phys, inode, from, to, 0);
6657 if (ret)
6658 mlog_errno(ret);
6659
6660 if (zero)
6661 zero_user_segment(page, from, to);
6662
6663 /*
6664 * Need to set the buffers we zero'd into uptodate
6665 * here if they aren't - ocfs2_map_page_blocks()
6666 * might've skipped some
6667 */
6668 ret = walk_page_buffers(handle, page_buffers(page),
6669 from, to, &partial,
6670 ocfs2_zero_func);
6671 if (ret < 0)
6672 mlog_errno(ret);
6673 else if (ocfs2_should_order_data(inode)) {
6674 ret = ocfs2_jbd2_file_inode(handle, inode);
6675 if (ret < 0)
6676 mlog_errno(ret);
6677 }
6678
6679 if (!partial)
6680 SetPageUptodate(page);
6681
6682 flush_dcache_page(page);
6683}
6684
6685static void ocfs2_zero_cluster_pages(struct inode *inode, loff_t start,
6686 loff_t end, struct page **pages,
6687 int numpages, u64 phys, handle_t *handle)
6688{
6689 int i;
6690 struct page *page;
6691 unsigned int from, to = PAGE_SIZE;
6692 struct super_block *sb = inode->i_sb;
6693
6694 BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(sb)));
6695
6696 if (numpages == 0)
6697 goto out;
6698
6699 to = PAGE_SIZE;
6700 for(i = 0; i < numpages; i++) {
6701 page = pages[i];
6702
6703 from = start & (PAGE_SIZE - 1);
6704 if ((end >> PAGE_SHIFT) == page->index)
6705 to = end & (PAGE_SIZE - 1);
6706
6707 BUG_ON(from > PAGE_SIZE);
6708 BUG_ON(to > PAGE_SIZE);
6709
6710 ocfs2_map_and_dirty_page(inode, handle, from, to, page, 1,
6711 &phys);
6712
6713 start = (page->index + 1) << PAGE_SHIFT;
6714 }
6715out:
6716 if (pages)
6717 ocfs2_unlock_and_free_pages(pages, numpages);
6718}
6719
6720int ocfs2_grab_pages(struct inode *inode, loff_t start, loff_t end,
6721 struct page **pages, int *num)
6722{
6723 int numpages, ret = 0;
6724 struct address_space *mapping = inode->i_mapping;
6725 unsigned long index;
6726 loff_t last_page_bytes;
6727
6728 BUG_ON(start > end);
6729
6730 numpages = 0;
6731 last_page_bytes = PAGE_ALIGN(end);
6732 index = start >> PAGE_SHIFT;
6733 do {
6734 pages[numpages] = find_or_create_page(mapping, index, GFP_NOFS);
6735 if (!pages[numpages]) {
6736 ret = -ENOMEM;
6737 mlog_errno(ret);
6738 goto out;
6739 }
6740
6741 numpages++;
6742 index++;
6743 } while (index < (last_page_bytes >> PAGE_SHIFT));
6744
6745out:
6746 if (ret != 0) {
6747 if (pages)
6748 ocfs2_unlock_and_free_pages(pages, numpages);
6749 numpages = 0;
6750 }
6751
6752 *num = numpages;
6753
6754 return ret;
6755}
6756
6757static int ocfs2_grab_eof_pages(struct inode *inode, loff_t start, loff_t end,
6758 struct page **pages, int *num)
6759{
6760 struct super_block *sb = inode->i_sb;
6761
6762 BUG_ON(start >> OCFS2_SB(sb)->s_clustersize_bits !=
6763 (end - 1) >> OCFS2_SB(sb)->s_clustersize_bits);
6764
6765 return ocfs2_grab_pages(inode, start, end, pages, num);
6766}
6767
6768/*
6769 * Zero the area past i_size but still within an allocated
6770 * cluster. This avoids exposing nonzero data on subsequent file
6771 * extends.
6772 *
6773 * We need to call this before i_size is updated on the inode because
6774 * otherwise block_write_full_page() will skip writeout of pages past
6775 * i_size. The new_i_size parameter is passed for this reason.
6776 */
6777int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
6778 u64 range_start, u64 range_end)
6779{
6780 int ret = 0, numpages;
6781 struct page **pages = NULL;
6782 u64 phys;
6783 unsigned int ext_flags;
6784 struct super_block *sb = inode->i_sb;
6785
6786 /*
6787 * File systems which don't support sparse files zero on every
6788 * extend.
6789 */
6790 if (!ocfs2_sparse_alloc(OCFS2_SB(sb)))
6791 return 0;
6792
6793 pages = kcalloc(ocfs2_pages_per_cluster(sb),
6794 sizeof(struct page *), GFP_NOFS);
6795 if (pages == NULL) {
6796 ret = -ENOMEM;
6797 mlog_errno(ret);
6798 goto out;
6799 }
6800
6801 if (range_start == range_end)
6802 goto out;
6803
6804 ret = ocfs2_extent_map_get_blocks(inode,
6805 range_start >> sb->s_blocksize_bits,
6806 &phys, NULL, &ext_flags);
6807 if (ret) {
6808 mlog_errno(ret);
6809 goto out;
6810 }
6811
6812 /*
6813 * Tail is a hole, or is marked unwritten. In either case, we
6814 * can count on read and write to return/push zero's.
6815 */
6816 if (phys == 0 || ext_flags & OCFS2_EXT_UNWRITTEN)
6817 goto out;
6818
6819 ret = ocfs2_grab_eof_pages(inode, range_start, range_end, pages,
6820 &numpages);
6821 if (ret) {
6822 mlog_errno(ret);
6823 goto out;
6824 }
6825
6826 ocfs2_zero_cluster_pages(inode, range_start, range_end, pages,
6827 numpages, phys, handle);
6828
6829 /*
6830 * Initiate writeout of the pages we zero'd here. We don't
6831 * wait on them - the truncate_inode_pages() call later will
6832 * do that for us.
6833 */
6834 ret = filemap_fdatawrite_range(inode->i_mapping, range_start,
6835 range_end - 1);
6836 if (ret)
6837 mlog_errno(ret);
6838
6839out:
6840 kfree(pages);
6841
6842 return ret;
6843}
6844
6845static void ocfs2_zero_dinode_id2_with_xattr(struct inode *inode,
6846 struct ocfs2_dinode *di)
6847{
6848 unsigned int blocksize = 1 << inode->i_sb->s_blocksize_bits;
6849 unsigned int xattrsize = le16_to_cpu(di->i_xattr_inline_size);
6850
6851 if (le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_XATTR_FL)
6852 memset(&di->id2, 0, blocksize -
6853 offsetof(struct ocfs2_dinode, id2) -
6854 xattrsize);
6855 else
6856 memset(&di->id2, 0, blocksize -
6857 offsetof(struct ocfs2_dinode, id2));
6858}
6859
6860void ocfs2_dinode_new_extent_list(struct inode *inode,
6861 struct ocfs2_dinode *di)
6862{
6863 ocfs2_zero_dinode_id2_with_xattr(inode, di);
6864 di->id2.i_list.l_tree_depth = 0;
6865 di->id2.i_list.l_next_free_rec = 0;
6866 di->id2.i_list.l_count = cpu_to_le16(
6867 ocfs2_extent_recs_per_inode_with_xattr(inode->i_sb, di));
6868}
6869
6870void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di)
6871{
6872 struct ocfs2_inode_info *oi = OCFS2_I(inode);
6873 struct ocfs2_inline_data *idata = &di->id2.i_data;
6874
6875 spin_lock(&oi->ip_lock);
6876 oi->ip_dyn_features |= OCFS2_INLINE_DATA_FL;
6877 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
6878 spin_unlock(&oi->ip_lock);
6879
6880 /*
6881 * We clear the entire i_data structure here so that all
6882 * fields can be properly initialized.
6883 */
6884 ocfs2_zero_dinode_id2_with_xattr(inode, di);
6885
6886 idata->id_count = cpu_to_le16(
6887 ocfs2_max_inline_data_with_xattr(inode->i_sb, di));
6888}
6889
6890int ocfs2_convert_inline_data_to_extents(struct inode *inode,
6891 struct buffer_head *di_bh)
6892{
6893 int ret, i, has_data, num_pages = 0;
6894 int need_free = 0;
6895 u32 bit_off, num;
6896 handle_t *handle;
6897 u64 uninitialized_var(block);
6898 struct ocfs2_inode_info *oi = OCFS2_I(inode);
6899 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6900 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
6901 struct ocfs2_alloc_context *data_ac = NULL;
6902 struct page **pages = NULL;
6903 loff_t end = osb->s_clustersize;
6904 struct ocfs2_extent_tree et;
6905 int did_quota = 0;
6906
6907 has_data = i_size_read(inode) ? 1 : 0;
6908
6909 if (has_data) {
6910 pages = kcalloc(ocfs2_pages_per_cluster(osb->sb),
6911 sizeof(struct page *), GFP_NOFS);
6912 if (pages == NULL) {
6913 ret = -ENOMEM;
6914 mlog_errno(ret);
6915 return ret;
6916 }
6917
6918 ret = ocfs2_reserve_clusters(osb, 1, &data_ac);
6919 if (ret) {
6920 mlog_errno(ret);
6921 goto free_pages;
6922 }
6923 }
6924
6925 handle = ocfs2_start_trans(osb,
6926 ocfs2_inline_to_extents_credits(osb->sb));
6927 if (IS_ERR(handle)) {
6928 ret = PTR_ERR(handle);
6929 mlog_errno(ret);
6930 goto out;
6931 }
6932
6933 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
6934 OCFS2_JOURNAL_ACCESS_WRITE);
6935 if (ret) {
6936 mlog_errno(ret);
6937 goto out_commit;
6938 }
6939
6940 if (has_data) {
6941 unsigned int page_end;
6942 u64 phys;
6943
6944 ret = dquot_alloc_space_nodirty(inode,
6945 ocfs2_clusters_to_bytes(osb->sb, 1));
6946 if (ret)
6947 goto out_commit;
6948 did_quota = 1;
6949
6950 data_ac->ac_resv = &OCFS2_I(inode)->ip_la_data_resv;
6951
6952 ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off,
6953 &num);
6954 if (ret) {
6955 mlog_errno(ret);
6956 goto out_commit;
6957 }
6958
6959 /*
6960 * Save two copies, one for insert, and one that can
6961 * be changed by ocfs2_map_and_dirty_page() below.
6962 */
6963 block = phys = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
6964
6965 /*
6966 * Non sparse file systems zero on extend, so no need
6967 * to do that now.
6968 */
6969 if (!ocfs2_sparse_alloc(osb) &&
6970 PAGE_SIZE < osb->s_clustersize)
6971 end = PAGE_SIZE;
6972
6973 ret = ocfs2_grab_eof_pages(inode, 0, end, pages, &num_pages);
6974 if (ret) {
6975 mlog_errno(ret);
6976 need_free = 1;
6977 goto out_commit;
6978 }
6979
6980 /*
6981 * This should populate the 1st page for us and mark
6982 * it up to date.
6983 */
6984 ret = ocfs2_read_inline_data(inode, pages[0], di_bh);
6985 if (ret) {
6986 mlog_errno(ret);
6987 need_free = 1;
6988 goto out_unlock;
6989 }
6990
6991 page_end = PAGE_SIZE;
6992 if (PAGE_SIZE > osb->s_clustersize)
6993 page_end = osb->s_clustersize;
6994
6995 for (i = 0; i < num_pages; i++)
6996 ocfs2_map_and_dirty_page(inode, handle, 0, page_end,
6997 pages[i], i > 0, &phys);
6998 }
6999
7000 spin_lock(&oi->ip_lock);
7001 oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL;
7002 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
7003 spin_unlock(&oi->ip_lock);
7004
7005 ocfs2_update_inode_fsync_trans(handle, inode, 1);
7006 ocfs2_dinode_new_extent_list(inode, di);
7007
7008 ocfs2_journal_dirty(handle, di_bh);
7009
7010 if (has_data) {
7011 /*
7012 * An error at this point should be extremely rare. If
7013 * this proves to be false, we could always re-build
7014 * the in-inode data from our pages.
7015 */
7016 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
7017 ret = ocfs2_insert_extent(handle, &et, 0, block, 1, 0, NULL);
7018 if (ret) {
7019 mlog_errno(ret);
7020 need_free = 1;
7021 goto out_unlock;
7022 }
7023
7024 inode->i_blocks = ocfs2_inode_sector_count(inode);
7025 }
7026
7027out_unlock:
7028 if (pages)
7029 ocfs2_unlock_and_free_pages(pages, num_pages);
7030
7031out_commit:
7032 if (ret < 0 && did_quota)
7033 dquot_free_space_nodirty(inode,
7034 ocfs2_clusters_to_bytes(osb->sb, 1));
7035
7036 if (need_free) {
7037 if (data_ac->ac_which == OCFS2_AC_USE_LOCAL)
7038 ocfs2_free_local_alloc_bits(osb, handle, data_ac,
7039 bit_off, num);
7040 else
7041 ocfs2_free_clusters(handle,
7042 data_ac->ac_inode,
7043 data_ac->ac_bh,
7044 ocfs2_clusters_to_blocks(osb->sb, bit_off),
7045 num);
7046 }
7047
7048 ocfs2_commit_trans(osb, handle);
7049
7050out:
7051 if (data_ac)
7052 ocfs2_free_alloc_context(data_ac);
7053free_pages:
7054 kfree(pages);
7055 return ret;
7056}
7057
7058/*
7059 * It is expected, that by the time you call this function,
7060 * inode->i_size and fe->i_size have been adjusted.
7061 *
7062 * WARNING: This will kfree the truncate context
7063 */
7064int ocfs2_commit_truncate(struct ocfs2_super *osb,
7065 struct inode *inode,
7066 struct buffer_head *di_bh)
7067{
7068 int status = 0, i, flags = 0;
7069 u32 new_highest_cpos, range, trunc_cpos, trunc_len, phys_cpos, coff;
7070 u64 blkno = 0;
7071 struct ocfs2_extent_list *el;
7072 struct ocfs2_extent_rec *rec;
7073 struct ocfs2_path *path = NULL;
7074 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7075 struct ocfs2_extent_list *root_el = &(di->id2.i_list);
7076 u64 refcount_loc = le64_to_cpu(di->i_refcount_loc);
7077 struct ocfs2_extent_tree et;
7078 struct ocfs2_cached_dealloc_ctxt dealloc;
7079 struct ocfs2_refcount_tree *ref_tree = NULL;
7080
7081 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
7082 ocfs2_init_dealloc_ctxt(&dealloc);
7083
7084 new_highest_cpos = ocfs2_clusters_for_bytes(osb->sb,
7085 i_size_read(inode));
7086
7087 path = ocfs2_new_path(di_bh, &di->id2.i_list,
7088 ocfs2_journal_access_di);
7089 if (!path) {
7090 status = -ENOMEM;
7091 mlog_errno(status);
7092 goto bail;
7093 }
7094
7095 ocfs2_extent_map_trunc(inode, new_highest_cpos);
7096
7097start:
7098 /*
7099 * Check that we still have allocation to delete.
7100 */
7101 if (OCFS2_I(inode)->ip_clusters == 0) {
7102 status = 0;
7103 goto bail;
7104 }
7105
7106 /*
7107 * Truncate always works against the rightmost tree branch.
7108 */
7109 status = ocfs2_find_path(INODE_CACHE(inode), path, UINT_MAX);
7110 if (status) {
7111 mlog_errno(status);
7112 goto bail;
7113 }
7114
7115 trace_ocfs2_commit_truncate(
7116 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7117 new_highest_cpos,
7118 OCFS2_I(inode)->ip_clusters,
7119 path->p_tree_depth);
7120
7121 /*
7122 * By now, el will point to the extent list on the bottom most
7123 * portion of this tree. Only the tail record is considered in
7124 * each pass.
7125 *
7126 * We handle the following cases, in order:
7127 * - empty extent: delete the remaining branch
7128 * - remove the entire record
7129 * - remove a partial record
7130 * - no record needs to be removed (truncate has completed)
7131 */
7132 el = path_leaf_el(path);
7133 if (le16_to_cpu(el->l_next_free_rec) == 0) {
7134 ocfs2_error(inode->i_sb,
7135 "Inode %llu has empty extent block at %llu\n",
7136 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7137 (unsigned long long)path_leaf_bh(path)->b_blocknr);
7138 status = -EROFS;
7139 goto bail;
7140 }
7141
7142 i = le16_to_cpu(el->l_next_free_rec) - 1;
7143 rec = &el->l_recs[i];
7144 flags = rec->e_flags;
7145 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
7146
7147 if (i == 0 && ocfs2_is_empty_extent(rec)) {
7148 /*
7149 * Lower levels depend on this never happening, but it's best
7150 * to check it up here before changing the tree.
7151 */
7152 if (root_el->l_tree_depth && rec->e_int_clusters == 0) {
7153 mlog(ML_ERROR, "Inode %lu has an empty "
7154 "extent record, depth %u\n", inode->i_ino,
7155 le16_to_cpu(root_el->l_tree_depth));
7156 status = ocfs2_remove_rightmost_empty_extent(osb,
7157 &et, path, &dealloc);
7158 if (status) {
7159 mlog_errno(status);
7160 goto bail;
7161 }
7162
7163 ocfs2_reinit_path(path, 1);
7164 goto start;
7165 } else {
7166 trunc_cpos = le32_to_cpu(rec->e_cpos);
7167 trunc_len = 0;
7168 blkno = 0;
7169 }
7170 } else if (le32_to_cpu(rec->e_cpos) >= new_highest_cpos) {
7171 /*
7172 * Truncate entire record.
7173 */
7174 trunc_cpos = le32_to_cpu(rec->e_cpos);
7175 trunc_len = ocfs2_rec_clusters(el, rec);
7176 blkno = le64_to_cpu(rec->e_blkno);
7177 } else if (range > new_highest_cpos) {
7178 /*
7179 * Partial truncate. it also should be
7180 * the last truncate we're doing.
7181 */
7182 trunc_cpos = new_highest_cpos;
7183 trunc_len = range - new_highest_cpos;
7184 coff = new_highest_cpos - le32_to_cpu(rec->e_cpos);
7185 blkno = le64_to_cpu(rec->e_blkno) +
7186 ocfs2_clusters_to_blocks(inode->i_sb, coff);
7187 } else {
7188 /*
7189 * Truncate completed, leave happily.
7190 */
7191 status = 0;
7192 goto bail;
7193 }
7194
7195 phys_cpos = ocfs2_blocks_to_clusters(inode->i_sb, blkno);
7196
7197 if ((flags & OCFS2_EXT_REFCOUNTED) && trunc_len && !ref_tree) {
7198 status = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
7199 &ref_tree, NULL);
7200 if (status) {
7201 mlog_errno(status);
7202 goto bail;
7203 }
7204 }
7205
7206 status = ocfs2_remove_btree_range(inode, &et, trunc_cpos,
7207 phys_cpos, trunc_len, flags, &dealloc,
7208 refcount_loc, true);
7209 if (status < 0) {
7210 mlog_errno(status);
7211 goto bail;
7212 }
7213
7214 ocfs2_reinit_path(path, 1);
7215
7216 /*
7217 * The check above will catch the case where we've truncated
7218 * away all allocation.
7219 */
7220 goto start;
7221
7222bail:
7223 if (ref_tree)
7224 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
7225
7226 ocfs2_schedule_truncate_log_flush(osb, 1);
7227
7228 ocfs2_run_deallocs(osb, &dealloc);
7229
7230 ocfs2_free_path(path);
7231
7232 return status;
7233}
7234
7235/*
7236 * 'start' is inclusive, 'end' is not.
7237 */
7238int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
7239 unsigned int start, unsigned int end, int trunc)
7240{
7241 int ret;
7242 unsigned int numbytes;
7243 handle_t *handle;
7244 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7245 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7246 struct ocfs2_inline_data *idata = &di->id2.i_data;
7247
7248 if (end > i_size_read(inode))
7249 end = i_size_read(inode);
7250
7251 BUG_ON(start > end);
7252
7253 if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) ||
7254 !(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL) ||
7255 !ocfs2_supports_inline_data(osb)) {
7256 ocfs2_error(inode->i_sb,
7257 "Inline data flags for inode %llu don't agree! Disk: 0x%x, Memory: 0x%x, Superblock: 0x%x\n",
7258 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7259 le16_to_cpu(di->i_dyn_features),
7260 OCFS2_I(inode)->ip_dyn_features,
7261 osb->s_feature_incompat);
7262 ret = -EROFS;
7263 goto out;
7264 }
7265
7266 handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
7267 if (IS_ERR(handle)) {
7268 ret = PTR_ERR(handle);
7269 mlog_errno(ret);
7270 goto out;
7271 }
7272
7273 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
7274 OCFS2_JOURNAL_ACCESS_WRITE);
7275 if (ret) {
7276 mlog_errno(ret);
7277 goto out_commit;
7278 }
7279
7280 numbytes = end - start;
7281 memset(idata->id_data + start, 0, numbytes);
7282
7283 /*
7284 * No need to worry about the data page here - it's been
7285 * truncated already and inline data doesn't need it for
7286 * pushing zero's to disk, so we'll let readpage pick it up
7287 * later.
7288 */
7289 if (trunc) {
7290 i_size_write(inode, start);
7291 di->i_size = cpu_to_le64(start);
7292 }
7293
7294 inode->i_blocks = ocfs2_inode_sector_count(inode);
7295 inode->i_ctime = inode->i_mtime = current_time(inode);
7296
7297 di->i_ctime = di->i_mtime = cpu_to_le64(inode->i_ctime.tv_sec);
7298 di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
7299
7300 ocfs2_update_inode_fsync_trans(handle, inode, 1);
7301 ocfs2_journal_dirty(handle, di_bh);
7302
7303out_commit:
7304 ocfs2_commit_trans(osb, handle);
7305
7306out:
7307 return ret;
7308}
7309
7310static int ocfs2_trim_extent(struct super_block *sb,
7311 struct ocfs2_group_desc *gd,
7312 u32 start, u32 count)
7313{
7314 u64 discard, bcount;
7315
7316 bcount = ocfs2_clusters_to_blocks(sb, count);
7317 discard = le64_to_cpu(gd->bg_blkno) +
7318 ocfs2_clusters_to_blocks(sb, start);
7319
7320 trace_ocfs2_trim_extent(sb, (unsigned long long)discard, bcount);
7321
7322 return sb_issue_discard(sb, discard, bcount, GFP_NOFS, 0);
7323}
7324
7325static int ocfs2_trim_group(struct super_block *sb,
7326 struct ocfs2_group_desc *gd,
7327 u32 start, u32 max, u32 minbits)
7328{
7329 int ret = 0, count = 0, next;
7330 void *bitmap = gd->bg_bitmap;
7331
7332 if (le16_to_cpu(gd->bg_free_bits_count) < minbits)
7333 return 0;
7334
7335 trace_ocfs2_trim_group((unsigned long long)le64_to_cpu(gd->bg_blkno),
7336 start, max, minbits);
7337
7338 while (start < max) {
7339 start = ocfs2_find_next_zero_bit(bitmap, max, start);
7340 if (start >= max)
7341 break;
7342 next = ocfs2_find_next_bit(bitmap, max, start);
7343
7344 if ((next - start) >= minbits) {
7345 ret = ocfs2_trim_extent(sb, gd,
7346 start, next - start);
7347 if (ret < 0) {
7348 mlog_errno(ret);
7349 break;
7350 }
7351 count += next - start;
7352 }
7353 start = next + 1;
7354
7355 if (fatal_signal_pending(current)) {
7356 count = -ERESTARTSYS;
7357 break;
7358 }
7359
7360 if ((le16_to_cpu(gd->bg_free_bits_count) - count) < minbits)
7361 break;
7362 }
7363
7364 if (ret < 0)
7365 count = ret;
7366
7367 return count;
7368}
7369
7370int ocfs2_trim_fs(struct super_block *sb, struct fstrim_range *range)
7371{
7372 struct ocfs2_super *osb = OCFS2_SB(sb);
7373 u64 start, len, trimmed, first_group, last_group, group;
7374 int ret, cnt;
7375 u32 first_bit, last_bit, minlen;
7376 struct buffer_head *main_bm_bh = NULL;
7377 struct inode *main_bm_inode = NULL;
7378 struct buffer_head *gd_bh = NULL;
7379 struct ocfs2_dinode *main_bm;
7380 struct ocfs2_group_desc *gd = NULL;
7381
7382 start = range->start >> osb->s_clustersize_bits;
7383 len = range->len >> osb->s_clustersize_bits;
7384 minlen = range->minlen >> osb->s_clustersize_bits;
7385
7386 if (minlen >= osb->bitmap_cpg || range->len < sb->s_blocksize)
7387 return -EINVAL;
7388
7389 main_bm_inode = ocfs2_get_system_file_inode(osb,
7390 GLOBAL_BITMAP_SYSTEM_INODE,
7391 OCFS2_INVALID_SLOT);
7392 if (!main_bm_inode) {
7393 ret = -EIO;
7394 mlog_errno(ret);
7395 goto out;
7396 }
7397
7398 inode_lock(main_bm_inode);
7399
7400 ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 0);
7401 if (ret < 0) {
7402 mlog_errno(ret);
7403 goto out_mutex;
7404 }
7405 main_bm = (struct ocfs2_dinode *)main_bm_bh->b_data;
7406
7407 if (start >= le32_to_cpu(main_bm->i_clusters)) {
7408 ret = -EINVAL;
7409 goto out_unlock;
7410 }
7411
7412 len = range->len >> osb->s_clustersize_bits;
7413 if (start + len > le32_to_cpu(main_bm->i_clusters))
7414 len = le32_to_cpu(main_bm->i_clusters) - start;
7415
7416 trace_ocfs2_trim_fs(start, len, minlen);
7417
7418 /* Determine first and last group to examine based on start and len */
7419 first_group = ocfs2_which_cluster_group(main_bm_inode, start);
7420 if (first_group == osb->first_cluster_group_blkno)
7421 first_bit = start;
7422 else
7423 first_bit = start - ocfs2_blocks_to_clusters(sb, first_group);
7424 last_group = ocfs2_which_cluster_group(main_bm_inode, start + len - 1);
7425 last_bit = osb->bitmap_cpg;
7426
7427 trimmed = 0;
7428 for (group = first_group; group <= last_group;) {
7429 if (first_bit + len >= osb->bitmap_cpg)
7430 last_bit = osb->bitmap_cpg;
7431 else
7432 last_bit = first_bit + len;
7433
7434 ret = ocfs2_read_group_descriptor(main_bm_inode,
7435 main_bm, group,
7436 &gd_bh);
7437 if (ret < 0) {
7438 mlog_errno(ret);
7439 break;
7440 }
7441
7442 gd = (struct ocfs2_group_desc *)gd_bh->b_data;
7443 cnt = ocfs2_trim_group(sb, gd, first_bit, last_bit, minlen);
7444 brelse(gd_bh);
7445 gd_bh = NULL;
7446 if (cnt < 0) {
7447 ret = cnt;
7448 mlog_errno(ret);
7449 break;
7450 }
7451
7452 trimmed += cnt;
7453 len -= osb->bitmap_cpg - first_bit;
7454 first_bit = 0;
7455 if (group == osb->first_cluster_group_blkno)
7456 group = ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg);
7457 else
7458 group += ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg);
7459 }
7460 range->len = trimmed * sb->s_blocksize;
7461out_unlock:
7462 ocfs2_inode_unlock(main_bm_inode, 0);
7463 brelse(main_bm_bh);
7464out_mutex:
7465 inode_unlock(main_bm_inode);
7466 iput(main_bm_inode);
7467out:
7468 return ret;
7469}
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* -*- mode: c; c-basic-offset: 8; -*-
3 * vim: noexpandtab sw=8 ts=8 sts=0:
4 *
5 * alloc.c
6 *
7 * Extent allocs and frees
8 *
9 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
10 */
11
12#include <linux/fs.h>
13#include <linux/types.h>
14#include <linux/slab.h>
15#include <linux/highmem.h>
16#include <linux/swap.h>
17#include <linux/quotaops.h>
18#include <linux/blkdev.h>
19#include <linux/sched/signal.h>
20
21#include <cluster/masklog.h>
22
23#include "ocfs2.h"
24
25#include "alloc.h"
26#include "aops.h"
27#include "blockcheck.h"
28#include "dlmglue.h"
29#include "extent_map.h"
30#include "inode.h"
31#include "journal.h"
32#include "localalloc.h"
33#include "suballoc.h"
34#include "sysfile.h"
35#include "file.h"
36#include "super.h"
37#include "uptodate.h"
38#include "xattr.h"
39#include "refcounttree.h"
40#include "ocfs2_trace.h"
41
42#include "buffer_head_io.h"
43
44enum ocfs2_contig_type {
45 CONTIG_NONE = 0,
46 CONTIG_LEFT,
47 CONTIG_RIGHT,
48 CONTIG_LEFTRIGHT,
49};
50
51static enum ocfs2_contig_type
52 ocfs2_extent_rec_contig(struct super_block *sb,
53 struct ocfs2_extent_rec *ext,
54 struct ocfs2_extent_rec *insert_rec);
55/*
56 * Operations for a specific extent tree type.
57 *
58 * To implement an on-disk btree (extent tree) type in ocfs2, add
59 * an ocfs2_extent_tree_operations structure and the matching
60 * ocfs2_init_<thingy>_extent_tree() function. That's pretty much it
61 * for the allocation portion of the extent tree.
62 */
63struct ocfs2_extent_tree_operations {
64 /*
65 * last_eb_blk is the block number of the right most leaf extent
66 * block. Most on-disk structures containing an extent tree store
67 * this value for fast access. The ->eo_set_last_eb_blk() and
68 * ->eo_get_last_eb_blk() operations access this value. They are
69 * both required.
70 */
71 void (*eo_set_last_eb_blk)(struct ocfs2_extent_tree *et,
72 u64 blkno);
73 u64 (*eo_get_last_eb_blk)(struct ocfs2_extent_tree *et);
74
75 /*
76 * The on-disk structure usually keeps track of how many total
77 * clusters are stored in this extent tree. This function updates
78 * that value. new_clusters is the delta, and must be
79 * added to the total. Required.
80 */
81 void (*eo_update_clusters)(struct ocfs2_extent_tree *et,
82 u32 new_clusters);
83
84 /*
85 * If this extent tree is supported by an extent map, insert
86 * a record into the map.
87 */
88 void (*eo_extent_map_insert)(struct ocfs2_extent_tree *et,
89 struct ocfs2_extent_rec *rec);
90
91 /*
92 * If this extent tree is supported by an extent map, truncate the
93 * map to clusters,
94 */
95 void (*eo_extent_map_truncate)(struct ocfs2_extent_tree *et,
96 u32 clusters);
97
98 /*
99 * If ->eo_insert_check() exists, it is called before rec is
100 * inserted into the extent tree. It is optional.
101 */
102 int (*eo_insert_check)(struct ocfs2_extent_tree *et,
103 struct ocfs2_extent_rec *rec);
104 int (*eo_sanity_check)(struct ocfs2_extent_tree *et);
105
106 /*
107 * --------------------------------------------------------------
108 * The remaining are internal to ocfs2_extent_tree and don't have
109 * accessor functions
110 */
111
112 /*
113 * ->eo_fill_root_el() takes et->et_object and sets et->et_root_el.
114 * It is required.
115 */
116 void (*eo_fill_root_el)(struct ocfs2_extent_tree *et);
117
118 /*
119 * ->eo_fill_max_leaf_clusters sets et->et_max_leaf_clusters if
120 * it exists. If it does not, et->et_max_leaf_clusters is set
121 * to 0 (unlimited). Optional.
122 */
123 void (*eo_fill_max_leaf_clusters)(struct ocfs2_extent_tree *et);
124
125 /*
126 * ->eo_extent_contig test whether the 2 ocfs2_extent_rec
127 * are contiguous or not. Optional. Don't need to set it if use
128 * ocfs2_extent_rec as the tree leaf.
129 */
130 enum ocfs2_contig_type
131 (*eo_extent_contig)(struct ocfs2_extent_tree *et,
132 struct ocfs2_extent_rec *ext,
133 struct ocfs2_extent_rec *insert_rec);
134};
135
136
137/*
138 * Pre-declare ocfs2_dinode_et_ops so we can use it as a sanity check
139 * in the methods.
140 */
141static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et);
142static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
143 u64 blkno);
144static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
145 u32 clusters);
146static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et,
147 struct ocfs2_extent_rec *rec);
148static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et,
149 u32 clusters);
150static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
151 struct ocfs2_extent_rec *rec);
152static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et);
153static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et);
154
155static int ocfs2_reuse_blk_from_dealloc(handle_t *handle,
156 struct ocfs2_extent_tree *et,
157 struct buffer_head **new_eb_bh,
158 int blk_wanted, int *blk_given);
159static int ocfs2_is_dealloc_empty(struct ocfs2_extent_tree *et);
160
161static const struct ocfs2_extent_tree_operations ocfs2_dinode_et_ops = {
162 .eo_set_last_eb_blk = ocfs2_dinode_set_last_eb_blk,
163 .eo_get_last_eb_blk = ocfs2_dinode_get_last_eb_blk,
164 .eo_update_clusters = ocfs2_dinode_update_clusters,
165 .eo_extent_map_insert = ocfs2_dinode_extent_map_insert,
166 .eo_extent_map_truncate = ocfs2_dinode_extent_map_truncate,
167 .eo_insert_check = ocfs2_dinode_insert_check,
168 .eo_sanity_check = ocfs2_dinode_sanity_check,
169 .eo_fill_root_el = ocfs2_dinode_fill_root_el,
170};
171
172static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et,
173 u64 blkno)
174{
175 struct ocfs2_dinode *di = et->et_object;
176
177 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
178 di->i_last_eb_blk = cpu_to_le64(blkno);
179}
180
181static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et)
182{
183 struct ocfs2_dinode *di = et->et_object;
184
185 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
186 return le64_to_cpu(di->i_last_eb_blk);
187}
188
189static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et,
190 u32 clusters)
191{
192 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
193 struct ocfs2_dinode *di = et->et_object;
194
195 le32_add_cpu(&di->i_clusters, clusters);
196 spin_lock(&oi->ip_lock);
197 oi->ip_clusters = le32_to_cpu(di->i_clusters);
198 spin_unlock(&oi->ip_lock);
199}
200
201static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et,
202 struct ocfs2_extent_rec *rec)
203{
204 struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode;
205
206 ocfs2_extent_map_insert_rec(inode, rec);
207}
208
209static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et,
210 u32 clusters)
211{
212 struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode;
213
214 ocfs2_extent_map_trunc(inode, clusters);
215}
216
217static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et,
218 struct ocfs2_extent_rec *rec)
219{
220 struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci);
221 struct ocfs2_super *osb = OCFS2_SB(oi->vfs_inode.i_sb);
222
223 BUG_ON(oi->ip_dyn_features & OCFS2_INLINE_DATA_FL);
224 mlog_bug_on_msg(!ocfs2_sparse_alloc(osb) &&
225 (oi->ip_clusters != le32_to_cpu(rec->e_cpos)),
226 "Device %s, asking for sparse allocation: inode %llu, "
227 "cpos %u, clusters %u\n",
228 osb->dev_str,
229 (unsigned long long)oi->ip_blkno,
230 rec->e_cpos, oi->ip_clusters);
231
232 return 0;
233}
234
235static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et)
236{
237 struct ocfs2_dinode *di = et->et_object;
238
239 BUG_ON(et->et_ops != &ocfs2_dinode_et_ops);
240 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
241
242 return 0;
243}
244
245static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et)
246{
247 struct ocfs2_dinode *di = et->et_object;
248
249 et->et_root_el = &di->id2.i_list;
250}
251
252
253static void ocfs2_xattr_value_fill_root_el(struct ocfs2_extent_tree *et)
254{
255 struct ocfs2_xattr_value_buf *vb = et->et_object;
256
257 et->et_root_el = &vb->vb_xv->xr_list;
258}
259
260static void ocfs2_xattr_value_set_last_eb_blk(struct ocfs2_extent_tree *et,
261 u64 blkno)
262{
263 struct ocfs2_xattr_value_buf *vb = et->et_object;
264
265 vb->vb_xv->xr_last_eb_blk = cpu_to_le64(blkno);
266}
267
268static u64 ocfs2_xattr_value_get_last_eb_blk(struct ocfs2_extent_tree *et)
269{
270 struct ocfs2_xattr_value_buf *vb = et->et_object;
271
272 return le64_to_cpu(vb->vb_xv->xr_last_eb_blk);
273}
274
275static void ocfs2_xattr_value_update_clusters(struct ocfs2_extent_tree *et,
276 u32 clusters)
277{
278 struct ocfs2_xattr_value_buf *vb = et->et_object;
279
280 le32_add_cpu(&vb->vb_xv->xr_clusters, clusters);
281}
282
283static const struct ocfs2_extent_tree_operations ocfs2_xattr_value_et_ops = {
284 .eo_set_last_eb_blk = ocfs2_xattr_value_set_last_eb_blk,
285 .eo_get_last_eb_blk = ocfs2_xattr_value_get_last_eb_blk,
286 .eo_update_clusters = ocfs2_xattr_value_update_clusters,
287 .eo_fill_root_el = ocfs2_xattr_value_fill_root_el,
288};
289
290static void ocfs2_xattr_tree_fill_root_el(struct ocfs2_extent_tree *et)
291{
292 struct ocfs2_xattr_block *xb = et->et_object;
293
294 et->et_root_el = &xb->xb_attrs.xb_root.xt_list;
295}
296
297static void ocfs2_xattr_tree_fill_max_leaf_clusters(struct ocfs2_extent_tree *et)
298{
299 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
300 et->et_max_leaf_clusters =
301 ocfs2_clusters_for_bytes(sb, OCFS2_MAX_XATTR_TREE_LEAF_SIZE);
302}
303
304static void ocfs2_xattr_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
305 u64 blkno)
306{
307 struct ocfs2_xattr_block *xb = et->et_object;
308 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
309
310 xt->xt_last_eb_blk = cpu_to_le64(blkno);
311}
312
313static u64 ocfs2_xattr_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
314{
315 struct ocfs2_xattr_block *xb = et->et_object;
316 struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root;
317
318 return le64_to_cpu(xt->xt_last_eb_blk);
319}
320
321static void ocfs2_xattr_tree_update_clusters(struct ocfs2_extent_tree *et,
322 u32 clusters)
323{
324 struct ocfs2_xattr_block *xb = et->et_object;
325
326 le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, clusters);
327}
328
329static const struct ocfs2_extent_tree_operations ocfs2_xattr_tree_et_ops = {
330 .eo_set_last_eb_blk = ocfs2_xattr_tree_set_last_eb_blk,
331 .eo_get_last_eb_blk = ocfs2_xattr_tree_get_last_eb_blk,
332 .eo_update_clusters = ocfs2_xattr_tree_update_clusters,
333 .eo_fill_root_el = ocfs2_xattr_tree_fill_root_el,
334 .eo_fill_max_leaf_clusters = ocfs2_xattr_tree_fill_max_leaf_clusters,
335};
336
337static void ocfs2_dx_root_set_last_eb_blk(struct ocfs2_extent_tree *et,
338 u64 blkno)
339{
340 struct ocfs2_dx_root_block *dx_root = et->et_object;
341
342 dx_root->dr_last_eb_blk = cpu_to_le64(blkno);
343}
344
345static u64 ocfs2_dx_root_get_last_eb_blk(struct ocfs2_extent_tree *et)
346{
347 struct ocfs2_dx_root_block *dx_root = et->et_object;
348
349 return le64_to_cpu(dx_root->dr_last_eb_blk);
350}
351
352static void ocfs2_dx_root_update_clusters(struct ocfs2_extent_tree *et,
353 u32 clusters)
354{
355 struct ocfs2_dx_root_block *dx_root = et->et_object;
356
357 le32_add_cpu(&dx_root->dr_clusters, clusters);
358}
359
360static int ocfs2_dx_root_sanity_check(struct ocfs2_extent_tree *et)
361{
362 struct ocfs2_dx_root_block *dx_root = et->et_object;
363
364 BUG_ON(!OCFS2_IS_VALID_DX_ROOT(dx_root));
365
366 return 0;
367}
368
369static void ocfs2_dx_root_fill_root_el(struct ocfs2_extent_tree *et)
370{
371 struct ocfs2_dx_root_block *dx_root = et->et_object;
372
373 et->et_root_el = &dx_root->dr_list;
374}
375
376static const struct ocfs2_extent_tree_operations ocfs2_dx_root_et_ops = {
377 .eo_set_last_eb_blk = ocfs2_dx_root_set_last_eb_blk,
378 .eo_get_last_eb_blk = ocfs2_dx_root_get_last_eb_blk,
379 .eo_update_clusters = ocfs2_dx_root_update_clusters,
380 .eo_sanity_check = ocfs2_dx_root_sanity_check,
381 .eo_fill_root_el = ocfs2_dx_root_fill_root_el,
382};
383
384static void ocfs2_refcount_tree_fill_root_el(struct ocfs2_extent_tree *et)
385{
386 struct ocfs2_refcount_block *rb = et->et_object;
387
388 et->et_root_el = &rb->rf_list;
389}
390
391static void ocfs2_refcount_tree_set_last_eb_blk(struct ocfs2_extent_tree *et,
392 u64 blkno)
393{
394 struct ocfs2_refcount_block *rb = et->et_object;
395
396 rb->rf_last_eb_blk = cpu_to_le64(blkno);
397}
398
399static u64 ocfs2_refcount_tree_get_last_eb_blk(struct ocfs2_extent_tree *et)
400{
401 struct ocfs2_refcount_block *rb = et->et_object;
402
403 return le64_to_cpu(rb->rf_last_eb_blk);
404}
405
406static void ocfs2_refcount_tree_update_clusters(struct ocfs2_extent_tree *et,
407 u32 clusters)
408{
409 struct ocfs2_refcount_block *rb = et->et_object;
410
411 le32_add_cpu(&rb->rf_clusters, clusters);
412}
413
414static enum ocfs2_contig_type
415ocfs2_refcount_tree_extent_contig(struct ocfs2_extent_tree *et,
416 struct ocfs2_extent_rec *ext,
417 struct ocfs2_extent_rec *insert_rec)
418{
419 return CONTIG_NONE;
420}
421
422static const struct ocfs2_extent_tree_operations ocfs2_refcount_tree_et_ops = {
423 .eo_set_last_eb_blk = ocfs2_refcount_tree_set_last_eb_blk,
424 .eo_get_last_eb_blk = ocfs2_refcount_tree_get_last_eb_blk,
425 .eo_update_clusters = ocfs2_refcount_tree_update_clusters,
426 .eo_fill_root_el = ocfs2_refcount_tree_fill_root_el,
427 .eo_extent_contig = ocfs2_refcount_tree_extent_contig,
428};
429
430static void __ocfs2_init_extent_tree(struct ocfs2_extent_tree *et,
431 struct ocfs2_caching_info *ci,
432 struct buffer_head *bh,
433 ocfs2_journal_access_func access,
434 void *obj,
435 const struct ocfs2_extent_tree_operations *ops)
436{
437 et->et_ops = ops;
438 et->et_root_bh = bh;
439 et->et_ci = ci;
440 et->et_root_journal_access = access;
441 if (!obj)
442 obj = (void *)bh->b_data;
443 et->et_object = obj;
444 et->et_dealloc = NULL;
445
446 et->et_ops->eo_fill_root_el(et);
447 if (!et->et_ops->eo_fill_max_leaf_clusters)
448 et->et_max_leaf_clusters = 0;
449 else
450 et->et_ops->eo_fill_max_leaf_clusters(et);
451}
452
453void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et,
454 struct ocfs2_caching_info *ci,
455 struct buffer_head *bh)
456{
457 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_di,
458 NULL, &ocfs2_dinode_et_ops);
459}
460
461void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et,
462 struct ocfs2_caching_info *ci,
463 struct buffer_head *bh)
464{
465 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_xb,
466 NULL, &ocfs2_xattr_tree_et_ops);
467}
468
469void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et,
470 struct ocfs2_caching_info *ci,
471 struct ocfs2_xattr_value_buf *vb)
472{
473 __ocfs2_init_extent_tree(et, ci, vb->vb_bh, vb->vb_access, vb,
474 &ocfs2_xattr_value_et_ops);
475}
476
477void ocfs2_init_dx_root_extent_tree(struct ocfs2_extent_tree *et,
478 struct ocfs2_caching_info *ci,
479 struct buffer_head *bh)
480{
481 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_dr,
482 NULL, &ocfs2_dx_root_et_ops);
483}
484
485void ocfs2_init_refcount_extent_tree(struct ocfs2_extent_tree *et,
486 struct ocfs2_caching_info *ci,
487 struct buffer_head *bh)
488{
489 __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_rb,
490 NULL, &ocfs2_refcount_tree_et_ops);
491}
492
493static inline void ocfs2_et_set_last_eb_blk(struct ocfs2_extent_tree *et,
494 u64 new_last_eb_blk)
495{
496 et->et_ops->eo_set_last_eb_blk(et, new_last_eb_blk);
497}
498
499static inline u64 ocfs2_et_get_last_eb_blk(struct ocfs2_extent_tree *et)
500{
501 return et->et_ops->eo_get_last_eb_blk(et);
502}
503
504static inline void ocfs2_et_update_clusters(struct ocfs2_extent_tree *et,
505 u32 clusters)
506{
507 et->et_ops->eo_update_clusters(et, clusters);
508}
509
510static inline void ocfs2_et_extent_map_insert(struct ocfs2_extent_tree *et,
511 struct ocfs2_extent_rec *rec)
512{
513 if (et->et_ops->eo_extent_map_insert)
514 et->et_ops->eo_extent_map_insert(et, rec);
515}
516
517static inline void ocfs2_et_extent_map_truncate(struct ocfs2_extent_tree *et,
518 u32 clusters)
519{
520 if (et->et_ops->eo_extent_map_truncate)
521 et->et_ops->eo_extent_map_truncate(et, clusters);
522}
523
524static inline int ocfs2_et_root_journal_access(handle_t *handle,
525 struct ocfs2_extent_tree *et,
526 int type)
527{
528 return et->et_root_journal_access(handle, et->et_ci, et->et_root_bh,
529 type);
530}
531
532static inline enum ocfs2_contig_type
533 ocfs2_et_extent_contig(struct ocfs2_extent_tree *et,
534 struct ocfs2_extent_rec *rec,
535 struct ocfs2_extent_rec *insert_rec)
536{
537 if (et->et_ops->eo_extent_contig)
538 return et->et_ops->eo_extent_contig(et, rec, insert_rec);
539
540 return ocfs2_extent_rec_contig(
541 ocfs2_metadata_cache_get_super(et->et_ci),
542 rec, insert_rec);
543}
544
545static inline int ocfs2_et_insert_check(struct ocfs2_extent_tree *et,
546 struct ocfs2_extent_rec *rec)
547{
548 int ret = 0;
549
550 if (et->et_ops->eo_insert_check)
551 ret = et->et_ops->eo_insert_check(et, rec);
552 return ret;
553}
554
555static inline int ocfs2_et_sanity_check(struct ocfs2_extent_tree *et)
556{
557 int ret = 0;
558
559 if (et->et_ops->eo_sanity_check)
560 ret = et->et_ops->eo_sanity_check(et);
561 return ret;
562}
563
564static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
565 struct ocfs2_extent_block *eb);
566static void ocfs2_adjust_rightmost_records(handle_t *handle,
567 struct ocfs2_extent_tree *et,
568 struct ocfs2_path *path,
569 struct ocfs2_extent_rec *insert_rec);
570/*
571 * Reset the actual path elements so that we can re-use the structure
572 * to build another path. Generally, this involves freeing the buffer
573 * heads.
574 */
575void ocfs2_reinit_path(struct ocfs2_path *path, int keep_root)
576{
577 int i, start = 0, depth = 0;
578 struct ocfs2_path_item *node;
579
580 if (keep_root)
581 start = 1;
582
583 for(i = start; i < path_num_items(path); i++) {
584 node = &path->p_node[i];
585
586 brelse(node->bh);
587 node->bh = NULL;
588 node->el = NULL;
589 }
590
591 /*
592 * Tree depth may change during truncate, or insert. If we're
593 * keeping the root extent list, then make sure that our path
594 * structure reflects the proper depth.
595 */
596 if (keep_root)
597 depth = le16_to_cpu(path_root_el(path)->l_tree_depth);
598 else
599 path_root_access(path) = NULL;
600
601 path->p_tree_depth = depth;
602}
603
604void ocfs2_free_path(struct ocfs2_path *path)
605{
606 if (path) {
607 ocfs2_reinit_path(path, 0);
608 kfree(path);
609 }
610}
611
612/*
613 * All the elements of src into dest. After this call, src could be freed
614 * without affecting dest.
615 *
616 * Both paths should have the same root. Any non-root elements of dest
617 * will be freed.
618 */
619static void ocfs2_cp_path(struct ocfs2_path *dest, struct ocfs2_path *src)
620{
621 int i;
622
623 BUG_ON(path_root_bh(dest) != path_root_bh(src));
624 BUG_ON(path_root_el(dest) != path_root_el(src));
625 BUG_ON(path_root_access(dest) != path_root_access(src));
626
627 ocfs2_reinit_path(dest, 1);
628
629 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
630 dest->p_node[i].bh = src->p_node[i].bh;
631 dest->p_node[i].el = src->p_node[i].el;
632
633 if (dest->p_node[i].bh)
634 get_bh(dest->p_node[i].bh);
635 }
636}
637
638/*
639 * Make the *dest path the same as src and re-initialize src path to
640 * have a root only.
641 */
642static void ocfs2_mv_path(struct ocfs2_path *dest, struct ocfs2_path *src)
643{
644 int i;
645
646 BUG_ON(path_root_bh(dest) != path_root_bh(src));
647 BUG_ON(path_root_access(dest) != path_root_access(src));
648
649 for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) {
650 brelse(dest->p_node[i].bh);
651
652 dest->p_node[i].bh = src->p_node[i].bh;
653 dest->p_node[i].el = src->p_node[i].el;
654
655 src->p_node[i].bh = NULL;
656 src->p_node[i].el = NULL;
657 }
658}
659
660/*
661 * Insert an extent block at given index.
662 *
663 * This will not take an additional reference on eb_bh.
664 */
665static inline void ocfs2_path_insert_eb(struct ocfs2_path *path, int index,
666 struct buffer_head *eb_bh)
667{
668 struct ocfs2_extent_block *eb = (struct ocfs2_extent_block *)eb_bh->b_data;
669
670 /*
671 * Right now, no root bh is an extent block, so this helps
672 * catch code errors with dinode trees. The assertion can be
673 * safely removed if we ever need to insert extent block
674 * structures at the root.
675 */
676 BUG_ON(index == 0);
677
678 path->p_node[index].bh = eb_bh;
679 path->p_node[index].el = &eb->h_list;
680}
681
682static struct ocfs2_path *ocfs2_new_path(struct buffer_head *root_bh,
683 struct ocfs2_extent_list *root_el,
684 ocfs2_journal_access_func access)
685{
686 struct ocfs2_path *path;
687
688 BUG_ON(le16_to_cpu(root_el->l_tree_depth) >= OCFS2_MAX_PATH_DEPTH);
689
690 path = kzalloc(sizeof(*path), GFP_NOFS);
691 if (path) {
692 path->p_tree_depth = le16_to_cpu(root_el->l_tree_depth);
693 get_bh(root_bh);
694 path_root_bh(path) = root_bh;
695 path_root_el(path) = root_el;
696 path_root_access(path) = access;
697 }
698
699 return path;
700}
701
702struct ocfs2_path *ocfs2_new_path_from_path(struct ocfs2_path *path)
703{
704 return ocfs2_new_path(path_root_bh(path), path_root_el(path),
705 path_root_access(path));
706}
707
708struct ocfs2_path *ocfs2_new_path_from_et(struct ocfs2_extent_tree *et)
709{
710 return ocfs2_new_path(et->et_root_bh, et->et_root_el,
711 et->et_root_journal_access);
712}
713
714/*
715 * Journal the buffer at depth idx. All idx>0 are extent_blocks,
716 * otherwise it's the root_access function.
717 *
718 * I don't like the way this function's name looks next to
719 * ocfs2_journal_access_path(), but I don't have a better one.
720 */
721int ocfs2_path_bh_journal_access(handle_t *handle,
722 struct ocfs2_caching_info *ci,
723 struct ocfs2_path *path,
724 int idx)
725{
726 ocfs2_journal_access_func access = path_root_access(path);
727
728 if (!access)
729 access = ocfs2_journal_access;
730
731 if (idx)
732 access = ocfs2_journal_access_eb;
733
734 return access(handle, ci, path->p_node[idx].bh,
735 OCFS2_JOURNAL_ACCESS_WRITE);
736}
737
738/*
739 * Convenience function to journal all components in a path.
740 */
741int ocfs2_journal_access_path(struct ocfs2_caching_info *ci,
742 handle_t *handle,
743 struct ocfs2_path *path)
744{
745 int i, ret = 0;
746
747 if (!path)
748 goto out;
749
750 for(i = 0; i < path_num_items(path); i++) {
751 ret = ocfs2_path_bh_journal_access(handle, ci, path, i);
752 if (ret < 0) {
753 mlog_errno(ret);
754 goto out;
755 }
756 }
757
758out:
759 return ret;
760}
761
762/*
763 * Return the index of the extent record which contains cluster #v_cluster.
764 * -1 is returned if it was not found.
765 *
766 * Should work fine on interior and exterior nodes.
767 */
768int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster)
769{
770 int ret = -1;
771 int i;
772 struct ocfs2_extent_rec *rec;
773 u32 rec_end, rec_start, clusters;
774
775 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
776 rec = &el->l_recs[i];
777
778 rec_start = le32_to_cpu(rec->e_cpos);
779 clusters = ocfs2_rec_clusters(el, rec);
780
781 rec_end = rec_start + clusters;
782
783 if (v_cluster >= rec_start && v_cluster < rec_end) {
784 ret = i;
785 break;
786 }
787 }
788
789 return ret;
790}
791
792/*
793 * NOTE: ocfs2_block_extent_contig(), ocfs2_extents_adjacent() and
794 * ocfs2_extent_rec_contig only work properly against leaf nodes!
795 */
796static int ocfs2_block_extent_contig(struct super_block *sb,
797 struct ocfs2_extent_rec *ext,
798 u64 blkno)
799{
800 u64 blk_end = le64_to_cpu(ext->e_blkno);
801
802 blk_end += ocfs2_clusters_to_blocks(sb,
803 le16_to_cpu(ext->e_leaf_clusters));
804
805 return blkno == blk_end;
806}
807
808static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left,
809 struct ocfs2_extent_rec *right)
810{
811 u32 left_range;
812
813 left_range = le32_to_cpu(left->e_cpos) +
814 le16_to_cpu(left->e_leaf_clusters);
815
816 return (left_range == le32_to_cpu(right->e_cpos));
817}
818
819static enum ocfs2_contig_type
820 ocfs2_extent_rec_contig(struct super_block *sb,
821 struct ocfs2_extent_rec *ext,
822 struct ocfs2_extent_rec *insert_rec)
823{
824 u64 blkno = le64_to_cpu(insert_rec->e_blkno);
825
826 /*
827 * Refuse to coalesce extent records with different flag
828 * fields - we don't want to mix unwritten extents with user
829 * data.
830 */
831 if (ext->e_flags != insert_rec->e_flags)
832 return CONTIG_NONE;
833
834 if (ocfs2_extents_adjacent(ext, insert_rec) &&
835 ocfs2_block_extent_contig(sb, ext, blkno))
836 return CONTIG_RIGHT;
837
838 blkno = le64_to_cpu(ext->e_blkno);
839 if (ocfs2_extents_adjacent(insert_rec, ext) &&
840 ocfs2_block_extent_contig(sb, insert_rec, blkno))
841 return CONTIG_LEFT;
842
843 return CONTIG_NONE;
844}
845
846/*
847 * NOTE: We can have pretty much any combination of contiguousness and
848 * appending.
849 *
850 * The usefulness of APPEND_TAIL is more in that it lets us know that
851 * we'll have to update the path to that leaf.
852 */
853enum ocfs2_append_type {
854 APPEND_NONE = 0,
855 APPEND_TAIL,
856};
857
858enum ocfs2_split_type {
859 SPLIT_NONE = 0,
860 SPLIT_LEFT,
861 SPLIT_RIGHT,
862};
863
864struct ocfs2_insert_type {
865 enum ocfs2_split_type ins_split;
866 enum ocfs2_append_type ins_appending;
867 enum ocfs2_contig_type ins_contig;
868 int ins_contig_index;
869 int ins_tree_depth;
870};
871
872struct ocfs2_merge_ctxt {
873 enum ocfs2_contig_type c_contig_type;
874 int c_has_empty_extent;
875 int c_split_covers_rec;
876};
877
878static int ocfs2_validate_extent_block(struct super_block *sb,
879 struct buffer_head *bh)
880{
881 int rc;
882 struct ocfs2_extent_block *eb =
883 (struct ocfs2_extent_block *)bh->b_data;
884
885 trace_ocfs2_validate_extent_block((unsigned long long)bh->b_blocknr);
886
887 BUG_ON(!buffer_uptodate(bh));
888
889 /*
890 * If the ecc fails, we return the error but otherwise
891 * leave the filesystem running. We know any error is
892 * local to this block.
893 */
894 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &eb->h_check);
895 if (rc) {
896 mlog(ML_ERROR, "Checksum failed for extent block %llu\n",
897 (unsigned long long)bh->b_blocknr);
898 return rc;
899 }
900
901 /*
902 * Errors after here are fatal.
903 */
904
905 if (!OCFS2_IS_VALID_EXTENT_BLOCK(eb)) {
906 rc = ocfs2_error(sb,
907 "Extent block #%llu has bad signature %.*s\n",
908 (unsigned long long)bh->b_blocknr, 7,
909 eb->h_signature);
910 goto bail;
911 }
912
913 if (le64_to_cpu(eb->h_blkno) != bh->b_blocknr) {
914 rc = ocfs2_error(sb,
915 "Extent block #%llu has an invalid h_blkno of %llu\n",
916 (unsigned long long)bh->b_blocknr,
917 (unsigned long long)le64_to_cpu(eb->h_blkno));
918 goto bail;
919 }
920
921 if (le32_to_cpu(eb->h_fs_generation) != OCFS2_SB(sb)->fs_generation)
922 rc = ocfs2_error(sb,
923 "Extent block #%llu has an invalid h_fs_generation of #%u\n",
924 (unsigned long long)bh->b_blocknr,
925 le32_to_cpu(eb->h_fs_generation));
926bail:
927 return rc;
928}
929
930int ocfs2_read_extent_block(struct ocfs2_caching_info *ci, u64 eb_blkno,
931 struct buffer_head **bh)
932{
933 int rc;
934 struct buffer_head *tmp = *bh;
935
936 rc = ocfs2_read_block(ci, eb_blkno, &tmp,
937 ocfs2_validate_extent_block);
938
939 /* If ocfs2_read_block() got us a new bh, pass it up. */
940 if (!rc && !*bh)
941 *bh = tmp;
942
943 return rc;
944}
945
946
947/*
948 * How many free extents have we got before we need more meta data?
949 */
950int ocfs2_num_free_extents(struct ocfs2_extent_tree *et)
951{
952 int retval;
953 struct ocfs2_extent_list *el = NULL;
954 struct ocfs2_extent_block *eb;
955 struct buffer_head *eb_bh = NULL;
956 u64 last_eb_blk = 0;
957
958 el = et->et_root_el;
959 last_eb_blk = ocfs2_et_get_last_eb_blk(et);
960
961 if (last_eb_blk) {
962 retval = ocfs2_read_extent_block(et->et_ci, last_eb_blk,
963 &eb_bh);
964 if (retval < 0) {
965 mlog_errno(retval);
966 goto bail;
967 }
968 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
969 el = &eb->h_list;
970 }
971
972 BUG_ON(el->l_tree_depth != 0);
973
974 retval = le16_to_cpu(el->l_count) - le16_to_cpu(el->l_next_free_rec);
975bail:
976 brelse(eb_bh);
977
978 trace_ocfs2_num_free_extents(retval);
979 return retval;
980}
981
982/* expects array to already be allocated
983 *
984 * sets h_signature, h_blkno, h_suballoc_bit, h_suballoc_slot, and
985 * l_count for you
986 */
987static int ocfs2_create_new_meta_bhs(handle_t *handle,
988 struct ocfs2_extent_tree *et,
989 int wanted,
990 struct ocfs2_alloc_context *meta_ac,
991 struct buffer_head *bhs[])
992{
993 int count, status, i;
994 u16 suballoc_bit_start;
995 u32 num_got;
996 u64 suballoc_loc, first_blkno;
997 struct ocfs2_super *osb =
998 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
999 struct ocfs2_extent_block *eb;
1000
1001 count = 0;
1002 while (count < wanted) {
1003 status = ocfs2_claim_metadata(handle,
1004 meta_ac,
1005 wanted - count,
1006 &suballoc_loc,
1007 &suballoc_bit_start,
1008 &num_got,
1009 &first_blkno);
1010 if (status < 0) {
1011 mlog_errno(status);
1012 goto bail;
1013 }
1014
1015 for(i = count; i < (num_got + count); i++) {
1016 bhs[i] = sb_getblk(osb->sb, first_blkno);
1017 if (bhs[i] == NULL) {
1018 status = -ENOMEM;
1019 mlog_errno(status);
1020 goto bail;
1021 }
1022 ocfs2_set_new_buffer_uptodate(et->et_ci, bhs[i]);
1023
1024 status = ocfs2_journal_access_eb(handle, et->et_ci,
1025 bhs[i],
1026 OCFS2_JOURNAL_ACCESS_CREATE);
1027 if (status < 0) {
1028 mlog_errno(status);
1029 goto bail;
1030 }
1031
1032 memset(bhs[i]->b_data, 0, osb->sb->s_blocksize);
1033 eb = (struct ocfs2_extent_block *) bhs[i]->b_data;
1034 /* Ok, setup the minimal stuff here. */
1035 strcpy(eb->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE);
1036 eb->h_blkno = cpu_to_le64(first_blkno);
1037 eb->h_fs_generation = cpu_to_le32(osb->fs_generation);
1038 eb->h_suballoc_slot =
1039 cpu_to_le16(meta_ac->ac_alloc_slot);
1040 eb->h_suballoc_loc = cpu_to_le64(suballoc_loc);
1041 eb->h_suballoc_bit = cpu_to_le16(suballoc_bit_start);
1042 eb->h_list.l_count =
1043 cpu_to_le16(ocfs2_extent_recs_per_eb(osb->sb));
1044
1045 suballoc_bit_start++;
1046 first_blkno++;
1047
1048 /* We'll also be dirtied by the caller, so
1049 * this isn't absolutely necessary. */
1050 ocfs2_journal_dirty(handle, bhs[i]);
1051 }
1052
1053 count += num_got;
1054 }
1055
1056 status = 0;
1057bail:
1058 if (status < 0) {
1059 for(i = 0; i < wanted; i++) {
1060 brelse(bhs[i]);
1061 bhs[i] = NULL;
1062 }
1063 mlog_errno(status);
1064 }
1065 return status;
1066}
1067
1068/*
1069 * Helper function for ocfs2_add_branch() and ocfs2_shift_tree_depth().
1070 *
1071 * Returns the sum of the rightmost extent rec logical offset and
1072 * cluster count.
1073 *
1074 * ocfs2_add_branch() uses this to determine what logical cluster
1075 * value should be populated into the leftmost new branch records.
1076 *
1077 * ocfs2_shift_tree_depth() uses this to determine the # clusters
1078 * value for the new topmost tree record.
1079 */
1080static inline u32 ocfs2_sum_rightmost_rec(struct ocfs2_extent_list *el)
1081{
1082 int i;
1083
1084 i = le16_to_cpu(el->l_next_free_rec) - 1;
1085
1086 return le32_to_cpu(el->l_recs[i].e_cpos) +
1087 ocfs2_rec_clusters(el, &el->l_recs[i]);
1088}
1089
1090/*
1091 * Change range of the branches in the right most path according to the leaf
1092 * extent block's rightmost record.
1093 */
1094static int ocfs2_adjust_rightmost_branch(handle_t *handle,
1095 struct ocfs2_extent_tree *et)
1096{
1097 int status;
1098 struct ocfs2_path *path = NULL;
1099 struct ocfs2_extent_list *el;
1100 struct ocfs2_extent_rec *rec;
1101
1102 path = ocfs2_new_path_from_et(et);
1103 if (!path) {
1104 status = -ENOMEM;
1105 return status;
1106 }
1107
1108 status = ocfs2_find_path(et->et_ci, path, UINT_MAX);
1109 if (status < 0) {
1110 mlog_errno(status);
1111 goto out;
1112 }
1113
1114 status = ocfs2_extend_trans(handle, path_num_items(path));
1115 if (status < 0) {
1116 mlog_errno(status);
1117 goto out;
1118 }
1119
1120 status = ocfs2_journal_access_path(et->et_ci, handle, path);
1121 if (status < 0) {
1122 mlog_errno(status);
1123 goto out;
1124 }
1125
1126 el = path_leaf_el(path);
1127 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec) - 1];
1128
1129 ocfs2_adjust_rightmost_records(handle, et, path, rec);
1130
1131out:
1132 ocfs2_free_path(path);
1133 return status;
1134}
1135
1136/*
1137 * Add an entire tree branch to our inode. eb_bh is the extent block
1138 * to start at, if we don't want to start the branch at the root
1139 * structure.
1140 *
1141 * last_eb_bh is required as we have to update it's next_leaf pointer
1142 * for the new last extent block.
1143 *
1144 * the new branch will be 'empty' in the sense that every block will
1145 * contain a single record with cluster count == 0.
1146 */
1147static int ocfs2_add_branch(handle_t *handle,
1148 struct ocfs2_extent_tree *et,
1149 struct buffer_head *eb_bh,
1150 struct buffer_head **last_eb_bh,
1151 struct ocfs2_alloc_context *meta_ac)
1152{
1153 int status, new_blocks, i, block_given = 0;
1154 u64 next_blkno, new_last_eb_blk;
1155 struct buffer_head *bh;
1156 struct buffer_head **new_eb_bhs = NULL;
1157 struct ocfs2_extent_block *eb;
1158 struct ocfs2_extent_list *eb_el;
1159 struct ocfs2_extent_list *el;
1160 u32 new_cpos, root_end;
1161
1162 BUG_ON(!last_eb_bh || !*last_eb_bh);
1163
1164 if (eb_bh) {
1165 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
1166 el = &eb->h_list;
1167 } else
1168 el = et->et_root_el;
1169
1170 /* we never add a branch to a leaf. */
1171 BUG_ON(!el->l_tree_depth);
1172
1173 new_blocks = le16_to_cpu(el->l_tree_depth);
1174
1175 eb = (struct ocfs2_extent_block *)(*last_eb_bh)->b_data;
1176 new_cpos = ocfs2_sum_rightmost_rec(&eb->h_list);
1177 root_end = ocfs2_sum_rightmost_rec(et->et_root_el);
1178
1179 /*
1180 * If there is a gap before the root end and the real end
1181 * of the righmost leaf block, we need to remove the gap
1182 * between new_cpos and root_end first so that the tree
1183 * is consistent after we add a new branch(it will start
1184 * from new_cpos).
1185 */
1186 if (root_end > new_cpos) {
1187 trace_ocfs2_adjust_rightmost_branch(
1188 (unsigned long long)
1189 ocfs2_metadata_cache_owner(et->et_ci),
1190 root_end, new_cpos);
1191
1192 status = ocfs2_adjust_rightmost_branch(handle, et);
1193 if (status) {
1194 mlog_errno(status);
1195 goto bail;
1196 }
1197 }
1198
1199 /* allocate the number of new eb blocks we need */
1200 new_eb_bhs = kcalloc(new_blocks, sizeof(struct buffer_head *),
1201 GFP_KERNEL);
1202 if (!new_eb_bhs) {
1203 status = -ENOMEM;
1204 mlog_errno(status);
1205 goto bail;
1206 }
1207
1208 /* Firstyly, try to reuse dealloc since we have already estimated how
1209 * many extent blocks we may use.
1210 */
1211 if (!ocfs2_is_dealloc_empty(et)) {
1212 status = ocfs2_reuse_blk_from_dealloc(handle, et,
1213 new_eb_bhs, new_blocks,
1214 &block_given);
1215 if (status < 0) {
1216 mlog_errno(status);
1217 goto bail;
1218 }
1219 }
1220
1221 BUG_ON(block_given > new_blocks);
1222
1223 if (block_given < new_blocks) {
1224 BUG_ON(!meta_ac);
1225 status = ocfs2_create_new_meta_bhs(handle, et,
1226 new_blocks - block_given,
1227 meta_ac,
1228 &new_eb_bhs[block_given]);
1229 if (status < 0) {
1230 mlog_errno(status);
1231 goto bail;
1232 }
1233 }
1234
1235 /* Note: new_eb_bhs[new_blocks - 1] is the guy which will be
1236 * linked with the rest of the tree.
1237 * conversly, new_eb_bhs[0] is the new bottommost leaf.
1238 *
1239 * when we leave the loop, new_last_eb_blk will point to the
1240 * newest leaf, and next_blkno will point to the topmost extent
1241 * block. */
1242 next_blkno = new_last_eb_blk = 0;
1243 for(i = 0; i < new_blocks; i++) {
1244 bh = new_eb_bhs[i];
1245 eb = (struct ocfs2_extent_block *) bh->b_data;
1246 /* ocfs2_create_new_meta_bhs() should create it right! */
1247 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1248 eb_el = &eb->h_list;
1249
1250 status = ocfs2_journal_access_eb(handle, et->et_ci, bh,
1251 OCFS2_JOURNAL_ACCESS_CREATE);
1252 if (status < 0) {
1253 mlog_errno(status);
1254 goto bail;
1255 }
1256
1257 eb->h_next_leaf_blk = 0;
1258 eb_el->l_tree_depth = cpu_to_le16(i);
1259 eb_el->l_next_free_rec = cpu_to_le16(1);
1260 /*
1261 * This actually counts as an empty extent as
1262 * c_clusters == 0
1263 */
1264 eb_el->l_recs[0].e_cpos = cpu_to_le32(new_cpos);
1265 eb_el->l_recs[0].e_blkno = cpu_to_le64(next_blkno);
1266 /*
1267 * eb_el isn't always an interior node, but even leaf
1268 * nodes want a zero'd flags and reserved field so
1269 * this gets the whole 32 bits regardless of use.
1270 */
1271 eb_el->l_recs[0].e_int_clusters = cpu_to_le32(0);
1272 if (!eb_el->l_tree_depth)
1273 new_last_eb_blk = le64_to_cpu(eb->h_blkno);
1274
1275 ocfs2_journal_dirty(handle, bh);
1276 next_blkno = le64_to_cpu(eb->h_blkno);
1277 }
1278
1279 /* This is a bit hairy. We want to update up to three blocks
1280 * here without leaving any of them in an inconsistent state
1281 * in case of error. We don't have to worry about
1282 * journal_dirty erroring as it won't unless we've aborted the
1283 * handle (in which case we would never be here) so reserving
1284 * the write with journal_access is all we need to do. */
1285 status = ocfs2_journal_access_eb(handle, et->et_ci, *last_eb_bh,
1286 OCFS2_JOURNAL_ACCESS_WRITE);
1287 if (status < 0) {
1288 mlog_errno(status);
1289 goto bail;
1290 }
1291 status = ocfs2_et_root_journal_access(handle, et,
1292 OCFS2_JOURNAL_ACCESS_WRITE);
1293 if (status < 0) {
1294 mlog_errno(status);
1295 goto bail;
1296 }
1297 if (eb_bh) {
1298 status = ocfs2_journal_access_eb(handle, et->et_ci, eb_bh,
1299 OCFS2_JOURNAL_ACCESS_WRITE);
1300 if (status < 0) {
1301 mlog_errno(status);
1302 goto bail;
1303 }
1304 }
1305
1306 /* Link the new branch into the rest of the tree (el will
1307 * either be on the root_bh, or the extent block passed in. */
1308 i = le16_to_cpu(el->l_next_free_rec);
1309 el->l_recs[i].e_blkno = cpu_to_le64(next_blkno);
1310 el->l_recs[i].e_cpos = cpu_to_le32(new_cpos);
1311 el->l_recs[i].e_int_clusters = 0;
1312 le16_add_cpu(&el->l_next_free_rec, 1);
1313
1314 /* fe needs a new last extent block pointer, as does the
1315 * next_leaf on the previously last-extent-block. */
1316 ocfs2_et_set_last_eb_blk(et, new_last_eb_blk);
1317
1318 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
1319 eb->h_next_leaf_blk = cpu_to_le64(new_last_eb_blk);
1320
1321 ocfs2_journal_dirty(handle, *last_eb_bh);
1322 ocfs2_journal_dirty(handle, et->et_root_bh);
1323 if (eb_bh)
1324 ocfs2_journal_dirty(handle, eb_bh);
1325
1326 /*
1327 * Some callers want to track the rightmost leaf so pass it
1328 * back here.
1329 */
1330 brelse(*last_eb_bh);
1331 get_bh(new_eb_bhs[0]);
1332 *last_eb_bh = new_eb_bhs[0];
1333
1334 status = 0;
1335bail:
1336 if (new_eb_bhs) {
1337 for (i = 0; i < new_blocks; i++)
1338 brelse(new_eb_bhs[i]);
1339 kfree(new_eb_bhs);
1340 }
1341
1342 return status;
1343}
1344
1345/*
1346 * adds another level to the allocation tree.
1347 * returns back the new extent block so you can add a branch to it
1348 * after this call.
1349 */
1350static int ocfs2_shift_tree_depth(handle_t *handle,
1351 struct ocfs2_extent_tree *et,
1352 struct ocfs2_alloc_context *meta_ac,
1353 struct buffer_head **ret_new_eb_bh)
1354{
1355 int status, i, block_given = 0;
1356 u32 new_clusters;
1357 struct buffer_head *new_eb_bh = NULL;
1358 struct ocfs2_extent_block *eb;
1359 struct ocfs2_extent_list *root_el;
1360 struct ocfs2_extent_list *eb_el;
1361
1362 if (!ocfs2_is_dealloc_empty(et)) {
1363 status = ocfs2_reuse_blk_from_dealloc(handle, et,
1364 &new_eb_bh, 1,
1365 &block_given);
1366 } else if (meta_ac) {
1367 status = ocfs2_create_new_meta_bhs(handle, et, 1, meta_ac,
1368 &new_eb_bh);
1369
1370 } else {
1371 BUG();
1372 }
1373
1374 if (status < 0) {
1375 mlog_errno(status);
1376 goto bail;
1377 }
1378
1379 eb = (struct ocfs2_extent_block *) new_eb_bh->b_data;
1380 /* ocfs2_create_new_meta_bhs() should create it right! */
1381 BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb));
1382
1383 eb_el = &eb->h_list;
1384 root_el = et->et_root_el;
1385
1386 status = ocfs2_journal_access_eb(handle, et->et_ci, new_eb_bh,
1387 OCFS2_JOURNAL_ACCESS_CREATE);
1388 if (status < 0) {
1389 mlog_errno(status);
1390 goto bail;
1391 }
1392
1393 /* copy the root extent list data into the new extent block */
1394 eb_el->l_tree_depth = root_el->l_tree_depth;
1395 eb_el->l_next_free_rec = root_el->l_next_free_rec;
1396 for (i = 0; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1397 eb_el->l_recs[i] = root_el->l_recs[i];
1398
1399 ocfs2_journal_dirty(handle, new_eb_bh);
1400
1401 status = ocfs2_et_root_journal_access(handle, et,
1402 OCFS2_JOURNAL_ACCESS_WRITE);
1403 if (status < 0) {
1404 mlog_errno(status);
1405 goto bail;
1406 }
1407
1408 new_clusters = ocfs2_sum_rightmost_rec(eb_el);
1409
1410 /* update root_bh now */
1411 le16_add_cpu(&root_el->l_tree_depth, 1);
1412 root_el->l_recs[0].e_cpos = 0;
1413 root_el->l_recs[0].e_blkno = eb->h_blkno;
1414 root_el->l_recs[0].e_int_clusters = cpu_to_le32(new_clusters);
1415 for (i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
1416 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
1417 root_el->l_next_free_rec = cpu_to_le16(1);
1418
1419 /* If this is our 1st tree depth shift, then last_eb_blk
1420 * becomes the allocated extent block */
1421 if (root_el->l_tree_depth == cpu_to_le16(1))
1422 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
1423
1424 ocfs2_journal_dirty(handle, et->et_root_bh);
1425
1426 *ret_new_eb_bh = new_eb_bh;
1427 new_eb_bh = NULL;
1428 status = 0;
1429bail:
1430 brelse(new_eb_bh);
1431
1432 return status;
1433}
1434
1435/*
1436 * Should only be called when there is no space left in any of the
1437 * leaf nodes. What we want to do is find the lowest tree depth
1438 * non-leaf extent block with room for new records. There are three
1439 * valid results of this search:
1440 *
1441 * 1) a lowest extent block is found, then we pass it back in
1442 * *lowest_eb_bh and return '0'
1443 *
1444 * 2) the search fails to find anything, but the root_el has room. We
1445 * pass NULL back in *lowest_eb_bh, but still return '0'
1446 *
1447 * 3) the search fails to find anything AND the root_el is full, in
1448 * which case we return > 0
1449 *
1450 * return status < 0 indicates an error.
1451 */
1452static int ocfs2_find_branch_target(struct ocfs2_extent_tree *et,
1453 struct buffer_head **target_bh)
1454{
1455 int status = 0, i;
1456 u64 blkno;
1457 struct ocfs2_extent_block *eb;
1458 struct ocfs2_extent_list *el;
1459 struct buffer_head *bh = NULL;
1460 struct buffer_head *lowest_bh = NULL;
1461
1462 *target_bh = NULL;
1463
1464 el = et->et_root_el;
1465
1466 while(le16_to_cpu(el->l_tree_depth) > 1) {
1467 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1468 status = ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1469 "Owner %llu has empty extent list (next_free_rec == 0)\n",
1470 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
1471 goto bail;
1472 }
1473 i = le16_to_cpu(el->l_next_free_rec) - 1;
1474 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1475 if (!blkno) {
1476 status = ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
1477 "Owner %llu has extent list where extent # %d has no physical block start\n",
1478 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), i);
1479 goto bail;
1480 }
1481
1482 brelse(bh);
1483 bh = NULL;
1484
1485 status = ocfs2_read_extent_block(et->et_ci, blkno, &bh);
1486 if (status < 0) {
1487 mlog_errno(status);
1488 goto bail;
1489 }
1490
1491 eb = (struct ocfs2_extent_block *) bh->b_data;
1492 el = &eb->h_list;
1493
1494 if (le16_to_cpu(el->l_next_free_rec) <
1495 le16_to_cpu(el->l_count)) {
1496 brelse(lowest_bh);
1497 lowest_bh = bh;
1498 get_bh(lowest_bh);
1499 }
1500 }
1501
1502 /* If we didn't find one and the fe doesn't have any room,
1503 * then return '1' */
1504 el = et->et_root_el;
1505 if (!lowest_bh && (el->l_next_free_rec == el->l_count))
1506 status = 1;
1507
1508 *target_bh = lowest_bh;
1509bail:
1510 brelse(bh);
1511
1512 return status;
1513}
1514
1515/*
1516 * Grow a b-tree so that it has more records.
1517 *
1518 * We might shift the tree depth in which case existing paths should
1519 * be considered invalid.
1520 *
1521 * Tree depth after the grow is returned via *final_depth.
1522 *
1523 * *last_eb_bh will be updated by ocfs2_add_branch().
1524 */
1525static int ocfs2_grow_tree(handle_t *handle, struct ocfs2_extent_tree *et,
1526 int *final_depth, struct buffer_head **last_eb_bh,
1527 struct ocfs2_alloc_context *meta_ac)
1528{
1529 int ret, shift;
1530 struct ocfs2_extent_list *el = et->et_root_el;
1531 int depth = le16_to_cpu(el->l_tree_depth);
1532 struct buffer_head *bh = NULL;
1533
1534 BUG_ON(meta_ac == NULL && ocfs2_is_dealloc_empty(et));
1535
1536 shift = ocfs2_find_branch_target(et, &bh);
1537 if (shift < 0) {
1538 ret = shift;
1539 mlog_errno(ret);
1540 goto out;
1541 }
1542
1543 /* We traveled all the way to the bottom of the allocation tree
1544 * and didn't find room for any more extents - we need to add
1545 * another tree level */
1546 if (shift) {
1547 BUG_ON(bh);
1548 trace_ocfs2_grow_tree(
1549 (unsigned long long)
1550 ocfs2_metadata_cache_owner(et->et_ci),
1551 depth);
1552
1553 /* ocfs2_shift_tree_depth will return us a buffer with
1554 * the new extent block (so we can pass that to
1555 * ocfs2_add_branch). */
1556 ret = ocfs2_shift_tree_depth(handle, et, meta_ac, &bh);
1557 if (ret < 0) {
1558 mlog_errno(ret);
1559 goto out;
1560 }
1561 depth++;
1562 if (depth == 1) {
1563 /*
1564 * Special case: we have room now if we shifted from
1565 * tree_depth 0, so no more work needs to be done.
1566 *
1567 * We won't be calling add_branch, so pass
1568 * back *last_eb_bh as the new leaf. At depth
1569 * zero, it should always be null so there's
1570 * no reason to brelse.
1571 */
1572 BUG_ON(*last_eb_bh);
1573 get_bh(bh);
1574 *last_eb_bh = bh;
1575 goto out;
1576 }
1577 }
1578
1579 /* call ocfs2_add_branch to add the final part of the tree with
1580 * the new data. */
1581 ret = ocfs2_add_branch(handle, et, bh, last_eb_bh,
1582 meta_ac);
1583 if (ret < 0)
1584 mlog_errno(ret);
1585
1586out:
1587 if (final_depth)
1588 *final_depth = depth;
1589 brelse(bh);
1590 return ret;
1591}
1592
1593/*
1594 * This function will discard the rightmost extent record.
1595 */
1596static void ocfs2_shift_records_right(struct ocfs2_extent_list *el)
1597{
1598 int next_free = le16_to_cpu(el->l_next_free_rec);
1599 int count = le16_to_cpu(el->l_count);
1600 unsigned int num_bytes;
1601
1602 BUG_ON(!next_free);
1603 /* This will cause us to go off the end of our extent list. */
1604 BUG_ON(next_free >= count);
1605
1606 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1607
1608 memmove(&el->l_recs[1], &el->l_recs[0], num_bytes);
1609}
1610
1611static void ocfs2_rotate_leaf(struct ocfs2_extent_list *el,
1612 struct ocfs2_extent_rec *insert_rec)
1613{
1614 int i, insert_index, next_free, has_empty, num_bytes;
1615 u32 insert_cpos = le32_to_cpu(insert_rec->e_cpos);
1616 struct ocfs2_extent_rec *rec;
1617
1618 next_free = le16_to_cpu(el->l_next_free_rec);
1619 has_empty = ocfs2_is_empty_extent(&el->l_recs[0]);
1620
1621 BUG_ON(!next_free);
1622
1623 /* The tree code before us didn't allow enough room in the leaf. */
1624 BUG_ON(el->l_next_free_rec == el->l_count && !has_empty);
1625
1626 /*
1627 * The easiest way to approach this is to just remove the
1628 * empty extent and temporarily decrement next_free.
1629 */
1630 if (has_empty) {
1631 /*
1632 * If next_free was 1 (only an empty extent), this
1633 * loop won't execute, which is fine. We still want
1634 * the decrement above to happen.
1635 */
1636 for(i = 0; i < (next_free - 1); i++)
1637 el->l_recs[i] = el->l_recs[i+1];
1638
1639 next_free--;
1640 }
1641
1642 /*
1643 * Figure out what the new record index should be.
1644 */
1645 for(i = 0; i < next_free; i++) {
1646 rec = &el->l_recs[i];
1647
1648 if (insert_cpos < le32_to_cpu(rec->e_cpos))
1649 break;
1650 }
1651 insert_index = i;
1652
1653 trace_ocfs2_rotate_leaf(insert_cpos, insert_index,
1654 has_empty, next_free,
1655 le16_to_cpu(el->l_count));
1656
1657 BUG_ON(insert_index < 0);
1658 BUG_ON(insert_index >= le16_to_cpu(el->l_count));
1659 BUG_ON(insert_index > next_free);
1660
1661 /*
1662 * No need to memmove if we're just adding to the tail.
1663 */
1664 if (insert_index != next_free) {
1665 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1666
1667 num_bytes = next_free - insert_index;
1668 num_bytes *= sizeof(struct ocfs2_extent_rec);
1669 memmove(&el->l_recs[insert_index + 1],
1670 &el->l_recs[insert_index],
1671 num_bytes);
1672 }
1673
1674 /*
1675 * Either we had an empty extent, and need to re-increment or
1676 * there was no empty extent on a non full rightmost leaf node,
1677 * in which case we still need to increment.
1678 */
1679 next_free++;
1680 el->l_next_free_rec = cpu_to_le16(next_free);
1681 /*
1682 * Make sure none of the math above just messed up our tree.
1683 */
1684 BUG_ON(le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count));
1685
1686 el->l_recs[insert_index] = *insert_rec;
1687
1688}
1689
1690static void ocfs2_remove_empty_extent(struct ocfs2_extent_list *el)
1691{
1692 int size, num_recs = le16_to_cpu(el->l_next_free_rec);
1693
1694 BUG_ON(num_recs == 0);
1695
1696 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
1697 num_recs--;
1698 size = num_recs * sizeof(struct ocfs2_extent_rec);
1699 memmove(&el->l_recs[0], &el->l_recs[1], size);
1700 memset(&el->l_recs[num_recs], 0,
1701 sizeof(struct ocfs2_extent_rec));
1702 el->l_next_free_rec = cpu_to_le16(num_recs);
1703 }
1704}
1705
1706/*
1707 * Create an empty extent record .
1708 *
1709 * l_next_free_rec may be updated.
1710 *
1711 * If an empty extent already exists do nothing.
1712 */
1713static void ocfs2_create_empty_extent(struct ocfs2_extent_list *el)
1714{
1715 int next_free = le16_to_cpu(el->l_next_free_rec);
1716
1717 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
1718
1719 if (next_free == 0)
1720 goto set_and_inc;
1721
1722 if (ocfs2_is_empty_extent(&el->l_recs[0]))
1723 return;
1724
1725 mlog_bug_on_msg(el->l_count == el->l_next_free_rec,
1726 "Asked to create an empty extent in a full list:\n"
1727 "count = %u, tree depth = %u",
1728 le16_to_cpu(el->l_count),
1729 le16_to_cpu(el->l_tree_depth));
1730
1731 ocfs2_shift_records_right(el);
1732
1733set_and_inc:
1734 le16_add_cpu(&el->l_next_free_rec, 1);
1735 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
1736}
1737
1738/*
1739 * For a rotation which involves two leaf nodes, the "root node" is
1740 * the lowest level tree node which contains a path to both leafs. This
1741 * resulting set of information can be used to form a complete "subtree"
1742 *
1743 * This function is passed two full paths from the dinode down to a
1744 * pair of adjacent leaves. It's task is to figure out which path
1745 * index contains the subtree root - this can be the root index itself
1746 * in a worst-case rotation.
1747 *
1748 * The array index of the subtree root is passed back.
1749 */
1750int ocfs2_find_subtree_root(struct ocfs2_extent_tree *et,
1751 struct ocfs2_path *left,
1752 struct ocfs2_path *right)
1753{
1754 int i = 0;
1755
1756 /*
1757 * Check that the caller passed in two paths from the same tree.
1758 */
1759 BUG_ON(path_root_bh(left) != path_root_bh(right));
1760
1761 do {
1762 i++;
1763
1764 /*
1765 * The caller didn't pass two adjacent paths.
1766 */
1767 mlog_bug_on_msg(i > left->p_tree_depth,
1768 "Owner %llu, left depth %u, right depth %u\n"
1769 "left leaf blk %llu, right leaf blk %llu\n",
1770 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
1771 left->p_tree_depth, right->p_tree_depth,
1772 (unsigned long long)path_leaf_bh(left)->b_blocknr,
1773 (unsigned long long)path_leaf_bh(right)->b_blocknr);
1774 } while (left->p_node[i].bh->b_blocknr ==
1775 right->p_node[i].bh->b_blocknr);
1776
1777 return i - 1;
1778}
1779
1780typedef void (path_insert_t)(void *, struct buffer_head *);
1781
1782/*
1783 * Traverse a btree path in search of cpos, starting at root_el.
1784 *
1785 * This code can be called with a cpos larger than the tree, in which
1786 * case it will return the rightmost path.
1787 */
1788static int __ocfs2_find_path(struct ocfs2_caching_info *ci,
1789 struct ocfs2_extent_list *root_el, u32 cpos,
1790 path_insert_t *func, void *data)
1791{
1792 int i, ret = 0;
1793 u32 range;
1794 u64 blkno;
1795 struct buffer_head *bh = NULL;
1796 struct ocfs2_extent_block *eb;
1797 struct ocfs2_extent_list *el;
1798 struct ocfs2_extent_rec *rec;
1799
1800 el = root_el;
1801 while (el->l_tree_depth) {
1802 if (le16_to_cpu(el->l_next_free_rec) == 0) {
1803 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1804 "Owner %llu has empty extent list at depth %u\n",
1805 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1806 le16_to_cpu(el->l_tree_depth));
1807 ret = -EROFS;
1808 goto out;
1809
1810 }
1811
1812 for(i = 0; i < le16_to_cpu(el->l_next_free_rec) - 1; i++) {
1813 rec = &el->l_recs[i];
1814
1815 /*
1816 * In the case that cpos is off the allocation
1817 * tree, this should just wind up returning the
1818 * rightmost record.
1819 */
1820 range = le32_to_cpu(rec->e_cpos) +
1821 ocfs2_rec_clusters(el, rec);
1822 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
1823 break;
1824 }
1825
1826 blkno = le64_to_cpu(el->l_recs[i].e_blkno);
1827 if (blkno == 0) {
1828 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1829 "Owner %llu has bad blkno in extent list at depth %u (index %d)\n",
1830 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1831 le16_to_cpu(el->l_tree_depth), i);
1832 ret = -EROFS;
1833 goto out;
1834 }
1835
1836 brelse(bh);
1837 bh = NULL;
1838 ret = ocfs2_read_extent_block(ci, blkno, &bh);
1839 if (ret) {
1840 mlog_errno(ret);
1841 goto out;
1842 }
1843
1844 eb = (struct ocfs2_extent_block *) bh->b_data;
1845 el = &eb->h_list;
1846
1847 if (le16_to_cpu(el->l_next_free_rec) >
1848 le16_to_cpu(el->l_count)) {
1849 ocfs2_error(ocfs2_metadata_cache_get_super(ci),
1850 "Owner %llu has bad count in extent list at block %llu (next free=%u, count=%u)\n",
1851 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1852 (unsigned long long)bh->b_blocknr,
1853 le16_to_cpu(el->l_next_free_rec),
1854 le16_to_cpu(el->l_count));
1855 ret = -EROFS;
1856 goto out;
1857 }
1858
1859 if (func)
1860 func(data, bh);
1861 }
1862
1863out:
1864 /*
1865 * Catch any trailing bh that the loop didn't handle.
1866 */
1867 brelse(bh);
1868
1869 return ret;
1870}
1871
1872/*
1873 * Given an initialized path (that is, it has a valid root extent
1874 * list), this function will traverse the btree in search of the path
1875 * which would contain cpos.
1876 *
1877 * The path traveled is recorded in the path structure.
1878 *
1879 * Note that this will not do any comparisons on leaf node extent
1880 * records, so it will work fine in the case that we just added a tree
1881 * branch.
1882 */
1883struct find_path_data {
1884 int index;
1885 struct ocfs2_path *path;
1886};
1887static void find_path_ins(void *data, struct buffer_head *bh)
1888{
1889 struct find_path_data *fp = data;
1890
1891 get_bh(bh);
1892 ocfs2_path_insert_eb(fp->path, fp->index, bh);
1893 fp->index++;
1894}
1895int ocfs2_find_path(struct ocfs2_caching_info *ci,
1896 struct ocfs2_path *path, u32 cpos)
1897{
1898 struct find_path_data data;
1899
1900 data.index = 1;
1901 data.path = path;
1902 return __ocfs2_find_path(ci, path_root_el(path), cpos,
1903 find_path_ins, &data);
1904}
1905
1906static void find_leaf_ins(void *data, struct buffer_head *bh)
1907{
1908 struct ocfs2_extent_block *eb =(struct ocfs2_extent_block *)bh->b_data;
1909 struct ocfs2_extent_list *el = &eb->h_list;
1910 struct buffer_head **ret = data;
1911
1912 /* We want to retain only the leaf block. */
1913 if (le16_to_cpu(el->l_tree_depth) == 0) {
1914 get_bh(bh);
1915 *ret = bh;
1916 }
1917}
1918/*
1919 * Find the leaf block in the tree which would contain cpos. No
1920 * checking of the actual leaf is done.
1921 *
1922 * Some paths want to call this instead of allocating a path structure
1923 * and calling ocfs2_find_path().
1924 *
1925 * This function doesn't handle non btree extent lists.
1926 */
1927int ocfs2_find_leaf(struct ocfs2_caching_info *ci,
1928 struct ocfs2_extent_list *root_el, u32 cpos,
1929 struct buffer_head **leaf_bh)
1930{
1931 int ret;
1932 struct buffer_head *bh = NULL;
1933
1934 ret = __ocfs2_find_path(ci, root_el, cpos, find_leaf_ins, &bh);
1935 if (ret) {
1936 mlog_errno(ret);
1937 goto out;
1938 }
1939
1940 *leaf_bh = bh;
1941out:
1942 return ret;
1943}
1944
1945/*
1946 * Adjust the adjacent records (left_rec, right_rec) involved in a rotation.
1947 *
1948 * Basically, we've moved stuff around at the bottom of the tree and
1949 * we need to fix up the extent records above the changes to reflect
1950 * the new changes.
1951 *
1952 * left_rec: the record on the left.
1953 * right_rec: the record to the right of left_rec
1954 * right_child_el: is the child list pointed to by right_rec
1955 *
1956 * By definition, this only works on interior nodes.
1957 */
1958static void ocfs2_adjust_adjacent_records(struct ocfs2_extent_rec *left_rec,
1959 struct ocfs2_extent_rec *right_rec,
1960 struct ocfs2_extent_list *right_child_el)
1961{
1962 u32 left_clusters, right_end;
1963
1964 /*
1965 * Interior nodes never have holes. Their cpos is the cpos of
1966 * the leftmost record in their child list. Their cluster
1967 * count covers the full theoretical range of their child list
1968 * - the range between their cpos and the cpos of the record
1969 * immediately to their right.
1970 */
1971 left_clusters = le32_to_cpu(right_child_el->l_recs[0].e_cpos);
1972 if (!ocfs2_rec_clusters(right_child_el, &right_child_el->l_recs[0])) {
1973 BUG_ON(right_child_el->l_tree_depth);
1974 BUG_ON(le16_to_cpu(right_child_el->l_next_free_rec) <= 1);
1975 left_clusters = le32_to_cpu(right_child_el->l_recs[1].e_cpos);
1976 }
1977 left_clusters -= le32_to_cpu(left_rec->e_cpos);
1978 left_rec->e_int_clusters = cpu_to_le32(left_clusters);
1979
1980 /*
1981 * Calculate the rightmost cluster count boundary before
1982 * moving cpos - we will need to adjust clusters after
1983 * updating e_cpos to keep the same highest cluster count.
1984 */
1985 right_end = le32_to_cpu(right_rec->e_cpos);
1986 right_end += le32_to_cpu(right_rec->e_int_clusters);
1987
1988 right_rec->e_cpos = left_rec->e_cpos;
1989 le32_add_cpu(&right_rec->e_cpos, left_clusters);
1990
1991 right_end -= le32_to_cpu(right_rec->e_cpos);
1992 right_rec->e_int_clusters = cpu_to_le32(right_end);
1993}
1994
1995/*
1996 * Adjust the adjacent root node records involved in a
1997 * rotation. left_el_blkno is passed in as a key so that we can easily
1998 * find it's index in the root list.
1999 */
2000static void ocfs2_adjust_root_records(struct ocfs2_extent_list *root_el,
2001 struct ocfs2_extent_list *left_el,
2002 struct ocfs2_extent_list *right_el,
2003 u64 left_el_blkno)
2004{
2005 int i;
2006
2007 BUG_ON(le16_to_cpu(root_el->l_tree_depth) <=
2008 le16_to_cpu(left_el->l_tree_depth));
2009
2010 for(i = 0; i < le16_to_cpu(root_el->l_next_free_rec) - 1; i++) {
2011 if (le64_to_cpu(root_el->l_recs[i].e_blkno) == left_el_blkno)
2012 break;
2013 }
2014
2015 /*
2016 * The path walking code should have never returned a root and
2017 * two paths which are not adjacent.
2018 */
2019 BUG_ON(i >= (le16_to_cpu(root_el->l_next_free_rec) - 1));
2020
2021 ocfs2_adjust_adjacent_records(&root_el->l_recs[i],
2022 &root_el->l_recs[i + 1], right_el);
2023}
2024
2025/*
2026 * We've changed a leaf block (in right_path) and need to reflect that
2027 * change back up the subtree.
2028 *
2029 * This happens in multiple places:
2030 * - When we've moved an extent record from the left path leaf to the right
2031 * path leaf to make room for an empty extent in the left path leaf.
2032 * - When our insert into the right path leaf is at the leftmost edge
2033 * and requires an update of the path immediately to it's left. This
2034 * can occur at the end of some types of rotation and appending inserts.
2035 * - When we've adjusted the last extent record in the left path leaf and the
2036 * 1st extent record in the right path leaf during cross extent block merge.
2037 */
2038static void ocfs2_complete_edge_insert(handle_t *handle,
2039 struct ocfs2_path *left_path,
2040 struct ocfs2_path *right_path,
2041 int subtree_index)
2042{
2043 int i, idx;
2044 struct ocfs2_extent_list *el, *left_el, *right_el;
2045 struct ocfs2_extent_rec *left_rec, *right_rec;
2046 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2047
2048 /*
2049 * Update the counts and position values within all the
2050 * interior nodes to reflect the leaf rotation we just did.
2051 *
2052 * The root node is handled below the loop.
2053 *
2054 * We begin the loop with right_el and left_el pointing to the
2055 * leaf lists and work our way up.
2056 *
2057 * NOTE: within this loop, left_el and right_el always refer
2058 * to the *child* lists.
2059 */
2060 left_el = path_leaf_el(left_path);
2061 right_el = path_leaf_el(right_path);
2062 for(i = left_path->p_tree_depth - 1; i > subtree_index; i--) {
2063 trace_ocfs2_complete_edge_insert(i);
2064
2065 /*
2066 * One nice property of knowing that all of these
2067 * nodes are below the root is that we only deal with
2068 * the leftmost right node record and the rightmost
2069 * left node record.
2070 */
2071 el = left_path->p_node[i].el;
2072 idx = le16_to_cpu(left_el->l_next_free_rec) - 1;
2073 left_rec = &el->l_recs[idx];
2074
2075 el = right_path->p_node[i].el;
2076 right_rec = &el->l_recs[0];
2077
2078 ocfs2_adjust_adjacent_records(left_rec, right_rec, right_el);
2079
2080 ocfs2_journal_dirty(handle, left_path->p_node[i].bh);
2081 ocfs2_journal_dirty(handle, right_path->p_node[i].bh);
2082
2083 /*
2084 * Setup our list pointers now so that the current
2085 * parents become children in the next iteration.
2086 */
2087 left_el = left_path->p_node[i].el;
2088 right_el = right_path->p_node[i].el;
2089 }
2090
2091 /*
2092 * At the root node, adjust the two adjacent records which
2093 * begin our path to the leaves.
2094 */
2095
2096 el = left_path->p_node[subtree_index].el;
2097 left_el = left_path->p_node[subtree_index + 1].el;
2098 right_el = right_path->p_node[subtree_index + 1].el;
2099
2100 ocfs2_adjust_root_records(el, left_el, right_el,
2101 left_path->p_node[subtree_index + 1].bh->b_blocknr);
2102
2103 root_bh = left_path->p_node[subtree_index].bh;
2104
2105 ocfs2_journal_dirty(handle, root_bh);
2106}
2107
2108static int ocfs2_rotate_subtree_right(handle_t *handle,
2109 struct ocfs2_extent_tree *et,
2110 struct ocfs2_path *left_path,
2111 struct ocfs2_path *right_path,
2112 int subtree_index)
2113{
2114 int ret, i;
2115 struct buffer_head *right_leaf_bh;
2116 struct buffer_head *left_leaf_bh = NULL;
2117 struct buffer_head *root_bh;
2118 struct ocfs2_extent_list *right_el, *left_el;
2119 struct ocfs2_extent_rec move_rec;
2120
2121 left_leaf_bh = path_leaf_bh(left_path);
2122 left_el = path_leaf_el(left_path);
2123
2124 if (left_el->l_next_free_rec != left_el->l_count) {
2125 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
2126 "Inode %llu has non-full interior leaf node %llu (next free = %u)\n",
2127 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2128 (unsigned long long)left_leaf_bh->b_blocknr,
2129 le16_to_cpu(left_el->l_next_free_rec));
2130 return -EROFS;
2131 }
2132
2133 /*
2134 * This extent block may already have an empty record, so we
2135 * return early if so.
2136 */
2137 if (ocfs2_is_empty_extent(&left_el->l_recs[0]))
2138 return 0;
2139
2140 root_bh = left_path->p_node[subtree_index].bh;
2141 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2142
2143 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2144 subtree_index);
2145 if (ret) {
2146 mlog_errno(ret);
2147 goto out;
2148 }
2149
2150 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2151 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2152 right_path, i);
2153 if (ret) {
2154 mlog_errno(ret);
2155 goto out;
2156 }
2157
2158 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2159 left_path, i);
2160 if (ret) {
2161 mlog_errno(ret);
2162 goto out;
2163 }
2164 }
2165
2166 right_leaf_bh = path_leaf_bh(right_path);
2167 right_el = path_leaf_el(right_path);
2168
2169 /* This is a code error, not a disk corruption. */
2170 mlog_bug_on_msg(!right_el->l_next_free_rec, "Inode %llu: Rotate fails "
2171 "because rightmost leaf block %llu is empty\n",
2172 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2173 (unsigned long long)right_leaf_bh->b_blocknr);
2174
2175 ocfs2_create_empty_extent(right_el);
2176
2177 ocfs2_journal_dirty(handle, right_leaf_bh);
2178
2179 /* Do the copy now. */
2180 i = le16_to_cpu(left_el->l_next_free_rec) - 1;
2181 move_rec = left_el->l_recs[i];
2182 right_el->l_recs[0] = move_rec;
2183
2184 /*
2185 * Clear out the record we just copied and shift everything
2186 * over, leaving an empty extent in the left leaf.
2187 *
2188 * We temporarily subtract from next_free_rec so that the
2189 * shift will lose the tail record (which is now defunct).
2190 */
2191 le16_add_cpu(&left_el->l_next_free_rec, -1);
2192 ocfs2_shift_records_right(left_el);
2193 memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2194 le16_add_cpu(&left_el->l_next_free_rec, 1);
2195
2196 ocfs2_journal_dirty(handle, left_leaf_bh);
2197
2198 ocfs2_complete_edge_insert(handle, left_path, right_path,
2199 subtree_index);
2200
2201out:
2202 return ret;
2203}
2204
2205/*
2206 * Given a full path, determine what cpos value would return us a path
2207 * containing the leaf immediately to the left of the current one.
2208 *
2209 * Will return zero if the path passed in is already the leftmost path.
2210 */
2211int ocfs2_find_cpos_for_left_leaf(struct super_block *sb,
2212 struct ocfs2_path *path, u32 *cpos)
2213{
2214 int i, j, ret = 0;
2215 u64 blkno;
2216 struct ocfs2_extent_list *el;
2217
2218 BUG_ON(path->p_tree_depth == 0);
2219
2220 *cpos = 0;
2221
2222 blkno = path_leaf_bh(path)->b_blocknr;
2223
2224 /* Start at the tree node just above the leaf and work our way up. */
2225 i = path->p_tree_depth - 1;
2226 while (i >= 0) {
2227 el = path->p_node[i].el;
2228
2229 /*
2230 * Find the extent record just before the one in our
2231 * path.
2232 */
2233 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2234 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2235 if (j == 0) {
2236 if (i == 0) {
2237 /*
2238 * We've determined that the
2239 * path specified is already
2240 * the leftmost one - return a
2241 * cpos of zero.
2242 */
2243 goto out;
2244 }
2245 /*
2246 * The leftmost record points to our
2247 * leaf - we need to travel up the
2248 * tree one level.
2249 */
2250 goto next_node;
2251 }
2252
2253 *cpos = le32_to_cpu(el->l_recs[j - 1].e_cpos);
2254 *cpos = *cpos + ocfs2_rec_clusters(el,
2255 &el->l_recs[j - 1]);
2256 *cpos = *cpos - 1;
2257 goto out;
2258 }
2259 }
2260
2261 /*
2262 * If we got here, we never found a valid node where
2263 * the tree indicated one should be.
2264 */
2265 ocfs2_error(sb, "Invalid extent tree at extent block %llu\n",
2266 (unsigned long long)blkno);
2267 ret = -EROFS;
2268 goto out;
2269
2270next_node:
2271 blkno = path->p_node[i].bh->b_blocknr;
2272 i--;
2273 }
2274
2275out:
2276 return ret;
2277}
2278
2279/*
2280 * Extend the transaction by enough credits to complete the rotation,
2281 * and still leave at least the original number of credits allocated
2282 * to this transaction.
2283 */
2284static int ocfs2_extend_rotate_transaction(handle_t *handle, int subtree_depth,
2285 int op_credits,
2286 struct ocfs2_path *path)
2287{
2288 int ret = 0;
2289 int credits = (path->p_tree_depth - subtree_depth) * 2 + 1 + op_credits;
2290
2291 if (handle->h_buffer_credits < credits)
2292 ret = ocfs2_extend_trans(handle,
2293 credits - handle->h_buffer_credits);
2294
2295 return ret;
2296}
2297
2298/*
2299 * Trap the case where we're inserting into the theoretical range past
2300 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2301 * whose cpos is less than ours into the right leaf.
2302 *
2303 * It's only necessary to look at the rightmost record of the left
2304 * leaf because the logic that calls us should ensure that the
2305 * theoretical ranges in the path components above the leaves are
2306 * correct.
2307 */
2308static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path,
2309 u32 insert_cpos)
2310{
2311 struct ocfs2_extent_list *left_el;
2312 struct ocfs2_extent_rec *rec;
2313 int next_free;
2314
2315 left_el = path_leaf_el(left_path);
2316 next_free = le16_to_cpu(left_el->l_next_free_rec);
2317 rec = &left_el->l_recs[next_free - 1];
2318
2319 if (insert_cpos > le32_to_cpu(rec->e_cpos))
2320 return 1;
2321 return 0;
2322}
2323
2324static int ocfs2_leftmost_rec_contains(struct ocfs2_extent_list *el, u32 cpos)
2325{
2326 int next_free = le16_to_cpu(el->l_next_free_rec);
2327 unsigned int range;
2328 struct ocfs2_extent_rec *rec;
2329
2330 if (next_free == 0)
2331 return 0;
2332
2333 rec = &el->l_recs[0];
2334 if (ocfs2_is_empty_extent(rec)) {
2335 /* Empty list. */
2336 if (next_free == 1)
2337 return 0;
2338 rec = &el->l_recs[1];
2339 }
2340
2341 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2342 if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range)
2343 return 1;
2344 return 0;
2345}
2346
2347/*
2348 * Rotate all the records in a btree right one record, starting at insert_cpos.
2349 *
2350 * The path to the rightmost leaf should be passed in.
2351 *
2352 * The array is assumed to be large enough to hold an entire path (tree depth).
2353 *
2354 * Upon successful return from this function:
2355 *
2356 * - The 'right_path' array will contain a path to the leaf block
2357 * whose range contains e_cpos.
2358 * - That leaf block will have a single empty extent in list index 0.
2359 * - In the case that the rotation requires a post-insert update,
2360 * *ret_left_path will contain a valid path which can be passed to
2361 * ocfs2_insert_path().
2362 */
2363static int ocfs2_rotate_tree_right(handle_t *handle,
2364 struct ocfs2_extent_tree *et,
2365 enum ocfs2_split_type split,
2366 u32 insert_cpos,
2367 struct ocfs2_path *right_path,
2368 struct ocfs2_path **ret_left_path)
2369{
2370 int ret, start, orig_credits = handle->h_buffer_credits;
2371 u32 cpos;
2372 struct ocfs2_path *left_path = NULL;
2373 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2374
2375 *ret_left_path = NULL;
2376
2377 left_path = ocfs2_new_path_from_path(right_path);
2378 if (!left_path) {
2379 ret = -ENOMEM;
2380 mlog_errno(ret);
2381 goto out;
2382 }
2383
2384 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2385 if (ret) {
2386 mlog_errno(ret);
2387 goto out;
2388 }
2389
2390 trace_ocfs2_rotate_tree_right(
2391 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2392 insert_cpos, cpos);
2393
2394 /*
2395 * What we want to do here is:
2396 *
2397 * 1) Start with the rightmost path.
2398 *
2399 * 2) Determine a path to the leaf block directly to the left
2400 * of that leaf.
2401 *
2402 * 3) Determine the 'subtree root' - the lowest level tree node
2403 * which contains a path to both leaves.
2404 *
2405 * 4) Rotate the subtree.
2406 *
2407 * 5) Find the next subtree by considering the left path to be
2408 * the new right path.
2409 *
2410 * The check at the top of this while loop also accepts
2411 * insert_cpos == cpos because cpos is only a _theoretical_
2412 * value to get us the left path - insert_cpos might very well
2413 * be filling that hole.
2414 *
2415 * Stop at a cpos of '0' because we either started at the
2416 * leftmost branch (i.e., a tree with one branch and a
2417 * rotation inside of it), or we've gone as far as we can in
2418 * rotating subtrees.
2419 */
2420 while (cpos && insert_cpos <= cpos) {
2421 trace_ocfs2_rotate_tree_right(
2422 (unsigned long long)
2423 ocfs2_metadata_cache_owner(et->et_ci),
2424 insert_cpos, cpos);
2425
2426 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
2427 if (ret) {
2428 mlog_errno(ret);
2429 goto out;
2430 }
2431
2432 mlog_bug_on_msg(path_leaf_bh(left_path) ==
2433 path_leaf_bh(right_path),
2434 "Owner %llu: error during insert of %u "
2435 "(left path cpos %u) results in two identical "
2436 "paths ending at %llu\n",
2437 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2438 insert_cpos, cpos,
2439 (unsigned long long)
2440 path_leaf_bh(left_path)->b_blocknr);
2441
2442 if (split == SPLIT_NONE &&
2443 ocfs2_rotate_requires_path_adjustment(left_path,
2444 insert_cpos)) {
2445
2446 /*
2447 * We've rotated the tree as much as we
2448 * should. The rest is up to
2449 * ocfs2_insert_path() to complete, after the
2450 * record insertion. We indicate this
2451 * situation by returning the left path.
2452 *
2453 * The reason we don't adjust the records here
2454 * before the record insert is that an error
2455 * later might break the rule where a parent
2456 * record e_cpos will reflect the actual
2457 * e_cpos of the 1st nonempty record of the
2458 * child list.
2459 */
2460 *ret_left_path = left_path;
2461 goto out_ret_path;
2462 }
2463
2464 start = ocfs2_find_subtree_root(et, left_path, right_path);
2465
2466 trace_ocfs2_rotate_subtree(start,
2467 (unsigned long long)
2468 right_path->p_node[start].bh->b_blocknr,
2469 right_path->p_tree_depth);
2470
2471 ret = ocfs2_extend_rotate_transaction(handle, start,
2472 orig_credits, right_path);
2473 if (ret) {
2474 mlog_errno(ret);
2475 goto out;
2476 }
2477
2478 ret = ocfs2_rotate_subtree_right(handle, et, left_path,
2479 right_path, start);
2480 if (ret) {
2481 mlog_errno(ret);
2482 goto out;
2483 }
2484
2485 if (split != SPLIT_NONE &&
2486 ocfs2_leftmost_rec_contains(path_leaf_el(right_path),
2487 insert_cpos)) {
2488 /*
2489 * A rotate moves the rightmost left leaf
2490 * record over to the leftmost right leaf
2491 * slot. If we're doing an extent split
2492 * instead of a real insert, then we have to
2493 * check that the extent to be split wasn't
2494 * just moved over. If it was, then we can
2495 * exit here, passing left_path back -
2496 * ocfs2_split_extent() is smart enough to
2497 * search both leaves.
2498 */
2499 *ret_left_path = left_path;
2500 goto out_ret_path;
2501 }
2502
2503 /*
2504 * There is no need to re-read the next right path
2505 * as we know that it'll be our current left
2506 * path. Optimize by copying values instead.
2507 */
2508 ocfs2_mv_path(right_path, left_path);
2509
2510 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos);
2511 if (ret) {
2512 mlog_errno(ret);
2513 goto out;
2514 }
2515 }
2516
2517out:
2518 ocfs2_free_path(left_path);
2519
2520out_ret_path:
2521 return ret;
2522}
2523
2524static int ocfs2_update_edge_lengths(handle_t *handle,
2525 struct ocfs2_extent_tree *et,
2526 struct ocfs2_path *path)
2527{
2528 int i, idx, ret;
2529 struct ocfs2_extent_rec *rec;
2530 struct ocfs2_extent_list *el;
2531 struct ocfs2_extent_block *eb;
2532 u32 range;
2533
2534 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
2535 if (ret) {
2536 mlog_errno(ret);
2537 goto out;
2538 }
2539
2540 /* Path should always be rightmost. */
2541 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
2542 BUG_ON(eb->h_next_leaf_blk != 0ULL);
2543
2544 el = &eb->h_list;
2545 BUG_ON(le16_to_cpu(el->l_next_free_rec) == 0);
2546 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2547 rec = &el->l_recs[idx];
2548 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
2549
2550 for (i = 0; i < path->p_tree_depth; i++) {
2551 el = path->p_node[i].el;
2552 idx = le16_to_cpu(el->l_next_free_rec) - 1;
2553 rec = &el->l_recs[idx];
2554
2555 rec->e_int_clusters = cpu_to_le32(range);
2556 le32_add_cpu(&rec->e_int_clusters, -le32_to_cpu(rec->e_cpos));
2557
2558 ocfs2_journal_dirty(handle, path->p_node[i].bh);
2559 }
2560out:
2561 return ret;
2562}
2563
2564static void ocfs2_unlink_path(handle_t *handle,
2565 struct ocfs2_extent_tree *et,
2566 struct ocfs2_cached_dealloc_ctxt *dealloc,
2567 struct ocfs2_path *path, int unlink_start)
2568{
2569 int ret, i;
2570 struct ocfs2_extent_block *eb;
2571 struct ocfs2_extent_list *el;
2572 struct buffer_head *bh;
2573
2574 for(i = unlink_start; i < path_num_items(path); i++) {
2575 bh = path->p_node[i].bh;
2576
2577 eb = (struct ocfs2_extent_block *)bh->b_data;
2578 /*
2579 * Not all nodes might have had their final count
2580 * decremented by the caller - handle this here.
2581 */
2582 el = &eb->h_list;
2583 if (le16_to_cpu(el->l_next_free_rec) > 1) {
2584 mlog(ML_ERROR,
2585 "Inode %llu, attempted to remove extent block "
2586 "%llu with %u records\n",
2587 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
2588 (unsigned long long)le64_to_cpu(eb->h_blkno),
2589 le16_to_cpu(el->l_next_free_rec));
2590
2591 ocfs2_journal_dirty(handle, bh);
2592 ocfs2_remove_from_cache(et->et_ci, bh);
2593 continue;
2594 }
2595
2596 el->l_next_free_rec = 0;
2597 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2598
2599 ocfs2_journal_dirty(handle, bh);
2600
2601 ret = ocfs2_cache_extent_block_free(dealloc, eb);
2602 if (ret)
2603 mlog_errno(ret);
2604
2605 ocfs2_remove_from_cache(et->et_ci, bh);
2606 }
2607}
2608
2609static void ocfs2_unlink_subtree(handle_t *handle,
2610 struct ocfs2_extent_tree *et,
2611 struct ocfs2_path *left_path,
2612 struct ocfs2_path *right_path,
2613 int subtree_index,
2614 struct ocfs2_cached_dealloc_ctxt *dealloc)
2615{
2616 int i;
2617 struct buffer_head *root_bh = left_path->p_node[subtree_index].bh;
2618 struct ocfs2_extent_list *root_el = left_path->p_node[subtree_index].el;
2619 struct ocfs2_extent_block *eb;
2620
2621 eb = (struct ocfs2_extent_block *)right_path->p_node[subtree_index + 1].bh->b_data;
2622
2623 for(i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++)
2624 if (root_el->l_recs[i].e_blkno == eb->h_blkno)
2625 break;
2626
2627 BUG_ON(i >= le16_to_cpu(root_el->l_next_free_rec));
2628
2629 memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec));
2630 le16_add_cpu(&root_el->l_next_free_rec, -1);
2631
2632 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2633 eb->h_next_leaf_blk = 0;
2634
2635 ocfs2_journal_dirty(handle, root_bh);
2636 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2637
2638 ocfs2_unlink_path(handle, et, dealloc, right_path,
2639 subtree_index + 1);
2640}
2641
2642static int ocfs2_rotate_subtree_left(handle_t *handle,
2643 struct ocfs2_extent_tree *et,
2644 struct ocfs2_path *left_path,
2645 struct ocfs2_path *right_path,
2646 int subtree_index,
2647 struct ocfs2_cached_dealloc_ctxt *dealloc,
2648 int *deleted)
2649{
2650 int ret, i, del_right_subtree = 0, right_has_empty = 0;
2651 struct buffer_head *root_bh, *et_root_bh = path_root_bh(right_path);
2652 struct ocfs2_extent_list *right_leaf_el, *left_leaf_el;
2653 struct ocfs2_extent_block *eb;
2654
2655 *deleted = 0;
2656
2657 right_leaf_el = path_leaf_el(right_path);
2658 left_leaf_el = path_leaf_el(left_path);
2659 root_bh = left_path->p_node[subtree_index].bh;
2660 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
2661
2662 if (!ocfs2_is_empty_extent(&left_leaf_el->l_recs[0]))
2663 return 0;
2664
2665 eb = (struct ocfs2_extent_block *)path_leaf_bh(right_path)->b_data;
2666 if (ocfs2_is_empty_extent(&right_leaf_el->l_recs[0])) {
2667 /*
2668 * It's legal for us to proceed if the right leaf is
2669 * the rightmost one and it has an empty extent. There
2670 * are two cases to handle - whether the leaf will be
2671 * empty after removal or not. If the leaf isn't empty
2672 * then just remove the empty extent up front. The
2673 * next block will handle empty leaves by flagging
2674 * them for unlink.
2675 *
2676 * Non rightmost leaves will throw -EAGAIN and the
2677 * caller can manually move the subtree and retry.
2678 */
2679
2680 if (eb->h_next_leaf_blk != 0ULL)
2681 return -EAGAIN;
2682
2683 if (le16_to_cpu(right_leaf_el->l_next_free_rec) > 1) {
2684 ret = ocfs2_journal_access_eb(handle, et->et_ci,
2685 path_leaf_bh(right_path),
2686 OCFS2_JOURNAL_ACCESS_WRITE);
2687 if (ret) {
2688 mlog_errno(ret);
2689 goto out;
2690 }
2691
2692 ocfs2_remove_empty_extent(right_leaf_el);
2693 } else
2694 right_has_empty = 1;
2695 }
2696
2697 if (eb->h_next_leaf_blk == 0ULL &&
2698 le16_to_cpu(right_leaf_el->l_next_free_rec) == 1) {
2699 /*
2700 * We have to update i_last_eb_blk during the meta
2701 * data delete.
2702 */
2703 ret = ocfs2_et_root_journal_access(handle, et,
2704 OCFS2_JOURNAL_ACCESS_WRITE);
2705 if (ret) {
2706 mlog_errno(ret);
2707 goto out;
2708 }
2709
2710 del_right_subtree = 1;
2711 }
2712
2713 /*
2714 * Getting here with an empty extent in the right path implies
2715 * that it's the rightmost path and will be deleted.
2716 */
2717 BUG_ON(right_has_empty && !del_right_subtree);
2718
2719 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
2720 subtree_index);
2721 if (ret) {
2722 mlog_errno(ret);
2723 goto out;
2724 }
2725
2726 for(i = subtree_index + 1; i < path_num_items(right_path); i++) {
2727 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2728 right_path, i);
2729 if (ret) {
2730 mlog_errno(ret);
2731 goto out;
2732 }
2733
2734 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2735 left_path, i);
2736 if (ret) {
2737 mlog_errno(ret);
2738 goto out;
2739 }
2740 }
2741
2742 if (!right_has_empty) {
2743 /*
2744 * Only do this if we're moving a real
2745 * record. Otherwise, the action is delayed until
2746 * after removal of the right path in which case we
2747 * can do a simple shift to remove the empty extent.
2748 */
2749 ocfs2_rotate_leaf(left_leaf_el, &right_leaf_el->l_recs[0]);
2750 memset(&right_leaf_el->l_recs[0], 0,
2751 sizeof(struct ocfs2_extent_rec));
2752 }
2753 if (eb->h_next_leaf_blk == 0ULL) {
2754 /*
2755 * Move recs over to get rid of empty extent, decrease
2756 * next_free. This is allowed to remove the last
2757 * extent in our leaf (setting l_next_free_rec to
2758 * zero) - the delete code below won't care.
2759 */
2760 ocfs2_remove_empty_extent(right_leaf_el);
2761 }
2762
2763 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
2764 ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
2765
2766 if (del_right_subtree) {
2767 ocfs2_unlink_subtree(handle, et, left_path, right_path,
2768 subtree_index, dealloc);
2769 ret = ocfs2_update_edge_lengths(handle, et, left_path);
2770 if (ret) {
2771 mlog_errno(ret);
2772 goto out;
2773 }
2774
2775 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
2776 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
2777
2778 /*
2779 * Removal of the extent in the left leaf was skipped
2780 * above so we could delete the right path
2781 * 1st.
2782 */
2783 if (right_has_empty)
2784 ocfs2_remove_empty_extent(left_leaf_el);
2785
2786 ocfs2_journal_dirty(handle, et_root_bh);
2787
2788 *deleted = 1;
2789 } else
2790 ocfs2_complete_edge_insert(handle, left_path, right_path,
2791 subtree_index);
2792
2793out:
2794 return ret;
2795}
2796
2797/*
2798 * Given a full path, determine what cpos value would return us a path
2799 * containing the leaf immediately to the right of the current one.
2800 *
2801 * Will return zero if the path passed in is already the rightmost path.
2802 *
2803 * This looks similar, but is subtly different to
2804 * ocfs2_find_cpos_for_left_leaf().
2805 */
2806int ocfs2_find_cpos_for_right_leaf(struct super_block *sb,
2807 struct ocfs2_path *path, u32 *cpos)
2808{
2809 int i, j, ret = 0;
2810 u64 blkno;
2811 struct ocfs2_extent_list *el;
2812
2813 *cpos = 0;
2814
2815 if (path->p_tree_depth == 0)
2816 return 0;
2817
2818 blkno = path_leaf_bh(path)->b_blocknr;
2819
2820 /* Start at the tree node just above the leaf and work our way up. */
2821 i = path->p_tree_depth - 1;
2822 while (i >= 0) {
2823 int next_free;
2824
2825 el = path->p_node[i].el;
2826
2827 /*
2828 * Find the extent record just after the one in our
2829 * path.
2830 */
2831 next_free = le16_to_cpu(el->l_next_free_rec);
2832 for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) {
2833 if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) {
2834 if (j == (next_free - 1)) {
2835 if (i == 0) {
2836 /*
2837 * We've determined that the
2838 * path specified is already
2839 * the rightmost one - return a
2840 * cpos of zero.
2841 */
2842 goto out;
2843 }
2844 /*
2845 * The rightmost record points to our
2846 * leaf - we need to travel up the
2847 * tree one level.
2848 */
2849 goto next_node;
2850 }
2851
2852 *cpos = le32_to_cpu(el->l_recs[j + 1].e_cpos);
2853 goto out;
2854 }
2855 }
2856
2857 /*
2858 * If we got here, we never found a valid node where
2859 * the tree indicated one should be.
2860 */
2861 ocfs2_error(sb, "Invalid extent tree at extent block %llu\n",
2862 (unsigned long long)blkno);
2863 ret = -EROFS;
2864 goto out;
2865
2866next_node:
2867 blkno = path->p_node[i].bh->b_blocknr;
2868 i--;
2869 }
2870
2871out:
2872 return ret;
2873}
2874
2875static int ocfs2_rotate_rightmost_leaf_left(handle_t *handle,
2876 struct ocfs2_extent_tree *et,
2877 struct ocfs2_path *path)
2878{
2879 int ret;
2880 struct buffer_head *bh = path_leaf_bh(path);
2881 struct ocfs2_extent_list *el = path_leaf_el(path);
2882
2883 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
2884 return 0;
2885
2886 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path,
2887 path_num_items(path) - 1);
2888 if (ret) {
2889 mlog_errno(ret);
2890 goto out;
2891 }
2892
2893 ocfs2_remove_empty_extent(el);
2894 ocfs2_journal_dirty(handle, bh);
2895
2896out:
2897 return ret;
2898}
2899
2900static int __ocfs2_rotate_tree_left(handle_t *handle,
2901 struct ocfs2_extent_tree *et,
2902 int orig_credits,
2903 struct ocfs2_path *path,
2904 struct ocfs2_cached_dealloc_ctxt *dealloc,
2905 struct ocfs2_path **empty_extent_path)
2906{
2907 int ret, subtree_root, deleted;
2908 u32 right_cpos;
2909 struct ocfs2_path *left_path = NULL;
2910 struct ocfs2_path *right_path = NULL;
2911 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
2912
2913 if (!ocfs2_is_empty_extent(&(path_leaf_el(path)->l_recs[0])))
2914 return 0;
2915
2916 *empty_extent_path = NULL;
2917
2918 ret = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos);
2919 if (ret) {
2920 mlog_errno(ret);
2921 goto out;
2922 }
2923
2924 left_path = ocfs2_new_path_from_path(path);
2925 if (!left_path) {
2926 ret = -ENOMEM;
2927 mlog_errno(ret);
2928 goto out;
2929 }
2930
2931 ocfs2_cp_path(left_path, path);
2932
2933 right_path = ocfs2_new_path_from_path(path);
2934 if (!right_path) {
2935 ret = -ENOMEM;
2936 mlog_errno(ret);
2937 goto out;
2938 }
2939
2940 while (right_cpos) {
2941 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
2942 if (ret) {
2943 mlog_errno(ret);
2944 goto out;
2945 }
2946
2947 subtree_root = ocfs2_find_subtree_root(et, left_path,
2948 right_path);
2949
2950 trace_ocfs2_rotate_subtree(subtree_root,
2951 (unsigned long long)
2952 right_path->p_node[subtree_root].bh->b_blocknr,
2953 right_path->p_tree_depth);
2954
2955 ret = ocfs2_extend_rotate_transaction(handle, 0,
2956 orig_credits, left_path);
2957 if (ret) {
2958 mlog_errno(ret);
2959 goto out;
2960 }
2961
2962 /*
2963 * Caller might still want to make changes to the
2964 * tree root, so re-add it to the journal here.
2965 */
2966 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
2967 left_path, 0);
2968 if (ret) {
2969 mlog_errno(ret);
2970 goto out;
2971 }
2972
2973 ret = ocfs2_rotate_subtree_left(handle, et, left_path,
2974 right_path, subtree_root,
2975 dealloc, &deleted);
2976 if (ret == -EAGAIN) {
2977 /*
2978 * The rotation has to temporarily stop due to
2979 * the right subtree having an empty
2980 * extent. Pass it back to the caller for a
2981 * fixup.
2982 */
2983 *empty_extent_path = right_path;
2984 right_path = NULL;
2985 goto out;
2986 }
2987 if (ret) {
2988 mlog_errno(ret);
2989 goto out;
2990 }
2991
2992 /*
2993 * The subtree rotate might have removed records on
2994 * the rightmost edge. If so, then rotation is
2995 * complete.
2996 */
2997 if (deleted)
2998 break;
2999
3000 ocfs2_mv_path(left_path, right_path);
3001
3002 ret = ocfs2_find_cpos_for_right_leaf(sb, left_path,
3003 &right_cpos);
3004 if (ret) {
3005 mlog_errno(ret);
3006 goto out;
3007 }
3008 }
3009
3010out:
3011 ocfs2_free_path(right_path);
3012 ocfs2_free_path(left_path);
3013
3014 return ret;
3015}
3016
3017static int ocfs2_remove_rightmost_path(handle_t *handle,
3018 struct ocfs2_extent_tree *et,
3019 struct ocfs2_path *path,
3020 struct ocfs2_cached_dealloc_ctxt *dealloc)
3021{
3022 int ret, subtree_index;
3023 u32 cpos;
3024 struct ocfs2_path *left_path = NULL;
3025 struct ocfs2_extent_block *eb;
3026 struct ocfs2_extent_list *el;
3027
3028 ret = ocfs2_et_sanity_check(et);
3029 if (ret)
3030 goto out;
3031
3032 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
3033 if (ret) {
3034 mlog_errno(ret);
3035 goto out;
3036 }
3037
3038 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3039 path, &cpos);
3040 if (ret) {
3041 mlog_errno(ret);
3042 goto out;
3043 }
3044
3045 if (cpos) {
3046 /*
3047 * We have a path to the left of this one - it needs
3048 * an update too.
3049 */
3050 left_path = ocfs2_new_path_from_path(path);
3051 if (!left_path) {
3052 ret = -ENOMEM;
3053 mlog_errno(ret);
3054 goto out;
3055 }
3056
3057 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
3058 if (ret) {
3059 mlog_errno(ret);
3060 goto out;
3061 }
3062
3063 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
3064 if (ret) {
3065 mlog_errno(ret);
3066 goto out;
3067 }
3068
3069 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
3070
3071 ocfs2_unlink_subtree(handle, et, left_path, path,
3072 subtree_index, dealloc);
3073 ret = ocfs2_update_edge_lengths(handle, et, left_path);
3074 if (ret) {
3075 mlog_errno(ret);
3076 goto out;
3077 }
3078
3079 eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data;
3080 ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno));
3081 } else {
3082 /*
3083 * 'path' is also the leftmost path which
3084 * means it must be the only one. This gets
3085 * handled differently because we want to
3086 * revert the root back to having extents
3087 * in-line.
3088 */
3089 ocfs2_unlink_path(handle, et, dealloc, path, 1);
3090
3091 el = et->et_root_el;
3092 el->l_tree_depth = 0;
3093 el->l_next_free_rec = 0;
3094 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3095
3096 ocfs2_et_set_last_eb_blk(et, 0);
3097 }
3098
3099 ocfs2_journal_dirty(handle, path_root_bh(path));
3100
3101out:
3102 ocfs2_free_path(left_path);
3103 return ret;
3104}
3105
3106static int ocfs2_remove_rightmost_empty_extent(struct ocfs2_super *osb,
3107 struct ocfs2_extent_tree *et,
3108 struct ocfs2_path *path,
3109 struct ocfs2_cached_dealloc_ctxt *dealloc)
3110{
3111 handle_t *handle;
3112 int ret;
3113 int credits = path->p_tree_depth * 2 + 1;
3114
3115 handle = ocfs2_start_trans(osb, credits);
3116 if (IS_ERR(handle)) {
3117 ret = PTR_ERR(handle);
3118 mlog_errno(ret);
3119 return ret;
3120 }
3121
3122 ret = ocfs2_remove_rightmost_path(handle, et, path, dealloc);
3123 if (ret)
3124 mlog_errno(ret);
3125
3126 ocfs2_commit_trans(osb, handle);
3127 return ret;
3128}
3129
3130/*
3131 * Left rotation of btree records.
3132 *
3133 * In many ways, this is (unsurprisingly) the opposite of right
3134 * rotation. We start at some non-rightmost path containing an empty
3135 * extent in the leaf block. The code works its way to the rightmost
3136 * path by rotating records to the left in every subtree.
3137 *
3138 * This is used by any code which reduces the number of extent records
3139 * in a leaf. After removal, an empty record should be placed in the
3140 * leftmost list position.
3141 *
3142 * This won't handle a length update of the rightmost path records if
3143 * the rightmost tree leaf record is removed so the caller is
3144 * responsible for detecting and correcting that.
3145 */
3146static int ocfs2_rotate_tree_left(handle_t *handle,
3147 struct ocfs2_extent_tree *et,
3148 struct ocfs2_path *path,
3149 struct ocfs2_cached_dealloc_ctxt *dealloc)
3150{
3151 int ret, orig_credits = handle->h_buffer_credits;
3152 struct ocfs2_path *tmp_path = NULL, *restart_path = NULL;
3153 struct ocfs2_extent_block *eb;
3154 struct ocfs2_extent_list *el;
3155
3156 el = path_leaf_el(path);
3157 if (!ocfs2_is_empty_extent(&el->l_recs[0]))
3158 return 0;
3159
3160 if (path->p_tree_depth == 0) {
3161rightmost_no_delete:
3162 /*
3163 * Inline extents. This is trivially handled, so do
3164 * it up front.
3165 */
3166 ret = ocfs2_rotate_rightmost_leaf_left(handle, et, path);
3167 if (ret)
3168 mlog_errno(ret);
3169 goto out;
3170 }
3171
3172 /*
3173 * Handle rightmost branch now. There's several cases:
3174 * 1) simple rotation leaving records in there. That's trivial.
3175 * 2) rotation requiring a branch delete - there's no more
3176 * records left. Two cases of this:
3177 * a) There are branches to the left.
3178 * b) This is also the leftmost (the only) branch.
3179 *
3180 * 1) is handled via ocfs2_rotate_rightmost_leaf_left()
3181 * 2a) we need the left branch so that we can update it with the unlink
3182 * 2b) we need to bring the root back to inline extents.
3183 */
3184
3185 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
3186 el = &eb->h_list;
3187 if (eb->h_next_leaf_blk == 0) {
3188 /*
3189 * This gets a bit tricky if we're going to delete the
3190 * rightmost path. Get the other cases out of the way
3191 * 1st.
3192 */
3193 if (le16_to_cpu(el->l_next_free_rec) > 1)
3194 goto rightmost_no_delete;
3195
3196 if (le16_to_cpu(el->l_next_free_rec) == 0) {
3197 ret = ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
3198 "Owner %llu has empty extent block at %llu\n",
3199 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
3200 (unsigned long long)le64_to_cpu(eb->h_blkno));
3201 goto out;
3202 }
3203
3204 /*
3205 * XXX: The caller can not trust "path" any more after
3206 * this as it will have been deleted. What do we do?
3207 *
3208 * In theory the rotate-for-merge code will never get
3209 * here because it'll always ask for a rotate in a
3210 * nonempty list.
3211 */
3212
3213 ret = ocfs2_remove_rightmost_path(handle, et, path,
3214 dealloc);
3215 if (ret)
3216 mlog_errno(ret);
3217 goto out;
3218 }
3219
3220 /*
3221 * Now we can loop, remembering the path we get from -EAGAIN
3222 * and restarting from there.
3223 */
3224try_rotate:
3225 ret = __ocfs2_rotate_tree_left(handle, et, orig_credits, path,
3226 dealloc, &restart_path);
3227 if (ret && ret != -EAGAIN) {
3228 mlog_errno(ret);
3229 goto out;
3230 }
3231
3232 while (ret == -EAGAIN) {
3233 tmp_path = restart_path;
3234 restart_path = NULL;
3235
3236 ret = __ocfs2_rotate_tree_left(handle, et, orig_credits,
3237 tmp_path, dealloc,
3238 &restart_path);
3239 if (ret && ret != -EAGAIN) {
3240 mlog_errno(ret);
3241 goto out;
3242 }
3243
3244 ocfs2_free_path(tmp_path);
3245 tmp_path = NULL;
3246
3247 if (ret == 0)
3248 goto try_rotate;
3249 }
3250
3251out:
3252 ocfs2_free_path(tmp_path);
3253 ocfs2_free_path(restart_path);
3254 return ret;
3255}
3256
3257static void ocfs2_cleanup_merge(struct ocfs2_extent_list *el,
3258 int index)
3259{
3260 struct ocfs2_extent_rec *rec = &el->l_recs[index];
3261 unsigned int size;
3262
3263 if (rec->e_leaf_clusters == 0) {
3264 /*
3265 * We consumed all of the merged-from record. An empty
3266 * extent cannot exist anywhere but the 1st array
3267 * position, so move things over if the merged-from
3268 * record doesn't occupy that position.
3269 *
3270 * This creates a new empty extent so the caller
3271 * should be smart enough to have removed any existing
3272 * ones.
3273 */
3274 if (index > 0) {
3275 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
3276 size = index * sizeof(struct ocfs2_extent_rec);
3277 memmove(&el->l_recs[1], &el->l_recs[0], size);
3278 }
3279
3280 /*
3281 * Always memset - the caller doesn't check whether it
3282 * created an empty extent, so there could be junk in
3283 * the other fields.
3284 */
3285 memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
3286 }
3287}
3288
3289static int ocfs2_get_right_path(struct ocfs2_extent_tree *et,
3290 struct ocfs2_path *left_path,
3291 struct ocfs2_path **ret_right_path)
3292{
3293 int ret;
3294 u32 right_cpos;
3295 struct ocfs2_path *right_path = NULL;
3296 struct ocfs2_extent_list *left_el;
3297
3298 *ret_right_path = NULL;
3299
3300 /* This function shouldn't be called for non-trees. */
3301 BUG_ON(left_path->p_tree_depth == 0);
3302
3303 left_el = path_leaf_el(left_path);
3304 BUG_ON(left_el->l_next_free_rec != left_el->l_count);
3305
3306 ret = ocfs2_find_cpos_for_right_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3307 left_path, &right_cpos);
3308 if (ret) {
3309 mlog_errno(ret);
3310 goto out;
3311 }
3312
3313 /* This function shouldn't be called for the rightmost leaf. */
3314 BUG_ON(right_cpos == 0);
3315
3316 right_path = ocfs2_new_path_from_path(left_path);
3317 if (!right_path) {
3318 ret = -ENOMEM;
3319 mlog_errno(ret);
3320 goto out;
3321 }
3322
3323 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos);
3324 if (ret) {
3325 mlog_errno(ret);
3326 goto out;
3327 }
3328
3329 *ret_right_path = right_path;
3330out:
3331 if (ret)
3332 ocfs2_free_path(right_path);
3333 return ret;
3334}
3335
3336/*
3337 * Remove split_rec clusters from the record at index and merge them
3338 * onto the beginning of the record "next" to it.
3339 * For index < l_count - 1, the next means the extent rec at index + 1.
3340 * For index == l_count - 1, the "next" means the 1st extent rec of the
3341 * next extent block.
3342 */
3343static int ocfs2_merge_rec_right(struct ocfs2_path *left_path,
3344 handle_t *handle,
3345 struct ocfs2_extent_tree *et,
3346 struct ocfs2_extent_rec *split_rec,
3347 int index)
3348{
3349 int ret, next_free, i;
3350 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3351 struct ocfs2_extent_rec *left_rec;
3352 struct ocfs2_extent_rec *right_rec;
3353 struct ocfs2_extent_list *right_el;
3354 struct ocfs2_path *right_path = NULL;
3355 int subtree_index = 0;
3356 struct ocfs2_extent_list *el = path_leaf_el(left_path);
3357 struct buffer_head *bh = path_leaf_bh(left_path);
3358 struct buffer_head *root_bh = NULL;
3359
3360 BUG_ON(index >= le16_to_cpu(el->l_next_free_rec));
3361 left_rec = &el->l_recs[index];
3362
3363 if (index == le16_to_cpu(el->l_next_free_rec) - 1 &&
3364 le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count)) {
3365 /* we meet with a cross extent block merge. */
3366 ret = ocfs2_get_right_path(et, left_path, &right_path);
3367 if (ret) {
3368 mlog_errno(ret);
3369 return ret;
3370 }
3371
3372 right_el = path_leaf_el(right_path);
3373 next_free = le16_to_cpu(right_el->l_next_free_rec);
3374 BUG_ON(next_free <= 0);
3375 right_rec = &right_el->l_recs[0];
3376 if (ocfs2_is_empty_extent(right_rec)) {
3377 BUG_ON(next_free <= 1);
3378 right_rec = &right_el->l_recs[1];
3379 }
3380
3381 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3382 le16_to_cpu(left_rec->e_leaf_clusters) !=
3383 le32_to_cpu(right_rec->e_cpos));
3384
3385 subtree_index = ocfs2_find_subtree_root(et, left_path,
3386 right_path);
3387
3388 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3389 handle->h_buffer_credits,
3390 right_path);
3391 if (ret) {
3392 mlog_errno(ret);
3393 goto out;
3394 }
3395
3396 root_bh = left_path->p_node[subtree_index].bh;
3397 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3398
3399 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3400 subtree_index);
3401 if (ret) {
3402 mlog_errno(ret);
3403 goto out;
3404 }
3405
3406 for (i = subtree_index + 1;
3407 i < path_num_items(right_path); i++) {
3408 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3409 right_path, i);
3410 if (ret) {
3411 mlog_errno(ret);
3412 goto out;
3413 }
3414
3415 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3416 left_path, i);
3417 if (ret) {
3418 mlog_errno(ret);
3419 goto out;
3420 }
3421 }
3422
3423 } else {
3424 BUG_ON(index == le16_to_cpu(el->l_next_free_rec) - 1);
3425 right_rec = &el->l_recs[index + 1];
3426 }
3427
3428 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, left_path,
3429 path_num_items(left_path) - 1);
3430 if (ret) {
3431 mlog_errno(ret);
3432 goto out;
3433 }
3434
3435 le16_add_cpu(&left_rec->e_leaf_clusters, -split_clusters);
3436
3437 le32_add_cpu(&right_rec->e_cpos, -split_clusters);
3438 le64_add_cpu(&right_rec->e_blkno,
3439 -ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3440 split_clusters));
3441 le16_add_cpu(&right_rec->e_leaf_clusters, split_clusters);
3442
3443 ocfs2_cleanup_merge(el, index);
3444
3445 ocfs2_journal_dirty(handle, bh);
3446 if (right_path) {
3447 ocfs2_journal_dirty(handle, path_leaf_bh(right_path));
3448 ocfs2_complete_edge_insert(handle, left_path, right_path,
3449 subtree_index);
3450 }
3451out:
3452 ocfs2_free_path(right_path);
3453 return ret;
3454}
3455
3456static int ocfs2_get_left_path(struct ocfs2_extent_tree *et,
3457 struct ocfs2_path *right_path,
3458 struct ocfs2_path **ret_left_path)
3459{
3460 int ret;
3461 u32 left_cpos;
3462 struct ocfs2_path *left_path = NULL;
3463
3464 *ret_left_path = NULL;
3465
3466 /* This function shouldn't be called for non-trees. */
3467 BUG_ON(right_path->p_tree_depth == 0);
3468
3469 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
3470 right_path, &left_cpos);
3471 if (ret) {
3472 mlog_errno(ret);
3473 goto out;
3474 }
3475
3476 /* This function shouldn't be called for the leftmost leaf. */
3477 BUG_ON(left_cpos == 0);
3478
3479 left_path = ocfs2_new_path_from_path(right_path);
3480 if (!left_path) {
3481 ret = -ENOMEM;
3482 mlog_errno(ret);
3483 goto out;
3484 }
3485
3486 ret = ocfs2_find_path(et->et_ci, left_path, left_cpos);
3487 if (ret) {
3488 mlog_errno(ret);
3489 goto out;
3490 }
3491
3492 *ret_left_path = left_path;
3493out:
3494 if (ret)
3495 ocfs2_free_path(left_path);
3496 return ret;
3497}
3498
3499/*
3500 * Remove split_rec clusters from the record at index and merge them
3501 * onto the tail of the record "before" it.
3502 * For index > 0, the "before" means the extent rec at index - 1.
3503 *
3504 * For index == 0, the "before" means the last record of the previous
3505 * extent block. And there is also a situation that we may need to
3506 * remove the rightmost leaf extent block in the right_path and change
3507 * the right path to indicate the new rightmost path.
3508 */
3509static int ocfs2_merge_rec_left(struct ocfs2_path *right_path,
3510 handle_t *handle,
3511 struct ocfs2_extent_tree *et,
3512 struct ocfs2_extent_rec *split_rec,
3513 struct ocfs2_cached_dealloc_ctxt *dealloc,
3514 int index)
3515{
3516 int ret, i, subtree_index = 0, has_empty_extent = 0;
3517 unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters);
3518 struct ocfs2_extent_rec *left_rec;
3519 struct ocfs2_extent_rec *right_rec;
3520 struct ocfs2_extent_list *el = path_leaf_el(right_path);
3521 struct buffer_head *bh = path_leaf_bh(right_path);
3522 struct buffer_head *root_bh = NULL;
3523 struct ocfs2_path *left_path = NULL;
3524 struct ocfs2_extent_list *left_el;
3525
3526 BUG_ON(index < 0);
3527
3528 right_rec = &el->l_recs[index];
3529 if (index == 0) {
3530 /* we meet with a cross extent block merge. */
3531 ret = ocfs2_get_left_path(et, right_path, &left_path);
3532 if (ret) {
3533 mlog_errno(ret);
3534 return ret;
3535 }
3536
3537 left_el = path_leaf_el(left_path);
3538 BUG_ON(le16_to_cpu(left_el->l_next_free_rec) !=
3539 le16_to_cpu(left_el->l_count));
3540
3541 left_rec = &left_el->l_recs[
3542 le16_to_cpu(left_el->l_next_free_rec) - 1];
3543 BUG_ON(le32_to_cpu(left_rec->e_cpos) +
3544 le16_to_cpu(left_rec->e_leaf_clusters) !=
3545 le32_to_cpu(split_rec->e_cpos));
3546
3547 subtree_index = ocfs2_find_subtree_root(et, left_path,
3548 right_path);
3549
3550 ret = ocfs2_extend_rotate_transaction(handle, subtree_index,
3551 handle->h_buffer_credits,
3552 left_path);
3553 if (ret) {
3554 mlog_errno(ret);
3555 goto out;
3556 }
3557
3558 root_bh = left_path->p_node[subtree_index].bh;
3559 BUG_ON(root_bh != right_path->p_node[subtree_index].bh);
3560
3561 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3562 subtree_index);
3563 if (ret) {
3564 mlog_errno(ret);
3565 goto out;
3566 }
3567
3568 for (i = subtree_index + 1;
3569 i < path_num_items(right_path); i++) {
3570 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3571 right_path, i);
3572 if (ret) {
3573 mlog_errno(ret);
3574 goto out;
3575 }
3576
3577 ret = ocfs2_path_bh_journal_access(handle, et->et_ci,
3578 left_path, i);
3579 if (ret) {
3580 mlog_errno(ret);
3581 goto out;
3582 }
3583 }
3584 } else {
3585 left_rec = &el->l_recs[index - 1];
3586 if (ocfs2_is_empty_extent(&el->l_recs[0]))
3587 has_empty_extent = 1;
3588 }
3589
3590 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path,
3591 path_num_items(right_path) - 1);
3592 if (ret) {
3593 mlog_errno(ret);
3594 goto out;
3595 }
3596
3597 if (has_empty_extent && index == 1) {
3598 /*
3599 * The easy case - we can just plop the record right in.
3600 */
3601 *left_rec = *split_rec;
3602 } else
3603 le16_add_cpu(&left_rec->e_leaf_clusters, split_clusters);
3604
3605 le32_add_cpu(&right_rec->e_cpos, split_clusters);
3606 le64_add_cpu(&right_rec->e_blkno,
3607 ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci),
3608 split_clusters));
3609 le16_add_cpu(&right_rec->e_leaf_clusters, -split_clusters);
3610
3611 ocfs2_cleanup_merge(el, index);
3612
3613 ocfs2_journal_dirty(handle, bh);
3614 if (left_path) {
3615 ocfs2_journal_dirty(handle, path_leaf_bh(left_path));
3616
3617 /*
3618 * In the situation that the right_rec is empty and the extent
3619 * block is empty also, ocfs2_complete_edge_insert can't handle
3620 * it and we need to delete the right extent block.
3621 */
3622 if (le16_to_cpu(right_rec->e_leaf_clusters) == 0 &&
3623 le16_to_cpu(el->l_next_free_rec) == 1) {
3624 /* extend credit for ocfs2_remove_rightmost_path */
3625 ret = ocfs2_extend_rotate_transaction(handle, 0,
3626 handle->h_buffer_credits,
3627 right_path);
3628 if (ret) {
3629 mlog_errno(ret);
3630 goto out;
3631 }
3632
3633 ret = ocfs2_remove_rightmost_path(handle, et,
3634 right_path,
3635 dealloc);
3636 if (ret) {
3637 mlog_errno(ret);
3638 goto out;
3639 }
3640
3641 /* Now the rightmost extent block has been deleted.
3642 * So we use the new rightmost path.
3643 */
3644 ocfs2_mv_path(right_path, left_path);
3645 left_path = NULL;
3646 } else
3647 ocfs2_complete_edge_insert(handle, left_path,
3648 right_path, subtree_index);
3649 }
3650out:
3651 ocfs2_free_path(left_path);
3652 return ret;
3653}
3654
3655static int ocfs2_try_to_merge_extent(handle_t *handle,
3656 struct ocfs2_extent_tree *et,
3657 struct ocfs2_path *path,
3658 int split_index,
3659 struct ocfs2_extent_rec *split_rec,
3660 struct ocfs2_cached_dealloc_ctxt *dealloc,
3661 struct ocfs2_merge_ctxt *ctxt)
3662{
3663 int ret = 0;
3664 struct ocfs2_extent_list *el = path_leaf_el(path);
3665 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
3666
3667 BUG_ON(ctxt->c_contig_type == CONTIG_NONE);
3668
3669 if (ctxt->c_split_covers_rec && ctxt->c_has_empty_extent) {
3670 /* extend credit for ocfs2_remove_rightmost_path */
3671 ret = ocfs2_extend_rotate_transaction(handle, 0,
3672 handle->h_buffer_credits,
3673 path);
3674 if (ret) {
3675 mlog_errno(ret);
3676 goto out;
3677 }
3678 /*
3679 * The merge code will need to create an empty
3680 * extent to take the place of the newly
3681 * emptied slot. Remove any pre-existing empty
3682 * extents - having more than one in a leaf is
3683 * illegal.
3684 */
3685 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3686 if (ret) {
3687 mlog_errno(ret);
3688 goto out;
3689 }
3690 split_index--;
3691 rec = &el->l_recs[split_index];
3692 }
3693
3694 if (ctxt->c_contig_type == CONTIG_LEFTRIGHT) {
3695 /*
3696 * Left-right contig implies this.
3697 */
3698 BUG_ON(!ctxt->c_split_covers_rec);
3699
3700 /*
3701 * Since the leftright insert always covers the entire
3702 * extent, this call will delete the insert record
3703 * entirely, resulting in an empty extent record added to
3704 * the extent block.
3705 *
3706 * Since the adding of an empty extent shifts
3707 * everything back to the right, there's no need to
3708 * update split_index here.
3709 *
3710 * When the split_index is zero, we need to merge it to the
3711 * prevoius extent block. It is more efficient and easier
3712 * if we do merge_right first and merge_left later.
3713 */
3714 ret = ocfs2_merge_rec_right(path, handle, et, split_rec,
3715 split_index);
3716 if (ret) {
3717 mlog_errno(ret);
3718 goto out;
3719 }
3720
3721 /*
3722 * We can only get this from logic error above.
3723 */
3724 BUG_ON(!ocfs2_is_empty_extent(&el->l_recs[0]));
3725
3726 /* extend credit for ocfs2_remove_rightmost_path */
3727 ret = ocfs2_extend_rotate_transaction(handle, 0,
3728 handle->h_buffer_credits,
3729 path);
3730 if (ret) {
3731 mlog_errno(ret);
3732 goto out;
3733 }
3734
3735 /* The merge left us with an empty extent, remove it. */
3736 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3737 if (ret) {
3738 mlog_errno(ret);
3739 goto out;
3740 }
3741
3742 rec = &el->l_recs[split_index];
3743
3744 /*
3745 * Note that we don't pass split_rec here on purpose -
3746 * we've merged it into the rec already.
3747 */
3748 ret = ocfs2_merge_rec_left(path, handle, et, rec,
3749 dealloc, split_index);
3750
3751 if (ret) {
3752 mlog_errno(ret);
3753 goto out;
3754 }
3755
3756 /* extend credit for ocfs2_remove_rightmost_path */
3757 ret = ocfs2_extend_rotate_transaction(handle, 0,
3758 handle->h_buffer_credits,
3759 path);
3760 if (ret) {
3761 mlog_errno(ret);
3762 goto out;
3763 }
3764
3765 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
3766 /*
3767 * Error from this last rotate is not critical, so
3768 * print but don't bubble it up.
3769 */
3770 if (ret)
3771 mlog_errno(ret);
3772 ret = 0;
3773 } else {
3774 /*
3775 * Merge a record to the left or right.
3776 *
3777 * 'contig_type' is relative to the existing record,
3778 * so for example, if we're "right contig", it's to
3779 * the record on the left (hence the left merge).
3780 */
3781 if (ctxt->c_contig_type == CONTIG_RIGHT) {
3782 ret = ocfs2_merge_rec_left(path, handle, et,
3783 split_rec, dealloc,
3784 split_index);
3785 if (ret) {
3786 mlog_errno(ret);
3787 goto out;
3788 }
3789 } else {
3790 ret = ocfs2_merge_rec_right(path, handle,
3791 et, split_rec,
3792 split_index);
3793 if (ret) {
3794 mlog_errno(ret);
3795 goto out;
3796 }
3797 }
3798
3799 if (ctxt->c_split_covers_rec) {
3800 /* extend credit for ocfs2_remove_rightmost_path */
3801 ret = ocfs2_extend_rotate_transaction(handle, 0,
3802 handle->h_buffer_credits,
3803 path);
3804 if (ret) {
3805 mlog_errno(ret);
3806 ret = 0;
3807 goto out;
3808 }
3809
3810 /*
3811 * The merge may have left an empty extent in
3812 * our leaf. Try to rotate it away.
3813 */
3814 ret = ocfs2_rotate_tree_left(handle, et, path,
3815 dealloc);
3816 if (ret)
3817 mlog_errno(ret);
3818 ret = 0;
3819 }
3820 }
3821
3822out:
3823 return ret;
3824}
3825
3826static void ocfs2_subtract_from_rec(struct super_block *sb,
3827 enum ocfs2_split_type split,
3828 struct ocfs2_extent_rec *rec,
3829 struct ocfs2_extent_rec *split_rec)
3830{
3831 u64 len_blocks;
3832
3833 len_blocks = ocfs2_clusters_to_blocks(sb,
3834 le16_to_cpu(split_rec->e_leaf_clusters));
3835
3836 if (split == SPLIT_LEFT) {
3837 /*
3838 * Region is on the left edge of the existing
3839 * record.
3840 */
3841 le32_add_cpu(&rec->e_cpos,
3842 le16_to_cpu(split_rec->e_leaf_clusters));
3843 le64_add_cpu(&rec->e_blkno, len_blocks);
3844 le16_add_cpu(&rec->e_leaf_clusters,
3845 -le16_to_cpu(split_rec->e_leaf_clusters));
3846 } else {
3847 /*
3848 * Region is on the right edge of the existing
3849 * record.
3850 */
3851 le16_add_cpu(&rec->e_leaf_clusters,
3852 -le16_to_cpu(split_rec->e_leaf_clusters));
3853 }
3854}
3855
3856/*
3857 * Do the final bits of extent record insertion at the target leaf
3858 * list. If this leaf is part of an allocation tree, it is assumed
3859 * that the tree above has been prepared.
3860 */
3861static void ocfs2_insert_at_leaf(struct ocfs2_extent_tree *et,
3862 struct ocfs2_extent_rec *insert_rec,
3863 struct ocfs2_extent_list *el,
3864 struct ocfs2_insert_type *insert)
3865{
3866 int i = insert->ins_contig_index;
3867 unsigned int range;
3868 struct ocfs2_extent_rec *rec;
3869
3870 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
3871
3872 if (insert->ins_split != SPLIT_NONE) {
3873 i = ocfs2_search_extent_list(el, le32_to_cpu(insert_rec->e_cpos));
3874 BUG_ON(i == -1);
3875 rec = &el->l_recs[i];
3876 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci),
3877 insert->ins_split, rec,
3878 insert_rec);
3879 goto rotate;
3880 }
3881
3882 /*
3883 * Contiguous insert - either left or right.
3884 */
3885 if (insert->ins_contig != CONTIG_NONE) {
3886 rec = &el->l_recs[i];
3887 if (insert->ins_contig == CONTIG_LEFT) {
3888 rec->e_blkno = insert_rec->e_blkno;
3889 rec->e_cpos = insert_rec->e_cpos;
3890 }
3891 le16_add_cpu(&rec->e_leaf_clusters,
3892 le16_to_cpu(insert_rec->e_leaf_clusters));
3893 return;
3894 }
3895
3896 /*
3897 * Handle insert into an empty leaf.
3898 */
3899 if (le16_to_cpu(el->l_next_free_rec) == 0 ||
3900 ((le16_to_cpu(el->l_next_free_rec) == 1) &&
3901 ocfs2_is_empty_extent(&el->l_recs[0]))) {
3902 el->l_recs[0] = *insert_rec;
3903 el->l_next_free_rec = cpu_to_le16(1);
3904 return;
3905 }
3906
3907 /*
3908 * Appending insert.
3909 */
3910 if (insert->ins_appending == APPEND_TAIL) {
3911 i = le16_to_cpu(el->l_next_free_rec) - 1;
3912 rec = &el->l_recs[i];
3913 range = le32_to_cpu(rec->e_cpos)
3914 + le16_to_cpu(rec->e_leaf_clusters);
3915 BUG_ON(le32_to_cpu(insert_rec->e_cpos) < range);
3916
3917 mlog_bug_on_msg(le16_to_cpu(el->l_next_free_rec) >=
3918 le16_to_cpu(el->l_count),
3919 "owner %llu, depth %u, count %u, next free %u, "
3920 "rec.cpos %u, rec.clusters %u, "
3921 "insert.cpos %u, insert.clusters %u\n",
3922 ocfs2_metadata_cache_owner(et->et_ci),
3923 le16_to_cpu(el->l_tree_depth),
3924 le16_to_cpu(el->l_count),
3925 le16_to_cpu(el->l_next_free_rec),
3926 le32_to_cpu(el->l_recs[i].e_cpos),
3927 le16_to_cpu(el->l_recs[i].e_leaf_clusters),
3928 le32_to_cpu(insert_rec->e_cpos),
3929 le16_to_cpu(insert_rec->e_leaf_clusters));
3930 i++;
3931 el->l_recs[i] = *insert_rec;
3932 le16_add_cpu(&el->l_next_free_rec, 1);
3933 return;
3934 }
3935
3936rotate:
3937 /*
3938 * Ok, we have to rotate.
3939 *
3940 * At this point, it is safe to assume that inserting into an
3941 * empty leaf and appending to a leaf have both been handled
3942 * above.
3943 *
3944 * This leaf needs to have space, either by the empty 1st
3945 * extent record, or by virtue of an l_next_rec < l_count.
3946 */
3947 ocfs2_rotate_leaf(el, insert_rec);
3948}
3949
3950static void ocfs2_adjust_rightmost_records(handle_t *handle,
3951 struct ocfs2_extent_tree *et,
3952 struct ocfs2_path *path,
3953 struct ocfs2_extent_rec *insert_rec)
3954{
3955 int i, next_free;
3956 struct buffer_head *bh;
3957 struct ocfs2_extent_list *el;
3958 struct ocfs2_extent_rec *rec;
3959
3960 /*
3961 * Update everything except the leaf block.
3962 */
3963 for (i = 0; i < path->p_tree_depth; i++) {
3964 bh = path->p_node[i].bh;
3965 el = path->p_node[i].el;
3966
3967 next_free = le16_to_cpu(el->l_next_free_rec);
3968 if (next_free == 0) {
3969 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
3970 "Owner %llu has a bad extent list\n",
3971 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci));
3972 return;
3973 }
3974
3975 rec = &el->l_recs[next_free - 1];
3976
3977 rec->e_int_clusters = insert_rec->e_cpos;
3978 le32_add_cpu(&rec->e_int_clusters,
3979 le16_to_cpu(insert_rec->e_leaf_clusters));
3980 le32_add_cpu(&rec->e_int_clusters,
3981 -le32_to_cpu(rec->e_cpos));
3982
3983 ocfs2_journal_dirty(handle, bh);
3984 }
3985}
3986
3987static int ocfs2_append_rec_to_path(handle_t *handle,
3988 struct ocfs2_extent_tree *et,
3989 struct ocfs2_extent_rec *insert_rec,
3990 struct ocfs2_path *right_path,
3991 struct ocfs2_path **ret_left_path)
3992{
3993 int ret, next_free;
3994 struct ocfs2_extent_list *el;
3995 struct ocfs2_path *left_path = NULL;
3996
3997 *ret_left_path = NULL;
3998
3999 /*
4000 * This shouldn't happen for non-trees. The extent rec cluster
4001 * count manipulation below only works for interior nodes.
4002 */
4003 BUG_ON(right_path->p_tree_depth == 0);
4004
4005 /*
4006 * If our appending insert is at the leftmost edge of a leaf,
4007 * then we might need to update the rightmost records of the
4008 * neighboring path.
4009 */
4010 el = path_leaf_el(right_path);
4011 next_free = le16_to_cpu(el->l_next_free_rec);
4012 if (next_free == 0 ||
4013 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
4014 u32 left_cpos;
4015
4016 ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci),
4017 right_path, &left_cpos);
4018 if (ret) {
4019 mlog_errno(ret);
4020 goto out;
4021 }
4022
4023 trace_ocfs2_append_rec_to_path(
4024 (unsigned long long)
4025 ocfs2_metadata_cache_owner(et->et_ci),
4026 le32_to_cpu(insert_rec->e_cpos),
4027 left_cpos);
4028
4029 /*
4030 * No need to worry if the append is already in the
4031 * leftmost leaf.
4032 */
4033 if (left_cpos) {
4034 left_path = ocfs2_new_path_from_path(right_path);
4035 if (!left_path) {
4036 ret = -ENOMEM;
4037 mlog_errno(ret);
4038 goto out;
4039 }
4040
4041 ret = ocfs2_find_path(et->et_ci, left_path,
4042 left_cpos);
4043 if (ret) {
4044 mlog_errno(ret);
4045 goto out;
4046 }
4047
4048 /*
4049 * ocfs2_insert_path() will pass the left_path to the
4050 * journal for us.
4051 */
4052 }
4053 }
4054
4055 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4056 if (ret) {
4057 mlog_errno(ret);
4058 goto out;
4059 }
4060
4061 ocfs2_adjust_rightmost_records(handle, et, right_path, insert_rec);
4062
4063 *ret_left_path = left_path;
4064 ret = 0;
4065out:
4066 if (ret != 0)
4067 ocfs2_free_path(left_path);
4068
4069 return ret;
4070}
4071
4072static void ocfs2_split_record(struct ocfs2_extent_tree *et,
4073 struct ocfs2_path *left_path,
4074 struct ocfs2_path *right_path,
4075 struct ocfs2_extent_rec *split_rec,
4076 enum ocfs2_split_type split)
4077{
4078 int index;
4079 u32 cpos = le32_to_cpu(split_rec->e_cpos);
4080 struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el;
4081 struct ocfs2_extent_rec *rec, *tmprec;
4082
4083 right_el = path_leaf_el(right_path);
4084 if (left_path)
4085 left_el = path_leaf_el(left_path);
4086
4087 el = right_el;
4088 insert_el = right_el;
4089 index = ocfs2_search_extent_list(el, cpos);
4090 if (index != -1) {
4091 if (index == 0 && left_path) {
4092 BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0]));
4093
4094 /*
4095 * This typically means that the record
4096 * started in the left path but moved to the
4097 * right as a result of rotation. We either
4098 * move the existing record to the left, or we
4099 * do the later insert there.
4100 *
4101 * In this case, the left path should always
4102 * exist as the rotate code will have passed
4103 * it back for a post-insert update.
4104 */
4105
4106 if (split == SPLIT_LEFT) {
4107 /*
4108 * It's a left split. Since we know
4109 * that the rotate code gave us an
4110 * empty extent in the left path, we
4111 * can just do the insert there.
4112 */
4113 insert_el = left_el;
4114 } else {
4115 /*
4116 * Right split - we have to move the
4117 * existing record over to the left
4118 * leaf. The insert will be into the
4119 * newly created empty extent in the
4120 * right leaf.
4121 */
4122 tmprec = &right_el->l_recs[index];
4123 ocfs2_rotate_leaf(left_el, tmprec);
4124 el = left_el;
4125
4126 memset(tmprec, 0, sizeof(*tmprec));
4127 index = ocfs2_search_extent_list(left_el, cpos);
4128 BUG_ON(index == -1);
4129 }
4130 }
4131 } else {
4132 BUG_ON(!left_path);
4133 BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0]));
4134 /*
4135 * Left path is easy - we can just allow the insert to
4136 * happen.
4137 */
4138 el = left_el;
4139 insert_el = left_el;
4140 index = ocfs2_search_extent_list(el, cpos);
4141 BUG_ON(index == -1);
4142 }
4143
4144 rec = &el->l_recs[index];
4145 ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci),
4146 split, rec, split_rec);
4147 ocfs2_rotate_leaf(insert_el, split_rec);
4148}
4149
4150/*
4151 * This function only does inserts on an allocation b-tree. For tree
4152 * depth = 0, ocfs2_insert_at_leaf() is called directly.
4153 *
4154 * right_path is the path we want to do the actual insert
4155 * in. left_path should only be passed in if we need to update that
4156 * portion of the tree after an edge insert.
4157 */
4158static int ocfs2_insert_path(handle_t *handle,
4159 struct ocfs2_extent_tree *et,
4160 struct ocfs2_path *left_path,
4161 struct ocfs2_path *right_path,
4162 struct ocfs2_extent_rec *insert_rec,
4163 struct ocfs2_insert_type *insert)
4164{
4165 int ret, subtree_index;
4166 struct buffer_head *leaf_bh = path_leaf_bh(right_path);
4167
4168 if (left_path) {
4169 /*
4170 * There's a chance that left_path got passed back to
4171 * us without being accounted for in the
4172 * journal. Extend our transaction here to be sure we
4173 * can change those blocks.
4174 */
4175 ret = ocfs2_extend_trans(handle, left_path->p_tree_depth);
4176 if (ret < 0) {
4177 mlog_errno(ret);
4178 goto out;
4179 }
4180
4181 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
4182 if (ret < 0) {
4183 mlog_errno(ret);
4184 goto out;
4185 }
4186 }
4187
4188 /*
4189 * Pass both paths to the journal. The majority of inserts
4190 * will be touching all components anyway.
4191 */
4192 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path);
4193 if (ret < 0) {
4194 mlog_errno(ret);
4195 goto out;
4196 }
4197
4198 if (insert->ins_split != SPLIT_NONE) {
4199 /*
4200 * We could call ocfs2_insert_at_leaf() for some types
4201 * of splits, but it's easier to just let one separate
4202 * function sort it all out.
4203 */
4204 ocfs2_split_record(et, left_path, right_path,
4205 insert_rec, insert->ins_split);
4206
4207 /*
4208 * Split might have modified either leaf and we don't
4209 * have a guarantee that the later edge insert will
4210 * dirty this for us.
4211 */
4212 if (left_path)
4213 ocfs2_journal_dirty(handle,
4214 path_leaf_bh(left_path));
4215 } else
4216 ocfs2_insert_at_leaf(et, insert_rec, path_leaf_el(right_path),
4217 insert);
4218
4219 ocfs2_journal_dirty(handle, leaf_bh);
4220
4221 if (left_path) {
4222 /*
4223 * The rotate code has indicated that we need to fix
4224 * up portions of the tree after the insert.
4225 *
4226 * XXX: Should we extend the transaction here?
4227 */
4228 subtree_index = ocfs2_find_subtree_root(et, left_path,
4229 right_path);
4230 ocfs2_complete_edge_insert(handle, left_path, right_path,
4231 subtree_index);
4232 }
4233
4234 ret = 0;
4235out:
4236 return ret;
4237}
4238
4239static int ocfs2_do_insert_extent(handle_t *handle,
4240 struct ocfs2_extent_tree *et,
4241 struct ocfs2_extent_rec *insert_rec,
4242 struct ocfs2_insert_type *type)
4243{
4244 int ret, rotate = 0;
4245 u32 cpos;
4246 struct ocfs2_path *right_path = NULL;
4247 struct ocfs2_path *left_path = NULL;
4248 struct ocfs2_extent_list *el;
4249
4250 el = et->et_root_el;
4251
4252 ret = ocfs2_et_root_journal_access(handle, et,
4253 OCFS2_JOURNAL_ACCESS_WRITE);
4254 if (ret) {
4255 mlog_errno(ret);
4256 goto out;
4257 }
4258
4259 if (le16_to_cpu(el->l_tree_depth) == 0) {
4260 ocfs2_insert_at_leaf(et, insert_rec, el, type);
4261 goto out_update_clusters;
4262 }
4263
4264 right_path = ocfs2_new_path_from_et(et);
4265 if (!right_path) {
4266 ret = -ENOMEM;
4267 mlog_errno(ret);
4268 goto out;
4269 }
4270
4271 /*
4272 * Determine the path to start with. Rotations need the
4273 * rightmost path, everything else can go directly to the
4274 * target leaf.
4275 */
4276 cpos = le32_to_cpu(insert_rec->e_cpos);
4277 if (type->ins_appending == APPEND_NONE &&
4278 type->ins_contig == CONTIG_NONE) {
4279 rotate = 1;
4280 cpos = UINT_MAX;
4281 }
4282
4283 ret = ocfs2_find_path(et->et_ci, right_path, cpos);
4284 if (ret) {
4285 mlog_errno(ret);
4286 goto out;
4287 }
4288
4289 /*
4290 * Rotations and appends need special treatment - they modify
4291 * parts of the tree's above them.
4292 *
4293 * Both might pass back a path immediate to the left of the
4294 * one being inserted to. This will be cause
4295 * ocfs2_insert_path() to modify the rightmost records of
4296 * left_path to account for an edge insert.
4297 *
4298 * XXX: When modifying this code, keep in mind that an insert
4299 * can wind up skipping both of these two special cases...
4300 */
4301 if (rotate) {
4302 ret = ocfs2_rotate_tree_right(handle, et, type->ins_split,
4303 le32_to_cpu(insert_rec->e_cpos),
4304 right_path, &left_path);
4305 if (ret) {
4306 mlog_errno(ret);
4307 goto out;
4308 }
4309
4310 /*
4311 * ocfs2_rotate_tree_right() might have extended the
4312 * transaction without re-journaling our tree root.
4313 */
4314 ret = ocfs2_et_root_journal_access(handle, et,
4315 OCFS2_JOURNAL_ACCESS_WRITE);
4316 if (ret) {
4317 mlog_errno(ret);
4318 goto out;
4319 }
4320 } else if (type->ins_appending == APPEND_TAIL
4321 && type->ins_contig != CONTIG_LEFT) {
4322 ret = ocfs2_append_rec_to_path(handle, et, insert_rec,
4323 right_path, &left_path);
4324 if (ret) {
4325 mlog_errno(ret);
4326 goto out;
4327 }
4328 }
4329
4330 ret = ocfs2_insert_path(handle, et, left_path, right_path,
4331 insert_rec, type);
4332 if (ret) {
4333 mlog_errno(ret);
4334 goto out;
4335 }
4336
4337out_update_clusters:
4338 if (type->ins_split == SPLIT_NONE)
4339 ocfs2_et_update_clusters(et,
4340 le16_to_cpu(insert_rec->e_leaf_clusters));
4341
4342 ocfs2_journal_dirty(handle, et->et_root_bh);
4343
4344out:
4345 ocfs2_free_path(left_path);
4346 ocfs2_free_path(right_path);
4347
4348 return ret;
4349}
4350
4351static int ocfs2_figure_merge_contig_type(struct ocfs2_extent_tree *et,
4352 struct ocfs2_path *path,
4353 struct ocfs2_extent_list *el, int index,
4354 struct ocfs2_extent_rec *split_rec,
4355 struct ocfs2_merge_ctxt *ctxt)
4356{
4357 int status = 0;
4358 enum ocfs2_contig_type ret = CONTIG_NONE;
4359 u32 left_cpos, right_cpos;
4360 struct ocfs2_extent_rec *rec = NULL;
4361 struct ocfs2_extent_list *new_el;
4362 struct ocfs2_path *left_path = NULL, *right_path = NULL;
4363 struct buffer_head *bh;
4364 struct ocfs2_extent_block *eb;
4365 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
4366
4367 if (index > 0) {
4368 rec = &el->l_recs[index - 1];
4369 } else if (path->p_tree_depth > 0) {
4370 status = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos);
4371 if (status)
4372 goto exit;
4373
4374 if (left_cpos != 0) {
4375 left_path = ocfs2_new_path_from_path(path);
4376 if (!left_path) {
4377 status = -ENOMEM;
4378 mlog_errno(status);
4379 goto exit;
4380 }
4381
4382 status = ocfs2_find_path(et->et_ci, left_path,
4383 left_cpos);
4384 if (status)
4385 goto free_left_path;
4386
4387 new_el = path_leaf_el(left_path);
4388
4389 if (le16_to_cpu(new_el->l_next_free_rec) !=
4390 le16_to_cpu(new_el->l_count)) {
4391 bh = path_leaf_bh(left_path);
4392 eb = (struct ocfs2_extent_block *)bh->b_data;
4393 status = ocfs2_error(sb,
4394 "Extent block #%llu has an invalid l_next_free_rec of %d. It should have matched the l_count of %d\n",
4395 (unsigned long long)le64_to_cpu(eb->h_blkno),
4396 le16_to_cpu(new_el->l_next_free_rec),
4397 le16_to_cpu(new_el->l_count));
4398 goto free_left_path;
4399 }
4400 rec = &new_el->l_recs[
4401 le16_to_cpu(new_el->l_next_free_rec) - 1];
4402 }
4403 }
4404
4405 /*
4406 * We're careful to check for an empty extent record here -
4407 * the merge code will know what to do if it sees one.
4408 */
4409 if (rec) {
4410 if (index == 1 && ocfs2_is_empty_extent(rec)) {
4411 if (split_rec->e_cpos == el->l_recs[index].e_cpos)
4412 ret = CONTIG_RIGHT;
4413 } else {
4414 ret = ocfs2_et_extent_contig(et, rec, split_rec);
4415 }
4416 }
4417
4418 rec = NULL;
4419 if (index < (le16_to_cpu(el->l_next_free_rec) - 1))
4420 rec = &el->l_recs[index + 1];
4421 else if (le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count) &&
4422 path->p_tree_depth > 0) {
4423 status = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos);
4424 if (status)
4425 goto free_left_path;
4426
4427 if (right_cpos == 0)
4428 goto free_left_path;
4429
4430 right_path = ocfs2_new_path_from_path(path);
4431 if (!right_path) {
4432 status = -ENOMEM;
4433 mlog_errno(status);
4434 goto free_left_path;
4435 }
4436
4437 status = ocfs2_find_path(et->et_ci, right_path, right_cpos);
4438 if (status)
4439 goto free_right_path;
4440
4441 new_el = path_leaf_el(right_path);
4442 rec = &new_el->l_recs[0];
4443 if (ocfs2_is_empty_extent(rec)) {
4444 if (le16_to_cpu(new_el->l_next_free_rec) <= 1) {
4445 bh = path_leaf_bh(right_path);
4446 eb = (struct ocfs2_extent_block *)bh->b_data;
4447 status = ocfs2_error(sb,
4448 "Extent block #%llu has an invalid l_next_free_rec of %d\n",
4449 (unsigned long long)le64_to_cpu(eb->h_blkno),
4450 le16_to_cpu(new_el->l_next_free_rec));
4451 goto free_right_path;
4452 }
4453 rec = &new_el->l_recs[1];
4454 }
4455 }
4456
4457 if (rec) {
4458 enum ocfs2_contig_type contig_type;
4459
4460 contig_type = ocfs2_et_extent_contig(et, rec, split_rec);
4461
4462 if (contig_type == CONTIG_LEFT && ret == CONTIG_RIGHT)
4463 ret = CONTIG_LEFTRIGHT;
4464 else if (ret == CONTIG_NONE)
4465 ret = contig_type;
4466 }
4467
4468free_right_path:
4469 ocfs2_free_path(right_path);
4470free_left_path:
4471 ocfs2_free_path(left_path);
4472exit:
4473 if (status == 0)
4474 ctxt->c_contig_type = ret;
4475
4476 return status;
4477}
4478
4479static void ocfs2_figure_contig_type(struct ocfs2_extent_tree *et,
4480 struct ocfs2_insert_type *insert,
4481 struct ocfs2_extent_list *el,
4482 struct ocfs2_extent_rec *insert_rec)
4483{
4484 int i;
4485 enum ocfs2_contig_type contig_type = CONTIG_NONE;
4486
4487 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4488
4489 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
4490 contig_type = ocfs2_et_extent_contig(et, &el->l_recs[i],
4491 insert_rec);
4492 if (contig_type != CONTIG_NONE) {
4493 insert->ins_contig_index = i;
4494 break;
4495 }
4496 }
4497 insert->ins_contig = contig_type;
4498
4499 if (insert->ins_contig != CONTIG_NONE) {
4500 struct ocfs2_extent_rec *rec =
4501 &el->l_recs[insert->ins_contig_index];
4502 unsigned int len = le16_to_cpu(rec->e_leaf_clusters) +
4503 le16_to_cpu(insert_rec->e_leaf_clusters);
4504
4505 /*
4506 * Caller might want us to limit the size of extents, don't
4507 * calculate contiguousness if we might exceed that limit.
4508 */
4509 if (et->et_max_leaf_clusters &&
4510 (len > et->et_max_leaf_clusters))
4511 insert->ins_contig = CONTIG_NONE;
4512 }
4513}
4514
4515/*
4516 * This should only be called against the righmost leaf extent list.
4517 *
4518 * ocfs2_figure_appending_type() will figure out whether we'll have to
4519 * insert at the tail of the rightmost leaf.
4520 *
4521 * This should also work against the root extent list for tree's with 0
4522 * depth. If we consider the root extent list to be the rightmost leaf node
4523 * then the logic here makes sense.
4524 */
4525static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert,
4526 struct ocfs2_extent_list *el,
4527 struct ocfs2_extent_rec *insert_rec)
4528{
4529 int i;
4530 u32 cpos = le32_to_cpu(insert_rec->e_cpos);
4531 struct ocfs2_extent_rec *rec;
4532
4533 insert->ins_appending = APPEND_NONE;
4534
4535 BUG_ON(le16_to_cpu(el->l_tree_depth) != 0);
4536
4537 if (!el->l_next_free_rec)
4538 goto set_tail_append;
4539
4540 if (ocfs2_is_empty_extent(&el->l_recs[0])) {
4541 /* Were all records empty? */
4542 if (le16_to_cpu(el->l_next_free_rec) == 1)
4543 goto set_tail_append;
4544 }
4545
4546 i = le16_to_cpu(el->l_next_free_rec) - 1;
4547 rec = &el->l_recs[i];
4548
4549 if (cpos >=
4550 (le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)))
4551 goto set_tail_append;
4552
4553 return;
4554
4555set_tail_append:
4556 insert->ins_appending = APPEND_TAIL;
4557}
4558
4559/*
4560 * Helper function called at the beginning of an insert.
4561 *
4562 * This computes a few things that are commonly used in the process of
4563 * inserting into the btree:
4564 * - Whether the new extent is contiguous with an existing one.
4565 * - The current tree depth.
4566 * - Whether the insert is an appending one.
4567 * - The total # of free records in the tree.
4568 *
4569 * All of the information is stored on the ocfs2_insert_type
4570 * structure.
4571 */
4572static int ocfs2_figure_insert_type(struct ocfs2_extent_tree *et,
4573 struct buffer_head **last_eb_bh,
4574 struct ocfs2_extent_rec *insert_rec,
4575 int *free_records,
4576 struct ocfs2_insert_type *insert)
4577{
4578 int ret;
4579 struct ocfs2_extent_block *eb;
4580 struct ocfs2_extent_list *el;
4581 struct ocfs2_path *path = NULL;
4582 struct buffer_head *bh = NULL;
4583
4584 insert->ins_split = SPLIT_NONE;
4585
4586 el = et->et_root_el;
4587 insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth);
4588
4589 if (el->l_tree_depth) {
4590 /*
4591 * If we have tree depth, we read in the
4592 * rightmost extent block ahead of time as
4593 * ocfs2_figure_insert_type() and ocfs2_add_branch()
4594 * may want it later.
4595 */
4596 ret = ocfs2_read_extent_block(et->et_ci,
4597 ocfs2_et_get_last_eb_blk(et),
4598 &bh);
4599 if (ret) {
4600 mlog_errno(ret);
4601 goto out;
4602 }
4603 eb = (struct ocfs2_extent_block *) bh->b_data;
4604 el = &eb->h_list;
4605 }
4606
4607 /*
4608 * Unless we have a contiguous insert, we'll need to know if
4609 * there is room left in our allocation tree for another
4610 * extent record.
4611 *
4612 * XXX: This test is simplistic, we can search for empty
4613 * extent records too.
4614 */
4615 *free_records = le16_to_cpu(el->l_count) -
4616 le16_to_cpu(el->l_next_free_rec);
4617
4618 if (!insert->ins_tree_depth) {
4619 ocfs2_figure_contig_type(et, insert, el, insert_rec);
4620 ocfs2_figure_appending_type(insert, el, insert_rec);
4621 return 0;
4622 }
4623
4624 path = ocfs2_new_path_from_et(et);
4625 if (!path) {
4626 ret = -ENOMEM;
4627 mlog_errno(ret);
4628 goto out;
4629 }
4630
4631 /*
4632 * In the case that we're inserting past what the tree
4633 * currently accounts for, ocfs2_find_path() will return for
4634 * us the rightmost tree path. This is accounted for below in
4635 * the appending code.
4636 */
4637 ret = ocfs2_find_path(et->et_ci, path, le32_to_cpu(insert_rec->e_cpos));
4638 if (ret) {
4639 mlog_errno(ret);
4640 goto out;
4641 }
4642
4643 el = path_leaf_el(path);
4644
4645 /*
4646 * Now that we have the path, there's two things we want to determine:
4647 * 1) Contiguousness (also set contig_index if this is so)
4648 *
4649 * 2) Are we doing an append? We can trivially break this up
4650 * into two types of appends: simple record append, or a
4651 * rotate inside the tail leaf.
4652 */
4653 ocfs2_figure_contig_type(et, insert, el, insert_rec);
4654
4655 /*
4656 * The insert code isn't quite ready to deal with all cases of
4657 * left contiguousness. Specifically, if it's an insert into
4658 * the 1st record in a leaf, it will require the adjustment of
4659 * cluster count on the last record of the path directly to it's
4660 * left. For now, just catch that case and fool the layers
4661 * above us. This works just fine for tree_depth == 0, which
4662 * is why we allow that above.
4663 */
4664 if (insert->ins_contig == CONTIG_LEFT &&
4665 insert->ins_contig_index == 0)
4666 insert->ins_contig = CONTIG_NONE;
4667
4668 /*
4669 * Ok, so we can simply compare against last_eb to figure out
4670 * whether the path doesn't exist. This will only happen in
4671 * the case that we're doing a tail append, so maybe we can
4672 * take advantage of that information somehow.
4673 */
4674 if (ocfs2_et_get_last_eb_blk(et) ==
4675 path_leaf_bh(path)->b_blocknr) {
4676 /*
4677 * Ok, ocfs2_find_path() returned us the rightmost
4678 * tree path. This might be an appending insert. There are
4679 * two cases:
4680 * 1) We're doing a true append at the tail:
4681 * -This might even be off the end of the leaf
4682 * 2) We're "appending" by rotating in the tail
4683 */
4684 ocfs2_figure_appending_type(insert, el, insert_rec);
4685 }
4686
4687out:
4688 ocfs2_free_path(path);
4689
4690 if (ret == 0)
4691 *last_eb_bh = bh;
4692 else
4693 brelse(bh);
4694 return ret;
4695}
4696
4697/*
4698 * Insert an extent into a btree.
4699 *
4700 * The caller needs to update the owning btree's cluster count.
4701 */
4702int ocfs2_insert_extent(handle_t *handle,
4703 struct ocfs2_extent_tree *et,
4704 u32 cpos,
4705 u64 start_blk,
4706 u32 new_clusters,
4707 u8 flags,
4708 struct ocfs2_alloc_context *meta_ac)
4709{
4710 int status;
4711 int uninitialized_var(free_records);
4712 struct buffer_head *last_eb_bh = NULL;
4713 struct ocfs2_insert_type insert = {0, };
4714 struct ocfs2_extent_rec rec;
4715
4716 trace_ocfs2_insert_extent_start(
4717 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
4718 cpos, new_clusters);
4719
4720 memset(&rec, 0, sizeof(rec));
4721 rec.e_cpos = cpu_to_le32(cpos);
4722 rec.e_blkno = cpu_to_le64(start_blk);
4723 rec.e_leaf_clusters = cpu_to_le16(new_clusters);
4724 rec.e_flags = flags;
4725 status = ocfs2_et_insert_check(et, &rec);
4726 if (status) {
4727 mlog_errno(status);
4728 goto bail;
4729 }
4730
4731 status = ocfs2_figure_insert_type(et, &last_eb_bh, &rec,
4732 &free_records, &insert);
4733 if (status < 0) {
4734 mlog_errno(status);
4735 goto bail;
4736 }
4737
4738 trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig,
4739 insert.ins_contig_index, free_records,
4740 insert.ins_tree_depth);
4741
4742 if (insert.ins_contig == CONTIG_NONE && free_records == 0) {
4743 status = ocfs2_grow_tree(handle, et,
4744 &insert.ins_tree_depth, &last_eb_bh,
4745 meta_ac);
4746 if (status) {
4747 mlog_errno(status);
4748 goto bail;
4749 }
4750 }
4751
4752 /* Finally, we can add clusters. This might rotate the tree for us. */
4753 status = ocfs2_do_insert_extent(handle, et, &rec, &insert);
4754 if (status < 0)
4755 mlog_errno(status);
4756 else
4757 ocfs2_et_extent_map_insert(et, &rec);
4758
4759bail:
4760 brelse(last_eb_bh);
4761
4762 return status;
4763}
4764
4765/*
4766 * Allcate and add clusters into the extent b-tree.
4767 * The new clusters(clusters_to_add) will be inserted at logical_offset.
4768 * The extent b-tree's root is specified by et, and
4769 * it is not limited to the file storage. Any extent tree can use this
4770 * function if it implements the proper ocfs2_extent_tree.
4771 */
4772int ocfs2_add_clusters_in_btree(handle_t *handle,
4773 struct ocfs2_extent_tree *et,
4774 u32 *logical_offset,
4775 u32 clusters_to_add,
4776 int mark_unwritten,
4777 struct ocfs2_alloc_context *data_ac,
4778 struct ocfs2_alloc_context *meta_ac,
4779 enum ocfs2_alloc_restarted *reason_ret)
4780{
4781 int status = 0, err = 0;
4782 int need_free = 0;
4783 int free_extents;
4784 enum ocfs2_alloc_restarted reason = RESTART_NONE;
4785 u32 bit_off, num_bits;
4786 u64 block;
4787 u8 flags = 0;
4788 struct ocfs2_super *osb =
4789 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
4790
4791 BUG_ON(!clusters_to_add);
4792
4793 if (mark_unwritten)
4794 flags = OCFS2_EXT_UNWRITTEN;
4795
4796 free_extents = ocfs2_num_free_extents(et);
4797 if (free_extents < 0) {
4798 status = free_extents;
4799 mlog_errno(status);
4800 goto leave;
4801 }
4802
4803 /* there are two cases which could cause us to EAGAIN in the
4804 * we-need-more-metadata case:
4805 * 1) we haven't reserved *any*
4806 * 2) we are so fragmented, we've needed to add metadata too
4807 * many times. */
4808 if (!free_extents && !meta_ac) {
4809 err = -1;
4810 status = -EAGAIN;
4811 reason = RESTART_META;
4812 goto leave;
4813 } else if ((!free_extents)
4814 && (ocfs2_alloc_context_bits_left(meta_ac)
4815 < ocfs2_extend_meta_needed(et->et_root_el))) {
4816 err = -2;
4817 status = -EAGAIN;
4818 reason = RESTART_META;
4819 goto leave;
4820 }
4821
4822 status = __ocfs2_claim_clusters(handle, data_ac, 1,
4823 clusters_to_add, &bit_off, &num_bits);
4824 if (status < 0) {
4825 if (status != -ENOSPC)
4826 mlog_errno(status);
4827 goto leave;
4828 }
4829
4830 BUG_ON(num_bits > clusters_to_add);
4831
4832 /* reserve our write early -- insert_extent may update the tree root */
4833 status = ocfs2_et_root_journal_access(handle, et,
4834 OCFS2_JOURNAL_ACCESS_WRITE);
4835 if (status < 0) {
4836 mlog_errno(status);
4837 need_free = 1;
4838 goto bail;
4839 }
4840
4841 block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
4842 trace_ocfs2_add_clusters_in_btree(
4843 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
4844 bit_off, num_bits);
4845 status = ocfs2_insert_extent(handle, et, *logical_offset, block,
4846 num_bits, flags, meta_ac);
4847 if (status < 0) {
4848 mlog_errno(status);
4849 need_free = 1;
4850 goto bail;
4851 }
4852
4853 ocfs2_journal_dirty(handle, et->et_root_bh);
4854
4855 clusters_to_add -= num_bits;
4856 *logical_offset += num_bits;
4857
4858 if (clusters_to_add) {
4859 err = clusters_to_add;
4860 status = -EAGAIN;
4861 reason = RESTART_TRANS;
4862 }
4863
4864bail:
4865 if (need_free) {
4866 if (data_ac->ac_which == OCFS2_AC_USE_LOCAL)
4867 ocfs2_free_local_alloc_bits(osb, handle, data_ac,
4868 bit_off, num_bits);
4869 else
4870 ocfs2_free_clusters(handle,
4871 data_ac->ac_inode,
4872 data_ac->ac_bh,
4873 ocfs2_clusters_to_blocks(osb->sb, bit_off),
4874 num_bits);
4875 }
4876
4877leave:
4878 if (reason_ret)
4879 *reason_ret = reason;
4880 trace_ocfs2_add_clusters_in_btree_ret(status, reason, err);
4881 return status;
4882}
4883
4884static void ocfs2_make_right_split_rec(struct super_block *sb,
4885 struct ocfs2_extent_rec *split_rec,
4886 u32 cpos,
4887 struct ocfs2_extent_rec *rec)
4888{
4889 u32 rec_cpos = le32_to_cpu(rec->e_cpos);
4890 u32 rec_range = rec_cpos + le16_to_cpu(rec->e_leaf_clusters);
4891
4892 memset(split_rec, 0, sizeof(struct ocfs2_extent_rec));
4893
4894 split_rec->e_cpos = cpu_to_le32(cpos);
4895 split_rec->e_leaf_clusters = cpu_to_le16(rec_range - cpos);
4896
4897 split_rec->e_blkno = rec->e_blkno;
4898 le64_add_cpu(&split_rec->e_blkno,
4899 ocfs2_clusters_to_blocks(sb, cpos - rec_cpos));
4900
4901 split_rec->e_flags = rec->e_flags;
4902}
4903
4904static int ocfs2_split_and_insert(handle_t *handle,
4905 struct ocfs2_extent_tree *et,
4906 struct ocfs2_path *path,
4907 struct buffer_head **last_eb_bh,
4908 int split_index,
4909 struct ocfs2_extent_rec *orig_split_rec,
4910 struct ocfs2_alloc_context *meta_ac)
4911{
4912 int ret = 0, depth;
4913 unsigned int insert_range, rec_range, do_leftright = 0;
4914 struct ocfs2_extent_rec tmprec;
4915 struct ocfs2_extent_list *rightmost_el;
4916 struct ocfs2_extent_rec rec;
4917 struct ocfs2_extent_rec split_rec = *orig_split_rec;
4918 struct ocfs2_insert_type insert;
4919 struct ocfs2_extent_block *eb;
4920
4921leftright:
4922 /*
4923 * Store a copy of the record on the stack - it might move
4924 * around as the tree is manipulated below.
4925 */
4926 rec = path_leaf_el(path)->l_recs[split_index];
4927
4928 rightmost_el = et->et_root_el;
4929
4930 depth = le16_to_cpu(rightmost_el->l_tree_depth);
4931 if (depth) {
4932 BUG_ON(!(*last_eb_bh));
4933 eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data;
4934 rightmost_el = &eb->h_list;
4935 }
4936
4937 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
4938 le16_to_cpu(rightmost_el->l_count)) {
4939 ret = ocfs2_grow_tree(handle, et,
4940 &depth, last_eb_bh, meta_ac);
4941 if (ret) {
4942 mlog_errno(ret);
4943 goto out;
4944 }
4945 }
4946
4947 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
4948 insert.ins_appending = APPEND_NONE;
4949 insert.ins_contig = CONTIG_NONE;
4950 insert.ins_tree_depth = depth;
4951
4952 insert_range = le32_to_cpu(split_rec.e_cpos) +
4953 le16_to_cpu(split_rec.e_leaf_clusters);
4954 rec_range = le32_to_cpu(rec.e_cpos) +
4955 le16_to_cpu(rec.e_leaf_clusters);
4956
4957 if (split_rec.e_cpos == rec.e_cpos) {
4958 insert.ins_split = SPLIT_LEFT;
4959 } else if (insert_range == rec_range) {
4960 insert.ins_split = SPLIT_RIGHT;
4961 } else {
4962 /*
4963 * Left/right split. We fake this as a right split
4964 * first and then make a second pass as a left split.
4965 */
4966 insert.ins_split = SPLIT_RIGHT;
4967
4968 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci),
4969 &tmprec, insert_range, &rec);
4970
4971 split_rec = tmprec;
4972
4973 BUG_ON(do_leftright);
4974 do_leftright = 1;
4975 }
4976
4977 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
4978 if (ret) {
4979 mlog_errno(ret);
4980 goto out;
4981 }
4982
4983 if (do_leftright == 1) {
4984 u32 cpos;
4985 struct ocfs2_extent_list *el;
4986
4987 do_leftright++;
4988 split_rec = *orig_split_rec;
4989
4990 ocfs2_reinit_path(path, 1);
4991
4992 cpos = le32_to_cpu(split_rec.e_cpos);
4993 ret = ocfs2_find_path(et->et_ci, path, cpos);
4994 if (ret) {
4995 mlog_errno(ret);
4996 goto out;
4997 }
4998
4999 el = path_leaf_el(path);
5000 split_index = ocfs2_search_extent_list(el, cpos);
5001 if (split_index == -1) {
5002 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5003 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5004 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5005 cpos);
5006 ret = -EROFS;
5007 goto out;
5008 }
5009 goto leftright;
5010 }
5011out:
5012
5013 return ret;
5014}
5015
5016static int ocfs2_replace_extent_rec(handle_t *handle,
5017 struct ocfs2_extent_tree *et,
5018 struct ocfs2_path *path,
5019 struct ocfs2_extent_list *el,
5020 int split_index,
5021 struct ocfs2_extent_rec *split_rec)
5022{
5023 int ret;
5024
5025 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path,
5026 path_num_items(path) - 1);
5027 if (ret) {
5028 mlog_errno(ret);
5029 goto out;
5030 }
5031
5032 el->l_recs[split_index] = *split_rec;
5033
5034 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5035out:
5036 return ret;
5037}
5038
5039/*
5040 * Split part or all of the extent record at split_index in the leaf
5041 * pointed to by path. Merge with the contiguous extent record if needed.
5042 *
5043 * Care is taken to handle contiguousness so as to not grow the tree.
5044 *
5045 * meta_ac is not strictly necessary - we only truly need it if growth
5046 * of the tree is required. All other cases will degrade into a less
5047 * optimal tree layout.
5048 *
5049 * last_eb_bh should be the rightmost leaf block for any extent
5050 * btree. Since a split may grow the tree or a merge might shrink it,
5051 * the caller cannot trust the contents of that buffer after this call.
5052 *
5053 * This code is optimized for readability - several passes might be
5054 * made over certain portions of the tree. All of those blocks will
5055 * have been brought into cache (and pinned via the journal), so the
5056 * extra overhead is not expressed in terms of disk reads.
5057 */
5058int ocfs2_split_extent(handle_t *handle,
5059 struct ocfs2_extent_tree *et,
5060 struct ocfs2_path *path,
5061 int split_index,
5062 struct ocfs2_extent_rec *split_rec,
5063 struct ocfs2_alloc_context *meta_ac,
5064 struct ocfs2_cached_dealloc_ctxt *dealloc)
5065{
5066 int ret = 0;
5067 struct ocfs2_extent_list *el = path_leaf_el(path);
5068 struct buffer_head *last_eb_bh = NULL;
5069 struct ocfs2_extent_rec *rec = &el->l_recs[split_index];
5070 struct ocfs2_merge_ctxt ctxt;
5071
5072 if (le32_to_cpu(rec->e_cpos) > le32_to_cpu(split_rec->e_cpos) ||
5073 ((le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)) <
5074 (le32_to_cpu(split_rec->e_cpos) + le16_to_cpu(split_rec->e_leaf_clusters)))) {
5075 ret = -EIO;
5076 mlog_errno(ret);
5077 goto out;
5078 }
5079
5080 ret = ocfs2_figure_merge_contig_type(et, path, el,
5081 split_index,
5082 split_rec,
5083 &ctxt);
5084 if (ret) {
5085 mlog_errno(ret);
5086 goto out;
5087 }
5088
5089 /*
5090 * The core merge / split code wants to know how much room is
5091 * left in this allocation tree, so we pass the
5092 * rightmost extent list.
5093 */
5094 if (path->p_tree_depth) {
5095 ret = ocfs2_read_extent_block(et->et_ci,
5096 ocfs2_et_get_last_eb_blk(et),
5097 &last_eb_bh);
5098 if (ret) {
5099 mlog_errno(ret);
5100 goto out;
5101 }
5102 }
5103
5104 if (rec->e_cpos == split_rec->e_cpos &&
5105 rec->e_leaf_clusters == split_rec->e_leaf_clusters)
5106 ctxt.c_split_covers_rec = 1;
5107 else
5108 ctxt.c_split_covers_rec = 0;
5109
5110 ctxt.c_has_empty_extent = ocfs2_is_empty_extent(&el->l_recs[0]);
5111
5112 trace_ocfs2_split_extent(split_index, ctxt.c_contig_type,
5113 ctxt.c_has_empty_extent,
5114 ctxt.c_split_covers_rec);
5115
5116 if (ctxt.c_contig_type == CONTIG_NONE) {
5117 if (ctxt.c_split_covers_rec)
5118 ret = ocfs2_replace_extent_rec(handle, et, path, el,
5119 split_index, split_rec);
5120 else
5121 ret = ocfs2_split_and_insert(handle, et, path,
5122 &last_eb_bh, split_index,
5123 split_rec, meta_ac);
5124 if (ret)
5125 mlog_errno(ret);
5126 } else {
5127 ret = ocfs2_try_to_merge_extent(handle, et, path,
5128 split_index, split_rec,
5129 dealloc, &ctxt);
5130 if (ret)
5131 mlog_errno(ret);
5132 }
5133
5134out:
5135 brelse(last_eb_bh);
5136 return ret;
5137}
5138
5139/*
5140 * Change the flags of the already-existing extent at cpos for len clusters.
5141 *
5142 * new_flags: the flags we want to set.
5143 * clear_flags: the flags we want to clear.
5144 * phys: the new physical offset we want this new extent starts from.
5145 *
5146 * If the existing extent is larger than the request, initiate a
5147 * split. An attempt will be made at merging with adjacent extents.
5148 *
5149 * The caller is responsible for passing down meta_ac if we'll need it.
5150 */
5151int ocfs2_change_extent_flag(handle_t *handle,
5152 struct ocfs2_extent_tree *et,
5153 u32 cpos, u32 len, u32 phys,
5154 struct ocfs2_alloc_context *meta_ac,
5155 struct ocfs2_cached_dealloc_ctxt *dealloc,
5156 int new_flags, int clear_flags)
5157{
5158 int ret, index;
5159 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
5160 u64 start_blkno = ocfs2_clusters_to_blocks(sb, phys);
5161 struct ocfs2_extent_rec split_rec;
5162 struct ocfs2_path *left_path = NULL;
5163 struct ocfs2_extent_list *el;
5164 struct ocfs2_extent_rec *rec;
5165
5166 left_path = ocfs2_new_path_from_et(et);
5167 if (!left_path) {
5168 ret = -ENOMEM;
5169 mlog_errno(ret);
5170 goto out;
5171 }
5172
5173 ret = ocfs2_find_path(et->et_ci, left_path, cpos);
5174 if (ret) {
5175 mlog_errno(ret);
5176 goto out;
5177 }
5178 el = path_leaf_el(left_path);
5179
5180 index = ocfs2_search_extent_list(el, cpos);
5181 if (index == -1) {
5182 ocfs2_error(sb,
5183 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5184 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5185 cpos);
5186 ret = -EROFS;
5187 goto out;
5188 }
5189
5190 ret = -EIO;
5191 rec = &el->l_recs[index];
5192 if (new_flags && (rec->e_flags & new_flags)) {
5193 mlog(ML_ERROR, "Owner %llu tried to set %d flags on an "
5194 "extent that already had them\n",
5195 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5196 new_flags);
5197 goto out;
5198 }
5199
5200 if (clear_flags && !(rec->e_flags & clear_flags)) {
5201 mlog(ML_ERROR, "Owner %llu tried to clear %d flags on an "
5202 "extent that didn't have them\n",
5203 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5204 clear_flags);
5205 goto out;
5206 }
5207
5208 memset(&split_rec, 0, sizeof(struct ocfs2_extent_rec));
5209 split_rec.e_cpos = cpu_to_le32(cpos);
5210 split_rec.e_leaf_clusters = cpu_to_le16(len);
5211 split_rec.e_blkno = cpu_to_le64(start_blkno);
5212 split_rec.e_flags = rec->e_flags;
5213 if (new_flags)
5214 split_rec.e_flags |= new_flags;
5215 if (clear_flags)
5216 split_rec.e_flags &= ~clear_flags;
5217
5218 ret = ocfs2_split_extent(handle, et, left_path,
5219 index, &split_rec, meta_ac,
5220 dealloc);
5221 if (ret)
5222 mlog_errno(ret);
5223
5224out:
5225 ocfs2_free_path(left_path);
5226 return ret;
5227
5228}
5229
5230/*
5231 * Mark the already-existing extent at cpos as written for len clusters.
5232 * This removes the unwritten extent flag.
5233 *
5234 * If the existing extent is larger than the request, initiate a
5235 * split. An attempt will be made at merging with adjacent extents.
5236 *
5237 * The caller is responsible for passing down meta_ac if we'll need it.
5238 */
5239int ocfs2_mark_extent_written(struct inode *inode,
5240 struct ocfs2_extent_tree *et,
5241 handle_t *handle, u32 cpos, u32 len, u32 phys,
5242 struct ocfs2_alloc_context *meta_ac,
5243 struct ocfs2_cached_dealloc_ctxt *dealloc)
5244{
5245 int ret;
5246
5247 trace_ocfs2_mark_extent_written(
5248 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5249 cpos, len, phys);
5250
5251 if (!ocfs2_writes_unwritten_extents(OCFS2_SB(inode->i_sb))) {
5252 ocfs2_error(inode->i_sb, "Inode %llu has unwritten extents that are being written to, but the feature bit is not set in the super block\n",
5253 (unsigned long long)OCFS2_I(inode)->ip_blkno);
5254 ret = -EROFS;
5255 goto out;
5256 }
5257
5258 /*
5259 * XXX: This should be fixed up so that we just re-insert the
5260 * next extent records.
5261 */
5262 ocfs2_et_extent_map_truncate(et, 0);
5263
5264 ret = ocfs2_change_extent_flag(handle, et, cpos,
5265 len, phys, meta_ac, dealloc,
5266 0, OCFS2_EXT_UNWRITTEN);
5267 if (ret)
5268 mlog_errno(ret);
5269
5270out:
5271 return ret;
5272}
5273
5274static int ocfs2_split_tree(handle_t *handle, struct ocfs2_extent_tree *et,
5275 struct ocfs2_path *path,
5276 int index, u32 new_range,
5277 struct ocfs2_alloc_context *meta_ac)
5278{
5279 int ret, depth, credits;
5280 struct buffer_head *last_eb_bh = NULL;
5281 struct ocfs2_extent_block *eb;
5282 struct ocfs2_extent_list *rightmost_el, *el;
5283 struct ocfs2_extent_rec split_rec;
5284 struct ocfs2_extent_rec *rec;
5285 struct ocfs2_insert_type insert;
5286
5287 /*
5288 * Setup the record to split before we grow the tree.
5289 */
5290 el = path_leaf_el(path);
5291 rec = &el->l_recs[index];
5292 ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci),
5293 &split_rec, new_range, rec);
5294
5295 depth = path->p_tree_depth;
5296 if (depth > 0) {
5297 ret = ocfs2_read_extent_block(et->et_ci,
5298 ocfs2_et_get_last_eb_blk(et),
5299 &last_eb_bh);
5300 if (ret < 0) {
5301 mlog_errno(ret);
5302 goto out;
5303 }
5304
5305 eb = (struct ocfs2_extent_block *) last_eb_bh->b_data;
5306 rightmost_el = &eb->h_list;
5307 } else
5308 rightmost_el = path_leaf_el(path);
5309
5310 credits = path->p_tree_depth +
5311 ocfs2_extend_meta_needed(et->et_root_el);
5312 ret = ocfs2_extend_trans(handle, credits);
5313 if (ret) {
5314 mlog_errno(ret);
5315 goto out;
5316 }
5317
5318 if (le16_to_cpu(rightmost_el->l_next_free_rec) ==
5319 le16_to_cpu(rightmost_el->l_count)) {
5320 ret = ocfs2_grow_tree(handle, et, &depth, &last_eb_bh,
5321 meta_ac);
5322 if (ret) {
5323 mlog_errno(ret);
5324 goto out;
5325 }
5326 }
5327
5328 memset(&insert, 0, sizeof(struct ocfs2_insert_type));
5329 insert.ins_appending = APPEND_NONE;
5330 insert.ins_contig = CONTIG_NONE;
5331 insert.ins_split = SPLIT_RIGHT;
5332 insert.ins_tree_depth = depth;
5333
5334 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert);
5335 if (ret)
5336 mlog_errno(ret);
5337
5338out:
5339 brelse(last_eb_bh);
5340 return ret;
5341}
5342
5343static int ocfs2_truncate_rec(handle_t *handle,
5344 struct ocfs2_extent_tree *et,
5345 struct ocfs2_path *path, int index,
5346 struct ocfs2_cached_dealloc_ctxt *dealloc,
5347 u32 cpos, u32 len)
5348{
5349 int ret;
5350 u32 left_cpos, rec_range, trunc_range;
5351 int is_rightmost_tree_rec = 0;
5352 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
5353 struct ocfs2_path *left_path = NULL;
5354 struct ocfs2_extent_list *el = path_leaf_el(path);
5355 struct ocfs2_extent_rec *rec;
5356 struct ocfs2_extent_block *eb;
5357
5358 if (ocfs2_is_empty_extent(&el->l_recs[0]) && index > 0) {
5359 /* extend credit for ocfs2_remove_rightmost_path */
5360 ret = ocfs2_extend_rotate_transaction(handle, 0,
5361 handle->h_buffer_credits,
5362 path);
5363 if (ret) {
5364 mlog_errno(ret);
5365 goto out;
5366 }
5367
5368 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
5369 if (ret) {
5370 mlog_errno(ret);
5371 goto out;
5372 }
5373
5374 index--;
5375 }
5376
5377 if (index == (le16_to_cpu(el->l_next_free_rec) - 1) &&
5378 path->p_tree_depth) {
5379 /*
5380 * Check whether this is the rightmost tree record. If
5381 * we remove all of this record or part of its right
5382 * edge then an update of the record lengths above it
5383 * will be required.
5384 */
5385 eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data;
5386 if (eb->h_next_leaf_blk == 0)
5387 is_rightmost_tree_rec = 1;
5388 }
5389
5390 rec = &el->l_recs[index];
5391 if (index == 0 && path->p_tree_depth &&
5392 le32_to_cpu(rec->e_cpos) == cpos) {
5393 /*
5394 * Changing the leftmost offset (via partial or whole
5395 * record truncate) of an interior (or rightmost) path
5396 * means we have to update the subtree that is formed
5397 * by this leaf and the one to it's left.
5398 *
5399 * There are two cases we can skip:
5400 * 1) Path is the leftmost one in our btree.
5401 * 2) The leaf is rightmost and will be empty after
5402 * we remove the extent record - the rotate code
5403 * knows how to update the newly formed edge.
5404 */
5405
5406 ret = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos);
5407 if (ret) {
5408 mlog_errno(ret);
5409 goto out;
5410 }
5411
5412 if (left_cpos && le16_to_cpu(el->l_next_free_rec) > 1) {
5413 left_path = ocfs2_new_path_from_path(path);
5414 if (!left_path) {
5415 ret = -ENOMEM;
5416 mlog_errno(ret);
5417 goto out;
5418 }
5419
5420 ret = ocfs2_find_path(et->et_ci, left_path,
5421 left_cpos);
5422 if (ret) {
5423 mlog_errno(ret);
5424 goto out;
5425 }
5426 }
5427 }
5428
5429 ret = ocfs2_extend_rotate_transaction(handle, 0,
5430 handle->h_buffer_credits,
5431 path);
5432 if (ret) {
5433 mlog_errno(ret);
5434 goto out;
5435 }
5436
5437 ret = ocfs2_journal_access_path(et->et_ci, handle, path);
5438 if (ret) {
5439 mlog_errno(ret);
5440 goto out;
5441 }
5442
5443 ret = ocfs2_journal_access_path(et->et_ci, handle, left_path);
5444 if (ret) {
5445 mlog_errno(ret);
5446 goto out;
5447 }
5448
5449 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5450 trunc_range = cpos + len;
5451
5452 if (le32_to_cpu(rec->e_cpos) == cpos && rec_range == trunc_range) {
5453 int next_free;
5454
5455 memset(rec, 0, sizeof(*rec));
5456 ocfs2_cleanup_merge(el, index);
5457
5458 next_free = le16_to_cpu(el->l_next_free_rec);
5459 if (is_rightmost_tree_rec && next_free > 1) {
5460 /*
5461 * We skip the edge update if this path will
5462 * be deleted by the rotate code.
5463 */
5464 rec = &el->l_recs[next_free - 1];
5465 ocfs2_adjust_rightmost_records(handle, et, path,
5466 rec);
5467 }
5468 } else if (le32_to_cpu(rec->e_cpos) == cpos) {
5469 /* Remove leftmost portion of the record. */
5470 le32_add_cpu(&rec->e_cpos, len);
5471 le64_add_cpu(&rec->e_blkno, ocfs2_clusters_to_blocks(sb, len));
5472 le16_add_cpu(&rec->e_leaf_clusters, -len);
5473 } else if (rec_range == trunc_range) {
5474 /* Remove rightmost portion of the record */
5475 le16_add_cpu(&rec->e_leaf_clusters, -len);
5476 if (is_rightmost_tree_rec)
5477 ocfs2_adjust_rightmost_records(handle, et, path, rec);
5478 } else {
5479 /* Caller should have trapped this. */
5480 mlog(ML_ERROR, "Owner %llu: Invalid record truncate: (%u, %u) "
5481 "(%u, %u)\n",
5482 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5483 le32_to_cpu(rec->e_cpos),
5484 le16_to_cpu(rec->e_leaf_clusters), cpos, len);
5485 BUG();
5486 }
5487
5488 if (left_path) {
5489 int subtree_index;
5490
5491 subtree_index = ocfs2_find_subtree_root(et, left_path, path);
5492 ocfs2_complete_edge_insert(handle, left_path, path,
5493 subtree_index);
5494 }
5495
5496 ocfs2_journal_dirty(handle, path_leaf_bh(path));
5497
5498 ret = ocfs2_rotate_tree_left(handle, et, path, dealloc);
5499 if (ret)
5500 mlog_errno(ret);
5501
5502out:
5503 ocfs2_free_path(left_path);
5504 return ret;
5505}
5506
5507int ocfs2_remove_extent(handle_t *handle,
5508 struct ocfs2_extent_tree *et,
5509 u32 cpos, u32 len,
5510 struct ocfs2_alloc_context *meta_ac,
5511 struct ocfs2_cached_dealloc_ctxt *dealloc)
5512{
5513 int ret, index;
5514 u32 rec_range, trunc_range;
5515 struct ocfs2_extent_rec *rec;
5516 struct ocfs2_extent_list *el;
5517 struct ocfs2_path *path = NULL;
5518
5519 /*
5520 * XXX: Why are we truncating to 0 instead of wherever this
5521 * affects us?
5522 */
5523 ocfs2_et_extent_map_truncate(et, 0);
5524
5525 path = ocfs2_new_path_from_et(et);
5526 if (!path) {
5527 ret = -ENOMEM;
5528 mlog_errno(ret);
5529 goto out;
5530 }
5531
5532 ret = ocfs2_find_path(et->et_ci, path, cpos);
5533 if (ret) {
5534 mlog_errno(ret);
5535 goto out;
5536 }
5537
5538 el = path_leaf_el(path);
5539 index = ocfs2_search_extent_list(el, cpos);
5540 if (index == -1) {
5541 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5542 "Owner %llu has an extent at cpos %u which can no longer be found\n",
5543 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5544 cpos);
5545 ret = -EROFS;
5546 goto out;
5547 }
5548
5549 /*
5550 * We have 3 cases of extent removal:
5551 * 1) Range covers the entire extent rec
5552 * 2) Range begins or ends on one edge of the extent rec
5553 * 3) Range is in the middle of the extent rec (no shared edges)
5554 *
5555 * For case 1 we remove the extent rec and left rotate to
5556 * fill the hole.
5557 *
5558 * For case 2 we just shrink the existing extent rec, with a
5559 * tree update if the shrinking edge is also the edge of an
5560 * extent block.
5561 *
5562 * For case 3 we do a right split to turn the extent rec into
5563 * something case 2 can handle.
5564 */
5565 rec = &el->l_recs[index];
5566 rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
5567 trunc_range = cpos + len;
5568
5569 BUG_ON(cpos < le32_to_cpu(rec->e_cpos) || trunc_range > rec_range);
5570
5571 trace_ocfs2_remove_extent(
5572 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5573 cpos, len, index, le32_to_cpu(rec->e_cpos),
5574 ocfs2_rec_clusters(el, rec));
5575
5576 if (le32_to_cpu(rec->e_cpos) == cpos || rec_range == trunc_range) {
5577 ret = ocfs2_truncate_rec(handle, et, path, index, dealloc,
5578 cpos, len);
5579 if (ret) {
5580 mlog_errno(ret);
5581 goto out;
5582 }
5583 } else {
5584 ret = ocfs2_split_tree(handle, et, path, index,
5585 trunc_range, meta_ac);
5586 if (ret) {
5587 mlog_errno(ret);
5588 goto out;
5589 }
5590
5591 /*
5592 * The split could have manipulated the tree enough to
5593 * move the record location, so we have to look for it again.
5594 */
5595 ocfs2_reinit_path(path, 1);
5596
5597 ret = ocfs2_find_path(et->et_ci, path, cpos);
5598 if (ret) {
5599 mlog_errno(ret);
5600 goto out;
5601 }
5602
5603 el = path_leaf_el(path);
5604 index = ocfs2_search_extent_list(el, cpos);
5605 if (index == -1) {
5606 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5607 "Owner %llu: split at cpos %u lost record\n",
5608 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5609 cpos);
5610 ret = -EROFS;
5611 goto out;
5612 }
5613
5614 /*
5615 * Double check our values here. If anything is fishy,
5616 * it's easier to catch it at the top level.
5617 */
5618 rec = &el->l_recs[index];
5619 rec_range = le32_to_cpu(rec->e_cpos) +
5620 ocfs2_rec_clusters(el, rec);
5621 if (rec_range != trunc_range) {
5622 ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci),
5623 "Owner %llu: error after split at cpos %u trunc len %u, existing record is (%u,%u)\n",
5624 (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci),
5625 cpos, len, le32_to_cpu(rec->e_cpos),
5626 ocfs2_rec_clusters(el, rec));
5627 ret = -EROFS;
5628 goto out;
5629 }
5630
5631 ret = ocfs2_truncate_rec(handle, et, path, index, dealloc,
5632 cpos, len);
5633 if (ret)
5634 mlog_errno(ret);
5635 }
5636
5637out:
5638 ocfs2_free_path(path);
5639 return ret;
5640}
5641
5642/*
5643 * ocfs2_reserve_blocks_for_rec_trunc() would look basically the
5644 * same as ocfs2_lock_alloctors(), except for it accepts a blocks
5645 * number to reserve some extra blocks, and it only handles meta
5646 * data allocations.
5647 *
5648 * Currently, only ocfs2_remove_btree_range() uses it for truncating
5649 * and punching holes.
5650 */
5651static int ocfs2_reserve_blocks_for_rec_trunc(struct inode *inode,
5652 struct ocfs2_extent_tree *et,
5653 u32 extents_to_split,
5654 struct ocfs2_alloc_context **ac,
5655 int extra_blocks)
5656{
5657 int ret = 0, num_free_extents;
5658 unsigned int max_recs_needed = 2 * extents_to_split;
5659 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5660
5661 *ac = NULL;
5662
5663 num_free_extents = ocfs2_num_free_extents(et);
5664 if (num_free_extents < 0) {
5665 ret = num_free_extents;
5666 mlog_errno(ret);
5667 goto out;
5668 }
5669
5670 if (!num_free_extents ||
5671 (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed))
5672 extra_blocks += ocfs2_extend_meta_needed(et->et_root_el);
5673
5674 if (extra_blocks) {
5675 ret = ocfs2_reserve_new_metadata_blocks(osb, extra_blocks, ac);
5676 if (ret < 0) {
5677 if (ret != -ENOSPC)
5678 mlog_errno(ret);
5679 }
5680 }
5681
5682out:
5683 if (ret) {
5684 if (*ac) {
5685 ocfs2_free_alloc_context(*ac);
5686 *ac = NULL;
5687 }
5688 }
5689
5690 return ret;
5691}
5692
5693int ocfs2_remove_btree_range(struct inode *inode,
5694 struct ocfs2_extent_tree *et,
5695 u32 cpos, u32 phys_cpos, u32 len, int flags,
5696 struct ocfs2_cached_dealloc_ctxt *dealloc,
5697 u64 refcount_loc, bool refcount_tree_locked)
5698{
5699 int ret, credits = 0, extra_blocks = 0;
5700 u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
5701 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5702 struct inode *tl_inode = osb->osb_tl_inode;
5703 handle_t *handle;
5704 struct ocfs2_alloc_context *meta_ac = NULL;
5705 struct ocfs2_refcount_tree *ref_tree = NULL;
5706
5707 if ((flags & OCFS2_EXT_REFCOUNTED) && len) {
5708 BUG_ON(!ocfs2_is_refcount_inode(inode));
5709
5710 if (!refcount_tree_locked) {
5711 ret = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
5712 &ref_tree, NULL);
5713 if (ret) {
5714 mlog_errno(ret);
5715 goto bail;
5716 }
5717 }
5718
5719 ret = ocfs2_prepare_refcount_change_for_del(inode,
5720 refcount_loc,
5721 phys_blkno,
5722 len,
5723 &credits,
5724 &extra_blocks);
5725 if (ret < 0) {
5726 mlog_errno(ret);
5727 goto bail;
5728 }
5729 }
5730
5731 ret = ocfs2_reserve_blocks_for_rec_trunc(inode, et, 1, &meta_ac,
5732 extra_blocks);
5733 if (ret) {
5734 mlog_errno(ret);
5735 goto bail;
5736 }
5737
5738 inode_lock(tl_inode);
5739
5740 if (ocfs2_truncate_log_needs_flush(osb)) {
5741 ret = __ocfs2_flush_truncate_log(osb);
5742 if (ret < 0) {
5743 mlog_errno(ret);
5744 goto out;
5745 }
5746 }
5747
5748 handle = ocfs2_start_trans(osb,
5749 ocfs2_remove_extent_credits(osb->sb) + credits);
5750 if (IS_ERR(handle)) {
5751 ret = PTR_ERR(handle);
5752 mlog_errno(ret);
5753 goto out;
5754 }
5755
5756 ret = ocfs2_et_root_journal_access(handle, et,
5757 OCFS2_JOURNAL_ACCESS_WRITE);
5758 if (ret) {
5759 mlog_errno(ret);
5760 goto out_commit;
5761 }
5762
5763 dquot_free_space_nodirty(inode,
5764 ocfs2_clusters_to_bytes(inode->i_sb, len));
5765
5766 ret = ocfs2_remove_extent(handle, et, cpos, len, meta_ac, dealloc);
5767 if (ret) {
5768 mlog_errno(ret);
5769 goto out_commit;
5770 }
5771
5772 ocfs2_et_update_clusters(et, -len);
5773 ocfs2_update_inode_fsync_trans(handle, inode, 1);
5774
5775 ocfs2_journal_dirty(handle, et->et_root_bh);
5776
5777 if (phys_blkno) {
5778 if (flags & OCFS2_EXT_REFCOUNTED)
5779 ret = ocfs2_decrease_refcount(inode, handle,
5780 ocfs2_blocks_to_clusters(osb->sb,
5781 phys_blkno),
5782 len, meta_ac,
5783 dealloc, 1);
5784 else
5785 ret = ocfs2_truncate_log_append(osb, handle,
5786 phys_blkno, len);
5787 if (ret)
5788 mlog_errno(ret);
5789
5790 }
5791
5792out_commit:
5793 ocfs2_commit_trans(osb, handle);
5794out:
5795 inode_unlock(tl_inode);
5796bail:
5797 if (meta_ac)
5798 ocfs2_free_alloc_context(meta_ac);
5799
5800 if (ref_tree)
5801 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
5802
5803 return ret;
5804}
5805
5806int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb)
5807{
5808 struct buffer_head *tl_bh = osb->osb_tl_bh;
5809 struct ocfs2_dinode *di;
5810 struct ocfs2_truncate_log *tl;
5811
5812 di = (struct ocfs2_dinode *) tl_bh->b_data;
5813 tl = &di->id2.i_dealloc;
5814
5815 mlog_bug_on_msg(le16_to_cpu(tl->tl_used) > le16_to_cpu(tl->tl_count),
5816 "slot %d, invalid truncate log parameters: used = "
5817 "%u, count = %u\n", osb->slot_num,
5818 le16_to_cpu(tl->tl_used), le16_to_cpu(tl->tl_count));
5819 return le16_to_cpu(tl->tl_used) == le16_to_cpu(tl->tl_count);
5820}
5821
5822static int ocfs2_truncate_log_can_coalesce(struct ocfs2_truncate_log *tl,
5823 unsigned int new_start)
5824{
5825 unsigned int tail_index;
5826 unsigned int current_tail;
5827
5828 /* No records, nothing to coalesce */
5829 if (!le16_to_cpu(tl->tl_used))
5830 return 0;
5831
5832 tail_index = le16_to_cpu(tl->tl_used) - 1;
5833 current_tail = le32_to_cpu(tl->tl_recs[tail_index].t_start);
5834 current_tail += le32_to_cpu(tl->tl_recs[tail_index].t_clusters);
5835
5836 return current_tail == new_start;
5837}
5838
5839int ocfs2_truncate_log_append(struct ocfs2_super *osb,
5840 handle_t *handle,
5841 u64 start_blk,
5842 unsigned int num_clusters)
5843{
5844 int status, index;
5845 unsigned int start_cluster, tl_count;
5846 struct inode *tl_inode = osb->osb_tl_inode;
5847 struct buffer_head *tl_bh = osb->osb_tl_bh;
5848 struct ocfs2_dinode *di;
5849 struct ocfs2_truncate_log *tl;
5850
5851 BUG_ON(inode_trylock(tl_inode));
5852
5853 start_cluster = ocfs2_blocks_to_clusters(osb->sb, start_blk);
5854
5855 di = (struct ocfs2_dinode *) tl_bh->b_data;
5856
5857 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
5858 * by the underlying call to ocfs2_read_inode_block(), so any
5859 * corruption is a code bug */
5860 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
5861
5862 tl = &di->id2.i_dealloc;
5863 tl_count = le16_to_cpu(tl->tl_count);
5864 mlog_bug_on_msg(tl_count > ocfs2_truncate_recs_per_inode(osb->sb) ||
5865 tl_count == 0,
5866 "Truncate record count on #%llu invalid "
5867 "wanted %u, actual %u\n",
5868 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5869 ocfs2_truncate_recs_per_inode(osb->sb),
5870 le16_to_cpu(tl->tl_count));
5871
5872 /* Caller should have known to flush before calling us. */
5873 index = le16_to_cpu(tl->tl_used);
5874 if (index >= tl_count) {
5875 status = -ENOSPC;
5876 mlog_errno(status);
5877 goto bail;
5878 }
5879
5880 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5881 OCFS2_JOURNAL_ACCESS_WRITE);
5882 if (status < 0) {
5883 mlog_errno(status);
5884 goto bail;
5885 }
5886
5887 trace_ocfs2_truncate_log_append(
5888 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, index,
5889 start_cluster, num_clusters);
5890 if (ocfs2_truncate_log_can_coalesce(tl, start_cluster)) {
5891 /*
5892 * Move index back to the record we are coalescing with.
5893 * ocfs2_truncate_log_can_coalesce() guarantees nonzero
5894 */
5895 index--;
5896
5897 num_clusters += le32_to_cpu(tl->tl_recs[index].t_clusters);
5898 trace_ocfs2_truncate_log_append(
5899 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5900 index, le32_to_cpu(tl->tl_recs[index].t_start),
5901 num_clusters);
5902 } else {
5903 tl->tl_recs[index].t_start = cpu_to_le32(start_cluster);
5904 tl->tl_used = cpu_to_le16(index + 1);
5905 }
5906 tl->tl_recs[index].t_clusters = cpu_to_le32(num_clusters);
5907
5908 ocfs2_journal_dirty(handle, tl_bh);
5909
5910 osb->truncated_clusters += num_clusters;
5911bail:
5912 return status;
5913}
5914
5915static int ocfs2_replay_truncate_records(struct ocfs2_super *osb,
5916 struct inode *data_alloc_inode,
5917 struct buffer_head *data_alloc_bh)
5918{
5919 int status = 0;
5920 int i;
5921 unsigned int num_clusters;
5922 u64 start_blk;
5923 struct ocfs2_truncate_rec rec;
5924 struct ocfs2_dinode *di;
5925 struct ocfs2_truncate_log *tl;
5926 struct inode *tl_inode = osb->osb_tl_inode;
5927 struct buffer_head *tl_bh = osb->osb_tl_bh;
5928 handle_t *handle;
5929
5930 di = (struct ocfs2_dinode *) tl_bh->b_data;
5931 tl = &di->id2.i_dealloc;
5932 i = le16_to_cpu(tl->tl_used) - 1;
5933 while (i >= 0) {
5934 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC);
5935 if (IS_ERR(handle)) {
5936 status = PTR_ERR(handle);
5937 mlog_errno(status);
5938 goto bail;
5939 }
5940
5941 /* Caller has given us at least enough credits to
5942 * update the truncate log dinode */
5943 status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh,
5944 OCFS2_JOURNAL_ACCESS_WRITE);
5945 if (status < 0) {
5946 mlog_errno(status);
5947 goto bail;
5948 }
5949
5950 tl->tl_used = cpu_to_le16(i);
5951
5952 ocfs2_journal_dirty(handle, tl_bh);
5953
5954 rec = tl->tl_recs[i];
5955 start_blk = ocfs2_clusters_to_blocks(data_alloc_inode->i_sb,
5956 le32_to_cpu(rec.t_start));
5957 num_clusters = le32_to_cpu(rec.t_clusters);
5958
5959 /* if start_blk is not set, we ignore the record as
5960 * invalid. */
5961 if (start_blk) {
5962 trace_ocfs2_replay_truncate_records(
5963 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
5964 i, le32_to_cpu(rec.t_start), num_clusters);
5965
5966 status = ocfs2_free_clusters(handle, data_alloc_inode,
5967 data_alloc_bh, start_blk,
5968 num_clusters);
5969 if (status < 0) {
5970 mlog_errno(status);
5971 goto bail;
5972 }
5973 }
5974
5975 ocfs2_commit_trans(osb, handle);
5976 i--;
5977 }
5978
5979 osb->truncated_clusters = 0;
5980
5981bail:
5982 return status;
5983}
5984
5985/* Expects you to already be holding tl_inode->i_mutex */
5986int __ocfs2_flush_truncate_log(struct ocfs2_super *osb)
5987{
5988 int status;
5989 unsigned int num_to_flush;
5990 struct inode *tl_inode = osb->osb_tl_inode;
5991 struct inode *data_alloc_inode = NULL;
5992 struct buffer_head *tl_bh = osb->osb_tl_bh;
5993 struct buffer_head *data_alloc_bh = NULL;
5994 struct ocfs2_dinode *di;
5995 struct ocfs2_truncate_log *tl;
5996 struct ocfs2_journal *journal = osb->journal;
5997
5998 BUG_ON(inode_trylock(tl_inode));
5999
6000 di = (struct ocfs2_dinode *) tl_bh->b_data;
6001
6002 /* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated
6003 * by the underlying call to ocfs2_read_inode_block(), so any
6004 * corruption is a code bug */
6005 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
6006
6007 tl = &di->id2.i_dealloc;
6008 num_to_flush = le16_to_cpu(tl->tl_used);
6009 trace_ocfs2_flush_truncate_log(
6010 (unsigned long long)OCFS2_I(tl_inode)->ip_blkno,
6011 num_to_flush);
6012 if (!num_to_flush) {
6013 status = 0;
6014 goto out;
6015 }
6016
6017 /* Appending truncate log(TA) and and flushing truncate log(TF) are
6018 * two separated transactions. They can be both committed but not
6019 * checkpointed. If crash occurs then, both two transaction will be
6020 * replayed with several already released to global bitmap clusters.
6021 * Then truncate log will be replayed resulting in cluster double free.
6022 */
6023 jbd2_journal_lock_updates(journal->j_journal);
6024 status = jbd2_journal_flush(journal->j_journal);
6025 jbd2_journal_unlock_updates(journal->j_journal);
6026 if (status < 0) {
6027 mlog_errno(status);
6028 goto out;
6029 }
6030
6031 data_alloc_inode = ocfs2_get_system_file_inode(osb,
6032 GLOBAL_BITMAP_SYSTEM_INODE,
6033 OCFS2_INVALID_SLOT);
6034 if (!data_alloc_inode) {
6035 status = -EINVAL;
6036 mlog(ML_ERROR, "Could not get bitmap inode!\n");
6037 goto out;
6038 }
6039
6040 inode_lock(data_alloc_inode);
6041
6042 status = ocfs2_inode_lock(data_alloc_inode, &data_alloc_bh, 1);
6043 if (status < 0) {
6044 mlog_errno(status);
6045 goto out_mutex;
6046 }
6047
6048 status = ocfs2_replay_truncate_records(osb, data_alloc_inode,
6049 data_alloc_bh);
6050 if (status < 0)
6051 mlog_errno(status);
6052
6053 brelse(data_alloc_bh);
6054 ocfs2_inode_unlock(data_alloc_inode, 1);
6055
6056out_mutex:
6057 inode_unlock(data_alloc_inode);
6058 iput(data_alloc_inode);
6059
6060out:
6061 return status;
6062}
6063
6064int ocfs2_flush_truncate_log(struct ocfs2_super *osb)
6065{
6066 int status;
6067 struct inode *tl_inode = osb->osb_tl_inode;
6068
6069 inode_lock(tl_inode);
6070 status = __ocfs2_flush_truncate_log(osb);
6071 inode_unlock(tl_inode);
6072
6073 return status;
6074}
6075
6076static void ocfs2_truncate_log_worker(struct work_struct *work)
6077{
6078 int status;
6079 struct ocfs2_super *osb =
6080 container_of(work, struct ocfs2_super,
6081 osb_truncate_log_wq.work);
6082
6083 status = ocfs2_flush_truncate_log(osb);
6084 if (status < 0)
6085 mlog_errno(status);
6086 else
6087 ocfs2_init_steal_slots(osb);
6088}
6089
6090#define OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL (2 * HZ)
6091void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
6092 int cancel)
6093{
6094 if (osb->osb_tl_inode &&
6095 atomic_read(&osb->osb_tl_disable) == 0) {
6096 /* We want to push off log flushes while truncates are
6097 * still running. */
6098 if (cancel)
6099 cancel_delayed_work(&osb->osb_truncate_log_wq);
6100
6101 queue_delayed_work(osb->ocfs2_wq, &osb->osb_truncate_log_wq,
6102 OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL);
6103 }
6104}
6105
6106/*
6107 * Try to flush truncate logs if we can free enough clusters from it.
6108 * As for return value, "< 0" means error, "0" no space and "1" means
6109 * we have freed enough spaces and let the caller try to allocate again.
6110 */
6111int ocfs2_try_to_free_truncate_log(struct ocfs2_super *osb,
6112 unsigned int needed)
6113{
6114 tid_t target;
6115 int ret = 0;
6116 unsigned int truncated_clusters;
6117
6118 inode_lock(osb->osb_tl_inode);
6119 truncated_clusters = osb->truncated_clusters;
6120 inode_unlock(osb->osb_tl_inode);
6121
6122 /*
6123 * Check whether we can succeed in allocating if we free
6124 * the truncate log.
6125 */
6126 if (truncated_clusters < needed)
6127 goto out;
6128
6129 ret = ocfs2_flush_truncate_log(osb);
6130 if (ret) {
6131 mlog_errno(ret);
6132 goto out;
6133 }
6134
6135 if (jbd2_journal_start_commit(osb->journal->j_journal, &target)) {
6136 jbd2_log_wait_commit(osb->journal->j_journal, target);
6137 ret = 1;
6138 }
6139out:
6140 return ret;
6141}
6142
6143static int ocfs2_get_truncate_log_info(struct ocfs2_super *osb,
6144 int slot_num,
6145 struct inode **tl_inode,
6146 struct buffer_head **tl_bh)
6147{
6148 int status;
6149 struct inode *inode = NULL;
6150 struct buffer_head *bh = NULL;
6151
6152 inode = ocfs2_get_system_file_inode(osb,
6153 TRUNCATE_LOG_SYSTEM_INODE,
6154 slot_num);
6155 if (!inode) {
6156 status = -EINVAL;
6157 mlog(ML_ERROR, "Could not get load truncate log inode!\n");
6158 goto bail;
6159 }
6160
6161 status = ocfs2_read_inode_block(inode, &bh);
6162 if (status < 0) {
6163 iput(inode);
6164 mlog_errno(status);
6165 goto bail;
6166 }
6167
6168 *tl_inode = inode;
6169 *tl_bh = bh;
6170bail:
6171 return status;
6172}
6173
6174/* called during the 1st stage of node recovery. we stamp a clean
6175 * truncate log and pass back a copy for processing later. if the
6176 * truncate log does not require processing, a *tl_copy is set to
6177 * NULL. */
6178int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
6179 int slot_num,
6180 struct ocfs2_dinode **tl_copy)
6181{
6182 int status;
6183 struct inode *tl_inode = NULL;
6184 struct buffer_head *tl_bh = NULL;
6185 struct ocfs2_dinode *di;
6186 struct ocfs2_truncate_log *tl;
6187
6188 *tl_copy = NULL;
6189
6190 trace_ocfs2_begin_truncate_log_recovery(slot_num);
6191
6192 status = ocfs2_get_truncate_log_info(osb, slot_num, &tl_inode, &tl_bh);
6193 if (status < 0) {
6194 mlog_errno(status);
6195 goto bail;
6196 }
6197
6198 di = (struct ocfs2_dinode *) tl_bh->b_data;
6199
6200 /* tl_bh is loaded from ocfs2_get_truncate_log_info(). It's
6201 * validated by the underlying call to ocfs2_read_inode_block(),
6202 * so any corruption is a code bug */
6203 BUG_ON(!OCFS2_IS_VALID_DINODE(di));
6204
6205 tl = &di->id2.i_dealloc;
6206 if (le16_to_cpu(tl->tl_used)) {
6207 trace_ocfs2_truncate_log_recovery_num(le16_to_cpu(tl->tl_used));
6208
6209 /*
6210 * Assuming the write-out below goes well, this copy will be
6211 * passed back to recovery for processing.
6212 */
6213 *tl_copy = kmemdup(tl_bh->b_data, tl_bh->b_size, GFP_KERNEL);
6214 if (!(*tl_copy)) {
6215 status = -ENOMEM;
6216 mlog_errno(status);
6217 goto bail;
6218 }
6219
6220 /* All we need to do to clear the truncate log is set
6221 * tl_used. */
6222 tl->tl_used = 0;
6223
6224 ocfs2_compute_meta_ecc(osb->sb, tl_bh->b_data, &di->i_check);
6225 status = ocfs2_write_block(osb, tl_bh, INODE_CACHE(tl_inode));
6226 if (status < 0) {
6227 mlog_errno(status);
6228 goto bail;
6229 }
6230 }
6231
6232bail:
6233 iput(tl_inode);
6234 brelse(tl_bh);
6235
6236 if (status < 0) {
6237 kfree(*tl_copy);
6238 *tl_copy = NULL;
6239 mlog_errno(status);
6240 }
6241
6242 return status;
6243}
6244
6245int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
6246 struct ocfs2_dinode *tl_copy)
6247{
6248 int status = 0;
6249 int i;
6250 unsigned int clusters, num_recs, start_cluster;
6251 u64 start_blk;
6252 handle_t *handle;
6253 struct inode *tl_inode = osb->osb_tl_inode;
6254 struct ocfs2_truncate_log *tl;
6255
6256 if (OCFS2_I(tl_inode)->ip_blkno == le64_to_cpu(tl_copy->i_blkno)) {
6257 mlog(ML_ERROR, "Asked to recover my own truncate log!\n");
6258 return -EINVAL;
6259 }
6260
6261 tl = &tl_copy->id2.i_dealloc;
6262 num_recs = le16_to_cpu(tl->tl_used);
6263 trace_ocfs2_complete_truncate_log_recovery(
6264 (unsigned long long)le64_to_cpu(tl_copy->i_blkno),
6265 num_recs);
6266
6267 inode_lock(tl_inode);
6268 for(i = 0; i < num_recs; i++) {
6269 if (ocfs2_truncate_log_needs_flush(osb)) {
6270 status = __ocfs2_flush_truncate_log(osb);
6271 if (status < 0) {
6272 mlog_errno(status);
6273 goto bail_up;
6274 }
6275 }
6276
6277 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6278 if (IS_ERR(handle)) {
6279 status = PTR_ERR(handle);
6280 mlog_errno(status);
6281 goto bail_up;
6282 }
6283
6284 clusters = le32_to_cpu(tl->tl_recs[i].t_clusters);
6285 start_cluster = le32_to_cpu(tl->tl_recs[i].t_start);
6286 start_blk = ocfs2_clusters_to_blocks(osb->sb, start_cluster);
6287
6288 status = ocfs2_truncate_log_append(osb, handle,
6289 start_blk, clusters);
6290 ocfs2_commit_trans(osb, handle);
6291 if (status < 0) {
6292 mlog_errno(status);
6293 goto bail_up;
6294 }
6295 }
6296
6297bail_up:
6298 inode_unlock(tl_inode);
6299
6300 return status;
6301}
6302
6303void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb)
6304{
6305 int status;
6306 struct inode *tl_inode = osb->osb_tl_inode;
6307
6308 atomic_set(&osb->osb_tl_disable, 1);
6309
6310 if (tl_inode) {
6311 cancel_delayed_work(&osb->osb_truncate_log_wq);
6312 flush_workqueue(osb->ocfs2_wq);
6313
6314 status = ocfs2_flush_truncate_log(osb);
6315 if (status < 0)
6316 mlog_errno(status);
6317
6318 brelse(osb->osb_tl_bh);
6319 iput(osb->osb_tl_inode);
6320 }
6321}
6322
6323int ocfs2_truncate_log_init(struct ocfs2_super *osb)
6324{
6325 int status;
6326 struct inode *tl_inode = NULL;
6327 struct buffer_head *tl_bh = NULL;
6328
6329 status = ocfs2_get_truncate_log_info(osb,
6330 osb->slot_num,
6331 &tl_inode,
6332 &tl_bh);
6333 if (status < 0)
6334 mlog_errno(status);
6335
6336 /* ocfs2_truncate_log_shutdown keys on the existence of
6337 * osb->osb_tl_inode so we don't set any of the osb variables
6338 * until we're sure all is well. */
6339 INIT_DELAYED_WORK(&osb->osb_truncate_log_wq,
6340 ocfs2_truncate_log_worker);
6341 atomic_set(&osb->osb_tl_disable, 0);
6342 osb->osb_tl_bh = tl_bh;
6343 osb->osb_tl_inode = tl_inode;
6344
6345 return status;
6346}
6347
6348/*
6349 * Delayed de-allocation of suballocator blocks.
6350 *
6351 * Some sets of block de-allocations might involve multiple suballocator inodes.
6352 *
6353 * The locking for this can get extremely complicated, especially when
6354 * the suballocator inodes to delete from aren't known until deep
6355 * within an unrelated codepath.
6356 *
6357 * ocfs2_extent_block structures are a good example of this - an inode
6358 * btree could have been grown by any number of nodes each allocating
6359 * out of their own suballoc inode.
6360 *
6361 * These structures allow the delay of block de-allocation until a
6362 * later time, when locking of multiple cluster inodes won't cause
6363 * deadlock.
6364 */
6365
6366/*
6367 * Describe a single bit freed from a suballocator. For the block
6368 * suballocators, it represents one block. For the global cluster
6369 * allocator, it represents some clusters and free_bit indicates
6370 * clusters number.
6371 */
6372struct ocfs2_cached_block_free {
6373 struct ocfs2_cached_block_free *free_next;
6374 u64 free_bg;
6375 u64 free_blk;
6376 unsigned int free_bit;
6377};
6378
6379struct ocfs2_per_slot_free_list {
6380 struct ocfs2_per_slot_free_list *f_next_suballocator;
6381 int f_inode_type;
6382 int f_slot;
6383 struct ocfs2_cached_block_free *f_first;
6384};
6385
6386static int ocfs2_free_cached_blocks(struct ocfs2_super *osb,
6387 int sysfile_type,
6388 int slot,
6389 struct ocfs2_cached_block_free *head)
6390{
6391 int ret;
6392 u64 bg_blkno;
6393 handle_t *handle;
6394 struct inode *inode;
6395 struct buffer_head *di_bh = NULL;
6396 struct ocfs2_cached_block_free *tmp;
6397
6398 inode = ocfs2_get_system_file_inode(osb, sysfile_type, slot);
6399 if (!inode) {
6400 ret = -EINVAL;
6401 mlog_errno(ret);
6402 goto out;
6403 }
6404
6405 inode_lock(inode);
6406
6407 ret = ocfs2_inode_lock(inode, &di_bh, 1);
6408 if (ret) {
6409 mlog_errno(ret);
6410 goto out_mutex;
6411 }
6412
6413 while (head) {
6414 if (head->free_bg)
6415 bg_blkno = head->free_bg;
6416 else
6417 bg_blkno = ocfs2_which_suballoc_group(head->free_blk,
6418 head->free_bit);
6419 handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
6420 if (IS_ERR(handle)) {
6421 ret = PTR_ERR(handle);
6422 mlog_errno(ret);
6423 goto out_unlock;
6424 }
6425
6426 trace_ocfs2_free_cached_blocks(
6427 (unsigned long long)head->free_blk, head->free_bit);
6428
6429 ret = ocfs2_free_suballoc_bits(handle, inode, di_bh,
6430 head->free_bit, bg_blkno, 1);
6431 if (ret)
6432 mlog_errno(ret);
6433
6434 ocfs2_commit_trans(osb, handle);
6435
6436 tmp = head;
6437 head = head->free_next;
6438 kfree(tmp);
6439 }
6440
6441out_unlock:
6442 ocfs2_inode_unlock(inode, 1);
6443 brelse(di_bh);
6444out_mutex:
6445 inode_unlock(inode);
6446 iput(inode);
6447out:
6448 while(head) {
6449 /* Premature exit may have left some dangling items. */
6450 tmp = head;
6451 head = head->free_next;
6452 kfree(tmp);
6453 }
6454
6455 return ret;
6456}
6457
6458int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6459 u64 blkno, unsigned int bit)
6460{
6461 int ret = 0;
6462 struct ocfs2_cached_block_free *item;
6463
6464 item = kzalloc(sizeof(*item), GFP_NOFS);
6465 if (item == NULL) {
6466 ret = -ENOMEM;
6467 mlog_errno(ret);
6468 return ret;
6469 }
6470
6471 trace_ocfs2_cache_cluster_dealloc((unsigned long long)blkno, bit);
6472
6473 item->free_blk = blkno;
6474 item->free_bit = bit;
6475 item->free_next = ctxt->c_global_allocator;
6476
6477 ctxt->c_global_allocator = item;
6478 return ret;
6479}
6480
6481static int ocfs2_free_cached_clusters(struct ocfs2_super *osb,
6482 struct ocfs2_cached_block_free *head)
6483{
6484 struct ocfs2_cached_block_free *tmp;
6485 struct inode *tl_inode = osb->osb_tl_inode;
6486 handle_t *handle;
6487 int ret = 0;
6488
6489 inode_lock(tl_inode);
6490
6491 while (head) {
6492 if (ocfs2_truncate_log_needs_flush(osb)) {
6493 ret = __ocfs2_flush_truncate_log(osb);
6494 if (ret < 0) {
6495 mlog_errno(ret);
6496 break;
6497 }
6498 }
6499
6500 handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE);
6501 if (IS_ERR(handle)) {
6502 ret = PTR_ERR(handle);
6503 mlog_errno(ret);
6504 break;
6505 }
6506
6507 ret = ocfs2_truncate_log_append(osb, handle, head->free_blk,
6508 head->free_bit);
6509
6510 ocfs2_commit_trans(osb, handle);
6511 tmp = head;
6512 head = head->free_next;
6513 kfree(tmp);
6514
6515 if (ret < 0) {
6516 mlog_errno(ret);
6517 break;
6518 }
6519 }
6520
6521 inode_unlock(tl_inode);
6522
6523 while (head) {
6524 /* Premature exit may have left some dangling items. */
6525 tmp = head;
6526 head = head->free_next;
6527 kfree(tmp);
6528 }
6529
6530 return ret;
6531}
6532
6533int ocfs2_run_deallocs(struct ocfs2_super *osb,
6534 struct ocfs2_cached_dealloc_ctxt *ctxt)
6535{
6536 int ret = 0, ret2;
6537 struct ocfs2_per_slot_free_list *fl;
6538
6539 if (!ctxt)
6540 return 0;
6541
6542 while (ctxt->c_first_suballocator) {
6543 fl = ctxt->c_first_suballocator;
6544
6545 if (fl->f_first) {
6546 trace_ocfs2_run_deallocs(fl->f_inode_type,
6547 fl->f_slot);
6548 ret2 = ocfs2_free_cached_blocks(osb,
6549 fl->f_inode_type,
6550 fl->f_slot,
6551 fl->f_first);
6552 if (ret2)
6553 mlog_errno(ret2);
6554 if (!ret)
6555 ret = ret2;
6556 }
6557
6558 ctxt->c_first_suballocator = fl->f_next_suballocator;
6559 kfree(fl);
6560 }
6561
6562 if (ctxt->c_global_allocator) {
6563 ret2 = ocfs2_free_cached_clusters(osb,
6564 ctxt->c_global_allocator);
6565 if (ret2)
6566 mlog_errno(ret2);
6567 if (!ret)
6568 ret = ret2;
6569
6570 ctxt->c_global_allocator = NULL;
6571 }
6572
6573 return ret;
6574}
6575
6576static struct ocfs2_per_slot_free_list *
6577ocfs2_find_per_slot_free_list(int type,
6578 int slot,
6579 struct ocfs2_cached_dealloc_ctxt *ctxt)
6580{
6581 struct ocfs2_per_slot_free_list *fl = ctxt->c_first_suballocator;
6582
6583 while (fl) {
6584 if (fl->f_inode_type == type && fl->f_slot == slot)
6585 return fl;
6586
6587 fl = fl->f_next_suballocator;
6588 }
6589
6590 fl = kmalloc(sizeof(*fl), GFP_NOFS);
6591 if (fl) {
6592 fl->f_inode_type = type;
6593 fl->f_slot = slot;
6594 fl->f_first = NULL;
6595 fl->f_next_suballocator = ctxt->c_first_suballocator;
6596
6597 ctxt->c_first_suballocator = fl;
6598 }
6599 return fl;
6600}
6601
6602static struct ocfs2_per_slot_free_list *
6603ocfs2_find_preferred_free_list(int type,
6604 int preferred_slot,
6605 int *real_slot,
6606 struct ocfs2_cached_dealloc_ctxt *ctxt)
6607{
6608 struct ocfs2_per_slot_free_list *fl = ctxt->c_first_suballocator;
6609
6610 while (fl) {
6611 if (fl->f_inode_type == type && fl->f_slot == preferred_slot) {
6612 *real_slot = fl->f_slot;
6613 return fl;
6614 }
6615
6616 fl = fl->f_next_suballocator;
6617 }
6618
6619 /* If we can't find any free list matching preferred slot, just use
6620 * the first one.
6621 */
6622 fl = ctxt->c_first_suballocator;
6623 *real_slot = fl->f_slot;
6624
6625 return fl;
6626}
6627
6628/* Return Value 1 indicates empty */
6629static int ocfs2_is_dealloc_empty(struct ocfs2_extent_tree *et)
6630{
6631 struct ocfs2_per_slot_free_list *fl = NULL;
6632
6633 if (!et->et_dealloc)
6634 return 1;
6635
6636 fl = et->et_dealloc->c_first_suballocator;
6637 if (!fl)
6638 return 1;
6639
6640 if (!fl->f_first)
6641 return 1;
6642
6643 return 0;
6644}
6645
6646/* If extent was deleted from tree due to extent rotation and merging, and
6647 * no metadata is reserved ahead of time. Try to reuse some extents
6648 * just deleted. This is only used to reuse extent blocks.
6649 * It is supposed to find enough extent blocks in dealloc if our estimation
6650 * on metadata is accurate.
6651 */
6652static int ocfs2_reuse_blk_from_dealloc(handle_t *handle,
6653 struct ocfs2_extent_tree *et,
6654 struct buffer_head **new_eb_bh,
6655 int blk_wanted, int *blk_given)
6656{
6657 int i, status = 0, real_slot;
6658 struct ocfs2_cached_dealloc_ctxt *dealloc;
6659 struct ocfs2_per_slot_free_list *fl;
6660 struct ocfs2_cached_block_free *bf;
6661 struct ocfs2_extent_block *eb;
6662 struct ocfs2_super *osb =
6663 OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci));
6664
6665 *blk_given = 0;
6666
6667 /* If extent tree doesn't have a dealloc, this is not faulty. Just
6668 * tell upper caller dealloc can't provide any block and it should
6669 * ask for alloc to claim more space.
6670 */
6671 dealloc = et->et_dealloc;
6672 if (!dealloc)
6673 goto bail;
6674
6675 for (i = 0; i < blk_wanted; i++) {
6676 /* Prefer to use local slot */
6677 fl = ocfs2_find_preferred_free_list(EXTENT_ALLOC_SYSTEM_INODE,
6678 osb->slot_num, &real_slot,
6679 dealloc);
6680 /* If no more block can be reused, we should claim more
6681 * from alloc. Just return here normally.
6682 */
6683 if (!fl) {
6684 status = 0;
6685 break;
6686 }
6687
6688 bf = fl->f_first;
6689 fl->f_first = bf->free_next;
6690
6691 new_eb_bh[i] = sb_getblk(osb->sb, bf->free_blk);
6692 if (new_eb_bh[i] == NULL) {
6693 status = -ENOMEM;
6694 mlog_errno(status);
6695 goto bail;
6696 }
6697
6698 mlog(0, "Reusing block(%llu) from "
6699 "dealloc(local slot:%d, real slot:%d)\n",
6700 bf->free_blk, osb->slot_num, real_slot);
6701
6702 ocfs2_set_new_buffer_uptodate(et->et_ci, new_eb_bh[i]);
6703
6704 status = ocfs2_journal_access_eb(handle, et->et_ci,
6705 new_eb_bh[i],
6706 OCFS2_JOURNAL_ACCESS_CREATE);
6707 if (status < 0) {
6708 mlog_errno(status);
6709 goto bail;
6710 }
6711
6712 memset(new_eb_bh[i]->b_data, 0, osb->sb->s_blocksize);
6713 eb = (struct ocfs2_extent_block *) new_eb_bh[i]->b_data;
6714
6715 /* We can't guarantee that buffer head is still cached, so
6716 * polutlate the extent block again.
6717 */
6718 strcpy(eb->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE);
6719 eb->h_blkno = cpu_to_le64(bf->free_blk);
6720 eb->h_fs_generation = cpu_to_le32(osb->fs_generation);
6721 eb->h_suballoc_slot = cpu_to_le16(real_slot);
6722 eb->h_suballoc_loc = cpu_to_le64(bf->free_bg);
6723 eb->h_suballoc_bit = cpu_to_le16(bf->free_bit);
6724 eb->h_list.l_count =
6725 cpu_to_le16(ocfs2_extent_recs_per_eb(osb->sb));
6726
6727 /* We'll also be dirtied by the caller, so
6728 * this isn't absolutely necessary.
6729 */
6730 ocfs2_journal_dirty(handle, new_eb_bh[i]);
6731
6732 if (!fl->f_first) {
6733 dealloc->c_first_suballocator = fl->f_next_suballocator;
6734 kfree(fl);
6735 }
6736 kfree(bf);
6737 }
6738
6739 *blk_given = i;
6740
6741bail:
6742 if (unlikely(status < 0)) {
6743 for (i = 0; i < blk_wanted; i++)
6744 brelse(new_eb_bh[i]);
6745 }
6746
6747 return status;
6748}
6749
6750int ocfs2_cache_block_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt,
6751 int type, int slot, u64 suballoc,
6752 u64 blkno, unsigned int bit)
6753{
6754 int ret;
6755 struct ocfs2_per_slot_free_list *fl;
6756 struct ocfs2_cached_block_free *item;
6757
6758 fl = ocfs2_find_per_slot_free_list(type, slot, ctxt);
6759 if (fl == NULL) {
6760 ret = -ENOMEM;
6761 mlog_errno(ret);
6762 goto out;
6763 }
6764
6765 item = kzalloc(sizeof(*item), GFP_NOFS);
6766 if (item == NULL) {
6767 ret = -ENOMEM;
6768 mlog_errno(ret);
6769 goto out;
6770 }
6771
6772 trace_ocfs2_cache_block_dealloc(type, slot,
6773 (unsigned long long)suballoc,
6774 (unsigned long long)blkno, bit);
6775
6776 item->free_bg = suballoc;
6777 item->free_blk = blkno;
6778 item->free_bit = bit;
6779 item->free_next = fl->f_first;
6780
6781 fl->f_first = item;
6782
6783 ret = 0;
6784out:
6785 return ret;
6786}
6787
6788static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt,
6789 struct ocfs2_extent_block *eb)
6790{
6791 return ocfs2_cache_block_dealloc(ctxt, EXTENT_ALLOC_SYSTEM_INODE,
6792 le16_to_cpu(eb->h_suballoc_slot),
6793 le64_to_cpu(eb->h_suballoc_loc),
6794 le64_to_cpu(eb->h_blkno),
6795 le16_to_cpu(eb->h_suballoc_bit));
6796}
6797
6798static int ocfs2_zero_func(handle_t *handle, struct buffer_head *bh)
6799{
6800 set_buffer_uptodate(bh);
6801 mark_buffer_dirty(bh);
6802 return 0;
6803}
6804
6805void ocfs2_map_and_dirty_page(struct inode *inode, handle_t *handle,
6806 unsigned int from, unsigned int to,
6807 struct page *page, int zero, u64 *phys)
6808{
6809 int ret, partial = 0;
6810 loff_t start_byte = ((loff_t)page->index << PAGE_SHIFT) + from;
6811 loff_t length = to - from;
6812
6813 ret = ocfs2_map_page_blocks(page, phys, inode, from, to, 0);
6814 if (ret)
6815 mlog_errno(ret);
6816
6817 if (zero)
6818 zero_user_segment(page, from, to);
6819
6820 /*
6821 * Need to set the buffers we zero'd into uptodate
6822 * here if they aren't - ocfs2_map_page_blocks()
6823 * might've skipped some
6824 */
6825 ret = walk_page_buffers(handle, page_buffers(page),
6826 from, to, &partial,
6827 ocfs2_zero_func);
6828 if (ret < 0)
6829 mlog_errno(ret);
6830 else if (ocfs2_should_order_data(inode)) {
6831 ret = ocfs2_jbd2_inode_add_write(handle, inode,
6832 start_byte, length);
6833 if (ret < 0)
6834 mlog_errno(ret);
6835 }
6836
6837 if (!partial)
6838 SetPageUptodate(page);
6839
6840 flush_dcache_page(page);
6841}
6842
6843static void ocfs2_zero_cluster_pages(struct inode *inode, loff_t start,
6844 loff_t end, struct page **pages,
6845 int numpages, u64 phys, handle_t *handle)
6846{
6847 int i;
6848 struct page *page;
6849 unsigned int from, to = PAGE_SIZE;
6850 struct super_block *sb = inode->i_sb;
6851
6852 BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(sb)));
6853
6854 if (numpages == 0)
6855 goto out;
6856
6857 to = PAGE_SIZE;
6858 for(i = 0; i < numpages; i++) {
6859 page = pages[i];
6860
6861 from = start & (PAGE_SIZE - 1);
6862 if ((end >> PAGE_SHIFT) == page->index)
6863 to = end & (PAGE_SIZE - 1);
6864
6865 BUG_ON(from > PAGE_SIZE);
6866 BUG_ON(to > PAGE_SIZE);
6867
6868 ocfs2_map_and_dirty_page(inode, handle, from, to, page, 1,
6869 &phys);
6870
6871 start = (page->index + 1) << PAGE_SHIFT;
6872 }
6873out:
6874 if (pages)
6875 ocfs2_unlock_and_free_pages(pages, numpages);
6876}
6877
6878int ocfs2_grab_pages(struct inode *inode, loff_t start, loff_t end,
6879 struct page **pages, int *num)
6880{
6881 int numpages, ret = 0;
6882 struct address_space *mapping = inode->i_mapping;
6883 unsigned long index;
6884 loff_t last_page_bytes;
6885
6886 BUG_ON(start > end);
6887
6888 numpages = 0;
6889 last_page_bytes = PAGE_ALIGN(end);
6890 index = start >> PAGE_SHIFT;
6891 do {
6892 pages[numpages] = find_or_create_page(mapping, index, GFP_NOFS);
6893 if (!pages[numpages]) {
6894 ret = -ENOMEM;
6895 mlog_errno(ret);
6896 goto out;
6897 }
6898
6899 numpages++;
6900 index++;
6901 } while (index < (last_page_bytes >> PAGE_SHIFT));
6902
6903out:
6904 if (ret != 0) {
6905 if (pages)
6906 ocfs2_unlock_and_free_pages(pages, numpages);
6907 numpages = 0;
6908 }
6909
6910 *num = numpages;
6911
6912 return ret;
6913}
6914
6915static int ocfs2_grab_eof_pages(struct inode *inode, loff_t start, loff_t end,
6916 struct page **pages, int *num)
6917{
6918 struct super_block *sb = inode->i_sb;
6919
6920 BUG_ON(start >> OCFS2_SB(sb)->s_clustersize_bits !=
6921 (end - 1) >> OCFS2_SB(sb)->s_clustersize_bits);
6922
6923 return ocfs2_grab_pages(inode, start, end, pages, num);
6924}
6925
6926/*
6927 * Zero the area past i_size but still within an allocated
6928 * cluster. This avoids exposing nonzero data on subsequent file
6929 * extends.
6930 *
6931 * We need to call this before i_size is updated on the inode because
6932 * otherwise block_write_full_page() will skip writeout of pages past
6933 * i_size. The new_i_size parameter is passed for this reason.
6934 */
6935int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
6936 u64 range_start, u64 range_end)
6937{
6938 int ret = 0, numpages;
6939 struct page **pages = NULL;
6940 u64 phys;
6941 unsigned int ext_flags;
6942 struct super_block *sb = inode->i_sb;
6943
6944 /*
6945 * File systems which don't support sparse files zero on every
6946 * extend.
6947 */
6948 if (!ocfs2_sparse_alloc(OCFS2_SB(sb)))
6949 return 0;
6950
6951 pages = kcalloc(ocfs2_pages_per_cluster(sb),
6952 sizeof(struct page *), GFP_NOFS);
6953 if (pages == NULL) {
6954 ret = -ENOMEM;
6955 mlog_errno(ret);
6956 goto out;
6957 }
6958
6959 if (range_start == range_end)
6960 goto out;
6961
6962 ret = ocfs2_extent_map_get_blocks(inode,
6963 range_start >> sb->s_blocksize_bits,
6964 &phys, NULL, &ext_flags);
6965 if (ret) {
6966 mlog_errno(ret);
6967 goto out;
6968 }
6969
6970 /*
6971 * Tail is a hole, or is marked unwritten. In either case, we
6972 * can count on read and write to return/push zero's.
6973 */
6974 if (phys == 0 || ext_flags & OCFS2_EXT_UNWRITTEN)
6975 goto out;
6976
6977 ret = ocfs2_grab_eof_pages(inode, range_start, range_end, pages,
6978 &numpages);
6979 if (ret) {
6980 mlog_errno(ret);
6981 goto out;
6982 }
6983
6984 ocfs2_zero_cluster_pages(inode, range_start, range_end, pages,
6985 numpages, phys, handle);
6986
6987 /*
6988 * Initiate writeout of the pages we zero'd here. We don't
6989 * wait on them - the truncate_inode_pages() call later will
6990 * do that for us.
6991 */
6992 ret = filemap_fdatawrite_range(inode->i_mapping, range_start,
6993 range_end - 1);
6994 if (ret)
6995 mlog_errno(ret);
6996
6997out:
6998 kfree(pages);
6999
7000 return ret;
7001}
7002
7003static void ocfs2_zero_dinode_id2_with_xattr(struct inode *inode,
7004 struct ocfs2_dinode *di)
7005{
7006 unsigned int blocksize = 1 << inode->i_sb->s_blocksize_bits;
7007 unsigned int xattrsize = le16_to_cpu(di->i_xattr_inline_size);
7008
7009 if (le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_XATTR_FL)
7010 memset(&di->id2, 0, blocksize -
7011 offsetof(struct ocfs2_dinode, id2) -
7012 xattrsize);
7013 else
7014 memset(&di->id2, 0, blocksize -
7015 offsetof(struct ocfs2_dinode, id2));
7016}
7017
7018void ocfs2_dinode_new_extent_list(struct inode *inode,
7019 struct ocfs2_dinode *di)
7020{
7021 ocfs2_zero_dinode_id2_with_xattr(inode, di);
7022 di->id2.i_list.l_tree_depth = 0;
7023 di->id2.i_list.l_next_free_rec = 0;
7024 di->id2.i_list.l_count = cpu_to_le16(
7025 ocfs2_extent_recs_per_inode_with_xattr(inode->i_sb, di));
7026}
7027
7028void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di)
7029{
7030 struct ocfs2_inode_info *oi = OCFS2_I(inode);
7031 struct ocfs2_inline_data *idata = &di->id2.i_data;
7032
7033 spin_lock(&oi->ip_lock);
7034 oi->ip_dyn_features |= OCFS2_INLINE_DATA_FL;
7035 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
7036 spin_unlock(&oi->ip_lock);
7037
7038 /*
7039 * We clear the entire i_data structure here so that all
7040 * fields can be properly initialized.
7041 */
7042 ocfs2_zero_dinode_id2_with_xattr(inode, di);
7043
7044 idata->id_count = cpu_to_le16(
7045 ocfs2_max_inline_data_with_xattr(inode->i_sb, di));
7046}
7047
7048int ocfs2_convert_inline_data_to_extents(struct inode *inode,
7049 struct buffer_head *di_bh)
7050{
7051 int ret, i, has_data, num_pages = 0;
7052 int need_free = 0;
7053 u32 bit_off, num;
7054 handle_t *handle;
7055 u64 uninitialized_var(block);
7056 struct ocfs2_inode_info *oi = OCFS2_I(inode);
7057 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7058 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7059 struct ocfs2_alloc_context *data_ac = NULL;
7060 struct page **pages = NULL;
7061 loff_t end = osb->s_clustersize;
7062 struct ocfs2_extent_tree et;
7063 int did_quota = 0;
7064
7065 has_data = i_size_read(inode) ? 1 : 0;
7066
7067 if (has_data) {
7068 pages = kcalloc(ocfs2_pages_per_cluster(osb->sb),
7069 sizeof(struct page *), GFP_NOFS);
7070 if (pages == NULL) {
7071 ret = -ENOMEM;
7072 mlog_errno(ret);
7073 return ret;
7074 }
7075
7076 ret = ocfs2_reserve_clusters(osb, 1, &data_ac);
7077 if (ret) {
7078 mlog_errno(ret);
7079 goto free_pages;
7080 }
7081 }
7082
7083 handle = ocfs2_start_trans(osb,
7084 ocfs2_inline_to_extents_credits(osb->sb));
7085 if (IS_ERR(handle)) {
7086 ret = PTR_ERR(handle);
7087 mlog_errno(ret);
7088 goto out;
7089 }
7090
7091 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
7092 OCFS2_JOURNAL_ACCESS_WRITE);
7093 if (ret) {
7094 mlog_errno(ret);
7095 goto out_commit;
7096 }
7097
7098 if (has_data) {
7099 unsigned int page_end;
7100 u64 phys;
7101
7102 ret = dquot_alloc_space_nodirty(inode,
7103 ocfs2_clusters_to_bytes(osb->sb, 1));
7104 if (ret)
7105 goto out_commit;
7106 did_quota = 1;
7107
7108 data_ac->ac_resv = &oi->ip_la_data_resv;
7109
7110 ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off,
7111 &num);
7112 if (ret) {
7113 mlog_errno(ret);
7114 goto out_commit;
7115 }
7116
7117 /*
7118 * Save two copies, one for insert, and one that can
7119 * be changed by ocfs2_map_and_dirty_page() below.
7120 */
7121 block = phys = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
7122
7123 /*
7124 * Non sparse file systems zero on extend, so no need
7125 * to do that now.
7126 */
7127 if (!ocfs2_sparse_alloc(osb) &&
7128 PAGE_SIZE < osb->s_clustersize)
7129 end = PAGE_SIZE;
7130
7131 ret = ocfs2_grab_eof_pages(inode, 0, end, pages, &num_pages);
7132 if (ret) {
7133 mlog_errno(ret);
7134 need_free = 1;
7135 goto out_commit;
7136 }
7137
7138 /*
7139 * This should populate the 1st page for us and mark
7140 * it up to date.
7141 */
7142 ret = ocfs2_read_inline_data(inode, pages[0], di_bh);
7143 if (ret) {
7144 mlog_errno(ret);
7145 need_free = 1;
7146 goto out_unlock;
7147 }
7148
7149 page_end = PAGE_SIZE;
7150 if (PAGE_SIZE > osb->s_clustersize)
7151 page_end = osb->s_clustersize;
7152
7153 for (i = 0; i < num_pages; i++)
7154 ocfs2_map_and_dirty_page(inode, handle, 0, page_end,
7155 pages[i], i > 0, &phys);
7156 }
7157
7158 spin_lock(&oi->ip_lock);
7159 oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL;
7160 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
7161 spin_unlock(&oi->ip_lock);
7162
7163 ocfs2_update_inode_fsync_trans(handle, inode, 1);
7164 ocfs2_dinode_new_extent_list(inode, di);
7165
7166 ocfs2_journal_dirty(handle, di_bh);
7167
7168 if (has_data) {
7169 /*
7170 * An error at this point should be extremely rare. If
7171 * this proves to be false, we could always re-build
7172 * the in-inode data from our pages.
7173 */
7174 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
7175 ret = ocfs2_insert_extent(handle, &et, 0, block, 1, 0, NULL);
7176 if (ret) {
7177 mlog_errno(ret);
7178 need_free = 1;
7179 goto out_unlock;
7180 }
7181
7182 inode->i_blocks = ocfs2_inode_sector_count(inode);
7183 }
7184
7185out_unlock:
7186 if (pages)
7187 ocfs2_unlock_and_free_pages(pages, num_pages);
7188
7189out_commit:
7190 if (ret < 0 && did_quota)
7191 dquot_free_space_nodirty(inode,
7192 ocfs2_clusters_to_bytes(osb->sb, 1));
7193
7194 if (need_free) {
7195 if (data_ac->ac_which == OCFS2_AC_USE_LOCAL)
7196 ocfs2_free_local_alloc_bits(osb, handle, data_ac,
7197 bit_off, num);
7198 else
7199 ocfs2_free_clusters(handle,
7200 data_ac->ac_inode,
7201 data_ac->ac_bh,
7202 ocfs2_clusters_to_blocks(osb->sb, bit_off),
7203 num);
7204 }
7205
7206 ocfs2_commit_trans(osb, handle);
7207
7208out:
7209 if (data_ac)
7210 ocfs2_free_alloc_context(data_ac);
7211free_pages:
7212 kfree(pages);
7213 return ret;
7214}
7215
7216/*
7217 * It is expected, that by the time you call this function,
7218 * inode->i_size and fe->i_size have been adjusted.
7219 *
7220 * WARNING: This will kfree the truncate context
7221 */
7222int ocfs2_commit_truncate(struct ocfs2_super *osb,
7223 struct inode *inode,
7224 struct buffer_head *di_bh)
7225{
7226 int status = 0, i, flags = 0;
7227 u32 new_highest_cpos, range, trunc_cpos, trunc_len, phys_cpos, coff;
7228 u64 blkno = 0;
7229 struct ocfs2_extent_list *el;
7230 struct ocfs2_extent_rec *rec;
7231 struct ocfs2_path *path = NULL;
7232 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7233 struct ocfs2_extent_list *root_el = &(di->id2.i_list);
7234 u64 refcount_loc = le64_to_cpu(di->i_refcount_loc);
7235 struct ocfs2_extent_tree et;
7236 struct ocfs2_cached_dealloc_ctxt dealloc;
7237 struct ocfs2_refcount_tree *ref_tree = NULL;
7238
7239 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
7240 ocfs2_init_dealloc_ctxt(&dealloc);
7241
7242 new_highest_cpos = ocfs2_clusters_for_bytes(osb->sb,
7243 i_size_read(inode));
7244
7245 path = ocfs2_new_path(di_bh, &di->id2.i_list,
7246 ocfs2_journal_access_di);
7247 if (!path) {
7248 status = -ENOMEM;
7249 mlog_errno(status);
7250 goto bail;
7251 }
7252
7253 ocfs2_extent_map_trunc(inode, new_highest_cpos);
7254
7255start:
7256 /*
7257 * Check that we still have allocation to delete.
7258 */
7259 if (OCFS2_I(inode)->ip_clusters == 0) {
7260 status = 0;
7261 goto bail;
7262 }
7263
7264 /*
7265 * Truncate always works against the rightmost tree branch.
7266 */
7267 status = ocfs2_find_path(INODE_CACHE(inode), path, UINT_MAX);
7268 if (status) {
7269 mlog_errno(status);
7270 goto bail;
7271 }
7272
7273 trace_ocfs2_commit_truncate(
7274 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7275 new_highest_cpos,
7276 OCFS2_I(inode)->ip_clusters,
7277 path->p_tree_depth);
7278
7279 /*
7280 * By now, el will point to the extent list on the bottom most
7281 * portion of this tree. Only the tail record is considered in
7282 * each pass.
7283 *
7284 * We handle the following cases, in order:
7285 * - empty extent: delete the remaining branch
7286 * - remove the entire record
7287 * - remove a partial record
7288 * - no record needs to be removed (truncate has completed)
7289 */
7290 el = path_leaf_el(path);
7291 if (le16_to_cpu(el->l_next_free_rec) == 0) {
7292 ocfs2_error(inode->i_sb,
7293 "Inode %llu has empty extent block at %llu\n",
7294 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7295 (unsigned long long)path_leaf_bh(path)->b_blocknr);
7296 status = -EROFS;
7297 goto bail;
7298 }
7299
7300 i = le16_to_cpu(el->l_next_free_rec) - 1;
7301 rec = &el->l_recs[i];
7302 flags = rec->e_flags;
7303 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
7304
7305 if (i == 0 && ocfs2_is_empty_extent(rec)) {
7306 /*
7307 * Lower levels depend on this never happening, but it's best
7308 * to check it up here before changing the tree.
7309 */
7310 if (root_el->l_tree_depth && rec->e_int_clusters == 0) {
7311 mlog(ML_ERROR, "Inode %lu has an empty "
7312 "extent record, depth %u\n", inode->i_ino,
7313 le16_to_cpu(root_el->l_tree_depth));
7314 status = ocfs2_remove_rightmost_empty_extent(osb,
7315 &et, path, &dealloc);
7316 if (status) {
7317 mlog_errno(status);
7318 goto bail;
7319 }
7320
7321 ocfs2_reinit_path(path, 1);
7322 goto start;
7323 } else {
7324 trunc_cpos = le32_to_cpu(rec->e_cpos);
7325 trunc_len = 0;
7326 blkno = 0;
7327 }
7328 } else if (le32_to_cpu(rec->e_cpos) >= new_highest_cpos) {
7329 /*
7330 * Truncate entire record.
7331 */
7332 trunc_cpos = le32_to_cpu(rec->e_cpos);
7333 trunc_len = ocfs2_rec_clusters(el, rec);
7334 blkno = le64_to_cpu(rec->e_blkno);
7335 } else if (range > new_highest_cpos) {
7336 /*
7337 * Partial truncate. it also should be
7338 * the last truncate we're doing.
7339 */
7340 trunc_cpos = new_highest_cpos;
7341 trunc_len = range - new_highest_cpos;
7342 coff = new_highest_cpos - le32_to_cpu(rec->e_cpos);
7343 blkno = le64_to_cpu(rec->e_blkno) +
7344 ocfs2_clusters_to_blocks(inode->i_sb, coff);
7345 } else {
7346 /*
7347 * Truncate completed, leave happily.
7348 */
7349 status = 0;
7350 goto bail;
7351 }
7352
7353 phys_cpos = ocfs2_blocks_to_clusters(inode->i_sb, blkno);
7354
7355 if ((flags & OCFS2_EXT_REFCOUNTED) && trunc_len && !ref_tree) {
7356 status = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
7357 &ref_tree, NULL);
7358 if (status) {
7359 mlog_errno(status);
7360 goto bail;
7361 }
7362 }
7363
7364 status = ocfs2_remove_btree_range(inode, &et, trunc_cpos,
7365 phys_cpos, trunc_len, flags, &dealloc,
7366 refcount_loc, true);
7367 if (status < 0) {
7368 mlog_errno(status);
7369 goto bail;
7370 }
7371
7372 ocfs2_reinit_path(path, 1);
7373
7374 /*
7375 * The check above will catch the case where we've truncated
7376 * away all allocation.
7377 */
7378 goto start;
7379
7380bail:
7381 if (ref_tree)
7382 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
7383
7384 ocfs2_schedule_truncate_log_flush(osb, 1);
7385
7386 ocfs2_run_deallocs(osb, &dealloc);
7387
7388 ocfs2_free_path(path);
7389
7390 return status;
7391}
7392
7393/*
7394 * 'start' is inclusive, 'end' is not.
7395 */
7396int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
7397 unsigned int start, unsigned int end, int trunc)
7398{
7399 int ret;
7400 unsigned int numbytes;
7401 handle_t *handle;
7402 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7403 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
7404 struct ocfs2_inline_data *idata = &di->id2.i_data;
7405
7406 if (end > i_size_read(inode))
7407 end = i_size_read(inode);
7408
7409 BUG_ON(start > end);
7410
7411 if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) ||
7412 !(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL) ||
7413 !ocfs2_supports_inline_data(osb)) {
7414 ocfs2_error(inode->i_sb,
7415 "Inline data flags for inode %llu don't agree! Disk: 0x%x, Memory: 0x%x, Superblock: 0x%x\n",
7416 (unsigned long long)OCFS2_I(inode)->ip_blkno,
7417 le16_to_cpu(di->i_dyn_features),
7418 OCFS2_I(inode)->ip_dyn_features,
7419 osb->s_feature_incompat);
7420 ret = -EROFS;
7421 goto out;
7422 }
7423
7424 handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
7425 if (IS_ERR(handle)) {
7426 ret = PTR_ERR(handle);
7427 mlog_errno(ret);
7428 goto out;
7429 }
7430
7431 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
7432 OCFS2_JOURNAL_ACCESS_WRITE);
7433 if (ret) {
7434 mlog_errno(ret);
7435 goto out_commit;
7436 }
7437
7438 numbytes = end - start;
7439 memset(idata->id_data + start, 0, numbytes);
7440
7441 /*
7442 * No need to worry about the data page here - it's been
7443 * truncated already and inline data doesn't need it for
7444 * pushing zero's to disk, so we'll let readpage pick it up
7445 * later.
7446 */
7447 if (trunc) {
7448 i_size_write(inode, start);
7449 di->i_size = cpu_to_le64(start);
7450 }
7451
7452 inode->i_blocks = ocfs2_inode_sector_count(inode);
7453 inode->i_ctime = inode->i_mtime = current_time(inode);
7454
7455 di->i_ctime = di->i_mtime = cpu_to_le64(inode->i_ctime.tv_sec);
7456 di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
7457
7458 ocfs2_update_inode_fsync_trans(handle, inode, 1);
7459 ocfs2_journal_dirty(handle, di_bh);
7460
7461out_commit:
7462 ocfs2_commit_trans(osb, handle);
7463
7464out:
7465 return ret;
7466}
7467
7468static int ocfs2_trim_extent(struct super_block *sb,
7469 struct ocfs2_group_desc *gd,
7470 u64 group, u32 start, u32 count)
7471{
7472 u64 discard, bcount;
7473 struct ocfs2_super *osb = OCFS2_SB(sb);
7474
7475 bcount = ocfs2_clusters_to_blocks(sb, count);
7476 discard = ocfs2_clusters_to_blocks(sb, start);
7477
7478 /*
7479 * For the first cluster group, the gd->bg_blkno is not at the start
7480 * of the group, but at an offset from the start. If we add it while
7481 * calculating discard for first group, we will wrongly start fstrim a
7482 * few blocks after the desried start block and the range can cross
7483 * over into the next cluster group. So, add it only if this is not
7484 * the first cluster group.
7485 */
7486 if (group != osb->first_cluster_group_blkno)
7487 discard += le64_to_cpu(gd->bg_blkno);
7488
7489 trace_ocfs2_trim_extent(sb, (unsigned long long)discard, bcount);
7490
7491 return sb_issue_discard(sb, discard, bcount, GFP_NOFS, 0);
7492}
7493
7494static int ocfs2_trim_group(struct super_block *sb,
7495 struct ocfs2_group_desc *gd, u64 group,
7496 u32 start, u32 max, u32 minbits)
7497{
7498 int ret = 0, count = 0, next;
7499 void *bitmap = gd->bg_bitmap;
7500
7501 if (le16_to_cpu(gd->bg_free_bits_count) < minbits)
7502 return 0;
7503
7504 trace_ocfs2_trim_group((unsigned long long)le64_to_cpu(gd->bg_blkno),
7505 start, max, minbits);
7506
7507 while (start < max) {
7508 start = ocfs2_find_next_zero_bit(bitmap, max, start);
7509 if (start >= max)
7510 break;
7511 next = ocfs2_find_next_bit(bitmap, max, start);
7512
7513 if ((next - start) >= minbits) {
7514 ret = ocfs2_trim_extent(sb, gd, group,
7515 start, next - start);
7516 if (ret < 0) {
7517 mlog_errno(ret);
7518 break;
7519 }
7520 count += next - start;
7521 }
7522 start = next + 1;
7523
7524 if (fatal_signal_pending(current)) {
7525 count = -ERESTARTSYS;
7526 break;
7527 }
7528
7529 if ((le16_to_cpu(gd->bg_free_bits_count) - count) < minbits)
7530 break;
7531 }
7532
7533 if (ret < 0)
7534 count = ret;
7535
7536 return count;
7537}
7538
7539static
7540int ocfs2_trim_mainbm(struct super_block *sb, struct fstrim_range *range)
7541{
7542 struct ocfs2_super *osb = OCFS2_SB(sb);
7543 u64 start, len, trimmed = 0, first_group, last_group = 0, group = 0;
7544 int ret, cnt;
7545 u32 first_bit, last_bit, minlen;
7546 struct buffer_head *main_bm_bh = NULL;
7547 struct inode *main_bm_inode = NULL;
7548 struct buffer_head *gd_bh = NULL;
7549 struct ocfs2_dinode *main_bm;
7550 struct ocfs2_group_desc *gd = NULL;
7551
7552 start = range->start >> osb->s_clustersize_bits;
7553 len = range->len >> osb->s_clustersize_bits;
7554 minlen = range->minlen >> osb->s_clustersize_bits;
7555
7556 if (minlen >= osb->bitmap_cpg || range->len < sb->s_blocksize)
7557 return -EINVAL;
7558
7559 trace_ocfs2_trim_mainbm(start, len, minlen);
7560
7561next_group:
7562 main_bm_inode = ocfs2_get_system_file_inode(osb,
7563 GLOBAL_BITMAP_SYSTEM_INODE,
7564 OCFS2_INVALID_SLOT);
7565 if (!main_bm_inode) {
7566 ret = -EIO;
7567 mlog_errno(ret);
7568 goto out;
7569 }
7570
7571 inode_lock(main_bm_inode);
7572
7573 ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 0);
7574 if (ret < 0) {
7575 mlog_errno(ret);
7576 goto out_mutex;
7577 }
7578 main_bm = (struct ocfs2_dinode *)main_bm_bh->b_data;
7579
7580 /*
7581 * Do some check before trim the first group.
7582 */
7583 if (!group) {
7584 if (start >= le32_to_cpu(main_bm->i_clusters)) {
7585 ret = -EINVAL;
7586 goto out_unlock;
7587 }
7588
7589 if (start + len > le32_to_cpu(main_bm->i_clusters))
7590 len = le32_to_cpu(main_bm->i_clusters) - start;
7591
7592 /*
7593 * Determine first and last group to examine based on
7594 * start and len
7595 */
7596 first_group = ocfs2_which_cluster_group(main_bm_inode, start);
7597 if (first_group == osb->first_cluster_group_blkno)
7598 first_bit = start;
7599 else
7600 first_bit = start - ocfs2_blocks_to_clusters(sb,
7601 first_group);
7602 last_group = ocfs2_which_cluster_group(main_bm_inode,
7603 start + len - 1);
7604 group = first_group;
7605 }
7606
7607 do {
7608 if (first_bit + len >= osb->bitmap_cpg)
7609 last_bit = osb->bitmap_cpg;
7610 else
7611 last_bit = first_bit + len;
7612
7613 ret = ocfs2_read_group_descriptor(main_bm_inode,
7614 main_bm, group,
7615 &gd_bh);
7616 if (ret < 0) {
7617 mlog_errno(ret);
7618 break;
7619 }
7620
7621 gd = (struct ocfs2_group_desc *)gd_bh->b_data;
7622 cnt = ocfs2_trim_group(sb, gd, group,
7623 first_bit, last_bit, minlen);
7624 brelse(gd_bh);
7625 gd_bh = NULL;
7626 if (cnt < 0) {
7627 ret = cnt;
7628 mlog_errno(ret);
7629 break;
7630 }
7631
7632 trimmed += cnt;
7633 len -= osb->bitmap_cpg - first_bit;
7634 first_bit = 0;
7635 if (group == osb->first_cluster_group_blkno)
7636 group = ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg);
7637 else
7638 group += ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg);
7639 } while (0);
7640
7641out_unlock:
7642 ocfs2_inode_unlock(main_bm_inode, 0);
7643 brelse(main_bm_bh);
7644 main_bm_bh = NULL;
7645out_mutex:
7646 inode_unlock(main_bm_inode);
7647 iput(main_bm_inode);
7648
7649 /*
7650 * If all the groups trim are not done or failed, but we should release
7651 * main_bm related locks for avoiding the current IO starve, then go to
7652 * trim the next group
7653 */
7654 if (ret >= 0 && group <= last_group)
7655 goto next_group;
7656out:
7657 range->len = trimmed * sb->s_blocksize;
7658 return ret;
7659}
7660
7661int ocfs2_trim_fs(struct super_block *sb, struct fstrim_range *range)
7662{
7663 int ret;
7664 struct ocfs2_super *osb = OCFS2_SB(sb);
7665 struct ocfs2_trim_fs_info info, *pinfo = NULL;
7666
7667 ocfs2_trim_fs_lock_res_init(osb);
7668
7669 trace_ocfs2_trim_fs(range->start, range->len, range->minlen);
7670
7671 ret = ocfs2_trim_fs_lock(osb, NULL, 1);
7672 if (ret < 0) {
7673 if (ret != -EAGAIN) {
7674 mlog_errno(ret);
7675 ocfs2_trim_fs_lock_res_uninit(osb);
7676 return ret;
7677 }
7678
7679 mlog(ML_NOTICE, "Wait for trim on device (%s) to "
7680 "finish, which is running from another node.\n",
7681 osb->dev_str);
7682 ret = ocfs2_trim_fs_lock(osb, &info, 0);
7683 if (ret < 0) {
7684 mlog_errno(ret);
7685 ocfs2_trim_fs_lock_res_uninit(osb);
7686 return ret;
7687 }
7688
7689 if (info.tf_valid && info.tf_success &&
7690 info.tf_start == range->start &&
7691 info.tf_len == range->len &&
7692 info.tf_minlen == range->minlen) {
7693 /* Avoid sending duplicated trim to a shared device */
7694 mlog(ML_NOTICE, "The same trim on device (%s) was "
7695 "just done from node (%u), return.\n",
7696 osb->dev_str, info.tf_nodenum);
7697 range->len = info.tf_trimlen;
7698 goto out;
7699 }
7700 }
7701
7702 info.tf_nodenum = osb->node_num;
7703 info.tf_start = range->start;
7704 info.tf_len = range->len;
7705 info.tf_minlen = range->minlen;
7706
7707 ret = ocfs2_trim_mainbm(sb, range);
7708
7709 info.tf_trimlen = range->len;
7710 info.tf_success = (ret < 0 ? 0 : 1);
7711 pinfo = &info;
7712out:
7713 ocfs2_trim_fs_unlock(osb, pinfo);
7714 ocfs2_trim_fs_lock_res_uninit(osb);
7715 return ret;
7716}