2 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
26 #include "xfs_mount.h"
27 #include "xfs_defer.h"
28 #include "xfs_da_format.h"
29 #include "xfs_da_btree.h"
31 #include "xfs_inode.h"
32 #include "xfs_btree.h"
33 #include "xfs_trans.h"
34 #include "xfs_inode_item.h"
35 #include "xfs_extfree_item.h"
36 #include "xfs_alloc.h"
38 #include "xfs_bmap_util.h"
39 #include "xfs_bmap_btree.h"
40 #include "xfs_rtalloc.h"
41 #include "xfs_error.h"
42 #include "xfs_quota.h"
43 #include "xfs_trans_space.h"
44 #include "xfs_buf_item.h"
45 #include "xfs_trace.h"
46 #include "xfs_symlink.h"
47 #include "xfs_attr_leaf.h"
48 #include "xfs_filestream.h"
50 #include "xfs_ag_resv.h"
51 #include "xfs_refcount.h"
52 #include "xfs_rmap_btree.h"
53 #include "xfs_icache.h"
56 kmem_zone_t *xfs_bmap_free_item_zone;
59 * Miscellaneous helper functions
63 * Compute and fill in the value of the maximum depth of a bmap btree
64 * in this filesystem. Done once, during mount.
67 xfs_bmap_compute_maxlevels(
68 xfs_mount_t *mp, /* file system mount structure */
69 int whichfork) /* data or attr fork */
71 int level; /* btree level */
72 uint maxblocks; /* max blocks at this level */
73 uint maxleafents; /* max leaf entries possible */
74 int maxrootrecs; /* max records in root block */
75 int minleafrecs; /* min records in leaf block */
76 int minnoderecs; /* min records in node block */
77 int sz; /* root block size */
80 * The maximum number of extents in a file, hence the maximum
81 * number of leaf entries, is controlled by the type of di_nextents
82 * (a signed 32-bit number, xfs_extnum_t), or by di_anextents
83 * (a signed 16-bit number, xfs_aextnum_t).
85 * Note that we can no longer assume that if we are in ATTR1 that
86 * the fork offset of all the inodes will be
87 * (xfs_default_attroffset(ip) >> 3) because we could have mounted
88 * with ATTR2 and then mounted back with ATTR1, keeping the
89 * di_forkoff's fixed but probably at various positions. Therefore,
90 * for both ATTR1 and ATTR2 we have to assume the worst case scenario
91 * of a minimum size available.
93 if (whichfork == XFS_DATA_FORK) {
94 maxleafents = MAXEXTNUM;
95 sz = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
97 maxleafents = MAXAEXTNUM;
98 sz = XFS_BMDR_SPACE_CALC(MINABTPTRS);
100 maxrootrecs = xfs_bmdr_maxrecs(sz, 0);
101 minleafrecs = mp->m_bmap_dmnr[0];
102 minnoderecs = mp->m_bmap_dmnr[1];
103 maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs;
104 for (level = 1; maxblocks > 1; level++) {
105 if (maxblocks <= maxrootrecs)
108 maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs;
110 mp->m_bm_maxlevels[whichfork] = level;
113 STATIC int /* error */
115 struct xfs_btree_cur *cur,
119 int *stat) /* success/failure */
121 cur->bc_rec.b.br_startoff = off;
122 cur->bc_rec.b.br_startblock = bno;
123 cur->bc_rec.b.br_blockcount = len;
124 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
127 STATIC int /* error */
129 struct xfs_btree_cur *cur,
133 int *stat) /* success/failure */
135 cur->bc_rec.b.br_startoff = off;
136 cur->bc_rec.b.br_startblock = bno;
137 cur->bc_rec.b.br_blockcount = len;
138 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
142 * Check if the inode needs to be converted to btree format.
144 static inline bool xfs_bmap_needs_btree(struct xfs_inode *ip, int whichfork)
146 return whichfork != XFS_COW_FORK &&
147 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
148 XFS_IFORK_NEXTENTS(ip, whichfork) >
149 XFS_IFORK_MAXEXT(ip, whichfork);
153 * Check if the inode should be converted to extent format.
155 static inline bool xfs_bmap_wants_extents(struct xfs_inode *ip, int whichfork)
157 return whichfork != XFS_COW_FORK &&
158 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE &&
159 XFS_IFORK_NEXTENTS(ip, whichfork) <=
160 XFS_IFORK_MAXEXT(ip, whichfork);
164 * Update the record referred to by cur to the value given
165 * by [off, bno, len, state].
166 * This either works (return 0) or gets an EFSCORRUPTED error.
170 struct xfs_btree_cur *cur,
176 union xfs_btree_rec rec;
178 xfs_bmbt_disk_set_allf(&rec.bmbt, off, bno, len, state);
179 return xfs_btree_update(cur, &rec);
183 * Compute the worst-case number of indirect blocks that will be used
184 * for ip's delayed extent of length "len".
187 xfs_bmap_worst_indlen(
188 xfs_inode_t *ip, /* incore inode pointer */
189 xfs_filblks_t len) /* delayed extent length */
191 int level; /* btree level number */
192 int maxrecs; /* maximum record count at this level */
193 xfs_mount_t *mp; /* mount structure */
194 xfs_filblks_t rval; /* return value */
195 xfs_filblks_t orig_len;
199 /* Calculate the worst-case size of the bmbt. */
201 maxrecs = mp->m_bmap_dmxr[0];
202 for (level = 0, rval = 0;
203 level < XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK);
206 do_div(len, maxrecs);
209 rval += XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) -
214 maxrecs = mp->m_bmap_dmxr[1];
217 /* Calculate the worst-case size of the rmapbt. */
218 if (xfs_sb_version_hasrmapbt(&mp->m_sb))
219 rval += 1 + xfs_rmapbt_calc_size(mp, orig_len) +
220 mp->m_rmap_maxlevels;
226 * Calculate the default attribute fork offset for newly created inodes.
229 xfs_default_attroffset(
230 struct xfs_inode *ip)
232 struct xfs_mount *mp = ip->i_mount;
235 if (mp->m_sb.sb_inodesize == 256) {
236 offset = XFS_LITINO(mp, ip->i_d.di_version) -
237 XFS_BMDR_SPACE_CALC(MINABTPTRS);
239 offset = XFS_BMDR_SPACE_CALC(6 * MINABTPTRS);
242 ASSERT(offset < XFS_LITINO(mp, ip->i_d.di_version));
247 * Helper routine to reset inode di_forkoff field when switching
248 * attribute fork from local to extent format - we reset it where
249 * possible to make space available for inline data fork extents.
252 xfs_bmap_forkoff_reset(
256 if (whichfork == XFS_ATTR_FORK &&
257 ip->i_d.di_format != XFS_DINODE_FMT_DEV &&
258 ip->i_d.di_format != XFS_DINODE_FMT_UUID &&
259 ip->i_d.di_format != XFS_DINODE_FMT_BTREE) {
260 uint dfl_forkoff = xfs_default_attroffset(ip) >> 3;
262 if (dfl_forkoff > ip->i_d.di_forkoff)
263 ip->i_d.di_forkoff = dfl_forkoff;
268 STATIC struct xfs_buf *
270 struct xfs_btree_cur *cur,
273 struct xfs_log_item_desc *lidp;
279 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) {
280 if (!cur->bc_bufs[i])
282 if (XFS_BUF_ADDR(cur->bc_bufs[i]) == bno)
283 return cur->bc_bufs[i];
286 /* Chase down all the log items to see if the bp is there */
287 list_for_each_entry(lidp, &cur->bc_tp->t_items, lid_trans) {
288 struct xfs_buf_log_item *bip;
289 bip = (struct xfs_buf_log_item *)lidp->lid_item;
290 if (bip->bli_item.li_type == XFS_LI_BUF &&
291 XFS_BUF_ADDR(bip->bli_buf) == bno)
300 struct xfs_btree_block *block,
306 __be64 *pp, *thispa; /* pointer to block address */
307 xfs_bmbt_key_t *prevp, *keyp;
309 ASSERT(be16_to_cpu(block->bb_level) > 0);
312 for( i = 1; i <= xfs_btree_get_numrecs(block); i++) {
313 dmxr = mp->m_bmap_dmxr[0];
314 keyp = XFS_BMBT_KEY_ADDR(mp, block, i);
317 ASSERT(be64_to_cpu(prevp->br_startoff) <
318 be64_to_cpu(keyp->br_startoff));
323 * Compare the block numbers to see if there are dups.
326 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz);
328 pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr);
330 for (j = i+1; j <= be16_to_cpu(block->bb_numrecs); j++) {
332 thispa = XFS_BMAP_BROOT_PTR_ADDR(mp, block, j, sz);
334 thispa = XFS_BMBT_PTR_ADDR(mp, block, j, dmxr);
335 if (*thispa == *pp) {
336 xfs_warn(mp, "%s: thispa(%d) == pp(%d) %Ld",
338 (unsigned long long)be64_to_cpu(*thispa));
339 panic("%s: ptrs are equal in node\n",
347 * Check that the extents for the inode ip are in the right order in all
348 * btree leaves. THis becomes prohibitively expensive for large extent count
349 * files, so don't bother with inodes that have more than 10,000 extents in
350 * them. The btree record ordering checks will still be done, so for such large
351 * bmapbt constructs that is going to catch most corruptions.
354 xfs_bmap_check_leaf_extents(
355 xfs_btree_cur_t *cur, /* btree cursor or null */
356 xfs_inode_t *ip, /* incore inode pointer */
357 int whichfork) /* data or attr fork */
359 struct xfs_btree_block *block; /* current btree block */
360 xfs_fsblock_t bno; /* block # of "block" */
361 xfs_buf_t *bp; /* buffer for "block" */
362 int error; /* error return value */
363 xfs_extnum_t i=0, j; /* index into the extents list */
364 xfs_ifork_t *ifp; /* fork structure */
365 int level; /* btree level, for checking */
366 xfs_mount_t *mp; /* file system mount structure */
367 __be64 *pp; /* pointer to block address */
368 xfs_bmbt_rec_t *ep; /* pointer to current extent */
369 xfs_bmbt_rec_t last = {0, 0}; /* last extent in prev block */
370 xfs_bmbt_rec_t *nextp; /* pointer to next extent */
373 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) {
377 /* skip large extent count inodes */
378 if (ip->i_d.di_nextents > 10000)
383 ifp = XFS_IFORK_PTR(ip, whichfork);
384 block = ifp->if_broot;
386 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
388 level = be16_to_cpu(block->bb_level);
390 xfs_check_block(block, mp, 1, ifp->if_broot_bytes);
391 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
392 bno = be64_to_cpu(*pp);
394 ASSERT(bno != NULLFSBLOCK);
395 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
396 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
399 * Go down the tree until leaf level is reached, following the first
400 * pointer (leftmost) at each level.
402 while (level-- > 0) {
403 /* See if buf is in cur first */
405 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
408 error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp,
414 block = XFS_BUF_TO_BLOCK(bp);
419 * Check this block for basic sanity (increasing keys and
420 * no duplicate blocks).
423 xfs_check_block(block, mp, 0, 0);
424 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
425 bno = be64_to_cpu(*pp);
426 XFS_WANT_CORRUPTED_GOTO(mp,
427 XFS_FSB_SANITY_CHECK(mp, bno), error0);
430 xfs_trans_brelse(NULL, bp);
435 * Here with bp and block set to the leftmost leaf node in the tree.
440 * Loop over all leaf nodes checking that all extents are in the right order.
443 xfs_fsblock_t nextbno;
444 xfs_extnum_t num_recs;
447 num_recs = xfs_btree_get_numrecs(block);
450 * Read-ahead the next leaf block, if any.
453 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
456 * Check all the extents to make sure they are OK.
457 * If we had a previous block, the last entry should
458 * conform with the first entry in this one.
461 ep = XFS_BMBT_REC_ADDR(mp, block, 1);
463 ASSERT(xfs_bmbt_disk_get_startoff(&last) +
464 xfs_bmbt_disk_get_blockcount(&last) <=
465 xfs_bmbt_disk_get_startoff(ep));
467 for (j = 1; j < num_recs; j++) {
468 nextp = XFS_BMBT_REC_ADDR(mp, block, j + 1);
469 ASSERT(xfs_bmbt_disk_get_startoff(ep) +
470 xfs_bmbt_disk_get_blockcount(ep) <=
471 xfs_bmbt_disk_get_startoff(nextp));
479 xfs_trans_brelse(NULL, bp);
483 * If we've reached the end, stop.
485 if (bno == NULLFSBLOCK)
489 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
492 error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp,
498 block = XFS_BUF_TO_BLOCK(bp);
504 xfs_warn(mp, "%s: at error0", __func__);
506 xfs_trans_brelse(NULL, bp);
508 xfs_warn(mp, "%s: BAD after btree leaves for %d extents",
510 panic("%s: CORRUPTED BTREE OR SOMETHING", __func__);
515 * Add bmap trace insert entries for all the contents of the extent records.
518 xfs_bmap_trace_exlist(
519 xfs_inode_t *ip, /* incore inode pointer */
520 xfs_extnum_t cnt, /* count of entries in the list */
521 int whichfork, /* data or attr or cow fork */
522 unsigned long caller_ip)
524 xfs_extnum_t idx; /* extent record index */
525 xfs_ifork_t *ifp; /* inode fork pointer */
528 if (whichfork == XFS_ATTR_FORK)
529 state |= BMAP_ATTRFORK;
530 else if (whichfork == XFS_COW_FORK)
531 state |= BMAP_COWFORK;
533 ifp = XFS_IFORK_PTR(ip, whichfork);
534 ASSERT(cnt == xfs_iext_count(ifp));
535 for (idx = 0; idx < cnt; idx++)
536 trace_xfs_extlist(ip, idx, state, caller_ip);
540 * Validate that the bmbt_irecs being returned from bmapi are valid
541 * given the caller's original parameters. Specifically check the
542 * ranges of the returned irecs to ensure that they only extend beyond
543 * the given parameters if the XFS_BMAPI_ENTIRE flag was set.
546 xfs_bmap_validate_ret(
550 xfs_bmbt_irec_t *mval,
554 int i; /* index to map values */
556 ASSERT(ret_nmap <= nmap);
558 for (i = 0; i < ret_nmap; i++) {
559 ASSERT(mval[i].br_blockcount > 0);
560 if (!(flags & XFS_BMAPI_ENTIRE)) {
561 ASSERT(mval[i].br_startoff >= bno);
562 ASSERT(mval[i].br_blockcount <= len);
563 ASSERT(mval[i].br_startoff + mval[i].br_blockcount <=
566 ASSERT(mval[i].br_startoff < bno + len);
567 ASSERT(mval[i].br_startoff + mval[i].br_blockcount >
571 mval[i - 1].br_startoff + mval[i - 1].br_blockcount ==
572 mval[i].br_startoff);
573 ASSERT(mval[i].br_startblock != DELAYSTARTBLOCK &&
574 mval[i].br_startblock != HOLESTARTBLOCK);
575 ASSERT(mval[i].br_state == XFS_EXT_NORM ||
576 mval[i].br_state == XFS_EXT_UNWRITTEN);
581 #define xfs_bmap_check_leaf_extents(cur, ip, whichfork) do { } while (0)
582 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap)
586 * bmap free list manipulation functions
590 * Add the extent to the list of extents to be free at transaction end.
591 * The list is maintained sorted (by block number).
595 struct xfs_mount *mp,
596 struct xfs_defer_ops *dfops,
599 struct xfs_owner_info *oinfo)
601 struct xfs_extent_free_item *new; /* new element */
606 ASSERT(bno != NULLFSBLOCK);
608 ASSERT(len <= MAXEXTLEN);
609 ASSERT(!isnullstartblock(bno));
610 agno = XFS_FSB_TO_AGNO(mp, bno);
611 agbno = XFS_FSB_TO_AGBNO(mp, bno);
612 ASSERT(agno < mp->m_sb.sb_agcount);
613 ASSERT(agbno < mp->m_sb.sb_agblocks);
614 ASSERT(len < mp->m_sb.sb_agblocks);
615 ASSERT(agbno + len <= mp->m_sb.sb_agblocks);
617 ASSERT(xfs_bmap_free_item_zone != NULL);
619 new = kmem_zone_alloc(xfs_bmap_free_item_zone, KM_SLEEP);
620 new->xefi_startblock = bno;
621 new->xefi_blockcount = (xfs_extlen_t)len;
623 new->xefi_oinfo = *oinfo;
625 xfs_rmap_skip_owner_update(&new->xefi_oinfo);
626 trace_xfs_bmap_free_defer(mp, XFS_FSB_TO_AGNO(mp, bno), 0,
627 XFS_FSB_TO_AGBNO(mp, bno), len);
628 xfs_defer_add(dfops, XFS_DEFER_OPS_TYPE_FREE, &new->xefi_list);
632 * Inode fork format manipulation functions
636 * Transform a btree format file with only one leaf node, where the
637 * extents list will fit in the inode, into an extents format file.
638 * Since the file extents are already in-core, all we have to do is
639 * give up the space for the btree root and pitch the leaf block.
641 STATIC int /* error */
642 xfs_bmap_btree_to_extents(
643 xfs_trans_t *tp, /* transaction pointer */
644 xfs_inode_t *ip, /* incore inode pointer */
645 xfs_btree_cur_t *cur, /* btree cursor */
646 int *logflagsp, /* inode logging flags */
647 int whichfork) /* data or attr fork */
650 struct xfs_btree_block *cblock;/* child btree block */
651 xfs_fsblock_t cbno; /* child block number */
652 xfs_buf_t *cbp; /* child block's buffer */
653 int error; /* error return value */
654 xfs_ifork_t *ifp; /* inode fork data */
655 xfs_mount_t *mp; /* mount point structure */
656 __be64 *pp; /* ptr to block address */
657 struct xfs_btree_block *rblock;/* root btree block */
658 struct xfs_owner_info oinfo;
661 ifp = XFS_IFORK_PTR(ip, whichfork);
662 ASSERT(whichfork != XFS_COW_FORK);
663 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
664 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
665 rblock = ifp->if_broot;
666 ASSERT(be16_to_cpu(rblock->bb_level) == 1);
667 ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1);
668 ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1);
669 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes);
670 cbno = be64_to_cpu(*pp);
673 if ((error = xfs_btree_check_lptr(cur, cbno, 1)))
676 error = xfs_btree_read_bufl(mp, tp, cbno, 0, &cbp, XFS_BMAP_BTREE_REF,
680 cblock = XFS_BUF_TO_BLOCK(cbp);
681 if ((error = xfs_btree_check_block(cur, cblock, 0, cbp)))
683 xfs_rmap_ino_bmbt_owner(&oinfo, ip->i_ino, whichfork);
684 xfs_bmap_add_free(mp, cur->bc_private.b.dfops, cbno, 1, &oinfo);
685 ip->i_d.di_nblocks--;
686 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
687 xfs_trans_binval(tp, cbp);
688 if (cur->bc_bufs[0] == cbp)
689 cur->bc_bufs[0] = NULL;
690 xfs_iroot_realloc(ip, -1, whichfork);
691 ASSERT(ifp->if_broot == NULL);
692 ASSERT((ifp->if_flags & XFS_IFBROOT) == 0);
693 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
694 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
699 * Convert an extents-format file into a btree-format file.
700 * The new file will have a root block (in the inode) and a single child block.
702 STATIC int /* error */
703 xfs_bmap_extents_to_btree(
704 xfs_trans_t *tp, /* transaction pointer */
705 xfs_inode_t *ip, /* incore inode pointer */
706 xfs_fsblock_t *firstblock, /* first-block-allocated */
707 struct xfs_defer_ops *dfops, /* blocks freed in xaction */
708 xfs_btree_cur_t **curp, /* cursor returned to caller */
709 int wasdel, /* converting a delayed alloc */
710 int *logflagsp, /* inode logging flags */
711 int whichfork) /* data or attr fork */
713 struct xfs_btree_block *ablock; /* allocated (child) bt block */
714 xfs_buf_t *abp; /* buffer for ablock */
715 xfs_alloc_arg_t args; /* allocation arguments */
716 xfs_bmbt_rec_t *arp; /* child record pointer */
717 struct xfs_btree_block *block; /* btree root block */
718 xfs_btree_cur_t *cur; /* bmap btree cursor */
719 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
720 int error; /* error return value */
721 xfs_extnum_t i, cnt; /* extent record index */
722 xfs_ifork_t *ifp; /* inode fork pointer */
723 xfs_bmbt_key_t *kp; /* root block key pointer */
724 xfs_mount_t *mp; /* mount structure */
725 xfs_extnum_t nextents; /* number of file extents */
726 xfs_bmbt_ptr_t *pp; /* root block address pointer */
729 ASSERT(whichfork != XFS_COW_FORK);
730 ifp = XFS_IFORK_PTR(ip, whichfork);
731 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS);
734 * Make space in the inode incore.
736 xfs_iroot_realloc(ip, 1, whichfork);
737 ifp->if_flags |= XFS_IFBROOT;
742 block = ifp->if_broot;
743 if (xfs_sb_version_hascrc(&mp->m_sb))
744 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL,
745 XFS_BMAP_CRC_MAGIC, 1, 1, ip->i_ino,
746 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS);
748 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL,
749 XFS_BMAP_MAGIC, 1, 1, ip->i_ino,
750 XFS_BTREE_LONG_PTRS);
753 * Need a cursor. Can't allocate until bb_level is filled in.
755 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
756 cur->bc_private.b.firstblock = *firstblock;
757 cur->bc_private.b.dfops = dfops;
758 cur->bc_private.b.flags = wasdel ? XFS_BTCUR_BPRV_WASDEL : 0;
760 * Convert to a btree with two levels, one record in root.
762 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_BTREE);
763 memset(&args, 0, sizeof(args));
766 xfs_rmap_ino_bmbt_owner(&args.oinfo, ip->i_ino, whichfork);
767 args.firstblock = *firstblock;
768 if (*firstblock == NULLFSBLOCK) {
769 args.type = XFS_ALLOCTYPE_START_BNO;
770 args.fsbno = XFS_INO_TO_FSB(mp, ip->i_ino);
771 } else if (dfops->dop_low) {
773 args.type = XFS_ALLOCTYPE_START_BNO;
774 args.fsbno = *firstblock;
776 args.type = XFS_ALLOCTYPE_NEAR_BNO;
777 args.fsbno = *firstblock;
779 args.minlen = args.maxlen = args.prod = 1;
780 args.wasdel = wasdel;
782 if ((error = xfs_alloc_vextent(&args))) {
783 xfs_iroot_realloc(ip, -1, whichfork);
784 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
789 * During a CoW operation, the allocation and bmbt updates occur in
790 * different transactions. The mapping code tries to put new bmbt
791 * blocks near extents being mapped, but the only way to guarantee this
792 * is if the alloc and the mapping happen in a single transaction that
793 * has a block reservation. That isn't the case here, so if we run out
794 * of space we'll try again with another AG.
796 if (xfs_sb_version_hasreflink(&cur->bc_mp->m_sb) &&
797 args.fsbno == NULLFSBLOCK &&
798 args.type == XFS_ALLOCTYPE_NEAR_BNO) {
799 dfops->dop_low = true;
803 * Allocation can't fail, the space was reserved.
805 ASSERT(args.fsbno != NULLFSBLOCK);
806 ASSERT(*firstblock == NULLFSBLOCK ||
807 args.agno == XFS_FSB_TO_AGNO(mp, *firstblock) ||
809 args.agno > XFS_FSB_TO_AGNO(mp, *firstblock)));
810 *firstblock = cur->bc_private.b.firstblock = args.fsbno;
811 cur->bc_private.b.allocated++;
812 ip->i_d.di_nblocks++;
813 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, 1L);
814 abp = xfs_btree_get_bufl(mp, tp, args.fsbno, 0);
816 * Fill in the child block.
818 abp->b_ops = &xfs_bmbt_buf_ops;
819 ablock = XFS_BUF_TO_BLOCK(abp);
820 if (xfs_sb_version_hascrc(&mp->m_sb))
821 xfs_btree_init_block_int(mp, ablock, abp->b_bn,
822 XFS_BMAP_CRC_MAGIC, 0, 0, ip->i_ino,
823 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS);
825 xfs_btree_init_block_int(mp, ablock, abp->b_bn,
826 XFS_BMAP_MAGIC, 0, 0, ip->i_ino,
827 XFS_BTREE_LONG_PTRS);
829 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
830 nextents = xfs_iext_count(ifp);
831 for (cnt = i = 0; i < nextents; i++) {
832 ep = xfs_iext_get_ext(ifp, i);
833 if (!isnullstartblock(xfs_bmbt_get_startblock(ep))) {
834 arp->l0 = cpu_to_be64(ep->l0);
835 arp->l1 = cpu_to_be64(ep->l1);
839 ASSERT(cnt == XFS_IFORK_NEXTENTS(ip, whichfork));
840 xfs_btree_set_numrecs(ablock, cnt);
843 * Fill in the root key and pointer.
845 kp = XFS_BMBT_KEY_ADDR(mp, block, 1);
846 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
847 kp->br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(arp));
848 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, xfs_bmbt_get_maxrecs(cur,
849 be16_to_cpu(block->bb_level)));
850 *pp = cpu_to_be64(args.fsbno);
853 * Do all this logging at the end so that
854 * the root is at the right level.
856 xfs_btree_log_block(cur, abp, XFS_BB_ALL_BITS);
857 xfs_btree_log_recs(cur, abp, 1, be16_to_cpu(ablock->bb_numrecs));
858 ASSERT(*curp == NULL);
860 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fbroot(whichfork);
865 * Convert a local file to an extents file.
866 * This code is out of bounds for data forks of regular files,
867 * since the file data needs to get logged so things will stay consistent.
868 * (The bmap-level manipulations are ok, though).
871 xfs_bmap_local_to_extents_empty(
872 struct xfs_inode *ip,
875 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
877 ASSERT(whichfork != XFS_COW_FORK);
878 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
879 ASSERT(ifp->if_bytes == 0);
880 ASSERT(XFS_IFORK_NEXTENTS(ip, whichfork) == 0);
882 xfs_bmap_forkoff_reset(ip, whichfork);
883 ifp->if_flags &= ~XFS_IFINLINE;
884 ifp->if_flags |= XFS_IFEXTENTS;
885 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
889 STATIC int /* error */
890 xfs_bmap_local_to_extents(
891 xfs_trans_t *tp, /* transaction pointer */
892 xfs_inode_t *ip, /* incore inode pointer */
893 xfs_fsblock_t *firstblock, /* first block allocated in xaction */
894 xfs_extlen_t total, /* total blocks needed by transaction */
895 int *logflagsp, /* inode logging flags */
897 void (*init_fn)(struct xfs_trans *tp,
899 struct xfs_inode *ip,
900 struct xfs_ifork *ifp))
903 int flags; /* logging flags returned */
904 xfs_ifork_t *ifp; /* inode fork pointer */
905 xfs_alloc_arg_t args; /* allocation arguments */
906 xfs_buf_t *bp; /* buffer for extent block */
907 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
910 * We don't want to deal with the case of keeping inode data inline yet.
911 * So sending the data fork of a regular inode is invalid.
913 ASSERT(!(S_ISREG(VFS_I(ip)->i_mode) && whichfork == XFS_DATA_FORK));
914 ifp = XFS_IFORK_PTR(ip, whichfork);
915 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
917 if (!ifp->if_bytes) {
918 xfs_bmap_local_to_extents_empty(ip, whichfork);
919 flags = XFS_ILOG_CORE;
925 ASSERT((ifp->if_flags & (XFS_IFINLINE|XFS_IFEXTENTS|XFS_IFEXTIREC)) ==
927 memset(&args, 0, sizeof(args));
929 args.mp = ip->i_mount;
930 xfs_rmap_ino_owner(&args.oinfo, ip->i_ino, whichfork, 0);
931 args.firstblock = *firstblock;
933 * Allocate a block. We know we need only one, since the
934 * file currently fits in an inode.
936 if (*firstblock == NULLFSBLOCK) {
938 args.fsbno = XFS_INO_TO_FSB(args.mp, ip->i_ino);
939 args.type = XFS_ALLOCTYPE_START_BNO;
941 args.fsbno = *firstblock;
942 args.type = XFS_ALLOCTYPE_NEAR_BNO;
945 args.minlen = args.maxlen = args.prod = 1;
946 error = xfs_alloc_vextent(&args);
951 * During a CoW operation, the allocation and bmbt updates occur in
952 * different transactions. The mapping code tries to put new bmbt
953 * blocks near extents being mapped, but the only way to guarantee this
954 * is if the alloc and the mapping happen in a single transaction that
955 * has a block reservation. That isn't the case here, so if we run out
956 * of space we'll try again with another AG.
958 if (xfs_sb_version_hasreflink(&ip->i_mount->m_sb) &&
959 args.fsbno == NULLFSBLOCK &&
960 args.type == XFS_ALLOCTYPE_NEAR_BNO) {
963 /* Can't fail, the space was reserved. */
964 ASSERT(args.fsbno != NULLFSBLOCK);
965 ASSERT(args.len == 1);
966 *firstblock = args.fsbno;
967 bp = xfs_btree_get_bufl(args.mp, tp, args.fsbno, 0);
970 * Initialize the block, copy the data and log the remote buffer.
972 * The callout is responsible for logging because the remote format
973 * might differ from the local format and thus we don't know how much to
974 * log here. Note that init_fn must also set the buffer log item type
977 init_fn(tp, bp, ip, ifp);
979 /* account for the change in fork size */
980 xfs_idata_realloc(ip, -ifp->if_bytes, whichfork);
981 xfs_bmap_local_to_extents_empty(ip, whichfork);
982 flags |= XFS_ILOG_CORE;
984 xfs_iext_add(ifp, 0, 1);
985 ep = xfs_iext_get_ext(ifp, 0);
986 xfs_bmbt_set_allf(ep, 0, args.fsbno, 1, XFS_EXT_NORM);
987 trace_xfs_bmap_post_update(ip, 0,
988 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0,
990 XFS_IFORK_NEXT_SET(ip, whichfork, 1);
991 ip->i_d.di_nblocks = 1;
992 xfs_trans_mod_dquot_byino(tp, ip,
993 XFS_TRANS_DQ_BCOUNT, 1L);
994 flags |= xfs_ilog_fext(whichfork);
1002 * Called from xfs_bmap_add_attrfork to handle btree format files.
1004 STATIC int /* error */
1005 xfs_bmap_add_attrfork_btree(
1006 xfs_trans_t *tp, /* transaction pointer */
1007 xfs_inode_t *ip, /* incore inode pointer */
1008 xfs_fsblock_t *firstblock, /* first block allocated */
1009 struct xfs_defer_ops *dfops, /* blocks to free at commit */
1010 int *flags) /* inode logging flags */
1012 xfs_btree_cur_t *cur; /* btree cursor */
1013 int error; /* error return value */
1014 xfs_mount_t *mp; /* file system mount struct */
1015 int stat; /* newroot status */
1018 if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip))
1019 *flags |= XFS_ILOG_DBROOT;
1021 cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK);
1022 cur->bc_private.b.dfops = dfops;
1023 cur->bc_private.b.firstblock = *firstblock;
1024 if ((error = xfs_bmbt_lookup_ge(cur, 0, 0, 0, &stat)))
1026 /* must be at least one entry */
1027 XFS_WANT_CORRUPTED_GOTO(mp, stat == 1, error0);
1028 if ((error = xfs_btree_new_iroot(cur, flags, &stat)))
1031 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1034 *firstblock = cur->bc_private.b.firstblock;
1035 cur->bc_private.b.allocated = 0;
1036 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1040 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1045 * Called from xfs_bmap_add_attrfork to handle extents format files.
1047 STATIC int /* error */
1048 xfs_bmap_add_attrfork_extents(
1049 xfs_trans_t *tp, /* transaction pointer */
1050 xfs_inode_t *ip, /* incore inode pointer */
1051 xfs_fsblock_t *firstblock, /* first block allocated */
1052 struct xfs_defer_ops *dfops, /* blocks to free at commit */
1053 int *flags) /* inode logging flags */
1055 xfs_btree_cur_t *cur; /* bmap btree cursor */
1056 int error; /* error return value */
1058 if (ip->i_d.di_nextents * sizeof(xfs_bmbt_rec_t) <= XFS_IFORK_DSIZE(ip))
1061 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, dfops, &cur, 0,
1062 flags, XFS_DATA_FORK);
1064 cur->bc_private.b.allocated = 0;
1065 xfs_btree_del_cursor(cur,
1066 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
1072 * Called from xfs_bmap_add_attrfork to handle local format files. Each
1073 * different data fork content type needs a different callout to do the
1074 * conversion. Some are basic and only require special block initialisation
1075 * callouts for the data formating, others (directories) are so specialised they
1076 * handle everything themselves.
1078 * XXX (dgc): investigate whether directory conversion can use the generic
1079 * formatting callout. It should be possible - it's just a very complex
1082 STATIC int /* error */
1083 xfs_bmap_add_attrfork_local(
1084 xfs_trans_t *tp, /* transaction pointer */
1085 xfs_inode_t *ip, /* incore inode pointer */
1086 xfs_fsblock_t *firstblock, /* first block allocated */
1087 struct xfs_defer_ops *dfops, /* blocks to free at commit */
1088 int *flags) /* inode logging flags */
1090 xfs_da_args_t dargs; /* args for dir/attr code */
1092 if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip))
1095 if (S_ISDIR(VFS_I(ip)->i_mode)) {
1096 memset(&dargs, 0, sizeof(dargs));
1097 dargs.geo = ip->i_mount->m_dir_geo;
1099 dargs.firstblock = firstblock;
1100 dargs.dfops = dfops;
1101 dargs.total = dargs.geo->fsbcount;
1102 dargs.whichfork = XFS_DATA_FORK;
1104 return xfs_dir2_sf_to_block(&dargs);
1107 if (S_ISLNK(VFS_I(ip)->i_mode))
1108 return xfs_bmap_local_to_extents(tp, ip, firstblock, 1,
1109 flags, XFS_DATA_FORK,
1110 xfs_symlink_local_to_remote);
1112 /* should only be called for types that support local format data */
1114 return -EFSCORRUPTED;
1118 * Convert inode from non-attributed to attributed.
1119 * Must not be in a transaction, ip must not be locked.
1121 int /* error code */
1122 xfs_bmap_add_attrfork(
1123 xfs_inode_t *ip, /* incore inode pointer */
1124 int size, /* space new attribute needs */
1125 int rsvd) /* xact may use reserved blks */
1127 xfs_fsblock_t firstblock; /* 1st block/ag allocated */
1128 struct xfs_defer_ops dfops; /* freed extent records */
1129 xfs_mount_t *mp; /* mount structure */
1130 xfs_trans_t *tp; /* transaction pointer */
1131 int blks; /* space reservation */
1132 int version = 1; /* superblock attr version */
1133 int logflags; /* logging flags */
1134 int error; /* error return value */
1136 ASSERT(XFS_IFORK_Q(ip) == 0);
1139 ASSERT(!XFS_NOT_DQATTACHED(mp, ip));
1141 blks = XFS_ADDAFORK_SPACE_RES(mp);
1143 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_addafork, blks, 0,
1144 rsvd ? XFS_TRANS_RESERVE : 0, &tp);
1148 xfs_ilock(ip, XFS_ILOCK_EXCL);
1149 error = xfs_trans_reserve_quota_nblks(tp, ip, blks, 0, rsvd ?
1150 XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
1151 XFS_QMOPT_RES_REGBLKS);
1154 if (XFS_IFORK_Q(ip))
1156 if (ip->i_d.di_anextents != 0) {
1157 error = -EFSCORRUPTED;
1160 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS) {
1162 * For inodes coming from pre-6.2 filesystems.
1164 ASSERT(ip->i_d.di_aformat == 0);
1165 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
1168 xfs_trans_ijoin(tp, ip, 0);
1169 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
1171 switch (ip->i_d.di_format) {
1172 case XFS_DINODE_FMT_DEV:
1173 ip->i_d.di_forkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
1175 case XFS_DINODE_FMT_UUID:
1176 ip->i_d.di_forkoff = roundup(sizeof(uuid_t), 8) >> 3;
1178 case XFS_DINODE_FMT_LOCAL:
1179 case XFS_DINODE_FMT_EXTENTS:
1180 case XFS_DINODE_FMT_BTREE:
1181 ip->i_d.di_forkoff = xfs_attr_shortform_bytesfit(ip, size);
1182 if (!ip->i_d.di_forkoff)
1183 ip->i_d.di_forkoff = xfs_default_attroffset(ip) >> 3;
1184 else if (mp->m_flags & XFS_MOUNT_ATTR2)
1193 ASSERT(ip->i_afp == NULL);
1194 ip->i_afp = kmem_zone_zalloc(xfs_ifork_zone, KM_SLEEP);
1195 ip->i_afp->if_flags = XFS_IFEXTENTS;
1197 xfs_defer_init(&dfops, &firstblock);
1198 switch (ip->i_d.di_format) {
1199 case XFS_DINODE_FMT_LOCAL:
1200 error = xfs_bmap_add_attrfork_local(tp, ip, &firstblock, &dfops,
1203 case XFS_DINODE_FMT_EXTENTS:
1204 error = xfs_bmap_add_attrfork_extents(tp, ip, &firstblock,
1207 case XFS_DINODE_FMT_BTREE:
1208 error = xfs_bmap_add_attrfork_btree(tp, ip, &firstblock, &dfops,
1216 xfs_trans_log_inode(tp, ip, logflags);
1219 if (!xfs_sb_version_hasattr(&mp->m_sb) ||
1220 (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2)) {
1221 bool log_sb = false;
1223 spin_lock(&mp->m_sb_lock);
1224 if (!xfs_sb_version_hasattr(&mp->m_sb)) {
1225 xfs_sb_version_addattr(&mp->m_sb);
1228 if (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2) {
1229 xfs_sb_version_addattr2(&mp->m_sb);
1232 spin_unlock(&mp->m_sb_lock);
1237 error = xfs_defer_finish(&tp, &dfops, NULL);
1240 error = xfs_trans_commit(tp);
1241 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1245 xfs_defer_cancel(&dfops);
1247 xfs_trans_cancel(tp);
1248 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1253 * Internal and external extent tree search functions.
1257 * Read in the extents to if_extents.
1258 * All inode fields are set up by caller, we just traverse the btree
1259 * and copy the records in. If the file system cannot contain unwritten
1260 * extents, the records are checked for no "state" flags.
1263 xfs_bmap_read_extents(
1264 xfs_trans_t *tp, /* transaction pointer */
1265 xfs_inode_t *ip, /* incore inode */
1266 int whichfork) /* data or attr fork */
1268 struct xfs_btree_block *block; /* current btree block */
1269 xfs_fsblock_t bno; /* block # of "block" */
1270 xfs_buf_t *bp; /* buffer for "block" */
1271 int error; /* error return value */
1272 xfs_exntfmt_t exntf; /* XFS_EXTFMT_NOSTATE, if checking */
1273 xfs_extnum_t i, j; /* index into the extents list */
1274 xfs_ifork_t *ifp; /* fork structure */
1275 int level; /* btree level, for checking */
1276 xfs_mount_t *mp; /* file system mount structure */
1277 __be64 *pp; /* pointer to block address */
1279 xfs_extnum_t room; /* number of entries there's room for */
1283 ifp = XFS_IFORK_PTR(ip, whichfork);
1284 exntf = (whichfork != XFS_DATA_FORK) ? XFS_EXTFMT_NOSTATE :
1285 XFS_EXTFMT_INODE(ip);
1286 block = ifp->if_broot;
1288 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
1290 level = be16_to_cpu(block->bb_level);
1292 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
1293 bno = be64_to_cpu(*pp);
1294 ASSERT(bno != NULLFSBLOCK);
1295 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
1296 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
1298 * Go down the tree until leaf level is reached, following the first
1299 * pointer (leftmost) at each level.
1301 while (level-- > 0) {
1302 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
1303 XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops);
1306 block = XFS_BUF_TO_BLOCK(bp);
1309 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
1310 bno = be64_to_cpu(*pp);
1311 XFS_WANT_CORRUPTED_GOTO(mp,
1312 XFS_FSB_SANITY_CHECK(mp, bno), error0);
1313 xfs_trans_brelse(tp, bp);
1316 * Here with bp and block set to the leftmost leaf node in the tree.
1318 room = xfs_iext_count(ifp);
1321 * Loop over all leaf nodes. Copy information to the extent records.
1324 xfs_bmbt_rec_t *frp;
1325 xfs_fsblock_t nextbno;
1326 xfs_extnum_t num_recs;
1329 num_recs = xfs_btree_get_numrecs(block);
1330 if (unlikely(i + num_recs > room)) {
1331 ASSERT(i + num_recs <= room);
1332 xfs_warn(ip->i_mount,
1333 "corrupt dinode %Lu, (btree extents).",
1334 (unsigned long long) ip->i_ino);
1335 XFS_CORRUPTION_ERROR("xfs_bmap_read_extents(1)",
1336 XFS_ERRLEVEL_LOW, ip->i_mount, block);
1340 * Read-ahead the next leaf block, if any.
1342 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
1343 if (nextbno != NULLFSBLOCK)
1344 xfs_btree_reada_bufl(mp, nextbno, 1,
1347 * Copy records into the extent records.
1349 frp = XFS_BMBT_REC_ADDR(mp, block, 1);
1351 for (j = 0; j < num_recs; j++, i++, frp++) {
1352 xfs_bmbt_rec_host_t *trp = xfs_iext_get_ext(ifp, i);
1353 trp->l0 = be64_to_cpu(frp->l0);
1354 trp->l1 = be64_to_cpu(frp->l1);
1356 if (exntf == XFS_EXTFMT_NOSTATE) {
1358 * Check all attribute bmap btree records and
1359 * any "older" data bmap btree records for a
1360 * set bit in the "extent flag" position.
1362 if (unlikely(xfs_check_nostate_extents(ifp,
1363 start, num_recs))) {
1364 XFS_ERROR_REPORT("xfs_bmap_read_extents(2)",
1370 xfs_trans_brelse(tp, bp);
1373 * If we've reached the end, stop.
1375 if (bno == NULLFSBLOCK)
1377 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
1378 XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops);
1381 block = XFS_BUF_TO_BLOCK(bp);
1383 if (i != XFS_IFORK_NEXTENTS(ip, whichfork))
1384 return -EFSCORRUPTED;
1385 ASSERT(i == xfs_iext_count(ifp));
1386 XFS_BMAP_TRACE_EXLIST(ip, i, whichfork);
1389 xfs_trans_brelse(tp, bp);
1390 return -EFSCORRUPTED;
1394 * Returns the file-relative block number of the first unused block(s)
1395 * in the file with at least "len" logically contiguous blocks free.
1396 * This is the lowest-address hole if the file has holes, else the first block
1397 * past the end of file.
1398 * Return 0 if the file is currently local (in-inode).
1401 xfs_bmap_first_unused(
1402 xfs_trans_t *tp, /* transaction pointer */
1403 xfs_inode_t *ip, /* incore inode */
1404 xfs_extlen_t len, /* size of hole to find */
1405 xfs_fileoff_t *first_unused, /* unused block */
1406 int whichfork) /* data or attr fork */
1408 int error; /* error return value */
1409 int idx; /* extent record index */
1410 xfs_ifork_t *ifp; /* inode fork pointer */
1411 xfs_fileoff_t lastaddr; /* last block number seen */
1412 xfs_fileoff_t lowest; /* lowest useful block */
1413 xfs_fileoff_t max; /* starting useful block */
1414 xfs_fileoff_t off; /* offset for this block */
1415 xfs_extnum_t nextents; /* number of extent entries */
1417 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE ||
1418 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS ||
1419 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
1420 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
1424 ifp = XFS_IFORK_PTR(ip, whichfork);
1425 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
1426 (error = xfs_iread_extents(tp, ip, whichfork)))
1428 lowest = *first_unused;
1429 nextents = xfs_iext_count(ifp);
1430 for (idx = 0, lastaddr = 0, max = lowest; idx < nextents; idx++) {
1431 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx);
1432 off = xfs_bmbt_get_startoff(ep);
1434 * See if the hole before this extent will work.
1436 if (off >= lowest + len && off - max >= len) {
1437 *first_unused = max;
1440 lastaddr = off + xfs_bmbt_get_blockcount(ep);
1441 max = XFS_FILEOFF_MAX(lastaddr, lowest);
1443 *first_unused = max;
1448 * Returns the file-relative block number of the last block - 1 before
1449 * last_block (input value) in the file.
1450 * This is not based on i_size, it is based on the extent records.
1451 * Returns 0 for local files, as they do not have extent records.
1454 xfs_bmap_last_before(
1455 struct xfs_trans *tp, /* transaction pointer */
1456 struct xfs_inode *ip, /* incore inode */
1457 xfs_fileoff_t *last_block, /* last block */
1458 int whichfork) /* data or attr fork */
1460 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1461 struct xfs_bmbt_irec got;
1465 switch (XFS_IFORK_FORMAT(ip, whichfork)) {
1466 case XFS_DINODE_FMT_LOCAL:
1469 case XFS_DINODE_FMT_BTREE:
1470 case XFS_DINODE_FMT_EXTENTS:
1476 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
1477 error = xfs_iread_extents(tp, ip, whichfork);
1482 if (xfs_iext_lookup_extent(ip, ifp, *last_block - 1, &idx, &got)) {
1483 if (got.br_startoff <= *last_block - 1)
1487 if (xfs_iext_get_extent(ifp, idx - 1, &got)) {
1488 *last_block = got.br_startoff + got.br_blockcount;
1497 xfs_bmap_last_extent(
1498 struct xfs_trans *tp,
1499 struct xfs_inode *ip,
1501 struct xfs_bmbt_irec *rec,
1504 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1508 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
1509 error = xfs_iread_extents(tp, ip, whichfork);
1514 nextents = xfs_iext_count(ifp);
1515 if (nextents == 0) {
1520 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, nextents - 1), rec);
1526 * Check the last inode extent to determine whether this allocation will result
1527 * in blocks being allocated at the end of the file. When we allocate new data
1528 * blocks at the end of the file which do not start at the previous data block,
1529 * we will try to align the new blocks at stripe unit boundaries.
1531 * Returns 1 in bma->aeof if the file (fork) is empty as any new write will be
1532 * at, or past the EOF.
1536 struct xfs_bmalloca *bma,
1539 struct xfs_bmbt_irec rec;
1544 error = xfs_bmap_last_extent(NULL, bma->ip, whichfork, &rec,
1555 * Check if we are allocation or past the last extent, or at least into
1556 * the last delayed allocated extent.
1558 bma->aeof = bma->offset >= rec.br_startoff + rec.br_blockcount ||
1559 (bma->offset >= rec.br_startoff &&
1560 isnullstartblock(rec.br_startblock));
1565 * Returns the file-relative block number of the first block past eof in
1566 * the file. This is not based on i_size, it is based on the extent records.
1567 * Returns 0 for local files, as they do not have extent records.
1570 xfs_bmap_last_offset(
1571 struct xfs_inode *ip,
1572 xfs_fileoff_t *last_block,
1575 struct xfs_bmbt_irec rec;
1581 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL)
1584 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
1585 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
1588 error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, &is_empty);
1589 if (error || is_empty)
1592 *last_block = rec.br_startoff + rec.br_blockcount;
1597 * Returns whether the selected fork of the inode has exactly one
1598 * block or not. For the data fork we check this matches di_size,
1599 * implying the file's range is 0..bsize-1.
1601 int /* 1=>1 block, 0=>otherwise */
1603 xfs_inode_t *ip, /* incore inode */
1604 int whichfork) /* data or attr fork */
1606 xfs_bmbt_rec_host_t *ep; /* ptr to fork's extent */
1607 xfs_ifork_t *ifp; /* inode fork pointer */
1608 int rval; /* return value */
1609 xfs_bmbt_irec_t s; /* internal version of extent */
1612 if (whichfork == XFS_DATA_FORK)
1613 return XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize;
1615 if (XFS_IFORK_NEXTENTS(ip, whichfork) != 1)
1617 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
1619 ifp = XFS_IFORK_PTR(ip, whichfork);
1620 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
1621 ep = xfs_iext_get_ext(ifp, 0);
1622 xfs_bmbt_get_all(ep, &s);
1623 rval = s.br_startoff == 0 && s.br_blockcount == 1;
1624 if (rval && whichfork == XFS_DATA_FORK)
1625 ASSERT(XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize);
1630 * Extent tree manipulation functions used during allocation.
1634 * Convert a delayed allocation to a real allocation.
1636 STATIC int /* error */
1637 xfs_bmap_add_extent_delay_real(
1638 struct xfs_bmalloca *bma,
1641 struct xfs_bmbt_irec *new = &bma->got;
1642 int diff; /* temp value */
1643 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */
1644 int error; /* error return value */
1645 int i; /* temp state */
1646 xfs_ifork_t *ifp; /* inode fork pointer */
1647 xfs_fileoff_t new_endoff; /* end offset of new entry */
1648 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
1649 /* left is 0, right is 1, prev is 2 */
1650 int rval=0; /* return value (logging flags) */
1651 int state = 0;/* state bits, accessed thru macros */
1652 xfs_filblks_t da_new; /* new count del alloc blocks used */
1653 xfs_filblks_t da_old; /* old count del alloc blocks used */
1654 xfs_filblks_t temp=0; /* value for da_new calculations */
1655 xfs_filblks_t temp2=0;/* value for da_new calculations */
1656 int tmp_rval; /* partial logging flags */
1657 struct xfs_mount *mp;
1658 xfs_extnum_t *nextents;
1660 mp = bma->ip->i_mount;
1661 ifp = XFS_IFORK_PTR(bma->ip, whichfork);
1662 ASSERT(whichfork != XFS_ATTR_FORK);
1663 nextents = (whichfork == XFS_COW_FORK ? &bma->ip->i_cnextents :
1664 &bma->ip->i_d.di_nextents);
1666 ASSERT(bma->idx >= 0);
1667 ASSERT(bma->idx <= xfs_iext_count(ifp));
1668 ASSERT(!isnullstartblock(new->br_startblock));
1670 (bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL));
1672 XFS_STATS_INC(mp, xs_add_exlist);
1678 if (whichfork == XFS_COW_FORK)
1679 state |= BMAP_COWFORK;
1682 * Set up a bunch of variables to make the tests simpler.
1684 ep = xfs_iext_get_ext(ifp, bma->idx);
1685 xfs_bmbt_get_all(ep, &PREV);
1686 new_endoff = new->br_startoff + new->br_blockcount;
1687 ASSERT(PREV.br_startoff <= new->br_startoff);
1688 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
1690 da_old = startblockval(PREV.br_startblock);
1694 * Set flags determining what part of the previous delayed allocation
1695 * extent is being replaced by a real allocation.
1697 if (PREV.br_startoff == new->br_startoff)
1698 state |= BMAP_LEFT_FILLING;
1699 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
1700 state |= BMAP_RIGHT_FILLING;
1703 * Check and set flags if this segment has a left neighbor.
1704 * Don't set contiguous if the combined extent would be too large.
1707 state |= BMAP_LEFT_VALID;
1708 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &LEFT);
1710 if (isnullstartblock(LEFT.br_startblock))
1711 state |= BMAP_LEFT_DELAY;
1714 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1715 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
1716 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
1717 LEFT.br_state == new->br_state &&
1718 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1719 state |= BMAP_LEFT_CONTIG;
1722 * Check and set flags if this segment has a right neighbor.
1723 * Don't set contiguous if the combined extent would be too large.
1724 * Also check for all-three-contiguous being too large.
1726 if (bma->idx < xfs_iext_count(ifp) - 1) {
1727 state |= BMAP_RIGHT_VALID;
1728 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx + 1), &RIGHT);
1730 if (isnullstartblock(RIGHT.br_startblock))
1731 state |= BMAP_RIGHT_DELAY;
1734 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1735 new_endoff == RIGHT.br_startoff &&
1736 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
1737 new->br_state == RIGHT.br_state &&
1738 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
1739 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1740 BMAP_RIGHT_FILLING)) !=
1741 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1742 BMAP_RIGHT_FILLING) ||
1743 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
1745 state |= BMAP_RIGHT_CONTIG;
1749 * Switch out based on the FILLING and CONTIG state bits.
1751 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1752 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
1753 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1754 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1756 * Filling in all of a previously delayed allocation extent.
1757 * The left and right neighbors are both contiguous with new.
1760 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1761 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
1762 LEFT.br_blockcount + PREV.br_blockcount +
1763 RIGHT.br_blockcount);
1764 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1766 xfs_iext_remove(bma->ip, bma->idx + 1, 2, state);
1768 if (bma->cur == NULL)
1769 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1771 rval = XFS_ILOG_CORE;
1772 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
1773 RIGHT.br_startblock,
1774 RIGHT.br_blockcount, &i);
1777 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1778 error = xfs_btree_delete(bma->cur, &i);
1781 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1782 error = xfs_btree_decrement(bma->cur, 0, &i);
1785 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1786 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
1788 LEFT.br_blockcount +
1789 PREV.br_blockcount +
1790 RIGHT.br_blockcount, LEFT.br_state);
1796 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1798 * Filling in all of a previously delayed allocation extent.
1799 * The left neighbor is contiguous, the right is not.
1803 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1804 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
1805 LEFT.br_blockcount + PREV.br_blockcount);
1806 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1808 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
1809 if (bma->cur == NULL)
1810 rval = XFS_ILOG_DEXT;
1813 error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff,
1814 LEFT.br_startblock, LEFT.br_blockcount,
1818 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1819 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
1821 LEFT.br_blockcount +
1822 PREV.br_blockcount, LEFT.br_state);
1828 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1830 * Filling in all of a previously delayed allocation extent.
1831 * The right neighbor is contiguous, the left is not.
1833 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1834 xfs_bmbt_set_startblock(ep, new->br_startblock);
1835 xfs_bmbt_set_blockcount(ep,
1836 PREV.br_blockcount + RIGHT.br_blockcount);
1837 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1839 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
1840 if (bma->cur == NULL)
1841 rval = XFS_ILOG_DEXT;
1844 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
1845 RIGHT.br_startblock,
1846 RIGHT.br_blockcount, &i);
1849 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1850 error = xfs_bmbt_update(bma->cur, PREV.br_startoff,
1852 PREV.br_blockcount +
1853 RIGHT.br_blockcount, PREV.br_state);
1859 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
1861 * Filling in all of a previously delayed allocation extent.
1862 * Neither the left nor right neighbors are contiguous with
1865 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1866 xfs_bmbt_set_startblock(ep, new->br_startblock);
1867 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1870 if (bma->cur == NULL)
1871 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1873 rval = XFS_ILOG_CORE;
1874 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
1875 new->br_startblock, new->br_blockcount,
1879 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
1880 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
1881 error = xfs_btree_insert(bma->cur, &i);
1884 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1888 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
1890 * Filling in the first part of a previous delayed allocation.
1891 * The left neighbor is contiguous.
1893 trace_xfs_bmap_pre_update(bma->ip, bma->idx - 1, state, _THIS_IP_);
1894 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx - 1),
1895 LEFT.br_blockcount + new->br_blockcount);
1896 xfs_bmbt_set_startoff(ep,
1897 PREV.br_startoff + new->br_blockcount);
1898 trace_xfs_bmap_post_update(bma->ip, bma->idx - 1, state, _THIS_IP_);
1900 temp = PREV.br_blockcount - new->br_blockcount;
1901 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1902 xfs_bmbt_set_blockcount(ep, temp);
1903 if (bma->cur == NULL)
1904 rval = XFS_ILOG_DEXT;
1907 error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff,
1908 LEFT.br_startblock, LEFT.br_blockcount,
1912 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1913 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
1915 LEFT.br_blockcount +
1921 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1922 startblockval(PREV.br_startblock));
1923 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
1924 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1929 case BMAP_LEFT_FILLING:
1931 * Filling in the first part of a previous delayed allocation.
1932 * The left neighbor is not contiguous.
1934 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1935 xfs_bmbt_set_startoff(ep, new_endoff);
1936 temp = PREV.br_blockcount - new->br_blockcount;
1937 xfs_bmbt_set_blockcount(ep, temp);
1938 xfs_iext_insert(bma->ip, bma->idx, 1, new, state);
1940 if (bma->cur == NULL)
1941 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1943 rval = XFS_ILOG_CORE;
1944 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
1945 new->br_startblock, new->br_blockcount,
1949 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
1950 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
1951 error = xfs_btree_insert(bma->cur, &i);
1954 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1957 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
1958 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
1959 bma->firstblock, bma->dfops,
1960 &bma->cur, 1, &tmp_rval, whichfork);
1965 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1966 startblockval(PREV.br_startblock) -
1967 (bma->cur ? bma->cur->bc_private.b.allocated : 0));
1968 ep = xfs_iext_get_ext(ifp, bma->idx + 1);
1969 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
1970 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
1973 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1975 * Filling in the last part of a previous delayed allocation.
1976 * The right neighbor is contiguous with the new allocation.
1978 temp = PREV.br_blockcount - new->br_blockcount;
1979 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
1980 xfs_bmbt_set_blockcount(ep, temp);
1981 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx + 1),
1982 new->br_startoff, new->br_startblock,
1983 new->br_blockcount + RIGHT.br_blockcount,
1985 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
1986 if (bma->cur == NULL)
1987 rval = XFS_ILOG_DEXT;
1990 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
1991 RIGHT.br_startblock,
1992 RIGHT.br_blockcount, &i);
1995 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1996 error = xfs_bmbt_update(bma->cur, new->br_startoff,
1998 new->br_blockcount +
1999 RIGHT.br_blockcount,
2005 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
2006 startblockval(PREV.br_startblock));
2007 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
2008 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
2009 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2014 case BMAP_RIGHT_FILLING:
2016 * Filling in the last part of a previous delayed allocation.
2017 * The right neighbor is not contiguous.
2019 temp = PREV.br_blockcount - new->br_blockcount;
2020 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
2021 xfs_bmbt_set_blockcount(ep, temp);
2022 xfs_iext_insert(bma->ip, bma->idx + 1, 1, new, state);
2024 if (bma->cur == NULL)
2025 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2027 rval = XFS_ILOG_CORE;
2028 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
2029 new->br_startblock, new->br_blockcount,
2033 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2034 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
2035 error = xfs_btree_insert(bma->cur, &i);
2038 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2041 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
2042 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2043 bma->firstblock, bma->dfops, &bma->cur, 1,
2044 &tmp_rval, whichfork);
2049 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
2050 startblockval(PREV.br_startblock) -
2051 (bma->cur ? bma->cur->bc_private.b.allocated : 0));
2052 ep = xfs_iext_get_ext(ifp, bma->idx);
2053 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
2054 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2061 * Filling in the middle part of a previous delayed allocation.
2062 * Contiguity is impossible here.
2063 * This case is avoided almost all the time.
2065 * We start with a delayed allocation:
2067 * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+
2070 * and we are allocating:
2071 * +rrrrrrrrrrrrrrrrr+
2074 * and we set it up for insertion as:
2075 * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+
2077 * PREV @ idx LEFT RIGHT
2078 * inserted at idx + 1
2080 temp = new->br_startoff - PREV.br_startoff;
2081 temp2 = PREV.br_startoff + PREV.br_blockcount - new_endoff;
2082 trace_xfs_bmap_pre_update(bma->ip, bma->idx, 0, _THIS_IP_);
2083 xfs_bmbt_set_blockcount(ep, temp); /* truncate PREV */
2085 RIGHT.br_state = PREV.br_state;
2086 RIGHT.br_startblock = nullstartblock(
2087 (int)xfs_bmap_worst_indlen(bma->ip, temp2));
2088 RIGHT.br_startoff = new_endoff;
2089 RIGHT.br_blockcount = temp2;
2090 /* insert LEFT (r[0]) and RIGHT (r[1]) at the same time */
2091 xfs_iext_insert(bma->ip, bma->idx + 1, 2, &LEFT, state);
2093 if (bma->cur == NULL)
2094 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2096 rval = XFS_ILOG_CORE;
2097 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
2098 new->br_startblock, new->br_blockcount,
2102 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2103 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
2104 error = xfs_btree_insert(bma->cur, &i);
2107 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2110 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
2111 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2112 bma->firstblock, bma->dfops, &bma->cur,
2113 1, &tmp_rval, whichfork);
2118 temp = xfs_bmap_worst_indlen(bma->ip, temp);
2119 temp2 = xfs_bmap_worst_indlen(bma->ip, temp2);
2120 diff = (int)(temp + temp2 - startblockval(PREV.br_startblock) -
2121 (bma->cur ? bma->cur->bc_private.b.allocated : 0));
2123 error = xfs_mod_fdblocks(bma->ip->i_mount,
2124 -((int64_t)diff), false);
2130 ep = xfs_iext_get_ext(ifp, bma->idx);
2131 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2132 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2133 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 2, state, _THIS_IP_);
2134 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, bma->idx + 2),
2135 nullstartblock((int)temp2));
2136 trace_xfs_bmap_post_update(bma->ip, bma->idx + 2, state, _THIS_IP_);
2139 da_new = temp + temp2;
2142 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2143 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2144 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
2145 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2146 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2147 case BMAP_LEFT_CONTIG:
2148 case BMAP_RIGHT_CONTIG:
2150 * These cases are all impossible.
2155 /* add reverse mapping */
2156 error = xfs_rmap_map_extent(mp, bma->dfops, bma->ip, whichfork, new);
2160 /* convert to a btree if necessary */
2161 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
2162 int tmp_logflags; /* partial log flag return val */
2164 ASSERT(bma->cur == NULL);
2165 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2166 bma->firstblock, bma->dfops, &bma->cur,
2167 da_old > 0, &tmp_logflags, whichfork);
2168 bma->logflags |= tmp_logflags;
2173 /* adjust for changes in reserved delayed indirect blocks */
2174 if (da_old || da_new) {
2177 temp += bma->cur->bc_private.b.allocated;
2178 ASSERT(temp <= da_old);
2180 xfs_mod_fdblocks(bma->ip->i_mount,
2181 (int64_t)(da_old - temp), false);
2184 /* clear out the allocated field, done with it now in any case. */
2186 bma->cur->bc_private.b.allocated = 0;
2188 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork);
2190 if (whichfork != XFS_COW_FORK)
2191 bma->logflags |= rval;
2199 * Convert an unwritten allocation to a real allocation or vice versa.
2201 STATIC int /* error */
2202 xfs_bmap_add_extent_unwritten_real(
2203 struct xfs_trans *tp,
2204 xfs_inode_t *ip, /* incore inode pointer */
2205 xfs_extnum_t *idx, /* extent number to update/insert */
2206 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
2207 xfs_bmbt_irec_t *new, /* new data to add to file extents */
2208 xfs_fsblock_t *first, /* pointer to firstblock variable */
2209 struct xfs_defer_ops *dfops, /* list of extents to be freed */
2210 int *logflagsp) /* inode logging flags */
2212 xfs_btree_cur_t *cur; /* btree cursor */
2213 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */
2214 int error; /* error return value */
2215 int i; /* temp state */
2216 xfs_ifork_t *ifp; /* inode fork pointer */
2217 xfs_fileoff_t new_endoff; /* end offset of new entry */
2218 xfs_exntst_t newext; /* new extent state */
2219 xfs_exntst_t oldext; /* old extent state */
2220 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
2221 /* left is 0, right is 1, prev is 2 */
2222 int rval=0; /* return value (logging flags) */
2223 int state = 0;/* state bits, accessed thru macros */
2224 struct xfs_mount *mp = tp->t_mountp;
2229 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
2232 ASSERT(*idx <= xfs_iext_count(ifp));
2233 ASSERT(!isnullstartblock(new->br_startblock));
2235 XFS_STATS_INC(mp, xs_add_exlist);
2242 * Set up a bunch of variables to make the tests simpler.
2245 ep = xfs_iext_get_ext(ifp, *idx);
2246 xfs_bmbt_get_all(ep, &PREV);
2247 newext = new->br_state;
2248 oldext = (newext == XFS_EXT_UNWRITTEN) ?
2249 XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
2250 ASSERT(PREV.br_state == oldext);
2251 new_endoff = new->br_startoff + new->br_blockcount;
2252 ASSERT(PREV.br_startoff <= new->br_startoff);
2253 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
2256 * Set flags determining what part of the previous oldext allocation
2257 * extent is being replaced by a newext allocation.
2259 if (PREV.br_startoff == new->br_startoff)
2260 state |= BMAP_LEFT_FILLING;
2261 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
2262 state |= BMAP_RIGHT_FILLING;
2265 * Check and set flags if this segment has a left neighbor.
2266 * Don't set contiguous if the combined extent would be too large.
2269 state |= BMAP_LEFT_VALID;
2270 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT);
2272 if (isnullstartblock(LEFT.br_startblock))
2273 state |= BMAP_LEFT_DELAY;
2276 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
2277 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
2278 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
2279 LEFT.br_state == newext &&
2280 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2281 state |= BMAP_LEFT_CONTIG;
2284 * Check and set flags if this segment has a right neighbor.
2285 * Don't set contiguous if the combined extent would be too large.
2286 * Also check for all-three-contiguous being too large.
2288 if (*idx < xfs_iext_count(&ip->i_df) - 1) {
2289 state |= BMAP_RIGHT_VALID;
2290 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT);
2291 if (isnullstartblock(RIGHT.br_startblock))
2292 state |= BMAP_RIGHT_DELAY;
2295 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
2296 new_endoff == RIGHT.br_startoff &&
2297 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
2298 newext == RIGHT.br_state &&
2299 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
2300 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
2301 BMAP_RIGHT_FILLING)) !=
2302 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
2303 BMAP_RIGHT_FILLING) ||
2304 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
2306 state |= BMAP_RIGHT_CONTIG;
2309 * Switch out based on the FILLING and CONTIG state bits.
2311 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
2312 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
2313 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
2314 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2316 * Setting all of a previous oldext extent to newext.
2317 * The left and right neighbors are both contiguous with new.
2321 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2322 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
2323 LEFT.br_blockcount + PREV.br_blockcount +
2324 RIGHT.br_blockcount);
2325 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2327 xfs_iext_remove(ip, *idx + 1, 2, state);
2328 ip->i_d.di_nextents -= 2;
2330 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2332 rval = XFS_ILOG_CORE;
2333 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
2334 RIGHT.br_startblock,
2335 RIGHT.br_blockcount, &i)))
2337 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2338 if ((error = xfs_btree_delete(cur, &i)))
2340 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2341 if ((error = xfs_btree_decrement(cur, 0, &i)))
2343 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2344 if ((error = xfs_btree_delete(cur, &i)))
2346 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2347 if ((error = xfs_btree_decrement(cur, 0, &i)))
2349 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2350 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
2352 LEFT.br_blockcount + PREV.br_blockcount +
2353 RIGHT.br_blockcount, LEFT.br_state)))
2358 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2360 * Setting all of a previous oldext extent to newext.
2361 * The left neighbor is contiguous, the right is not.
2365 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2366 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
2367 LEFT.br_blockcount + PREV.br_blockcount);
2368 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2370 xfs_iext_remove(ip, *idx + 1, 1, state);
2371 ip->i_d.di_nextents--;
2373 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2375 rval = XFS_ILOG_CORE;
2376 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2377 PREV.br_startblock, PREV.br_blockcount,
2380 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2381 if ((error = xfs_btree_delete(cur, &i)))
2383 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2384 if ((error = xfs_btree_decrement(cur, 0, &i)))
2386 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2387 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
2389 LEFT.br_blockcount + PREV.br_blockcount,
2395 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2397 * Setting all of a previous oldext extent to newext.
2398 * The right neighbor is contiguous, the left is not.
2400 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2401 xfs_bmbt_set_blockcount(ep,
2402 PREV.br_blockcount + RIGHT.br_blockcount);
2403 xfs_bmbt_set_state(ep, newext);
2404 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2405 xfs_iext_remove(ip, *idx + 1, 1, state);
2406 ip->i_d.di_nextents--;
2408 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2410 rval = XFS_ILOG_CORE;
2411 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
2412 RIGHT.br_startblock,
2413 RIGHT.br_blockcount, &i)))
2415 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2416 if ((error = xfs_btree_delete(cur, &i)))
2418 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2419 if ((error = xfs_btree_decrement(cur, 0, &i)))
2421 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2422 if ((error = xfs_bmbt_update(cur, new->br_startoff,
2424 new->br_blockcount + RIGHT.br_blockcount,
2430 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
2432 * Setting all of a previous oldext extent to newext.
2433 * Neither the left nor right neighbors are contiguous with
2436 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2437 xfs_bmbt_set_state(ep, newext);
2438 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2441 rval = XFS_ILOG_DEXT;
2444 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
2445 new->br_startblock, new->br_blockcount,
2448 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2449 if ((error = xfs_bmbt_update(cur, new->br_startoff,
2450 new->br_startblock, new->br_blockcount,
2456 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
2458 * Setting the first part of a previous oldext extent to newext.
2459 * The left neighbor is contiguous.
2461 trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_);
2462 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1),
2463 LEFT.br_blockcount + new->br_blockcount);
2464 xfs_bmbt_set_startoff(ep,
2465 PREV.br_startoff + new->br_blockcount);
2466 trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_);
2468 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2469 xfs_bmbt_set_startblock(ep,
2470 new->br_startblock + new->br_blockcount);
2471 xfs_bmbt_set_blockcount(ep,
2472 PREV.br_blockcount - new->br_blockcount);
2473 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2478 rval = XFS_ILOG_DEXT;
2481 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2482 PREV.br_startblock, PREV.br_blockcount,
2485 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2486 if ((error = xfs_bmbt_update(cur,
2487 PREV.br_startoff + new->br_blockcount,
2488 PREV.br_startblock + new->br_blockcount,
2489 PREV.br_blockcount - new->br_blockcount,
2492 if ((error = xfs_btree_decrement(cur, 0, &i)))
2494 error = xfs_bmbt_update(cur, LEFT.br_startoff,
2496 LEFT.br_blockcount + new->br_blockcount,
2503 case BMAP_LEFT_FILLING:
2505 * Setting the first part of a previous oldext extent to newext.
2506 * The left neighbor is not contiguous.
2508 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2509 ASSERT(ep && xfs_bmbt_get_state(ep) == oldext);
2510 xfs_bmbt_set_startoff(ep, new_endoff);
2511 xfs_bmbt_set_blockcount(ep,
2512 PREV.br_blockcount - new->br_blockcount);
2513 xfs_bmbt_set_startblock(ep,
2514 new->br_startblock + new->br_blockcount);
2515 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2517 xfs_iext_insert(ip, *idx, 1, new, state);
2518 ip->i_d.di_nextents++;
2520 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2522 rval = XFS_ILOG_CORE;
2523 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2524 PREV.br_startblock, PREV.br_blockcount,
2527 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2528 if ((error = xfs_bmbt_update(cur,
2529 PREV.br_startoff + new->br_blockcount,
2530 PREV.br_startblock + new->br_blockcount,
2531 PREV.br_blockcount - new->br_blockcount,
2534 cur->bc_rec.b = *new;
2535 if ((error = xfs_btree_insert(cur, &i)))
2537 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2541 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2543 * Setting the last part of a previous oldext extent to newext.
2544 * The right neighbor is contiguous with the new allocation.
2546 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2547 xfs_bmbt_set_blockcount(ep,
2548 PREV.br_blockcount - new->br_blockcount);
2549 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2553 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2554 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
2555 new->br_startoff, new->br_startblock,
2556 new->br_blockcount + RIGHT.br_blockcount, newext);
2557 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2560 rval = XFS_ILOG_DEXT;
2563 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2565 PREV.br_blockcount, &i)))
2567 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2568 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
2570 PREV.br_blockcount - new->br_blockcount,
2573 if ((error = xfs_btree_increment(cur, 0, &i)))
2575 if ((error = xfs_bmbt_update(cur, new->br_startoff,
2577 new->br_blockcount + RIGHT.br_blockcount,
2583 case BMAP_RIGHT_FILLING:
2585 * Setting the last part of a previous oldext extent to newext.
2586 * The right neighbor is not contiguous.
2588 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2589 xfs_bmbt_set_blockcount(ep,
2590 PREV.br_blockcount - new->br_blockcount);
2591 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2594 xfs_iext_insert(ip, *idx, 1, new, state);
2596 ip->i_d.di_nextents++;
2598 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2600 rval = XFS_ILOG_CORE;
2601 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2602 PREV.br_startblock, PREV.br_blockcount,
2605 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2606 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
2608 PREV.br_blockcount - new->br_blockcount,
2611 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
2612 new->br_startblock, new->br_blockcount,
2615 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2616 cur->bc_rec.b.br_state = XFS_EXT_NORM;
2617 if ((error = xfs_btree_insert(cur, &i)))
2619 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2625 * Setting the middle part of a previous oldext extent to
2626 * newext. Contiguity is impossible here.
2627 * One extent becomes three extents.
2629 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2630 xfs_bmbt_set_blockcount(ep,
2631 new->br_startoff - PREV.br_startoff);
2632 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2635 r[1].br_startoff = new_endoff;
2636 r[1].br_blockcount =
2637 PREV.br_startoff + PREV.br_blockcount - new_endoff;
2638 r[1].br_startblock = new->br_startblock + new->br_blockcount;
2639 r[1].br_state = oldext;
2642 xfs_iext_insert(ip, *idx, 2, &r[0], state);
2644 ip->i_d.di_nextents += 2;
2646 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2648 rval = XFS_ILOG_CORE;
2649 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2650 PREV.br_startblock, PREV.br_blockcount,
2653 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2654 /* new right extent - oldext */
2655 if ((error = xfs_bmbt_update(cur, r[1].br_startoff,
2656 r[1].br_startblock, r[1].br_blockcount,
2659 /* new left extent - oldext */
2660 cur->bc_rec.b = PREV;
2661 cur->bc_rec.b.br_blockcount =
2662 new->br_startoff - PREV.br_startoff;
2663 if ((error = xfs_btree_insert(cur, &i)))
2665 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2667 * Reset the cursor to the position of the new extent
2668 * we are about to insert as we can't trust it after
2669 * the previous insert.
2671 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
2672 new->br_startblock, new->br_blockcount,
2675 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2676 /* new middle extent - newext */
2677 cur->bc_rec.b.br_state = new->br_state;
2678 if ((error = xfs_btree_insert(cur, &i)))
2680 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2684 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2685 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2686 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
2687 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2688 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2689 case BMAP_LEFT_CONTIG:
2690 case BMAP_RIGHT_CONTIG:
2692 * These cases are all impossible.
2697 /* update reverse mappings */
2698 error = xfs_rmap_convert_extent(mp, dfops, ip, XFS_DATA_FORK, new);
2702 /* convert to a btree if necessary */
2703 if (xfs_bmap_needs_btree(ip, XFS_DATA_FORK)) {
2704 int tmp_logflags; /* partial log flag return val */
2706 ASSERT(cur == NULL);
2707 error = xfs_bmap_extents_to_btree(tp, ip, first, dfops, &cur,
2708 0, &tmp_logflags, XFS_DATA_FORK);
2709 *logflagsp |= tmp_logflags;
2714 /* clear out the allocated field, done with it now in any case. */
2716 cur->bc_private.b.allocated = 0;
2720 xfs_bmap_check_leaf_extents(*curp, ip, XFS_DATA_FORK);
2730 * Convert a hole to a delayed allocation.
2733 xfs_bmap_add_extent_hole_delay(
2734 xfs_inode_t *ip, /* incore inode pointer */
2736 xfs_extnum_t *idx, /* extent number to update/insert */
2737 xfs_bmbt_irec_t *new) /* new data to add to file extents */
2739 xfs_ifork_t *ifp; /* inode fork pointer */
2740 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2741 xfs_filblks_t newlen=0; /* new indirect size */
2742 xfs_filblks_t oldlen=0; /* old indirect size */
2743 xfs_bmbt_irec_t right; /* right neighbor extent entry */
2744 int state; /* state bits, accessed thru macros */
2745 xfs_filblks_t temp=0; /* temp for indirect calculations */
2747 ifp = XFS_IFORK_PTR(ip, whichfork);
2749 if (whichfork == XFS_COW_FORK)
2750 state |= BMAP_COWFORK;
2751 ASSERT(isnullstartblock(new->br_startblock));
2754 * Check and set flags if this segment has a left neighbor
2757 state |= BMAP_LEFT_VALID;
2758 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left);
2760 if (isnullstartblock(left.br_startblock))
2761 state |= BMAP_LEFT_DELAY;
2765 * Check and set flags if the current (right) segment exists.
2766 * If it doesn't exist, we're converting the hole at end-of-file.
2768 if (*idx < xfs_iext_count(ifp)) {
2769 state |= BMAP_RIGHT_VALID;
2770 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right);
2772 if (isnullstartblock(right.br_startblock))
2773 state |= BMAP_RIGHT_DELAY;
2777 * Set contiguity flags on the left and right neighbors.
2778 * Don't let extents get too large, even if the pieces are contiguous.
2780 if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) &&
2781 left.br_startoff + left.br_blockcount == new->br_startoff &&
2782 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2783 state |= BMAP_LEFT_CONTIG;
2785 if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) &&
2786 new->br_startoff + new->br_blockcount == right.br_startoff &&
2787 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
2788 (!(state & BMAP_LEFT_CONTIG) ||
2789 (left.br_blockcount + new->br_blockcount +
2790 right.br_blockcount <= MAXEXTLEN)))
2791 state |= BMAP_RIGHT_CONTIG;
2794 * Switch out based on the contiguity flags.
2796 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
2797 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2799 * New allocation is contiguous with delayed allocations
2800 * on the left and on the right.
2801 * Merge all three into a single extent record.
2804 temp = left.br_blockcount + new->br_blockcount +
2805 right.br_blockcount;
2807 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2808 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
2809 oldlen = startblockval(left.br_startblock) +
2810 startblockval(new->br_startblock) +
2811 startblockval(right.br_startblock);
2812 newlen = xfs_bmap_worst_indlen(ip, temp);
2813 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
2814 nullstartblock((int)newlen));
2815 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2817 xfs_iext_remove(ip, *idx + 1, 1, state);
2820 case BMAP_LEFT_CONTIG:
2822 * New allocation is contiguous with a delayed allocation
2824 * Merge the new allocation with the left neighbor.
2827 temp = left.br_blockcount + new->br_blockcount;
2829 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2830 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
2831 oldlen = startblockval(left.br_startblock) +
2832 startblockval(new->br_startblock);
2833 newlen = xfs_bmap_worst_indlen(ip, temp);
2834 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
2835 nullstartblock((int)newlen));
2836 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2839 case BMAP_RIGHT_CONTIG:
2841 * New allocation is contiguous with a delayed allocation
2843 * Merge the new allocation with the right neighbor.
2845 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2846 temp = new->br_blockcount + right.br_blockcount;
2847 oldlen = startblockval(new->br_startblock) +
2848 startblockval(right.br_startblock);
2849 newlen = xfs_bmap_worst_indlen(ip, temp);
2850 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
2852 nullstartblock((int)newlen), temp, right.br_state);
2853 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2858 * New allocation is not contiguous with another
2859 * delayed allocation.
2860 * Insert a new entry.
2862 oldlen = newlen = 0;
2863 xfs_iext_insert(ip, *idx, 1, new, state);
2866 if (oldlen != newlen) {
2867 ASSERT(oldlen > newlen);
2868 xfs_mod_fdblocks(ip->i_mount, (int64_t)(oldlen - newlen),
2871 * Nothing to do for disk quota accounting here.
2877 * Convert a hole to a real allocation.
2879 STATIC int /* error */
2880 xfs_bmap_add_extent_hole_real(
2881 struct xfs_bmalloca *bma,
2884 struct xfs_bmbt_irec *new = &bma->got;
2885 int error; /* error return value */
2886 int i; /* temp state */
2887 xfs_ifork_t *ifp; /* inode fork pointer */
2888 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2889 xfs_bmbt_irec_t right; /* right neighbor extent entry */
2890 int rval=0; /* return value (logging flags) */
2891 int state; /* state bits, accessed thru macros */
2892 struct xfs_mount *mp;
2894 mp = bma->ip->i_mount;
2895 ifp = XFS_IFORK_PTR(bma->ip, whichfork);
2897 ASSERT(bma->idx >= 0);
2898 ASSERT(bma->idx <= xfs_iext_count(ifp));
2899 ASSERT(!isnullstartblock(new->br_startblock));
2901 !(bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL));
2902 ASSERT(whichfork != XFS_COW_FORK);
2904 XFS_STATS_INC(mp, xs_add_exlist);
2907 if (whichfork == XFS_ATTR_FORK)
2908 state |= BMAP_ATTRFORK;
2911 * Check and set flags if this segment has a left neighbor.
2914 state |= BMAP_LEFT_VALID;
2915 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &left);
2916 if (isnullstartblock(left.br_startblock))
2917 state |= BMAP_LEFT_DELAY;
2921 * Check and set flags if this segment has a current value.
2922 * Not true if we're inserting into the "hole" at eof.
2924 if (bma->idx < xfs_iext_count(ifp)) {
2925 state |= BMAP_RIGHT_VALID;
2926 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &right);
2927 if (isnullstartblock(right.br_startblock))
2928 state |= BMAP_RIGHT_DELAY;
2932 * We're inserting a real allocation between "left" and "right".
2933 * Set the contiguity flags. Don't let extents get too large.
2935 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
2936 left.br_startoff + left.br_blockcount == new->br_startoff &&
2937 left.br_startblock + left.br_blockcount == new->br_startblock &&
2938 left.br_state == new->br_state &&
2939 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2940 state |= BMAP_LEFT_CONTIG;
2942 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
2943 new->br_startoff + new->br_blockcount == right.br_startoff &&
2944 new->br_startblock + new->br_blockcount == right.br_startblock &&
2945 new->br_state == right.br_state &&
2946 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
2947 (!(state & BMAP_LEFT_CONTIG) ||
2948 left.br_blockcount + new->br_blockcount +
2949 right.br_blockcount <= MAXEXTLEN))
2950 state |= BMAP_RIGHT_CONTIG;
2954 * Select which case we're in here, and implement it.
2956 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
2957 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2959 * New allocation is contiguous with real allocations on the
2960 * left and on the right.
2961 * Merge all three into a single extent record.
2964 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
2965 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
2966 left.br_blockcount + new->br_blockcount +
2967 right.br_blockcount);
2968 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2970 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
2972 XFS_IFORK_NEXT_SET(bma->ip, whichfork,
2973 XFS_IFORK_NEXTENTS(bma->ip, whichfork) - 1);
2974 if (bma->cur == NULL) {
2975 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
2977 rval = XFS_ILOG_CORE;
2978 error = xfs_bmbt_lookup_eq(bma->cur, right.br_startoff,
2979 right.br_startblock, right.br_blockcount,
2983 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2984 error = xfs_btree_delete(bma->cur, &i);
2987 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2988 error = xfs_btree_decrement(bma->cur, 0, &i);
2991 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2992 error = xfs_bmbt_update(bma->cur, left.br_startoff,
2994 left.br_blockcount +
2995 new->br_blockcount +
2996 right.br_blockcount,
3003 case BMAP_LEFT_CONTIG:
3005 * New allocation is contiguous with a real allocation
3007 * Merge the new allocation with the left neighbor.
3010 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
3011 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
3012 left.br_blockcount + new->br_blockcount);
3013 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
3015 if (bma->cur == NULL) {
3016 rval = xfs_ilog_fext(whichfork);
3019 error = xfs_bmbt_lookup_eq(bma->cur, left.br_startoff,
3020 left.br_startblock, left.br_blockcount,
3024 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3025 error = xfs_bmbt_update(bma->cur, left.br_startoff,
3027 left.br_blockcount +
3035 case BMAP_RIGHT_CONTIG:
3037 * New allocation is contiguous with a real allocation
3039 * Merge the new allocation with the right neighbor.
3041 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
3042 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx),
3043 new->br_startoff, new->br_startblock,
3044 new->br_blockcount + right.br_blockcount,
3046 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
3048 if (bma->cur == NULL) {
3049 rval = xfs_ilog_fext(whichfork);
3052 error = xfs_bmbt_lookup_eq(bma->cur,
3054 right.br_startblock,
3055 right.br_blockcount, &i);
3058 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3059 error = xfs_bmbt_update(bma->cur, new->br_startoff,
3061 new->br_blockcount +
3062 right.br_blockcount,
3071 * New allocation is not contiguous with another
3073 * Insert a new entry.
3075 xfs_iext_insert(bma->ip, bma->idx, 1, new, state);
3076 XFS_IFORK_NEXT_SET(bma->ip, whichfork,
3077 XFS_IFORK_NEXTENTS(bma->ip, whichfork) + 1);
3078 if (bma->cur == NULL) {
3079 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
3081 rval = XFS_ILOG_CORE;
3082 error = xfs_bmbt_lookup_eq(bma->cur,
3085 new->br_blockcount, &i);
3088 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
3089 bma->cur->bc_rec.b.br_state = new->br_state;
3090 error = xfs_btree_insert(bma->cur, &i);
3093 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3098 /* add reverse mapping */
3099 error = xfs_rmap_map_extent(mp, bma->dfops, bma->ip, whichfork, new);
3103 /* convert to a btree if necessary */
3104 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
3105 int tmp_logflags; /* partial log flag return val */
3107 ASSERT(bma->cur == NULL);
3108 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
3109 bma->firstblock, bma->dfops, &bma->cur,
3110 0, &tmp_logflags, whichfork);
3111 bma->logflags |= tmp_logflags;
3116 /* clear out the allocated field, done with it now in any case. */
3118 bma->cur->bc_private.b.allocated = 0;
3120 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork);
3122 bma->logflags |= rval;
3127 * Functions used in the extent read, allocate and remove paths
3131 * Adjust the size of the new extent based on di_extsize and rt extsize.
3134 xfs_bmap_extsize_align(
3136 xfs_bmbt_irec_t *gotp, /* next extent pointer */
3137 xfs_bmbt_irec_t *prevp, /* previous extent pointer */
3138 xfs_extlen_t extsz, /* align to this extent size */
3139 int rt, /* is this a realtime inode? */
3140 int eof, /* is extent at end-of-file? */
3141 int delay, /* creating delalloc extent? */
3142 int convert, /* overwriting unwritten extent? */
3143 xfs_fileoff_t *offp, /* in/out: aligned offset */
3144 xfs_extlen_t *lenp) /* in/out: aligned length */
3146 xfs_fileoff_t orig_off; /* original offset */
3147 xfs_extlen_t orig_alen; /* original length */
3148 xfs_fileoff_t orig_end; /* original off+len */
3149 xfs_fileoff_t nexto; /* next file offset */
3150 xfs_fileoff_t prevo; /* previous file offset */
3151 xfs_fileoff_t align_off; /* temp for offset */
3152 xfs_extlen_t align_alen; /* temp for length */
3153 xfs_extlen_t temp; /* temp for calculations */
3158 orig_off = align_off = *offp;
3159 orig_alen = align_alen = *lenp;
3160 orig_end = orig_off + orig_alen;
3163 * If this request overlaps an existing extent, then don't
3164 * attempt to perform any additional alignment.
3166 if (!delay && !eof &&
3167 (orig_off >= gotp->br_startoff) &&
3168 (orig_end <= gotp->br_startoff + gotp->br_blockcount)) {
3173 * If the file offset is unaligned vs. the extent size
3174 * we need to align it. This will be possible unless
3175 * the file was previously written with a kernel that didn't
3176 * perform this alignment, or if a truncate shot us in the
3179 temp = do_mod(orig_off, extsz);
3185 /* Same adjustment for the end of the requested area. */
3186 temp = (align_alen % extsz);
3188 align_alen += extsz - temp;
3191 * For large extent hint sizes, the aligned extent might be larger than
3192 * MAXEXTLEN. In that case, reduce the size by an extsz so that it pulls
3193 * the length back under MAXEXTLEN. The outer allocation loops handle
3194 * short allocation just fine, so it is safe to do this. We only want to
3195 * do it when we are forced to, though, because it means more allocation
3196 * operations are required.
3198 while (align_alen > MAXEXTLEN)
3199 align_alen -= extsz;
3200 ASSERT(align_alen <= MAXEXTLEN);
3203 * If the previous block overlaps with this proposed allocation
3204 * then move the start forward without adjusting the length.
3206 if (prevp->br_startoff != NULLFILEOFF) {
3207 if (prevp->br_startblock == HOLESTARTBLOCK)
3208 prevo = prevp->br_startoff;
3210 prevo = prevp->br_startoff + prevp->br_blockcount;
3213 if (align_off != orig_off && align_off < prevo)
3216 * If the next block overlaps with this proposed allocation
3217 * then move the start back without adjusting the length,
3218 * but not before offset 0.
3219 * This may of course make the start overlap previous block,
3220 * and if we hit the offset 0 limit then the next block
3221 * can still overlap too.
3223 if (!eof && gotp->br_startoff != NULLFILEOFF) {
3224 if ((delay && gotp->br_startblock == HOLESTARTBLOCK) ||
3225 (!delay && gotp->br_startblock == DELAYSTARTBLOCK))
3226 nexto = gotp->br_startoff + gotp->br_blockcount;
3228 nexto = gotp->br_startoff;
3230 nexto = NULLFILEOFF;
3232 align_off + align_alen != orig_end &&
3233 align_off + align_alen > nexto)
3234 align_off = nexto > align_alen ? nexto - align_alen : 0;
3236 * If we're now overlapping the next or previous extent that
3237 * means we can't fit an extsz piece in this hole. Just move
3238 * the start forward to the first valid spot and set
3239 * the length so we hit the end.
3241 if (align_off != orig_off && align_off < prevo)
3243 if (align_off + align_alen != orig_end &&
3244 align_off + align_alen > nexto &&
3245 nexto != NULLFILEOFF) {
3246 ASSERT(nexto > prevo);
3247 align_alen = nexto - align_off;
3251 * If realtime, and the result isn't a multiple of the realtime
3252 * extent size we need to remove blocks until it is.
3254 if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) {
3256 * We're not covering the original request, or
3257 * we won't be able to once we fix the length.
3259 if (orig_off < align_off ||
3260 orig_end > align_off + align_alen ||
3261 align_alen - temp < orig_alen)
3264 * Try to fix it by moving the start up.
3266 if (align_off + temp <= orig_off) {
3271 * Try to fix it by moving the end in.
3273 else if (align_off + align_alen - temp >= orig_end)
3276 * Set the start to the minimum then trim the length.
3279 align_alen -= orig_off - align_off;
3280 align_off = orig_off;
3281 align_alen -= align_alen % mp->m_sb.sb_rextsize;
3284 * Result doesn't cover the request, fail it.
3286 if (orig_off < align_off || orig_end > align_off + align_alen)
3289 ASSERT(orig_off >= align_off);
3290 /* see MAXEXTLEN handling above */
3291 ASSERT(orig_end <= align_off + align_alen ||
3292 align_alen + extsz > MAXEXTLEN);
3296 if (!eof && gotp->br_startoff != NULLFILEOFF)
3297 ASSERT(align_off + align_alen <= gotp->br_startoff);
3298 if (prevp->br_startoff != NULLFILEOFF)
3299 ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount);
3307 #define XFS_ALLOC_GAP_UNITS 4
3311 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3313 xfs_fsblock_t adjust; /* adjustment to block numbers */
3314 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
3315 xfs_mount_t *mp; /* mount point structure */
3316 int nullfb; /* true if ap->firstblock isn't set */
3317 int rt; /* true if inode is realtime */
3319 #define ISVALID(x,y) \
3321 (x) < mp->m_sb.sb_rblocks : \
3322 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \
3323 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \
3324 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks)
3326 mp = ap->ip->i_mount;
3327 nullfb = *ap->firstblock == NULLFSBLOCK;
3328 rt = XFS_IS_REALTIME_INODE(ap->ip) &&
3329 xfs_alloc_is_userdata(ap->datatype);
3330 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock);
3332 * If allocating at eof, and there's a previous real block,
3333 * try to use its last block as our starting point.
3335 if (ap->eof && ap->prev.br_startoff != NULLFILEOFF &&
3336 !isnullstartblock(ap->prev.br_startblock) &&
3337 ISVALID(ap->prev.br_startblock + ap->prev.br_blockcount,
3338 ap->prev.br_startblock)) {
3339 ap->blkno = ap->prev.br_startblock + ap->prev.br_blockcount;
3341 * Adjust for the gap between prevp and us.
3343 adjust = ap->offset -
3344 (ap->prev.br_startoff + ap->prev.br_blockcount);
3346 ISVALID(ap->blkno + adjust, ap->prev.br_startblock))
3347 ap->blkno += adjust;
3350 * If not at eof, then compare the two neighbor blocks.
3351 * Figure out whether either one gives us a good starting point,
3352 * and pick the better one.
3354 else if (!ap->eof) {
3355 xfs_fsblock_t gotbno; /* right side block number */
3356 xfs_fsblock_t gotdiff=0; /* right side difference */
3357 xfs_fsblock_t prevbno; /* left side block number */
3358 xfs_fsblock_t prevdiff=0; /* left side difference */
3361 * If there's a previous (left) block, select a requested
3362 * start block based on it.
3364 if (ap->prev.br_startoff != NULLFILEOFF &&
3365 !isnullstartblock(ap->prev.br_startblock) &&
3366 (prevbno = ap->prev.br_startblock +
3367 ap->prev.br_blockcount) &&
3368 ISVALID(prevbno, ap->prev.br_startblock)) {
3370 * Calculate gap to end of previous block.
3372 adjust = prevdiff = ap->offset -
3373 (ap->prev.br_startoff +
3374 ap->prev.br_blockcount);
3376 * Figure the startblock based on the previous block's
3377 * end and the gap size.
3379 * If the gap is large relative to the piece we're
3380 * allocating, or using it gives us an invalid block
3381 * number, then just use the end of the previous block.
3383 if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
3384 ISVALID(prevbno + prevdiff,
3385 ap->prev.br_startblock))
3390 * If the firstblock forbids it, can't use it,
3393 if (!rt && !nullfb &&
3394 XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno)
3395 prevbno = NULLFSBLOCK;
3398 * No previous block or can't follow it, just default.
3401 prevbno = NULLFSBLOCK;
3403 * If there's a following (right) block, select a requested
3404 * start block based on it.
3406 if (!isnullstartblock(ap->got.br_startblock)) {
3408 * Calculate gap to start of next block.
3410 adjust = gotdiff = ap->got.br_startoff - ap->offset;
3412 * Figure the startblock based on the next block's
3413 * start and the gap size.
3415 gotbno = ap->got.br_startblock;
3418 * If the gap is large relative to the piece we're
3419 * allocating, or using it gives us an invalid block
3420 * number, then just use the start of the next block
3421 * offset by our length.
3423 if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
3424 ISVALID(gotbno - gotdiff, gotbno))
3426 else if (ISVALID(gotbno - ap->length, gotbno)) {
3427 gotbno -= ap->length;
3428 gotdiff += adjust - ap->length;
3432 * If the firstblock forbids it, can't use it,
3435 if (!rt && !nullfb &&
3436 XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno)
3437 gotbno = NULLFSBLOCK;
3440 * No next block, just default.
3443 gotbno = NULLFSBLOCK;
3445 * If both valid, pick the better one, else the only good
3446 * one, else ap->blkno is already set (to 0 or the inode block).
3448 if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK)
3449 ap->blkno = prevdiff <= gotdiff ? prevbno : gotbno;
3450 else if (prevbno != NULLFSBLOCK)
3451 ap->blkno = prevbno;
3452 else if (gotbno != NULLFSBLOCK)
3459 xfs_bmap_longest_free_extent(
3460 struct xfs_trans *tp,
3465 struct xfs_mount *mp = tp->t_mountp;
3466 struct xfs_perag *pag;
3467 xfs_extlen_t longest;
3470 pag = xfs_perag_get(mp, ag);
3471 if (!pag->pagf_init) {
3472 error = xfs_alloc_pagf_init(mp, tp, ag, XFS_ALLOC_FLAG_TRYLOCK);
3476 if (!pag->pagf_init) {
3482 longest = xfs_alloc_longest_free_extent(mp, pag,
3483 xfs_alloc_min_freelist(mp, pag),
3484 xfs_ag_resv_needed(pag, XFS_AG_RESV_NONE));
3485 if (*blen < longest)
3494 xfs_bmap_select_minlen(
3495 struct xfs_bmalloca *ap,
3496 struct xfs_alloc_arg *args,
3500 if (notinit || *blen < ap->minlen) {
3502 * Since we did a BUF_TRYLOCK above, it is possible that
3503 * there is space for this request.
3505 args->minlen = ap->minlen;
3506 } else if (*blen < args->maxlen) {
3508 * If the best seen length is less than the request length,
3509 * use the best as the minimum.
3511 args->minlen = *blen;
3514 * Otherwise we've seen an extent as big as maxlen, use that
3517 args->minlen = args->maxlen;
3522 xfs_bmap_btalloc_nullfb(
3523 struct xfs_bmalloca *ap,
3524 struct xfs_alloc_arg *args,
3527 struct xfs_mount *mp = ap->ip->i_mount;
3528 xfs_agnumber_t ag, startag;
3532 args->type = XFS_ALLOCTYPE_START_BNO;
3533 args->total = ap->total;
3535 startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
3536 if (startag == NULLAGNUMBER)
3539 while (*blen < args->maxlen) {
3540 error = xfs_bmap_longest_free_extent(args->tp, ag, blen,
3545 if (++ag == mp->m_sb.sb_agcount)
3551 xfs_bmap_select_minlen(ap, args, blen, notinit);
3556 xfs_bmap_btalloc_filestreams(
3557 struct xfs_bmalloca *ap,
3558 struct xfs_alloc_arg *args,
3561 struct xfs_mount *mp = ap->ip->i_mount;
3566 args->type = XFS_ALLOCTYPE_NEAR_BNO;
3567 args->total = ap->total;
3569 ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
3570 if (ag == NULLAGNUMBER)
3573 error = xfs_bmap_longest_free_extent(args->tp, ag, blen, ¬init);
3577 if (*blen < args->maxlen) {
3578 error = xfs_filestream_new_ag(ap, &ag);
3582 error = xfs_bmap_longest_free_extent(args->tp, ag, blen,
3589 xfs_bmap_select_minlen(ap, args, blen, notinit);
3592 * Set the failure fallback case to look in the selected AG as stream
3595 ap->blkno = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0);
3601 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3603 xfs_mount_t *mp; /* mount point structure */
3604 xfs_alloctype_t atype = 0; /* type for allocation routines */
3605 xfs_extlen_t align = 0; /* minimum allocation alignment */
3606 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
3608 xfs_alloc_arg_t args;
3610 xfs_extlen_t nextminlen = 0;
3611 int nullfb; /* true if ap->firstblock isn't set */
3619 mp = ap->ip->i_mount;
3621 /* stripe alignment for allocation is determined by mount parameters */
3623 if (mp->m_swidth && (mp->m_flags & XFS_MOUNT_SWALLOC))
3624 stripe_align = mp->m_swidth;
3625 else if (mp->m_dalign)
3626 stripe_align = mp->m_dalign;
3628 if (ap->flags & XFS_BMAPI_COWFORK)
3629 align = xfs_get_cowextsz_hint(ap->ip);
3630 else if (xfs_alloc_is_userdata(ap->datatype))
3631 align = xfs_get_extsz_hint(ap->ip);
3632 if (unlikely(align)) {
3633 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
3634 align, 0, ap->eof, 0, ap->conv,
3635 &ap->offset, &ap->length);
3641 nullfb = *ap->firstblock == NULLFSBLOCK;
3642 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock);
3644 if (xfs_alloc_is_userdata(ap->datatype) &&
3645 xfs_inode_is_filestream(ap->ip)) {
3646 ag = xfs_filestream_lookup_ag(ap->ip);
3647 ag = (ag != NULLAGNUMBER) ? ag : 0;
3648 ap->blkno = XFS_AGB_TO_FSB(mp, ag, 0);
3650 ap->blkno = XFS_INO_TO_FSB(mp, ap->ip->i_ino);
3653 ap->blkno = *ap->firstblock;
3655 xfs_bmap_adjacent(ap);
3658 * If allowed, use ap->blkno; otherwise must use firstblock since
3659 * it's in the right allocation group.
3661 if (nullfb || XFS_FSB_TO_AGNO(mp, ap->blkno) == fb_agno)
3664 ap->blkno = *ap->firstblock;
3666 * Normal allocation, done through xfs_alloc_vextent.
3668 tryagain = isaligned = 0;
3669 memset(&args, 0, sizeof(args));
3672 args.fsbno = ap->blkno;
3673 xfs_rmap_skip_owner_update(&args.oinfo);
3675 /* Trim the allocation back to the maximum an AG can fit. */
3676 args.maxlen = MIN(ap->length, mp->m_ag_max_usable);
3677 args.firstblock = *ap->firstblock;
3681 * Search for an allocation group with a single extent large
3682 * enough for the request. If one isn't found, then adjust
3683 * the minimum allocation size to the largest space found.
3685 if (xfs_alloc_is_userdata(ap->datatype) &&
3686 xfs_inode_is_filestream(ap->ip))
3687 error = xfs_bmap_btalloc_filestreams(ap, &args, &blen);
3689 error = xfs_bmap_btalloc_nullfb(ap, &args, &blen);
3692 } else if (ap->dfops->dop_low) {
3693 if (xfs_inode_is_filestream(ap->ip))
3694 args.type = XFS_ALLOCTYPE_FIRST_AG;
3696 args.type = XFS_ALLOCTYPE_START_BNO;
3697 args.total = args.minlen = ap->minlen;
3699 args.type = XFS_ALLOCTYPE_NEAR_BNO;
3700 args.total = ap->total;
3701 args.minlen = ap->minlen;
3703 /* apply extent size hints if obtained earlier */
3704 if (unlikely(align)) {
3706 if ((args.mod = (xfs_extlen_t)do_mod(ap->offset, args.prod)))
3707 args.mod = (xfs_extlen_t)(args.prod - args.mod);
3708 } else if (mp->m_sb.sb_blocksize >= PAGE_SIZE) {
3712 args.prod = PAGE_SIZE >> mp->m_sb.sb_blocklog;
3713 if ((args.mod = (xfs_extlen_t)(do_mod(ap->offset, args.prod))))
3714 args.mod = (xfs_extlen_t)(args.prod - args.mod);
3717 * If we are not low on available data blocks, and the
3718 * underlying logical volume manager is a stripe, and
3719 * the file offset is zero then try to allocate data
3720 * blocks on stripe unit boundary.
3721 * NOTE: ap->aeof is only set if the allocation length
3722 * is >= the stripe unit and the allocation offset is
3723 * at the end of file.
3725 if (!ap->dfops->dop_low && ap->aeof) {
3727 args.alignment = stripe_align;
3731 * Adjust for alignment
3733 if (blen > args.alignment && blen <= args.maxlen)
3734 args.minlen = blen - args.alignment;
3735 args.minalignslop = 0;
3738 * First try an exact bno allocation.
3739 * If it fails then do a near or start bno
3740 * allocation with alignment turned on.
3744 args.type = XFS_ALLOCTYPE_THIS_BNO;
3747 * Compute the minlen+alignment for the
3748 * next case. Set slop so that the value
3749 * of minlen+alignment+slop doesn't go up
3750 * between the calls.
3752 if (blen > stripe_align && blen <= args.maxlen)
3753 nextminlen = blen - stripe_align;
3755 nextminlen = args.minlen;
3756 if (nextminlen + stripe_align > args.minlen + 1)
3758 nextminlen + stripe_align -
3761 args.minalignslop = 0;
3765 args.minalignslop = 0;
3767 args.minleft = ap->minleft;
3768 args.wasdel = ap->wasdel;
3769 args.resv = XFS_AG_RESV_NONE;
3770 args.datatype = ap->datatype;
3771 if (ap->datatype & XFS_ALLOC_USERDATA_ZERO)
3774 error = xfs_alloc_vextent(&args);
3778 if (tryagain && args.fsbno == NULLFSBLOCK) {
3780 * Exact allocation failed. Now try with alignment
3784 args.fsbno = ap->blkno;
3785 args.alignment = stripe_align;
3786 args.minlen = nextminlen;
3787 args.minalignslop = 0;
3789 if ((error = xfs_alloc_vextent(&args)))
3792 if (isaligned && args.fsbno == NULLFSBLOCK) {
3794 * allocation failed, so turn off alignment and
3798 args.fsbno = ap->blkno;
3800 if ((error = xfs_alloc_vextent(&args)))
3803 if (args.fsbno == NULLFSBLOCK && nullfb &&
3804 args.minlen > ap->minlen) {
3805 args.minlen = ap->minlen;
3806 args.type = XFS_ALLOCTYPE_START_BNO;
3807 args.fsbno = ap->blkno;
3808 if ((error = xfs_alloc_vextent(&args)))
3811 if (args.fsbno == NULLFSBLOCK && nullfb) {
3813 args.type = XFS_ALLOCTYPE_FIRST_AG;
3814 args.total = ap->minlen;
3815 if ((error = xfs_alloc_vextent(&args)))
3817 ap->dfops->dop_low = true;
3819 if (args.fsbno != NULLFSBLOCK) {
3821 * check the allocation happened at the same or higher AG than
3822 * the first block that was allocated.
3824 ASSERT(*ap->firstblock == NULLFSBLOCK ||
3825 XFS_FSB_TO_AGNO(mp, *ap->firstblock) ==
3826 XFS_FSB_TO_AGNO(mp, args.fsbno) ||
3827 (ap->dfops->dop_low &&
3828 XFS_FSB_TO_AGNO(mp, *ap->firstblock) <
3829 XFS_FSB_TO_AGNO(mp, args.fsbno)));
3831 ap->blkno = args.fsbno;
3832 if (*ap->firstblock == NULLFSBLOCK)
3833 *ap->firstblock = args.fsbno;
3834 ASSERT(nullfb || fb_agno == args.agno ||
3835 (ap->dfops->dop_low && fb_agno < args.agno));
3836 ap->length = args.len;
3837 if (!(ap->flags & XFS_BMAPI_COWFORK))
3838 ap->ip->i_d.di_nblocks += args.len;
3839 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
3841 ap->ip->i_delayed_blks -= args.len;
3843 * Adjust the disk quota also. This was reserved
3846 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
3847 ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT :
3848 XFS_TRANS_DQ_BCOUNT,
3851 ap->blkno = NULLFSBLOCK;
3858 * For a remap operation, just "allocate" an extent at the address that the
3859 * caller passed in, and ensure that the AGFL is the right size. The caller
3860 * will then map the "allocated" extent into the file somewhere.
3863 xfs_bmap_remap_alloc(
3864 struct xfs_bmalloca *ap)
3866 struct xfs_trans *tp = ap->tp;
3867 struct xfs_mount *mp = tp->t_mountp;
3869 struct xfs_alloc_arg args;
3873 * validate that the block number is legal - the enables us to detect
3874 * and handle a silent filesystem corruption rather than crashing.
3876 memset(&args, 0, sizeof(struct xfs_alloc_arg));
3878 args.mp = ap->tp->t_mountp;
3879 bno = *ap->firstblock;
3880 args.agno = XFS_FSB_TO_AGNO(mp, bno);
3881 args.agbno = XFS_FSB_TO_AGBNO(mp, bno);
3882 if (args.agno >= mp->m_sb.sb_agcount ||
3883 args.agbno >= mp->m_sb.sb_agblocks)
3884 return -EFSCORRUPTED;
3886 /* "Allocate" the extent from the range we passed in. */
3887 trace_xfs_bmap_remap_alloc(ap->ip, *ap->firstblock, ap->length);
3889 ap->ip->i_d.di_nblocks += ap->length;
3890 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
3892 /* Fix the freelist, like a real allocator does. */
3893 args.datatype = ap->datatype;
3894 args.pag = xfs_perag_get(args.mp, args.agno);
3898 * The freelist fixing code will decline the allocation if
3899 * the size and shape of the free space doesn't allow for
3900 * allocating the extent and updating all the metadata that
3901 * happens during an allocation. We're remapping, not
3902 * allocating, so skip that check by pretending to be freeing.
3904 error = xfs_alloc_fix_freelist(&args, XFS_ALLOC_FLAG_FREEING);
3905 xfs_perag_put(args.pag);
3907 trace_xfs_bmap_remap_alloc_error(ap->ip, error, _RET_IP_);
3912 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
3913 * It figures out where to ask the underlying allocator to put the new extent.
3917 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3919 if (ap->flags & XFS_BMAPI_REMAP)
3920 return xfs_bmap_remap_alloc(ap);
3921 if (XFS_IS_REALTIME_INODE(ap->ip) &&
3922 xfs_alloc_is_userdata(ap->datatype))
3923 return xfs_bmap_rtalloc(ap);
3924 return xfs_bmap_btalloc(ap);
3927 /* Trim extent to fit a logical block range. */
3930 struct xfs_bmbt_irec *irec,
3934 xfs_fileoff_t distance;
3935 xfs_fileoff_t end = bno + len;
3937 if (irec->br_startoff + irec->br_blockcount <= bno ||
3938 irec->br_startoff >= end) {
3939 irec->br_blockcount = 0;
3943 if (irec->br_startoff < bno) {
3944 distance = bno - irec->br_startoff;
3945 if (isnullstartblock(irec->br_startblock))
3946 irec->br_startblock = DELAYSTARTBLOCK;
3947 if (irec->br_startblock != DELAYSTARTBLOCK &&
3948 irec->br_startblock != HOLESTARTBLOCK)
3949 irec->br_startblock += distance;
3950 irec->br_startoff += distance;
3951 irec->br_blockcount -= distance;
3954 if (end < irec->br_startoff + irec->br_blockcount) {
3955 distance = irec->br_startoff + irec->br_blockcount - end;
3956 irec->br_blockcount -= distance;
3961 * Trim the returned map to the required bounds
3965 struct xfs_bmbt_irec *mval,
3966 struct xfs_bmbt_irec *got,
3974 if ((flags & XFS_BMAPI_ENTIRE) ||
3975 got->br_startoff + got->br_blockcount <= obno) {
3977 if (isnullstartblock(got->br_startblock))
3978 mval->br_startblock = DELAYSTARTBLOCK;
3984 ASSERT((*bno >= obno) || (n == 0));
3986 mval->br_startoff = *bno;
3987 if (isnullstartblock(got->br_startblock))
3988 mval->br_startblock = DELAYSTARTBLOCK;
3990 mval->br_startblock = got->br_startblock +
3991 (*bno - got->br_startoff);
3993 * Return the minimum of what we got and what we asked for for
3994 * the length. We can use the len variable here because it is
3995 * modified below and we could have been there before coming
3996 * here if the first part of the allocation didn't overlap what
3999 mval->br_blockcount = XFS_FILBLKS_MIN(end - *bno,
4000 got->br_blockcount - (*bno - got->br_startoff));
4001 mval->br_state = got->br_state;
4002 ASSERT(mval->br_blockcount <= len);
4007 * Update and validate the extent map to return
4010 xfs_bmapi_update_map(
4011 struct xfs_bmbt_irec **map,
4019 xfs_bmbt_irec_t *mval = *map;
4021 ASSERT((flags & XFS_BMAPI_ENTIRE) ||
4022 ((mval->br_startoff + mval->br_blockcount) <= end));
4023 ASSERT((flags & XFS_BMAPI_ENTIRE) || (mval->br_blockcount <= *len) ||
4024 (mval->br_startoff < obno));
4026 *bno = mval->br_startoff + mval->br_blockcount;
4028 if (*n > 0 && mval->br_startoff == mval[-1].br_startoff) {
4029 /* update previous map with new information */
4030 ASSERT(mval->br_startblock == mval[-1].br_startblock);
4031 ASSERT(mval->br_blockcount > mval[-1].br_blockcount);
4032 ASSERT(mval->br_state == mval[-1].br_state);
4033 mval[-1].br_blockcount = mval->br_blockcount;
4034 mval[-1].br_state = mval->br_state;
4035 } else if (*n > 0 && mval->br_startblock != DELAYSTARTBLOCK &&
4036 mval[-1].br_startblock != DELAYSTARTBLOCK &&
4037 mval[-1].br_startblock != HOLESTARTBLOCK &&
4038 mval->br_startblock == mval[-1].br_startblock +
4039 mval[-1].br_blockcount &&
4040 ((flags & XFS_BMAPI_IGSTATE) ||
4041 mval[-1].br_state == mval->br_state)) {
4042 ASSERT(mval->br_startoff ==
4043 mval[-1].br_startoff + mval[-1].br_blockcount);
4044 mval[-1].br_blockcount += mval->br_blockcount;
4045 } else if (*n > 0 &&
4046 mval->br_startblock == DELAYSTARTBLOCK &&
4047 mval[-1].br_startblock == DELAYSTARTBLOCK &&
4048 mval->br_startoff ==
4049 mval[-1].br_startoff + mval[-1].br_blockcount) {
4050 mval[-1].br_blockcount += mval->br_blockcount;
4051 mval[-1].br_state = mval->br_state;
4052 } else if (!((*n == 0) &&
4053 ((mval->br_startoff + mval->br_blockcount) <=
4062 * Map file blocks to filesystem blocks without allocation.
4066 struct xfs_inode *ip,
4069 struct xfs_bmbt_irec *mval,
4073 struct xfs_mount *mp = ip->i_mount;
4074 struct xfs_ifork *ifp;
4075 struct xfs_bmbt_irec got;
4082 int whichfork = xfs_bmapi_whichfork(flags);
4085 ASSERT(!(flags & ~(XFS_BMAPI_ATTRFORK|XFS_BMAPI_ENTIRE|
4086 XFS_BMAPI_IGSTATE|XFS_BMAPI_COWFORK)));
4087 ASSERT(xfs_isilocked(ip, XFS_ILOCK_SHARED|XFS_ILOCK_EXCL));
4089 if (unlikely(XFS_TEST_ERROR(
4090 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4091 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
4092 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
4093 XFS_ERROR_REPORT("xfs_bmapi_read", XFS_ERRLEVEL_LOW, mp);
4094 return -EFSCORRUPTED;
4097 if (XFS_FORCED_SHUTDOWN(mp))
4100 XFS_STATS_INC(mp, xs_blk_mapr);
4102 ifp = XFS_IFORK_PTR(ip, whichfork);
4104 /* No CoW fork? Return a hole. */
4105 if (whichfork == XFS_COW_FORK && !ifp) {
4106 mval->br_startoff = bno;
4107 mval->br_startblock = HOLESTARTBLOCK;
4108 mval->br_blockcount = len;
4109 mval->br_state = XFS_EXT_NORM;
4114 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4115 error = xfs_iread_extents(NULL, ip, whichfork);
4120 if (!xfs_iext_lookup_extent(ip, ifp, bno, &idx, &got))
4125 while (bno < end && n < *nmap) {
4126 /* Reading past eof, act as though there's a hole up to end. */
4128 got.br_startoff = end;
4129 if (got.br_startoff > bno) {
4130 /* Reading in a hole. */
4131 mval->br_startoff = bno;
4132 mval->br_startblock = HOLESTARTBLOCK;
4133 mval->br_blockcount =
4134 XFS_FILBLKS_MIN(len, got.br_startoff - bno);
4135 mval->br_state = XFS_EXT_NORM;
4136 bno += mval->br_blockcount;
4137 len -= mval->br_blockcount;
4143 /* set up the extent map to return. */
4144 xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags);
4145 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
4147 /* If we're done, stop now. */
4148 if (bno >= end || n >= *nmap)
4151 /* Else go on to the next record. */
4152 if (!xfs_iext_get_extent(ifp, ++idx, &got))
4160 xfs_bmapi_reserve_delalloc(
4161 struct xfs_inode *ip,
4165 xfs_filblks_t prealloc,
4166 struct xfs_bmbt_irec *got,
4167 xfs_extnum_t *lastx,
4170 struct xfs_mount *mp = ip->i_mount;
4171 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
4173 xfs_extlen_t indlen;
4174 char rt = XFS_IS_REALTIME_INODE(ip);
4177 xfs_fileoff_t aoff = off;
4180 * Cap the alloc length. Keep track of prealloc so we know whether to
4181 * tag the inode before we return.
4183 alen = XFS_FILBLKS_MIN(len + prealloc, MAXEXTLEN);
4185 alen = XFS_FILBLKS_MIN(alen, got->br_startoff - aoff);
4186 if (prealloc && alen >= len)
4187 prealloc = alen - len;
4189 /* Figure out the extent size, adjust alen */
4190 if (whichfork == XFS_COW_FORK)
4191 extsz = xfs_get_cowextsz_hint(ip);
4193 extsz = xfs_get_extsz_hint(ip);
4195 struct xfs_bmbt_irec prev;
4197 if (!xfs_iext_get_extent(ifp, *lastx - 1, &prev))
4198 prev.br_startoff = NULLFILEOFF;
4200 error = xfs_bmap_extsize_align(mp, got, &prev, extsz, rt, eof,
4201 1, 0, &aoff, &alen);
4206 extsz = alen / mp->m_sb.sb_rextsize;
4209 * Make a transaction-less quota reservation for delayed allocation
4210 * blocks. This number gets adjusted later. We return if we haven't
4211 * allocated blocks already inside this loop.
4213 error = xfs_trans_reserve_quota_nblks(NULL, ip, (long)alen, 0,
4214 rt ? XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS);
4219 * Split changing sb for alen and indlen since they could be coming
4220 * from different places.
4222 indlen = (xfs_extlen_t)xfs_bmap_worst_indlen(ip, alen);
4226 error = xfs_mod_frextents(mp, -((int64_t)extsz));
4228 error = xfs_mod_fdblocks(mp, -((int64_t)alen), false);
4232 goto out_unreserve_quota;
4234 error = xfs_mod_fdblocks(mp, -((int64_t)indlen), false);
4236 goto out_unreserve_blocks;
4239 ip->i_delayed_blks += alen;
4241 got->br_startoff = aoff;
4242 got->br_startblock = nullstartblock(indlen);
4243 got->br_blockcount = alen;
4244 got->br_state = XFS_EXT_NORM;
4245 xfs_bmap_add_extent_hole_delay(ip, whichfork, lastx, got);
4248 * Update our extent pointer, given that xfs_bmap_add_extent_hole_delay
4249 * might have merged it into one of the neighbouring ones.
4251 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *lastx), got);
4254 * Tag the inode if blocks were preallocated. Note that COW fork
4255 * preallocation can occur at the start or end of the extent, even when
4256 * prealloc == 0, so we must also check the aligned offset and length.
4258 if (whichfork == XFS_DATA_FORK && prealloc)
4259 xfs_inode_set_eofblocks_tag(ip);
4260 if (whichfork == XFS_COW_FORK && (prealloc || aoff < off || alen > len))
4261 xfs_inode_set_cowblocks_tag(ip);
4263 ASSERT(got->br_startoff <= aoff);
4264 ASSERT(got->br_startoff + got->br_blockcount >= aoff + alen);
4265 ASSERT(isnullstartblock(got->br_startblock));
4266 ASSERT(got->br_state == XFS_EXT_NORM);
4269 out_unreserve_blocks:
4271 xfs_mod_frextents(mp, extsz);
4273 xfs_mod_fdblocks(mp, alen, false);
4274 out_unreserve_quota:
4275 if (XFS_IS_QUOTA_ON(mp))
4276 xfs_trans_unreserve_quota_nblks(NULL, ip, (long)alen, 0, rt ?
4277 XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS);
4283 struct xfs_bmalloca *bma)
4285 struct xfs_mount *mp = bma->ip->i_mount;
4286 int whichfork = xfs_bmapi_whichfork(bma->flags);
4287 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4288 int tmp_logflags = 0;
4291 ASSERT(bma->length > 0);
4294 * For the wasdelay case, we could also just allocate the stuff asked
4295 * for in this bmap call but that wouldn't be as good.
4298 bma->length = (xfs_extlen_t)bma->got.br_blockcount;
4299 bma->offset = bma->got.br_startoff;
4301 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1),
4305 bma->length = XFS_FILBLKS_MIN(bma->length, MAXEXTLEN);
4307 bma->length = XFS_FILBLKS_MIN(bma->length,
4308 bma->got.br_startoff - bma->offset);
4312 * Set the data type being allocated. For the data fork, the first data
4313 * in the file is treated differently to all other allocations. For the
4314 * attribute fork, we only need to ensure the allocated range is not on
4317 if (!(bma->flags & XFS_BMAPI_METADATA)) {
4318 bma->datatype = XFS_ALLOC_NOBUSY;
4319 if (whichfork == XFS_DATA_FORK) {
4320 if (bma->offset == 0)
4321 bma->datatype |= XFS_ALLOC_INITIAL_USER_DATA;
4323 bma->datatype |= XFS_ALLOC_USERDATA;
4325 if (bma->flags & XFS_BMAPI_ZERO)
4326 bma->datatype |= XFS_ALLOC_USERDATA_ZERO;
4329 bma->minlen = (bma->flags & XFS_BMAPI_CONTIG) ? bma->length : 1;
4332 * Only want to do the alignment at the eof if it is userdata and
4333 * allocation length is larger than a stripe unit.
4335 if (mp->m_dalign && bma->length >= mp->m_dalign &&
4336 !(bma->flags & XFS_BMAPI_METADATA) && whichfork == XFS_DATA_FORK) {
4337 error = xfs_bmap_isaeof(bma, whichfork);
4342 error = xfs_bmap_alloc(bma);
4347 bma->cur->bc_private.b.firstblock = *bma->firstblock;
4348 if (bma->blkno == NULLFSBLOCK)
4350 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) {
4351 bma->cur = xfs_bmbt_init_cursor(mp, bma->tp, bma->ip, whichfork);
4352 bma->cur->bc_private.b.firstblock = *bma->firstblock;
4353 bma->cur->bc_private.b.dfops = bma->dfops;
4356 * Bump the number of extents we've allocated
4362 bma->cur->bc_private.b.flags =
4363 bma->wasdel ? XFS_BTCUR_BPRV_WASDEL : 0;
4365 bma->got.br_startoff = bma->offset;
4366 bma->got.br_startblock = bma->blkno;
4367 bma->got.br_blockcount = bma->length;
4368 bma->got.br_state = XFS_EXT_NORM;
4371 * A wasdelay extent has been initialized, so shouldn't be flagged
4374 if (!bma->wasdel && (bma->flags & XFS_BMAPI_PREALLOC) &&
4375 xfs_sb_version_hasextflgbit(&mp->m_sb))
4376 bma->got.br_state = XFS_EXT_UNWRITTEN;
4379 error = xfs_bmap_add_extent_delay_real(bma, whichfork);
4381 error = xfs_bmap_add_extent_hole_real(bma, whichfork);
4383 bma->logflags |= tmp_logflags;
4388 * Update our extent pointer, given that xfs_bmap_add_extent_delay_real
4389 * or xfs_bmap_add_extent_hole_real might have merged it into one of
4390 * the neighbouring ones.
4392 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got);
4394 ASSERT(bma->got.br_startoff <= bma->offset);
4395 ASSERT(bma->got.br_startoff + bma->got.br_blockcount >=
4396 bma->offset + bma->length);
4397 ASSERT(bma->got.br_state == XFS_EXT_NORM ||
4398 bma->got.br_state == XFS_EXT_UNWRITTEN);
4403 xfs_bmapi_convert_unwritten(
4404 struct xfs_bmalloca *bma,
4405 struct xfs_bmbt_irec *mval,
4409 int whichfork = xfs_bmapi_whichfork(flags);
4410 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4411 int tmp_logflags = 0;
4414 /* check if we need to do unwritten->real conversion */
4415 if (mval->br_state == XFS_EXT_UNWRITTEN &&
4416 (flags & XFS_BMAPI_PREALLOC))
4419 /* check if we need to do real->unwritten conversion */
4420 if (mval->br_state == XFS_EXT_NORM &&
4421 (flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) !=
4422 (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT))
4425 ASSERT(whichfork != XFS_COW_FORK);
4428 * Modify (by adding) the state flag, if writing.
4430 ASSERT(mval->br_blockcount <= len);
4431 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) {
4432 bma->cur = xfs_bmbt_init_cursor(bma->ip->i_mount, bma->tp,
4433 bma->ip, whichfork);
4434 bma->cur->bc_private.b.firstblock = *bma->firstblock;
4435 bma->cur->bc_private.b.dfops = bma->dfops;
4437 mval->br_state = (mval->br_state == XFS_EXT_UNWRITTEN)
4438 ? XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
4441 * Before insertion into the bmbt, zero the range being converted
4444 if (flags & XFS_BMAPI_ZERO) {
4445 error = xfs_zero_extent(bma->ip, mval->br_startblock,
4446 mval->br_blockcount);
4451 error = xfs_bmap_add_extent_unwritten_real(bma->tp, bma->ip, &bma->idx,
4452 &bma->cur, mval, bma->firstblock, bma->dfops,
4455 * Log the inode core unconditionally in the unwritten extent conversion
4456 * path because the conversion might not have done so (e.g., if the
4457 * extent count hasn't changed). We need to make sure the inode is dirty
4458 * in the transaction for the sake of fsync(), even if nothing has
4459 * changed, because fsync() will not force the log for this transaction
4460 * unless it sees the inode pinned.
4462 bma->logflags |= tmp_logflags | XFS_ILOG_CORE;
4467 * Update our extent pointer, given that
4468 * xfs_bmap_add_extent_unwritten_real might have merged it into one
4469 * of the neighbouring ones.
4471 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got);
4474 * We may have combined previously unwritten space with written space,
4475 * so generate another request.
4477 if (mval->br_blockcount < len)
4483 * Map file blocks to filesystem blocks, and allocate blocks or convert the
4484 * extent state if necessary. Details behaviour is controlled by the flags
4485 * parameter. Only allocates blocks from a single allocation group, to avoid
4488 * The returned value in "firstblock" from the first call in a transaction
4489 * must be remembered and presented to subsequent calls in "firstblock".
4490 * An upper bound for the number of blocks to be allocated is supplied to
4491 * the first call in "total"; if no allocation group has that many free
4492 * blocks then the call will fail (return NULLFSBLOCK in "firstblock").
4496 struct xfs_trans *tp, /* transaction pointer */
4497 struct xfs_inode *ip, /* incore inode */
4498 xfs_fileoff_t bno, /* starting file offs. mapped */
4499 xfs_filblks_t len, /* length to map in file */
4500 int flags, /* XFS_BMAPI_... */
4501 xfs_fsblock_t *firstblock, /* first allocated block
4502 controls a.g. for allocs */
4503 xfs_extlen_t total, /* total blocks needed */
4504 struct xfs_bmbt_irec *mval, /* output: map values */
4505 int *nmap, /* i/o: mval size/count */
4506 struct xfs_defer_ops *dfops) /* i/o: list extents to free */
4508 struct xfs_mount *mp = ip->i_mount;
4509 struct xfs_ifork *ifp;
4510 struct xfs_bmalloca bma = { NULL }; /* args for xfs_bmap_alloc */
4511 xfs_fileoff_t end; /* end of mapped file region */
4512 bool eof = false; /* after the end of extents */
4513 int error; /* error return */
4514 int n; /* current extent index */
4515 xfs_fileoff_t obno; /* old block number (offset) */
4516 int whichfork; /* data or attr fork */
4517 char inhole; /* current location is hole in file */
4518 char wasdelay; /* old extent was delayed */
4521 xfs_fileoff_t orig_bno; /* original block number value */
4522 int orig_flags; /* original flags arg value */
4523 xfs_filblks_t orig_len; /* original value of len arg */
4524 struct xfs_bmbt_irec *orig_mval; /* original value of mval */
4525 int orig_nmap; /* original value of *nmap */
4533 whichfork = xfs_bmapi_whichfork(flags);
4536 ASSERT(*nmap <= XFS_BMAP_MAX_NMAP);
4537 ASSERT(!(flags & XFS_BMAPI_IGSTATE));
4540 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL);
4541 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
4542 ASSERT(!(flags & XFS_BMAPI_REMAP) || whichfork == XFS_DATA_FORK);
4543 ASSERT(!(flags & XFS_BMAPI_PREALLOC) || !(flags & XFS_BMAPI_REMAP));
4544 ASSERT(!(flags & XFS_BMAPI_CONVERT) || !(flags & XFS_BMAPI_REMAP));
4545 ASSERT(!(flags & XFS_BMAPI_PREALLOC) || whichfork != XFS_COW_FORK);
4546 ASSERT(!(flags & XFS_BMAPI_CONVERT) || whichfork != XFS_COW_FORK);
4548 /* zeroing is for currently only for data extents, not metadata */
4549 ASSERT((flags & (XFS_BMAPI_METADATA | XFS_BMAPI_ZERO)) !=
4550 (XFS_BMAPI_METADATA | XFS_BMAPI_ZERO));
4552 * we can allocate unwritten extents or pre-zero allocated blocks,
4553 * but it makes no sense to do both at once. This would result in
4554 * zeroing the unwritten extent twice, but it still being an
4555 * unwritten extent....
4557 ASSERT((flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_ZERO)) !=
4558 (XFS_BMAPI_PREALLOC | XFS_BMAPI_ZERO));
4560 if (unlikely(XFS_TEST_ERROR(
4561 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4562 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
4563 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
4564 XFS_ERROR_REPORT("xfs_bmapi_write", XFS_ERRLEVEL_LOW, mp);
4565 return -EFSCORRUPTED;
4568 if (XFS_FORCED_SHUTDOWN(mp))
4571 ifp = XFS_IFORK_PTR(ip, whichfork);
4573 XFS_STATS_INC(mp, xs_blk_mapw);
4575 if (*firstblock == NULLFSBLOCK) {
4576 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE)
4577 bma.minleft = be16_to_cpu(ifp->if_broot->bb_level) + 1;
4584 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4585 error = xfs_iread_extents(tp, ip, whichfork);
4594 if (!xfs_iext_lookup_extent(ip, ifp, bno, &bma.idx, &bma.got))
4596 if (!xfs_iext_get_extent(ifp, bma.idx - 1, &bma.prev))
4597 bma.prev.br_startoff = NULLFILEOFF;
4603 bma.firstblock = firstblock;
4605 while (bno < end && n < *nmap) {
4606 inhole = eof || bma.got.br_startoff > bno;
4607 wasdelay = !inhole && isnullstartblock(bma.got.br_startblock);
4610 * Make sure we only reflink into a hole.
4612 if (flags & XFS_BMAPI_REMAP)
4614 if (flags & XFS_BMAPI_COWFORK)
4618 * First, deal with the hole before the allocated space
4619 * that we found, if any.
4621 if (inhole || wasdelay) {
4623 bma.conv = !!(flags & XFS_BMAPI_CONVERT);
4624 bma.wasdel = wasdelay;
4629 * There's a 32/64 bit type mismatch between the
4630 * allocation length request (which can be 64 bits in
4631 * length) and the bma length request, which is
4632 * xfs_extlen_t and therefore 32 bits. Hence we have to
4633 * check for 32-bit overflows and handle them here.
4635 if (len > (xfs_filblks_t)MAXEXTLEN)
4636 bma.length = MAXEXTLEN;
4641 ASSERT(bma.length > 0);
4642 error = xfs_bmapi_allocate(&bma);
4645 if (bma.blkno == NULLFSBLOCK)
4649 * If this is a CoW allocation, record the data in
4650 * the refcount btree for orphan recovery.
4652 if (whichfork == XFS_COW_FORK) {
4653 error = xfs_refcount_alloc_cow_extent(mp, dfops,
4654 bma.blkno, bma.length);
4660 /* Deal with the allocated space we found. */
4661 xfs_bmapi_trim_map(mval, &bma.got, &bno, len, obno,
4664 /* Execute unwritten extent conversion if necessary */
4665 error = xfs_bmapi_convert_unwritten(&bma, mval, len, flags);
4666 if (error == -EAGAIN)
4671 /* update the extent map to return */
4672 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
4675 * If we're done, stop now. Stop when we've allocated
4676 * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise
4677 * the transaction may get too big.
4679 if (bno >= end || n >= *nmap || bma.nallocs >= *nmap)
4682 /* Else go on to the next record. */
4684 if (!xfs_iext_get_extent(ifp, ++bma.idx, &bma.got))
4690 * Transform from btree to extents, give it cur.
4692 if (xfs_bmap_wants_extents(ip, whichfork)) {
4693 int tmp_logflags = 0;
4696 error = xfs_bmap_btree_to_extents(tp, ip, bma.cur,
4697 &tmp_logflags, whichfork);
4698 bma.logflags |= tmp_logflags;
4703 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE ||
4704 XFS_IFORK_NEXTENTS(ip, whichfork) >
4705 XFS_IFORK_MAXEXT(ip, whichfork));
4709 * Log everything. Do this after conversion, there's no point in
4710 * logging the extent records if we've converted to btree format.
4712 if ((bma.logflags & xfs_ilog_fext(whichfork)) &&
4713 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
4714 bma.logflags &= ~xfs_ilog_fext(whichfork);
4715 else if ((bma.logflags & xfs_ilog_fbroot(whichfork)) &&
4716 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)
4717 bma.logflags &= ~xfs_ilog_fbroot(whichfork);
4719 * Log whatever the flags say, even if error. Otherwise we might miss
4720 * detecting a case where the data is changed, there's an error,
4721 * and it's not logged so we don't shutdown when we should.
4724 xfs_trans_log_inode(tp, ip, bma.logflags);
4728 ASSERT(*firstblock == NULLFSBLOCK ||
4729 XFS_FSB_TO_AGNO(mp, *firstblock) ==
4731 bma.cur->bc_private.b.firstblock) ||
4733 XFS_FSB_TO_AGNO(mp, *firstblock) <
4735 bma.cur->bc_private.b.firstblock)));
4736 *firstblock = bma.cur->bc_private.b.firstblock;
4738 xfs_btree_del_cursor(bma.cur,
4739 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
4742 xfs_bmap_validate_ret(orig_bno, orig_len, orig_flags, orig_mval,
4748 * When a delalloc extent is split (e.g., due to a hole punch), the original
4749 * indlen reservation must be shared across the two new extents that are left
4752 * Given the original reservation and the worst case indlen for the two new
4753 * extents (as calculated by xfs_bmap_worst_indlen()), split the original
4754 * reservation fairly across the two new extents. If necessary, steal available
4755 * blocks from a deleted extent to make up a reservation deficiency (e.g., if
4756 * ores == 1). The number of stolen blocks is returned. The availability and
4757 * subsequent accounting of stolen blocks is the responsibility of the caller.
4759 static xfs_filblks_t
4760 xfs_bmap_split_indlen(
4761 xfs_filblks_t ores, /* original res. */
4762 xfs_filblks_t *indlen1, /* ext1 worst indlen */
4763 xfs_filblks_t *indlen2, /* ext2 worst indlen */
4764 xfs_filblks_t avail) /* stealable blocks */
4766 xfs_filblks_t len1 = *indlen1;
4767 xfs_filblks_t len2 = *indlen2;
4768 xfs_filblks_t nres = len1 + len2; /* new total res. */
4769 xfs_filblks_t stolen = 0;
4772 * Steal as many blocks as we can to try and satisfy the worst case
4773 * indlen for both new extents.
4775 while (nres > ores && avail) {
4782 * The only blocks available are those reserved for the original
4783 * extent and what we can steal from the extent being removed.
4784 * If this still isn't enough to satisfy the combined
4785 * requirements for the two new extents, skim blocks off of each
4786 * of the new reservations until they match what is available.
4788 while (nres > ores) {
4808 xfs_bmap_del_extent_delay(
4809 struct xfs_inode *ip,
4812 struct xfs_bmbt_irec *got,
4813 struct xfs_bmbt_irec *del)
4815 struct xfs_mount *mp = ip->i_mount;
4816 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
4817 struct xfs_bmbt_irec new;
4818 int64_t da_old, da_new, da_diff = 0;
4819 xfs_fileoff_t del_endoff, got_endoff;
4820 xfs_filblks_t got_indlen, new_indlen, stolen;
4821 int error = 0, state = 0;
4824 XFS_STATS_INC(mp, xs_del_exlist);
4826 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
4827 del_endoff = del->br_startoff + del->br_blockcount;
4828 got_endoff = got->br_startoff + got->br_blockcount;
4829 da_old = startblockval(got->br_startblock);
4833 ASSERT(*idx <= xfs_iext_count(ifp));
4834 ASSERT(del->br_blockcount > 0);
4835 ASSERT(got->br_startoff <= del->br_startoff);
4836 ASSERT(got_endoff >= del_endoff);
4839 int64_t rtexts = XFS_FSB_TO_B(mp, del->br_blockcount);
4841 do_div(rtexts, mp->m_sb.sb_rextsize);
4842 xfs_mod_frextents(mp, rtexts);
4846 * Update the inode delalloc counter now and wait to update the
4847 * sb counters as we might have to borrow some blocks for the
4848 * indirect block accounting.
4850 error = xfs_trans_reserve_quota_nblks(NULL, ip,
4851 -((long)del->br_blockcount), 0,
4852 isrt ? XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS);
4855 ip->i_delayed_blks -= del->br_blockcount;
4857 if (whichfork == XFS_COW_FORK)
4858 state |= BMAP_COWFORK;
4860 if (got->br_startoff == del->br_startoff)
4861 state |= BMAP_LEFT_CONTIG;
4862 if (got_endoff == del_endoff)
4863 state |= BMAP_RIGHT_CONTIG;
4865 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
4866 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
4868 * Matches the whole extent. Delete the entry.
4870 xfs_iext_remove(ip, *idx, 1, state);
4873 case BMAP_LEFT_CONTIG:
4875 * Deleting the first part of the extent.
4877 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4878 got->br_startoff = del_endoff;
4879 got->br_blockcount -= del->br_blockcount;
4880 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip,
4881 got->br_blockcount), da_old);
4882 got->br_startblock = nullstartblock((int)da_new);
4883 xfs_bmbt_set_all(xfs_iext_get_ext(ifp, *idx), got);
4884 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4886 case BMAP_RIGHT_CONTIG:
4888 * Deleting the last part of the extent.
4890 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4891 got->br_blockcount = got->br_blockcount - del->br_blockcount;
4892 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip,
4893 got->br_blockcount), da_old);
4894 got->br_startblock = nullstartblock((int)da_new);
4895 xfs_bmbt_set_all(xfs_iext_get_ext(ifp, *idx), got);
4896 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4900 * Deleting the middle of the extent.
4902 * Distribute the original indlen reservation across the two new
4903 * extents. Steal blocks from the deleted extent if necessary.
4904 * Stealing blocks simply fudges the fdblocks accounting below.
4905 * Warn if either of the new indlen reservations is zero as this
4906 * can lead to delalloc problems.
4908 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4910 got->br_blockcount = del->br_startoff - got->br_startoff;
4911 got_indlen = xfs_bmap_worst_indlen(ip, got->br_blockcount);
4913 new.br_blockcount = got_endoff - del_endoff;
4914 new_indlen = xfs_bmap_worst_indlen(ip, new.br_blockcount);
4916 WARN_ON_ONCE(!got_indlen || !new_indlen);
4917 stolen = xfs_bmap_split_indlen(da_old, &got_indlen, &new_indlen,
4918 del->br_blockcount);
4920 got->br_startblock = nullstartblock((int)got_indlen);
4921 xfs_bmbt_set_all(xfs_iext_get_ext(ifp, *idx), got);
4922 trace_xfs_bmap_post_update(ip, *idx, 0, _THIS_IP_);
4924 new.br_startoff = del_endoff;
4925 new.br_state = got->br_state;
4926 new.br_startblock = nullstartblock((int)new_indlen);
4929 xfs_iext_insert(ip, *idx, 1, &new, state);
4931 da_new = got_indlen + new_indlen - stolen;
4932 del->br_blockcount -= stolen;
4936 ASSERT(da_old >= da_new);
4937 da_diff = da_old - da_new;
4939 da_diff += del->br_blockcount;
4941 xfs_mod_fdblocks(mp, da_diff, false);
4946 xfs_bmap_del_extent_cow(
4947 struct xfs_inode *ip,
4949 struct xfs_bmbt_irec *got,
4950 struct xfs_bmbt_irec *del)
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;
4958 XFS_STATS_INC(mp, xs_del_exlist);
4960 del_endoff = del->br_startoff + del->br_blockcount;
4961 got_endoff = got->br_startoff + got->br_blockcount;
4964 ASSERT(*idx <= xfs_iext_count(ifp));
4965 ASSERT(del->br_blockcount > 0);
4966 ASSERT(got->br_startoff <= del->br_startoff);
4967 ASSERT(got_endoff >= del_endoff);
4968 ASSERT(!isnullstartblock(got->br_startblock));
4970 if (got->br_startoff == del->br_startoff)
4971 state |= BMAP_LEFT_CONTIG;
4972 if (got_endoff == del_endoff)
4973 state |= BMAP_RIGHT_CONTIG;
4975 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
4976 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
4978 * Matches the whole extent. Delete the entry.
4980 xfs_iext_remove(ip, *idx, 1, state);
4983 case BMAP_LEFT_CONTIG:
4985 * Deleting the first part of the extent.
4987 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4988 got->br_startoff = del_endoff;
4989 got->br_blockcount -= del->br_blockcount;
4990 got->br_startblock = del->br_startblock + del->br_blockcount;
4991 xfs_bmbt_set_all(xfs_iext_get_ext(ifp, *idx), got);
4992 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4994 case BMAP_RIGHT_CONTIG:
4996 * Deleting the last part of the extent.
4998 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4999 got->br_blockcount -= del->br_blockcount;
5000 xfs_bmbt_set_all(xfs_iext_get_ext(ifp, *idx), got);
5001 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5005 * Deleting the middle of the extent.
5007 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
5008 got->br_blockcount = del->br_startoff - got->br_startoff;
5009 xfs_bmbt_set_all(xfs_iext_get_ext(ifp, *idx), got);
5010 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5012 new.br_startoff = del_endoff;
5013 new.br_blockcount = got_endoff - del_endoff;
5014 new.br_state = got->br_state;
5015 new.br_startblock = del->br_startblock + del->br_blockcount;
5018 xfs_iext_insert(ip, *idx, 1, &new, state);
5024 * Called by xfs_bmapi to update file extent records and the btree
5025 * after removing space (or undoing a delayed allocation).
5027 STATIC int /* error */
5028 xfs_bmap_del_extent(
5029 xfs_inode_t *ip, /* incore inode pointer */
5030 xfs_trans_t *tp, /* current transaction pointer */
5031 xfs_extnum_t *idx, /* extent number to update/delete */
5032 struct xfs_defer_ops *dfops, /* list of extents to be freed */
5033 xfs_btree_cur_t *cur, /* if null, not a btree */
5034 xfs_bmbt_irec_t *del, /* data to remove from extents */
5035 int *logflagsp, /* inode logging flags */
5036 int whichfork, /* data or attr fork */
5037 int bflags) /* bmapi flags */
5039 xfs_filblks_t da_new; /* new delay-alloc indirect blocks */
5040 xfs_filblks_t da_old; /* old delay-alloc indirect blocks */
5041 xfs_fsblock_t del_endblock=0; /* first block past del */
5042 xfs_fileoff_t del_endoff; /* first offset past del */
5043 int delay; /* current block is delayed allocated */
5044 int do_fx; /* free extent at end of routine */
5045 xfs_bmbt_rec_host_t *ep; /* current extent entry pointer */
5046 int error; /* error return value */
5047 int flags; /* inode logging flags */
5048 xfs_bmbt_irec_t got; /* current extent entry */
5049 xfs_fileoff_t got_endoff; /* first offset past got */
5050 int i; /* temp state */
5051 xfs_ifork_t *ifp; /* inode fork pointer */
5052 xfs_mount_t *mp; /* mount structure */
5053 xfs_filblks_t nblks; /* quota/sb block count */
5054 xfs_bmbt_irec_t new; /* new record to be inserted */
5056 uint qfield; /* quota field to update */
5057 xfs_filblks_t temp; /* for indirect length calculations */
5058 xfs_filblks_t temp2; /* for indirect length calculations */
5062 XFS_STATS_INC(mp, xs_del_exlist);
5064 if (whichfork == XFS_ATTR_FORK)
5065 state |= BMAP_ATTRFORK;
5066 else if (whichfork == XFS_COW_FORK)
5067 state |= BMAP_COWFORK;
5069 ifp = XFS_IFORK_PTR(ip, whichfork);
5070 ASSERT((*idx >= 0) && (*idx < xfs_iext_count(ifp)));
5071 ASSERT(del->br_blockcount > 0);
5072 ep = xfs_iext_get_ext(ifp, *idx);
5073 xfs_bmbt_get_all(ep, &got);
5074 ASSERT(got.br_startoff <= del->br_startoff);
5075 del_endoff = del->br_startoff + del->br_blockcount;
5076 got_endoff = got.br_startoff + got.br_blockcount;
5077 ASSERT(got_endoff >= del_endoff);
5078 delay = isnullstartblock(got.br_startblock);
5079 ASSERT(isnullstartblock(del->br_startblock) == delay);
5084 * If deleting a real allocation, must free up the disk space.
5087 flags = XFS_ILOG_CORE;
5089 * Realtime allocation. Free it and record di_nblocks update.
5091 if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) {
5095 ASSERT(do_mod(del->br_blockcount,
5096 mp->m_sb.sb_rextsize) == 0);
5097 ASSERT(do_mod(del->br_startblock,
5098 mp->m_sb.sb_rextsize) == 0);
5099 bno = del->br_startblock;
5100 len = del->br_blockcount;
5101 do_div(bno, mp->m_sb.sb_rextsize);
5102 do_div(len, mp->m_sb.sb_rextsize);
5103 error = xfs_rtfree_extent(tp, bno, (xfs_extlen_t)len);
5107 nblks = len * mp->m_sb.sb_rextsize;
5108 qfield = XFS_TRANS_DQ_RTBCOUNT;
5111 * Ordinary allocation.
5115 nblks = del->br_blockcount;
5116 qfield = XFS_TRANS_DQ_BCOUNT;
5119 * Set up del_endblock and cur for later.
5121 del_endblock = del->br_startblock + del->br_blockcount;
5123 if ((error = xfs_bmbt_lookup_eq(cur, got.br_startoff,
5124 got.br_startblock, got.br_blockcount,
5127 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
5129 da_old = da_new = 0;
5131 da_old = startblockval(got.br_startblock);
5138 * Set flag value to use in switch statement.
5139 * Left-contig is 2, right-contig is 1.
5141 switch (((got.br_startoff == del->br_startoff) << 1) |
5142 (got_endoff == del_endoff)) {
5145 * Matches the whole extent. Delete the entry.
5147 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
5148 xfs_iext_remove(ip, *idx, 1,
5149 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0);
5154 XFS_IFORK_NEXT_SET(ip, whichfork,
5155 XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
5156 flags |= XFS_ILOG_CORE;
5158 flags |= xfs_ilog_fext(whichfork);
5161 if ((error = xfs_btree_delete(cur, &i)))
5163 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
5168 * Deleting the first part of the extent.
5170 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
5171 xfs_bmbt_set_startoff(ep, del_endoff);
5172 temp = got.br_blockcount - del->br_blockcount;
5173 xfs_bmbt_set_blockcount(ep, temp);
5175 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
5177 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
5178 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5182 xfs_bmbt_set_startblock(ep, del_endblock);
5183 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5185 flags |= xfs_ilog_fext(whichfork);
5188 if ((error = xfs_bmbt_update(cur, del_endoff, del_endblock,
5189 got.br_blockcount - del->br_blockcount,
5196 * Deleting the last part of the extent.
5198 temp = got.br_blockcount - del->br_blockcount;
5199 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
5200 xfs_bmbt_set_blockcount(ep, temp);
5202 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
5204 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
5205 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5209 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5211 flags |= xfs_ilog_fext(whichfork);
5214 if ((error = xfs_bmbt_update(cur, got.br_startoff,
5216 got.br_blockcount - del->br_blockcount,
5223 * Deleting the middle of the extent.
5225 temp = del->br_startoff - got.br_startoff;
5226 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
5227 xfs_bmbt_set_blockcount(ep, temp);
5228 new.br_startoff = del_endoff;
5229 temp2 = got_endoff - del_endoff;
5230 new.br_blockcount = temp2;
5231 new.br_state = got.br_state;
5233 new.br_startblock = del_endblock;
5234 flags |= XFS_ILOG_CORE;
5236 if ((error = xfs_bmbt_update(cur,
5238 got.br_startblock, temp,
5241 if ((error = xfs_btree_increment(cur, 0, &i)))
5243 cur->bc_rec.b = new;
5244 error = xfs_btree_insert(cur, &i);
5245 if (error && error != -ENOSPC)
5248 * If get no-space back from btree insert,
5249 * it tried a split, and we have a zero
5250 * block reservation.
5251 * Fix up our state and return the error.
5253 if (error == -ENOSPC) {
5255 * Reset the cursor, don't trust
5256 * it after any insert operation.
5258 if ((error = xfs_bmbt_lookup_eq(cur,
5263 XFS_WANT_CORRUPTED_GOTO(mp,
5266 * Update the btree record back
5267 * to the original value.
5269 if ((error = xfs_bmbt_update(cur,
5276 * Reset the extent record back
5277 * to the original value.
5279 xfs_bmbt_set_blockcount(ep,
5285 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
5287 flags |= xfs_ilog_fext(whichfork);
5288 XFS_IFORK_NEXT_SET(ip, whichfork,
5289 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
5291 xfs_filblks_t stolen;
5292 ASSERT(whichfork == XFS_DATA_FORK);
5295 * Distribute the original indlen reservation across the
5296 * two new extents. Steal blocks from the deleted extent
5297 * if necessary. Stealing blocks simply fudges the
5298 * fdblocks accounting in xfs_bunmapi().
5300 temp = xfs_bmap_worst_indlen(ip, got.br_blockcount);
5301 temp2 = xfs_bmap_worst_indlen(ip, new.br_blockcount);
5302 stolen = xfs_bmap_split_indlen(da_old, &temp, &temp2,
5303 del->br_blockcount);
5304 da_new = temp + temp2 - stolen;
5305 del->br_blockcount -= stolen;
5308 * Set the reservation for each extent. Warn if either
5309 * is zero as this can lead to delalloc problems.
5311 WARN_ON_ONCE(!temp || !temp2);
5312 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
5313 new.br_startblock = nullstartblock((int)temp2);
5315 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
5316 xfs_iext_insert(ip, *idx + 1, 1, &new, state);
5321 /* remove reverse mapping */
5323 error = xfs_rmap_unmap_extent(mp, dfops, ip, whichfork, del);
5329 * If we need to, add to list of extents to delete.
5331 if (do_fx && !(bflags & XFS_BMAPI_REMAP)) {
5332 if (xfs_is_reflink_inode(ip) && whichfork == XFS_DATA_FORK) {
5333 error = xfs_refcount_decrease_extent(mp, dfops, del);
5337 xfs_bmap_add_free(mp, dfops, del->br_startblock,
5338 del->br_blockcount, NULL);
5342 * Adjust inode # blocks in the file.
5345 ip->i_d.di_nblocks -= nblks;
5347 * Adjust quota data.
5349 if (qfield && !(bflags & XFS_BMAPI_REMAP))
5350 xfs_trans_mod_dquot_byino(tp, ip, qfield, (long)-nblks);
5353 * Account for change in delayed indirect blocks.
5354 * Nothing to do for disk quota accounting here.
5356 ASSERT(da_old >= da_new);
5357 if (da_old > da_new)
5358 xfs_mod_fdblocks(mp, (int64_t)(da_old - da_new), false);
5365 * Unmap (remove) blocks from a file.
5366 * If nexts is nonzero then the number of extents to remove is limited to
5367 * that value. If not all extents in the block range can be removed then
5372 xfs_trans_t *tp, /* transaction pointer */
5373 struct xfs_inode *ip, /* incore inode */
5374 xfs_fileoff_t bno, /* starting offset to unmap */
5375 xfs_filblks_t *rlen, /* i/o: amount remaining */
5376 int flags, /* misc flags */
5377 xfs_extnum_t nexts, /* number of extents max */
5378 xfs_fsblock_t *firstblock, /* first allocated block
5379 controls a.g. for allocs */
5380 struct xfs_defer_ops *dfops) /* i/o: deferred updates */
5382 xfs_btree_cur_t *cur; /* bmap btree cursor */
5383 xfs_bmbt_irec_t del; /* extent being deleted */
5384 int error; /* error return value */
5385 xfs_extnum_t extno; /* extent number in list */
5386 xfs_bmbt_irec_t got; /* current extent record */
5387 xfs_ifork_t *ifp; /* inode fork pointer */
5388 int isrt; /* freeing in rt area */
5389 xfs_extnum_t lastx; /* last extent index used */
5390 int logflags; /* transaction logging flags */
5391 xfs_extlen_t mod; /* rt extent offset */
5392 xfs_mount_t *mp; /* mount structure */
5393 xfs_fileoff_t start; /* first file offset deleted */
5394 int tmp_logflags; /* partial logging flags */
5395 int wasdel; /* was a delayed alloc extent */
5396 int whichfork; /* data or attribute fork */
5398 xfs_filblks_t len = *rlen; /* length to unmap in file */
5400 trace_xfs_bunmap(ip, bno, len, flags, _RET_IP_);
5402 whichfork = xfs_bmapi_whichfork(flags);
5403 ASSERT(whichfork != XFS_COW_FORK);
5404 ifp = XFS_IFORK_PTR(ip, whichfork);
5406 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
5407 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)) {
5408 XFS_ERROR_REPORT("xfs_bunmapi", XFS_ERRLEVEL_LOW,
5410 return -EFSCORRUPTED;
5413 if (XFS_FORCED_SHUTDOWN(mp))
5416 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5420 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
5421 (error = xfs_iread_extents(tp, ip, whichfork)))
5423 if (xfs_iext_count(ifp) == 0) {
5427 XFS_STATS_INC(mp, xs_blk_unmap);
5428 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
5430 bno = start + len - 1;
5433 * Check to see if the given block number is past the end of the
5434 * file, back up to the last block if so...
5436 if (!xfs_iext_lookup_extent(ip, ifp, bno, &lastx, &got)) {
5438 xfs_iext_get_extent(ifp, --lastx, &got);
5439 bno = got.br_startoff + got.br_blockcount - 1;
5443 if (ifp->if_flags & XFS_IFBROOT) {
5444 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
5445 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5446 cur->bc_private.b.firstblock = *firstblock;
5447 cur->bc_private.b.dfops = dfops;
5448 cur->bc_private.b.flags = 0;
5454 * Synchronize by locking the bitmap inode.
5456 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL|XFS_ILOCK_RTBITMAP);
5457 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
5458 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL|XFS_ILOCK_RTSUM);
5459 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
5463 while (bno != (xfs_fileoff_t)-1 && bno >= start && lastx >= 0 &&
5464 (nexts == 0 || extno < nexts)) {
5466 * Is the found extent after a hole in which bno lives?
5467 * Just back up to the previous extent, if so.
5469 if (got.br_startoff > bno) {
5472 xfs_iext_get_extent(ifp, lastx, &got);
5475 * Is the last block of this extent before the range
5476 * we're supposed to delete? If so, we're done.
5478 bno = XFS_FILEOFF_MIN(bno,
5479 got.br_startoff + got.br_blockcount - 1);
5483 * Then deal with the (possibly delayed) allocated space
5487 wasdel = isnullstartblock(del.br_startblock);
5488 if (got.br_startoff < start) {
5489 del.br_startoff = start;
5490 del.br_blockcount -= start - got.br_startoff;
5492 del.br_startblock += start - got.br_startoff;
5494 if (del.br_startoff + del.br_blockcount > bno + 1)
5495 del.br_blockcount = bno + 1 - del.br_startoff;
5496 sum = del.br_startblock + del.br_blockcount;
5498 (mod = do_mod(sum, mp->m_sb.sb_rextsize))) {
5500 * Realtime extent not lined up at the end.
5501 * The extent could have been split into written
5502 * and unwritten pieces, or we could just be
5503 * unmapping part of it. But we can't really
5504 * get rid of part of a realtime extent.
5506 if (del.br_state == XFS_EXT_UNWRITTEN ||
5507 !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
5509 * This piece is unwritten, or we're not
5510 * using unwritten extents. Skip over it.
5513 bno -= mod > del.br_blockcount ?
5514 del.br_blockcount : mod;
5515 if (bno < got.br_startoff) {
5517 xfs_bmbt_get_all(xfs_iext_get_ext(
5523 * It's written, turn it unwritten.
5524 * This is better than zeroing it.
5526 ASSERT(del.br_state == XFS_EXT_NORM);
5527 ASSERT(tp->t_blk_res > 0);
5529 * If this spans a realtime extent boundary,
5530 * chop it back to the start of the one we end at.
5532 if (del.br_blockcount > mod) {
5533 del.br_startoff += del.br_blockcount - mod;
5534 del.br_startblock += del.br_blockcount - mod;
5535 del.br_blockcount = mod;
5537 del.br_state = XFS_EXT_UNWRITTEN;
5538 error = xfs_bmap_add_extent_unwritten_real(tp, ip,
5539 &lastx, &cur, &del, firstblock, dfops,
5545 if (isrt && (mod = do_mod(del.br_startblock, mp->m_sb.sb_rextsize))) {
5547 * Realtime extent is lined up at the end but not
5548 * at the front. We'll get rid of full extents if
5551 mod = mp->m_sb.sb_rextsize - mod;
5552 if (del.br_blockcount > mod) {
5553 del.br_blockcount -= mod;
5554 del.br_startoff += mod;
5555 del.br_startblock += mod;
5556 } else if ((del.br_startoff == start &&
5557 (del.br_state == XFS_EXT_UNWRITTEN ||
5558 tp->t_blk_res == 0)) ||
5559 !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
5561 * Can't make it unwritten. There isn't
5562 * a full extent here so just skip it.
5564 ASSERT(bno >= del.br_blockcount);
5565 bno -= del.br_blockcount;
5566 if (got.br_startoff > bno && --lastx >= 0)
5567 xfs_iext_get_extent(ifp, lastx, &got);
5569 } else if (del.br_state == XFS_EXT_UNWRITTEN) {
5570 struct xfs_bmbt_irec prev;
5573 * This one is already unwritten.
5574 * It must have a written left neighbor.
5575 * Unwrite the killed part of that one and
5579 xfs_iext_get_extent(ifp, lastx - 1, &prev);
5580 ASSERT(prev.br_state == XFS_EXT_NORM);
5581 ASSERT(!isnullstartblock(prev.br_startblock));
5582 ASSERT(del.br_startblock ==
5583 prev.br_startblock + prev.br_blockcount);
5584 if (prev.br_startoff < start) {
5585 mod = start - prev.br_startoff;
5586 prev.br_blockcount -= mod;
5587 prev.br_startblock += mod;
5588 prev.br_startoff = start;
5590 prev.br_state = XFS_EXT_UNWRITTEN;
5592 error = xfs_bmap_add_extent_unwritten_real(tp,
5593 ip, &lastx, &cur, &prev,
5594 firstblock, dfops, &logflags);
5599 ASSERT(del.br_state == XFS_EXT_NORM);
5600 del.br_state = XFS_EXT_UNWRITTEN;
5601 error = xfs_bmap_add_extent_unwritten_real(tp,
5602 ip, &lastx, &cur, &del,
5603 firstblock, dfops, &logflags);
5611 * If it's the case where the directory code is running
5612 * with no block reservation, and the deleted block is in
5613 * the middle of its extent, and the resulting insert
5614 * of an extent would cause transformation to btree format,
5615 * then reject it. The calling code will then swap
5616 * blocks around instead.
5617 * We have to do this now, rather than waiting for the
5618 * conversion to btree format, since the transaction
5621 if (!wasdel && tp->t_blk_res == 0 &&
5622 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
5623 XFS_IFORK_NEXTENTS(ip, whichfork) >= /* Note the >= */
5624 XFS_IFORK_MAXEXT(ip, whichfork) &&
5625 del.br_startoff > got.br_startoff &&
5626 del.br_startoff + del.br_blockcount <
5627 got.br_startoff + got.br_blockcount) {
5633 * Unreserve quota and update realtime free space, if
5634 * appropriate. If delayed allocation, update the inode delalloc
5635 * counter now and wait to update the sb counters as
5636 * xfs_bmap_del_extent() might need to borrow some blocks.
5639 ASSERT(startblockval(del.br_startblock) > 0);
5641 xfs_filblks_t rtexts;
5643 rtexts = XFS_FSB_TO_B(mp, del.br_blockcount);
5644 do_div(rtexts, mp->m_sb.sb_rextsize);
5645 xfs_mod_frextents(mp, (int64_t)rtexts);
5646 (void)xfs_trans_reserve_quota_nblks(NULL,
5647 ip, -((long)del.br_blockcount), 0,
5648 XFS_QMOPT_RES_RTBLKS);
5650 (void)xfs_trans_reserve_quota_nblks(NULL,
5651 ip, -((long)del.br_blockcount), 0,
5652 XFS_QMOPT_RES_REGBLKS);
5654 ip->i_delayed_blks -= del.br_blockcount;
5656 cur->bc_private.b.flags |=
5657 XFS_BTCUR_BPRV_WASDEL;
5659 cur->bc_private.b.flags &= ~XFS_BTCUR_BPRV_WASDEL;
5661 error = xfs_bmap_del_extent(ip, tp, &lastx, dfops, cur, &del,
5662 &tmp_logflags, whichfork, flags);
5663 logflags |= tmp_logflags;
5667 if (!isrt && wasdel)
5668 xfs_mod_fdblocks(mp, (int64_t)del.br_blockcount, false);
5670 bno = del.br_startoff - 1;
5673 * If not done go on to the next (previous) record.
5675 if (bno != (xfs_fileoff_t)-1 && bno >= start) {
5677 xfs_iext_get_extent(ifp, lastx, &got);
5678 if (got.br_startoff > bno && --lastx >= 0)
5679 xfs_iext_get_extent(ifp, lastx, &got);
5684 if (bno == (xfs_fileoff_t)-1 || bno < start || lastx < 0)
5687 *rlen = bno - start + 1;
5690 * Convert to a btree if necessary.
5692 if (xfs_bmap_needs_btree(ip, whichfork)) {
5693 ASSERT(cur == NULL);
5694 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, dfops,
5695 &cur, 0, &tmp_logflags, whichfork);
5696 logflags |= tmp_logflags;
5701 * transform from btree to extents, give it cur
5703 else if (xfs_bmap_wants_extents(ip, whichfork)) {
5704 ASSERT(cur != NULL);
5705 error = xfs_bmap_btree_to_extents(tp, ip, cur, &tmp_logflags,
5707 logflags |= tmp_logflags;
5712 * transform from extents to local?
5717 * Log everything. Do this after conversion, there's no point in
5718 * logging the extent records if we've converted to btree format.
5720 if ((logflags & xfs_ilog_fext(whichfork)) &&
5721 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
5722 logflags &= ~xfs_ilog_fext(whichfork);
5723 else if ((logflags & xfs_ilog_fbroot(whichfork)) &&
5724 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)
5725 logflags &= ~xfs_ilog_fbroot(whichfork);
5727 * Log inode even in the error case, if the transaction
5728 * is dirty we'll need to shut down the filesystem.
5731 xfs_trans_log_inode(tp, ip, logflags);
5734 *firstblock = cur->bc_private.b.firstblock;
5735 cur->bc_private.b.allocated = 0;
5737 xfs_btree_del_cursor(cur,
5738 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
5743 /* Unmap a range of a file. */
5747 struct xfs_inode *ip,
5752 xfs_fsblock_t *firstblock,
5753 struct xfs_defer_ops *dfops,
5758 error = __xfs_bunmapi(tp, ip, bno, &len, flags, nexts, firstblock,
5765 * Determine whether an extent shift can be accomplished by a merge with the
5766 * extent that precedes the target hole of the shift.
5770 struct xfs_bmbt_irec *left, /* preceding extent */
5771 struct xfs_bmbt_irec *got, /* current extent to shift */
5772 xfs_fileoff_t shift) /* shift fsb */
5774 xfs_fileoff_t startoff;
5776 startoff = got->br_startoff - shift;
5779 * The extent, once shifted, must be adjacent in-file and on-disk with
5780 * the preceding extent.
5782 if ((left->br_startoff + left->br_blockcount != startoff) ||
5783 (left->br_startblock + left->br_blockcount != got->br_startblock) ||
5784 (left->br_state != got->br_state) ||
5785 (left->br_blockcount + got->br_blockcount > MAXEXTLEN))
5792 * A bmap extent shift adjusts the file offset of an extent to fill a preceding
5793 * hole in the file. If an extent shift would result in the extent being fully
5794 * adjacent to the extent that currently precedes the hole, we can merge with
5795 * the preceding extent rather than do the shift.
5797 * This function assumes the caller has verified a shift-by-merge is possible
5798 * with the provided extents via xfs_bmse_can_merge().
5802 struct xfs_inode *ip,
5804 xfs_fileoff_t shift, /* shift fsb */
5805 int current_ext, /* idx of gotp */
5806 struct xfs_bmbt_rec_host *gotp, /* extent to shift */
5807 struct xfs_bmbt_rec_host *leftp, /* preceding extent */
5808 struct xfs_btree_cur *cur,
5809 int *logflags) /* output */
5811 struct xfs_bmbt_irec got;
5812 struct xfs_bmbt_irec left;
5813 xfs_filblks_t blockcount;
5815 struct xfs_mount *mp = ip->i_mount;
5817 xfs_bmbt_get_all(gotp, &got);
5818 xfs_bmbt_get_all(leftp, &left);
5819 blockcount = left.br_blockcount + got.br_blockcount;
5821 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
5822 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5823 ASSERT(xfs_bmse_can_merge(&left, &got, shift));
5826 * Merge the in-core extents. Note that the host record pointers and
5827 * current_ext index are invalid once the extent has been removed via
5828 * xfs_iext_remove().
5830 xfs_bmbt_set_blockcount(leftp, blockcount);
5831 xfs_iext_remove(ip, current_ext, 1, 0);
5834 * Update the on-disk extent count, the btree if necessary and log the
5837 XFS_IFORK_NEXT_SET(ip, whichfork,
5838 XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
5839 *logflags |= XFS_ILOG_CORE;
5841 *logflags |= XFS_ILOG_DEXT;
5845 /* lookup and remove the extent to merge */
5846 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, got.br_startblock,
5847 got.br_blockcount, &i);
5850 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5852 error = xfs_btree_delete(cur, &i);
5855 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5857 /* lookup and update size of the previous extent */
5858 error = xfs_bmbt_lookup_eq(cur, left.br_startoff, left.br_startblock,
5859 left.br_blockcount, &i);
5862 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5864 left.br_blockcount = blockcount;
5866 return xfs_bmbt_update(cur, left.br_startoff, left.br_startblock,
5867 left.br_blockcount, left.br_state);
5871 * Shift a single extent.
5875 struct xfs_inode *ip,
5877 xfs_fileoff_t offset_shift_fsb,
5879 struct xfs_bmbt_rec_host *gotp,
5880 struct xfs_btree_cur *cur,
5882 enum shift_direction direction,
5883 struct xfs_defer_ops *dfops)
5885 struct xfs_ifork *ifp;
5886 struct xfs_mount *mp;
5887 xfs_fileoff_t startoff;
5888 struct xfs_bmbt_rec_host *adj_irecp;
5889 struct xfs_bmbt_irec got;
5890 struct xfs_bmbt_irec adj_irec;
5896 ifp = XFS_IFORK_PTR(ip, whichfork);
5897 total_extents = xfs_iext_count(ifp);
5899 xfs_bmbt_get_all(gotp, &got);
5901 /* delalloc extents should be prevented by caller */
5902 XFS_WANT_CORRUPTED_RETURN(mp, !isnullstartblock(got.br_startblock));
5904 if (direction == SHIFT_LEFT) {
5905 startoff = got.br_startoff - offset_shift_fsb;
5908 * Check for merge if we've got an extent to the left,
5909 * otherwise make sure there's enough room at the start
5910 * of the file for the shift.
5912 if (!*current_ext) {
5913 if (got.br_startoff < offset_shift_fsb)
5915 goto update_current_ext;
5918 * grab the left extent and check for a large
5921 adj_irecp = xfs_iext_get_ext(ifp, *current_ext - 1);
5922 xfs_bmbt_get_all(adj_irecp, &adj_irec);
5925 adj_irec.br_startoff + adj_irec.br_blockcount)
5928 /* check whether to merge the extent or shift it down */
5929 if (xfs_bmse_can_merge(&adj_irec, &got,
5930 offset_shift_fsb)) {
5931 error = xfs_bmse_merge(ip, whichfork, offset_shift_fsb,
5932 *current_ext, gotp, adj_irecp,
5940 startoff = got.br_startoff + offset_shift_fsb;
5941 /* nothing to move if this is the last extent */
5942 if (*current_ext >= (total_extents - 1))
5943 goto update_current_ext;
5945 * If this is not the last extent in the file, make sure there
5946 * is enough room between current extent and next extent for
5947 * accommodating the shift.
5949 adj_irecp = xfs_iext_get_ext(ifp, *current_ext + 1);
5950 xfs_bmbt_get_all(adj_irecp, &adj_irec);
5951 if (startoff + got.br_blockcount > adj_irec.br_startoff)
5954 * Unlike a left shift (which involves a hole punch),
5955 * a right shift does not modify extent neighbors
5956 * in any way. We should never find mergeable extents
5957 * in this scenario. Check anyways and warn if we
5958 * encounter two extents that could be one.
5960 if (xfs_bmse_can_merge(&got, &adj_irec, offset_shift_fsb))
5964 * Increment the extent index for the next iteration, update the start
5965 * offset of the in-core extent and update the btree if applicable.
5968 if (direction == SHIFT_LEFT)
5972 xfs_bmbt_set_startoff(gotp, startoff);
5973 *logflags |= XFS_ILOG_CORE;
5976 *logflags |= XFS_ILOG_DEXT;
5980 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, got.br_startblock,
5981 got.br_blockcount, &i);
5984 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5986 got.br_startoff = startoff;
5987 error = xfs_bmbt_update(cur, got.br_startoff, got.br_startblock,
5988 got.br_blockcount, got.br_state);
5993 /* update reverse mapping */
5994 error = xfs_rmap_unmap_extent(mp, dfops, ip, whichfork, &adj_irec);
5997 adj_irec.br_startoff = startoff;
5998 return xfs_rmap_map_extent(mp, dfops, ip, whichfork, &adj_irec);
6002 * Shift extent records to the left/right to cover/create a hole.
6004 * The maximum number of extents to be shifted in a single operation is
6005 * @num_exts. @stop_fsb specifies the file offset at which to stop shift and the
6006 * file offset where we've left off is returned in @next_fsb. @offset_shift_fsb
6007 * is the length by which each extent is shifted. If there is no hole to shift
6008 * the extents into, this will be considered invalid operation and we abort
6012 xfs_bmap_shift_extents(
6013 struct xfs_trans *tp,
6014 struct xfs_inode *ip,
6015 xfs_fileoff_t *next_fsb,
6016 xfs_fileoff_t offset_shift_fsb,
6018 xfs_fileoff_t stop_fsb,
6019 xfs_fsblock_t *firstblock,
6020 struct xfs_defer_ops *dfops,
6021 enum shift_direction direction,
6024 struct xfs_btree_cur *cur = NULL;
6025 struct xfs_bmbt_rec_host *gotp;
6026 struct xfs_bmbt_irec got;
6027 struct xfs_mount *mp = ip->i_mount;
6028 struct xfs_ifork *ifp;
6029 xfs_extnum_t nexts = 0;
6030 xfs_extnum_t current_ext;
6031 xfs_extnum_t total_extents;
6032 xfs_extnum_t stop_extent;
6034 int whichfork = XFS_DATA_FORK;
6037 if (unlikely(XFS_TEST_ERROR(
6038 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
6039 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
6040 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
6041 XFS_ERROR_REPORT("xfs_bmap_shift_extents",
6042 XFS_ERRLEVEL_LOW, mp);
6043 return -EFSCORRUPTED;
6046 if (XFS_FORCED_SHUTDOWN(mp))
6049 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
6050 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
6051 ASSERT(direction == SHIFT_LEFT || direction == SHIFT_RIGHT);
6052 ASSERT(*next_fsb != NULLFSBLOCK || direction == SHIFT_RIGHT);
6054 ifp = XFS_IFORK_PTR(ip, whichfork);
6055 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
6056 /* Read in all the extents */
6057 error = xfs_iread_extents(tp, ip, whichfork);
6062 if (ifp->if_flags & XFS_IFBROOT) {
6063 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
6064 cur->bc_private.b.firstblock = *firstblock;
6065 cur->bc_private.b.dfops = dfops;
6066 cur->bc_private.b.flags = 0;
6070 * There may be delalloc extents in the data fork before the range we
6071 * are collapsing out, so we cannot use the count of real extents here.
6072 * Instead we have to calculate it from the incore fork.
6074 total_extents = xfs_iext_count(ifp);
6075 if (total_extents == 0) {
6081 * In case of first right shift, we need to initialize next_fsb
6083 if (*next_fsb == NULLFSBLOCK) {
6084 gotp = xfs_iext_get_ext(ifp, total_extents - 1);
6085 xfs_bmbt_get_all(gotp, &got);
6086 *next_fsb = got.br_startoff;
6087 if (stop_fsb > *next_fsb) {
6093 /* Lookup the extent index at which we have to stop */
6094 if (direction == SHIFT_RIGHT) {
6095 gotp = xfs_iext_bno_to_ext(ifp, stop_fsb, &stop_extent);
6096 /* Make stop_extent exclusive of shift range */
6099 stop_extent = total_extents;
6102 * Look up the extent index for the fsb where we start shifting. We can
6103 * henceforth iterate with current_ext as extent list changes are locked
6106 * gotp can be null in 2 cases: 1) if there are no extents or 2)
6107 * *next_fsb lies in a hole beyond which there are no extents. Either
6110 gotp = xfs_iext_bno_to_ext(ifp, *next_fsb, ¤t_ext);
6116 /* some sanity checking before we finally start shifting extents */
6117 if ((direction == SHIFT_LEFT && current_ext >= stop_extent) ||
6118 (direction == SHIFT_RIGHT && current_ext <= stop_extent)) {
6123 while (nexts++ < num_exts) {
6124 error = xfs_bmse_shift_one(ip, whichfork, offset_shift_fsb,
6125 ¤t_ext, gotp, cur, &logflags,
6130 * If there was an extent merge during the shift, the extent
6131 * count can change. Update the total and grade the next record.
6133 if (direction == SHIFT_LEFT) {
6134 total_extents = xfs_iext_count(ifp);
6135 stop_extent = total_extents;
6138 if (current_ext == stop_extent) {
6140 *next_fsb = NULLFSBLOCK;
6143 gotp = xfs_iext_get_ext(ifp, current_ext);
6147 xfs_bmbt_get_all(gotp, &got);
6148 *next_fsb = got.br_startoff;
6153 xfs_btree_del_cursor(cur,
6154 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
6157 xfs_trans_log_inode(tp, ip, logflags);
6163 * Splits an extent into two extents at split_fsb block such that it is
6164 * the first block of the current_ext. @current_ext is a target extent
6165 * to be split. @split_fsb is a block where the extents is split.
6166 * If split_fsb lies in a hole or the first block of extents, just return 0.
6169 xfs_bmap_split_extent_at(
6170 struct xfs_trans *tp,
6171 struct xfs_inode *ip,
6172 xfs_fileoff_t split_fsb,
6173 xfs_fsblock_t *firstfsb,
6174 struct xfs_defer_ops *dfops)
6176 int whichfork = XFS_DATA_FORK;
6177 struct xfs_btree_cur *cur = NULL;
6178 struct xfs_bmbt_rec_host *gotp;
6179 struct xfs_bmbt_irec got;
6180 struct xfs_bmbt_irec new; /* split extent */
6181 struct xfs_mount *mp = ip->i_mount;
6182 struct xfs_ifork *ifp;
6183 xfs_fsblock_t gotblkcnt; /* new block count for got */
6184 xfs_extnum_t current_ext;
6189 if (unlikely(XFS_TEST_ERROR(
6190 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
6191 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
6192 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
6193 XFS_ERROR_REPORT("xfs_bmap_split_extent_at",
6194 XFS_ERRLEVEL_LOW, mp);
6195 return -EFSCORRUPTED;
6198 if (XFS_FORCED_SHUTDOWN(mp))
6201 ifp = XFS_IFORK_PTR(ip, whichfork);
6202 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
6203 /* Read in all the extents */
6204 error = xfs_iread_extents(tp, ip, whichfork);
6210 * gotp can be null in 2 cases: 1) if there are no extents
6211 * or 2) split_fsb lies in a hole beyond which there are
6212 * no extents. Either way, we are done.
6214 gotp = xfs_iext_bno_to_ext(ifp, split_fsb, ¤t_ext);
6218 xfs_bmbt_get_all(gotp, &got);
6221 * Check split_fsb lies in a hole or the start boundary offset
6224 if (got.br_startoff >= split_fsb)
6227 gotblkcnt = split_fsb - got.br_startoff;
6228 new.br_startoff = split_fsb;
6229 new.br_startblock = got.br_startblock + gotblkcnt;
6230 new.br_blockcount = got.br_blockcount - gotblkcnt;
6231 new.br_state = got.br_state;
6233 if (ifp->if_flags & XFS_IFBROOT) {
6234 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
6235 cur->bc_private.b.firstblock = *firstfsb;
6236 cur->bc_private.b.dfops = dfops;
6237 cur->bc_private.b.flags = 0;
6238 error = xfs_bmbt_lookup_eq(cur, got.br_startoff,
6244 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, del_cursor);
6247 xfs_bmbt_set_blockcount(gotp, gotblkcnt);
6248 got.br_blockcount = gotblkcnt;
6250 logflags = XFS_ILOG_CORE;
6252 error = xfs_bmbt_update(cur, got.br_startoff,
6259 logflags |= XFS_ILOG_DEXT;
6261 /* Add new extent */
6263 xfs_iext_insert(ip, current_ext, 1, &new, 0);
6264 XFS_IFORK_NEXT_SET(ip, whichfork,
6265 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
6268 error = xfs_bmbt_lookup_eq(cur, new.br_startoff,
6269 new.br_startblock, new.br_blockcount,
6273 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, del_cursor);
6274 cur->bc_rec.b.br_state = new.br_state;
6276 error = xfs_btree_insert(cur, &i);
6279 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, del_cursor);
6283 * Convert to a btree if necessary.
6285 if (xfs_bmap_needs_btree(ip, whichfork)) {
6286 int tmp_logflags; /* partial log flag return val */
6288 ASSERT(cur == NULL);
6289 error = xfs_bmap_extents_to_btree(tp, ip, firstfsb, dfops,
6290 &cur, 0, &tmp_logflags, whichfork);
6291 logflags |= tmp_logflags;
6296 cur->bc_private.b.allocated = 0;
6297 xfs_btree_del_cursor(cur,
6298 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
6302 xfs_trans_log_inode(tp, ip, logflags);
6307 xfs_bmap_split_extent(
6308 struct xfs_inode *ip,
6309 xfs_fileoff_t split_fsb)
6311 struct xfs_mount *mp = ip->i_mount;
6312 struct xfs_trans *tp;
6313 struct xfs_defer_ops dfops;
6314 xfs_fsblock_t firstfsb;
6317 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_write,
6318 XFS_DIOSTRAT_SPACE_RES(mp, 0), 0, 0, &tp);
6322 xfs_ilock(ip, XFS_ILOCK_EXCL);
6323 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
6325 xfs_defer_init(&dfops, &firstfsb);
6327 error = xfs_bmap_split_extent_at(tp, ip, split_fsb,
6332 error = xfs_defer_finish(&tp, &dfops, NULL);
6336 return xfs_trans_commit(tp);
6339 xfs_defer_cancel(&dfops);
6340 xfs_trans_cancel(tp);
6344 /* Deferred mapping is only for real extents in the data fork. */
6346 xfs_bmap_is_update_needed(
6347 struct xfs_bmbt_irec *bmap)
6349 return bmap->br_startblock != HOLESTARTBLOCK &&
6350 bmap->br_startblock != DELAYSTARTBLOCK;
6353 /* Record a bmap intent. */
6356 struct xfs_mount *mp,
6357 struct xfs_defer_ops *dfops,
6358 enum xfs_bmap_intent_type type,
6359 struct xfs_inode *ip,
6361 struct xfs_bmbt_irec *bmap)
6364 struct xfs_bmap_intent *bi;
6366 trace_xfs_bmap_defer(mp,
6367 XFS_FSB_TO_AGNO(mp, bmap->br_startblock),
6369 XFS_FSB_TO_AGBNO(mp, bmap->br_startblock),
6370 ip->i_ino, whichfork,
6372 bmap->br_blockcount,
6375 bi = kmem_alloc(sizeof(struct xfs_bmap_intent), KM_SLEEP | KM_NOFS);
6376 INIT_LIST_HEAD(&bi->bi_list);
6379 bi->bi_whichfork = whichfork;
6380 bi->bi_bmap = *bmap;
6382 error = xfs_defer_join(dfops, bi->bi_owner);
6388 xfs_defer_add(dfops, XFS_DEFER_OPS_TYPE_BMAP, &bi->bi_list);
6392 /* Map an extent into a file. */
6394 xfs_bmap_map_extent(
6395 struct xfs_mount *mp,
6396 struct xfs_defer_ops *dfops,
6397 struct xfs_inode *ip,
6398 struct xfs_bmbt_irec *PREV)
6400 if (!xfs_bmap_is_update_needed(PREV))
6403 return __xfs_bmap_add(mp, dfops, XFS_BMAP_MAP, ip,
6404 XFS_DATA_FORK, PREV);
6407 /* Unmap an extent out of a file. */
6409 xfs_bmap_unmap_extent(
6410 struct xfs_mount *mp,
6411 struct xfs_defer_ops *dfops,
6412 struct xfs_inode *ip,
6413 struct xfs_bmbt_irec *PREV)
6415 if (!xfs_bmap_is_update_needed(PREV))
6418 return __xfs_bmap_add(mp, dfops, XFS_BMAP_UNMAP, ip,
6419 XFS_DATA_FORK, PREV);
6423 * Process one of the deferred bmap operations. We pass back the
6424 * btree cursor to maintain our lock on the bmapbt between calls.
6427 xfs_bmap_finish_one(
6428 struct xfs_trans *tp,
6429 struct xfs_defer_ops *dfops,
6430 struct xfs_inode *ip,
6431 enum xfs_bmap_intent_type type,
6433 xfs_fileoff_t startoff,
6434 xfs_fsblock_t startblock,
6435 xfs_filblks_t blockcount,
6438 struct xfs_bmbt_irec bmap;
6440 xfs_fsblock_t firstfsb;
6441 int flags = XFS_BMAPI_REMAP;
6445 bmap.br_startblock = startblock;
6446 bmap.br_startoff = startoff;
6447 bmap.br_blockcount = blockcount;
6448 bmap.br_state = state;
6450 trace_xfs_bmap_deferred(tp->t_mountp,
6451 XFS_FSB_TO_AGNO(tp->t_mountp, startblock), type,
6452 XFS_FSB_TO_AGBNO(tp->t_mountp, startblock),
6453 ip->i_ino, whichfork, startoff, blockcount, state);
6455 if (whichfork != XFS_DATA_FORK && whichfork != XFS_ATTR_FORK)
6456 return -EFSCORRUPTED;
6457 if (whichfork == XFS_ATTR_FORK)
6458 flags |= XFS_BMAPI_ATTRFORK;
6460 if (XFS_TEST_ERROR(false, tp->t_mountp,
6461 XFS_ERRTAG_BMAP_FINISH_ONE,
6462 XFS_RANDOM_BMAP_FINISH_ONE))
6467 firstfsb = bmap.br_startblock;
6468 error = xfs_bmapi_write(tp, ip, bmap.br_startoff,
6469 bmap.br_blockcount, flags, &firstfsb,
6470 bmap.br_blockcount, &bmap, &nimaps,
6473 case XFS_BMAP_UNMAP:
6474 error = xfs_bunmapi(tp, ip, bmap.br_startoff,
6475 bmap.br_blockcount, flags, 1, &firstfsb,
6481 error = -EFSCORRUPTED;