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_types.h"
24 #include "xfs_trans.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_alloc_btree.h"
31 #include "xfs_ialloc_btree.h"
32 #include "xfs_dir2_sf.h"
33 #include "xfs_dinode.h"
34 #include "xfs_inode.h"
35 #include "xfs_btree.h"
36 #include "xfs_mount.h"
37 #include "xfs_itable.h"
38 #include "xfs_dir2_data.h"
39 #include "xfs_dir2_leaf.h"
40 #include "xfs_dir2_block.h"
41 #include "xfs_inode_item.h"
42 #include "xfs_extfree_item.h"
43 #include "xfs_alloc.h"
45 #include "xfs_rtalloc.h"
46 #include "xfs_error.h"
47 #include "xfs_attr_leaf.h"
49 #include "xfs_quota.h"
50 #include "xfs_trans_space.h"
51 #include "xfs_buf_item.h"
52 #include "xfs_filestream.h"
53 #include "xfs_vnodeops.h"
54 #include "xfs_trace.h"
59 xfs_bmap_check_leaf_extents(xfs_btree_cur_t *cur, xfs_inode_t *ip, int whichfork);
62 kmem_zone_t *xfs_bmap_free_item_zone;
65 * Prototypes for internal bmap routines.
70 * Called from xfs_bmap_add_attrfork to handle extents format files.
72 STATIC int /* error */
73 xfs_bmap_add_attrfork_extents(
74 xfs_trans_t *tp, /* transaction pointer */
75 xfs_inode_t *ip, /* incore inode pointer */
76 xfs_fsblock_t *firstblock, /* first block allocated */
77 xfs_bmap_free_t *flist, /* blocks to free at commit */
78 int *flags); /* inode logging flags */
81 * Called from xfs_bmap_add_attrfork to handle local format files.
83 STATIC int /* error */
84 xfs_bmap_add_attrfork_local(
85 xfs_trans_t *tp, /* transaction pointer */
86 xfs_inode_t *ip, /* incore inode pointer */
87 xfs_fsblock_t *firstblock, /* first block allocated */
88 xfs_bmap_free_t *flist, /* blocks to free at commit */
89 int *flags); /* inode logging flags */
92 * Called by xfs_bmap_add_extent to handle cases converting a delayed
93 * allocation to a real allocation.
95 STATIC int /* error */
96 xfs_bmap_add_extent_delay_real(
97 xfs_inode_t *ip, /* incore inode pointer */
98 xfs_extnum_t *idx, /* extent number to update/insert */
99 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
100 xfs_bmbt_irec_t *new, /* new data to add to file extents */
101 xfs_filblks_t *dnew, /* new delayed-alloc indirect blocks */
102 xfs_fsblock_t *first, /* pointer to firstblock variable */
103 xfs_bmap_free_t *flist, /* list of extents to be freed */
104 int *logflagsp); /* inode logging flags */
107 * Called by xfs_bmap_add_extent to handle cases converting a hole
108 * to a delayed allocation.
110 STATIC int /* error */
111 xfs_bmap_add_extent_hole_delay(
112 xfs_inode_t *ip, /* incore inode pointer */
113 xfs_extnum_t *idx, /* extent number to update/insert */
114 xfs_bmbt_irec_t *new, /* new data to add to file extents */
115 int *logflagsp); /* inode logging flags */
118 * Called by xfs_bmap_add_extent to handle cases converting a hole
119 * to a real allocation.
121 STATIC int /* error */
122 xfs_bmap_add_extent_hole_real(
123 xfs_inode_t *ip, /* incore inode pointer */
124 xfs_extnum_t *idx, /* extent number to update/insert */
125 xfs_btree_cur_t *cur, /* if null, not a btree */
126 xfs_bmbt_irec_t *new, /* new data to add to file extents */
127 int *logflagsp, /* inode logging flags */
128 int whichfork); /* data or attr fork */
131 * Called by xfs_bmap_add_extent to handle cases converting an unwritten
132 * allocation to a real allocation or vice versa.
134 STATIC int /* error */
135 xfs_bmap_add_extent_unwritten_real(
136 xfs_inode_t *ip, /* incore inode pointer */
137 xfs_extnum_t *idx, /* extent number to update/insert */
138 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
139 xfs_bmbt_irec_t *new, /* new data to add to file extents */
140 int *logflagsp); /* inode logging flags */
143 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
144 * It figures out where to ask the underlying allocator to put the new extent.
146 STATIC int /* error */
148 xfs_bmalloca_t *ap); /* bmap alloc argument struct */
151 * Transform a btree format file with only one leaf node, where the
152 * extents list will fit in the inode, into an extents format file.
153 * Since the file extents are already in-core, all we have to do is
154 * give up the space for the btree root and pitch the leaf block.
156 STATIC int /* error */
157 xfs_bmap_btree_to_extents(
158 xfs_trans_t *tp, /* transaction pointer */
159 xfs_inode_t *ip, /* incore inode pointer */
160 xfs_btree_cur_t *cur, /* btree cursor */
161 int *logflagsp, /* inode logging flags */
162 int whichfork); /* data or attr fork */
165 * Remove the entry "free" from the free item list. Prev points to the
166 * previous entry, unless "free" is the head of the list.
170 xfs_bmap_free_t *flist, /* free item list header */
171 xfs_bmap_free_item_t *prev, /* previous item on list, if any */
172 xfs_bmap_free_item_t *free); /* list item to be freed */
175 * Convert an extents-format file into a btree-format file.
176 * The new file will have a root block (in the inode) and a single child block.
178 STATIC int /* error */
179 xfs_bmap_extents_to_btree(
180 xfs_trans_t *tp, /* transaction pointer */
181 xfs_inode_t *ip, /* incore inode pointer */
182 xfs_fsblock_t *firstblock, /* first-block-allocated */
183 xfs_bmap_free_t *flist, /* blocks freed in xaction */
184 xfs_btree_cur_t **curp, /* cursor returned to caller */
185 int wasdel, /* converting a delayed alloc */
186 int *logflagsp, /* inode logging flags */
187 int whichfork); /* data or attr fork */
190 * Convert a local file to an extents file.
191 * This code is sort of bogus, since the file data needs to get
192 * logged so it won't be lost. The bmap-level manipulations are ok, though.
194 STATIC int /* error */
195 xfs_bmap_local_to_extents(
196 xfs_trans_t *tp, /* transaction pointer */
197 xfs_inode_t *ip, /* incore inode pointer */
198 xfs_fsblock_t *firstblock, /* first block allocated in xaction */
199 xfs_extlen_t total, /* total blocks needed by transaction */
200 int *logflagsp, /* inode logging flags */
201 int whichfork); /* data or attr fork */
204 * Search the extents list for the inode, for the extent containing bno.
205 * If bno lies in a hole, point to the next entry. If bno lies past eof,
206 * *eofp will be set, and *prevp will contain the last entry (null if none).
207 * Else, *lastxp will be set to the index of the found
208 * entry; *gotp will contain the entry.
210 STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */
211 xfs_bmap_search_extents(
212 xfs_inode_t *ip, /* incore inode pointer */
213 xfs_fileoff_t bno, /* block number searched for */
214 int whichfork, /* data or attr fork */
215 int *eofp, /* out: end of file found */
216 xfs_extnum_t *lastxp, /* out: last extent index */
217 xfs_bmbt_irec_t *gotp, /* out: extent entry found */
218 xfs_bmbt_irec_t *prevp); /* out: previous extent entry found */
221 * Check the last inode extent to determine whether this allocation will result
222 * in blocks being allocated at the end of the file. When we allocate new data
223 * blocks at the end of the file which do not start at the previous data block,
224 * we will try to align the new blocks at stripe unit boundaries.
226 STATIC int /* error */
228 xfs_inode_t *ip, /* incore inode pointer */
229 xfs_fileoff_t off, /* file offset in fsblocks */
230 int whichfork, /* data or attribute fork */
231 char *aeof); /* return value */
234 * Compute the worst-case number of indirect blocks that will be used
235 * for ip's delayed extent of length "len".
238 xfs_bmap_worst_indlen(
239 xfs_inode_t *ip, /* incore inode pointer */
240 xfs_filblks_t len); /* delayed extent length */
244 * Perform various validation checks on the values being returned
248 xfs_bmap_validate_ret(
252 xfs_bmbt_irec_t *mval,
256 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap)
264 xfs_fsblock_t blockno,
269 xfs_bmap_count_leaves(
276 xfs_bmap_disk_count_leaves(
277 struct xfs_mount *mp,
278 struct xfs_btree_block *block,
283 * Bmap internal routines.
286 STATIC int /* error */
288 struct xfs_btree_cur *cur,
292 int *stat) /* success/failure */
294 cur->bc_rec.b.br_startoff = off;
295 cur->bc_rec.b.br_startblock = bno;
296 cur->bc_rec.b.br_blockcount = len;
297 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
300 STATIC int /* error */
302 struct xfs_btree_cur *cur,
306 int *stat) /* success/failure */
308 cur->bc_rec.b.br_startoff = off;
309 cur->bc_rec.b.br_startblock = bno;
310 cur->bc_rec.b.br_blockcount = len;
311 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
315 * Update the record referred to by cur to the value given
316 * by [off, bno, len, state].
317 * This either works (return 0) or gets an EFSCORRUPTED error.
321 struct xfs_btree_cur *cur,
327 union xfs_btree_rec rec;
329 xfs_bmbt_disk_set_allf(&rec.bmbt, off, bno, len, state);
330 return xfs_btree_update(cur, &rec);
334 * Called from xfs_bmap_add_attrfork to handle btree format files.
336 STATIC int /* error */
337 xfs_bmap_add_attrfork_btree(
338 xfs_trans_t *tp, /* transaction pointer */
339 xfs_inode_t *ip, /* incore inode pointer */
340 xfs_fsblock_t *firstblock, /* first block allocated */
341 xfs_bmap_free_t *flist, /* blocks to free at commit */
342 int *flags) /* inode logging flags */
344 xfs_btree_cur_t *cur; /* btree cursor */
345 int error; /* error return value */
346 xfs_mount_t *mp; /* file system mount struct */
347 int stat; /* newroot status */
350 if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip))
351 *flags |= XFS_ILOG_DBROOT;
353 cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK);
354 cur->bc_private.b.flist = flist;
355 cur->bc_private.b.firstblock = *firstblock;
356 if ((error = xfs_bmbt_lookup_ge(cur, 0, 0, 0, &stat)))
358 /* must be at least one entry */
359 XFS_WANT_CORRUPTED_GOTO(stat == 1, error0);
360 if ((error = xfs_btree_new_iroot(cur, flags, &stat)))
363 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
364 return XFS_ERROR(ENOSPC);
366 *firstblock = cur->bc_private.b.firstblock;
367 cur->bc_private.b.allocated = 0;
368 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
372 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
377 * Called from xfs_bmap_add_attrfork to handle extents format files.
379 STATIC int /* error */
380 xfs_bmap_add_attrfork_extents(
381 xfs_trans_t *tp, /* transaction pointer */
382 xfs_inode_t *ip, /* incore inode pointer */
383 xfs_fsblock_t *firstblock, /* first block allocated */
384 xfs_bmap_free_t *flist, /* blocks to free at commit */
385 int *flags) /* inode logging flags */
387 xfs_btree_cur_t *cur; /* bmap btree cursor */
388 int error; /* error return value */
390 if (ip->i_d.di_nextents * sizeof(xfs_bmbt_rec_t) <= XFS_IFORK_DSIZE(ip))
393 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist, &cur, 0,
394 flags, XFS_DATA_FORK);
396 cur->bc_private.b.allocated = 0;
397 xfs_btree_del_cursor(cur,
398 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
404 * Called from xfs_bmap_add_attrfork to handle local format files.
406 STATIC int /* error */
407 xfs_bmap_add_attrfork_local(
408 xfs_trans_t *tp, /* transaction pointer */
409 xfs_inode_t *ip, /* incore inode pointer */
410 xfs_fsblock_t *firstblock, /* first block allocated */
411 xfs_bmap_free_t *flist, /* blocks to free at commit */
412 int *flags) /* inode logging flags */
414 xfs_da_args_t dargs; /* args for dir/attr code */
415 int error; /* error return value */
416 xfs_mount_t *mp; /* mount structure pointer */
418 if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip))
420 if ((ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
422 memset(&dargs, 0, sizeof(dargs));
424 dargs.firstblock = firstblock;
426 dargs.total = mp->m_dirblkfsbs;
427 dargs.whichfork = XFS_DATA_FORK;
429 error = xfs_dir2_sf_to_block(&dargs);
431 error = xfs_bmap_local_to_extents(tp, ip, firstblock, 1, flags,
437 * Called by xfs_bmapi to update file extent records and the btree
438 * after allocating space (or doing a delayed allocation).
440 STATIC int /* error */
442 xfs_inode_t *ip, /* incore inode pointer */
443 xfs_extnum_t *idx, /* extent number to update/insert */
444 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
445 xfs_bmbt_irec_t *new, /* new data to add to file extents */
446 xfs_fsblock_t *first, /* pointer to firstblock variable */
447 xfs_bmap_free_t *flist, /* list of extents to be freed */
448 int *logflagsp, /* inode logging flags */
449 int whichfork) /* data or attr fork */
451 xfs_btree_cur_t *cur; /* btree cursor or null */
452 xfs_filblks_t da_new; /* new count del alloc blocks used */
453 xfs_filblks_t da_old; /* old count del alloc blocks used */
454 int error; /* error return value */
455 xfs_ifork_t *ifp; /* inode fork ptr */
456 int logflags; /* returned value */
457 xfs_extnum_t nextents; /* number of extents in file now */
459 XFS_STATS_INC(xs_add_exlist);
462 ifp = XFS_IFORK_PTR(ip, whichfork);
463 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
468 ASSERT(*idx <= nextents);
471 * This is the first extent added to a new/empty file.
472 * Special case this one, so other routines get to assume there are
473 * already extents in the list.
476 xfs_iext_insert(ip, *idx, 1, new,
477 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0);
481 if (!isnullstartblock(new->br_startblock)) {
482 XFS_IFORK_NEXT_SET(ip, whichfork, 1);
483 logflags = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
488 * Any kind of new delayed allocation goes here.
490 else if (isnullstartblock(new->br_startblock)) {
492 ASSERT((cur->bc_private.b.flags &
493 XFS_BTCUR_BPRV_WASDEL) == 0);
494 error = xfs_bmap_add_extent_hole_delay(ip, idx, new,
498 * Real allocation off the end of the file.
500 else if (*idx == nextents) {
502 ASSERT((cur->bc_private.b.flags &
503 XFS_BTCUR_BPRV_WASDEL) == 0);
504 error = xfs_bmap_add_extent_hole_real(ip, idx, cur, new,
505 &logflags, whichfork);
507 xfs_bmbt_irec_t prev; /* old extent at offset idx */
510 * Get the record referred to by idx.
512 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &prev);
514 * If it's a real allocation record, and the new allocation ends
515 * after the start of the referred to record, then we're filling
516 * in a delayed or unwritten allocation with a real one, or
517 * converting real back to unwritten.
519 if (!isnullstartblock(new->br_startblock) &&
520 new->br_startoff + new->br_blockcount > prev.br_startoff) {
521 if (prev.br_state != XFS_EXT_UNWRITTEN &&
522 isnullstartblock(prev.br_startblock)) {
523 da_old = startblockval(prev.br_startblock);
525 ASSERT(cur->bc_private.b.flags &
526 XFS_BTCUR_BPRV_WASDEL);
527 error = xfs_bmap_add_extent_delay_real(ip,
528 idx, &cur, new, &da_new,
529 first, flist, &logflags);
531 ASSERT(new->br_state == XFS_EXT_NORM ||
532 new->br_state == XFS_EXT_UNWRITTEN);
534 error = xfs_bmap_add_extent_unwritten_real(ip,
535 idx, &cur, new, &logflags);
541 * Otherwise we're filling in a hole with an allocation.
545 ASSERT((cur->bc_private.b.flags &
546 XFS_BTCUR_BPRV_WASDEL) == 0);
547 error = xfs_bmap_add_extent_hole_real(ip, idx, cur,
548 new, &logflags, whichfork);
554 ASSERT(*curp == cur || *curp == NULL);
557 * Convert to a btree if necessary.
559 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
560 XFS_IFORK_NEXTENTS(ip, whichfork) > ifp->if_ext_max) {
561 int tmp_logflags; /* partial log flag return val */
564 error = xfs_bmap_extents_to_btree(ip->i_transp, ip, first,
565 flist, &cur, da_old > 0, &tmp_logflags, whichfork);
566 logflags |= tmp_logflags;
571 * Adjust for changes in reserved delayed indirect blocks.
572 * Nothing to do for disk quotas here.
574 if (da_old || da_new) {
579 nblks += cur->bc_private.b.allocated;
580 ASSERT(nblks <= da_old);
582 xfs_icsb_modify_counters(ip->i_mount, XFS_SBS_FDBLOCKS,
583 (int64_t)(da_old - nblks), 0);
586 * Clear out the allocated field, done with it now in any case.
589 cur->bc_private.b.allocated = 0;
595 xfs_bmap_check_leaf_extents(*curp, ip, whichfork);
597 *logflagsp = logflags;
602 * Called by xfs_bmap_add_extent to handle cases converting a delayed
603 * allocation to a real allocation.
605 STATIC int /* error */
606 xfs_bmap_add_extent_delay_real(
607 xfs_inode_t *ip, /* incore inode pointer */
608 xfs_extnum_t *idx, /* extent number to update/insert */
609 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
610 xfs_bmbt_irec_t *new, /* new data to add to file extents */
611 xfs_filblks_t *dnew, /* new delayed-alloc indirect blocks */
612 xfs_fsblock_t *first, /* pointer to firstblock variable */
613 xfs_bmap_free_t *flist, /* list of extents to be freed */
614 int *logflagsp) /* inode logging flags */
616 xfs_btree_cur_t *cur; /* btree cursor */
617 int diff; /* temp value */
618 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */
619 int error; /* error return value */
620 int i; /* temp state */
621 xfs_ifork_t *ifp; /* inode fork pointer */
622 xfs_fileoff_t new_endoff; /* end offset of new entry */
623 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
624 /* left is 0, right is 1, prev is 2 */
625 int rval=0; /* return value (logging flags) */
626 int state = 0;/* state bits, accessed thru macros */
627 xfs_filblks_t temp=0; /* value for dnew calculations */
628 xfs_filblks_t temp2=0;/* value for dnew calculations */
629 int tmp_rval; /* partial logging flags */
636 * Set up a bunch of variables to make the tests simpler.
639 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
640 ep = xfs_iext_get_ext(ifp, *idx);
641 xfs_bmbt_get_all(ep, &PREV);
642 new_endoff = new->br_startoff + new->br_blockcount;
643 ASSERT(PREV.br_startoff <= new->br_startoff);
644 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
647 * Set flags determining what part of the previous delayed allocation
648 * extent is being replaced by a real allocation.
650 if (PREV.br_startoff == new->br_startoff)
651 state |= BMAP_LEFT_FILLING;
652 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
653 state |= BMAP_RIGHT_FILLING;
656 * Check and set flags if this segment has a left neighbor.
657 * Don't set contiguous if the combined extent would be too large.
660 state |= BMAP_LEFT_VALID;
661 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT);
663 if (isnullstartblock(LEFT.br_startblock))
664 state |= BMAP_LEFT_DELAY;
667 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
668 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
669 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
670 LEFT.br_state == new->br_state &&
671 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
672 state |= BMAP_LEFT_CONTIG;
675 * Check and set flags if this segment has a right neighbor.
676 * Don't set contiguous if the combined extent would be too large.
677 * Also check for all-three-contiguous being too large.
679 if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) {
680 state |= BMAP_RIGHT_VALID;
681 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT);
683 if (isnullstartblock(RIGHT.br_startblock))
684 state |= BMAP_RIGHT_DELAY;
687 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
688 new_endoff == RIGHT.br_startoff &&
689 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
690 new->br_state == RIGHT.br_state &&
691 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
692 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
693 BMAP_RIGHT_FILLING)) !=
694 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
695 BMAP_RIGHT_FILLING) ||
696 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
698 state |= BMAP_RIGHT_CONTIG;
702 * Switch out based on the FILLING and CONTIG state bits.
704 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
705 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
706 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
707 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
709 * Filling in all of a previously delayed allocation extent.
710 * The left and right neighbors are both contiguous with new.
713 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
714 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
715 LEFT.br_blockcount + PREV.br_blockcount +
716 RIGHT.br_blockcount);
717 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
719 xfs_iext_remove(ip, *idx + 1, 2, state);
720 ip->i_d.di_nextents--;
722 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
724 rval = XFS_ILOG_CORE;
725 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
727 RIGHT.br_blockcount, &i)))
729 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
730 if ((error = xfs_btree_delete(cur, &i)))
732 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
733 if ((error = xfs_btree_decrement(cur, 0, &i)))
735 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
736 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
740 RIGHT.br_blockcount, LEFT.br_state)))
746 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
748 * Filling in all of a previously delayed allocation extent.
749 * The left neighbor is contiguous, the right is not.
753 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
754 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
755 LEFT.br_blockcount + PREV.br_blockcount);
756 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
758 xfs_iext_remove(ip, *idx + 1, 1, state);
760 rval = XFS_ILOG_DEXT;
763 if ((error = xfs_bmbt_lookup_eq(cur, LEFT.br_startoff,
764 LEFT.br_startblock, LEFT.br_blockcount,
767 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
768 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
771 PREV.br_blockcount, LEFT.br_state)))
777 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
779 * Filling in all of a previously delayed allocation extent.
780 * The right neighbor is contiguous, the left is not.
782 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
783 xfs_bmbt_set_startblock(ep, new->br_startblock);
784 xfs_bmbt_set_blockcount(ep,
785 PREV.br_blockcount + RIGHT.br_blockcount);
786 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
788 xfs_iext_remove(ip, *idx + 1, 1, state);
790 rval = XFS_ILOG_DEXT;
793 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
795 RIGHT.br_blockcount, &i)))
797 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
798 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
801 RIGHT.br_blockcount, PREV.br_state)))
808 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
810 * Filling in all of a previously delayed allocation extent.
811 * Neither the left nor right neighbors are contiguous with
814 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
815 xfs_bmbt_set_startblock(ep, new->br_startblock);
816 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
818 ip->i_d.di_nextents++;
820 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
822 rval = XFS_ILOG_CORE;
823 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
824 new->br_startblock, new->br_blockcount,
827 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
828 cur->bc_rec.b.br_state = XFS_EXT_NORM;
829 if ((error = xfs_btree_insert(cur, &i)))
831 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
837 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
839 * Filling in the first part of a previous delayed allocation.
840 * The left neighbor is contiguous.
842 trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_);
843 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1),
844 LEFT.br_blockcount + new->br_blockcount);
845 xfs_bmbt_set_startoff(ep,
846 PREV.br_startoff + new->br_blockcount);
847 trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_);
849 temp = PREV.br_blockcount - new->br_blockcount;
850 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
851 xfs_bmbt_set_blockcount(ep, temp);
853 rval = XFS_ILOG_DEXT;
856 if ((error = xfs_bmbt_lookup_eq(cur, LEFT.br_startoff,
857 LEFT.br_startblock, LEFT.br_blockcount,
860 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
861 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
868 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
869 startblockval(PREV.br_startblock));
870 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
871 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
877 case BMAP_LEFT_FILLING:
879 * Filling in the first part of a previous delayed allocation.
880 * The left neighbor is not contiguous.
882 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
883 xfs_bmbt_set_startoff(ep, new_endoff);
884 temp = PREV.br_blockcount - new->br_blockcount;
885 xfs_bmbt_set_blockcount(ep, temp);
886 xfs_iext_insert(ip, *idx, 1, new, state);
887 ip->i_d.di_nextents++;
889 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
891 rval = XFS_ILOG_CORE;
892 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
893 new->br_startblock, new->br_blockcount,
896 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
897 cur->bc_rec.b.br_state = XFS_EXT_NORM;
898 if ((error = xfs_btree_insert(cur, &i)))
900 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
902 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
903 ip->i_d.di_nextents > ip->i_df.if_ext_max) {
904 error = xfs_bmap_extents_to_btree(ip->i_transp, ip,
905 first, flist, &cur, 1, &tmp_rval,
911 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
912 startblockval(PREV.br_startblock) -
913 (cur ? cur->bc_private.b.allocated : 0));
914 ep = xfs_iext_get_ext(ifp, *idx + 1);
915 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
916 trace_xfs_bmap_post_update(ip, *idx + 1, state, _THIS_IP_);
921 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
923 * Filling in the last part of a previous delayed allocation.
924 * The right neighbor is contiguous with the new allocation.
926 temp = PREV.br_blockcount - new->br_blockcount;
927 trace_xfs_bmap_pre_update(ip, *idx + 1, state, _THIS_IP_);
928 xfs_bmbt_set_blockcount(ep, temp);
929 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx + 1),
930 new->br_startoff, new->br_startblock,
931 new->br_blockcount + RIGHT.br_blockcount,
933 trace_xfs_bmap_post_update(ip, *idx + 1, state, _THIS_IP_);
935 rval = XFS_ILOG_DEXT;
938 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
940 RIGHT.br_blockcount, &i)))
942 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
943 if ((error = xfs_bmbt_update(cur, new->br_startoff,
951 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
952 startblockval(PREV.br_startblock));
953 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
954 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
955 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
961 case BMAP_RIGHT_FILLING:
963 * Filling in the last part of a previous delayed allocation.
964 * The right neighbor is not contiguous.
966 temp = PREV.br_blockcount - new->br_blockcount;
967 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
968 xfs_bmbt_set_blockcount(ep, temp);
969 xfs_iext_insert(ip, *idx + 1, 1, new, state);
970 ip->i_d.di_nextents++;
972 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
974 rval = XFS_ILOG_CORE;
975 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
976 new->br_startblock, new->br_blockcount,
979 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
980 cur->bc_rec.b.br_state = XFS_EXT_NORM;
981 if ((error = xfs_btree_insert(cur, &i)))
983 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
985 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
986 ip->i_d.di_nextents > ip->i_df.if_ext_max) {
987 error = xfs_bmap_extents_to_btree(ip->i_transp, ip,
988 first, flist, &cur, 1, &tmp_rval,
994 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
995 startblockval(PREV.br_startblock) -
996 (cur ? cur->bc_private.b.allocated : 0));
997 ep = xfs_iext_get_ext(ifp, *idx);
998 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
999 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1007 * Filling in the middle part of a previous delayed allocation.
1008 * Contiguity is impossible here.
1009 * This case is avoided almost all the time.
1011 * We start with a delayed allocation:
1013 * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+
1016 * and we are allocating:
1017 * +rrrrrrrrrrrrrrrrr+
1020 * and we set it up for insertion as:
1021 * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+
1023 * PREV @ idx LEFT RIGHT
1024 * inserted at idx + 1
1026 temp = new->br_startoff - PREV.br_startoff;
1027 temp2 = PREV.br_startoff + PREV.br_blockcount - new_endoff;
1028 trace_xfs_bmap_pre_update(ip, *idx, 0, _THIS_IP_);
1029 xfs_bmbt_set_blockcount(ep, temp); /* truncate PREV */
1031 RIGHT.br_state = PREV.br_state;
1032 RIGHT.br_startblock = nullstartblock(
1033 (int)xfs_bmap_worst_indlen(ip, temp2));
1034 RIGHT.br_startoff = new_endoff;
1035 RIGHT.br_blockcount = temp2;
1036 /* insert LEFT (r[0]) and RIGHT (r[1]) at the same time */
1037 xfs_iext_insert(ip, *idx + 1, 2, &LEFT, state);
1038 ip->i_d.di_nextents++;
1040 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1042 rval = XFS_ILOG_CORE;
1043 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1044 new->br_startblock, new->br_blockcount,
1047 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1048 cur->bc_rec.b.br_state = XFS_EXT_NORM;
1049 if ((error = xfs_btree_insert(cur, &i)))
1051 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1053 if (ip->i_d.di_format == XFS_DINODE_FMT_EXTENTS &&
1054 ip->i_d.di_nextents > ip->i_df.if_ext_max) {
1055 error = xfs_bmap_extents_to_btree(ip->i_transp, ip,
1056 first, flist, &cur, 1, &tmp_rval,
1062 temp = xfs_bmap_worst_indlen(ip, temp);
1063 temp2 = xfs_bmap_worst_indlen(ip, temp2);
1064 diff = (int)(temp + temp2 - startblockval(PREV.br_startblock) -
1065 (cur ? cur->bc_private.b.allocated : 0));
1067 xfs_icsb_modify_counters(ip->i_mount, XFS_SBS_FDBLOCKS,
1068 -((int64_t)diff), 0)) {
1070 * Ick gross gag me with a spoon.
1072 ASSERT(0); /* want to see if this ever happens! */
1078 !xfs_icsb_modify_counters(ip->i_mount,
1080 -((int64_t)diff), 0))
1087 !xfs_icsb_modify_counters(ip->i_mount,
1089 -((int64_t)diff), 0))
1094 ep = xfs_iext_get_ext(ifp, *idx);
1095 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
1096 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1097 trace_xfs_bmap_pre_update(ip, *idx + 2, state, _THIS_IP_);
1098 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx + 2),
1099 nullstartblock((int)temp2));
1100 trace_xfs_bmap_post_update(ip, *idx + 2, state, _THIS_IP_);
1103 *dnew = temp + temp2;
1106 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1107 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1108 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
1109 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1110 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1111 case BMAP_LEFT_CONTIG:
1112 case BMAP_RIGHT_CONTIG:
1114 * These cases are all impossible.
1128 * Called by xfs_bmap_add_extent to handle cases converting an unwritten
1129 * allocation to a real allocation or vice versa.
1131 STATIC int /* error */
1132 xfs_bmap_add_extent_unwritten_real(
1133 xfs_inode_t *ip, /* incore inode pointer */
1134 xfs_extnum_t *idx, /* extent number to update/insert */
1135 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */
1136 xfs_bmbt_irec_t *new, /* new data to add to file extents */
1137 int *logflagsp) /* inode logging flags */
1139 xfs_btree_cur_t *cur; /* btree cursor */
1140 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */
1141 int error; /* error return value */
1142 int i; /* temp state */
1143 xfs_ifork_t *ifp; /* inode fork pointer */
1144 xfs_fileoff_t new_endoff; /* end offset of new entry */
1145 xfs_exntst_t newext; /* new extent state */
1146 xfs_exntst_t oldext; /* old extent state */
1147 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */
1148 /* left is 0, right is 1, prev is 2 */
1149 int rval=0; /* return value (logging flags) */
1150 int state = 0;/* state bits, accessed thru macros */
1156 * Set up a bunch of variables to make the tests simpler.
1160 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
1161 ep = xfs_iext_get_ext(ifp, *idx);
1162 xfs_bmbt_get_all(ep, &PREV);
1163 newext = new->br_state;
1164 oldext = (newext == XFS_EXT_UNWRITTEN) ?
1165 XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
1166 ASSERT(PREV.br_state == oldext);
1167 new_endoff = new->br_startoff + new->br_blockcount;
1168 ASSERT(PREV.br_startoff <= new->br_startoff);
1169 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
1172 * Set flags determining what part of the previous oldext allocation
1173 * extent is being replaced by a newext allocation.
1175 if (PREV.br_startoff == new->br_startoff)
1176 state |= BMAP_LEFT_FILLING;
1177 if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
1178 state |= BMAP_RIGHT_FILLING;
1181 * Check and set flags if this segment has a left neighbor.
1182 * Don't set contiguous if the combined extent would be too large.
1185 state |= BMAP_LEFT_VALID;
1186 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT);
1188 if (isnullstartblock(LEFT.br_startblock))
1189 state |= BMAP_LEFT_DELAY;
1192 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1193 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
1194 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
1195 LEFT.br_state == newext &&
1196 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1197 state |= BMAP_LEFT_CONTIG;
1200 * Check and set flags if this segment has a right neighbor.
1201 * Don't set contiguous if the combined extent would be too large.
1202 * Also check for all-three-contiguous being too large.
1204 if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) {
1205 state |= BMAP_RIGHT_VALID;
1206 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT);
1207 if (isnullstartblock(RIGHT.br_startblock))
1208 state |= BMAP_RIGHT_DELAY;
1211 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1212 new_endoff == RIGHT.br_startoff &&
1213 new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
1214 newext == RIGHT.br_state &&
1215 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
1216 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1217 BMAP_RIGHT_FILLING)) !=
1218 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1219 BMAP_RIGHT_FILLING) ||
1220 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
1222 state |= BMAP_RIGHT_CONTIG;
1225 * Switch out based on the FILLING and CONTIG state bits.
1227 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1228 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
1229 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1230 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1232 * Setting all of a previous oldext extent to newext.
1233 * The left and right neighbors are both contiguous with new.
1237 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1238 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
1239 LEFT.br_blockcount + PREV.br_blockcount +
1240 RIGHT.br_blockcount);
1241 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1243 xfs_iext_remove(ip, *idx + 1, 2, state);
1244 ip->i_d.di_nextents -= 2;
1246 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1248 rval = XFS_ILOG_CORE;
1249 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
1250 RIGHT.br_startblock,
1251 RIGHT.br_blockcount, &i)))
1253 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1254 if ((error = xfs_btree_delete(cur, &i)))
1256 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1257 if ((error = xfs_btree_decrement(cur, 0, &i)))
1259 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1260 if ((error = xfs_btree_delete(cur, &i)))
1262 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1263 if ((error = xfs_btree_decrement(cur, 0, &i)))
1265 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1266 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
1268 LEFT.br_blockcount + PREV.br_blockcount +
1269 RIGHT.br_blockcount, LEFT.br_state)))
1274 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1276 * Setting all of a previous oldext extent to newext.
1277 * The left neighbor is contiguous, the right is not.
1281 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1282 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
1283 LEFT.br_blockcount + PREV.br_blockcount);
1284 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1286 xfs_iext_remove(ip, *idx + 1, 1, state);
1287 ip->i_d.di_nextents--;
1289 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1291 rval = XFS_ILOG_CORE;
1292 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1293 PREV.br_startblock, PREV.br_blockcount,
1296 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1297 if ((error = xfs_btree_delete(cur, &i)))
1299 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1300 if ((error = xfs_btree_decrement(cur, 0, &i)))
1302 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1303 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
1305 LEFT.br_blockcount + PREV.br_blockcount,
1311 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1313 * Setting all of a previous oldext extent to newext.
1314 * The right neighbor is contiguous, the left is not.
1316 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1317 xfs_bmbt_set_blockcount(ep,
1318 PREV.br_blockcount + RIGHT.br_blockcount);
1319 xfs_bmbt_set_state(ep, newext);
1320 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1321 xfs_iext_remove(ip, *idx + 1, 1, state);
1322 ip->i_d.di_nextents--;
1324 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1326 rval = XFS_ILOG_CORE;
1327 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
1328 RIGHT.br_startblock,
1329 RIGHT.br_blockcount, &i)))
1331 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1332 if ((error = xfs_btree_delete(cur, &i)))
1334 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1335 if ((error = xfs_btree_decrement(cur, 0, &i)))
1337 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1338 if ((error = xfs_bmbt_update(cur, new->br_startoff,
1340 new->br_blockcount + RIGHT.br_blockcount,
1346 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
1348 * Setting all of a previous oldext extent to newext.
1349 * Neither the left nor right neighbors are contiguous with
1352 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1353 xfs_bmbt_set_state(ep, newext);
1354 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1357 rval = XFS_ILOG_DEXT;
1360 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1361 new->br_startblock, new->br_blockcount,
1364 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1365 if ((error = xfs_bmbt_update(cur, new->br_startoff,
1366 new->br_startblock, new->br_blockcount,
1372 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
1374 * Setting the first part of a previous oldext extent to newext.
1375 * The left neighbor is contiguous.
1377 trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_);
1378 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1),
1379 LEFT.br_blockcount + new->br_blockcount);
1380 xfs_bmbt_set_startoff(ep,
1381 PREV.br_startoff + new->br_blockcount);
1382 trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_);
1384 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1385 xfs_bmbt_set_startblock(ep,
1386 new->br_startblock + new->br_blockcount);
1387 xfs_bmbt_set_blockcount(ep,
1388 PREV.br_blockcount - new->br_blockcount);
1389 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1394 rval = XFS_ILOG_DEXT;
1397 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1398 PREV.br_startblock, PREV.br_blockcount,
1401 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1402 if ((error = xfs_bmbt_update(cur,
1403 PREV.br_startoff + new->br_blockcount,
1404 PREV.br_startblock + new->br_blockcount,
1405 PREV.br_blockcount - new->br_blockcount,
1408 if ((error = xfs_btree_decrement(cur, 0, &i)))
1410 if (xfs_bmbt_update(cur, LEFT.br_startoff,
1412 LEFT.br_blockcount + new->br_blockcount,
1418 case BMAP_LEFT_FILLING:
1420 * Setting the first part of a previous oldext extent to newext.
1421 * The left neighbor is not contiguous.
1423 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1424 ASSERT(ep && xfs_bmbt_get_state(ep) == oldext);
1425 xfs_bmbt_set_startoff(ep, new_endoff);
1426 xfs_bmbt_set_blockcount(ep,
1427 PREV.br_blockcount - new->br_blockcount);
1428 xfs_bmbt_set_startblock(ep,
1429 new->br_startblock + new->br_blockcount);
1430 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1432 xfs_iext_insert(ip, *idx, 1, new, state);
1433 ip->i_d.di_nextents++;
1435 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1437 rval = XFS_ILOG_CORE;
1438 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1439 PREV.br_startblock, PREV.br_blockcount,
1442 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1443 if ((error = xfs_bmbt_update(cur,
1444 PREV.br_startoff + new->br_blockcount,
1445 PREV.br_startblock + new->br_blockcount,
1446 PREV.br_blockcount - new->br_blockcount,
1449 cur->bc_rec.b = *new;
1450 if ((error = xfs_btree_insert(cur, &i)))
1452 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1456 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1458 * Setting the last part of a previous oldext extent to newext.
1459 * The right neighbor is contiguous with the new allocation.
1461 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1462 xfs_bmbt_set_blockcount(ep,
1463 PREV.br_blockcount - new->br_blockcount);
1464 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1468 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1469 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
1470 new->br_startoff, new->br_startblock,
1471 new->br_blockcount + RIGHT.br_blockcount, newext);
1472 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1475 rval = XFS_ILOG_DEXT;
1478 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1480 PREV.br_blockcount, &i)))
1482 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1483 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
1485 PREV.br_blockcount - new->br_blockcount,
1488 if ((error = xfs_btree_increment(cur, 0, &i)))
1490 if ((error = xfs_bmbt_update(cur, new->br_startoff,
1492 new->br_blockcount + RIGHT.br_blockcount,
1498 case BMAP_RIGHT_FILLING:
1500 * Setting the last part of a previous oldext extent to newext.
1501 * The right neighbor is not contiguous.
1503 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1504 xfs_bmbt_set_blockcount(ep,
1505 PREV.br_blockcount - new->br_blockcount);
1506 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1509 xfs_iext_insert(ip, *idx, 1, new, state);
1511 ip->i_d.di_nextents++;
1513 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1515 rval = XFS_ILOG_CORE;
1516 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1517 PREV.br_startblock, PREV.br_blockcount,
1520 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1521 if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
1523 PREV.br_blockcount - new->br_blockcount,
1526 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1527 new->br_startblock, new->br_blockcount,
1530 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1531 cur->bc_rec.b.br_state = XFS_EXT_NORM;
1532 if ((error = xfs_btree_insert(cur, &i)))
1534 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1540 * Setting the middle part of a previous oldext extent to
1541 * newext. Contiguity is impossible here.
1542 * One extent becomes three extents.
1544 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1545 xfs_bmbt_set_blockcount(ep,
1546 new->br_startoff - PREV.br_startoff);
1547 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1550 r[1].br_startoff = new_endoff;
1551 r[1].br_blockcount =
1552 PREV.br_startoff + PREV.br_blockcount - new_endoff;
1553 r[1].br_startblock = new->br_startblock + new->br_blockcount;
1554 r[1].br_state = oldext;
1557 xfs_iext_insert(ip, *idx, 2, &r[0], state);
1559 ip->i_d.di_nextents += 2;
1561 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1563 rval = XFS_ILOG_CORE;
1564 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1565 PREV.br_startblock, PREV.br_blockcount,
1568 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1569 /* new right extent - oldext */
1570 if ((error = xfs_bmbt_update(cur, r[1].br_startoff,
1571 r[1].br_startblock, r[1].br_blockcount,
1574 /* new left extent - oldext */
1575 cur->bc_rec.b = PREV;
1576 cur->bc_rec.b.br_blockcount =
1577 new->br_startoff - PREV.br_startoff;
1578 if ((error = xfs_btree_insert(cur, &i)))
1580 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1582 * Reset the cursor to the position of the new extent
1583 * we are about to insert as we can't trust it after
1584 * the previous insert.
1586 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1587 new->br_startblock, new->br_blockcount,
1590 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1591 /* new middle extent - newext */
1592 cur->bc_rec.b.br_state = new->br_state;
1593 if ((error = xfs_btree_insert(cur, &i)))
1595 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1599 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1600 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1601 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
1602 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1603 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1604 case BMAP_LEFT_CONTIG:
1605 case BMAP_RIGHT_CONTIG:
1607 * These cases are all impossible.
1621 * Called by xfs_bmap_add_extent to handle cases converting a hole
1622 * to a delayed allocation.
1625 STATIC int /* error */
1626 xfs_bmap_add_extent_hole_delay(
1627 xfs_inode_t *ip, /* incore inode pointer */
1628 xfs_extnum_t *idx, /* extent number to update/insert */
1629 xfs_bmbt_irec_t *new, /* new data to add to file extents */
1630 int *logflagsp) /* inode logging flags */
1632 xfs_bmbt_rec_host_t *ep; /* extent record for idx */
1633 xfs_ifork_t *ifp; /* inode fork pointer */
1634 xfs_bmbt_irec_t left; /* left neighbor extent entry */
1635 xfs_filblks_t newlen=0; /* new indirect size */
1636 xfs_filblks_t oldlen=0; /* old indirect size */
1637 xfs_bmbt_irec_t right; /* right neighbor extent entry */
1638 int state; /* state bits, accessed thru macros */
1639 xfs_filblks_t temp=0; /* temp for indirect calculations */
1641 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
1642 ep = xfs_iext_get_ext(ifp, *idx);
1644 ASSERT(isnullstartblock(new->br_startblock));
1647 * Check and set flags if this segment has a left neighbor
1650 state |= BMAP_LEFT_VALID;
1651 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left);
1653 if (isnullstartblock(left.br_startblock))
1654 state |= BMAP_LEFT_DELAY;
1658 * Check and set flags if the current (right) segment exists.
1659 * If it doesn't exist, we're converting the hole at end-of-file.
1661 if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) {
1662 state |= BMAP_RIGHT_VALID;
1663 xfs_bmbt_get_all(ep, &right);
1665 if (isnullstartblock(right.br_startblock))
1666 state |= BMAP_RIGHT_DELAY;
1670 * Set contiguity flags on the left and right neighbors.
1671 * Don't let extents get too large, even if the pieces are contiguous.
1673 if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) &&
1674 left.br_startoff + left.br_blockcount == new->br_startoff &&
1675 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1676 state |= BMAP_LEFT_CONTIG;
1678 if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) &&
1679 new->br_startoff + new->br_blockcount == right.br_startoff &&
1680 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
1681 (!(state & BMAP_LEFT_CONTIG) ||
1682 (left.br_blockcount + new->br_blockcount +
1683 right.br_blockcount <= MAXEXTLEN)))
1684 state |= BMAP_RIGHT_CONTIG;
1687 * Switch out based on the contiguity flags.
1689 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
1690 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1692 * New allocation is contiguous with delayed allocations
1693 * on the left and on the right.
1694 * Merge all three into a single extent record.
1697 temp = left.br_blockcount + new->br_blockcount +
1698 right.br_blockcount;
1700 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1701 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
1702 oldlen = startblockval(left.br_startblock) +
1703 startblockval(new->br_startblock) +
1704 startblockval(right.br_startblock);
1705 newlen = xfs_bmap_worst_indlen(ip, temp);
1706 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
1707 nullstartblock((int)newlen));
1708 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1710 xfs_iext_remove(ip, *idx + 1, 1, state);
1713 case BMAP_LEFT_CONTIG:
1715 * New allocation is contiguous with a delayed allocation
1717 * Merge the new allocation with the left neighbor.
1720 temp = left.br_blockcount + new->br_blockcount;
1722 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1723 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
1724 oldlen = startblockval(left.br_startblock) +
1725 startblockval(new->br_startblock);
1726 newlen = xfs_bmap_worst_indlen(ip, temp);
1727 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
1728 nullstartblock((int)newlen));
1729 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1732 case BMAP_RIGHT_CONTIG:
1734 * New allocation is contiguous with a delayed allocation
1736 * Merge the new allocation with the right neighbor.
1738 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1739 temp = new->br_blockcount + right.br_blockcount;
1740 oldlen = startblockval(new->br_startblock) +
1741 startblockval(right.br_startblock);
1742 newlen = xfs_bmap_worst_indlen(ip, temp);
1743 xfs_bmbt_set_allf(ep, new->br_startoff,
1744 nullstartblock((int)newlen), temp, right.br_state);
1745 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1750 * New allocation is not contiguous with another
1751 * delayed allocation.
1752 * Insert a new entry.
1754 oldlen = newlen = 0;
1755 xfs_iext_insert(ip, *idx, 1, new, state);
1758 if (oldlen != newlen) {
1759 ASSERT(oldlen > newlen);
1760 xfs_icsb_modify_counters(ip->i_mount, XFS_SBS_FDBLOCKS,
1761 (int64_t)(oldlen - newlen), 0);
1763 * Nothing to do for disk quota accounting here.
1771 * Called by xfs_bmap_add_extent to handle cases converting a hole
1772 * to a real allocation.
1774 STATIC int /* error */
1775 xfs_bmap_add_extent_hole_real(
1776 xfs_inode_t *ip, /* incore inode pointer */
1777 xfs_extnum_t *idx, /* extent number to update/insert */
1778 xfs_btree_cur_t *cur, /* if null, not a btree */
1779 xfs_bmbt_irec_t *new, /* new data to add to file extents */
1780 int *logflagsp, /* inode logging flags */
1781 int whichfork) /* data or attr fork */
1783 xfs_bmbt_rec_host_t *ep; /* pointer to extent entry ins. point */
1784 int error; /* error return value */
1785 int i; /* temp state */
1786 xfs_ifork_t *ifp; /* inode fork pointer */
1787 xfs_bmbt_irec_t left; /* left neighbor extent entry */
1788 xfs_bmbt_irec_t right; /* right neighbor extent entry */
1789 int rval=0; /* return value (logging flags) */
1790 int state; /* state bits, accessed thru macros */
1792 ifp = XFS_IFORK_PTR(ip, whichfork);
1793 ASSERT(*idx <= ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t));
1794 ep = xfs_iext_get_ext(ifp, *idx);
1797 if (whichfork == XFS_ATTR_FORK)
1798 state |= BMAP_ATTRFORK;
1801 * Check and set flags if this segment has a left neighbor.
1804 state |= BMAP_LEFT_VALID;
1805 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left);
1806 if (isnullstartblock(left.br_startblock))
1807 state |= BMAP_LEFT_DELAY;
1811 * Check and set flags if this segment has a current value.
1812 * Not true if we're inserting into the "hole" at eof.
1814 if (*idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) {
1815 state |= BMAP_RIGHT_VALID;
1816 xfs_bmbt_get_all(ep, &right);
1817 if (isnullstartblock(right.br_startblock))
1818 state |= BMAP_RIGHT_DELAY;
1822 * We're inserting a real allocation between "left" and "right".
1823 * Set the contiguity flags. Don't let extents get too large.
1825 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1826 left.br_startoff + left.br_blockcount == new->br_startoff &&
1827 left.br_startblock + left.br_blockcount == new->br_startblock &&
1828 left.br_state == new->br_state &&
1829 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1830 state |= BMAP_LEFT_CONTIG;
1832 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1833 new->br_startoff + new->br_blockcount == right.br_startoff &&
1834 new->br_startblock + new->br_blockcount == right.br_startblock &&
1835 new->br_state == right.br_state &&
1836 new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
1837 (!(state & BMAP_LEFT_CONTIG) ||
1838 left.br_blockcount + new->br_blockcount +
1839 right.br_blockcount <= MAXEXTLEN))
1840 state |= BMAP_RIGHT_CONTIG;
1844 * Select which case we're in here, and implement it.
1846 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
1847 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1849 * New allocation is contiguous with real allocations on the
1850 * left and on the right.
1851 * Merge all three into a single extent record.
1854 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1855 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
1856 left.br_blockcount + new->br_blockcount +
1857 right.br_blockcount);
1858 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1860 xfs_iext_remove(ip, *idx + 1, 1, state);
1862 XFS_IFORK_NEXT_SET(ip, whichfork,
1863 XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
1865 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
1867 rval = XFS_ILOG_CORE;
1868 if ((error = xfs_bmbt_lookup_eq(cur,
1870 right.br_startblock,
1871 right.br_blockcount, &i)))
1873 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1874 if ((error = xfs_btree_delete(cur, &i)))
1876 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1877 if ((error = xfs_btree_decrement(cur, 0, &i)))
1879 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1880 if ((error = xfs_bmbt_update(cur, left.br_startoff,
1882 left.br_blockcount +
1883 new->br_blockcount +
1884 right.br_blockcount,
1890 case BMAP_LEFT_CONTIG:
1892 * New allocation is contiguous with a real allocation
1894 * Merge the new allocation with the left neighbor.
1897 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1898 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
1899 left.br_blockcount + new->br_blockcount);
1900 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1903 rval = xfs_ilog_fext(whichfork);
1906 if ((error = xfs_bmbt_lookup_eq(cur,
1909 left.br_blockcount, &i)))
1911 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1912 if ((error = xfs_bmbt_update(cur, left.br_startoff,
1914 left.br_blockcount +
1921 case BMAP_RIGHT_CONTIG:
1923 * New allocation is contiguous with a real allocation
1925 * Merge the new allocation with the right neighbor.
1927 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1928 xfs_bmbt_set_allf(ep, new->br_startoff, new->br_startblock,
1929 new->br_blockcount + right.br_blockcount,
1931 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1934 rval = xfs_ilog_fext(whichfork);
1937 if ((error = xfs_bmbt_lookup_eq(cur,
1939 right.br_startblock,
1940 right.br_blockcount, &i)))
1942 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1943 if ((error = xfs_bmbt_update(cur, new->br_startoff,
1945 new->br_blockcount +
1946 right.br_blockcount,
1954 * New allocation is not contiguous with another
1956 * Insert a new entry.
1958 xfs_iext_insert(ip, *idx, 1, new, state);
1959 XFS_IFORK_NEXT_SET(ip, whichfork,
1960 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
1962 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
1964 rval = XFS_ILOG_CORE;
1965 if ((error = xfs_bmbt_lookup_eq(cur,
1968 new->br_blockcount, &i)))
1970 XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1971 cur->bc_rec.b.br_state = new->br_state;
1972 if ((error = xfs_btree_insert(cur, &i)))
1974 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1984 * Adjust the size of the new extent based on di_extsize and rt extsize.
1987 xfs_bmap_extsize_align(
1989 xfs_bmbt_irec_t *gotp, /* next extent pointer */
1990 xfs_bmbt_irec_t *prevp, /* previous extent pointer */
1991 xfs_extlen_t extsz, /* align to this extent size */
1992 int rt, /* is this a realtime inode? */
1993 int eof, /* is extent at end-of-file? */
1994 int delay, /* creating delalloc extent? */
1995 int convert, /* overwriting unwritten extent? */
1996 xfs_fileoff_t *offp, /* in/out: aligned offset */
1997 xfs_extlen_t *lenp) /* in/out: aligned length */
1999 xfs_fileoff_t orig_off; /* original offset */
2000 xfs_extlen_t orig_alen; /* original length */
2001 xfs_fileoff_t orig_end; /* original off+len */
2002 xfs_fileoff_t nexto; /* next file offset */
2003 xfs_fileoff_t prevo; /* previous file offset */
2004 xfs_fileoff_t align_off; /* temp for offset */
2005 xfs_extlen_t align_alen; /* temp for length */
2006 xfs_extlen_t temp; /* temp for calculations */
2011 orig_off = align_off = *offp;
2012 orig_alen = align_alen = *lenp;
2013 orig_end = orig_off + orig_alen;
2016 * If this request overlaps an existing extent, then don't
2017 * attempt to perform any additional alignment.
2019 if (!delay && !eof &&
2020 (orig_off >= gotp->br_startoff) &&
2021 (orig_end <= gotp->br_startoff + gotp->br_blockcount)) {
2026 * If the file offset is unaligned vs. the extent size
2027 * we need to align it. This will be possible unless
2028 * the file was previously written with a kernel that didn't
2029 * perform this alignment, or if a truncate shot us in the
2032 temp = do_mod(orig_off, extsz);
2038 * Same adjustment for the end of the requested area.
2040 if ((temp = (align_alen % extsz))) {
2041 align_alen += extsz - temp;
2044 * If the previous block overlaps with this proposed allocation
2045 * then move the start forward without adjusting the length.
2047 if (prevp->br_startoff != NULLFILEOFF) {
2048 if (prevp->br_startblock == HOLESTARTBLOCK)
2049 prevo = prevp->br_startoff;
2051 prevo = prevp->br_startoff + prevp->br_blockcount;
2054 if (align_off != orig_off && align_off < prevo)
2057 * If the next block overlaps with this proposed allocation
2058 * then move the start back without adjusting the length,
2059 * but not before offset 0.
2060 * This may of course make the start overlap previous block,
2061 * and if we hit the offset 0 limit then the next block
2062 * can still overlap too.
2064 if (!eof && gotp->br_startoff != NULLFILEOFF) {
2065 if ((delay && gotp->br_startblock == HOLESTARTBLOCK) ||
2066 (!delay && gotp->br_startblock == DELAYSTARTBLOCK))
2067 nexto = gotp->br_startoff + gotp->br_blockcount;
2069 nexto = gotp->br_startoff;
2071 nexto = NULLFILEOFF;
2073 align_off + align_alen != orig_end &&
2074 align_off + align_alen > nexto)
2075 align_off = nexto > align_alen ? nexto - align_alen : 0;
2077 * If we're now overlapping the next or previous extent that
2078 * means we can't fit an extsz piece in this hole. Just move
2079 * the start forward to the first valid spot and set
2080 * the length so we hit the end.
2082 if (align_off != orig_off && align_off < prevo)
2084 if (align_off + align_alen != orig_end &&
2085 align_off + align_alen > nexto &&
2086 nexto != NULLFILEOFF) {
2087 ASSERT(nexto > prevo);
2088 align_alen = nexto - align_off;
2092 * If realtime, and the result isn't a multiple of the realtime
2093 * extent size we need to remove blocks until it is.
2095 if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) {
2097 * We're not covering the original request, or
2098 * we won't be able to once we fix the length.
2100 if (orig_off < align_off ||
2101 orig_end > align_off + align_alen ||
2102 align_alen - temp < orig_alen)
2103 return XFS_ERROR(EINVAL);
2105 * Try to fix it by moving the start up.
2107 if (align_off + temp <= orig_off) {
2112 * Try to fix it by moving the end in.
2114 else if (align_off + align_alen - temp >= orig_end)
2117 * Set the start to the minimum then trim the length.
2120 align_alen -= orig_off - align_off;
2121 align_off = orig_off;
2122 align_alen -= align_alen % mp->m_sb.sb_rextsize;
2125 * Result doesn't cover the request, fail it.
2127 if (orig_off < align_off || orig_end > align_off + align_alen)
2128 return XFS_ERROR(EINVAL);
2130 ASSERT(orig_off >= align_off);
2131 ASSERT(orig_end <= align_off + align_alen);
2135 if (!eof && gotp->br_startoff != NULLFILEOFF)
2136 ASSERT(align_off + align_alen <= gotp->br_startoff);
2137 if (prevp->br_startoff != NULLFILEOFF)
2138 ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount);
2146 #define XFS_ALLOC_GAP_UNITS 4
2150 xfs_bmalloca_t *ap) /* bmap alloc argument struct */
2152 xfs_fsblock_t adjust; /* adjustment to block numbers */
2153 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
2154 xfs_mount_t *mp; /* mount point structure */
2155 int nullfb; /* true if ap->firstblock isn't set */
2156 int rt; /* true if inode is realtime */
2158 #define ISVALID(x,y) \
2160 (x) < mp->m_sb.sb_rblocks : \
2161 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \
2162 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \
2163 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks)
2165 mp = ap->ip->i_mount;
2166 nullfb = ap->firstblock == NULLFSBLOCK;
2167 rt = XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata;
2168 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, ap->firstblock);
2170 * If allocating at eof, and there's a previous real block,
2171 * try to use its last block as our starting point.
2173 if (ap->eof && ap->prevp->br_startoff != NULLFILEOFF &&
2174 !isnullstartblock(ap->prevp->br_startblock) &&
2175 ISVALID(ap->prevp->br_startblock + ap->prevp->br_blockcount,
2176 ap->prevp->br_startblock)) {
2177 ap->rval = ap->prevp->br_startblock + ap->prevp->br_blockcount;
2179 * Adjust for the gap between prevp and us.
2182 (ap->prevp->br_startoff + ap->prevp->br_blockcount);
2184 ISVALID(ap->rval + adjust, ap->prevp->br_startblock))
2188 * If not at eof, then compare the two neighbor blocks.
2189 * Figure out whether either one gives us a good starting point,
2190 * and pick the better one.
2192 else if (!ap->eof) {
2193 xfs_fsblock_t gotbno; /* right side block number */
2194 xfs_fsblock_t gotdiff=0; /* right side difference */
2195 xfs_fsblock_t prevbno; /* left side block number */
2196 xfs_fsblock_t prevdiff=0; /* left side difference */
2199 * If there's a previous (left) block, select a requested
2200 * start block based on it.
2202 if (ap->prevp->br_startoff != NULLFILEOFF &&
2203 !isnullstartblock(ap->prevp->br_startblock) &&
2204 (prevbno = ap->prevp->br_startblock +
2205 ap->prevp->br_blockcount) &&
2206 ISVALID(prevbno, ap->prevp->br_startblock)) {
2208 * Calculate gap to end of previous block.
2210 adjust = prevdiff = ap->off -
2211 (ap->prevp->br_startoff +
2212 ap->prevp->br_blockcount);
2214 * Figure the startblock based on the previous block's
2215 * end and the gap size.
2217 * If the gap is large relative to the piece we're
2218 * allocating, or using it gives us an invalid block
2219 * number, then just use the end of the previous block.
2221 if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->alen &&
2222 ISVALID(prevbno + prevdiff,
2223 ap->prevp->br_startblock))
2228 * If the firstblock forbids it, can't use it,
2231 if (!rt && !nullfb &&
2232 XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno)
2233 prevbno = NULLFSBLOCK;
2236 * No previous block or can't follow it, just default.
2239 prevbno = NULLFSBLOCK;
2241 * If there's a following (right) block, select a requested
2242 * start block based on it.
2244 if (!isnullstartblock(ap->gotp->br_startblock)) {
2246 * Calculate gap to start of next block.
2248 adjust = gotdiff = ap->gotp->br_startoff - ap->off;
2250 * Figure the startblock based on the next block's
2251 * start and the gap size.
2253 gotbno = ap->gotp->br_startblock;
2256 * If the gap is large relative to the piece we're
2257 * allocating, or using it gives us an invalid block
2258 * number, then just use the start of the next block
2259 * offset by our length.
2261 if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->alen &&
2262 ISVALID(gotbno - gotdiff, gotbno))
2264 else if (ISVALID(gotbno - ap->alen, gotbno)) {
2266 gotdiff += adjust - ap->alen;
2270 * If the firstblock forbids it, can't use it,
2273 if (!rt && !nullfb &&
2274 XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno)
2275 gotbno = NULLFSBLOCK;
2278 * No next block, just default.
2281 gotbno = NULLFSBLOCK;
2283 * If both valid, pick the better one, else the only good
2284 * one, else ap->rval is already set (to 0 or the inode block).
2286 if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK)
2287 ap->rval = prevdiff <= gotdiff ? prevbno : gotbno;
2288 else if (prevbno != NULLFSBLOCK)
2290 else if (gotbno != NULLFSBLOCK)
2298 xfs_bmalloca_t *ap) /* bmap alloc argument struct */
2300 xfs_alloctype_t atype = 0; /* type for allocation routines */
2301 int error; /* error return value */
2302 xfs_mount_t *mp; /* mount point structure */
2303 xfs_extlen_t prod = 0; /* product factor for allocators */
2304 xfs_extlen_t ralen = 0; /* realtime allocation length */
2305 xfs_extlen_t align; /* minimum allocation alignment */
2308 mp = ap->ip->i_mount;
2309 align = xfs_get_extsz_hint(ap->ip);
2310 prod = align / mp->m_sb.sb_rextsize;
2311 error = xfs_bmap_extsize_align(mp, ap->gotp, ap->prevp,
2312 align, 1, ap->eof, 0,
2313 ap->conv, &ap->off, &ap->alen);
2317 ASSERT(ap->alen % mp->m_sb.sb_rextsize == 0);
2320 * If the offset & length are not perfectly aligned
2321 * then kill prod, it will just get us in trouble.
2323 if (do_mod(ap->off, align) || ap->alen % align)
2326 * Set ralen to be the actual requested length in rtextents.
2328 ralen = ap->alen / mp->m_sb.sb_rextsize;
2330 * If the old value was close enough to MAXEXTLEN that
2331 * we rounded up to it, cut it back so it's valid again.
2332 * Note that if it's a really large request (bigger than
2333 * MAXEXTLEN), we don't hear about that number, and can't
2334 * adjust the starting point to match it.
2336 if (ralen * mp->m_sb.sb_rextsize >= MAXEXTLEN)
2337 ralen = MAXEXTLEN / mp->m_sb.sb_rextsize;
2340 * Lock out other modifications to the RT bitmap inode.
2342 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
2343 xfs_trans_ijoin_ref(ap->tp, mp->m_rbmip, XFS_ILOCK_EXCL);
2346 * If it's an allocation to an empty file at offset 0,
2347 * pick an extent that will space things out in the rt area.
2349 if (ap->eof && ap->off == 0) {
2350 xfs_rtblock_t uninitialized_var(rtx); /* realtime extent no */
2352 error = xfs_rtpick_extent(mp, ap->tp, ralen, &rtx);
2355 ap->rval = rtx * mp->m_sb.sb_rextsize;
2360 xfs_bmap_adjacent(ap);
2363 * Realtime allocation, done through xfs_rtallocate_extent.
2365 atype = ap->rval == 0 ? XFS_ALLOCTYPE_ANY_AG : XFS_ALLOCTYPE_NEAR_BNO;
2366 do_div(ap->rval, mp->m_sb.sb_rextsize);
2369 if ((error = xfs_rtallocate_extent(ap->tp, ap->rval, 1, ap->alen,
2370 &ralen, atype, ap->wasdel, prod, &rtb)))
2372 if (rtb == NULLFSBLOCK && prod > 1 &&
2373 (error = xfs_rtallocate_extent(ap->tp, ap->rval, 1,
2374 ap->alen, &ralen, atype,
2375 ap->wasdel, 1, &rtb)))
2378 if (ap->rval != NULLFSBLOCK) {
2379 ap->rval *= mp->m_sb.sb_rextsize;
2380 ralen *= mp->m_sb.sb_rextsize;
2382 ap->ip->i_d.di_nblocks += ralen;
2383 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
2385 ap->ip->i_delayed_blks -= ralen;
2387 * Adjust the disk quota also. This was reserved
2390 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
2391 ap->wasdel ? XFS_TRANS_DQ_DELRTBCOUNT :
2392 XFS_TRANS_DQ_RTBCOUNT, (long) ralen);
2400 xfs_bmap_btalloc_nullfb(
2401 struct xfs_bmalloca *ap,
2402 struct xfs_alloc_arg *args,
2405 struct xfs_mount *mp = ap->ip->i_mount;
2406 struct xfs_perag *pag;
2407 xfs_agnumber_t ag, startag;
2411 if (ap->userdata && xfs_inode_is_filestream(ap->ip))
2412 args->type = XFS_ALLOCTYPE_NEAR_BNO;
2414 args->type = XFS_ALLOCTYPE_START_BNO;
2415 args->total = ap->total;
2418 * Search for an allocation group with a single extent large enough
2419 * for the request. If one isn't found, then adjust the minimum
2420 * allocation size to the largest space found.
2422 startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
2423 if (startag == NULLAGNUMBER)
2426 pag = xfs_perag_get(mp, ag);
2427 while (*blen < args->maxlen) {
2428 if (!pag->pagf_init) {
2429 error = xfs_alloc_pagf_init(mp, args->tp, ag,
2430 XFS_ALLOC_FLAG_TRYLOCK);
2438 * See xfs_alloc_fix_freelist...
2440 if (pag->pagf_init) {
2441 xfs_extlen_t longest;
2442 longest = xfs_alloc_longest_free_extent(mp, pag);
2443 if (*blen < longest)
2448 if (xfs_inode_is_filestream(ap->ip)) {
2449 if (*blen >= args->maxlen)
2454 * If startag is an invalid AG, we've
2455 * come here once before and
2456 * xfs_filestream_new_ag picked the
2457 * best currently available.
2459 * Don't continue looping, since we
2460 * could loop forever.
2462 if (startag == NULLAGNUMBER)
2465 error = xfs_filestream_new_ag(ap, &ag);
2470 /* loop again to set 'blen'*/
2471 startag = NULLAGNUMBER;
2472 pag = xfs_perag_get(mp, ag);
2476 if (++ag == mp->m_sb.sb_agcount)
2481 pag = xfs_perag_get(mp, ag);
2486 * Since the above loop did a BUF_TRYLOCK, it is
2487 * possible that there is space for this request.
2489 if (notinit || *blen < ap->minlen)
2490 args->minlen = ap->minlen;
2492 * If the best seen length is less than the request
2493 * length, use the best as the minimum.
2495 else if (*blen < args->maxlen)
2496 args->minlen = *blen;
2498 * Otherwise we've seen an extent as big as maxlen,
2499 * use that as the minimum.
2502 args->minlen = args->maxlen;
2505 * set the failure fallback case to look in the selected
2506 * AG as the stream may have moved.
2508 if (xfs_inode_is_filestream(ap->ip))
2509 ap->rval = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0);
2516 xfs_bmalloca_t *ap) /* bmap alloc argument struct */
2518 xfs_mount_t *mp; /* mount point structure */
2519 xfs_alloctype_t atype = 0; /* type for allocation routines */
2520 xfs_extlen_t align; /* minimum allocation alignment */
2521 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */
2523 xfs_alloc_arg_t args;
2525 xfs_extlen_t nextminlen = 0;
2526 int nullfb; /* true if ap->firstblock isn't set */
2531 mp = ap->ip->i_mount;
2532 align = ap->userdata ? xfs_get_extsz_hint(ap->ip) : 0;
2533 if (unlikely(align)) {
2534 error = xfs_bmap_extsize_align(mp, ap->gotp, ap->prevp,
2535 align, 0, ap->eof, 0, ap->conv,
2536 &ap->off, &ap->alen);
2540 nullfb = ap->firstblock == NULLFSBLOCK;
2541 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, ap->firstblock);
2543 if (ap->userdata && xfs_inode_is_filestream(ap->ip)) {
2544 ag = xfs_filestream_lookup_ag(ap->ip);
2545 ag = (ag != NULLAGNUMBER) ? ag : 0;
2546 ap->rval = XFS_AGB_TO_FSB(mp, ag, 0);
2548 ap->rval = XFS_INO_TO_FSB(mp, ap->ip->i_ino);
2551 ap->rval = ap->firstblock;
2553 xfs_bmap_adjacent(ap);
2556 * If allowed, use ap->rval; otherwise must use firstblock since
2557 * it's in the right allocation group.
2559 if (nullfb || XFS_FSB_TO_AGNO(mp, ap->rval) == fb_agno)
2562 ap->rval = ap->firstblock;
2564 * Normal allocation, done through xfs_alloc_vextent.
2566 tryagain = isaligned = 0;
2569 args.fsbno = ap->rval;
2571 /* Trim the allocation back to the maximum an AG can fit. */
2572 args.maxlen = MIN(ap->alen, XFS_ALLOC_AG_MAX_USABLE(mp));
2573 args.firstblock = ap->firstblock;
2576 error = xfs_bmap_btalloc_nullfb(ap, &args, &blen);
2579 } else if (ap->low) {
2580 if (xfs_inode_is_filestream(ap->ip))
2581 args.type = XFS_ALLOCTYPE_FIRST_AG;
2583 args.type = XFS_ALLOCTYPE_START_BNO;
2584 args.total = args.minlen = ap->minlen;
2586 args.type = XFS_ALLOCTYPE_NEAR_BNO;
2587 args.total = ap->total;
2588 args.minlen = ap->minlen;
2590 /* apply extent size hints if obtained earlier */
2591 if (unlikely(align)) {
2593 if ((args.mod = (xfs_extlen_t)do_mod(ap->off, args.prod)))
2594 args.mod = (xfs_extlen_t)(args.prod - args.mod);
2595 } else if (mp->m_sb.sb_blocksize >= PAGE_CACHE_SIZE) {
2599 args.prod = PAGE_CACHE_SIZE >> mp->m_sb.sb_blocklog;
2600 if ((args.mod = (xfs_extlen_t)(do_mod(ap->off, args.prod))))
2601 args.mod = (xfs_extlen_t)(args.prod - args.mod);
2604 * If we are not low on available data blocks, and the
2605 * underlying logical volume manager is a stripe, and
2606 * the file offset is zero then try to allocate data
2607 * blocks on stripe unit boundary.
2608 * NOTE: ap->aeof is only set if the allocation length
2609 * is >= the stripe unit and the allocation offset is
2610 * at the end of file.
2612 if (!ap->low && ap->aeof) {
2614 args.alignment = mp->m_dalign;
2618 * Adjust for alignment
2620 if (blen > args.alignment && blen <= args.maxlen)
2621 args.minlen = blen - args.alignment;
2622 args.minalignslop = 0;
2625 * First try an exact bno allocation.
2626 * If it fails then do a near or start bno
2627 * allocation with alignment turned on.
2631 args.type = XFS_ALLOCTYPE_THIS_BNO;
2634 * Compute the minlen+alignment for the
2635 * next case. Set slop so that the value
2636 * of minlen+alignment+slop doesn't go up
2637 * between the calls.
2639 if (blen > mp->m_dalign && blen <= args.maxlen)
2640 nextminlen = blen - mp->m_dalign;
2642 nextminlen = args.minlen;
2643 if (nextminlen + mp->m_dalign > args.minlen + 1)
2645 nextminlen + mp->m_dalign -
2648 args.minalignslop = 0;
2652 args.minalignslop = 0;
2654 args.minleft = ap->minleft;
2655 args.wasdel = ap->wasdel;
2657 args.userdata = ap->userdata;
2658 if ((error = xfs_alloc_vextent(&args)))
2660 if (tryagain && args.fsbno == NULLFSBLOCK) {
2662 * Exact allocation failed. Now try with alignment
2666 args.fsbno = ap->rval;
2667 args.alignment = mp->m_dalign;
2668 args.minlen = nextminlen;
2669 args.minalignslop = 0;
2671 if ((error = xfs_alloc_vextent(&args)))
2674 if (isaligned && args.fsbno == NULLFSBLOCK) {
2676 * allocation failed, so turn off alignment and
2680 args.fsbno = ap->rval;
2682 if ((error = xfs_alloc_vextent(&args)))
2685 if (args.fsbno == NULLFSBLOCK && nullfb &&
2686 args.minlen > ap->minlen) {
2687 args.minlen = ap->minlen;
2688 args.type = XFS_ALLOCTYPE_START_BNO;
2689 args.fsbno = ap->rval;
2690 if ((error = xfs_alloc_vextent(&args)))
2693 if (args.fsbno == NULLFSBLOCK && nullfb) {
2695 args.type = XFS_ALLOCTYPE_FIRST_AG;
2696 args.total = ap->minlen;
2698 if ((error = xfs_alloc_vextent(&args)))
2702 if (args.fsbno != NULLFSBLOCK) {
2703 ap->firstblock = ap->rval = args.fsbno;
2704 ASSERT(nullfb || fb_agno == args.agno ||
2705 (ap->low && fb_agno < args.agno));
2706 ap->alen = args.len;
2707 ap->ip->i_d.di_nblocks += args.len;
2708 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
2710 ap->ip->i_delayed_blks -= args.len;
2712 * Adjust the disk quota also. This was reserved
2715 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
2716 ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT :
2717 XFS_TRANS_DQ_BCOUNT,
2720 ap->rval = NULLFSBLOCK;
2727 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
2728 * It figures out where to ask the underlying allocator to put the new extent.
2732 xfs_bmalloca_t *ap) /* bmap alloc argument struct */
2734 if (XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata)
2735 return xfs_bmap_rtalloc(ap);
2736 return xfs_bmap_btalloc(ap);
2740 * Transform a btree format file with only one leaf node, where the
2741 * extents list will fit in the inode, into an extents format file.
2742 * Since the file extents are already in-core, all we have to do is
2743 * give up the space for the btree root and pitch the leaf block.
2745 STATIC int /* error */
2746 xfs_bmap_btree_to_extents(
2747 xfs_trans_t *tp, /* transaction pointer */
2748 xfs_inode_t *ip, /* incore inode pointer */
2749 xfs_btree_cur_t *cur, /* btree cursor */
2750 int *logflagsp, /* inode logging flags */
2751 int whichfork) /* data or attr fork */
2754 struct xfs_btree_block *cblock;/* child btree block */
2755 xfs_fsblock_t cbno; /* child block number */
2756 xfs_buf_t *cbp; /* child block's buffer */
2757 int error; /* error return value */
2758 xfs_ifork_t *ifp; /* inode fork data */
2759 xfs_mount_t *mp; /* mount point structure */
2760 __be64 *pp; /* ptr to block address */
2761 struct xfs_btree_block *rblock;/* root btree block */
2764 ifp = XFS_IFORK_PTR(ip, whichfork);
2765 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
2766 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
2767 rblock = ifp->if_broot;
2768 ASSERT(be16_to_cpu(rblock->bb_level) == 1);
2769 ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1);
2770 ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1);
2771 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes);
2772 cbno = be64_to_cpu(*pp);
2775 if ((error = xfs_btree_check_lptr(cur, cbno, 1)))
2778 if ((error = xfs_btree_read_bufl(mp, tp, cbno, 0, &cbp,
2779 XFS_BMAP_BTREE_REF)))
2781 cblock = XFS_BUF_TO_BLOCK(cbp);
2782 if ((error = xfs_btree_check_block(cur, cblock, 0, cbp)))
2784 xfs_bmap_add_free(cbno, 1, cur->bc_private.b.flist, mp);
2785 ip->i_d.di_nblocks--;
2786 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
2787 xfs_trans_binval(tp, cbp);
2788 if (cur->bc_bufs[0] == cbp)
2789 cur->bc_bufs[0] = NULL;
2790 xfs_iroot_realloc(ip, -1, whichfork);
2791 ASSERT(ifp->if_broot == NULL);
2792 ASSERT((ifp->if_flags & XFS_IFBROOT) == 0);
2793 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
2794 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
2799 * Called by xfs_bmapi to update file extent records and the btree
2800 * after removing space (or undoing a delayed allocation).
2802 STATIC int /* error */
2803 xfs_bmap_del_extent(
2804 xfs_inode_t *ip, /* incore inode pointer */
2805 xfs_trans_t *tp, /* current transaction pointer */
2806 xfs_extnum_t *idx, /* extent number to update/delete */
2807 xfs_bmap_free_t *flist, /* list of extents to be freed */
2808 xfs_btree_cur_t *cur, /* if null, not a btree */
2809 xfs_bmbt_irec_t *del, /* data to remove from extents */
2810 int *logflagsp, /* inode logging flags */
2811 int whichfork) /* data or attr fork */
2813 xfs_filblks_t da_new; /* new delay-alloc indirect blocks */
2814 xfs_filblks_t da_old; /* old delay-alloc indirect blocks */
2815 xfs_fsblock_t del_endblock=0; /* first block past del */
2816 xfs_fileoff_t del_endoff; /* first offset past del */
2817 int delay; /* current block is delayed allocated */
2818 int do_fx; /* free extent at end of routine */
2819 xfs_bmbt_rec_host_t *ep; /* current extent entry pointer */
2820 int error; /* error return value */
2821 int flags; /* inode logging flags */
2822 xfs_bmbt_irec_t got; /* current extent entry */
2823 xfs_fileoff_t got_endoff; /* first offset past got */
2824 int i; /* temp state */
2825 xfs_ifork_t *ifp; /* inode fork pointer */
2826 xfs_mount_t *mp; /* mount structure */
2827 xfs_filblks_t nblks; /* quota/sb block count */
2828 xfs_bmbt_irec_t new; /* new record to be inserted */
2830 uint qfield; /* quota field to update */
2831 xfs_filblks_t temp; /* for indirect length calculations */
2832 xfs_filblks_t temp2; /* for indirect length calculations */
2835 XFS_STATS_INC(xs_del_exlist);
2837 if (whichfork == XFS_ATTR_FORK)
2838 state |= BMAP_ATTRFORK;
2841 ifp = XFS_IFORK_PTR(ip, whichfork);
2842 ASSERT((*idx >= 0) && (*idx < ifp->if_bytes /
2843 (uint)sizeof(xfs_bmbt_rec_t)));
2844 ASSERT(del->br_blockcount > 0);
2845 ep = xfs_iext_get_ext(ifp, *idx);
2846 xfs_bmbt_get_all(ep, &got);
2847 ASSERT(got.br_startoff <= del->br_startoff);
2848 del_endoff = del->br_startoff + del->br_blockcount;
2849 got_endoff = got.br_startoff + got.br_blockcount;
2850 ASSERT(got_endoff >= del_endoff);
2851 delay = isnullstartblock(got.br_startblock);
2852 ASSERT(isnullstartblock(del->br_startblock) == delay);
2857 * If deleting a real allocation, must free up the disk space.
2860 flags = XFS_ILOG_CORE;
2862 * Realtime allocation. Free it and record di_nblocks update.
2864 if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) {
2868 ASSERT(do_mod(del->br_blockcount,
2869 mp->m_sb.sb_rextsize) == 0);
2870 ASSERT(do_mod(del->br_startblock,
2871 mp->m_sb.sb_rextsize) == 0);
2872 bno = del->br_startblock;
2873 len = del->br_blockcount;
2874 do_div(bno, mp->m_sb.sb_rextsize);
2875 do_div(len, mp->m_sb.sb_rextsize);
2876 if ((error = xfs_rtfree_extent(ip->i_transp, bno,
2877 (xfs_extlen_t)len)))
2880 nblks = len * mp->m_sb.sb_rextsize;
2881 qfield = XFS_TRANS_DQ_RTBCOUNT;
2884 * Ordinary allocation.
2888 nblks = del->br_blockcount;
2889 qfield = XFS_TRANS_DQ_BCOUNT;
2892 * Set up del_endblock and cur for later.
2894 del_endblock = del->br_startblock + del->br_blockcount;
2896 if ((error = xfs_bmbt_lookup_eq(cur, got.br_startoff,
2897 got.br_startblock, got.br_blockcount,
2900 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
2902 da_old = da_new = 0;
2904 da_old = startblockval(got.br_startblock);
2910 * Set flag value to use in switch statement.
2911 * Left-contig is 2, right-contig is 1.
2913 switch (((got.br_startoff == del->br_startoff) << 1) |
2914 (got_endoff == del_endoff)) {
2917 * Matches the whole extent. Delete the entry.
2919 xfs_iext_remove(ip, *idx, 1,
2920 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0);
2923 XFS_IFORK_NEXT_SET(ip, whichfork,
2924 XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
2925 flags |= XFS_ILOG_CORE;
2927 flags |= xfs_ilog_fext(whichfork);
2930 if ((error = xfs_btree_delete(cur, &i)))
2932 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
2937 * Deleting the first part of the extent.
2939 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2940 xfs_bmbt_set_startoff(ep, del_endoff);
2941 temp = got.br_blockcount - del->br_blockcount;
2942 xfs_bmbt_set_blockcount(ep, temp);
2944 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2946 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2947 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2951 xfs_bmbt_set_startblock(ep, del_endblock);
2952 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2954 flags |= xfs_ilog_fext(whichfork);
2957 if ((error = xfs_bmbt_update(cur, del_endoff, del_endblock,
2958 got.br_blockcount - del->br_blockcount,
2965 * Deleting the last part of the extent.
2967 temp = got.br_blockcount - del->br_blockcount;
2968 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2969 xfs_bmbt_set_blockcount(ep, temp);
2971 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2973 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2974 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2978 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2980 flags |= xfs_ilog_fext(whichfork);
2983 if ((error = xfs_bmbt_update(cur, got.br_startoff,
2985 got.br_blockcount - del->br_blockcount,
2992 * Deleting the middle of the extent.
2994 temp = del->br_startoff - got.br_startoff;
2995 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2996 xfs_bmbt_set_blockcount(ep, temp);
2997 new.br_startoff = del_endoff;
2998 temp2 = got_endoff - del_endoff;
2999 new.br_blockcount = temp2;
3000 new.br_state = got.br_state;
3002 new.br_startblock = del_endblock;
3003 flags |= XFS_ILOG_CORE;
3005 if ((error = xfs_bmbt_update(cur,
3007 got.br_startblock, temp,
3010 if ((error = xfs_btree_increment(cur, 0, &i)))
3012 cur->bc_rec.b = new;
3013 error = xfs_btree_insert(cur, &i);
3014 if (error && error != ENOSPC)
3017 * If get no-space back from btree insert,
3018 * it tried a split, and we have a zero
3019 * block reservation.
3020 * Fix up our state and return the error.
3022 if (error == ENOSPC) {
3024 * Reset the cursor, don't trust
3025 * it after any insert operation.
3027 if ((error = xfs_bmbt_lookup_eq(cur,
3032 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
3034 * Update the btree record back
3035 * to the original value.
3037 if ((error = xfs_bmbt_update(cur,
3044 * Reset the extent record back
3045 * to the original value.
3047 xfs_bmbt_set_blockcount(ep,
3050 error = XFS_ERROR(ENOSPC);
3053 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
3055 flags |= xfs_ilog_fext(whichfork);
3056 XFS_IFORK_NEXT_SET(ip, whichfork,
3057 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
3059 ASSERT(whichfork == XFS_DATA_FORK);
3060 temp = xfs_bmap_worst_indlen(ip, temp);
3061 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
3062 temp2 = xfs_bmap_worst_indlen(ip, temp2);
3063 new.br_startblock = nullstartblock((int)temp2);
3064 da_new = temp + temp2;
3065 while (da_new > da_old) {
3069 xfs_bmbt_set_startblock(ep,
3070 nullstartblock((int)temp));
3072 if (da_new == da_old)
3078 nullstartblock((int)temp2);
3082 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
3083 xfs_iext_insert(ip, *idx + 1, 1, &new, state);
3088 * If we need to, add to list of extents to delete.
3091 xfs_bmap_add_free(del->br_startblock, del->br_blockcount, flist,
3094 * Adjust inode # blocks in the file.
3097 ip->i_d.di_nblocks -= nblks;
3099 * Adjust quota data.
3102 xfs_trans_mod_dquot_byino(tp, ip, qfield, (long)-nblks);
3105 * Account for change in delayed indirect blocks.
3106 * Nothing to do for disk quota accounting here.
3108 ASSERT(da_old >= da_new);
3109 if (da_old > da_new) {
3110 xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS,
3111 (int64_t)(da_old - da_new), 0);
3119 * Remove the entry "free" from the free item list. Prev points to the
3120 * previous entry, unless "free" is the head of the list.
3124 xfs_bmap_free_t *flist, /* free item list header */
3125 xfs_bmap_free_item_t *prev, /* previous item on list, if any */
3126 xfs_bmap_free_item_t *free) /* list item to be freed */
3129 prev->xbfi_next = free->xbfi_next;
3131 flist->xbf_first = free->xbfi_next;
3133 kmem_zone_free(xfs_bmap_free_item_zone, free);
3137 * Convert an extents-format file into a btree-format file.
3138 * The new file will have a root block (in the inode) and a single child block.
3140 STATIC int /* error */
3141 xfs_bmap_extents_to_btree(
3142 xfs_trans_t *tp, /* transaction pointer */
3143 xfs_inode_t *ip, /* incore inode pointer */
3144 xfs_fsblock_t *firstblock, /* first-block-allocated */
3145 xfs_bmap_free_t *flist, /* blocks freed in xaction */
3146 xfs_btree_cur_t **curp, /* cursor returned to caller */
3147 int wasdel, /* converting a delayed alloc */
3148 int *logflagsp, /* inode logging flags */
3149 int whichfork) /* data or attr fork */
3151 struct xfs_btree_block *ablock; /* allocated (child) bt block */
3152 xfs_buf_t *abp; /* buffer for ablock */
3153 xfs_alloc_arg_t args; /* allocation arguments */
3154 xfs_bmbt_rec_t *arp; /* child record pointer */
3155 struct xfs_btree_block *block; /* btree root block */
3156 xfs_btree_cur_t *cur; /* bmap btree cursor */
3157 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
3158 int error; /* error return value */
3159 xfs_extnum_t i, cnt; /* extent record index */
3160 xfs_ifork_t *ifp; /* inode fork pointer */
3161 xfs_bmbt_key_t *kp; /* root block key pointer */
3162 xfs_mount_t *mp; /* mount structure */
3163 xfs_extnum_t nextents; /* number of file extents */
3164 xfs_bmbt_ptr_t *pp; /* root block address pointer */
3166 ifp = XFS_IFORK_PTR(ip, whichfork);
3167 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS);
3168 ASSERT(ifp->if_ext_max ==
3169 XFS_IFORK_SIZE(ip, whichfork) / (uint)sizeof(xfs_bmbt_rec_t));
3171 * Make space in the inode incore.
3173 xfs_iroot_realloc(ip, 1, whichfork);
3174 ifp->if_flags |= XFS_IFBROOT;
3179 block = ifp->if_broot;
3180 block->bb_magic = cpu_to_be32(XFS_BMAP_MAGIC);
3181 block->bb_level = cpu_to_be16(1);
3182 block->bb_numrecs = cpu_to_be16(1);
3183 block->bb_u.l.bb_leftsib = cpu_to_be64(NULLDFSBNO);
3184 block->bb_u.l.bb_rightsib = cpu_to_be64(NULLDFSBNO);
3187 * Need a cursor. Can't allocate until bb_level is filled in.
3190 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
3191 cur->bc_private.b.firstblock = *firstblock;
3192 cur->bc_private.b.flist = flist;
3193 cur->bc_private.b.flags = wasdel ? XFS_BTCUR_BPRV_WASDEL : 0;
3195 * Convert to a btree with two levels, one record in root.
3197 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_BTREE);
3200 args.firstblock = *firstblock;
3201 if (*firstblock == NULLFSBLOCK) {
3202 args.type = XFS_ALLOCTYPE_START_BNO;
3203 args.fsbno = XFS_INO_TO_FSB(mp, ip->i_ino);
3204 } else if (flist->xbf_low) {
3205 args.type = XFS_ALLOCTYPE_START_BNO;
3206 args.fsbno = *firstblock;
3208 args.type = XFS_ALLOCTYPE_NEAR_BNO;
3209 args.fsbno = *firstblock;
3211 args.minlen = args.maxlen = args.prod = 1;
3212 args.total = args.minleft = args.alignment = args.mod = args.isfl =
3213 args.minalignslop = 0;
3214 args.wasdel = wasdel;
3216 if ((error = xfs_alloc_vextent(&args))) {
3217 xfs_iroot_realloc(ip, -1, whichfork);
3218 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
3222 * Allocation can't fail, the space was reserved.
3224 ASSERT(args.fsbno != NULLFSBLOCK);
3225 ASSERT(*firstblock == NULLFSBLOCK ||
3226 args.agno == XFS_FSB_TO_AGNO(mp, *firstblock) ||
3228 args.agno > XFS_FSB_TO_AGNO(mp, *firstblock)));
3229 *firstblock = cur->bc_private.b.firstblock = args.fsbno;
3230 cur->bc_private.b.allocated++;
3231 ip->i_d.di_nblocks++;
3232 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, 1L);
3233 abp = xfs_btree_get_bufl(mp, tp, args.fsbno, 0);
3235 * Fill in the child block.
3237 ablock = XFS_BUF_TO_BLOCK(abp);
3238 ablock->bb_magic = cpu_to_be32(XFS_BMAP_MAGIC);
3239 ablock->bb_level = 0;
3240 ablock->bb_u.l.bb_leftsib = cpu_to_be64(NULLDFSBNO);
3241 ablock->bb_u.l.bb_rightsib = cpu_to_be64(NULLDFSBNO);
3242 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
3243 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
3244 for (cnt = i = 0; i < nextents; i++) {
3245 ep = xfs_iext_get_ext(ifp, i);
3246 if (!isnullstartblock(xfs_bmbt_get_startblock(ep))) {
3247 arp->l0 = cpu_to_be64(ep->l0);
3248 arp->l1 = cpu_to_be64(ep->l1);
3252 ASSERT(cnt == XFS_IFORK_NEXTENTS(ip, whichfork));
3253 xfs_btree_set_numrecs(ablock, cnt);
3256 * Fill in the root key and pointer.
3258 kp = XFS_BMBT_KEY_ADDR(mp, block, 1);
3259 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1);
3260 kp->br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(arp));
3261 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, xfs_bmbt_get_maxrecs(cur,
3262 be16_to_cpu(block->bb_level)));
3263 *pp = cpu_to_be64(args.fsbno);
3266 * Do all this logging at the end so that
3267 * the root is at the right level.
3269 xfs_btree_log_block(cur, abp, XFS_BB_ALL_BITS);
3270 xfs_btree_log_recs(cur, abp, 1, be16_to_cpu(ablock->bb_numrecs));
3271 ASSERT(*curp == NULL);
3273 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fbroot(whichfork);
3278 * Calculate the default attribute fork offset for newly created inodes.
3281 xfs_default_attroffset(
3282 struct xfs_inode *ip)
3284 struct xfs_mount *mp = ip->i_mount;
3287 if (mp->m_sb.sb_inodesize == 256) {
3288 offset = XFS_LITINO(mp) -
3289 XFS_BMDR_SPACE_CALC(MINABTPTRS);
3291 offset = XFS_BMDR_SPACE_CALC(6 * MINABTPTRS);
3294 ASSERT(offset < XFS_LITINO(mp));
3299 * Helper routine to reset inode di_forkoff field when switching
3300 * attribute fork from local to extent format - we reset it where
3301 * possible to make space available for inline data fork extents.
3304 xfs_bmap_forkoff_reset(
3309 if (whichfork == XFS_ATTR_FORK &&
3310 ip->i_d.di_format != XFS_DINODE_FMT_DEV &&
3311 ip->i_d.di_format != XFS_DINODE_FMT_UUID &&
3312 ip->i_d.di_format != XFS_DINODE_FMT_BTREE) {
3313 uint dfl_forkoff = xfs_default_attroffset(ip) >> 3;
3315 if (dfl_forkoff > ip->i_d.di_forkoff) {
3316 ip->i_d.di_forkoff = dfl_forkoff;
3317 ip->i_df.if_ext_max =
3318 XFS_IFORK_DSIZE(ip) / sizeof(xfs_bmbt_rec_t);
3319 ip->i_afp->if_ext_max =
3320 XFS_IFORK_ASIZE(ip) / sizeof(xfs_bmbt_rec_t);
3326 * Convert a local file to an extents file.
3327 * This code is out of bounds for data forks of regular files,
3328 * since the file data needs to get logged so things will stay consistent.
3329 * (The bmap-level manipulations are ok, though).
3331 STATIC int /* error */
3332 xfs_bmap_local_to_extents(
3333 xfs_trans_t *tp, /* transaction pointer */
3334 xfs_inode_t *ip, /* incore inode pointer */
3335 xfs_fsblock_t *firstblock, /* first block allocated in xaction */
3336 xfs_extlen_t total, /* total blocks needed by transaction */
3337 int *logflagsp, /* inode logging flags */
3338 int whichfork) /* data or attr fork */
3340 int error; /* error return value */
3341 int flags; /* logging flags returned */
3342 xfs_ifork_t *ifp; /* inode fork pointer */
3345 * We don't want to deal with the case of keeping inode data inline yet.
3346 * So sending the data fork of a regular inode is invalid.
3348 ASSERT(!((ip->i_d.di_mode & S_IFMT) == S_IFREG &&
3349 whichfork == XFS_DATA_FORK));
3350 ifp = XFS_IFORK_PTR(ip, whichfork);
3351 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
3354 if (ifp->if_bytes) {
3355 xfs_alloc_arg_t args; /* allocation arguments */
3356 xfs_buf_t *bp; /* buffer for extent block */
3357 xfs_bmbt_rec_host_t *ep;/* extent record pointer */
3360 args.mp = ip->i_mount;
3361 args.firstblock = *firstblock;
3362 ASSERT((ifp->if_flags &
3363 (XFS_IFINLINE|XFS_IFEXTENTS|XFS_IFEXTIREC)) == XFS_IFINLINE);
3365 * Allocate a block. We know we need only one, since the
3366 * file currently fits in an inode.
3368 if (*firstblock == NULLFSBLOCK) {
3369 args.fsbno = XFS_INO_TO_FSB(args.mp, ip->i_ino);
3370 args.type = XFS_ALLOCTYPE_START_BNO;
3372 args.fsbno = *firstblock;
3373 args.type = XFS_ALLOCTYPE_NEAR_BNO;
3376 args.mod = args.minleft = args.alignment = args.wasdel =
3377 args.isfl = args.minalignslop = 0;
3378 args.minlen = args.maxlen = args.prod = 1;
3379 if ((error = xfs_alloc_vextent(&args)))
3382 * Can't fail, the space was reserved.
3384 ASSERT(args.fsbno != NULLFSBLOCK);
3385 ASSERT(args.len == 1);
3386 *firstblock = args.fsbno;
3387 bp = xfs_btree_get_bufl(args.mp, tp, args.fsbno, 0);
3388 memcpy((char *)XFS_BUF_PTR(bp), ifp->if_u1.if_data,
3390 xfs_trans_log_buf(tp, bp, 0, ifp->if_bytes - 1);
3391 xfs_bmap_forkoff_reset(args.mp, ip, whichfork);
3392 xfs_idata_realloc(ip, -ifp->if_bytes, whichfork);
3393 xfs_iext_add(ifp, 0, 1);
3394 ep = xfs_iext_get_ext(ifp, 0);
3395 xfs_bmbt_set_allf(ep, 0, args.fsbno, 1, XFS_EXT_NORM);
3396 trace_xfs_bmap_post_update(ip, 0,
3397 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0,
3399 XFS_IFORK_NEXT_SET(ip, whichfork, 1);
3400 ip->i_d.di_nblocks = 1;
3401 xfs_trans_mod_dquot_byino(tp, ip,
3402 XFS_TRANS_DQ_BCOUNT, 1L);
3403 flags |= xfs_ilog_fext(whichfork);
3405 ASSERT(XFS_IFORK_NEXTENTS(ip, whichfork) == 0);
3406 xfs_bmap_forkoff_reset(ip->i_mount, ip, whichfork);
3408 ifp->if_flags &= ~XFS_IFINLINE;
3409 ifp->if_flags |= XFS_IFEXTENTS;
3410 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
3411 flags |= XFS_ILOG_CORE;
3418 * Search the extent records for the entry containing block bno.
3419 * If bno lies in a hole, point to the next entry. If bno lies
3420 * past eof, *eofp will be set, and *prevp will contain the last
3421 * entry (null if none). Else, *lastxp will be set to the index
3422 * of the found entry; *gotp will contain the entry.
3424 STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */
3425 xfs_bmap_search_multi_extents(
3426 xfs_ifork_t *ifp, /* inode fork pointer */
3427 xfs_fileoff_t bno, /* block number searched for */
3428 int *eofp, /* out: end of file found */
3429 xfs_extnum_t *lastxp, /* out: last extent index */
3430 xfs_bmbt_irec_t *gotp, /* out: extent entry found */
3431 xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */
3433 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
3434 xfs_extnum_t lastx; /* last extent index */
3437 * Initialize the extent entry structure to catch access to
3438 * uninitialized br_startblock field.
3440 gotp->br_startoff = 0xffa5a5a5a5a5a5a5LL;
3441 gotp->br_blockcount = 0xa55a5a5a5a5a5a5aLL;
3442 gotp->br_state = XFS_EXT_INVALID;
3444 gotp->br_startblock = 0xffffa5a5a5a5a5a5LL;
3446 gotp->br_startblock = 0xffffa5a5;
3448 prevp->br_startoff = NULLFILEOFF;
3450 ep = xfs_iext_bno_to_ext(ifp, bno, &lastx);
3452 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx - 1), prevp);
3454 if (lastx < (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))) {
3455 xfs_bmbt_get_all(ep, gotp);
3469 * Search the extents list for the inode, for the extent containing bno.
3470 * If bno lies in a hole, point to the next entry. If bno lies past eof,
3471 * *eofp will be set, and *prevp will contain the last entry (null if none).
3472 * Else, *lastxp will be set to the index of the found
3473 * entry; *gotp will contain the entry.
3475 STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */
3476 xfs_bmap_search_extents(
3477 xfs_inode_t *ip, /* incore inode pointer */
3478 xfs_fileoff_t bno, /* block number searched for */
3479 int fork, /* data or attr fork */
3480 int *eofp, /* out: end of file found */
3481 xfs_extnum_t *lastxp, /* out: last extent index */
3482 xfs_bmbt_irec_t *gotp, /* out: extent entry found */
3483 xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */
3485 xfs_ifork_t *ifp; /* inode fork pointer */
3486 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
3488 XFS_STATS_INC(xs_look_exlist);
3489 ifp = XFS_IFORK_PTR(ip, fork);
3491 ep = xfs_bmap_search_multi_extents(ifp, bno, eofp, lastxp, gotp, prevp);
3493 if (unlikely(!(gotp->br_startblock) && (*lastxp != NULLEXTNUM) &&
3494 !(XFS_IS_REALTIME_INODE(ip) && fork == XFS_DATA_FORK))) {
3495 xfs_alert_tag(ip->i_mount, XFS_PTAG_FSBLOCK_ZERO,
3496 "Access to block zero in inode %llu "
3497 "start_block: %llx start_off: %llx "
3498 "blkcnt: %llx extent-state: %x lastx: %x\n",
3499 (unsigned long long)ip->i_ino,
3500 (unsigned long long)gotp->br_startblock,
3501 (unsigned long long)gotp->br_startoff,
3502 (unsigned long long)gotp->br_blockcount,
3503 gotp->br_state, *lastxp);
3504 *lastxp = NULLEXTNUM;
3512 * Compute the worst-case number of indirect blocks that will be used
3513 * for ip's delayed extent of length "len".
3515 STATIC xfs_filblks_t
3516 xfs_bmap_worst_indlen(
3517 xfs_inode_t *ip, /* incore inode pointer */
3518 xfs_filblks_t len) /* delayed extent length */
3520 int level; /* btree level number */
3521 int maxrecs; /* maximum record count at this level */
3522 xfs_mount_t *mp; /* mount structure */
3523 xfs_filblks_t rval; /* return value */
3526 maxrecs = mp->m_bmap_dmxr[0];
3527 for (level = 0, rval = 0;
3528 level < XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK);
3531 do_div(len, maxrecs);
3534 return rval + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) -
3537 maxrecs = mp->m_bmap_dmxr[1];
3543 * Convert inode from non-attributed to attributed.
3544 * Must not be in a transaction, ip must not be locked.
3546 int /* error code */
3547 xfs_bmap_add_attrfork(
3548 xfs_inode_t *ip, /* incore inode pointer */
3549 int size, /* space new attribute needs */
3550 int rsvd) /* xact may use reserved blks */
3552 xfs_fsblock_t firstblock; /* 1st block/ag allocated */
3553 xfs_bmap_free_t flist; /* freed extent records */
3554 xfs_mount_t *mp; /* mount structure */
3555 xfs_trans_t *tp; /* transaction pointer */
3556 int blks; /* space reservation */
3557 int version = 1; /* superblock attr version */
3558 int committed; /* xaction was committed */
3559 int logflags; /* logging flags */
3560 int error; /* error return value */
3562 ASSERT(XFS_IFORK_Q(ip) == 0);
3563 ASSERT(ip->i_df.if_ext_max ==
3564 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t));
3567 ASSERT(!XFS_NOT_DQATTACHED(mp, ip));
3568 tp = xfs_trans_alloc(mp, XFS_TRANS_ADDAFORK);
3569 blks = XFS_ADDAFORK_SPACE_RES(mp);
3571 tp->t_flags |= XFS_TRANS_RESERVE;
3572 if ((error = xfs_trans_reserve(tp, blks, XFS_ADDAFORK_LOG_RES(mp), 0,
3573 XFS_TRANS_PERM_LOG_RES, XFS_ADDAFORK_LOG_COUNT)))
3575 xfs_ilock(ip, XFS_ILOCK_EXCL);
3576 error = xfs_trans_reserve_quota_nblks(tp, ip, blks, 0, rsvd ?
3577 XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
3578 XFS_QMOPT_RES_REGBLKS);
3580 xfs_iunlock(ip, XFS_ILOCK_EXCL);
3581 xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES);
3584 if (XFS_IFORK_Q(ip))
3586 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS) {
3588 * For inodes coming from pre-6.2 filesystems.
3590 ASSERT(ip->i_d.di_aformat == 0);
3591 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
3593 ASSERT(ip->i_d.di_anextents == 0);
3595 xfs_trans_ijoin_ref(tp, ip, XFS_ILOCK_EXCL);
3596 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
3598 switch (ip->i_d.di_format) {
3599 case XFS_DINODE_FMT_DEV:
3600 ip->i_d.di_forkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
3602 case XFS_DINODE_FMT_UUID:
3603 ip->i_d.di_forkoff = roundup(sizeof(uuid_t), 8) >> 3;
3605 case XFS_DINODE_FMT_LOCAL:
3606 case XFS_DINODE_FMT_EXTENTS:
3607 case XFS_DINODE_FMT_BTREE:
3608 ip->i_d.di_forkoff = xfs_attr_shortform_bytesfit(ip, size);
3609 if (!ip->i_d.di_forkoff)
3610 ip->i_d.di_forkoff = xfs_default_attroffset(ip) >> 3;
3611 else if (mp->m_flags & XFS_MOUNT_ATTR2)
3616 error = XFS_ERROR(EINVAL);
3619 ip->i_df.if_ext_max =
3620 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t);
3621 ASSERT(ip->i_afp == NULL);
3622 ip->i_afp = kmem_zone_zalloc(xfs_ifork_zone, KM_SLEEP);
3623 ip->i_afp->if_ext_max =
3624 XFS_IFORK_ASIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t);
3625 ip->i_afp->if_flags = XFS_IFEXTENTS;
3627 xfs_bmap_init(&flist, &firstblock);
3628 switch (ip->i_d.di_format) {
3629 case XFS_DINODE_FMT_LOCAL:
3630 error = xfs_bmap_add_attrfork_local(tp, ip, &firstblock, &flist,
3633 case XFS_DINODE_FMT_EXTENTS:
3634 error = xfs_bmap_add_attrfork_extents(tp, ip, &firstblock,
3637 case XFS_DINODE_FMT_BTREE:
3638 error = xfs_bmap_add_attrfork_btree(tp, ip, &firstblock, &flist,
3646 xfs_trans_log_inode(tp, ip, logflags);
3649 if (!xfs_sb_version_hasattr(&mp->m_sb) ||
3650 (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2)) {
3651 __int64_t sbfields = 0;
3653 spin_lock(&mp->m_sb_lock);
3654 if (!xfs_sb_version_hasattr(&mp->m_sb)) {
3655 xfs_sb_version_addattr(&mp->m_sb);
3656 sbfields |= XFS_SB_VERSIONNUM;
3658 if (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2) {
3659 xfs_sb_version_addattr2(&mp->m_sb);
3660 sbfields |= (XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
3663 spin_unlock(&mp->m_sb_lock);
3664 xfs_mod_sb(tp, sbfields);
3666 spin_unlock(&mp->m_sb_lock);
3668 if ((error = xfs_bmap_finish(&tp, &flist, &committed)))
3670 error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
3671 ASSERT(ip->i_df.if_ext_max ==
3672 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t));
3675 xfs_bmap_cancel(&flist);
3677 xfs_iunlock(ip, XFS_ILOCK_EXCL);
3679 xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
3680 ASSERT(ip->i_df.if_ext_max ==
3681 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t));
3686 * Add the extent to the list of extents to be free at transaction end.
3687 * The list is maintained sorted (by block number).
3692 xfs_fsblock_t bno, /* fs block number of extent */
3693 xfs_filblks_t len, /* length of extent */
3694 xfs_bmap_free_t *flist, /* list of extents */
3695 xfs_mount_t *mp) /* mount point structure */
3697 xfs_bmap_free_item_t *cur; /* current (next) element */
3698 xfs_bmap_free_item_t *new; /* new element */
3699 xfs_bmap_free_item_t *prev; /* previous element */
3701 xfs_agnumber_t agno;
3702 xfs_agblock_t agbno;
3704 ASSERT(bno != NULLFSBLOCK);
3706 ASSERT(len <= MAXEXTLEN);
3707 ASSERT(!isnullstartblock(bno));
3708 agno = XFS_FSB_TO_AGNO(mp, bno);
3709 agbno = XFS_FSB_TO_AGBNO(mp, bno);
3710 ASSERT(agno < mp->m_sb.sb_agcount);
3711 ASSERT(agbno < mp->m_sb.sb_agblocks);
3712 ASSERT(len < mp->m_sb.sb_agblocks);
3713 ASSERT(agbno + len <= mp->m_sb.sb_agblocks);
3715 ASSERT(xfs_bmap_free_item_zone != NULL);
3716 new = kmem_zone_alloc(xfs_bmap_free_item_zone, KM_SLEEP);
3717 new->xbfi_startblock = bno;
3718 new->xbfi_blockcount = (xfs_extlen_t)len;
3719 for (prev = NULL, cur = flist->xbf_first;
3721 prev = cur, cur = cur->xbfi_next) {
3722 if (cur->xbfi_startblock >= bno)
3726 prev->xbfi_next = new;
3728 flist->xbf_first = new;
3729 new->xbfi_next = cur;
3734 * Compute and fill in the value of the maximum depth of a bmap btree
3735 * in this filesystem. Done once, during mount.
3738 xfs_bmap_compute_maxlevels(
3739 xfs_mount_t *mp, /* file system mount structure */
3740 int whichfork) /* data or attr fork */
3742 int level; /* btree level */
3743 uint maxblocks; /* max blocks at this level */
3744 uint maxleafents; /* max leaf entries possible */
3745 int maxrootrecs; /* max records in root block */
3746 int minleafrecs; /* min records in leaf block */
3747 int minnoderecs; /* min records in node block */
3748 int sz; /* root block size */
3751 * The maximum number of extents in a file, hence the maximum
3752 * number of leaf entries, is controlled by the type of di_nextents
3753 * (a signed 32-bit number, xfs_extnum_t), or by di_anextents
3754 * (a signed 16-bit number, xfs_aextnum_t).
3756 * Note that we can no longer assume that if we are in ATTR1 that
3757 * the fork offset of all the inodes will be
3758 * (xfs_default_attroffset(ip) >> 3) because we could have mounted
3759 * with ATTR2 and then mounted back with ATTR1, keeping the
3760 * di_forkoff's fixed but probably at various positions. Therefore,
3761 * for both ATTR1 and ATTR2 we have to assume the worst case scenario
3762 * of a minimum size available.
3764 if (whichfork == XFS_DATA_FORK) {
3765 maxleafents = MAXEXTNUM;
3766 sz = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
3768 maxleafents = MAXAEXTNUM;
3769 sz = XFS_BMDR_SPACE_CALC(MINABTPTRS);
3771 maxrootrecs = xfs_bmdr_maxrecs(mp, sz, 0);
3772 minleafrecs = mp->m_bmap_dmnr[0];
3773 minnoderecs = mp->m_bmap_dmnr[1];
3774 maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs;
3775 for (level = 1; maxblocks > 1; level++) {
3776 if (maxblocks <= maxrootrecs)
3779 maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs;
3781 mp->m_bm_maxlevels[whichfork] = level;
3785 * Routine to be called at transaction's end by xfs_bmapi, xfs_bunmapi
3786 * caller. Frees all the extents that need freeing, which must be done
3787 * last due to locking considerations. We never free any extents in
3788 * the first transaction. This is to allow the caller to make the first
3789 * transaction a synchronous one so that the pointers to the data being
3790 * broken in this transaction will be permanent before the data is actually
3791 * freed. This is necessary to prevent blocks from being reallocated
3792 * and written to before the free and reallocation are actually permanent.
3793 * We do not just make the first transaction synchronous here, because
3794 * there are more efficient ways to gain the same protection in some cases
3795 * (see the file truncation code).
3797 * Return 1 if the given transaction was committed and a new one
3798 * started, and 0 otherwise in the committed parameter.
3803 xfs_trans_t **tp, /* transaction pointer addr */
3804 xfs_bmap_free_t *flist, /* i/o: list extents to free */
3805 int *committed) /* xact committed or not */
3807 xfs_efd_log_item_t *efd; /* extent free data */
3808 xfs_efi_log_item_t *efi; /* extent free intention */
3809 int error; /* error return value */
3810 xfs_bmap_free_item_t *free; /* free extent item */
3811 unsigned int logres; /* new log reservation */
3812 unsigned int logcount; /* new log count */
3813 xfs_mount_t *mp; /* filesystem mount structure */
3814 xfs_bmap_free_item_t *next; /* next item on free list */
3815 xfs_trans_t *ntp; /* new transaction pointer */
3817 ASSERT((*tp)->t_flags & XFS_TRANS_PERM_LOG_RES);
3818 if (flist->xbf_count == 0) {
3823 efi = xfs_trans_get_efi(ntp, flist->xbf_count);
3824 for (free = flist->xbf_first; free; free = free->xbfi_next)
3825 xfs_trans_log_efi_extent(ntp, efi, free->xbfi_startblock,
3826 free->xbfi_blockcount);
3827 logres = ntp->t_log_res;
3828 logcount = ntp->t_log_count;
3829 ntp = xfs_trans_dup(*tp);
3830 error = xfs_trans_commit(*tp, 0);
3834 * We have a new transaction, so we should return committed=1,
3835 * even though we're returning an error.
3841 * transaction commit worked ok so we can drop the extra ticket
3842 * reference that we gained in xfs_trans_dup()
3844 xfs_log_ticket_put(ntp->t_ticket);
3846 if ((error = xfs_trans_reserve(ntp, 0, logres, 0, XFS_TRANS_PERM_LOG_RES,
3849 efd = xfs_trans_get_efd(ntp, efi, flist->xbf_count);
3850 for (free = flist->xbf_first; free != NULL; free = next) {
3851 next = free->xbfi_next;
3852 if ((error = xfs_free_extent(ntp, free->xbfi_startblock,
3853 free->xbfi_blockcount))) {
3855 * The bmap free list will be cleaned up at a
3856 * higher level. The EFI will be canceled when
3857 * this transaction is aborted.
3858 * Need to force shutdown here to make sure it
3859 * happens, since this transaction may not be
3863 if (!XFS_FORCED_SHUTDOWN(mp))
3864 xfs_force_shutdown(mp,
3865 (error == EFSCORRUPTED) ?
3866 SHUTDOWN_CORRUPT_INCORE :
3867 SHUTDOWN_META_IO_ERROR);
3870 xfs_trans_log_efd_extent(ntp, efd, free->xbfi_startblock,
3871 free->xbfi_blockcount);
3872 xfs_bmap_del_free(flist, NULL, free);
3878 * Free up any items left in the list.
3882 xfs_bmap_free_t *flist) /* list of bmap_free_items */
3884 xfs_bmap_free_item_t *free; /* free list item */
3885 xfs_bmap_free_item_t *next;
3887 if (flist->xbf_count == 0)
3889 ASSERT(flist->xbf_first != NULL);
3890 for (free = flist->xbf_first; free; free = next) {
3891 next = free->xbfi_next;
3892 xfs_bmap_del_free(flist, NULL, free);
3894 ASSERT(flist->xbf_count == 0);
3898 * Returns the file-relative block number of the first unused block(s)
3899 * in the file with at least "len" logically contiguous blocks free.
3900 * This is the lowest-address hole if the file has holes, else the first block
3901 * past the end of file.
3902 * Return 0 if the file is currently local (in-inode).
3905 xfs_bmap_first_unused(
3906 xfs_trans_t *tp, /* transaction pointer */
3907 xfs_inode_t *ip, /* incore inode */
3908 xfs_extlen_t len, /* size of hole to find */
3909 xfs_fileoff_t *first_unused, /* unused block */
3910 int whichfork) /* data or attr fork */
3912 int error; /* error return value */
3913 int idx; /* extent record index */
3914 xfs_ifork_t *ifp; /* inode fork pointer */
3915 xfs_fileoff_t lastaddr; /* last block number seen */
3916 xfs_fileoff_t lowest; /* lowest useful block */
3917 xfs_fileoff_t max; /* starting useful block */
3918 xfs_fileoff_t off; /* offset for this block */
3919 xfs_extnum_t nextents; /* number of extent entries */
3921 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE ||
3922 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS ||
3923 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL);
3924 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
3928 ifp = XFS_IFORK_PTR(ip, whichfork);
3929 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
3930 (error = xfs_iread_extents(tp, ip, whichfork)))
3932 lowest = *first_unused;
3933 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
3934 for (idx = 0, lastaddr = 0, max = lowest; idx < nextents; idx++) {
3935 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx);
3936 off = xfs_bmbt_get_startoff(ep);
3938 * See if the hole before this extent will work.
3940 if (off >= lowest + len && off - max >= len) {
3941 *first_unused = max;
3944 lastaddr = off + xfs_bmbt_get_blockcount(ep);
3945 max = XFS_FILEOFF_MAX(lastaddr, lowest);
3947 *first_unused = max;
3952 * Returns the file-relative block number of the last block + 1 before
3953 * last_block (input value) in the file.
3954 * This is not based on i_size, it is based on the extent records.
3955 * Returns 0 for local files, as they do not have extent records.
3958 xfs_bmap_last_before(
3959 xfs_trans_t *tp, /* transaction pointer */
3960 xfs_inode_t *ip, /* incore inode */
3961 xfs_fileoff_t *last_block, /* last block */
3962 int whichfork) /* data or attr fork */
3964 xfs_fileoff_t bno; /* input file offset */
3965 int eof; /* hit end of file */
3966 xfs_bmbt_rec_host_t *ep; /* pointer to last extent */
3967 int error; /* error return value */
3968 xfs_bmbt_irec_t got; /* current extent value */
3969 xfs_ifork_t *ifp; /* inode fork pointer */
3970 xfs_extnum_t lastx; /* last extent used */
3971 xfs_bmbt_irec_t prev; /* previous extent value */
3973 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
3974 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
3975 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL)
3976 return XFS_ERROR(EIO);
3977 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
3981 ifp = XFS_IFORK_PTR(ip, whichfork);
3982 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
3983 (error = xfs_iread_extents(tp, ip, whichfork)))
3985 bno = *last_block - 1;
3986 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got,
3988 if (eof || xfs_bmbt_get_startoff(ep) > bno) {
3989 if (prev.br_startoff == NULLFILEOFF)
3992 *last_block = prev.br_startoff + prev.br_blockcount;
3995 * Otherwise *last_block is already the right answer.
4001 * Returns the file-relative block number of the first block past eof in
4002 * the file. This is not based on i_size, it is based on the extent records.
4003 * Returns 0 for local files, as they do not have extent records.
4006 xfs_bmap_last_offset(
4007 xfs_trans_t *tp, /* transaction pointer */
4008 xfs_inode_t *ip, /* incore inode */
4009 xfs_fileoff_t *last_block, /* last block */
4010 int whichfork) /* data or attr fork */
4012 xfs_bmbt_rec_host_t *ep; /* pointer to last extent */
4013 int error; /* error return value */
4014 xfs_ifork_t *ifp; /* inode fork pointer */
4015 xfs_extnum_t nextents; /* number of extent entries */
4017 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
4018 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4019 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL)
4020 return XFS_ERROR(EIO);
4021 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
4025 ifp = XFS_IFORK_PTR(ip, whichfork);
4026 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
4027 (error = xfs_iread_extents(tp, ip, whichfork)))
4029 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
4034 ep = xfs_iext_get_ext(ifp, nextents - 1);
4035 *last_block = xfs_bmbt_get_startoff(ep) + xfs_bmbt_get_blockcount(ep);
4040 * Returns whether the selected fork of the inode has exactly one
4041 * block or not. For the data fork we check this matches di_size,
4042 * implying the file's range is 0..bsize-1.
4044 int /* 1=>1 block, 0=>otherwise */
4046 xfs_inode_t *ip, /* incore inode */
4047 int whichfork) /* data or attr fork */
4049 xfs_bmbt_rec_host_t *ep; /* ptr to fork's extent */
4050 xfs_ifork_t *ifp; /* inode fork pointer */
4051 int rval; /* return value */
4052 xfs_bmbt_irec_t s; /* internal version of extent */
4055 if (whichfork == XFS_DATA_FORK) {
4056 return ((ip->i_d.di_mode & S_IFMT) == S_IFREG) ?
4057 (ip->i_size == ip->i_mount->m_sb.sb_blocksize) :
4058 (ip->i_d.di_size == ip->i_mount->m_sb.sb_blocksize);
4061 if (XFS_IFORK_NEXTENTS(ip, whichfork) != 1)
4063 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
4065 ifp = XFS_IFORK_PTR(ip, whichfork);
4066 ASSERT(ifp->if_flags & XFS_IFEXTENTS);
4067 ep = xfs_iext_get_ext(ifp, 0);
4068 xfs_bmbt_get_all(ep, &s);
4069 rval = s.br_startoff == 0 && s.br_blockcount == 1;
4070 if (rval && whichfork == XFS_DATA_FORK)
4071 ASSERT(ip->i_size == ip->i_mount->m_sb.sb_blocksize);
4076 xfs_bmap_sanity_check(
4077 struct xfs_mount *mp,
4081 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
4083 if (be32_to_cpu(block->bb_magic) != XFS_BMAP_MAGIC ||
4084 be16_to_cpu(block->bb_level) != level ||
4085 be16_to_cpu(block->bb_numrecs) == 0 ||
4086 be16_to_cpu(block->bb_numrecs) > mp->m_bmap_dmxr[level != 0])
4092 * Read in the extents to if_extents.
4093 * All inode fields are set up by caller, we just traverse the btree
4094 * and copy the records in. If the file system cannot contain unwritten
4095 * extents, the records are checked for no "state" flags.
4098 xfs_bmap_read_extents(
4099 xfs_trans_t *tp, /* transaction pointer */
4100 xfs_inode_t *ip, /* incore inode */
4101 int whichfork) /* data or attr fork */
4103 struct xfs_btree_block *block; /* current btree block */
4104 xfs_fsblock_t bno; /* block # of "block" */
4105 xfs_buf_t *bp; /* buffer for "block" */
4106 int error; /* error return value */
4107 xfs_exntfmt_t exntf; /* XFS_EXTFMT_NOSTATE, if checking */
4108 xfs_extnum_t i, j; /* index into the extents list */
4109 xfs_ifork_t *ifp; /* fork structure */
4110 int level; /* btree level, for checking */
4111 xfs_mount_t *mp; /* file system mount structure */
4112 __be64 *pp; /* pointer to block address */
4114 xfs_extnum_t room; /* number of entries there's room for */
4118 ifp = XFS_IFORK_PTR(ip, whichfork);
4119 exntf = (whichfork != XFS_DATA_FORK) ? XFS_EXTFMT_NOSTATE :
4120 XFS_EXTFMT_INODE(ip);
4121 block = ifp->if_broot;
4123 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
4125 level = be16_to_cpu(block->bb_level);
4127 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
4128 bno = be64_to_cpu(*pp);
4129 ASSERT(bno != NULLDFSBNO);
4130 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
4131 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
4133 * Go down the tree until leaf level is reached, following the first
4134 * pointer (leftmost) at each level.
4136 while (level-- > 0) {
4137 if ((error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
4138 XFS_BMAP_BTREE_REF)))
4140 block = XFS_BUF_TO_BLOCK(bp);
4141 XFS_WANT_CORRUPTED_GOTO(
4142 xfs_bmap_sanity_check(mp, bp, level),
4146 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
4147 bno = be64_to_cpu(*pp);
4148 XFS_WANT_CORRUPTED_GOTO(XFS_FSB_SANITY_CHECK(mp, bno), error0);
4149 xfs_trans_brelse(tp, bp);
4152 * Here with bp and block set to the leftmost leaf node in the tree.
4154 room = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
4157 * Loop over all leaf nodes. Copy information to the extent records.
4160 xfs_bmbt_rec_t *frp;
4161 xfs_fsblock_t nextbno;
4162 xfs_extnum_t num_recs;
4166 num_recs = xfs_btree_get_numrecs(block);
4167 if (unlikely(i + num_recs > room)) {
4168 ASSERT(i + num_recs <= room);
4169 xfs_warn(ip->i_mount,
4170 "corrupt dinode %Lu, (btree extents).",
4171 (unsigned long long) ip->i_ino);
4172 XFS_CORRUPTION_ERROR("xfs_bmap_read_extents(1)",
4173 XFS_ERRLEVEL_LOW, ip->i_mount, block);
4176 XFS_WANT_CORRUPTED_GOTO(
4177 xfs_bmap_sanity_check(mp, bp, 0),
4180 * Read-ahead the next leaf block, if any.
4182 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
4183 if (nextbno != NULLFSBLOCK)
4184 xfs_btree_reada_bufl(mp, nextbno, 1);
4186 * Copy records into the extent records.
4188 frp = XFS_BMBT_REC_ADDR(mp, block, 1);
4190 for (j = 0; j < num_recs; j++, i++, frp++) {
4191 xfs_bmbt_rec_host_t *trp = xfs_iext_get_ext(ifp, i);
4192 trp->l0 = be64_to_cpu(frp->l0);
4193 trp->l1 = be64_to_cpu(frp->l1);
4195 if (exntf == XFS_EXTFMT_NOSTATE) {
4197 * Check all attribute bmap btree records and
4198 * any "older" data bmap btree records for a
4199 * set bit in the "extent flag" position.
4201 if (unlikely(xfs_check_nostate_extents(ifp,
4202 start, num_recs))) {
4203 XFS_ERROR_REPORT("xfs_bmap_read_extents(2)",
4209 xfs_trans_brelse(tp, bp);
4212 * If we've reached the end, stop.
4214 if (bno == NULLFSBLOCK)
4216 if ((error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
4217 XFS_BMAP_BTREE_REF)))
4219 block = XFS_BUF_TO_BLOCK(bp);
4221 ASSERT(i == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)));
4222 ASSERT(i == XFS_IFORK_NEXTENTS(ip, whichfork));
4223 XFS_BMAP_TRACE_EXLIST(ip, i, whichfork);
4226 xfs_trans_brelse(tp, bp);
4227 return XFS_ERROR(EFSCORRUPTED);
4232 * Add bmap trace insert entries for all the contents of the extent records.
4235 xfs_bmap_trace_exlist(
4236 xfs_inode_t *ip, /* incore inode pointer */
4237 xfs_extnum_t cnt, /* count of entries in the list */
4238 int whichfork, /* data or attr fork */
4239 unsigned long caller_ip)
4241 xfs_extnum_t idx; /* extent record index */
4242 xfs_ifork_t *ifp; /* inode fork pointer */
4245 if (whichfork == XFS_ATTR_FORK)
4246 state |= BMAP_ATTRFORK;
4248 ifp = XFS_IFORK_PTR(ip, whichfork);
4249 ASSERT(cnt == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)));
4250 for (idx = 0; idx < cnt; idx++)
4251 trace_xfs_extlist(ip, idx, whichfork, caller_ip);
4255 * Validate that the bmbt_irecs being returned from bmapi are valid
4256 * given the callers original parameters. Specifically check the
4257 * ranges of the returned irecs to ensure that they only extent beyond
4258 * the given parameters if the XFS_BMAPI_ENTIRE flag was set.
4261 xfs_bmap_validate_ret(
4265 xfs_bmbt_irec_t *mval,
4269 int i; /* index to map values */
4271 ASSERT(ret_nmap <= nmap);
4273 for (i = 0; i < ret_nmap; i++) {
4274 ASSERT(mval[i].br_blockcount > 0);
4275 if (!(flags & XFS_BMAPI_ENTIRE)) {
4276 ASSERT(mval[i].br_startoff >= bno);
4277 ASSERT(mval[i].br_blockcount <= len);
4278 ASSERT(mval[i].br_startoff + mval[i].br_blockcount <=
4281 ASSERT(mval[i].br_startoff < bno + len);
4282 ASSERT(mval[i].br_startoff + mval[i].br_blockcount >
4286 mval[i - 1].br_startoff + mval[i - 1].br_blockcount ==
4287 mval[i].br_startoff);
4288 if ((flags & XFS_BMAPI_WRITE) && !(flags & XFS_BMAPI_DELAY))
4289 ASSERT(mval[i].br_startblock != DELAYSTARTBLOCK &&
4290 mval[i].br_startblock != HOLESTARTBLOCK);
4291 ASSERT(mval[i].br_state == XFS_EXT_NORM ||
4292 mval[i].br_state == XFS_EXT_UNWRITTEN);
4299 * Map file blocks to filesystem blocks.
4300 * File range is given by the bno/len pair.
4301 * Adds blocks to file if a write ("flags & XFS_BMAPI_WRITE" set)
4302 * into a hole or past eof.
4303 * Only allocates blocks from a single allocation group,
4304 * to avoid locking problems.
4305 * The returned value in "firstblock" from the first call in a transaction
4306 * must be remembered and presented to subsequent calls in "firstblock".
4307 * An upper bound for the number of blocks to be allocated is supplied to
4308 * the first call in "total"; if no allocation group has that many free
4309 * blocks then the call will fail (return NULLFSBLOCK in "firstblock").
4313 xfs_trans_t *tp, /* transaction pointer */
4314 xfs_inode_t *ip, /* incore inode */
4315 xfs_fileoff_t bno, /* starting file offs. mapped */
4316 xfs_filblks_t len, /* length to map in file */
4317 int flags, /* XFS_BMAPI_... */
4318 xfs_fsblock_t *firstblock, /* first allocated block
4319 controls a.g. for allocs */
4320 xfs_extlen_t total, /* total blocks needed */
4321 xfs_bmbt_irec_t *mval, /* output: map values */
4322 int *nmap, /* i/o: mval size/count */
4323 xfs_bmap_free_t *flist) /* i/o: list extents to free */
4325 xfs_fsblock_t abno; /* allocated block number */
4326 xfs_extlen_t alen; /* allocated extent length */
4327 xfs_fileoff_t aoff; /* allocated file offset */
4328 xfs_bmalloca_t bma = { 0 }; /* args for xfs_bmap_alloc */
4329 xfs_btree_cur_t *cur; /* bmap btree cursor */
4330 xfs_fileoff_t end; /* end of mapped file region */
4331 int eof; /* we've hit the end of extents */
4332 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
4333 int error; /* error return */
4334 xfs_bmbt_irec_t got; /* current file extent record */
4335 xfs_ifork_t *ifp; /* inode fork pointer */
4336 xfs_extlen_t indlen; /* indirect blocks length */
4337 xfs_extnum_t lastx; /* last useful extent number */
4338 int logflags; /* flags for transaction logging */
4339 xfs_extlen_t minleft; /* min blocks left after allocation */
4340 xfs_extlen_t minlen; /* min allocation size */
4341 xfs_mount_t *mp; /* xfs mount structure */
4342 int n; /* current extent index */
4343 int nallocs; /* number of extents alloc'd */
4344 xfs_extnum_t nextents; /* number of extents in file */
4345 xfs_fileoff_t obno; /* old block number (offset) */
4346 xfs_bmbt_irec_t prev; /* previous file extent record */
4347 int tmp_logflags; /* temp flags holder */
4348 int whichfork; /* data or attr fork */
4349 char inhole; /* current location is hole in file */
4350 char wasdelay; /* old extent was delayed */
4351 char wr; /* this is a write request */
4352 char rt; /* this is a realtime file */
4354 xfs_fileoff_t orig_bno; /* original block number value */
4355 int orig_flags; /* original flags arg value */
4356 xfs_filblks_t orig_len; /* original value of len arg */
4357 xfs_bmbt_irec_t *orig_mval; /* original value of mval */
4358 int orig_nmap; /* original value of *nmap */
4367 ASSERT(*nmap <= XFS_BMAP_MAX_NMAP || !(flags & XFS_BMAPI_WRITE));
4368 whichfork = (flags & XFS_BMAPI_ATTRFORK) ?
4369 XFS_ATTR_FORK : XFS_DATA_FORK;
4371 if (unlikely(XFS_TEST_ERROR(
4372 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4373 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
4374 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL),
4375 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) {
4376 XFS_ERROR_REPORT("xfs_bmapi", XFS_ERRLEVEL_LOW, mp);
4377 return XFS_ERROR(EFSCORRUPTED);
4379 if (XFS_FORCED_SHUTDOWN(mp))
4380 return XFS_ERROR(EIO);
4381 rt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
4382 ifp = XFS_IFORK_PTR(ip, whichfork);
4383 ASSERT(ifp->if_ext_max ==
4384 XFS_IFORK_SIZE(ip, whichfork) / (uint)sizeof(xfs_bmbt_rec_t));
4385 if ((wr = (flags & XFS_BMAPI_WRITE)) != 0)
4386 XFS_STATS_INC(xs_blk_mapw);
4388 XFS_STATS_INC(xs_blk_mapr);
4390 * IGSTATE flag is used to combine extents which
4391 * differ only due to the state of the extents.
4392 * This technique is used from xfs_getbmap()
4393 * when the caller does not wish to see the
4394 * separation (which is the default).
4396 * This technique is also used when writing a
4397 * buffer which has been partially written,
4398 * (usually by being flushed during a chunkread),
4399 * to ensure one write takes place. This also
4400 * prevents a change in the xfs inode extents at
4401 * this time, intentionally. This change occurs
4402 * on completion of the write operation, in
4403 * xfs_strat_comp(), where the xfs_bmapi() call
4404 * is transactioned, and the extents combined.
4406 if ((flags & XFS_BMAPI_IGSTATE) && wr) /* if writing unwritten space */
4407 wr = 0; /* no allocations are allowed */
4408 ASSERT(wr || !(flags & XFS_BMAPI_DELAY));
4412 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
4414 if ((error = xfs_bmap_local_to_extents(tp, ip,
4415 firstblock, total, &logflags, whichfork)))
4418 if (wr && *firstblock == NULLFSBLOCK) {
4419 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE)
4420 minleft = be16_to_cpu(ifp->if_broot->bb_level) + 1;
4425 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
4426 (error = xfs_iread_extents(tp, ip, whichfork)))
4428 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got,
4430 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
4436 while (bno < end && n < *nmap) {
4438 * Reading past eof, act as though there's a hole
4442 got.br_startoff = end;
4443 inhole = eof || got.br_startoff > bno;
4444 wasdelay = wr && !inhole && !(flags & XFS_BMAPI_DELAY) &&
4445 isnullstartblock(got.br_startblock);
4447 * First, deal with the hole before the allocated space
4448 * that we found, if any.
4450 if (wr && (inhole || wasdelay)) {
4452 * For the wasdelay case, we could also just
4453 * allocate the stuff asked for in this bmap call
4454 * but that wouldn't be as good.
4457 alen = (xfs_extlen_t)got.br_blockcount;
4458 aoff = got.br_startoff;
4459 if (lastx != NULLEXTNUM && lastx) {
4460 ep = xfs_iext_get_ext(ifp, lastx - 1);
4461 xfs_bmbt_get_all(ep, &prev);
4464 alen = (xfs_extlen_t)
4465 XFS_FILBLKS_MIN(len, MAXEXTLEN);
4467 alen = (xfs_extlen_t)
4468 XFS_FILBLKS_MIN(alen,
4469 got.br_startoff - bno);
4472 minlen = (flags & XFS_BMAPI_CONTIG) ? alen : 1;
4473 if (flags & XFS_BMAPI_DELAY) {
4476 /* Figure out the extent size, adjust alen */
4477 extsz = xfs_get_extsz_hint(ip);
4480 * make sure we don't exceed a single
4481 * extent length when we align the
4482 * extent by reducing length we are
4483 * going to allocate by the maximum
4484 * amount extent size aligment may
4487 alen = XFS_FILBLKS_MIN(len,
4488 MAXEXTLEN - (2 * extsz - 1));
4489 error = xfs_bmap_extsize_align(mp,
4492 flags&XFS_BMAPI_DELAY,
4493 flags&XFS_BMAPI_CONVERT,
4499 extsz = alen / mp->m_sb.sb_rextsize;
4502 * Make a transaction-less quota reservation for
4503 * delayed allocation blocks. This number gets
4504 * adjusted later. We return if we haven't
4505 * allocated blocks already inside this loop.
4507 error = xfs_trans_reserve_quota_nblks(
4508 NULL, ip, (long)alen, 0,
4509 rt ? XFS_QMOPT_RES_RTBLKS :
4510 XFS_QMOPT_RES_REGBLKS);
4514 ASSERT(cur == NULL);
4521 * Split changing sb for alen and indlen since
4522 * they could be coming from different places.
4524 indlen = (xfs_extlen_t)
4525 xfs_bmap_worst_indlen(ip, alen);
4529 error = xfs_mod_incore_sb(mp,
4531 -((int64_t)extsz), 0);
4533 error = xfs_icsb_modify_counters(mp,
4535 -((int64_t)alen), 0);
4538 error = xfs_icsb_modify_counters(mp,
4540 -((int64_t)indlen), 0);
4542 xfs_mod_incore_sb(mp,
4546 xfs_icsb_modify_counters(mp,
4552 if (XFS_IS_QUOTA_ON(mp))
4553 /* unreserve the blocks now */
4555 xfs_trans_unreserve_quota_nblks(
4558 XFS_QMOPT_RES_RTBLKS :
4559 XFS_QMOPT_RES_REGBLKS);
4563 ip->i_delayed_blks += alen;
4564 abno = nullstartblock(indlen);
4567 * If first time, allocate and fill in
4568 * once-only bma fields.
4570 if (bma.ip == NULL) {
4578 /* Indicate if this is the first user data
4579 * in the file, or just any user data.
4581 if (!(flags & XFS_BMAPI_METADATA)) {
4582 bma.userdata = (aoff == 0) ?
4583 XFS_ALLOC_INITIAL_USER_DATA :
4587 * Fill in changeable bma fields.
4590 bma.firstblock = *firstblock;
4593 bma.conv = !!(flags & XFS_BMAPI_CONVERT);
4594 bma.wasdel = wasdelay;
4595 bma.minlen = minlen;
4596 bma.low = flist->xbf_low;
4597 bma.minleft = minleft;
4599 * Only want to do the alignment at the
4600 * eof if it is userdata and allocation length
4601 * is larger than a stripe unit.
4603 if (mp->m_dalign && alen >= mp->m_dalign &&
4604 (!(flags & XFS_BMAPI_METADATA)) &&
4605 (whichfork == XFS_DATA_FORK)) {
4606 if ((error = xfs_bmap_isaeof(ip, aoff,
4607 whichfork, &bma.aeof)))
4614 if ((error = xfs_bmap_alloc(&bma)))
4617 * Copy out result fields.
4620 if ((flist->xbf_low = bma.low))
4624 ASSERT(*firstblock == NULLFSBLOCK ||
4625 XFS_FSB_TO_AGNO(mp, *firstblock) ==
4626 XFS_FSB_TO_AGNO(mp, bma.firstblock) ||
4628 XFS_FSB_TO_AGNO(mp, *firstblock) <
4629 XFS_FSB_TO_AGNO(mp, bma.firstblock)));
4630 *firstblock = bma.firstblock;
4632 cur->bc_private.b.firstblock =
4634 if (abno == NULLFSBLOCK)
4636 if ((ifp->if_flags & XFS_IFBROOT) && !cur) {
4637 cur = xfs_bmbt_init_cursor(mp, tp,
4639 cur->bc_private.b.firstblock =
4641 cur->bc_private.b.flist = flist;
4644 * Bump the number of extents we've allocated
4650 cur->bc_private.b.flags =
4651 wasdelay ? XFS_BTCUR_BPRV_WASDEL : 0;
4652 got.br_startoff = aoff;
4653 got.br_startblock = abno;
4654 got.br_blockcount = alen;
4655 got.br_state = XFS_EXT_NORM; /* assume normal */
4657 * Determine state of extent, and the filesystem.
4658 * A wasdelay extent has been initialized, so
4659 * shouldn't be flagged as unwritten.
4661 if (wr && xfs_sb_version_hasextflgbit(&mp->m_sb)) {
4662 if (!wasdelay && (flags & XFS_BMAPI_PREALLOC))
4663 got.br_state = XFS_EXT_UNWRITTEN;
4665 error = xfs_bmap_add_extent(ip, &lastx, &cur, &got,
4666 firstblock, flist, &tmp_logflags,
4668 logflags |= tmp_logflags;
4671 ep = xfs_iext_get_ext(ifp, lastx);
4672 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
4673 xfs_bmbt_get_all(ep, &got);
4674 ASSERT(got.br_startoff <= aoff);
4675 ASSERT(got.br_startoff + got.br_blockcount >=
4678 if (flags & XFS_BMAPI_DELAY) {
4679 ASSERT(isnullstartblock(got.br_startblock));
4680 ASSERT(startblockval(got.br_startblock) > 0);
4682 ASSERT(got.br_state == XFS_EXT_NORM ||
4683 got.br_state == XFS_EXT_UNWRITTEN);
4686 * Fall down into the found allocated space case.
4688 } else if (inhole) {
4690 * Reading in a hole.
4692 mval->br_startoff = bno;
4693 mval->br_startblock = HOLESTARTBLOCK;
4694 mval->br_blockcount =
4695 XFS_FILBLKS_MIN(len, got.br_startoff - bno);
4696 mval->br_state = XFS_EXT_NORM;
4697 bno += mval->br_blockcount;
4698 len -= mval->br_blockcount;
4704 * Then deal with the allocated space we found.
4707 if (!(flags & XFS_BMAPI_ENTIRE) &&
4708 (got.br_startoff + got.br_blockcount > obno)) {
4711 ASSERT((bno >= obno) || (n == 0));
4713 mval->br_startoff = bno;
4714 if (isnullstartblock(got.br_startblock)) {
4715 ASSERT(!wr || (flags & XFS_BMAPI_DELAY));
4716 mval->br_startblock = DELAYSTARTBLOCK;
4718 mval->br_startblock =
4720 (bno - got.br_startoff);
4722 * Return the minimum of what we got and what we
4723 * asked for for the length. We can use the len
4724 * variable here because it is modified below
4725 * and we could have been there before coming
4726 * here if the first part of the allocation
4727 * didn't overlap what was asked for.
4729 mval->br_blockcount =
4730 XFS_FILBLKS_MIN(end - bno, got.br_blockcount -
4731 (bno - got.br_startoff));
4732 mval->br_state = got.br_state;
4733 ASSERT(mval->br_blockcount <= len);
4736 if (isnullstartblock(mval->br_startblock)) {
4737 ASSERT(!wr || (flags & XFS_BMAPI_DELAY));
4738 mval->br_startblock = DELAYSTARTBLOCK;
4743 * Check if writing previously allocated but
4744 * unwritten extents.
4747 ((mval->br_state == XFS_EXT_UNWRITTEN &&
4748 ((flags & (XFS_BMAPI_PREALLOC|XFS_BMAPI_DELAY)) == 0)) ||
4749 (mval->br_state == XFS_EXT_NORM &&
4750 ((flags & (XFS_BMAPI_PREALLOC|XFS_BMAPI_CONVERT)) ==
4751 (XFS_BMAPI_PREALLOC|XFS_BMAPI_CONVERT))))) {
4753 * Modify (by adding) the state flag, if writing.
4755 ASSERT(mval->br_blockcount <= len);
4756 if ((ifp->if_flags & XFS_IFBROOT) && !cur) {
4757 cur = xfs_bmbt_init_cursor(mp,
4759 cur->bc_private.b.firstblock =
4761 cur->bc_private.b.flist = flist;
4763 mval->br_state = (mval->br_state == XFS_EXT_UNWRITTEN)
4765 : XFS_EXT_UNWRITTEN;
4766 error = xfs_bmap_add_extent(ip, &lastx, &cur, mval,
4767 firstblock, flist, &tmp_logflags,
4769 logflags |= tmp_logflags;
4772 ep = xfs_iext_get_ext(ifp, lastx);
4773 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
4774 xfs_bmbt_get_all(ep, &got);
4776 * We may have combined previously unwritten
4777 * space with written space, so generate
4780 if (mval->br_blockcount < len)
4784 ASSERT((flags & XFS_BMAPI_ENTIRE) ||
4785 ((mval->br_startoff + mval->br_blockcount) <= end));
4786 ASSERT((flags & XFS_BMAPI_ENTIRE) ||
4787 (mval->br_blockcount <= len) ||
4788 (mval->br_startoff < obno));
4789 bno = mval->br_startoff + mval->br_blockcount;
4791 if (n > 0 && mval->br_startoff == mval[-1].br_startoff) {
4792 ASSERT(mval->br_startblock == mval[-1].br_startblock);
4793 ASSERT(mval->br_blockcount > mval[-1].br_blockcount);
4794 ASSERT(mval->br_state == mval[-1].br_state);
4795 mval[-1].br_blockcount = mval->br_blockcount;
4796 mval[-1].br_state = mval->br_state;
4797 } else if (n > 0 && mval->br_startblock != DELAYSTARTBLOCK &&
4798 mval[-1].br_startblock != DELAYSTARTBLOCK &&
4799 mval[-1].br_startblock != HOLESTARTBLOCK &&
4800 mval->br_startblock ==
4801 mval[-1].br_startblock + mval[-1].br_blockcount &&
4802 ((flags & XFS_BMAPI_IGSTATE) ||
4803 mval[-1].br_state == mval->br_state)) {
4804 ASSERT(mval->br_startoff ==
4805 mval[-1].br_startoff + mval[-1].br_blockcount);
4806 mval[-1].br_blockcount += mval->br_blockcount;
4808 mval->br_startblock == DELAYSTARTBLOCK &&
4809 mval[-1].br_startblock == DELAYSTARTBLOCK &&
4810 mval->br_startoff ==
4811 mval[-1].br_startoff + mval[-1].br_blockcount) {
4812 mval[-1].br_blockcount += mval->br_blockcount;
4813 mval[-1].br_state = mval->br_state;
4814 } else if (!((n == 0) &&
4815 ((mval->br_startoff + mval->br_blockcount) <=
4821 * If we're done, stop now. Stop when we've allocated
4822 * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise
4823 * the transaction may get too big.
4825 if (bno >= end || n >= *nmap || nallocs >= *nmap)
4828 * Else go on to the next record.
4830 ep = xfs_iext_get_ext(ifp, ++lastx);
4832 if (lastx >= nextents)
4835 xfs_bmbt_get_all(ep, &got);
4839 * Transform from btree to extents, give it cur.
4841 if (tp && XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE &&
4842 XFS_IFORK_NEXTENTS(ip, whichfork) <= ifp->if_ext_max) {
4844 error = xfs_bmap_btree_to_extents(tp, ip, cur,
4845 &tmp_logflags, whichfork);
4846 logflags |= tmp_logflags;
4850 ASSERT(ifp->if_ext_max ==
4851 XFS_IFORK_SIZE(ip, whichfork) / (uint)sizeof(xfs_bmbt_rec_t));
4852 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE ||
4853 XFS_IFORK_NEXTENTS(ip, whichfork) > ifp->if_ext_max);
4857 * Log everything. Do this after conversion, there's no point in
4858 * logging the extent records if we've converted to btree format.
4860 if ((logflags & xfs_ilog_fext(whichfork)) &&
4861 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
4862 logflags &= ~xfs_ilog_fext(whichfork);
4863 else if ((logflags & xfs_ilog_fbroot(whichfork)) &&
4864 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)
4865 logflags &= ~xfs_ilog_fbroot(whichfork);
4867 * Log whatever the flags say, even if error. Otherwise we might miss
4868 * detecting a case where the data is changed, there's an error,
4869 * and it's not logged so we don't shutdown when we should.
4873 xfs_trans_log_inode(tp, ip, logflags);
4877 ASSERT(*firstblock == NULLFSBLOCK ||
4878 XFS_FSB_TO_AGNO(mp, *firstblock) ==
4880 cur->bc_private.b.firstblock) ||
4882 XFS_FSB_TO_AGNO(mp, *firstblock) <
4884 cur->bc_private.b.firstblock)));
4885 *firstblock = cur->bc_private.b.firstblock;
4887 xfs_btree_del_cursor(cur,
4888 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
4891 xfs_bmap_validate_ret(orig_bno, orig_len, orig_flags, orig_mval,
4897 * Map file blocks to filesystem blocks, simple version.
4898 * One block (extent) only, read-only.
4899 * For flags, only the XFS_BMAPI_ATTRFORK flag is examined.
4900 * For the other flag values, the effect is as if XFS_BMAPI_METADATA
4901 * was set and all the others were clear.
4905 xfs_trans_t *tp, /* transaction pointer */
4906 xfs_inode_t *ip, /* incore inode */
4907 int whichfork, /* data or attr fork */
4908 xfs_fsblock_t *fsb, /* output: mapped block */
4909 xfs_fileoff_t bno) /* starting file offs. mapped */
4911 int eof; /* we've hit the end of extents */
4912 int error; /* error return */
4913 xfs_bmbt_irec_t got; /* current file extent record */
4914 xfs_ifork_t *ifp; /* inode fork pointer */
4915 xfs_extnum_t lastx; /* last useful extent number */
4916 xfs_bmbt_irec_t prev; /* previous file extent record */
4918 ifp = XFS_IFORK_PTR(ip, whichfork);
4920 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE &&
4921 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)) {
4922 XFS_ERROR_REPORT("xfs_bmapi_single", XFS_ERRLEVEL_LOW,
4924 return XFS_ERROR(EFSCORRUPTED);
4926 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
4927 return XFS_ERROR(EIO);
4928 XFS_STATS_INC(xs_blk_mapr);
4929 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
4930 (error = xfs_iread_extents(tp, ip, whichfork)))
4932 (void)xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got,
4935 * Reading past eof, act as though there's a hole
4938 if (eof || got.br_startoff > bno) {
4942 ASSERT(!isnullstartblock(got.br_startblock));
4943 ASSERT(bno < got.br_startoff + got.br_blockcount);
4944 *fsb = got.br_startblock + (bno - got.br_startoff);
4949 * Unmap (remove) blocks from a file.
4950 * If nexts is nonzero then the number of extents to remove is limited to
4951 * that value. If not all extents in the block range can be removed then
4956 xfs_trans_t *tp, /* transaction pointer */
4957 struct xfs_inode *ip, /* incore inode */
4958 xfs_fileoff_t bno, /* starting offset to unmap */
4959 xfs_filblks_t len, /* length to unmap in file */
4960 int flags, /* misc flags */
4961 xfs_extnum_t nexts, /* number of extents max */
4962 xfs_fsblock_t *firstblock, /* first allocated block
4963 controls a.g. for allocs */
4964 xfs_bmap_free_t *flist, /* i/o: list extents to free */
4965 int *done) /* set if not done yet */
4967 xfs_btree_cur_t *cur; /* bmap btree cursor */
4968 xfs_bmbt_irec_t del; /* extent being deleted */
4969 int eof; /* is deleting at eof */
4970 xfs_bmbt_rec_host_t *ep; /* extent record pointer */
4971 int error; /* error return value */
4972 xfs_extnum_t extno; /* extent number in list */
4973 xfs_bmbt_irec_t got; /* current extent record */
4974 xfs_ifork_t *ifp; /* inode fork pointer */
4975 int isrt; /* freeing in rt area */
4976 xfs_extnum_t lastx; /* last extent index used */
4977 int logflags; /* transaction logging flags */
4978 xfs_extlen_t mod; /* rt extent offset */
4979 xfs_mount_t *mp; /* mount structure */
4980 xfs_extnum_t nextents; /* number of file extents */
4981 xfs_bmbt_irec_t prev; /* previous extent record */
4982 xfs_fileoff_t start; /* first file offset deleted */
4983 int tmp_logflags; /* partial logging flags */
4984 int wasdel; /* was a delayed alloc extent */
4985 int whichfork; /* data or attribute fork */
4988 trace_xfs_bunmap(ip, bno, len, flags, _RET_IP_);
4990 whichfork = (flags & XFS_BMAPI_ATTRFORK) ?
4991 XFS_ATTR_FORK : XFS_DATA_FORK;
4992 ifp = XFS_IFORK_PTR(ip, whichfork);
4994 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS &&
4995 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)) {
4996 XFS_ERROR_REPORT("xfs_bunmapi", XFS_ERRLEVEL_LOW,
4998 return XFS_ERROR(EFSCORRUPTED);
5001 if (XFS_FORCED_SHUTDOWN(mp))
5002 return XFS_ERROR(EIO);
5006 ASSERT(ifp->if_ext_max ==
5007 XFS_IFORK_SIZE(ip, whichfork) / (uint)sizeof(xfs_bmbt_rec_t));
5008 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
5009 (error = xfs_iread_extents(tp, ip, whichfork)))
5011 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
5012 if (nextents == 0) {
5016 XFS_STATS_INC(xs_blk_unmap);
5017 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip);
5019 bno = start + len - 1;
5020 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got,
5024 * Check to see if the given block number is past the end of the
5025 * file, back up to the last block if so...
5028 ep = xfs_iext_get_ext(ifp, --lastx);
5029 xfs_bmbt_get_all(ep, &got);
5030 bno = got.br_startoff + got.br_blockcount - 1;
5033 if (ifp->if_flags & XFS_IFBROOT) {
5034 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
5035 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
5036 cur->bc_private.b.firstblock = *firstblock;
5037 cur->bc_private.b.flist = flist;
5038 cur->bc_private.b.flags = 0;
5042 while (bno != (xfs_fileoff_t)-1 && bno >= start && lastx >= 0 &&
5043 (nexts == 0 || extno < nexts)) {
5045 * Is the found extent after a hole in which bno lives?
5046 * Just back up to the previous extent, if so.
5048 if (got.br_startoff > bno) {
5051 ep = xfs_iext_get_ext(ifp, lastx);
5052 xfs_bmbt_get_all(ep, &got);
5055 * Is the last block of this extent before the range
5056 * we're supposed to delete? If so, we're done.
5058 bno = XFS_FILEOFF_MIN(bno,
5059 got.br_startoff + got.br_blockcount - 1);
5063 * Then deal with the (possibly delayed) allocated space
5068 wasdel = isnullstartblock(del.br_startblock);
5069 if (got.br_startoff < start) {
5070 del.br_startoff = start;
5071 del.br_blockcount -= start - got.br_startoff;
5073 del.br_startblock += start - got.br_startoff;
5075 if (del.br_startoff + del.br_blockcount > bno + 1)
5076 del.br_blockcount = bno + 1 - del.br_startoff;
5077 sum = del.br_startblock + del.br_blockcount;
5079 (mod = do_mod(sum, mp->m_sb.sb_rextsize))) {
5081 * Realtime extent not lined up at the end.
5082 * The extent could have been split into written
5083 * and unwritten pieces, or we could just be
5084 * unmapping part of it. But we can't really
5085 * get rid of part of a realtime extent.
5087 if (del.br_state == XFS_EXT_UNWRITTEN ||
5088 !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
5090 * This piece is unwritten, or we're not
5091 * using unwritten extents. Skip over it.
5094 bno -= mod > del.br_blockcount ?
5095 del.br_blockcount : mod;
5096 if (bno < got.br_startoff) {
5098 xfs_bmbt_get_all(xfs_iext_get_ext(
5104 * It's written, turn it unwritten.
5105 * This is better than zeroing it.
5107 ASSERT(del.br_state == XFS_EXT_NORM);
5108 ASSERT(xfs_trans_get_block_res(tp) > 0);
5110 * If this spans a realtime extent boundary,
5111 * chop it back to the start of the one we end at.
5113 if (del.br_blockcount > mod) {
5114 del.br_startoff += del.br_blockcount - mod;
5115 del.br_startblock += del.br_blockcount - mod;
5116 del.br_blockcount = mod;
5118 del.br_state = XFS_EXT_UNWRITTEN;
5119 error = xfs_bmap_add_extent(ip, &lastx, &cur, &del,
5120 firstblock, flist, &logflags,
5126 if (isrt && (mod = do_mod(del.br_startblock, mp->m_sb.sb_rextsize))) {
5128 * Realtime extent is lined up at the end but not
5129 * at the front. We'll get rid of full extents if
5132 mod = mp->m_sb.sb_rextsize - mod;
5133 if (del.br_blockcount > mod) {
5134 del.br_blockcount -= mod;
5135 del.br_startoff += mod;
5136 del.br_startblock += mod;
5137 } else if ((del.br_startoff == start &&
5138 (del.br_state == XFS_EXT_UNWRITTEN ||
5139 xfs_trans_get_block_res(tp) == 0)) ||
5140 !xfs_sb_version_hasextflgbit(&mp->m_sb)) {
5142 * Can't make it unwritten. There isn't
5143 * a full extent here so just skip it.
5145 ASSERT(bno >= del.br_blockcount);
5146 bno -= del.br_blockcount;
5147 if (bno < got.br_startoff) {
5149 xfs_bmbt_get_all(--ep, &got);
5152 } else if (del.br_state == XFS_EXT_UNWRITTEN) {
5154 * This one is already unwritten.
5155 * It must have a written left neighbor.
5156 * Unwrite the killed part of that one and
5160 xfs_bmbt_get_all(xfs_iext_get_ext(ifp,
5162 ASSERT(prev.br_state == XFS_EXT_NORM);
5163 ASSERT(!isnullstartblock(prev.br_startblock));
5164 ASSERT(del.br_startblock ==
5165 prev.br_startblock + prev.br_blockcount);
5166 if (prev.br_startoff < start) {
5167 mod = start - prev.br_startoff;
5168 prev.br_blockcount -= mod;
5169 prev.br_startblock += mod;
5170 prev.br_startoff = start;
5172 prev.br_state = XFS_EXT_UNWRITTEN;
5174 error = xfs_bmap_add_extent(ip, &lastx, &cur,
5175 &prev, firstblock, flist, &logflags,
5181 ASSERT(del.br_state == XFS_EXT_NORM);
5182 del.br_state = XFS_EXT_UNWRITTEN;
5183 error = xfs_bmap_add_extent(ip, &lastx, &cur,
5184 &del, firstblock, flist, &logflags,
5192 ASSERT(startblockval(del.br_startblock) > 0);
5193 /* Update realtime/data freespace, unreserve quota */
5195 xfs_filblks_t rtexts;
5197 rtexts = XFS_FSB_TO_B(mp, del.br_blockcount);
5198 do_div(rtexts, mp->m_sb.sb_rextsize);
5199 xfs_mod_incore_sb(mp, XFS_SBS_FREXTENTS,
5200 (int64_t)rtexts, 0);
5201 (void)xfs_trans_reserve_quota_nblks(NULL,
5202 ip, -((long)del.br_blockcount), 0,
5203 XFS_QMOPT_RES_RTBLKS);
5205 xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS,
5206 (int64_t)del.br_blockcount, 0);
5207 (void)xfs_trans_reserve_quota_nblks(NULL,
5208 ip, -((long)del.br_blockcount), 0,
5209 XFS_QMOPT_RES_REGBLKS);
5211 ip->i_delayed_blks -= del.br_blockcount;
5213 cur->bc_private.b.flags |=
5214 XFS_BTCUR_BPRV_WASDEL;
5216 cur->bc_private.b.flags &= ~XFS_BTCUR_BPRV_WASDEL;
5218 * If it's the case where the directory code is running
5219 * with no block reservation, and the deleted block is in
5220 * the middle of its extent, and the resulting insert
5221 * of an extent would cause transformation to btree format,
5222 * then reject it. The calling code will then swap
5223 * blocks around instead.
5224 * We have to do this now, rather than waiting for the
5225 * conversion to btree format, since the transaction
5228 if (!wasdel && xfs_trans_get_block_res(tp) == 0 &&
5229 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
5230 XFS_IFORK_NEXTENTS(ip, whichfork) >= ifp->if_ext_max &&
5231 del.br_startoff > got.br_startoff &&
5232 del.br_startoff + del.br_blockcount <
5233 got.br_startoff + got.br_blockcount) {
5234 error = XFS_ERROR(ENOSPC);
5237 error = xfs_bmap_del_extent(ip, tp, &lastx, flist, cur, &del,
5238 &tmp_logflags, whichfork);
5239 logflags |= tmp_logflags;
5242 bno = del.br_startoff - 1;
5245 * If not done go on to the next (previous) record.
5246 * Reset ep in case the extents array was re-alloced.
5248 ep = xfs_iext_get_ext(ifp, lastx);
5249 if (bno != (xfs_fileoff_t)-1 && bno >= start) {
5250 if (lastx >= XFS_IFORK_NEXTENTS(ip, whichfork) ||
5251 xfs_bmbt_get_startoff(ep) > bno) {
5253 ep = xfs_iext_get_ext(ifp, lastx);
5256 xfs_bmbt_get_all(ep, &got);
5260 *done = bno == (xfs_fileoff_t)-1 || bno < start || lastx < 0;
5261 ASSERT(ifp->if_ext_max ==
5262 XFS_IFORK_SIZE(ip, whichfork) / (uint)sizeof(xfs_bmbt_rec_t));
5264 * Convert to a btree if necessary.
5266 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
5267 XFS_IFORK_NEXTENTS(ip, whichfork) > ifp->if_ext_max) {
5268 ASSERT(cur == NULL);
5269 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist,
5270 &cur, 0, &tmp_logflags, whichfork);
5271 logflags |= tmp_logflags;
5276 * transform from btree to extents, give it cur
5278 else if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE &&
5279 XFS_IFORK_NEXTENTS(ip, whichfork) <= ifp->if_ext_max) {
5280 ASSERT(cur != NULL);
5281 error = xfs_bmap_btree_to_extents(tp, ip, cur, &tmp_logflags,
5283 logflags |= tmp_logflags;
5288 * transform from extents to local?
5290 ASSERT(ifp->if_ext_max ==
5291 XFS_IFORK_SIZE(ip, whichfork) / (uint)sizeof(xfs_bmbt_rec_t));
5295 * Log everything. Do this after conversion, there's no point in
5296 * logging the extent records if we've converted to btree format.
5298 if ((logflags & xfs_ilog_fext(whichfork)) &&
5299 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS)
5300 logflags &= ~xfs_ilog_fext(whichfork);
5301 else if ((logflags & xfs_ilog_fbroot(whichfork)) &&
5302 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)
5303 logflags &= ~xfs_ilog_fbroot(whichfork);
5305 * Log inode even in the error case, if the transaction
5306 * is dirty we'll need to shut down the filesystem.
5309 xfs_trans_log_inode(tp, ip, logflags);
5312 *firstblock = cur->bc_private.b.firstblock;
5313 cur->bc_private.b.allocated = 0;
5315 xfs_btree_del_cursor(cur,
5316 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
5322 * returns 1 for success, 0 if we failed to map the extent.
5325 xfs_getbmapx_fix_eof_hole(
5326 xfs_inode_t *ip, /* xfs incore inode pointer */
5327 struct getbmapx *out, /* output structure */
5328 int prealloced, /* this is a file with
5329 * preallocated data space */
5330 __int64_t end, /* last block requested */
5331 xfs_fsblock_t startblock)
5334 xfs_mount_t *mp; /* file system mount point */
5335 xfs_ifork_t *ifp; /* inode fork pointer */
5336 xfs_extnum_t lastx; /* last extent pointer */
5337 xfs_fileoff_t fileblock;
5339 if (startblock == HOLESTARTBLOCK) {
5341 out->bmv_block = -1;
5342 fixlen = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, ip->i_size));
5343 fixlen -= out->bmv_offset;
5344 if (prealloced && out->bmv_offset + out->bmv_length == end) {
5345 /* Came to hole at EOF. Trim it. */
5348 out->bmv_length = fixlen;
5351 if (startblock == DELAYSTARTBLOCK)
5352 out->bmv_block = -2;
5354 out->bmv_block = xfs_fsb_to_db(ip, startblock);
5355 fileblock = XFS_BB_TO_FSB(ip->i_mount, out->bmv_offset);
5356 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
5357 if (xfs_iext_bno_to_ext(ifp, fileblock, &lastx) &&
5358 (lastx == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))-1))
5359 out->bmv_oflags |= BMV_OF_LAST;
5366 * Get inode's extents as described in bmv, and format for output.
5367 * Calls formatter to fill the user's buffer until all extents
5368 * are mapped, until the passed-in bmv->bmv_count slots have
5369 * been filled, or until the formatter short-circuits the loop,
5370 * if it is tracking filled-in extents on its own.
5372 int /* error code */
5375 struct getbmapx *bmv, /* user bmap structure */
5376 xfs_bmap_format_t formatter, /* format to user */
5377 void *arg) /* formatter arg */
5379 __int64_t bmvend; /* last block requested */
5380 int error = 0; /* return value */
5381 __int64_t fixlen; /* length for -1 case */
5382 int i; /* extent number */
5383 int lock; /* lock state */
5384 xfs_bmbt_irec_t *map; /* buffer for user's data */
5385 xfs_mount_t *mp; /* file system mount point */
5386 int nex; /* # of user extents can do */
5387 int nexleft; /* # of user extents left */
5388 int subnex; /* # of bmapi's can do */
5389 int nmap; /* number of map entries */
5390 struct getbmapx *out; /* output structure */
5391 int whichfork; /* data or attr fork */
5392 int prealloced; /* this is a file with
5393 * preallocated data space */
5394 int iflags; /* interface flags */
5395 int bmapi_flags; /* flags for xfs_bmapi */
5399 iflags = bmv->bmv_iflags;
5400 whichfork = iflags & BMV_IF_ATTRFORK ? XFS_ATTR_FORK : XFS_DATA_FORK;
5402 if (whichfork == XFS_ATTR_FORK) {
5403 if (XFS_IFORK_Q(ip)) {
5404 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS &&
5405 ip->i_d.di_aformat != XFS_DINODE_FMT_BTREE &&
5406 ip->i_d.di_aformat != XFS_DINODE_FMT_LOCAL)
5407 return XFS_ERROR(EINVAL);
5408 } else if (unlikely(
5409 ip->i_d.di_aformat != 0 &&
5410 ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS)) {
5411 XFS_ERROR_REPORT("xfs_getbmap", XFS_ERRLEVEL_LOW,
5413 return XFS_ERROR(EFSCORRUPTED);
5419 if (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS &&
5420 ip->i_d.di_format != XFS_DINODE_FMT_BTREE &&
5421 ip->i_d.di_format != XFS_DINODE_FMT_LOCAL)
5422 return XFS_ERROR(EINVAL);
5424 if (xfs_get_extsz_hint(ip) ||
5425 ip->i_d.di_flags & (XFS_DIFLAG_PREALLOC|XFS_DIFLAG_APPEND)){
5427 fixlen = XFS_MAXIOFFSET(mp);
5430 fixlen = ip->i_size;
5434 if (bmv->bmv_length == -1) {
5435 fixlen = XFS_FSB_TO_BB(mp, XFS_B_TO_FSB(mp, fixlen));
5437 max_t(__int64_t, fixlen - bmv->bmv_offset, 0);
5438 } else if (bmv->bmv_length == 0) {
5439 bmv->bmv_entries = 0;
5441 } else if (bmv->bmv_length < 0) {
5442 return XFS_ERROR(EINVAL);
5445 nex = bmv->bmv_count - 1;
5447 return XFS_ERROR(EINVAL);
5448 bmvend = bmv->bmv_offset + bmv->bmv_length;
5451 if (bmv->bmv_count > ULONG_MAX / sizeof(struct getbmapx))
5452 return XFS_ERROR(ENOMEM);
5453 out = kmem_zalloc(bmv->bmv_count * sizeof(struct getbmapx), KM_MAYFAIL);
5455 return XFS_ERROR(ENOMEM);
5457 xfs_ilock(ip, XFS_IOLOCK_SHARED);
5458 if (whichfork == XFS_DATA_FORK && !(iflags & BMV_IF_DELALLOC)) {
5459 if (ip->i_delayed_blks || ip->i_size > ip->i_d.di_size) {
5460 error = xfs_flush_pages(ip, 0, -1, 0, FI_REMAPF);
5462 goto out_unlock_iolock;
5465 * even after flushing the inode, there can still be delalloc
5466 * blocks on the inode beyond EOF due to speculative
5467 * preallocation. These are not removed until the release
5468 * function is called or the inode is inactivated. Hence we
5469 * cannot assert here that ip->i_delayed_blks == 0.
5473 lock = xfs_ilock_map_shared(ip);
5476 * Don't let nex be bigger than the number of extents
5477 * we can have assuming alternating holes and real extents.
5479 if (nex > XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1)
5480 nex = XFS_IFORK_NEXTENTS(ip, whichfork) * 2 + 1;
5482 bmapi_flags = xfs_bmapi_aflag(whichfork);
5483 if (!(iflags & BMV_IF_PREALLOC))
5484 bmapi_flags |= XFS_BMAPI_IGSTATE;
5487 * Allocate enough space to handle "subnex" maps at a time.
5491 map = kmem_alloc(subnex * sizeof(*map), KM_MAYFAIL | KM_NOFS);
5493 goto out_unlock_ilock;
5495 bmv->bmv_entries = 0;
5497 if (XFS_IFORK_NEXTENTS(ip, whichfork) == 0 &&
5498 (whichfork == XFS_ATTR_FORK || !(iflags & BMV_IF_DELALLOC))) {
5506 nmap = (nexleft > subnex) ? subnex : nexleft;
5507 error = xfs_bmapi(NULL, ip, XFS_BB_TO_FSBT(mp, bmv->bmv_offset),
5508 XFS_BB_TO_FSB(mp, bmv->bmv_length),
5509 bmapi_flags, NULL, 0, map, &nmap,
5513 ASSERT(nmap <= subnex);
5515 for (i = 0; i < nmap && nexleft && bmv->bmv_length; i++) {
5516 out[cur_ext].bmv_oflags = 0;
5517 if (map[i].br_state == XFS_EXT_UNWRITTEN)
5518 out[cur_ext].bmv_oflags |= BMV_OF_PREALLOC;
5519 else if (map[i].br_startblock == DELAYSTARTBLOCK)
5520 out[cur_ext].bmv_oflags |= BMV_OF_DELALLOC;
5521 out[cur_ext].bmv_offset =
5522 XFS_FSB_TO_BB(mp, map[i].br_startoff);
5523 out[cur_ext].bmv_length =
5524 XFS_FSB_TO_BB(mp, map[i].br_blockcount);
5525 out[cur_ext].bmv_unused1 = 0;
5526 out[cur_ext].bmv_unused2 = 0;
5527 ASSERT(((iflags & BMV_IF_DELALLOC) != 0) ||
5528 (map[i].br_startblock != DELAYSTARTBLOCK));
5529 if (map[i].br_startblock == HOLESTARTBLOCK &&
5530 whichfork == XFS_ATTR_FORK) {
5531 /* came to the end of attribute fork */
5532 out[cur_ext].bmv_oflags |= BMV_OF_LAST;
5536 if (!xfs_getbmapx_fix_eof_hole(ip, &out[cur_ext],
5538 map[i].br_startblock))
5542 out[cur_ext].bmv_offset +
5543 out[cur_ext].bmv_length;
5545 max_t(__int64_t, 0, bmvend - bmv->bmv_offset);
5548 * In case we don't want to return the hole,
5549 * don't increase cur_ext so that we can reuse
5550 * it in the next loop.
5552 if ((iflags & BMV_IF_NO_HOLES) &&
5553 map[i].br_startblock == HOLESTARTBLOCK) {
5554 memset(&out[cur_ext], 0, sizeof(out[cur_ext]));
5562 } while (nmap && nexleft && bmv->bmv_length);
5567 xfs_iunlock_map_shared(ip, lock);
5569 xfs_iunlock(ip, XFS_IOLOCK_SHARED);
5571 for (i = 0; i < cur_ext; i++) {
5572 int full = 0; /* user array is full */
5574 /* format results & advance arg */
5575 error = formatter(&arg, &out[i], &full);
5585 * Check the last inode extent to determine whether this allocation will result
5586 * in blocks being allocated at the end of the file. When we allocate new data
5587 * blocks at the end of the file which do not start at the previous data block,
5588 * we will try to align the new blocks at stripe unit boundaries.
5590 STATIC int /* error */
5592 xfs_inode_t *ip, /* incore inode pointer */
5593 xfs_fileoff_t off, /* file offset in fsblocks */
5594 int whichfork, /* data or attribute fork */
5595 char *aeof) /* return value */
5597 int error; /* error return value */
5598 xfs_ifork_t *ifp; /* inode fork pointer */
5599 xfs_bmbt_rec_host_t *lastrec; /* extent record pointer */
5600 xfs_extnum_t nextents; /* number of file extents */
5601 xfs_bmbt_irec_t s; /* expanded extent record */
5603 ASSERT(whichfork == XFS_DATA_FORK);
5604 ifp = XFS_IFORK_PTR(ip, whichfork);
5605 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
5606 (error = xfs_iread_extents(NULL, ip, whichfork)))
5608 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
5609 if (nextents == 0) {
5614 * Go to the last extent
5616 lastrec = xfs_iext_get_ext(ifp, nextents - 1);
5617 xfs_bmbt_get_all(lastrec, &s);
5619 * Check we are allocating in the last extent (for delayed allocations)
5620 * or past the last extent for non-delayed allocations.
5622 *aeof = (off >= s.br_startoff &&
5623 off < s.br_startoff + s.br_blockcount &&
5624 isnullstartblock(s.br_startblock)) ||
5625 off >= s.br_startoff + s.br_blockcount;
5630 * Check if the endoff is outside the last extent. If so the caller will grow
5631 * the allocation to a stripe unit boundary.
5635 xfs_inode_t *ip, /* incore inode pointer */
5636 xfs_fileoff_t endoff, /* file offset in fsblocks */
5637 int whichfork, /* data or attribute fork */
5638 int *eof) /* result value */
5640 xfs_fsblock_t blockcount; /* extent block count */
5641 int error; /* error return value */
5642 xfs_ifork_t *ifp; /* inode fork pointer */
5643 xfs_bmbt_rec_host_t *lastrec; /* extent record pointer */
5644 xfs_extnum_t nextents; /* number of file extents */
5645 xfs_fileoff_t startoff; /* extent starting file offset */
5647 ASSERT(whichfork == XFS_DATA_FORK);
5648 ifp = XFS_IFORK_PTR(ip, whichfork);
5649 if (!(ifp->if_flags & XFS_IFEXTENTS) &&
5650 (error = xfs_iread_extents(NULL, ip, whichfork)))
5652 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
5653 if (nextents == 0) {
5658 * Go to the last extent
5660 lastrec = xfs_iext_get_ext(ifp, nextents - 1);
5661 startoff = xfs_bmbt_get_startoff(lastrec);
5662 blockcount = xfs_bmbt_get_blockcount(lastrec);
5663 *eof = endoff >= startoff + blockcount;
5668 STATIC struct xfs_buf *
5670 struct xfs_btree_cur *cur,
5673 struct xfs_log_item_desc *lidp;
5679 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) {
5680 if (!cur->bc_bufs[i])
5682 if (XFS_BUF_ADDR(cur->bc_bufs[i]) == bno)
5683 return cur->bc_bufs[i];
5686 /* Chase down all the log items to see if the bp is there */
5687 list_for_each_entry(lidp, &cur->bc_tp->t_items, lid_trans) {
5688 struct xfs_buf_log_item *bip;
5689 bip = (struct xfs_buf_log_item *)lidp->lid_item;
5690 if (bip->bli_item.li_type == XFS_LI_BUF &&
5691 XFS_BUF_ADDR(bip->bli_buf) == bno)
5692 return bip->bli_buf;
5700 struct xfs_btree_block *block,
5706 __be64 *pp, *thispa; /* pointer to block address */
5707 xfs_bmbt_key_t *prevp, *keyp;
5709 ASSERT(be16_to_cpu(block->bb_level) > 0);
5712 for( i = 1; i <= xfs_btree_get_numrecs(block); i++) {
5713 dmxr = mp->m_bmap_dmxr[0];
5714 keyp = XFS_BMBT_KEY_ADDR(mp, block, i);
5717 ASSERT(be64_to_cpu(prevp->br_startoff) <
5718 be64_to_cpu(keyp->br_startoff));
5723 * Compare the block numbers to see if there are dups.
5726 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz);
5728 pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr);
5730 for (j = i+1; j <= be16_to_cpu(block->bb_numrecs); j++) {
5732 thispa = XFS_BMAP_BROOT_PTR_ADDR(mp, block, j, sz);
5734 thispa = XFS_BMBT_PTR_ADDR(mp, block, j, dmxr);
5735 if (*thispa == *pp) {
5736 xfs_warn(mp, "%s: thispa(%d) == pp(%d) %Ld",
5738 (unsigned long long)be64_to_cpu(*thispa));
5739 panic("%s: ptrs are equal in node\n",
5747 * Check that the extents for the inode ip are in the right order in all
5752 xfs_bmap_check_leaf_extents(
5753 xfs_btree_cur_t *cur, /* btree cursor or null */
5754 xfs_inode_t *ip, /* incore inode pointer */
5755 int whichfork) /* data or attr fork */
5757 struct xfs_btree_block *block; /* current btree block */
5758 xfs_fsblock_t bno; /* block # of "block" */
5759 xfs_buf_t *bp; /* buffer for "block" */
5760 int error; /* error return value */
5761 xfs_extnum_t i=0, j; /* index into the extents list */
5762 xfs_ifork_t *ifp; /* fork structure */
5763 int level; /* btree level, for checking */
5764 xfs_mount_t *mp; /* file system mount structure */
5765 __be64 *pp; /* pointer to block address */
5766 xfs_bmbt_rec_t *ep; /* pointer to current extent */
5767 xfs_bmbt_rec_t last = {0, 0}; /* last extent in prev block */
5768 xfs_bmbt_rec_t *nextp; /* pointer to next extent */
5771 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) {
5777 ifp = XFS_IFORK_PTR(ip, whichfork);
5778 block = ifp->if_broot;
5780 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
5782 level = be16_to_cpu(block->bb_level);
5784 xfs_check_block(block, mp, 1, ifp->if_broot_bytes);
5785 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
5786 bno = be64_to_cpu(*pp);
5788 ASSERT(bno != NULLDFSBNO);
5789 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
5790 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
5793 * Go down the tree until leaf level is reached, following the first
5794 * pointer (leftmost) at each level.
5796 while (level-- > 0) {
5797 /* See if buf is in cur first */
5798 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
5804 if (!bp && (error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp,
5805 XFS_BMAP_BTREE_REF)))
5807 block = XFS_BUF_TO_BLOCK(bp);
5808 XFS_WANT_CORRUPTED_GOTO(
5809 xfs_bmap_sanity_check(mp, bp, level),
5815 * Check this block for basic sanity (increasing keys and
5816 * no duplicate blocks).
5819 xfs_check_block(block, mp, 0, 0);
5820 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
5821 bno = be64_to_cpu(*pp);
5822 XFS_WANT_CORRUPTED_GOTO(XFS_FSB_SANITY_CHECK(mp, bno), error0);
5825 xfs_trans_brelse(NULL, bp);
5830 * Here with bp and block set to the leftmost leaf node in the tree.
5835 * Loop over all leaf nodes checking that all extents are in the right order.
5838 xfs_fsblock_t nextbno;
5839 xfs_extnum_t num_recs;
5842 num_recs = xfs_btree_get_numrecs(block);
5845 * Read-ahead the next leaf block, if any.
5848 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
5851 * Check all the extents to make sure they are OK.
5852 * If we had a previous block, the last entry should
5853 * conform with the first entry in this one.
5856 ep = XFS_BMBT_REC_ADDR(mp, block, 1);
5858 ASSERT(xfs_bmbt_disk_get_startoff(&last) +
5859 xfs_bmbt_disk_get_blockcount(&last) <=
5860 xfs_bmbt_disk_get_startoff(ep));
5862 for (j = 1; j < num_recs; j++) {
5863 nextp = XFS_BMBT_REC_ADDR(mp, block, j + 1);
5864 ASSERT(xfs_bmbt_disk_get_startoff(ep) +
5865 xfs_bmbt_disk_get_blockcount(ep) <=
5866 xfs_bmbt_disk_get_startoff(nextp));
5874 xfs_trans_brelse(NULL, bp);
5878 * If we've reached the end, stop.
5880 if (bno == NULLFSBLOCK)
5883 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno));
5889 if (!bp && (error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp,
5890 XFS_BMAP_BTREE_REF)))
5892 block = XFS_BUF_TO_BLOCK(bp);
5896 xfs_trans_brelse(NULL, bp);
5901 xfs_warn(mp, "%s: at error0", __func__);
5903 xfs_trans_brelse(NULL, bp);
5905 xfs_warn(mp, "%s: BAD after btree leaves for %d extents",
5907 panic("%s: CORRUPTED BTREE OR SOMETHING", __func__);
5913 * Count fsblocks of the given fork.
5916 xfs_bmap_count_blocks(
5917 xfs_trans_t *tp, /* transaction pointer */
5918 xfs_inode_t *ip, /* incore inode */
5919 int whichfork, /* data or attr fork */
5920 int *count) /* out: count of blocks */
5922 struct xfs_btree_block *block; /* current btree block */
5923 xfs_fsblock_t bno; /* block # of "block" */
5924 xfs_ifork_t *ifp; /* fork structure */
5925 int level; /* btree level, for checking */
5926 xfs_mount_t *mp; /* file system mount structure */
5927 __be64 *pp; /* pointer to block address */
5931 ifp = XFS_IFORK_PTR(ip, whichfork);
5932 if ( XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS ) {
5933 xfs_bmap_count_leaves(ifp, 0,
5934 ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t),
5940 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
5942 block = ifp->if_broot;
5943 level = be16_to_cpu(block->bb_level);
5945 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes);
5946 bno = be64_to_cpu(*pp);
5947 ASSERT(bno != NULLDFSBNO);
5948 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount);
5949 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks);
5951 if (unlikely(xfs_bmap_count_tree(mp, tp, ifp, bno, level, count) < 0)) {
5952 XFS_ERROR_REPORT("xfs_bmap_count_blocks(2)", XFS_ERRLEVEL_LOW,
5954 return XFS_ERROR(EFSCORRUPTED);
5961 * Recursively walks each level of a btree
5962 * to count total fsblocks is use.
5964 STATIC int /* error */
5965 xfs_bmap_count_tree(
5966 xfs_mount_t *mp, /* file system mount point */
5967 xfs_trans_t *tp, /* transaction pointer */
5968 xfs_ifork_t *ifp, /* inode fork pointer */
5969 xfs_fsblock_t blockno, /* file system block number */
5970 int levelin, /* level in btree */
5971 int *count) /* Count of blocks */
5974 xfs_buf_t *bp, *nbp;
5975 int level = levelin;
5977 xfs_fsblock_t bno = blockno;
5978 xfs_fsblock_t nextbno;
5979 struct xfs_btree_block *block, *nextblock;
5982 if ((error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, XFS_BMAP_BTREE_REF)))
5985 block = XFS_BUF_TO_BLOCK(bp);
5988 /* Not at node above leaves, count this level of nodes */
5989 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
5990 while (nextbno != NULLFSBLOCK) {
5991 if ((error = xfs_btree_read_bufl(mp, tp, nextbno,
5992 0, &nbp, XFS_BMAP_BTREE_REF)))
5995 nextblock = XFS_BUF_TO_BLOCK(nbp);
5996 nextbno = be64_to_cpu(nextblock->bb_u.l.bb_rightsib);
5997 xfs_trans_brelse(tp, nbp);
6000 /* Dive to the next level */
6001 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]);
6002 bno = be64_to_cpu(*pp);
6003 if (unlikely((error =
6004 xfs_bmap_count_tree(mp, tp, ifp, bno, level, count)) < 0)) {
6005 xfs_trans_brelse(tp, bp);
6006 XFS_ERROR_REPORT("xfs_bmap_count_tree(1)",
6007 XFS_ERRLEVEL_LOW, mp);
6008 return XFS_ERROR(EFSCORRUPTED);
6010 xfs_trans_brelse(tp, bp);
6012 /* count all level 1 nodes and their leaves */
6014 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib);
6015 numrecs = be16_to_cpu(block->bb_numrecs);
6016 xfs_bmap_disk_count_leaves(mp, block, numrecs, count);
6017 xfs_trans_brelse(tp, bp);
6018 if (nextbno == NULLFSBLOCK)
6021 if ((error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp,
6022 XFS_BMAP_BTREE_REF)))
6025 block = XFS_BUF_TO_BLOCK(bp);
6032 * Count leaf blocks given a range of extent records.
6035 xfs_bmap_count_leaves(
6043 for (b = 0; b < numrecs; b++) {
6044 xfs_bmbt_rec_host_t *frp = xfs_iext_get_ext(ifp, idx + b);
6045 *count += xfs_bmbt_get_blockcount(frp);
6050 * Count leaf blocks given a range of extent records originally
6054 xfs_bmap_disk_count_leaves(
6055 struct xfs_mount *mp,
6056 struct xfs_btree_block *block,
6061 xfs_bmbt_rec_t *frp;
6063 for (b = 1; b <= numrecs; b++) {
6064 frp = XFS_BMBT_REC_ADDR(mp, block, b);
6065 *count += xfs_bmbt_disk_get_blockcount(frp);
6070 * dead simple method of punching delalyed allocation blocks from a range in
6071 * the inode. Walks a block at a time so will be slow, but is only executed in
6072 * rare error cases so the overhead is not critical. This will alays punch out
6073 * both the start and end blocks, even if the ranges only partially overlap
6074 * them, so it is up to the caller to ensure that partial blocks are not
6078 xfs_bmap_punch_delalloc_range(
6079 struct xfs_inode *ip,
6080 xfs_fileoff_t start_fsb,
6081 xfs_fileoff_t length)
6083 xfs_fileoff_t remaining = length;
6086 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
6090 xfs_bmbt_irec_t imap;
6092 xfs_fsblock_t firstblock;
6093 xfs_bmap_free_t flist;
6096 * Map the range first and check that it is a delalloc extent
6097 * before trying to unmap the range. Otherwise we will be
6098 * trying to remove a real extent (which requires a
6099 * transaction) or a hole, which is probably a bad idea...
6101 error = xfs_bmapi(NULL, ip, start_fsb, 1,
6102 XFS_BMAPI_ENTIRE, NULL, 0, &imap,
6106 /* something screwed, just bail */
6107 if (!XFS_FORCED_SHUTDOWN(ip->i_mount)) {
6108 xfs_alert(ip->i_mount,
6109 "Failed delalloc mapping lookup ino %lld fsb %lld.",
6110 ip->i_ino, start_fsb);
6118 if (imap.br_startblock != DELAYSTARTBLOCK) {
6119 /* been converted, ignore */
6122 WARN_ON(imap.br_blockcount == 0);
6125 * Note: while we initialise the firstblock/flist pair, they
6126 * should never be used because blocks should never be
6127 * allocated or freed for a delalloc extent and hence we need
6128 * don't cancel or finish them after the xfs_bunmapi() call.
6130 xfs_bmap_init(&flist, &firstblock);
6131 error = xfs_bunmapi(NULL, ip, start_fsb, 1, 0, 1, &firstblock,
6136 ASSERT(!flist.xbf_count && !flist.xbf_first);
6140 } while(remaining > 0);
projects / linux-2.6-microblaze.git / blob