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_da_format.h"
28 #include "xfs_da_btree.h"
30 #include "xfs_inode.h"
31 #include "xfs_btree.h"
32 #include "xfs_trans.h"
33 #include "xfs_inode_item.h"
34 #include "xfs_extfree_item.h"
35 #include "xfs_alloc.h"
37 #include "xfs_bmap_util.h"
38 #include "xfs_bmap_btree.h"
39 #include "xfs_rtalloc.h"
40 #include "xfs_error.h"
41 #include "xfs_quota.h"
42 #include "xfs_trans_space.h"
43 #include "xfs_buf_item.h"
44 #include "xfs_trace.h"
45 #include "xfs_symlink.h"
46 #include "xfs_attr_leaf.h"
47 #include "xfs_filestream.h"
50 kmem_zone_t *xfs_bmap_free_item_zone;
53 * Miscellaneous helper functions
57 * Compute and fill in the value of the maximum depth of a bmap btree
58 * in this filesystem. Done once, during mount.
61 xfs_bmap_compute_maxlevels(
62 xfs_mount_t *mp, /* file system mount structure */
63 int whichfork) /* data or attr fork */
65 int level; /* btree level */
66 uint maxblocks; /* max blocks at this level */
67 uint maxleafents; /* max leaf entries possible */
68 int maxrootrecs; /* max records in root block */
69 int minleafrecs; /* min records in leaf block */
70 int minnoderecs; /* min records in node block */
71 int sz; /* root block size */
74 * The maximum number of extents in a file, hence the maximum
75 * number of leaf entries, is controlled by the type of di_nextents
76 * (a signed 32-bit number, xfs_extnum_t), or by di_anextents
77 * (a signed 16-bit number, xfs_aextnum_t).
79 * Note that we can no longer assume that if we are in ATTR1 that
80 * the fork offset of all the inodes will be
81 * (xfs_default_attroffset(ip) >> 3) because we could have mounted
82 * with ATTR2 and then mounted back with ATTR1, keeping the
83 * di_forkoff's fixed but probably at various positions. Therefore,
84 * for both ATTR1 and ATTR2 we have to assume the worst case scenario
85 * of a minimum size available.
87 if (whichfork == XFS_DATA_FORK) {
88 maxleafents = MAXEXTNUM;
89 sz = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
91 maxleafents = MAXAEXTNUM;
92 sz = XFS_BMDR_SPACE_CALC(MINABTPTRS);
94 maxrootrecs = xfs_bmdr_maxrecs(sz, 0);
95 minleafrecs = mp->m_bmap_dmnr[0];
96 minnoderecs = mp->m_bmap_dmnr[1];
97 maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs;
98 for (level = 1; maxblocks > 1; level++) {
99 if (maxblocks <= maxrootrecs)
102 maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs;
104 mp->m_bm_maxlevels[whichfork] = level;
107 STATIC int /* error */
109 struct xfs_btree_cur *cur,
113 int *stat) /* success/failure */
115 cur->bc_rec.b.br_startoff = off;
116 cur->bc_rec.b.br_startblock = bno;
117 cur->bc_rec.b.br_blockcount = len;
118 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
121 STATIC int /* error */
123 struct xfs_btree_cur *cur,
127 int *stat) /* success/failure */
129 cur->bc_rec.b.br_startoff = off;
130 cur->bc_rec.b.br_startblock = bno;
131 cur->bc_rec.b.br_blockcount = len;
132 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
136 * Check if the inode needs to be converted to btree format.
138 static inline bool xfs_bmap_needs_btree(struct xfs_inode *ip, int whichfork)
140 return XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
141 XFS_IFORK_NEXTENTS(ip, whichfork) >
142 XFS_IFORK_MAXEXT(ip, whichfork);
146 * Check if the inode should be converted to extent format.
148 static inline bool xfs_bmap_wants_extents(struct xfs_inode *ip, int whichfork)
150 return XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE &&
151 XFS_IFORK_NEXTENTS(ip, whichfork) <=
152 XFS_IFORK_MAXEXT(ip, whichfork);
156 * Update the record referred to by cur to the value given
157 * by [off, bno, len, state].
158 * This either works (return 0) or gets an EFSCORRUPTED error.
162 struct xfs_btree_cur *cur,
168 union xfs_btree_rec rec;
170 xfs_bmbt_disk_set_allf(&rec.bmbt, off, bno, len, state);
171 return xfs_btree_update(cur, &rec);
175 * Compute the worst-case number of indirect blocks that will be used
176 * for ip's delayed extent of length "len".
179 xfs_bmap_worst_indlen(
180 xfs_inode_t *ip, /* incore inode pointer */
181 xfs_filblks_t len) /* delayed extent length */
183 int level; /* btree level number */
184 int maxrecs; /* maximum record count at this level */
185 xfs_mount_t *mp; /* mount structure */
186 xfs_filblks_t rval; /* return value */
189 maxrecs = mp->m_bmap_dmxr[0];
190 for (level = 0, rval = 0;
191 level < XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK);
194 do_div(len, maxrecs);
197 return rval + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) -
200 maxrecs = mp->m_bmap_dmxr[1];
206 * Calculate the default attribute fork offset for newly created inodes.
209 xfs_default_attroffset(
210 struct xfs_inode *ip)
212 struct xfs_mount *mp = ip->i_mount;
215 if (mp->m_sb.sb_inodesize == 256) {
216 offset = XFS_LITINO(mp, ip->i_d.di_version) -
217 XFS_BMDR_SPACE_CALC(MINABTPTRS);
219 offset = XFS_BMDR_SPACE_CALC(6 * MINABTPTRS);
222 ASSERT(offset < XFS_LITINO(mp, ip->i_d.di_version));
227 * Helper routine to reset inode di_forkoff field when switching
228 * attribute fork from local to extent format - we reset it where
229 * possible to make space available for inline data fork extents.
232 xfs_bmap_forkoff_reset(
236 if (whichfork == XFS_ATTR_FORK &&
237 ip->i_d.di_format != XFS_DINODE_FMT_DEV &&
238 ip->i_d.di_format != XFS_DINODE_FMT_UUID &&
239 ip->i_d.di_format != XFS_DINODE_FMT_BTREE) {
240 uint dfl_forkoff = xfs_default_attroffset(ip) >> 3;
242 if (dfl_forkoff > ip->i_d.di_forkoff)
243 ip->i_d.di_forkoff = dfl_forkoff;
248 STATIC struct xfs_buf *
250 struct xfs_btree_cur *cur,
253 struct xfs_log_item_desc *lidp;
259 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) {
260 if (!cur->bc_bufs[i])
262 if (XFS_BUF_ADDR(cur->bc_bufs[i]) == bno)
263 return cur->bc_bufs[i];
266 /* Chase down all the log items to see if the bp is there */
267 list_for_each_entry(lidp, &cur->bc_tp->t_items, lid_trans) {
268 struct xfs_buf_log_item *bip;
269 bip = (struct xfs_buf_log_item *)lidp->lid_item;
270 if (bip->bli_item.li_type == XFS_LI_BUF &&
271 XFS_BUF_ADDR(bip->bli_buf) == bno)
280 struct xfs_btree_block *block,
286 __be64 *pp, *thispa; /* pointer to block address */
287 xfs_bmbt_key_t *prevp, *keyp;
289 ASSERT(be16_to_cpu(block->bb_level) > 0);
292 for( i = 1; i <= xfs_btree_get_numrecs(block); i++) {
293 dmxr = mp->m_bmap_dmxr[0];
294 keyp = XFS_BMBT_KEY_ADDR(mp, block, i);
297 ASSERT(be64_to_cpu(prevp->br_startoff) <
298 be64_to_cpu(keyp->br_startoff));
303 * Compare the block numbers to see if there are dups.
306 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz);
308 pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr);
310 for (j = i+1; j <= be16_to_cpu(block->bb_numrecs); j++) {
312 thispa = XFS_BMAP_BROOT_PTR_ADDR(mp, block, j, sz);
314 thispa = XFS_BMBT_PTR_ADDR(mp, block, j, dmxr);
315 if (*thispa == *pp) {
316 xfs_warn(mp, "%s: thispa(%d) == pp(%d) %Ld",
318 (unsigned long long)be64_to_cpu(*thispa));
319 panic("%s: ptrs are equal in node\n",
327 * Check that the extents for the inode ip are in the right order in all
332 xfs_bmap_check_leaf_extents(
333 xfs_btree_cur_t *cur, /* btree cursor or null */
334 xfs_inode_t *ip, /* incore inode pointer */
335 int whichfork) /* data or attr fork */
337 struct xfs_btree_block *block; /* current btree block */
338 xfs_fsblock_t bno; /* block # of "block" */
339 xfs_buf_t *bp; /* buffer for "block" */
340 int error; /* error return value */
341 xfs_extnum_t i=0, j; /* index into the extents list */
342 xfs_ifork_t *ifp; /* fork structure */
343 int level; /* btree level, for checking */
344 xfs_mount_t *mp; /* file system mount structure */
345 __be64 *pp; /* pointer to block address */
346 xfs_bmbt_rec_t *ep; /* pointer to current extent */
347 xfs_bmbt_rec_t last = {0, 0}; /* last extent in prev block */
348 xfs_bmbt_rec_t *nextp; /* pointer to next extent */
351 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) {
357 ifp = XFS_IFORK_PTR(ip, whichfork);
358 block = ifp->if_broot;
360 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
362 level = be16_to_cpu(block->bb_level);
364 xfs_check_block(block, mp, 1, ifp->if_broot_bytes);
365 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
366 bno = be64_to_cpu(*pp);
368 ASSERT(bno != NULLFSBLOCK);
369 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
370 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
373 * Go down the tree until leaf level is reached, following the first
374 * pointer (leftmost) at each level.
376 while (level-- > 0) {
377 /* See if buf is in cur first */
379 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
382 error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp,
388 block = XFS_BUF_TO_BLOCK(bp);
393 * Check this block for basic sanity (increasing keys and
394 * no duplicate blocks).
397 xfs_check_block(block, mp, 0, 0);
398 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
399 bno = be64_to_cpu(*pp);
400 XFS_WANT_CORRUPTED_GOTO(mp,
401 XFS_FSB_SANITY_CHECK(mp, bno), error0);
404 xfs_trans_brelse(NULL, bp);
409 * Here with bp and block set to the leftmost leaf node in the tree.
414 * Loop over all leaf nodes checking that all extents are in the right order.
417 xfs_fsblock_t nextbno;
418 xfs_extnum_t num_recs;
421 num_recs = xfs_btree_get_numrecs(block);
424 * Read-ahead the next leaf block, if any.
427 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
430 * Check all the extents to make sure they are OK.
431 * If we had a previous block, the last entry should
432 * conform with the first entry in this one.
435 ep = XFS_BMBT_REC_ADDR(mp, block, 1);
437 ASSERT(xfs_bmbt_disk_get_startoff(&last) +
438 xfs_bmbt_disk_get_blockcount(&last) <=
439 xfs_bmbt_disk_get_startoff(ep));
441 for (j = 1; j < num_recs; j++) {
442 nextp = XFS_BMBT_REC_ADDR(mp, block, j + 1);
443 ASSERT(xfs_bmbt_disk_get_startoff(ep) +
444 xfs_bmbt_disk_get_blockcount(ep) <=
445 xfs_bmbt_disk_get_startoff(nextp));
453 xfs_trans_brelse(NULL, bp);
457 * If we've reached the end, stop.
459 if (bno == NULLFSBLOCK)
463 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
466 error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp,
472 block = XFS_BUF_TO_BLOCK(bp);
476 xfs_trans_brelse(NULL, bp);
481 xfs_warn(mp, "%s: at error0", __func__);
483 xfs_trans_brelse(NULL, bp);
485 xfs_warn(mp, "%s: BAD after btree leaves for %d extents",
487 panic("%s: CORRUPTED BTREE OR SOMETHING", __func__);
492 * Add bmap trace insert entries for all the contents of the extent records.
495 xfs_bmap_trace_exlist(
496 xfs_inode_t *ip, /* incore inode pointer */
497 xfs_extnum_t cnt, /* count of entries in the list */
498 int whichfork, /* data or attr fork */
499 unsigned long caller_ip)
501 xfs_extnum_t idx; /* extent record index */
502 xfs_ifork_t *ifp; /* inode fork pointer */
505 if (whichfork == XFS_ATTR_FORK)
506 state |= BMAP_ATTRFORK;
508 ifp = XFS_IFORK_PTR(ip, whichfork);
509 ASSERT(cnt == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)));
510 for (idx = 0; idx < cnt; idx++)
511 trace_xfs_extlist(ip, idx, whichfork, caller_ip);
515 * Validate that the bmbt_irecs being returned from bmapi are valid
516 * given the caller's original parameters. Specifically check the
517 * ranges of the returned irecs to ensure that they only extend beyond
518 * the given parameters if the XFS_BMAPI_ENTIRE flag was set.
521 xfs_bmap_validate_ret(
525 xfs_bmbt_irec_t *mval,
529 int i; /* index to map values */
531 ASSERT(ret_nmap <= nmap);
533 for (i = 0; i < ret_nmap; i++) {
534 ASSERT(mval[i].br_blockcount > 0);
535 if (!(flags & XFS_BMAPI_ENTIRE)) {
536 ASSERT(mval[i].br_startoff >= bno);
537 ASSERT(mval[i].br_blockcount <= len);
538 ASSERT(mval[i].br_startoff + mval[i].br_blockcount <=
541 ASSERT(mval[i].br_startoff < bno + len);
542 ASSERT(mval[i].br_startoff + mval[i].br_blockcount >
546 mval[i - 1].br_startoff + mval[i - 1].br_blockcount ==
547 mval[i].br_startoff);
548 ASSERT(mval[i].br_startblock != DELAYSTARTBLOCK &&
549 mval[i].br_startblock != HOLESTARTBLOCK);
550 ASSERT(mval[i].br_state == XFS_EXT_NORM ||
551 mval[i].br_state == XFS_EXT_UNWRITTEN);
556 #define xfs_bmap_check_leaf_extents(cur, ip, whichfork) do { } while (0)
557 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap)
561 * bmap free list manipulation functions
565 * Add the extent to the list of extents to be free at transaction end.
566 * The list is maintained sorted (by block number).
570 xfs_fsblock_t bno, /* fs block number of extent */
571 xfs_filblks_t len, /* length of extent */
572 xfs_bmap_free_t *flist, /* list of extents */
573 xfs_mount_t *mp) /* mount point structure */
575 xfs_bmap_free_item_t *cur; /* current (next) element */
576 xfs_bmap_free_item_t *new; /* new element */
577 xfs_bmap_free_item_t *prev; /* previous element */
582 ASSERT(bno != NULLFSBLOCK);
584 ASSERT(len <= MAXEXTLEN);
585 ASSERT(!isnullstartblock(bno));
586 agno = XFS_FSB_TO_AGNO(mp, bno);
587 agbno = XFS_FSB_TO_AGBNO(mp, bno);
588 ASSERT(agno < mp->m_sb.sb_agcount);
589 ASSERT(agbno < mp->m_sb.sb_agblocks);
590 ASSERT(len < mp->m_sb.sb_agblocks);
591 ASSERT(agbno + len <= mp->m_sb.sb_agblocks);
593 ASSERT(xfs_bmap_free_item_zone != NULL);
594 new = kmem_zone_alloc(xfs_bmap_free_item_zone, KM_SLEEP);
595 new->xbfi_startblock = bno;
596 new->xbfi_blockcount = (xfs_extlen_t)len;
597 for (prev = NULL, cur = flist->xbf_first;
599 prev = cur, cur = cur->xbfi_next) {
600 if (cur->xbfi_startblock >= bno)
604 prev->xbfi_next = new;
606 flist->xbf_first = new;
607 new->xbfi_next = cur;
612 * Remove the entry "free" from the free item list. Prev points to the
613 * previous entry, unless "free" is the head of the list.
617 xfs_bmap_free_t *flist, /* free item list header */
618 xfs_bmap_free_item_t *prev, /* previous item on list, if any */
619 xfs_bmap_free_item_t *free) /* list item to be freed */
622 prev->xbfi_next = free->xbfi_next;
624 flist->xbf_first = free->xbfi_next;
626 kmem_zone_free(xfs_bmap_free_item_zone, free);
630 * Free up any items left in the list.
634 xfs_bmap_free_t *flist) /* list of bmap_free_items */
636 xfs_bmap_free_item_t *free; /* free list item */
637 xfs_bmap_free_item_t *next;
639 if (flist->xbf_count == 0)
641 ASSERT(flist->xbf_first != NULL);
642 for (free = flist->xbf_first; free; free = next) {
643 next = free->xbfi_next;
644 xfs_bmap_del_free(flist, NULL, free);
646 ASSERT(flist->xbf_count == 0);
650 * Inode fork format manipulation functions
654 * Transform a btree format file with only one leaf node, where the
655 * extents list will fit in the inode, into an extents format file.
656 * Since the file extents are already in-core, all we have to do is
657 * give up the space for the btree root and pitch the leaf block.
659 STATIC int /* error */
660 xfs_bmap_btree_to_extents(
661 xfs_trans_t *tp, /* transaction pointer */
662 xfs_inode_t *ip, /* incore inode pointer */
663 xfs_btree_cur_t *cur, /* btree cursor */
664 int *logflagsp, /* inode logging flags */
665 int whichfork) /* data or attr fork */
668 struct xfs_btree_block *cblock;/* child btree block */
669 xfs_fsblock_t cbno; /* child block number */
670 xfs_buf_t *cbp; /* child block's buffer */
671 int error; /* error return value */
672 xfs_ifork_t *ifp; /* inode fork data */
673 xfs_mount_t *mp; /* mount point structure */
674 __be64 *pp; /* ptr to block address */
675 struct xfs_btree_block *rblock;/* root btree block */
678 ifp = XFS_IFORK_PTR(ip, whichfork);
679 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
680 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
681 rblock = ifp->if_broot;
682 ASSERT(be16_to_cpu(rblock->bb_level) == 1);
683 ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1);
684 ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1);
685 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes);
686 cbno = be64_to_cpu(*pp);
689 if ((error = xfs_btree_check_lptr(cur, cbno, 1)))
692 error = xfs_btree_read_bufl(mp, tp, cbno, 0, &cbp, XFS_BMAP_BTREE_REF,
696 cblock = XFS_BUF_TO_BLOCK(cbp);
697 if ((error = xfs_btree_check_block(cur, cblock, 0, cbp)))
699 xfs_bmap_add_free(cbno, 1, cur->bc_private.b.flist, mp);
700 ip->i_d.di_nblocks--;
701 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
702 xfs_trans_binval(tp, cbp);
703 if (cur->bc_bufs[0] == cbp)
704 cur->bc_bufs[0] = NULL;
705 xfs_iroot_realloc(ip, -1, whichfork);
706 ASSERT(ifp->if_broot == NULL);
707 ASSERT((ifp->if_flags & XFS_IFBROOT) == 0);
708 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
709 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
714 * Convert an extents-format file into a btree-format file.
715 * The new file will have a root block (in the inode) and a single child block.
717 STATIC int /* error */
718 xfs_bmap_extents_to_btree(
719 xfs_trans_t *tp, /* transaction pointer */
720 xfs_inode_t *ip, /* incore inode pointer */
721 xfs_fsblock_t *firstblock, /* first-block-allocated */
722 xfs_bmap_free_t *flist, /* blocks freed in xaction */
723 xfs_btree_cur_t **curp, /* cursor returned to caller */
724 int wasdel, /* converting a delayed alloc */
725 int *logflagsp, /* inode logging flags */
726 int whichfork) /* data or attr fork */
728 struct xfs_btree_block *ablock; /* allocated (child) bt block */
729 xfs_buf_t *abp; /* buffer for ablock */
730 xfs_alloc_arg_t args; /* allocation arguments */
731 xfs_bmbt_rec_t *arp; /* child record pointer */
732 struct xfs_btree_block *block; /* btree root block */
733 xfs_btree_cur_t *cur; /* bmap btree cursor */
734 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
735 int error; /* error return value */
736 xfs_extnum_t i, cnt; /* extent record index */
737 xfs_ifork_t *ifp; /* inode fork pointer */
738 xfs_bmbt_key_t *kp; /* root block key pointer */
739 xfs_mount_t *mp; /* mount structure */
740 xfs_extnum_t nextents; /* number of file extents */
741 xfs_bmbt_ptr_t *pp; /* root block address pointer */
744 ifp = XFS_IFORK_PTR(ip, whichfork);
745 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS);
748 * Make space in the inode incore.
750 xfs_iroot_realloc(ip, 1, whichfork);
751 ifp->if_flags |= XFS_IFBROOT;
756 block = ifp->if_broot;
757 if (xfs_sb_version_hascrc(&mp->m_sb))
758 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL,
759 XFS_BMAP_CRC_MAGIC, 1, 1, ip->i_ino,
760 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS);
762 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL,
763 XFS_BMAP_MAGIC, 1, 1, ip->i_ino,
764 XFS_BTREE_LONG_PTRS);
767 * Need a cursor. Can't allocate until bb_level is filled in.
769 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
770 cur->bc_private.b.firstblock = *firstblock;
771 cur->bc_private.b.flist = flist;
772 cur->bc_private.b.flags = wasdel ? XFS_BTCUR_BPRV_WASDEL : 0;
774 * Convert to a btree with two levels, one record in root.
776 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_BTREE);
777 memset(&args, 0, sizeof(args));
780 args.firstblock = *firstblock;
781 if (*firstblock == NULLFSBLOCK) {
782 args.type = XFS_ALLOCTYPE_START_BNO;
783 args.fsbno = XFS_INO_TO_FSB(mp, ip->i_ino);
784 } else if (flist->xbf_low) {
785 args.type = XFS_ALLOCTYPE_START_BNO;
786 args.fsbno = *firstblock;
788 args.type = XFS_ALLOCTYPE_NEAR_BNO;
789 args.fsbno = *firstblock;
791 args.minlen = args.maxlen = args.prod = 1;
792 args.wasdel = wasdel;
794 if ((error = xfs_alloc_vextent(&args))) {
795 xfs_iroot_realloc(ip, -1, whichfork);
796 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
800 * Allocation can't fail, the space was reserved.
802 ASSERT(args.fsbno != NULLFSBLOCK);
803 ASSERT(*firstblock == NULLFSBLOCK ||
804 args.agno == XFS_FSB_TO_AGNO(mp, *firstblock) ||
806 args.agno > XFS_FSB_TO_AGNO(mp, *firstblock)));
807 *firstblock = cur->bc_private.b.firstblock = args.fsbno;
808 cur->bc_private.b.allocated++;
809 ip->i_d.di_nblocks++;
810 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, 1L);
811 abp = xfs_btree_get_bufl(mp, tp, args.fsbno, 0);
813 * Fill in the child block.
815 abp->b_ops = &xfs_bmbt_buf_ops;
816 ablock = XFS_BUF_TO_BLOCK(abp);
817 if (xfs_sb_version_hascrc(&mp->m_sb))
818 xfs_btree_init_block_int(mp, ablock, abp->b_bn,
819 XFS_BMAP_CRC_MAGIC, 0, 0, ip->i_ino,
820 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS);
822 xfs_btree_init_block_int(mp, ablock, abp->b_bn,
823 XFS_BMAP_MAGIC, 0, 0, ip->i_ino,
824 XFS_BTREE_LONG_PTRS);
826 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
827 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
828 for (cnt = i = 0; i < nextents; i++) {
829 ep = xfs_iext_get_ext(ifp, i);
830 if (!isnullstartblock(xfs_bmbt_get_startblock(ep))) {
831 arp->l0 = cpu_to_be64(ep->l0);
832 arp->l1 = cpu_to_be64(ep->l1);
836 ASSERT(cnt == XFS_IFORK_NEXTENTS(ip, whichfork));
837 xfs_btree_set_numrecs(ablock, cnt);
840 * Fill in the root key and pointer.
842 kp = XFS_BMBT_KEY_ADDR(mp, block, 1);
843 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
844 kp->br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(arp));
845 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, xfs_bmbt_get_maxrecs(cur,
846 be16_to_cpu(block->bb_level)));
847 *pp = cpu_to_be64(args.fsbno);
850 * Do all this logging at the end so that
851 * the root is at the right level.
853 xfs_btree_log_block(cur, abp, XFS_BB_ALL_BITS);
854 xfs_btree_log_recs(cur, abp, 1, be16_to_cpu(ablock->bb_numrecs));
855 ASSERT(*curp == NULL);
857 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fbroot(whichfork);
862 * Convert a local file to an extents file.
863 * This code is out of bounds for data forks of regular files,
864 * since the file data needs to get logged so things will stay consistent.
865 * (The bmap-level manipulations are ok, though).
868 xfs_bmap_local_to_extents_empty(
869 struct xfs_inode *ip,
872 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
874 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
875 ASSERT(ifp->if_bytes == 0);
876 ASSERT(XFS_IFORK_NEXTENTS(ip, whichfork) == 0);
878 xfs_bmap_forkoff_reset(ip, whichfork);
879 ifp->if_flags &= ~XFS_IFINLINE;
880 ifp->if_flags |= XFS_IFEXTENTS;
881 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
885 STATIC int /* error */
886 xfs_bmap_local_to_extents(
887 xfs_trans_t *tp, /* transaction pointer */
888 xfs_inode_t *ip, /* incore inode pointer */
889 xfs_fsblock_t *firstblock, /* first block allocated in xaction */
890 xfs_extlen_t total, /* total blocks needed by transaction */
891 int *logflagsp, /* inode logging flags */
893 void (*init_fn)(struct xfs_trans *tp,
895 struct xfs_inode *ip,
896 struct xfs_ifork *ifp))
899 int flags; /* logging flags returned */
900 xfs_ifork_t *ifp; /* inode fork pointer */
901 xfs_alloc_arg_t args; /* allocation arguments */
902 xfs_buf_t *bp; /* buffer for extent block */
903 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
906 * We don't want to deal with the case of keeping inode data inline yet.
907 * So sending the data fork of a regular inode is invalid.
909 ASSERT(!(S_ISREG(ip->i_d.di_mode) && whichfork == XFS_DATA_FORK));
910 ifp = XFS_IFORK_PTR(ip, whichfork);
911 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
913 if (!ifp->if_bytes) {
914 xfs_bmap_local_to_extents_empty(ip, whichfork);
915 flags = XFS_ILOG_CORE;
921 ASSERT((ifp->if_flags & (XFS_IFINLINE|XFS_IFEXTENTS|XFS_IFEXTIREC)) ==
923 memset(&args, 0, sizeof(args));
925 args.mp = ip->i_mount;
926 args.firstblock = *firstblock;
928 * Allocate a block. We know we need only one, since the
929 * file currently fits in an inode.
931 if (*firstblock == NULLFSBLOCK) {
932 args.fsbno = XFS_INO_TO_FSB(args.mp, ip->i_ino);
933 args.type = XFS_ALLOCTYPE_START_BNO;
935 args.fsbno = *firstblock;
936 args.type = XFS_ALLOCTYPE_NEAR_BNO;
939 args.minlen = args.maxlen = args.prod = 1;
940 error = xfs_alloc_vextent(&args);
944 /* Can't fail, the space was reserved. */
945 ASSERT(args.fsbno != NULLFSBLOCK);
946 ASSERT(args.len == 1);
947 *firstblock = args.fsbno;
948 bp = xfs_btree_get_bufl(args.mp, tp, args.fsbno, 0);
951 * Initialise the block and copy the data
953 * Note: init_fn must set the buffer log item type correctly!
955 init_fn(tp, bp, ip, ifp);
957 /* account for the change in fork size and log everything */
958 xfs_trans_log_buf(tp, bp, 0, ifp->if_bytes - 1);
959 xfs_idata_realloc(ip, -ifp->if_bytes, whichfork);
960 xfs_bmap_local_to_extents_empty(ip, whichfork);
961 flags |= XFS_ILOG_CORE;
963 xfs_iext_add(ifp, 0, 1);
964 ep = xfs_iext_get_ext(ifp, 0);
965 xfs_bmbt_set_allf(ep, 0, args.fsbno, 1, XFS_EXT_NORM);
966 trace_xfs_bmap_post_update(ip, 0,
967 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0,
969 XFS_IFORK_NEXT_SET(ip, whichfork, 1);
970 ip->i_d.di_nblocks = 1;
971 xfs_trans_mod_dquot_byino(tp, ip,
972 XFS_TRANS_DQ_BCOUNT, 1L);
973 flags |= xfs_ilog_fext(whichfork);
981 * Called from xfs_bmap_add_attrfork to handle btree format files.
983 STATIC int /* error */
984 xfs_bmap_add_attrfork_btree(
985 xfs_trans_t *tp, /* transaction pointer */
986 xfs_inode_t *ip, /* incore inode pointer */
987 xfs_fsblock_t *firstblock, /* first block allocated */
988 xfs_bmap_free_t *flist, /* blocks to free at commit */
989 int *flags) /* inode logging flags */
991 xfs_btree_cur_t *cur; /* btree cursor */
992 int error; /* error return value */
993 xfs_mount_t *mp; /* file system mount struct */
994 int stat; /* newroot status */
997 if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip))
998 *flags |= XFS_ILOG_DBROOT;
1000 cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK);
1001 cur->bc_private.b.flist = flist;
1002 cur->bc_private.b.firstblock = *firstblock;
1003 if ((error = xfs_bmbt_lookup_ge(cur, 0, 0, 0, &stat)))
1005 /* must be at least one entry */
1006 XFS_WANT_CORRUPTED_GOTO(mp, stat == 1, error0);
1007 if ((error = xfs_btree_new_iroot(cur, flags, &stat)))
1010 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1013 *firstblock = cur->bc_private.b.firstblock;
1014 cur->bc_private.b.allocated = 0;
1015 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1019 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1024 * Called from xfs_bmap_add_attrfork to handle extents format files.
1026 STATIC int /* error */
1027 xfs_bmap_add_attrfork_extents(
1028 xfs_trans_t *tp, /* transaction pointer */
1029 xfs_inode_t *ip, /* incore inode pointer */
1030 xfs_fsblock_t *firstblock, /* first block allocated */
1031 xfs_bmap_free_t *flist, /* blocks to free at commit */
1032 int *flags) /* inode logging flags */
1034 xfs_btree_cur_t *cur; /* bmap btree cursor */
1035 int error; /* error return value */
1037 if (ip->i_d.di_nextents * sizeof(xfs_bmbt_rec_t) <= XFS_IFORK_DSIZE(ip))
1040 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist, &cur, 0,
1041 flags, XFS_DATA_FORK);
1043 cur->bc_private.b.allocated = 0;
1044 xfs_btree_del_cursor(cur,
1045 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
1051 * Called from xfs_bmap_add_attrfork to handle local format files. Each
1052 * different data fork content type needs a different callout to do the
1053 * conversion. Some are basic and only require special block initialisation
1054 * callouts for the data formating, others (directories) are so specialised they
1055 * handle everything themselves.
1057 * XXX (dgc): investigate whether directory conversion can use the generic
1058 * formatting callout. It should be possible - it's just a very complex
1061 STATIC int /* error */
1062 xfs_bmap_add_attrfork_local(
1063 xfs_trans_t *tp, /* transaction pointer */
1064 xfs_inode_t *ip, /* incore inode pointer */
1065 xfs_fsblock_t *firstblock, /* first block allocated */
1066 xfs_bmap_free_t *flist, /* blocks to free at commit */
1067 int *flags) /* inode logging flags */
1069 xfs_da_args_t dargs; /* args for dir/attr code */
1071 if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip))
1074 if (S_ISDIR(ip->i_d.di_mode)) {
1075 memset(&dargs, 0, sizeof(dargs));
1076 dargs.geo = ip->i_mount->m_dir_geo;
1078 dargs.firstblock = firstblock;
1079 dargs.flist = flist;
1080 dargs.total = dargs.geo->fsbcount;
1081 dargs.whichfork = XFS_DATA_FORK;
1083 return xfs_dir2_sf_to_block(&dargs);
1086 if (S_ISLNK(ip->i_d.di_mode))
1087 return xfs_bmap_local_to_extents(tp, ip, firstblock, 1,
1088 flags, XFS_DATA_FORK,
1089 xfs_symlink_local_to_remote);
1091 /* should only be called for types that support local format data */
1093 return -EFSCORRUPTED;
1097 * Convert inode from non-attributed to attributed.
1098 * Must not be in a transaction, ip must not be locked.
1100 int /* error code */
1101 xfs_bmap_add_attrfork(
1102 xfs_inode_t *ip, /* incore inode pointer */
1103 int size, /* space new attribute needs */
1104 int rsvd) /* xact may use reserved blks */
1106 xfs_fsblock_t firstblock; /* 1st block/ag allocated */
1107 xfs_bmap_free_t flist; /* freed extent records */
1108 xfs_mount_t *mp; /* mount structure */
1109 xfs_trans_t *tp; /* transaction pointer */
1110 int blks; /* space reservation */
1111 int version = 1; /* superblock attr version */
1112 int committed; /* xaction was committed */
1113 int logflags; /* logging flags */
1114 int error; /* error return value */
1115 int cancel_flags = 0;
1117 ASSERT(XFS_IFORK_Q(ip) == 0);
1120 ASSERT(!XFS_NOT_DQATTACHED(mp, ip));
1121 tp = xfs_trans_alloc(mp, XFS_TRANS_ADDAFORK);
1122 blks = XFS_ADDAFORK_SPACE_RES(mp);
1124 tp->t_flags |= XFS_TRANS_RESERVE;
1125 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_addafork, blks, 0);
1127 xfs_trans_cancel(tp, 0);
1130 cancel_flags = XFS_TRANS_RELEASE_LOG_RES;
1131 xfs_ilock(ip, XFS_ILOCK_EXCL);
1132 error = xfs_trans_reserve_quota_nblks(tp, ip, blks, 0, rsvd ?
1133 XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
1134 XFS_QMOPT_RES_REGBLKS);
1137 cancel_flags |= XFS_TRANS_ABORT;
1138 if (XFS_IFORK_Q(ip))
1140 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS) {
1142 * For inodes coming from pre-6.2 filesystems.
1144 ASSERT(ip->i_d.di_aformat == 0);
1145 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
1147 ASSERT(ip->i_d.di_anextents == 0);
1149 xfs_trans_ijoin(tp, ip, 0);
1150 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
1152 switch (ip->i_d.di_format) {
1153 case XFS_DINODE_FMT_DEV:
1154 ip->i_d.di_forkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
1156 case XFS_DINODE_FMT_UUID:
1157 ip->i_d.di_forkoff = roundup(sizeof(uuid_t), 8) >> 3;
1159 case XFS_DINODE_FMT_LOCAL:
1160 case XFS_DINODE_FMT_EXTENTS:
1161 case XFS_DINODE_FMT_BTREE:
1162 ip->i_d.di_forkoff = xfs_attr_shortform_bytesfit(ip, size);
1163 if (!ip->i_d.di_forkoff)
1164 ip->i_d.di_forkoff = xfs_default_attroffset(ip) >> 3;
1165 else if (mp->m_flags & XFS_MOUNT_ATTR2)
1174 ASSERT(ip->i_afp == NULL);
1175 ip->i_afp = kmem_zone_zalloc(xfs_ifork_zone, KM_SLEEP);
1176 ip->i_afp->if_flags = XFS_IFEXTENTS;
1178 xfs_bmap_init(&flist, &firstblock);
1179 switch (ip->i_d.di_format) {
1180 case XFS_DINODE_FMT_LOCAL:
1181 error = xfs_bmap_add_attrfork_local(tp, ip, &firstblock, &flist,
1184 case XFS_DINODE_FMT_EXTENTS:
1185 error = xfs_bmap_add_attrfork_extents(tp, ip, &firstblock,
1188 case XFS_DINODE_FMT_BTREE:
1189 error = xfs_bmap_add_attrfork_btree(tp, ip, &firstblock, &flist,
1197 xfs_trans_log_inode(tp, ip, logflags);
1200 if (!xfs_sb_version_hasattr(&mp->m_sb) ||
1201 (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2)) {
1202 bool log_sb = false;
1204 spin_lock(&mp->m_sb_lock);
1205 if (!xfs_sb_version_hasattr(&mp->m_sb)) {
1206 xfs_sb_version_addattr(&mp->m_sb);
1209 if (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2) {
1210 xfs_sb_version_addattr2(&mp->m_sb);
1213 spin_unlock(&mp->m_sb_lock);
1218 error = xfs_bmap_finish(&tp, &flist, &committed);
1221 error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
1222 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1226 xfs_bmap_cancel(&flist);
1228 xfs_trans_cancel(tp, cancel_flags);
1229 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1234 * Internal and external extent tree search functions.
1238 * Read in the extents to if_extents.
1239 * All inode fields are set up by caller, we just traverse the btree
1240 * and copy the records in. If the file system cannot contain unwritten
1241 * extents, the records are checked for no "state" flags.
1244 xfs_bmap_read_extents(
1245 xfs_trans_t *tp, /* transaction pointer */
1246 xfs_inode_t *ip, /* incore inode */
1247 int whichfork) /* data or attr fork */
1249 struct xfs_btree_block *block; /* current btree block */
1250 xfs_fsblock_t bno; /* block # of "block" */
1251 xfs_buf_t *bp; /* buffer for "block" */
1252 int error; /* error return value */
1253 xfs_exntfmt_t exntf; /* XFS_EXTFMT_NOSTATE, if checking */
1254 xfs_extnum_t i, j; /* index into the extents list */
1255 xfs_ifork_t *ifp; /* fork structure */
1256 int level; /* btree level, for checking */
1257 xfs_mount_t *mp; /* file system mount structure */
1258 __be64 *pp; /* pointer to block address */
1260 xfs_extnum_t room; /* number of entries there's room for */
1264 ifp = XFS_IFORK_PTR(ip, whichfork);
1265 exntf = (whichfork != XFS_DATA_FORK) ? XFS_EXTFMT_NOSTATE :
1266 XFS_EXTFMT_INODE(ip);
1267 block = ifp->if_broot;
1269 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
1271 level = be16_to_cpu(block->bb_level);
1273 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
1274 bno = be64_to_cpu(*pp);
1275 ASSERT(bno != NULLFSBLOCK);
1276 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
1277 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
1279 * Go down the tree until leaf level is reached, following the first
1280 * pointer (leftmost) at each level.
1282 while (level-- > 0) {
1283 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
1284 XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops);
1287 block = XFS_BUF_TO_BLOCK(bp);
1290 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
1291 bno = be64_to_cpu(*pp);
1292 XFS_WANT_CORRUPTED_GOTO(mp,
1293 XFS_FSB_SANITY_CHECK(mp, bno), error0);
1294 xfs_trans_brelse(tp, bp);
1297 * Here with bp and block set to the leftmost leaf node in the tree.
1299 room = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
1302 * Loop over all leaf nodes. Copy information to the extent records.
1305 xfs_bmbt_rec_t *frp;
1306 xfs_fsblock_t nextbno;
1307 xfs_extnum_t num_recs;
1310 num_recs = xfs_btree_get_numrecs(block);
1311 if (unlikely(i + num_recs > room)) {
1312 ASSERT(i + num_recs <= room);
1313 xfs_warn(ip->i_mount,
1314 "corrupt dinode %Lu, (btree extents).",
1315 (unsigned long long) ip->i_ino);
1316 XFS_CORRUPTION_ERROR("xfs_bmap_read_extents(1)",
1317 XFS_ERRLEVEL_LOW, ip->i_mount, block);
1321 * Read-ahead the next leaf block, if any.
1323 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
1324 if (nextbno != NULLFSBLOCK)
1325 xfs_btree_reada_bufl(mp, nextbno, 1,
1328 * Copy records into the extent records.
1330 frp = XFS_BMBT_REC_ADDR(mp, block, 1);
1332 for (j = 0; j < num_recs; j++, i++, frp++) {
1333 xfs_bmbt_rec_host_t *trp = xfs_iext_get_ext(ifp, i);
1334 trp->l0 = be64_to_cpu(frp->l0);
1335 trp->l1 = be64_to_cpu(frp->l1);
1337 if (exntf == XFS_EXTFMT_NOSTATE) {
1339 * Check all attribute bmap btree records and
1340 * any "older" data bmap btree records for a
1341 * set bit in the "extent flag" position.
1343 if (unlikely(xfs_check_nostate_extents(ifp,
1344 start, num_recs))) {
1345 XFS_ERROR_REPORT("xfs_bmap_read_extents(2)",
1351 xfs_trans_brelse(tp, bp);
1354 * If we've reached the end, stop.
1356 if (bno == NULLFSBLOCK)
1358 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
1359 XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops);
1362 block = XFS_BUF_TO_BLOCK(bp);
1364 ASSERT(i == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)));
1365 ASSERT(i == XFS_IFORK_NEXTENTS(ip, whichfork));
1366 XFS_BMAP_TRACE_EXLIST(ip, i, whichfork);
1369 xfs_trans_brelse(tp, bp);
1370 return -EFSCORRUPTED;
1375 * Search the extent records for the entry containing block bno.
1376 * If bno lies in a hole, point to the next entry. If bno lies
1377 * past eof, *eofp will be set, and *prevp will contain the last
1378 * entry (null if none). Else, *lastxp will be set to the index
1379 * of the found entry; *gotp will contain the entry.
1381 STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */
1382 xfs_bmap_search_multi_extents(
1383 xfs_ifork_t *ifp, /* inode fork pointer */
1384 xfs_fileoff_t bno, /* block number searched for */
1385 int *eofp, /* out: end of file found */
1386 xfs_extnum_t *lastxp, /* out: last extent index */
1387 xfs_bmbt_irec_t *gotp, /* out: extent entry found */
1388 xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */
1390 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
1391 xfs_extnum_t lastx; /* last extent index */
1394 * Initialize the extent entry structure to catch access to
1395 * uninitialized br_startblock field.
1397 gotp->br_startoff = 0xffa5a5a5a5a5a5a5LL;
1398 gotp->br_blockcount = 0xa55a5a5a5a5a5a5aLL;
1399 gotp->br_state = XFS_EXT_INVALID;
1400 gotp->br_startblock = 0xffffa5a5a5a5a5a5LL;
1401 prevp->br_startoff = NULLFILEOFF;
1403 ep = xfs_iext_bno_to_ext(ifp, bno, &lastx);
1405 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx - 1), prevp);
1407 if (lastx < (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))) {
1408 xfs_bmbt_get_all(ep, gotp);
1422 * Search the extents list for the inode, for the extent containing bno.
1423 * If bno lies in a hole, point to the next entry. If bno lies past eof,
1424 * *eofp will be set, and *prevp will contain the last entry (null if none).
1425 * Else, *lastxp will be set to the index of the found
1426 * entry; *gotp will contain the entry.
1428 STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */
1429 xfs_bmap_search_extents(
1430 xfs_inode_t *ip, /* incore inode pointer */
1431 xfs_fileoff_t bno, /* block number searched for */
1432 int fork, /* data or attr fork */
1433 int *eofp, /* out: end of file found */
1434 xfs_extnum_t *lastxp, /* out: last extent index */
1435 xfs_bmbt_irec_t *gotp, /* out: extent entry found */
1436 xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */
1438 xfs_ifork_t *ifp; /* inode fork pointer */
1439 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
1441 XFS_STATS_INC(xs_look_exlist);
1442 ifp = XFS_IFORK_PTR(ip, fork);
1444 ep = xfs_bmap_search_multi_extents(ifp, bno, eofp, lastxp, gotp, prevp);
1446 if (unlikely(!(gotp->br_startblock) && (*lastxp != NULLEXTNUM) &&
1447 !(XFS_IS_REALTIME_INODE(ip) && fork == XFS_DATA_FORK))) {
1448 xfs_alert_tag(ip->i_mount, XFS_PTAG_FSBLOCK_ZERO,
1449 "Access to block zero in inode %llu "
1450 "start_block: %llx start_off: %llx "
1451 "blkcnt: %llx extent-state: %x lastx: %x",
1452 (unsigned long long)ip->i_ino,
1453 (unsigned long long)gotp->br_startblock,
1454 (unsigned long long)gotp->br_startoff,
1455 (unsigned long long)gotp->br_blockcount,
1456 gotp->br_state, *lastxp);
1457 *lastxp = NULLEXTNUM;
1465 * Returns the file-relative block number of the first unused block(s)
1466 * in the file with at least "len" logically contiguous blocks free.
1467 * This is the lowest-address hole if the file has holes, else the first block
1468 * past the end of file.
1469 * Return 0 if the file is currently local (in-inode).
1472 xfs_bmap_first_unused(
1473 xfs_trans_t *tp, /* transaction pointer */
1474 xfs_inode_t *ip, /* incore inode */
1475 xfs_extlen_t len, /* size of hole to find */
1476 xfs_fileoff_t *first_unused, /* unused block */
1477 int whichfork) /* data or attr fork */
1479 int error; /* error return value */
1480 int idx; /* extent record index */
1481 xfs_ifork_t *ifp; /* inode fork pointer */
1482 xfs_fileoff_t lastaddr; /* last block number seen */
1483 xfs_fileoff_t lowest; /* lowest useful block */
1484 xfs_fileoff_t max; /* starting useful block */
1485 xfs_fileoff_t off; /* offset for this block */
1486 xfs_extnum_t nextents; /* number of extent entries */
1488 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE ||
1489 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS ||
1490 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
1491 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
1495 ifp = XFS_IFORK_PTR(ip, whichfork);
1496 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
1497 (error = xfs_iread_extents(tp, ip, whichfork)))
1499 lowest = *first_unused;
1500 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
1501 for (idx = 0, lastaddr = 0, max = lowest; idx < nextents; idx++) {
1502 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx);
1503 off = xfs_bmbt_get_startoff(ep);
1505 * See if the hole before this extent will work.
1507 if (off >= lowest + len && off - max >= len) {
1508 *first_unused = max;
1511 lastaddr = off + xfs_bmbt_get_blockcount(ep);
1512 max = XFS_FILEOFF_MAX(lastaddr, lowest);
1514 *first_unused = max;
1519 * Returns the file-relative block number of the last block - 1 before
1520 * last_block (input value) in the file.
1521 * This is not based on i_size, it is based on the extent records.
1522 * Returns 0 for local files, as they do not have extent records.
1525 xfs_bmap_last_before(
1526 xfs_trans_t *tp, /* transaction pointer */
1527 xfs_inode_t *ip, /* incore inode */
1528 xfs_fileoff_t *last_block, /* last block */
1529 int whichfork) /* data or attr fork */
1531 xfs_fileoff_t bno; /* input file offset */
1532 int eof; /* hit end of file */
1533 xfs_bmbt_rec_host_t *ep; /* pointer to last extent */
1534 int error; /* error return value */
1535 xfs_bmbt_irec_t got; /* current extent value */
1536 xfs_ifork_t *ifp; /* inode fork pointer */
1537 xfs_extnum_t lastx; /* last extent used */
1538 xfs_bmbt_irec_t prev; /* previous extent value */
1540 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
1541 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
1542 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL)
1544 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
1548 ifp = XFS_IFORK_PTR(ip, whichfork);
1549 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
1550 (error = xfs_iread_extents(tp, ip, whichfork)))
1552 bno = *last_block - 1;
1553 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got,
1555 if (eof || xfs_bmbt_get_startoff(ep) > bno) {
1556 if (prev.br_startoff == NULLFILEOFF)
1559 *last_block = prev.br_startoff + prev.br_blockcount;
1562 * Otherwise *last_block is already the right answer.
1568 xfs_bmap_last_extent(
1569 struct xfs_trans *tp,
1570 struct xfs_inode *ip,
1572 struct xfs_bmbt_irec *rec,
1575 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
1579 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
1580 error = xfs_iread_extents(tp, ip, whichfork);
1585 nextents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t);
1586 if (nextents == 0) {
1591 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, nextents - 1), rec);
1597 * Check the last inode extent to determine whether this allocation will result
1598 * in blocks being allocated at the end of the file. When we allocate new data
1599 * blocks at the end of the file which do not start at the previous data block,
1600 * we will try to align the new blocks at stripe unit boundaries.
1602 * Returns 1 in bma->aeof if the file (fork) is empty as any new write will be
1603 * at, or past the EOF.
1607 struct xfs_bmalloca *bma,
1610 struct xfs_bmbt_irec rec;
1615 error = xfs_bmap_last_extent(NULL, bma->ip, whichfork, &rec,
1626 * Check if we are allocation or past the last extent, or at least into
1627 * the last delayed allocated extent.
1629 bma->aeof = bma->offset >= rec.br_startoff + rec.br_blockcount ||
1630 (bma->offset >= rec.br_startoff &&
1631 isnullstartblock(rec.br_startblock));
1636 * Returns the file-relative block number of the first block past eof in
1637 * the file. This is not based on i_size, it is based on the extent records.
1638 * Returns 0 for local files, as they do not have extent records.
1641 xfs_bmap_last_offset(
1642 struct xfs_inode *ip,
1643 xfs_fileoff_t *last_block,
1646 struct xfs_bmbt_irec rec;
1652 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL)
1655 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
1656 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
1659 error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, &is_empty);
1660 if (error || is_empty)
1663 *last_block = rec.br_startoff + rec.br_blockcount;
1668 * Returns whether the selected fork of the inode has exactly one
1669 * block or not. For the data fork we check this matches di_size,
1670 * implying the file's range is 0..bsize-1.
1672 int /* 1=>1 block, 0=>otherwise */
1674 xfs_inode_t *ip, /* incore inode */
1675 int whichfork) /* data or attr fork */
1677 xfs_bmbt_rec_host_t *ep; /* ptr to fork's extent */
1678 xfs_ifork_t *ifp; /* inode fork pointer */
1679 int rval; /* return value */
1680 xfs_bmbt_irec_t s; /* internal version of extent */
1683 if (whichfork == XFS_DATA_FORK)
1684 return XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize;
1686 if (XFS_IFORK_NEXTENTS(ip, whichfork) != 1)
1688 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
1690 ifp = XFS_IFORK_PTR(ip, whichfork);
1691 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
1692 ep = xfs_iext_get_ext(ifp, 0);
1693 xfs_bmbt_get_all(ep, &s);
1694 rval = s.br_startoff == 0 && s.br_blockcount == 1;
1695 if (rval && whichfork == XFS_DATA_FORK)
1696 ASSERT(XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize);
1701 * Extent tree manipulation functions used during allocation.
1705 * Convert a delayed allocation to a real allocation.
1707 STATIC int /* error */
1708 xfs_bmap_add_extent_delay_real(
1709 struct xfs_bmalloca *bma)
1711 struct xfs_bmbt_irec *new = &bma->got;
1712 int diff; /* temp value */
1713 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */
1714 int error; /* error return value */
1715 int i; /* temp state */
1716 xfs_ifork_t *ifp; /* inode fork pointer */
1717 xfs_fileoff_t new_endoff; /* end offset of new entry */
1718 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
1719 /* left is 0, right is 1, prev is 2 */
1720 int rval=0; /* return value (logging flags) */
1721 int state = 0;/* state bits, accessed thru macros */
1722 xfs_filblks_t da_new; /* new count del alloc blocks used */
1723 xfs_filblks_t da_old; /* old count del alloc blocks used */
1724 xfs_filblks_t temp=0; /* value for da_new calculations */
1725 xfs_filblks_t temp2=0;/* value for da_new calculations */
1726 int tmp_rval; /* partial logging flags */
1727 struct xfs_mount *mp;
1729 mp = bma->tp ? bma->tp->t_mountp : NULL;
1730 ifp = XFS_IFORK_PTR(bma->ip, XFS_DATA_FORK);
1732 ASSERT(bma->idx >= 0);
1733 ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec));
1734 ASSERT(!isnullstartblock(new->br_startblock));
1736 (bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL));
1738 XFS_STATS_INC(xs_add_exlist);
1745 * Set up a bunch of variables to make the tests simpler.
1747 ep = xfs_iext_get_ext(ifp, bma->idx);
1748 xfs_bmbt_get_all(ep, &PREV);
1749 new_endoff = new->br_startoff + new->br_blockcount;
1750 ASSERT(PREV.br_startoff <= new->br_startoff);
1751 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
1753 da_old = startblockval(PREV.br_startblock);
1757 * Set flags determining what part of the previous delayed allocation
1758 * extent is being replaced by a real allocation.
1760 if (PREV.br_startoff == new->br_startoff)
1761 state |= BMAP_LEFT_FILLING;
1762 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
1763 state |= BMAP_RIGHT_FILLING;
1766 * Check and set flags if this segment has a left neighbor.
1767 * Don't set contiguous if the combined extent would be too large.
1770 state |= BMAP_LEFT_VALID;
1771 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &LEFT);
1773 if (isnullstartblock(LEFT.br_startblock))
1774 state |= BMAP_LEFT_DELAY;
1777 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1778 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
1779 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
1780 LEFT.br_state == new->br_state &&
1781 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1782 state |= BMAP_LEFT_CONTIG;
1785 * Check and set flags if this segment has a right neighbor.
1786 * Don't set contiguous if the combined extent would be too large.
1787 * Also check for all-three-contiguous being too large.
1789 if (bma->idx < bma->ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) {
1790 state |= BMAP_RIGHT_VALID;
1791 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx + 1), &RIGHT);
1793 if (isnullstartblock(RIGHT.br_startblock))
1794 state |= BMAP_RIGHT_DELAY;
1797 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1798 new_endoff == RIGHT.br_startoff &&
1799 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
1800 new->br_state == RIGHT.br_state &&
1801 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
1802 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1803 BMAP_RIGHT_FILLING)) !=
1804 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1805 BMAP_RIGHT_FILLING) ||
1806 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
1808 state |= BMAP_RIGHT_CONTIG;
1812 * Switch out based on the FILLING and CONTIG state bits.
1814 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1815 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
1816 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1817 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1819 * Filling in all of a previously delayed allocation extent.
1820 * The left and right neighbors are both contiguous with new.
1823 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1824 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
1825 LEFT.br_blockcount + PREV.br_blockcount +
1826 RIGHT.br_blockcount);
1827 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1829 xfs_iext_remove(bma->ip, bma->idx + 1, 2, state);
1830 bma->ip->i_d.di_nextents--;
1831 if (bma->cur == NULL)
1832 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1834 rval = XFS_ILOG_CORE;
1835 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
1836 RIGHT.br_startblock,
1837 RIGHT.br_blockcount, &i);
1840 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1841 error = xfs_btree_delete(bma->cur, &i);
1844 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1845 error = xfs_btree_decrement(bma->cur, 0, &i);
1848 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1849 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
1851 LEFT.br_blockcount +
1852 PREV.br_blockcount +
1853 RIGHT.br_blockcount, LEFT.br_state);
1859 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1861 * Filling in all of a previously delayed allocation extent.
1862 * The left neighbor is contiguous, the right is not.
1866 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1867 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
1868 LEFT.br_blockcount + PREV.br_blockcount);
1869 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1871 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
1872 if (bma->cur == NULL)
1873 rval = XFS_ILOG_DEXT;
1876 error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff,
1877 LEFT.br_startblock, LEFT.br_blockcount,
1881 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1882 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
1884 LEFT.br_blockcount +
1885 PREV.br_blockcount, LEFT.br_state);
1891 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1893 * Filling in all of a previously delayed allocation extent.
1894 * The right neighbor is contiguous, the left is not.
1896 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1897 xfs_bmbt_set_startblock(ep, new->br_startblock);
1898 xfs_bmbt_set_blockcount(ep,
1899 PREV.br_blockcount + RIGHT.br_blockcount);
1900 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1902 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
1903 if (bma->cur == NULL)
1904 rval = XFS_ILOG_DEXT;
1907 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
1908 RIGHT.br_startblock,
1909 RIGHT.br_blockcount, &i);
1912 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1913 error = xfs_bmbt_update(bma->cur, PREV.br_startoff,
1915 PREV.br_blockcount +
1916 RIGHT.br_blockcount, PREV.br_state);
1922 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
1924 * Filling in all of a previously delayed allocation extent.
1925 * Neither the left nor right neighbors are contiguous with
1928 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1929 xfs_bmbt_set_startblock(ep, new->br_startblock);
1930 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1932 bma->ip->i_d.di_nextents++;
1933 if (bma->cur == NULL)
1934 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1936 rval = XFS_ILOG_CORE;
1937 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
1938 new->br_startblock, new->br_blockcount,
1942 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
1943 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
1944 error = xfs_btree_insert(bma->cur, &i);
1947 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1951 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
1953 * Filling in the first part of a previous delayed allocation.
1954 * The left neighbor is contiguous.
1956 trace_xfs_bmap_pre_update(bma->ip, bma->idx - 1, state, _THIS_IP_);
1957 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx - 1),
1958 LEFT.br_blockcount + new->br_blockcount);
1959 xfs_bmbt_set_startoff(ep,
1960 PREV.br_startoff + new->br_blockcount);
1961 trace_xfs_bmap_post_update(bma->ip, bma->idx - 1, state, _THIS_IP_);
1963 temp = PREV.br_blockcount - new->br_blockcount;
1964 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1965 xfs_bmbt_set_blockcount(ep, temp);
1966 if (bma->cur == NULL)
1967 rval = XFS_ILOG_DEXT;
1970 error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff,
1971 LEFT.br_startblock, LEFT.br_blockcount,
1975 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
1976 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
1978 LEFT.br_blockcount +
1984 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
1985 startblockval(PREV.br_startblock));
1986 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
1987 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1992 case BMAP_LEFT_FILLING:
1994 * Filling in the first part of a previous delayed allocation.
1995 * The left neighbor is not contiguous.
1997 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1998 xfs_bmbt_set_startoff(ep, new_endoff);
1999 temp = PREV.br_blockcount - new->br_blockcount;
2000 xfs_bmbt_set_blockcount(ep, temp);
2001 xfs_iext_insert(bma->ip, bma->idx, 1, new, state);
2002 bma->ip->i_d.di_nextents++;
2003 if (bma->cur == NULL)
2004 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2006 rval = XFS_ILOG_CORE;
2007 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
2008 new->br_startblock, new->br_blockcount,
2012 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2013 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
2014 error = xfs_btree_insert(bma->cur, &i);
2017 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2020 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
2021 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2022 bma->firstblock, bma->flist,
2023 &bma->cur, 1, &tmp_rval, XFS_DATA_FORK);
2028 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
2029 startblockval(PREV.br_startblock) -
2030 (bma->cur ? bma->cur->bc_private.b.allocated : 0));
2031 ep = xfs_iext_get_ext(ifp, bma->idx + 1);
2032 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
2033 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
2036 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2038 * Filling in the last part of a previous delayed allocation.
2039 * The right neighbor is contiguous with the new allocation.
2041 temp = PREV.br_blockcount - new->br_blockcount;
2042 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
2043 xfs_bmbt_set_blockcount(ep, temp);
2044 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx + 1),
2045 new->br_startoff, new->br_startblock,
2046 new->br_blockcount + RIGHT.br_blockcount,
2048 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
2049 if (bma->cur == NULL)
2050 rval = XFS_ILOG_DEXT;
2053 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
2054 RIGHT.br_startblock,
2055 RIGHT.br_blockcount, &i);
2058 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2059 error = xfs_bmbt_update(bma->cur, new->br_startoff,
2061 new->br_blockcount +
2062 RIGHT.br_blockcount,
2068 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
2069 startblockval(PREV.br_startblock));
2070 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
2071 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
2072 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2077 case BMAP_RIGHT_FILLING:
2079 * Filling in the last part of a previous delayed allocation.
2080 * The right neighbor is not contiguous.
2082 temp = PREV.br_blockcount - new->br_blockcount;
2083 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
2084 xfs_bmbt_set_blockcount(ep, temp);
2085 xfs_iext_insert(bma->ip, bma->idx + 1, 1, new, state);
2086 bma->ip->i_d.di_nextents++;
2087 if (bma->cur == NULL)
2088 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2090 rval = XFS_ILOG_CORE;
2091 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
2092 new->br_startblock, new->br_blockcount,
2096 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2097 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
2098 error = xfs_btree_insert(bma->cur, &i);
2101 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2104 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
2105 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2106 bma->firstblock, bma->flist, &bma->cur, 1,
2107 &tmp_rval, XFS_DATA_FORK);
2112 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
2113 startblockval(PREV.br_startblock) -
2114 (bma->cur ? bma->cur->bc_private.b.allocated : 0));
2115 ep = xfs_iext_get_ext(ifp, bma->idx);
2116 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
2117 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2124 * Filling in the middle part of a previous delayed allocation.
2125 * Contiguity is impossible here.
2126 * This case is avoided almost all the time.
2128 * We start with a delayed allocation:
2130 * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+
2133 * and we are allocating:
2134 * +rrrrrrrrrrrrrrrrr+
2137 * and we set it up for insertion as:
2138 * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+
2140 * PREV @ idx LEFT RIGHT
2141 * inserted at idx + 1
2143 temp = new->br_startoff - PREV.br_startoff;
2144 temp2 = PREV.br_startoff + PREV.br_blockcount - new_endoff;
2145 trace_xfs_bmap_pre_update(bma->ip, bma->idx, 0, _THIS_IP_);
2146 xfs_bmbt_set_blockcount(ep, temp); /* truncate PREV */
2148 RIGHT.br_state = PREV.br_state;
2149 RIGHT.br_startblock = nullstartblock(
2150 (int)xfs_bmap_worst_indlen(bma->ip, temp2));
2151 RIGHT.br_startoff = new_endoff;
2152 RIGHT.br_blockcount = temp2;
2153 /* insert LEFT (r[0]) and RIGHT (r[1]) at the same time */
2154 xfs_iext_insert(bma->ip, bma->idx + 1, 2, &LEFT, state);
2155 bma->ip->i_d.di_nextents++;
2156 if (bma->cur == NULL)
2157 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2159 rval = XFS_ILOG_CORE;
2160 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
2161 new->br_startblock, new->br_blockcount,
2165 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2166 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
2167 error = xfs_btree_insert(bma->cur, &i);
2170 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2173 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
2174 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2175 bma->firstblock, bma->flist, &bma->cur,
2176 1, &tmp_rval, XFS_DATA_FORK);
2181 temp = xfs_bmap_worst_indlen(bma->ip, temp);
2182 temp2 = xfs_bmap_worst_indlen(bma->ip, temp2);
2183 diff = (int)(temp + temp2 - startblockval(PREV.br_startblock) -
2184 (bma->cur ? bma->cur->bc_private.b.allocated : 0));
2186 error = xfs_mod_fdblocks(bma->ip->i_mount,
2187 -((int64_t)diff), false);
2193 ep = xfs_iext_get_ext(ifp, bma->idx);
2194 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2195 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
2196 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 2, state, _THIS_IP_);
2197 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, bma->idx + 2),
2198 nullstartblock((int)temp2));
2199 trace_xfs_bmap_post_update(bma->ip, bma->idx + 2, state, _THIS_IP_);
2202 da_new = temp + temp2;
2205 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2206 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2207 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
2208 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2209 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2210 case BMAP_LEFT_CONTIG:
2211 case BMAP_RIGHT_CONTIG:
2213 * These cases are all impossible.
2218 /* convert to a btree if necessary */
2219 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
2220 int tmp_logflags; /* partial log flag return val */
2222 ASSERT(bma->cur == NULL);
2223 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
2224 bma->firstblock, bma->flist, &bma->cur,
2225 da_old > 0, &tmp_logflags, XFS_DATA_FORK);
2226 bma->logflags |= tmp_logflags;
2231 /* adjust for changes in reserved delayed indirect blocks */
2232 if (da_old || da_new) {
2235 temp += bma->cur->bc_private.b.allocated;
2236 ASSERT(temp <= da_old);
2238 xfs_mod_fdblocks(bma->ip->i_mount,
2239 (int64_t)(da_old - temp), false);
2242 /* clear out the allocated field, done with it now in any case. */
2244 bma->cur->bc_private.b.allocated = 0;
2246 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, XFS_DATA_FORK);
2248 bma->logflags |= rval;
2256 * Convert an unwritten allocation to a real allocation or vice versa.
2258 STATIC int /* error */
2259 xfs_bmap_add_extent_unwritten_real(
2260 struct xfs_trans *tp,
2261 xfs_inode_t *ip, /* incore inode pointer */
2262 xfs_extnum_t *idx, /* extent number to update/insert */
2263 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
2264 xfs_bmbt_irec_t *new, /* new data to add to file extents */
2265 xfs_fsblock_t *first, /* pointer to firstblock variable */
2266 xfs_bmap_free_t *flist, /* list of extents to be freed */
2267 int *logflagsp) /* inode logging flags */
2269 xfs_btree_cur_t *cur; /* btree cursor */
2270 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */
2271 int error; /* error return value */
2272 int i; /* temp state */
2273 xfs_ifork_t *ifp; /* inode fork pointer */
2274 xfs_fileoff_t new_endoff; /* end offset of new entry */
2275 xfs_exntst_t newext; /* new extent state */
2276 xfs_exntst_t oldext; /* old extent state */
2277 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
2278 /* left is 0, right is 1, prev is 2 */
2279 int rval=0; /* return value (logging flags) */
2280 int state = 0;/* state bits, accessed thru macros */
2281 struct xfs_mount *mp = tp->t_mountp;
2286 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
2289 ASSERT(*idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec));
2290 ASSERT(!isnullstartblock(new->br_startblock));
2292 XFS_STATS_INC(xs_add_exlist);
2299 * Set up a bunch of variables to make the tests simpler.
2302 ep = xfs_iext_get_ext(ifp, *idx);
2303 xfs_bmbt_get_all(ep, &PREV);
2304 newext = new->br_state;
2305 oldext = (newext == XFS_EXT_UNWRITTEN) ?
2306 XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
2307 ASSERT(PREV.br_state == oldext);
2308 new_endoff = new->br_startoff + new->br_blockcount;
2309 ASSERT(PREV.br_startoff <= new->br_startoff);
2310 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
2313 * Set flags determining what part of the previous oldext allocation
2314 * extent is being replaced by a newext allocation.
2316 if (PREV.br_startoff == new->br_startoff)
2317 state |= BMAP_LEFT_FILLING;
2318 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
2319 state |= BMAP_RIGHT_FILLING;
2322 * Check and set flags if this segment has a left neighbor.
2323 * Don't set contiguous if the combined extent would be too large.
2326 state |= BMAP_LEFT_VALID;
2327 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT);
2329 if (isnullstartblock(LEFT.br_startblock))
2330 state |= BMAP_LEFT_DELAY;
2333 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
2334 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
2335 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
2336 LEFT.br_state == newext &&
2337 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2338 state |= BMAP_LEFT_CONTIG;
2341 * Check and set flags if this segment has a right neighbor.
2342 * Don't set contiguous if the combined extent would be too large.
2343 * Also check for all-three-contiguous being too large.
2345 if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) {
2346 state |= BMAP_RIGHT_VALID;
2347 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT);
2348 if (isnullstartblock(RIGHT.br_startblock))
2349 state |= BMAP_RIGHT_DELAY;
2352 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
2353 new_endoff == RIGHT.br_startoff &&
2354 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
2355 newext == RIGHT.br_state &&
2356 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
2357 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
2358 BMAP_RIGHT_FILLING)) !=
2359 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
2360 BMAP_RIGHT_FILLING) ||
2361 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
2363 state |= BMAP_RIGHT_CONTIG;
2366 * Switch out based on the FILLING and CONTIG state bits.
2368 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
2369 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
2370 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
2371 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2373 * Setting all of a previous oldext extent to newext.
2374 * The left and right neighbors are both contiguous with new.
2378 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2379 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
2380 LEFT.br_blockcount + PREV.br_blockcount +
2381 RIGHT.br_blockcount);
2382 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2384 xfs_iext_remove(ip, *idx + 1, 2, state);
2385 ip->i_d.di_nextents -= 2;
2387 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2389 rval = XFS_ILOG_CORE;
2390 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
2391 RIGHT.br_startblock,
2392 RIGHT.br_blockcount, &i)))
2394 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2395 if ((error = xfs_btree_delete(cur, &i)))
2397 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2398 if ((error = xfs_btree_decrement(cur, 0, &i)))
2400 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2401 if ((error = xfs_btree_delete(cur, &i)))
2403 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2404 if ((error = xfs_btree_decrement(cur, 0, &i)))
2406 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2407 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
2409 LEFT.br_blockcount + PREV.br_blockcount +
2410 RIGHT.br_blockcount, LEFT.br_state)))
2415 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2417 * Setting all of a previous oldext extent to newext.
2418 * The left neighbor is contiguous, the right is not.
2422 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2423 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
2424 LEFT.br_blockcount + PREV.br_blockcount);
2425 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2427 xfs_iext_remove(ip, *idx + 1, 1, state);
2428 ip->i_d.di_nextents--;
2430 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2432 rval = XFS_ILOG_CORE;
2433 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2434 PREV.br_startblock, PREV.br_blockcount,
2437 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2438 if ((error = xfs_btree_delete(cur, &i)))
2440 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2441 if ((error = xfs_btree_decrement(cur, 0, &i)))
2443 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2444 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
2446 LEFT.br_blockcount + PREV.br_blockcount,
2452 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2454 * Setting all of a previous oldext extent to newext.
2455 * The right neighbor is contiguous, the left is not.
2457 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2458 xfs_bmbt_set_blockcount(ep,
2459 PREV.br_blockcount + RIGHT.br_blockcount);
2460 xfs_bmbt_set_state(ep, newext);
2461 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2462 xfs_iext_remove(ip, *idx + 1, 1, state);
2463 ip->i_d.di_nextents--;
2465 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2467 rval = XFS_ILOG_CORE;
2468 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
2469 RIGHT.br_startblock,
2470 RIGHT.br_blockcount, &i)))
2472 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2473 if ((error = xfs_btree_delete(cur, &i)))
2475 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2476 if ((error = xfs_btree_decrement(cur, 0, &i)))
2478 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2479 if ((error = xfs_bmbt_update(cur, new->br_startoff,
2481 new->br_blockcount + RIGHT.br_blockcount,
2487 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
2489 * Setting all of a previous oldext extent to newext.
2490 * Neither the left nor right neighbors are contiguous with
2493 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2494 xfs_bmbt_set_state(ep, newext);
2495 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2498 rval = XFS_ILOG_DEXT;
2501 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
2502 new->br_startblock, new->br_blockcount,
2505 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2506 if ((error = xfs_bmbt_update(cur, new->br_startoff,
2507 new->br_startblock, new->br_blockcount,
2513 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
2515 * Setting the first part of a previous oldext extent to newext.
2516 * The left neighbor is contiguous.
2518 trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_);
2519 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1),
2520 LEFT.br_blockcount + new->br_blockcount);
2521 xfs_bmbt_set_startoff(ep,
2522 PREV.br_startoff + new->br_blockcount);
2523 trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_);
2525 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2526 xfs_bmbt_set_startblock(ep,
2527 new->br_startblock + new->br_blockcount);
2528 xfs_bmbt_set_blockcount(ep,
2529 PREV.br_blockcount - new->br_blockcount);
2530 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2535 rval = XFS_ILOG_DEXT;
2538 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2539 PREV.br_startblock, PREV.br_blockcount,
2542 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2543 if ((error = xfs_bmbt_update(cur,
2544 PREV.br_startoff + new->br_blockcount,
2545 PREV.br_startblock + new->br_blockcount,
2546 PREV.br_blockcount - new->br_blockcount,
2549 if ((error = xfs_btree_decrement(cur, 0, &i)))
2551 error = xfs_bmbt_update(cur, LEFT.br_startoff,
2553 LEFT.br_blockcount + new->br_blockcount,
2560 case BMAP_LEFT_FILLING:
2562 * Setting the first part of a previous oldext extent to newext.
2563 * The left neighbor is not contiguous.
2565 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2566 ASSERT(ep && xfs_bmbt_get_state(ep) == oldext);
2567 xfs_bmbt_set_startoff(ep, new_endoff);
2568 xfs_bmbt_set_blockcount(ep,
2569 PREV.br_blockcount - new->br_blockcount);
2570 xfs_bmbt_set_startblock(ep,
2571 new->br_startblock + new->br_blockcount);
2572 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2574 xfs_iext_insert(ip, *idx, 1, new, state);
2575 ip->i_d.di_nextents++;
2577 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2579 rval = XFS_ILOG_CORE;
2580 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2581 PREV.br_startblock, PREV.br_blockcount,
2584 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2585 if ((error = xfs_bmbt_update(cur,
2586 PREV.br_startoff + new->br_blockcount,
2587 PREV.br_startblock + new->br_blockcount,
2588 PREV.br_blockcount - new->br_blockcount,
2591 cur->bc_rec.b = *new;
2592 if ((error = xfs_btree_insert(cur, &i)))
2594 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2598 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
2600 * Setting the last part of a previous oldext extent to newext.
2601 * The right neighbor is contiguous with the new allocation.
2603 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2604 xfs_bmbt_set_blockcount(ep,
2605 PREV.br_blockcount - new->br_blockcount);
2606 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2610 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2611 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
2612 new->br_startoff, new->br_startblock,
2613 new->br_blockcount + RIGHT.br_blockcount, newext);
2614 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2617 rval = XFS_ILOG_DEXT;
2620 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2622 PREV.br_blockcount, &i)))
2624 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2625 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
2627 PREV.br_blockcount - new->br_blockcount,
2630 if ((error = xfs_btree_increment(cur, 0, &i)))
2632 if ((error = xfs_bmbt_update(cur, new->br_startoff,
2634 new->br_blockcount + RIGHT.br_blockcount,
2640 case BMAP_RIGHT_FILLING:
2642 * Setting the last part of a previous oldext extent to newext.
2643 * The right neighbor is not contiguous.
2645 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2646 xfs_bmbt_set_blockcount(ep,
2647 PREV.br_blockcount - new->br_blockcount);
2648 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2651 xfs_iext_insert(ip, *idx, 1, new, state);
2653 ip->i_d.di_nextents++;
2655 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2657 rval = XFS_ILOG_CORE;
2658 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2659 PREV.br_startblock, PREV.br_blockcount,
2662 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2663 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
2665 PREV.br_blockcount - new->br_blockcount,
2668 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
2669 new->br_startblock, new->br_blockcount,
2672 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2673 cur->bc_rec.b.br_state = XFS_EXT_NORM;
2674 if ((error = xfs_btree_insert(cur, &i)))
2676 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2682 * Setting the middle part of a previous oldext extent to
2683 * newext. Contiguity is impossible here.
2684 * One extent becomes three extents.
2686 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2687 xfs_bmbt_set_blockcount(ep,
2688 new->br_startoff - PREV.br_startoff);
2689 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2692 r[1].br_startoff = new_endoff;
2693 r[1].br_blockcount =
2694 PREV.br_startoff + PREV.br_blockcount - new_endoff;
2695 r[1].br_startblock = new->br_startblock + new->br_blockcount;
2696 r[1].br_state = oldext;
2699 xfs_iext_insert(ip, *idx, 2, &r[0], state);
2701 ip->i_d.di_nextents += 2;
2703 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
2705 rval = XFS_ILOG_CORE;
2706 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
2707 PREV.br_startblock, PREV.br_blockcount,
2710 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2711 /* new right extent - oldext */
2712 if ((error = xfs_bmbt_update(cur, r[1].br_startoff,
2713 r[1].br_startblock, r[1].br_blockcount,
2716 /* new left extent - oldext */
2717 cur->bc_rec.b = PREV;
2718 cur->bc_rec.b.br_blockcount =
2719 new->br_startoff - PREV.br_startoff;
2720 if ((error = xfs_btree_insert(cur, &i)))
2722 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2724 * Reset the cursor to the position of the new extent
2725 * we are about to insert as we can't trust it after
2726 * the previous insert.
2728 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
2729 new->br_startblock, new->br_blockcount,
2732 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
2733 /* new middle extent - newext */
2734 cur->bc_rec.b.br_state = new->br_state;
2735 if ((error = xfs_btree_insert(cur, &i)))
2737 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
2741 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2742 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2743 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
2744 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
2745 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2746 case BMAP_LEFT_CONTIG:
2747 case BMAP_RIGHT_CONTIG:
2749 * These cases are all impossible.
2754 /* convert to a btree if necessary */
2755 if (xfs_bmap_needs_btree(ip, XFS_DATA_FORK)) {
2756 int tmp_logflags; /* partial log flag return val */
2758 ASSERT(cur == NULL);
2759 error = xfs_bmap_extents_to_btree(tp, ip, first, flist, &cur,
2760 0, &tmp_logflags, XFS_DATA_FORK);
2761 *logflagsp |= tmp_logflags;
2766 /* clear out the allocated field, done with it now in any case. */
2768 cur->bc_private.b.allocated = 0;
2772 xfs_bmap_check_leaf_extents(*curp, ip, XFS_DATA_FORK);
2782 * Convert a hole to a delayed allocation.
2785 xfs_bmap_add_extent_hole_delay(
2786 xfs_inode_t *ip, /* incore inode pointer */
2787 xfs_extnum_t *idx, /* extent number to update/insert */
2788 xfs_bmbt_irec_t *new) /* new data to add to file extents */
2790 xfs_ifork_t *ifp; /* inode fork pointer */
2791 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2792 xfs_filblks_t newlen=0; /* new indirect size */
2793 xfs_filblks_t oldlen=0; /* old indirect size */
2794 xfs_bmbt_irec_t right; /* right neighbor extent entry */
2795 int state; /* state bits, accessed thru macros */
2796 xfs_filblks_t temp=0; /* temp for indirect calculations */
2798 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
2800 ASSERT(isnullstartblock(new->br_startblock));
2803 * Check and set flags if this segment has a left neighbor
2806 state |= BMAP_LEFT_VALID;
2807 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left);
2809 if (isnullstartblock(left.br_startblock))
2810 state |= BMAP_LEFT_DELAY;
2814 * Check and set flags if the current (right) segment exists.
2815 * If it doesn't exist, we're converting the hole at end-of-file.
2817 if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) {
2818 state |= BMAP_RIGHT_VALID;
2819 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right);
2821 if (isnullstartblock(right.br_startblock))
2822 state |= BMAP_RIGHT_DELAY;
2826 * Set contiguity flags on the left and right neighbors.
2827 * Don't let extents get too large, even if the pieces are contiguous.
2829 if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) &&
2830 left.br_startoff + left.br_blockcount == new->br_startoff &&
2831 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2832 state |= BMAP_LEFT_CONTIG;
2834 if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) &&
2835 new->br_startoff + new->br_blockcount == right.br_startoff &&
2836 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
2837 (!(state & BMAP_LEFT_CONTIG) ||
2838 (left.br_blockcount + new->br_blockcount +
2839 right.br_blockcount <= MAXEXTLEN)))
2840 state |= BMAP_RIGHT_CONTIG;
2843 * Switch out based on the contiguity flags.
2845 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
2846 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
2848 * New allocation is contiguous with delayed allocations
2849 * on the left and on the right.
2850 * Merge all three into a single extent record.
2853 temp = left.br_blockcount + new->br_blockcount +
2854 right.br_blockcount;
2856 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2857 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
2858 oldlen = startblockval(left.br_startblock) +
2859 startblockval(new->br_startblock) +
2860 startblockval(right.br_startblock);
2861 newlen = xfs_bmap_worst_indlen(ip, temp);
2862 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
2863 nullstartblock((int)newlen));
2864 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2866 xfs_iext_remove(ip, *idx + 1, 1, state);
2869 case BMAP_LEFT_CONTIG:
2871 * New allocation is contiguous with a delayed allocation
2873 * Merge the new allocation with the left neighbor.
2876 temp = left.br_blockcount + new->br_blockcount;
2878 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2879 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
2880 oldlen = startblockval(left.br_startblock) +
2881 startblockval(new->br_startblock);
2882 newlen = xfs_bmap_worst_indlen(ip, temp);
2883 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
2884 nullstartblock((int)newlen));
2885 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2888 case BMAP_RIGHT_CONTIG:
2890 * New allocation is contiguous with a delayed allocation
2892 * Merge the new allocation with the right neighbor.
2894 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2895 temp = new->br_blockcount + right.br_blockcount;
2896 oldlen = startblockval(new->br_startblock) +
2897 startblockval(right.br_startblock);
2898 newlen = xfs_bmap_worst_indlen(ip, temp);
2899 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
2901 nullstartblock((int)newlen), temp, right.br_state);
2902 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2907 * New allocation is not contiguous with another
2908 * delayed allocation.
2909 * Insert a new entry.
2911 oldlen = newlen = 0;
2912 xfs_iext_insert(ip, *idx, 1, new, state);
2915 if (oldlen != newlen) {
2916 ASSERT(oldlen > newlen);
2917 xfs_mod_fdblocks(ip->i_mount, (int64_t)(oldlen - newlen),
2920 * Nothing to do for disk quota accounting here.
2926 * Convert a hole to a real allocation.
2928 STATIC int /* error */
2929 xfs_bmap_add_extent_hole_real(
2930 struct xfs_bmalloca *bma,
2933 struct xfs_bmbt_irec *new = &bma->got;
2934 int error; /* error return value */
2935 int i; /* temp state */
2936 xfs_ifork_t *ifp; /* inode fork pointer */
2937 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2938 xfs_bmbt_irec_t right; /* right neighbor extent entry */
2939 int rval=0; /* return value (logging flags) */
2940 int state; /* state bits, accessed thru macros */
2941 struct xfs_mount *mp;
2943 mp = bma->tp ? bma->tp->t_mountp : NULL;
2944 ifp = XFS_IFORK_PTR(bma->ip, whichfork);
2946 ASSERT(bma->idx >= 0);
2947 ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec));
2948 ASSERT(!isnullstartblock(new->br_startblock));
2950 !(bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL));
2952 XFS_STATS_INC(xs_add_exlist);
2955 if (whichfork == XFS_ATTR_FORK)
2956 state |= BMAP_ATTRFORK;
2959 * Check and set flags if this segment has a left neighbor.
2962 state |= BMAP_LEFT_VALID;
2963 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &left);
2964 if (isnullstartblock(left.br_startblock))
2965 state |= BMAP_LEFT_DELAY;
2969 * Check and set flags if this segment has a current value.
2970 * Not true if we're inserting into the "hole" at eof.
2972 if (bma->idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) {
2973 state |= BMAP_RIGHT_VALID;
2974 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &right);
2975 if (isnullstartblock(right.br_startblock))
2976 state |= BMAP_RIGHT_DELAY;
2980 * We're inserting a real allocation between "left" and "right".
2981 * Set the contiguity flags. Don't let extents get too large.
2983 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
2984 left.br_startoff + left.br_blockcount == new->br_startoff &&
2985 left.br_startblock + left.br_blockcount == new->br_startblock &&
2986 left.br_state == new->br_state &&
2987 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2988 state |= BMAP_LEFT_CONTIG;
2990 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
2991 new->br_startoff + new->br_blockcount == right.br_startoff &&
2992 new->br_startblock + new->br_blockcount == right.br_startblock &&
2993 new->br_state == right.br_state &&
2994 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
2995 (!(state & BMAP_LEFT_CONTIG) ||
2996 left.br_blockcount + new->br_blockcount +
2997 right.br_blockcount <= MAXEXTLEN))
2998 state |= BMAP_RIGHT_CONTIG;
3002 * Select which case we're in here, and implement it.
3004 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
3005 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
3007 * New allocation is contiguous with real allocations on the
3008 * left and on the right.
3009 * Merge all three into a single extent record.
3012 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
3013 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
3014 left.br_blockcount + new->br_blockcount +
3015 right.br_blockcount);
3016 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
3018 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
3020 XFS_IFORK_NEXT_SET(bma->ip, whichfork,
3021 XFS_IFORK_NEXTENTS(bma->ip, whichfork) - 1);
3022 if (bma->cur == NULL) {
3023 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
3025 rval = XFS_ILOG_CORE;
3026 error = xfs_bmbt_lookup_eq(bma->cur, right.br_startoff,
3027 right.br_startblock, right.br_blockcount,
3031 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3032 error = xfs_btree_delete(bma->cur, &i);
3035 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3036 error = xfs_btree_decrement(bma->cur, 0, &i);
3039 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3040 error = xfs_bmbt_update(bma->cur, left.br_startoff,
3042 left.br_blockcount +
3043 new->br_blockcount +
3044 right.br_blockcount,
3051 case BMAP_LEFT_CONTIG:
3053 * New allocation is contiguous with a real allocation
3055 * Merge the new allocation with the left neighbor.
3058 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
3059 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
3060 left.br_blockcount + new->br_blockcount);
3061 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
3063 if (bma->cur == NULL) {
3064 rval = xfs_ilog_fext(whichfork);
3067 error = xfs_bmbt_lookup_eq(bma->cur, left.br_startoff,
3068 left.br_startblock, left.br_blockcount,
3072 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3073 error = xfs_bmbt_update(bma->cur, left.br_startoff,
3075 left.br_blockcount +
3083 case BMAP_RIGHT_CONTIG:
3085 * New allocation is contiguous with a real allocation
3087 * Merge the new allocation with the right neighbor.
3089 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
3090 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx),
3091 new->br_startoff, new->br_startblock,
3092 new->br_blockcount + right.br_blockcount,
3094 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
3096 if (bma->cur == NULL) {
3097 rval = xfs_ilog_fext(whichfork);
3100 error = xfs_bmbt_lookup_eq(bma->cur,
3102 right.br_startblock,
3103 right.br_blockcount, &i);
3106 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3107 error = xfs_bmbt_update(bma->cur, new->br_startoff,
3109 new->br_blockcount +
3110 right.br_blockcount,
3119 * New allocation is not contiguous with another
3121 * Insert a new entry.
3123 xfs_iext_insert(bma->ip, bma->idx, 1, new, state);
3124 XFS_IFORK_NEXT_SET(bma->ip, whichfork,
3125 XFS_IFORK_NEXTENTS(bma->ip, whichfork) + 1);
3126 if (bma->cur == NULL) {
3127 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
3129 rval = XFS_ILOG_CORE;
3130 error = xfs_bmbt_lookup_eq(bma->cur,
3133 new->br_blockcount, &i);
3136 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done);
3137 bma->cur->bc_rec.b.br_state = new->br_state;
3138 error = xfs_btree_insert(bma->cur, &i);
3141 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
3146 /* convert to a btree if necessary */
3147 if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
3148 int tmp_logflags; /* partial log flag return val */
3150 ASSERT(bma->cur == NULL);
3151 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
3152 bma->firstblock, bma->flist, &bma->cur,
3153 0, &tmp_logflags, whichfork);
3154 bma->logflags |= tmp_logflags;
3159 /* clear out the allocated field, done with it now in any case. */
3161 bma->cur->bc_private.b.allocated = 0;
3163 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork);
3165 bma->logflags |= rval;
3170 * Functions used in the extent read, allocate and remove paths
3174 * Adjust the size of the new extent based on di_extsize and rt extsize.
3177 xfs_bmap_extsize_align(
3179 xfs_bmbt_irec_t *gotp, /* next extent pointer */
3180 xfs_bmbt_irec_t *prevp, /* previous extent pointer */
3181 xfs_extlen_t extsz, /* align to this extent size */
3182 int rt, /* is this a realtime inode? */
3183 int eof, /* is extent at end-of-file? */
3184 int delay, /* creating delalloc extent? */
3185 int convert, /* overwriting unwritten extent? */
3186 xfs_fileoff_t *offp, /* in/out: aligned offset */
3187 xfs_extlen_t *lenp) /* in/out: aligned length */
3189 xfs_fileoff_t orig_off; /* original offset */
3190 xfs_extlen_t orig_alen; /* original length */
3191 xfs_fileoff_t orig_end; /* original off+len */
3192 xfs_fileoff_t nexto; /* next file offset */
3193 xfs_fileoff_t prevo; /* previous file offset */
3194 xfs_fileoff_t align_off; /* temp for offset */
3195 xfs_extlen_t align_alen; /* temp for length */
3196 xfs_extlen_t temp; /* temp for calculations */
3201 orig_off = align_off = *offp;
3202 orig_alen = align_alen = *lenp;
3203 orig_end = orig_off + orig_alen;
3206 * If this request overlaps an existing extent, then don't
3207 * attempt to perform any additional alignment.
3209 if (!delay && !eof &&
3210 (orig_off >= gotp->br_startoff) &&
3211 (orig_end <= gotp->br_startoff + gotp->br_blockcount)) {
3216 * If the file offset is unaligned vs. the extent size
3217 * we need to align it. This will be possible unless
3218 * the file was previously written with a kernel that didn't
3219 * perform this alignment, or if a truncate shot us in the
3222 temp = do_mod(orig_off, extsz);
3228 * Same adjustment for the end of the requested area.
3230 if ((temp = (align_alen % extsz))) {
3231 align_alen += extsz - temp;
3234 * If the previous block overlaps with this proposed allocation
3235 * then move the start forward without adjusting the length.
3237 if (prevp->br_startoff != NULLFILEOFF) {
3238 if (prevp->br_startblock == HOLESTARTBLOCK)
3239 prevo = prevp->br_startoff;
3241 prevo = prevp->br_startoff + prevp->br_blockcount;
3244 if (align_off != orig_off && align_off < prevo)
3247 * If the next block overlaps with this proposed allocation
3248 * then move the start back without adjusting the length,
3249 * but not before offset 0.
3250 * This may of course make the start overlap previous block,
3251 * and if we hit the offset 0 limit then the next block
3252 * can still overlap too.
3254 if (!eof && gotp->br_startoff != NULLFILEOFF) {
3255 if ((delay && gotp->br_startblock == HOLESTARTBLOCK) ||
3256 (!delay && gotp->br_startblock == DELAYSTARTBLOCK))
3257 nexto = gotp->br_startoff + gotp->br_blockcount;
3259 nexto = gotp->br_startoff;
3261 nexto = NULLFILEOFF;
3263 align_off + align_alen != orig_end &&
3264 align_off + align_alen > nexto)
3265 align_off = nexto > align_alen ? nexto - align_alen : 0;
3267 * If we're now overlapping the next or previous extent that
3268 * means we can't fit an extsz piece in this hole. Just move
3269 * the start forward to the first valid spot and set
3270 * the length so we hit the end.
3272 if (align_off != orig_off && align_off < prevo)
3274 if (align_off + align_alen != orig_end &&
3275 align_off + align_alen > nexto &&
3276 nexto != NULLFILEOFF) {
3277 ASSERT(nexto > prevo);
3278 align_alen = nexto - align_off;
3282 * If realtime, and the result isn't a multiple of the realtime
3283 * extent size we need to remove blocks until it is.
3285 if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) {
3287 * We're not covering the original request, or
3288 * we won't be able to once we fix the length.
3290 if (orig_off < align_off ||
3291 orig_end > align_off + align_alen ||
3292 align_alen - temp < orig_alen)
3295 * Try to fix it by moving the start up.
3297 if (align_off + temp <= orig_off) {
3302 * Try to fix it by moving the end in.
3304 else if (align_off + align_alen - temp >= orig_end)
3307 * Set the start to the minimum then trim the length.
3310 align_alen -= orig_off - align_off;
3311 align_off = orig_off;
3312 align_alen -= align_alen % mp->m_sb.sb_rextsize;
3315 * Result doesn't cover the request, fail it.
3317 if (orig_off < align_off || orig_end > align_off + align_alen)
3320 ASSERT(orig_off >= align_off);
3321 ASSERT(orig_end <= align_off + align_alen);
3325 if (!eof && gotp->br_startoff != NULLFILEOFF)
3326 ASSERT(align_off + align_alen <= gotp->br_startoff);
3327 if (prevp->br_startoff != NULLFILEOFF)
3328 ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount);
3336 #define XFS_ALLOC_GAP_UNITS 4
3340 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3342 xfs_fsblock_t adjust; /* adjustment to block numbers */
3343 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
3344 xfs_mount_t *mp; /* mount point structure */
3345 int nullfb; /* true if ap->firstblock isn't set */
3346 int rt; /* true if inode is realtime */
3348 #define ISVALID(x,y) \
3350 (x) < mp->m_sb.sb_rblocks : \
3351 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \
3352 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \
3353 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks)
3355 mp = ap->ip->i_mount;
3356 nullfb = *ap->firstblock == NULLFSBLOCK;
3357 rt = XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata;
3358 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock);
3360 * If allocating at eof, and there's a previous real block,
3361 * try to use its last block as our starting point.
3363 if (ap->eof && ap->prev.br_startoff != NULLFILEOFF &&
3364 !isnullstartblock(ap->prev.br_startblock) &&
3365 ISVALID(ap->prev.br_startblock + ap->prev.br_blockcount,
3366 ap->prev.br_startblock)) {
3367 ap->blkno = ap->prev.br_startblock + ap->prev.br_blockcount;
3369 * Adjust for the gap between prevp and us.
3371 adjust = ap->offset -
3372 (ap->prev.br_startoff + ap->prev.br_blockcount);
3374 ISVALID(ap->blkno + adjust, ap->prev.br_startblock))
3375 ap->blkno += adjust;
3378 * If not at eof, then compare the two neighbor blocks.
3379 * Figure out whether either one gives us a good starting point,
3380 * and pick the better one.
3382 else if (!ap->eof) {
3383 xfs_fsblock_t gotbno; /* right side block number */
3384 xfs_fsblock_t gotdiff=0; /* right side difference */
3385 xfs_fsblock_t prevbno; /* left side block number */
3386 xfs_fsblock_t prevdiff=0; /* left side difference */
3389 * If there's a previous (left) block, select a requested
3390 * start block based on it.
3392 if (ap->prev.br_startoff != NULLFILEOFF &&
3393 !isnullstartblock(ap->prev.br_startblock) &&
3394 (prevbno = ap->prev.br_startblock +
3395 ap->prev.br_blockcount) &&
3396 ISVALID(prevbno, ap->prev.br_startblock)) {
3398 * Calculate gap to end of previous block.
3400 adjust = prevdiff = ap->offset -
3401 (ap->prev.br_startoff +
3402 ap->prev.br_blockcount);
3404 * Figure the startblock based on the previous block's
3405 * end and the gap size.
3407 * If the gap is large relative to the piece we're
3408 * allocating, or using it gives us an invalid block
3409 * number, then just use the end of the previous block.
3411 if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
3412 ISVALID(prevbno + prevdiff,
3413 ap->prev.br_startblock))
3418 * If the firstblock forbids it, can't use it,
3421 if (!rt && !nullfb &&
3422 XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno)
3423 prevbno = NULLFSBLOCK;
3426 * No previous block or can't follow it, just default.
3429 prevbno = NULLFSBLOCK;
3431 * If there's a following (right) block, select a requested
3432 * start block based on it.
3434 if (!isnullstartblock(ap->got.br_startblock)) {
3436 * Calculate gap to start of next block.
3438 adjust = gotdiff = ap->got.br_startoff - ap->offset;
3440 * Figure the startblock based on the next block's
3441 * start and the gap size.
3443 gotbno = ap->got.br_startblock;
3446 * If the gap is large relative to the piece we're
3447 * allocating, or using it gives us an invalid block
3448 * number, then just use the start of the next block
3449 * offset by our length.
3451 if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
3452 ISVALID(gotbno - gotdiff, gotbno))
3454 else if (ISVALID(gotbno - ap->length, gotbno)) {
3455 gotbno -= ap->length;
3456 gotdiff += adjust - ap->length;
3460 * If the firstblock forbids it, can't use it,
3463 if (!rt && !nullfb &&
3464 XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno)
3465 gotbno = NULLFSBLOCK;
3468 * No next block, just default.
3471 gotbno = NULLFSBLOCK;
3473 * If both valid, pick the better one, else the only good
3474 * one, else ap->blkno is already set (to 0 or the inode block).
3476 if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK)
3477 ap->blkno = prevdiff <= gotdiff ? prevbno : gotbno;
3478 else if (prevbno != NULLFSBLOCK)
3479 ap->blkno = prevbno;
3480 else if (gotbno != NULLFSBLOCK)
3487 xfs_bmap_longest_free_extent(
3488 struct xfs_trans *tp,
3493 struct xfs_mount *mp = tp->t_mountp;
3494 struct xfs_perag *pag;
3495 xfs_extlen_t longest;
3498 pag = xfs_perag_get(mp, ag);
3499 if (!pag->pagf_init) {
3500 error = xfs_alloc_pagf_init(mp, tp, ag, XFS_ALLOC_FLAG_TRYLOCK);
3504 if (!pag->pagf_init) {
3510 longest = xfs_alloc_longest_free_extent(mp, pag);
3511 if (*blen < longest)
3520 xfs_bmap_select_minlen(
3521 struct xfs_bmalloca *ap,
3522 struct xfs_alloc_arg *args,
3526 if (notinit || *blen < ap->minlen) {
3528 * Since we did a BUF_TRYLOCK above, it is possible that
3529 * there is space for this request.
3531 args->minlen = ap->minlen;
3532 } else if (*blen < args->maxlen) {
3534 * If the best seen length is less than the request length,
3535 * use the best as the minimum.
3537 args->minlen = *blen;
3540 * Otherwise we've seen an extent as big as maxlen, use that
3543 args->minlen = args->maxlen;
3548 xfs_bmap_btalloc_nullfb(
3549 struct xfs_bmalloca *ap,
3550 struct xfs_alloc_arg *args,
3553 struct xfs_mount *mp = ap->ip->i_mount;
3554 xfs_agnumber_t ag, startag;
3558 args->type = XFS_ALLOCTYPE_START_BNO;
3559 args->total = ap->total;
3561 startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
3562 if (startag == NULLAGNUMBER)
3565 while (*blen < args->maxlen) {
3566 error = xfs_bmap_longest_free_extent(args->tp, ag, blen,
3571 if (++ag == mp->m_sb.sb_agcount)
3577 xfs_bmap_select_minlen(ap, args, blen, notinit);
3582 xfs_bmap_btalloc_filestreams(
3583 struct xfs_bmalloca *ap,
3584 struct xfs_alloc_arg *args,
3587 struct xfs_mount *mp = ap->ip->i_mount;
3592 args->type = XFS_ALLOCTYPE_NEAR_BNO;
3593 args->total = ap->total;
3595 ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
3596 if (ag == NULLAGNUMBER)
3599 error = xfs_bmap_longest_free_extent(args->tp, ag, blen, ¬init);
3603 if (*blen < args->maxlen) {
3604 error = xfs_filestream_new_ag(ap, &ag);
3608 error = xfs_bmap_longest_free_extent(args->tp, ag, blen,
3615 xfs_bmap_select_minlen(ap, args, blen, notinit);
3618 * Set the failure fallback case to look in the selected AG as stream
3621 ap->blkno = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0);
3627 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3629 xfs_mount_t *mp; /* mount point structure */
3630 xfs_alloctype_t atype = 0; /* type for allocation routines */
3631 xfs_extlen_t align; /* minimum allocation alignment */
3632 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
3634 xfs_alloc_arg_t args;
3636 xfs_extlen_t nextminlen = 0;
3637 int nullfb; /* true if ap->firstblock isn't set */
3645 mp = ap->ip->i_mount;
3647 /* stripe alignment for allocation is determined by mount parameters */
3649 if (mp->m_swidth && (mp->m_flags & XFS_MOUNT_SWALLOC))
3650 stripe_align = mp->m_swidth;
3651 else if (mp->m_dalign)
3652 stripe_align = mp->m_dalign;
3654 align = ap->userdata ? xfs_get_extsz_hint(ap->ip) : 0;
3655 if (unlikely(align)) {
3656 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
3657 align, 0, ap->eof, 0, ap->conv,
3658 &ap->offset, &ap->length);
3664 nullfb = *ap->firstblock == NULLFSBLOCK;
3665 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock);
3667 if (ap->userdata && xfs_inode_is_filestream(ap->ip)) {
3668 ag = xfs_filestream_lookup_ag(ap->ip);
3669 ag = (ag != NULLAGNUMBER) ? ag : 0;
3670 ap->blkno = XFS_AGB_TO_FSB(mp, ag, 0);
3672 ap->blkno = XFS_INO_TO_FSB(mp, ap->ip->i_ino);
3675 ap->blkno = *ap->firstblock;
3677 xfs_bmap_adjacent(ap);
3680 * If allowed, use ap->blkno; otherwise must use firstblock since
3681 * it's in the right allocation group.
3683 if (nullfb || XFS_FSB_TO_AGNO(mp, ap->blkno) == fb_agno)
3686 ap->blkno = *ap->firstblock;
3688 * Normal allocation, done through xfs_alloc_vextent.
3690 tryagain = isaligned = 0;
3691 memset(&args, 0, sizeof(args));
3694 args.fsbno = ap->blkno;
3696 /* Trim the allocation back to the maximum an AG can fit. */
3697 args.maxlen = MIN(ap->length, XFS_ALLOC_AG_MAX_USABLE(mp));
3698 args.firstblock = *ap->firstblock;
3702 * Search for an allocation group with a single extent large
3703 * enough for the request. If one isn't found, then adjust
3704 * the minimum allocation size to the largest space found.
3706 if (ap->userdata && xfs_inode_is_filestream(ap->ip))
3707 error = xfs_bmap_btalloc_filestreams(ap, &args, &blen);
3709 error = xfs_bmap_btalloc_nullfb(ap, &args, &blen);
3712 } else if (ap->flist->xbf_low) {
3713 if (xfs_inode_is_filestream(ap->ip))
3714 args.type = XFS_ALLOCTYPE_FIRST_AG;
3716 args.type = XFS_ALLOCTYPE_START_BNO;
3717 args.total = args.minlen = ap->minlen;
3719 args.type = XFS_ALLOCTYPE_NEAR_BNO;
3720 args.total = ap->total;
3721 args.minlen = ap->minlen;
3723 /* apply extent size hints if obtained earlier */
3724 if (unlikely(align)) {
3726 if ((args.mod = (xfs_extlen_t)do_mod(ap->offset, args.prod)))
3727 args.mod = (xfs_extlen_t)(args.prod - args.mod);
3728 } else if (mp->m_sb.sb_blocksize >= PAGE_CACHE_SIZE) {
3732 args.prod = PAGE_CACHE_SIZE >> mp->m_sb.sb_blocklog;
3733 if ((args.mod = (xfs_extlen_t)(do_mod(ap->offset, args.prod))))
3734 args.mod = (xfs_extlen_t)(args.prod - args.mod);
3737 * If we are not low on available data blocks, and the
3738 * underlying logical volume manager is a stripe, and
3739 * the file offset is zero then try to allocate data
3740 * blocks on stripe unit boundary.
3741 * NOTE: ap->aeof is only set if the allocation length
3742 * is >= the stripe unit and the allocation offset is
3743 * at the end of file.
3745 if (!ap->flist->xbf_low && ap->aeof) {
3747 args.alignment = stripe_align;
3751 * Adjust for alignment
3753 if (blen > args.alignment && blen <= args.maxlen)
3754 args.minlen = blen - args.alignment;
3755 args.minalignslop = 0;
3758 * First try an exact bno allocation.
3759 * If it fails then do a near or start bno
3760 * allocation with alignment turned on.
3764 args.type = XFS_ALLOCTYPE_THIS_BNO;
3767 * Compute the minlen+alignment for the
3768 * next case. Set slop so that the value
3769 * of minlen+alignment+slop doesn't go up
3770 * between the calls.
3772 if (blen > stripe_align && blen <= args.maxlen)
3773 nextminlen = blen - stripe_align;
3775 nextminlen = args.minlen;
3776 if (nextminlen + stripe_align > args.minlen + 1)
3778 nextminlen + stripe_align -
3781 args.minalignslop = 0;
3785 args.minalignslop = 0;
3787 args.minleft = ap->minleft;
3788 args.wasdel = ap->wasdel;
3790 args.userdata = ap->userdata;
3791 if ((error = xfs_alloc_vextent(&args)))
3793 if (tryagain && args.fsbno == NULLFSBLOCK) {
3795 * Exact allocation failed. Now try with alignment
3799 args.fsbno = ap->blkno;
3800 args.alignment = stripe_align;
3801 args.minlen = nextminlen;
3802 args.minalignslop = 0;
3804 if ((error = xfs_alloc_vextent(&args)))
3807 if (isaligned && args.fsbno == NULLFSBLOCK) {
3809 * allocation failed, so turn off alignment and
3813 args.fsbno = ap->blkno;
3815 if ((error = xfs_alloc_vextent(&args)))
3818 if (args.fsbno == NULLFSBLOCK && nullfb &&
3819 args.minlen > ap->minlen) {
3820 args.minlen = ap->minlen;
3821 args.type = XFS_ALLOCTYPE_START_BNO;
3822 args.fsbno = ap->blkno;
3823 if ((error = xfs_alloc_vextent(&args)))
3826 if (args.fsbno == NULLFSBLOCK && nullfb) {
3828 args.type = XFS_ALLOCTYPE_FIRST_AG;
3829 args.total = ap->minlen;
3831 if ((error = xfs_alloc_vextent(&args)))
3833 ap->flist->xbf_low = 1;
3835 if (args.fsbno != NULLFSBLOCK) {
3837 * check the allocation happened at the same or higher AG than
3838 * the first block that was allocated.
3840 ASSERT(*ap->firstblock == NULLFSBLOCK ||
3841 XFS_FSB_TO_AGNO(mp, *ap->firstblock) ==
3842 XFS_FSB_TO_AGNO(mp, args.fsbno) ||
3843 (ap->flist->xbf_low &&
3844 XFS_FSB_TO_AGNO(mp, *ap->firstblock) <
3845 XFS_FSB_TO_AGNO(mp, args.fsbno)));
3847 ap->blkno = args.fsbno;
3848 if (*ap->firstblock == NULLFSBLOCK)
3849 *ap->firstblock = args.fsbno;
3850 ASSERT(nullfb || fb_agno == args.agno ||
3851 (ap->flist->xbf_low && fb_agno < args.agno));
3852 ap->length = args.len;
3853 ap->ip->i_d.di_nblocks += args.len;
3854 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
3856 ap->ip->i_delayed_blks -= args.len;
3858 * Adjust the disk quota also. This was reserved
3861 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
3862 ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT :
3863 XFS_TRANS_DQ_BCOUNT,
3866 ap->blkno = NULLFSBLOCK;
3873 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
3874 * It figures out where to ask the underlying allocator to put the new extent.
3878 struct xfs_bmalloca *ap) /* bmap alloc argument struct */
3880 if (XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata)
3881 return xfs_bmap_rtalloc(ap);
3882 return xfs_bmap_btalloc(ap);
3886 * Trim the returned map to the required bounds
3890 struct xfs_bmbt_irec *mval,
3891 struct xfs_bmbt_irec *got,
3899 if ((flags & XFS_BMAPI_ENTIRE) ||
3900 got->br_startoff + got->br_blockcount <= obno) {
3902 if (isnullstartblock(got->br_startblock))
3903 mval->br_startblock = DELAYSTARTBLOCK;
3909 ASSERT((*bno >= obno) || (n == 0));
3911 mval->br_startoff = *bno;
3912 if (isnullstartblock(got->br_startblock))
3913 mval->br_startblock = DELAYSTARTBLOCK;
3915 mval->br_startblock = got->br_startblock +
3916 (*bno - got->br_startoff);
3918 * Return the minimum of what we got and what we asked for for
3919 * the length. We can use the len variable here because it is
3920 * modified below and we could have been there before coming
3921 * here if the first part of the allocation didn't overlap what
3924 mval->br_blockcount = XFS_FILBLKS_MIN(end - *bno,
3925 got->br_blockcount - (*bno - got->br_startoff));
3926 mval->br_state = got->br_state;
3927 ASSERT(mval->br_blockcount <= len);
3932 * Update and validate the extent map to return
3935 xfs_bmapi_update_map(
3936 struct xfs_bmbt_irec **map,
3944 xfs_bmbt_irec_t *mval = *map;
3946 ASSERT((flags & XFS_BMAPI_ENTIRE) ||
3947 ((mval->br_startoff + mval->br_blockcount) <= end));
3948 ASSERT((flags & XFS_BMAPI_ENTIRE) || (mval->br_blockcount <= *len) ||
3949 (mval->br_startoff < obno));
3951 *bno = mval->br_startoff + mval->br_blockcount;
3953 if (*n > 0 && mval->br_startoff == mval[-1].br_startoff) {
3954 /* update previous map with new information */
3955 ASSERT(mval->br_startblock == mval[-1].br_startblock);
3956 ASSERT(mval->br_blockcount > mval[-1].br_blockcount);
3957 ASSERT(mval->br_state == mval[-1].br_state);
3958 mval[-1].br_blockcount = mval->br_blockcount;
3959 mval[-1].br_state = mval->br_state;
3960 } else if (*n > 0 && mval->br_startblock != DELAYSTARTBLOCK &&
3961 mval[-1].br_startblock != DELAYSTARTBLOCK &&
3962 mval[-1].br_startblock != HOLESTARTBLOCK &&
3963 mval->br_startblock == mval[-1].br_startblock +
3964 mval[-1].br_blockcount &&
3965 ((flags & XFS_BMAPI_IGSTATE) ||
3966 mval[-1].br_state == mval->br_state)) {
3967 ASSERT(mval->br_startoff ==
3968 mval[-1].br_startoff + mval[-1].br_blockcount);
3969 mval[-1].br_blockcount += mval->br_blockcount;
3970 } else if (*n > 0 &&
3971 mval->br_startblock == DELAYSTARTBLOCK &&
3972 mval[-1].br_startblock == DELAYSTARTBLOCK &&
3973 mval->br_startoff ==
3974 mval[-1].br_startoff + mval[-1].br_blockcount) {
3975 mval[-1].br_blockcount += mval->br_blockcount;
3976 mval[-1].br_state = mval->br_state;
3977 } else if (!((*n == 0) &&
3978 ((mval->br_startoff + mval->br_blockcount) <=
3987 * Map file blocks to filesystem blocks without allocation.
3991 struct xfs_inode *ip,
3994 struct xfs_bmbt_irec *mval,
3998 struct xfs_mount *mp = ip->i_mount;
3999 struct xfs_ifork *ifp;
4000 struct xfs_bmbt_irec got;
4001 struct xfs_bmbt_irec prev;
4008 int whichfork = (flags & XFS_BMAPI_ATTRFORK) ?
4009 XFS_ATTR_FORK : XFS_DATA_FORK;
4012 ASSERT(!(flags & ~(XFS_BMAPI_ATTRFORK|XFS_BMAPI_ENTIRE|
4013 XFS_BMAPI_IGSTATE)));
4014 ASSERT(xfs_isilocked(ip, XFS_ILOCK_SHARED|XFS_ILOCK_EXCL));
4016 if (unlikely(XFS_TEST_ERROR(
4017 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4018 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
4019 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
4020 XFS_ERROR_REPORT("xfs_bmapi_read", XFS_ERRLEVEL_LOW, mp);
4021 return -EFSCORRUPTED;
4024 if (XFS_FORCED_SHUTDOWN(mp))
4027 XFS_STATS_INC(xs_blk_mapr);
4029 ifp = XFS_IFORK_PTR(ip, whichfork);
4031 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4032 error = xfs_iread_extents(NULL, ip, whichfork);
4037 xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, &prev);
4041 while (bno < end && n < *nmap) {
4042 /* Reading past eof, act as though there's a hole up to end. */
4044 got.br_startoff = end;
4045 if (got.br_startoff > bno) {
4046 /* Reading in a hole. */
4047 mval->br_startoff = bno;
4048 mval->br_startblock = HOLESTARTBLOCK;
4049 mval->br_blockcount =
4050 XFS_FILBLKS_MIN(len, got.br_startoff - bno);
4051 mval->br_state = XFS_EXT_NORM;
4052 bno += mval->br_blockcount;
4053 len -= mval->br_blockcount;
4059 /* set up the extent map to return. */
4060 xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags);
4061 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
4063 /* If we're done, stop now. */
4064 if (bno >= end || n >= *nmap)
4067 /* Else go on to the next record. */
4068 if (++lastx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t))
4069 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx), &got);
4078 xfs_bmapi_reserve_delalloc(
4079 struct xfs_inode *ip,
4082 struct xfs_bmbt_irec *got,
4083 struct xfs_bmbt_irec *prev,
4084 xfs_extnum_t *lastx,
4087 struct xfs_mount *mp = ip->i_mount;
4088 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
4090 xfs_extlen_t indlen;
4091 char rt = XFS_IS_REALTIME_INODE(ip);
4095 alen = XFS_FILBLKS_MIN(len, MAXEXTLEN);
4097 alen = XFS_FILBLKS_MIN(alen, got->br_startoff - aoff);
4099 /* Figure out the extent size, adjust alen */
4100 extsz = xfs_get_extsz_hint(ip);
4103 * Make sure we don't exceed a single extent length when we
4104 * align the extent by reducing length we are going to
4105 * allocate by the maximum amount extent size aligment may
4108 alen = XFS_FILBLKS_MIN(len, MAXEXTLEN - (2 * extsz - 1));
4109 error = xfs_bmap_extsize_align(mp, got, prev, extsz, rt, eof,
4110 1, 0, &aoff, &alen);
4115 extsz = alen / mp->m_sb.sb_rextsize;
4118 * Make a transaction-less quota reservation for delayed allocation
4119 * blocks. This number gets adjusted later. We return if we haven't
4120 * allocated blocks already inside this loop.
4122 error = xfs_trans_reserve_quota_nblks(NULL, ip, (long)alen, 0,
4123 rt ? XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS);
4128 * Split changing sb for alen and indlen since they could be coming
4129 * from different places.
4131 indlen = (xfs_extlen_t)xfs_bmap_worst_indlen(ip, alen);
4135 error = xfs_mod_frextents(mp, -((int64_t)extsz));
4137 error = xfs_mod_fdblocks(mp, -((int64_t)alen), false);
4141 goto out_unreserve_quota;
4143 error = xfs_mod_fdblocks(mp, -((int64_t)indlen), false);
4145 goto out_unreserve_blocks;
4148 ip->i_delayed_blks += alen;
4150 got->br_startoff = aoff;
4151 got->br_startblock = nullstartblock(indlen);
4152 got->br_blockcount = alen;
4153 got->br_state = XFS_EXT_NORM;
4154 xfs_bmap_add_extent_hole_delay(ip, lastx, got);
4157 * Update our extent pointer, given that xfs_bmap_add_extent_hole_delay
4158 * might have merged it into one of the neighbouring ones.
4160 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *lastx), got);
4162 ASSERT(got->br_startoff <= aoff);
4163 ASSERT(got->br_startoff + got->br_blockcount >= aoff + alen);
4164 ASSERT(isnullstartblock(got->br_startblock));
4165 ASSERT(got->br_state == XFS_EXT_NORM);
4168 out_unreserve_blocks:
4170 xfs_mod_frextents(mp, extsz);
4172 xfs_mod_fdblocks(mp, alen, false);
4173 out_unreserve_quota:
4174 if (XFS_IS_QUOTA_ON(mp))
4175 xfs_trans_unreserve_quota_nblks(NULL, ip, (long)alen, 0, rt ?
4176 XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS);
4181 * Map file blocks to filesystem blocks, adding delayed allocations as needed.
4185 struct xfs_inode *ip, /* incore inode */
4186 xfs_fileoff_t bno, /* starting file offs. mapped */
4187 xfs_filblks_t len, /* length to map in file */
4188 struct xfs_bmbt_irec *mval, /* output: map values */
4189 int *nmap, /* i/o: mval size/count */
4190 int flags) /* XFS_BMAPI_... */
4192 struct xfs_mount *mp = ip->i_mount;
4193 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
4194 struct xfs_bmbt_irec got; /* current file extent record */
4195 struct xfs_bmbt_irec prev; /* previous file extent record */
4196 xfs_fileoff_t obno; /* old block number (offset) */
4197 xfs_fileoff_t end; /* end of mapped file region */
4198 xfs_extnum_t lastx; /* last useful extent number */
4199 int eof; /* we've hit the end of extents */
4200 int n = 0; /* current extent index */
4204 ASSERT(*nmap <= XFS_BMAP_MAX_NMAP);
4205 ASSERT(!(flags & ~XFS_BMAPI_ENTIRE));
4206 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
4208 if (unlikely(XFS_TEST_ERROR(
4209 (XFS_IFORK_FORMAT(ip, XFS_DATA_FORK) != XFS_DINODE_FMT_EXTENTS &&
4210 XFS_IFORK_FORMAT(ip, XFS_DATA_FORK) != XFS_DINODE_FMT_BTREE),
4211 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
4212 XFS_ERROR_REPORT("xfs_bmapi_delay", XFS_ERRLEVEL_LOW, mp);
4213 return -EFSCORRUPTED;
4216 if (XFS_FORCED_SHUTDOWN(mp))
4219 XFS_STATS_INC(xs_blk_mapw);
4221 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4222 error = xfs_iread_extents(NULL, ip, XFS_DATA_FORK);
4227 xfs_bmap_search_extents(ip, bno, XFS_DATA_FORK, &eof, &lastx, &got, &prev);
4231 while (bno < end && n < *nmap) {
4232 if (eof || got.br_startoff > bno) {
4233 error = xfs_bmapi_reserve_delalloc(ip, bno, len, &got,
4234 &prev, &lastx, eof);
4244 /* set up the extent map to return. */
4245 xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags);
4246 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
4248 /* If we're done, stop now. */
4249 if (bno >= end || n >= *nmap)
4252 /* Else go on to the next record. */
4254 if (++lastx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t))
4255 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx), &got);
4267 struct xfs_bmalloca *bma)
4269 struct xfs_mount *mp = bma->ip->i_mount;
4270 int whichfork = (bma->flags & XFS_BMAPI_ATTRFORK) ?
4271 XFS_ATTR_FORK : XFS_DATA_FORK;
4272 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4273 int tmp_logflags = 0;
4276 ASSERT(bma->length > 0);
4279 * For the wasdelay case, we could also just allocate the stuff asked
4280 * for in this bmap call but that wouldn't be as good.
4283 bma->length = (xfs_extlen_t)bma->got.br_blockcount;
4284 bma->offset = bma->got.br_startoff;
4285 if (bma->idx != NULLEXTNUM && bma->idx) {
4286 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1),
4290 bma->length = XFS_FILBLKS_MIN(bma->length, MAXEXTLEN);
4292 bma->length = XFS_FILBLKS_MIN(bma->length,
4293 bma->got.br_startoff - bma->offset);
4297 * Indicate if this is the first user data in the file, or just any
4300 if (!(bma->flags & XFS_BMAPI_METADATA)) {
4301 bma->userdata = (bma->offset == 0) ?
4302 XFS_ALLOC_INITIAL_USER_DATA : XFS_ALLOC_USERDATA;
4305 bma->minlen = (bma->flags & XFS_BMAPI_CONTIG) ? bma->length : 1;
4308 * Only want to do the alignment at the eof if it is userdata and
4309 * allocation length is larger than a stripe unit.
4311 if (mp->m_dalign && bma->length >= mp->m_dalign &&
4312 !(bma->flags & XFS_BMAPI_METADATA) && whichfork == XFS_DATA_FORK) {
4313 error = xfs_bmap_isaeof(bma, whichfork);
4318 error = xfs_bmap_alloc(bma);
4322 if (bma->flist->xbf_low)
4325 bma->cur->bc_private.b.firstblock = *bma->firstblock;
4326 if (bma->blkno == NULLFSBLOCK)
4328 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) {
4329 bma->cur = xfs_bmbt_init_cursor(mp, bma->tp, bma->ip, whichfork);
4330 bma->cur->bc_private.b.firstblock = *bma->firstblock;
4331 bma->cur->bc_private.b.flist = bma->flist;
4334 * Bump the number of extents we've allocated
4340 bma->cur->bc_private.b.flags =
4341 bma->wasdel ? XFS_BTCUR_BPRV_WASDEL : 0;
4343 bma->got.br_startoff = bma->offset;
4344 bma->got.br_startblock = bma->blkno;
4345 bma->got.br_blockcount = bma->length;
4346 bma->got.br_state = XFS_EXT_NORM;
4349 * A wasdelay extent has been initialized, so shouldn't be flagged
4352 if (!bma->wasdel && (bma->flags & XFS_BMAPI_PREALLOC) &&
4353 xfs_sb_version_hasextflgbit(&mp->m_sb))
4354 bma->got.br_state = XFS_EXT_UNWRITTEN;
4357 error = xfs_bmap_add_extent_delay_real(bma);
4359 error = xfs_bmap_add_extent_hole_real(bma, whichfork);
4361 bma->logflags |= tmp_logflags;
4366 * Update our extent pointer, given that xfs_bmap_add_extent_delay_real
4367 * or xfs_bmap_add_extent_hole_real might have merged it into one of
4368 * the neighbouring ones.
4370 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got);
4372 ASSERT(bma->got.br_startoff <= bma->offset);
4373 ASSERT(bma->got.br_startoff + bma->got.br_blockcount >=
4374 bma->offset + bma->length);
4375 ASSERT(bma->got.br_state == XFS_EXT_NORM ||
4376 bma->got.br_state == XFS_EXT_UNWRITTEN);
4381 xfs_bmapi_convert_unwritten(
4382 struct xfs_bmalloca *bma,
4383 struct xfs_bmbt_irec *mval,
4387 int whichfork = (flags & XFS_BMAPI_ATTRFORK) ?
4388 XFS_ATTR_FORK : XFS_DATA_FORK;
4389 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork);
4390 int tmp_logflags = 0;
4393 /* check if we need to do unwritten->real conversion */
4394 if (mval->br_state == XFS_EXT_UNWRITTEN &&
4395 (flags & XFS_BMAPI_PREALLOC))
4398 /* check if we need to do real->unwritten conversion */
4399 if (mval->br_state == XFS_EXT_NORM &&
4400 (flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) !=
4401 (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT))
4405 * Modify (by adding) the state flag, if writing.
4407 ASSERT(mval->br_blockcount <= len);
4408 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) {
4409 bma->cur = xfs_bmbt_init_cursor(bma->ip->i_mount, bma->tp,
4410 bma->ip, whichfork);
4411 bma->cur->bc_private.b.firstblock = *bma->firstblock;
4412 bma->cur->bc_private.b.flist = bma->flist;
4414 mval->br_state = (mval->br_state == XFS_EXT_UNWRITTEN)
4415 ? XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
4417 error = xfs_bmap_add_extent_unwritten_real(bma->tp, bma->ip, &bma->idx,
4418 &bma->cur, mval, bma->firstblock, bma->flist,
4420 bma->logflags |= tmp_logflags;
4425 * Update our extent pointer, given that
4426 * xfs_bmap_add_extent_unwritten_real might have merged it into one
4427 * of the neighbouring ones.
4429 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got);
4432 * We may have combined previously unwritten space with written space,
4433 * so generate another request.
4435 if (mval->br_blockcount < len)
4441 * Map file blocks to filesystem blocks, and allocate blocks or convert the
4442 * extent state if necessary. Details behaviour is controlled by the flags
4443 * parameter. Only allocates blocks from a single allocation group, to avoid
4446 * The returned value in "firstblock" from the first call in a transaction
4447 * must be remembered and presented to subsequent calls in "firstblock".
4448 * An upper bound for the number of blocks to be allocated is supplied to
4449 * the first call in "total"; if no allocation group has that many free
4450 * blocks then the call will fail (return NULLFSBLOCK in "firstblock").
4454 struct xfs_trans *tp, /* transaction pointer */
4455 struct xfs_inode *ip, /* incore inode */
4456 xfs_fileoff_t bno, /* starting file offs. mapped */
4457 xfs_filblks_t len, /* length to map in file */
4458 int flags, /* XFS_BMAPI_... */
4459 xfs_fsblock_t *firstblock, /* first allocated block
4460 controls a.g. for allocs */
4461 xfs_extlen_t total, /* total blocks needed */
4462 struct xfs_bmbt_irec *mval, /* output: map values */
4463 int *nmap, /* i/o: mval size/count */
4464 struct xfs_bmap_free *flist) /* i/o: list extents to free */
4466 struct xfs_mount *mp = ip->i_mount;
4467 struct xfs_ifork *ifp;
4468 struct xfs_bmalloca bma = { NULL }; /* args for xfs_bmap_alloc */
4469 xfs_fileoff_t end; /* end of mapped file region */
4470 int eof; /* after the end of extents */
4471 int error; /* error return */
4472 int n; /* current extent index */
4473 xfs_fileoff_t obno; /* old block number (offset) */
4474 int whichfork; /* data or attr fork */
4475 char inhole; /* current location is hole in file */
4476 char wasdelay; /* old extent was delayed */
4479 xfs_fileoff_t orig_bno; /* original block number value */
4480 int orig_flags; /* original flags arg value */
4481 xfs_filblks_t orig_len; /* original value of len arg */
4482 struct xfs_bmbt_irec *orig_mval; /* original value of mval */
4483 int orig_nmap; /* original value of *nmap */
4491 whichfork = (flags & XFS_BMAPI_ATTRFORK) ?
4492 XFS_ATTR_FORK : XFS_DATA_FORK;
4495 ASSERT(*nmap <= XFS_BMAP_MAX_NMAP);
4496 ASSERT(!(flags & XFS_BMAPI_IGSTATE));
4499 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL);
4500 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
4502 if (unlikely(XFS_TEST_ERROR(
4503 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4504 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
4505 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
4506 XFS_ERROR_REPORT("xfs_bmapi_write", XFS_ERRLEVEL_LOW, mp);
4507 return -EFSCORRUPTED;
4510 if (XFS_FORCED_SHUTDOWN(mp))
4513 ifp = XFS_IFORK_PTR(ip, whichfork);
4515 XFS_STATS_INC(xs_blk_mapw);
4517 if (*firstblock == NULLFSBLOCK) {
4518 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE)
4519 bma.minleft = be16_to_cpu(ifp->if_broot->bb_level) + 1;
4526 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
4527 error = xfs_iread_extents(tp, ip, whichfork);
4532 xfs_bmap_search_extents(ip, bno, whichfork, &eof, &bma.idx, &bma.got,
4543 bma.firstblock = firstblock;
4545 while (bno < end && n < *nmap) {
4546 inhole = eof || bma.got.br_startoff > bno;
4547 wasdelay = !inhole && isnullstartblock(bma.got.br_startblock);
4550 * First, deal with the hole before the allocated space
4551 * that we found, if any.
4553 if (inhole || wasdelay) {
4555 bma.conv = !!(flags & XFS_BMAPI_CONVERT);
4556 bma.wasdel = wasdelay;
4561 * There's a 32/64 bit type mismatch between the
4562 * allocation length request (which can be 64 bits in
4563 * length) and the bma length request, which is
4564 * xfs_extlen_t and therefore 32 bits. Hence we have to
4565 * check for 32-bit overflows and handle them here.
4567 if (len > (xfs_filblks_t)MAXEXTLEN)
4568 bma.length = MAXEXTLEN;
4573 ASSERT(bma.length > 0);
4574 error = xfs_bmapi_allocate(&bma);
4577 if (bma.blkno == NULLFSBLOCK)
4581 /* Deal with the allocated space we found. */
4582 xfs_bmapi_trim_map(mval, &bma.got, &bno, len, obno,
4585 /* Execute unwritten extent conversion if necessary */
4586 error = xfs_bmapi_convert_unwritten(&bma, mval, len, flags);
4587 if (error == -EAGAIN)
4592 /* update the extent map to return */
4593 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags);
4596 * If we're done, stop now. Stop when we've allocated
4597 * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise
4598 * the transaction may get too big.
4600 if (bno >= end || n >= *nmap || bma.nallocs >= *nmap)
4603 /* Else go on to the next record. */
4605 if (++bma.idx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t)) {
4606 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma.idx),
4614 * Transform from btree to extents, give it cur.
4616 if (xfs_bmap_wants_extents(ip, whichfork)) {
4617 int tmp_logflags = 0;
4620 error = xfs_bmap_btree_to_extents(tp, ip, bma.cur,
4621 &tmp_logflags, whichfork);
4622 bma.logflags |= tmp_logflags;
4627 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE ||
4628 XFS_IFORK_NEXTENTS(ip, whichfork) >
4629 XFS_IFORK_MAXEXT(ip, whichfork));
4633 * Log everything. Do this after conversion, there's no point in
4634 * logging the extent records if we've converted to btree format.
4636 if ((bma.logflags & xfs_ilog_fext(whichfork)) &&
4637 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
4638 bma.logflags &= ~xfs_ilog_fext(whichfork);
4639 else if ((bma.logflags & xfs_ilog_fbroot(whichfork)) &&
4640 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)
4641 bma.logflags &= ~xfs_ilog_fbroot(whichfork);
4643 * Log whatever the flags say, even if error. Otherwise we might miss
4644 * detecting a case where the data is changed, there's an error,
4645 * and it's not logged so we don't shutdown when we should.
4648 xfs_trans_log_inode(tp, ip, bma.logflags);
4652 ASSERT(*firstblock == NULLFSBLOCK ||
4653 XFS_FSB_TO_AGNO(mp, *firstblock) ==
4655 bma.cur->bc_private.b.firstblock) ||
4657 XFS_FSB_TO_AGNO(mp, *firstblock) <
4659 bma.cur->bc_private.b.firstblock)));
4660 *firstblock = bma.cur->bc_private.b.firstblock;
4662 xfs_btree_del_cursor(bma.cur,
4663 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
4666 xfs_bmap_validate_ret(orig_bno, orig_len, orig_flags, orig_mval,
4672 * Called by xfs_bmapi to update file extent records and the btree
4673 * after removing space (or undoing a delayed allocation).
4675 STATIC int /* error */
4676 xfs_bmap_del_extent(
4677 xfs_inode_t *ip, /* incore inode pointer */
4678 xfs_trans_t *tp, /* current transaction pointer */
4679 xfs_extnum_t *idx, /* extent number to update/delete */
4680 xfs_bmap_free_t *flist, /* list of extents to be freed */
4681 xfs_btree_cur_t *cur, /* if null, not a btree */
4682 xfs_bmbt_irec_t *del, /* data to remove from extents */
4683 int *logflagsp, /* inode logging flags */
4684 int whichfork) /* data or attr fork */
4686 xfs_filblks_t da_new; /* new delay-alloc indirect blocks */
4687 xfs_filblks_t da_old; /* old delay-alloc indirect blocks */
4688 xfs_fsblock_t del_endblock=0; /* first block past del */
4689 xfs_fileoff_t del_endoff; /* first offset past del */
4690 int delay; /* current block is delayed allocated */
4691 int do_fx; /* free extent at end of routine */
4692 xfs_bmbt_rec_host_t *ep; /* current extent entry pointer */
4693 int error; /* error return value */
4694 int flags; /* inode logging flags */
4695 xfs_bmbt_irec_t got; /* current extent entry */
4696 xfs_fileoff_t got_endoff; /* first offset past got */
4697 int i; /* temp state */
4698 xfs_ifork_t *ifp; /* inode fork pointer */
4699 xfs_mount_t *mp; /* mount structure */
4700 xfs_filblks_t nblks; /* quota/sb block count */
4701 xfs_bmbt_irec_t new; /* new record to be inserted */
4703 uint qfield; /* quota field to update */
4704 xfs_filblks_t temp; /* for indirect length calculations */
4705 xfs_filblks_t temp2; /* for indirect length calculations */
4708 XFS_STATS_INC(xs_del_exlist);
4710 if (whichfork == XFS_ATTR_FORK)
4711 state |= BMAP_ATTRFORK;
4714 ifp = XFS_IFORK_PTR(ip, whichfork);
4715 ASSERT((*idx >= 0) && (*idx < ifp->if_bytes /
4716 (uint)sizeof(xfs_bmbt_rec_t)));
4717 ASSERT(del->br_blockcount > 0);
4718 ep = xfs_iext_get_ext(ifp, *idx);
4719 xfs_bmbt_get_all(ep, &got);
4720 ASSERT(got.br_startoff <= del->br_startoff);
4721 del_endoff = del->br_startoff + del->br_blockcount;
4722 got_endoff = got.br_startoff + got.br_blockcount;
4723 ASSERT(got_endoff >= del_endoff);
4724 delay = isnullstartblock(got.br_startblock);
4725 ASSERT(isnullstartblock(del->br_startblock) == delay);
4730 * If deleting a real allocation, must free up the disk space.
4733 flags = XFS_ILOG_CORE;
4735 * Realtime allocation. Free it and record di_nblocks update.
4737 if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) {
4741 ASSERT(do_mod(del->br_blockcount,
4742 mp->m_sb.sb_rextsize) == 0);
4743 ASSERT(do_mod(del->br_startblock,
4744 mp->m_sb.sb_rextsize) == 0);
4745 bno = del->br_startblock;
4746 len = del->br_blockcount;
4747 do_div(bno, mp->m_sb.sb_rextsize);
4748 do_div(len, mp->m_sb.sb_rextsize);
4749 error = xfs_rtfree_extent(tp, bno, (xfs_extlen_t)len);
4753 nblks = len * mp->m_sb.sb_rextsize;
4754 qfield = XFS_TRANS_DQ_RTBCOUNT;
4757 * Ordinary allocation.
4761 nblks = del->br_blockcount;
4762 qfield = XFS_TRANS_DQ_BCOUNT;
4765 * Set up del_endblock and cur for later.
4767 del_endblock = del->br_startblock + del->br_blockcount;
4769 if ((error = xfs_bmbt_lookup_eq(cur, got.br_startoff,
4770 got.br_startblock, got.br_blockcount,
4773 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
4775 da_old = da_new = 0;
4777 da_old = startblockval(got.br_startblock);
4783 * Set flag value to use in switch statement.
4784 * Left-contig is 2, right-contig is 1.
4786 switch (((got.br_startoff == del->br_startoff) << 1) |
4787 (got_endoff == del_endoff)) {
4790 * Matches the whole extent. Delete the entry.
4792 xfs_iext_remove(ip, *idx, 1,
4793 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0);
4798 XFS_IFORK_NEXT_SET(ip, whichfork,
4799 XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
4800 flags |= XFS_ILOG_CORE;
4802 flags |= xfs_ilog_fext(whichfork);
4805 if ((error = xfs_btree_delete(cur, &i)))
4807 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
4812 * Deleting the first part of the extent.
4814 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4815 xfs_bmbt_set_startoff(ep, del_endoff);
4816 temp = got.br_blockcount - del->br_blockcount;
4817 xfs_bmbt_set_blockcount(ep, temp);
4819 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
4821 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
4822 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4826 xfs_bmbt_set_startblock(ep, del_endblock);
4827 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4829 flags |= xfs_ilog_fext(whichfork);
4832 if ((error = xfs_bmbt_update(cur, del_endoff, del_endblock,
4833 got.br_blockcount - del->br_blockcount,
4840 * Deleting the last part of the extent.
4842 temp = got.br_blockcount - del->br_blockcount;
4843 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4844 xfs_bmbt_set_blockcount(ep, temp);
4846 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
4848 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
4849 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4853 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4855 flags |= xfs_ilog_fext(whichfork);
4858 if ((error = xfs_bmbt_update(cur, got.br_startoff,
4860 got.br_blockcount - del->br_blockcount,
4867 * Deleting the middle of the extent.
4869 temp = del->br_startoff - got.br_startoff;
4870 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
4871 xfs_bmbt_set_blockcount(ep, temp);
4872 new.br_startoff = del_endoff;
4873 temp2 = got_endoff - del_endoff;
4874 new.br_blockcount = temp2;
4875 new.br_state = got.br_state;
4877 new.br_startblock = del_endblock;
4878 flags |= XFS_ILOG_CORE;
4880 if ((error = xfs_bmbt_update(cur,
4882 got.br_startblock, temp,
4885 if ((error = xfs_btree_increment(cur, 0, &i)))
4887 cur->bc_rec.b = new;
4888 error = xfs_btree_insert(cur, &i);
4889 if (error && error != -ENOSPC)
4892 * If get no-space back from btree insert,
4893 * it tried a split, and we have a zero
4894 * block reservation.
4895 * Fix up our state and return the error.
4897 if (error == -ENOSPC) {
4899 * Reset the cursor, don't trust
4900 * it after any insert operation.
4902 if ((error = xfs_bmbt_lookup_eq(cur,
4907 XFS_WANT_CORRUPTED_GOTO(mp,
4910 * Update the btree record back
4911 * to the original value.
4913 if ((error = xfs_bmbt_update(cur,
4920 * Reset the extent record back
4921 * to the original value.
4923 xfs_bmbt_set_blockcount(ep,
4929 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done);
4931 flags |= xfs_ilog_fext(whichfork);
4932 XFS_IFORK_NEXT_SET(ip, whichfork,
4933 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
4935 ASSERT(whichfork == XFS_DATA_FORK);
4936 temp = xfs_bmap_worst_indlen(ip, temp);
4937 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
4938 temp2 = xfs_bmap_worst_indlen(ip, temp2);
4939 new.br_startblock = nullstartblock((int)temp2);
4940 da_new = temp + temp2;
4941 while (da_new > da_old) {
4945 xfs_bmbt_set_startblock(ep,
4946 nullstartblock((int)temp));
4948 if (da_new == da_old)
4954 nullstartblock((int)temp2);
4958 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
4959 xfs_iext_insert(ip, *idx + 1, 1, &new, state);
4964 * If we need to, add to list of extents to delete.
4967 xfs_bmap_add_free(del->br_startblock, del->br_blockcount, flist,
4970 * Adjust inode # blocks in the file.
4973 ip->i_d.di_nblocks -= nblks;
4975 * Adjust quota data.
4978 xfs_trans_mod_dquot_byino(tp, ip, qfield, (long)-nblks);
4981 * Account for change in delayed indirect blocks.
4982 * Nothing to do for disk quota accounting here.
4984 ASSERT(da_old >= da_new);
4985 if (da_old > da_new)
4986 xfs_mod_fdblocks(mp, (int64_t)(da_old - da_new), false);
4993 * Unmap (remove) blocks from a file.
4994 * If nexts is nonzero then the number of extents to remove is limited to
4995 * that value. If not all extents in the block range can be removed then
5000 xfs_trans_t *tp, /* transaction pointer */
5001 struct xfs_inode *ip, /* incore inode */
5002 xfs_fileoff_t bno, /* starting offset to unmap */
5003 xfs_filblks_t len, /* length to unmap in file */
5004 int flags, /* misc flags */
5005 xfs_extnum_t nexts, /* number of extents max */
5006 xfs_fsblock_t *firstblock, /* first allocated block
5007 controls a.g. for allocs */
5008 xfs_bmap_free_t *flist, /* i/o: list extents to free */
5009 int *done) /* set if not done yet */
5011 xfs_btree_cur_t *cur; /* bmap btree cursor */
5012 xfs_bmbt_irec_t del; /* extent being deleted */
5013 int eof; /* is deleting at eof */
5014 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
5015 int error; /* error return value */
5016 xfs_extnum_t extno; /* extent number in list */
5017 xfs_bmbt_irec_t got; /* current extent record */
5018 xfs_ifork_t *ifp; /* inode fork pointer */
5019 int isrt; /* freeing in rt area */
5020 xfs_extnum_t lastx; /* last extent index used */
5021 int logflags; /* transaction logging flags */
5022 xfs_extlen_t mod; /* rt extent offset */
5023 xfs_mount_t *mp; /* mount structure */
5024 xfs_extnum_t nextents; /* number of file extents */
5025 xfs_bmbt_irec_t prev; /* previous extent record */
5026 xfs_fileoff_t start; /* first file offset deleted */
5027 int tmp_logflags; /* partial logging flags */
5028 int wasdel; /* was a delayed alloc extent */
5029 int whichfork; /* data or attribute fork */
5032 trace_xfs_bunmap(ip, bno, len, flags, _RET_IP_);
5034 whichfork = (flags & XFS_BMAPI_ATTRFORK) ?
5035 XFS_ATTR_FORK : XFS_DATA_FORK;
5036 ifp = XFS_IFORK_PTR(ip, whichfork);
5038 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
5039 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)) {
5040 XFS_ERROR_REPORT("xfs_bunmapi", XFS_ERRLEVEL_LOW,
5042 return -EFSCORRUPTED;
5045 if (XFS_FORCED_SHUTDOWN(mp))
5048 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5052 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
5053 (error = xfs_iread_extents(tp, ip, whichfork)))
5055 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
5056 if (nextents == 0) {
5060 XFS_STATS_INC(xs_blk_unmap);
5061 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
5063 bno = start + len - 1;
5064 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got,
5068 * Check to see if the given block number is past the end of the
5069 * file, back up to the last block if so...
5072 ep = xfs_iext_get_ext(ifp, --lastx);
5073 xfs_bmbt_get_all(ep, &got);
5074 bno = got.br_startoff + got.br_blockcount - 1;
5077 if (ifp->if_flags & XFS_IFBROOT) {
5078 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
5079 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5080 cur->bc_private.b.firstblock = *firstblock;
5081 cur->bc_private.b.flist = flist;
5082 cur->bc_private.b.flags = 0;
5088 * Synchronize by locking the bitmap inode.
5090 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
5091 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
5095 while (bno != (xfs_fileoff_t)-1 && bno >= start && lastx >= 0 &&
5096 (nexts == 0 || extno < nexts)) {
5098 * Is the found extent after a hole in which bno lives?
5099 * Just back up to the previous extent, if so.
5101 if (got.br_startoff > bno) {
5104 ep = xfs_iext_get_ext(ifp, lastx);
5105 xfs_bmbt_get_all(ep, &got);
5108 * Is the last block of this extent before the range
5109 * we're supposed to delete? If so, we're done.
5111 bno = XFS_FILEOFF_MIN(bno,
5112 got.br_startoff + got.br_blockcount - 1);
5116 * Then deal with the (possibly delayed) allocated space
5121 wasdel = isnullstartblock(del.br_startblock);
5122 if (got.br_startoff < start) {
5123 del.br_startoff = start;
5124 del.br_blockcount -= start - got.br_startoff;
5126 del.br_startblock += start - got.br_startoff;
5128 if (del.br_startoff + del.br_blockcount > bno + 1)
5129 del.br_blockcount = bno + 1 - del.br_startoff;
5130 sum = del.br_startblock + del.br_blockcount;
5132 (mod = do_mod(sum, mp->m_sb.sb_rextsize))) {
5134 * Realtime extent not lined up at the end.
5135 * The extent could have been split into written
5136 * and unwritten pieces, or we could just be
5137 * unmapping part of it. But we can't really
5138 * get rid of part of a realtime extent.
5140 if (del.br_state == XFS_EXT_UNWRITTEN ||
5141 !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
5143 * This piece is unwritten, or we're not
5144 * using unwritten extents. Skip over it.
5147 bno -= mod > del.br_blockcount ?
5148 del.br_blockcount : mod;
5149 if (bno < got.br_startoff) {
5151 xfs_bmbt_get_all(xfs_iext_get_ext(
5157 * It's written, turn it unwritten.
5158 * This is better than zeroing it.
5160 ASSERT(del.br_state == XFS_EXT_NORM);
5161 ASSERT(xfs_trans_get_block_res(tp) > 0);
5163 * If this spans a realtime extent boundary,
5164 * chop it back to the start of the one we end at.
5166 if (del.br_blockcount > mod) {
5167 del.br_startoff += del.br_blockcount - mod;
5168 del.br_startblock += del.br_blockcount - mod;
5169 del.br_blockcount = mod;
5171 del.br_state = XFS_EXT_UNWRITTEN;
5172 error = xfs_bmap_add_extent_unwritten_real(tp, ip,
5173 &lastx, &cur, &del, firstblock, flist,
5179 if (isrt && (mod = do_mod(del.br_startblock, mp->m_sb.sb_rextsize))) {
5181 * Realtime extent is lined up at the end but not
5182 * at the front. We'll get rid of full extents if
5185 mod = mp->m_sb.sb_rextsize - mod;
5186 if (del.br_blockcount > mod) {
5187 del.br_blockcount -= mod;
5188 del.br_startoff += mod;
5189 del.br_startblock += mod;
5190 } else if ((del.br_startoff == start &&
5191 (del.br_state == XFS_EXT_UNWRITTEN ||
5192 xfs_trans_get_block_res(tp) == 0)) ||
5193 !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
5195 * Can't make it unwritten. There isn't
5196 * a full extent here so just skip it.
5198 ASSERT(bno >= del.br_blockcount);
5199 bno -= del.br_blockcount;
5200 if (got.br_startoff > bno) {
5202 ep = xfs_iext_get_ext(ifp,
5204 xfs_bmbt_get_all(ep, &got);
5208 } else if (del.br_state == XFS_EXT_UNWRITTEN) {
5210 * This one is already unwritten.
5211 * It must have a written left neighbor.
5212 * Unwrite the killed part of that one and
5216 xfs_bmbt_get_all(xfs_iext_get_ext(ifp,
5218 ASSERT(prev.br_state == XFS_EXT_NORM);
5219 ASSERT(!isnullstartblock(prev.br_startblock));
5220 ASSERT(del.br_startblock ==
5221 prev.br_startblock + prev.br_blockcount);
5222 if (prev.br_startoff < start) {
5223 mod = start - prev.br_startoff;
5224 prev.br_blockcount -= mod;
5225 prev.br_startblock += mod;
5226 prev.br_startoff = start;
5228 prev.br_state = XFS_EXT_UNWRITTEN;
5230 error = xfs_bmap_add_extent_unwritten_real(tp,
5231 ip, &lastx, &cur, &prev,
5232 firstblock, flist, &logflags);
5237 ASSERT(del.br_state == XFS_EXT_NORM);
5238 del.br_state = XFS_EXT_UNWRITTEN;
5239 error = xfs_bmap_add_extent_unwritten_real(tp,
5240 ip, &lastx, &cur, &del,
5241 firstblock, flist, &logflags);
5248 ASSERT(startblockval(del.br_startblock) > 0);
5249 /* Update realtime/data freespace, unreserve quota */
5251 xfs_filblks_t rtexts;
5253 rtexts = XFS_FSB_TO_B(mp, del.br_blockcount);
5254 do_div(rtexts, mp->m_sb.sb_rextsize);
5255 xfs_mod_frextents(mp, (int64_t)rtexts);
5256 (void)xfs_trans_reserve_quota_nblks(NULL,
5257 ip, -((long)del.br_blockcount), 0,
5258 XFS_QMOPT_RES_RTBLKS);
5260 xfs_mod_fdblocks(mp, (int64_t)del.br_blockcount,
5262 (void)xfs_trans_reserve_quota_nblks(NULL,
5263 ip, -((long)del.br_blockcount), 0,
5264 XFS_QMOPT_RES_REGBLKS);
5266 ip->i_delayed_blks -= del.br_blockcount;
5268 cur->bc_private.b.flags |=
5269 XFS_BTCUR_BPRV_WASDEL;
5271 cur->bc_private.b.flags &= ~XFS_BTCUR_BPRV_WASDEL;
5273 * If it's the case where the directory code is running
5274 * with no block reservation, and the deleted block is in
5275 * the middle of its extent, and the resulting insert
5276 * of an extent would cause transformation to btree format,
5277 * then reject it. The calling code will then swap
5278 * blocks around instead.
5279 * We have to do this now, rather than waiting for the
5280 * conversion to btree format, since the transaction
5283 if (!wasdel && xfs_trans_get_block_res(tp) == 0 &&
5284 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
5285 XFS_IFORK_NEXTENTS(ip, whichfork) >= /* Note the >= */
5286 XFS_IFORK_MAXEXT(ip, whichfork) &&
5287 del.br_startoff > got.br_startoff &&
5288 del.br_startoff + del.br_blockcount <
5289 got.br_startoff + got.br_blockcount) {
5293 error = xfs_bmap_del_extent(ip, tp, &lastx, flist, cur, &del,
5294 &tmp_logflags, whichfork);
5295 logflags |= tmp_logflags;
5298 bno = del.br_startoff - 1;
5301 * If not done go on to the next (previous) record.
5303 if (bno != (xfs_fileoff_t)-1 && bno >= start) {
5305 ep = xfs_iext_get_ext(ifp, lastx);
5306 if (xfs_bmbt_get_startoff(ep) > bno) {
5308 ep = xfs_iext_get_ext(ifp,
5311 xfs_bmbt_get_all(ep, &got);
5316 *done = bno == (xfs_fileoff_t)-1 || bno < start || lastx < 0;
5319 * Convert to a btree if necessary.
5321 if (xfs_bmap_needs_btree(ip, whichfork)) {
5322 ASSERT(cur == NULL);
5323 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist,
5324 &cur, 0, &tmp_logflags, whichfork);
5325 logflags |= tmp_logflags;
5330 * transform from btree to extents, give it cur
5332 else if (xfs_bmap_wants_extents(ip, whichfork)) {
5333 ASSERT(cur != NULL);
5334 error = xfs_bmap_btree_to_extents(tp, ip, cur, &tmp_logflags,
5336 logflags |= tmp_logflags;
5341 * transform from extents to local?
5346 * Log everything. Do this after conversion, there's no point in
5347 * logging the extent records if we've converted to btree format.
5349 if ((logflags & xfs_ilog_fext(whichfork)) &&
5350 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
5351 logflags &= ~xfs_ilog_fext(whichfork);
5352 else if ((logflags & xfs_ilog_fbroot(whichfork)) &&
5353 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)
5354 logflags &= ~xfs_ilog_fbroot(whichfork);
5356 * Log inode even in the error case, if the transaction
5357 * is dirty we'll need to shut down the filesystem.
5360 xfs_trans_log_inode(tp, ip, logflags);
5363 *firstblock = cur->bc_private.b.firstblock;
5364 cur->bc_private.b.allocated = 0;
5366 xfs_btree_del_cursor(cur,
5367 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
5373 * Determine whether an extent shift can be accomplished by a merge with the
5374 * extent that precedes the target hole of the shift.
5378 struct xfs_bmbt_irec *left, /* preceding extent */
5379 struct xfs_bmbt_irec *got, /* current extent to shift */
5380 xfs_fileoff_t shift) /* shift fsb */
5382 xfs_fileoff_t startoff;
5384 startoff = got->br_startoff - shift;
5387 * The extent, once shifted, must be adjacent in-file and on-disk with
5388 * the preceding extent.
5390 if ((left->br_startoff + left->br_blockcount != startoff) ||
5391 (left->br_startblock + left->br_blockcount != got->br_startblock) ||
5392 (left->br_state != got->br_state) ||
5393 (left->br_blockcount + got->br_blockcount > MAXEXTLEN))
5400 * A bmap extent shift adjusts the file offset of an extent to fill a preceding
5401 * hole in the file. If an extent shift would result in the extent being fully
5402 * adjacent to the extent that currently precedes the hole, we can merge with
5403 * the preceding extent rather than do the shift.
5405 * This function assumes the caller has verified a shift-by-merge is possible
5406 * with the provided extents via xfs_bmse_can_merge().
5410 struct xfs_inode *ip,
5412 xfs_fileoff_t shift, /* shift fsb */
5413 int current_ext, /* idx of gotp */
5414 struct xfs_bmbt_rec_host *gotp, /* extent to shift */
5415 struct xfs_bmbt_rec_host *leftp, /* preceding extent */
5416 struct xfs_btree_cur *cur,
5417 int *logflags) /* output */
5419 struct xfs_bmbt_irec got;
5420 struct xfs_bmbt_irec left;
5421 xfs_filblks_t blockcount;
5423 struct xfs_mount *mp = ip->i_mount;
5425 xfs_bmbt_get_all(gotp, &got);
5426 xfs_bmbt_get_all(leftp, &left);
5427 blockcount = left.br_blockcount + got.br_blockcount;
5429 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
5430 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5431 ASSERT(xfs_bmse_can_merge(&left, &got, shift));
5434 * Merge the in-core extents. Note that the host record pointers and
5435 * current_ext index are invalid once the extent has been removed via
5436 * xfs_iext_remove().
5438 xfs_bmbt_set_blockcount(leftp, blockcount);
5439 xfs_iext_remove(ip, current_ext, 1, 0);
5442 * Update the on-disk extent count, the btree if necessary and log the
5445 XFS_IFORK_NEXT_SET(ip, whichfork,
5446 XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
5447 *logflags |= XFS_ILOG_CORE;
5449 *logflags |= XFS_ILOG_DEXT;
5453 /* lookup and remove the extent to merge */
5454 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, got.br_startblock,
5455 got.br_blockcount, &i);
5458 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5460 error = xfs_btree_delete(cur, &i);
5463 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5465 /* lookup and update size of the previous extent */
5466 error = xfs_bmbt_lookup_eq(cur, left.br_startoff, left.br_startblock,
5467 left.br_blockcount, &i);
5470 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5472 left.br_blockcount = blockcount;
5474 return xfs_bmbt_update(cur, left.br_startoff, left.br_startblock,
5475 left.br_blockcount, left.br_state);
5479 * Shift a single extent.
5483 struct xfs_inode *ip,
5485 xfs_fileoff_t offset_shift_fsb,
5487 struct xfs_bmbt_rec_host *gotp,
5488 struct xfs_btree_cur *cur,
5490 enum shift_direction direction)
5492 struct xfs_ifork *ifp;
5493 struct xfs_mount *mp;
5494 xfs_fileoff_t startoff;
5495 struct xfs_bmbt_rec_host *adj_irecp;
5496 struct xfs_bmbt_irec got;
5497 struct xfs_bmbt_irec adj_irec;
5503 ifp = XFS_IFORK_PTR(ip, whichfork);
5504 total_extents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t);
5506 xfs_bmbt_get_all(gotp, &got);
5508 /* delalloc extents should be prevented by caller */
5509 XFS_WANT_CORRUPTED_RETURN(mp, !isnullstartblock(got.br_startblock));
5511 if (direction == SHIFT_LEFT) {
5512 startoff = got.br_startoff - offset_shift_fsb;
5515 * Check for merge if we've got an extent to the left,
5516 * otherwise make sure there's enough room at the start
5517 * of the file for the shift.
5519 if (!*current_ext) {
5520 if (got.br_startoff < offset_shift_fsb)
5522 goto update_current_ext;
5525 * grab the left extent and check for a large
5528 adj_irecp = xfs_iext_get_ext(ifp, *current_ext - 1);
5529 xfs_bmbt_get_all(adj_irecp, &adj_irec);
5532 adj_irec.br_startoff + adj_irec.br_blockcount)
5535 /* check whether to merge the extent or shift it down */
5536 if (xfs_bmse_can_merge(&adj_irec, &got,
5537 offset_shift_fsb)) {
5538 return xfs_bmse_merge(ip, whichfork, offset_shift_fsb,
5539 *current_ext, gotp, adj_irecp,
5543 startoff = got.br_startoff + offset_shift_fsb;
5544 /* nothing to move if this is the last extent */
5545 if (*current_ext >= (total_extents - 1))
5546 goto update_current_ext;
5548 * If this is not the last extent in the file, make sure there
5549 * is enough room between current extent and next extent for
5550 * accommodating the shift.
5552 adj_irecp = xfs_iext_get_ext(ifp, *current_ext + 1);
5553 xfs_bmbt_get_all(adj_irecp, &adj_irec);
5554 if (startoff + got.br_blockcount > adj_irec.br_startoff)
5557 * Unlike a left shift (which involves a hole punch),
5558 * a right shift does not modify extent neighbors
5559 * in any way. We should never find mergeable extents
5560 * in this scenario. Check anyways and warn if we
5561 * encounter two extents that could be one.
5563 if (xfs_bmse_can_merge(&got, &adj_irec, offset_shift_fsb))
5567 * Increment the extent index for the next iteration, update the start
5568 * offset of the in-core extent and update the btree if applicable.
5571 if (direction == SHIFT_LEFT)
5575 xfs_bmbt_set_startoff(gotp, startoff);
5576 *logflags |= XFS_ILOG_CORE;
5578 *logflags |= XFS_ILOG_DEXT;
5582 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, got.br_startblock,
5583 got.br_blockcount, &i);
5586 XFS_WANT_CORRUPTED_RETURN(mp, i == 1);
5588 got.br_startoff = startoff;
5589 return xfs_bmbt_update(cur, got.br_startoff, got.br_startblock,
5590 got.br_blockcount, got.br_state);
5594 * Shift extent records to the left/right to cover/create a hole.
5596 * The maximum number of extents to be shifted in a single operation is
5597 * @num_exts. @stop_fsb specifies the file offset at which to stop shift and the
5598 * file offset where we've left off is returned in @next_fsb. @offset_shift_fsb
5599 * is the length by which each extent is shifted. If there is no hole to shift
5600 * the extents into, this will be considered invalid operation and we abort
5604 xfs_bmap_shift_extents(
5605 struct xfs_trans *tp,
5606 struct xfs_inode *ip,
5607 xfs_fileoff_t *next_fsb,
5608 xfs_fileoff_t offset_shift_fsb,
5610 xfs_fileoff_t stop_fsb,
5611 xfs_fsblock_t *firstblock,
5612 struct xfs_bmap_free *flist,
5613 enum shift_direction direction,
5616 struct xfs_btree_cur *cur = NULL;
5617 struct xfs_bmbt_rec_host *gotp;
5618 struct xfs_bmbt_irec got;
5619 struct xfs_mount *mp = ip->i_mount;
5620 struct xfs_ifork *ifp;
5621 xfs_extnum_t nexts = 0;
5622 xfs_extnum_t current_ext;
5623 xfs_extnum_t total_extents;
5624 xfs_extnum_t stop_extent;
5626 int whichfork = XFS_DATA_FORK;
5629 if (unlikely(XFS_TEST_ERROR(
5630 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
5631 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
5632 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
5633 XFS_ERROR_REPORT("xfs_bmap_shift_extents",
5634 XFS_ERRLEVEL_LOW, mp);
5635 return -EFSCORRUPTED;
5638 if (XFS_FORCED_SHUTDOWN(mp))
5641 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL));
5642 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
5643 ASSERT(direction == SHIFT_LEFT || direction == SHIFT_RIGHT);
5644 ASSERT(*next_fsb != NULLFSBLOCK || direction == SHIFT_RIGHT);
5646 ifp = XFS_IFORK_PTR(ip, whichfork);
5647 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
5648 /* Read in all the extents */
5649 error = xfs_iread_extents(tp, ip, whichfork);
5654 if (ifp->if_flags & XFS_IFBROOT) {
5655 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5656 cur->bc_private.b.firstblock = *firstblock;
5657 cur->bc_private.b.flist = flist;
5658 cur->bc_private.b.flags = 0;
5662 * There may be delalloc extents in the data fork before the range we
5663 * are collapsing out, so we cannot use the count of real extents here.
5664 * Instead we have to calculate it from the incore fork.
5666 total_extents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t);
5667 if (total_extents == 0) {
5673 * In case of first right shift, we need to initialize next_fsb
5675 if (*next_fsb == NULLFSBLOCK) {
5676 gotp = xfs_iext_get_ext(ifp, total_extents - 1);
5677 xfs_bmbt_get_all(gotp, &got);
5678 *next_fsb = got.br_startoff;
5679 if (stop_fsb > *next_fsb) {
5685 /* Lookup the extent index at which we have to stop */
5686 if (direction == SHIFT_RIGHT) {
5687 gotp = xfs_iext_bno_to_ext(ifp, stop_fsb, &stop_extent);
5688 /* Make stop_extent exclusive of shift range */
5691 stop_extent = total_extents;
5694 * Look up the extent index for the fsb where we start shifting. We can
5695 * henceforth iterate with current_ext as extent list changes are locked
5698 * gotp can be null in 2 cases: 1) if there are no extents or 2)
5699 * *next_fsb lies in a hole beyond which there are no extents. Either
5702 gotp = xfs_iext_bno_to_ext(ifp, *next_fsb, ¤t_ext);
5708 /* some sanity checking before we finally start shifting extents */
5709 if ((direction == SHIFT_LEFT && current_ext >= stop_extent) ||
5710 (direction == SHIFT_RIGHT && current_ext <= stop_extent)) {
5715 while (nexts++ < num_exts) {
5716 error = xfs_bmse_shift_one(ip, whichfork, offset_shift_fsb,
5717 ¤t_ext, gotp, cur, &logflags,
5722 * If there was an extent merge during the shift, the extent
5723 * count can change. Update the total and grade the next record.
5725 if (direction == SHIFT_LEFT) {
5726 total_extents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t);
5727 stop_extent = total_extents;
5730 if (current_ext == stop_extent) {
5732 *next_fsb = NULLFSBLOCK;
5735 gotp = xfs_iext_get_ext(ifp, current_ext);
5739 xfs_bmbt_get_all(gotp, &got);
5740 *next_fsb = got.br_startoff;
5745 xfs_btree_del_cursor(cur,
5746 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
5749 xfs_trans_log_inode(tp, ip, logflags);
5755 * Splits an extent into two extents at split_fsb block such that it is
5756 * the first block of the current_ext. @current_ext is a target extent
5757 * to be split. @split_fsb is a block where the extents is split.
5758 * If split_fsb lies in a hole or the first block of extents, just return 0.
5761 xfs_bmap_split_extent_at(
5762 struct xfs_trans *tp,
5763 struct xfs_inode *ip,
5764 xfs_fileoff_t split_fsb,
5765 xfs_fsblock_t *firstfsb,
5766 struct xfs_bmap_free *free_list)
5768 int whichfork = XFS_DATA_FORK;
5769 struct xfs_btree_cur *cur = NULL;
5770 struct xfs_bmbt_rec_host *gotp;
5771 struct xfs_bmbt_irec got;
5772 struct xfs_bmbt_irec new; /* split extent */
5773 struct xfs_mount *mp = ip->i_mount;
5774 struct xfs_ifork *ifp;
5775 xfs_fsblock_t gotblkcnt; /* new block count for got */
5776 xfs_extnum_t current_ext;
5781 if (unlikely(XFS_TEST_ERROR(
5782 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
5783 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE),
5784 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
5785 XFS_ERROR_REPORT("xfs_bmap_split_extent_at",
5786 XFS_ERRLEVEL_LOW, mp);
5787 return -EFSCORRUPTED;
5790 if (XFS_FORCED_SHUTDOWN(mp))
5793 ifp = XFS_IFORK_PTR(ip, whichfork);
5794 if (!(ifp->if_flags & XFS_IFEXTENTS)) {
5795 /* Read in all the extents */
5796 error = xfs_iread_extents(tp, ip, whichfork);
5802 * gotp can be null in 2 cases: 1) if there are no extents
5803 * or 2) split_fsb lies in a hole beyond which there are
5804 * no extents. Either way, we are done.
5806 gotp = xfs_iext_bno_to_ext(ifp, split_fsb, ¤t_ext);
5810 xfs_bmbt_get_all(gotp, &got);
5813 * Check split_fsb lies in a hole or the start boundary offset
5816 if (got.br_startoff >= split_fsb)
5819 gotblkcnt = split_fsb - got.br_startoff;
5820 new.br_startoff = split_fsb;
5821 new.br_startblock = got.br_startblock + gotblkcnt;
5822 new.br_blockcount = got.br_blockcount - gotblkcnt;
5823 new.br_state = got.br_state;
5825 if (ifp->if_flags & XFS_IFBROOT) {
5826 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5827 cur->bc_private.b.firstblock = *firstfsb;
5828 cur->bc_private.b.flist = free_list;
5829 cur->bc_private.b.flags = 0;
5830 error = xfs_bmbt_lookup_eq(cur, got.br_startoff,
5836 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, del_cursor);
5839 xfs_bmbt_set_blockcount(gotp, gotblkcnt);
5840 got.br_blockcount = gotblkcnt;
5842 logflags = XFS_ILOG_CORE;
5844 error = xfs_bmbt_update(cur, got.br_startoff,
5851 logflags |= XFS_ILOG_DEXT;
5853 /* Add new extent */
5855 xfs_iext_insert(ip, current_ext, 1, &new, 0);
5856 XFS_IFORK_NEXT_SET(ip, whichfork,
5857 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
5860 error = xfs_bmbt_lookup_eq(cur, new.br_startoff,
5861 new.br_startblock, new.br_blockcount,
5865 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, del_cursor);
5866 cur->bc_rec.b.br_state = new.br_state;
5868 error = xfs_btree_insert(cur, &i);
5871 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, del_cursor);
5875 * Convert to a btree if necessary.
5877 if (xfs_bmap_needs_btree(ip, whichfork)) {
5878 int tmp_logflags; /* partial log flag return val */
5880 ASSERT(cur == NULL);
5881 error = xfs_bmap_extents_to_btree(tp, ip, firstfsb, free_list,
5882 &cur, 0, &tmp_logflags, whichfork);
5883 logflags |= tmp_logflags;
5888 cur->bc_private.b.allocated = 0;
5889 xfs_btree_del_cursor(cur,
5890 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
5894 xfs_trans_log_inode(tp, ip, logflags);
5899 xfs_bmap_split_extent(
5900 struct xfs_inode *ip,
5901 xfs_fileoff_t split_fsb)
5903 struct xfs_mount *mp = ip->i_mount;
5904 struct xfs_trans *tp;
5905 struct xfs_bmap_free free_list;
5906 xfs_fsblock_t firstfsb;
5910 tp = xfs_trans_alloc(mp, XFS_TRANS_DIOSTRAT);
5911 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_write,
5912 XFS_DIOSTRAT_SPACE_RES(mp, 0), 0);
5914 xfs_trans_cancel(tp, 0);
5918 xfs_ilock(ip, XFS_ILOCK_EXCL);
5919 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
5921 xfs_bmap_init(&free_list, &firstfsb);
5923 error = xfs_bmap_split_extent_at(tp, ip, split_fsb,
5924 &firstfsb, &free_list);
5928 error = xfs_bmap_finish(&tp, &free_list, &committed);
5932 return xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
5936 xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES | XFS_TRANS_ABORT);