Linux 3.12.5
[linux/fpc-iii.git] / fs / xfs / xfs_bmap_util.c
blob97f952caea74bd8311a3269ca7520e87b01fcb18
1 /*
2 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
3 * Copyright (c) 2012 Red Hat, Inc.
4 * All Rights Reserved.
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.
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.
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
19 #include "xfs.h"
20 #include "xfs_fs.h"
21 #include "xfs_format.h"
22 #include "xfs_bit.h"
23 #include "xfs_log.h"
24 #include "xfs_inum.h"
25 #include "xfs_trans.h"
26 #include "xfs_sb.h"
27 #include "xfs_ag.h"
28 #include "xfs_mount.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dinode.h"
34 #include "xfs_inode.h"
35 #include "xfs_btree.h"
36 #include "xfs_extfree_item.h"
37 #include "xfs_alloc.h"
38 #include "xfs_bmap.h"
39 #include "xfs_bmap_util.h"
40 #include "xfs_rtalloc.h"
41 #include "xfs_error.h"
42 #include "xfs_quota.h"
43 #include "xfs_trans_space.h"
44 #include "xfs_trace.h"
45 #include "xfs_icache.h"
47 /* Kernel only BMAP related definitions and functions */
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.
54 xfs_daddr_t
55 xfs_fsb_to_db(struct xfs_inode *ip, xfs_fsblock_t fsb)
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)));
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.
68 * Return 1 if the given transaction was committed and a new one
69 * started, and 0 otherwise in the committed parameter.
71 int /* error */
72 xfs_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 */
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 */
86 ASSERT((*tp)->t_flags & XFS_TRANS_PERM_LOG_RES);
87 if (flist->xbf_count == 0) {
88 *committed = 0;
89 return 0;
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);
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;
105 * We have a new transaction, so we should return committed=1,
106 * even though we're returning an error.
108 if (error)
109 return error;
112 * transaction commit worked ok so we can drop the extra ticket
113 * reference that we gained in xfs_trans_dup()
115 xfs_log_ticket_put(ntp->t_ticket);
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))) {
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.
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;
141 xfs_trans_log_efd_extent(ntp, efd, free->xbfi_startblock,
142 free->xbfi_blockcount);
143 xfs_bmap_del_free(flist, NULL, free);
145 return 0;
149 xfs_bmap_rtalloc(
150 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
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;
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);
172 * If the offset & length are not perfectly aligned
173 * then kill prod, it will just get us in trouble.
175 if (do_mod(ap->offset, align) || ap->length % align)
176 prod = 1;
178 * Set ralen to be the actual requested length in rtextents.
180 ralen = ap->length / mp->m_sb.sb_rextsize;
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.
188 if (ralen * mp->m_sb.sb_rextsize >= MAXEXTLEN)
189 ralen = MAXEXTLEN / mp->m_sb.sb_rextsize;
192 * Lock out other modifications to the RT bitmap inode.
194 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
195 xfs_trans_ijoin(ap->tp, mp->m_rbmip, XFS_ILOCK_EXCL);
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.
201 if (ap->eof && ap->offset == 0) {
202 xfs_rtblock_t uninitialized_var(rtx); /* realtime extent no */
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;
212 xfs_bmap_adjacent(ap);
215 * Realtime allocation, done through xfs_rtallocate_extent.
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;
239 * Adjust the disk quota also. This was reserved
240 * earlier.
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;
248 return 0;
252 * Stack switching interfaces for allocation
254 static void
255 xfs_bmapi_allocate_worker(
256 struct work_struct *work)
258 struct xfs_bmalloca *args = container_of(work,
259 struct xfs_bmalloca, work);
260 unsigned long pflags;
262 /* we are in a transaction context here */
263 current_set_flags_nested(&pflags, PF_FSTRANS);
265 args->result = __xfs_bmapi_allocate(args);
266 complete(args->done);
268 current_restore_flags_nested(&pflags, PF_FSTRANS);
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.
277 xfs_bmapi_allocate(
278 struct xfs_bmalloca *args)
280 DECLARE_COMPLETION_ONSTACK(done);
282 if (!args->stack_switch)
283 return __xfs_bmapi_allocate(args);
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 return args->result;
294 * Check if the endoff is outside the last extent. If so the caller will grow
295 * the allocation to a stripe unit boundary. All offsets are considered outside
296 * the end of file for an empty fork, so 1 is returned in *eof in that case.
299 xfs_bmap_eof(
300 struct xfs_inode *ip,
301 xfs_fileoff_t endoff,
302 int whichfork,
303 int *eof)
305 struct xfs_bmbt_irec rec;
306 int error;
308 error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, eof);
309 if (error || *eof)
310 return error;
312 *eof = endoff >= rec.br_startoff + rec.br_blockcount;
313 return 0;
317 * Extent tree block counting routines.
321 * Count leaf blocks given a range of extent records.
323 STATIC void
324 xfs_bmap_count_leaves(
325 xfs_ifork_t *ifp,
326 xfs_extnum_t idx,
327 int numrecs,
328 int *count)
330 int b;
332 for (b = 0; b < numrecs; b++) {
333 xfs_bmbt_rec_host_t *frp = xfs_iext_get_ext(ifp, idx + b);
334 *count += xfs_bmbt_get_blockcount(frp);
339 * Count leaf blocks given a range of extent records originally
340 * in btree format.
342 STATIC void
343 xfs_bmap_disk_count_leaves(
344 struct xfs_mount *mp,
345 struct xfs_btree_block *block,
346 int numrecs,
347 int *count)
349 int b;
350 xfs_bmbt_rec_t *frp;
352 for (b = 1; b <= numrecs; b++) {
353 frp = XFS_BMBT_REC_ADDR(mp, block, b);
354 *count += xfs_bmbt_disk_get_blockcount(frp);
359 * Recursively walks each level of a btree
360 * to count total fsblocks in use.
362 STATIC int /* error */
363 xfs_bmap_count_tree(
364 xfs_mount_t *mp, /* file system mount point */
365 xfs_trans_t *tp, /* transaction pointer */
366 xfs_ifork_t *ifp, /* inode fork pointer */
367 xfs_fsblock_t blockno, /* file system block number */
368 int levelin, /* level in btree */
369 int *count) /* Count of blocks */
371 int error;
372 xfs_buf_t *bp, *nbp;
373 int level = levelin;
374 __be64 *pp;
375 xfs_fsblock_t bno = blockno;
376 xfs_fsblock_t nextbno;
377 struct xfs_btree_block *block, *nextblock;
378 int numrecs;
380 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, XFS_BMAP_BTREE_REF,
381 &xfs_bmbt_buf_ops);
382 if (error)
383 return error;
384 *count += 1;
385 block = XFS_BUF_TO_BLOCK(bp);
387 if (--level) {
388 /* Not at node above leaves, count this level of nodes */
389 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
390 while (nextbno != NULLFSBLOCK) {
391 error = xfs_btree_read_bufl(mp, tp, nextbno, 0, &nbp,
392 XFS_BMAP_BTREE_REF,
393 &xfs_bmbt_buf_ops);
394 if (error)
395 return error;
396 *count += 1;
397 nextblock = XFS_BUF_TO_BLOCK(nbp);
398 nextbno = be64_to_cpu(nextblock->bb_u.l.bb_rightsib);
399 xfs_trans_brelse(tp, nbp);
402 /* Dive to the next level */
403 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
404 bno = be64_to_cpu(*pp);
405 if (unlikely((error =
406 xfs_bmap_count_tree(mp, tp, ifp, bno, level, count)) < 0)) {
407 xfs_trans_brelse(tp, bp);
408 XFS_ERROR_REPORT("xfs_bmap_count_tree(1)",
409 XFS_ERRLEVEL_LOW, mp);
410 return XFS_ERROR(EFSCORRUPTED);
412 xfs_trans_brelse(tp, bp);
413 } else {
414 /* count all level 1 nodes and their leaves */
415 for (;;) {
416 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
417 numrecs = be16_to_cpu(block->bb_numrecs);
418 xfs_bmap_disk_count_leaves(mp, block, numrecs, count);
419 xfs_trans_brelse(tp, bp);
420 if (nextbno == NULLFSBLOCK)
421 break;
422 bno = nextbno;
423 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
424 XFS_BMAP_BTREE_REF,
425 &xfs_bmbt_buf_ops);
426 if (error)
427 return error;
428 *count += 1;
429 block = XFS_BUF_TO_BLOCK(bp);
432 return 0;
436 * Count fsblocks of the given fork.
438 int /* error */
439 xfs_bmap_count_blocks(
440 xfs_trans_t *tp, /* transaction pointer */
441 xfs_inode_t *ip, /* incore inode */
442 int whichfork, /* data or attr fork */
443 int *count) /* out: count of blocks */
445 struct xfs_btree_block *block; /* current btree block */
446 xfs_fsblock_t bno; /* block # of "block" */
447 xfs_ifork_t *ifp; /* fork structure */
448 int level; /* btree level, for checking */
449 xfs_mount_t *mp; /* file system mount structure */
450 __be64 *pp; /* pointer to block address */
452 bno = NULLFSBLOCK;
453 mp = ip->i_mount;
454 ifp = XFS_IFORK_PTR(ip, whichfork);
455 if ( XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS ) {
456 xfs_bmap_count_leaves(ifp, 0,
457 ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t),
458 count);
459 return 0;
463 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
465 block = ifp->if_broot;
466 level = be16_to_cpu(block->bb_level);
467 ASSERT(level > 0);
468 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
469 bno = be64_to_cpu(*pp);
470 ASSERT(bno != NULLDFSBNO);
471 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
472 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
474 if (unlikely(xfs_bmap_count_tree(mp, tp, ifp, bno, level, count) < 0)) {
475 XFS_ERROR_REPORT("xfs_bmap_count_blocks(2)", XFS_ERRLEVEL_LOW,
476 mp);
477 return XFS_ERROR(EFSCORRUPTED);
480 return 0;
484 * returns 1 for success, 0 if we failed to map the extent.
486 STATIC int
487 xfs_getbmapx_fix_eof_hole(
488 xfs_inode_t *ip, /* xfs incore inode pointer */
489 struct getbmapx *out, /* output structure */
490 int prealloced, /* this is a file with
491 * preallocated data space */
492 __int64_t end, /* last block requested */
493 xfs_fsblock_t startblock)
495 __int64_t fixlen;
496 xfs_mount_t *mp; /* file system mount point */
497 xfs_ifork_t *ifp; /* inode fork pointer */
498 xfs_extnum_t lastx; /* last extent pointer */
499 xfs_fileoff_t fileblock;
501 if (startblock == HOLESTARTBLOCK) {
502 mp = ip->i_mount;
503 out->bmv_block = -1;
504 fixlen = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, XFS_ISIZE(ip)));
505 fixlen -= out->bmv_offset;
506 if (prealloced && out->bmv_offset + out->bmv_length == end) {
507 /* Came to hole at EOF. Trim it. */
508 if (fixlen <= 0)
509 return 0;
510 out->bmv_length = fixlen;
512 } else {
513 if (startblock == DELAYSTARTBLOCK)
514 out->bmv_block = -2;
515 else
516 out->bmv_block = xfs_fsb_to_db(ip, startblock);
517 fileblock = XFS_BB_TO_FSB(ip->i_mount, out->bmv_offset);
518 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
519 if (xfs_iext_bno_to_ext(ifp, fileblock, &lastx) &&
520 (lastx == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))-1))
521 out->bmv_oflags |= BMV_OF_LAST;
524 return 1;
528 * Get inode's extents as described in bmv, and format for output.
529 * Calls formatter to fill the user's buffer until all extents
530 * are mapped, until the passed-in bmv->bmv_count slots have
531 * been filled, or until the formatter short-circuits the loop,
532 * if it is tracking filled-in extents on its own.
534 int /* error code */
535 xfs_getbmap(
536 xfs_inode_t *ip,
537 struct getbmapx *bmv, /* user bmap structure */
538 xfs_bmap_format_t formatter, /* format to user */
539 void *arg) /* formatter arg */
541 __int64_t bmvend; /* last block requested */
542 int error = 0; /* return value */
543 __int64_t fixlen; /* length for -1 case */
544 int i; /* extent number */
545 int lock; /* lock state */
546 xfs_bmbt_irec_t *map; /* buffer for user's data */
547 xfs_mount_t *mp; /* file system mount point */
548 int nex; /* # of user extents can do */
549 int nexleft; /* # of user extents left */
550 int subnex; /* # of bmapi's can do */
551 int nmap; /* number of map entries */
552 struct getbmapx *out; /* output structure */
553 int whichfork; /* data or attr fork */
554 int prealloced; /* this is a file with
555 * preallocated data space */
556 int iflags; /* interface flags */
557 int bmapi_flags; /* flags for xfs_bmapi */
558 int cur_ext = 0;
560 mp = ip->i_mount;
561 iflags = bmv->bmv_iflags;
562 whichfork = iflags & BMV_IF_ATTRFORK ? XFS_ATTR_FORK : XFS_DATA_FORK;
564 if (whichfork == XFS_ATTR_FORK) {
565 if (XFS_IFORK_Q(ip)) {
566 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS &&
567 ip->i_d.di_aformat != XFS_DINODE_FMT_BTREE &&
568 ip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)
569 return XFS_ERROR(EINVAL);
570 } else if (unlikely(
571 ip->i_d.di_aformat != 0 &&
572 ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS)) {
573 XFS_ERROR_REPORT("xfs_getbmap", XFS_ERRLEVEL_LOW,
574 ip->i_mount);
575 return XFS_ERROR(EFSCORRUPTED);
578 prealloced = 0;
579 fixlen = 1LL << 32;
580 } else {
581 if (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS &&
582 ip->i_d.di_format != XFS_DINODE_FMT_BTREE &&
583 ip->i_d.di_format != XFS_DINODE_FMT_LOCAL)
584 return XFS_ERROR(EINVAL);
586 if (xfs_get_extsz_hint(ip) ||
587 ip->i_d.di_flags & (XFS_DIFLAG_PREALLOC|XFS_DIFLAG_APPEND)){
588 prealloced = 1;
589 fixlen = mp->m_super->s_maxbytes;
590 } else {
591 prealloced = 0;
592 fixlen = XFS_ISIZE(ip);
596 if (bmv->bmv_length == -1) {
597 fixlen = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, fixlen));
598 bmv->bmv_length =
599 max_t(__int64_t, fixlen - bmv->bmv_offset, 0);
600 } else if (bmv->bmv_length == 0) {
601 bmv->bmv_entries = 0;
602 return 0;
603 } else if (bmv->bmv_length < 0) {
604 return XFS_ERROR(EINVAL);
607 nex = bmv->bmv_count - 1;
608 if (nex <= 0)
609 return XFS_ERROR(EINVAL);
610 bmvend = bmv->bmv_offset + bmv->bmv_length;
613 if (bmv->bmv_count > ULONG_MAX / sizeof(struct getbmapx))
614 return XFS_ERROR(ENOMEM);
615 out = kmem_zalloc_large(bmv->bmv_count * sizeof(struct getbmapx), 0);
616 if (!out)
617 return XFS_ERROR(ENOMEM);
619 xfs_ilock(ip, XFS_IOLOCK_SHARED);
620 if (whichfork == XFS_DATA_FORK && !(iflags & BMV_IF_DELALLOC)) {
621 if (ip->i_delayed_blks || XFS_ISIZE(ip) > ip->i_d.di_size) {
622 error = -filemap_write_and_wait(VFS_I(ip)->i_mapping);
623 if (error)
624 goto out_unlock_iolock;
627 * even after flushing the inode, there can still be delalloc
628 * blocks on the inode beyond EOF due to speculative
629 * preallocation. These are not removed until the release
630 * function is called or the inode is inactivated. Hence we
631 * cannot assert here that ip->i_delayed_blks == 0.
635 lock = xfs_ilock_map_shared(ip);
638 * Don't let nex be bigger than the number of extents
639 * we can have assuming alternating holes and real extents.
641 if (nex > XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1)
642 nex = XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1;
644 bmapi_flags = xfs_bmapi_aflag(whichfork);
645 if (!(iflags & BMV_IF_PREALLOC))
646 bmapi_flags |= XFS_BMAPI_IGSTATE;
649 * Allocate enough space to handle "subnex" maps at a time.
651 error = ENOMEM;
652 subnex = 16;
653 map = kmem_alloc(subnex * sizeof(*map), KM_MAYFAIL | KM_NOFS);
654 if (!map)
655 goto out_unlock_ilock;
657 bmv->bmv_entries = 0;
659 if (XFS_IFORK_NEXTENTS(ip, whichfork) == 0 &&
660 (whichfork == XFS_ATTR_FORK || !(iflags & BMV_IF_DELALLOC))) {
661 error = 0;
662 goto out_free_map;
665 nexleft = nex;
667 do {
668 nmap = (nexleft > subnex) ? subnex : nexleft;
669 error = xfs_bmapi_read(ip, XFS_BB_TO_FSBT(mp, bmv->bmv_offset),
670 XFS_BB_TO_FSB(mp, bmv->bmv_length),
671 map, &nmap, bmapi_flags);
672 if (error)
673 goto out_free_map;
674 ASSERT(nmap <= subnex);
676 for (i = 0; i < nmap && nexleft && bmv->bmv_length; i++) {
677 out[cur_ext].bmv_oflags = 0;
678 if (map[i].br_state == XFS_EXT_UNWRITTEN)
679 out[cur_ext].bmv_oflags |= BMV_OF_PREALLOC;
680 else if (map[i].br_startblock == DELAYSTARTBLOCK)
681 out[cur_ext].bmv_oflags |= BMV_OF_DELALLOC;
682 out[cur_ext].bmv_offset =
683 XFS_FSB_TO_BB(mp, map[i].br_startoff);
684 out[cur_ext].bmv_length =
685 XFS_FSB_TO_BB(mp, map[i].br_blockcount);
686 out[cur_ext].bmv_unused1 = 0;
687 out[cur_ext].bmv_unused2 = 0;
690 * delayed allocation extents that start beyond EOF can
691 * occur due to speculative EOF allocation when the
692 * delalloc extent is larger than the largest freespace
693 * extent at conversion time. These extents cannot be
694 * converted by data writeback, so can exist here even
695 * if we are not supposed to be finding delalloc
696 * extents.
698 if (map[i].br_startblock == DELAYSTARTBLOCK &&
699 map[i].br_startoff <= XFS_B_TO_FSB(mp, XFS_ISIZE(ip)))
700 ASSERT((iflags & BMV_IF_DELALLOC) != 0);
702 if (map[i].br_startblock == HOLESTARTBLOCK &&
703 whichfork == XFS_ATTR_FORK) {
704 /* came to the end of attribute fork */
705 out[cur_ext].bmv_oflags |= BMV_OF_LAST;
706 goto out_free_map;
709 if (!xfs_getbmapx_fix_eof_hole(ip, &out[cur_ext],
710 prealloced, bmvend,
711 map[i].br_startblock))
712 goto out_free_map;
714 bmv->bmv_offset =
715 out[cur_ext].bmv_offset +
716 out[cur_ext].bmv_length;
717 bmv->bmv_length =
718 max_t(__int64_t, 0, bmvend - bmv->bmv_offset);
721 * In case we don't want to return the hole,
722 * don't increase cur_ext so that we can reuse
723 * it in the next loop.
725 if ((iflags & BMV_IF_NO_HOLES) &&
726 map[i].br_startblock == HOLESTARTBLOCK) {
727 memset(&out[cur_ext], 0, sizeof(out[cur_ext]));
728 continue;
731 nexleft--;
732 bmv->bmv_entries++;
733 cur_ext++;
735 } while (nmap && nexleft && bmv->bmv_length);
737 out_free_map:
738 kmem_free(map);
739 out_unlock_ilock:
740 xfs_iunlock_map_shared(ip, lock);
741 out_unlock_iolock:
742 xfs_iunlock(ip, XFS_IOLOCK_SHARED);
744 for (i = 0; i < cur_ext; i++) {
745 int full = 0; /* user array is full */
747 /* format results & advance arg */
748 error = formatter(&arg, &out[i], &full);
749 if (error || full)
750 break;
753 kmem_free(out);
754 return error;
758 * dead simple method of punching delalyed allocation blocks from a range in
759 * the inode. Walks a block at a time so will be slow, but is only executed in
760 * rare error cases so the overhead is not critical. This will always punch out
761 * both the start and end blocks, even if the ranges only partially overlap
762 * them, so it is up to the caller to ensure that partial blocks are not
763 * passed in.
766 xfs_bmap_punch_delalloc_range(
767 struct xfs_inode *ip,
768 xfs_fileoff_t start_fsb,
769 xfs_fileoff_t length)
771 xfs_fileoff_t remaining = length;
772 int error = 0;
774 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
776 do {
777 int done;
778 xfs_bmbt_irec_t imap;
779 int nimaps = 1;
780 xfs_fsblock_t firstblock;
781 xfs_bmap_free_t flist;
784 * Map the range first and check that it is a delalloc extent
785 * before trying to unmap the range. Otherwise we will be
786 * trying to remove a real extent (which requires a
787 * transaction) or a hole, which is probably a bad idea...
789 error = xfs_bmapi_read(ip, start_fsb, 1, &imap, &nimaps,
790 XFS_BMAPI_ENTIRE);
792 if (error) {
793 /* something screwed, just bail */
794 if (!XFS_FORCED_SHUTDOWN(ip->i_mount)) {
795 xfs_alert(ip->i_mount,
796 "Failed delalloc mapping lookup ino %lld fsb %lld.",
797 ip->i_ino, start_fsb);
799 break;
801 if (!nimaps) {
802 /* nothing there */
803 goto next_block;
805 if (imap.br_startblock != DELAYSTARTBLOCK) {
806 /* been converted, ignore */
807 goto next_block;
809 WARN_ON(imap.br_blockcount == 0);
812 * Note: while we initialise the firstblock/flist pair, they
813 * should never be used because blocks should never be
814 * allocated or freed for a delalloc extent and hence we need
815 * don't cancel or finish them after the xfs_bunmapi() call.
817 xfs_bmap_init(&flist, &firstblock);
818 error = xfs_bunmapi(NULL, ip, start_fsb, 1, 0, 1, &firstblock,
819 &flist, &done);
820 if (error)
821 break;
823 ASSERT(!flist.xbf_count && !flist.xbf_first);
824 next_block:
825 start_fsb++;
826 remaining--;
827 } while(remaining > 0);
829 return error;
833 * Test whether it is appropriate to check an inode for and free post EOF
834 * blocks. The 'force' parameter determines whether we should also consider
835 * regular files that are marked preallocated or append-only.
837 bool
838 xfs_can_free_eofblocks(struct xfs_inode *ip, bool force)
840 /* prealloc/delalloc exists only on regular files */
841 if (!S_ISREG(ip->i_d.di_mode))
842 return false;
845 * Zero sized files with no cached pages and delalloc blocks will not
846 * have speculative prealloc/delalloc blocks to remove.
848 if (VFS_I(ip)->i_size == 0 &&
849 VN_CACHED(VFS_I(ip)) == 0 &&
850 ip->i_delayed_blks == 0)
851 return false;
853 /* If we haven't read in the extent list, then don't do it now. */
854 if (!(ip->i_df.if_flags & XFS_IFEXTENTS))
855 return false;
858 * Do not free real preallocated or append-only files unless the file
859 * has delalloc blocks and we are forced to remove them.
861 if (ip->i_d.di_flags & (XFS_DIFLAG_PREALLOC | XFS_DIFLAG_APPEND))
862 if (!force || ip->i_delayed_blks == 0)
863 return false;
865 return true;
869 * This is called by xfs_inactive to free any blocks beyond eof
870 * when the link count isn't zero and by xfs_dm_punch_hole() when
871 * punching a hole to EOF.
874 xfs_free_eofblocks(
875 xfs_mount_t *mp,
876 xfs_inode_t *ip,
877 bool need_iolock)
879 xfs_trans_t *tp;
880 int error;
881 xfs_fileoff_t end_fsb;
882 xfs_fileoff_t last_fsb;
883 xfs_filblks_t map_len;
884 int nimaps;
885 xfs_bmbt_irec_t imap;
888 * Figure out if there are any blocks beyond the end
889 * of the file. If not, then there is nothing to do.
891 end_fsb = XFS_B_TO_FSB(mp, (xfs_ufsize_t)XFS_ISIZE(ip));
892 last_fsb = XFS_B_TO_FSB(mp, mp->m_super->s_maxbytes);
893 if (last_fsb <= end_fsb)
894 return 0;
895 map_len = last_fsb - end_fsb;
897 nimaps = 1;
898 xfs_ilock(ip, XFS_ILOCK_SHARED);
899 error = xfs_bmapi_read(ip, end_fsb, map_len, &imap, &nimaps, 0);
900 xfs_iunlock(ip, XFS_ILOCK_SHARED);
902 if (!error && (nimaps != 0) &&
903 (imap.br_startblock != HOLESTARTBLOCK ||
904 ip->i_delayed_blks)) {
906 * Attach the dquots to the inode up front.
908 error = xfs_qm_dqattach(ip, 0);
909 if (error)
910 return error;
913 * There are blocks after the end of file.
914 * Free them up now by truncating the file to
915 * its current size.
917 tp = xfs_trans_alloc(mp, XFS_TRANS_INACTIVE);
919 if (need_iolock) {
920 if (!xfs_ilock_nowait(ip, XFS_IOLOCK_EXCL)) {
921 xfs_trans_cancel(tp, 0);
922 return EAGAIN;
926 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_itruncate, 0, 0);
927 if (error) {
928 ASSERT(XFS_FORCED_SHUTDOWN(mp));
929 xfs_trans_cancel(tp, 0);
930 if (need_iolock)
931 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
932 return error;
935 xfs_ilock(ip, XFS_ILOCK_EXCL);
936 xfs_trans_ijoin(tp, ip, 0);
939 * Do not update the on-disk file size. If we update the
940 * on-disk file size and then the system crashes before the
941 * contents of the file are flushed to disk then the files
942 * may be full of holes (ie NULL files bug).
944 error = xfs_itruncate_extents(&tp, ip, XFS_DATA_FORK,
945 XFS_ISIZE(ip));
946 if (error) {
948 * If we get an error at this point we simply don't
949 * bother truncating the file.
951 xfs_trans_cancel(tp,
952 (XFS_TRANS_RELEASE_LOG_RES |
953 XFS_TRANS_ABORT));
954 } else {
955 error = xfs_trans_commit(tp,
956 XFS_TRANS_RELEASE_LOG_RES);
957 if (!error)
958 xfs_inode_clear_eofblocks_tag(ip);
961 xfs_iunlock(ip, XFS_ILOCK_EXCL);
962 if (need_iolock)
963 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
965 return error;
969 * xfs_alloc_file_space()
970 * This routine allocates disk space for the given file.
972 * If alloc_type == 0, this request is for an ALLOCSP type
973 * request which will change the file size. In this case, no
974 * DMAPI event will be generated by the call. A TRUNCATE event
975 * will be generated later by xfs_setattr.
977 * If alloc_type != 0, this request is for a RESVSP type
978 * request, and a DMAPI DM_EVENT_WRITE will be generated if the
979 * lower block boundary byte address is less than the file's
980 * length.
982 * RETURNS:
983 * 0 on success
984 * errno on error
987 STATIC int
988 xfs_alloc_file_space(
989 xfs_inode_t *ip,
990 xfs_off_t offset,
991 xfs_off_t len,
992 int alloc_type,
993 int attr_flags)
995 xfs_mount_t *mp = ip->i_mount;
996 xfs_off_t count;
997 xfs_filblks_t allocated_fsb;
998 xfs_filblks_t allocatesize_fsb;
999 xfs_extlen_t extsz, temp;
1000 xfs_fileoff_t startoffset_fsb;
1001 xfs_fsblock_t firstfsb;
1002 int nimaps;
1003 int quota_flag;
1004 int rt;
1005 xfs_trans_t *tp;
1006 xfs_bmbt_irec_t imaps[1], *imapp;
1007 xfs_bmap_free_t free_list;
1008 uint qblocks, resblks, resrtextents;
1009 int committed;
1010 int error;
1012 trace_xfs_alloc_file_space(ip);
1014 if (XFS_FORCED_SHUTDOWN(mp))
1015 return XFS_ERROR(EIO);
1017 error = xfs_qm_dqattach(ip, 0);
1018 if (error)
1019 return error;
1021 if (len <= 0)
1022 return XFS_ERROR(EINVAL);
1024 rt = XFS_IS_REALTIME_INODE(ip);
1025 extsz = xfs_get_extsz_hint(ip);
1027 count = len;
1028 imapp = &imaps[0];
1029 nimaps = 1;
1030 startoffset_fsb = XFS_B_TO_FSBT(mp, offset);
1031 allocatesize_fsb = XFS_B_TO_FSB(mp, count);
1034 * Allocate file space until done or until there is an error
1036 while (allocatesize_fsb && !error) {
1037 xfs_fileoff_t s, e;
1040 * Determine space reservations for data/realtime.
1042 if (unlikely(extsz)) {
1043 s = startoffset_fsb;
1044 do_div(s, extsz);
1045 s *= extsz;
1046 e = startoffset_fsb + allocatesize_fsb;
1047 if ((temp = do_mod(startoffset_fsb, extsz)))
1048 e += temp;
1049 if ((temp = do_mod(e, extsz)))
1050 e += extsz - temp;
1051 } else {
1052 s = 0;
1053 e = allocatesize_fsb;
1057 * The transaction reservation is limited to a 32-bit block
1058 * count, hence we need to limit the number of blocks we are
1059 * trying to reserve to avoid an overflow. We can't allocate
1060 * more than @nimaps extents, and an extent is limited on disk
1061 * to MAXEXTLEN (21 bits), so use that to enforce the limit.
1063 resblks = min_t(xfs_fileoff_t, (e - s), (MAXEXTLEN * nimaps));
1064 if (unlikely(rt)) {
1065 resrtextents = qblocks = resblks;
1066 resrtextents /= mp->m_sb.sb_rextsize;
1067 resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0);
1068 quota_flag = XFS_QMOPT_RES_RTBLKS;
1069 } else {
1070 resrtextents = 0;
1071 resblks = qblocks = XFS_DIOSTRAT_SPACE_RES(mp, resblks);
1072 quota_flag = XFS_QMOPT_RES_REGBLKS;
1076 * Allocate and setup the transaction.
1078 tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT);
1079 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write,
1080 resblks, resrtextents);
1082 * Check for running out of space
1084 if (error) {
1086 * Free the transaction structure.
1088 ASSERT(error == ENOSPC || XFS_FORCED_SHUTDOWN(mp));
1089 xfs_trans_cancel(tp, 0);
1090 break;
1092 xfs_ilock(ip, XFS_ILOCK_EXCL);
1093 error = xfs_trans_reserve_quota_nblks(tp, ip, qblocks,
1094 0, quota_flag);
1095 if (error)
1096 goto error1;
1098 xfs_trans_ijoin(tp, ip, 0);
1100 xfs_bmap_init(&free_list, &firstfsb);
1101 error = xfs_bmapi_write(tp, ip, startoffset_fsb,
1102 allocatesize_fsb, alloc_type, &firstfsb,
1103 0, imapp, &nimaps, &free_list);
1104 if (error) {
1105 goto error0;
1109 * Complete the transaction
1111 error = xfs_bmap_finish(&tp, &free_list, &committed);
1112 if (error) {
1113 goto error0;
1116 error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
1117 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1118 if (error) {
1119 break;
1122 allocated_fsb = imapp->br_blockcount;
1124 if (nimaps == 0) {
1125 error = XFS_ERROR(ENOSPC);
1126 break;
1129 startoffset_fsb += allocated_fsb;
1130 allocatesize_fsb -= allocated_fsb;
1133 return error;
1135 error0: /* Cancel bmap, unlock inode, unreserve quota blocks, cancel trans */
1136 xfs_bmap_cancel(&free_list);
1137 xfs_trans_unreserve_quota_nblks(tp, ip, (long)qblocks, 0, quota_flag);
1139 error1: /* Just cancel transaction */
1140 xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES | XFS_TRANS_ABORT);
1141 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1142 return error;
1146 * Zero file bytes between startoff and endoff inclusive.
1147 * The iolock is held exclusive and no blocks are buffered.
1149 * This function is used by xfs_free_file_space() to zero
1150 * partial blocks when the range to free is not block aligned.
1151 * When unreserving space with boundaries that are not block
1152 * aligned we round up the start and round down the end
1153 * boundaries and then use this function to zero the parts of
1154 * the blocks that got dropped during the rounding.
1156 STATIC int
1157 xfs_zero_remaining_bytes(
1158 xfs_inode_t *ip,
1159 xfs_off_t startoff,
1160 xfs_off_t endoff)
1162 xfs_bmbt_irec_t imap;
1163 xfs_fileoff_t offset_fsb;
1164 xfs_off_t lastoffset;
1165 xfs_off_t offset;
1166 xfs_buf_t *bp;
1167 xfs_mount_t *mp = ip->i_mount;
1168 int nimap;
1169 int error = 0;
1172 * Avoid doing I/O beyond eof - it's not necessary
1173 * since nothing can read beyond eof. The space will
1174 * be zeroed when the file is extended anyway.
1176 if (startoff >= XFS_ISIZE(ip))
1177 return 0;
1179 if (endoff > XFS_ISIZE(ip))
1180 endoff = XFS_ISIZE(ip);
1182 bp = xfs_buf_get_uncached(XFS_IS_REALTIME_INODE(ip) ?
1183 mp->m_rtdev_targp : mp->m_ddev_targp,
1184 BTOBB(mp->m_sb.sb_blocksize), 0);
1185 if (!bp)
1186 return XFS_ERROR(ENOMEM);
1188 xfs_buf_unlock(bp);
1190 for (offset = startoff; offset <= endoff; offset = lastoffset + 1) {
1191 offset_fsb = XFS_B_TO_FSBT(mp, offset);
1192 nimap = 1;
1193 error = xfs_bmapi_read(ip, offset_fsb, 1, &imap, &nimap, 0);
1194 if (error || nimap < 1)
1195 break;
1196 ASSERT(imap.br_blockcount >= 1);
1197 ASSERT(imap.br_startoff == offset_fsb);
1198 lastoffset = XFS_FSB_TO_B(mp, imap.br_startoff + 1) - 1;
1199 if (lastoffset > endoff)
1200 lastoffset = endoff;
1201 if (imap.br_startblock == HOLESTARTBLOCK)
1202 continue;
1203 ASSERT(imap.br_startblock != DELAYSTARTBLOCK);
1204 if (imap.br_state == XFS_EXT_UNWRITTEN)
1205 continue;
1206 XFS_BUF_UNDONE(bp);
1207 XFS_BUF_UNWRITE(bp);
1208 XFS_BUF_READ(bp);
1209 XFS_BUF_SET_ADDR(bp, xfs_fsb_to_db(ip, imap.br_startblock));
1210 xfsbdstrat(mp, bp);
1211 error = xfs_buf_iowait(bp);
1212 if (error) {
1213 xfs_buf_ioerror_alert(bp,
1214 "xfs_zero_remaining_bytes(read)");
1215 break;
1217 memset(bp->b_addr +
1218 (offset - XFS_FSB_TO_B(mp, imap.br_startoff)),
1219 0, lastoffset - offset + 1);
1220 XFS_BUF_UNDONE(bp);
1221 XFS_BUF_UNREAD(bp);
1222 XFS_BUF_WRITE(bp);
1223 xfsbdstrat(mp, bp);
1224 error = xfs_buf_iowait(bp);
1225 if (error) {
1226 xfs_buf_ioerror_alert(bp,
1227 "xfs_zero_remaining_bytes(write)");
1228 break;
1231 xfs_buf_free(bp);
1232 return error;
1236 * xfs_free_file_space()
1237 * This routine frees disk space for the given file.
1239 * This routine is only called by xfs_change_file_space
1240 * for an UNRESVSP type call.
1242 * RETURNS:
1243 * 0 on success
1244 * errno on error
1247 STATIC int
1248 xfs_free_file_space(
1249 xfs_inode_t *ip,
1250 xfs_off_t offset,
1251 xfs_off_t len,
1252 int attr_flags)
1254 int committed;
1255 int done;
1256 xfs_fileoff_t endoffset_fsb;
1257 int error;
1258 xfs_fsblock_t firstfsb;
1259 xfs_bmap_free_t free_list;
1260 xfs_bmbt_irec_t imap;
1261 xfs_off_t ioffset;
1262 xfs_extlen_t mod=0;
1263 xfs_mount_t *mp;
1264 int nimap;
1265 uint resblks;
1266 xfs_off_t rounding;
1267 int rt;
1268 xfs_fileoff_t startoffset_fsb;
1269 xfs_trans_t *tp;
1270 int need_iolock = 1;
1272 mp = ip->i_mount;
1274 trace_xfs_free_file_space(ip);
1276 error = xfs_qm_dqattach(ip, 0);
1277 if (error)
1278 return error;
1280 error = 0;
1281 if (len <= 0) /* if nothing being freed */
1282 return error;
1283 rt = XFS_IS_REALTIME_INODE(ip);
1284 startoffset_fsb = XFS_B_TO_FSB(mp, offset);
1285 endoffset_fsb = XFS_B_TO_FSBT(mp, offset + len);
1287 if (attr_flags & XFS_ATTR_NOLOCK)
1288 need_iolock = 0;
1289 if (need_iolock) {
1290 xfs_ilock(ip, XFS_IOLOCK_EXCL);
1291 /* wait for the completion of any pending DIOs */
1292 inode_dio_wait(VFS_I(ip));
1295 rounding = max_t(xfs_off_t, 1 << mp->m_sb.sb_blocklog, PAGE_CACHE_SIZE);
1296 ioffset = offset & ~(rounding - 1);
1297 error = -filemap_write_and_wait_range(VFS_I(ip)->i_mapping,
1298 ioffset, -1);
1299 if (error)
1300 goto out_unlock_iolock;
1301 truncate_pagecache_range(VFS_I(ip), ioffset, -1);
1304 * Need to zero the stuff we're not freeing, on disk.
1305 * If it's a realtime file & can't use unwritten extents then we
1306 * actually need to zero the extent edges. Otherwise xfs_bunmapi
1307 * will take care of it for us.
1309 if (rt && !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
1310 nimap = 1;
1311 error = xfs_bmapi_read(ip, startoffset_fsb, 1,
1312 &imap, &nimap, 0);
1313 if (error)
1314 goto out_unlock_iolock;
1315 ASSERT(nimap == 0 || nimap == 1);
1316 if (nimap && imap.br_startblock != HOLESTARTBLOCK) {
1317 xfs_daddr_t block;
1319 ASSERT(imap.br_startblock != DELAYSTARTBLOCK);
1320 block = imap.br_startblock;
1321 mod = do_div(block, mp->m_sb.sb_rextsize);
1322 if (mod)
1323 startoffset_fsb += mp->m_sb.sb_rextsize - mod;
1325 nimap = 1;
1326 error = xfs_bmapi_read(ip, endoffset_fsb - 1, 1,
1327 &imap, &nimap, 0);
1328 if (error)
1329 goto out_unlock_iolock;
1330 ASSERT(nimap == 0 || nimap == 1);
1331 if (nimap && imap.br_startblock != HOLESTARTBLOCK) {
1332 ASSERT(imap.br_startblock != DELAYSTARTBLOCK);
1333 mod++;
1334 if (mod && (mod != mp->m_sb.sb_rextsize))
1335 endoffset_fsb -= mod;
1338 if ((done = (endoffset_fsb <= startoffset_fsb)))
1340 * One contiguous piece to clear
1342 error = xfs_zero_remaining_bytes(ip, offset, offset + len - 1);
1343 else {
1345 * Some full blocks, possibly two pieces to clear
1347 if (offset < XFS_FSB_TO_B(mp, startoffset_fsb))
1348 error = xfs_zero_remaining_bytes(ip, offset,
1349 XFS_FSB_TO_B(mp, startoffset_fsb) - 1);
1350 if (!error &&
1351 XFS_FSB_TO_B(mp, endoffset_fsb) < offset + len)
1352 error = xfs_zero_remaining_bytes(ip,
1353 XFS_FSB_TO_B(mp, endoffset_fsb),
1354 offset + len - 1);
1358 * free file space until done or until there is an error
1360 resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0);
1361 while (!error && !done) {
1364 * allocate and setup the transaction. Allow this
1365 * transaction to dip into the reserve blocks to ensure
1366 * the freeing of the space succeeds at ENOSPC.
1368 tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT);
1369 tp->t_flags |= XFS_TRANS_RESERVE;
1370 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write, resblks, 0);
1373 * check for running out of space
1375 if (error) {
1377 * Free the transaction structure.
1379 ASSERT(error == ENOSPC || XFS_FORCED_SHUTDOWN(mp));
1380 xfs_trans_cancel(tp, 0);
1381 break;
1383 xfs_ilock(ip, XFS_ILOCK_EXCL);
1384 error = xfs_trans_reserve_quota(tp, mp,
1385 ip->i_udquot, ip->i_gdquot, ip->i_pdquot,
1386 resblks, 0, XFS_QMOPT_RES_REGBLKS);
1387 if (error)
1388 goto error1;
1390 xfs_trans_ijoin(tp, ip, 0);
1393 * issue the bunmapi() call to free the blocks
1395 xfs_bmap_init(&free_list, &firstfsb);
1396 error = xfs_bunmapi(tp, ip, startoffset_fsb,
1397 endoffset_fsb - startoffset_fsb,
1398 0, 2, &firstfsb, &free_list, &done);
1399 if (error) {
1400 goto error0;
1404 * complete the transaction
1406 error = xfs_bmap_finish(&tp, &free_list, &committed);
1407 if (error) {
1408 goto error0;
1411 error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
1412 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1415 out_unlock_iolock:
1416 if (need_iolock)
1417 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
1418 return error;
1420 error0:
1421 xfs_bmap_cancel(&free_list);
1422 error1:
1423 xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES | XFS_TRANS_ABORT);
1424 xfs_iunlock(ip, need_iolock ? (XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL) :
1425 XFS_ILOCK_EXCL);
1426 return error;
1430 STATIC int
1431 xfs_zero_file_space(
1432 struct xfs_inode *ip,
1433 xfs_off_t offset,
1434 xfs_off_t len,
1435 int attr_flags)
1437 struct xfs_mount *mp = ip->i_mount;
1438 uint granularity;
1439 xfs_off_t start_boundary;
1440 xfs_off_t end_boundary;
1441 int error;
1443 granularity = max_t(uint, 1 << mp->m_sb.sb_blocklog, PAGE_CACHE_SIZE);
1446 * Round the range of extents we are going to convert inwards. If the
1447 * offset is aligned, then it doesn't get changed so we zero from the
1448 * start of the block offset points to.
1450 start_boundary = round_up(offset, granularity);
1451 end_boundary = round_down(offset + len, granularity);
1453 ASSERT(start_boundary >= offset);
1454 ASSERT(end_boundary <= offset + len);
1456 if (!(attr_flags & XFS_ATTR_NOLOCK))
1457 xfs_ilock(ip, XFS_IOLOCK_EXCL);
1459 if (start_boundary < end_boundary - 1) {
1460 /* punch out the page cache over the conversion range */
1461 truncate_pagecache_range(VFS_I(ip), start_boundary,
1462 end_boundary - 1);
1463 /* convert the blocks */
1464 error = xfs_alloc_file_space(ip, start_boundary,
1465 end_boundary - start_boundary - 1,
1466 XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT,
1467 attr_flags);
1468 if (error)
1469 goto out_unlock;
1471 /* We've handled the interior of the range, now for the edges */
1472 if (start_boundary != offset)
1473 error = xfs_iozero(ip, offset, start_boundary - offset);
1474 if (error)
1475 goto out_unlock;
1477 if (end_boundary != offset + len)
1478 error = xfs_iozero(ip, end_boundary,
1479 offset + len - end_boundary);
1481 } else {
1483 * It's either a sub-granularity range or the range spanned lies
1484 * partially across two adjacent blocks.
1486 error = xfs_iozero(ip, offset, len);
1489 out_unlock:
1490 if (!(attr_flags & XFS_ATTR_NOLOCK))
1491 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
1492 return error;
1497 * xfs_change_file_space()
1498 * This routine allocates or frees disk space for the given file.
1499 * The user specified parameters are checked for alignment and size
1500 * limitations.
1502 * RETURNS:
1503 * 0 on success
1504 * errno on error
1508 xfs_change_file_space(
1509 xfs_inode_t *ip,
1510 int cmd,
1511 xfs_flock64_t *bf,
1512 xfs_off_t offset,
1513 int attr_flags)
1515 xfs_mount_t *mp = ip->i_mount;
1516 int clrprealloc;
1517 int error;
1518 xfs_fsize_t fsize;
1519 int setprealloc;
1520 xfs_off_t startoffset;
1521 xfs_trans_t *tp;
1522 struct iattr iattr;
1524 if (!S_ISREG(ip->i_d.di_mode))
1525 return XFS_ERROR(EINVAL);
1527 switch (bf->l_whence) {
1528 case 0: /*SEEK_SET*/
1529 break;
1530 case 1: /*SEEK_CUR*/
1531 bf->l_start += offset;
1532 break;
1533 case 2: /*SEEK_END*/
1534 bf->l_start += XFS_ISIZE(ip);
1535 break;
1536 default:
1537 return XFS_ERROR(EINVAL);
1541 * length of <= 0 for resv/unresv/zero is invalid. length for
1542 * alloc/free is ignored completely and we have no idea what userspace
1543 * might have set it to, so set it to zero to allow range
1544 * checks to pass.
1546 switch (cmd) {
1547 case XFS_IOC_ZERO_RANGE:
1548 case XFS_IOC_RESVSP:
1549 case XFS_IOC_RESVSP64:
1550 case XFS_IOC_UNRESVSP:
1551 case XFS_IOC_UNRESVSP64:
1552 if (bf->l_len <= 0)
1553 return XFS_ERROR(EINVAL);
1554 break;
1555 default:
1556 bf->l_len = 0;
1557 break;
1560 if (bf->l_start < 0 ||
1561 bf->l_start > mp->m_super->s_maxbytes ||
1562 bf->l_start + bf->l_len < 0 ||
1563 bf->l_start + bf->l_len >= mp->m_super->s_maxbytes)
1564 return XFS_ERROR(EINVAL);
1566 bf->l_whence = 0;
1568 startoffset = bf->l_start;
1569 fsize = XFS_ISIZE(ip);
1571 setprealloc = clrprealloc = 0;
1572 switch (cmd) {
1573 case XFS_IOC_ZERO_RANGE:
1574 error = xfs_zero_file_space(ip, startoffset, bf->l_len,
1575 attr_flags);
1576 if (error)
1577 return error;
1578 setprealloc = 1;
1579 break;
1581 case XFS_IOC_RESVSP:
1582 case XFS_IOC_RESVSP64:
1583 error = xfs_alloc_file_space(ip, startoffset, bf->l_len,
1584 XFS_BMAPI_PREALLOC, attr_flags);
1585 if (error)
1586 return error;
1587 setprealloc = 1;
1588 break;
1590 case XFS_IOC_UNRESVSP:
1591 case XFS_IOC_UNRESVSP64:
1592 if ((error = xfs_free_file_space(ip, startoffset, bf->l_len,
1593 attr_flags)))
1594 return error;
1595 break;
1597 case XFS_IOC_ALLOCSP:
1598 case XFS_IOC_ALLOCSP64:
1599 case XFS_IOC_FREESP:
1600 case XFS_IOC_FREESP64:
1602 * These operations actually do IO when extending the file, but
1603 * the allocation is done seperately to the zeroing that is
1604 * done. This set of operations need to be serialised against
1605 * other IO operations, such as truncate and buffered IO. We
1606 * need to take the IOLOCK here to serialise the allocation and
1607 * zeroing IO to prevent other IOLOCK holders (e.g. getbmap,
1608 * truncate, direct IO) from racing against the transient
1609 * allocated but not written state we can have here.
1611 xfs_ilock(ip, XFS_IOLOCK_EXCL);
1612 if (startoffset > fsize) {
1613 error = xfs_alloc_file_space(ip, fsize,
1614 startoffset - fsize, 0,
1615 attr_flags | XFS_ATTR_NOLOCK);
1616 if (error) {
1617 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
1618 break;
1622 iattr.ia_valid = ATTR_SIZE;
1623 iattr.ia_size = startoffset;
1625 error = xfs_setattr_size(ip, &iattr,
1626 attr_flags | XFS_ATTR_NOLOCK);
1627 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
1629 if (error)
1630 return error;
1632 clrprealloc = 1;
1633 break;
1635 default:
1636 ASSERT(0);
1637 return XFS_ERROR(EINVAL);
1641 * update the inode timestamp, mode, and prealloc flag bits
1643 tp = xfs_trans_alloc(mp, XFS_TRANS_WRITEID);
1644 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_writeid, 0, 0);
1645 if (error) {
1646 xfs_trans_cancel(tp, 0);
1647 return error;
1650 xfs_ilock(ip, XFS_ILOCK_EXCL);
1651 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
1653 if ((attr_flags & XFS_ATTR_DMI) == 0) {
1654 ip->i_d.di_mode &= ~S_ISUID;
1657 * Note that we don't have to worry about mandatory
1658 * file locking being disabled here because we only
1659 * clear the S_ISGID bit if the Group execute bit is
1660 * on, but if it was on then mandatory locking wouldn't
1661 * have been enabled.
1663 if (ip->i_d.di_mode & S_IXGRP)
1664 ip->i_d.di_mode &= ~S_ISGID;
1666 xfs_trans_ichgtime(tp, ip, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
1668 if (setprealloc)
1669 ip->i_d.di_flags |= XFS_DIFLAG_PREALLOC;
1670 else if (clrprealloc)
1671 ip->i_d.di_flags &= ~XFS_DIFLAG_PREALLOC;
1673 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
1674 if (attr_flags & XFS_ATTR_SYNC)
1675 xfs_trans_set_sync(tp);
1676 return xfs_trans_commit(tp, 0);
1680 * We need to check that the format of the data fork in the temporary inode is
1681 * valid for the target inode before doing the swap. This is not a problem with
1682 * attr1 because of the fixed fork offset, but attr2 has a dynamically sized
1683 * data fork depending on the space the attribute fork is taking so we can get
1684 * invalid formats on the target inode.
1686 * E.g. target has space for 7 extents in extent format, temp inode only has
1687 * space for 6. If we defragment down to 7 extents, then the tmp format is a
1688 * btree, but when swapped it needs to be in extent format. Hence we can't just
1689 * blindly swap data forks on attr2 filesystems.
1691 * Note that we check the swap in both directions so that we don't end up with
1692 * a corrupt temporary inode, either.
1694 * Note that fixing the way xfs_fsr sets up the attribute fork in the source
1695 * inode will prevent this situation from occurring, so all we do here is
1696 * reject and log the attempt. basically we are putting the responsibility on
1697 * userspace to get this right.
1699 static int
1700 xfs_swap_extents_check_format(
1701 xfs_inode_t *ip, /* target inode */
1702 xfs_inode_t *tip) /* tmp inode */
1705 /* Should never get a local format */
1706 if (ip->i_d.di_format == XFS_DINODE_FMT_LOCAL ||
1707 tip->i_d.di_format == XFS_DINODE_FMT_LOCAL)
1708 return EINVAL;
1711 * if the target inode has less extents that then temporary inode then
1712 * why did userspace call us?
1714 if (ip->i_d.di_nextents < tip->i_d.di_nextents)
1715 return EINVAL;
1718 * if the target inode is in extent form and the temp inode is in btree
1719 * form then we will end up with the target inode in the wrong format
1720 * as we already know there are less extents in the temp inode.
1722 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1723 tip->i_d.di_format == XFS_DINODE_FMT_BTREE)
1724 return EINVAL;
1726 /* Check temp in extent form to max in target */
1727 if (tip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1728 XFS_IFORK_NEXTENTS(tip, XFS_DATA_FORK) >
1729 XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK))
1730 return EINVAL;
1732 /* Check target in extent form to max in temp */
1733 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1734 XFS_IFORK_NEXTENTS(ip, XFS_DATA_FORK) >
1735 XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK))
1736 return EINVAL;
1739 * If we are in a btree format, check that the temp root block will fit
1740 * in the target and that it has enough extents to be in btree format
1741 * in the target.
1743 * Note that we have to be careful to allow btree->extent conversions
1744 * (a common defrag case) which will occur when the temp inode is in
1745 * extent format...
1747 if (tip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1748 if (XFS_IFORK_BOFF(ip) &&
1749 XFS_BMAP_BMDR_SPACE(tip->i_df.if_broot) > XFS_IFORK_BOFF(ip))
1750 return EINVAL;
1751 if (XFS_IFORK_NEXTENTS(tip, XFS_DATA_FORK) <=
1752 XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK))
1753 return EINVAL;
1756 /* Reciprocal target->temp btree format checks */
1757 if (ip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1758 if (XFS_IFORK_BOFF(tip) &&
1759 XFS_BMAP_BMDR_SPACE(ip->i_df.if_broot) > XFS_IFORK_BOFF(tip))
1760 return EINVAL;
1761 if (XFS_IFORK_NEXTENTS(ip, XFS_DATA_FORK) <=
1762 XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK))
1763 return EINVAL;
1766 return 0;
1770 xfs_swap_extents(
1771 xfs_inode_t *ip, /* target inode */
1772 xfs_inode_t *tip, /* tmp inode */
1773 xfs_swapext_t *sxp)
1775 xfs_mount_t *mp = ip->i_mount;
1776 xfs_trans_t *tp;
1777 xfs_bstat_t *sbp = &sxp->sx_stat;
1778 xfs_ifork_t *tempifp, *ifp, *tifp;
1779 int src_log_flags, target_log_flags;
1780 int error = 0;
1781 int aforkblks = 0;
1782 int taforkblks = 0;
1783 __uint64_t tmp;
1785 tempifp = kmem_alloc(sizeof(xfs_ifork_t), KM_MAYFAIL);
1786 if (!tempifp) {
1787 error = XFS_ERROR(ENOMEM);
1788 goto out;
1792 * we have to do two separate lock calls here to keep lockdep
1793 * happy. If we try to get all the locks in one call, lock will
1794 * report false positives when we drop the ILOCK and regain them
1795 * below.
1797 xfs_lock_two_inodes(ip, tip, XFS_IOLOCK_EXCL);
1798 xfs_lock_two_inodes(ip, tip, XFS_ILOCK_EXCL);
1800 /* Verify that both files have the same format */
1801 if ((ip->i_d.di_mode & S_IFMT) != (tip->i_d.di_mode & S_IFMT)) {
1802 error = XFS_ERROR(EINVAL);
1803 goto out_unlock;
1806 /* Verify both files are either real-time or non-realtime */
1807 if (XFS_IS_REALTIME_INODE(ip) != XFS_IS_REALTIME_INODE(tip)) {
1808 error = XFS_ERROR(EINVAL);
1809 goto out_unlock;
1812 error = -filemap_write_and_wait(VFS_I(tip)->i_mapping);
1813 if (error)
1814 goto out_unlock;
1815 truncate_pagecache_range(VFS_I(tip), 0, -1);
1817 /* Verify O_DIRECT for ftmp */
1818 if (VN_CACHED(VFS_I(tip)) != 0) {
1819 error = XFS_ERROR(EINVAL);
1820 goto out_unlock;
1823 /* Verify all data are being swapped */
1824 if (sxp->sx_offset != 0 ||
1825 sxp->sx_length != ip->i_d.di_size ||
1826 sxp->sx_length != tip->i_d.di_size) {
1827 error = XFS_ERROR(EFAULT);
1828 goto out_unlock;
1831 trace_xfs_swap_extent_before(ip, 0);
1832 trace_xfs_swap_extent_before(tip, 1);
1834 /* check inode formats now that data is flushed */
1835 error = xfs_swap_extents_check_format(ip, tip);
1836 if (error) {
1837 xfs_notice(mp,
1838 "%s: inode 0x%llx format is incompatible for exchanging.",
1839 __func__, ip->i_ino);
1840 goto out_unlock;
1844 * Compare the current change & modify times with that
1845 * passed in. If they differ, we abort this swap.
1846 * This is the mechanism used to ensure the calling
1847 * process that the file was not changed out from
1848 * under it.
1850 if ((sbp->bs_ctime.tv_sec != VFS_I(ip)->i_ctime.tv_sec) ||
1851 (sbp->bs_ctime.tv_nsec != VFS_I(ip)->i_ctime.tv_nsec) ||
1852 (sbp->bs_mtime.tv_sec != VFS_I(ip)->i_mtime.tv_sec) ||
1853 (sbp->bs_mtime.tv_nsec != VFS_I(ip)->i_mtime.tv_nsec)) {
1854 error = XFS_ERROR(EBUSY);
1855 goto out_unlock;
1858 /* We need to fail if the file is memory mapped. Once we have tossed
1859 * all existing pages, the page fault will have no option
1860 * but to go to the filesystem for pages. By making the page fault call
1861 * vop_read (or write in the case of autogrow) they block on the iolock
1862 * until we have switched the extents.
1864 if (VN_MAPPED(VFS_I(ip))) {
1865 error = XFS_ERROR(EBUSY);
1866 goto out_unlock;
1869 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1870 xfs_iunlock(tip, XFS_ILOCK_EXCL);
1873 * There is a race condition here since we gave up the
1874 * ilock. However, the data fork will not change since
1875 * we have the iolock (locked for truncation too) so we
1876 * are safe. We don't really care if non-io related
1877 * fields change.
1879 truncate_pagecache_range(VFS_I(ip), 0, -1);
1881 tp = xfs_trans_alloc(mp, XFS_TRANS_SWAPEXT);
1882 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_ichange, 0, 0);
1883 if (error) {
1884 xfs_iunlock(ip, XFS_IOLOCK_EXCL);
1885 xfs_iunlock(tip, XFS_IOLOCK_EXCL);
1886 xfs_trans_cancel(tp, 0);
1887 goto out;
1889 xfs_lock_two_inodes(ip, tip, XFS_ILOCK_EXCL);
1892 * Count the number of extended attribute blocks
1894 if ( ((XFS_IFORK_Q(ip) != 0) && (ip->i_d.di_anextents > 0)) &&
1895 (ip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)) {
1896 error = xfs_bmap_count_blocks(tp, ip, XFS_ATTR_FORK, &aforkblks);
1897 if (error)
1898 goto out_trans_cancel;
1900 if ( ((XFS_IFORK_Q(tip) != 0) && (tip->i_d.di_anextents > 0)) &&
1901 (tip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)) {
1902 error = xfs_bmap_count_blocks(tp, tip, XFS_ATTR_FORK,
1903 &taforkblks);
1904 if (error)
1905 goto out_trans_cancel;
1908 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
1909 xfs_trans_ijoin(tp, tip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
1912 * Before we've swapped the forks, lets set the owners of the forks
1913 * appropriately. We have to do this as we are demand paging the btree
1914 * buffers, and so the validation done on read will expect the owner
1915 * field to be correctly set. Once we change the owners, we can swap the
1916 * inode forks.
1918 * Note the trickiness in setting the log flags - we set the owner log
1919 * flag on the opposite inode (i.e. the inode we are setting the new
1920 * owner to be) because once we swap the forks and log that, log
1921 * recovery is going to see the fork as owned by the swapped inode,
1922 * not the pre-swapped inodes.
1924 src_log_flags = XFS_ILOG_CORE;
1925 target_log_flags = XFS_ILOG_CORE;
1926 if (ip->i_d.di_version == 3 &&
1927 ip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1928 target_log_flags |= XFS_ILOG_DOWNER;
1929 error = xfs_bmbt_change_owner(tp, ip, XFS_DATA_FORK,
1930 tip->i_ino, NULL);
1931 if (error)
1932 goto out_trans_cancel;
1935 if (tip->i_d.di_version == 3 &&
1936 tip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
1937 src_log_flags |= XFS_ILOG_DOWNER;
1938 error = xfs_bmbt_change_owner(tp, tip, XFS_DATA_FORK,
1939 ip->i_ino, NULL);
1940 if (error)
1941 goto out_trans_cancel;
1945 * Swap the data forks of the inodes
1947 ifp = &ip->i_df;
1948 tifp = &tip->i_df;
1949 *tempifp = *ifp; /* struct copy */
1950 *ifp = *tifp; /* struct copy */
1951 *tifp = *tempifp; /* struct copy */
1954 * Fix the on-disk inode values
1956 tmp = (__uint64_t)ip->i_d.di_nblocks;
1957 ip->i_d.di_nblocks = tip->i_d.di_nblocks - taforkblks + aforkblks;
1958 tip->i_d.di_nblocks = tmp + taforkblks - aforkblks;
1960 tmp = (__uint64_t) ip->i_d.di_nextents;
1961 ip->i_d.di_nextents = tip->i_d.di_nextents;
1962 tip->i_d.di_nextents = tmp;
1964 tmp = (__uint64_t) ip->i_d.di_format;
1965 ip->i_d.di_format = tip->i_d.di_format;
1966 tip->i_d.di_format = tmp;
1969 * The extents in the source inode could still contain speculative
1970 * preallocation beyond EOF (e.g. the file is open but not modified
1971 * while defrag is in progress). In that case, we need to copy over the
1972 * number of delalloc blocks the data fork in the source inode is
1973 * tracking beyond EOF so that when the fork is truncated away when the
1974 * temporary inode is unlinked we don't underrun the i_delayed_blks
1975 * counter on that inode.
1977 ASSERT(tip->i_delayed_blks == 0);
1978 tip->i_delayed_blks = ip->i_delayed_blks;
1979 ip->i_delayed_blks = 0;
1981 switch (ip->i_d.di_format) {
1982 case XFS_DINODE_FMT_EXTENTS:
1983 /* If the extents fit in the inode, fix the
1984 * pointer. Otherwise it's already NULL or
1985 * pointing to the extent.
1987 if (ip->i_d.di_nextents <= XFS_INLINE_EXTS) {
1988 ifp->if_u1.if_extents =
1989 ifp->if_u2.if_inline_ext;
1991 src_log_flags |= XFS_ILOG_DEXT;
1992 break;
1993 case XFS_DINODE_FMT_BTREE:
1994 ASSERT(ip->i_d.di_version < 3 ||
1995 (src_log_flags & XFS_ILOG_DOWNER));
1996 src_log_flags |= XFS_ILOG_DBROOT;
1997 break;
2000 switch (tip->i_d.di_format) {
2001 case XFS_DINODE_FMT_EXTENTS:
2002 /* If the extents fit in the inode, fix the
2003 * pointer. Otherwise it's already NULL or
2004 * pointing to the extent.
2006 if (tip->i_d.di_nextents <= XFS_INLINE_EXTS) {
2007 tifp->if_u1.if_extents =
2008 tifp->if_u2.if_inline_ext;
2010 target_log_flags |= XFS_ILOG_DEXT;
2011 break;
2012 case XFS_DINODE_FMT_BTREE:
2013 target_log_flags |= XFS_ILOG_DBROOT;
2014 ASSERT(tip->i_d.di_version < 3 ||
2015 (target_log_flags & XFS_ILOG_DOWNER));
2016 break;
2019 xfs_trans_log_inode(tp, ip, src_log_flags);
2020 xfs_trans_log_inode(tp, tip, target_log_flags);
2023 * If this is a synchronous mount, make sure that the
2024 * transaction goes to disk before returning to the user.
2026 if (mp->m_flags & XFS_MOUNT_WSYNC)
2027 xfs_trans_set_sync(tp);
2029 error = xfs_trans_commit(tp, 0);
2031 trace_xfs_swap_extent_after(ip, 0);
2032 trace_xfs_swap_extent_after(tip, 1);
2033 out:
2034 kmem_free(tempifp);
2035 return error;
2037 out_unlock:
2038 xfs_iunlock(ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
2039 xfs_iunlock(tip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
2040 goto out;
2042 out_trans_cancel:
2043 xfs_trans_cancel(tp, 0);
2044 goto out_unlock;