Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2000-2006 Silicon Graphics, Inc. |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 3 | * Copyright (c) 2012 Red Hat, Inc. |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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" |
Dave Chinner | 70a9883c | 2013-10-23 10:36:05 +1100 | [diff] [blame] | 21 | #include "xfs_shared.h" |
Dave Chinner | 239880e | 2013-10-23 10:50:10 +1100 | [diff] [blame] | 22 | #include "xfs_format.h" |
| 23 | #include "xfs_log_format.h" |
| 24 | #include "xfs_trans_resv.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 25 | #include "xfs_bit.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 26 | #include "xfs_sb.h" |
| 27 | #include "xfs_ag.h" |
| 28 | #include "xfs_mount.h" |
Dave Chinner | 5706278 | 2013-10-15 09:17:51 +1100 | [diff] [blame] | 29 | #include "xfs_da_format.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 30 | #include "xfs_inode.h" |
| 31 | #include "xfs_btree.h" |
Dave Chinner | 239880e | 2013-10-23 10:50:10 +1100 | [diff] [blame] | 32 | #include "xfs_trans.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 33 | #include "xfs_extfree_item.h" |
| 34 | #include "xfs_alloc.h" |
| 35 | #include "xfs_bmap.h" |
| 36 | #include "xfs_bmap_util.h" |
Dave Chinner | a4fbe6a | 2013-10-23 10:51:50 +1100 | [diff] [blame] | 37 | #include "xfs_bmap_btree.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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" |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 43 | #include "xfs_icache.h" |
Dave Chinner | 239880e | 2013-10-23 10:50:10 +1100 | [diff] [blame] | 44 | #include "xfs_log.h" |
Dave Chinner | a4fbe6a | 2013-10-23 10:51:50 +1100 | [diff] [blame] | 45 | #include "xfs_dinode.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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 | */ |
| 54 | xfs_daddr_t |
| 55 | xfs_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 | */ |
| 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 */ |
| 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 */ |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 81 | struct xfs_trans_res tres; /* new log reservation */ |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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); |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 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; |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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 | |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 117 | error = xfs_trans_reserve(ntp, &tres, 0, 0); |
| 118 | if (error) |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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 | |
| 148 | int |
| 149 | xfs_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 | */ |
| 254 | static void |
| 255 | xfs_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 | */ |
| 276 | int |
| 277 | xfs_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 | return args->result; |
| 291 | } |
| 292 | |
| 293 | /* |
| 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. |
| 297 | */ |
| 298 | int |
| 299 | xfs_bmap_eof( |
| 300 | struct xfs_inode *ip, |
| 301 | xfs_fileoff_t endoff, |
| 302 | int whichfork, |
| 303 | int *eof) |
| 304 | { |
| 305 | struct xfs_bmbt_irec rec; |
| 306 | int error; |
| 307 | |
| 308 | error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, eof); |
| 309 | if (error || *eof) |
| 310 | return error; |
| 311 | |
| 312 | *eof = endoff >= rec.br_startoff + rec.br_blockcount; |
| 313 | return 0; |
| 314 | } |
| 315 | |
| 316 | /* |
| 317 | * Extent tree block counting routines. |
| 318 | */ |
| 319 | |
| 320 | /* |
| 321 | * Count leaf blocks given a range of extent records. |
| 322 | */ |
| 323 | STATIC void |
| 324 | xfs_bmap_count_leaves( |
| 325 | xfs_ifork_t *ifp, |
| 326 | xfs_extnum_t idx, |
| 327 | int numrecs, |
| 328 | int *count) |
| 329 | { |
| 330 | int b; |
| 331 | |
| 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); |
| 335 | } |
| 336 | } |
| 337 | |
| 338 | /* |
| 339 | * Count leaf blocks given a range of extent records originally |
| 340 | * in btree format. |
| 341 | */ |
| 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) |
| 348 | { |
| 349 | int b; |
| 350 | xfs_bmbt_rec_t *frp; |
| 351 | |
| 352 | for (b = 1; b <= numrecs; b++) { |
| 353 | frp = XFS_BMBT_REC_ADDR(mp, block, b); |
| 354 | *count += xfs_bmbt_disk_get_blockcount(frp); |
| 355 | } |
| 356 | } |
| 357 | |
| 358 | /* |
| 359 | * Recursively walks each level of a btree |
Zhi Yong Wu | 8be11e9 | 2013-08-12 03:14:52 +0000 | [diff] [blame] | 360 | * to count total fsblocks in use. |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 361 | */ |
| 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 */ |
| 370 | { |
| 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; |
| 379 | |
| 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); |
| 386 | |
| 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); |
| 400 | } |
| 401 | |
| 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); |
| 411 | } |
| 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); |
| 430 | } |
| 431 | } |
| 432 | return 0; |
| 433 | } |
| 434 | |
| 435 | /* |
| 436 | * Count fsblocks of the given fork. |
| 437 | */ |
| 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 */ |
| 444 | { |
| 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 */ |
| 451 | |
| 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; |
| 460 | } |
| 461 | |
| 462 | /* |
| 463 | * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out. |
| 464 | */ |
| 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); |
| 473 | |
| 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); |
| 478 | } |
| 479 | |
| 480 | return 0; |
| 481 | } |
| 482 | |
| 483 | /* |
| 484 | * returns 1 for success, 0 if we failed to map the extent. |
| 485 | */ |
| 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) |
| 494 | { |
| 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; |
| 500 | |
| 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; |
| 511 | } |
| 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; |
| 522 | } |
| 523 | |
| 524 | return 1; |
| 525 | } |
| 526 | |
| 527 | /* |
| 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. |
| 533 | */ |
| 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 */ |
| 540 | { |
| 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; |
| 559 | |
| 560 | mp = ip->i_mount; |
| 561 | iflags = bmv->bmv_iflags; |
| 562 | whichfork = iflags & BMV_IF_ATTRFORK ? XFS_ATTR_FORK : XFS_DATA_FORK; |
| 563 | |
| 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); |
| 576 | } |
| 577 | |
| 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); |
| 585 | |
| 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); |
| 593 | } |
| 594 | } |
| 595 | |
| 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); |
| 605 | } |
| 606 | |
| 607 | nex = bmv->bmv_count - 1; |
| 608 | if (nex <= 0) |
| 609 | return XFS_ERROR(EINVAL); |
| 610 | bmvend = bmv->bmv_offset + bmv->bmv_length; |
| 611 | |
| 612 | |
| 613 | if (bmv->bmv_count > ULONG_MAX / sizeof(struct getbmapx)) |
| 614 | return XFS_ERROR(ENOMEM); |
Dave Chinner | fdd3cce | 2013-09-02 20:53:00 +1000 | [diff] [blame] | 615 | out = kmem_zalloc_large(bmv->bmv_count * sizeof(struct getbmapx), 0); |
| 616 | if (!out) |
| 617 | return XFS_ERROR(ENOMEM); |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 618 | |
| 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; |
| 625 | } |
| 626 | /* |
| 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. |
| 632 | */ |
| 633 | } |
| 634 | |
| 635 | lock = xfs_ilock_map_shared(ip); |
| 636 | |
| 637 | /* |
| 638 | * Don't let nex be bigger than the number of extents |
| 639 | * we can have assuming alternating holes and real extents. |
| 640 | */ |
| 641 | if (nex > XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1) |
| 642 | nex = XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1; |
| 643 | |
| 644 | bmapi_flags = xfs_bmapi_aflag(whichfork); |
| 645 | if (!(iflags & BMV_IF_PREALLOC)) |
| 646 | bmapi_flags |= XFS_BMAPI_IGSTATE; |
| 647 | |
| 648 | /* |
| 649 | * Allocate enough space to handle "subnex" maps at a time. |
| 650 | */ |
| 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; |
| 656 | |
| 657 | bmv->bmv_entries = 0; |
| 658 | |
| 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; |
| 663 | } |
| 664 | |
| 665 | nexleft = nex; |
| 666 | |
| 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); |
| 675 | |
| 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; |
| 688 | |
| 689 | /* |
| 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. |
| 697 | */ |
| 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); |
| 701 | |
| 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; |
| 707 | } |
| 708 | |
| 709 | if (!xfs_getbmapx_fix_eof_hole(ip, &out[cur_ext], |
| 710 | prealloced, bmvend, |
| 711 | map[i].br_startblock)) |
| 712 | goto out_free_map; |
| 713 | |
| 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); |
| 719 | |
| 720 | /* |
| 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. |
| 724 | */ |
| 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; |
| 729 | } |
| 730 | |
| 731 | nexleft--; |
| 732 | bmv->bmv_entries++; |
| 733 | cur_ext++; |
| 734 | } |
| 735 | } while (nmap && nexleft && bmv->bmv_length); |
| 736 | |
| 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); |
| 743 | |
| 744 | for (i = 0; i < cur_ext; i++) { |
| 745 | int full = 0; /* user array is full */ |
| 746 | |
| 747 | /* format results & advance arg */ |
| 748 | error = formatter(&arg, &out[i], &full); |
| 749 | if (error || full) |
| 750 | break; |
| 751 | } |
| 752 | |
Dave Chinner | fdd3cce | 2013-09-02 20:53:00 +1000 | [diff] [blame] | 753 | kmem_free(out); |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 754 | return error; |
| 755 | } |
| 756 | |
| 757 | /* |
| 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 |
Zhi Yong Wu | ad4809b | 2013-08-12 03:14:55 +0000 | [diff] [blame] | 760 | * rare error cases so the overhead is not critical. This will always punch out |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 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. |
| 764 | */ |
| 765 | int |
| 766 | xfs_bmap_punch_delalloc_range( |
| 767 | struct xfs_inode *ip, |
| 768 | xfs_fileoff_t start_fsb, |
| 769 | xfs_fileoff_t length) |
| 770 | { |
| 771 | xfs_fileoff_t remaining = length; |
| 772 | int error = 0; |
| 773 | |
| 774 | ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); |
| 775 | |
| 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; |
| 782 | |
| 783 | /* |
| 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... |
| 788 | */ |
| 789 | error = xfs_bmapi_read(ip, start_fsb, 1, &imap, &nimaps, |
| 790 | XFS_BMAPI_ENTIRE); |
| 791 | |
| 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); |
| 798 | } |
| 799 | break; |
| 800 | } |
| 801 | if (!nimaps) { |
| 802 | /* nothing there */ |
| 803 | goto next_block; |
| 804 | } |
| 805 | if (imap.br_startblock != DELAYSTARTBLOCK) { |
| 806 | /* been converted, ignore */ |
| 807 | goto next_block; |
| 808 | } |
| 809 | WARN_ON(imap.br_blockcount == 0); |
| 810 | |
| 811 | /* |
| 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. |
| 816 | */ |
| 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; |
| 822 | |
| 823 | ASSERT(!flist.xbf_count && !flist.xbf_first); |
| 824 | next_block: |
| 825 | start_fsb++; |
| 826 | remaining--; |
| 827 | } while(remaining > 0); |
| 828 | |
| 829 | return error; |
| 830 | } |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 831 | |
| 832 | /* |
| 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. |
| 836 | */ |
| 837 | bool |
| 838 | xfs_can_free_eofblocks(struct xfs_inode *ip, bool force) |
| 839 | { |
| 840 | /* prealloc/delalloc exists only on regular files */ |
| 841 | if (!S_ISREG(ip->i_d.di_mode)) |
| 842 | return false; |
| 843 | |
| 844 | /* |
| 845 | * Zero sized files with no cached pages and delalloc blocks will not |
| 846 | * have speculative prealloc/delalloc blocks to remove. |
| 847 | */ |
| 848 | if (VFS_I(ip)->i_size == 0 && |
| 849 | VN_CACHED(VFS_I(ip)) == 0 && |
| 850 | ip->i_delayed_blks == 0) |
| 851 | return false; |
| 852 | |
| 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; |
| 856 | |
| 857 | /* |
| 858 | * Do not free real preallocated or append-only files unless the file |
| 859 | * has delalloc blocks and we are forced to remove them. |
| 860 | */ |
| 861 | if (ip->i_d.di_flags & (XFS_DIFLAG_PREALLOC | XFS_DIFLAG_APPEND)) |
| 862 | if (!force || ip->i_delayed_blks == 0) |
| 863 | return false; |
| 864 | |
| 865 | return true; |
| 866 | } |
| 867 | |
| 868 | /* |
| 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. |
| 872 | */ |
| 873 | int |
| 874 | xfs_free_eofblocks( |
| 875 | xfs_mount_t *mp, |
| 876 | xfs_inode_t *ip, |
| 877 | bool need_iolock) |
| 878 | { |
| 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; |
| 886 | |
| 887 | /* |
| 888 | * Figure out if there are any blocks beyond the end |
| 889 | * of the file. If not, then there is nothing to do. |
| 890 | */ |
| 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; |
| 896 | |
| 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); |
| 901 | |
| 902 | if (!error && (nimaps != 0) && |
| 903 | (imap.br_startblock != HOLESTARTBLOCK || |
| 904 | ip->i_delayed_blks)) { |
| 905 | /* |
| 906 | * Attach the dquots to the inode up front. |
| 907 | */ |
| 908 | error = xfs_qm_dqattach(ip, 0); |
| 909 | if (error) |
| 910 | return error; |
| 911 | |
| 912 | /* |
| 913 | * There are blocks after the end of file. |
| 914 | * Free them up now by truncating the file to |
| 915 | * its current size. |
| 916 | */ |
| 917 | tp = xfs_trans_alloc(mp, XFS_TRANS_INACTIVE); |
| 918 | |
| 919 | if (need_iolock) { |
| 920 | if (!xfs_ilock_nowait(ip, XFS_IOLOCK_EXCL)) { |
| 921 | xfs_trans_cancel(tp, 0); |
| 922 | return EAGAIN; |
| 923 | } |
| 924 | } |
| 925 | |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 926 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_itruncate, 0, 0); |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 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; |
| 933 | } |
| 934 | |
| 935 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
| 936 | xfs_trans_ijoin(tp, ip, 0); |
| 937 | |
| 938 | /* |
| 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). |
| 943 | */ |
| 944 | error = xfs_itruncate_extents(&tp, ip, XFS_DATA_FORK, |
| 945 | XFS_ISIZE(ip)); |
| 946 | if (error) { |
| 947 | /* |
| 948 | * If we get an error at this point we simply don't |
| 949 | * bother truncating the file. |
| 950 | */ |
| 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); |
| 959 | } |
| 960 | |
| 961 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 962 | if (need_iolock) |
| 963 | xfs_iunlock(ip, XFS_IOLOCK_EXCL); |
| 964 | } |
| 965 | return error; |
| 966 | } |
| 967 | |
Christoph Hellwig | 83aee9e | 2013-10-12 00:55:07 -0700 | [diff] [blame] | 968 | int |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 969 | xfs_alloc_file_space( |
Christoph Hellwig | 83aee9e | 2013-10-12 00:55:07 -0700 | [diff] [blame] | 970 | struct xfs_inode *ip, |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 971 | xfs_off_t offset, |
| 972 | xfs_off_t len, |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 973 | int alloc_type) |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 974 | { |
| 975 | xfs_mount_t *mp = ip->i_mount; |
| 976 | xfs_off_t count; |
| 977 | xfs_filblks_t allocated_fsb; |
| 978 | xfs_filblks_t allocatesize_fsb; |
| 979 | xfs_extlen_t extsz, temp; |
| 980 | xfs_fileoff_t startoffset_fsb; |
| 981 | xfs_fsblock_t firstfsb; |
| 982 | int nimaps; |
| 983 | int quota_flag; |
| 984 | int rt; |
| 985 | xfs_trans_t *tp; |
| 986 | xfs_bmbt_irec_t imaps[1], *imapp; |
| 987 | xfs_bmap_free_t free_list; |
| 988 | uint qblocks, resblks, resrtextents; |
| 989 | int committed; |
| 990 | int error; |
| 991 | |
| 992 | trace_xfs_alloc_file_space(ip); |
| 993 | |
| 994 | if (XFS_FORCED_SHUTDOWN(mp)) |
| 995 | return XFS_ERROR(EIO); |
| 996 | |
| 997 | error = xfs_qm_dqattach(ip, 0); |
| 998 | if (error) |
| 999 | return error; |
| 1000 | |
| 1001 | if (len <= 0) |
| 1002 | return XFS_ERROR(EINVAL); |
| 1003 | |
| 1004 | rt = XFS_IS_REALTIME_INODE(ip); |
| 1005 | extsz = xfs_get_extsz_hint(ip); |
| 1006 | |
| 1007 | count = len; |
| 1008 | imapp = &imaps[0]; |
| 1009 | nimaps = 1; |
| 1010 | startoffset_fsb = XFS_B_TO_FSBT(mp, offset); |
| 1011 | allocatesize_fsb = XFS_B_TO_FSB(mp, count); |
| 1012 | |
| 1013 | /* |
| 1014 | * Allocate file space until done or until there is an error |
| 1015 | */ |
| 1016 | while (allocatesize_fsb && !error) { |
| 1017 | xfs_fileoff_t s, e; |
| 1018 | |
| 1019 | /* |
| 1020 | * Determine space reservations for data/realtime. |
| 1021 | */ |
| 1022 | if (unlikely(extsz)) { |
| 1023 | s = startoffset_fsb; |
| 1024 | do_div(s, extsz); |
| 1025 | s *= extsz; |
| 1026 | e = startoffset_fsb + allocatesize_fsb; |
| 1027 | if ((temp = do_mod(startoffset_fsb, extsz))) |
| 1028 | e += temp; |
| 1029 | if ((temp = do_mod(e, extsz))) |
| 1030 | e += extsz - temp; |
| 1031 | } else { |
| 1032 | s = 0; |
| 1033 | e = allocatesize_fsb; |
| 1034 | } |
| 1035 | |
| 1036 | /* |
| 1037 | * The transaction reservation is limited to a 32-bit block |
| 1038 | * count, hence we need to limit the number of blocks we are |
| 1039 | * trying to reserve to avoid an overflow. We can't allocate |
| 1040 | * more than @nimaps extents, and an extent is limited on disk |
| 1041 | * to MAXEXTLEN (21 bits), so use that to enforce the limit. |
| 1042 | */ |
| 1043 | resblks = min_t(xfs_fileoff_t, (e - s), (MAXEXTLEN * nimaps)); |
| 1044 | if (unlikely(rt)) { |
| 1045 | resrtextents = qblocks = resblks; |
| 1046 | resrtextents /= mp->m_sb.sb_rextsize; |
| 1047 | resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0); |
| 1048 | quota_flag = XFS_QMOPT_RES_RTBLKS; |
| 1049 | } else { |
| 1050 | resrtextents = 0; |
| 1051 | resblks = qblocks = XFS_DIOSTRAT_SPACE_RES(mp, resblks); |
| 1052 | quota_flag = XFS_QMOPT_RES_REGBLKS; |
| 1053 | } |
| 1054 | |
| 1055 | /* |
| 1056 | * Allocate and setup the transaction. |
| 1057 | */ |
| 1058 | tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT); |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 1059 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write, |
| 1060 | resblks, resrtextents); |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1061 | /* |
| 1062 | * Check for running out of space |
| 1063 | */ |
| 1064 | if (error) { |
| 1065 | /* |
| 1066 | * Free the transaction structure. |
| 1067 | */ |
| 1068 | ASSERT(error == ENOSPC || XFS_FORCED_SHUTDOWN(mp)); |
| 1069 | xfs_trans_cancel(tp, 0); |
| 1070 | break; |
| 1071 | } |
| 1072 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
| 1073 | error = xfs_trans_reserve_quota_nblks(tp, ip, qblocks, |
| 1074 | 0, quota_flag); |
| 1075 | if (error) |
| 1076 | goto error1; |
| 1077 | |
| 1078 | xfs_trans_ijoin(tp, ip, 0); |
| 1079 | |
| 1080 | xfs_bmap_init(&free_list, &firstfsb); |
| 1081 | error = xfs_bmapi_write(tp, ip, startoffset_fsb, |
| 1082 | allocatesize_fsb, alloc_type, &firstfsb, |
| 1083 | 0, imapp, &nimaps, &free_list); |
| 1084 | if (error) { |
| 1085 | goto error0; |
| 1086 | } |
| 1087 | |
| 1088 | /* |
| 1089 | * Complete the transaction |
| 1090 | */ |
| 1091 | error = xfs_bmap_finish(&tp, &free_list, &committed); |
| 1092 | if (error) { |
| 1093 | goto error0; |
| 1094 | } |
| 1095 | |
| 1096 | error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); |
| 1097 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 1098 | if (error) { |
| 1099 | break; |
| 1100 | } |
| 1101 | |
| 1102 | allocated_fsb = imapp->br_blockcount; |
| 1103 | |
| 1104 | if (nimaps == 0) { |
| 1105 | error = XFS_ERROR(ENOSPC); |
| 1106 | break; |
| 1107 | } |
| 1108 | |
| 1109 | startoffset_fsb += allocated_fsb; |
| 1110 | allocatesize_fsb -= allocated_fsb; |
| 1111 | } |
| 1112 | |
| 1113 | return error; |
| 1114 | |
| 1115 | error0: /* Cancel bmap, unlock inode, unreserve quota blocks, cancel trans */ |
| 1116 | xfs_bmap_cancel(&free_list); |
| 1117 | xfs_trans_unreserve_quota_nblks(tp, ip, (long)qblocks, 0, quota_flag); |
| 1118 | |
| 1119 | error1: /* Just cancel transaction */ |
| 1120 | xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES | XFS_TRANS_ABORT); |
| 1121 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 1122 | return error; |
| 1123 | } |
| 1124 | |
| 1125 | /* |
| 1126 | * Zero file bytes between startoff and endoff inclusive. |
| 1127 | * The iolock is held exclusive and no blocks are buffered. |
| 1128 | * |
| 1129 | * This function is used by xfs_free_file_space() to zero |
| 1130 | * partial blocks when the range to free is not block aligned. |
| 1131 | * When unreserving space with boundaries that are not block |
| 1132 | * aligned we round up the start and round down the end |
| 1133 | * boundaries and then use this function to zero the parts of |
| 1134 | * the blocks that got dropped during the rounding. |
| 1135 | */ |
| 1136 | STATIC int |
| 1137 | xfs_zero_remaining_bytes( |
| 1138 | xfs_inode_t *ip, |
| 1139 | xfs_off_t startoff, |
| 1140 | xfs_off_t endoff) |
| 1141 | { |
| 1142 | xfs_bmbt_irec_t imap; |
| 1143 | xfs_fileoff_t offset_fsb; |
| 1144 | xfs_off_t lastoffset; |
| 1145 | xfs_off_t offset; |
| 1146 | xfs_buf_t *bp; |
| 1147 | xfs_mount_t *mp = ip->i_mount; |
| 1148 | int nimap; |
| 1149 | int error = 0; |
| 1150 | |
| 1151 | /* |
| 1152 | * Avoid doing I/O beyond eof - it's not necessary |
| 1153 | * since nothing can read beyond eof. The space will |
| 1154 | * be zeroed when the file is extended anyway. |
| 1155 | */ |
| 1156 | if (startoff >= XFS_ISIZE(ip)) |
| 1157 | return 0; |
| 1158 | |
| 1159 | if (endoff > XFS_ISIZE(ip)) |
| 1160 | endoff = XFS_ISIZE(ip); |
| 1161 | |
| 1162 | bp = xfs_buf_get_uncached(XFS_IS_REALTIME_INODE(ip) ? |
| 1163 | mp->m_rtdev_targp : mp->m_ddev_targp, |
| 1164 | BTOBB(mp->m_sb.sb_blocksize), 0); |
| 1165 | if (!bp) |
| 1166 | return XFS_ERROR(ENOMEM); |
| 1167 | |
| 1168 | xfs_buf_unlock(bp); |
| 1169 | |
| 1170 | for (offset = startoff; offset <= endoff; offset = lastoffset + 1) { |
| 1171 | offset_fsb = XFS_B_TO_FSBT(mp, offset); |
| 1172 | nimap = 1; |
| 1173 | error = xfs_bmapi_read(ip, offset_fsb, 1, &imap, &nimap, 0); |
| 1174 | if (error || nimap < 1) |
| 1175 | break; |
| 1176 | ASSERT(imap.br_blockcount >= 1); |
| 1177 | ASSERT(imap.br_startoff == offset_fsb); |
| 1178 | lastoffset = XFS_FSB_TO_B(mp, imap.br_startoff + 1) - 1; |
| 1179 | if (lastoffset > endoff) |
| 1180 | lastoffset = endoff; |
| 1181 | if (imap.br_startblock == HOLESTARTBLOCK) |
| 1182 | continue; |
| 1183 | ASSERT(imap.br_startblock != DELAYSTARTBLOCK); |
| 1184 | if (imap.br_state == XFS_EXT_UNWRITTEN) |
| 1185 | continue; |
| 1186 | XFS_BUF_UNDONE(bp); |
| 1187 | XFS_BUF_UNWRITE(bp); |
| 1188 | XFS_BUF_READ(bp); |
| 1189 | XFS_BUF_SET_ADDR(bp, xfs_fsb_to_db(ip, imap.br_startblock)); |
| 1190 | xfsbdstrat(mp, bp); |
| 1191 | error = xfs_buf_iowait(bp); |
| 1192 | if (error) { |
| 1193 | xfs_buf_ioerror_alert(bp, |
| 1194 | "xfs_zero_remaining_bytes(read)"); |
| 1195 | break; |
| 1196 | } |
| 1197 | memset(bp->b_addr + |
| 1198 | (offset - XFS_FSB_TO_B(mp, imap.br_startoff)), |
| 1199 | 0, lastoffset - offset + 1); |
| 1200 | XFS_BUF_UNDONE(bp); |
| 1201 | XFS_BUF_UNREAD(bp); |
| 1202 | XFS_BUF_WRITE(bp); |
| 1203 | xfsbdstrat(mp, bp); |
| 1204 | error = xfs_buf_iowait(bp); |
| 1205 | if (error) { |
| 1206 | xfs_buf_ioerror_alert(bp, |
| 1207 | "xfs_zero_remaining_bytes(write)"); |
| 1208 | break; |
| 1209 | } |
| 1210 | } |
| 1211 | xfs_buf_free(bp); |
| 1212 | return error; |
| 1213 | } |
| 1214 | |
Christoph Hellwig | 83aee9e | 2013-10-12 00:55:07 -0700 | [diff] [blame] | 1215 | int |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1216 | xfs_free_file_space( |
Christoph Hellwig | 83aee9e | 2013-10-12 00:55:07 -0700 | [diff] [blame] | 1217 | struct xfs_inode *ip, |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1218 | xfs_off_t offset, |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1219 | xfs_off_t len) |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1220 | { |
| 1221 | int committed; |
| 1222 | int done; |
| 1223 | xfs_fileoff_t endoffset_fsb; |
| 1224 | int error; |
| 1225 | xfs_fsblock_t firstfsb; |
| 1226 | xfs_bmap_free_t free_list; |
| 1227 | xfs_bmbt_irec_t imap; |
| 1228 | xfs_off_t ioffset; |
| 1229 | xfs_extlen_t mod=0; |
| 1230 | xfs_mount_t *mp; |
| 1231 | int nimap; |
| 1232 | uint resblks; |
| 1233 | xfs_off_t rounding; |
| 1234 | int rt; |
| 1235 | xfs_fileoff_t startoffset_fsb; |
| 1236 | xfs_trans_t *tp; |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1237 | |
| 1238 | mp = ip->i_mount; |
| 1239 | |
| 1240 | trace_xfs_free_file_space(ip); |
| 1241 | |
| 1242 | error = xfs_qm_dqattach(ip, 0); |
| 1243 | if (error) |
| 1244 | return error; |
| 1245 | |
| 1246 | error = 0; |
| 1247 | if (len <= 0) /* if nothing being freed */ |
| 1248 | return error; |
| 1249 | rt = XFS_IS_REALTIME_INODE(ip); |
| 1250 | startoffset_fsb = XFS_B_TO_FSB(mp, offset); |
| 1251 | endoffset_fsb = XFS_B_TO_FSBT(mp, offset + len); |
| 1252 | |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1253 | /* wait for the completion of any pending DIOs */ |
| 1254 | inode_dio_wait(VFS_I(ip)); |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1255 | |
| 1256 | rounding = max_t(xfs_off_t, 1 << mp->m_sb.sb_blocklog, PAGE_CACHE_SIZE); |
| 1257 | ioffset = offset & ~(rounding - 1); |
| 1258 | error = -filemap_write_and_wait_range(VFS_I(ip)->i_mapping, |
| 1259 | ioffset, -1); |
| 1260 | if (error) |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1261 | goto out; |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1262 | truncate_pagecache_range(VFS_I(ip), ioffset, -1); |
| 1263 | |
| 1264 | /* |
| 1265 | * Need to zero the stuff we're not freeing, on disk. |
| 1266 | * If it's a realtime file & can't use unwritten extents then we |
| 1267 | * actually need to zero the extent edges. Otherwise xfs_bunmapi |
| 1268 | * will take care of it for us. |
| 1269 | */ |
| 1270 | if (rt && !xfs_sb_version_hasextflgbit(&mp->m_sb)) { |
| 1271 | nimap = 1; |
| 1272 | error = xfs_bmapi_read(ip, startoffset_fsb, 1, |
| 1273 | &imap, &nimap, 0); |
| 1274 | if (error) |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1275 | goto out; |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1276 | ASSERT(nimap == 0 || nimap == 1); |
| 1277 | if (nimap && imap.br_startblock != HOLESTARTBLOCK) { |
| 1278 | xfs_daddr_t block; |
| 1279 | |
| 1280 | ASSERT(imap.br_startblock != DELAYSTARTBLOCK); |
| 1281 | block = imap.br_startblock; |
| 1282 | mod = do_div(block, mp->m_sb.sb_rextsize); |
| 1283 | if (mod) |
| 1284 | startoffset_fsb += mp->m_sb.sb_rextsize - mod; |
| 1285 | } |
| 1286 | nimap = 1; |
| 1287 | error = xfs_bmapi_read(ip, endoffset_fsb - 1, 1, |
| 1288 | &imap, &nimap, 0); |
| 1289 | if (error) |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1290 | goto out; |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1291 | ASSERT(nimap == 0 || nimap == 1); |
| 1292 | if (nimap && imap.br_startblock != HOLESTARTBLOCK) { |
| 1293 | ASSERT(imap.br_startblock != DELAYSTARTBLOCK); |
| 1294 | mod++; |
| 1295 | if (mod && (mod != mp->m_sb.sb_rextsize)) |
| 1296 | endoffset_fsb -= mod; |
| 1297 | } |
| 1298 | } |
| 1299 | if ((done = (endoffset_fsb <= startoffset_fsb))) |
| 1300 | /* |
| 1301 | * One contiguous piece to clear |
| 1302 | */ |
| 1303 | error = xfs_zero_remaining_bytes(ip, offset, offset + len - 1); |
| 1304 | else { |
| 1305 | /* |
| 1306 | * Some full blocks, possibly two pieces to clear |
| 1307 | */ |
| 1308 | if (offset < XFS_FSB_TO_B(mp, startoffset_fsb)) |
| 1309 | error = xfs_zero_remaining_bytes(ip, offset, |
| 1310 | XFS_FSB_TO_B(mp, startoffset_fsb) - 1); |
| 1311 | if (!error && |
| 1312 | XFS_FSB_TO_B(mp, endoffset_fsb) < offset + len) |
| 1313 | error = xfs_zero_remaining_bytes(ip, |
| 1314 | XFS_FSB_TO_B(mp, endoffset_fsb), |
| 1315 | offset + len - 1); |
| 1316 | } |
| 1317 | |
| 1318 | /* |
| 1319 | * free file space until done or until there is an error |
| 1320 | */ |
| 1321 | resblks = XFS_DIOSTRAT_SPACE_RES(mp, 0); |
| 1322 | while (!error && !done) { |
| 1323 | |
| 1324 | /* |
| 1325 | * allocate and setup the transaction. Allow this |
| 1326 | * transaction to dip into the reserve blocks to ensure |
| 1327 | * the freeing of the space succeeds at ENOSPC. |
| 1328 | */ |
| 1329 | tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT); |
| 1330 | tp->t_flags |= XFS_TRANS_RESERVE; |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 1331 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write, resblks, 0); |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1332 | |
| 1333 | /* |
| 1334 | * check for running out of space |
| 1335 | */ |
| 1336 | if (error) { |
| 1337 | /* |
| 1338 | * Free the transaction structure. |
| 1339 | */ |
| 1340 | ASSERT(error == ENOSPC || XFS_FORCED_SHUTDOWN(mp)); |
| 1341 | xfs_trans_cancel(tp, 0); |
| 1342 | break; |
| 1343 | } |
| 1344 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
| 1345 | error = xfs_trans_reserve_quota(tp, mp, |
| 1346 | ip->i_udquot, ip->i_gdquot, ip->i_pdquot, |
| 1347 | resblks, 0, XFS_QMOPT_RES_REGBLKS); |
| 1348 | if (error) |
| 1349 | goto error1; |
| 1350 | |
| 1351 | xfs_trans_ijoin(tp, ip, 0); |
| 1352 | |
| 1353 | /* |
| 1354 | * issue the bunmapi() call to free the blocks |
| 1355 | */ |
| 1356 | xfs_bmap_init(&free_list, &firstfsb); |
| 1357 | error = xfs_bunmapi(tp, ip, startoffset_fsb, |
| 1358 | endoffset_fsb - startoffset_fsb, |
| 1359 | 0, 2, &firstfsb, &free_list, &done); |
| 1360 | if (error) { |
| 1361 | goto error0; |
| 1362 | } |
| 1363 | |
| 1364 | /* |
| 1365 | * complete the transaction |
| 1366 | */ |
| 1367 | error = xfs_bmap_finish(&tp, &free_list, &committed); |
| 1368 | if (error) { |
| 1369 | goto error0; |
| 1370 | } |
| 1371 | |
| 1372 | error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); |
| 1373 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 1374 | } |
| 1375 | |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1376 | out: |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1377 | return error; |
| 1378 | |
| 1379 | error0: |
| 1380 | xfs_bmap_cancel(&free_list); |
| 1381 | error1: |
| 1382 | xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES | XFS_TRANS_ABORT); |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1383 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 1384 | goto out; |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1385 | } |
| 1386 | |
| 1387 | |
Christoph Hellwig | 865e944 | 2013-10-12 00:55:08 -0700 | [diff] [blame] | 1388 | int |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1389 | xfs_zero_file_space( |
| 1390 | struct xfs_inode *ip, |
| 1391 | xfs_off_t offset, |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1392 | xfs_off_t len) |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1393 | { |
| 1394 | struct xfs_mount *mp = ip->i_mount; |
| 1395 | uint granularity; |
| 1396 | xfs_off_t start_boundary; |
| 1397 | xfs_off_t end_boundary; |
| 1398 | int error; |
| 1399 | |
| 1400 | granularity = max_t(uint, 1 << mp->m_sb.sb_blocklog, PAGE_CACHE_SIZE); |
| 1401 | |
| 1402 | /* |
| 1403 | * Round the range of extents we are going to convert inwards. If the |
| 1404 | * offset is aligned, then it doesn't get changed so we zero from the |
| 1405 | * start of the block offset points to. |
| 1406 | */ |
| 1407 | start_boundary = round_up(offset, granularity); |
| 1408 | end_boundary = round_down(offset + len, granularity); |
| 1409 | |
| 1410 | ASSERT(start_boundary >= offset); |
| 1411 | ASSERT(end_boundary <= offset + len); |
| 1412 | |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1413 | if (start_boundary < end_boundary - 1) { |
| 1414 | /* punch out the page cache over the conversion range */ |
| 1415 | truncate_pagecache_range(VFS_I(ip), start_boundary, |
| 1416 | end_boundary - 1); |
| 1417 | /* convert the blocks */ |
| 1418 | error = xfs_alloc_file_space(ip, start_boundary, |
| 1419 | end_boundary - start_boundary - 1, |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1420 | XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT); |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1421 | if (error) |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1422 | goto out; |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1423 | |
| 1424 | /* We've handled the interior of the range, now for the edges */ |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1425 | if (start_boundary != offset) { |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1426 | error = xfs_iozero(ip, offset, start_boundary - offset); |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1427 | if (error) |
| 1428 | goto out; |
| 1429 | } |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1430 | |
| 1431 | if (end_boundary != offset + len) |
| 1432 | error = xfs_iozero(ip, end_boundary, |
| 1433 | offset + len - end_boundary); |
| 1434 | |
| 1435 | } else { |
| 1436 | /* |
| 1437 | * It's either a sub-granularity range or the range spanned lies |
| 1438 | * partially across two adjacent blocks. |
| 1439 | */ |
| 1440 | error = xfs_iozero(ip, offset, len); |
| 1441 | } |
| 1442 | |
Christoph Hellwig | 5f8aca8 | 2013-10-12 00:55:06 -0700 | [diff] [blame] | 1443 | out: |
Dave Chinner | c24b5df | 2013-08-12 20:49:45 +1000 | [diff] [blame] | 1444 | return error; |
| 1445 | |
| 1446 | } |
| 1447 | |
| 1448 | /* |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1449 | * We need to check that the format of the data fork in the temporary inode is |
| 1450 | * valid for the target inode before doing the swap. This is not a problem with |
| 1451 | * attr1 because of the fixed fork offset, but attr2 has a dynamically sized |
| 1452 | * data fork depending on the space the attribute fork is taking so we can get |
| 1453 | * invalid formats on the target inode. |
| 1454 | * |
| 1455 | * E.g. target has space for 7 extents in extent format, temp inode only has |
| 1456 | * space for 6. If we defragment down to 7 extents, then the tmp format is a |
| 1457 | * btree, but when swapped it needs to be in extent format. Hence we can't just |
| 1458 | * blindly swap data forks on attr2 filesystems. |
| 1459 | * |
| 1460 | * Note that we check the swap in both directions so that we don't end up with |
| 1461 | * a corrupt temporary inode, either. |
| 1462 | * |
| 1463 | * Note that fixing the way xfs_fsr sets up the attribute fork in the source |
| 1464 | * inode will prevent this situation from occurring, so all we do here is |
| 1465 | * reject and log the attempt. basically we are putting the responsibility on |
| 1466 | * userspace to get this right. |
| 1467 | */ |
| 1468 | static int |
| 1469 | xfs_swap_extents_check_format( |
| 1470 | xfs_inode_t *ip, /* target inode */ |
| 1471 | xfs_inode_t *tip) /* tmp inode */ |
| 1472 | { |
| 1473 | |
| 1474 | /* Should never get a local format */ |
| 1475 | if (ip->i_d.di_format == XFS_DINODE_FMT_LOCAL || |
| 1476 | tip->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
| 1477 | return EINVAL; |
| 1478 | |
| 1479 | /* |
| 1480 | * if the target inode has less extents that then temporary inode then |
| 1481 | * why did userspace call us? |
| 1482 | */ |
| 1483 | if (ip->i_d.di_nextents < tip->i_d.di_nextents) |
| 1484 | return EINVAL; |
| 1485 | |
| 1486 | /* |
| 1487 | * if the target inode is in extent form and the temp inode is in btree |
| 1488 | * form then we will end up with the target inode in the wrong format |
| 1489 | * as we already know there are less extents in the temp inode. |
| 1490 | */ |
| 1491 | if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS && |
| 1492 | tip->i_d.di_format == XFS_DINODE_FMT_BTREE) |
| 1493 | return EINVAL; |
| 1494 | |
| 1495 | /* Check temp in extent form to max in target */ |
| 1496 | if (tip->i_d.di_format == XFS_DINODE_FMT_EXTENTS && |
| 1497 | XFS_IFORK_NEXTENTS(tip, XFS_DATA_FORK) > |
| 1498 | XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK)) |
| 1499 | return EINVAL; |
| 1500 | |
| 1501 | /* Check target in extent form to max in temp */ |
| 1502 | if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS && |
| 1503 | XFS_IFORK_NEXTENTS(ip, XFS_DATA_FORK) > |
| 1504 | XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK)) |
| 1505 | return EINVAL; |
| 1506 | |
| 1507 | /* |
| 1508 | * If we are in a btree format, check that the temp root block will fit |
| 1509 | * in the target and that it has enough extents to be in btree format |
| 1510 | * in the target. |
| 1511 | * |
| 1512 | * Note that we have to be careful to allow btree->extent conversions |
| 1513 | * (a common defrag case) which will occur when the temp inode is in |
| 1514 | * extent format... |
| 1515 | */ |
| 1516 | if (tip->i_d.di_format == XFS_DINODE_FMT_BTREE) { |
| 1517 | if (XFS_IFORK_BOFF(ip) && |
| 1518 | XFS_BMAP_BMDR_SPACE(tip->i_df.if_broot) > XFS_IFORK_BOFF(ip)) |
| 1519 | return EINVAL; |
| 1520 | if (XFS_IFORK_NEXTENTS(tip, XFS_DATA_FORK) <= |
| 1521 | XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK)) |
| 1522 | return EINVAL; |
| 1523 | } |
| 1524 | |
| 1525 | /* Reciprocal target->temp btree format checks */ |
| 1526 | if (ip->i_d.di_format == XFS_DINODE_FMT_BTREE) { |
| 1527 | if (XFS_IFORK_BOFF(tip) && |
| 1528 | XFS_BMAP_BMDR_SPACE(ip->i_df.if_broot) > XFS_IFORK_BOFF(tip)) |
| 1529 | return EINVAL; |
| 1530 | if (XFS_IFORK_NEXTENTS(ip, XFS_DATA_FORK) <= |
| 1531 | XFS_IFORK_MAXEXT(tip, XFS_DATA_FORK)) |
| 1532 | return EINVAL; |
| 1533 | } |
| 1534 | |
| 1535 | return 0; |
| 1536 | } |
| 1537 | |
| 1538 | int |
| 1539 | xfs_swap_extents( |
| 1540 | xfs_inode_t *ip, /* target inode */ |
| 1541 | xfs_inode_t *tip, /* tmp inode */ |
| 1542 | xfs_swapext_t *sxp) |
| 1543 | { |
| 1544 | xfs_mount_t *mp = ip->i_mount; |
| 1545 | xfs_trans_t *tp; |
| 1546 | xfs_bstat_t *sbp = &sxp->sx_stat; |
| 1547 | xfs_ifork_t *tempifp, *ifp, *tifp; |
| 1548 | int src_log_flags, target_log_flags; |
| 1549 | int error = 0; |
| 1550 | int aforkblks = 0; |
| 1551 | int taforkblks = 0; |
| 1552 | __uint64_t tmp; |
| 1553 | |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1554 | tempifp = kmem_alloc(sizeof(xfs_ifork_t), KM_MAYFAIL); |
| 1555 | if (!tempifp) { |
| 1556 | error = XFS_ERROR(ENOMEM); |
| 1557 | goto out; |
| 1558 | } |
| 1559 | |
| 1560 | /* |
| 1561 | * we have to do two separate lock calls here to keep lockdep |
| 1562 | * happy. If we try to get all the locks in one call, lock will |
| 1563 | * report false positives when we drop the ILOCK and regain them |
| 1564 | * below. |
| 1565 | */ |
| 1566 | xfs_lock_two_inodes(ip, tip, XFS_IOLOCK_EXCL); |
| 1567 | xfs_lock_two_inodes(ip, tip, XFS_ILOCK_EXCL); |
| 1568 | |
| 1569 | /* Verify that both files have the same format */ |
| 1570 | if ((ip->i_d.di_mode & S_IFMT) != (tip->i_d.di_mode & S_IFMT)) { |
| 1571 | error = XFS_ERROR(EINVAL); |
| 1572 | goto out_unlock; |
| 1573 | } |
| 1574 | |
| 1575 | /* Verify both files are either real-time or non-realtime */ |
| 1576 | if (XFS_IS_REALTIME_INODE(ip) != XFS_IS_REALTIME_INODE(tip)) { |
| 1577 | error = XFS_ERROR(EINVAL); |
| 1578 | goto out_unlock; |
| 1579 | } |
| 1580 | |
| 1581 | error = -filemap_write_and_wait(VFS_I(tip)->i_mapping); |
| 1582 | if (error) |
| 1583 | goto out_unlock; |
| 1584 | truncate_pagecache_range(VFS_I(tip), 0, -1); |
| 1585 | |
| 1586 | /* Verify O_DIRECT for ftmp */ |
| 1587 | if (VN_CACHED(VFS_I(tip)) != 0) { |
| 1588 | error = XFS_ERROR(EINVAL); |
| 1589 | goto out_unlock; |
| 1590 | } |
| 1591 | |
| 1592 | /* Verify all data are being swapped */ |
| 1593 | if (sxp->sx_offset != 0 || |
| 1594 | sxp->sx_length != ip->i_d.di_size || |
| 1595 | sxp->sx_length != tip->i_d.di_size) { |
| 1596 | error = XFS_ERROR(EFAULT); |
| 1597 | goto out_unlock; |
| 1598 | } |
| 1599 | |
| 1600 | trace_xfs_swap_extent_before(ip, 0); |
| 1601 | trace_xfs_swap_extent_before(tip, 1); |
| 1602 | |
| 1603 | /* check inode formats now that data is flushed */ |
| 1604 | error = xfs_swap_extents_check_format(ip, tip); |
| 1605 | if (error) { |
| 1606 | xfs_notice(mp, |
| 1607 | "%s: inode 0x%llx format is incompatible for exchanging.", |
| 1608 | __func__, ip->i_ino); |
| 1609 | goto out_unlock; |
| 1610 | } |
| 1611 | |
| 1612 | /* |
| 1613 | * Compare the current change & modify times with that |
| 1614 | * passed in. If they differ, we abort this swap. |
| 1615 | * This is the mechanism used to ensure the calling |
| 1616 | * process that the file was not changed out from |
| 1617 | * under it. |
| 1618 | */ |
| 1619 | if ((sbp->bs_ctime.tv_sec != VFS_I(ip)->i_ctime.tv_sec) || |
| 1620 | (sbp->bs_ctime.tv_nsec != VFS_I(ip)->i_ctime.tv_nsec) || |
| 1621 | (sbp->bs_mtime.tv_sec != VFS_I(ip)->i_mtime.tv_sec) || |
| 1622 | (sbp->bs_mtime.tv_nsec != VFS_I(ip)->i_mtime.tv_nsec)) { |
| 1623 | error = XFS_ERROR(EBUSY); |
| 1624 | goto out_unlock; |
| 1625 | } |
| 1626 | |
| 1627 | /* We need to fail if the file is memory mapped. Once we have tossed |
| 1628 | * all existing pages, the page fault will have no option |
| 1629 | * but to go to the filesystem for pages. By making the page fault call |
| 1630 | * vop_read (or write in the case of autogrow) they block on the iolock |
| 1631 | * until we have switched the extents. |
| 1632 | */ |
| 1633 | if (VN_MAPPED(VFS_I(ip))) { |
| 1634 | error = XFS_ERROR(EBUSY); |
| 1635 | goto out_unlock; |
| 1636 | } |
| 1637 | |
| 1638 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 1639 | xfs_iunlock(tip, XFS_ILOCK_EXCL); |
| 1640 | |
| 1641 | /* |
| 1642 | * There is a race condition here since we gave up the |
| 1643 | * ilock. However, the data fork will not change since |
| 1644 | * we have the iolock (locked for truncation too) so we |
| 1645 | * are safe. We don't really care if non-io related |
| 1646 | * fields change. |
| 1647 | */ |
| 1648 | truncate_pagecache_range(VFS_I(ip), 0, -1); |
| 1649 | |
| 1650 | tp = xfs_trans_alloc(mp, XFS_TRANS_SWAPEXT); |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 1651 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_ichange, 0, 0); |
| 1652 | if (error) { |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1653 | xfs_iunlock(ip, XFS_IOLOCK_EXCL); |
| 1654 | xfs_iunlock(tip, XFS_IOLOCK_EXCL); |
| 1655 | xfs_trans_cancel(tp, 0); |
| 1656 | goto out; |
| 1657 | } |
| 1658 | xfs_lock_two_inodes(ip, tip, XFS_ILOCK_EXCL); |
| 1659 | |
| 1660 | /* |
| 1661 | * Count the number of extended attribute blocks |
| 1662 | */ |
| 1663 | if ( ((XFS_IFORK_Q(ip) != 0) && (ip->i_d.di_anextents > 0)) && |
| 1664 | (ip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)) { |
| 1665 | error = xfs_bmap_count_blocks(tp, ip, XFS_ATTR_FORK, &aforkblks); |
| 1666 | if (error) |
| 1667 | goto out_trans_cancel; |
| 1668 | } |
| 1669 | if ( ((XFS_IFORK_Q(tip) != 0) && (tip->i_d.di_anextents > 0)) && |
| 1670 | (tip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)) { |
| 1671 | error = xfs_bmap_count_blocks(tp, tip, XFS_ATTR_FORK, |
| 1672 | &taforkblks); |
| 1673 | if (error) |
| 1674 | goto out_trans_cancel; |
| 1675 | } |
| 1676 | |
Dave Chinner | 21b5c97 | 2013-08-30 10:23:44 +1000 | [diff] [blame] | 1677 | xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL); |
| 1678 | xfs_trans_ijoin(tp, tip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL); |
| 1679 | |
| 1680 | /* |
| 1681 | * Before we've swapped the forks, lets set the owners of the forks |
| 1682 | * appropriately. We have to do this as we are demand paging the btree |
| 1683 | * buffers, and so the validation done on read will expect the owner |
| 1684 | * field to be correctly set. Once we change the owners, we can swap the |
| 1685 | * inode forks. |
| 1686 | * |
| 1687 | * Note the trickiness in setting the log flags - we set the owner log |
| 1688 | * flag on the opposite inode (i.e. the inode we are setting the new |
| 1689 | * owner to be) because once we swap the forks and log that, log |
| 1690 | * recovery is going to see the fork as owned by the swapped inode, |
| 1691 | * not the pre-swapped inodes. |
| 1692 | */ |
| 1693 | src_log_flags = XFS_ILOG_CORE; |
| 1694 | target_log_flags = XFS_ILOG_CORE; |
| 1695 | if (ip->i_d.di_version == 3 && |
| 1696 | ip->i_d.di_format == XFS_DINODE_FMT_BTREE) { |
Dave Chinner | 638f4416 | 2013-08-30 10:23:45 +1000 | [diff] [blame] | 1697 | target_log_flags |= XFS_ILOG_DOWNER; |
| 1698 | error = xfs_bmbt_change_owner(tp, ip, XFS_DATA_FORK, |
| 1699 | tip->i_ino, NULL); |
Dave Chinner | 21b5c97 | 2013-08-30 10:23:44 +1000 | [diff] [blame] | 1700 | if (error) |
| 1701 | goto out_trans_cancel; |
| 1702 | } |
| 1703 | |
| 1704 | if (tip->i_d.di_version == 3 && |
| 1705 | tip->i_d.di_format == XFS_DINODE_FMT_BTREE) { |
Dave Chinner | 638f4416 | 2013-08-30 10:23:45 +1000 | [diff] [blame] | 1706 | src_log_flags |= XFS_ILOG_DOWNER; |
| 1707 | error = xfs_bmbt_change_owner(tp, tip, XFS_DATA_FORK, |
| 1708 | ip->i_ino, NULL); |
Dave Chinner | 21b5c97 | 2013-08-30 10:23:44 +1000 | [diff] [blame] | 1709 | if (error) |
| 1710 | goto out_trans_cancel; |
| 1711 | } |
| 1712 | |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1713 | /* |
| 1714 | * Swap the data forks of the inodes |
| 1715 | */ |
| 1716 | ifp = &ip->i_df; |
| 1717 | tifp = &tip->i_df; |
| 1718 | *tempifp = *ifp; /* struct copy */ |
| 1719 | *ifp = *tifp; /* struct copy */ |
| 1720 | *tifp = *tempifp; /* struct copy */ |
| 1721 | |
| 1722 | /* |
| 1723 | * Fix the on-disk inode values |
| 1724 | */ |
| 1725 | tmp = (__uint64_t)ip->i_d.di_nblocks; |
| 1726 | ip->i_d.di_nblocks = tip->i_d.di_nblocks - taforkblks + aforkblks; |
| 1727 | tip->i_d.di_nblocks = tmp + taforkblks - aforkblks; |
| 1728 | |
| 1729 | tmp = (__uint64_t) ip->i_d.di_nextents; |
| 1730 | ip->i_d.di_nextents = tip->i_d.di_nextents; |
| 1731 | tip->i_d.di_nextents = tmp; |
| 1732 | |
| 1733 | tmp = (__uint64_t) ip->i_d.di_format; |
| 1734 | ip->i_d.di_format = tip->i_d.di_format; |
| 1735 | tip->i_d.di_format = tmp; |
| 1736 | |
| 1737 | /* |
| 1738 | * The extents in the source inode could still contain speculative |
| 1739 | * preallocation beyond EOF (e.g. the file is open but not modified |
| 1740 | * while defrag is in progress). In that case, we need to copy over the |
| 1741 | * number of delalloc blocks the data fork in the source inode is |
| 1742 | * tracking beyond EOF so that when the fork is truncated away when the |
| 1743 | * temporary inode is unlinked we don't underrun the i_delayed_blks |
| 1744 | * counter on that inode. |
| 1745 | */ |
| 1746 | ASSERT(tip->i_delayed_blks == 0); |
| 1747 | tip->i_delayed_blks = ip->i_delayed_blks; |
| 1748 | ip->i_delayed_blks = 0; |
| 1749 | |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1750 | switch (ip->i_d.di_format) { |
| 1751 | case XFS_DINODE_FMT_EXTENTS: |
| 1752 | /* If the extents fit in the inode, fix the |
| 1753 | * pointer. Otherwise it's already NULL or |
| 1754 | * pointing to the extent. |
| 1755 | */ |
| 1756 | if (ip->i_d.di_nextents <= XFS_INLINE_EXTS) { |
| 1757 | ifp->if_u1.if_extents = |
| 1758 | ifp->if_u2.if_inline_ext; |
| 1759 | } |
| 1760 | src_log_flags |= XFS_ILOG_DEXT; |
| 1761 | break; |
| 1762 | case XFS_DINODE_FMT_BTREE: |
Dave Chinner | 21b5c97 | 2013-08-30 10:23:44 +1000 | [diff] [blame] | 1763 | ASSERT(ip->i_d.di_version < 3 || |
Dave Chinner | 638f4416 | 2013-08-30 10:23:45 +1000 | [diff] [blame] | 1764 | (src_log_flags & XFS_ILOG_DOWNER)); |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1765 | src_log_flags |= XFS_ILOG_DBROOT; |
| 1766 | break; |
| 1767 | } |
| 1768 | |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1769 | switch (tip->i_d.di_format) { |
| 1770 | case XFS_DINODE_FMT_EXTENTS: |
| 1771 | /* If the extents fit in the inode, fix the |
| 1772 | * pointer. Otherwise it's already NULL or |
| 1773 | * pointing to the extent. |
| 1774 | */ |
| 1775 | if (tip->i_d.di_nextents <= XFS_INLINE_EXTS) { |
| 1776 | tifp->if_u1.if_extents = |
| 1777 | tifp->if_u2.if_inline_ext; |
| 1778 | } |
| 1779 | target_log_flags |= XFS_ILOG_DEXT; |
| 1780 | break; |
| 1781 | case XFS_DINODE_FMT_BTREE: |
| 1782 | target_log_flags |= XFS_ILOG_DBROOT; |
Dave Chinner | 21b5c97 | 2013-08-30 10:23:44 +1000 | [diff] [blame] | 1783 | ASSERT(tip->i_d.di_version < 3 || |
Dave Chinner | 638f4416 | 2013-08-30 10:23:45 +1000 | [diff] [blame] | 1784 | (target_log_flags & XFS_ILOG_DOWNER)); |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1785 | break; |
| 1786 | } |
| 1787 | |
Dave Chinner | a133d95 | 2013-08-12 20:49:48 +1000 | [diff] [blame] | 1788 | xfs_trans_log_inode(tp, ip, src_log_flags); |
| 1789 | xfs_trans_log_inode(tp, tip, target_log_flags); |
| 1790 | |
| 1791 | /* |
| 1792 | * If this is a synchronous mount, make sure that the |
| 1793 | * transaction goes to disk before returning to the user. |
| 1794 | */ |
| 1795 | if (mp->m_flags & XFS_MOUNT_WSYNC) |
| 1796 | xfs_trans_set_sync(tp); |
| 1797 | |
| 1798 | error = xfs_trans_commit(tp, 0); |
| 1799 | |
| 1800 | trace_xfs_swap_extent_after(ip, 0); |
| 1801 | trace_xfs_swap_extent_after(tip, 1); |
| 1802 | out: |
| 1803 | kmem_free(tempifp); |
| 1804 | return error; |
| 1805 | |
| 1806 | out_unlock: |
| 1807 | xfs_iunlock(ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL); |
| 1808 | xfs_iunlock(tip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL); |
| 1809 | goto out; |
| 1810 | |
| 1811 | out_trans_cancel: |
| 1812 | xfs_trans_cancel(tp, 0); |
| 1813 | goto out_unlock; |
| 1814 | } |