]> git.ipfire.org Git - thirdparty/xfsprogs-dev.git/blob - libxfs/xfs_bmap.c
projects / thirdparty / xfsprogs-dev.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
xfs: Process allocated extent in a separate function
[thirdparty/xfsprogs-dev.git] / libxfs / xfs_bmap.c
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6 #include "libxfs_priv.h"
7 #include "xfs_fs.h"
8 #include "xfs_shared.h"
9 #include "xfs_format.h"
10 #include "xfs_log_format.h"
11 #include "xfs_trans_resv.h"
12 #include "xfs_bit.h"
13 #include "xfs_sb.h"
14 #include "xfs_mount.h"
15 #include "xfs_defer.h"
16 #include "xfs_dir2.h"
17 #include "xfs_inode.h"
18 #include "xfs_btree.h"
19 #include "xfs_trans.h"
20 #include "xfs_alloc.h"
21 #include "xfs_bmap.h"
22 #include "xfs_bmap_btree.h"
23 #include "xfs_errortag.h"
24 #include "xfs_trans_space.h"
25 #include "xfs_trace.h"
26 #include "xfs_attr_leaf.h"
27 #include "xfs_quota_defs.h"
28 #include "xfs_rmap.h"
29 #include "xfs_ag_resv.h"
30 #include "xfs_refcount.h"
31
32
33 kmem_zone_t *xfs_bmap_free_item_zone;
34
35 /*
36 * Miscellaneous helper functions
37 */
38
39 /*
40 * Compute and fill in the value of the maximum depth of a bmap btree
41 * in this filesystem. Done once, during mount.
42 */
43 void
44 xfs_bmap_compute_maxlevels(
45 xfs_mount_t *mp, /* file system mount structure */
46 int whichfork) /* data or attr fork */
47 {
48 int level; /* btree level */
49 uint maxblocks; /* max blocks at this level */
50 uint maxleafents; /* max leaf entries possible */
51 int maxrootrecs; /* max records in root block */
52 int minleafrecs; /* min records in leaf block */
53 int minnoderecs; /* min records in node block */
54 int sz; /* root block size */
55
56 /*
57 * The maximum number of extents in a file, hence the maximum number of
58 * leaf entries, is controlled by the size of the on-disk extent count,
59 * either a signed 32-bit number for the data fork, or a signed 16-bit
60 * number for the attr fork.
61 *
62 * Note that we can no longer assume that if we are in ATTR1 that
63 * the fork offset of all the inodes will be
64 * (xfs_default_attroffset(ip) >> 3) because we could have mounted
65 * with ATTR2 and then mounted back with ATTR1, keeping the
66 * di_forkoff's fixed but probably at various positions. Therefore,
67 * for both ATTR1 and ATTR2 we have to assume the worst case scenario
68 * of a minimum size available.
69 */
70 if (whichfork == XFS_DATA_FORK) {
71 maxleafents = MAXEXTNUM;
72 sz = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
73 } else {
74 maxleafents = MAXAEXTNUM;
75 sz = XFS_BMDR_SPACE_CALC(MINABTPTRS);
76 }
77 maxrootrecs = xfs_bmdr_maxrecs(sz, 0);
78 minleafrecs = mp->m_bmap_dmnr[0];
79 minnoderecs = mp->m_bmap_dmnr[1];
80 maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs;
81 for (level = 1; maxblocks > 1; level++) {
82 if (maxblocks <= maxrootrecs)
83 maxblocks = 1;
84 else
85 maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs;
86 }
87 mp->m_bm_maxlevels[whichfork] = level;
88 }
89
90 STATIC int /* error */
91 xfs_bmbt_lookup_eq(
92 struct xfs_btree_cur *cur,
93 struct xfs_bmbt_irec *irec,
94 int *stat) /* success/failure */
95 {
96 cur->bc_rec.b = *irec;
97 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
98 }
99
100 STATIC int /* error */
101 xfs_bmbt_lookup_first(
102 struct xfs_btree_cur *cur,
103 int *stat) /* success/failure */
104 {
105 cur->bc_rec.b.br_startoff = 0;
106 cur->bc_rec.b.br_startblock = 0;
107 cur->bc_rec.b.br_blockcount = 0;
108 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
109 }
110
111 /*
112 * Check if the inode needs to be converted to btree format.
113 */
114 static inline bool xfs_bmap_needs_btree(struct xfs_inode *ip, int whichfork)
115 {
116 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
117
118 return whichfork != XFS_COW_FORK &&
119 ifp->if_format == XFS_DINODE_FMT_EXTENTS &&
120 ifp->if_nextents > XFS_IFORK_MAXEXT(ip, whichfork);
121 }
122
123 /*
124 * Check if the inode should be converted to extent format.
125 */
126 static inline bool xfs_bmap_wants_extents(struct xfs_inode *ip, int whichfork)
127 {
128 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
129
130 return whichfork != XFS_COW_FORK &&
131 ifp->if_format == XFS_DINODE_FMT_BTREE &&
132 ifp->if_nextents <= XFS_IFORK_MAXEXT(ip, whichfork);
133 }
134
135 /*
136 * Update the record referred to by cur to the value given by irec
137 * This either works (return 0) or gets an EFSCORRUPTED error.
138 */
139 STATIC int
140 xfs_bmbt_update(
141 struct xfs_btree_cur *cur,
142 struct xfs_bmbt_irec *irec)
143 {
144 union xfs_btree_rec rec;
145
146 xfs_bmbt_disk_set_all(&rec.bmbt, irec);
147 return xfs_btree_update(cur, &rec);
148 }
149
150 /*
151 * Compute the worst-case number of indirect blocks that will be used
152 * for ip's delayed extent of length "len".
153 */
154 STATIC xfs_filblks_t
155 xfs_bmap_worst_indlen(
156 xfs_inode_t *ip, /* incore inode pointer */
157 xfs_filblks_t len) /* delayed extent length */
158 {
159 int level; /* btree level number */
160 int maxrecs; /* maximum record count at this level */
161 xfs_mount_t *mp; /* mount structure */
162 xfs_filblks_t rval; /* return value */
163
164 mp = ip->i_mount;
165 maxrecs = mp->m_bmap_dmxr[0];
166 for (level = 0, rval = 0;
167 level < XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK);
168 level++) {
169 len += maxrecs - 1;
170 do_div(len, maxrecs);
171 rval += len;
172 if (len == 1)
173 return rval + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) -
174 level - 1;
175 if (level == 0)
176 maxrecs = mp->m_bmap_dmxr[1];
177 }
178 return rval;
179 }
180
181 /*
182 * Calculate the default attribute fork offset for newly created inodes.
183 */
184 uint
185 xfs_default_attroffset(
186 struct xfs_inode *ip)
187 {
188 struct xfs_mount *mp = ip->i_mount;
189 uint offset;
190
191 if (mp->m_sb.sb_inodesize == 256)
192 offset = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS);
193 else
194 offset = XFS_BMDR_SPACE_CALC(6 * MINABTPTRS);
195
196 ASSERT(offset < XFS_LITINO(mp));
197 return offset;
198 }
199
200 /*
201 * Helper routine to reset inode di_forkoff field when switching
202 * attribute fork from local to extent format - we reset it where
203 * possible to make space available for inline data fork extents.
204 */
205 STATIC void
206 xfs_bmap_forkoff_reset(
207 xfs_inode_t *ip,
208 int whichfork)
209 {
210 if (whichfork == XFS_ATTR_FORK &&
211 ip->i_df.if_format != XFS_DINODE_FMT_DEV &&
212 ip->i_df.if_format != XFS_DINODE_FMT_BTREE) {
213 uint dfl_forkoff = xfs_default_attroffset(ip) >> 3;
214
215 if (dfl_forkoff > ip->i_d.di_forkoff)
216 ip->i_d.di_forkoff = dfl_forkoff;
217 }
218 }
219
220 #ifdef DEBUG
221 STATIC struct xfs_buf *
222 xfs_bmap_get_bp(
223 struct xfs_btree_cur *cur,
224 xfs_fsblock_t bno)
225 {
226 struct xfs_log_item *lip;
227 int i;
228
229 if (!cur)
230 return NULL;
231
232 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) {
233 if (!cur->bc_bufs[i])
234 break;
235 if (XFS_BUF_ADDR(cur->bc_bufs[i]) == bno)
236 return cur->bc_bufs[i];
237 }
238
239 /* Chase down all the log items to see if the bp is there */
240 list_for_each_entry(lip, &cur->bc_tp->t_items, li_trans) {
241 struct xfs_buf_log_item *bip = (struct xfs_buf_log_item *)lip;
242
243 if (bip->bli_item.li_type == XFS_LI_BUF &&
244 XFS_BUF_ADDR(bip->bli_buf) == bno)
245 return bip->bli_buf;
246 }
247
248 return NULL;
249 }
250
251 STATIC void
252 xfs_check_block(
253 struct xfs_btree_block *block,
254 xfs_mount_t *mp,
255 int root,
256 short sz)
257 {
258 int i, j, dmxr;
259 __be64 *pp, *thispa; /* pointer to block address */
260 xfs_bmbt_key_t *prevp, *keyp;
261
262 ASSERT(be16_to_cpu(block->bb_level) > 0);
263
264 prevp = NULL;
265 for( i = 1; i <= xfs_btree_get_numrecs(block); i++) {
266 dmxr = mp->m_bmap_dmxr[0];
267 keyp = XFS_BMBT_KEY_ADDR(mp, block, i);
268
269 if (prevp) {
270 ASSERT(be64_to_cpu(prevp->br_startoff) <
271 be64_to_cpu(keyp->br_startoff));
272 }
273 prevp = keyp;
274
275 /*
276 * Compare the block numbers to see if there are dups.
277 */
278 if (root)
279 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz);
280 else
281 pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr);
282
283 for (j = i+1; j <= be16_to_cpu(block->bb_numrecs); j++) {
284 if (root)
285 thispa = XFS_BMAP_BROOT_PTR_ADDR(mp, block, j, sz);
286 else
287 thispa = XFS_BMBT_PTR_ADDR(mp, block, j, dmxr);
288 if (*thispa == *pp) {
289 xfs_warn(mp, "%s: thispa(%d) == pp(%d) %Ld",
290 __func__, j, i,
291 (unsigned long long)be64_to_cpu(*thispa));
292 xfs_err(mp, "%s: ptrs are equal in node\n",
293 __func__);
294 xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
295 }
296 }
297 }
298 }
299
300 /*
301 * Check that the extents for the inode ip are in the right order in all
302 * btree leaves. THis becomes prohibitively expensive for large extent count
303 * files, so don't bother with inodes that have more than 10,000 extents in
304 * them. The btree record ordering checks will still be done, so for such large
305 * bmapbt constructs that is going to catch most corruptions.
306 */
307 STATIC void
308 xfs_bmap_check_leaf_extents(
309 xfs_btree_cur_t *cur, /* btree cursor or null */
310 xfs_inode_t *ip, /* incore inode pointer */
311 int whichfork) /* data or attr fork */
312 {
313 struct xfs_mount *mp = ip->i_mount;
314 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
315 struct xfs_btree_block *block; /* current btree block */
316 xfs_fsblock_t bno; /* block # of "block" */
317 struct xfs_buf *bp; /* buffer for "block" */
318 int error; /* error return value */
319 xfs_extnum_t i=0, j; /* index into the extents list */
320 int level; /* btree level, for checking */
321 __be64 *pp; /* pointer to block address */
322 xfs_bmbt_rec_t *ep; /* pointer to current extent */
323 xfs_bmbt_rec_t last = {0, 0}; /* last extent in prev block */
324 xfs_bmbt_rec_t *nextp; /* pointer to next extent */
325 int bp_release = 0;
326
327 if (ifp->if_format != XFS_DINODE_FMT_BTREE)
328 return;
329
330 /* skip large extent count inodes */
331 if (ip->i_df.if_nextents > 10000)
332 return;
333
334 bno = NULLFSBLOCK;
335 block = ifp->if_broot;
336 /*
337 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
338 */
339 level = be16_to_cpu(block->bb_level);
340 ASSERT(level > 0);
341 xfs_check_block(block, mp, 1, ifp->if_broot_bytes);
342 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
343 bno = be64_to_cpu(*pp);
344
345 ASSERT(bno != NULLFSBLOCK);
346 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
347 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
348
349 /*
350 * Go down the tree until leaf level is reached, following the first
351 * pointer (leftmost) at each level.
352 */
353 while (level-- > 0) {
354 /* See if buf is in cur first */
355 bp_release = 0;
356 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
357 if (!bp) {
358 bp_release = 1;
359 error = xfs_btree_read_bufl(mp, NULL, bno, &bp,
360 XFS_BMAP_BTREE_REF,
361 &xfs_bmbt_buf_ops);
362 if (error)
363 goto error_norelse;
364 }
365 block = XFS_BUF_TO_BLOCK(bp);
366 if (level == 0)
367 break;
368
369 /*
370 * Check this block for basic sanity (increasing keys and
371 * no duplicate blocks).
372 */
373
374 xfs_check_block(block, mp, 0, 0);
375 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
376 bno = be64_to_cpu(*pp);
377 if (XFS_IS_CORRUPT(mp, !xfs_verify_fsbno(mp, bno))) {
378 error = -EFSCORRUPTED;
379 goto error0;
380 }
381 if (bp_release) {
382 bp_release = 0;
383 xfs_trans_brelse(NULL, bp);
384 }
385 }
386
387 /*
388 * Here with bp and block set to the leftmost leaf node in the tree.
389 */
390 i = 0;
391
392 /*
393 * Loop over all leaf nodes checking that all extents are in the right order.
394 */
395 for (;;) {
396 xfs_fsblock_t nextbno;
397 xfs_extnum_t num_recs;
398
399
400 num_recs = xfs_btree_get_numrecs(block);
401
402 /*
403 * Read-ahead the next leaf block, if any.
404 */
405
406 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
407
408 /*
409 * Check all the extents to make sure they are OK.
410 * If we had a previous block, the last entry should
411 * conform with the first entry in this one.
412 */
413
414 ep = XFS_BMBT_REC_ADDR(mp, block, 1);
415 if (i) {
416 ASSERT(xfs_bmbt_disk_get_startoff(&last) +
417 xfs_bmbt_disk_get_blockcount(&last) <=
418 xfs_bmbt_disk_get_startoff(ep));
419 }
420 for (j = 1; j < num_recs; j++) {
421 nextp = XFS_BMBT_REC_ADDR(mp, block, j + 1);
422 ASSERT(xfs_bmbt_disk_get_startoff(ep) +
423 xfs_bmbt_disk_get_blockcount(ep) <=
424 xfs_bmbt_disk_get_startoff(nextp));
425 ep = nextp;
426 }
427
428 last = *ep;
429 i += num_recs;
430 if (bp_release) {
431 bp_release = 0;
432 xfs_trans_brelse(NULL, bp);
433 }
434 bno = nextbno;
435 /*
436 * If we've reached the end, stop.
437 */
438 if (bno == NULLFSBLOCK)
439 break;
440
441 bp_release = 0;
442 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
443 if (!bp) {
444 bp_release = 1;
445 error = xfs_btree_read_bufl(mp, NULL, bno, &bp,
446 XFS_BMAP_BTREE_REF,
447 &xfs_bmbt_buf_ops);
448 if (error)
449 goto error_norelse;
450 }
451 block = XFS_BUF_TO_BLOCK(bp);
452 }
453
454 return;
455
456 error0:
457 xfs_warn(mp, "%s: at error0", __func__);
458 if (bp_release)
459 xfs_trans_brelse(NULL, bp);
460 error_norelse:
461 xfs_warn(mp, "%s: BAD after btree leaves for %d extents",
462 __func__, i);
463 xfs_err(mp, "%s: CORRUPTED BTREE OR SOMETHING", __func__);
464 xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
465 return;
466 }
467
468 /*
469 * Validate that the bmbt_irecs being returned from bmapi are valid
470 * given the caller's original parameters. Specifically check the
471 * ranges of the returned irecs to ensure that they only extend beyond
472 * the given parameters if the XFS_BMAPI_ENTIRE flag was set.
473 */
474 STATIC void
475 xfs_bmap_validate_ret(
476 xfs_fileoff_t bno,
477 xfs_filblks_t len,
478 int flags,
479 xfs_bmbt_irec_t *mval,
480 int nmap,
481 int ret_nmap)
482 {
483 int i; /* index to map values */
484
485 ASSERT(ret_nmap <= nmap);
486
487 for (i = 0; i < ret_nmap; i++) {
488 ASSERT(mval[i].br_blockcount > 0);
489 if (!(flags & XFS_BMAPI_ENTIRE)) {
490 ASSERT(mval[i].br_startoff >= bno);
491 ASSERT(mval[i].br_blockcount <= len);
492 ASSERT(mval[i].br_startoff + mval[i].br_blockcount <=
493 bno + len);
494 } else {
495 ASSERT(mval[i].br_startoff < bno + len);
496 ASSERT(mval[i].br_startoff + mval[i].br_blockcount >
497 bno);
498 }
499 ASSERT(i == 0 ||
500 mval[i - 1].br_startoff + mval[i - 1].br_blockcount ==
501 mval[i].br_startoff);
502 ASSERT(mval[i].br_startblock != DELAYSTARTBLOCK &&
503 mval[i].br_startblock != HOLESTARTBLOCK);
504 ASSERT(mval[i].br_state == XFS_EXT_NORM ||
505 mval[i].br_state == XFS_EXT_UNWRITTEN);
506 }
507 }
508
509 #else
510 #define xfs_bmap_check_leaf_extents(cur, ip, whichfork) do { } while (0)
511 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap) do { } while (0)
512 #endif /* DEBUG */
513
514 /*
515 * bmap free list manipulation functions
516 */
517
518 /*
519 * Add the extent to the list of extents to be free at transaction end.
520 * The list is maintained sorted (by block number).
521 */
522 void
523 __xfs_bmap_add_free(
524 struct xfs_trans *tp,
525 xfs_fsblock_t bno,
526 xfs_filblks_t len,
527 const struct xfs_owner_info *oinfo,
528 bool skip_discard)
529 {
530 struct xfs_extent_free_item *new; /* new element */
531 #ifdef DEBUG
532 struct xfs_mount *mp = tp->t_mountp;
533 xfs_agnumber_t agno;
534 xfs_agblock_t agbno;
535
536 ASSERT(bno != NULLFSBLOCK);
537 ASSERT(len > 0);
538 ASSERT(len <= MAXEXTLEN);
539 ASSERT(!isnullstartblock(bno));
540 agno = XFS_FSB_TO_AGNO(mp, bno);
541 agbno = XFS_FSB_TO_AGBNO(mp, bno);
542 ASSERT(agno < mp->m_sb.sb_agcount);
543 ASSERT(agbno < mp->m_sb.sb_agblocks);
544 ASSERT(len < mp->m_sb.sb_agblocks);
545 ASSERT(agbno + len <= mp->m_sb.sb_agblocks);
546 #endif
547 ASSERT(xfs_bmap_free_item_zone != NULL);
548
549 new = kmem_cache_alloc(xfs_bmap_free_item_zone,
550 GFP_KERNEL | __GFP_NOFAIL);
551 new->xefi_startblock = bno;
552 new->xefi_blockcount = (xfs_extlen_t)len;
553 if (oinfo)
554 new->xefi_oinfo = *oinfo;
555 else
556 new->xefi_oinfo = XFS_RMAP_OINFO_SKIP_UPDATE;
557 new->xefi_skip_discard = skip_discard;
558 trace_xfs_bmap_free_defer(tp->t_mountp,
559 XFS_FSB_TO_AGNO(tp->t_mountp, bno), 0,
560 XFS_FSB_TO_AGBNO(tp->t_mountp, bno), len);
561 xfs_defer_add(tp, XFS_DEFER_OPS_TYPE_FREE, &new->xefi_list);
562 }
563
564 /*
565 * Inode fork format manipulation functions
566 */
567
568 /*
569 * Convert the inode format to extent format if it currently is in btree format,
570 * but the extent list is small enough that it fits into the extent format.
571 *
572 * Since the extents are already in-core, all we have to do is give up the space
573 * for the btree root and pitch the leaf block.
574 */
575 STATIC int /* error */
576 xfs_bmap_btree_to_extents(
577 struct xfs_trans *tp, /* transaction pointer */
578 struct xfs_inode *ip, /* incore inode pointer */
579 struct xfs_btree_cur *cur, /* btree cursor */
580 int *logflagsp, /* inode logging flags */
581 int whichfork) /* data or attr fork */
582 {
583 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
584 struct xfs_mount *mp = ip->i_mount;
585 struct xfs_btree_block *rblock = ifp->if_broot;
586 struct xfs_btree_block *cblock;/* child btree block */
587 xfs_fsblock_t cbno; /* child block number */
588 struct xfs_buf *cbp; /* child block's buffer */
589 int error; /* error return value */
590 __be64 *pp; /* ptr to block address */
591 struct xfs_owner_info oinfo;
592
593 /* check if we actually need the extent format first: */
594 if (!xfs_bmap_wants_extents(ip, whichfork))
595 return 0;
596
597 ASSERT(cur);
598 ASSERT(whichfork != XFS_COW_FORK);
599 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
600 ASSERT(ifp->if_format == XFS_DINODE_FMT_BTREE);
601 ASSERT(be16_to_cpu(rblock->bb_level) == 1);
602 ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1);
603 ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1);
604
605 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes);
606 cbno = be64_to_cpu(*pp);
607 #ifdef DEBUG
608 if (XFS_IS_CORRUPT(cur->bc_mp, !xfs_btree_check_lptr(cur, cbno, 1)))
609 return -EFSCORRUPTED;
610 #endif
611 error = xfs_btree_read_bufl(mp, tp, cbno, &cbp, XFS_BMAP_BTREE_REF,
612 &xfs_bmbt_buf_ops);
613 if (error)
614 return error;
615 cblock = XFS_BUF_TO_BLOCK(cbp);
616 if ((error = xfs_btree_check_block(cur, cblock, 0, cbp)))
617 return error;
618 xfs_rmap_ino_bmbt_owner(&oinfo, ip->i_ino, whichfork);
619 xfs_bmap_add_free(cur->bc_tp, cbno, 1, &oinfo);
620 ip->i_d.di_nblocks--;
621 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
622 xfs_trans_binval(tp, cbp);
623 if (cur->bc_bufs[0] == cbp)
624 cur->bc_bufs[0] = NULL;
625 xfs_iroot_realloc(ip, -1, whichfork);
626 ASSERT(ifp->if_broot == NULL);
627 ASSERT((ifp->if_flags & XFS_IFBROOT) == 0);
628 ifp->if_format = XFS_DINODE_FMT_EXTENTS;
629 *logflagsp |= XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
630 return 0;
631 }
632
633 /*
634 * Convert an extents-format file into a btree-format file.
635 * The new file will have a root block (in the inode) and a single child block.
636 */
637 STATIC int /* error */
638 xfs_bmap_extents_to_btree(
639 struct xfs_trans *tp, /* transaction pointer */
640 struct xfs_inode *ip, /* incore inode pointer */
641 struct xfs_btree_cur **curp, /* cursor returned to caller */
642 int wasdel, /* converting a delayed alloc */
643 int *logflagsp, /* inode logging flags */
644 int whichfork) /* data or attr fork */
645 {
646 struct xfs_btree_block *ablock; /* allocated (child) bt block */
647 struct xfs_buf *abp; /* buffer for ablock */
648 struct xfs_alloc_arg args; /* allocation arguments */
649 struct xfs_bmbt_rec *arp; /* child record pointer */
650 struct xfs_btree_block *block; /* btree root block */
651 struct xfs_btree_cur *cur; /* bmap btree cursor */
652 int error; /* error return value */
653 struct xfs_ifork *ifp; /* inode fork pointer */
654 struct xfs_bmbt_key *kp; /* root block key pointer */
655 struct xfs_mount *mp; /* mount structure */
656 xfs_bmbt_ptr_t *pp; /* root block address pointer */
657 struct xfs_iext_cursor icur;
658 struct xfs_bmbt_irec rec;
659 xfs_extnum_t cnt = 0;
660
661 mp = ip->i_mount;
662 ASSERT(whichfork != XFS_COW_FORK);
663 ifp = XFS_IFORK_PTR(ip, whichfork);
664 ASSERT(ifp->if_format == XFS_DINODE_FMT_EXTENTS);
665
666 /*
667 * Make space in the inode incore. This needs to be undone if we fail
668 * to expand the root.
669 */
670 xfs_iroot_realloc(ip, 1, whichfork);
671 ifp->if_flags |= XFS_IFBROOT;
672
673 /*
674 * Fill in the root.
675 */
676 block = ifp->if_broot;
677 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL,
678 XFS_BTNUM_BMAP, 1, 1, ip->i_ino,
679 XFS_BTREE_LONG_PTRS);
680 /*
681 * Need a cursor. Can't allocate until bb_level is filled in.
682 */
683 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
684 cur->bc_ino.flags = wasdel ? XFS_BTCUR_BMBT_WASDEL : 0;
685 /*
686 * Convert to a btree with two levels, one record in root.
687 */
688 ifp->if_format = XFS_DINODE_FMT_BTREE;
689 memset(&args, 0, sizeof(args));
690 args.tp = tp;
691 args.mp = mp;
692 xfs_rmap_ino_bmbt_owner(&args.oinfo, ip->i_ino, whichfork);
693 if (tp->t_firstblock == NULLFSBLOCK) {
694 args.type = XFS_ALLOCTYPE_START_BNO;
695 args.fsbno = XFS_INO_TO_FSB(mp, ip->i_ino);
696 } else if (tp->t_flags & XFS_TRANS_LOWMODE) {
697 args.type = XFS_ALLOCTYPE_START_BNO;
698 args.fsbno = tp->t_firstblock;
699 } else {
700 args.type = XFS_ALLOCTYPE_NEAR_BNO;
701 args.fsbno = tp->t_firstblock;
702 }
703 args.minlen = args.maxlen = args.prod = 1;
704 args.wasdel = wasdel;
705 *logflagsp = 0;
706 error = xfs_alloc_vextent(&args);
707 if (error)
708 goto out_root_realloc;
709
710 if (WARN_ON_ONCE(args.fsbno == NULLFSBLOCK)) {
711 error = -ENOSPC;
712 goto out_root_realloc;
713 }
714
715 /*
716 * Allocation can't fail, the space was reserved.
717 */
718 ASSERT(tp->t_firstblock == NULLFSBLOCK ||
719 args.agno >= XFS_FSB_TO_AGNO(mp, tp->t_firstblock));
720 tp->t_firstblock = args.fsbno;
721 cur->bc_ino.allocated++;
722 ip->i_d.di_nblocks++;
723 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, 1L);
724 error = xfs_trans_get_buf(tp, mp->m_ddev_targp,
725 XFS_FSB_TO_DADDR(mp, args.fsbno),
726 mp->m_bsize, 0, &abp);
727 if (error)
728 goto out_unreserve_dquot;
729
730 /*
731 * Fill in the child block.
732 */
733 abp->b_ops = &xfs_bmbt_buf_ops;
734 ablock = XFS_BUF_TO_BLOCK(abp);
735 xfs_btree_init_block_int(mp, ablock, abp->b_bn,
736 XFS_BTNUM_BMAP, 0, 0, ip->i_ino,
737 XFS_BTREE_LONG_PTRS);
738
739 for_each_xfs_iext(ifp, &icur, &rec) {
740 if (isnullstartblock(rec.br_startblock))
741 continue;
742 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1 + cnt);
743 xfs_bmbt_disk_set_all(arp, &rec);
744 cnt++;
745 }
746 ASSERT(cnt == ifp->if_nextents);
747 xfs_btree_set_numrecs(ablock, cnt);
748
749 /*
750 * Fill in the root key and pointer.
751 */
752 kp = XFS_BMBT_KEY_ADDR(mp, block, 1);
753 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
754 kp->br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(arp));
755 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, xfs_bmbt_get_maxrecs(cur,
756 be16_to_cpu(block->bb_level)));
757 *pp = cpu_to_be64(args.fsbno);
758
759 /*
760 * Do all this logging at the end so that
761 * the root is at the right level.
762 */
763 xfs_btree_log_block(cur, abp, XFS_BB_ALL_BITS);
764 xfs_btree_log_recs(cur, abp, 1, be16_to_cpu(ablock->bb_numrecs));
765 ASSERT(*curp == NULL);
766 *curp = cur;
767 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fbroot(whichfork);
768 return 0;
769
770 out_unreserve_dquot:
771 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
772 out_root_realloc:
773 xfs_iroot_realloc(ip, -1, whichfork);
774 ifp->if_format = XFS_DINODE_FMT_EXTENTS;
775 ASSERT(ifp->if_broot == NULL);
776 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
777
778 return error;
779 }
780
781 /*
782 * Convert a local file to an extents file.
783 * This code is out of bounds for data forks of regular files,
784 * since the file data needs to get logged so things will stay consistent.
785 * (The bmap-level manipulations are ok, though).
786 */
787 void
788 xfs_bmap_local_to_extents_empty(
789 struct xfs_trans *tp,
790 struct xfs_inode *ip,
791 int whichfork)
792 {
793 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
794
795 ASSERT(whichfork != XFS_COW_FORK);
796 ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL);
797 ASSERT(ifp->if_bytes == 0);
798 ASSERT(ifp->if_nextents == 0);
799
800 xfs_bmap_forkoff_reset(ip, whichfork);
801 ifp->if_flags &= ~XFS_IFINLINE;
802 ifp->if_flags |= XFS_IFEXTENTS;
803 ifp->if_u1.if_root = NULL;
804 ifp->if_height = 0;
805 ifp->if_format = XFS_DINODE_FMT_EXTENTS;
806 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
807 }
808
809
810 STATIC int /* error */
811 xfs_bmap_local_to_extents(
812 xfs_trans_t *tp, /* transaction pointer */
813 xfs_inode_t *ip, /* incore inode pointer */
814 xfs_extlen_t total, /* total blocks needed by transaction */
815 int *logflagsp, /* inode logging flags */
816 int whichfork,
817 void (*init_fn)(struct xfs_trans *tp,
818 struct xfs_buf *bp,
819 struct xfs_inode *ip,
820 struct xfs_ifork *ifp))
821 {
822 int error = 0;
823 int flags; /* logging flags returned */
824 struct xfs_ifork *ifp; /* inode fork pointer */
825 xfs_alloc_arg_t args; /* allocation arguments */
826 struct xfs_buf *bp; /* buffer for extent block */
827 struct xfs_bmbt_irec rec;
828 struct xfs_iext_cursor icur;
829
830 /*
831 * We don't want to deal with the case of keeping inode data inline yet.
832 * So sending the data fork of a regular inode is invalid.
833 */
834 ASSERT(!(S_ISREG(VFS_I(ip)->i_mode) && whichfork == XFS_DATA_FORK));
835 ifp = XFS_IFORK_PTR(ip, whichfork);
836 ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL);
837
838 if (!ifp->if_bytes) {
839 xfs_bmap_local_to_extents_empty(tp, ip, whichfork);
840 flags = XFS_ILOG_CORE;
841 goto done;
842 }
843
844 flags = 0;
845 error = 0;
846 ASSERT((ifp->if_flags & (XFS_IFINLINE|XFS_IFEXTENTS)) == XFS_IFINLINE);
847 memset(&args, 0, sizeof(args));
848 args.tp = tp;
849 args.mp = ip->i_mount;
850 xfs_rmap_ino_owner(&args.oinfo, ip->i_ino, whichfork, 0);
851 /*
852 * Allocate a block. We know we need only one, since the
853 * file currently fits in an inode.
854 */
855 if (tp->t_firstblock == NULLFSBLOCK) {
856 args.fsbno = XFS_INO_TO_FSB(args.mp, ip->i_ino);
857 args.type = XFS_ALLOCTYPE_START_BNO;
858 } else {
859 args.fsbno = tp->t_firstblock;
860 args.type = XFS_ALLOCTYPE_NEAR_BNO;
861 }
862 args.total = total;
863 args.minlen = args.maxlen = args.prod = 1;
864 error = xfs_alloc_vextent(&args);
865 if (error)
866 goto done;
867
868 /* Can't fail, the space was reserved. */
869 ASSERT(args.fsbno != NULLFSBLOCK);
870 ASSERT(args.len == 1);
871 tp->t_firstblock = args.fsbno;
872 error = xfs_trans_get_buf(tp, args.mp->m_ddev_targp,
873 XFS_FSB_TO_DADDR(args.mp, args.fsbno),
874 args.mp->m_bsize, 0, &bp);
875 if (error)
876 goto done;
877
878 /*
879 * Initialize the block, copy the data and log the remote buffer.
880 *
881 * The callout is responsible for logging because the remote format
882 * might differ from the local format and thus we don't know how much to
883 * log here. Note that init_fn must also set the buffer log item type
884 * correctly.
885 */
886 init_fn(tp, bp, ip, ifp);
887
888 /* account for the change in fork size */
889 xfs_idata_realloc(ip, -ifp->if_bytes, whichfork);
890 xfs_bmap_local_to_extents_empty(tp, ip, whichfork);
891 flags |= XFS_ILOG_CORE;
892
893 ifp->if_u1.if_root = NULL;
894 ifp->if_height = 0;
895
896 rec.br_startoff = 0;
897 rec.br_startblock = args.fsbno;
898 rec.br_blockcount = 1;
899 rec.br_state = XFS_EXT_NORM;
900 xfs_iext_first(ifp, &icur);
901 xfs_iext_insert(ip, &icur, &rec, 0);
902
903 ifp->if_nextents = 1;
904 ip->i_d.di_nblocks = 1;
905 xfs_trans_mod_dquot_byino(tp, ip,
906 XFS_TRANS_DQ_BCOUNT, 1L);
907 flags |= xfs_ilog_fext(whichfork);
908
909 done:
910 *logflagsp = flags;
911 return error;
912 }
913
914 /*
915 * Called from xfs_bmap_add_attrfork to handle btree format files.
916 */
917 STATIC int /* error */
918 xfs_bmap_add_attrfork_btree(
919 xfs_trans_t *tp, /* transaction pointer */
920 xfs_inode_t *ip, /* incore inode pointer */
921 int *flags) /* inode logging flags */
922 {
923 xfs_btree_cur_t *cur; /* btree cursor */
924 int error; /* error return value */
925 xfs_mount_t *mp; /* file system mount struct */
926 int stat; /* newroot status */
927
928 mp = ip->i_mount;
929 if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip))
930 *flags |= XFS_ILOG_DBROOT;
931 else {
932 cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK);
933 error = xfs_bmbt_lookup_first(cur, &stat);
934 if (error)
935 goto error0;
936 /* must be at least one entry */
937 if (XFS_IS_CORRUPT(mp, stat != 1)) {
938 error = -EFSCORRUPTED;
939 goto error0;
940 }
941 if ((error = xfs_btree_new_iroot(cur, flags, &stat)))
942 goto error0;
943 if (stat == 0) {
944 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
945 return -ENOSPC;
946 }
947 cur->bc_ino.allocated = 0;
948 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
949 }
950 return 0;
951 error0:
952 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
953 return error;
954 }
955
956 /*
957 * Called from xfs_bmap_add_attrfork to handle extents format files.
958 */
959 STATIC int /* error */
960 xfs_bmap_add_attrfork_extents(
961 struct xfs_trans *tp, /* transaction pointer */
962 struct xfs_inode *ip, /* incore inode pointer */
963 int *flags) /* inode logging flags */
964 {
965 xfs_btree_cur_t *cur; /* bmap btree cursor */
966 int error; /* error return value */
967
968 if (ip->i_df.if_nextents * sizeof(struct xfs_bmbt_rec) <=
969 XFS_IFORK_DSIZE(ip))
970 return 0;
971 cur = NULL;
972 error = xfs_bmap_extents_to_btree(tp, ip, &cur, 0, flags,
973 XFS_DATA_FORK);
974 if (cur) {
975 cur->bc_ino.allocated = 0;
976 xfs_btree_del_cursor(cur, error);
977 }
978 return error;
979 }
980
981 /*
982 * Called from xfs_bmap_add_attrfork to handle local format files. Each
983 * different data fork content type needs a different callout to do the
984 * conversion. Some are basic and only require special block initialisation
985 * callouts for the data formating, others (directories) are so specialised they
986 * handle everything themselves.
987 *
988 * XXX (dgc): investigate whether directory conversion can use the generic
989 * formatting callout. It should be possible - it's just a very complex
990 * formatter.
991 */
992 STATIC int /* error */
993 xfs_bmap_add_attrfork_local(
994 struct xfs_trans *tp, /* transaction pointer */
995 struct xfs_inode *ip, /* incore inode pointer */
996 int *flags) /* inode logging flags */
997 {
998 struct xfs_da_args dargs; /* args for dir/attr code */
999
1000 if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip))
1001 return 0;
1002
1003 if (S_ISDIR(VFS_I(ip)->i_mode)) {
1004 memset(&dargs, 0, sizeof(dargs));
1005 dargs.geo = ip->i_mount->m_dir_geo;
1006 dargs.dp = ip;
1007 dargs.total = dargs.geo->fsbcount;
1008 dargs.whichfork = XFS_DATA_FORK;
1009 dargs.trans = tp;
1010 return xfs_dir2_sf_to_block(&dargs);
1011 }
1012
1013 if (S_ISLNK(VFS_I(ip)->i_mode))
1014 return xfs_bmap_local_to_extents(tp, ip, 1, flags,
1015 XFS_DATA_FORK,
1016 xfs_symlink_local_to_remote);
1017
1018 /* should only be called for types that support local format data */
1019 ASSERT(0);
1020 return -EFSCORRUPTED;
1021 }
1022
1023 /* Set an inode attr fork off based on the format */
1024 int
1025 xfs_bmap_set_attrforkoff(
1026 struct xfs_inode *ip,
1027 int size,
1028 int *version)
1029 {
1030 switch (ip->i_df.if_format) {
1031 case XFS_DINODE_FMT_DEV:
1032 ip->i_d.di_forkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
1033 break;
1034 case XFS_DINODE_FMT_LOCAL:
1035 case XFS_DINODE_FMT_EXTENTS:
1036 case XFS_DINODE_FMT_BTREE:
1037 ip->i_d.di_forkoff = xfs_attr_shortform_bytesfit(ip, size);
1038 if (!ip->i_d.di_forkoff)
1039 ip->i_d.di_forkoff = xfs_default_attroffset(ip) >> 3;
1040 else if ((ip->i_mount->m_flags & XFS_MOUNT_ATTR2) && version)
1041 *version = 2;
1042 break;
1043 default:
1044 ASSERT(0);
1045 return -EINVAL;
1046 }
1047
1048 return 0;
1049 }
1050
1051 /*
1052 * Convert inode from non-attributed to attributed.
1053 * Must not be in a transaction, ip must not be locked.
1054 */
1055 int /* error code */
1056 xfs_bmap_add_attrfork(
1057 xfs_inode_t *ip, /* incore inode pointer */
1058 int size, /* space new attribute needs */
1059 int rsvd) /* xact may use reserved blks */
1060 {
1061 xfs_mount_t *mp; /* mount structure */
1062 xfs_trans_t *tp; /* transaction pointer */
1063 int blks; /* space reservation */
1064 int version = 1; /* superblock attr version */
1065 int logflags; /* logging flags */
1066 int error; /* error return value */
1067
1068 ASSERT(XFS_IFORK_Q(ip) == 0);
1069
1070 mp = ip->i_mount;
1071 ASSERT(!XFS_NOT_DQATTACHED(mp, ip));
1072
1073 blks = XFS_ADDAFORK_SPACE_RES(mp);
1074
1075 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_addafork, blks, 0,
1076 rsvd ? XFS_TRANS_RESERVE : 0, &tp);
1077 if (error)
1078 return error;
1079
1080 xfs_ilock(ip, XFS_ILOCK_EXCL);
1081 error = xfs_trans_reserve_quota_nblks(tp, ip, blks, 0, rsvd ?
1082 XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
1083 XFS_QMOPT_RES_REGBLKS);
1084 if (error)
1085 goto trans_cancel;
1086 if (XFS_IFORK_Q(ip))
1087 goto trans_cancel;
1088
1089 xfs_trans_ijoin(tp, ip, 0);
1090 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
1091 error = xfs_bmap_set_attrforkoff(ip, size, &version);
1092 if (error)
1093 goto trans_cancel;
1094 ASSERT(ip->i_afp == NULL);
1095
1096 ip->i_afp = kmem_cache_zalloc(xfs_ifork_zone,
1097 GFP_KERNEL | __GFP_NOFAIL);
1098
1099 ip->i_afp->if_format = XFS_DINODE_FMT_EXTENTS;
1100 ip->i_afp->if_flags = XFS_IFEXTENTS;
1101 logflags = 0;
1102 switch (ip->i_df.if_format) {
1103 case XFS_DINODE_FMT_LOCAL:
1104 error = xfs_bmap_add_attrfork_local(tp, ip, &logflags);
1105 break;
1106 case XFS_DINODE_FMT_EXTENTS:
1107 error = xfs_bmap_add_attrfork_extents(tp, ip, &logflags);
1108 break;
1109 case XFS_DINODE_FMT_BTREE:
1110 error = xfs_bmap_add_attrfork_btree(tp, ip, &logflags);
1111 break;
1112 default:
1113 error = 0;
1114 break;
1115 }
1116 if (logflags)
1117 xfs_trans_log_inode(tp, ip, logflags);
1118 if (error)
1119 goto trans_cancel;
1120 if (!xfs_sb_version_hasattr(&mp->m_sb) ||
1121 (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2)) {
1122 bool log_sb = false;
1123
1124 spin_lock(&mp->m_sb_lock);
1125 if (!xfs_sb_version_hasattr(&mp->m_sb)) {
1126 xfs_sb_version_addattr(&mp->m_sb);
1127 log_sb = true;
1128 }
1129 if (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2) {
1130 xfs_sb_version_addattr2(&mp->m_sb);
1131 log_sb = true;
1132 }
1133 spin_unlock(&mp->m_sb_lock);
1134 if (log_sb)
1135 xfs_log_sb(tp);
1136 }
1137
1138 error = xfs_trans_commit(tp);
1139 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1140 return error;
1141
1142 trans_cancel:
1143 xfs_trans_cancel(tp);
1144 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1145 return error;
1146 }
1147
1148 /*
1149 * Internal and external extent tree search functions.
1150 */
1151
1152 struct xfs_iread_state {
1153 struct xfs_iext_cursor icur;
1154 xfs_extnum_t loaded;
1155 };
1156
1157 /* Stuff every bmbt record from this block into the incore extent map. */
1158 static int
1159 xfs_iread_bmbt_block(
1160 struct xfs_btree_cur *cur,
1161 int level,
1162 void *priv)
1163 {
1164 struct xfs_iread_state *ir = priv;
1165 struct xfs_mount *mp = cur->bc_mp;
1166 struct xfs_inode *ip = cur->bc_ino.ip;
1167 struct xfs_btree_block *block;
1168 struct xfs_buf *bp;
1169 struct xfs_bmbt_rec *frp;
1170 xfs_extnum_t num_recs;
1171 xfs_extnum_t j;
1172 int whichfork = cur->bc_ino.whichfork;
1173 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1174
1175 block = xfs_btree_get_block(cur, level, &bp);
1176
1177 /* Abort if we find more records than nextents. */
1178 num_recs = xfs_btree_get_numrecs(block);
1179 if (unlikely(ir->loaded + num_recs > ifp->if_nextents)) {
1180 xfs_warn(ip->i_mount, "corrupt dinode %llu, (btree extents).",
1181 (unsigned long long)ip->i_ino);
1182 xfs_inode_verifier_error(ip, -EFSCORRUPTED, __func__, block,
1183 sizeof(*block), __this_address);
1184 return -EFSCORRUPTED;
1185 }
1186
1187 /* Copy records into the incore cache. */
1188 frp = XFS_BMBT_REC_ADDR(mp, block, 1);
1189 for (j = 0; j < num_recs; j++, frp++, ir->loaded++) {
1190 struct xfs_bmbt_irec new;
1191 xfs_failaddr_t fa;
1192
1193 xfs_bmbt_disk_get_all(frp, &new);
1194 fa = xfs_bmap_validate_extent(ip, whichfork, &new);
1195 if (fa) {
1196 xfs_inode_verifier_error(ip, -EFSCORRUPTED,
1197 "xfs_iread_extents(2)", frp,
1198 sizeof(*frp), fa);
1199 return -EFSCORRUPTED;
1200 }
1201 xfs_iext_insert(ip, &ir->icur, &new,
1202 xfs_bmap_fork_to_state(whichfork));
1203 trace_xfs_read_extent(ip, &ir->icur,
1204 xfs_bmap_fork_to_state(whichfork), _THIS_IP_);
1205 xfs_iext_next(ifp, &ir->icur);
1206 }
1207
1208 return 0;
1209 }
1210
1211 /*
1212 * Read in extents from a btree-format inode.
1213 */
1214 int
1215 xfs_iread_extents(
1216 struct xfs_trans *tp,
1217 struct xfs_inode *ip,
1218 int whichfork)
1219 {
1220 struct xfs_iread_state ir;
1221 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1222 struct xfs_mount *mp = ip->i_mount;
1223 struct xfs_btree_cur *cur;
1224 int error;
1225
1226 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
1227
1228 if (XFS_IS_CORRUPT(mp, ifp->if_format != XFS_DINODE_FMT_BTREE)) {
1229 error = -EFSCORRUPTED;
1230 goto out;
1231 }
1232
1233 ir.loaded = 0;
1234 xfs_iext_first(ifp, &ir.icur);
1235 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
1236 error = xfs_btree_visit_blocks(cur, xfs_iread_bmbt_block,
1237 XFS_BTREE_VISIT_RECORDS, &ir);
1238 xfs_btree_del_cursor(cur, error);
1239 if (error)
1240 goto out;
1241
1242 if (XFS_IS_CORRUPT(mp, ir.loaded != ifp->if_nextents)) {
1243 error = -EFSCORRUPTED;
1244 goto out;
1245 }
1246 ASSERT(ir.loaded == xfs_iext_count(ifp));
1247
1248 ifp->if_flags |= XFS_IFEXTENTS;
1249 return 0;
1250 out:
1251 xfs_iext_destroy(ifp);
1252 return error;
1253 }
1254
1255 /*
1256 * Returns the relative block number of the first unused block(s) in the given
1257 * fork with at least "len" logically contiguous blocks free. This is the
1258 * lowest-address hole if the fork has holes, else the first block past the end
1259 * of fork. Return 0 if the fork is currently local (in-inode).
1260 */
1261 int /* error */
1262 xfs_bmap_first_unused(
1263 struct xfs_trans *tp, /* transaction pointer */
1264 struct xfs_inode *ip, /* incore inode */
1265 xfs_extlen_t len, /* size of hole to find */
1266 xfs_fileoff_t *first_unused, /* unused block */
1267 int whichfork) /* data or attr fork */
1268 {
1269 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1270 struct xfs_bmbt_irec got;
1271 struct xfs_iext_cursor icur;
1272 xfs_fileoff_t lastaddr = 0;
1273 xfs_fileoff_t lowest, max;
1274 int error;
1275
1276 if (ifp->if_format == XFS_DINODE_FMT_LOCAL) {
1277 *first_unused = 0;
1278 return 0;
1279 }
1280
1281 ASSERT(xfs_ifork_has_extents(ifp));
1282
1283 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
1284 error = xfs_iread_extents(tp, ip, whichfork);
1285 if (error)
1286 return error;
1287 }
1288
1289 lowest = max = *first_unused;
1290 for_each_xfs_iext(ifp, &icur, &got) {
1291 /*
1292 * See if the hole before this extent will work.
1293 */
1294 if (got.br_startoff >= lowest + len &&
1295 got.br_startoff - max >= len)
1296 break;
1297 lastaddr = got.br_startoff + got.br_blockcount;
1298 max = XFS_FILEOFF_MAX(lastaddr, lowest);
1299 }
1300
1301 *first_unused = max;
1302 return 0;
1303 }
1304
1305 /*
1306 * Returns the file-relative block number of the last block - 1 before
1307 * last_block (input value) in the file.
1308 * This is not based on i_size, it is based on the extent records.
1309 * Returns 0 for local files, as they do not have extent records.
1310 */
1311 int /* error */
1312 xfs_bmap_last_before(
1313 struct xfs_trans *tp, /* transaction pointer */
1314 struct xfs_inode *ip, /* incore inode */
1315 xfs_fileoff_t *last_block, /* last block */
1316 int whichfork) /* data or attr fork */
1317 {
1318 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1319 struct xfs_bmbt_irec got;
1320 struct xfs_iext_cursor icur;
1321 int error;
1322
1323 switch (ifp->if_format) {
1324 case XFS_DINODE_FMT_LOCAL:
1325 *last_block = 0;
1326 return 0;
1327 case XFS_DINODE_FMT_BTREE:
1328 case XFS_DINODE_FMT_EXTENTS:
1329 break;
1330 default:
1331 ASSERT(0);
1332 return -EFSCORRUPTED;
1333 }
1334
1335 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
1336 error = xfs_iread_extents(tp, ip, whichfork);
1337 if (error)
1338 return error;
1339 }
1340
1341 if (!xfs_iext_lookup_extent_before(ip, ifp, last_block, &icur, &got))
1342 *last_block = 0;
1343 return 0;
1344 }
1345
1346 int
1347 xfs_bmap_last_extent(
1348 struct xfs_trans *tp,
1349 struct xfs_inode *ip,
1350 int whichfork,
1351 struct xfs_bmbt_irec *rec,
1352 int *is_empty)
1353 {
1354 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1355 struct xfs_iext_cursor icur;
1356 int error;
1357
1358 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
1359 error = xfs_iread_extents(tp, ip, whichfork);
1360 if (error)
1361 return error;
1362 }
1363
1364 xfs_iext_last(ifp, &icur);
1365 if (!xfs_iext_get_extent(ifp, &icur, rec))
1366 *is_empty = 1;
1367 else
1368 *is_empty = 0;
1369 return 0;
1370 }
1371
1372 /*
1373 * Check the last inode extent to determine whether this allocation will result
1374 * in blocks being allocated at the end of the file. When we allocate new data
1375 * blocks at the end of the file which do not start at the previous data block,
1376 * we will try to align the new blocks at stripe unit boundaries.
1377 *
1378 * Returns 1 in bma->aeof if the file (fork) is empty as any new write will be
1379 * at, or past the EOF.
1380 */
1381 STATIC int
1382 xfs_bmap_isaeof(
1383 struct xfs_bmalloca *bma,
1384 int whichfork)
1385 {
1386 struct xfs_bmbt_irec rec;
1387 int is_empty;
1388 int error;
1389
1390 bma->aeof = false;
1391 error = xfs_bmap_last_extent(NULL, bma->ip, whichfork, &rec,
1392 &is_empty);
1393 if (error)
1394 return error;
1395
1396 if (is_empty) {
1397 bma->aeof = true;
1398 return 0;
1399 }
1400
1401 /*
1402 * Check if we are allocation or past the last extent, or at least into
1403 * the last delayed allocated extent.
1404 */
1405 bma->aeof = bma->offset >= rec.br_startoff + rec.br_blockcount ||
1406 (bma->offset >= rec.br_startoff &&
1407 isnullstartblock(rec.br_startblock));
1408 return 0;
1409 }
1410
1411 /*
1412 * Returns the file-relative block number of the first block past eof in
1413 * the file. This is not based on i_size, it is based on the extent records.
1414 * Returns 0 for local files, as they do not have extent records.
1415 */
1416 int
1417 xfs_bmap_last_offset(
1418 struct xfs_inode *ip,
1419 xfs_fileoff_t *last_block,
1420 int whichfork)
1421 {
1422 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1423 struct xfs_bmbt_irec rec;
1424 int is_empty;
1425 int error;
1426
1427 *last_block = 0;
1428
1429 if (ifp->if_format == XFS_DINODE_FMT_LOCAL)
1430 return 0;
1431
1432 if (XFS_IS_CORRUPT(ip->i_mount, !xfs_ifork_has_extents(ifp)))
1433 return -EFSCORRUPTED;
1434
1435 error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, &is_empty);
1436 if (error || is_empty)
1437 return error;
1438
1439 *last_block = rec.br_startoff + rec.br_blockcount;
1440 return 0;
1441 }
1442
1443 /*
1444 * Returns whether the selected fork of the inode has exactly one
1445 * block or not. For the data fork we check this matches di_size,
1446 * implying the file's range is 0..bsize-1.
1447 */
1448 int /* 1=>1 block, 0=>otherwise */
1449 xfs_bmap_one_block(
1450 struct xfs_inode *ip, /* incore inode */
1451 int whichfork) /* data or attr fork */
1452 {
1453 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1454 int rval; /* return value */
1455 struct xfs_bmbt_irec s; /* internal version of extent */
1456 struct xfs_iext_cursor icur;
1457
1458 #ifndef DEBUG
1459 if (whichfork == XFS_DATA_FORK)
1460 return XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize;
1461 #endif /* !DEBUG */
1462 if (ifp->if_nextents != 1)
1463 return 0;
1464 if (ifp->if_format != XFS_DINODE_FMT_EXTENTS)
1465 return 0;
1466 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
1467 xfs_iext_first(ifp, &icur);
1468 xfs_iext_get_extent(ifp, &icur, &s);
1469 rval = s.br_startoff == 0 && s.br_blockcount == 1;
1470 if (rval && whichfork == XFS_DATA_FORK)
1471 ASSERT(XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize);
1472 return rval;
1473 }
1474
1475 /*
1476 * Extent tree manipulation functions used during allocation.
1477 */
1478
1479 /*
1480 * Convert a delayed allocation to a real allocation.
1481 */
1482 STATIC int /* error */
1483 xfs_bmap_add_extent_delay_real(
1484 struct xfs_bmalloca *bma,
1485 int whichfork)
1486 {
1487 struct xfs_mount *mp = bma->ip->i_mount;
1488 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
1489 struct xfs_bmbt_irec *new = &bma->got;
1490 int error; /* error return value */
1491 int i; /* temp state */
1492 xfs_fileoff_t new_endoff; /* end offset of new entry */
1493 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
1494 /* left is 0, right is 1, prev is 2 */
1495 int rval=0; /* return value (logging flags) */
1496 int state = xfs_bmap_fork_to_state(whichfork);
1497 xfs_filblks_t da_new; /* new count del alloc blocks used */
1498 xfs_filblks_t da_old; /* old count del alloc blocks used */
1499 xfs_filblks_t temp=0; /* value for da_new calculations */
1500 int tmp_rval; /* partial logging flags */
1501 struct xfs_bmbt_irec old;
1502
1503 ASSERT(whichfork != XFS_ATTR_FORK);
1504 ASSERT(!isnullstartblock(new->br_startblock));
1505 ASSERT(!bma->cur ||
1506 (bma->cur->bc_ino.flags & XFS_BTCUR_BMBT_WASDEL));
1507
1508 XFS_STATS_INC(mp, xs_add_exlist);
1509
1510 #define LEFT r[0]
1511 #define RIGHT r[1]
1512 #define PREV r[2]
1513
1514 /*
1515 * Set up a bunch of variables to make the tests simpler.
1516 */
1517 xfs_iext_get_extent(ifp, &bma->icur, &PREV);
1518 new_endoff = new->br_startoff + new->br_blockcount;
1519 ASSERT(isnullstartblock(PREV.br_startblock));
1520 ASSERT(PREV.br_startoff <= new->br_startoff);
1521 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
1522
1523 da_old = startblockval(PREV.br_startblock);
1524 da_new = 0;
1525
1526 /*
1527 * Set flags determining what part of the previous delayed allocation
1528 * extent is being replaced by a real allocation.
1529 */
1530 if (PREV.br_startoff == new->br_startoff)
1531 state |= BMAP_LEFT_FILLING;
1532 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
1533 state |= BMAP_RIGHT_FILLING;
1534
1535 /*
1536 * Check and set flags if this segment has a left neighbor.
1537 * Don't set contiguous if the combined extent would be too large.
1538 */
1539 if (xfs_iext_peek_prev_extent(ifp, &bma->icur, &LEFT)) {
1540 state |= BMAP_LEFT_VALID;
1541 if (isnullstartblock(LEFT.br_startblock))
1542 state |= BMAP_LEFT_DELAY;
1543 }
1544
1545 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1546 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
1547 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
1548 LEFT.br_state == new->br_state &&
1549 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1550 state |= BMAP_LEFT_CONTIG;
1551
1552 /*
1553 * Check and set flags if this segment has a right neighbor.
1554 * Don't set contiguous if the combined extent would be too large.
1555 * Also check for all-three-contiguous being too large.
1556 */
1557 if (xfs_iext_peek_next_extent(ifp, &bma->icur, &RIGHT)) {
1558 state |= BMAP_RIGHT_VALID;
1559 if (isnullstartblock(RIGHT.br_startblock))
1560 state |= BMAP_RIGHT_DELAY;
1561 }
1562
1563 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1564 new_endoff == RIGHT.br_startoff &&
1565 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
1566 new->br_state == RIGHT.br_state &&
1567 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
1568 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1569 BMAP_RIGHT_FILLING)) !=
1570 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1571 BMAP_RIGHT_FILLING) ||
1572 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
1573 <= MAXEXTLEN))
1574 state |= BMAP_RIGHT_CONTIG;
1575
1576 error = 0;
1577 /*
1578 * Switch out based on the FILLING and CONTIG state bits.
1579 */
1580 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1581 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
1582 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1583 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1584 /*
1585 * Filling in all of a previously delayed allocation extent.
1586 * The left and right neighbors are both contiguous with new.
1587 */
1588 LEFT.br_blockcount += PREV.br_blockcount + RIGHT.br_blockcount;
1589
1590 xfs_iext_remove(bma->ip, &bma->icur, state);
1591 xfs_iext_remove(bma->ip, &bma->icur, state);
1592 xfs_iext_prev(ifp, &bma->icur);
1593 xfs_iext_update_extent(bma->ip, state, &bma->icur, &LEFT);
1594 ifp->if_nextents--;
1595
1596 if (bma->cur == NULL)
1597 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1598 else {
1599 rval = XFS_ILOG_CORE;
1600 error = xfs_bmbt_lookup_eq(bma->cur, &RIGHT, &i);
1601 if (error)
1602 goto done;
1603 if (XFS_IS_CORRUPT(mp, i != 1)) {
1604 error = -EFSCORRUPTED;
1605 goto done;
1606 }
1607 error = xfs_btree_delete(bma->cur, &i);
1608 if (error)
1609 goto done;
1610 if (XFS_IS_CORRUPT(mp, i != 1)) {
1611 error = -EFSCORRUPTED;
1612 goto done;
1613 }
1614 error = xfs_btree_decrement(bma->cur, 0, &i);
1615 if (error)
1616 goto done;
1617 if (XFS_IS_CORRUPT(mp, i != 1)) {
1618 error = -EFSCORRUPTED;
1619 goto done;
1620 }
1621 error = xfs_bmbt_update(bma->cur, &LEFT);
1622 if (error)
1623 goto done;
1624 }
1625 break;
1626
1627 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1628 /*
1629 * Filling in all of a previously delayed allocation extent.
1630 * The left neighbor is contiguous, the right is not.
1631 */
1632 old = LEFT;
1633 LEFT.br_blockcount += PREV.br_blockcount;
1634
1635 xfs_iext_remove(bma->ip, &bma->icur, state);
1636 xfs_iext_prev(ifp, &bma->icur);
1637 xfs_iext_update_extent(bma->ip, state, &bma->icur, &LEFT);
1638
1639 if (bma->cur == NULL)
1640 rval = XFS_ILOG_DEXT;
1641 else {
1642 rval = 0;
1643 error = xfs_bmbt_lookup_eq(bma->cur, &old, &i);
1644 if (error)
1645 goto done;
1646 if (XFS_IS_CORRUPT(mp, i != 1)) {
1647 error = -EFSCORRUPTED;
1648 goto done;
1649 }
1650 error = xfs_bmbt_update(bma->cur, &LEFT);
1651 if (error)
1652 goto done;
1653 }
1654 break;
1655
1656 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1657 /*
1658 * Filling in all of a previously delayed allocation extent.
1659 * The right neighbor is contiguous, the left is not. Take care
1660 * with delay -> unwritten extent allocation here because the
1661 * delalloc record we are overwriting is always written.
1662 */
1663 PREV.br_startblock = new->br_startblock;
1664 PREV.br_blockcount += RIGHT.br_blockcount;
1665 PREV.br_state = new->br_state;
1666
1667 xfs_iext_next(ifp, &bma->icur);
1668 xfs_iext_remove(bma->ip, &bma->icur, state);
1669 xfs_iext_prev(ifp, &bma->icur);
1670 xfs_iext_update_extent(bma->ip, state, &bma->icur, &PREV);
1671
1672 if (bma->cur == NULL)
1673 rval = XFS_ILOG_DEXT;
1674 else {
1675 rval = 0;
1676 error = xfs_bmbt_lookup_eq(bma->cur, &RIGHT, &i);
1677 if (error)
1678 goto done;
1679 if (XFS_IS_CORRUPT(mp, i != 1)) {
1680 error = -EFSCORRUPTED;
1681 goto done;
1682 }
1683 error = xfs_bmbt_update(bma->cur, &PREV);
1684 if (error)
1685 goto done;
1686 }
1687 break;
1688
1689 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
1690 /*
1691 * Filling in all of a previously delayed allocation extent.
1692 * Neither the left nor right neighbors are contiguous with
1693 * the new one.
1694 */
1695 PREV.br_startblock = new->br_startblock;
1696 PREV.br_state = new->br_state;
1697 xfs_iext_update_extent(bma->ip, state, &bma->icur, &PREV);
1698 ifp->if_nextents++;
1699
1700 if (bma->cur == NULL)
1701 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1702 else {
1703 rval = XFS_ILOG_CORE;
1704 error = xfs_bmbt_lookup_eq(bma->cur, new, &i);
1705 if (error)
1706 goto done;
1707 if (XFS_IS_CORRUPT(mp, i != 0)) {
1708 error = -EFSCORRUPTED;
1709 goto done;
1710 }
1711 error = xfs_btree_insert(bma->cur, &i);
1712 if (error)
1713 goto done;
1714 if (XFS_IS_CORRUPT(mp, i != 1)) {
1715 error = -EFSCORRUPTED;
1716 goto done;
1717 }
1718 }
1719 break;
1720
1721 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
1722 /*
1723 * Filling in the first part of a previous delayed allocation.
1724 * The left neighbor is contiguous.
1725 */
1726 old = LEFT;
1727 temp = PREV.br_blockcount - new->br_blockcount;
1728 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1729 startblockval(PREV.br_startblock));
1730
1731 LEFT.br_blockcount += new->br_blockcount;
1732
1733 PREV.br_blockcount = temp;
1734 PREV.br_startoff += new->br_blockcount;
1735 PREV.br_startblock = nullstartblock(da_new);
1736
1737 xfs_iext_update_extent(bma->ip, state, &bma->icur, &PREV);
1738 xfs_iext_prev(ifp, &bma->icur);
1739 xfs_iext_update_extent(bma->ip, state, &bma->icur, &LEFT);
1740
1741 if (bma->cur == NULL)
1742 rval = XFS_ILOG_DEXT;
1743 else {
1744 rval = 0;
1745 error = xfs_bmbt_lookup_eq(bma->cur, &old, &i);
1746 if (error)
1747 goto done;
1748 if (XFS_IS_CORRUPT(mp, i != 1)) {
1749 error = -EFSCORRUPTED;
1750 goto done;
1751 }
1752 error = xfs_bmbt_update(bma->cur, &LEFT);
1753 if (error)
1754 goto done;
1755 }
1756 break;
1757
1758 case BMAP_LEFT_FILLING:
1759 /*
1760 * Filling in the first part of a previous delayed allocation.
1761 * The left neighbor is not contiguous.
1762 */
1763 xfs_iext_update_extent(bma->ip, state, &bma->icur, new);
1764 ifp->if_nextents++;
1765
1766 if (bma->cur == NULL)
1767 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1768 else {
1769 rval = XFS_ILOG_CORE;
1770 error = xfs_bmbt_lookup_eq(bma->cur, new, &i);
1771 if (error)
1772 goto done;
1773 if (XFS_IS_CORRUPT(mp, i != 0)) {
1774 error = -EFSCORRUPTED;
1775 goto done;
1776 }
1777 error = xfs_btree_insert(bma->cur, &i);
1778 if (error)
1779 goto done;
1780 if (XFS_IS_CORRUPT(mp, i != 1)) {
1781 error = -EFSCORRUPTED;
1782 goto done;
1783 }
1784 }
1785
1786 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
1787 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
1788 &bma->cur, 1, &tmp_rval, whichfork);
1789 rval |= tmp_rval;
1790 if (error)
1791 goto done;
1792 }
1793
1794 temp = PREV.br_blockcount - new->br_blockcount;
1795 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1796 startblockval(PREV.br_startblock) -
1797 (bma->cur ? bma->cur->bc_ino.allocated : 0));
1798
1799 PREV.br_startoff = new_endoff;
1800 PREV.br_blockcount = temp;
1801 PREV.br_startblock = nullstartblock(da_new);
1802 xfs_iext_next(ifp, &bma->icur);
1803 xfs_iext_insert(bma->ip, &bma->icur, &PREV, state);
1804 xfs_iext_prev(ifp, &bma->icur);
1805 break;
1806
1807 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1808 /*
1809 * Filling in the last part of a previous delayed allocation.
1810 * The right neighbor is contiguous with the new allocation.
1811 */
1812 old = RIGHT;
1813 RIGHT.br_startoff = new->br_startoff;
1814 RIGHT.br_startblock = new->br_startblock;
1815 RIGHT.br_blockcount += new->br_blockcount;
1816
1817 if (bma->cur == NULL)
1818 rval = XFS_ILOG_DEXT;
1819 else {
1820 rval = 0;
1821 error = xfs_bmbt_lookup_eq(bma->cur, &old, &i);
1822 if (error)
1823 goto done;
1824 if (XFS_IS_CORRUPT(mp, i != 1)) {
1825 error = -EFSCORRUPTED;
1826 goto done;
1827 }
1828 error = xfs_bmbt_update(bma->cur, &RIGHT);
1829 if (error)
1830 goto done;
1831 }
1832
1833 temp = PREV.br_blockcount - new->br_blockcount;
1834 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1835 startblockval(PREV.br_startblock));
1836
1837 PREV.br_blockcount = temp;
1838 PREV.br_startblock = nullstartblock(da_new);
1839
1840 xfs_iext_update_extent(bma->ip, state, &bma->icur, &PREV);
1841 xfs_iext_next(ifp, &bma->icur);
1842 xfs_iext_update_extent(bma->ip, state, &bma->icur, &RIGHT);
1843 break;
1844
1845 case BMAP_RIGHT_FILLING:
1846 /*
1847 * Filling in the last part of a previous delayed allocation.
1848 * The right neighbor is not contiguous.
1849 */
1850 xfs_iext_update_extent(bma->ip, state, &bma->icur, new);
1851 ifp->if_nextents++;
1852
1853 if (bma->cur == NULL)
1854 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1855 else {
1856 rval = XFS_ILOG_CORE;
1857 error = xfs_bmbt_lookup_eq(bma->cur, new, &i);
1858 if (error)
1859 goto done;
1860 if (XFS_IS_CORRUPT(mp, i != 0)) {
1861 error = -EFSCORRUPTED;
1862 goto done;
1863 }
1864 error = xfs_btree_insert(bma->cur, &i);
1865 if (error)
1866 goto done;
1867 if (XFS_IS_CORRUPT(mp, i != 1)) {
1868 error = -EFSCORRUPTED;
1869 goto done;
1870 }
1871 }
1872
1873 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
1874 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
1875 &bma->cur, 1, &tmp_rval, whichfork);
1876 rval |= tmp_rval;
1877 if (error)
1878 goto done;
1879 }
1880
1881 temp = PREV.br_blockcount - new->br_blockcount;
1882 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1883 startblockval(PREV.br_startblock) -
1884 (bma->cur ? bma->cur->bc_ino.allocated : 0));
1885
1886 PREV.br_startblock = nullstartblock(da_new);
1887 PREV.br_blockcount = temp;
1888 xfs_iext_insert(bma->ip, &bma->icur, &PREV, state);
1889 xfs_iext_next(ifp, &bma->icur);
1890 break;
1891
1892 case 0:
1893 /*
1894 * Filling in the middle part of a previous delayed allocation.
1895 * Contiguity is impossible here.
1896 * This case is avoided almost all the time.
1897 *
1898 * We start with a delayed allocation:
1899 *
1900 * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+
1901 * PREV @ idx
1902 *
1903 * and we are allocating:
1904 * +rrrrrrrrrrrrrrrrr+
1905 * new
1906 *
1907 * and we set it up for insertion as:
1908 * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+
1909 * new
1910 * PREV @ idx LEFT RIGHT
1911 * inserted at idx + 1
1912 */
1913 old = PREV;
1914
1915 /* LEFT is the new middle */
1916 LEFT = *new;
1917
1918 /* RIGHT is the new right */
1919 RIGHT.br_state = PREV.br_state;
1920 RIGHT.br_startoff = new_endoff;
1921 RIGHT.br_blockcount =
1922 PREV.br_startoff + PREV.br_blockcount - new_endoff;
1923 RIGHT.br_startblock =
1924 nullstartblock(xfs_bmap_worst_indlen(bma->ip,
1925 RIGHT.br_blockcount));
1926
1927 /* truncate PREV */
1928 PREV.br_blockcount = new->br_startoff - PREV.br_startoff;
1929 PREV.br_startblock =
1930 nullstartblock(xfs_bmap_worst_indlen(bma->ip,
1931 PREV.br_blockcount));
1932 xfs_iext_update_extent(bma->ip, state, &bma->icur, &PREV);
1933
1934 xfs_iext_next(ifp, &bma->icur);
1935 xfs_iext_insert(bma->ip, &bma->icur, &RIGHT, state);
1936 xfs_iext_insert(bma->ip, &bma->icur, &LEFT, state);
1937 ifp->if_nextents++;
1938
1939 if (bma->cur == NULL)
1940 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1941 else {
1942 rval = XFS_ILOG_CORE;
1943 error = xfs_bmbt_lookup_eq(bma->cur, new, &i);
1944 if (error)
1945 goto done;
1946 if (XFS_IS_CORRUPT(mp, i != 0)) {
1947 error = -EFSCORRUPTED;
1948 goto done;
1949 }
1950 error = xfs_btree_insert(bma->cur, &i);
1951 if (error)
1952 goto done;
1953 if (XFS_IS_CORRUPT(mp, i != 1)) {
1954 error = -EFSCORRUPTED;
1955 goto done;
1956 }
1957 }
1958
1959 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
1960 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
1961 &bma->cur, 1, &tmp_rval, whichfork);
1962 rval |= tmp_rval;
1963 if (error)
1964 goto done;
1965 }
1966
1967 da_new = startblockval(PREV.br_startblock) +
1968 startblockval(RIGHT.br_startblock);
1969 break;
1970
1971 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1972 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1973 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
1974 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1975 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1976 case BMAP_LEFT_CONTIG:
1977 case BMAP_RIGHT_CONTIG:
1978 /*
1979 * These cases are all impossible.
1980 */
1981 ASSERT(0);
1982 }
1983
1984 /* add reverse mapping unless caller opted out */
1985 if (!(bma->flags & XFS_BMAPI_NORMAP))
1986 xfs_rmap_map_extent(bma->tp, bma->ip, whichfork, new);
1987
1988 /* convert to a btree if necessary */
1989 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
1990 int tmp_logflags; /* partial log flag return val */
1991
1992 ASSERT(bma->cur == NULL);
1993 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
1994 &bma->cur, da_old > 0, &tmp_logflags,
1995 whichfork);
1996 bma->logflags |= tmp_logflags;
1997 if (error)
1998 goto done;
1999 }
2000
2001 if (da_new != da_old)
2002 xfs_mod_delalloc(mp, (int64_t)da_new - da_old);
2003
2004 if (bma->cur) {
2005 da_new += bma->cur->bc_ino.allocated;
2006 bma->cur->bc_ino.allocated = 0;
2007 }
2008
2009 /* adjust for changes in reserved delayed indirect blocks */
2010 if (da_new != da_old) {
2011 ASSERT(state == 0 || da_new < da_old);
2012 error = xfs_mod_fdblocks(mp, (int64_t)(da_old - da_new),
2013 false);
2014 }
2015
2016 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork);
2017 done:
2018 if (whichfork != XFS_COW_FORK)
2019 bma->logflags |= rval;
2020 return error;
2021 #undef LEFT
2022 #undef RIGHT
2023 #undef PREV
2024 }
2025
2026 /*
2027 * Convert an unwritten allocation to a real allocation or vice versa.
2028 */
2029 int /* error */
2030 xfs_bmap_add_extent_unwritten_real(
2031 struct xfs_trans *tp,
2032 xfs_inode_t *ip, /* incore inode pointer */
2033 int whichfork,
2034 struct xfs_iext_cursor *icur,
2035 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
2036 xfs_bmbt_irec_t *new, /* new data to add to file extents */
2037 int *logflagsp) /* inode logging flags */
2038 {
2039 xfs_btree_cur_t *cur; /* btree cursor */
2040 int error; /* error return value */
2041 int i; /* temp state */
2042 struct xfs_ifork *ifp; /* inode fork pointer */
2043 xfs_fileoff_t new_endoff; /* end offset of new entry */
2044 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
2045 /* left is 0, right is 1, prev is 2 */
2046 int rval=0; /* return value (logging flags) */
2047 int state = xfs_bmap_fork_to_state(whichfork);
2048 struct xfs_mount *mp = ip->i_mount;
2049 struct xfs_bmbt_irec old;
2050
2051 *logflagsp = 0;
2052
2053 cur = *curp;
2054 ifp = XFS_IFORK_PTR(ip, whichfork);
2055
2056 ASSERT(!isnullstartblock(new->br_startblock));
2057
2058 XFS_STATS_INC(mp, xs_add_exlist);
2059
2060 #define LEFT r[0]
2061 #define RIGHT r[1]
2062 #define PREV r[2]
2063
2064 /*
2065 * Set up a bunch of variables to make the tests simpler.
2066 */
2067 error = 0;
2068 xfs_iext_get_extent(ifp, icur, &PREV);
2069 ASSERT(new->br_state != PREV.br_state);
2070 new_endoff = new->br_startoff + new->br_blockcount;
2071 ASSERT(PREV.br_startoff <= new->br_startoff);
2072 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
2073
2074 /*
2075 * Set flags determining what part of the previous oldext allocation
2076 * extent is being replaced by a newext allocation.
2077 */
2078 if (PREV.br_startoff == new->br_startoff)
2079 state |= BMAP_LEFT_FILLING;
2080 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
2081 state |= BMAP_RIGHT_FILLING;
2082
2083 /*
2084 * Check and set flags if this segment has a left neighbor.
2085 * Don't set contiguous if the combined extent would be too large.
2086 */
2087 if (xfs_iext_peek_prev_extent(ifp, icur, &LEFT)) {
2088 state |= BMAP_LEFT_VALID;
2089 if (isnullstartblock(LEFT.br_startblock))
2090 state |= BMAP_LEFT_DELAY;
2091 }
2092
2093 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
2094 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
2095 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
2096 LEFT.br_state == new->br_state &&
2097 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2098 state |= BMAP_LEFT_CONTIG;
2099
2100 /*
2101 * Check and set flags if this segment has a right neighbor.
2102 * Don't set contiguous if the combined extent would be too large.
2103 * Also check for all-three-contiguous being too large.
2104 */
2105 if (xfs_iext_peek_next_extent(ifp, icur, &RIGHT)) {
2106 state |= BMAP_RIGHT_VALID;
2107 if (isnullstartblock(RIGHT.br_startblock))
2108 state |= BMAP_RIGHT_DELAY;
2109 }
2110
2111 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
2112 new_endoff == RIGHT.br_startoff &&
2113 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
2114 new->br_state == RIGHT.br_state &&
2115 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
2116 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
2117 BMAP_RIGHT_FILLING)) !=
2118 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
2119 BMAP_RIGHT_FILLING) ||
2120 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
2121 <= MAXEXTLEN))
2122 state |= BMAP_RIGHT_CONTIG;
2123
2124 /*
2125 * Switch out based on the FILLING and CONTIG state bits.
2126 */
2127 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
2128 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
2129 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
2130 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2131 /*
2132 * Setting all of a previous oldext extent to newext.
2133 * The left and right neighbors are both contiguous with new.
2134 */
2135 LEFT.br_blockcount += PREV.br_blockcount + RIGHT.br_blockcount;
2136
2137 xfs_iext_remove(ip, icur, state);
2138 xfs_iext_remove(ip, icur, state);
2139 xfs_iext_prev(ifp, icur);
2140 xfs_iext_update_extent(ip, state, icur, &LEFT);
2141 ifp->if_nextents -= 2;
2142 if (cur == NULL)
2143 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2144 else {
2145 rval = XFS_ILOG_CORE;
2146 error = xfs_bmbt_lookup_eq(cur, &RIGHT, &i);
2147 if (error)
2148 goto done;
2149 if (XFS_IS_CORRUPT(mp, i != 1)) {
2150 error = -EFSCORRUPTED;
2151 goto done;
2152 }
2153 if ((error = xfs_btree_delete(cur, &i)))
2154 goto done;
2155 if (XFS_IS_CORRUPT(mp, i != 1)) {
2156 error = -EFSCORRUPTED;
2157 goto done;
2158 }
2159 if ((error = xfs_btree_decrement(cur, 0, &i)))
2160 goto done;
2161 if (XFS_IS_CORRUPT(mp, i != 1)) {
2162 error = -EFSCORRUPTED;
2163 goto done;
2164 }
2165 if ((error = xfs_btree_delete(cur, &i)))
2166 goto done;
2167 if (XFS_IS_CORRUPT(mp, i != 1)) {
2168 error = -EFSCORRUPTED;
2169 goto done;
2170 }
2171 if ((error = xfs_btree_decrement(cur, 0, &i)))
2172 goto done;
2173 if (XFS_IS_CORRUPT(mp, i != 1)) {
2174 error = -EFSCORRUPTED;
2175 goto done;
2176 }
2177 error = xfs_bmbt_update(cur, &LEFT);
2178 if (error)
2179 goto done;
2180 }
2181 break;
2182
2183 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2184 /*
2185 * Setting all of a previous oldext extent to newext.
2186 * The left neighbor is contiguous, the right is not.
2187 */
2188 LEFT.br_blockcount += PREV.br_blockcount;
2189
2190 xfs_iext_remove(ip, icur, state);
2191 xfs_iext_prev(ifp, icur);
2192 xfs_iext_update_extent(ip, state, icur, &LEFT);
2193 ifp->if_nextents--;
2194 if (cur == NULL)
2195 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2196 else {
2197 rval = XFS_ILOG_CORE;
2198 error = xfs_bmbt_lookup_eq(cur, &PREV, &i);
2199 if (error)
2200 goto done;
2201 if (XFS_IS_CORRUPT(mp, i != 1)) {
2202 error = -EFSCORRUPTED;
2203 goto done;
2204 }
2205 if ((error = xfs_btree_delete(cur, &i)))
2206 goto done;
2207 if (XFS_IS_CORRUPT(mp, i != 1)) {
2208 error = -EFSCORRUPTED;
2209 goto done;
2210 }
2211 if ((error = xfs_btree_decrement(cur, 0, &i)))
2212 goto done;
2213 if (XFS_IS_CORRUPT(mp, i != 1)) {
2214 error = -EFSCORRUPTED;
2215 goto done;
2216 }
2217 error = xfs_bmbt_update(cur, &LEFT);
2218 if (error)
2219 goto done;
2220 }
2221 break;
2222
2223 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2224 /*
2225 * Setting all of a previous oldext extent to newext.
2226 * The right neighbor is contiguous, the left is not.
2227 */
2228 PREV.br_blockcount += RIGHT.br_blockcount;
2229 PREV.br_state = new->br_state;
2230
2231 xfs_iext_next(ifp, icur);
2232 xfs_iext_remove(ip, icur, state);
2233 xfs_iext_prev(ifp, icur);
2234 xfs_iext_update_extent(ip, state, icur, &PREV);
2235 ifp->if_nextents--;
2236
2237 if (cur == NULL)
2238 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2239 else {
2240 rval = XFS_ILOG_CORE;
2241 error = xfs_bmbt_lookup_eq(cur, &RIGHT, &i);
2242 if (error)
2243 goto done;
2244 if (XFS_IS_CORRUPT(mp, i != 1)) {
2245 error = -EFSCORRUPTED;
2246 goto done;
2247 }
2248 if ((error = xfs_btree_delete(cur, &i)))
2249 goto done;
2250 if (XFS_IS_CORRUPT(mp, i != 1)) {
2251 error = -EFSCORRUPTED;
2252 goto done;
2253 }
2254 if ((error = xfs_btree_decrement(cur, 0, &i)))
2255 goto done;
2256 if (XFS_IS_CORRUPT(mp, i != 1)) {
2257 error = -EFSCORRUPTED;
2258 goto done;
2259 }
2260 error = xfs_bmbt_update(cur, &PREV);
2261 if (error)
2262 goto done;
2263 }
2264 break;
2265
2266 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
2267 /*
2268 * Setting all of a previous oldext extent to newext.
2269 * Neither the left nor right neighbors are contiguous with
2270 * the new one.
2271 */
2272 PREV.br_state = new->br_state;
2273 xfs_iext_update_extent(ip, state, icur, &PREV);
2274
2275 if (cur == NULL)
2276 rval = XFS_ILOG_DEXT;
2277 else {
2278 rval = 0;
2279 error = xfs_bmbt_lookup_eq(cur, new, &i);
2280 if (error)
2281 goto done;
2282 if (XFS_IS_CORRUPT(mp, i != 1)) {
2283 error = -EFSCORRUPTED;
2284 goto done;
2285 }
2286 error = xfs_bmbt_update(cur, &PREV);
2287 if (error)
2288 goto done;
2289 }
2290 break;
2291
2292 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
2293 /*
2294 * Setting the first part of a previous oldext extent to newext.
2295 * The left neighbor is contiguous.
2296 */
2297 LEFT.br_blockcount += new->br_blockcount;
2298
2299 old = PREV;
2300 PREV.br_startoff += new->br_blockcount;
2301 PREV.br_startblock += new->br_blockcount;
2302 PREV.br_blockcount -= new->br_blockcount;
2303
2304 xfs_iext_update_extent(ip, state, icur, &PREV);
2305 xfs_iext_prev(ifp, icur);
2306 xfs_iext_update_extent(ip, state, icur, &LEFT);
2307
2308 if (cur == NULL)
2309 rval = XFS_ILOG_DEXT;
2310 else {
2311 rval = 0;
2312 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2313 if (error)
2314 goto done;
2315 if (XFS_IS_CORRUPT(mp, i != 1)) {
2316 error = -EFSCORRUPTED;
2317 goto done;
2318 }
2319 error = xfs_bmbt_update(cur, &PREV);
2320 if (error)
2321 goto done;
2322 error = xfs_btree_decrement(cur, 0, &i);
2323 if (error)
2324 goto done;
2325 error = xfs_bmbt_update(cur, &LEFT);
2326 if (error)
2327 goto done;
2328 }
2329 break;
2330
2331 case BMAP_LEFT_FILLING:
2332 /*
2333 * Setting the first part of a previous oldext extent to newext.
2334 * The left neighbor is not contiguous.
2335 */
2336 old = PREV;
2337 PREV.br_startoff += new->br_blockcount;
2338 PREV.br_startblock += new->br_blockcount;
2339 PREV.br_blockcount -= new->br_blockcount;
2340
2341 xfs_iext_update_extent(ip, state, icur, &PREV);
2342 xfs_iext_insert(ip, icur, new, state);
2343 ifp->if_nextents++;
2344
2345 if (cur == NULL)
2346 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2347 else {
2348 rval = XFS_ILOG_CORE;
2349 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2350 if (error)
2351 goto done;
2352 if (XFS_IS_CORRUPT(mp, i != 1)) {
2353 error = -EFSCORRUPTED;
2354 goto done;
2355 }
2356 error = xfs_bmbt_update(cur, &PREV);
2357 if (error)
2358 goto done;
2359 cur->bc_rec.b = *new;
2360 if ((error = xfs_btree_insert(cur, &i)))
2361 goto done;
2362 if (XFS_IS_CORRUPT(mp, i != 1)) {
2363 error = -EFSCORRUPTED;
2364 goto done;
2365 }
2366 }
2367 break;
2368
2369 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2370 /*
2371 * Setting the last part of a previous oldext extent to newext.
2372 * The right neighbor is contiguous with the new allocation.
2373 */
2374 old = PREV;
2375 PREV.br_blockcount -= new->br_blockcount;
2376
2377 RIGHT.br_startoff = new->br_startoff;
2378 RIGHT.br_startblock = new->br_startblock;
2379 RIGHT.br_blockcount += new->br_blockcount;
2380
2381 xfs_iext_update_extent(ip, state, icur, &PREV);
2382 xfs_iext_next(ifp, icur);
2383 xfs_iext_update_extent(ip, state, icur, &RIGHT);
2384
2385 if (cur == NULL)
2386 rval = XFS_ILOG_DEXT;
2387 else {
2388 rval = 0;
2389 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2390 if (error)
2391 goto done;
2392 if (XFS_IS_CORRUPT(mp, i != 1)) {
2393 error = -EFSCORRUPTED;
2394 goto done;
2395 }
2396 error = xfs_bmbt_update(cur, &PREV);
2397 if (error)
2398 goto done;
2399 error = xfs_btree_increment(cur, 0, &i);
2400 if (error)
2401 goto done;
2402 error = xfs_bmbt_update(cur, &RIGHT);
2403 if (error)
2404 goto done;
2405 }
2406 break;
2407
2408 case BMAP_RIGHT_FILLING:
2409 /*
2410 * Setting the last part of a previous oldext extent to newext.
2411 * The right neighbor is not contiguous.
2412 */
2413 old = PREV;
2414 PREV.br_blockcount -= new->br_blockcount;
2415
2416 xfs_iext_update_extent(ip, state, icur, &PREV);
2417 xfs_iext_next(ifp, icur);
2418 xfs_iext_insert(ip, icur, new, state);
2419 ifp->if_nextents++;
2420
2421 if (cur == NULL)
2422 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2423 else {
2424 rval = XFS_ILOG_CORE;
2425 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2426 if (error)
2427 goto done;
2428 if (XFS_IS_CORRUPT(mp, i != 1)) {
2429 error = -EFSCORRUPTED;
2430 goto done;
2431 }
2432 error = xfs_bmbt_update(cur, &PREV);
2433 if (error)
2434 goto done;
2435 error = xfs_bmbt_lookup_eq(cur, new, &i);
2436 if (error)
2437 goto done;
2438 if (XFS_IS_CORRUPT(mp, i != 0)) {
2439 error = -EFSCORRUPTED;
2440 goto done;
2441 }
2442 if ((error = xfs_btree_insert(cur, &i)))
2443 goto done;
2444 if (XFS_IS_CORRUPT(mp, i != 1)) {
2445 error = -EFSCORRUPTED;
2446 goto done;
2447 }
2448 }
2449 break;
2450
2451 case 0:
2452 /*
2453 * Setting the middle part of a previous oldext extent to
2454 * newext. Contiguity is impossible here.
2455 * One extent becomes three extents.
2456 */
2457 old = PREV;
2458 PREV.br_blockcount = new->br_startoff - PREV.br_startoff;
2459
2460 r[0] = *new;
2461 r[1].br_startoff = new_endoff;
2462 r[1].br_blockcount =
2463 old.br_startoff + old.br_blockcount - new_endoff;
2464 r[1].br_startblock = new->br_startblock + new->br_blockcount;
2465 r[1].br_state = PREV.br_state;
2466
2467 xfs_iext_update_extent(ip, state, icur, &PREV);
2468 xfs_iext_next(ifp, icur);
2469 xfs_iext_insert(ip, icur, &r[1], state);
2470 xfs_iext_insert(ip, icur, &r[0], state);
2471 ifp->if_nextents += 2;
2472
2473 if (cur == NULL)
2474 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2475 else {
2476 rval = XFS_ILOG_CORE;
2477 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2478 if (error)
2479 goto done;
2480 if (XFS_IS_CORRUPT(mp, i != 1)) {
2481 error = -EFSCORRUPTED;
2482 goto done;
2483 }
2484 /* new right extent - oldext */
2485 error = xfs_bmbt_update(cur, &r[1]);
2486 if (error)
2487 goto done;
2488 /* new left extent - oldext */
2489 cur->bc_rec.b = PREV;
2490 if ((error = xfs_btree_insert(cur, &i)))
2491 goto done;
2492 if (XFS_IS_CORRUPT(mp, i != 1)) {
2493 error = -EFSCORRUPTED;
2494 goto done;
2495 }
2496 /*
2497 * Reset the cursor to the position of the new extent
2498 * we are about to insert as we can't trust it after
2499 * the previous insert.
2500 */
2501 error = xfs_bmbt_lookup_eq(cur, new, &i);
2502 if (error)
2503 goto done;
2504 if (XFS_IS_CORRUPT(mp, i != 0)) {
2505 error = -EFSCORRUPTED;
2506 goto done;
2507 }
2508 /* new middle extent - newext */
2509 if ((error = xfs_btree_insert(cur, &i)))
2510 goto done;
2511 if (XFS_IS_CORRUPT(mp, i != 1)) {
2512 error = -EFSCORRUPTED;
2513 goto done;
2514 }
2515 }
2516 break;
2517
2518 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2519 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2520 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
2521 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2522 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2523 case BMAP_LEFT_CONTIG:
2524 case BMAP_RIGHT_CONTIG:
2525 /*
2526 * These cases are all impossible.
2527 */
2528 ASSERT(0);
2529 }
2530
2531 /* update reverse mappings */
2532 xfs_rmap_convert_extent(mp, tp, ip, whichfork, new);
2533
2534 /* convert to a btree if necessary */
2535 if (xfs_bmap_needs_btree(ip, whichfork)) {
2536 int tmp_logflags; /* partial log flag return val */
2537
2538 ASSERT(cur == NULL);
2539 error = xfs_bmap_extents_to_btree(tp, ip, &cur, 0,
2540 &tmp_logflags, whichfork);
2541 *logflagsp |= tmp_logflags;
2542 if (error)
2543 goto done;
2544 }
2545
2546 /* clear out the allocated field, done with it now in any case. */
2547 if (cur) {
2548 cur->bc_ino.allocated = 0;
2549 *curp = cur;
2550 }
2551
2552 xfs_bmap_check_leaf_extents(*curp, ip, whichfork);
2553 done:
2554 *logflagsp |= rval;
2555 return error;
2556 #undef LEFT
2557 #undef RIGHT
2558 #undef PREV
2559 }
2560
2561 /*
2562 * Convert a hole to a delayed allocation.
2563 */
2564 STATIC void
2565 xfs_bmap_add_extent_hole_delay(
2566 xfs_inode_t *ip, /* incore inode pointer */
2567 int whichfork,
2568 struct xfs_iext_cursor *icur,
2569 xfs_bmbt_irec_t *new) /* new data to add to file extents */
2570 {
2571 struct xfs_ifork *ifp; /* inode fork pointer */
2572 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2573 xfs_filblks_t newlen=0; /* new indirect size */
2574 xfs_filblks_t oldlen=0; /* old indirect size */
2575 xfs_bmbt_irec_t right; /* right neighbor extent entry */
2576 int state = xfs_bmap_fork_to_state(whichfork);
2577 xfs_filblks_t temp; /* temp for indirect calculations */
2578
2579 ifp = XFS_IFORK_PTR(ip, whichfork);
2580 ASSERT(isnullstartblock(new->br_startblock));
2581
2582 /*
2583 * Check and set flags if this segment has a left neighbor
2584 */
2585 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) {
2586 state |= BMAP_LEFT_VALID;
2587 if (isnullstartblock(left.br_startblock))
2588 state |= BMAP_LEFT_DELAY;
2589 }
2590
2591 /*
2592 * Check and set flags if the current (right) segment exists.
2593 * If it doesn't exist, we're converting the hole at end-of-file.
2594 */
2595 if (xfs_iext_get_extent(ifp, icur, &right)) {
2596 state |= BMAP_RIGHT_VALID;
2597 if (isnullstartblock(right.br_startblock))
2598 state |= BMAP_RIGHT_DELAY;
2599 }
2600
2601 /*
2602 * Set contiguity flags on the left and right neighbors.
2603 * Don't let extents get too large, even if the pieces are contiguous.
2604 */
2605 if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) &&
2606 left.br_startoff + left.br_blockcount == new->br_startoff &&
2607 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2608 state |= BMAP_LEFT_CONTIG;
2609
2610 if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) &&
2611 new->br_startoff + new->br_blockcount == right.br_startoff &&
2612 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
2613 (!(state & BMAP_LEFT_CONTIG) ||
2614 (left.br_blockcount + new->br_blockcount +
2615 right.br_blockcount <= MAXEXTLEN)))
2616 state |= BMAP_RIGHT_CONTIG;
2617
2618 /*
2619 * Switch out based on the contiguity flags.
2620 */
2621 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
2622 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2623 /*
2624 * New allocation is contiguous with delayed allocations
2625 * on the left and on the right.
2626 * Merge all three into a single extent record.
2627 */
2628 temp = left.br_blockcount + new->br_blockcount +
2629 right.br_blockcount;
2630
2631 oldlen = startblockval(left.br_startblock) +
2632 startblockval(new->br_startblock) +
2633 startblockval(right.br_startblock);
2634 newlen = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2635 oldlen);
2636 left.br_startblock = nullstartblock(newlen);
2637 left.br_blockcount = temp;
2638
2639 xfs_iext_remove(ip, icur, state);
2640 xfs_iext_prev(ifp, icur);
2641 xfs_iext_update_extent(ip, state, icur, &left);
2642 break;
2643
2644 case BMAP_LEFT_CONTIG:
2645 /*
2646 * New allocation is contiguous with a delayed allocation
2647 * on the left.
2648 * Merge the new allocation with the left neighbor.
2649 */
2650 temp = left.br_blockcount + new->br_blockcount;
2651
2652 oldlen = startblockval(left.br_startblock) +
2653 startblockval(new->br_startblock);
2654 newlen = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2655 oldlen);
2656 left.br_blockcount = temp;
2657 left.br_startblock = nullstartblock(newlen);
2658
2659 xfs_iext_prev(ifp, icur);
2660 xfs_iext_update_extent(ip, state, icur, &left);
2661 break;
2662
2663 case BMAP_RIGHT_CONTIG:
2664 /*
2665 * New allocation is contiguous with a delayed allocation
2666 * on the right.
2667 * Merge the new allocation with the right neighbor.
2668 */
2669 temp = new->br_blockcount + right.br_blockcount;
2670 oldlen = startblockval(new->br_startblock) +
2671 startblockval(right.br_startblock);
2672 newlen = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2673 oldlen);
2674 right.br_startoff = new->br_startoff;
2675 right.br_startblock = nullstartblock(newlen);
2676 right.br_blockcount = temp;
2677 xfs_iext_update_extent(ip, state, icur, &right);
2678 break;
2679
2680 case 0:
2681 /*
2682 * New allocation is not contiguous with another
2683 * delayed allocation.
2684 * Insert a new entry.
2685 */
2686 oldlen = newlen = 0;
2687 xfs_iext_insert(ip, icur, new, state);
2688 break;
2689 }
2690 if (oldlen != newlen) {
2691 ASSERT(oldlen > newlen);
2692 xfs_mod_fdblocks(ip->i_mount, (int64_t)(oldlen - newlen),
2693 false);
2694 /*
2695 * Nothing to do for disk quota accounting here.
2696 */
2697 xfs_mod_delalloc(ip->i_mount, (int64_t)newlen - oldlen);
2698 }
2699 }
2700
2701 /*
2702 * Convert a hole to a real allocation.
2703 */
2704 STATIC int /* error */
2705 xfs_bmap_add_extent_hole_real(
2706 struct xfs_trans *tp,
2707 struct xfs_inode *ip,
2708 int whichfork,
2709 struct xfs_iext_cursor *icur,
2710 struct xfs_btree_cur **curp,
2711 struct xfs_bmbt_irec *new,
2712 int *logflagsp,
2713 int flags)
2714 {
2715 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
2716 struct xfs_mount *mp = ip->i_mount;
2717 struct xfs_btree_cur *cur = *curp;
2718 int error; /* error return value */
2719 int i; /* temp state */
2720 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2721 xfs_bmbt_irec_t right; /* right neighbor extent entry */
2722 int rval=0; /* return value (logging flags) */
2723 int state = xfs_bmap_fork_to_state(whichfork);
2724 struct xfs_bmbt_irec old;
2725
2726 ASSERT(!isnullstartblock(new->br_startblock));
2727 ASSERT(!cur || !(cur->bc_ino.flags & XFS_BTCUR_BMBT_WASDEL));
2728
2729 XFS_STATS_INC(mp, xs_add_exlist);
2730
2731 /*
2732 * Check and set flags if this segment has a left neighbor.
2733 */
2734 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) {
2735 state |= BMAP_LEFT_VALID;
2736 if (isnullstartblock(left.br_startblock))
2737 state |= BMAP_LEFT_DELAY;
2738 }
2739
2740 /*
2741 * Check and set flags if this segment has a current value.
2742 * Not true if we're inserting into the "hole" at eof.
2743 */
2744 if (xfs_iext_get_extent(ifp, icur, &right)) {
2745 state |= BMAP_RIGHT_VALID;
2746 if (isnullstartblock(right.br_startblock))
2747 state |= BMAP_RIGHT_DELAY;
2748 }
2749
2750 /*
2751 * We're inserting a real allocation between "left" and "right".
2752 * Set the contiguity flags. Don't let extents get too large.
2753 */
2754 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
2755 left.br_startoff + left.br_blockcount == new->br_startoff &&
2756 left.br_startblock + left.br_blockcount == new->br_startblock &&
2757 left.br_state == new->br_state &&
2758 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2759 state |= BMAP_LEFT_CONTIG;
2760
2761 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
2762 new->br_startoff + new->br_blockcount == right.br_startoff &&
2763 new->br_startblock + new->br_blockcount == right.br_startblock &&
2764 new->br_state == right.br_state &&
2765 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
2766 (!(state & BMAP_LEFT_CONTIG) ||
2767 left.br_blockcount + new->br_blockcount +
2768 right.br_blockcount <= MAXEXTLEN))
2769 state |= BMAP_RIGHT_CONTIG;
2770
2771 error = 0;
2772 /*
2773 * Select which case we're in here, and implement it.
2774 */
2775 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
2776 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2777 /*
2778 * New allocation is contiguous with real allocations on the
2779 * left and on the right.
2780 * Merge all three into a single extent record.
2781 */
2782 left.br_blockcount += new->br_blockcount + right.br_blockcount;
2783
2784 xfs_iext_remove(ip, icur, state);
2785 xfs_iext_prev(ifp, icur);
2786 xfs_iext_update_extent(ip, state, icur, &left);
2787 ifp->if_nextents--;
2788
2789 if (cur == NULL) {
2790 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
2791 } else {
2792 rval = XFS_ILOG_CORE;
2793 error = xfs_bmbt_lookup_eq(cur, &right, &i);
2794 if (error)
2795 goto done;
2796 if (XFS_IS_CORRUPT(mp, i != 1)) {
2797 error = -EFSCORRUPTED;
2798 goto done;
2799 }
2800 error = xfs_btree_delete(cur, &i);
2801 if (error)
2802 goto done;
2803 if (XFS_IS_CORRUPT(mp, i != 1)) {
2804 error = -EFSCORRUPTED;
2805 goto done;
2806 }
2807 error = xfs_btree_decrement(cur, 0, &i);
2808 if (error)
2809 goto done;
2810 if (XFS_IS_CORRUPT(mp, i != 1)) {
2811 error = -EFSCORRUPTED;
2812 goto done;
2813 }
2814 error = xfs_bmbt_update(cur, &left);
2815 if (error)
2816 goto done;
2817 }
2818 break;
2819
2820 case BMAP_LEFT_CONTIG:
2821 /*
2822 * New allocation is contiguous with a real allocation
2823 * on the left.
2824 * Merge the new allocation with the left neighbor.
2825 */
2826 old = left;
2827 left.br_blockcount += new->br_blockcount;
2828
2829 xfs_iext_prev(ifp, icur);
2830 xfs_iext_update_extent(ip, state, icur, &left);
2831
2832 if (cur == NULL) {
2833 rval = xfs_ilog_fext(whichfork);
2834 } else {
2835 rval = 0;
2836 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2837 if (error)
2838 goto done;
2839 if (XFS_IS_CORRUPT(mp, i != 1)) {
2840 error = -EFSCORRUPTED;
2841 goto done;
2842 }
2843 error = xfs_bmbt_update(cur, &left);
2844 if (error)
2845 goto done;
2846 }
2847 break;
2848
2849 case BMAP_RIGHT_CONTIG:
2850 /*
2851 * New allocation is contiguous with a real allocation
2852 * on the right.
2853 * Merge the new allocation with the right neighbor.
2854 */
2855 old = right;
2856
2857 right.br_startoff = new->br_startoff;
2858 right.br_startblock = new->br_startblock;
2859 right.br_blockcount += new->br_blockcount;
2860 xfs_iext_update_extent(ip, state, icur, &right);
2861
2862 if (cur == NULL) {
2863 rval = xfs_ilog_fext(whichfork);
2864 } else {
2865 rval = 0;
2866 error = xfs_bmbt_lookup_eq(cur, &old, &i);
2867 if (error)
2868 goto done;
2869 if (XFS_IS_CORRUPT(mp, i != 1)) {
2870 error = -EFSCORRUPTED;
2871 goto done;
2872 }
2873 error = xfs_bmbt_update(cur, &right);
2874 if (error)
2875 goto done;
2876 }
2877 break;
2878
2879 case 0:
2880 /*
2881 * New allocation is not contiguous with another
2882 * real allocation.
2883 * Insert a new entry.
2884 */
2885 xfs_iext_insert(ip, icur, new, state);
2886 ifp->if_nextents++;
2887
2888 if (cur == NULL) {
2889 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
2890 } else {
2891 rval = XFS_ILOG_CORE;
2892 error = xfs_bmbt_lookup_eq(cur, new, &i);
2893 if (error)
2894 goto done;
2895 if (XFS_IS_CORRUPT(mp, i != 0)) {
2896 error = -EFSCORRUPTED;
2897 goto done;
2898 }
2899 error = xfs_btree_insert(cur, &i);
2900 if (error)
2901 goto done;
2902 if (XFS_IS_CORRUPT(mp, i != 1)) {
2903 error = -EFSCORRUPTED;
2904 goto done;
2905 }
2906 }
2907 break;
2908 }
2909
2910 /* add reverse mapping unless caller opted out */
2911 if (!(flags & XFS_BMAPI_NORMAP))
2912 xfs_rmap_map_extent(tp, ip, whichfork, new);
2913
2914 /* convert to a btree if necessary */
2915 if (xfs_bmap_needs_btree(ip, whichfork)) {
2916 int tmp_logflags; /* partial log flag return val */
2917
2918 ASSERT(cur == NULL);
2919 error = xfs_bmap_extents_to_btree(tp, ip, curp, 0,
2920 &tmp_logflags, whichfork);
2921 *logflagsp |= tmp_logflags;
2922 cur = *curp;
2923 if (error)
2924 goto done;
2925 }
2926
2927 /* clear out the allocated field, done with it now in any case. */
2928 if (cur)
2929 cur->bc_ino.allocated = 0;
2930
2931 xfs_bmap_check_leaf_extents(cur, ip, whichfork);
2932 done:
2933 *logflagsp |= rval;
2934 return error;
2935 }
2936
2937 /*
2938 * Functions used in the extent read, allocate and remove paths
2939 */
2940
2941 /*
2942 * Adjust the size of the new extent based on di_extsize and rt extsize.
2943 */
2944 int
2945 xfs_bmap_extsize_align(
2946 xfs_mount_t *mp,
2947 xfs_bmbt_irec_t *gotp, /* next extent pointer */
2948 xfs_bmbt_irec_t *prevp, /* previous extent pointer */
2949 xfs_extlen_t extsz, /* align to this extent size */
2950 int rt, /* is this a realtime inode? */
2951 int eof, /* is extent at end-of-file? */
2952 int delay, /* creating delalloc extent? */
2953 int convert, /* overwriting unwritten extent? */
2954 xfs_fileoff_t *offp, /* in/out: aligned offset */
2955 xfs_extlen_t *lenp) /* in/out: aligned length */
2956 {
2957 xfs_fileoff_t orig_off; /* original offset */
2958 xfs_extlen_t orig_alen; /* original length */
2959 xfs_fileoff_t orig_end; /* original off+len */
2960 xfs_fileoff_t nexto; /* next file offset */
2961 xfs_fileoff_t prevo; /* previous file offset */
2962 xfs_fileoff_t align_off; /* temp for offset */
2963 xfs_extlen_t align_alen; /* temp for length */
2964 xfs_extlen_t temp; /* temp for calculations */
2965
2966 if (convert)
2967 return 0;
2968
2969 orig_off = align_off = *offp;
2970 orig_alen = align_alen = *lenp;
2971 orig_end = orig_off + orig_alen;
2972
2973 /*
2974 * If this request overlaps an existing extent, then don't
2975 * attempt to perform any additional alignment.
2976 */
2977 if (!delay && !eof &&
2978 (orig_off >= gotp->br_startoff) &&
2979 (orig_end <= gotp->br_startoff + gotp->br_blockcount)) {
2980 return 0;
2981 }
2982
2983 /*
2984 * If the file offset is unaligned vs. the extent size
2985 * we need to align it. This will be possible unless
2986 * the file was previously written with a kernel that didn't
2987 * perform this alignment, or if a truncate shot us in the
2988 * foot.
2989 */
2990 div_u64_rem(orig_off, extsz, &temp);
2991 if (temp) {
2992 align_alen += temp;
2993 align_off -= temp;
2994 }
2995
2996 /* Same adjustment for the end of the requested area. */
2997 temp = (align_alen % extsz);
2998 if (temp)
2999 align_alen += extsz - temp;
3000
3001 /*
3002 * For large extent hint sizes, the aligned extent might be larger than
3003 * MAXEXTLEN. In that case, reduce the size by an extsz so that it pulls
3004 * the length back under MAXEXTLEN. The outer allocation loops handle
3005 * short allocation just fine, so it is safe to do this. We only want to
3006 * do it when we are forced to, though, because it means more allocation
3007 * operations are required.
3008 */
3009 while (align_alen > MAXEXTLEN)
3010 align_alen -= extsz;
3011 ASSERT(align_alen <= MAXEXTLEN);
3012
3013 /*
3014 * If the previous block overlaps with this proposed allocation
3015 * then move the start forward without adjusting the length.
3016 */
3017 if (prevp->br_startoff != NULLFILEOFF) {
3018 if (prevp->br_startblock == HOLESTARTBLOCK)
3019 prevo = prevp->br_startoff;
3020 else
3021 prevo = prevp->br_startoff + prevp->br_blockcount;
3022 } else
3023 prevo = 0;
3024 if (align_off != orig_off && align_off < prevo)
3025 align_off = prevo;
3026 /*
3027 * If the next block overlaps with this proposed allocation
3028 * then move the start back without adjusting the length,
3029 * but not before offset 0.
3030 * This may of course make the start overlap previous block,
3031 * and if we hit the offset 0 limit then the next block
3032 * can still overlap too.
3033 */
3034 if (!eof && gotp->br_startoff != NULLFILEOFF) {
3035 if ((delay && gotp->br_startblock == HOLESTARTBLOCK) ||
3036 (!delay && gotp->br_startblock == DELAYSTARTBLOCK))
3037 nexto = gotp->br_startoff + gotp->br_blockcount;
3038 else
3039 nexto = gotp->br_startoff;
3040 } else
3041 nexto = NULLFILEOFF;
3042 if (!eof &&
3043 align_off + align_alen != orig_end &&
3044 align_off + align_alen > nexto)
3045 align_off = nexto > align_alen ? nexto - align_alen : 0;
3046 /*
3047 * If we're now overlapping the next or previous extent that
3048 * means we can't fit an extsz piece in this hole. Just move
3049 * the start forward to the first valid spot and set
3050 * the length so we hit the end.
3051 */
3052 if (align_off != orig_off && align_off < prevo)
3053 align_off = prevo;
3054 if (align_off + align_alen != orig_end &&
3055 align_off + align_alen > nexto &&
3056 nexto != NULLFILEOFF) {
3057 ASSERT(nexto > prevo);
3058 align_alen = nexto - align_off;
3059 }
3060
3061 /*
3062 * If realtime, and the result isn't a multiple of the realtime
3063 * extent size we need to remove blocks until it is.
3064 */
3065 if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) {
3066 /*
3067 * We're not covering the original request, or
3068 * we won't be able to once we fix the length.
3069 */
3070 if (orig_off < align_off ||
3071 orig_end > align_off + align_alen ||
3072 align_alen - temp < orig_alen)
3073 return -EINVAL;
3074 /*
3075 * Try to fix it by moving the start up.
3076 */
3077 if (align_off + temp <= orig_off) {
3078 align_alen -= temp;
3079 align_off += temp;
3080 }
3081 /*
3082 * Try to fix it by moving the end in.
3083 */
3084 else if (align_off + align_alen - temp >= orig_end)
3085 align_alen -= temp;
3086 /*
3087 * Set the start to the minimum then trim the length.
3088 */
3089 else {
3090 align_alen -= orig_off - align_off;
3091 align_off = orig_off;
3092 align_alen -= align_alen % mp->m_sb.sb_rextsize;
3093 }
3094 /*
3095 * Result doesn't cover the request, fail it.
3096 */
3097 if (orig_off < align_off || orig_end > align_off + align_alen)
3098 return -EINVAL;
3099 } else {
3100 ASSERT(orig_off >= align_off);
3101 /* see MAXEXTLEN handling above */
3102 ASSERT(orig_end <= align_off + align_alen ||
3103 align_alen + extsz > MAXEXTLEN);
3104 }
3105
3106 #ifdef DEBUG
3107 if (!eof && gotp->br_startoff != NULLFILEOFF)
3108 ASSERT(align_off + align_alen <= gotp->br_startoff);
3109 if (prevp->br_startoff != NULLFILEOFF)
3110 ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount);
3111 #endif
3112
3113 *lenp = align_alen;
3114 *offp = align_off;
3115 return 0;
3116 }
3117
3118 #define XFS_ALLOC_GAP_UNITS 4
3119
3120 void
3121 xfs_bmap_adjacent(
3122 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3123 {
3124 xfs_fsblock_t adjust; /* adjustment to block numbers */
3125 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
3126 xfs_mount_t *mp; /* mount point structure */
3127 int nullfb; /* true if ap->firstblock isn't set */
3128 int rt; /* true if inode is realtime */
3129
3130 #define ISVALID(x,y) \
3131 (rt ? \
3132 (x) < mp->m_sb.sb_rblocks : \
3133 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \
3134 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \
3135 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks)
3136
3137 mp = ap->ip->i_mount;
3138 nullfb = ap->tp->t_firstblock == NULLFSBLOCK;
3139 rt = XFS_IS_REALTIME_INODE(ap->ip) &&
3140 (ap->datatype & XFS_ALLOC_USERDATA);
3141 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp,
3142 ap->tp->t_firstblock);
3143 /*
3144 * If allocating at eof, and there's a previous real block,
3145 * try to use its last block as our starting point.
3146 */
3147 if (ap->eof && ap->prev.br_startoff != NULLFILEOFF &&
3148 !isnullstartblock(ap->prev.br_startblock) &&
3149 ISVALID(ap->prev.br_startblock + ap->prev.br_blockcount,
3150 ap->prev.br_startblock)) {
3151 ap->blkno = ap->prev.br_startblock + ap->prev.br_blockcount;
3152 /*
3153 * Adjust for the gap between prevp and us.
3154 */
3155 adjust = ap->offset -
3156 (ap->prev.br_startoff + ap->prev.br_blockcount);
3157 if (adjust &&
3158 ISVALID(ap->blkno + adjust, ap->prev.br_startblock))
3159 ap->blkno += adjust;
3160 }
3161 /*
3162 * If not at eof, then compare the two neighbor blocks.
3163 * Figure out whether either one gives us a good starting point,
3164 * and pick the better one.
3165 */
3166 else if (!ap->eof) {
3167 xfs_fsblock_t gotbno; /* right side block number */
3168 xfs_fsblock_t gotdiff=0; /* right side difference */
3169 xfs_fsblock_t prevbno; /* left side block number */
3170 xfs_fsblock_t prevdiff=0; /* left side difference */
3171
3172 /*
3173 * If there's a previous (left) block, select a requested
3174 * start block based on it.
3175 */
3176 if (ap->prev.br_startoff != NULLFILEOFF &&
3177 !isnullstartblock(ap->prev.br_startblock) &&
3178 (prevbno = ap->prev.br_startblock +
3179 ap->prev.br_blockcount) &&
3180 ISVALID(prevbno, ap->prev.br_startblock)) {
3181 /*
3182 * Calculate gap to end of previous block.
3183 */
3184 adjust = prevdiff = ap->offset -
3185 (ap->prev.br_startoff +
3186 ap->prev.br_blockcount);
3187 /*
3188 * Figure the startblock based on the previous block's
3189 * end and the gap size.
3190 * Heuristic!
3191 * If the gap is large relative to the piece we're
3192 * allocating, or using it gives us an invalid block
3193 * number, then just use the end of the previous block.
3194 */
3195 if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
3196 ISVALID(prevbno + prevdiff,
3197 ap->prev.br_startblock))
3198 prevbno += adjust;
3199 else
3200 prevdiff += adjust;
3201 /*
3202 * If the firstblock forbids it, can't use it,
3203 * must use default.
3204 */
3205 if (!rt && !nullfb &&
3206 XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno)
3207 prevbno = NULLFSBLOCK;
3208 }
3209 /*
3210 * No previous block or can't follow it, just default.
3211 */
3212 else
3213 prevbno = NULLFSBLOCK;
3214 /*
3215 * If there's a following (right) block, select a requested
3216 * start block based on it.
3217 */
3218 if (!isnullstartblock(ap->got.br_startblock)) {
3219 /*
3220 * Calculate gap to start of next block.
3221 */
3222 adjust = gotdiff = ap->got.br_startoff - ap->offset;
3223 /*
3224 * Figure the startblock based on the next block's
3225 * start and the gap size.
3226 */
3227 gotbno = ap->got.br_startblock;
3228 /*
3229 * Heuristic!
3230 * If the gap is large relative to the piece we're
3231 * allocating, or using it gives us an invalid block
3232 * number, then just use the start of the next block
3233 * offset by our length.
3234 */
3235 if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
3236 ISVALID(gotbno - gotdiff, gotbno))
3237 gotbno -= adjust;
3238 else if (ISVALID(gotbno - ap->length, gotbno)) {
3239 gotbno -= ap->length;
3240 gotdiff += adjust - ap->length;
3241 } else
3242 gotdiff += adjust;
3243 /*
3244 * If the firstblock forbids it, can't use it,
3245 * must use default.
3246 */
3247 if (!rt && !nullfb &&
3248 XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno)
3249 gotbno = NULLFSBLOCK;
3250 }
3251 /*
3252 * No next block, just default.
3253 */
3254 else
3255 gotbno = NULLFSBLOCK;
3256 /*
3257 * If both valid, pick the better one, else the only good
3258 * one, else ap->blkno is already set (to 0 or the inode block).
3259 */
3260 if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK)
3261 ap->blkno = prevdiff <= gotdiff ? prevbno : gotbno;
3262 else if (prevbno != NULLFSBLOCK)
3263 ap->blkno = prevbno;
3264 else if (gotbno != NULLFSBLOCK)
3265 ap->blkno = gotbno;
3266 }
3267 #undef ISVALID
3268 }
3269
3270 static int
3271 xfs_bmap_longest_free_extent(
3272 struct xfs_trans *tp,
3273 xfs_agnumber_t ag,
3274 xfs_extlen_t *blen,
3275 int *notinit)
3276 {
3277 struct xfs_mount *mp = tp->t_mountp;
3278 struct xfs_perag *pag;
3279 xfs_extlen_t longest;
3280 int error = 0;
3281
3282 pag = xfs_perag_get(mp, ag);
3283 if (!pag->pagf_init) {
3284 error = xfs_alloc_pagf_init(mp, tp, ag, XFS_ALLOC_FLAG_TRYLOCK);
3285 if (error) {
3286 /* Couldn't lock the AGF, so skip this AG. */
3287 if (error == -EAGAIN) {
3288 *notinit = 1;
3289 error = 0;
3290 }
3291 goto out;
3292 }
3293 }
3294
3295 longest = xfs_alloc_longest_free_extent(pag,
3296 xfs_alloc_min_freelist(mp, pag),
3297 xfs_ag_resv_needed(pag, XFS_AG_RESV_NONE));
3298 if (*blen < longest)
3299 *blen = longest;
3300
3301 out:
3302 xfs_perag_put(pag);
3303 return error;
3304 }
3305
3306 static void
3307 xfs_bmap_select_minlen(
3308 struct xfs_bmalloca *ap,
3309 struct xfs_alloc_arg *args,
3310 xfs_extlen_t *blen,
3311 int notinit)
3312 {
3313 if (notinit || *blen < ap->minlen) {
3314 /*
3315 * Since we did a BUF_TRYLOCK above, it is possible that
3316 * there is space for this request.
3317 */
3318 args->minlen = ap->minlen;
3319 } else if (*blen < args->maxlen) {
3320 /*
3321 * If the best seen length is less than the request length,
3322 * use the best as the minimum.
3323 */
3324 args->minlen = *blen;
3325 } else {
3326 /*
3327 * Otherwise we've seen an extent as big as maxlen, use that
3328 * as the minimum.
3329 */
3330 args->minlen = args->maxlen;
3331 }
3332 }
3333
3334 STATIC int
3335 xfs_bmap_btalloc_nullfb(
3336 struct xfs_bmalloca *ap,
3337 struct xfs_alloc_arg *args,
3338 xfs_extlen_t *blen)
3339 {
3340 struct xfs_mount *mp = ap->ip->i_mount;
3341 xfs_agnumber_t ag, startag;
3342 int notinit = 0;
3343 int error;
3344
3345 args->type = XFS_ALLOCTYPE_START_BNO;
3346 args->total = ap->total;
3347
3348 startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
3349 if (startag == NULLAGNUMBER)
3350 startag = ag = 0;
3351
3352 while (*blen < args->maxlen) {
3353 error = xfs_bmap_longest_free_extent(args->tp, ag, blen,
3354 &notinit);
3355 if (error)
3356 return error;
3357
3358 if (++ag == mp->m_sb.sb_agcount)
3359 ag = 0;
3360 if (ag == startag)
3361 break;
3362 }
3363
3364 xfs_bmap_select_minlen(ap, args, blen, notinit);
3365 return 0;
3366 }
3367
3368 STATIC int
3369 xfs_bmap_btalloc_filestreams(
3370 struct xfs_bmalloca *ap,
3371 struct xfs_alloc_arg *args,
3372 xfs_extlen_t *blen)
3373 {
3374 struct xfs_mount *mp = ap->ip->i_mount;
3375 xfs_agnumber_t ag;
3376 int notinit = 0;
3377 int error;
3378
3379 args->type = XFS_ALLOCTYPE_NEAR_BNO;
3380 args->total = ap->total;
3381
3382 ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
3383 if (ag == NULLAGNUMBER)
3384 ag = 0;
3385
3386 error = xfs_bmap_longest_free_extent(args->tp, ag, blen, &notinit);
3387 if (error)
3388 return error;
3389
3390 if (*blen < args->maxlen) {
3391 error = xfs_filestream_new_ag(ap, &ag);
3392 if (error)
3393 return error;
3394
3395 error = xfs_bmap_longest_free_extent(args->tp, ag, blen,
3396 &notinit);
3397 if (error)
3398 return error;
3399
3400 }
3401
3402 xfs_bmap_select_minlen(ap, args, blen, notinit);
3403
3404 /*
3405 * Set the failure fallback case to look in the selected AG as stream
3406 * may have moved.
3407 */
3408 ap->blkno = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0);
3409 return 0;
3410 }
3411
3412 /* Update all inode and quota accounting for the allocation we just did. */
3413 static void
3414 xfs_bmap_btalloc_accounting(
3415 struct xfs_bmalloca *ap,
3416 struct xfs_alloc_arg *args)
3417 {
3418 if (ap->flags & XFS_BMAPI_COWFORK) {
3419 /*
3420 * COW fork blocks are in-core only and thus are treated as
3421 * in-core quota reservation (like delalloc blocks) even when
3422 * converted to real blocks. The quota reservation is not
3423 * accounted to disk until blocks are remapped to the data
3424 * fork. So if these blocks were previously delalloc, we
3425 * already have quota reservation and there's nothing to do
3426 * yet.
3427 */
3428 if (ap->wasdel) {
3429 xfs_mod_delalloc(ap->ip->i_mount, -(int64_t)args->len);
3430 return;
3431 }
3432
3433 /*
3434 * Otherwise, we've allocated blocks in a hole. The transaction
3435 * has acquired in-core quota reservation for this extent.
3436 * Rather than account these as real blocks, however, we reduce
3437 * the transaction quota reservation based on the allocation.
3438 * This essentially transfers the transaction quota reservation
3439 * to that of a delalloc extent.
3440 */
3441 ap->ip->i_delayed_blks += args->len;
3442 xfs_trans_mod_dquot_byino(ap->tp, ap->ip, XFS_TRANS_DQ_RES_BLKS,
3443 -(long)args->len);
3444 return;
3445 }
3446
3447 /* data/attr fork only */
3448 ap->ip->i_d.di_nblocks += args->len;
3449 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
3450 if (ap->wasdel) {
3451 ap->ip->i_delayed_blks -= args->len;
3452 xfs_mod_delalloc(ap->ip->i_mount, -(int64_t)args->len);
3453 }
3454 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
3455 ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT : XFS_TRANS_DQ_BCOUNT,
3456 args->len);
3457 }
3458
3459 static int
3460 xfs_bmap_compute_alignments(
3461 struct xfs_bmalloca *ap,
3462 struct xfs_alloc_arg *args)
3463 {
3464 struct xfs_mount *mp = args->mp;
3465 xfs_extlen_t align = 0; /* minimum allocation alignment */
3466 int stripe_align = 0;
3467 int error;
3468
3469 /* stripe alignment for allocation is determined by mount parameters */
3470 if (mp->m_swidth && (mp->m_flags & XFS_MOUNT_SWALLOC))
3471 stripe_align = mp->m_swidth;
3472 else if (mp->m_dalign)
3473 stripe_align = mp->m_dalign;
3474
3475 if (ap->flags & XFS_BMAPI_COWFORK)
3476 align = xfs_get_cowextsz_hint(ap->ip);
3477 else if (ap->datatype & XFS_ALLOC_USERDATA)
3478 align = xfs_get_extsz_hint(ap->ip);
3479 if (align) {
3480 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
3481 align, 0, ap->eof, 0, ap->conv,
3482 &ap->offset, &ap->length);
3483 ASSERT(!error);
3484 ASSERT(ap->length);
3485 }
3486
3487 /* apply extent size hints if obtained earlier */
3488 if (align) {
3489 args->prod = align;
3490 div_u64_rem(ap->offset, args->prod, &args->mod);
3491 if (args->mod)
3492 args->mod = args->prod - args->mod;
3493 } else if (mp->m_sb.sb_blocksize >= PAGE_SIZE) {
3494 args->prod = 1;
3495 args->mod = 0;
3496 } else {
3497 args->prod = PAGE_SIZE >> mp->m_sb.sb_blocklog;
3498 div_u64_rem(ap->offset, args->prod, &args->mod);
3499 if (args->mod)
3500 args->mod = args->prod - args->mod;
3501 }
3502
3503 return stripe_align;
3504 }
3505
3506 static void
3507 xfs_bmap_process_allocated_extent(
3508 struct xfs_bmalloca *ap,
3509 struct xfs_alloc_arg *args,
3510 xfs_fileoff_t orig_offset,
3511 xfs_extlen_t orig_length)
3512 {
3513 int nullfb;
3514
3515 nullfb = ap->tp->t_firstblock == NULLFSBLOCK;
3516
3517 /*
3518 * check the allocation happened at the same or higher AG than
3519 * the first block that was allocated.
3520 */
3521 ASSERT(nullfb ||
3522 XFS_FSB_TO_AGNO(args->mp, ap->tp->t_firstblock) <=
3523 XFS_FSB_TO_AGNO(args->mp, args->fsbno));
3524
3525 ap->blkno = args->fsbno;
3526 if (nullfb)
3527 ap->tp->t_firstblock = args->fsbno;
3528 ap->length = args->len;
3529 /*
3530 * If the extent size hint is active, we tried to round the
3531 * caller's allocation request offset down to extsz and the
3532 * length up to another extsz boundary. If we found a free
3533 * extent we mapped it in starting at this new offset. If the
3534 * newly mapped space isn't long enough to cover any of the
3535 * range of offsets that was originally requested, move the
3536 * mapping up so that we can fill as much of the caller's
3537 * original request as possible. Free space is apparently
3538 * very fragmented so we're unlikely to be able to satisfy the
3539 * hints anyway.
3540 */
3541 if (ap->length <= orig_length)
3542 ap->offset = orig_offset;
3543 else if (ap->offset + ap->length < orig_offset + orig_length)
3544 ap->offset = orig_offset + orig_length - ap->length;
3545 xfs_bmap_btalloc_accounting(ap, args);
3546 }
3547
3548 STATIC int
3549 xfs_bmap_btalloc(
3550 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3551 {
3552 xfs_mount_t *mp; /* mount point structure */
3553 xfs_alloctype_t atype = 0; /* type for allocation routines */
3554 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
3555 xfs_agnumber_t ag;
3556 xfs_alloc_arg_t args;
3557 xfs_fileoff_t orig_offset;
3558 xfs_extlen_t orig_length;
3559 xfs_extlen_t blen;
3560 xfs_extlen_t nextminlen = 0;
3561 int nullfb; /* true if ap->firstblock isn't set */
3562 int isaligned;
3563 int tryagain;
3564 int error;
3565 int stripe_align;
3566
3567 ASSERT(ap->length);
3568 orig_offset = ap->offset;
3569 orig_length = ap->length;
3570
3571 mp = ap->ip->i_mount;
3572
3573 memset(&args, 0, sizeof(args));
3574 args.tp = ap->tp;
3575 args.mp = mp;
3576
3577 stripe_align = xfs_bmap_compute_alignments(ap, &args);
3578
3579 nullfb = ap->tp->t_firstblock == NULLFSBLOCK;
3580 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp,
3581 ap->tp->t_firstblock);
3582 if (nullfb) {
3583 if ((ap->datatype & XFS_ALLOC_USERDATA) &&
3584 xfs_inode_is_filestream(ap->ip)) {
3585 ag = xfs_filestream_lookup_ag(ap->ip);
3586 ag = (ag != NULLAGNUMBER) ? ag : 0;
3587 ap->blkno = XFS_AGB_TO_FSB(mp, ag, 0);
3588 } else {
3589 ap->blkno = XFS_INO_TO_FSB(mp, ap->ip->i_ino);
3590 }
3591 } else
3592 ap->blkno = ap->tp->t_firstblock;
3593
3594 xfs_bmap_adjacent(ap);
3595
3596 /*
3597 * If allowed, use ap->blkno; otherwise must use firstblock since
3598 * it's in the right allocation group.
3599 */
3600 if (nullfb || XFS_FSB_TO_AGNO(mp, ap->blkno) == fb_agno)
3601 ;
3602 else
3603 ap->blkno = ap->tp->t_firstblock;
3604 /*
3605 * Normal allocation, done through xfs_alloc_vextent.
3606 */
3607 tryagain = isaligned = 0;
3608 args.fsbno = ap->blkno;
3609 args.oinfo = XFS_RMAP_OINFO_SKIP_UPDATE;
3610
3611 /* Trim the allocation back to the maximum an AG can fit. */
3612 args.maxlen = min(ap->length, mp->m_ag_max_usable);
3613 blen = 0;
3614 if (nullfb) {
3615 /*
3616 * Search for an allocation group with a single extent large
3617 * enough for the request. If one isn't found, then adjust
3618 * the minimum allocation size to the largest space found.
3619 */
3620 if ((ap->datatype & XFS_ALLOC_USERDATA) &&
3621 xfs_inode_is_filestream(ap->ip))
3622 error = xfs_bmap_btalloc_filestreams(ap, &args, &blen);
3623 else
3624 error = xfs_bmap_btalloc_nullfb(ap, &args, &blen);
3625 if (error)
3626 return error;
3627 } else if (ap->tp->t_flags & XFS_TRANS_LOWMODE) {
3628 if (xfs_inode_is_filestream(ap->ip))
3629 args.type = XFS_ALLOCTYPE_FIRST_AG;
3630 else
3631 args.type = XFS_ALLOCTYPE_START_BNO;
3632 args.total = args.minlen = ap->minlen;
3633 } else {
3634 args.type = XFS_ALLOCTYPE_NEAR_BNO;
3635 args.total = ap->total;
3636 args.minlen = ap->minlen;
3637 }
3638
3639 /*
3640 * If we are not low on available data blocks, and the underlying
3641 * logical volume manager is a stripe, and the file offset is zero then
3642 * try to allocate data blocks on stripe unit boundary. NOTE: ap->aeof
3643 * is only set if the allocation length is >= the stripe unit and the
3644 * allocation offset is at the end of file.
3645 */
3646 if (!(ap->tp->t_flags & XFS_TRANS_LOWMODE) && ap->aeof) {
3647 if (!ap->offset) {
3648 args.alignment = stripe_align;
3649 atype = args.type;
3650 isaligned = 1;
3651 /*
3652 * Adjust minlen to try and preserve alignment if we
3653 * can't guarantee an aligned maxlen extent.
3654 */
3655 if (blen > args.alignment &&
3656 blen <= args.maxlen + args.alignment)
3657 args.minlen = blen - args.alignment;
3658 args.minalignslop = 0;
3659 } else {
3660 /*
3661 * First try an exact bno allocation.
3662 * If it fails then do a near or start bno
3663 * allocation with alignment turned on.
3664 */
3665 atype = args.type;
3666 tryagain = 1;
3667 args.type = XFS_ALLOCTYPE_THIS_BNO;
3668 args.alignment = 1;
3669 /*
3670 * Compute the minlen+alignment for the
3671 * next case. Set slop so that the value
3672 * of minlen+alignment+slop doesn't go up
3673 * between the calls.
3674 */
3675 if (blen > stripe_align && blen <= args.maxlen)
3676 nextminlen = blen - stripe_align;
3677 else
3678 nextminlen = args.minlen;
3679 if (nextminlen + stripe_align > args.minlen + 1)
3680 args.minalignslop =
3681 nextminlen + stripe_align -
3682 args.minlen - 1;
3683 else
3684 args.minalignslop = 0;
3685 }
3686 } else {
3687 args.alignment = 1;
3688 args.minalignslop = 0;
3689 }
3690 args.minleft = ap->minleft;
3691 args.wasdel = ap->wasdel;
3692 args.resv = XFS_AG_RESV_NONE;
3693 args.datatype = ap->datatype;
3694
3695 error = xfs_alloc_vextent(&args);
3696 if (error)
3697 return error;
3698
3699 if (tryagain && args.fsbno == NULLFSBLOCK) {
3700 /*
3701 * Exact allocation failed. Now try with alignment
3702 * turned on.
3703 */
3704 args.type = atype;
3705 args.fsbno = ap->blkno;
3706 args.alignment = stripe_align;
3707 args.minlen = nextminlen;
3708 args.minalignslop = 0;
3709 isaligned = 1;
3710 if ((error = xfs_alloc_vextent(&args)))
3711 return error;
3712 }
3713 if (isaligned && args.fsbno == NULLFSBLOCK) {
3714 /*
3715 * allocation failed, so turn off alignment and
3716 * try again.
3717 */
3718 args.type = atype;
3719 args.fsbno = ap->blkno;
3720 args.alignment = 0;
3721 if ((error = xfs_alloc_vextent(&args)))
3722 return error;
3723 }
3724 if (args.fsbno == NULLFSBLOCK && nullfb &&
3725 args.minlen > ap->minlen) {
3726 args.minlen = ap->minlen;
3727 args.type = XFS_ALLOCTYPE_START_BNO;
3728 args.fsbno = ap->blkno;
3729 if ((error = xfs_alloc_vextent(&args)))
3730 return error;
3731 }
3732 if (args.fsbno == NULLFSBLOCK && nullfb) {
3733 args.fsbno = 0;
3734 args.type = XFS_ALLOCTYPE_FIRST_AG;
3735 args.total = ap->minlen;
3736 if ((error = xfs_alloc_vextent(&args)))
3737 return error;
3738 ap->tp->t_flags |= XFS_TRANS_LOWMODE;
3739 }
3740
3741 if (args.fsbno != NULLFSBLOCK) {
3742 xfs_bmap_process_allocated_extent(ap, &args, orig_offset,
3743 orig_length);
3744 } else {
3745 ap->blkno = NULLFSBLOCK;
3746 ap->length = 0;
3747 }
3748 return 0;
3749 }
3750
3751 /* Trim extent to fit a logical block range. */
3752 void
3753 xfs_trim_extent(
3754 struct xfs_bmbt_irec *irec,
3755 xfs_fileoff_t bno,
3756 xfs_filblks_t len)
3757 {
3758 xfs_fileoff_t distance;
3759 xfs_fileoff_t end = bno + len;
3760
3761 if (irec->br_startoff + irec->br_blockcount <= bno ||
3762 irec->br_startoff >= end) {
3763 irec->br_blockcount = 0;
3764 return;
3765 }
3766
3767 if (irec->br_startoff < bno) {
3768 distance = bno - irec->br_startoff;
3769 if (isnullstartblock(irec->br_startblock))
3770 irec->br_startblock = DELAYSTARTBLOCK;
3771 if (irec->br_startblock != DELAYSTARTBLOCK &&
3772 irec->br_startblock != HOLESTARTBLOCK)
3773 irec->br_startblock += distance;
3774 irec->br_startoff += distance;
3775 irec->br_blockcount -= distance;
3776 }
3777
3778 if (end < irec->br_startoff + irec->br_blockcount) {
3779 distance = irec->br_startoff + irec->br_blockcount - end;
3780 irec->br_blockcount -= distance;
3781 }
3782 }
3783
3784 /*
3785 * Trim the returned map to the required bounds
3786 */
3787 STATIC void
3788 xfs_bmapi_trim_map(
3789 struct xfs_bmbt_irec *mval,
3790 struct xfs_bmbt_irec *got,
3791 xfs_fileoff_t *bno,
3792 xfs_filblks_t len,
3793 xfs_fileoff_t obno,
3794 xfs_fileoff_t end,
3795 int n,
3796 int flags)
3797 {
3798 if ((flags & XFS_BMAPI_ENTIRE) ||
3799 got->br_startoff + got->br_blockcount <= obno) {
3800 *mval = *got;
3801 if (isnullstartblock(got->br_startblock))
3802 mval->br_startblock = DELAYSTARTBLOCK;
3803 return;
3804 }
3805
3806 if (obno > *bno)
3807 *bno = obno;
3808 ASSERT((*bno >= obno) || (n == 0));
3809 ASSERT(*bno < end);
3810 mval->br_startoff = *bno;
3811 if (isnullstartblock(got->br_startblock))
3812 mval->br_startblock = DELAYSTARTBLOCK;
3813 else
3814 mval->br_startblock = got->br_startblock +
3815 (*bno - got->br_startoff);
3816 /*
3817 * Return the minimum of what we got and what we asked for for
3818 * the length. We can use the len variable here because it is
3819 * modified below and we could have been there before coming
3820 * here if the first part of the allocation didn't overlap what
3821 * was asked for.
3822 */
3823 mval->br_blockcount = XFS_FILBLKS_MIN(end - *bno,
3824 got->br_blockcount - (*bno - got->br_startoff));
3825 mval->br_state = got->br_state;
3826 ASSERT(mval->br_blockcount <= len);
3827 return;
3828 }
3829
3830 /*
3831 * Update and validate the extent map to return
3832 */
3833 STATIC void
3834 xfs_bmapi_update_map(
3835 struct xfs_bmbt_irec **map,
3836 xfs_fileoff_t *bno,
3837 xfs_filblks_t *len,
3838 xfs_fileoff_t obno,
3839 xfs_fileoff_t end,
3840 int *n,
3841 int flags)
3842 {
3843 xfs_bmbt_irec_t *mval = *map;
3844
3845 ASSERT((flags & XFS_BMAPI_ENTIRE) ||
3846 ((mval->br_startoff + mval->br_blockcount) <= end));
3847 ASSERT((flags & XFS_BMAPI_ENTIRE) || (mval->br_blockcount <= *len) ||
3848 (mval->br_startoff < obno));
3849
3850 *bno = mval->br_startoff + mval->br_blockcount;
3851 *len = end - *bno;
3852 if (*n > 0 && mval->br_startoff == mval[-1].br_startoff) {
3853 /* update previous map with new information */
3854 ASSERT(mval->br_startblock == mval[-1].br_startblock);
3855 ASSERT(mval->br_blockcount > mval[-1].br_blockcount);
3856 ASSERT(mval->br_state == mval[-1].br_state);
3857 mval[-1].br_blockcount = mval->br_blockcount;
3858 mval[-1].br_state = mval->br_state;
3859 } else if (*n > 0 && mval->br_startblock != DELAYSTARTBLOCK &&
3860 mval[-1].br_startblock != DELAYSTARTBLOCK &&
3861 mval[-1].br_startblock != HOLESTARTBLOCK &&
3862 mval->br_startblock == mval[-1].br_startblock +
3863 mval[-1].br_blockcount &&
3864 mval[-1].br_state == mval->br_state) {
3865 ASSERT(mval->br_startoff ==
3866 mval[-1].br_startoff + mval[-1].br_blockcount);
3867 mval[-1].br_blockcount += mval->br_blockcount;
3868 } else if (*n > 0 &&
3869 mval->br_startblock == DELAYSTARTBLOCK &&
3870 mval[-1].br_startblock == DELAYSTARTBLOCK &&
3871 mval->br_startoff ==
3872 mval[-1].br_startoff + mval[-1].br_blockcount) {
3873 mval[-1].br_blockcount += mval->br_blockcount;
3874 mval[-1].br_state = mval->br_state;
3875 } else if (!((*n == 0) &&
3876 ((mval->br_startoff + mval->br_blockcount) <=
3877 obno))) {
3878 mval++;
3879 (*n)++;
3880 }
3881 *map = mval;
3882 }
3883
3884 /*
3885 * Map file blocks to filesystem blocks without allocation.
3886 */
3887 int
3888 xfs_bmapi_read(
3889 struct xfs_inode *ip,
3890 xfs_fileoff_t bno,
3891 xfs_filblks_t len,
3892 struct xfs_bmbt_irec *mval,
3893 int *nmap,
3894 int flags)
3895 {
3896 struct xfs_mount *mp = ip->i_mount;
3897 int whichfork = xfs_bmapi_whichfork(flags);
3898 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
3899 struct xfs_bmbt_irec got;
3900 xfs_fileoff_t obno;
3901 xfs_fileoff_t end;
3902 struct xfs_iext_cursor icur;
3903 int error;
3904 bool eof = false;
3905 int n = 0;
3906
3907 ASSERT(*nmap >= 1);
3908 ASSERT(!(flags & ~(XFS_BMAPI_ATTRFORK | XFS_BMAPI_ENTIRE)));
3909 ASSERT(xfs_isilocked(ip, XFS_ILOCK_SHARED|XFS_ILOCK_EXCL));
3910
3911 if (WARN_ON_ONCE(!ifp))
3912 return -EFSCORRUPTED;
3913
3914 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)) ||
3915 XFS_TEST_ERROR(false, mp, XFS_ERRTAG_BMAPIFORMAT))
3916 return -EFSCORRUPTED;
3917
3918 if (XFS_FORCED_SHUTDOWN(mp))
3919 return -EIO;
3920
3921 XFS_STATS_INC(mp, xs_blk_mapr);
3922
3923 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
3924 error = xfs_iread_extents(NULL, ip, whichfork);
3925 if (error)
3926 return error;
3927 }
3928
3929 if (!xfs_iext_lookup_extent(ip, ifp, bno, &icur, &got))
3930 eof = true;
3931 end = bno + len;
3932 obno = bno;
3933
3934 while (bno < end && n < *nmap) {
3935 /* Reading past eof, act as though there's a hole up to end. */
3936 if (eof)
3937 got.br_startoff = end;
3938 if (got.br_startoff > bno) {
3939 /* Reading in a hole. */
3940 mval->br_startoff = bno;
3941 mval->br_startblock = HOLESTARTBLOCK;
3942 mval->br_blockcount =
3943 XFS_FILBLKS_MIN(len, got.br_startoff - bno);
3944 mval->br_state = XFS_EXT_NORM;
3945 bno += mval->br_blockcount;
3946 len -= mval->br_blockcount;
3947 mval++;
3948 n++;
3949 continue;
3950 }
3951
3952 /* set up the extent map to return. */
3953 xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags);
3954 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
3955
3956 /* If we're done, stop now. */
3957 if (bno >= end || n >= *nmap)
3958 break;
3959
3960 /* Else go on to the next record. */
3961 if (!xfs_iext_next_extent(ifp, &icur, &got))
3962 eof = true;
3963 }
3964 *nmap = n;
3965 return 0;
3966 }
3967
3968 /*
3969 * Add a delayed allocation extent to an inode. Blocks are reserved from the
3970 * global pool and the extent inserted into the inode in-core extent tree.
3971 *
3972 * On entry, got refers to the first extent beyond the offset of the extent to
3973 * allocate or eof is specified if no such extent exists. On return, got refers
3974 * to the extent record that was inserted to the inode fork.
3975 *
3976 * Note that the allocated extent may have been merged with contiguous extents
3977 * during insertion into the inode fork. Thus, got does not reflect the current
3978 * state of the inode fork on return. If necessary, the caller can use lastx to
3979 * look up the updated record in the inode fork.
3980 */
3981 int
3982 xfs_bmapi_reserve_delalloc(
3983 struct xfs_inode *ip,
3984 int whichfork,
3985 xfs_fileoff_t off,
3986 xfs_filblks_t len,
3987 xfs_filblks_t prealloc,
3988 struct xfs_bmbt_irec *got,
3989 struct xfs_iext_cursor *icur,
3990 int eof)
3991 {
3992 struct xfs_mount *mp = ip->i_mount;
3993 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
3994 xfs_extlen_t alen;
3995 xfs_extlen_t indlen;
3996 int error;
3997 xfs_fileoff_t aoff = off;
3998
3999 /*
4000 * Cap the alloc length. Keep track of prealloc so we know whether to
4001 * tag the inode before we return.
4002 */
4003 alen = XFS_FILBLKS_MIN(len + prealloc, MAXEXTLEN);
4004 if (!eof)
4005 alen = XFS_FILBLKS_MIN(alen, got->br_startoff - aoff);
4006 if (prealloc && alen >= len)
4007 prealloc = alen - len;
4008
4009 /* Figure out the extent size, adjust alen */
4010 if (whichfork == XFS_COW_FORK) {
4011 struct xfs_bmbt_irec prev;
4012 xfs_extlen_t extsz = xfs_get_cowextsz_hint(ip);
4013
4014 if (!xfs_iext_peek_prev_extent(ifp, icur, &prev))
4015 prev.br_startoff = NULLFILEOFF;
4016
4017 error = xfs_bmap_extsize_align(mp, got, &prev, extsz, 0, eof,
4018 1, 0, &aoff, &alen);
4019 ASSERT(!error);
4020 }
4021
4022 /*
4023 * Make a transaction-less quota reservation for delayed allocation
4024 * blocks. This number gets adjusted later. We return if we haven't
4025 * allocated blocks already inside this loop.
4026 */
4027 error = xfs_trans_reserve_quota_nblks(NULL, ip, (long)alen, 0,
4028 XFS_QMOPT_RES_REGBLKS);
4029 if (error)
4030 return error;
4031
4032 /*
4033 * Split changing sb for alen and indlen since they could be coming
4034 * from different places.
4035 */
4036 indlen = (xfs_extlen_t)xfs_bmap_worst_indlen(ip, alen);
4037 ASSERT(indlen > 0);
4038
4039 error = xfs_mod_fdblocks(mp, -((int64_t)alen), false);
4040 if (error)
4041 goto out_unreserve_quota;
4042
4043 error = xfs_mod_fdblocks(mp, -((int64_t)indlen), false);
4044 if (error)
4045 goto out_unreserve_blocks;
4046
4047
4048 ip->i_delayed_blks += alen;
4049 xfs_mod_delalloc(ip->i_mount, alen + indlen);
4050
4051 got->br_startoff = aoff;
4052 got->br_startblock = nullstartblock(indlen);
4053 got->br_blockcount = alen;
4054 got->br_state = XFS_EXT_NORM;
4055
4056 xfs_bmap_add_extent_hole_delay(ip, whichfork, icur, got);
4057
4058 /*
4059 * Tag the inode if blocks were preallocated. Note that COW fork
4060 * preallocation can occur at the start or end of the extent, even when
4061 * prealloc == 0, so we must also check the aligned offset and length.
4062 */
4063 if (whichfork == XFS_DATA_FORK && prealloc)
4064 xfs_inode_set_eofblocks_tag(ip);
4065 if (whichfork == XFS_COW_FORK && (prealloc || aoff < off || alen > len))
4066 xfs_inode_set_cowblocks_tag(ip);
4067
4068 return 0;
4069
4070 out_unreserve_blocks:
4071 xfs_mod_fdblocks(mp, alen, false);
4072 out_unreserve_quota:
4073 if (XFS_IS_QUOTA_ON(mp))
4074 xfs_trans_unreserve_quota_nblks(NULL, ip, (long)alen, 0,
4075 XFS_QMOPT_RES_REGBLKS);
4076 return error;
4077 }
4078
4079 static int
4080 xfs_bmap_alloc_userdata(
4081 struct xfs_bmalloca *bma)
4082 {
4083 struct xfs_mount *mp = bma->ip->i_mount;
4084 int whichfork = xfs_bmapi_whichfork(bma->flags);
4085 int error;
4086
4087 /*
4088 * Set the data type being allocated. For the data fork, the first data
4089 * in the file is treated differently to all other allocations. For the
4090 * attribute fork, we only need to ensure the allocated range is not on
4091 * the busy list.
4092 */
4093 bma->datatype = XFS_ALLOC_NOBUSY;
4094 if (whichfork == XFS_DATA_FORK) {
4095 bma->datatype |= XFS_ALLOC_USERDATA;
4096 if (bma->offset == 0)
4097 bma->datatype |= XFS_ALLOC_INITIAL_USER_DATA;
4098
4099 if (mp->m_dalign && bma->length >= mp->m_dalign) {
4100 error = xfs_bmap_isaeof(bma, whichfork);
4101 if (error)
4102 return error;
4103 }
4104
4105 if (XFS_IS_REALTIME_INODE(bma->ip))
4106 return xfs_bmap_rtalloc(bma);
4107 }
4108
4109 return xfs_bmap_btalloc(bma);
4110 }
4111
4112 static int
4113 xfs_bmapi_allocate(
4114 struct xfs_bmalloca *bma)
4115 {
4116 struct xfs_mount *mp = bma->ip->i_mount;
4117 int whichfork = xfs_bmapi_whichfork(bma->flags);
4118 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4119 int tmp_logflags = 0;
4120 int error;
4121
4122 ASSERT(bma->length > 0);
4123
4124 /*
4125 * For the wasdelay case, we could also just allocate the stuff asked
4126 * for in this bmap call but that wouldn't be as good.
4127 */
4128 if (bma->wasdel) {
4129 bma->length = (xfs_extlen_t)bma->got.br_blockcount;
4130 bma->offset = bma->got.br_startoff;
4131 if (!xfs_iext_peek_prev_extent(ifp, &bma->icur, &bma->prev))
4132 bma->prev.br_startoff = NULLFILEOFF;
4133 } else {
4134 bma->length = XFS_FILBLKS_MIN(bma->length, MAXEXTLEN);
4135 if (!bma->eof)
4136 bma->length = XFS_FILBLKS_MIN(bma->length,
4137 bma->got.br_startoff - bma->offset);
4138 }
4139
4140 if (bma->flags & XFS_BMAPI_CONTIG)
4141 bma->minlen = bma->length;
4142 else
4143 bma->minlen = 1;
4144
4145 if (bma->flags & XFS_BMAPI_METADATA)
4146 error = xfs_bmap_btalloc(bma);
4147 else
4148 error = xfs_bmap_alloc_userdata(bma);
4149 if (error || bma->blkno == NULLFSBLOCK)
4150 return error;
4151
4152 if (bma->flags & XFS_BMAPI_ZERO) {
4153 error = xfs_zero_extent(bma->ip, bma->blkno, bma->length);
4154 if (error)
4155 return error;
4156 }
4157
4158 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur)
4159 bma->cur = xfs_bmbt_init_cursor(mp, bma->tp, bma->ip, whichfork);
4160 /*
4161 * Bump the number of extents we've allocated
4162 * in this call.
4163 */
4164 bma->nallocs++;
4165
4166 if (bma->cur)
4167 bma->cur->bc_ino.flags =
4168 bma->wasdel ? XFS_BTCUR_BMBT_WASDEL : 0;
4169
4170 bma->got.br_startoff = bma->offset;
4171 bma->got.br_startblock = bma->blkno;
4172 bma->got.br_blockcount = bma->length;
4173 bma->got.br_state = XFS_EXT_NORM;
4174
4175 if (bma->flags & XFS_BMAPI_PREALLOC)
4176 bma->got.br_state = XFS_EXT_UNWRITTEN;
4177
4178 if (bma->wasdel)
4179 error = xfs_bmap_add_extent_delay_real(bma, whichfork);
4180 else
4181 error = xfs_bmap_add_extent_hole_real(bma->tp, bma->ip,
4182 whichfork, &bma->icur, &bma->cur, &bma->got,
4183 &bma->logflags, bma->flags);
4184
4185 bma->logflags |= tmp_logflags;
4186 if (error)
4187 return error;
4188
4189 /*
4190 * Update our extent pointer, given that xfs_bmap_add_extent_delay_real
4191 * or xfs_bmap_add_extent_hole_real might have merged it into one of
4192 * the neighbouring ones.
4193 */
4194 xfs_iext_get_extent(ifp, &bma->icur, &bma->got);
4195
4196 ASSERT(bma->got.br_startoff <= bma->offset);
4197 ASSERT(bma->got.br_startoff + bma->got.br_blockcount >=
4198 bma->offset + bma->length);
4199 ASSERT(bma->got.br_state == XFS_EXT_NORM ||
4200 bma->got.br_state == XFS_EXT_UNWRITTEN);
4201 return 0;
4202 }
4203
4204 STATIC int
4205 xfs_bmapi_convert_unwritten(
4206 struct xfs_bmalloca *bma,
4207 struct xfs_bmbt_irec *mval,
4208 xfs_filblks_t len,
4209 int flags)
4210 {
4211 int whichfork = xfs_bmapi_whichfork(flags);
4212 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4213 int tmp_logflags = 0;
4214 int error;
4215
4216 /* check if we need to do unwritten->real conversion */
4217 if (mval->br_state == XFS_EXT_UNWRITTEN &&
4218 (flags & XFS_BMAPI_PREALLOC))
4219 return 0;
4220
4221 /* check if we need to do real->unwritten conversion */
4222 if (mval->br_state == XFS_EXT_NORM &&
4223 (flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) !=
4224 (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT))
4225 return 0;
4226
4227 /*
4228 * Modify (by adding) the state flag, if writing.
4229 */
4230 ASSERT(mval->br_blockcount <= len);
4231 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) {
4232 bma->cur = xfs_bmbt_init_cursor(bma->ip->i_mount, bma->tp,
4233 bma->ip, whichfork);
4234 }
4235 mval->br_state = (mval->br_state == XFS_EXT_UNWRITTEN)
4236 ? XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
4237
4238 /*
4239 * Before insertion into the bmbt, zero the range being converted
4240 * if required.
4241 */
4242 if (flags & XFS_BMAPI_ZERO) {
4243 error = xfs_zero_extent(bma->ip, mval->br_startblock,
4244 mval->br_blockcount);
4245 if (error)
4246 return error;
4247 }
4248
4249 error = xfs_bmap_add_extent_unwritten_real(bma->tp, bma->ip, whichfork,
4250 &bma->icur, &bma->cur, mval, &tmp_logflags);
4251 /*
4252 * Log the inode core unconditionally in the unwritten extent conversion
4253 * path because the conversion might not have done so (e.g., if the
4254 * extent count hasn't changed). We need to make sure the inode is dirty
4255 * in the transaction for the sake of fsync(), even if nothing has
4256 * changed, because fsync() will not force the log for this transaction
4257 * unless it sees the inode pinned.
4258 *
4259 * Note: If we're only converting cow fork extents, there aren't
4260 * any on-disk updates to make, so we don't need to log anything.
4261 */
4262 if (whichfork != XFS_COW_FORK)
4263 bma->logflags |= tmp_logflags | XFS_ILOG_CORE;
4264 if (error)
4265 return error;
4266
4267 /*
4268 * Update our extent pointer, given that
4269 * xfs_bmap_add_extent_unwritten_real might have merged it into one
4270 * of the neighbouring ones.
4271 */
4272 xfs_iext_get_extent(ifp, &bma->icur, &bma->got);
4273
4274 /*
4275 * We may have combined previously unwritten space with written space,
4276 * so generate another request.
4277 */
4278 if (mval->br_blockcount < len)
4279 return -EAGAIN;
4280 return 0;
4281 }
4282
4283 static inline xfs_extlen_t
4284 xfs_bmapi_minleft(
4285 struct xfs_trans *tp,
4286 struct xfs_inode *ip,
4287 int fork)
4288 {
4289 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, fork);
4290
4291 if (tp && tp->t_firstblock != NULLFSBLOCK)
4292 return 0;
4293 if (ifp->if_format != XFS_DINODE_FMT_BTREE)
4294 return 1;
4295 return be16_to_cpu(ifp->if_broot->bb_level) + 1;
4296 }
4297
4298 /*
4299 * Log whatever the flags say, even if error. Otherwise we might miss detecting
4300 * a case where the data is changed, there's an error, and it's not logged so we
4301 * don't shutdown when we should. Don't bother logging extents/btree changes if
4302 * we converted to the other format.
4303 */
4304 static void
4305 xfs_bmapi_finish(
4306 struct xfs_bmalloca *bma,
4307 int whichfork,
4308 int error)
4309 {
4310 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4311
4312 if ((bma->logflags & xfs_ilog_fext(whichfork)) &&
4313 ifp->if_format != XFS_DINODE_FMT_EXTENTS)
4314 bma->logflags &= ~xfs_ilog_fext(whichfork);
4315 else if ((bma->logflags & xfs_ilog_fbroot(whichfork)) &&
4316 ifp->if_format != XFS_DINODE_FMT_BTREE)
4317 bma->logflags &= ~xfs_ilog_fbroot(whichfork);
4318
4319 if (bma->logflags)
4320 xfs_trans_log_inode(bma->tp, bma->ip, bma->logflags);
4321 if (bma->cur)
4322 xfs_btree_del_cursor(bma->cur, error);
4323 }
4324
4325 /*
4326 * Map file blocks to filesystem blocks, and allocate blocks or convert the
4327 * extent state if necessary. Details behaviour is controlled by the flags
4328 * parameter. Only allocates blocks from a single allocation group, to avoid
4329 * locking problems.
4330 */
4331 int
4332 xfs_bmapi_write(
4333 struct xfs_trans *tp, /* transaction pointer */
4334 struct xfs_inode *ip, /* incore inode */
4335 xfs_fileoff_t bno, /* starting file offs. mapped */
4336 xfs_filblks_t len, /* length to map in file */
4337 int flags, /* XFS_BMAPI_... */
4338 xfs_extlen_t total, /* total blocks needed */
4339 struct xfs_bmbt_irec *mval, /* output: map values */
4340 int *nmap) /* i/o: mval size/count */
4341 {
4342 struct xfs_bmalloca bma = {
4343 .tp = tp,
4344 .ip = ip,
4345 .total = total,
4346 };
4347 struct xfs_mount *mp = ip->i_mount;
4348 int whichfork = xfs_bmapi_whichfork(flags);
4349 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
4350 xfs_fileoff_t end; /* end of mapped file region */
4351 bool eof = false; /* after the end of extents */
4352 int error; /* error return */
4353 int n; /* current extent index */
4354 xfs_fileoff_t obno; /* old block number (offset) */
4355
4356 #ifdef DEBUG
4357 xfs_fileoff_t orig_bno; /* original block number value */
4358 int orig_flags; /* original flags arg value */
4359 xfs_filblks_t orig_len; /* original value of len arg */
4360 struct xfs_bmbt_irec *orig_mval; /* original value of mval */
4361 int orig_nmap; /* original value of *nmap */
4362
4363 orig_bno = bno;
4364 orig_len = len;
4365 orig_flags = flags;
4366 orig_mval = mval;
4367 orig_nmap = *nmap;
4368 #endif
4369
4370 ASSERT(*nmap >= 1);
4371 ASSERT(*nmap <= XFS_BMAP_MAX_NMAP);
4372 ASSERT(tp != NULL);
4373 ASSERT(len > 0);
4374 ASSERT(ifp->if_format != XFS_DINODE_FMT_LOCAL);
4375 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
4376 ASSERT(!(flags & XFS_BMAPI_REMAP));
4377
4378 /* zeroing is for currently only for data extents, not metadata */
4379 ASSERT((flags & (XFS_BMAPI_METADATA | XFS_BMAPI_ZERO)) !=
4380 (XFS_BMAPI_METADATA | XFS_BMAPI_ZERO));
4381 /*
4382 * we can allocate unwritten extents or pre-zero allocated blocks,
4383 * but it makes no sense to do both at once. This would result in
4384 * zeroing the unwritten extent twice, but it still being an
4385 * unwritten extent....
4386 */
4387 ASSERT((flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_ZERO)) !=
4388 (XFS_BMAPI_PREALLOC | XFS_BMAPI_ZERO));
4389
4390 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)) ||
4391 XFS_TEST_ERROR(false, mp, XFS_ERRTAG_BMAPIFORMAT)) {
4392 return -EFSCORRUPTED;
4393 }
4394
4395 if (XFS_FORCED_SHUTDOWN(mp))
4396 return -EIO;
4397
4398 XFS_STATS_INC(mp, xs_blk_mapw);
4399
4400 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4401 error = xfs_iread_extents(tp, ip, whichfork);
4402 if (error)
4403 goto error0;
4404 }
4405
4406 if (!xfs_iext_lookup_extent(ip, ifp, bno, &bma.icur, &bma.got))
4407 eof = true;
4408 if (!xfs_iext_peek_prev_extent(ifp, &bma.icur, &bma.prev))
4409 bma.prev.br_startoff = NULLFILEOFF;
4410 bma.minleft = xfs_bmapi_minleft(tp, ip, whichfork);
4411
4412 n = 0;
4413 end = bno + len;
4414 obno = bno;
4415 while (bno < end && n < *nmap) {
4416 bool need_alloc = false, wasdelay = false;
4417
4418 /* in hole or beyond EOF? */
4419 if (eof || bma.got.br_startoff > bno) {
4420 /*
4421 * CoW fork conversions should /never/ hit EOF or
4422 * holes. There should always be something for us
4423 * to work on.
4424 */
4425 ASSERT(!((flags & XFS_BMAPI_CONVERT) &&
4426 (flags & XFS_BMAPI_COWFORK)));
4427
4428 need_alloc = true;
4429 } else if (isnullstartblock(bma.got.br_startblock)) {
4430 wasdelay = true;
4431 }
4432
4433 /*
4434 * First, deal with the hole before the allocated space
4435 * that we found, if any.
4436 */
4437 if (need_alloc || wasdelay) {
4438 bma.eof = eof;
4439 bma.conv = !!(flags & XFS_BMAPI_CONVERT);
4440 bma.wasdel = wasdelay;
4441 bma.offset = bno;
4442 bma.flags = flags;
4443
4444 /*
4445 * There's a 32/64 bit type mismatch between the
4446 * allocation length request (which can be 64 bits in
4447 * length) and the bma length request, which is
4448 * xfs_extlen_t and therefore 32 bits. Hence we have to
4449 * check for 32-bit overflows and handle them here.
4450 */
4451 if (len > (xfs_filblks_t)MAXEXTLEN)
4452 bma.length = MAXEXTLEN;
4453 else
4454 bma.length = len;
4455
4456 ASSERT(len > 0);
4457 ASSERT(bma.length > 0);
4458 error = xfs_bmapi_allocate(&bma);
4459 if (error)
4460 goto error0;
4461 if (bma.blkno == NULLFSBLOCK)
4462 break;
4463
4464 /*
4465 * If this is a CoW allocation, record the data in
4466 * the refcount btree for orphan recovery.
4467 */
4468 if (whichfork == XFS_COW_FORK)
4469 xfs_refcount_alloc_cow_extent(tp, bma.blkno,
4470 bma.length);
4471 }
4472
4473 /* Deal with the allocated space we found. */
4474 xfs_bmapi_trim_map(mval, &bma.got, &bno, len, obno,
4475 end, n, flags);
4476
4477 /* Execute unwritten extent conversion if necessary */
4478 error = xfs_bmapi_convert_unwritten(&bma, mval, len, flags);
4479 if (error == -EAGAIN)
4480 continue;
4481 if (error)
4482 goto error0;
4483
4484 /* update the extent map to return */
4485 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
4486
4487 /*
4488 * If we're done, stop now. Stop when we've allocated
4489 * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise
4490 * the transaction may get too big.
4491 */
4492 if (bno >= end || n >= *nmap || bma.nallocs >= *nmap)
4493 break;
4494
4495 /* Else go on to the next record. */
4496 bma.prev = bma.got;
4497 if (!xfs_iext_next_extent(ifp, &bma.icur, &bma.got))
4498 eof = true;
4499 }
4500 *nmap = n;
4501
4502 error = xfs_bmap_btree_to_extents(tp, ip, bma.cur, &bma.logflags,
4503 whichfork);
4504 if (error)
4505 goto error0;
4506
4507 ASSERT(ifp->if_format != XFS_DINODE_FMT_BTREE ||
4508 ifp->if_nextents > XFS_IFORK_MAXEXT(ip, whichfork));
4509 xfs_bmapi_finish(&bma, whichfork, 0);
4510 xfs_bmap_validate_ret(orig_bno, orig_len, orig_flags, orig_mval,
4511 orig_nmap, *nmap);
4512 return 0;
4513 error0:
4514 xfs_bmapi_finish(&bma, whichfork, error);
4515 return error;
4516 }
4517
4518 /*
4519 * Convert an existing delalloc extent to real blocks based on file offset. This
4520 * attempts to allocate the entire delalloc extent and may require multiple
4521 * invocations to allocate the target offset if a large enough physical extent
4522 * is not available.
4523 */
4524 int
4525 xfs_bmapi_convert_delalloc(
4526 struct xfs_inode *ip,
4527 int whichfork,
4528 xfs_off_t offset,
4529 struct iomap *iomap,
4530 unsigned int *seq)
4531 {
4532 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
4533 struct xfs_mount *mp = ip->i_mount;
4534 xfs_fileoff_t offset_fsb = XFS_B_TO_FSBT(mp, offset);
4535 struct xfs_bmalloca bma = { NULL };
4536 uint16_t flags = 0;
4537 struct xfs_trans *tp;
4538 int error;
4539
4540 if (whichfork == XFS_COW_FORK)
4541 flags |= IOMAP_F_SHARED;
4542
4543 /*
4544 * Space for the extent and indirect blocks was reserved when the
4545 * delalloc extent was created so there's no need to do so here.
4546 */
4547 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_write, 0, 0,
4548 XFS_TRANS_RESERVE, &tp);
4549 if (error)
4550 return error;
4551
4552 xfs_ilock(ip, XFS_ILOCK_EXCL);
4553
4554 error = xfs_iext_count_may_overflow(ip, whichfork,
4555 XFS_IEXT_ADD_NOSPLIT_CNT);
4556 if (error)
4557 goto out_trans_cancel;
4558
4559 xfs_trans_ijoin(tp, ip, 0);
4560
4561 if (!xfs_iext_lookup_extent(ip, ifp, offset_fsb, &bma.icur, &bma.got) ||
4562 bma.got.br_startoff > offset_fsb) {
4563 /*
4564 * No extent found in the range we are trying to convert. This
4565 * should only happen for the COW fork, where another thread
4566 * might have moved the extent to the data fork in the meantime.
4567 */
4568 WARN_ON_ONCE(whichfork != XFS_COW_FORK);
4569 error = -EAGAIN;
4570 goto out_trans_cancel;
4571 }
4572
4573 /*
4574 * If we find a real extent here we raced with another thread converting
4575 * the extent. Just return the real extent at this offset.
4576 */
4577 if (!isnullstartblock(bma.got.br_startblock)) {
4578 xfs_bmbt_to_iomap(ip, iomap, &bma.got, flags);
4579 *seq = READ_ONCE(ifp->if_seq);
4580 goto out_trans_cancel;
4581 }
4582
4583 bma.tp = tp;
4584 bma.ip = ip;
4585 bma.wasdel = true;
4586 bma.offset = bma.got.br_startoff;
4587 bma.length = max_t(xfs_filblks_t, bma.got.br_blockcount, MAXEXTLEN);
4588 bma.minleft = xfs_bmapi_minleft(tp, ip, whichfork);
4589
4590 /*
4591 * When we're converting the delalloc reservations backing dirty pages
4592 * in the page cache, we must be careful about how we create the new
4593 * extents:
4594 *
4595 * New CoW fork extents are created unwritten, turned into real extents
4596 * when we're about to write the data to disk, and mapped into the data
4597 * fork after the write finishes. End of story.
4598 *
4599 * New data fork extents must be mapped in as unwritten and converted
4600 * to real extents after the write succeeds to avoid exposing stale
4601 * disk contents if we crash.
4602 */
4603 bma.flags = XFS_BMAPI_PREALLOC;
4604 if (whichfork == XFS_COW_FORK)
4605 bma.flags |= XFS_BMAPI_COWFORK;
4606
4607 if (!xfs_iext_peek_prev_extent(ifp, &bma.icur, &bma.prev))
4608 bma.prev.br_startoff = NULLFILEOFF;
4609
4610 error = xfs_bmapi_allocate(&bma);
4611 if (error)
4612 goto out_finish;
4613
4614 error = -ENOSPC;
4615 if (WARN_ON_ONCE(bma.blkno == NULLFSBLOCK))
4616 goto out_finish;
4617 error = -EFSCORRUPTED;
4618 if (WARN_ON_ONCE(!xfs_valid_startblock(ip, bma.got.br_startblock)))
4619 goto out_finish;
4620
4621 XFS_STATS_ADD(mp, xs_xstrat_bytes, XFS_FSB_TO_B(mp, bma.length));
4622 XFS_STATS_INC(mp, xs_xstrat_quick);
4623
4624 ASSERT(!isnullstartblock(bma.got.br_startblock));
4625 xfs_bmbt_to_iomap(ip, iomap, &bma.got, flags);
4626 *seq = READ_ONCE(ifp->if_seq);
4627
4628 if (whichfork == XFS_COW_FORK)
4629 xfs_refcount_alloc_cow_extent(tp, bma.blkno, bma.length);
4630
4631 error = xfs_bmap_btree_to_extents(tp, ip, bma.cur, &bma.logflags,
4632 whichfork);
4633 if (error)
4634 goto out_finish;
4635
4636 xfs_bmapi_finish(&bma, whichfork, 0);
4637 error = xfs_trans_commit(tp);
4638 xfs_iunlock(ip, XFS_ILOCK_EXCL);
4639 return error;
4640
4641 out_finish:
4642 xfs_bmapi_finish(&bma, whichfork, error);
4643 out_trans_cancel:
4644 xfs_trans_cancel(tp);
4645 xfs_iunlock(ip, XFS_ILOCK_EXCL);
4646 return error;
4647 }
4648
4649 int
4650 xfs_bmapi_remap(
4651 struct xfs_trans *tp,
4652 struct xfs_inode *ip,
4653 xfs_fileoff_t bno,
4654 xfs_filblks_t len,
4655 xfs_fsblock_t startblock,
4656 int flags)
4657 {
4658 struct xfs_mount *mp = ip->i_mount;
4659 struct xfs_ifork *ifp;
4660 struct xfs_btree_cur *cur = NULL;
4661 struct xfs_bmbt_irec got;
4662 struct xfs_iext_cursor icur;
4663 int whichfork = xfs_bmapi_whichfork(flags);
4664 int logflags = 0, error;
4665
4666 ifp = XFS_IFORK_PTR(ip, whichfork);
4667 ASSERT(len > 0);
4668 ASSERT(len <= (xfs_filblks_t)MAXEXTLEN);
4669 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
4670 ASSERT(!(flags & ~(XFS_BMAPI_ATTRFORK | XFS_BMAPI_PREALLOC |
4671 XFS_BMAPI_NORMAP)));
4672 ASSERT((flags & (XFS_BMAPI_ATTRFORK | XFS_BMAPI_PREALLOC)) !=
4673 (XFS_BMAPI_ATTRFORK | XFS_BMAPI_PREALLOC));
4674
4675 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)) ||
4676 XFS_TEST_ERROR(false, mp, XFS_ERRTAG_BMAPIFORMAT)) {
4677 return -EFSCORRUPTED;
4678 }
4679
4680 if (XFS_FORCED_SHUTDOWN(mp))
4681 return -EIO;
4682
4683 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4684 error = xfs_iread_extents(tp, ip, whichfork);
4685 if (error)
4686 return error;
4687 }
4688
4689 if (xfs_iext_lookup_extent(ip, ifp, bno, &icur, &got)) {
4690 /* make sure we only reflink into a hole. */
4691 ASSERT(got.br_startoff > bno);
4692 ASSERT(got.br_startoff - bno >= len);
4693 }
4694
4695 ip->i_d.di_nblocks += len;
4696 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
4697
4698 if (ifp->if_flags & XFS_IFBROOT) {
4699 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
4700 cur->bc_ino.flags = 0;
4701 }
4702
4703 got.br_startoff = bno;
4704 got.br_startblock = startblock;
4705 got.br_blockcount = len;
4706 if (flags & XFS_BMAPI_PREALLOC)
4707 got.br_state = XFS_EXT_UNWRITTEN;
4708 else
4709 got.br_state = XFS_EXT_NORM;
4710
4711 error = xfs_bmap_add_extent_hole_real(tp, ip, whichfork, &icur,
4712 &cur, &got, &logflags, flags);
4713 if (error)
4714 goto error0;
4715
4716 error = xfs_bmap_btree_to_extents(tp, ip, cur, &logflags, whichfork);
4717
4718 error0:
4719 if (ip->i_df.if_format != XFS_DINODE_FMT_EXTENTS)
4720 logflags &= ~XFS_ILOG_DEXT;
4721 else if (ip->i_df.if_format != XFS_DINODE_FMT_BTREE)
4722 logflags &= ~XFS_ILOG_DBROOT;
4723
4724 if (logflags)
4725 xfs_trans_log_inode(tp, ip, logflags);
4726 if (cur)
4727 xfs_btree_del_cursor(cur, error);
4728 return error;
4729 }
4730
4731 /*
4732 * When a delalloc extent is split (e.g., due to a hole punch), the original
4733 * indlen reservation must be shared across the two new extents that are left
4734 * behind.
4735 *
4736 * Given the original reservation and the worst case indlen for the two new
4737 * extents (as calculated by xfs_bmap_worst_indlen()), split the original
4738 * reservation fairly across the two new extents. If necessary, steal available
4739 * blocks from a deleted extent to make up a reservation deficiency (e.g., if
4740 * ores == 1). The number of stolen blocks is returned. The availability and
4741 * subsequent accounting of stolen blocks is the responsibility of the caller.
4742 */
4743 static xfs_filblks_t
4744 xfs_bmap_split_indlen(
4745 xfs_filblks_t ores, /* original res. */
4746 xfs_filblks_t *indlen1, /* ext1 worst indlen */
4747 xfs_filblks_t *indlen2, /* ext2 worst indlen */
4748 xfs_filblks_t avail) /* stealable blocks */
4749 {
4750 xfs_filblks_t len1 = *indlen1;
4751 xfs_filblks_t len2 = *indlen2;
4752 xfs_filblks_t nres = len1 + len2; /* new total res. */
4753 xfs_filblks_t stolen = 0;
4754 xfs_filblks_t resfactor;
4755
4756 /*
4757 * Steal as many blocks as we can to try and satisfy the worst case
4758 * indlen for both new extents.
4759 */
4760 if (ores < nres && avail)
4761 stolen = XFS_FILBLKS_MIN(nres - ores, avail);
4762 ores += stolen;
4763
4764 /* nothing else to do if we've satisfied the new reservation */
4765 if (ores >= nres)
4766 return stolen;
4767
4768 /*
4769 * We can't meet the total required reservation for the two extents.
4770 * Calculate the percent of the overall shortage between both extents
4771 * and apply this percentage to each of the requested indlen values.
4772 * This distributes the shortage fairly and reduces the chances that one
4773 * of the two extents is left with nothing when extents are repeatedly
4774 * split.
4775 */
4776 resfactor = (ores * 100);
4777 do_div(resfactor, nres);
4778 len1 *= resfactor;
4779 do_div(len1, 100);
4780 len2 *= resfactor;
4781 do_div(len2, 100);
4782 ASSERT(len1 + len2 <= ores);
4783 ASSERT(len1 < *indlen1 && len2 < *indlen2);
4784
4785 /*
4786 * Hand out the remainder to each extent. If one of the two reservations
4787 * is zero, we want to make sure that one gets a block first. The loop
4788 * below starts with len1, so hand len2 a block right off the bat if it
4789 * is zero.
4790 */
4791 ores -= (len1 + len2);
4792 ASSERT((*indlen1 - len1) + (*indlen2 - len2) >= ores);
4793 if (ores && !len2 && *indlen2) {
4794 len2++;
4795 ores--;
4796 }
4797 while (ores) {
4798 if (len1 < *indlen1) {
4799 len1++;
4800 ores--;
4801 }
4802 if (!ores)
4803 break;
4804 if (len2 < *indlen2) {
4805 len2++;
4806 ores--;
4807 }
4808 }
4809
4810 *indlen1 = len1;
4811 *indlen2 = len2;
4812
4813 return stolen;
4814 }
4815
4816 int
4817 xfs_bmap_del_extent_delay(
4818 struct xfs_inode *ip,
4819 int whichfork,
4820 struct xfs_iext_cursor *icur,
4821 struct xfs_bmbt_irec *got,
4822 struct xfs_bmbt_irec *del)
4823 {
4824 struct xfs_mount *mp = ip->i_mount;
4825 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
4826 struct xfs_bmbt_irec new;
4827 int64_t da_old, da_new, da_diff = 0;
4828 xfs_fileoff_t del_endoff, got_endoff;
4829 xfs_filblks_t got_indlen, new_indlen, stolen;
4830 int state = xfs_bmap_fork_to_state(whichfork);
4831 int error = 0;
4832 bool isrt;
4833
4834 XFS_STATS_INC(mp, xs_del_exlist);
4835
4836 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
4837 del_endoff = del->br_startoff + del->br_blockcount;
4838 got_endoff = got->br_startoff + got->br_blockcount;
4839 da_old = startblockval(got->br_startblock);
4840 da_new = 0;
4841
4842 ASSERT(del->br_blockcount > 0);
4843 ASSERT(got->br_startoff <= del->br_startoff);
4844 ASSERT(got_endoff >= del_endoff);
4845
4846 if (isrt) {
4847 uint64_t rtexts = XFS_FSB_TO_B(mp, del->br_blockcount);
4848
4849 do_div(rtexts, mp->m_sb.sb_rextsize);
4850 xfs_mod_frextents(mp, rtexts);
4851 }
4852
4853 /*
4854 * Update the inode delalloc counter now and wait to update the
4855 * sb counters as we might have to borrow some blocks for the
4856 * indirect block accounting.
4857 */
4858 error = xfs_trans_reserve_quota_nblks(NULL, ip,
4859 -((long)del->br_blockcount), 0,
4860 isrt ? XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS);
4861 if (error)
4862 return error;
4863 ip->i_delayed_blks -= del->br_blockcount;
4864
4865 if (got->br_startoff == del->br_startoff)
4866 state |= BMAP_LEFT_FILLING;
4867 if (got_endoff == del_endoff)
4868 state |= BMAP_RIGHT_FILLING;
4869
4870 switch (state & (BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING)) {
4871 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
4872 /*
4873 * Matches the whole extent. Delete the entry.
4874 */
4875 xfs_iext_remove(ip, icur, state);
4876 xfs_iext_prev(ifp, icur);
4877 break;
4878 case BMAP_LEFT_FILLING:
4879 /*
4880 * Deleting the first part of the extent.
4881 */
4882 got->br_startoff = del_endoff;
4883 got->br_blockcount -= del->br_blockcount;
4884 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip,
4885 got->br_blockcount), da_old);
4886 got->br_startblock = nullstartblock((int)da_new);
4887 xfs_iext_update_extent(ip, state, icur, got);
4888 break;
4889 case BMAP_RIGHT_FILLING:
4890 /*
4891 * Deleting the last part of the extent.
4892 */
4893 got->br_blockcount = got->br_blockcount - del->br_blockcount;
4894 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip,
4895 got->br_blockcount), da_old);
4896 got->br_startblock = nullstartblock((int)da_new);
4897 xfs_iext_update_extent(ip, state, icur, got);
4898 break;
4899 case 0:
4900 /*
4901 * Deleting the middle of the extent.
4902 *
4903 * Distribute the original indlen reservation across the two new
4904 * extents. Steal blocks from the deleted extent if necessary.
4905 * Stealing blocks simply fudges the fdblocks accounting below.
4906 * Warn if either of the new indlen reservations is zero as this
4907 * can lead to delalloc problems.
4908 */
4909 got->br_blockcount = del->br_startoff - got->br_startoff;
4910 got_indlen = xfs_bmap_worst_indlen(ip, got->br_blockcount);
4911
4912 new.br_blockcount = got_endoff - del_endoff;
4913 new_indlen = xfs_bmap_worst_indlen(ip, new.br_blockcount);
4914
4915 WARN_ON_ONCE(!got_indlen || !new_indlen);
4916 stolen = xfs_bmap_split_indlen(da_old, &got_indlen, &new_indlen,
4917 del->br_blockcount);
4918
4919 got->br_startblock = nullstartblock((int)got_indlen);
4920
4921 new.br_startoff = del_endoff;
4922 new.br_state = got->br_state;
4923 new.br_startblock = nullstartblock((int)new_indlen);
4924
4925 xfs_iext_update_extent(ip, state, icur, got);
4926 xfs_iext_next(ifp, icur);
4927 xfs_iext_insert(ip, icur, &new, state);
4928
4929 da_new = got_indlen + new_indlen - stolen;
4930 del->br_blockcount -= stolen;
4931 break;
4932 }
4933
4934 ASSERT(da_old >= da_new);
4935 da_diff = da_old - da_new;
4936 if (!isrt)
4937 da_diff += del->br_blockcount;
4938 if (da_diff) {
4939 xfs_mod_fdblocks(mp, da_diff, false);
4940 xfs_mod_delalloc(mp, -da_diff);
4941 }
4942 return error;
4943 }
4944
4945 void
4946 xfs_bmap_del_extent_cow(
4947 struct xfs_inode *ip,
4948 struct xfs_iext_cursor *icur,
4949 struct xfs_bmbt_irec *got,
4950 struct xfs_bmbt_irec *del)
4951 {
4952 struct xfs_mount *mp = ip->i_mount;
4953 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, XFS_COW_FORK);
4954 struct xfs_bmbt_irec new;
4955 xfs_fileoff_t del_endoff, got_endoff;
4956 int state = BMAP_COWFORK;
4957
4958 XFS_STATS_INC(mp, xs_del_exlist);
4959
4960 del_endoff = del->br_startoff + del->br_blockcount;
4961 got_endoff = got->br_startoff + got->br_blockcount;
4962
4963 ASSERT(del->br_blockcount > 0);
4964 ASSERT(got->br_startoff <= del->br_startoff);
4965 ASSERT(got_endoff >= del_endoff);
4966 ASSERT(!isnullstartblock(got->br_startblock));
4967
4968 if (got->br_startoff == del->br_startoff)
4969 state |= BMAP_LEFT_FILLING;
4970 if (got_endoff == del_endoff)
4971 state |= BMAP_RIGHT_FILLING;
4972
4973 switch (state & (BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING)) {
4974 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
4975 /*
4976 * Matches the whole extent. Delete the entry.
4977 */
4978 xfs_iext_remove(ip, icur, state);
4979 xfs_iext_prev(ifp, icur);
4980 break;
4981 case BMAP_LEFT_FILLING:
4982 /*
4983 * Deleting the first part of the extent.
4984 */
4985 got->br_startoff = del_endoff;
4986 got->br_blockcount -= del->br_blockcount;
4987 got->br_startblock = del->br_startblock + del->br_blockcount;
4988 xfs_iext_update_extent(ip, state, icur, got);
4989 break;
4990 case BMAP_RIGHT_FILLING:
4991 /*
4992 * Deleting the last part of the extent.
4993 */
4994 got->br_blockcount -= del->br_blockcount;
4995 xfs_iext_update_extent(ip, state, icur, got);
4996 break;
4997 case 0:
4998 /*
4999 * Deleting the middle of the extent.
5000 */
5001 got->br_blockcount = del->br_startoff - got->br_startoff;
5002
5003 new.br_startoff = del_endoff;
5004 new.br_blockcount = got_endoff - del_endoff;
5005 new.br_state = got->br_state;
5006 new.br_startblock = del->br_startblock + del->br_blockcount;
5007
5008 xfs_iext_update_extent(ip, state, icur, got);
5009 xfs_iext_next(ifp, icur);
5010 xfs_iext_insert(ip, icur, &new, state);
5011 break;
5012 }
5013 ip->i_delayed_blks -= del->br_blockcount;
5014 }
5015
5016 /*
5017 * Called by xfs_bmapi to update file extent records and the btree
5018 * after removing space.
5019 */
5020 STATIC int /* error */
5021 xfs_bmap_del_extent_real(
5022 xfs_inode_t *ip, /* incore inode pointer */
5023 xfs_trans_t *tp, /* current transaction pointer */
5024 struct xfs_iext_cursor *icur,
5025 xfs_btree_cur_t *cur, /* if null, not a btree */
5026 xfs_bmbt_irec_t *del, /* data to remove from extents */
5027 int *logflagsp, /* inode logging flags */
5028 int whichfork, /* data or attr fork */
5029 int bflags) /* bmapi flags */
5030 {
5031 xfs_fsblock_t del_endblock=0; /* first block past del */
5032 xfs_fileoff_t del_endoff; /* first offset past del */
5033 int do_fx; /* free extent at end of routine */
5034 int error; /* error return value */
5035 int flags = 0;/* inode logging flags */
5036 struct xfs_bmbt_irec got; /* current extent entry */
5037 xfs_fileoff_t got_endoff; /* first offset past got */
5038 int i; /* temp state */
5039 struct xfs_ifork *ifp; /* inode fork pointer */
5040 xfs_mount_t *mp; /* mount structure */
5041 xfs_filblks_t nblks; /* quota/sb block count */
5042 xfs_bmbt_irec_t new; /* new record to be inserted */
5043 /* REFERENCED */
5044 uint qfield; /* quota field to update */
5045 int state = xfs_bmap_fork_to_state(whichfork);
5046 struct xfs_bmbt_irec old;
5047
5048 mp = ip->i_mount;
5049 XFS_STATS_INC(mp, xs_del_exlist);
5050
5051 ifp = XFS_IFORK_PTR(ip, whichfork);
5052 ASSERT(del->br_blockcount > 0);
5053 xfs_iext_get_extent(ifp, icur, &got);
5054 ASSERT(got.br_startoff <= del->br_startoff);
5055 del_endoff = del->br_startoff + del->br_blockcount;
5056 got_endoff = got.br_startoff + got.br_blockcount;
5057 ASSERT(got_endoff >= del_endoff);
5058 ASSERT(!isnullstartblock(got.br_startblock));
5059 qfield = 0;
5060 error = 0;
5061
5062 /*
5063 * If it's the case where the directory code is running with no block
5064 * reservation, and the deleted block is in the middle of its extent,
5065 * and the resulting insert of an extent would cause transformation to
5066 * btree format, then reject it. The calling code will then swap blocks
5067 * around instead. We have to do this now, rather than waiting for the
5068 * conversion to btree format, since the transaction will be dirty then.
5069 */
5070 if (tp->t_blk_res == 0 &&
5071 ifp->if_format == XFS_DINODE_FMT_EXTENTS &&
5072 ifp->if_nextents >= XFS_IFORK_MAXEXT(ip, whichfork) &&
5073 del->br_startoff > got.br_startoff && del_endoff < got_endoff)
5074 return -ENOSPC;
5075
5076 flags = XFS_ILOG_CORE;
5077 if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) {
5078 xfs_filblks_t len;
5079 xfs_extlen_t mod;
5080
5081 len = div_u64_rem(del->br_blockcount, mp->m_sb.sb_rextsize,
5082 &mod);
5083 ASSERT(mod == 0);
5084
5085 if (!(bflags & XFS_BMAPI_REMAP)) {
5086 xfs_fsblock_t bno;
5087
5088 bno = div_u64_rem(del->br_startblock,
5089 mp->m_sb.sb_rextsize, &mod);
5090 ASSERT(mod == 0);
5091
5092 error = xfs_rtfree_extent(tp, bno, (xfs_extlen_t)len);
5093 if (error)
5094 goto done;
5095 }
5096
5097 do_fx = 0;
5098 nblks = len * mp->m_sb.sb_rextsize;
5099 qfield = XFS_TRANS_DQ_RTBCOUNT;
5100 } else {
5101 do_fx = 1;
5102 nblks = del->br_blockcount;
5103 qfield = XFS_TRANS_DQ_BCOUNT;
5104 }
5105
5106 del_endblock = del->br_startblock + del->br_blockcount;
5107 if (cur) {
5108 error = xfs_bmbt_lookup_eq(cur, &got, &i);
5109 if (error)
5110 goto done;
5111 if (XFS_IS_CORRUPT(mp, i != 1)) {
5112 error = -EFSCORRUPTED;
5113 goto done;
5114 }
5115 }
5116
5117 if (got.br_startoff == del->br_startoff)
5118 state |= BMAP_LEFT_FILLING;
5119 if (got_endoff == del_endoff)
5120 state |= BMAP_RIGHT_FILLING;
5121
5122 switch (state & (BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING)) {
5123 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
5124 /*
5125 * Matches the whole extent. Delete the entry.
5126 */
5127 xfs_iext_remove(ip, icur, state);
5128 xfs_iext_prev(ifp, icur);
5129 ifp->if_nextents--;
5130
5131 flags |= XFS_ILOG_CORE;
5132 if (!cur) {
5133 flags |= xfs_ilog_fext(whichfork);
5134 break;
5135 }
5136 if ((error = xfs_btree_delete(cur, &i)))
5137 goto done;
5138 if (XFS_IS_CORRUPT(mp, i != 1)) {
5139 error = -EFSCORRUPTED;
5140 goto done;
5141 }
5142 break;
5143 case BMAP_LEFT_FILLING:
5144 /*
5145 * Deleting the first part of the extent.
5146 */
5147 got.br_startoff = del_endoff;
5148 got.br_startblock = del_endblock;
5149 got.br_blockcount -= del->br_blockcount;
5150 xfs_iext_update_extent(ip, state, icur, &got);
5151 if (!cur) {
5152 flags |= xfs_ilog_fext(whichfork);
5153 break;
5154 }
5155 error = xfs_bmbt_update(cur, &got);
5156 if (error)
5157 goto done;
5158 break;
5159 case BMAP_RIGHT_FILLING:
5160 /*
5161 * Deleting the last part of the extent.
5162 */
5163 got.br_blockcount -= del->br_blockcount;
5164 xfs_iext_update_extent(ip, state, icur, &got);
5165 if (!cur) {
5166 flags |= xfs_ilog_fext(whichfork);
5167 break;
5168 }
5169 error = xfs_bmbt_update(cur, &got);
5170 if (error)
5171 goto done;
5172 break;
5173 case 0:
5174 /*
5175 * Deleting the middle of the extent.
5176 */
5177
5178 /*
5179 * For directories, -ENOSPC is returned since a directory entry
5180 * remove operation must not fail due to low extent count
5181 * availability. -ENOSPC will be handled by higher layers of XFS
5182 * by letting the corresponding empty Data/Free blocks to linger
5183 * until a future remove operation. Dabtree blocks would be
5184 * swapped with the last block in the leaf space and then the
5185 * new last block will be unmapped.
5186 *
5187 * The above logic also applies to the source directory entry of
5188 * a rename operation.
5189 */
5190 error = xfs_iext_count_may_overflow(ip, whichfork, 1);
5191 if (error) {
5192 ASSERT(S_ISDIR(VFS_I(ip)->i_mode) &&
5193 whichfork == XFS_DATA_FORK);
5194 error = -ENOSPC;
5195 goto done;
5196 }
5197
5198 old = got;
5199
5200 got.br_blockcount = del->br_startoff - got.br_startoff;
5201 xfs_iext_update_extent(ip, state, icur, &got);
5202
5203 new.br_startoff = del_endoff;
5204 new.br_blockcount = got_endoff - del_endoff;
5205 new.br_state = got.br_state;
5206 new.br_startblock = del_endblock;
5207
5208 flags |= XFS_ILOG_CORE;
5209 if (cur) {
5210 error = xfs_bmbt_update(cur, &got);
5211 if (error)
5212 goto done;
5213 error = xfs_btree_increment(cur, 0, &i);
5214 if (error)
5215 goto done;
5216 cur->bc_rec.b = new;
5217 error = xfs_btree_insert(cur, &i);
5218 if (error && error != -ENOSPC)
5219 goto done;
5220 /*
5221 * If get no-space back from btree insert, it tried a
5222 * split, and we have a zero block reservation. Fix up
5223 * our state and return the error.
5224 */
5225 if (error == -ENOSPC) {
5226 /*
5227 * Reset the cursor, don't trust it after any
5228 * insert operation.
5229 */
5230 error = xfs_bmbt_lookup_eq(cur, &got, &i);
5231 if (error)
5232 goto done;
5233 if (XFS_IS_CORRUPT(mp, i != 1)) {
5234 error = -EFSCORRUPTED;
5235 goto done;
5236 }
5237 /*
5238 * Update the btree record back
5239 * to the original value.
5240 */
5241 error = xfs_bmbt_update(cur, &old);
5242 if (error)
5243 goto done;
5244 /*
5245 * Reset the extent record back
5246 * to the original value.
5247 */
5248 xfs_iext_update_extent(ip, state, icur, &old);
5249 flags = 0;
5250 error = -ENOSPC;
5251 goto done;
5252 }
5253 if (XFS_IS_CORRUPT(mp, i != 1)) {
5254 error = -EFSCORRUPTED;
5255 goto done;
5256 }
5257 } else
5258 flags |= xfs_ilog_fext(whichfork);
5259
5260 ifp->if_nextents++;
5261 xfs_iext_next(ifp, icur);
5262 xfs_iext_insert(ip, icur, &new, state);
5263 break;
5264 }
5265
5266 /* remove reverse mapping */
5267 xfs_rmap_unmap_extent(tp, ip, whichfork, del);
5268
5269 /*
5270 * If we need to, add to list of extents to delete.
5271 */
5272 if (do_fx && !(bflags & XFS_BMAPI_REMAP)) {
5273 if (xfs_is_reflink_inode(ip) && whichfork == XFS_DATA_FORK) {
5274 xfs_refcount_decrease_extent(tp, del);
5275 } else {
5276 __xfs_bmap_add_free(tp, del->br_startblock,
5277 del->br_blockcount, NULL,
5278 (bflags & XFS_BMAPI_NODISCARD) ||
5279 del->br_state == XFS_EXT_UNWRITTEN);
5280 }
5281 }
5282
5283 /*
5284 * Adjust inode # blocks in the file.
5285 */
5286 if (nblks)
5287 ip->i_d.di_nblocks -= nblks;
5288 /*
5289 * Adjust quota data.
5290 */
5291 if (qfield && !(bflags & XFS_BMAPI_REMAP))
5292 xfs_trans_mod_dquot_byino(tp, ip, qfield, (long)-nblks);
5293
5294 done:
5295 *logflagsp = flags;
5296 return error;
5297 }
5298
5299 /*
5300 * Unmap (remove) blocks from a file.
5301 * If nexts is nonzero then the number of extents to remove is limited to
5302 * that value. If not all extents in the block range can be removed then
5303 * *done is set.
5304 */
5305 int /* error */
5306 __xfs_bunmapi(
5307 struct xfs_trans *tp, /* transaction pointer */
5308 struct xfs_inode *ip, /* incore inode */
5309 xfs_fileoff_t start, /* first file offset deleted */
5310 xfs_filblks_t *rlen, /* i/o: amount remaining */
5311 int flags, /* misc flags */
5312 xfs_extnum_t nexts) /* number of extents max */
5313 {
5314 struct xfs_btree_cur *cur; /* bmap btree cursor */
5315 struct xfs_bmbt_irec del; /* extent being deleted */
5316 int error; /* error return value */
5317 xfs_extnum_t extno; /* extent number in list */
5318 struct xfs_bmbt_irec got; /* current extent record */
5319 struct xfs_ifork *ifp; /* inode fork pointer */
5320 int isrt; /* freeing in rt area */
5321 int logflags; /* transaction logging flags */
5322 xfs_extlen_t mod; /* rt extent offset */
5323 struct xfs_mount *mp = ip->i_mount;
5324 int tmp_logflags; /* partial logging flags */
5325 int wasdel; /* was a delayed alloc extent */
5326 int whichfork; /* data or attribute fork */
5327 xfs_fsblock_t sum;
5328 xfs_filblks_t len = *rlen; /* length to unmap in file */
5329 xfs_fileoff_t max_len;
5330 xfs_agnumber_t prev_agno = NULLAGNUMBER, agno;
5331 xfs_fileoff_t end;
5332 struct xfs_iext_cursor icur;
5333 bool done = false;
5334
5335 trace_xfs_bunmap(ip, start, len, flags, _RET_IP_);
5336
5337 whichfork = xfs_bmapi_whichfork(flags);
5338 ASSERT(whichfork != XFS_COW_FORK);
5339 ifp = XFS_IFORK_PTR(ip, whichfork);
5340 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)))
5341 return -EFSCORRUPTED;
5342 if (XFS_FORCED_SHUTDOWN(mp))
5343 return -EIO;
5344
5345 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5346 ASSERT(len > 0);
5347 ASSERT(nexts >= 0);
5348
5349 /*
5350 * Guesstimate how many blocks we can unmap without running the risk of
5351 * blowing out the transaction with a mix of EFIs and reflink
5352 * adjustments.
5353 */
5354 if (tp && xfs_is_reflink_inode(ip) && whichfork == XFS_DATA_FORK)
5355 max_len = min(len, xfs_refcount_max_unmap(tp->t_log_res));
5356 else
5357 max_len = len;
5358
5359 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
5360 (error = xfs_iread_extents(tp, ip, whichfork)))
5361 return error;
5362 if (xfs_iext_count(ifp) == 0) {
5363 *rlen = 0;
5364 return 0;
5365 }
5366 XFS_STATS_INC(mp, xs_blk_unmap);
5367 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
5368 end = start + len;
5369
5370 if (!xfs_iext_lookup_extent_before(ip, ifp, &end, &icur, &got)) {
5371 *rlen = 0;
5372 return 0;
5373 }
5374 end--;
5375
5376 logflags = 0;
5377 if (ifp->if_flags & XFS_IFBROOT) {
5378 ASSERT(ifp->if_format == XFS_DINODE_FMT_BTREE);
5379 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5380 cur->bc_ino.flags = 0;
5381 } else
5382 cur = NULL;
5383
5384 if (isrt) {
5385 /*
5386 * Synchronize by locking the bitmap inode.
5387 */
5388 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL|XFS_ILOCK_RTBITMAP);
5389 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
5390 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL|XFS_ILOCK_RTSUM);
5391 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
5392 }
5393
5394 extno = 0;
5395 while (end != (xfs_fileoff_t)-1 && end >= start &&
5396 (nexts == 0 || extno < nexts) && max_len > 0) {
5397 /*
5398 * Is the found extent after a hole in which end lives?
5399 * Just back up to the previous extent, if so.
5400 */
5401 if (got.br_startoff > end &&
5402 !xfs_iext_prev_extent(ifp, &icur, &got)) {
5403 done = true;
5404 break;
5405 }
5406 /*
5407 * Is the last block of this extent before the range
5408 * we're supposed to delete? If so, we're done.
5409 */
5410 end = XFS_FILEOFF_MIN(end,
5411 got.br_startoff + got.br_blockcount - 1);
5412 if (end < start)
5413 break;
5414 /*
5415 * Then deal with the (possibly delayed) allocated space
5416 * we found.
5417 */
5418 del = got;
5419 wasdel = isnullstartblock(del.br_startblock);
5420
5421 /*
5422 * Make sure we don't touch multiple AGF headers out of order
5423 * in a single transaction, as that could cause AB-BA deadlocks.
5424 */
5425 if (!wasdel && !isrt) {
5426 agno = XFS_FSB_TO_AGNO(mp, del.br_startblock);
5427 if (prev_agno != NULLAGNUMBER && prev_agno > agno)
5428 break;
5429 prev_agno = agno;
5430 }
5431 if (got.br_startoff < start) {
5432 del.br_startoff = start;
5433 del.br_blockcount -= start - got.br_startoff;
5434 if (!wasdel)
5435 del.br_startblock += start - got.br_startoff;
5436 }
5437 if (del.br_startoff + del.br_blockcount > end + 1)
5438 del.br_blockcount = end + 1 - del.br_startoff;
5439
5440 /* How much can we safely unmap? */
5441 if (max_len < del.br_blockcount) {
5442 del.br_startoff += del.br_blockcount - max_len;
5443 if (!wasdel)
5444 del.br_startblock += del.br_blockcount - max_len;
5445 del.br_blockcount = max_len;
5446 }
5447
5448 if (!isrt)
5449 goto delete;
5450
5451 sum = del.br_startblock + del.br_blockcount;
5452 div_u64_rem(sum, mp->m_sb.sb_rextsize, &mod);
5453 if (mod) {
5454 /*
5455 * Realtime extent not lined up at the end.
5456 * The extent could have been split into written
5457 * and unwritten pieces, or we could just be
5458 * unmapping part of it. But we can't really
5459 * get rid of part of a realtime extent.
5460 */
5461 if (del.br_state == XFS_EXT_UNWRITTEN) {
5462 /*
5463 * This piece is unwritten, or we're not
5464 * using unwritten extents. Skip over it.
5465 */
5466 ASSERT(end >= mod);
5467 end -= mod > del.br_blockcount ?
5468 del.br_blockcount : mod;
5469 if (end < got.br_startoff &&
5470 !xfs_iext_prev_extent(ifp, &icur, &got)) {
5471 done = true;
5472 break;
5473 }
5474 continue;
5475 }
5476 /*
5477 * It's written, turn it unwritten.
5478 * This is better than zeroing it.
5479 */
5480 ASSERT(del.br_state == XFS_EXT_NORM);
5481 ASSERT(tp->t_blk_res > 0);
5482 /*
5483 * If this spans a realtime extent boundary,
5484 * chop it back to the start of the one we end at.
5485 */
5486 if (del.br_blockcount > mod) {
5487 del.br_startoff += del.br_blockcount - mod;
5488 del.br_startblock += del.br_blockcount - mod;
5489 del.br_blockcount = mod;
5490 }
5491 del.br_state = XFS_EXT_UNWRITTEN;
5492 error = xfs_bmap_add_extent_unwritten_real(tp, ip,
5493 whichfork, &icur, &cur, &del,
5494 &logflags);
5495 if (error)
5496 goto error0;
5497 goto nodelete;
5498 }
5499 div_u64_rem(del.br_startblock, mp->m_sb.sb_rextsize, &mod);
5500 if (mod) {
5501 xfs_extlen_t off = mp->m_sb.sb_rextsize - mod;
5502
5503 /*
5504 * Realtime extent is lined up at the end but not
5505 * at the front. We'll get rid of full extents if
5506 * we can.
5507 */
5508 if (del.br_blockcount > off) {
5509 del.br_blockcount -= off;
5510 del.br_startoff += off;
5511 del.br_startblock += off;
5512 } else if (del.br_startoff == start &&
5513 (del.br_state == XFS_EXT_UNWRITTEN ||
5514 tp->t_blk_res == 0)) {
5515 /*
5516 * Can't make it unwritten. There isn't
5517 * a full extent here so just skip it.
5518 */
5519 ASSERT(end >= del.br_blockcount);
5520 end -= del.br_blockcount;
5521 if (got.br_startoff > end &&
5522 !xfs_iext_prev_extent(ifp, &icur, &got)) {
5523 done = true;
5524 break;
5525 }
5526 continue;
5527 } else if (del.br_state == XFS_EXT_UNWRITTEN) {
5528 struct xfs_bmbt_irec prev;
5529 xfs_fileoff_t unwrite_start;
5530
5531 /*
5532 * This one is already unwritten.
5533 * It must have a written left neighbor.
5534 * Unwrite the killed part of that one and
5535 * try again.
5536 */
5537 if (!xfs_iext_prev_extent(ifp, &icur, &prev))
5538 ASSERT(0);
5539 ASSERT(prev.br_state == XFS_EXT_NORM);
5540 ASSERT(!isnullstartblock(prev.br_startblock));
5541 ASSERT(del.br_startblock ==
5542 prev.br_startblock + prev.br_blockcount);
5543 unwrite_start = max3(start,
5544 del.br_startoff - mod,
5545 prev.br_startoff);
5546 mod = unwrite_start - prev.br_startoff;
5547 prev.br_startoff = unwrite_start;
5548 prev.br_startblock += mod;
5549 prev.br_blockcount -= mod;
5550 prev.br_state = XFS_EXT_UNWRITTEN;
5551 error = xfs_bmap_add_extent_unwritten_real(tp,
5552 ip, whichfork, &icur, &cur,
5553 &prev, &logflags);
5554 if (error)
5555 goto error0;
5556 goto nodelete;
5557 } else {
5558 ASSERT(del.br_state == XFS_EXT_NORM);
5559 del.br_state = XFS_EXT_UNWRITTEN;
5560 error = xfs_bmap_add_extent_unwritten_real(tp,
5561 ip, whichfork, &icur, &cur,
5562 &del, &logflags);
5563 if (error)
5564 goto error0;
5565 goto nodelete;
5566 }
5567 }
5568
5569 delete:
5570 if (wasdel) {
5571 error = xfs_bmap_del_extent_delay(ip, whichfork, &icur,
5572 &got, &del);
5573 } else {
5574 error = xfs_bmap_del_extent_real(ip, tp, &icur, cur,
5575 &del, &tmp_logflags, whichfork,
5576 flags);
5577 logflags |= tmp_logflags;
5578 }
5579
5580 if (error)
5581 goto error0;
5582
5583 max_len -= del.br_blockcount;
5584 end = del.br_startoff - 1;
5585 nodelete:
5586 /*
5587 * If not done go on to the next (previous) record.
5588 */
5589 if (end != (xfs_fileoff_t)-1 && end >= start) {
5590 if (!xfs_iext_get_extent(ifp, &icur, &got) ||
5591 (got.br_startoff > end &&
5592 !xfs_iext_prev_extent(ifp, &icur, &got))) {
5593 done = true;
5594 break;
5595 }
5596 extno++;
5597 }
5598 }
5599 if (done || end == (xfs_fileoff_t)-1 || end < start)
5600 *rlen = 0;
5601 else
5602 *rlen = end - start + 1;
5603
5604 /*
5605 * Convert to a btree if necessary.
5606 */
5607 if (xfs_bmap_needs_btree(ip, whichfork)) {
5608 ASSERT(cur == NULL);
5609 error = xfs_bmap_extents_to_btree(tp, ip, &cur, 0,
5610 &tmp_logflags, whichfork);
5611 logflags |= tmp_logflags;
5612 } else {
5613 error = xfs_bmap_btree_to_extents(tp, ip, cur, &logflags,
5614 whichfork);
5615 }
5616
5617 error0:
5618 /*
5619 * Log everything. Do this after conversion, there's no point in
5620 * logging the extent records if we've converted to btree format.
5621 */
5622 if ((logflags & xfs_ilog_fext(whichfork)) &&
5623 ifp->if_format != XFS_DINODE_FMT_EXTENTS)
5624 logflags &= ~xfs_ilog_fext(whichfork);
5625 else if ((logflags & xfs_ilog_fbroot(whichfork)) &&
5626 ifp->if_format != XFS_DINODE_FMT_BTREE)
5627 logflags &= ~xfs_ilog_fbroot(whichfork);
5628 /*
5629 * Log inode even in the error case, if the transaction
5630 * is dirty we'll need to shut down the filesystem.
5631 */
5632 if (logflags)
5633 xfs_trans_log_inode(tp, ip, logflags);
5634 if (cur) {
5635 if (!error)
5636 cur->bc_ino.allocated = 0;
5637 xfs_btree_del_cursor(cur, error);
5638 }
5639 return error;
5640 }
5641
5642 /* Unmap a range of a file. */
5643 int
5644 xfs_bunmapi(
5645 xfs_trans_t *tp,
5646 struct xfs_inode *ip,
5647 xfs_fileoff_t bno,
5648 xfs_filblks_t len,
5649 int flags,
5650 xfs_extnum_t nexts,
5651 int *done)
5652 {
5653 int error;
5654
5655 error = __xfs_bunmapi(tp, ip, bno, &len, flags, nexts);
5656 *done = (len == 0);
5657 return error;
5658 }
5659
5660 /*
5661 * Determine whether an extent shift can be accomplished by a merge with the
5662 * extent that precedes the target hole of the shift.
5663 */
5664 STATIC bool
5665 xfs_bmse_can_merge(
5666 struct xfs_bmbt_irec *left, /* preceding extent */
5667 struct xfs_bmbt_irec *got, /* current extent to shift */
5668 xfs_fileoff_t shift) /* shift fsb */
5669 {
5670 xfs_fileoff_t startoff;
5671
5672 startoff = got->br_startoff - shift;
5673
5674 /*
5675 * The extent, once shifted, must be adjacent in-file and on-disk with
5676 * the preceding extent.
5677 */
5678 if ((left->br_startoff + left->br_blockcount != startoff) ||
5679 (left->br_startblock + left->br_blockcount != got->br_startblock) ||
5680 (left->br_state != got->br_state) ||
5681 (left->br_blockcount + got->br_blockcount > MAXEXTLEN))
5682 return false;
5683
5684 return true;
5685 }
5686
5687 /*
5688 * A bmap extent shift adjusts the file offset of an extent to fill a preceding
5689 * hole in the file. If an extent shift would result in the extent being fully
5690 * adjacent to the extent that currently precedes the hole, we can merge with
5691 * the preceding extent rather than do the shift.
5692 *
5693 * This function assumes the caller has verified a shift-by-merge is possible
5694 * with the provided extents via xfs_bmse_can_merge().
5695 */
5696 STATIC int
5697 xfs_bmse_merge(
5698 struct xfs_trans *tp,
5699 struct xfs_inode *ip,
5700 int whichfork,
5701 xfs_fileoff_t shift, /* shift fsb */
5702 struct xfs_iext_cursor *icur,
5703 struct xfs_bmbt_irec *got, /* extent to shift */
5704 struct xfs_bmbt_irec *left, /* preceding extent */
5705 struct xfs_btree_cur *cur,
5706 int *logflags) /* output */
5707 {
5708 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
5709 struct xfs_bmbt_irec new;
5710 xfs_filblks_t blockcount;
5711 int error, i;
5712 struct xfs_mount *mp = ip->i_mount;
5713
5714 blockcount = left->br_blockcount + got->br_blockcount;
5715
5716 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
5717 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5718 ASSERT(xfs_bmse_can_merge(left, got, shift));
5719
5720 new = *left;
5721 new.br_blockcount = blockcount;
5722
5723 /*
5724 * Update the on-disk extent count, the btree if necessary and log the
5725 * inode.
5726 */
5727 ifp->if_nextents--;
5728 *logflags |= XFS_ILOG_CORE;
5729 if (!cur) {
5730 *logflags |= XFS_ILOG_DEXT;
5731 goto done;
5732 }
5733
5734 /* lookup and remove the extent to merge */
5735 error = xfs_bmbt_lookup_eq(cur, got, &i);
5736 if (error)
5737 return error;
5738 if (XFS_IS_CORRUPT(mp, i != 1))
5739 return -EFSCORRUPTED;
5740
5741 error = xfs_btree_delete(cur, &i);
5742 if (error)
5743 return error;
5744 if (XFS_IS_CORRUPT(mp, i != 1))
5745 return -EFSCORRUPTED;
5746
5747 /* lookup and update size of the previous extent */
5748 error = xfs_bmbt_lookup_eq(cur, left, &i);
5749 if (error)
5750 return error;
5751 if (XFS_IS_CORRUPT(mp, i != 1))
5752 return -EFSCORRUPTED;
5753
5754 error = xfs_bmbt_update(cur, &new);
5755 if (error)
5756 return error;
5757
5758 /* change to extent format if required after extent removal */
5759 error = xfs_bmap_btree_to_extents(tp, ip, cur, logflags, whichfork);
5760 if (error)
5761 return error;
5762
5763 done:
5764 xfs_iext_remove(ip, icur, 0);
5765 xfs_iext_prev(ifp, icur);
5766 xfs_iext_update_extent(ip, xfs_bmap_fork_to_state(whichfork), icur,
5767 &new);
5768
5769 /* update reverse mapping. rmap functions merge the rmaps for us */
5770 xfs_rmap_unmap_extent(tp, ip, whichfork, got);
5771 memcpy(&new, got, sizeof(new));
5772 new.br_startoff = left->br_startoff + left->br_blockcount;
5773 xfs_rmap_map_extent(tp, ip, whichfork, &new);
5774 return 0;
5775 }
5776
5777 static int
5778 xfs_bmap_shift_update_extent(
5779 struct xfs_trans *tp,
5780 struct xfs_inode *ip,
5781 int whichfork,
5782 struct xfs_iext_cursor *icur,
5783 struct xfs_bmbt_irec *got,
5784 struct xfs_btree_cur *cur,
5785 int *logflags,
5786 xfs_fileoff_t startoff)
5787 {
5788 struct xfs_mount *mp = ip->i_mount;
5789 struct xfs_bmbt_irec prev = *got;
5790 int error, i;
5791
5792 *logflags |= XFS_ILOG_CORE;
5793
5794 got->br_startoff = startoff;
5795
5796 if (cur) {
5797 error = xfs_bmbt_lookup_eq(cur, &prev, &i);
5798 if (error)
5799 return error;
5800 if (XFS_IS_CORRUPT(mp, i != 1))
5801 return -EFSCORRUPTED;
5802
5803 error = xfs_bmbt_update(cur, got);
5804 if (error)
5805 return error;
5806 } else {
5807 *logflags |= XFS_ILOG_DEXT;
5808 }
5809
5810 xfs_iext_update_extent(ip, xfs_bmap_fork_to_state(whichfork), icur,
5811 got);
5812
5813 /* update reverse mapping */
5814 xfs_rmap_unmap_extent(tp, ip, whichfork, &prev);
5815 xfs_rmap_map_extent(tp, ip, whichfork, got);
5816 return 0;
5817 }
5818
5819 int
5820 xfs_bmap_collapse_extents(
5821 struct xfs_trans *tp,
5822 struct xfs_inode *ip,
5823 xfs_fileoff_t *next_fsb,
5824 xfs_fileoff_t offset_shift_fsb,
5825 bool *done)
5826 {
5827 int whichfork = XFS_DATA_FORK;
5828 struct xfs_mount *mp = ip->i_mount;
5829 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
5830 struct xfs_btree_cur *cur = NULL;
5831 struct xfs_bmbt_irec got, prev;
5832 struct xfs_iext_cursor icur;
5833 xfs_fileoff_t new_startoff;
5834 int error = 0;
5835 int logflags = 0;
5836
5837 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)) ||
5838 XFS_TEST_ERROR(false, mp, XFS_ERRTAG_BMAPIFORMAT)) {
5839 return -EFSCORRUPTED;
5840 }
5841
5842 if (XFS_FORCED_SHUTDOWN(mp))
5843 return -EIO;
5844
5845 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL | XFS_ILOCK_EXCL));
5846
5847 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
5848 error = xfs_iread_extents(tp, ip, whichfork);
5849 if (error)
5850 return error;
5851 }
5852
5853 if (ifp->if_flags & XFS_IFBROOT) {
5854 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5855 cur->bc_ino.flags = 0;
5856 }
5857
5858 if (!xfs_iext_lookup_extent(ip, ifp, *next_fsb, &icur, &got)) {
5859 *done = true;
5860 goto del_cursor;
5861 }
5862 if (XFS_IS_CORRUPT(mp, isnullstartblock(got.br_startblock))) {
5863 error = -EFSCORRUPTED;
5864 goto del_cursor;
5865 }
5866
5867 new_startoff = got.br_startoff - offset_shift_fsb;
5868 if (xfs_iext_peek_prev_extent(ifp, &icur, &prev)) {
5869 if (new_startoff < prev.br_startoff + prev.br_blockcount) {
5870 error = -EINVAL;
5871 goto del_cursor;
5872 }
5873
5874 if (xfs_bmse_can_merge(&prev, &got, offset_shift_fsb)) {
5875 error = xfs_bmse_merge(tp, ip, whichfork,
5876 offset_shift_fsb, &icur, &got, &prev,
5877 cur, &logflags);
5878 if (error)
5879 goto del_cursor;
5880 goto done;
5881 }
5882 } else {
5883 if (got.br_startoff < offset_shift_fsb) {
5884 error = -EINVAL;
5885 goto del_cursor;
5886 }
5887 }
5888
5889 error = xfs_bmap_shift_update_extent(tp, ip, whichfork, &icur, &got,
5890 cur, &logflags, new_startoff);
5891 if (error)
5892 goto del_cursor;
5893
5894 done:
5895 if (!xfs_iext_next_extent(ifp, &icur, &got)) {
5896 *done = true;
5897 goto del_cursor;
5898 }
5899
5900 *next_fsb = got.br_startoff;
5901 del_cursor:
5902 if (cur)
5903 xfs_btree_del_cursor(cur, error);
5904 if (logflags)
5905 xfs_trans_log_inode(tp, ip, logflags);
5906 return error;
5907 }
5908
5909 /* Make sure we won't be right-shifting an extent past the maximum bound. */
5910 int
5911 xfs_bmap_can_insert_extents(
5912 struct xfs_inode *ip,
5913 xfs_fileoff_t off,
5914 xfs_fileoff_t shift)
5915 {
5916 struct xfs_bmbt_irec got;
5917 int is_empty;
5918 int error = 0;
5919
5920 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
5921
5922 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
5923 return -EIO;
5924
5925 xfs_ilock(ip, XFS_ILOCK_EXCL);
5926 error = xfs_bmap_last_extent(NULL, ip, XFS_DATA_FORK, &got, &is_empty);
5927 if (!error && !is_empty && got.br_startoff >= off &&
5928 ((got.br_startoff + shift) & BMBT_STARTOFF_MASK) < got.br_startoff)
5929 error = -EINVAL;
5930 xfs_iunlock(ip, XFS_ILOCK_EXCL);
5931
5932 return error;
5933 }
5934
5935 int
5936 xfs_bmap_insert_extents(
5937 struct xfs_trans *tp,
5938 struct xfs_inode *ip,
5939 xfs_fileoff_t *next_fsb,
5940 xfs_fileoff_t offset_shift_fsb,
5941 bool *done,
5942 xfs_fileoff_t stop_fsb)
5943 {
5944 int whichfork = XFS_DATA_FORK;
5945 struct xfs_mount *mp = ip->i_mount;
5946 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
5947 struct xfs_btree_cur *cur = NULL;
5948 struct xfs_bmbt_irec got, next;
5949 struct xfs_iext_cursor icur;
5950 xfs_fileoff_t new_startoff;
5951 int error = 0;
5952 int logflags = 0;
5953
5954 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)) ||
5955 XFS_TEST_ERROR(false, mp, XFS_ERRTAG_BMAPIFORMAT)) {
5956 return -EFSCORRUPTED;
5957 }
5958
5959 if (XFS_FORCED_SHUTDOWN(mp))
5960 return -EIO;
5961
5962 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL | XFS_ILOCK_EXCL));
5963
5964 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
5965 error = xfs_iread_extents(tp, ip, whichfork);
5966 if (error)
5967 return error;
5968 }
5969
5970 if (ifp->if_flags & XFS_IFBROOT) {
5971 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5972 cur->bc_ino.flags = 0;
5973 }
5974
5975 if (*next_fsb == NULLFSBLOCK) {
5976 xfs_iext_last(ifp, &icur);
5977 if (!xfs_iext_get_extent(ifp, &icur, &got) ||
5978 stop_fsb > got.br_startoff) {
5979 *done = true;
5980 goto del_cursor;
5981 }
5982 } else {
5983 if (!xfs_iext_lookup_extent(ip, ifp, *next_fsb, &icur, &got)) {
5984 *done = true;
5985 goto del_cursor;
5986 }
5987 }
5988 if (XFS_IS_CORRUPT(mp, isnullstartblock(got.br_startblock))) {
5989 error = -EFSCORRUPTED;
5990 goto del_cursor;
5991 }
5992
5993 if (XFS_IS_CORRUPT(mp, stop_fsb > got.br_startoff)) {
5994 error = -EFSCORRUPTED;
5995 goto del_cursor;
5996 }
5997
5998 new_startoff = got.br_startoff + offset_shift_fsb;
5999 if (xfs_iext_peek_next_extent(ifp, &icur, &next)) {
6000 if (new_startoff + got.br_blockcount > next.br_startoff) {
6001 error = -EINVAL;
6002 goto del_cursor;
6003 }
6004
6005 /*
6006 * Unlike a left shift (which involves a hole punch), a right
6007 * shift does not modify extent neighbors in any way. We should
6008 * never find mergeable extents in this scenario. Check anyways
6009 * and warn if we encounter two extents that could be one.
6010 */
6011 if (xfs_bmse_can_merge(&got, &next, offset_shift_fsb))
6012 WARN_ON_ONCE(1);
6013 }
6014
6015 error = xfs_bmap_shift_update_extent(tp, ip, whichfork, &icur, &got,
6016 cur, &logflags, new_startoff);
6017 if (error)
6018 goto del_cursor;
6019
6020 if (!xfs_iext_prev_extent(ifp, &icur, &got) ||
6021 stop_fsb >= got.br_startoff + got.br_blockcount) {
6022 *done = true;
6023 goto del_cursor;
6024 }
6025
6026 *next_fsb = got.br_startoff;
6027 del_cursor:
6028 if (cur)
6029 xfs_btree_del_cursor(cur, error);
6030 if (logflags)
6031 xfs_trans_log_inode(tp, ip, logflags);
6032 return error;
6033 }
6034
6035 /*
6036 * Splits an extent into two extents at split_fsb block such that it is the
6037 * first block of the current_ext. @ext is a target extent to be split.
6038 * @split_fsb is a block where the extents is split. If split_fsb lies in a
6039 * hole or the first block of extents, just return 0.
6040 */
6041 int
6042 xfs_bmap_split_extent(
6043 struct xfs_trans *tp,
6044 struct xfs_inode *ip,
6045 xfs_fileoff_t split_fsb)
6046 {
6047 int whichfork = XFS_DATA_FORK;
6048 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
6049 struct xfs_btree_cur *cur = NULL;
6050 struct xfs_bmbt_irec got;
6051 struct xfs_bmbt_irec new; /* split extent */
6052 struct xfs_mount *mp = ip->i_mount;
6053 xfs_fsblock_t gotblkcnt; /* new block count for got */
6054 struct xfs_iext_cursor icur;
6055 int error = 0;
6056 int logflags = 0;
6057 int i = 0;
6058
6059 if (XFS_IS_CORRUPT(mp, !xfs_ifork_has_extents(ifp)) ||
6060 XFS_TEST_ERROR(false, mp, XFS_ERRTAG_BMAPIFORMAT)) {
6061 return -EFSCORRUPTED;
6062 }
6063
6064 if (XFS_FORCED_SHUTDOWN(mp))
6065 return -EIO;
6066
6067 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
6068 /* Read in all the extents */
6069 error = xfs_iread_extents(tp, ip, whichfork);
6070 if (error)
6071 return error;
6072 }
6073
6074 /*
6075 * If there are not extents, or split_fsb lies in a hole we are done.
6076 */
6077 if (!xfs_iext_lookup_extent(ip, ifp, split_fsb, &icur, &got) ||
6078 got.br_startoff >= split_fsb)
6079 return 0;
6080
6081 gotblkcnt = split_fsb - got.br_startoff;
6082 new.br_startoff = split_fsb;
6083 new.br_startblock = got.br_startblock + gotblkcnt;
6084 new.br_blockcount = got.br_blockcount - gotblkcnt;
6085 new.br_state = got.br_state;
6086
6087 if (ifp->if_flags & XFS_IFBROOT) {
6088 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
6089 cur->bc_ino.flags = 0;
6090 error = xfs_bmbt_lookup_eq(cur, &got, &i);
6091 if (error)
6092 goto del_cursor;
6093 if (XFS_IS_CORRUPT(mp, i != 1)) {
6094 error = -EFSCORRUPTED;
6095 goto del_cursor;
6096 }
6097 }
6098
6099 got.br_blockcount = gotblkcnt;
6100 xfs_iext_update_extent(ip, xfs_bmap_fork_to_state(whichfork), &icur,
6101 &got);
6102
6103 logflags = XFS_ILOG_CORE;
6104 if (cur) {
6105 error = xfs_bmbt_update(cur, &got);
6106 if (error)
6107 goto del_cursor;
6108 } else
6109 logflags |= XFS_ILOG_DEXT;
6110
6111 /* Add new extent */
6112 xfs_iext_next(ifp, &icur);
6113 xfs_iext_insert(ip, &icur, &new, 0);
6114 ifp->if_nextents++;
6115
6116 if (cur) {
6117 error = xfs_bmbt_lookup_eq(cur, &new, &i);
6118 if (error)
6119 goto del_cursor;
6120 if (XFS_IS_CORRUPT(mp, i != 0)) {
6121 error = -EFSCORRUPTED;
6122 goto del_cursor;
6123 }
6124 error = xfs_btree_insert(cur, &i);
6125 if (error)
6126 goto del_cursor;
6127 if (XFS_IS_CORRUPT(mp, i != 1)) {
6128 error = -EFSCORRUPTED;
6129 goto del_cursor;
6130 }
6131 }
6132
6133 /*
6134 * Convert to a btree if necessary.
6135 */
6136 if (xfs_bmap_needs_btree(ip, whichfork)) {
6137 int tmp_logflags; /* partial log flag return val */
6138
6139 ASSERT(cur == NULL);
6140 error = xfs_bmap_extents_to_btree(tp, ip, &cur, 0,
6141 &tmp_logflags, whichfork);
6142 logflags |= tmp_logflags;
6143 }
6144
6145 del_cursor:
6146 if (cur) {
6147 cur->bc_ino.allocated = 0;
6148 xfs_btree_del_cursor(cur, error);
6149 }
6150
6151 if (logflags)
6152 xfs_trans_log_inode(tp, ip, logflags);
6153 return error;
6154 }
6155
6156 /* Deferred mapping is only for real extents in the data fork. */
6157 static bool
6158 xfs_bmap_is_update_needed(
6159 struct xfs_bmbt_irec *bmap)
6160 {
6161 return bmap->br_startblock != HOLESTARTBLOCK &&
6162 bmap->br_startblock != DELAYSTARTBLOCK;
6163 }
6164
6165 /* Record a bmap intent. */
6166 static int
6167 __xfs_bmap_add(
6168 struct xfs_trans *tp,
6169 enum xfs_bmap_intent_type type,
6170 struct xfs_inode *ip,
6171 int whichfork,
6172 struct xfs_bmbt_irec *bmap)
6173 {
6174 struct xfs_bmap_intent *bi;
6175
6176 trace_xfs_bmap_defer(tp->t_mountp,
6177 XFS_FSB_TO_AGNO(tp->t_mountp, bmap->br_startblock),
6178 type,
6179 XFS_FSB_TO_AGBNO(tp->t_mountp, bmap->br_startblock),
6180 ip->i_ino, whichfork,
6181 bmap->br_startoff,
6182 bmap->br_blockcount,
6183 bmap->br_state);
6184
6185 bi = kmem_alloc(sizeof(struct xfs_bmap_intent), KM_NOFS);
6186 INIT_LIST_HEAD(&bi->bi_list);
6187 bi->bi_type = type;
6188 bi->bi_owner = ip;
6189 bi->bi_whichfork = whichfork;
6190 bi->bi_bmap = *bmap;
6191
6192 xfs_defer_add(tp, XFS_DEFER_OPS_TYPE_BMAP, &bi->bi_list);
6193 return 0;
6194 }
6195
6196 /* Map an extent into a file. */
6197 void
6198 xfs_bmap_map_extent(
6199 struct xfs_trans *tp,
6200 struct xfs_inode *ip,
6201 struct xfs_bmbt_irec *PREV)
6202 {
6203 if (!xfs_bmap_is_update_needed(PREV))
6204 return;
6205
6206 __xfs_bmap_add(tp, XFS_BMAP_MAP, ip, XFS_DATA_FORK, PREV);
6207 }
6208
6209 /* Unmap an extent out of a file. */
6210 void
6211 xfs_bmap_unmap_extent(
6212 struct xfs_trans *tp,
6213 struct xfs_inode *ip,
6214 struct xfs_bmbt_irec *PREV)
6215 {
6216 if (!xfs_bmap_is_update_needed(PREV))
6217 return;
6218
6219 __xfs_bmap_add(tp, XFS_BMAP_UNMAP, ip, XFS_DATA_FORK, PREV);
6220 }
6221
6222 /*
6223 * Process one of the deferred bmap operations. We pass back the
6224 * btree cursor to maintain our lock on the bmapbt between calls.
6225 */
6226 int
6227 xfs_bmap_finish_one(
6228 struct xfs_trans *tp,
6229 struct xfs_inode *ip,
6230 enum xfs_bmap_intent_type type,
6231 int whichfork,
6232 xfs_fileoff_t startoff,
6233 xfs_fsblock_t startblock,
6234 xfs_filblks_t *blockcount,
6235 xfs_exntst_t state)
6236 {
6237 int error = 0;
6238
6239 ASSERT(tp->t_firstblock == NULLFSBLOCK);
6240
6241 trace_xfs_bmap_deferred(tp->t_mountp,
6242 XFS_FSB_TO_AGNO(tp->t_mountp, startblock), type,
6243 XFS_FSB_TO_AGBNO(tp->t_mountp, startblock),
6244 ip->i_ino, whichfork, startoff, *blockcount, state);
6245
6246 if (WARN_ON_ONCE(whichfork != XFS_DATA_FORK))
6247 return -EFSCORRUPTED;
6248
6249 if (XFS_TEST_ERROR(false, tp->t_mountp,
6250 XFS_ERRTAG_BMAP_FINISH_ONE))
6251 return -EIO;
6252
6253 switch (type) {
6254 case XFS_BMAP_MAP:
6255 error = xfs_bmapi_remap(tp, ip, startoff, *blockcount,
6256 startblock, 0);
6257 *blockcount = 0;
6258 break;
6259 case XFS_BMAP_UNMAP:
6260 error = __xfs_bunmapi(tp, ip, startoff, blockcount,
6261 XFS_BMAPI_REMAP, 1);
6262 break;
6263 default:
6264 ASSERT(0);
6265 error = -EFSCORRUPTED;
6266 }
6267
6268 return error;
6269 }
6270
6271 /* Check that an inode's extent does not have invalid flags or bad ranges. */
6272 xfs_failaddr_t
6273 xfs_bmap_validate_extent(
6274 struct xfs_inode *ip,
6275 int whichfork,
6276 struct xfs_bmbt_irec *irec)
6277 {
6278 struct xfs_mount *mp = ip->i_mount;
6279
6280 if (!xfs_verify_fileext(mp, irec->br_startoff, irec->br_blockcount))
6281 return __this_address;
6282
6283 if (XFS_IS_REALTIME_INODE(ip) && whichfork == XFS_DATA_FORK) {
6284 if (!xfs_verify_rtext(mp, irec->br_startblock,
6285 irec->br_blockcount))
6286 return __this_address;
6287 } else {
6288 if (!xfs_verify_fsbext(mp, irec->br_startblock,
6289 irec->br_blockcount))
6290 return __this_address;
6291 }
6292 if (irec->br_state != XFS_EXT_NORM && whichfork != XFS_DATA_FORK)
6293 return __this_address;
6294 return NULL;
6295 }
Unnamed repository; edit this file 'description' to name the repository.