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