Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
4 * Copyright (c) 2012 Red Hat, Inc.
5 * All Rights Reserved.
6 */
7#include "xfs.h"
8#include "xfs_fs.h"
9#include "xfs_shared.h"
10#include "xfs_format.h"
11#include "xfs_log_format.h"
12#include "xfs_trans_resv.h"
13#include "xfs_bit.h"
14#include "xfs_mount.h"
15#include "xfs_defer.h"
16#include "xfs_inode.h"
17#include "xfs_btree.h"
18#include "xfs_trans.h"
19#include "xfs_alloc.h"
20#include "xfs_bmap.h"
21#include "xfs_bmap_util.h"
22#include "xfs_bmap_btree.h"
23#include "xfs_rtalloc.h"
24#include "xfs_error.h"
25#include "xfs_quota.h"
26#include "xfs_trans_space.h"
27#include "xfs_trace.h"
28#include "xfs_icache.h"
29#include "xfs_iomap.h"
30#include "xfs_reflink.h"
31
32/* Kernel only BMAP related definitions and functions */
33
34/*
35 * Convert the given file system block to a disk block. We have to treat it
36 * differently based on whether the file is a real time file or not, because the
37 * bmap code does.
38 */
39xfs_daddr_t
40xfs_fsb_to_db(struct xfs_inode *ip, xfs_fsblock_t fsb)
41{
42 if (XFS_IS_REALTIME_INODE(ip))
43 return XFS_FSB_TO_BB(ip->i_mount, fsb);
44 return XFS_FSB_TO_DADDR(ip->i_mount, fsb);
45}
46
47/*
48 * Routine to zero an extent on disk allocated to the specific inode.
49 *
50 * The VFS functions take a linearised filesystem block offset, so we have to
51 * convert the sparse xfs fsb to the right format first.
52 * VFS types are real funky, too.
53 */
54int
55xfs_zero_extent(
56 struct xfs_inode *ip,
57 xfs_fsblock_t start_fsb,
58 xfs_off_t count_fsb)
59{
60 struct xfs_mount *mp = ip->i_mount;
61 struct xfs_buftarg *target = xfs_inode_buftarg(ip);
62 xfs_daddr_t sector = xfs_fsb_to_db(ip, start_fsb);
63 sector_t block = XFS_BB_TO_FSBT(mp, sector);
64
65 return blkdev_issue_zeroout(target->bt_bdev,
66 block << (mp->m_super->s_blocksize_bits - 9),
67 count_fsb << (mp->m_super->s_blocksize_bits - 9),
68 GFP_NOFS, 0);
69}
70
71#ifdef CONFIG_XFS_RT
72int
73xfs_bmap_rtalloc(
74 struct xfs_bmalloca *ap)
75{
76 struct xfs_mount *mp = ap->ip->i_mount;
77 xfs_fileoff_t orig_offset = ap->offset;
78 xfs_rtblock_t rtb;
79 xfs_extlen_t prod = 0; /* product factor for allocators */
80 xfs_extlen_t mod = 0; /* product factor for allocators */
81 xfs_extlen_t ralen = 0; /* realtime allocation length */
82 xfs_extlen_t align; /* minimum allocation alignment */
83 xfs_extlen_t orig_length = ap->length;
84 xfs_extlen_t minlen = mp->m_sb.sb_rextsize;
85 xfs_extlen_t raminlen;
86 bool rtlocked = false;
87 bool ignore_locality = false;
88 int error;
89
90 align = xfs_get_extsz_hint(ap->ip);
91retry:
92 prod = align / mp->m_sb.sb_rextsize;
93 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
94 align, 1, ap->eof, 0,
95 ap->conv, &ap->offset, &ap->length);
96 if (error)
97 return error;
98 ASSERT(ap->length);
99 ASSERT(ap->length % mp->m_sb.sb_rextsize == 0);
100
101 /*
102 * If we shifted the file offset downward to satisfy an extent size
103 * hint, increase minlen by that amount so that the allocator won't
104 * give us an allocation that's too short to cover at least one of the
105 * blocks that the caller asked for.
106 */
107 if (ap->offset != orig_offset)
108 minlen += orig_offset - ap->offset;
109
110 /*
111 * If the offset & length are not perfectly aligned
112 * then kill prod, it will just get us in trouble.
113 */
114 div_u64_rem(ap->offset, align, &mod);
115 if (mod || ap->length % align)
116 prod = 1;
117 /*
118 * Set ralen to be the actual requested length in rtextents.
119 */
120 ralen = ap->length / mp->m_sb.sb_rextsize;
121 /*
122 * If the old value was close enough to XFS_BMBT_MAX_EXTLEN that
123 * we rounded up to it, cut it back so it's valid again.
124 * Note that if it's a really large request (bigger than
125 * XFS_BMBT_MAX_EXTLEN), we don't hear about that number, and can't
126 * adjust the starting point to match it.
127 */
128 if (ralen * mp->m_sb.sb_rextsize >= XFS_MAX_BMBT_EXTLEN)
129 ralen = XFS_MAX_BMBT_EXTLEN / mp->m_sb.sb_rextsize;
130
131 /*
132 * Lock out modifications to both the RT bitmap and summary inodes
133 */
134 if (!rtlocked) {
135 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL|XFS_ILOCK_RTBITMAP);
136 xfs_trans_ijoin(ap->tp, mp->m_rbmip, XFS_ILOCK_EXCL);
137 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL|XFS_ILOCK_RTSUM);
138 xfs_trans_ijoin(ap->tp, mp->m_rsumip, XFS_ILOCK_EXCL);
139 rtlocked = true;
140 }
141
142 /*
143 * If it's an allocation to an empty file at offset 0,
144 * pick an extent that will space things out in the rt area.
145 */
146 if (ap->eof && ap->offset == 0) {
147 xfs_rtblock_t rtx; /* realtime extent no */
148
149 error = xfs_rtpick_extent(mp, ap->tp, ralen, &rtx);
150 if (error)
151 return error;
152 ap->blkno = rtx * mp->m_sb.sb_rextsize;
153 } else {
154 ap->blkno = 0;
155 }
156
157 xfs_bmap_adjacent(ap);
158
159 /*
160 * Realtime allocation, done through xfs_rtallocate_extent.
161 */
162 if (ignore_locality)
163 ap->blkno = 0;
164 else
165 do_div(ap->blkno, mp->m_sb.sb_rextsize);
166 rtb = ap->blkno;
167 ap->length = ralen;
168 raminlen = max_t(xfs_extlen_t, 1, minlen / mp->m_sb.sb_rextsize);
169 error = xfs_rtallocate_extent(ap->tp, ap->blkno, raminlen, ap->length,
170 &ralen, ap->wasdel, prod, &rtb);
171 if (error)
172 return error;
173
174 if (rtb != NULLRTBLOCK) {
175 ap->blkno = rtb * mp->m_sb.sb_rextsize;
176 ap->length = ralen * mp->m_sb.sb_rextsize;
177 ap->ip->i_nblocks += ap->length;
178 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
179 if (ap->wasdel)
180 ap->ip->i_delayed_blks -= ap->length;
181 /*
182 * Adjust the disk quota also. This was reserved
183 * earlier.
184 */
185 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
186 ap->wasdel ? XFS_TRANS_DQ_DELRTBCOUNT :
187 XFS_TRANS_DQ_RTBCOUNT, ap->length);
188 return 0;
189 }
190
191 if (align > mp->m_sb.sb_rextsize) {
192 /*
193 * We previously enlarged the request length to try to satisfy
194 * an extent size hint. The allocator didn't return anything,
195 * so reset the parameters to the original values and try again
196 * without alignment criteria.
197 */
198 ap->offset = orig_offset;
199 ap->length = orig_length;
200 minlen = align = mp->m_sb.sb_rextsize;
201 goto retry;
202 }
203
204 if (!ignore_locality && ap->blkno != 0) {
205 /*
206 * If we can't allocate near a specific rt extent, try again
207 * without locality criteria.
208 */
209 ignore_locality = true;
210 goto retry;
211 }
212
213 ap->blkno = NULLFSBLOCK;
214 ap->length = 0;
215 return 0;
216}
217#endif /* CONFIG_XFS_RT */
218
219/*
220 * Extent tree block counting routines.
221 */
222
223/*
224 * Count leaf blocks given a range of extent records. Delayed allocation
225 * extents are not counted towards the totals.
226 */
227xfs_extnum_t
228xfs_bmap_count_leaves(
229 struct xfs_ifork *ifp,
230 xfs_filblks_t *count)
231{
232 struct xfs_iext_cursor icur;
233 struct xfs_bmbt_irec got;
234 xfs_extnum_t numrecs = 0;
235
236 for_each_xfs_iext(ifp, &icur, &got) {
237 if (!isnullstartblock(got.br_startblock)) {
238 *count += got.br_blockcount;
239 numrecs++;
240 }
241 }
242
243 return numrecs;
244}
245
246/*
247 * Count fsblocks of the given fork. Delayed allocation extents are
248 * not counted towards the totals.
249 */
250int
251xfs_bmap_count_blocks(
252 struct xfs_trans *tp,
253 struct xfs_inode *ip,
254 int whichfork,
255 xfs_extnum_t *nextents,
256 xfs_filblks_t *count)
257{
258 struct xfs_mount *mp = ip->i_mount;
259 struct xfs_ifork *ifp = xfs_ifork_ptr(ip, whichfork);
260 struct xfs_btree_cur *cur;
261 xfs_extlen_t btblocks = 0;
262 int error;
263
264 *nextents = 0;
265 *count = 0;
266
267 if (!ifp)
268 return 0;
269
270 switch (ifp->if_format) {
271 case XFS_DINODE_FMT_BTREE:
272 error = xfs_iread_extents(tp, ip, whichfork);
273 if (error)
274 return error;
275
276 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
277 error = xfs_btree_count_blocks(cur, &btblocks);
278 xfs_btree_del_cursor(cur, error);
279 if (error)
280 return error;
281
282 /*
283 * xfs_btree_count_blocks includes the root block contained in
284 * the inode fork in @btblocks, so subtract one because we're
285 * only interested in allocated disk blocks.
286 */
287 *count += btblocks - 1;
288
289 fallthrough;
290 case XFS_DINODE_FMT_EXTENTS:
291 *nextents = xfs_bmap_count_leaves(ifp, count);
292 break;
293 }
294
295 return 0;
296}
297
298static int
299xfs_getbmap_report_one(
300 struct xfs_inode *ip,
301 struct getbmapx *bmv,
302 struct kgetbmap *out,
303 int64_t bmv_end,
304 struct xfs_bmbt_irec *got)
305{
306 struct kgetbmap *p = out + bmv->bmv_entries;
307 bool shared = false;
308 int error;
309
310 error = xfs_reflink_trim_around_shared(ip, got, &shared);
311 if (error)
312 return error;
313
314 if (isnullstartblock(got->br_startblock) ||
315 got->br_startblock == DELAYSTARTBLOCK) {
316 /*
317 * Delalloc extents that start beyond EOF can occur due to
318 * speculative EOF allocation when the delalloc extent is larger
319 * than the largest freespace extent at conversion time. These
320 * extents cannot be converted by data writeback, so can exist
321 * here even if we are not supposed to be finding delalloc
322 * extents.
323 */
324 if (got->br_startoff < XFS_B_TO_FSB(ip->i_mount, XFS_ISIZE(ip)))
325 ASSERT((bmv->bmv_iflags & BMV_IF_DELALLOC) != 0);
326
327 p->bmv_oflags |= BMV_OF_DELALLOC;
328 p->bmv_block = -2;
329 } else {
330 p->bmv_block = xfs_fsb_to_db(ip, got->br_startblock);
331 }
332
333 if (got->br_state == XFS_EXT_UNWRITTEN &&
334 (bmv->bmv_iflags & BMV_IF_PREALLOC))
335 p->bmv_oflags |= BMV_OF_PREALLOC;
336
337 if (shared)
338 p->bmv_oflags |= BMV_OF_SHARED;
339
340 p->bmv_offset = XFS_FSB_TO_BB(ip->i_mount, got->br_startoff);
341 p->bmv_length = XFS_FSB_TO_BB(ip->i_mount, got->br_blockcount);
342
343 bmv->bmv_offset = p->bmv_offset + p->bmv_length;
344 bmv->bmv_length = max(0LL, bmv_end - bmv->bmv_offset);
345 bmv->bmv_entries++;
346 return 0;
347}
348
349static void
350xfs_getbmap_report_hole(
351 struct xfs_inode *ip,
352 struct getbmapx *bmv,
353 struct kgetbmap *out,
354 int64_t bmv_end,
355 xfs_fileoff_t bno,
356 xfs_fileoff_t end)
357{
358 struct kgetbmap *p = out + bmv->bmv_entries;
359
360 if (bmv->bmv_iflags & BMV_IF_NO_HOLES)
361 return;
362
363 p->bmv_block = -1;
364 p->bmv_offset = XFS_FSB_TO_BB(ip->i_mount, bno);
365 p->bmv_length = XFS_FSB_TO_BB(ip->i_mount, end - bno);
366
367 bmv->bmv_offset = p->bmv_offset + p->bmv_length;
368 bmv->bmv_length = max(0LL, bmv_end - bmv->bmv_offset);
369 bmv->bmv_entries++;
370}
371
372static inline bool
373xfs_getbmap_full(
374 struct getbmapx *bmv)
375{
376 return bmv->bmv_length == 0 || bmv->bmv_entries >= bmv->bmv_count - 1;
377}
378
379static bool
380xfs_getbmap_next_rec(
381 struct xfs_bmbt_irec *rec,
382 xfs_fileoff_t total_end)
383{
384 xfs_fileoff_t end = rec->br_startoff + rec->br_blockcount;
385
386 if (end == total_end)
387 return false;
388
389 rec->br_startoff += rec->br_blockcount;
390 if (!isnullstartblock(rec->br_startblock) &&
391 rec->br_startblock != DELAYSTARTBLOCK)
392 rec->br_startblock += rec->br_blockcount;
393 rec->br_blockcount = total_end - end;
394 return true;
395}
396
397/*
398 * Get inode's extents as described in bmv, and format for output.
399 * Calls formatter to fill the user's buffer until all extents
400 * are mapped, until the passed-in bmv->bmv_count slots have
401 * been filled, or until the formatter short-circuits the loop,
402 * if it is tracking filled-in extents on its own.
403 */
404int /* error code */
405xfs_getbmap(
406 struct xfs_inode *ip,
407 struct getbmapx *bmv, /* user bmap structure */
408 struct kgetbmap *out)
409{
410 struct xfs_mount *mp = ip->i_mount;
411 int iflags = bmv->bmv_iflags;
412 int whichfork, lock, error = 0;
413 int64_t bmv_end, max_len;
414 xfs_fileoff_t bno, first_bno;
415 struct xfs_ifork *ifp;
416 struct xfs_bmbt_irec got, rec;
417 xfs_filblks_t len;
418 struct xfs_iext_cursor icur;
419
420 if (bmv->bmv_iflags & ~BMV_IF_VALID)
421 return -EINVAL;
422#ifndef DEBUG
423 /* Only allow CoW fork queries if we're debugging. */
424 if (iflags & BMV_IF_COWFORK)
425 return -EINVAL;
426#endif
427 if ((iflags & BMV_IF_ATTRFORK) && (iflags & BMV_IF_COWFORK))
428 return -EINVAL;
429
430 if (bmv->bmv_length < -1)
431 return -EINVAL;
432 bmv->bmv_entries = 0;
433 if (bmv->bmv_length == 0)
434 return 0;
435
436 if (iflags & BMV_IF_ATTRFORK)
437 whichfork = XFS_ATTR_FORK;
438 else if (iflags & BMV_IF_COWFORK)
439 whichfork = XFS_COW_FORK;
440 else
441 whichfork = XFS_DATA_FORK;
442
443 xfs_ilock(ip, XFS_IOLOCK_SHARED);
444 switch (whichfork) {
445 case XFS_ATTR_FORK:
446 lock = xfs_ilock_attr_map_shared(ip);
447 if (!xfs_inode_has_attr_fork(ip))
448 goto out_unlock_ilock;
449
450 max_len = 1LL << 32;
451 break;
452 case XFS_COW_FORK:
453 lock = XFS_ILOCK_SHARED;
454 xfs_ilock(ip, lock);
455
456 /* No CoW fork? Just return */
457 if (!xfs_ifork_ptr(ip, whichfork))
458 goto out_unlock_ilock;
459
460 if (xfs_get_cowextsz_hint(ip))
461 max_len = mp->m_super->s_maxbytes;
462 else
463 max_len = XFS_ISIZE(ip);
464 break;
465 case XFS_DATA_FORK:
466 if (!(iflags & BMV_IF_DELALLOC) &&
467 (ip->i_delayed_blks || XFS_ISIZE(ip) > ip->i_disk_size)) {
468 error = filemap_write_and_wait(VFS_I(ip)->i_mapping);
469 if (error)
470 goto out_unlock_iolock;
471
472 /*
473 * Even after flushing the inode, there can still be
474 * delalloc blocks on the inode beyond EOF due to
475 * speculative preallocation. These are not removed
476 * until the release function is called or the inode
477 * is inactivated. Hence we cannot assert here that
478 * ip->i_delayed_blks == 0.
479 */
480 }
481
482 if (xfs_get_extsz_hint(ip) ||
483 (ip->i_diflags &
484 (XFS_DIFLAG_PREALLOC | XFS_DIFLAG_APPEND)))
485 max_len = mp->m_super->s_maxbytes;
486 else
487 max_len = XFS_ISIZE(ip);
488
489 lock = xfs_ilock_data_map_shared(ip);
490 break;
491 }
492
493 ifp = xfs_ifork_ptr(ip, whichfork);
494
495 switch (ifp->if_format) {
496 case XFS_DINODE_FMT_EXTENTS:
497 case XFS_DINODE_FMT_BTREE:
498 break;
499 case XFS_DINODE_FMT_LOCAL:
500 /* Local format inode forks report no extents. */
501 goto out_unlock_ilock;
502 default:
503 error = -EINVAL;
504 goto out_unlock_ilock;
505 }
506
507 if (bmv->bmv_length == -1) {
508 max_len = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, max_len));
509 bmv->bmv_length = max(0LL, max_len - bmv->bmv_offset);
510 }
511
512 bmv_end = bmv->bmv_offset + bmv->bmv_length;
513
514 first_bno = bno = XFS_BB_TO_FSBT(mp, bmv->bmv_offset);
515 len = XFS_BB_TO_FSB(mp, bmv->bmv_length);
516
517 error = xfs_iread_extents(NULL, ip, whichfork);
518 if (error)
519 goto out_unlock_ilock;
520
521 if (!xfs_iext_lookup_extent(ip, ifp, bno, &icur, &got)) {
522 /*
523 * Report a whole-file hole if the delalloc flag is set to
524 * stay compatible with the old implementation.
525 */
526 if (iflags & BMV_IF_DELALLOC)
527 xfs_getbmap_report_hole(ip, bmv, out, bmv_end, bno,
528 XFS_B_TO_FSB(mp, XFS_ISIZE(ip)));
529 goto out_unlock_ilock;
530 }
531
532 while (!xfs_getbmap_full(bmv)) {
533 xfs_trim_extent(&got, first_bno, len);
534
535 /*
536 * Report an entry for a hole if this extent doesn't directly
537 * follow the previous one.
538 */
539 if (got.br_startoff > bno) {
540 xfs_getbmap_report_hole(ip, bmv, out, bmv_end, bno,
541 got.br_startoff);
542 if (xfs_getbmap_full(bmv))
543 break;
544 }
545
546 /*
547 * In order to report shared extents accurately, we report each
548 * distinct shared / unshared part of a single bmbt record with
549 * an individual getbmapx record.
550 */
551 bno = got.br_startoff + got.br_blockcount;
552 rec = got;
553 do {
554 error = xfs_getbmap_report_one(ip, bmv, out, bmv_end,
555 &rec);
556 if (error || xfs_getbmap_full(bmv))
557 goto out_unlock_ilock;
558 } while (xfs_getbmap_next_rec(&rec, bno));
559
560 if (!xfs_iext_next_extent(ifp, &icur, &got)) {
561 xfs_fileoff_t end = XFS_B_TO_FSB(mp, XFS_ISIZE(ip));
562
563 out[bmv->bmv_entries - 1].bmv_oflags |= BMV_OF_LAST;
564
565 if (whichfork != XFS_ATTR_FORK && bno < end &&
566 !xfs_getbmap_full(bmv)) {
567 xfs_getbmap_report_hole(ip, bmv, out, bmv_end,
568 bno, end);
569 }
570 break;
571 }
572
573 if (bno >= first_bno + len)
574 break;
575 }
576
577out_unlock_ilock:
578 xfs_iunlock(ip, lock);
579out_unlock_iolock:
580 xfs_iunlock(ip, XFS_IOLOCK_SHARED);
581 return error;
582}
583
584/*
585 * Dead simple method of punching delalyed allocation blocks from a range in
586 * the inode. This will always punch out both the start and end blocks, even
587 * if the ranges only partially overlap them, so it is up to the caller to
588 * ensure that partial blocks are not passed in.
589 */
590int
591xfs_bmap_punch_delalloc_range(
592 struct xfs_inode *ip,
593 xfs_off_t start_byte,
594 xfs_off_t end_byte)
595{
596 struct xfs_mount *mp = ip->i_mount;
597 struct xfs_ifork *ifp = &ip->i_df;
598 xfs_fileoff_t start_fsb = XFS_B_TO_FSBT(mp, start_byte);
599 xfs_fileoff_t end_fsb = XFS_B_TO_FSB(mp, end_byte);
600 struct xfs_bmbt_irec got, del;
601 struct xfs_iext_cursor icur;
602 int error = 0;
603
604 ASSERT(!xfs_need_iread_extents(ifp));
605
606 xfs_ilock(ip, XFS_ILOCK_EXCL);
607 if (!xfs_iext_lookup_extent_before(ip, ifp, &end_fsb, &icur, &got))
608 goto out_unlock;
609
610 while (got.br_startoff + got.br_blockcount > start_fsb) {
611 del = got;
612 xfs_trim_extent(&del, start_fsb, end_fsb - start_fsb);
613
614 /*
615 * A delete can push the cursor forward. Step back to the
616 * previous extent on non-delalloc or extents outside the
617 * target range.
618 */
619 if (!del.br_blockcount ||
620 !isnullstartblock(del.br_startblock)) {
621 if (!xfs_iext_prev_extent(ifp, &icur, &got))
622 break;
623 continue;
624 }
625
626 error = xfs_bmap_del_extent_delay(ip, XFS_DATA_FORK, &icur,
627 &got, &del);
628 if (error || !xfs_iext_get_extent(ifp, &icur, &got))
629 break;
630 }
631
632out_unlock:
633 xfs_iunlock(ip, XFS_ILOCK_EXCL);
634 return error;
635}
636
637/*
638 * Test whether it is appropriate to check an inode for and free post EOF
639 * blocks. The 'force' parameter determines whether we should also consider
640 * regular files that are marked preallocated or append-only.
641 */
642bool
643xfs_can_free_eofblocks(
644 struct xfs_inode *ip,
645 bool force)
646{
647 struct xfs_bmbt_irec imap;
648 struct xfs_mount *mp = ip->i_mount;
649 xfs_fileoff_t end_fsb;
650 xfs_fileoff_t last_fsb;
651 int nimaps = 1;
652 int error;
653
654 /*
655 * Caller must either hold the exclusive io lock; or be inactivating
656 * the inode, which guarantees there are no other users of the inode.
657 */
658 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL) ||
659 (VFS_I(ip)->i_state & I_FREEING));
660
661 /* prealloc/delalloc exists only on regular files */
662 if (!S_ISREG(VFS_I(ip)->i_mode))
663 return false;
664
665 /*
666 * Zero sized files with no cached pages and delalloc blocks will not
667 * have speculative prealloc/delalloc blocks to remove.
668 */
669 if (VFS_I(ip)->i_size == 0 &&
670 VFS_I(ip)->i_mapping->nrpages == 0 &&
671 ip->i_delayed_blks == 0)
672 return false;
673
674 /* If we haven't read in the extent list, then don't do it now. */
675 if (xfs_need_iread_extents(&ip->i_df))
676 return false;
677
678 /*
679 * Do not free real preallocated or append-only files unless the file
680 * has delalloc blocks and we are forced to remove them.
681 */
682 if (ip->i_diflags & (XFS_DIFLAG_PREALLOC | XFS_DIFLAG_APPEND))
683 if (!force || ip->i_delayed_blks == 0)
684 return false;
685
686 /*
687 * Do not try to free post-EOF blocks if EOF is beyond the end of the
688 * range supported by the page cache, because the truncation will loop
689 * forever.
690 */
691 end_fsb = XFS_B_TO_FSB(mp, (xfs_ufsize_t)XFS_ISIZE(ip));
692 if (XFS_IS_REALTIME_INODE(ip) && mp->m_sb.sb_rextsize > 1)
693 end_fsb = roundup_64(end_fsb, mp->m_sb.sb_rextsize);
694 last_fsb = XFS_B_TO_FSB(mp, mp->m_super->s_maxbytes);
695 if (last_fsb <= end_fsb)
696 return false;
697
698 /*
699 * Look up the mapping for the first block past EOF. If we can't find
700 * it, there's nothing to free.
701 */
702 xfs_ilock(ip, XFS_ILOCK_SHARED);
703 error = xfs_bmapi_read(ip, end_fsb, last_fsb - end_fsb, &imap, &nimaps,
704 0);
705 xfs_iunlock(ip, XFS_ILOCK_SHARED);
706 if (error || nimaps == 0)
707 return false;
708
709 /*
710 * If there's a real mapping there or there are delayed allocation
711 * reservations, then we have post-EOF blocks to try to free.
712 */
713 return imap.br_startblock != HOLESTARTBLOCK || ip->i_delayed_blks;
714}
715
716/*
717 * This is called to free any blocks beyond eof. The caller must hold
718 * IOLOCK_EXCL unless we are in the inode reclaim path and have the only
719 * reference to the inode.
720 */
721int
722xfs_free_eofblocks(
723 struct xfs_inode *ip)
724{
725 struct xfs_trans *tp;
726 struct xfs_mount *mp = ip->i_mount;
727 int error;
728
729 /* Attach the dquots to the inode up front. */
730 error = xfs_qm_dqattach(ip);
731 if (error)
732 return error;
733
734 /* Wait on dio to ensure i_size has settled. */
735 inode_dio_wait(VFS_I(ip));
736
737 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_itruncate, 0, 0, 0, &tp);
738 if (error) {
739 ASSERT(xfs_is_shutdown(mp));
740 return error;
741 }
742
743 xfs_ilock(ip, XFS_ILOCK_EXCL);
744 xfs_trans_ijoin(tp, ip, 0);
745
746 /*
747 * Do not update the on-disk file size. If we update the on-disk file
748 * size and then the system crashes before the contents of the file are
749 * flushed to disk then the files may be full of holes (ie NULL files
750 * bug).
751 */
752 error = xfs_itruncate_extents_flags(&tp, ip, XFS_DATA_FORK,
753 XFS_ISIZE(ip), XFS_BMAPI_NODISCARD);
754 if (error)
755 goto err_cancel;
756
757 error = xfs_trans_commit(tp);
758 if (error)
759 goto out_unlock;
760
761 xfs_inode_clear_eofblocks_tag(ip);
762 goto out_unlock;
763
764err_cancel:
765 /*
766 * If we get an error at this point we simply don't
767 * bother truncating the file.
768 */
769 xfs_trans_cancel(tp);
770out_unlock:
771 xfs_iunlock(ip, XFS_ILOCK_EXCL);
772 return error;
773}
774
775int
776xfs_alloc_file_space(
777 struct xfs_inode *ip,
778 xfs_off_t offset,
779 xfs_off_t len)
780{
781 xfs_mount_t *mp = ip->i_mount;
782 xfs_off_t count;
783 xfs_filblks_t allocated_fsb;
784 xfs_filblks_t allocatesize_fsb;
785 xfs_extlen_t extsz, temp;
786 xfs_fileoff_t startoffset_fsb;
787 xfs_fileoff_t endoffset_fsb;
788 int nimaps;
789 int rt;
790 xfs_trans_t *tp;
791 xfs_bmbt_irec_t imaps[1], *imapp;
792 int error;
793
794 trace_xfs_alloc_file_space(ip);
795
796 if (xfs_is_shutdown(mp))
797 return -EIO;
798
799 error = xfs_qm_dqattach(ip);
800 if (error)
801 return error;
802
803 if (len <= 0)
804 return -EINVAL;
805
806 rt = XFS_IS_REALTIME_INODE(ip);
807 extsz = xfs_get_extsz_hint(ip);
808
809 count = len;
810 imapp = &imaps[0];
811 nimaps = 1;
812 startoffset_fsb = XFS_B_TO_FSBT(mp, offset);
813 endoffset_fsb = XFS_B_TO_FSB(mp, offset + count);
814 allocatesize_fsb = endoffset_fsb - startoffset_fsb;
815
816 /*
817 * Allocate file space until done or until there is an error
818 */
819 while (allocatesize_fsb && !error) {
820 xfs_fileoff_t s, e;
821 unsigned int dblocks, rblocks, resblks;
822
823 /*
824 * Determine space reservations for data/realtime.
825 */
826 if (unlikely(extsz)) {
827 s = startoffset_fsb;
828 do_div(s, extsz);
829 s *= extsz;
830 e = startoffset_fsb + allocatesize_fsb;
831 div_u64_rem(startoffset_fsb, extsz, &temp);
832 if (temp)
833 e += temp;
834 div_u64_rem(e, extsz, &temp);
835 if (temp)
836 e += extsz - temp;
837 } else {
838 s = 0;
839 e = allocatesize_fsb;
840 }
841
842 /*
843 * The transaction reservation is limited to a 32-bit block
844 * count, hence we need to limit the number of blocks we are
845 * trying to reserve to avoid an overflow. We can't allocate
846 * more than @nimaps extents, and an extent is limited on disk
847 * to XFS_BMBT_MAX_EXTLEN (21 bits), so use that to enforce the
848 * limit.
849 */
850 resblks = min_t(xfs_fileoff_t, (e - s),
851 (XFS_MAX_BMBT_EXTLEN * nimaps));
852 if (unlikely(rt)) {
853 dblocks = XFS_DIOSTRAT_SPACE_RES(mp, 0);
854 rblocks = resblks;
855 } else {
856 dblocks = XFS_DIOSTRAT_SPACE_RES(mp, resblks);
857 rblocks = 0;
858 }
859
860 error = xfs_trans_alloc_inode(ip, &M_RES(mp)->tr_write,
861 dblocks, rblocks, false, &tp);
862 if (error)
863 break;
864
865 error = xfs_iext_count_may_overflow(ip, XFS_DATA_FORK,
866 XFS_IEXT_ADD_NOSPLIT_CNT);
867 if (error == -EFBIG)
868 error = xfs_iext_count_upgrade(tp, ip,
869 XFS_IEXT_ADD_NOSPLIT_CNT);
870 if (error)
871 goto error;
872
873 error = xfs_bmapi_write(tp, ip, startoffset_fsb,
874 allocatesize_fsb, XFS_BMAPI_PREALLOC, 0, imapp,
875 &nimaps);
876 if (error)
877 goto error;
878
879 ip->i_diflags |= XFS_DIFLAG_PREALLOC;
880 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
881
882 error = xfs_trans_commit(tp);
883 xfs_iunlock(ip, XFS_ILOCK_EXCL);
884 if (error)
885 break;
886
887 allocated_fsb = imapp->br_blockcount;
888
889 if (nimaps == 0) {
890 error = -ENOSPC;
891 break;
892 }
893
894 startoffset_fsb += allocated_fsb;
895 allocatesize_fsb -= allocated_fsb;
896 }
897
898 return error;
899
900error:
901 xfs_trans_cancel(tp);
902 xfs_iunlock(ip, XFS_ILOCK_EXCL);
903 return error;
904}
905
906static int
907xfs_unmap_extent(
908 struct xfs_inode *ip,
909 xfs_fileoff_t startoffset_fsb,
910 xfs_filblks_t len_fsb,
911 int *done)
912{
913 struct xfs_mount *mp = ip->i_mount;
914 struct xfs_trans *tp;
915 uint resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0);
916 int error;
917
918 error = xfs_trans_alloc_inode(ip, &M_RES(mp)->tr_write, resblks, 0,
919 false, &tp);
920 if (error)
921 return error;
922
923 error = xfs_iext_count_may_overflow(ip, XFS_DATA_FORK,
924 XFS_IEXT_PUNCH_HOLE_CNT);
925 if (error == -EFBIG)
926 error = xfs_iext_count_upgrade(tp, ip, XFS_IEXT_PUNCH_HOLE_CNT);
927 if (error)
928 goto out_trans_cancel;
929
930 error = xfs_bunmapi(tp, ip, startoffset_fsb, len_fsb, 0, 2, done);
931 if (error)
932 goto out_trans_cancel;
933
934 error = xfs_trans_commit(tp);
935out_unlock:
936 xfs_iunlock(ip, XFS_ILOCK_EXCL);
937 return error;
938
939out_trans_cancel:
940 xfs_trans_cancel(tp);
941 goto out_unlock;
942}
943
944/* Caller must first wait for the completion of any pending DIOs if required. */
945int
946xfs_flush_unmap_range(
947 struct xfs_inode *ip,
948 xfs_off_t offset,
949 xfs_off_t len)
950{
951 struct xfs_mount *mp = ip->i_mount;
952 struct inode *inode = VFS_I(ip);
953 xfs_off_t rounding, start, end;
954 int error;
955
956 rounding = max_t(xfs_off_t, mp->m_sb.sb_blocksize, PAGE_SIZE);
957 start = round_down(offset, rounding);
958 end = round_up(offset + len, rounding) - 1;
959
960 error = filemap_write_and_wait_range(inode->i_mapping, start, end);
961 if (error)
962 return error;
963 truncate_pagecache_range(inode, start, end);
964 return 0;
965}
966
967int
968xfs_free_file_space(
969 struct xfs_inode *ip,
970 xfs_off_t offset,
971 xfs_off_t len)
972{
973 struct xfs_mount *mp = ip->i_mount;
974 xfs_fileoff_t startoffset_fsb;
975 xfs_fileoff_t endoffset_fsb;
976 int done = 0, error;
977
978 trace_xfs_free_file_space(ip);
979
980 error = xfs_qm_dqattach(ip);
981 if (error)
982 return error;
983
984 if (len <= 0) /* if nothing being freed */
985 return 0;
986
987 startoffset_fsb = XFS_B_TO_FSB(mp, offset);
988 endoffset_fsb = XFS_B_TO_FSBT(mp, offset + len);
989
990 /* We can only free complete realtime extents. */
991 if (XFS_IS_REALTIME_INODE(ip) && mp->m_sb.sb_rextsize > 1) {
992 startoffset_fsb = roundup_64(startoffset_fsb,
993 mp->m_sb.sb_rextsize);
994 endoffset_fsb = rounddown_64(endoffset_fsb,
995 mp->m_sb.sb_rextsize);
996 }
997
998 /*
999 * Need to zero the stuff we're not freeing, on disk.
1000 */
1001 if (endoffset_fsb > startoffset_fsb) {
1002 while (!done) {
1003 error = xfs_unmap_extent(ip, startoffset_fsb,
1004 endoffset_fsb - startoffset_fsb, &done);
1005 if (error)
1006 return error;
1007 }
1008 }
1009
1010 /*
1011 * Now that we've unmap all full blocks we'll have to zero out any
1012 * partial block at the beginning and/or end. xfs_zero_range is smart
1013 * enough to skip any holes, including those we just created, but we
1014 * must take care not to zero beyond EOF and enlarge i_size.
1015 */
1016 if (offset >= XFS_ISIZE(ip))
1017 return 0;
1018 if (offset + len > XFS_ISIZE(ip))
1019 len = XFS_ISIZE(ip) - offset;
1020 error = xfs_zero_range(ip, offset, len, NULL);
1021 if (error)
1022 return error;
1023
1024 /*
1025 * If we zeroed right up to EOF and EOF straddles a page boundary we
1026 * must make sure that the post-EOF area is also zeroed because the
1027 * page could be mmap'd and xfs_zero_range doesn't do that for us.
1028 * Writeback of the eof page will do this, albeit clumsily.
1029 */
1030 if (offset + len >= XFS_ISIZE(ip) && offset_in_page(offset + len) > 0) {
1031 error = filemap_write_and_wait_range(VFS_I(ip)->i_mapping,
1032 round_down(offset + len, PAGE_SIZE), LLONG_MAX);
1033 }
1034
1035 return error;
1036}
1037
1038static int
1039xfs_prepare_shift(
1040 struct xfs_inode *ip,
1041 loff_t offset)
1042{
1043 struct xfs_mount *mp = ip->i_mount;
1044 int error;
1045
1046 /*
1047 * Trim eofblocks to avoid shifting uninitialized post-eof preallocation
1048 * into the accessible region of the file.
1049 */
1050 if (xfs_can_free_eofblocks(ip, true)) {
1051 error = xfs_free_eofblocks(ip);
1052 if (error)
1053 return error;
1054 }
1055
1056 /*
1057 * Shift operations must stabilize the start block offset boundary along
1058 * with the full range of the operation. If we don't, a COW writeback
1059 * completion could race with an insert, front merge with the start
1060 * extent (after split) during the shift and corrupt the file. Start
1061 * with the block just prior to the start to stabilize the boundary.
1062 */
1063 offset = round_down(offset, mp->m_sb.sb_blocksize);
1064 if (offset)
1065 offset -= mp->m_sb.sb_blocksize;
1066
1067 /*
1068 * Writeback and invalidate cache for the remainder of the file as we're
1069 * about to shift down every extent from offset to EOF.
1070 */
1071 error = xfs_flush_unmap_range(ip, offset, XFS_ISIZE(ip));
1072 if (error)
1073 return error;
1074
1075 /*
1076 * Clean out anything hanging around in the cow fork now that
1077 * we've flushed all the dirty data out to disk to avoid having
1078 * CoW extents at the wrong offsets.
1079 */
1080 if (xfs_inode_has_cow_data(ip)) {
1081 error = xfs_reflink_cancel_cow_range(ip, offset, NULLFILEOFF,
1082 true);
1083 if (error)
1084 return error;
1085 }
1086
1087 return 0;
1088}
1089
1090/*
1091 * xfs_collapse_file_space()
1092 * This routine frees disk space and shift extent for the given file.
1093 * The first thing we do is to free data blocks in the specified range
1094 * by calling xfs_free_file_space(). It would also sync dirty data
1095 * and invalidate page cache over the region on which collapse range
1096 * is working. And Shift extent records to the left to cover a hole.
1097 * RETURNS:
1098 * 0 on success
1099 * errno on error
1100 *
1101 */
1102int
1103xfs_collapse_file_space(
1104 struct xfs_inode *ip,
1105 xfs_off_t offset,
1106 xfs_off_t len)
1107{
1108 struct xfs_mount *mp = ip->i_mount;
1109 struct xfs_trans *tp;
1110 int error;
1111 xfs_fileoff_t next_fsb = XFS_B_TO_FSB(mp, offset + len);
1112 xfs_fileoff_t shift_fsb = XFS_B_TO_FSB(mp, len);
1113 bool done = false;
1114
1115 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
1116 ASSERT(xfs_isilocked(ip, XFS_MMAPLOCK_EXCL));
1117
1118 trace_xfs_collapse_file_space(ip);
1119
1120 error = xfs_free_file_space(ip, offset, len);
1121 if (error)
1122 return error;
1123
1124 error = xfs_prepare_shift(ip, offset);
1125 if (error)
1126 return error;
1127
1128 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_write, 0, 0, 0, &tp);
1129 if (error)
1130 return error;
1131
1132 xfs_ilock(ip, XFS_ILOCK_EXCL);
1133 xfs_trans_ijoin(tp, ip, 0);
1134
1135 while (!done) {
1136 error = xfs_bmap_collapse_extents(tp, ip, &next_fsb, shift_fsb,
1137 &done);
1138 if (error)
1139 goto out_trans_cancel;
1140 if (done)
1141 break;
1142
1143 /* finish any deferred frees and roll the transaction */
1144 error = xfs_defer_finish(&tp);
1145 if (error)
1146 goto out_trans_cancel;
1147 }
1148
1149 error = xfs_trans_commit(tp);
1150 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1151 return error;
1152
1153out_trans_cancel:
1154 xfs_trans_cancel(tp);
1155 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1156 return error;
1157}
1158
1159/*
1160 * xfs_insert_file_space()
1161 * This routine create hole space by shifting extents for the given file.
1162 * The first thing we do is to sync dirty data and invalidate page cache
1163 * over the region on which insert range is working. And split an extent
1164 * to two extents at given offset by calling xfs_bmap_split_extent.
1165 * And shift all extent records which are laying between [offset,
1166 * last allocated extent] to the right to reserve hole range.
1167 * RETURNS:
1168 * 0 on success
1169 * errno on error
1170 */
1171int
1172xfs_insert_file_space(
1173 struct xfs_inode *ip,
1174 loff_t offset,
1175 loff_t len)
1176{
1177 struct xfs_mount *mp = ip->i_mount;
1178 struct xfs_trans *tp;
1179 int error;
1180 xfs_fileoff_t stop_fsb = XFS_B_TO_FSB(mp, offset);
1181 xfs_fileoff_t next_fsb = NULLFSBLOCK;
1182 xfs_fileoff_t shift_fsb = XFS_B_TO_FSB(mp, len);
1183 bool done = false;
1184
1185 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
1186 ASSERT(xfs_isilocked(ip, XFS_MMAPLOCK_EXCL));
1187
1188 trace_xfs_insert_file_space(ip);
1189
1190 error = xfs_bmap_can_insert_extents(ip, stop_fsb, shift_fsb);
1191 if (error)
1192 return error;
1193
1194 error = xfs_prepare_shift(ip, offset);
1195 if (error)
1196 return error;
1197
1198 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_write,
1199 XFS_DIOSTRAT_SPACE_RES(mp, 0), 0, 0, &tp);
1200 if (error)
1201 return error;
1202
1203 xfs_ilock(ip, XFS_ILOCK_EXCL);
1204 xfs_trans_ijoin(tp, ip, 0);
1205
1206 error = xfs_iext_count_may_overflow(ip, XFS_DATA_FORK,
1207 XFS_IEXT_PUNCH_HOLE_CNT);
1208 if (error == -EFBIG)
1209 error = xfs_iext_count_upgrade(tp, ip, XFS_IEXT_PUNCH_HOLE_CNT);
1210 if (error)
1211 goto out_trans_cancel;
1212
1213 /*
1214 * The extent shifting code works on extent granularity. So, if stop_fsb
1215 * is not the starting block of extent, we need to split the extent at
1216 * stop_fsb.
1217 */
1218 error = xfs_bmap_split_extent(tp, ip, stop_fsb);
1219 if (error)
1220 goto out_trans_cancel;
1221
1222 do {
1223 error = xfs_defer_finish(&tp);
1224 if (error)
1225 goto out_trans_cancel;
1226
1227 error = xfs_bmap_insert_extents(tp, ip, &next_fsb, shift_fsb,
1228 &done, stop_fsb);
1229 if (error)
1230 goto out_trans_cancel;
1231 } while (!done);
1232
1233 error = xfs_trans_commit(tp);
1234 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1235 return error;
1236
1237out_trans_cancel:
1238 xfs_trans_cancel(tp);
1239 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1240 return error;
1241}
1242
1243/*
1244 * We need to check that the format of the data fork in the temporary inode is
1245 * valid for the target inode before doing the swap. This is not a problem with
1246 * attr1 because of the fixed fork offset, but attr2 has a dynamically sized
1247 * data fork depending on the space the attribute fork is taking so we can get
1248 * invalid formats on the target inode.
1249 *
1250 * E.g. target has space for 7 extents in extent format, temp inode only has
1251 * space for 6. If we defragment down to 7 extents, then the tmp format is a
1252 * btree, but when swapped it needs to be in extent format. Hence we can't just
1253 * blindly swap data forks on attr2 filesystems.
1254 *
1255 * Note that we check the swap in both directions so that we don't end up with
1256 * a corrupt temporary inode, either.
1257 *
1258 * Note that fixing the way xfs_fsr sets up the attribute fork in the source
1259 * inode will prevent this situation from occurring, so all we do here is
1260 * reject and log the attempt. basically we are putting the responsibility on
1261 * userspace to get this right.
1262 */
1263static int
1264xfs_swap_extents_check_format(
1265 struct xfs_inode *ip, /* target inode */
1266 struct xfs_inode *tip) /* tmp inode */
1267{
1268 struct xfs_ifork *ifp = &ip->i_df;
1269 struct xfs_ifork *tifp = &tip->i_df;
1270
1271 /* User/group/project quota ids must match if quotas are enforced. */
1272 if (XFS_IS_QUOTA_ON(ip->i_mount) &&
1273 (!uid_eq(VFS_I(ip)->i_uid, VFS_I(tip)->i_uid) ||
1274 !gid_eq(VFS_I(ip)->i_gid, VFS_I(tip)->i_gid) ||
1275 ip->i_projid != tip->i_projid))
1276 return -EINVAL;
1277
1278 /* Should never get a local format */
1279 if (ifp->if_format == XFS_DINODE_FMT_LOCAL ||
1280 tifp->if_format == XFS_DINODE_FMT_LOCAL)
1281 return -EINVAL;
1282
1283 /*
1284 * if the target inode has less extents that then temporary inode then
1285 * why did userspace call us?
1286 */
1287 if (ifp->if_nextents < tifp->if_nextents)
1288 return -EINVAL;
1289
1290 /*
1291 * If we have to use the (expensive) rmap swap method, we can
1292 * handle any number of extents and any format.
1293 */
1294 if (xfs_has_rmapbt(ip->i_mount))
1295 return 0;
1296
1297 /*
1298 * if the target inode is in extent form and the temp inode is in btree
1299 * form then we will end up with the target inode in the wrong format
1300 * as we already know there are less extents in the temp inode.
1301 */
1302 if (ifp->if_format == XFS_DINODE_FMT_EXTENTS &&
1303 tifp->if_format == XFS_DINODE_FMT_BTREE)
1304 return -EINVAL;
1305
1306 /* Check temp in extent form to max in target */
1307 if (tifp->if_format == XFS_DINODE_FMT_EXTENTS &&
1308 tifp->if_nextents > XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK))
1309 return -EINVAL;
1310
1311 /* Check target in extent form to max in temp */
1312 if (ifp->if_format == XFS_DINODE_FMT_EXTENTS &&
1313 ifp->if_nextents > XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK))
1314 return -EINVAL;
1315
1316 /*
1317 * If we are in a btree format, check that the temp root block will fit
1318 * in the target and that it has enough extents to be in btree format
1319 * in the target.
1320 *
1321 * Note that we have to be careful to allow btree->extent conversions
1322 * (a common defrag case) which will occur when the temp inode is in
1323 * extent format...
1324 */
1325 if (tifp->if_format == XFS_DINODE_FMT_BTREE) {
1326 if (xfs_inode_has_attr_fork(ip) &&
1327 XFS_BMAP_BMDR_SPACE(tifp->if_broot) > xfs_inode_fork_boff(ip))
1328 return -EINVAL;
1329 if (tifp->if_nextents <= XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK))
1330 return -EINVAL;
1331 }
1332
1333 /* Reciprocal target->temp btree format checks */
1334 if (ifp->if_format == XFS_DINODE_FMT_BTREE) {
1335 if (xfs_inode_has_attr_fork(tip) &&
1336 XFS_BMAP_BMDR_SPACE(ip->i_df.if_broot) > xfs_inode_fork_boff(tip))
1337 return -EINVAL;
1338 if (ifp->if_nextents <= XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK))
1339 return -EINVAL;
1340 }
1341
1342 return 0;
1343}
1344
1345static int
1346xfs_swap_extent_flush(
1347 struct xfs_inode *ip)
1348{
1349 int error;
1350
1351 error = filemap_write_and_wait(VFS_I(ip)->i_mapping);
1352 if (error)
1353 return error;
1354 truncate_pagecache_range(VFS_I(ip), 0, -1);
1355
1356 /* Verify O_DIRECT for ftmp */
1357 if (VFS_I(ip)->i_mapping->nrpages)
1358 return -EINVAL;
1359 return 0;
1360}
1361
1362/*
1363 * Move extents from one file to another, when rmap is enabled.
1364 */
1365STATIC int
1366xfs_swap_extent_rmap(
1367 struct xfs_trans **tpp,
1368 struct xfs_inode *ip,
1369 struct xfs_inode *tip)
1370{
1371 struct xfs_trans *tp = *tpp;
1372 struct xfs_bmbt_irec irec;
1373 struct xfs_bmbt_irec uirec;
1374 struct xfs_bmbt_irec tirec;
1375 xfs_fileoff_t offset_fsb;
1376 xfs_fileoff_t end_fsb;
1377 xfs_filblks_t count_fsb;
1378 int error;
1379 xfs_filblks_t ilen;
1380 xfs_filblks_t rlen;
1381 int nimaps;
1382 uint64_t tip_flags2;
1383
1384 /*
1385 * If the source file has shared blocks, we must flag the donor
1386 * file as having shared blocks so that we get the shared-block
1387 * rmap functions when we go to fix up the rmaps. The flags
1388 * will be switch for reals later.
1389 */
1390 tip_flags2 = tip->i_diflags2;
1391 if (ip->i_diflags2 & XFS_DIFLAG2_REFLINK)
1392 tip->i_diflags2 |= XFS_DIFLAG2_REFLINK;
1393
1394 offset_fsb = 0;
1395 end_fsb = XFS_B_TO_FSB(ip->i_mount, i_size_read(VFS_I(ip)));
1396 count_fsb = (xfs_filblks_t)(end_fsb - offset_fsb);
1397
1398 while (count_fsb) {
1399 /* Read extent from the donor file */
1400 nimaps = 1;
1401 error = xfs_bmapi_read(tip, offset_fsb, count_fsb, &tirec,
1402 &nimaps, 0);
1403 if (error)
1404 goto out;
1405 ASSERT(nimaps == 1);
1406 ASSERT(tirec.br_startblock != DELAYSTARTBLOCK);
1407
1408 trace_xfs_swap_extent_rmap_remap(tip, &tirec);
1409 ilen = tirec.br_blockcount;
1410
1411 /* Unmap the old blocks in the source file. */
1412 while (tirec.br_blockcount) {
1413 ASSERT(tp->t_firstblock == NULLFSBLOCK);
1414 trace_xfs_swap_extent_rmap_remap_piece(tip, &tirec);
1415
1416 /* Read extent from the source file */
1417 nimaps = 1;
1418 error = xfs_bmapi_read(ip, tirec.br_startoff,
1419 tirec.br_blockcount, &irec,
1420 &nimaps, 0);
1421 if (error)
1422 goto out;
1423 ASSERT(nimaps == 1);
1424 ASSERT(tirec.br_startoff == irec.br_startoff);
1425 trace_xfs_swap_extent_rmap_remap_piece(ip, &irec);
1426
1427 /* Trim the extent. */
1428 uirec = tirec;
1429 uirec.br_blockcount = rlen = min_t(xfs_filblks_t,
1430 tirec.br_blockcount,
1431 irec.br_blockcount);
1432 trace_xfs_swap_extent_rmap_remap_piece(tip, &uirec);
1433
1434 if (xfs_bmap_is_real_extent(&uirec)) {
1435 error = xfs_iext_count_may_overflow(ip,
1436 XFS_DATA_FORK,
1437 XFS_IEXT_SWAP_RMAP_CNT);
1438 if (error == -EFBIG)
1439 error = xfs_iext_count_upgrade(tp, ip,
1440 XFS_IEXT_SWAP_RMAP_CNT);
1441 if (error)
1442 goto out;
1443 }
1444
1445 if (xfs_bmap_is_real_extent(&irec)) {
1446 error = xfs_iext_count_may_overflow(tip,
1447 XFS_DATA_FORK,
1448 XFS_IEXT_SWAP_RMAP_CNT);
1449 if (error == -EFBIG)
1450 error = xfs_iext_count_upgrade(tp, ip,
1451 XFS_IEXT_SWAP_RMAP_CNT);
1452 if (error)
1453 goto out;
1454 }
1455
1456 /* Remove the mapping from the donor file. */
1457 xfs_bmap_unmap_extent(tp, tip, &uirec);
1458
1459 /* Remove the mapping from the source file. */
1460 xfs_bmap_unmap_extent(tp, ip, &irec);
1461
1462 /* Map the donor file's blocks into the source file. */
1463 xfs_bmap_map_extent(tp, ip, &uirec);
1464
1465 /* Map the source file's blocks into the donor file. */
1466 xfs_bmap_map_extent(tp, tip, &irec);
1467
1468 error = xfs_defer_finish(tpp);
1469 tp = *tpp;
1470 if (error)
1471 goto out;
1472
1473 tirec.br_startoff += rlen;
1474 if (tirec.br_startblock != HOLESTARTBLOCK &&
1475 tirec.br_startblock != DELAYSTARTBLOCK)
1476 tirec.br_startblock += rlen;
1477 tirec.br_blockcount -= rlen;
1478 }
1479
1480 /* Roll on... */
1481 count_fsb -= ilen;
1482 offset_fsb += ilen;
1483 }
1484
1485 tip->i_diflags2 = tip_flags2;
1486 return 0;
1487
1488out:
1489 trace_xfs_swap_extent_rmap_error(ip, error, _RET_IP_);
1490 tip->i_diflags2 = tip_flags2;
1491 return error;
1492}
1493
1494/* Swap the extents of two files by swapping data forks. */
1495STATIC int
1496xfs_swap_extent_forks(
1497 struct xfs_trans *tp,
1498 struct xfs_inode *ip,
1499 struct xfs_inode *tip,
1500 int *src_log_flags,
1501 int *target_log_flags)
1502{
1503 xfs_filblks_t aforkblks = 0;
1504 xfs_filblks_t taforkblks = 0;
1505 xfs_extnum_t junk;
1506 uint64_t tmp;
1507 int error;
1508
1509 /*
1510 * Count the number of extended attribute blocks
1511 */
1512 if (xfs_inode_has_attr_fork(ip) && ip->i_af.if_nextents > 0 &&
1513 ip->i_af.if_format != XFS_DINODE_FMT_LOCAL) {
1514 error = xfs_bmap_count_blocks(tp, ip, XFS_ATTR_FORK, &junk,
1515 &aforkblks);
1516 if (error)
1517 return error;
1518 }
1519 if (xfs_inode_has_attr_fork(tip) && tip->i_af.if_nextents > 0 &&
1520 tip->i_af.if_format != XFS_DINODE_FMT_LOCAL) {
1521 error = xfs_bmap_count_blocks(tp, tip, XFS_ATTR_FORK, &junk,
1522 &taforkblks);
1523 if (error)
1524 return error;
1525 }
1526
1527 /*
1528 * Btree format (v3) inodes have the inode number stamped in the bmbt
1529 * block headers. We can't start changing the bmbt blocks until the
1530 * inode owner change is logged so recovery does the right thing in the
1531 * event of a crash. Set the owner change log flags now and leave the
1532 * bmbt scan as the last step.
1533 */
1534 if (xfs_has_v3inodes(ip->i_mount)) {
1535 if (ip->i_df.if_format == XFS_DINODE_FMT_BTREE)
1536 (*target_log_flags) |= XFS_ILOG_DOWNER;
1537 if (tip->i_df.if_format == XFS_DINODE_FMT_BTREE)
1538 (*src_log_flags) |= XFS_ILOG_DOWNER;
1539 }
1540
1541 /*
1542 * Swap the data forks of the inodes
1543 */
1544 swap(ip->i_df, tip->i_df);
1545
1546 /*
1547 * Fix the on-disk inode values
1548 */
1549 tmp = (uint64_t)ip->i_nblocks;
1550 ip->i_nblocks = tip->i_nblocks - taforkblks + aforkblks;
1551 tip->i_nblocks = tmp + taforkblks - aforkblks;
1552
1553 /*
1554 * The extents in the source inode could still contain speculative
1555 * preallocation beyond EOF (e.g. the file is open but not modified
1556 * while defrag is in progress). In that case, we need to copy over the
1557 * number of delalloc blocks the data fork in the source inode is
1558 * tracking beyond EOF so that when the fork is truncated away when the
1559 * temporary inode is unlinked we don't underrun the i_delayed_blks
1560 * counter on that inode.
1561 */
1562 ASSERT(tip->i_delayed_blks == 0);
1563 tip->i_delayed_blks = ip->i_delayed_blks;
1564 ip->i_delayed_blks = 0;
1565
1566 switch (ip->i_df.if_format) {
1567 case XFS_DINODE_FMT_EXTENTS:
1568 (*src_log_flags) |= XFS_ILOG_DEXT;
1569 break;
1570 case XFS_DINODE_FMT_BTREE:
1571 ASSERT(!xfs_has_v3inodes(ip->i_mount) ||
1572 (*src_log_flags & XFS_ILOG_DOWNER));
1573 (*src_log_flags) |= XFS_ILOG_DBROOT;
1574 break;
1575 }
1576
1577 switch (tip->i_df.if_format) {
1578 case XFS_DINODE_FMT_EXTENTS:
1579 (*target_log_flags) |= XFS_ILOG_DEXT;
1580 break;
1581 case XFS_DINODE_FMT_BTREE:
1582 (*target_log_flags) |= XFS_ILOG_DBROOT;
1583 ASSERT(!xfs_has_v3inodes(ip->i_mount) ||
1584 (*target_log_flags & XFS_ILOG_DOWNER));
1585 break;
1586 }
1587
1588 return 0;
1589}
1590
1591/*
1592 * Fix up the owners of the bmbt blocks to refer to the current inode. The
1593 * change owner scan attempts to order all modified buffers in the current
1594 * transaction. In the event of ordered buffer failure, the offending buffer is
1595 * physically logged as a fallback and the scan returns -EAGAIN. We must roll
1596 * the transaction in this case to replenish the fallback log reservation and
1597 * restart the scan. This process repeats until the scan completes.
1598 */
1599static int
1600xfs_swap_change_owner(
1601 struct xfs_trans **tpp,
1602 struct xfs_inode *ip,
1603 struct xfs_inode *tmpip)
1604{
1605 int error;
1606 struct xfs_trans *tp = *tpp;
1607
1608 do {
1609 error = xfs_bmbt_change_owner(tp, ip, XFS_DATA_FORK, ip->i_ino,
1610 NULL);
1611 /* success or fatal error */
1612 if (error != -EAGAIN)
1613 break;
1614
1615 error = xfs_trans_roll(tpp);
1616 if (error)
1617 break;
1618 tp = *tpp;
1619
1620 /*
1621 * Redirty both inodes so they can relog and keep the log tail
1622 * moving forward.
1623 */
1624 xfs_trans_ijoin(tp, ip, 0);
1625 xfs_trans_ijoin(tp, tmpip, 0);
1626 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
1627 xfs_trans_log_inode(tp, tmpip, XFS_ILOG_CORE);
1628 } while (true);
1629
1630 return error;
1631}
1632
1633int
1634xfs_swap_extents(
1635 struct xfs_inode *ip, /* target inode */
1636 struct xfs_inode *tip, /* tmp inode */
1637 struct xfs_swapext *sxp)
1638{
1639 struct xfs_mount *mp = ip->i_mount;
1640 struct xfs_trans *tp;
1641 struct xfs_bstat *sbp = &sxp->sx_stat;
1642 int src_log_flags, target_log_flags;
1643 int error = 0;
1644 uint64_t f;
1645 int resblks = 0;
1646 unsigned int flags = 0;
1647
1648 /*
1649 * Lock the inodes against other IO, page faults and truncate to
1650 * begin with. Then we can ensure the inodes are flushed and have no
1651 * page cache safely. Once we have done this we can take the ilocks and
1652 * do the rest of the checks.
1653 */
1654 lock_two_nondirectories(VFS_I(ip), VFS_I(tip));
1655 filemap_invalidate_lock_two(VFS_I(ip)->i_mapping,
1656 VFS_I(tip)->i_mapping);
1657
1658 /* Verify that both files have the same format */
1659 if ((VFS_I(ip)->i_mode & S_IFMT) != (VFS_I(tip)->i_mode & S_IFMT)) {
1660 error = -EINVAL;
1661 goto out_unlock;
1662 }
1663
1664 /* Verify both files are either real-time or non-realtime */
1665 if (XFS_IS_REALTIME_INODE(ip) != XFS_IS_REALTIME_INODE(tip)) {
1666 error = -EINVAL;
1667 goto out_unlock;
1668 }
1669
1670 error = xfs_qm_dqattach(ip);
1671 if (error)
1672 goto out_unlock;
1673
1674 error = xfs_qm_dqattach(tip);
1675 if (error)
1676 goto out_unlock;
1677
1678 error = xfs_swap_extent_flush(ip);
1679 if (error)
1680 goto out_unlock;
1681 error = xfs_swap_extent_flush(tip);
1682 if (error)
1683 goto out_unlock;
1684
1685 if (xfs_inode_has_cow_data(tip)) {
1686 error = xfs_reflink_cancel_cow_range(tip, 0, NULLFILEOFF, true);
1687 if (error)
1688 goto out_unlock;
1689 }
1690
1691 /*
1692 * Extent "swapping" with rmap requires a permanent reservation and
1693 * a block reservation because it's really just a remap operation
1694 * performed with log redo items!
1695 */
1696 if (xfs_has_rmapbt(mp)) {
1697 int w = XFS_DATA_FORK;
1698 uint32_t ipnext = ip->i_df.if_nextents;
1699 uint32_t tipnext = tip->i_df.if_nextents;
1700
1701 /*
1702 * Conceptually this shouldn't affect the shape of either bmbt,
1703 * but since we atomically move extents one by one, we reserve
1704 * enough space to rebuild both trees.
1705 */
1706 resblks = XFS_SWAP_RMAP_SPACE_RES(mp, ipnext, w);
1707 resblks += XFS_SWAP_RMAP_SPACE_RES(mp, tipnext, w);
1708
1709 /*
1710 * If either inode straddles a bmapbt block allocation boundary,
1711 * the rmapbt algorithm triggers repeated allocs and frees as
1712 * extents are remapped. This can exhaust the block reservation
1713 * prematurely and cause shutdown. Return freed blocks to the
1714 * transaction reservation to counter this behavior.
1715 */
1716 flags |= XFS_TRANS_RES_FDBLKS;
1717 }
1718 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_write, resblks, 0, flags,
1719 &tp);
1720 if (error)
1721 goto out_unlock;
1722
1723 /*
1724 * Lock and join the inodes to the tansaction so that transaction commit
1725 * or cancel will unlock the inodes from this point onwards.
1726 */
1727 xfs_lock_two_inodes(ip, XFS_ILOCK_EXCL, tip, XFS_ILOCK_EXCL);
1728 xfs_trans_ijoin(tp, ip, 0);
1729 xfs_trans_ijoin(tp, tip, 0);
1730
1731
1732 /* Verify all data are being swapped */
1733 if (sxp->sx_offset != 0 ||
1734 sxp->sx_length != ip->i_disk_size ||
1735 sxp->sx_length != tip->i_disk_size) {
1736 error = -EFAULT;
1737 goto out_trans_cancel;
1738 }
1739
1740 trace_xfs_swap_extent_before(ip, 0);
1741 trace_xfs_swap_extent_before(tip, 1);
1742
1743 /* check inode formats now that data is flushed */
1744 error = xfs_swap_extents_check_format(ip, tip);
1745 if (error) {
1746 xfs_notice(mp,
1747 "%s: inode 0x%llx format is incompatible for exchanging.",
1748 __func__, ip->i_ino);
1749 goto out_trans_cancel;
1750 }
1751
1752 /*
1753 * Compare the current change & modify times with that
1754 * passed in. If they differ, we abort this swap.
1755 * This is the mechanism used to ensure the calling
1756 * process that the file was not changed out from
1757 * under it.
1758 */
1759 if ((sbp->bs_ctime.tv_sec != VFS_I(ip)->i_ctime.tv_sec) ||
1760 (sbp->bs_ctime.tv_nsec != VFS_I(ip)->i_ctime.tv_nsec) ||
1761 (sbp->bs_mtime.tv_sec != VFS_I(ip)->i_mtime.tv_sec) ||
1762 (sbp->bs_mtime.tv_nsec != VFS_I(ip)->i_mtime.tv_nsec)) {
1763 error = -EBUSY;
1764 goto out_trans_cancel;
1765 }
1766
1767 /*
1768 * Note the trickiness in setting the log flags - we set the owner log
1769 * flag on the opposite inode (i.e. the inode we are setting the new
1770 * owner to be) because once we swap the forks and log that, log
1771 * recovery is going to see the fork as owned by the swapped inode,
1772 * not the pre-swapped inodes.
1773 */
1774 src_log_flags = XFS_ILOG_CORE;
1775 target_log_flags = XFS_ILOG_CORE;
1776
1777 if (xfs_has_rmapbt(mp))
1778 error = xfs_swap_extent_rmap(&tp, ip, tip);
1779 else
1780 error = xfs_swap_extent_forks(tp, ip, tip, &src_log_flags,
1781 &target_log_flags);
1782 if (error)
1783 goto out_trans_cancel;
1784
1785 /* Do we have to swap reflink flags? */
1786 if ((ip->i_diflags2 & XFS_DIFLAG2_REFLINK) ^
1787 (tip->i_diflags2 & XFS_DIFLAG2_REFLINK)) {
1788 f = ip->i_diflags2 & XFS_DIFLAG2_REFLINK;
1789 ip->i_diflags2 &= ~XFS_DIFLAG2_REFLINK;
1790 ip->i_diflags2 |= tip->i_diflags2 & XFS_DIFLAG2_REFLINK;
1791 tip->i_diflags2 &= ~XFS_DIFLAG2_REFLINK;
1792 tip->i_diflags2 |= f & XFS_DIFLAG2_REFLINK;
1793 }
1794
1795 /* Swap the cow forks. */
1796 if (xfs_has_reflink(mp)) {
1797 ASSERT(!ip->i_cowfp ||
1798 ip->i_cowfp->if_format == XFS_DINODE_FMT_EXTENTS);
1799 ASSERT(!tip->i_cowfp ||
1800 tip->i_cowfp->if_format == XFS_DINODE_FMT_EXTENTS);
1801
1802 swap(ip->i_cowfp, tip->i_cowfp);
1803
1804 if (ip->i_cowfp && ip->i_cowfp->if_bytes)
1805 xfs_inode_set_cowblocks_tag(ip);
1806 else
1807 xfs_inode_clear_cowblocks_tag(ip);
1808 if (tip->i_cowfp && tip->i_cowfp->if_bytes)
1809 xfs_inode_set_cowblocks_tag(tip);
1810 else
1811 xfs_inode_clear_cowblocks_tag(tip);
1812 }
1813
1814 xfs_trans_log_inode(tp, ip, src_log_flags);
1815 xfs_trans_log_inode(tp, tip, target_log_flags);
1816
1817 /*
1818 * The extent forks have been swapped, but crc=1,rmapbt=0 filesystems
1819 * have inode number owner values in the bmbt blocks that still refer to
1820 * the old inode. Scan each bmbt to fix up the owner values with the
1821 * inode number of the current inode.
1822 */
1823 if (src_log_flags & XFS_ILOG_DOWNER) {
1824 error = xfs_swap_change_owner(&tp, ip, tip);
1825 if (error)
1826 goto out_trans_cancel;
1827 }
1828 if (target_log_flags & XFS_ILOG_DOWNER) {
1829 error = xfs_swap_change_owner(&tp, tip, ip);
1830 if (error)
1831 goto out_trans_cancel;
1832 }
1833
1834 /*
1835 * If this is a synchronous mount, make sure that the
1836 * transaction goes to disk before returning to the user.
1837 */
1838 if (xfs_has_wsync(mp))
1839 xfs_trans_set_sync(tp);
1840
1841 error = xfs_trans_commit(tp);
1842
1843 trace_xfs_swap_extent_after(ip, 0);
1844 trace_xfs_swap_extent_after(tip, 1);
1845
1846out_unlock_ilock:
1847 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1848 xfs_iunlock(tip, XFS_ILOCK_EXCL);
1849out_unlock:
1850 filemap_invalidate_unlock_two(VFS_I(ip)->i_mapping,
1851 VFS_I(tip)->i_mapping);
1852 unlock_two_nondirectories(VFS_I(ip), VFS_I(tip));
1853 return error;
1854
1855out_trans_cancel:
1856 xfs_trans_cancel(tp);
1857 goto out_unlock_ilock;
1858}
1/*
2 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
3 * Copyright (c) 2012 Red Hat, Inc.
4 * All Rights Reserved.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it would be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
18 */
19#include "xfs.h"
20#include "xfs_fs.h"
21#include "xfs_shared.h"
22#include "xfs_format.h"
23#include "xfs_log_format.h"
24#include "xfs_trans_resv.h"
25#include "xfs_bit.h"
26#include "xfs_mount.h"
27#include "xfs_da_format.h"
28#include "xfs_inode.h"
29#include "xfs_btree.h"
30#include "xfs_trans.h"
31#include "xfs_extfree_item.h"
32#include "xfs_alloc.h"
33#include "xfs_bmap.h"
34#include "xfs_bmap_util.h"
35#include "xfs_bmap_btree.h"
36#include "xfs_rtalloc.h"
37#include "xfs_error.h"
38#include "xfs_quota.h"
39#include "xfs_trans_space.h"
40#include "xfs_trace.h"
41#include "xfs_icache.h"
42#include "xfs_log.h"
43
44/* Kernel only BMAP related definitions and functions */
45
46/*
47 * Convert the given file system block to a disk block. We have to treat it
48 * differently based on whether the file is a real time file or not, because the
49 * bmap code does.
50 */
51xfs_daddr_t
52xfs_fsb_to_db(struct xfs_inode *ip, xfs_fsblock_t fsb)
53{
54 return (XFS_IS_REALTIME_INODE(ip) ? \
55 (xfs_daddr_t)XFS_FSB_TO_BB((ip)->i_mount, (fsb)) : \
56 XFS_FSB_TO_DADDR((ip)->i_mount, (fsb)));
57}
58
59/*
60 * Routine to zero an extent on disk allocated to the specific inode.
61 *
62 * The VFS functions take a linearised filesystem block offset, so we have to
63 * convert the sparse xfs fsb to the right format first.
64 * VFS types are real funky, too.
65 */
66int
67xfs_zero_extent(
68 struct xfs_inode *ip,
69 xfs_fsblock_t start_fsb,
70 xfs_off_t count_fsb)
71{
72 struct xfs_mount *mp = ip->i_mount;
73 xfs_daddr_t sector = xfs_fsb_to_db(ip, start_fsb);
74 sector_t block = XFS_BB_TO_FSBT(mp, sector);
75 ssize_t size = XFS_FSB_TO_B(mp, count_fsb);
76
77 if (IS_DAX(VFS_I(ip)))
78 return dax_clear_sectors(xfs_find_bdev_for_inode(VFS_I(ip)),
79 sector, size);
80
81 /*
82 * let the block layer decide on the fastest method of
83 * implementing the zeroing.
84 */
85 return sb_issue_zeroout(mp->m_super, block, count_fsb, GFP_NOFS);
86
87}
88
89/*
90 * Routine to be called at transaction's end by xfs_bmapi, xfs_bunmapi
91 * caller. Frees all the extents that need freeing, which must be done
92 * last due to locking considerations. We never free any extents in
93 * the first transaction.
94 *
95 * If an inode *ip is provided, rejoin it to the transaction if
96 * the transaction was committed.
97 */
98int /* error */
99xfs_bmap_finish(
100 struct xfs_trans **tp, /* transaction pointer addr */
101 struct xfs_bmap_free *flist, /* i/o: list extents to free */
102 struct xfs_inode *ip)
103{
104 struct xfs_efd_log_item *efd; /* extent free data */
105 struct xfs_efi_log_item *efi; /* extent free intention */
106 int error; /* error return value */
107 int committed;/* xact committed or not */
108 struct xfs_bmap_free_item *free; /* free extent item */
109 struct xfs_bmap_free_item *next; /* next item on free list */
110
111 ASSERT((*tp)->t_flags & XFS_TRANS_PERM_LOG_RES);
112 if (flist->xbf_count == 0)
113 return 0;
114
115 efi = xfs_trans_get_efi(*tp, flist->xbf_count);
116 for (free = flist->xbf_first; free; free = free->xbfi_next)
117 xfs_trans_log_efi_extent(*tp, efi, free->xbfi_startblock,
118 free->xbfi_blockcount);
119
120 error = __xfs_trans_roll(tp, ip, &committed);
121 if (error) {
122 /*
123 * If the transaction was committed, drop the EFD reference
124 * since we're bailing out of here. The other reference is
125 * dropped when the EFI hits the AIL.
126 *
127 * If the transaction was not committed, the EFI is freed by the
128 * EFI item unlock handler on abort. Also, we have a new
129 * transaction so we should return committed=1 even though we're
130 * returning an error.
131 */
132 if (committed) {
133 xfs_efi_release(efi);
134 xfs_force_shutdown((*tp)->t_mountp,
135 (error == -EFSCORRUPTED) ?
136 SHUTDOWN_CORRUPT_INCORE :
137 SHUTDOWN_META_IO_ERROR);
138 }
139 return error;
140 }
141
142 /*
143 * Get an EFD and free each extent in the list, logging to the EFD in
144 * the process. The remaining bmap free list is cleaned up by the caller
145 * on error.
146 */
147 efd = xfs_trans_get_efd(*tp, efi, flist->xbf_count);
148 for (free = flist->xbf_first; free != NULL; free = next) {
149 next = free->xbfi_next;
150
151 error = xfs_trans_free_extent(*tp, efd, free->xbfi_startblock,
152 free->xbfi_blockcount);
153 if (error)
154 return error;
155
156 xfs_bmap_del_free(flist, NULL, free);
157 }
158
159 return 0;
160}
161
162int
163xfs_bmap_rtalloc(
164 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
165{
166 xfs_alloctype_t atype = 0; /* type for allocation routines */
167 int error; /* error return value */
168 xfs_mount_t *mp; /* mount point structure */
169 xfs_extlen_t prod = 0; /* product factor for allocators */
170 xfs_extlen_t ralen = 0; /* realtime allocation length */
171 xfs_extlen_t align; /* minimum allocation alignment */
172 xfs_rtblock_t rtb;
173
174 mp = ap->ip->i_mount;
175 align = xfs_get_extsz_hint(ap->ip);
176 prod = align / mp->m_sb.sb_rextsize;
177 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
178 align, 1, ap->eof, 0,
179 ap->conv, &ap->offset, &ap->length);
180 if (error)
181 return error;
182 ASSERT(ap->length);
183 ASSERT(ap->length % mp->m_sb.sb_rextsize == 0);
184
185 /*
186 * If the offset & length are not perfectly aligned
187 * then kill prod, it will just get us in trouble.
188 */
189 if (do_mod(ap->offset, align) || ap->length % align)
190 prod = 1;
191 /*
192 * Set ralen to be the actual requested length in rtextents.
193 */
194 ralen = ap->length / mp->m_sb.sb_rextsize;
195 /*
196 * If the old value was close enough to MAXEXTLEN that
197 * we rounded up to it, cut it back so it's valid again.
198 * Note that if it's a really large request (bigger than
199 * MAXEXTLEN), we don't hear about that number, and can't
200 * adjust the starting point to match it.
201 */
202 if (ralen * mp->m_sb.sb_rextsize >= MAXEXTLEN)
203 ralen = MAXEXTLEN / mp->m_sb.sb_rextsize;
204
205 /*
206 * Lock out modifications to both the RT bitmap and summary inodes
207 */
208 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
209 xfs_trans_ijoin(ap->tp, mp->m_rbmip, XFS_ILOCK_EXCL);
210 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL);
211 xfs_trans_ijoin(ap->tp, mp->m_rsumip, XFS_ILOCK_EXCL);
212
213 /*
214 * If it's an allocation to an empty file at offset 0,
215 * pick an extent that will space things out in the rt area.
216 */
217 if (ap->eof && ap->offset == 0) {
218 xfs_rtblock_t uninitialized_var(rtx); /* realtime extent no */
219
220 error = xfs_rtpick_extent(mp, ap->tp, ralen, &rtx);
221 if (error)
222 return error;
223 ap->blkno = rtx * mp->m_sb.sb_rextsize;
224 } else {
225 ap->blkno = 0;
226 }
227
228 xfs_bmap_adjacent(ap);
229
230 /*
231 * Realtime allocation, done through xfs_rtallocate_extent.
232 */
233 atype = ap->blkno == 0 ? XFS_ALLOCTYPE_ANY_AG : XFS_ALLOCTYPE_NEAR_BNO;
234 do_div(ap->blkno, mp->m_sb.sb_rextsize);
235 rtb = ap->blkno;
236 ap->length = ralen;
237 if ((error = xfs_rtallocate_extent(ap->tp, ap->blkno, 1, ap->length,
238 &ralen, atype, ap->wasdel, prod, &rtb)))
239 return error;
240 if (rtb == NULLFSBLOCK && prod > 1 &&
241 (error = xfs_rtallocate_extent(ap->tp, ap->blkno, 1,
242 ap->length, &ralen, atype,
243 ap->wasdel, 1, &rtb)))
244 return error;
245 ap->blkno = rtb;
246 if (ap->blkno != NULLFSBLOCK) {
247 ap->blkno *= mp->m_sb.sb_rextsize;
248 ralen *= mp->m_sb.sb_rextsize;
249 ap->length = ralen;
250 ap->ip->i_d.di_nblocks += ralen;
251 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
252 if (ap->wasdel)
253 ap->ip->i_delayed_blks -= ralen;
254 /*
255 * Adjust the disk quota also. This was reserved
256 * earlier.
257 */
258 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
259 ap->wasdel ? XFS_TRANS_DQ_DELRTBCOUNT :
260 XFS_TRANS_DQ_RTBCOUNT, (long) ralen);
261
262 /* Zero the extent if we were asked to do so */
263 if (ap->userdata & XFS_ALLOC_USERDATA_ZERO) {
264 error = xfs_zero_extent(ap->ip, ap->blkno, ap->length);
265 if (error)
266 return error;
267 }
268 } else {
269 ap->length = 0;
270 }
271 return 0;
272}
273
274/*
275 * Check if the endoff is outside the last extent. If so the caller will grow
276 * the allocation to a stripe unit boundary. All offsets are considered outside
277 * the end of file for an empty fork, so 1 is returned in *eof in that case.
278 */
279int
280xfs_bmap_eof(
281 struct xfs_inode *ip,
282 xfs_fileoff_t endoff,
283 int whichfork,
284 int *eof)
285{
286 struct xfs_bmbt_irec rec;
287 int error;
288
289 error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, eof);
290 if (error || *eof)
291 return error;
292
293 *eof = endoff >= rec.br_startoff + rec.br_blockcount;
294 return 0;
295}
296
297/*
298 * Extent tree block counting routines.
299 */
300
301/*
302 * Count leaf blocks given a range of extent records.
303 */
304STATIC void
305xfs_bmap_count_leaves(
306 xfs_ifork_t *ifp,
307 xfs_extnum_t idx,
308 int numrecs,
309 int *count)
310{
311 int b;
312
313 for (b = 0; b < numrecs; b++) {
314 xfs_bmbt_rec_host_t *frp = xfs_iext_get_ext(ifp, idx + b);
315 *count += xfs_bmbt_get_blockcount(frp);
316 }
317}
318
319/*
320 * Count leaf blocks given a range of extent records originally
321 * in btree format.
322 */
323STATIC void
324xfs_bmap_disk_count_leaves(
325 struct xfs_mount *mp,
326 struct xfs_btree_block *block,
327 int numrecs,
328 int *count)
329{
330 int b;
331 xfs_bmbt_rec_t *frp;
332
333 for (b = 1; b <= numrecs; b++) {
334 frp = XFS_BMBT_REC_ADDR(mp, block, b);
335 *count += xfs_bmbt_disk_get_blockcount(frp);
336 }
337}
338
339/*
340 * Recursively walks each level of a btree
341 * to count total fsblocks in use.
342 */
343STATIC int /* error */
344xfs_bmap_count_tree(
345 xfs_mount_t *mp, /* file system mount point */
346 xfs_trans_t *tp, /* transaction pointer */
347 xfs_ifork_t *ifp, /* inode fork pointer */
348 xfs_fsblock_t blockno, /* file system block number */
349 int levelin, /* level in btree */
350 int *count) /* Count of blocks */
351{
352 int error;
353 xfs_buf_t *bp, *nbp;
354 int level = levelin;
355 __be64 *pp;
356 xfs_fsblock_t bno = blockno;
357 xfs_fsblock_t nextbno;
358 struct xfs_btree_block *block, *nextblock;
359 int numrecs;
360
361 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, XFS_BMAP_BTREE_REF,
362 &xfs_bmbt_buf_ops);
363 if (error)
364 return error;
365 *count += 1;
366 block = XFS_BUF_TO_BLOCK(bp);
367
368 if (--level) {
369 /* Not at node above leaves, count this level of nodes */
370 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
371 while (nextbno != NULLFSBLOCK) {
372 error = xfs_btree_read_bufl(mp, tp, nextbno, 0, &nbp,
373 XFS_BMAP_BTREE_REF,
374 &xfs_bmbt_buf_ops);
375 if (error)
376 return error;
377 *count += 1;
378 nextblock = XFS_BUF_TO_BLOCK(nbp);
379 nextbno = be64_to_cpu(nextblock->bb_u.l.bb_rightsib);
380 xfs_trans_brelse(tp, nbp);
381 }
382
383 /* Dive to the next level */
384 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
385 bno = be64_to_cpu(*pp);
386 if (unlikely((error =
387 xfs_bmap_count_tree(mp, tp, ifp, bno, level, count)) < 0)) {
388 xfs_trans_brelse(tp, bp);
389 XFS_ERROR_REPORT("xfs_bmap_count_tree(1)",
390 XFS_ERRLEVEL_LOW, mp);
391 return -EFSCORRUPTED;
392 }
393 xfs_trans_brelse(tp, bp);
394 } else {
395 /* count all level 1 nodes and their leaves */
396 for (;;) {
397 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
398 numrecs = be16_to_cpu(block->bb_numrecs);
399 xfs_bmap_disk_count_leaves(mp, block, numrecs, count);
400 xfs_trans_brelse(tp, bp);
401 if (nextbno == NULLFSBLOCK)
402 break;
403 bno = nextbno;
404 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
405 XFS_BMAP_BTREE_REF,
406 &xfs_bmbt_buf_ops);
407 if (error)
408 return error;
409 *count += 1;
410 block = XFS_BUF_TO_BLOCK(bp);
411 }
412 }
413 return 0;
414}
415
416/*
417 * Count fsblocks of the given fork.
418 */
419int /* error */
420xfs_bmap_count_blocks(
421 xfs_trans_t *tp, /* transaction pointer */
422 xfs_inode_t *ip, /* incore inode */
423 int whichfork, /* data or attr fork */
424 int *count) /* out: count of blocks */
425{
426 struct xfs_btree_block *block; /* current btree block */
427 xfs_fsblock_t bno; /* block # of "block" */
428 xfs_ifork_t *ifp; /* fork structure */
429 int level; /* btree level, for checking */
430 xfs_mount_t *mp; /* file system mount structure */
431 __be64 *pp; /* pointer to block address */
432
433 bno = NULLFSBLOCK;
434 mp = ip->i_mount;
435 ifp = XFS_IFORK_PTR(ip, whichfork);
436 if ( XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS ) {
437 xfs_bmap_count_leaves(ifp, 0,
438 ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t),
439 count);
440 return 0;
441 }
442
443 /*
444 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
445 */
446 block = ifp->if_broot;
447 level = be16_to_cpu(block->bb_level);
448 ASSERT(level > 0);
449 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
450 bno = be64_to_cpu(*pp);
451 ASSERT(bno != NULLFSBLOCK);
452 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
453 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
454
455 if (unlikely(xfs_bmap_count_tree(mp, tp, ifp, bno, level, count) < 0)) {
456 XFS_ERROR_REPORT("xfs_bmap_count_blocks(2)", XFS_ERRLEVEL_LOW,
457 mp);
458 return -EFSCORRUPTED;
459 }
460
461 return 0;
462}
463
464/*
465 * returns 1 for success, 0 if we failed to map the extent.
466 */
467STATIC int
468xfs_getbmapx_fix_eof_hole(
469 xfs_inode_t *ip, /* xfs incore inode pointer */
470 struct getbmapx *out, /* output structure */
471 int prealloced, /* this is a file with
472 * preallocated data space */
473 __int64_t end, /* last block requested */
474 xfs_fsblock_t startblock)
475{
476 __int64_t fixlen;
477 xfs_mount_t *mp; /* file system mount point */
478 xfs_ifork_t *ifp; /* inode fork pointer */
479 xfs_extnum_t lastx; /* last extent pointer */
480 xfs_fileoff_t fileblock;
481
482 if (startblock == HOLESTARTBLOCK) {
483 mp = ip->i_mount;
484 out->bmv_block = -1;
485 fixlen = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, XFS_ISIZE(ip)));
486 fixlen -= out->bmv_offset;
487 if (prealloced && out->bmv_offset + out->bmv_length == end) {
488 /* Came to hole at EOF. Trim it. */
489 if (fixlen <= 0)
490 return 0;
491 out->bmv_length = fixlen;
492 }
493 } else {
494 if (startblock == DELAYSTARTBLOCK)
495 out->bmv_block = -2;
496 else
497 out->bmv_block = xfs_fsb_to_db(ip, startblock);
498 fileblock = XFS_BB_TO_FSB(ip->i_mount, out->bmv_offset);
499 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
500 if (xfs_iext_bno_to_ext(ifp, fileblock, &lastx) &&
501 (lastx == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))-1))
502 out->bmv_oflags |= BMV_OF_LAST;
503 }
504
505 return 1;
506}
507
508/*
509 * Get inode's extents as described in bmv, and format for output.
510 * Calls formatter to fill the user's buffer until all extents
511 * are mapped, until the passed-in bmv->bmv_count slots have
512 * been filled, or until the formatter short-circuits the loop,
513 * if it is tracking filled-in extents on its own.
514 */
515int /* error code */
516xfs_getbmap(
517 xfs_inode_t *ip,
518 struct getbmapx *bmv, /* user bmap structure */
519 xfs_bmap_format_t formatter, /* format to user */
520 void *arg) /* formatter arg */
521{
522 __int64_t bmvend; /* last block requested */
523 int error = 0; /* return value */
524 __int64_t fixlen; /* length for -1 case */
525 int i; /* extent number */
526 int lock; /* lock state */
527 xfs_bmbt_irec_t *map; /* buffer for user's data */
528 xfs_mount_t *mp; /* file system mount point */
529 int nex; /* # of user extents can do */
530 int nexleft; /* # of user extents left */
531 int subnex; /* # of bmapi's can do */
532 int nmap; /* number of map entries */
533 struct getbmapx *out; /* output structure */
534 int whichfork; /* data or attr fork */
535 int prealloced; /* this is a file with
536 * preallocated data space */
537 int iflags; /* interface flags */
538 int bmapi_flags; /* flags for xfs_bmapi */
539 int cur_ext = 0;
540
541 mp = ip->i_mount;
542 iflags = bmv->bmv_iflags;
543 whichfork = iflags & BMV_IF_ATTRFORK ? XFS_ATTR_FORK : XFS_DATA_FORK;
544
545 if (whichfork == XFS_ATTR_FORK) {
546 if (XFS_IFORK_Q(ip)) {
547 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS &&
548 ip->i_d.di_aformat != XFS_DINODE_FMT_BTREE &&
549 ip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)
550 return -EINVAL;
551 } else if (unlikely(
552 ip->i_d.di_aformat != 0 &&
553 ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS)) {
554 XFS_ERROR_REPORT("xfs_getbmap", XFS_ERRLEVEL_LOW,
555 ip->i_mount);
556 return -EFSCORRUPTED;
557 }
558
559 prealloced = 0;
560 fixlen = 1LL << 32;
561 } else {
562 if (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS &&
563 ip->i_d.di_format != XFS_DINODE_FMT_BTREE &&
564 ip->i_d.di_format != XFS_DINODE_FMT_LOCAL)
565 return -EINVAL;
566
567 if (xfs_get_extsz_hint(ip) ||
568 ip->i_d.di_flags & (XFS_DIFLAG_PREALLOC|XFS_DIFLAG_APPEND)){
569 prealloced = 1;
570 fixlen = mp->m_super->s_maxbytes;
571 } else {
572 prealloced = 0;
573 fixlen = XFS_ISIZE(ip);
574 }
575 }
576
577 if (bmv->bmv_length == -1) {
578 fixlen = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, fixlen));
579 bmv->bmv_length =
580 max_t(__int64_t, fixlen - bmv->bmv_offset, 0);
581 } else if (bmv->bmv_length == 0) {
582 bmv->bmv_entries = 0;
583 return 0;
584 } else if (bmv->bmv_length < 0) {
585 return -EINVAL;
586 }
587
588 nex = bmv->bmv_count - 1;
589 if (nex <= 0)
590 return -EINVAL;
591 bmvend = bmv->bmv_offset + bmv->bmv_length;
592
593
594 if (bmv->bmv_count > ULONG_MAX / sizeof(struct getbmapx))
595 return -ENOMEM;
596 out = kmem_zalloc_large(bmv->bmv_count * sizeof(struct getbmapx), 0);
597 if (!out)
598 return -ENOMEM;
599
600 xfs_ilock(ip, XFS_IOLOCK_SHARED);
601 if (whichfork == XFS_DATA_FORK) {
602 if (!(iflags & BMV_IF_DELALLOC) &&
603 (ip->i_delayed_blks || XFS_ISIZE(ip) > ip->i_d.di_size)) {
604 error = filemap_write_and_wait(VFS_I(ip)->i_mapping);
605 if (error)
606 goto out_unlock_iolock;
607
608 /*
609 * Even after flushing the inode, there can still be
610 * delalloc blocks on the inode beyond EOF due to
611 * speculative preallocation. These are not removed
612 * until the release function is called or the inode
613 * is inactivated. Hence we cannot assert here that
614 * ip->i_delayed_blks == 0.
615 */
616 }
617
618 lock = xfs_ilock_data_map_shared(ip);
619 } else {
620 lock = xfs_ilock_attr_map_shared(ip);
621 }
622
623 /*
624 * Don't let nex be bigger than the number of extents
625 * we can have assuming alternating holes and real extents.
626 */
627 if (nex > XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1)
628 nex = XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1;
629
630 bmapi_flags = xfs_bmapi_aflag(whichfork);
631 if (!(iflags & BMV_IF_PREALLOC))
632 bmapi_flags |= XFS_BMAPI_IGSTATE;
633
634 /*
635 * Allocate enough space to handle "subnex" maps at a time.
636 */
637 error = -ENOMEM;
638 subnex = 16;
639 map = kmem_alloc(subnex * sizeof(*map), KM_MAYFAIL | KM_NOFS);
640 if (!map)
641 goto out_unlock_ilock;
642
643 bmv->bmv_entries = 0;
644
645 if (XFS_IFORK_NEXTENTS(ip, whichfork) == 0 &&
646 (whichfork == XFS_ATTR_FORK || !(iflags & BMV_IF_DELALLOC))) {
647 error = 0;
648 goto out_free_map;
649 }
650
651 nexleft = nex;
652
653 do {
654 nmap = (nexleft > subnex) ? subnex : nexleft;
655 error = xfs_bmapi_read(ip, XFS_BB_TO_FSBT(mp, bmv->bmv_offset),
656 XFS_BB_TO_FSB(mp, bmv->bmv_length),
657 map, &nmap, bmapi_flags);
658 if (error)
659 goto out_free_map;
660 ASSERT(nmap <= subnex);
661
662 for (i = 0; i < nmap && nexleft && bmv->bmv_length; i++) {
663 out[cur_ext].bmv_oflags = 0;
664 if (map[i].br_state == XFS_EXT_UNWRITTEN)
665 out[cur_ext].bmv_oflags |= BMV_OF_PREALLOC;
666 else if (map[i].br_startblock == DELAYSTARTBLOCK)
667 out[cur_ext].bmv_oflags |= BMV_OF_DELALLOC;
668 out[cur_ext].bmv_offset =
669 XFS_FSB_TO_BB(mp, map[i].br_startoff);
670 out[cur_ext].bmv_length =
671 XFS_FSB_TO_BB(mp, map[i].br_blockcount);
672 out[cur_ext].bmv_unused1 = 0;
673 out[cur_ext].bmv_unused2 = 0;
674
675 /*
676 * delayed allocation extents that start beyond EOF can
677 * occur due to speculative EOF allocation when the
678 * delalloc extent is larger than the largest freespace
679 * extent at conversion time. These extents cannot be
680 * converted by data writeback, so can exist here even
681 * if we are not supposed to be finding delalloc
682 * extents.
683 */
684 if (map[i].br_startblock == DELAYSTARTBLOCK &&
685 map[i].br_startoff <= XFS_B_TO_FSB(mp, XFS_ISIZE(ip)))
686 ASSERT((iflags & BMV_IF_DELALLOC) != 0);
687
688 if (map[i].br_startblock == HOLESTARTBLOCK &&
689 whichfork == XFS_ATTR_FORK) {
690 /* came to the end of attribute fork */
691 out[cur_ext].bmv_oflags |= BMV_OF_LAST;
692 goto out_free_map;
693 }
694
695 if (!xfs_getbmapx_fix_eof_hole(ip, &out[cur_ext],
696 prealloced, bmvend,
697 map[i].br_startblock))
698 goto out_free_map;
699
700 bmv->bmv_offset =
701 out[cur_ext].bmv_offset +
702 out[cur_ext].bmv_length;
703 bmv->bmv_length =
704 max_t(__int64_t, 0, bmvend - bmv->bmv_offset);
705
706 /*
707 * In case we don't want to return the hole,
708 * don't increase cur_ext so that we can reuse
709 * it in the next loop.
710 */
711 if ((iflags & BMV_IF_NO_HOLES) &&
712 map[i].br_startblock == HOLESTARTBLOCK) {
713 memset(&out[cur_ext], 0, sizeof(out[cur_ext]));
714 continue;
715 }
716
717 nexleft--;
718 bmv->bmv_entries++;
719 cur_ext++;
720 }
721 } while (nmap && nexleft && bmv->bmv_length);
722
723 out_free_map:
724 kmem_free(map);
725 out_unlock_ilock:
726 xfs_iunlock(ip, lock);
727 out_unlock_iolock:
728 xfs_iunlock(ip, XFS_IOLOCK_SHARED);
729
730 for (i = 0; i < cur_ext; i++) {
731 int full = 0; /* user array is full */
732
733 /* format results & advance arg */
734 error = formatter(&arg, &out[i], &full);
735 if (error || full)
736 break;
737 }
738
739 kmem_free(out);
740 return error;
741}
742
743/*
744 * dead simple method of punching delalyed allocation blocks from a range in
745 * the inode. Walks a block at a time so will be slow, but is only executed in
746 * rare error cases so the overhead is not critical. This will always punch out
747 * both the start and end blocks, even if the ranges only partially overlap
748 * them, so it is up to the caller to ensure that partial blocks are not
749 * passed in.
750 */
751int
752xfs_bmap_punch_delalloc_range(
753 struct xfs_inode *ip,
754 xfs_fileoff_t start_fsb,
755 xfs_fileoff_t length)
756{
757 xfs_fileoff_t remaining = length;
758 int error = 0;
759
760 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
761
762 do {
763 int done;
764 xfs_bmbt_irec_t imap;
765 int nimaps = 1;
766 xfs_fsblock_t firstblock;
767 xfs_bmap_free_t flist;
768
769 /*
770 * Map the range first and check that it is a delalloc extent
771 * before trying to unmap the range. Otherwise we will be
772 * trying to remove a real extent (which requires a
773 * transaction) or a hole, which is probably a bad idea...
774 */
775 error = xfs_bmapi_read(ip, start_fsb, 1, &imap, &nimaps,
776 XFS_BMAPI_ENTIRE);
777
778 if (error) {
779 /* something screwed, just bail */
780 if (!XFS_FORCED_SHUTDOWN(ip->i_mount)) {
781 xfs_alert(ip->i_mount,
782 "Failed delalloc mapping lookup ino %lld fsb %lld.",
783 ip->i_ino, start_fsb);
784 }
785 break;
786 }
787 if (!nimaps) {
788 /* nothing there */
789 goto next_block;
790 }
791 if (imap.br_startblock != DELAYSTARTBLOCK) {
792 /* been converted, ignore */
793 goto next_block;
794 }
795 WARN_ON(imap.br_blockcount == 0);
796
797 /*
798 * Note: while we initialise the firstblock/flist pair, they
799 * should never be used because blocks should never be
800 * allocated or freed for a delalloc extent and hence we need
801 * don't cancel or finish them after the xfs_bunmapi() call.
802 */
803 xfs_bmap_init(&flist, &firstblock);
804 error = xfs_bunmapi(NULL, ip, start_fsb, 1, 0, 1, &firstblock,
805 &flist, &done);
806 if (error)
807 break;
808
809 ASSERT(!flist.xbf_count && !flist.xbf_first);
810next_block:
811 start_fsb++;
812 remaining--;
813 } while(remaining > 0);
814
815 return error;
816}
817
818/*
819 * Test whether it is appropriate to check an inode for and free post EOF
820 * blocks. The 'force' parameter determines whether we should also consider
821 * regular files that are marked preallocated or append-only.
822 */
823bool
824xfs_can_free_eofblocks(struct xfs_inode *ip, bool force)
825{
826 /* prealloc/delalloc exists only on regular files */
827 if (!S_ISREG(VFS_I(ip)->i_mode))
828 return false;
829
830 /*
831 * Zero sized files with no cached pages and delalloc blocks will not
832 * have speculative prealloc/delalloc blocks to remove.
833 */
834 if (VFS_I(ip)->i_size == 0 &&
835 VFS_I(ip)->i_mapping->nrpages == 0 &&
836 ip->i_delayed_blks == 0)
837 return false;
838
839 /* If we haven't read in the extent list, then don't do it now. */
840 if (!(ip->i_df.if_flags & XFS_IFEXTENTS))
841 return false;
842
843 /*
844 * Do not free real preallocated or append-only files unless the file
845 * has delalloc blocks and we are forced to remove them.
846 */
847 if (ip->i_d.di_flags & (XFS_DIFLAG_PREALLOC | XFS_DIFLAG_APPEND))
848 if (!force || ip->i_delayed_blks == 0)
849 return false;
850
851 return true;
852}
853
854/*
855 * This is called by xfs_inactive to free any blocks beyond eof
856 * when the link count isn't zero and by xfs_dm_punch_hole() when
857 * punching a hole to EOF.
858 */
859int
860xfs_free_eofblocks(
861 xfs_mount_t *mp,
862 xfs_inode_t *ip,
863 bool need_iolock)
864{
865 xfs_trans_t *tp;
866 int error;
867 xfs_fileoff_t end_fsb;
868 xfs_fileoff_t last_fsb;
869 xfs_filblks_t map_len;
870 int nimaps;
871 xfs_bmbt_irec_t imap;
872
873 /*
874 * Figure out if there are any blocks beyond the end
875 * of the file. If not, then there is nothing to do.
876 */
877 end_fsb = XFS_B_TO_FSB(mp, (xfs_ufsize_t)XFS_ISIZE(ip));
878 last_fsb = XFS_B_TO_FSB(mp, mp->m_super->s_maxbytes);
879 if (last_fsb <= end_fsb)
880 return 0;
881 map_len = last_fsb - end_fsb;
882
883 nimaps = 1;
884 xfs_ilock(ip, XFS_ILOCK_SHARED);
885 error = xfs_bmapi_read(ip, end_fsb, map_len, &imap, &nimaps, 0);
886 xfs_iunlock(ip, XFS_ILOCK_SHARED);
887
888 if (!error && (nimaps != 0) &&
889 (imap.br_startblock != HOLESTARTBLOCK ||
890 ip->i_delayed_blks)) {
891 /*
892 * Attach the dquots to the inode up front.
893 */
894 error = xfs_qm_dqattach(ip, 0);
895 if (error)
896 return error;
897
898 /*
899 * There are blocks after the end of file.
900 * Free them up now by truncating the file to
901 * its current size.
902 */
903 tp = xfs_trans_alloc(mp, XFS_TRANS_INACTIVE);
904
905 if (need_iolock) {
906 if (!xfs_ilock_nowait(ip, XFS_IOLOCK_EXCL)) {
907 xfs_trans_cancel(tp);
908 return -EAGAIN;
909 }
910 }
911
912 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_itruncate, 0, 0);
913 if (error) {
914 ASSERT(XFS_FORCED_SHUTDOWN(mp));
915 xfs_trans_cancel(tp);
916 if (need_iolock)
917 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
918 return error;
919 }
920
921 xfs_ilock(ip, XFS_ILOCK_EXCL);
922 xfs_trans_ijoin(tp, ip, 0);
923
924 /*
925 * Do not update the on-disk file size. If we update the
926 * on-disk file size and then the system crashes before the
927 * contents of the file are flushed to disk then the files
928 * may be full of holes (ie NULL files bug).
929 */
930 error = xfs_itruncate_extents(&tp, ip, XFS_DATA_FORK,
931 XFS_ISIZE(ip));
932 if (error) {
933 /*
934 * If we get an error at this point we simply don't
935 * bother truncating the file.
936 */
937 xfs_trans_cancel(tp);
938 } else {
939 error = xfs_trans_commit(tp);
940 if (!error)
941 xfs_inode_clear_eofblocks_tag(ip);
942 }
943
944 xfs_iunlock(ip, XFS_ILOCK_EXCL);
945 if (need_iolock)
946 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
947 }
948 return error;
949}
950
951int
952xfs_alloc_file_space(
953 struct xfs_inode *ip,
954 xfs_off_t offset,
955 xfs_off_t len,
956 int alloc_type)
957{
958 xfs_mount_t *mp = ip->i_mount;
959 xfs_off_t count;
960 xfs_filblks_t allocated_fsb;
961 xfs_filblks_t allocatesize_fsb;
962 xfs_extlen_t extsz, temp;
963 xfs_fileoff_t startoffset_fsb;
964 xfs_fsblock_t firstfsb;
965 int nimaps;
966 int quota_flag;
967 int rt;
968 xfs_trans_t *tp;
969 xfs_bmbt_irec_t imaps[1], *imapp;
970 xfs_bmap_free_t free_list;
971 uint qblocks, resblks, resrtextents;
972 int error;
973
974 trace_xfs_alloc_file_space(ip);
975
976 if (XFS_FORCED_SHUTDOWN(mp))
977 return -EIO;
978
979 error = xfs_qm_dqattach(ip, 0);
980 if (error)
981 return error;
982
983 if (len <= 0)
984 return -EINVAL;
985
986 rt = XFS_IS_REALTIME_INODE(ip);
987 extsz = xfs_get_extsz_hint(ip);
988
989 count = len;
990 imapp = &imaps[0];
991 nimaps = 1;
992 startoffset_fsb = XFS_B_TO_FSBT(mp, offset);
993 allocatesize_fsb = XFS_B_TO_FSB(mp, count);
994
995 /*
996 * Allocate file space until done or until there is an error
997 */
998 while (allocatesize_fsb && !error) {
999 xfs_fileoff_t s, e;
1000
1001 /*
1002 * Determine space reservations for data/realtime.
1003 */
1004 if (unlikely(extsz)) {
1005 s = startoffset_fsb;
1006 do_div(s, extsz);
1007 s *= extsz;
1008 e = startoffset_fsb + allocatesize_fsb;
1009 if ((temp = do_mod(startoffset_fsb, extsz)))
1010 e += temp;
1011 if ((temp = do_mod(e, extsz)))
1012 e += extsz - temp;
1013 } else {
1014 s = 0;
1015 e = allocatesize_fsb;
1016 }
1017
1018 /*
1019 * The transaction reservation is limited to a 32-bit block
1020 * count, hence we need to limit the number of blocks we are
1021 * trying to reserve to avoid an overflow. We can't allocate
1022 * more than @nimaps extents, and an extent is limited on disk
1023 * to MAXEXTLEN (21 bits), so use that to enforce the limit.
1024 */
1025 resblks = min_t(xfs_fileoff_t, (e - s), (MAXEXTLEN * nimaps));
1026 if (unlikely(rt)) {
1027 resrtextents = qblocks = resblks;
1028 resrtextents /= mp->m_sb.sb_rextsize;
1029 resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0);
1030 quota_flag = XFS_QMOPT_RES_RTBLKS;
1031 } else {
1032 resrtextents = 0;
1033 resblks = qblocks = XFS_DIOSTRAT_SPACE_RES(mp, resblks);
1034 quota_flag = XFS_QMOPT_RES_REGBLKS;
1035 }
1036
1037 /*
1038 * Allocate and setup the transaction.
1039 */
1040 tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT);
1041 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write,
1042 resblks, resrtextents);
1043 /*
1044 * Check for running out of space
1045 */
1046 if (error) {
1047 /*
1048 * Free the transaction structure.
1049 */
1050 ASSERT(error == -ENOSPC || XFS_FORCED_SHUTDOWN(mp));
1051 xfs_trans_cancel(tp);
1052 break;
1053 }
1054 xfs_ilock(ip, XFS_ILOCK_EXCL);
1055 error = xfs_trans_reserve_quota_nblks(tp, ip, qblocks,
1056 0, quota_flag);
1057 if (error)
1058 goto error1;
1059
1060 xfs_trans_ijoin(tp, ip, 0);
1061
1062 xfs_bmap_init(&free_list, &firstfsb);
1063 error = xfs_bmapi_write(tp, ip, startoffset_fsb,
1064 allocatesize_fsb, alloc_type, &firstfsb,
1065 resblks, imapp, &nimaps, &free_list);
1066 if (error)
1067 goto error0;
1068
1069 /*
1070 * Complete the transaction
1071 */
1072 error = xfs_bmap_finish(&tp, &free_list, NULL);
1073 if (error)
1074 goto error0;
1075
1076 error = xfs_trans_commit(tp);
1077 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1078 if (error)
1079 break;
1080
1081 allocated_fsb = imapp->br_blockcount;
1082
1083 if (nimaps == 0) {
1084 error = -ENOSPC;
1085 break;
1086 }
1087
1088 startoffset_fsb += allocated_fsb;
1089 allocatesize_fsb -= allocated_fsb;
1090 }
1091
1092 return error;
1093
1094error0: /* Cancel bmap, unlock inode, unreserve quota blocks, cancel trans */
1095 xfs_bmap_cancel(&free_list);
1096 xfs_trans_unreserve_quota_nblks(tp, ip, (long)qblocks, 0, quota_flag);
1097
1098error1: /* Just cancel transaction */
1099 xfs_trans_cancel(tp);
1100 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1101 return error;
1102}
1103
1104/*
1105 * Zero file bytes between startoff and endoff inclusive.
1106 * The iolock is held exclusive and no blocks are buffered.
1107 *
1108 * This function is used by xfs_free_file_space() to zero
1109 * partial blocks when the range to free is not block aligned.
1110 * When unreserving space with boundaries that are not block
1111 * aligned we round up the start and round down the end
1112 * boundaries and then use this function to zero the parts of
1113 * the blocks that got dropped during the rounding.
1114 */
1115STATIC int
1116xfs_zero_remaining_bytes(
1117 xfs_inode_t *ip,
1118 xfs_off_t startoff,
1119 xfs_off_t endoff)
1120{
1121 xfs_bmbt_irec_t imap;
1122 xfs_fileoff_t offset_fsb;
1123 xfs_off_t lastoffset;
1124 xfs_off_t offset;
1125 xfs_buf_t *bp;
1126 xfs_mount_t *mp = ip->i_mount;
1127 int nimap;
1128 int error = 0;
1129
1130 /*
1131 * Avoid doing I/O beyond eof - it's not necessary
1132 * since nothing can read beyond eof. The space will
1133 * be zeroed when the file is extended anyway.
1134 */
1135 if (startoff >= XFS_ISIZE(ip))
1136 return 0;
1137
1138 if (endoff > XFS_ISIZE(ip))
1139 endoff = XFS_ISIZE(ip);
1140
1141 for (offset = startoff; offset <= endoff; offset = lastoffset + 1) {
1142 uint lock_mode;
1143
1144 offset_fsb = XFS_B_TO_FSBT(mp, offset);
1145 nimap = 1;
1146
1147 lock_mode = xfs_ilock_data_map_shared(ip);
1148 error = xfs_bmapi_read(ip, offset_fsb, 1, &imap, &nimap, 0);
1149 xfs_iunlock(ip, lock_mode);
1150
1151 if (error || nimap < 1)
1152 break;
1153 ASSERT(imap.br_blockcount >= 1);
1154 ASSERT(imap.br_startoff == offset_fsb);
1155 ASSERT(imap.br_startblock != DELAYSTARTBLOCK);
1156
1157 if (imap.br_startblock == HOLESTARTBLOCK ||
1158 imap.br_state == XFS_EXT_UNWRITTEN) {
1159 /* skip the entire extent */
1160 lastoffset = XFS_FSB_TO_B(mp, imap.br_startoff +
1161 imap.br_blockcount) - 1;
1162 continue;
1163 }
1164
1165 lastoffset = XFS_FSB_TO_B(mp, imap.br_startoff + 1) - 1;
1166 if (lastoffset > endoff)
1167 lastoffset = endoff;
1168
1169 /* DAX can just zero the backing device directly */
1170 if (IS_DAX(VFS_I(ip))) {
1171 error = dax_zero_page_range(VFS_I(ip), offset,
1172 lastoffset - offset + 1,
1173 xfs_get_blocks_direct);
1174 if (error)
1175 return error;
1176 continue;
1177 }
1178
1179 error = xfs_buf_read_uncached(XFS_IS_REALTIME_INODE(ip) ?
1180 mp->m_rtdev_targp : mp->m_ddev_targp,
1181 xfs_fsb_to_db(ip, imap.br_startblock),
1182 BTOBB(mp->m_sb.sb_blocksize),
1183 0, &bp, NULL);
1184 if (error)
1185 return error;
1186
1187 memset(bp->b_addr +
1188 (offset - XFS_FSB_TO_B(mp, imap.br_startoff)),
1189 0, lastoffset - offset + 1);
1190
1191 error = xfs_bwrite(bp);
1192 xfs_buf_relse(bp);
1193 if (error)
1194 return error;
1195 }
1196 return error;
1197}
1198
1199int
1200xfs_free_file_space(
1201 struct xfs_inode *ip,
1202 xfs_off_t offset,
1203 xfs_off_t len)
1204{
1205 int done;
1206 xfs_fileoff_t endoffset_fsb;
1207 int error;
1208 xfs_fsblock_t firstfsb;
1209 xfs_bmap_free_t free_list;
1210 xfs_bmbt_irec_t imap;
1211 xfs_off_t ioffset;
1212 xfs_off_t iendoffset;
1213 xfs_extlen_t mod=0;
1214 xfs_mount_t *mp;
1215 int nimap;
1216 uint resblks;
1217 xfs_off_t rounding;
1218 int rt;
1219 xfs_fileoff_t startoffset_fsb;
1220 xfs_trans_t *tp;
1221
1222 mp = ip->i_mount;
1223
1224 trace_xfs_free_file_space(ip);
1225
1226 error = xfs_qm_dqattach(ip, 0);
1227 if (error)
1228 return error;
1229
1230 error = 0;
1231 if (len <= 0) /* if nothing being freed */
1232 return error;
1233 rt = XFS_IS_REALTIME_INODE(ip);
1234 startoffset_fsb = XFS_B_TO_FSB(mp, offset);
1235 endoffset_fsb = XFS_B_TO_FSBT(mp, offset + len);
1236
1237 /* wait for the completion of any pending DIOs */
1238 inode_dio_wait(VFS_I(ip));
1239
1240 rounding = max_t(xfs_off_t, 1 << mp->m_sb.sb_blocklog, PAGE_SIZE);
1241 ioffset = round_down(offset, rounding);
1242 iendoffset = round_up(offset + len, rounding) - 1;
1243 error = filemap_write_and_wait_range(VFS_I(ip)->i_mapping, ioffset,
1244 iendoffset);
1245 if (error)
1246 goto out;
1247 truncate_pagecache_range(VFS_I(ip), ioffset, iendoffset);
1248
1249 /*
1250 * Need to zero the stuff we're not freeing, on disk.
1251 * If it's a realtime file & can't use unwritten extents then we
1252 * actually need to zero the extent edges. Otherwise xfs_bunmapi
1253 * will take care of it for us.
1254 */
1255 if (rt && !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
1256 nimap = 1;
1257 error = xfs_bmapi_read(ip, startoffset_fsb, 1,
1258 &imap, &nimap, 0);
1259 if (error)
1260 goto out;
1261 ASSERT(nimap == 0 || nimap == 1);
1262 if (nimap && imap.br_startblock != HOLESTARTBLOCK) {
1263 xfs_daddr_t block;
1264
1265 ASSERT(imap.br_startblock != DELAYSTARTBLOCK);
1266 block = imap.br_startblock;
1267 mod = do_div(block, mp->m_sb.sb_rextsize);
1268 if (mod)
1269 startoffset_fsb += mp->m_sb.sb_rextsize - mod;
1270 }
1271 nimap = 1;
1272 error = xfs_bmapi_read(ip, endoffset_fsb - 1, 1,
1273 &imap, &nimap, 0);
1274 if (error)
1275 goto out;
1276 ASSERT(nimap == 0 || nimap == 1);
1277 if (nimap && imap.br_startblock != HOLESTARTBLOCK) {
1278 ASSERT(imap.br_startblock != DELAYSTARTBLOCK);
1279 mod++;
1280 if (mod && (mod != mp->m_sb.sb_rextsize))
1281 endoffset_fsb -= mod;
1282 }
1283 }
1284 if ((done = (endoffset_fsb <= startoffset_fsb)))
1285 /*
1286 * One contiguous piece to clear
1287 */
1288 error = xfs_zero_remaining_bytes(ip, offset, offset + len - 1);
1289 else {
1290 /*
1291 * Some full blocks, possibly two pieces to clear
1292 */
1293 if (offset < XFS_FSB_TO_B(mp, startoffset_fsb))
1294 error = xfs_zero_remaining_bytes(ip, offset,
1295 XFS_FSB_TO_B(mp, startoffset_fsb) - 1);
1296 if (!error &&
1297 XFS_FSB_TO_B(mp, endoffset_fsb) < offset + len)
1298 error = xfs_zero_remaining_bytes(ip,
1299 XFS_FSB_TO_B(mp, endoffset_fsb),
1300 offset + len - 1);
1301 }
1302
1303 /*
1304 * free file space until done or until there is an error
1305 */
1306 resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0);
1307 while (!error && !done) {
1308
1309 /*
1310 * allocate and setup the transaction. Allow this
1311 * transaction to dip into the reserve blocks to ensure
1312 * the freeing of the space succeeds at ENOSPC.
1313 */
1314 tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT);
1315 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write, resblks, 0);
1316
1317 /*
1318 * check for running out of space
1319 */
1320 if (error) {
1321 /*
1322 * Free the transaction structure.
1323 */
1324 ASSERT(error == -ENOSPC || XFS_FORCED_SHUTDOWN(mp));
1325 xfs_trans_cancel(tp);
1326 break;
1327 }
1328 xfs_ilock(ip, XFS_ILOCK_EXCL);
1329 error = xfs_trans_reserve_quota(tp, mp,
1330 ip->i_udquot, ip->i_gdquot, ip->i_pdquot,
1331 resblks, 0, XFS_QMOPT_RES_REGBLKS);
1332 if (error)
1333 goto error1;
1334
1335 xfs_trans_ijoin(tp, ip, 0);
1336
1337 /*
1338 * issue the bunmapi() call to free the blocks
1339 */
1340 xfs_bmap_init(&free_list, &firstfsb);
1341 error = xfs_bunmapi(tp, ip, startoffset_fsb,
1342 endoffset_fsb - startoffset_fsb,
1343 0, 2, &firstfsb, &free_list, &done);
1344 if (error)
1345 goto error0;
1346
1347 /*
1348 * complete the transaction
1349 */
1350 error = xfs_bmap_finish(&tp, &free_list, NULL);
1351 if (error)
1352 goto error0;
1353
1354 error = xfs_trans_commit(tp);
1355 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1356 }
1357
1358 out:
1359 return error;
1360
1361 error0:
1362 xfs_bmap_cancel(&free_list);
1363 error1:
1364 xfs_trans_cancel(tp);
1365 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1366 goto out;
1367}
1368
1369/*
1370 * Preallocate and zero a range of a file. This mechanism has the allocation
1371 * semantics of fallocate and in addition converts data in the range to zeroes.
1372 */
1373int
1374xfs_zero_file_space(
1375 struct xfs_inode *ip,
1376 xfs_off_t offset,
1377 xfs_off_t len)
1378{
1379 struct xfs_mount *mp = ip->i_mount;
1380 uint blksize;
1381 int error;
1382
1383 trace_xfs_zero_file_space(ip);
1384
1385 blksize = 1 << mp->m_sb.sb_blocklog;
1386
1387 /*
1388 * Punch a hole and prealloc the range. We use hole punch rather than
1389 * unwritten extent conversion for two reasons:
1390 *
1391 * 1.) Hole punch handles partial block zeroing for us.
1392 *
1393 * 2.) If prealloc returns ENOSPC, the file range is still zero-valued
1394 * by virtue of the hole punch.
1395 */
1396 error = xfs_free_file_space(ip, offset, len);
1397 if (error)
1398 goto out;
1399
1400 error = xfs_alloc_file_space(ip, round_down(offset, blksize),
1401 round_up(offset + len, blksize) -
1402 round_down(offset, blksize),
1403 XFS_BMAPI_PREALLOC);
1404out:
1405 return error;
1406
1407}
1408
1409/*
1410 * @next_fsb will keep track of the extent currently undergoing shift.
1411 * @stop_fsb will keep track of the extent at which we have to stop.
1412 * If we are shifting left, we will start with block (offset + len) and
1413 * shift each extent till last extent.
1414 * If we are shifting right, we will start with last extent inside file space
1415 * and continue until we reach the block corresponding to offset.
1416 */
1417static int
1418xfs_shift_file_space(
1419 struct xfs_inode *ip,
1420 xfs_off_t offset,
1421 xfs_off_t len,
1422 enum shift_direction direction)
1423{
1424 int done = 0;
1425 struct xfs_mount *mp = ip->i_mount;
1426 struct xfs_trans *tp;
1427 int error;
1428 struct xfs_bmap_free free_list;
1429 xfs_fsblock_t first_block;
1430 xfs_fileoff_t stop_fsb;
1431 xfs_fileoff_t next_fsb;
1432 xfs_fileoff_t shift_fsb;
1433
1434 ASSERT(direction == SHIFT_LEFT || direction == SHIFT_RIGHT);
1435
1436 if (direction == SHIFT_LEFT) {
1437 next_fsb = XFS_B_TO_FSB(mp, offset + len);
1438 stop_fsb = XFS_B_TO_FSB(mp, VFS_I(ip)->i_size);
1439 } else {
1440 /*
1441 * If right shift, delegate the work of initialization of
1442 * next_fsb to xfs_bmap_shift_extent as it has ilock held.
1443 */
1444 next_fsb = NULLFSBLOCK;
1445 stop_fsb = XFS_B_TO_FSB(mp, offset);
1446 }
1447
1448 shift_fsb = XFS_B_TO_FSB(mp, len);
1449
1450 /*
1451 * Trim eofblocks to avoid shifting uninitialized post-eof preallocation
1452 * into the accessible region of the file.
1453 */
1454 if (xfs_can_free_eofblocks(ip, true)) {
1455 error = xfs_free_eofblocks(mp, ip, false);
1456 if (error)
1457 return error;
1458 }
1459
1460 /*
1461 * Writeback and invalidate cache for the remainder of the file as we're
1462 * about to shift down every extent from offset to EOF.
1463 */
1464 error = filemap_write_and_wait_range(VFS_I(ip)->i_mapping,
1465 offset, -1);
1466 if (error)
1467 return error;
1468 error = invalidate_inode_pages2_range(VFS_I(ip)->i_mapping,
1469 offset >> PAGE_SHIFT, -1);
1470 if (error)
1471 return error;
1472
1473 /*
1474 * The extent shiting code works on extent granularity. So, if
1475 * stop_fsb is not the starting block of extent, we need to split
1476 * the extent at stop_fsb.
1477 */
1478 if (direction == SHIFT_RIGHT) {
1479 error = xfs_bmap_split_extent(ip, stop_fsb);
1480 if (error)
1481 return error;
1482 }
1483
1484 while (!error && !done) {
1485 tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT);
1486 /*
1487 * We would need to reserve permanent block for transaction.
1488 * This will come into picture when after shifting extent into
1489 * hole we found that adjacent extents can be merged which
1490 * may lead to freeing of a block during record update.
1491 */
1492 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write,
1493 XFS_DIOSTRAT_SPACE_RES(mp, 0), 0);
1494 if (error) {
1495 xfs_trans_cancel(tp);
1496 break;
1497 }
1498
1499 xfs_ilock(ip, XFS_ILOCK_EXCL);
1500 error = xfs_trans_reserve_quota(tp, mp, ip->i_udquot,
1501 ip->i_gdquot, ip->i_pdquot,
1502 XFS_DIOSTRAT_SPACE_RES(mp, 0), 0,
1503 XFS_QMOPT_RES_REGBLKS);
1504 if (error)
1505 goto out_trans_cancel;
1506
1507 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
1508
1509 xfs_bmap_init(&free_list, &first_block);
1510
1511 /*
1512 * We are using the write transaction in which max 2 bmbt
1513 * updates are allowed
1514 */
1515 error = xfs_bmap_shift_extents(tp, ip, &next_fsb, shift_fsb,
1516 &done, stop_fsb, &first_block, &free_list,
1517 direction, XFS_BMAP_MAX_SHIFT_EXTENTS);
1518 if (error)
1519 goto out_bmap_cancel;
1520
1521 error = xfs_bmap_finish(&tp, &free_list, NULL);
1522 if (error)
1523 goto out_bmap_cancel;
1524
1525 error = xfs_trans_commit(tp);
1526 }
1527
1528 return error;
1529
1530out_bmap_cancel:
1531 xfs_bmap_cancel(&free_list);
1532out_trans_cancel:
1533 xfs_trans_cancel(tp);
1534 return error;
1535}
1536
1537/*
1538 * xfs_collapse_file_space()
1539 * This routine frees disk space and shift extent for the given file.
1540 * The first thing we do is to free data blocks in the specified range
1541 * by calling xfs_free_file_space(). It would also sync dirty data
1542 * and invalidate page cache over the region on which collapse range
1543 * is working. And Shift extent records to the left to cover a hole.
1544 * RETURNS:
1545 * 0 on success
1546 * errno on error
1547 *
1548 */
1549int
1550xfs_collapse_file_space(
1551 struct xfs_inode *ip,
1552 xfs_off_t offset,
1553 xfs_off_t len)
1554{
1555 int error;
1556
1557 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
1558 trace_xfs_collapse_file_space(ip);
1559
1560 error = xfs_free_file_space(ip, offset, len);
1561 if (error)
1562 return error;
1563
1564 return xfs_shift_file_space(ip, offset, len, SHIFT_LEFT);
1565}
1566
1567/*
1568 * xfs_insert_file_space()
1569 * This routine create hole space by shifting extents for the given file.
1570 * The first thing we do is to sync dirty data and invalidate page cache
1571 * over the region on which insert range is working. And split an extent
1572 * to two extents at given offset by calling xfs_bmap_split_extent.
1573 * And shift all extent records which are laying between [offset,
1574 * last allocated extent] to the right to reserve hole range.
1575 * RETURNS:
1576 * 0 on success
1577 * errno on error
1578 */
1579int
1580xfs_insert_file_space(
1581 struct xfs_inode *ip,
1582 loff_t offset,
1583 loff_t len)
1584{
1585 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
1586 trace_xfs_insert_file_space(ip);
1587
1588 return xfs_shift_file_space(ip, offset, len, SHIFT_RIGHT);
1589}
1590
1591/*
1592 * We need to check that the format of the data fork in the temporary inode is
1593 * valid for the target inode before doing the swap. This is not a problem with
1594 * attr1 because of the fixed fork offset, but attr2 has a dynamically sized
1595 * data fork depending on the space the attribute fork is taking so we can get
1596 * invalid formats on the target inode.
1597 *
1598 * E.g. target has space for 7 extents in extent format, temp inode only has
1599 * space for 6. If we defragment down to 7 extents, then the tmp format is a
1600 * btree, but when swapped it needs to be in extent format. Hence we can't just
1601 * blindly swap data forks on attr2 filesystems.
1602 *
1603 * Note that we check the swap in both directions so that we don't end up with
1604 * a corrupt temporary inode, either.
1605 *
1606 * Note that fixing the way xfs_fsr sets up the attribute fork in the source
1607 * inode will prevent this situation from occurring, so all we do here is
1608 * reject and log the attempt. basically we are putting the responsibility on
1609 * userspace to get this right.
1610 */
1611static int
1612xfs_swap_extents_check_format(
1613 xfs_inode_t *ip, /* target inode */
1614 xfs_inode_t *tip) /* tmp inode */
1615{
1616
1617 /* Should never get a local format */
1618 if (ip->i_d.di_format == XFS_DINODE_FMT_LOCAL ||
1619 tip->i_d.di_format == XFS_DINODE_FMT_LOCAL)
1620 return -EINVAL;
1621
1622 /*
1623 * if the target inode has less extents that then temporary inode then
1624 * why did userspace call us?
1625 */
1626 if (ip->i_d.di_nextents < tip->i_d.di_nextents)
1627 return -EINVAL;
1628
1629 /*
1630 * if the target inode is in extent form and the temp inode is in btree
1631 * form then we will end up with the target inode in the wrong format
1632 * as we already know there are less extents in the temp inode.
1633 */
1634 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1635 tip->i_d.di_format == XFS_DINODE_FMT_BTREE)
1636 return -EINVAL;
1637
1638 /* Check temp in extent form to max in target */
1639 if (tip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1640 XFS_IFORK_NEXTENTS(tip, XFS_DATA_FORK) >
1641 XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK))
1642 return -EINVAL;
1643
1644 /* Check target in extent form to max in temp */
1645 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1646 XFS_IFORK_NEXTENTS(ip, XFS_DATA_FORK) >
1647 XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK))
1648 return -EINVAL;
1649
1650 /*
1651 * If we are in a btree format, check that the temp root block will fit
1652 * in the target and that it has enough extents to be in btree format
1653 * in the target.
1654 *
1655 * Note that we have to be careful to allow btree->extent conversions
1656 * (a common defrag case) which will occur when the temp inode is in
1657 * extent format...
1658 */
1659 if (tip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1660 if (XFS_IFORK_BOFF(ip) &&
1661 XFS_BMAP_BMDR_SPACE(tip->i_df.if_broot) > XFS_IFORK_BOFF(ip))
1662 return -EINVAL;
1663 if (XFS_IFORK_NEXTENTS(tip, XFS_DATA_FORK) <=
1664 XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK))
1665 return -EINVAL;
1666 }
1667
1668 /* Reciprocal target->temp btree format checks */
1669 if (ip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1670 if (XFS_IFORK_BOFF(tip) &&
1671 XFS_BMAP_BMDR_SPACE(ip->i_df.if_broot) > XFS_IFORK_BOFF(tip))
1672 return -EINVAL;
1673 if (XFS_IFORK_NEXTENTS(ip, XFS_DATA_FORK) <=
1674 XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK))
1675 return -EINVAL;
1676 }
1677
1678 return 0;
1679}
1680
1681static int
1682xfs_swap_extent_flush(
1683 struct xfs_inode *ip)
1684{
1685 int error;
1686
1687 error = filemap_write_and_wait(VFS_I(ip)->i_mapping);
1688 if (error)
1689 return error;
1690 truncate_pagecache_range(VFS_I(ip), 0, -1);
1691
1692 /* Verify O_DIRECT for ftmp */
1693 if (VFS_I(ip)->i_mapping->nrpages)
1694 return -EINVAL;
1695 return 0;
1696}
1697
1698int
1699xfs_swap_extents(
1700 xfs_inode_t *ip, /* target inode */
1701 xfs_inode_t *tip, /* tmp inode */
1702 xfs_swapext_t *sxp)
1703{
1704 xfs_mount_t *mp = ip->i_mount;
1705 xfs_trans_t *tp;
1706 xfs_bstat_t *sbp = &sxp->sx_stat;
1707 xfs_ifork_t *tempifp, *ifp, *tifp;
1708 int src_log_flags, target_log_flags;
1709 int error = 0;
1710 int aforkblks = 0;
1711 int taforkblks = 0;
1712 __uint64_t tmp;
1713 int lock_flags;
1714
1715 tempifp = kmem_alloc(sizeof(xfs_ifork_t), KM_MAYFAIL);
1716 if (!tempifp) {
1717 error = -ENOMEM;
1718 goto out;
1719 }
1720
1721 /*
1722 * Lock the inodes against other IO, page faults and truncate to
1723 * begin with. Then we can ensure the inodes are flushed and have no
1724 * page cache safely. Once we have done this we can take the ilocks and
1725 * do the rest of the checks.
1726 */
1727 lock_flags = XFS_IOLOCK_EXCL | XFS_MMAPLOCK_EXCL;
1728 xfs_lock_two_inodes(ip, tip, XFS_IOLOCK_EXCL);
1729 xfs_lock_two_inodes(ip, tip, XFS_MMAPLOCK_EXCL);
1730
1731 /* Verify that both files have the same format */
1732 if ((VFS_I(ip)->i_mode & S_IFMT) != (VFS_I(tip)->i_mode & S_IFMT)) {
1733 error = -EINVAL;
1734 goto out_unlock;
1735 }
1736
1737 /* Verify both files are either real-time or non-realtime */
1738 if (XFS_IS_REALTIME_INODE(ip) != XFS_IS_REALTIME_INODE(tip)) {
1739 error = -EINVAL;
1740 goto out_unlock;
1741 }
1742
1743 error = xfs_swap_extent_flush(ip);
1744 if (error)
1745 goto out_unlock;
1746 error = xfs_swap_extent_flush(tip);
1747 if (error)
1748 goto out_unlock;
1749
1750 tp = xfs_trans_alloc(mp, XFS_TRANS_SWAPEXT);
1751 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_ichange, 0, 0);
1752 if (error) {
1753 xfs_trans_cancel(tp);
1754 goto out_unlock;
1755 }
1756
1757 /*
1758 * Lock and join the inodes to the tansaction so that transaction commit
1759 * or cancel will unlock the inodes from this point onwards.
1760 */
1761 xfs_lock_two_inodes(ip, tip, XFS_ILOCK_EXCL);
1762 lock_flags |= XFS_ILOCK_EXCL;
1763 xfs_trans_ijoin(tp, ip, lock_flags);
1764 xfs_trans_ijoin(tp, tip, lock_flags);
1765
1766
1767 /* Verify all data are being swapped */
1768 if (sxp->sx_offset != 0 ||
1769 sxp->sx_length != ip->i_d.di_size ||
1770 sxp->sx_length != tip->i_d.di_size) {
1771 error = -EFAULT;
1772 goto out_trans_cancel;
1773 }
1774
1775 trace_xfs_swap_extent_before(ip, 0);
1776 trace_xfs_swap_extent_before(tip, 1);
1777
1778 /* check inode formats now that data is flushed */
1779 error = xfs_swap_extents_check_format(ip, tip);
1780 if (error) {
1781 xfs_notice(mp,
1782 "%s: inode 0x%llx format is incompatible for exchanging.",
1783 __func__, ip->i_ino);
1784 goto out_trans_cancel;
1785 }
1786
1787 /*
1788 * Compare the current change & modify times with that
1789 * passed in. If they differ, we abort this swap.
1790 * This is the mechanism used to ensure the calling
1791 * process that the file was not changed out from
1792 * under it.
1793 */
1794 if ((sbp->bs_ctime.tv_sec != VFS_I(ip)->i_ctime.tv_sec) ||
1795 (sbp->bs_ctime.tv_nsec != VFS_I(ip)->i_ctime.tv_nsec) ||
1796 (sbp->bs_mtime.tv_sec != VFS_I(ip)->i_mtime.tv_sec) ||
1797 (sbp->bs_mtime.tv_nsec != VFS_I(ip)->i_mtime.tv_nsec)) {
1798 error = -EBUSY;
1799 goto out_trans_cancel;
1800 }
1801 /*
1802 * Count the number of extended attribute blocks
1803 */
1804 if ( ((XFS_IFORK_Q(ip) != 0) && (ip->i_d.di_anextents > 0)) &&
1805 (ip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)) {
1806 error = xfs_bmap_count_blocks(tp, ip, XFS_ATTR_FORK, &aforkblks);
1807 if (error)
1808 goto out_trans_cancel;
1809 }
1810 if ( ((XFS_IFORK_Q(tip) != 0) && (tip->i_d.di_anextents > 0)) &&
1811 (tip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)) {
1812 error = xfs_bmap_count_blocks(tp, tip, XFS_ATTR_FORK,
1813 &taforkblks);
1814 if (error)
1815 goto out_trans_cancel;
1816 }
1817
1818 /*
1819 * Before we've swapped the forks, lets set the owners of the forks
1820 * appropriately. We have to do this as we are demand paging the btree
1821 * buffers, and so the validation done on read will expect the owner
1822 * field to be correctly set. Once we change the owners, we can swap the
1823 * inode forks.
1824 *
1825 * Note the trickiness in setting the log flags - we set the owner log
1826 * flag on the opposite inode (i.e. the inode we are setting the new
1827 * owner to be) because once we swap the forks and log that, log
1828 * recovery is going to see the fork as owned by the swapped inode,
1829 * not the pre-swapped inodes.
1830 */
1831 src_log_flags = XFS_ILOG_CORE;
1832 target_log_flags = XFS_ILOG_CORE;
1833 if (ip->i_d.di_version == 3 &&
1834 ip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1835 target_log_flags |= XFS_ILOG_DOWNER;
1836 error = xfs_bmbt_change_owner(tp, ip, XFS_DATA_FORK,
1837 tip->i_ino, NULL);
1838 if (error)
1839 goto out_trans_cancel;
1840 }
1841
1842 if (tip->i_d.di_version == 3 &&
1843 tip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1844 src_log_flags |= XFS_ILOG_DOWNER;
1845 error = xfs_bmbt_change_owner(tp, tip, XFS_DATA_FORK,
1846 ip->i_ino, NULL);
1847 if (error)
1848 goto out_trans_cancel;
1849 }
1850
1851 /*
1852 * Swap the data forks of the inodes
1853 */
1854 ifp = &ip->i_df;
1855 tifp = &tip->i_df;
1856 *tempifp = *ifp; /* struct copy */
1857 *ifp = *tifp; /* struct copy */
1858 *tifp = *tempifp; /* struct copy */
1859
1860 /*
1861 * Fix the on-disk inode values
1862 */
1863 tmp = (__uint64_t)ip->i_d.di_nblocks;
1864 ip->i_d.di_nblocks = tip->i_d.di_nblocks - taforkblks + aforkblks;
1865 tip->i_d.di_nblocks = tmp + taforkblks - aforkblks;
1866
1867 tmp = (__uint64_t) ip->i_d.di_nextents;
1868 ip->i_d.di_nextents = tip->i_d.di_nextents;
1869 tip->i_d.di_nextents = tmp;
1870
1871 tmp = (__uint64_t) ip->i_d.di_format;
1872 ip->i_d.di_format = tip->i_d.di_format;
1873 tip->i_d.di_format = tmp;
1874
1875 /*
1876 * The extents in the source inode could still contain speculative
1877 * preallocation beyond EOF (e.g. the file is open but not modified
1878 * while defrag is in progress). In that case, we need to copy over the
1879 * number of delalloc blocks the data fork in the source inode is
1880 * tracking beyond EOF so that when the fork is truncated away when the
1881 * temporary inode is unlinked we don't underrun the i_delayed_blks
1882 * counter on that inode.
1883 */
1884 ASSERT(tip->i_delayed_blks == 0);
1885 tip->i_delayed_blks = ip->i_delayed_blks;
1886 ip->i_delayed_blks = 0;
1887
1888 switch (ip->i_d.di_format) {
1889 case XFS_DINODE_FMT_EXTENTS:
1890 /* If the extents fit in the inode, fix the
1891 * pointer. Otherwise it's already NULL or
1892 * pointing to the extent.
1893 */
1894 if (ip->i_d.di_nextents <= XFS_INLINE_EXTS) {
1895 ifp->if_u1.if_extents =
1896 ifp->if_u2.if_inline_ext;
1897 }
1898 src_log_flags |= XFS_ILOG_DEXT;
1899 break;
1900 case XFS_DINODE_FMT_BTREE:
1901 ASSERT(ip->i_d.di_version < 3 ||
1902 (src_log_flags & XFS_ILOG_DOWNER));
1903 src_log_flags |= XFS_ILOG_DBROOT;
1904 break;
1905 }
1906
1907 switch (tip->i_d.di_format) {
1908 case XFS_DINODE_FMT_EXTENTS:
1909 /* If the extents fit in the inode, fix the
1910 * pointer. Otherwise it's already NULL or
1911 * pointing to the extent.
1912 */
1913 if (tip->i_d.di_nextents <= XFS_INLINE_EXTS) {
1914 tifp->if_u1.if_extents =
1915 tifp->if_u2.if_inline_ext;
1916 }
1917 target_log_flags |= XFS_ILOG_DEXT;
1918 break;
1919 case XFS_DINODE_FMT_BTREE:
1920 target_log_flags |= XFS_ILOG_DBROOT;
1921 ASSERT(tip->i_d.di_version < 3 ||
1922 (target_log_flags & XFS_ILOG_DOWNER));
1923 break;
1924 }
1925
1926 xfs_trans_log_inode(tp, ip, src_log_flags);
1927 xfs_trans_log_inode(tp, tip, target_log_flags);
1928
1929 /*
1930 * If this is a synchronous mount, make sure that the
1931 * transaction goes to disk before returning to the user.
1932 */
1933 if (mp->m_flags & XFS_MOUNT_WSYNC)
1934 xfs_trans_set_sync(tp);
1935
1936 error = xfs_trans_commit(tp);
1937
1938 trace_xfs_swap_extent_after(ip, 0);
1939 trace_xfs_swap_extent_after(tip, 1);
1940out:
1941 kmem_free(tempifp);
1942 return error;
1943
1944out_unlock:
1945 xfs_iunlock(ip, lock_flags);
1946 xfs_iunlock(tip, lock_flags);
1947 goto out;
1948
1949out_trans_cancel:
1950 xfs_trans_cancel(tp);
1951 goto out;
1952}