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