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