2 * Copyright (c) 2000-2005 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"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dir_sf.h"
34 #include "xfs_dir2_sf.h"
35 #include "xfs_attr_sf.h"
36 #include "xfs_dinode.h"
37 #include "xfs_inode.h"
38 #include "xfs_btree.h"
39 #include "xfs_dmapi.h"
40 #include "xfs_mount.h"
41 #include "xfs_ialloc.h"
42 #include "xfs_itable.h"
43 #include "xfs_inode_item.h"
44 #include "xfs_extfree_item.h"
45 #include "xfs_alloc.h"
47 #include "xfs_rtalloc.h"
48 #include "xfs_error.h"
49 #include "xfs_dir_leaf.h"
50 #include "xfs_attr_leaf.h"
52 #include "xfs_quota.h"
53 #include "xfs_trans_space.h"
54 #include "xfs_buf_item.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_bmapi to update extent list structure and the btree
93 * after allocating space (or doing a delayed allocation).
95 STATIC
int /* error */
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 put in extent list */
101 xfs_fsblock_t
*first
, /* pointer to firstblock variable */
102 xfs_bmap_free_t
*flist
, /* list of extents to be freed */
103 int *logflagsp
, /* inode logging flags */
104 int whichfork
, /* data or attr fork */
105 int rsvd
); /* OK to allocate reserved blocks */
108 * Called by xfs_bmap_add_extent to handle cases converting a delayed
109 * allocation to a real allocation.
111 STATIC
int /* error */
112 xfs_bmap_add_extent_delay_real(
113 xfs_inode_t
*ip
, /* incore inode pointer */
114 xfs_extnum_t idx
, /* extent number to update/insert */
115 xfs_btree_cur_t
**curp
, /* if *curp is null, not a btree */
116 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
117 xfs_filblks_t
*dnew
, /* new delayed-alloc indirect blocks */
118 xfs_fsblock_t
*first
, /* pointer to firstblock variable */
119 xfs_bmap_free_t
*flist
, /* list of extents to be freed */
120 int *logflagsp
, /* inode logging flags */
121 int rsvd
); /* OK to allocate reserved blocks */
124 * Called by xfs_bmap_add_extent to handle cases converting a hole
125 * to a delayed allocation.
127 STATIC
int /* error */
128 xfs_bmap_add_extent_hole_delay(
129 xfs_inode_t
*ip
, /* incore inode pointer */
130 xfs_extnum_t idx
, /* extent number to update/insert */
131 xfs_btree_cur_t
*cur
, /* if null, not a btree */
132 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
133 int *logflagsp
,/* inode logging flags */
134 int rsvd
); /* OK to allocate reserved blocks */
137 * Called by xfs_bmap_add_extent to handle cases converting a hole
138 * to a real allocation.
140 STATIC
int /* error */
141 xfs_bmap_add_extent_hole_real(
142 xfs_inode_t
*ip
, /* incore inode pointer */
143 xfs_extnum_t idx
, /* extent number to update/insert */
144 xfs_btree_cur_t
*cur
, /* if null, not a btree */
145 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
146 int *logflagsp
, /* inode logging flags */
147 int whichfork
); /* data or attr fork */
150 * Called by xfs_bmap_add_extent to handle cases converting an unwritten
151 * allocation to a real allocation or vice versa.
153 STATIC
int /* error */
154 xfs_bmap_add_extent_unwritten_real(
155 xfs_inode_t
*ip
, /* incore inode pointer */
156 xfs_extnum_t idx
, /* extent number to update/insert */
157 xfs_btree_cur_t
**curp
, /* if *curp is null, not a btree */
158 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
159 int *logflagsp
); /* inode logging flags */
162 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
163 * It figures out where to ask the underlying allocator to put the new extent.
165 STATIC
int /* error */
167 xfs_bmalloca_t
*ap
); /* bmap alloc argument struct */
170 * Transform a btree format file with only one leaf node, where the
171 * extents list will fit in the inode, into an extents format file.
172 * Since the extent list is already in-core, all we have to do is
173 * give up the space for the btree root and pitch the leaf block.
175 STATIC
int /* error */
176 xfs_bmap_btree_to_extents(
177 xfs_trans_t
*tp
, /* transaction pointer */
178 xfs_inode_t
*ip
, /* incore inode pointer */
179 xfs_btree_cur_t
*cur
, /* btree cursor */
180 int *logflagsp
, /* inode logging flags */
181 int whichfork
); /* data or attr fork */
185 * Check that the extents list for the inode ip is in the right order.
188 xfs_bmap_check_extents(
189 xfs_inode_t
*ip
, /* incore inode pointer */
190 int whichfork
); /* data or attr fork */
194 * Called by xfs_bmapi to update extent list structure and the btree
195 * after removing space (or undoing a delayed allocation).
197 STATIC
int /* error */
199 xfs_inode_t
*ip
, /* incore inode pointer */
200 xfs_trans_t
*tp
, /* current trans pointer */
201 xfs_extnum_t idx
, /* extent number to update/insert */
202 xfs_bmap_free_t
*flist
, /* list of extents to be freed */
203 xfs_btree_cur_t
*cur
, /* if null, not a btree */
204 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
205 int *logflagsp
,/* inode logging flags */
206 int whichfork
, /* data or attr fork */
207 int rsvd
); /* OK to allocate reserved blocks */
210 * Remove the entry "free" from the free item list. Prev points to the
211 * previous entry, unless "free" is the head of the list.
215 xfs_bmap_free_t
*flist
, /* free item list header */
216 xfs_bmap_free_item_t
*prev
, /* previous item on list, if any */
217 xfs_bmap_free_item_t
*free
); /* list item to be freed */
220 * Remove count entries from the extents array for inode "ip", starting
221 * at index "idx". Copies the remaining items down over the deleted ones,
222 * and gives back the excess memory.
225 xfs_bmap_delete_exlist(
226 xfs_inode_t
*ip
, /* incode inode pointer */
227 xfs_extnum_t idx
, /* starting delete index */
228 xfs_extnum_t count
, /* count of items to delete */
229 int whichfork
); /* data or attr fork */
232 * Convert an extents-format file into a btree-format file.
233 * The new file will have a root block (in the inode) and a single child block.
235 STATIC
int /* error */
236 xfs_bmap_extents_to_btree(
237 xfs_trans_t
*tp
, /* transaction pointer */
238 xfs_inode_t
*ip
, /* incore inode pointer */
239 xfs_fsblock_t
*firstblock
, /* first-block-allocated */
240 xfs_bmap_free_t
*flist
, /* blocks freed in xaction */
241 xfs_btree_cur_t
**curp
, /* cursor returned to caller */
242 int wasdel
, /* converting a delayed alloc */
243 int *logflagsp
, /* inode logging flags */
244 int whichfork
); /* data or attr fork */
247 * Insert new item(s) in the extent list for inode "ip".
248 * Count new items are inserted at offset idx.
251 xfs_bmap_insert_exlist(
252 xfs_inode_t
*ip
, /* incore inode pointer */
253 xfs_extnum_t idx
, /* starting index of new items */
254 xfs_extnum_t count
, /* number of inserted items */
255 xfs_bmbt_irec_t
*new, /* items to insert */
256 int whichfork
); /* data or attr fork */
259 * Convert a local file to an extents file.
260 * This code is sort of bogus, since the file data needs to get
261 * logged so it won't be lost. The bmap-level manipulations are ok, though.
263 STATIC
int /* error */
264 xfs_bmap_local_to_extents(
265 xfs_trans_t
*tp
, /* transaction pointer */
266 xfs_inode_t
*ip
, /* incore inode pointer */
267 xfs_fsblock_t
*firstblock
, /* first block allocated in xaction */
268 xfs_extlen_t total
, /* total blocks needed by transaction */
269 int *logflagsp
, /* inode logging flags */
270 int whichfork
); /* data or attr fork */
273 * Search the extents list for the inode, for the extent containing bno.
274 * If bno lies in a hole, point to the next entry. If bno lies past eof,
275 * *eofp will be set, and *prevp will contain the last entry (null if none).
276 * Else, *lastxp will be set to the index of the found
277 * entry; *gotp will contain the entry.
279 STATIC xfs_bmbt_rec_t
* /* pointer to found extent entry */
280 xfs_bmap_search_extents(
281 xfs_inode_t
*ip
, /* incore inode pointer */
282 xfs_fileoff_t bno
, /* block number searched for */
283 int whichfork
, /* data or attr fork */
284 int *eofp
, /* out: end of file found */
285 xfs_extnum_t
*lastxp
, /* out: last extent index */
286 xfs_bmbt_irec_t
*gotp
, /* out: extent entry found */
287 xfs_bmbt_irec_t
*prevp
); /* out: previous extent entry found */
290 * Check the last inode extent to determine whether this allocation will result
291 * in blocks being allocated at the end of the file. When we allocate new data
292 * blocks at the end of the file which do not start at the previous data block,
293 * we will try to align the new blocks at stripe unit boundaries.
295 STATIC
int /* error */
297 xfs_inode_t
*ip
, /* incore inode pointer */
298 xfs_fileoff_t off
, /* file offset in fsblocks */
299 int whichfork
, /* data or attribute fork */
300 char *aeof
); /* return value */
302 #ifdef XFS_BMAP_TRACE
304 * Add a bmap trace buffer entry. Base routine for the others.
307 xfs_bmap_trace_addentry(
308 int opcode
, /* operation */
309 char *fname
, /* function name */
310 char *desc
, /* operation description */
311 xfs_inode_t
*ip
, /* incore inode pointer */
312 xfs_extnum_t idx
, /* index of entry(ies) */
313 xfs_extnum_t cnt
, /* count of entries, 1 or 2 */
314 xfs_bmbt_rec_t
*r1
, /* first record */
315 xfs_bmbt_rec_t
*r2
, /* second record or null */
316 int whichfork
); /* data or attr fork */
319 * Add bmap trace entry prior to a call to xfs_bmap_delete_exlist.
322 xfs_bmap_trace_delete(
323 char *fname
, /* function name */
324 char *desc
, /* operation description */
325 xfs_inode_t
*ip
, /* incore inode pointer */
326 xfs_extnum_t idx
, /* index of entry(entries) deleted */
327 xfs_extnum_t cnt
, /* count of entries deleted, 1 or 2 */
328 int whichfork
); /* data or attr fork */
331 * Add bmap trace entry prior to a call to xfs_bmap_insert_exlist, or
332 * reading in the extents list from the disk (in the btree).
335 xfs_bmap_trace_insert(
336 char *fname
, /* function name */
337 char *desc
, /* operation description */
338 xfs_inode_t
*ip
, /* incore inode pointer */
339 xfs_extnum_t idx
, /* index of entry(entries) inserted */
340 xfs_extnum_t cnt
, /* count of entries inserted, 1 or 2 */
341 xfs_bmbt_irec_t
*r1
, /* inserted record 1 */
342 xfs_bmbt_irec_t
*r2
, /* inserted record 2 or null */
343 int whichfork
); /* data or attr fork */
346 * Add bmap trace entry after updating an extent list entry in place.
349 xfs_bmap_trace_post_update(
350 char *fname
, /* function name */
351 char *desc
, /* operation description */
352 xfs_inode_t
*ip
, /* incore inode pointer */
353 xfs_extnum_t idx
, /* index of entry updated */
354 int whichfork
); /* data or attr fork */
357 * Add bmap trace entry prior to updating an extent list entry in place.
360 xfs_bmap_trace_pre_update(
361 char *fname
, /* function name */
362 char *desc
, /* operation description */
363 xfs_inode_t
*ip
, /* incore inode pointer */
364 xfs_extnum_t idx
, /* index of entry to be updated */
365 int whichfork
); /* data or attr fork */
368 #define xfs_bmap_trace_delete(f,d,ip,i,c,w)
369 #define xfs_bmap_trace_insert(f,d,ip,i,c,r1,r2,w)
370 #define xfs_bmap_trace_post_update(f,d,ip,i,w)
371 #define xfs_bmap_trace_pre_update(f,d,ip,i,w)
372 #endif /* XFS_BMAP_TRACE */
375 * Compute the worst-case number of indirect blocks that will be used
376 * for ip's delayed extent of length "len".
379 xfs_bmap_worst_indlen(
380 xfs_inode_t
*ip
, /* incore inode pointer */
381 xfs_filblks_t len
); /* delayed extent length */
385 * Perform various validation checks on the values being returned
389 xfs_bmap_validate_ret(
393 xfs_bmbt_irec_t
*mval
,
397 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap)
400 #if defined(XFS_RW_TRACE)
409 #define xfs_bunmap_trace(ip, bno, len, flags, ra)
410 #endif /* XFS_RW_TRACE */
416 xfs_fsblock_t blockno
,
421 xfs_bmap_count_leaves(
427 * Bmap internal routines.
431 * Called from xfs_bmap_add_attrfork to handle btree format files.
433 STATIC
int /* error */
434 xfs_bmap_add_attrfork_btree(
435 xfs_trans_t
*tp
, /* transaction pointer */
436 xfs_inode_t
*ip
, /* incore inode pointer */
437 xfs_fsblock_t
*firstblock
, /* first block allocated */
438 xfs_bmap_free_t
*flist
, /* blocks to free at commit */
439 int *flags
) /* inode logging flags */
441 xfs_btree_cur_t
*cur
; /* btree cursor */
442 int error
; /* error return value */
443 xfs_mount_t
*mp
; /* file system mount struct */
444 int stat
; /* newroot status */
447 if (ip
->i_df
.if_broot_bytes
<= XFS_IFORK_DSIZE(ip
))
448 *flags
|= XFS_ILOG_DBROOT
;
450 cur
= xfs_btree_init_cursor(mp
, tp
, NULL
, 0, XFS_BTNUM_BMAP
, ip
,
452 cur
->bc_private
.b
.flist
= flist
;
453 cur
->bc_private
.b
.firstblock
= *firstblock
;
454 if ((error
= xfs_bmbt_lookup_ge(cur
, 0, 0, 0, &stat
)))
456 ASSERT(stat
== 1); /* must be at least one entry */
457 if ((error
= xfs_bmbt_newroot(cur
, flags
, &stat
)))
460 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
461 return XFS_ERROR(ENOSPC
);
463 *firstblock
= cur
->bc_private
.b
.firstblock
;
464 cur
->bc_private
.b
.allocated
= 0;
465 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
469 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
474 * Called from xfs_bmap_add_attrfork to handle extents format files.
476 STATIC
int /* error */
477 xfs_bmap_add_attrfork_extents(
478 xfs_trans_t
*tp
, /* transaction pointer */
479 xfs_inode_t
*ip
, /* incore inode pointer */
480 xfs_fsblock_t
*firstblock
, /* first block allocated */
481 xfs_bmap_free_t
*flist
, /* blocks to free at commit */
482 int *flags
) /* inode logging flags */
484 xfs_btree_cur_t
*cur
; /* bmap btree cursor */
485 int error
; /* error return value */
487 if (ip
->i_d
.di_nextents
* sizeof(xfs_bmbt_rec_t
) <= XFS_IFORK_DSIZE(ip
))
490 error
= xfs_bmap_extents_to_btree(tp
, ip
, firstblock
, flist
, &cur
, 0,
491 flags
, XFS_DATA_FORK
);
493 cur
->bc_private
.b
.allocated
= 0;
494 xfs_btree_del_cursor(cur
,
495 error
? XFS_BTREE_ERROR
: XFS_BTREE_NOERROR
);
501 * Called from xfs_bmap_add_attrfork to handle local format files.
503 STATIC
int /* error */
504 xfs_bmap_add_attrfork_local(
505 xfs_trans_t
*tp
, /* transaction pointer */
506 xfs_inode_t
*ip
, /* incore inode pointer */
507 xfs_fsblock_t
*firstblock
, /* first block allocated */
508 xfs_bmap_free_t
*flist
, /* blocks to free at commit */
509 int *flags
) /* inode logging flags */
511 xfs_da_args_t dargs
; /* args for dir/attr code */
512 int error
; /* error return value */
513 xfs_mount_t
*mp
; /* mount structure pointer */
515 if (ip
->i_df
.if_bytes
<= XFS_IFORK_DSIZE(ip
))
517 if ((ip
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
) {
519 memset(&dargs
, 0, sizeof(dargs
));
521 dargs
.firstblock
= firstblock
;
523 dargs
.total
= mp
->m_dirblkfsbs
;
524 dargs
.whichfork
= XFS_DATA_FORK
;
526 error
= XFS_DIR_SHORTFORM_TO_SINGLE(mp
, &dargs
);
528 error
= xfs_bmap_local_to_extents(tp
, ip
, firstblock
, 1, flags
,
534 * Called by xfs_bmapi to update extent list structure and the btree
535 * after allocating space (or doing a delayed allocation).
537 STATIC
int /* error */
539 xfs_inode_t
*ip
, /* incore inode pointer */
540 xfs_extnum_t idx
, /* extent number to update/insert */
541 xfs_btree_cur_t
**curp
, /* if *curp is null, not a btree */
542 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
543 xfs_fsblock_t
*first
, /* pointer to firstblock variable */
544 xfs_bmap_free_t
*flist
, /* list of extents to be freed */
545 int *logflagsp
, /* inode logging flags */
546 int whichfork
, /* data or attr fork */
547 int rsvd
) /* OK to use reserved data blocks */
549 xfs_btree_cur_t
*cur
; /* btree cursor or null */
550 xfs_filblks_t da_new
; /* new count del alloc blocks used */
551 xfs_filblks_t da_old
; /* old count del alloc blocks used */
552 int error
; /* error return value */
553 #ifdef XFS_BMAP_TRACE
554 static char fname
[] = "xfs_bmap_add_extent";
556 xfs_ifork_t
*ifp
; /* inode fork ptr */
557 int logflags
; /* returned value */
558 xfs_extnum_t nextents
; /* number of extents in file now */
560 XFS_STATS_INC(xs_add_exlist
);
562 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
563 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
564 ASSERT(idx
<= nextents
);
568 * This is the first extent added to a new/empty file.
569 * Special case this one, so other routines get to assume there are
570 * already extents in the list.
573 xfs_bmap_trace_insert(fname
, "insert empty", ip
, 0, 1, new,
575 xfs_bmap_insert_exlist(ip
, 0, 1, new, whichfork
);
578 if (!ISNULLSTARTBLOCK(new->br_startblock
)) {
579 XFS_IFORK_NEXT_SET(ip
, whichfork
, 1);
580 logflags
= XFS_ILOG_CORE
| XFS_ILOG_FEXT(whichfork
);
585 * Any kind of new delayed allocation goes here.
587 else if (ISNULLSTARTBLOCK(new->br_startblock
)) {
589 ASSERT((cur
->bc_private
.b
.flags
&
590 XFS_BTCUR_BPRV_WASDEL
) == 0);
591 if ((error
= xfs_bmap_add_extent_hole_delay(ip
, idx
, cur
, new,
596 * Real allocation off the end of the file.
598 else if (idx
== nextents
) {
600 ASSERT((cur
->bc_private
.b
.flags
&
601 XFS_BTCUR_BPRV_WASDEL
) == 0);
602 if ((error
= xfs_bmap_add_extent_hole_real(ip
, idx
, cur
, new,
603 &logflags
, whichfork
)))
606 xfs_bmbt_irec_t prev
; /* old extent at offset idx */
609 * Get the record referred to by idx.
611 xfs_bmbt_get_all(&ifp
->if_u1
.if_extents
[idx
], &prev
);
613 * If it's a real allocation record, and the new allocation ends
614 * after the start of the referred to record, then we're filling
615 * in a delayed or unwritten allocation with a real one, or
616 * converting real back to unwritten.
618 if (!ISNULLSTARTBLOCK(new->br_startblock
) &&
619 new->br_startoff
+ new->br_blockcount
> prev
.br_startoff
) {
620 if (prev
.br_state
!= XFS_EXT_UNWRITTEN
&&
621 ISNULLSTARTBLOCK(prev
.br_startblock
)) {
622 da_old
= STARTBLOCKVAL(prev
.br_startblock
);
624 ASSERT(cur
->bc_private
.b
.flags
&
625 XFS_BTCUR_BPRV_WASDEL
);
626 if ((error
= xfs_bmap_add_extent_delay_real(ip
,
627 idx
, &cur
, new, &da_new
, first
, flist
,
630 } else if (new->br_state
== XFS_EXT_NORM
) {
631 ASSERT(new->br_state
== XFS_EXT_NORM
);
632 if ((error
= xfs_bmap_add_extent_unwritten_real(
633 ip
, idx
, &cur
, new, &logflags
)))
636 ASSERT(new->br_state
== XFS_EXT_UNWRITTEN
);
637 if ((error
= xfs_bmap_add_extent_unwritten_real(
638 ip
, idx
, &cur
, new, &logflags
)))
641 ASSERT(*curp
== cur
|| *curp
== NULL
);
644 * Otherwise we're filling in a hole with an allocation.
648 ASSERT((cur
->bc_private
.b
.flags
&
649 XFS_BTCUR_BPRV_WASDEL
) == 0);
650 if ((error
= xfs_bmap_add_extent_hole_real(ip
, idx
, cur
,
651 new, &logflags
, whichfork
)))
656 ASSERT(*curp
== cur
|| *curp
== NULL
);
658 * Convert to a btree if necessary.
660 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_EXTENTS
&&
661 XFS_IFORK_NEXTENTS(ip
, whichfork
) > ifp
->if_ext_max
) {
662 int tmp_logflags
; /* partial log flag return val */
665 error
= xfs_bmap_extents_to_btree(ip
->i_transp
, ip
, first
,
666 flist
, &cur
, da_old
> 0, &tmp_logflags
, whichfork
);
667 logflags
|= tmp_logflags
;
672 * Adjust for changes in reserved delayed indirect blocks.
673 * Nothing to do for disk quotas here.
675 if (da_old
|| da_new
) {
680 nblks
+= cur
->bc_private
.b
.allocated
;
681 ASSERT(nblks
<= da_old
);
683 xfs_mod_incore_sb(ip
->i_mount
, XFS_SBS_FDBLOCKS
,
684 (int)(da_old
- nblks
), rsvd
);
687 * Clear out the allocated field, done with it now in any case.
690 cur
->bc_private
.b
.allocated
= 0;
696 xfs_bmap_check_leaf_extents(*curp
, ip
, whichfork
);
698 *logflagsp
= logflags
;
703 * Called by xfs_bmap_add_extent to handle cases converting a delayed
704 * allocation to a real allocation.
706 STATIC
int /* error */
707 xfs_bmap_add_extent_delay_real(
708 xfs_inode_t
*ip
, /* incore inode pointer */
709 xfs_extnum_t idx
, /* extent number to update/insert */
710 xfs_btree_cur_t
**curp
, /* if *curp is null, not a btree */
711 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
712 xfs_filblks_t
*dnew
, /* new delayed-alloc indirect blocks */
713 xfs_fsblock_t
*first
, /* pointer to firstblock variable */
714 xfs_bmap_free_t
*flist
, /* list of extents to be freed */
715 int *logflagsp
, /* inode logging flags */
716 int rsvd
) /* OK to use reserved data block allocation */
718 xfs_bmbt_rec_t
*base
; /* base of extent entry list */
719 xfs_btree_cur_t
*cur
; /* btree cursor */
720 int diff
; /* temp value */
721 xfs_bmbt_rec_t
*ep
; /* extent entry for idx */
722 int error
; /* error return value */
723 #ifdef XFS_BMAP_TRACE
724 static char fname
[] = "xfs_bmap_add_extent_delay_real";
726 int i
; /* temp state */
727 xfs_fileoff_t new_endoff
; /* end offset of new entry */
728 xfs_bmbt_irec_t r
[3]; /* neighbor extent entries */
729 /* left is 0, right is 1, prev is 2 */
730 int rval
=0; /* return value (logging flags) */
731 int state
= 0;/* state bits, accessed thru macros */
732 xfs_filblks_t temp
; /* value for dnew calculations */
733 xfs_filblks_t temp2
; /* value for dnew calculations */
734 int tmp_rval
; /* partial logging flags */
735 enum { /* bit number definitions for state */
736 LEFT_CONTIG
, RIGHT_CONTIG
,
737 LEFT_FILLING
, RIGHT_FILLING
,
738 LEFT_DELAY
, RIGHT_DELAY
,
739 LEFT_VALID
, RIGHT_VALID
745 #define MASK(b) (1 << (b))
746 #define MASK2(a,b) (MASK(a) | MASK(b))
747 #define MASK3(a,b,c) (MASK2(a,b) | MASK(c))
748 #define MASK4(a,b,c,d) (MASK3(a,b,c) | MASK(d))
749 #define STATE_SET(b,v) ((v) ? (state |= MASK(b)) : (state &= ~MASK(b)))
750 #define STATE_TEST(b) (state & MASK(b))
751 #define STATE_SET_TEST(b,v) ((v) ? ((state |= MASK(b)), 1) : \
752 ((state &= ~MASK(b)), 0))
753 #define SWITCH_STATE \
754 (state & MASK4(LEFT_FILLING, RIGHT_FILLING, LEFT_CONTIG, RIGHT_CONTIG))
757 * Set up a bunch of variables to make the tests simpler.
760 base
= ip
->i_df
.if_u1
.if_extents
;
762 xfs_bmbt_get_all(ep
, &PREV
);
763 new_endoff
= new->br_startoff
+ new->br_blockcount
;
764 ASSERT(PREV
.br_startoff
<= new->br_startoff
);
765 ASSERT(PREV
.br_startoff
+ PREV
.br_blockcount
>= new_endoff
);
767 * Set flags determining what part of the previous delayed allocation
768 * extent is being replaced by a real allocation.
770 STATE_SET(LEFT_FILLING
, PREV
.br_startoff
== new->br_startoff
);
771 STATE_SET(RIGHT_FILLING
,
772 PREV
.br_startoff
+ PREV
.br_blockcount
== new_endoff
);
774 * Check and set flags if this segment has a left neighbor.
775 * Don't set contiguous if the combined extent would be too large.
777 if (STATE_SET_TEST(LEFT_VALID
, idx
> 0)) {
778 xfs_bmbt_get_all(ep
- 1, &LEFT
);
779 STATE_SET(LEFT_DELAY
, ISNULLSTARTBLOCK(LEFT
.br_startblock
));
781 STATE_SET(LEFT_CONTIG
,
782 STATE_TEST(LEFT_VALID
) && !STATE_TEST(LEFT_DELAY
) &&
783 LEFT
.br_startoff
+ LEFT
.br_blockcount
== new->br_startoff
&&
784 LEFT
.br_startblock
+ LEFT
.br_blockcount
== new->br_startblock
&&
785 LEFT
.br_state
== new->br_state
&&
786 LEFT
.br_blockcount
+ new->br_blockcount
<= MAXEXTLEN
);
788 * Check and set flags if this segment has a right neighbor.
789 * Don't set contiguous if the combined extent would be too large.
790 * Also check for all-three-contiguous being too large.
792 if (STATE_SET_TEST(RIGHT_VALID
,
794 ip
->i_df
.if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
) - 1)) {
795 xfs_bmbt_get_all(ep
+ 1, &RIGHT
);
796 STATE_SET(RIGHT_DELAY
, ISNULLSTARTBLOCK(RIGHT
.br_startblock
));
798 STATE_SET(RIGHT_CONTIG
,
799 STATE_TEST(RIGHT_VALID
) && !STATE_TEST(RIGHT_DELAY
) &&
800 new_endoff
== RIGHT
.br_startoff
&&
801 new->br_startblock
+ new->br_blockcount
==
802 RIGHT
.br_startblock
&&
803 new->br_state
== RIGHT
.br_state
&&
804 new->br_blockcount
+ RIGHT
.br_blockcount
<= MAXEXTLEN
&&
805 ((state
& MASK3(LEFT_CONTIG
, LEFT_FILLING
, RIGHT_FILLING
)) !=
806 MASK3(LEFT_CONTIG
, LEFT_FILLING
, RIGHT_FILLING
) ||
807 LEFT
.br_blockcount
+ new->br_blockcount
+ RIGHT
.br_blockcount
811 * Switch out based on the FILLING and CONTIG state bits.
813 switch (SWITCH_STATE
) {
815 case MASK4(LEFT_FILLING
, RIGHT_FILLING
, LEFT_CONTIG
, RIGHT_CONTIG
):
817 * Filling in all of a previously delayed allocation extent.
818 * The left and right neighbors are both contiguous with new.
820 xfs_bmap_trace_pre_update(fname
, "LF|RF|LC|RC", ip
, idx
- 1,
822 xfs_bmbt_set_blockcount(ep
- 1,
823 LEFT
.br_blockcount
+ PREV
.br_blockcount
+
824 RIGHT
.br_blockcount
);
825 xfs_bmap_trace_post_update(fname
, "LF|RF|LC|RC", ip
, idx
- 1,
827 xfs_bmap_trace_delete(fname
, "LF|RF|LC|RC", ip
, idx
, 2,
829 xfs_bmap_delete_exlist(ip
, idx
, 2, XFS_DATA_FORK
);
830 ip
->i_df
.if_lastex
= idx
- 1;
831 ip
->i_d
.di_nextents
--;
833 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
835 rval
= XFS_ILOG_CORE
;
836 if ((error
= xfs_bmbt_lookup_eq(cur
, RIGHT
.br_startoff
,
838 RIGHT
.br_blockcount
, &i
)))
841 if ((error
= xfs_bmbt_delete(cur
, &i
)))
844 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
847 if ((error
= xfs_bmbt_update(cur
, LEFT
.br_startoff
,
851 RIGHT
.br_blockcount
, LEFT
.br_state
)))
857 case MASK3(LEFT_FILLING
, RIGHT_FILLING
, LEFT_CONTIG
):
859 * Filling in all of a previously delayed allocation extent.
860 * The left neighbor is contiguous, the right is not.
862 xfs_bmap_trace_pre_update(fname
, "LF|RF|LC", ip
, idx
- 1,
864 xfs_bmbt_set_blockcount(ep
- 1,
865 LEFT
.br_blockcount
+ PREV
.br_blockcount
);
866 xfs_bmap_trace_post_update(fname
, "LF|RF|LC", ip
, idx
- 1,
868 ip
->i_df
.if_lastex
= idx
- 1;
869 xfs_bmap_trace_delete(fname
, "LF|RF|LC", ip
, idx
, 1,
871 xfs_bmap_delete_exlist(ip
, idx
, 1, XFS_DATA_FORK
);
873 rval
= XFS_ILOG_DEXT
;
876 if ((error
= xfs_bmbt_lookup_eq(cur
, LEFT
.br_startoff
,
877 LEFT
.br_startblock
, LEFT
.br_blockcount
,
881 if ((error
= xfs_bmbt_update(cur
, LEFT
.br_startoff
,
884 PREV
.br_blockcount
, LEFT
.br_state
)))
890 case MASK3(LEFT_FILLING
, RIGHT_FILLING
, RIGHT_CONTIG
):
892 * Filling in all of a previously delayed allocation extent.
893 * The right neighbor is contiguous, the left is not.
895 xfs_bmap_trace_pre_update(fname
, "LF|RF|RC", ip
, idx
,
897 xfs_bmbt_set_startblock(ep
, new->br_startblock
);
898 xfs_bmbt_set_blockcount(ep
,
899 PREV
.br_blockcount
+ RIGHT
.br_blockcount
);
900 xfs_bmap_trace_post_update(fname
, "LF|RF|RC", ip
, idx
,
902 ip
->i_df
.if_lastex
= idx
;
903 xfs_bmap_trace_delete(fname
, "LF|RF|RC", ip
, idx
+ 1, 1,
905 xfs_bmap_delete_exlist(ip
, idx
+ 1, 1, XFS_DATA_FORK
);
907 rval
= XFS_ILOG_DEXT
;
910 if ((error
= xfs_bmbt_lookup_eq(cur
, RIGHT
.br_startoff
,
912 RIGHT
.br_blockcount
, &i
)))
915 if ((error
= xfs_bmbt_update(cur
, PREV
.br_startoff
,
918 RIGHT
.br_blockcount
, PREV
.br_state
)))
924 case MASK2(LEFT_FILLING
, RIGHT_FILLING
):
926 * Filling in all of a previously delayed allocation extent.
927 * Neither the left nor right neighbors are contiguous with
930 xfs_bmap_trace_pre_update(fname
, "LF|RF", ip
, idx
,
932 xfs_bmbt_set_startblock(ep
, new->br_startblock
);
933 xfs_bmap_trace_post_update(fname
, "LF|RF", ip
, idx
,
935 ip
->i_df
.if_lastex
= idx
;
936 ip
->i_d
.di_nextents
++;
938 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
940 rval
= XFS_ILOG_CORE
;
941 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
942 new->br_startblock
, new->br_blockcount
,
946 cur
->bc_rec
.b
.br_state
= XFS_EXT_NORM
;
947 if ((error
= xfs_bmbt_insert(cur
, &i
)))
954 case MASK2(LEFT_FILLING
, LEFT_CONTIG
):
956 * Filling in the first part of a previous delayed allocation.
957 * The left neighbor is contiguous.
959 xfs_bmap_trace_pre_update(fname
, "LF|LC", ip
, idx
- 1,
961 xfs_bmbt_set_blockcount(ep
- 1,
962 LEFT
.br_blockcount
+ new->br_blockcount
);
963 xfs_bmbt_set_startoff(ep
,
964 PREV
.br_startoff
+ new->br_blockcount
);
965 xfs_bmap_trace_post_update(fname
, "LF|LC", ip
, idx
- 1,
967 temp
= PREV
.br_blockcount
- new->br_blockcount
;
968 xfs_bmap_trace_pre_update(fname
, "LF|LC", ip
, idx
,
970 xfs_bmbt_set_blockcount(ep
, temp
);
971 ip
->i_df
.if_lastex
= idx
- 1;
973 rval
= XFS_ILOG_DEXT
;
976 if ((error
= xfs_bmbt_lookup_eq(cur
, LEFT
.br_startoff
,
977 LEFT
.br_startblock
, LEFT
.br_blockcount
,
981 if ((error
= xfs_bmbt_update(cur
, LEFT
.br_startoff
,
988 temp
= XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip
, temp
),
989 STARTBLOCKVAL(PREV
.br_startblock
));
990 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
991 xfs_bmap_trace_post_update(fname
, "LF|LC", ip
, idx
,
996 case MASK(LEFT_FILLING
):
998 * Filling in the first part of a previous delayed allocation.
999 * The left neighbor is not contiguous.
1001 xfs_bmap_trace_pre_update(fname
, "LF", ip
, idx
, XFS_DATA_FORK
);
1002 xfs_bmbt_set_startoff(ep
, new_endoff
);
1003 temp
= PREV
.br_blockcount
- new->br_blockcount
;
1004 xfs_bmbt_set_blockcount(ep
, temp
);
1005 xfs_bmap_trace_insert(fname
, "LF", ip
, idx
, 1, new, NULL
,
1007 xfs_bmap_insert_exlist(ip
, idx
, 1, new, XFS_DATA_FORK
);
1008 ip
->i_df
.if_lastex
= idx
;
1009 ip
->i_d
.di_nextents
++;
1011 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1013 rval
= XFS_ILOG_CORE
;
1014 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
1015 new->br_startblock
, new->br_blockcount
,
1019 cur
->bc_rec
.b
.br_state
= XFS_EXT_NORM
;
1020 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1024 if (ip
->i_d
.di_format
== XFS_DINODE_FMT_EXTENTS
&&
1025 ip
->i_d
.di_nextents
> ip
->i_df
.if_ext_max
) {
1026 error
= xfs_bmap_extents_to_btree(ip
->i_transp
, ip
,
1027 first
, flist
, &cur
, 1, &tmp_rval
,
1033 temp
= XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip
, temp
),
1034 STARTBLOCKVAL(PREV
.br_startblock
) -
1035 (cur
? cur
->bc_private
.b
.allocated
: 0));
1036 base
= ip
->i_df
.if_u1
.if_extents
;
1037 ep
= &base
[idx
+ 1];
1038 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
1039 xfs_bmap_trace_post_update(fname
, "LF", ip
, idx
+ 1,
1044 case MASK2(RIGHT_FILLING
, RIGHT_CONTIG
):
1046 * Filling in the last part of a previous delayed allocation.
1047 * The right neighbor is contiguous with the new allocation.
1049 temp
= PREV
.br_blockcount
- new->br_blockcount
;
1050 xfs_bmap_trace_pre_update(fname
, "RF|RC", ip
, idx
,
1052 xfs_bmap_trace_pre_update(fname
, "RF|RC", ip
, idx
+ 1,
1054 xfs_bmbt_set_blockcount(ep
, temp
);
1055 xfs_bmbt_set_allf(ep
+ 1, new->br_startoff
, new->br_startblock
,
1056 new->br_blockcount
+ RIGHT
.br_blockcount
,
1058 xfs_bmap_trace_post_update(fname
, "RF|RC", ip
, idx
+ 1,
1060 ip
->i_df
.if_lastex
= idx
+ 1;
1062 rval
= XFS_ILOG_DEXT
;
1065 if ((error
= xfs_bmbt_lookup_eq(cur
, RIGHT
.br_startoff
,
1066 RIGHT
.br_startblock
,
1067 RIGHT
.br_blockcount
, &i
)))
1070 if ((error
= xfs_bmbt_update(cur
, new->br_startoff
,
1072 new->br_blockcount
+
1073 RIGHT
.br_blockcount
,
1077 temp
= XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip
, temp
),
1078 STARTBLOCKVAL(PREV
.br_startblock
));
1079 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
1080 xfs_bmap_trace_post_update(fname
, "RF|RC", ip
, idx
,
1085 case MASK(RIGHT_FILLING
):
1087 * Filling in the last part of a previous delayed allocation.
1088 * The right neighbor is not contiguous.
1090 temp
= PREV
.br_blockcount
- new->br_blockcount
;
1091 xfs_bmap_trace_pre_update(fname
, "RF", ip
, idx
, XFS_DATA_FORK
);
1092 xfs_bmbt_set_blockcount(ep
, temp
);
1093 xfs_bmap_trace_insert(fname
, "RF", ip
, idx
+ 1, 1,
1094 new, NULL
, XFS_DATA_FORK
);
1095 xfs_bmap_insert_exlist(ip
, idx
+ 1, 1, new, XFS_DATA_FORK
);
1096 ip
->i_df
.if_lastex
= idx
+ 1;
1097 ip
->i_d
.di_nextents
++;
1099 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1101 rval
= XFS_ILOG_CORE
;
1102 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
1103 new->br_startblock
, new->br_blockcount
,
1107 cur
->bc_rec
.b
.br_state
= XFS_EXT_NORM
;
1108 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1112 if (ip
->i_d
.di_format
== XFS_DINODE_FMT_EXTENTS
&&
1113 ip
->i_d
.di_nextents
> ip
->i_df
.if_ext_max
) {
1114 error
= xfs_bmap_extents_to_btree(ip
->i_transp
, ip
,
1115 first
, flist
, &cur
, 1, &tmp_rval
,
1121 temp
= XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip
, temp
),
1122 STARTBLOCKVAL(PREV
.br_startblock
) -
1123 (cur
? cur
->bc_private
.b
.allocated
: 0));
1124 base
= ip
->i_df
.if_u1
.if_extents
;
1126 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
1127 xfs_bmap_trace_post_update(fname
, "RF", ip
, idx
, XFS_DATA_FORK
);
1133 * Filling in the middle part of a previous delayed allocation.
1134 * Contiguity is impossible here.
1135 * This case is avoided almost all the time.
1137 temp
= new->br_startoff
- PREV
.br_startoff
;
1138 xfs_bmap_trace_pre_update(fname
, "0", ip
, idx
, XFS_DATA_FORK
);
1139 xfs_bmbt_set_blockcount(ep
, temp
);
1141 r
[1].br_startoff
= new_endoff
;
1142 temp2
= PREV
.br_startoff
+ PREV
.br_blockcount
- new_endoff
;
1143 r
[1].br_blockcount
= temp2
;
1144 xfs_bmap_trace_insert(fname
, "0", ip
, idx
+ 1, 2, &r
[0], &r
[1],
1146 xfs_bmap_insert_exlist(ip
, idx
+ 1, 2, &r
[0], XFS_DATA_FORK
);
1147 ip
->i_df
.if_lastex
= idx
+ 1;
1148 ip
->i_d
.di_nextents
++;
1150 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1152 rval
= XFS_ILOG_CORE
;
1153 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
1154 new->br_startblock
, new->br_blockcount
,
1158 cur
->bc_rec
.b
.br_state
= XFS_EXT_NORM
;
1159 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1163 if (ip
->i_d
.di_format
== XFS_DINODE_FMT_EXTENTS
&&
1164 ip
->i_d
.di_nextents
> ip
->i_df
.if_ext_max
) {
1165 error
= xfs_bmap_extents_to_btree(ip
->i_transp
, ip
,
1166 first
, flist
, &cur
, 1, &tmp_rval
,
1172 temp
= xfs_bmap_worst_indlen(ip
, temp
);
1173 temp2
= xfs_bmap_worst_indlen(ip
, temp2
);
1174 diff
= (int)(temp
+ temp2
- STARTBLOCKVAL(PREV
.br_startblock
) -
1175 (cur
? cur
->bc_private
.b
.allocated
: 0));
1177 xfs_mod_incore_sb(ip
->i_mount
, XFS_SBS_FDBLOCKS
, -diff
, rsvd
)) {
1179 * Ick gross gag me with a spoon.
1181 ASSERT(0); /* want to see if this ever happens! */
1187 !xfs_mod_incore_sb(ip
->i_mount
,
1188 XFS_SBS_FDBLOCKS
, -diff
, rsvd
))
1195 !xfs_mod_incore_sb(ip
->i_mount
,
1196 XFS_SBS_FDBLOCKS
, -diff
, rsvd
))
1201 base
= ip
->i_df
.if_u1
.if_extents
;
1203 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
1204 xfs_bmap_trace_post_update(fname
, "0", ip
, idx
, XFS_DATA_FORK
);
1205 xfs_bmap_trace_pre_update(fname
, "0", ip
, idx
+ 2,
1207 xfs_bmbt_set_startblock(ep
+ 2, NULLSTARTBLOCK((int)temp2
));
1208 xfs_bmap_trace_post_update(fname
, "0", ip
, idx
+ 2,
1210 *dnew
= temp
+ temp2
;
1213 case MASK3(LEFT_FILLING
, LEFT_CONTIG
, RIGHT_CONTIG
):
1214 case MASK3(RIGHT_FILLING
, LEFT_CONTIG
, RIGHT_CONTIG
):
1215 case MASK2(LEFT_FILLING
, RIGHT_CONTIG
):
1216 case MASK2(RIGHT_FILLING
, LEFT_CONTIG
):
1217 case MASK2(LEFT_CONTIG
, RIGHT_CONTIG
):
1218 case MASK(LEFT_CONTIG
):
1219 case MASK(RIGHT_CONTIG
):
1221 * These cases are all impossible.
1238 #undef STATE_SET_TEST
1243 * Called by xfs_bmap_add_extent to handle cases converting an unwritten
1244 * allocation to a real allocation or vice versa.
1246 STATIC
int /* error */
1247 xfs_bmap_add_extent_unwritten_real(
1248 xfs_inode_t
*ip
, /* incore inode pointer */
1249 xfs_extnum_t idx
, /* extent number to update/insert */
1250 xfs_btree_cur_t
**curp
, /* if *curp is null, not a btree */
1251 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
1252 int *logflagsp
) /* inode logging flags */
1254 xfs_bmbt_rec_t
*base
; /* base of extent entry list */
1255 xfs_btree_cur_t
*cur
; /* btree cursor */
1256 xfs_bmbt_rec_t
*ep
; /* extent entry for idx */
1257 int error
; /* error return value */
1258 #ifdef XFS_BMAP_TRACE
1259 static char fname
[] = "xfs_bmap_add_extent_unwritten_real";
1261 int i
; /* temp state */
1262 xfs_fileoff_t new_endoff
; /* end offset of new entry */
1263 xfs_exntst_t newext
; /* new extent state */
1264 xfs_exntst_t oldext
; /* old extent state */
1265 xfs_bmbt_irec_t r
[3]; /* neighbor extent entries */
1266 /* left is 0, right is 1, prev is 2 */
1267 int rval
=0; /* return value (logging flags) */
1268 int state
= 0;/* state bits, accessed thru macros */
1269 enum { /* bit number definitions for state */
1270 LEFT_CONTIG
, RIGHT_CONTIG
,
1271 LEFT_FILLING
, RIGHT_FILLING
,
1272 LEFT_DELAY
, RIGHT_DELAY
,
1273 LEFT_VALID
, RIGHT_VALID
1279 #define MASK(b) (1 << (b))
1280 #define MASK2(a,b) (MASK(a) | MASK(b))
1281 #define MASK3(a,b,c) (MASK2(a,b) | MASK(c))
1282 #define MASK4(a,b,c,d) (MASK3(a,b,c) | MASK(d))
1283 #define STATE_SET(b,v) ((v) ? (state |= MASK(b)) : (state &= ~MASK(b)))
1284 #define STATE_TEST(b) (state & MASK(b))
1285 #define STATE_SET_TEST(b,v) ((v) ? ((state |= MASK(b)), 1) : \
1286 ((state &= ~MASK(b)), 0))
1287 #define SWITCH_STATE \
1288 (state & MASK4(LEFT_FILLING, RIGHT_FILLING, LEFT_CONTIG, RIGHT_CONTIG))
1291 * Set up a bunch of variables to make the tests simpler.
1295 base
= ip
->i_df
.if_u1
.if_extents
;
1297 xfs_bmbt_get_all(ep
, &PREV
);
1298 newext
= new->br_state
;
1299 oldext
= (newext
== XFS_EXT_UNWRITTEN
) ?
1300 XFS_EXT_NORM
: XFS_EXT_UNWRITTEN
;
1301 ASSERT(PREV
.br_state
== oldext
);
1302 new_endoff
= new->br_startoff
+ new->br_blockcount
;
1303 ASSERT(PREV
.br_startoff
<= new->br_startoff
);
1304 ASSERT(PREV
.br_startoff
+ PREV
.br_blockcount
>= new_endoff
);
1306 * Set flags determining what part of the previous oldext allocation
1307 * extent is being replaced by a newext allocation.
1309 STATE_SET(LEFT_FILLING
, PREV
.br_startoff
== new->br_startoff
);
1310 STATE_SET(RIGHT_FILLING
,
1311 PREV
.br_startoff
+ PREV
.br_blockcount
== new_endoff
);
1313 * Check and set flags if this segment has a left neighbor.
1314 * Don't set contiguous if the combined extent would be too large.
1316 if (STATE_SET_TEST(LEFT_VALID
, idx
> 0)) {
1317 xfs_bmbt_get_all(ep
- 1, &LEFT
);
1318 STATE_SET(LEFT_DELAY
, ISNULLSTARTBLOCK(LEFT
.br_startblock
));
1320 STATE_SET(LEFT_CONTIG
,
1321 STATE_TEST(LEFT_VALID
) && !STATE_TEST(LEFT_DELAY
) &&
1322 LEFT
.br_startoff
+ LEFT
.br_blockcount
== new->br_startoff
&&
1323 LEFT
.br_startblock
+ LEFT
.br_blockcount
== new->br_startblock
&&
1324 LEFT
.br_state
== newext
&&
1325 LEFT
.br_blockcount
+ new->br_blockcount
<= MAXEXTLEN
);
1327 * Check and set flags if this segment has a right neighbor.
1328 * Don't set contiguous if the combined extent would be too large.
1329 * Also check for all-three-contiguous being too large.
1331 if (STATE_SET_TEST(RIGHT_VALID
,
1333 ip
->i_df
.if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
) - 1)) {
1334 xfs_bmbt_get_all(ep
+ 1, &RIGHT
);
1335 STATE_SET(RIGHT_DELAY
, ISNULLSTARTBLOCK(RIGHT
.br_startblock
));
1337 STATE_SET(RIGHT_CONTIG
,
1338 STATE_TEST(RIGHT_VALID
) && !STATE_TEST(RIGHT_DELAY
) &&
1339 new_endoff
== RIGHT
.br_startoff
&&
1340 new->br_startblock
+ new->br_blockcount
==
1341 RIGHT
.br_startblock
&&
1342 newext
== RIGHT
.br_state
&&
1343 new->br_blockcount
+ RIGHT
.br_blockcount
<= MAXEXTLEN
&&
1344 ((state
& MASK3(LEFT_CONTIG
, LEFT_FILLING
, RIGHT_FILLING
)) !=
1345 MASK3(LEFT_CONTIG
, LEFT_FILLING
, RIGHT_FILLING
) ||
1346 LEFT
.br_blockcount
+ new->br_blockcount
+ RIGHT
.br_blockcount
1349 * Switch out based on the FILLING and CONTIG state bits.
1351 switch (SWITCH_STATE
) {
1353 case MASK4(LEFT_FILLING
, RIGHT_FILLING
, LEFT_CONTIG
, RIGHT_CONTIG
):
1355 * Setting all of a previous oldext extent to newext.
1356 * The left and right neighbors are both contiguous with new.
1358 xfs_bmap_trace_pre_update(fname
, "LF|RF|LC|RC", ip
, idx
- 1,
1360 xfs_bmbt_set_blockcount(ep
- 1,
1361 LEFT
.br_blockcount
+ PREV
.br_blockcount
+
1362 RIGHT
.br_blockcount
);
1363 xfs_bmap_trace_post_update(fname
, "LF|RF|LC|RC", ip
, idx
- 1,
1365 xfs_bmap_trace_delete(fname
, "LF|RF|LC|RC", ip
, idx
, 2,
1367 xfs_bmap_delete_exlist(ip
, idx
, 2, XFS_DATA_FORK
);
1368 ip
->i_df
.if_lastex
= idx
- 1;
1369 ip
->i_d
.di_nextents
-= 2;
1371 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1373 rval
= XFS_ILOG_CORE
;
1374 if ((error
= xfs_bmbt_lookup_eq(cur
, RIGHT
.br_startoff
,
1375 RIGHT
.br_startblock
,
1376 RIGHT
.br_blockcount
, &i
)))
1379 if ((error
= xfs_bmbt_delete(cur
, &i
)))
1382 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
1385 if ((error
= xfs_bmbt_delete(cur
, &i
)))
1388 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
1391 if ((error
= xfs_bmbt_update(cur
, LEFT
.br_startoff
,
1393 LEFT
.br_blockcount
+ PREV
.br_blockcount
+
1394 RIGHT
.br_blockcount
, LEFT
.br_state
)))
1399 case MASK3(LEFT_FILLING
, RIGHT_FILLING
, LEFT_CONTIG
):
1401 * Setting all of a previous oldext extent to newext.
1402 * The left neighbor is contiguous, the right is not.
1404 xfs_bmap_trace_pre_update(fname
, "LF|RF|LC", ip
, idx
- 1,
1406 xfs_bmbt_set_blockcount(ep
- 1,
1407 LEFT
.br_blockcount
+ PREV
.br_blockcount
);
1408 xfs_bmap_trace_post_update(fname
, "LF|RF|LC", ip
, idx
- 1,
1410 ip
->i_df
.if_lastex
= idx
- 1;
1411 xfs_bmap_trace_delete(fname
, "LF|RF|LC", ip
, idx
, 1,
1413 xfs_bmap_delete_exlist(ip
, idx
, 1, XFS_DATA_FORK
);
1414 ip
->i_d
.di_nextents
--;
1416 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1418 rval
= XFS_ILOG_CORE
;
1419 if ((error
= xfs_bmbt_lookup_eq(cur
, PREV
.br_startoff
,
1420 PREV
.br_startblock
, PREV
.br_blockcount
,
1424 if ((error
= xfs_bmbt_delete(cur
, &i
)))
1427 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
1430 if ((error
= xfs_bmbt_update(cur
, LEFT
.br_startoff
,
1432 LEFT
.br_blockcount
+ PREV
.br_blockcount
,
1438 case MASK3(LEFT_FILLING
, RIGHT_FILLING
, RIGHT_CONTIG
):
1440 * Setting all of a previous oldext extent to newext.
1441 * The right neighbor is contiguous, the left is not.
1443 xfs_bmap_trace_pre_update(fname
, "LF|RF|RC", ip
, idx
,
1445 xfs_bmbt_set_blockcount(ep
,
1446 PREV
.br_blockcount
+ RIGHT
.br_blockcount
);
1447 xfs_bmbt_set_state(ep
, newext
);
1448 xfs_bmap_trace_post_update(fname
, "LF|RF|RC", ip
, idx
,
1450 ip
->i_df
.if_lastex
= idx
;
1451 xfs_bmap_trace_delete(fname
, "LF|RF|RC", ip
, idx
+ 1, 1,
1453 xfs_bmap_delete_exlist(ip
, idx
+ 1, 1, XFS_DATA_FORK
);
1454 ip
->i_d
.di_nextents
--;
1456 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1458 rval
= XFS_ILOG_CORE
;
1459 if ((error
= xfs_bmbt_lookup_eq(cur
, RIGHT
.br_startoff
,
1460 RIGHT
.br_startblock
,
1461 RIGHT
.br_blockcount
, &i
)))
1464 if ((error
= xfs_bmbt_delete(cur
, &i
)))
1467 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
1470 if ((error
= xfs_bmbt_update(cur
, new->br_startoff
,
1472 new->br_blockcount
+ RIGHT
.br_blockcount
,
1478 case MASK2(LEFT_FILLING
, RIGHT_FILLING
):
1480 * Setting all of a previous oldext extent to newext.
1481 * Neither the left nor right neighbors are contiguous with
1484 xfs_bmap_trace_pre_update(fname
, "LF|RF", ip
, idx
,
1486 xfs_bmbt_set_state(ep
, newext
);
1487 xfs_bmap_trace_post_update(fname
, "LF|RF", ip
, idx
,
1489 ip
->i_df
.if_lastex
= idx
;
1491 rval
= XFS_ILOG_DEXT
;
1494 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
1495 new->br_startblock
, new->br_blockcount
,
1499 if ((error
= xfs_bmbt_update(cur
, new->br_startoff
,
1500 new->br_startblock
, new->br_blockcount
,
1506 case MASK2(LEFT_FILLING
, LEFT_CONTIG
):
1508 * Setting the first part of a previous oldext extent to newext.
1509 * The left neighbor is contiguous.
1511 xfs_bmap_trace_pre_update(fname
, "LF|LC", ip
, idx
- 1,
1513 xfs_bmbt_set_blockcount(ep
- 1,
1514 LEFT
.br_blockcount
+ new->br_blockcount
);
1515 xfs_bmbt_set_startoff(ep
,
1516 PREV
.br_startoff
+ new->br_blockcount
);
1517 xfs_bmap_trace_post_update(fname
, "LF|LC", ip
, idx
- 1,
1519 xfs_bmap_trace_pre_update(fname
, "LF|LC", ip
, idx
,
1521 xfs_bmbt_set_startblock(ep
,
1522 new->br_startblock
+ new->br_blockcount
);
1523 xfs_bmbt_set_blockcount(ep
,
1524 PREV
.br_blockcount
- new->br_blockcount
);
1525 xfs_bmap_trace_post_update(fname
, "LF|LC", ip
, idx
,
1527 ip
->i_df
.if_lastex
= idx
- 1;
1529 rval
= XFS_ILOG_DEXT
;
1532 if ((error
= xfs_bmbt_lookup_eq(cur
, PREV
.br_startoff
,
1533 PREV
.br_startblock
, PREV
.br_blockcount
,
1537 if ((error
= xfs_bmbt_update(cur
,
1538 PREV
.br_startoff
+ new->br_blockcount
,
1539 PREV
.br_startblock
+ new->br_blockcount
,
1540 PREV
.br_blockcount
- new->br_blockcount
,
1543 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
1545 if (xfs_bmbt_update(cur
, LEFT
.br_startoff
,
1547 LEFT
.br_blockcount
+ new->br_blockcount
,
1553 case MASK(LEFT_FILLING
):
1555 * Setting the first part of a previous oldext extent to newext.
1556 * The left neighbor is not contiguous.
1558 xfs_bmap_trace_pre_update(fname
, "LF", ip
, idx
, XFS_DATA_FORK
);
1559 ASSERT(ep
&& xfs_bmbt_get_state(ep
) == oldext
);
1560 xfs_bmbt_set_startoff(ep
, new_endoff
);
1561 xfs_bmbt_set_blockcount(ep
,
1562 PREV
.br_blockcount
- new->br_blockcount
);
1563 xfs_bmbt_set_startblock(ep
,
1564 new->br_startblock
+ new->br_blockcount
);
1565 xfs_bmap_trace_post_update(fname
, "LF", ip
, idx
, XFS_DATA_FORK
);
1566 xfs_bmap_trace_insert(fname
, "LF", ip
, idx
, 1, new, NULL
,
1568 xfs_bmap_insert_exlist(ip
, idx
, 1, new, XFS_DATA_FORK
);
1569 ip
->i_df
.if_lastex
= idx
;
1570 ip
->i_d
.di_nextents
++;
1572 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1574 rval
= XFS_ILOG_CORE
;
1575 if ((error
= xfs_bmbt_lookup_eq(cur
, PREV
.br_startoff
,
1576 PREV
.br_startblock
, PREV
.br_blockcount
,
1580 if ((error
= xfs_bmbt_update(cur
,
1581 PREV
.br_startoff
+ new->br_blockcount
,
1582 PREV
.br_startblock
+ new->br_blockcount
,
1583 PREV
.br_blockcount
- new->br_blockcount
,
1586 cur
->bc_rec
.b
= *new;
1587 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1593 case MASK2(RIGHT_FILLING
, RIGHT_CONTIG
):
1595 * Setting the last part of a previous oldext extent to newext.
1596 * The right neighbor is contiguous with the new allocation.
1598 xfs_bmap_trace_pre_update(fname
, "RF|RC", ip
, idx
,
1600 xfs_bmap_trace_pre_update(fname
, "RF|RC", ip
, idx
+ 1,
1602 xfs_bmbt_set_blockcount(ep
,
1603 PREV
.br_blockcount
- new->br_blockcount
);
1604 xfs_bmap_trace_post_update(fname
, "RF|RC", ip
, idx
,
1606 xfs_bmbt_set_allf(ep
+ 1, new->br_startoff
, new->br_startblock
,
1607 new->br_blockcount
+ RIGHT
.br_blockcount
, newext
);
1608 xfs_bmap_trace_post_update(fname
, "RF|RC", ip
, idx
+ 1,
1610 ip
->i_df
.if_lastex
= idx
+ 1;
1612 rval
= XFS_ILOG_DEXT
;
1615 if ((error
= xfs_bmbt_lookup_eq(cur
, PREV
.br_startoff
,
1617 PREV
.br_blockcount
, &i
)))
1620 if ((error
= xfs_bmbt_update(cur
, PREV
.br_startoff
,
1622 PREV
.br_blockcount
- new->br_blockcount
,
1625 if ((error
= xfs_bmbt_increment(cur
, 0, &i
)))
1627 if ((error
= xfs_bmbt_update(cur
, new->br_startoff
,
1629 new->br_blockcount
+ RIGHT
.br_blockcount
,
1635 case MASK(RIGHT_FILLING
):
1637 * Setting the last part of a previous oldext extent to newext.
1638 * The right neighbor is not contiguous.
1640 xfs_bmap_trace_pre_update(fname
, "RF", ip
, idx
, XFS_DATA_FORK
);
1641 xfs_bmbt_set_blockcount(ep
,
1642 PREV
.br_blockcount
- new->br_blockcount
);
1643 xfs_bmap_trace_post_update(fname
, "RF", ip
, idx
, XFS_DATA_FORK
);
1644 xfs_bmap_trace_insert(fname
, "RF", ip
, idx
+ 1, 1,
1645 new, NULL
, XFS_DATA_FORK
);
1646 xfs_bmap_insert_exlist(ip
, idx
+ 1, 1, new, XFS_DATA_FORK
);
1647 ip
->i_df
.if_lastex
= idx
+ 1;
1648 ip
->i_d
.di_nextents
++;
1650 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1652 rval
= XFS_ILOG_CORE
;
1653 if ((error
= xfs_bmbt_lookup_eq(cur
, PREV
.br_startoff
,
1654 PREV
.br_startblock
, PREV
.br_blockcount
,
1658 if ((error
= xfs_bmbt_update(cur
, PREV
.br_startoff
,
1660 PREV
.br_blockcount
- new->br_blockcount
,
1663 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
1664 new->br_startblock
, new->br_blockcount
,
1668 cur
->bc_rec
.b
.br_state
= XFS_EXT_NORM
;
1669 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1677 * Setting the middle part of a previous oldext extent to
1678 * newext. Contiguity is impossible here.
1679 * One extent becomes three extents.
1681 xfs_bmap_trace_pre_update(fname
, "0", ip
, idx
, XFS_DATA_FORK
);
1682 xfs_bmbt_set_blockcount(ep
,
1683 new->br_startoff
- PREV
.br_startoff
);
1684 xfs_bmap_trace_post_update(fname
, "0", ip
, idx
, XFS_DATA_FORK
);
1686 r
[1].br_startoff
= new_endoff
;
1687 r
[1].br_blockcount
=
1688 PREV
.br_startoff
+ PREV
.br_blockcount
- new_endoff
;
1689 r
[1].br_startblock
= new->br_startblock
+ new->br_blockcount
;
1690 r
[1].br_state
= oldext
;
1691 xfs_bmap_trace_insert(fname
, "0", ip
, idx
+ 1, 2, &r
[0], &r
[1],
1693 xfs_bmap_insert_exlist(ip
, idx
+ 1, 2, &r
[0], XFS_DATA_FORK
);
1694 ip
->i_df
.if_lastex
= idx
+ 1;
1695 ip
->i_d
.di_nextents
+= 2;
1697 rval
= XFS_ILOG_CORE
| XFS_ILOG_DEXT
;
1699 rval
= XFS_ILOG_CORE
;
1700 if ((error
= xfs_bmbt_lookup_eq(cur
, PREV
.br_startoff
,
1701 PREV
.br_startblock
, PREV
.br_blockcount
,
1705 /* new right extent - oldext */
1706 if ((error
= xfs_bmbt_update(cur
, r
[1].br_startoff
,
1707 r
[1].br_startblock
, r
[1].br_blockcount
,
1710 /* new left extent - oldext */
1711 PREV
.br_blockcount
=
1712 new->br_startoff
- PREV
.br_startoff
;
1713 cur
->bc_rec
.b
= PREV
;
1714 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1717 if ((error
= xfs_bmbt_increment(cur
, 0, &i
)))
1720 /* new middle extent - newext */
1721 cur
->bc_rec
.b
= *new;
1722 if ((error
= xfs_bmbt_insert(cur
, &i
)))
1728 case MASK3(LEFT_FILLING
, LEFT_CONTIG
, RIGHT_CONTIG
):
1729 case MASK3(RIGHT_FILLING
, LEFT_CONTIG
, RIGHT_CONTIG
):
1730 case MASK2(LEFT_FILLING
, RIGHT_CONTIG
):
1731 case MASK2(RIGHT_FILLING
, LEFT_CONTIG
):
1732 case MASK2(LEFT_CONTIG
, RIGHT_CONTIG
):
1733 case MASK(LEFT_CONTIG
):
1734 case MASK(RIGHT_CONTIG
):
1736 * These cases are all impossible.
1753 #undef STATE_SET_TEST
1758 * Called by xfs_bmap_add_extent to handle cases converting a hole
1759 * to a delayed allocation.
1762 STATIC
int /* error */
1763 xfs_bmap_add_extent_hole_delay(
1764 xfs_inode_t
*ip
, /* incore inode pointer */
1765 xfs_extnum_t idx
, /* extent number to update/insert */
1766 xfs_btree_cur_t
*cur
, /* if null, not a btree */
1767 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
1768 int *logflagsp
, /* inode logging flags */
1769 int rsvd
) /* OK to allocate reserved blocks */
1771 xfs_bmbt_rec_t
*base
; /* base of extent entry list */
1772 xfs_bmbt_rec_t
*ep
; /* extent list entry for idx */
1773 #ifdef XFS_BMAP_TRACE
1774 static char fname
[] = "xfs_bmap_add_extent_hole_delay";
1776 xfs_bmbt_irec_t left
; /* left neighbor extent entry */
1777 xfs_filblks_t newlen
=0; /* new indirect size */
1778 xfs_filblks_t oldlen
=0; /* old indirect size */
1779 xfs_bmbt_irec_t right
; /* right neighbor extent entry */
1780 int state
; /* state bits, accessed thru macros */
1781 xfs_filblks_t temp
; /* temp for indirect calculations */
1782 enum { /* bit number definitions for state */
1783 LEFT_CONTIG
, RIGHT_CONTIG
,
1784 LEFT_DELAY
, RIGHT_DELAY
,
1785 LEFT_VALID
, RIGHT_VALID
1788 #define MASK(b) (1 << (b))
1789 #define MASK2(a,b) (MASK(a) | MASK(b))
1790 #define STATE_SET(b,v) ((v) ? (state |= MASK(b)) : (state &= ~MASK(b)))
1791 #define STATE_TEST(b) (state & MASK(b))
1792 #define STATE_SET_TEST(b,v) ((v) ? ((state |= MASK(b)), 1) : \
1793 ((state &= ~MASK(b)), 0))
1794 #define SWITCH_STATE (state & MASK2(LEFT_CONTIG, RIGHT_CONTIG))
1796 base
= ip
->i_df
.if_u1
.if_extents
;
1799 ASSERT(ISNULLSTARTBLOCK(new->br_startblock
));
1801 * Check and set flags if this segment has a left neighbor
1803 if (STATE_SET_TEST(LEFT_VALID
, idx
> 0)) {
1804 xfs_bmbt_get_all(ep
- 1, &left
);
1805 STATE_SET(LEFT_DELAY
, ISNULLSTARTBLOCK(left
.br_startblock
));
1808 * Check and set flags if the current (right) segment exists.
1809 * If it doesn't exist, we're converting the hole at end-of-file.
1811 if (STATE_SET_TEST(RIGHT_VALID
,
1813 ip
->i_df
.if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
))) {
1814 xfs_bmbt_get_all(ep
, &right
);
1815 STATE_SET(RIGHT_DELAY
, ISNULLSTARTBLOCK(right
.br_startblock
));
1818 * Set contiguity flags on the left and right neighbors.
1819 * Don't let extents get too large, even if the pieces are contiguous.
1821 STATE_SET(LEFT_CONTIG
,
1822 STATE_TEST(LEFT_VALID
) && STATE_TEST(LEFT_DELAY
) &&
1823 left
.br_startoff
+ left
.br_blockcount
== new->br_startoff
&&
1824 left
.br_blockcount
+ new->br_blockcount
<= MAXEXTLEN
);
1825 STATE_SET(RIGHT_CONTIG
,
1826 STATE_TEST(RIGHT_VALID
) && STATE_TEST(RIGHT_DELAY
) &&
1827 new->br_startoff
+ new->br_blockcount
== right
.br_startoff
&&
1828 new->br_blockcount
+ right
.br_blockcount
<= MAXEXTLEN
&&
1829 (!STATE_TEST(LEFT_CONTIG
) ||
1830 (left
.br_blockcount
+ new->br_blockcount
+
1831 right
.br_blockcount
<= MAXEXTLEN
)));
1833 * Switch out based on the contiguity flags.
1835 switch (SWITCH_STATE
) {
1837 case MASK2(LEFT_CONTIG
, RIGHT_CONTIG
):
1839 * New allocation is contiguous with delayed allocations
1840 * on the left and on the right.
1841 * Merge all three into a single extent list entry.
1843 temp
= left
.br_blockcount
+ new->br_blockcount
+
1844 right
.br_blockcount
;
1845 xfs_bmap_trace_pre_update(fname
, "LC|RC", ip
, idx
- 1,
1847 xfs_bmbt_set_blockcount(ep
- 1, temp
);
1848 oldlen
= STARTBLOCKVAL(left
.br_startblock
) +
1849 STARTBLOCKVAL(new->br_startblock
) +
1850 STARTBLOCKVAL(right
.br_startblock
);
1851 newlen
= xfs_bmap_worst_indlen(ip
, temp
);
1852 xfs_bmbt_set_startblock(ep
- 1, NULLSTARTBLOCK((int)newlen
));
1853 xfs_bmap_trace_post_update(fname
, "LC|RC", ip
, idx
- 1,
1855 xfs_bmap_trace_delete(fname
, "LC|RC", ip
, idx
, 1,
1857 xfs_bmap_delete_exlist(ip
, idx
, 1, XFS_DATA_FORK
);
1858 ip
->i_df
.if_lastex
= idx
- 1;
1861 case MASK(LEFT_CONTIG
):
1863 * New allocation is contiguous with a delayed allocation
1865 * Merge the new allocation with the left neighbor.
1867 temp
= left
.br_blockcount
+ new->br_blockcount
;
1868 xfs_bmap_trace_pre_update(fname
, "LC", ip
, idx
- 1,
1870 xfs_bmbt_set_blockcount(ep
- 1, temp
);
1871 oldlen
= STARTBLOCKVAL(left
.br_startblock
) +
1872 STARTBLOCKVAL(new->br_startblock
);
1873 newlen
= xfs_bmap_worst_indlen(ip
, temp
);
1874 xfs_bmbt_set_startblock(ep
- 1, NULLSTARTBLOCK((int)newlen
));
1875 xfs_bmap_trace_post_update(fname
, "LC", ip
, idx
- 1,
1877 ip
->i_df
.if_lastex
= idx
- 1;
1880 case MASK(RIGHT_CONTIG
):
1882 * New allocation is contiguous with a delayed allocation
1884 * Merge the new allocation with the right neighbor.
1886 xfs_bmap_trace_pre_update(fname
, "RC", ip
, idx
, XFS_DATA_FORK
);
1887 temp
= new->br_blockcount
+ right
.br_blockcount
;
1888 oldlen
= STARTBLOCKVAL(new->br_startblock
) +
1889 STARTBLOCKVAL(right
.br_startblock
);
1890 newlen
= xfs_bmap_worst_indlen(ip
, temp
);
1891 xfs_bmbt_set_allf(ep
, new->br_startoff
,
1892 NULLSTARTBLOCK((int)newlen
), temp
, right
.br_state
);
1893 xfs_bmap_trace_post_update(fname
, "RC", ip
, idx
, XFS_DATA_FORK
);
1894 ip
->i_df
.if_lastex
= idx
;
1899 * New allocation is not contiguous with another
1900 * delayed allocation.
1901 * Insert a new entry.
1903 oldlen
= newlen
= 0;
1904 xfs_bmap_trace_insert(fname
, "0", ip
, idx
, 1, new, NULL
,
1906 xfs_bmap_insert_exlist(ip
, idx
, 1, new, XFS_DATA_FORK
);
1907 ip
->i_df
.if_lastex
= idx
;
1910 if (oldlen
!= newlen
) {
1911 ASSERT(oldlen
> newlen
);
1912 xfs_mod_incore_sb(ip
->i_mount
, XFS_SBS_FDBLOCKS
,
1913 (int)(oldlen
- newlen
), rsvd
);
1915 * Nothing to do for disk quota accounting here.
1924 #undef STATE_SET_TEST
1929 * Called by xfs_bmap_add_extent to handle cases converting a hole
1930 * to a real allocation.
1932 STATIC
int /* error */
1933 xfs_bmap_add_extent_hole_real(
1934 xfs_inode_t
*ip
, /* incore inode pointer */
1935 xfs_extnum_t idx
, /* extent number to update/insert */
1936 xfs_btree_cur_t
*cur
, /* if null, not a btree */
1937 xfs_bmbt_irec_t
*new, /* new data to put in extent list */
1938 int *logflagsp
, /* inode logging flags */
1939 int whichfork
) /* data or attr fork */
1941 xfs_bmbt_rec_t
*ep
; /* pointer to extent entry ins. point */
1942 int error
; /* error return value */
1943 #ifdef XFS_BMAP_TRACE
1944 static char fname
[] = "xfs_bmap_add_extent_hole_real";
1946 int i
; /* temp state */
1947 xfs_ifork_t
*ifp
; /* inode fork pointer */
1948 xfs_bmbt_irec_t left
; /* left neighbor extent entry */
1949 xfs_bmbt_irec_t right
; /* right neighbor extent entry */
1950 int state
; /* state bits, accessed thru macros */
1951 enum { /* bit number definitions for state */
1952 LEFT_CONTIG
, RIGHT_CONTIG
,
1953 LEFT_DELAY
, RIGHT_DELAY
,
1954 LEFT_VALID
, RIGHT_VALID
1957 #define MASK(b) (1 << (b))
1958 #define MASK2(a,b) (MASK(a) | MASK(b))
1959 #define STATE_SET(b,v) ((v) ? (state |= MASK(b)) : (state &= ~MASK(b)))
1960 #define STATE_TEST(b) (state & MASK(b))
1961 #define STATE_SET_TEST(b,v) ((v) ? ((state |= MASK(b)), 1) : \
1962 ((state &= ~MASK(b)), 0))
1963 #define SWITCH_STATE (state & MASK2(LEFT_CONTIG, RIGHT_CONTIG))
1965 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
1966 ASSERT(idx
<= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
));
1967 ep
= &ifp
->if_u1
.if_extents
[idx
];
1970 * Check and set flags if this segment has a left neighbor.
1972 if (STATE_SET_TEST(LEFT_VALID
, idx
> 0)) {
1973 xfs_bmbt_get_all(ep
- 1, &left
);
1974 STATE_SET(LEFT_DELAY
, ISNULLSTARTBLOCK(left
.br_startblock
));
1977 * Check and set flags if this segment has a current value.
1978 * Not true if we're inserting into the "hole" at eof.
1980 if (STATE_SET_TEST(RIGHT_VALID
,
1982 ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
))) {
1983 xfs_bmbt_get_all(ep
, &right
);
1984 STATE_SET(RIGHT_DELAY
, ISNULLSTARTBLOCK(right
.br_startblock
));
1987 * We're inserting a real allocation between "left" and "right".
1988 * Set the contiguity flags. Don't let extents get too large.
1990 STATE_SET(LEFT_CONTIG
,
1991 STATE_TEST(LEFT_VALID
) && !STATE_TEST(LEFT_DELAY
) &&
1992 left
.br_startoff
+ left
.br_blockcount
== new->br_startoff
&&
1993 left
.br_startblock
+ left
.br_blockcount
== new->br_startblock
&&
1994 left
.br_state
== new->br_state
&&
1995 left
.br_blockcount
+ new->br_blockcount
<= MAXEXTLEN
);
1996 STATE_SET(RIGHT_CONTIG
,
1997 STATE_TEST(RIGHT_VALID
) && !STATE_TEST(RIGHT_DELAY
) &&
1998 new->br_startoff
+ new->br_blockcount
== right
.br_startoff
&&
1999 new->br_startblock
+ new->br_blockcount
==
2000 right
.br_startblock
&&
2001 new->br_state
== right
.br_state
&&
2002 new->br_blockcount
+ right
.br_blockcount
<= MAXEXTLEN
&&
2003 (!STATE_TEST(LEFT_CONTIG
) ||
2004 left
.br_blockcount
+ new->br_blockcount
+
2005 right
.br_blockcount
<= MAXEXTLEN
));
2008 * Select which case we're in here, and implement it.
2010 switch (SWITCH_STATE
) {
2012 case MASK2(LEFT_CONTIG
, RIGHT_CONTIG
):
2014 * New allocation is contiguous with real allocations on the
2015 * left and on the right.
2016 * Merge all three into a single extent list entry.
2018 xfs_bmap_trace_pre_update(fname
, "LC|RC", ip
, idx
- 1,
2020 xfs_bmbt_set_blockcount(ep
- 1,
2021 left
.br_blockcount
+ new->br_blockcount
+
2022 right
.br_blockcount
);
2023 xfs_bmap_trace_post_update(fname
, "LC|RC", ip
, idx
- 1,
2025 xfs_bmap_trace_delete(fname
, "LC|RC", ip
,
2027 xfs_bmap_delete_exlist(ip
, idx
, 1, whichfork
);
2028 ifp
->if_lastex
= idx
- 1;
2029 XFS_IFORK_NEXT_SET(ip
, whichfork
,
2030 XFS_IFORK_NEXTENTS(ip
, whichfork
) - 1);
2032 *logflagsp
= XFS_ILOG_CORE
| XFS_ILOG_FEXT(whichfork
);
2035 *logflagsp
= XFS_ILOG_CORE
;
2036 if ((error
= xfs_bmbt_lookup_eq(cur
, right
.br_startoff
,
2037 right
.br_startblock
, right
.br_blockcount
, &i
)))
2040 if ((error
= xfs_bmbt_delete(cur
, &i
)))
2043 if ((error
= xfs_bmbt_decrement(cur
, 0, &i
)))
2046 error
= xfs_bmbt_update(cur
, left
.br_startoff
,
2048 left
.br_blockcount
+ new->br_blockcount
+
2049 right
.br_blockcount
, left
.br_state
);
2052 case MASK(LEFT_CONTIG
):
2054 * New allocation is contiguous with a real allocation
2056 * Merge the new allocation with the left neighbor.
2058 xfs_bmap_trace_pre_update(fname
, "LC", ip
, idx
- 1, whichfork
);
2059 xfs_bmbt_set_blockcount(ep
- 1,
2060 left
.br_blockcount
+ new->br_blockcount
);
2061 xfs_bmap_trace_post_update(fname
, "LC", ip
, idx
- 1, whichfork
);
2062 ifp
->if_lastex
= idx
- 1;
2064 *logflagsp
= XFS_ILOG_FEXT(whichfork
);
2068 if ((error
= xfs_bmbt_lookup_eq(cur
, left
.br_startoff
,
2069 left
.br_startblock
, left
.br_blockcount
, &i
)))
2072 error
= xfs_bmbt_update(cur
, left
.br_startoff
,
2074 left
.br_blockcount
+ new->br_blockcount
,
2078 case MASK(RIGHT_CONTIG
):
2080 * New allocation is contiguous with a real allocation
2082 * Merge the new allocation with the right neighbor.
2084 xfs_bmap_trace_pre_update(fname
, "RC", ip
, idx
, whichfork
);
2085 xfs_bmbt_set_allf(ep
, new->br_startoff
, new->br_startblock
,
2086 new->br_blockcount
+ right
.br_blockcount
,
2088 xfs_bmap_trace_post_update(fname
, "RC", ip
, idx
, whichfork
);
2089 ifp
->if_lastex
= idx
;
2091 *logflagsp
= XFS_ILOG_FEXT(whichfork
);
2095 if ((error
= xfs_bmbt_lookup_eq(cur
, right
.br_startoff
,
2096 right
.br_startblock
, right
.br_blockcount
, &i
)))
2099 error
= xfs_bmbt_update(cur
, new->br_startoff
,
2101 new->br_blockcount
+ right
.br_blockcount
,
2107 * New allocation is not contiguous with another
2109 * Insert a new entry.
2111 xfs_bmap_trace_insert(fname
, "0", ip
, idx
, 1, new, NULL
,
2113 xfs_bmap_insert_exlist(ip
, idx
, 1, new, whichfork
);
2114 ifp
->if_lastex
= idx
;
2115 XFS_IFORK_NEXT_SET(ip
, whichfork
,
2116 XFS_IFORK_NEXTENTS(ip
, whichfork
) + 1);
2118 *logflagsp
= XFS_ILOG_CORE
| XFS_ILOG_FEXT(whichfork
);
2121 *logflagsp
= XFS_ILOG_CORE
;
2122 if ((error
= xfs_bmbt_lookup_eq(cur
, new->br_startoff
,
2123 new->br_startblock
, new->br_blockcount
, &i
)))
2126 cur
->bc_rec
.b
.br_state
= new->br_state
;
2127 if ((error
= xfs_bmbt_insert(cur
, &i
)))
2136 #undef STATE_SET_TEST
2140 return 0; /* keep gcc quite */
2143 #define XFS_ALLOC_GAP_UNITS 4
2146 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
2147 * It figures out where to ask the underlying allocator to put the new extent.
2149 STATIC
int /* error */
2151 xfs_bmalloca_t
*ap
) /* bmap alloc argument struct */
2153 xfs_fsblock_t adjust
; /* adjustment to block numbers */
2154 xfs_alloctype_t atype
=0; /* type for allocation routines */
2155 int error
; /* error return value */
2156 xfs_agnumber_t fb_agno
; /* ag number of ap->firstblock */
2157 xfs_mount_t
*mp
; /* mount point structure */
2158 int nullfb
; /* true if ap->firstblock isn't set */
2159 int rt
; /* true if inode is realtime */
2161 xfs_extlen_t prod
=0; /* product factor for allocators */
2162 xfs_extlen_t ralen
=0; /* realtime allocation length */
2165 #define ISVALID(x,y) \
2167 (x) < mp->m_sb.sb_rblocks : \
2168 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \
2169 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \
2170 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks)
2175 mp
= ap
->ip
->i_mount
;
2176 nullfb
= ap
->firstblock
== NULLFSBLOCK
;
2177 rt
= XFS_IS_REALTIME_INODE(ap
->ip
) && ap
->userdata
;
2178 fb_agno
= nullfb
? NULLAGNUMBER
: XFS_FSB_TO_AGNO(mp
, ap
->firstblock
);
2181 xfs_extlen_t extsz
; /* file extent size for rt */
2182 xfs_fileoff_t nexto
; /* next file offset */
2183 xfs_extlen_t orig_alen
; /* original ap->alen */
2184 xfs_fileoff_t orig_end
; /* original off+len */
2185 xfs_fileoff_t orig_off
; /* original ap->off */
2186 xfs_extlen_t mod_off
; /* modulus calculations */
2187 xfs_fileoff_t prevo
; /* previous file offset */
2188 xfs_rtblock_t rtx
; /* realtime extent number */
2189 xfs_extlen_t temp
; /* temp for rt calculations */
2192 * Set prod to match the realtime extent size.
2194 if (!(extsz
= ap
->ip
->i_d
.di_extsize
))
2195 extsz
= mp
->m_sb
.sb_rextsize
;
2196 prod
= extsz
/ mp
->m_sb
.sb_rextsize
;
2198 orig_alen
= ap
->alen
;
2199 orig_end
= orig_off
+ orig_alen
;
2201 * If the file offset is unaligned vs. the extent size
2202 * we need to align it. This will be possible unless
2203 * the file was previously written with a kernel that didn't
2204 * perform this alignment.
2206 mod_off
= do_mod(orig_off
, extsz
);
2208 ap
->alen
+= mod_off
;
2212 * Same adjustment for the end of the requested area.
2214 if ((temp
= (ap
->alen
% extsz
)))
2215 ap
->alen
+= extsz
- temp
;
2217 * If the previous block overlaps with this proposed allocation
2218 * then move the start forward without adjusting the length.
2221 ap
->prevp
->br_startoff
== NULLFILEOFF
?
2223 (ap
->prevp
->br_startoff
+
2224 ap
->prevp
->br_blockcount
);
2225 if (ap
->off
!= orig_off
&& ap
->off
< prevo
)
2228 * If the next block overlaps with this proposed allocation
2229 * then move the start back without adjusting the length,
2230 * but not before offset 0.
2231 * This may of course make the start overlap previous block,
2232 * and if we hit the offset 0 limit then the next block
2233 * can still overlap too.
2235 nexto
= (ap
->eof
|| ap
->gotp
->br_startoff
== NULLFILEOFF
) ?
2236 NULLFILEOFF
: ap
->gotp
->br_startoff
;
2238 ap
->off
+ ap
->alen
!= orig_end
&&
2239 ap
->off
+ ap
->alen
> nexto
)
2240 ap
->off
= nexto
> ap
->alen
? nexto
- ap
->alen
: 0;
2242 * If we're now overlapping the next or previous extent that
2243 * means we can't fit an extsz piece in this hole. Just move
2244 * the start forward to the first valid spot and set
2245 * the length so we hit the end.
2247 if ((ap
->off
!= orig_off
&& ap
->off
< prevo
) ||
2248 (ap
->off
+ ap
->alen
!= orig_end
&&
2249 ap
->off
+ ap
->alen
> nexto
)) {
2251 ap
->alen
= nexto
- prevo
;
2254 * If the result isn't a multiple of rtextents we need to
2255 * remove blocks until it is.
2257 if ((temp
= (ap
->alen
% mp
->m_sb
.sb_rextsize
))) {
2259 * We're not covering the original request, or
2260 * we won't be able to once we fix the length.
2262 if (orig_off
< ap
->off
||
2263 orig_end
> ap
->off
+ ap
->alen
||
2264 ap
->alen
- temp
< orig_alen
)
2265 return XFS_ERROR(EINVAL
);
2267 * Try to fix it by moving the start up.
2269 if (ap
->off
+ temp
<= orig_off
) {
2274 * Try to fix it by moving the end in.
2276 else if (ap
->off
+ ap
->alen
- temp
>= orig_end
)
2279 * Set the start to the minimum then trim the length.
2282 ap
->alen
-= orig_off
- ap
->off
;
2284 ap
->alen
-= ap
->alen
% mp
->m_sb
.sb_rextsize
;
2287 * Result doesn't cover the request, fail it.
2289 if (orig_off
< ap
->off
|| orig_end
> ap
->off
+ ap
->alen
)
2290 return XFS_ERROR(EINVAL
);
2292 ASSERT(ap
->alen
% mp
->m_sb
.sb_rextsize
== 0);
2294 * If the offset & length are not perfectly aligned
2295 * then kill prod, it will just get us in trouble.
2297 if (do_mod(ap
->off
, extsz
) || ap
->alen
% extsz
)
2300 * Set ralen to be the actual requested length in rtextents.
2302 ralen
= ap
->alen
/ mp
->m_sb
.sb_rextsize
;
2304 * If the old value was close enough to MAXEXTLEN that
2305 * we rounded up to it, cut it back so it's valid again.
2306 * Note that if it's a really large request (bigger than
2307 * MAXEXTLEN), we don't hear about that number, and can't
2308 * adjust the starting point to match it.
2310 if (ralen
* mp
->m_sb
.sb_rextsize
>= MAXEXTLEN
)
2311 ralen
= MAXEXTLEN
/ mp
->m_sb
.sb_rextsize
;
2313 * If it's an allocation to an empty file at offset 0,
2314 * pick an extent that will space things out in the rt area.
2316 if (ap
->eof
&& ap
->off
== 0) {
2317 error
= xfs_rtpick_extent(mp
, ap
->tp
, ralen
, &rtx
);
2320 ap
->rval
= rtx
* mp
->m_sb
.sb_rextsize
;
2327 #endif /* __KERNEL__ */
2329 ap
->rval
= XFS_INO_TO_FSB(mp
, ap
->ip
->i_ino
);
2331 ap
->rval
= ap
->firstblock
;
2333 * If allocating at eof, and there's a previous real block,
2334 * try to use it's last block as our starting point.
2336 if (ap
->eof
&& ap
->prevp
->br_startoff
!= NULLFILEOFF
&&
2337 !ISNULLSTARTBLOCK(ap
->prevp
->br_startblock
) &&
2338 ISVALID(ap
->prevp
->br_startblock
+ ap
->prevp
->br_blockcount
,
2339 ap
->prevp
->br_startblock
)) {
2340 ap
->rval
= ap
->prevp
->br_startblock
+ ap
->prevp
->br_blockcount
;
2342 * Adjust for the gap between prevp and us.
2345 (ap
->prevp
->br_startoff
+ ap
->prevp
->br_blockcount
);
2347 ISVALID(ap
->rval
+ adjust
, ap
->prevp
->br_startblock
))
2351 * If not at eof, then compare the two neighbor blocks.
2352 * Figure out whether either one gives us a good starting point,
2353 * and pick the better one.
2355 else if (!ap
->eof
) {
2356 xfs_fsblock_t gotbno
; /* right side block number */
2357 xfs_fsblock_t gotdiff
=0; /* right side difference */
2358 xfs_fsblock_t prevbno
; /* left side block number */
2359 xfs_fsblock_t prevdiff
=0; /* left side difference */
2362 * If there's a previous (left) block, select a requested
2363 * start block based on it.
2365 if (ap
->prevp
->br_startoff
!= NULLFILEOFF
&&
2366 !ISNULLSTARTBLOCK(ap
->prevp
->br_startblock
) &&
2367 (prevbno
= ap
->prevp
->br_startblock
+
2368 ap
->prevp
->br_blockcount
) &&
2369 ISVALID(prevbno
, ap
->prevp
->br_startblock
)) {
2371 * Calculate gap to end of previous block.
2373 adjust
= prevdiff
= ap
->off
-
2374 (ap
->prevp
->br_startoff
+
2375 ap
->prevp
->br_blockcount
);
2377 * Figure the startblock based on the previous block's
2378 * end and the gap size.
2380 * If the gap is large relative to the piece we're
2381 * allocating, or using it gives us an invalid block
2382 * number, then just use the end of the previous block.
2384 if (prevdiff
<= XFS_ALLOC_GAP_UNITS
* ap
->alen
&&
2385 ISVALID(prevbno
+ prevdiff
,
2386 ap
->prevp
->br_startblock
))
2391 * If the firstblock forbids it, can't use it,
2394 if (!rt
&& !nullfb
&&
2395 XFS_FSB_TO_AGNO(mp
, prevbno
) != fb_agno
)
2396 prevbno
= NULLFSBLOCK
;
2399 * No previous block or can't follow it, just default.
2402 prevbno
= NULLFSBLOCK
;
2404 * If there's a following (right) block, select a requested
2405 * start block based on it.
2407 if (!ISNULLSTARTBLOCK(ap
->gotp
->br_startblock
)) {
2409 * Calculate gap to start of next block.
2411 adjust
= gotdiff
= ap
->gotp
->br_startoff
- ap
->off
;
2413 * Figure the startblock based on the next block's
2414 * start and the gap size.
2416 gotbno
= ap
->gotp
->br_startblock
;
2419 * If the gap is large relative to the piece we're
2420 * allocating, or using it gives us an invalid block
2421 * number, then just use the start of the next block
2422 * offset by our length.
2424 if (gotdiff
<= XFS_ALLOC_GAP_UNITS
* ap
->alen
&&
2425 ISVALID(gotbno
- gotdiff
, gotbno
))
2427 else if (ISVALID(gotbno
- ap
->alen
, gotbno
)) {
2429 gotdiff
+= adjust
- ap
->alen
;
2433 * If the firstblock forbids it, can't use it,
2436 if (!rt
&& !nullfb
&&
2437 XFS_FSB_TO_AGNO(mp
, gotbno
) != fb_agno
)
2438 gotbno
= NULLFSBLOCK
;
2441 * No next block, just default.
2444 gotbno
= NULLFSBLOCK
;
2446 * If both valid, pick the better one, else the only good
2447 * one, else ap->rval is already set (to 0 or the inode block).
2449 if (prevbno
!= NULLFSBLOCK
&& gotbno
!= NULLFSBLOCK
)
2450 ap
->rval
= prevdiff
<= gotdiff
? prevbno
: gotbno
;
2451 else if (prevbno
!= NULLFSBLOCK
)
2453 else if (gotbno
!= NULLFSBLOCK
)
2457 * If allowed, use ap->rval; otherwise must use firstblock since
2458 * it's in the right allocation group.
2460 if (nullfb
|| rt
|| XFS_FSB_TO_AGNO(mp
, ap
->rval
) == fb_agno
)
2463 ap
->rval
= ap
->firstblock
;
2465 * Realtime allocation, done through xfs_rtallocate_extent.
2473 atype
= ap
->rval
== 0 ?
2474 XFS_ALLOCTYPE_ANY_AG
: XFS_ALLOCTYPE_NEAR_BNO
;
2475 do_div(ap
->rval
, mp
->m_sb
.sb_rextsize
);
2478 if ((error
= xfs_rtallocate_extent(ap
->tp
, ap
->rval
, 1, ap
->alen
,
2479 &ralen
, atype
, ap
->wasdel
, prod
, &rtb
)))
2481 if (rtb
== NULLFSBLOCK
&& prod
> 1 &&
2482 (error
= xfs_rtallocate_extent(ap
->tp
, ap
->rval
, 1,
2483 ap
->alen
, &ralen
, atype
,
2484 ap
->wasdel
, 1, &rtb
)))
2487 if (ap
->rval
!= NULLFSBLOCK
) {
2488 ap
->rval
*= mp
->m_sb
.sb_rextsize
;
2489 ralen
*= mp
->m_sb
.sb_rextsize
;
2491 ap
->ip
->i_d
.di_nblocks
+= ralen
;
2492 xfs_trans_log_inode(ap
->tp
, ap
->ip
, XFS_ILOG_CORE
);
2494 ap
->ip
->i_delayed_blks
-= ralen
;
2496 * Adjust the disk quota also. This was reserved
2499 XFS_TRANS_MOD_DQUOT_BYINO(mp
, ap
->tp
, ap
->ip
,
2500 ap
->wasdel
? XFS_TRANS_DQ_DELRTBCOUNT
:
2501 XFS_TRANS_DQ_RTBCOUNT
,
2505 #endif /* __KERNEL__ */
2508 * Normal allocation, done through xfs_alloc_vextent.
2512 xfs_alloc_arg_t args
;
2516 xfs_extlen_t longest
;
2518 xfs_extlen_t nextminlen
=0;
2521 xfs_agnumber_t startag
;
2524 tryagain
= isaligned
= 0;
2527 args
.fsbno
= ap
->rval
;
2528 args
.maxlen
= MIN(ap
->alen
, mp
->m_sb
.sb_agblocks
);
2531 args
.type
= XFS_ALLOCTYPE_START_BNO
;
2532 args
.total
= ap
->total
;
2534 * Find the longest available space.
2535 * We're going to try for the whole allocation at once.
2537 startag
= ag
= XFS_FSB_TO_AGNO(mp
, args
.fsbno
);
2539 down_read(&mp
->m_peraglock
);
2540 while (blen
< ap
->alen
) {
2541 pag
= &mp
->m_perag
[ag
];
2542 if (!pag
->pagf_init
&&
2543 (error
= xfs_alloc_pagf_init(mp
, args
.tp
,
2544 ag
, XFS_ALLOC_FLAG_TRYLOCK
))) {
2545 up_read(&mp
->m_peraglock
);
2549 * See xfs_alloc_fix_freelist...
2551 if (pag
->pagf_init
) {
2552 need
= XFS_MIN_FREELIST_PAG(pag
, mp
);
2553 delta
= need
> pag
->pagf_flcount
?
2554 need
- pag
->pagf_flcount
: 0;
2555 longest
= (pag
->pagf_longest
> delta
) ?
2556 (pag
->pagf_longest
- delta
) :
2557 (pag
->pagf_flcount
> 0 ||
2558 pag
->pagf_longest
> 0);
2563 if (++ag
== mp
->m_sb
.sb_agcount
)
2568 up_read(&mp
->m_peraglock
);
2570 * Since the above loop did a BUF_TRYLOCK, it is
2571 * possible that there is space for this request.
2573 if (notinit
|| blen
< ap
->minlen
)
2574 args
.minlen
= ap
->minlen
;
2576 * If the best seen length is less than the request
2577 * length, use the best as the minimum.
2579 else if (blen
< ap
->alen
)
2582 * Otherwise we've seen an extent as big as alen,
2583 * use that as the minimum.
2586 args
.minlen
= ap
->alen
;
2587 } else if (ap
->low
) {
2588 args
.type
= XFS_ALLOCTYPE_FIRST_AG
;
2589 args
.total
= args
.minlen
= ap
->minlen
;
2591 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
2592 args
.total
= ap
->total
;
2593 args
.minlen
= ap
->minlen
;
2595 if (ap
->ip
->i_d
.di_extsize
) {
2596 args
.prod
= ap
->ip
->i_d
.di_extsize
;
2597 if ((args
.mod
= (xfs_extlen_t
)do_mod(ap
->off
, args
.prod
)))
2598 args
.mod
= (xfs_extlen_t
)(args
.prod
- args
.mod
);
2599 } else if (mp
->m_sb
.sb_blocksize
>= NBPP
) {
2603 args
.prod
= NBPP
>> mp
->m_sb
.sb_blocklog
;
2604 if ((args
.mod
= (xfs_extlen_t
)(do_mod(ap
->off
, args
.prod
))))
2605 args
.mod
= (xfs_extlen_t
)(args
.prod
- args
.mod
);
2608 * If we are not low on available data blocks, and the
2609 * underlying logical volume manager is a stripe, and
2610 * the file offset is zero then try to allocate data
2611 * blocks on stripe unit boundary.
2612 * NOTE: ap->aeof is only set if the allocation length
2613 * is >= the stripe unit and the allocation offset is
2614 * at the end of file.
2616 if (!ap
->low
&& ap
->aeof
) {
2618 args
.alignment
= mp
->m_dalign
;
2622 * Adjust for alignment
2624 if (blen
> args
.alignment
&& blen
<= ap
->alen
)
2625 args
.minlen
= blen
- args
.alignment
;
2626 args
.minalignslop
= 0;
2629 * First try an exact bno allocation.
2630 * If it fails then do a near or start bno
2631 * allocation with alignment turned on.
2635 args
.type
= XFS_ALLOCTYPE_THIS_BNO
;
2638 * Compute the minlen+alignment for the
2639 * next case. Set slop so that the value
2640 * of minlen+alignment+slop doesn't go up
2641 * between the calls.
2643 if (blen
> mp
->m_dalign
&& blen
<= ap
->alen
)
2644 nextminlen
= blen
- mp
->m_dalign
;
2646 nextminlen
= args
.minlen
;
2647 if (nextminlen
+ mp
->m_dalign
> args
.minlen
+ 1)
2649 nextminlen
+ mp
->m_dalign
-
2652 args
.minalignslop
= 0;
2656 args
.minalignslop
= 0;
2658 args
.minleft
= ap
->minleft
;
2659 args
.wasdel
= ap
->wasdel
;
2661 args
.userdata
= ap
->userdata
;
2662 if ((error
= xfs_alloc_vextent(&args
)))
2664 if (tryagain
&& args
.fsbno
== NULLFSBLOCK
) {
2666 * Exact allocation failed. Now try with alignment
2670 args
.fsbno
= ap
->rval
;
2671 args
.alignment
= mp
->m_dalign
;
2672 args
.minlen
= nextminlen
;
2673 args
.minalignslop
= 0;
2675 if ((error
= xfs_alloc_vextent(&args
)))
2678 if (isaligned
&& args
.fsbno
== NULLFSBLOCK
) {
2680 * allocation failed, so turn off alignment and
2684 args
.fsbno
= ap
->rval
;
2686 if ((error
= xfs_alloc_vextent(&args
)))
2689 if (args
.fsbno
== NULLFSBLOCK
&& nullfb
&&
2690 args
.minlen
> ap
->minlen
) {
2691 args
.minlen
= ap
->minlen
;
2692 args
.type
= XFS_ALLOCTYPE_START_BNO
;
2693 args
.fsbno
= ap
->rval
;
2694 if ((error
= xfs_alloc_vextent(&args
)))
2697 if (args
.fsbno
== NULLFSBLOCK
&& nullfb
) {
2699 args
.type
= XFS_ALLOCTYPE_FIRST_AG
;
2700 args
.total
= ap
->minlen
;
2702 if ((error
= xfs_alloc_vextent(&args
)))
2706 if (args
.fsbno
!= NULLFSBLOCK
) {
2707 ap
->firstblock
= ap
->rval
= args
.fsbno
;
2708 ASSERT(nullfb
|| fb_agno
== args
.agno
||
2709 (ap
->low
&& fb_agno
< args
.agno
));
2710 ap
->alen
= args
.len
;
2711 ap
->ip
->i_d
.di_nblocks
+= args
.len
;
2712 xfs_trans_log_inode(ap
->tp
, ap
->ip
, XFS_ILOG_CORE
);
2714 ap
->ip
->i_delayed_blks
-= args
.len
;
2716 * Adjust the disk quota also. This was reserved
2719 XFS_TRANS_MOD_DQUOT_BYINO(mp
, ap
->tp
, ap
->ip
,
2720 ap
->wasdel
? XFS_TRANS_DQ_DELBCOUNT
:
2721 XFS_TRANS_DQ_BCOUNT
,
2724 ap
->rval
= NULLFSBLOCK
;
2733 * Transform a btree format file with only one leaf node, where the
2734 * extents list will fit in the inode, into an extents format file.
2735 * Since the extent list is already in-core, all we have to do is
2736 * give up the space for the btree root and pitch the leaf block.
2738 STATIC
int /* error */
2739 xfs_bmap_btree_to_extents(
2740 xfs_trans_t
*tp
, /* transaction pointer */
2741 xfs_inode_t
*ip
, /* incore inode pointer */
2742 xfs_btree_cur_t
*cur
, /* btree cursor */
2743 int *logflagsp
, /* inode logging flags */
2744 int whichfork
) /* data or attr fork */
2747 xfs_bmbt_block_t
*cblock
;/* child btree block */
2748 xfs_fsblock_t cbno
; /* child block number */
2749 xfs_buf_t
*cbp
; /* child block's buffer */
2750 int error
; /* error return value */
2751 xfs_ifork_t
*ifp
; /* inode fork data */
2752 xfs_mount_t
*mp
; /* mount point structure */
2753 xfs_bmbt_ptr_t
*pp
; /* ptr to block address */
2754 xfs_bmbt_block_t
*rblock
;/* root btree block */
2756 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
2757 ASSERT(ifp
->if_flags
& XFS_IFEXTENTS
);
2758 ASSERT(XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_BTREE
);
2759 rblock
= ifp
->if_broot
;
2760 ASSERT(INT_GET(rblock
->bb_level
, ARCH_CONVERT
) == 1);
2761 ASSERT(INT_GET(rblock
->bb_numrecs
, ARCH_CONVERT
) == 1);
2762 ASSERT(XFS_BMAP_BROOT_MAXRECS(ifp
->if_broot_bytes
) == 1);
2764 pp
= XFS_BMAP_BROOT_PTR_ADDR(rblock
, 1, ifp
->if_broot_bytes
);
2767 if ((error
= xfs_btree_check_lptr(cur
, INT_GET(*pp
, ARCH_CONVERT
), 1)))
2770 cbno
= INT_GET(*pp
, ARCH_CONVERT
);
2771 if ((error
= xfs_btree_read_bufl(mp
, tp
, cbno
, 0, &cbp
,
2772 XFS_BMAP_BTREE_REF
)))
2774 cblock
= XFS_BUF_TO_BMBT_BLOCK(cbp
);
2775 if ((error
= xfs_btree_check_lblock(cur
, cblock
, 0, cbp
)))
2777 xfs_bmap_add_free(cbno
, 1, cur
->bc_private
.b
.flist
, mp
);
2778 ip
->i_d
.di_nblocks
--;
2779 XFS_TRANS_MOD_DQUOT_BYINO(mp
, tp
, ip
, XFS_TRANS_DQ_BCOUNT
, -1L);
2780 xfs_trans_binval(tp
, cbp
);
2781 if (cur
->bc_bufs
[0] == cbp
)
2782 cur
->bc_bufs
[0] = NULL
;
2783 xfs_iroot_realloc(ip
, -1, whichfork
);
2784 ASSERT(ifp
->if_broot
== NULL
);
2785 ASSERT((ifp
->if_flags
& XFS_IFBROOT
) == 0);
2786 XFS_IFORK_FMT_SET(ip
, whichfork
, XFS_DINODE_FMT_EXTENTS
);
2787 *logflagsp
= XFS_ILOG_CORE
| XFS_ILOG_FEXT(whichfork
);
2792 * Called by xfs_bmapi to update extent list structure and the btree
2793 * after removing space (or undoing a delayed allocation).
2795 STATIC
int /* error */
2796 xfs_bmap_del_extent(
2797 xfs_inode_t
*ip
, /* incore inode pointer */
2798 xfs_trans_t
*tp
, /* current transaction pointer */
2799 xfs_extnum_t idx
, /* extent number to update/delete */
2800 xfs_bmap_free_t
*flist
, /* list of extents to be freed */
2801 xfs_btree_cur_t
*cur
, /* if null, not a btree */
2802 xfs_bmbt_irec_t
*del
, /* data to remove from extent list */
2803 int *logflagsp
, /* inode logging flags */
2804 int whichfork
, /* data or attr fork */
2805 int rsvd
) /* OK to allocate reserved blocks */
2807 xfs_filblks_t da_new
; /* new delay-alloc indirect blocks */
2808 xfs_filblks_t da_old
; /* old delay-alloc indirect blocks */
2809 xfs_fsblock_t del_endblock
=0; /* first block past del */
2810 xfs_fileoff_t del_endoff
; /* first offset past del */
2811 int delay
; /* current block is delayed allocated */
2812 int do_fx
; /* free extent at end of routine */
2813 xfs_bmbt_rec_t
*ep
; /* current extent entry pointer */
2814 int error
; /* error return value */
2815 int flags
; /* inode logging flags */
2816 #ifdef XFS_BMAP_TRACE
2817 static char fname
[] = "xfs_bmap_del_extent";
2819 xfs_bmbt_irec_t got
; /* current extent entry */
2820 xfs_fileoff_t got_endoff
; /* first offset past got */
2821 int i
; /* temp state */
2822 xfs_ifork_t
*ifp
; /* inode fork pointer */
2823 xfs_mount_t
*mp
; /* mount structure */
2824 xfs_filblks_t nblks
; /* quota/sb block count */
2825 xfs_bmbt_irec_t
new; /* new record to be inserted */
2827 xfs_extnum_t nextents
; /* number of extents in list */
2828 uint qfield
; /* quota field to update */
2829 xfs_filblks_t temp
; /* for indirect length calculations */
2830 xfs_filblks_t temp2
; /* for indirect length calculations */
2832 XFS_STATS_INC(xs_del_exlist
);
2834 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
2835 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
2836 ASSERT(idx
>= 0 && idx
< nextents
);
2837 ASSERT(del
->br_blockcount
> 0);
2838 ep
= &ifp
->if_u1
.if_extents
[idx
];
2839 xfs_bmbt_get_all(ep
, &got
);
2840 ASSERT(got
.br_startoff
<= del
->br_startoff
);
2841 del_endoff
= del
->br_startoff
+ del
->br_blockcount
;
2842 got_endoff
= got
.br_startoff
+ got
.br_blockcount
;
2843 ASSERT(got_endoff
>= del_endoff
);
2844 delay
= ISNULLSTARTBLOCK(got
.br_startblock
);
2845 ASSERT(ISNULLSTARTBLOCK(del
->br_startblock
) == delay
);
2850 * If deleting a real allocation, must free up the disk space.
2853 flags
= XFS_ILOG_CORE
;
2855 * Realtime allocation. Free it and record di_nblocks update.
2857 if (whichfork
== XFS_DATA_FORK
&&
2858 (ip
->i_d
.di_flags
& XFS_DIFLAG_REALTIME
)) {
2862 ASSERT(do_mod(del
->br_blockcount
,
2863 mp
->m_sb
.sb_rextsize
) == 0);
2864 ASSERT(do_mod(del
->br_startblock
,
2865 mp
->m_sb
.sb_rextsize
) == 0);
2866 bno
= del
->br_startblock
;
2867 len
= del
->br_blockcount
;
2868 do_div(bno
, mp
->m_sb
.sb_rextsize
);
2869 do_div(len
, mp
->m_sb
.sb_rextsize
);
2870 if ((error
= xfs_rtfree_extent(ip
->i_transp
, bno
,
2871 (xfs_extlen_t
)len
)))
2874 nblks
= len
* mp
->m_sb
.sb_rextsize
;
2875 qfield
= XFS_TRANS_DQ_RTBCOUNT
;
2878 * Ordinary allocation.
2882 nblks
= del
->br_blockcount
;
2883 qfield
= XFS_TRANS_DQ_BCOUNT
;
2886 * Set up del_endblock and cur for later.
2888 del_endblock
= del
->br_startblock
+ del
->br_blockcount
;
2890 if ((error
= xfs_bmbt_lookup_eq(cur
, got
.br_startoff
,
2891 got
.br_startblock
, got
.br_blockcount
,
2896 da_old
= da_new
= 0;
2898 da_old
= STARTBLOCKVAL(got
.br_startblock
);
2904 * Set flag value to use in switch statement.
2905 * Left-contig is 2, right-contig is 1.
2907 switch (((got
.br_startoff
== del
->br_startoff
) << 1) |
2908 (got_endoff
== del_endoff
)) {
2911 * Matches the whole extent. Delete the entry.
2913 xfs_bmap_trace_delete(fname
, "3", ip
, idx
, 1, whichfork
);
2914 xfs_bmap_delete_exlist(ip
, idx
, 1, whichfork
);
2915 ifp
->if_lastex
= idx
;
2918 XFS_IFORK_NEXT_SET(ip
, whichfork
,
2919 XFS_IFORK_NEXTENTS(ip
, whichfork
) - 1);
2920 flags
|= XFS_ILOG_CORE
;
2922 flags
|= XFS_ILOG_FEXT(whichfork
);
2925 if ((error
= xfs_bmbt_delete(cur
, &i
)))
2932 * Deleting the first part of the extent.
2934 xfs_bmap_trace_pre_update(fname
, "2", ip
, idx
, whichfork
);
2935 xfs_bmbt_set_startoff(ep
, del_endoff
);
2936 temp
= got
.br_blockcount
- del
->br_blockcount
;
2937 xfs_bmbt_set_blockcount(ep
, temp
);
2938 ifp
->if_lastex
= idx
;
2940 temp
= XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip
, temp
),
2942 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
2943 xfs_bmap_trace_post_update(fname
, "2", ip
, idx
,
2948 xfs_bmbt_set_startblock(ep
, del_endblock
);
2949 xfs_bmap_trace_post_update(fname
, "2", ip
, idx
, whichfork
);
2951 flags
|= XFS_ILOG_FEXT(whichfork
);
2954 if ((error
= xfs_bmbt_update(cur
, del_endoff
, del_endblock
,
2955 got
.br_blockcount
- del
->br_blockcount
,
2962 * Deleting the last part of the extent.
2964 temp
= got
.br_blockcount
- del
->br_blockcount
;
2965 xfs_bmap_trace_pre_update(fname
, "1", ip
, idx
, whichfork
);
2966 xfs_bmbt_set_blockcount(ep
, temp
);
2967 ifp
->if_lastex
= idx
;
2969 temp
= XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip
, temp
),
2971 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
2972 xfs_bmap_trace_post_update(fname
, "1", ip
, idx
,
2977 xfs_bmap_trace_post_update(fname
, "1", ip
, idx
, whichfork
);
2979 flags
|= XFS_ILOG_FEXT(whichfork
);
2982 if ((error
= xfs_bmbt_update(cur
, got
.br_startoff
,
2984 got
.br_blockcount
- del
->br_blockcount
,
2991 * Deleting the middle of the extent.
2993 temp
= del
->br_startoff
- got
.br_startoff
;
2994 xfs_bmap_trace_pre_update(fname
, "0", ip
, idx
, whichfork
);
2995 xfs_bmbt_set_blockcount(ep
, temp
);
2996 new.br_startoff
= del_endoff
;
2997 temp2
= got_endoff
- del_endoff
;
2998 new.br_blockcount
= temp2
;
2999 new.br_state
= got
.br_state
;
3001 new.br_startblock
= del_endblock
;
3002 flags
|= XFS_ILOG_CORE
;
3004 if ((error
= xfs_bmbt_update(cur
,
3006 got
.br_startblock
, temp
,
3009 if ((error
= xfs_bmbt_increment(cur
, 0, &i
)))
3011 cur
->bc_rec
.b
= new;
3012 error
= xfs_bmbt_insert(cur
, &i
);
3013 if (error
&& error
!= ENOSPC
)
3016 * If get no-space back from btree insert,
3017 * it tried a split, and we have a zero
3018 * block reservation.
3019 * Fix up our state and return the error.
3021 if (error
== ENOSPC
) {
3023 * Reset the cursor, don't trust
3024 * it after any insert operation.
3026 if ((error
= xfs_bmbt_lookup_eq(cur
,
3033 * Update the btree record back
3034 * to the original value.
3036 if ((error
= xfs_bmbt_update(cur
,
3043 * Reset the extent record back
3044 * to the original value.
3046 xfs_bmbt_set_blockcount(ep
,
3049 error
= XFS_ERROR(ENOSPC
);
3054 flags
|= XFS_ILOG_FEXT(whichfork
);
3055 XFS_IFORK_NEXT_SET(ip
, whichfork
,
3056 XFS_IFORK_NEXTENTS(ip
, whichfork
) + 1);
3058 ASSERT(whichfork
== XFS_DATA_FORK
);
3059 temp
= xfs_bmap_worst_indlen(ip
, temp
);
3060 xfs_bmbt_set_startblock(ep
, NULLSTARTBLOCK((int)temp
));
3061 temp2
= xfs_bmap_worst_indlen(ip
, temp2
);
3062 new.br_startblock
= NULLSTARTBLOCK((int)temp2
);
3063 da_new
= temp
+ temp2
;
3064 while (da_new
> da_old
) {
3068 xfs_bmbt_set_startblock(ep
,
3069 NULLSTARTBLOCK((int)temp
));
3071 if (da_new
== da_old
)
3077 NULLSTARTBLOCK((int)temp2
);
3081 xfs_bmap_trace_post_update(fname
, "0", ip
, idx
, whichfork
);
3082 xfs_bmap_trace_insert(fname
, "0", ip
, idx
+ 1, 1, &new, NULL
,
3084 xfs_bmap_insert_exlist(ip
, idx
+ 1, 1, &new, whichfork
);
3085 ifp
->if_lastex
= idx
+ 1;
3089 * If we need to, add to list of extents to delete.
3092 xfs_bmap_add_free(del
->br_startblock
, del
->br_blockcount
, flist
,
3095 * Adjust inode # blocks in the file.
3098 ip
->i_d
.di_nblocks
-= nblks
;
3100 * Adjust quota data.
3103 XFS_TRANS_MOD_DQUOT_BYINO(mp
, tp
, ip
, qfield
, (long)-nblks
);
3106 * Account for change in delayed indirect blocks.
3107 * Nothing to do for disk quota accounting here.
3109 ASSERT(da_old
>= da_new
);
3110 if (da_old
> da_new
)
3111 xfs_mod_incore_sb(mp
, XFS_SBS_FDBLOCKS
, (int)(da_old
- da_new
),
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 * Remove count entries from the extents array for inode "ip", starting
3138 * at index "idx". Copies the remaining items down over the deleted ones,
3139 * and gives back the excess memory.
3142 xfs_bmap_delete_exlist(
3143 xfs_inode_t
*ip
, /* incore inode pointer */
3144 xfs_extnum_t idx
, /* starting delete index */
3145 xfs_extnum_t count
, /* count of items to delete */
3146 int whichfork
) /* data or attr fork */
3148 xfs_bmbt_rec_t
*base
; /* base of extent list */
3149 xfs_ifork_t
*ifp
; /* inode fork pointer */
3150 xfs_extnum_t nextents
; /* number of extents in list after */
3152 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3153 ASSERT(ifp
->if_flags
& XFS_IFEXTENTS
);
3154 base
= ifp
->if_u1
.if_extents
;
3155 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
) - count
;
3156 memmove(&base
[idx
], &base
[idx
+ count
],
3157 (nextents
- idx
) * sizeof(*base
));
3158 xfs_iext_realloc(ip
, -count
, whichfork
);
3162 * Convert an extents-format file into a btree-format file.
3163 * The new file will have a root block (in the inode) and a single child block.
3165 STATIC
int /* error */
3166 xfs_bmap_extents_to_btree(
3167 xfs_trans_t
*tp
, /* transaction pointer */
3168 xfs_inode_t
*ip
, /* incore inode pointer */
3169 xfs_fsblock_t
*firstblock
, /* first-block-allocated */
3170 xfs_bmap_free_t
*flist
, /* blocks freed in xaction */
3171 xfs_btree_cur_t
**curp
, /* cursor returned to caller */
3172 int wasdel
, /* converting a delayed alloc */
3173 int *logflagsp
, /* inode logging flags */
3174 int whichfork
) /* data or attr fork */
3176 xfs_bmbt_block_t
*ablock
; /* allocated (child) bt block */
3177 xfs_buf_t
*abp
; /* buffer for ablock */
3178 xfs_alloc_arg_t args
; /* allocation arguments */
3179 xfs_bmbt_rec_t
*arp
; /* child record pointer */
3180 xfs_bmbt_block_t
*block
; /* btree root block */
3181 xfs_btree_cur_t
*cur
; /* bmap btree cursor */
3182 xfs_bmbt_rec_t
*ep
; /* extent list pointer */
3183 int error
; /* error return value */
3184 xfs_extnum_t i
, cnt
; /* extent list index */
3185 xfs_ifork_t
*ifp
; /* inode fork pointer */
3186 xfs_bmbt_key_t
*kp
; /* root block key pointer */
3187 xfs_mount_t
*mp
; /* mount structure */
3188 xfs_extnum_t nextents
; /* extent list size */
3189 xfs_bmbt_ptr_t
*pp
; /* root block address pointer */
3191 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3192 ASSERT(XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_EXTENTS
);
3193 ASSERT(ifp
->if_ext_max
==
3194 XFS_IFORK_SIZE(ip
, whichfork
) / (uint
)sizeof(xfs_bmbt_rec_t
));
3196 * Make space in the inode incore.
3198 xfs_iroot_realloc(ip
, 1, whichfork
);
3199 ifp
->if_flags
|= XFS_IFBROOT
;
3203 block
= ifp
->if_broot
;
3204 INT_SET(block
->bb_magic
, ARCH_CONVERT
, XFS_BMAP_MAGIC
);
3205 INT_SET(block
->bb_level
, ARCH_CONVERT
, 1);
3206 INT_SET(block
->bb_numrecs
, ARCH_CONVERT
, 1);
3207 INT_SET(block
->bb_leftsib
, ARCH_CONVERT
, NULLDFSBNO
);
3208 INT_SET(block
->bb_rightsib
, ARCH_CONVERT
, NULLDFSBNO
);
3210 * Need a cursor. Can't allocate until bb_level is filled in.
3213 cur
= xfs_btree_init_cursor(mp
, tp
, NULL
, 0, XFS_BTNUM_BMAP
, ip
,
3215 cur
->bc_private
.b
.firstblock
= *firstblock
;
3216 cur
->bc_private
.b
.flist
= flist
;
3217 cur
->bc_private
.b
.flags
= wasdel
? XFS_BTCUR_BPRV_WASDEL
: 0;
3219 * Convert to a btree with two levels, one record in root.
3221 XFS_IFORK_FMT_SET(ip
, whichfork
, XFS_DINODE_FMT_BTREE
);
3224 if (*firstblock
== NULLFSBLOCK
) {
3225 args
.type
= XFS_ALLOCTYPE_START_BNO
;
3226 args
.fsbno
= XFS_INO_TO_FSB(mp
, ip
->i_ino
);
3227 } else if (flist
->xbf_low
) {
3228 args
.type
= XFS_ALLOCTYPE_START_BNO
;
3229 args
.fsbno
= *firstblock
;
3231 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
3232 args
.fsbno
= *firstblock
;
3234 args
.minlen
= args
.maxlen
= args
.prod
= 1;
3235 args
.total
= args
.minleft
= args
.alignment
= args
.mod
= args
.isfl
=
3236 args
.minalignslop
= 0;
3237 args
.wasdel
= wasdel
;
3239 if ((error
= xfs_alloc_vextent(&args
))) {
3240 xfs_iroot_realloc(ip
, -1, whichfork
);
3241 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
3245 * Allocation can't fail, the space was reserved.
3247 ASSERT(args
.fsbno
!= NULLFSBLOCK
);
3248 ASSERT(*firstblock
== NULLFSBLOCK
||
3249 args
.agno
== XFS_FSB_TO_AGNO(mp
, *firstblock
) ||
3251 args
.agno
> XFS_FSB_TO_AGNO(mp
, *firstblock
)));
3252 *firstblock
= cur
->bc_private
.b
.firstblock
= args
.fsbno
;
3253 cur
->bc_private
.b
.allocated
++;
3254 ip
->i_d
.di_nblocks
++;
3255 XFS_TRANS_MOD_DQUOT_BYINO(mp
, tp
, ip
, XFS_TRANS_DQ_BCOUNT
, 1L);
3256 abp
= xfs_btree_get_bufl(mp
, tp
, args
.fsbno
, 0);
3258 * Fill in the child block.
3260 ablock
= XFS_BUF_TO_BMBT_BLOCK(abp
);
3261 INT_SET(ablock
->bb_magic
, ARCH_CONVERT
, XFS_BMAP_MAGIC
);
3262 ablock
->bb_level
= 0;
3263 INT_SET(ablock
->bb_leftsib
, ARCH_CONVERT
, NULLDFSBNO
);
3264 INT_SET(ablock
->bb_rightsib
, ARCH_CONVERT
, NULLDFSBNO
);
3265 arp
= XFS_BMAP_REC_IADDR(ablock
, 1, cur
);
3266 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
3267 for (ep
= ifp
->if_u1
.if_extents
, cnt
= i
= 0; i
< nextents
; i
++, ep
++) {
3268 if (!ISNULLSTARTBLOCK(xfs_bmbt_get_startblock(ep
))) {
3269 arp
->l0
= INT_GET(ep
->l0
, ARCH_CONVERT
);
3270 arp
->l1
= INT_GET(ep
->l1
, ARCH_CONVERT
);
3274 INT_SET(ablock
->bb_numrecs
, ARCH_CONVERT
, cnt
);
3275 ASSERT(INT_GET(ablock
->bb_numrecs
, ARCH_CONVERT
) == XFS_IFORK_NEXTENTS(ip
, whichfork
));
3277 * Fill in the root key and pointer.
3279 kp
= XFS_BMAP_KEY_IADDR(block
, 1, cur
);
3280 arp
= XFS_BMAP_REC_IADDR(ablock
, 1, cur
);
3281 INT_SET(kp
->br_startoff
, ARCH_CONVERT
, xfs_bmbt_disk_get_startoff(arp
));
3282 pp
= XFS_BMAP_PTR_IADDR(block
, 1, cur
);
3283 INT_SET(*pp
, ARCH_CONVERT
, args
.fsbno
);
3285 * Do all this logging at the end so that
3286 * the root is at the right level.
3288 xfs_bmbt_log_block(cur
, abp
, XFS_BB_ALL_BITS
);
3289 xfs_bmbt_log_recs(cur
, abp
, 1, INT_GET(ablock
->bb_numrecs
, ARCH_CONVERT
));
3290 ASSERT(*curp
== NULL
);
3292 *logflagsp
= XFS_ILOG_CORE
| XFS_ILOG_FBROOT(whichfork
);
3297 * Insert new item(s) in the extent list for inode "ip".
3298 * Count new items are inserted at offset idx.
3301 xfs_bmap_insert_exlist(
3302 xfs_inode_t
*ip
, /* incore inode pointer */
3303 xfs_extnum_t idx
, /* starting index of new items */
3304 xfs_extnum_t count
, /* number of inserted items */
3305 xfs_bmbt_irec_t
*new, /* items to insert */
3306 int whichfork
) /* data or attr fork */
3308 xfs_bmbt_rec_t
*base
; /* extent list base */
3309 xfs_ifork_t
*ifp
; /* inode fork pointer */
3310 xfs_extnum_t nextents
; /* extent list size */
3311 xfs_extnum_t to
; /* extent list index */
3313 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3314 ASSERT(ifp
->if_flags
& XFS_IFEXTENTS
);
3315 xfs_iext_realloc(ip
, count
, whichfork
);
3316 base
= ifp
->if_u1
.if_extents
;
3317 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
3318 memmove(&base
[idx
+ count
], &base
[idx
],
3319 (nextents
- (idx
+ count
)) * sizeof(*base
));
3320 for (to
= idx
; to
< idx
+ count
; to
++, new++)
3321 xfs_bmbt_set_all(&base
[to
], new);
3325 * Helper routine to reset inode di_forkoff field when switching
3326 * attribute fork from local to extent format - we reset it where
3327 * possible to make space available for inline data fork extents.
3330 xfs_bmap_forkoff_reset(
3335 if (whichfork
== XFS_ATTR_FORK
&&
3336 (ip
->i_d
.di_format
!= XFS_DINODE_FMT_DEV
) &&
3337 (ip
->i_d
.di_format
!= XFS_DINODE_FMT_UUID
) &&
3338 ((mp
->m_attroffset
>> 3) > ip
->i_d
.di_forkoff
)) {
3339 ip
->i_d
.di_forkoff
= mp
->m_attroffset
>> 3;
3340 ip
->i_df
.if_ext_max
= XFS_IFORK_DSIZE(ip
) /
3341 (uint
)sizeof(xfs_bmbt_rec_t
);
3342 ip
->i_afp
->if_ext_max
= XFS_IFORK_ASIZE(ip
) /
3343 (uint
)sizeof(xfs_bmbt_rec_t
);
3348 * Convert a local file to an extents file.
3349 * This code is out of bounds for data forks of regular files,
3350 * since the file data needs to get logged so things will stay consistent.
3351 * (The bmap-level manipulations are ok, though).
3353 STATIC
int /* error */
3354 xfs_bmap_local_to_extents(
3355 xfs_trans_t
*tp
, /* transaction pointer */
3356 xfs_inode_t
*ip
, /* incore inode pointer */
3357 xfs_fsblock_t
*firstblock
, /* first block allocated in xaction */
3358 xfs_extlen_t total
, /* total blocks needed by transaction */
3359 int *logflagsp
, /* inode logging flags */
3360 int whichfork
) /* data or attr fork */
3362 int error
; /* error return value */
3363 int flags
; /* logging flags returned */
3364 #ifdef XFS_BMAP_TRACE
3365 static char fname
[] = "xfs_bmap_local_to_extents";
3367 xfs_ifork_t
*ifp
; /* inode fork pointer */
3370 * We don't want to deal with the case of keeping inode data inline yet.
3371 * So sending the data fork of a regular inode is invalid.
3373 ASSERT(!((ip
->i_d
.di_mode
& S_IFMT
) == S_IFREG
&&
3374 whichfork
== XFS_DATA_FORK
));
3375 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3376 ASSERT(XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_LOCAL
);
3379 if (ifp
->if_bytes
) {
3380 xfs_alloc_arg_t args
; /* allocation arguments */
3381 xfs_buf_t
*bp
; /* buffer for extent list block */
3382 xfs_bmbt_rec_t
*ep
; /* extent list pointer */
3385 args
.mp
= ip
->i_mount
;
3386 ASSERT(ifp
->if_flags
& XFS_IFINLINE
);
3388 * Allocate a block. We know we need only one, since the
3389 * file currently fits in an inode.
3391 if (*firstblock
== NULLFSBLOCK
) {
3392 args
.fsbno
= XFS_INO_TO_FSB(args
.mp
, ip
->i_ino
);
3393 args
.type
= XFS_ALLOCTYPE_START_BNO
;
3395 args
.fsbno
= *firstblock
;
3396 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
3399 args
.mod
= args
.minleft
= args
.alignment
= args
.wasdel
=
3400 args
.isfl
= args
.minalignslop
= 0;
3401 args
.minlen
= args
.maxlen
= args
.prod
= 1;
3402 if ((error
= xfs_alloc_vextent(&args
)))
3405 * Can't fail, the space was reserved.
3407 ASSERT(args
.fsbno
!= NULLFSBLOCK
);
3408 ASSERT(args
.len
== 1);
3409 *firstblock
= args
.fsbno
;
3410 bp
= xfs_btree_get_bufl(args
.mp
, tp
, args
.fsbno
, 0);
3411 memcpy((char *)XFS_BUF_PTR(bp
), ifp
->if_u1
.if_data
,
3413 xfs_trans_log_buf(tp
, bp
, 0, ifp
->if_bytes
- 1);
3414 xfs_bmap_forkoff_reset(args
.mp
, ip
, whichfork
);
3415 xfs_idata_realloc(ip
, -ifp
->if_bytes
, whichfork
);
3416 xfs_iext_realloc(ip
, 1, whichfork
);
3417 ep
= ifp
->if_u1
.if_extents
;
3418 xfs_bmbt_set_allf(ep
, 0, args
.fsbno
, 1, XFS_EXT_NORM
);
3419 xfs_bmap_trace_post_update(fname
, "new", ip
, 0, whichfork
);
3420 XFS_IFORK_NEXT_SET(ip
, whichfork
, 1);
3421 ip
->i_d
.di_nblocks
= 1;
3422 XFS_TRANS_MOD_DQUOT_BYINO(args
.mp
, tp
, ip
,
3423 XFS_TRANS_DQ_BCOUNT
, 1L);
3424 flags
|= XFS_ILOG_FEXT(whichfork
);
3426 ASSERT(XFS_IFORK_NEXTENTS(ip
, whichfork
) == 0);
3427 xfs_bmap_forkoff_reset(ip
->i_mount
, ip
, whichfork
);
3429 ifp
->if_flags
&= ~XFS_IFINLINE
;
3430 ifp
->if_flags
|= XFS_IFEXTENTS
;
3431 XFS_IFORK_FMT_SET(ip
, whichfork
, XFS_DINODE_FMT_EXTENTS
);
3432 flags
|= XFS_ILOG_CORE
;
3438 xfs_bmbt_rec_t
* /* pointer to found extent entry */
3439 xfs_bmap_do_search_extents(
3440 xfs_bmbt_rec_t
*base
, /* base of extent list */
3441 xfs_extnum_t lastx
, /* last extent index used */
3442 xfs_extnum_t nextents
, /* extent list size */
3443 xfs_fileoff_t bno
, /* block number searched for */
3444 int *eofp
, /* out: end of file found */
3445 xfs_extnum_t
*lastxp
, /* out: last extent index */
3446 xfs_bmbt_irec_t
*gotp
, /* out: extent entry found */
3447 xfs_bmbt_irec_t
*prevp
) /* out: previous extent entry found */
3449 xfs_bmbt_rec_t
*ep
; /* extent list entry pointer */
3450 xfs_bmbt_irec_t got
; /* extent list entry, decoded */
3451 int high
; /* high index of binary search */
3452 int low
; /* low index of binary search */
3455 * Initialize the extent entry structure to catch access to
3456 * uninitialized br_startblock field.
3458 got
.br_startoff
= 0xffa5a5a5a5a5a5a5LL
;
3459 got
.br_blockcount
= 0xa55a5a5a5a5a5a5aLL
;
3460 got
.br_state
= XFS_EXT_INVALID
;
3463 got
.br_startblock
= 0xffffa5a5a5a5a5a5LL
;
3465 got
.br_startblock
= 0xffffa5a5;
3468 if (lastx
!= NULLEXTNUM
&& lastx
< nextents
)
3472 prevp
->br_startoff
= NULLFILEOFF
;
3473 if (ep
&& bno
>= (got
.br_startoff
= xfs_bmbt_get_startoff(ep
)) &&
3474 bno
< got
.br_startoff
+
3475 (got
.br_blockcount
= xfs_bmbt_get_blockcount(ep
)))
3477 else if (ep
&& lastx
< nextents
- 1 &&
3478 bno
>= (got
.br_startoff
= xfs_bmbt_get_startoff(ep
+ 1)) &&
3479 bno
< got
.br_startoff
+
3480 (got
.br_blockcount
= xfs_bmbt_get_blockcount(ep
+ 1))) {
3484 } else if (nextents
== 0)
3486 else if (bno
== 0 &&
3487 (got
.br_startoff
= xfs_bmbt_get_startoff(base
)) == 0) {
3490 got
.br_blockcount
= xfs_bmbt_get_blockcount(ep
);
3493 /* binary search the extents array */
3495 high
= nextents
- 1;
3496 while (low
<= high
) {
3497 XFS_STATS_INC(xs_cmp_exlist
);
3498 lastx
= (low
+ high
) >> 1;
3500 got
.br_startoff
= xfs_bmbt_get_startoff(ep
);
3501 got
.br_blockcount
= xfs_bmbt_get_blockcount(ep
);
3502 if (bno
< got
.br_startoff
)
3504 else if (bno
>= got
.br_startoff
+ got
.br_blockcount
)
3507 got
.br_startblock
= xfs_bmbt_get_startblock(ep
);
3508 got
.br_state
= xfs_bmbt_get_state(ep
);
3515 if (bno
>= got
.br_startoff
+ got
.br_blockcount
) {
3517 if (lastx
== nextents
) {
3519 got
.br_startblock
= xfs_bmbt_get_startblock(ep
);
3520 got
.br_state
= xfs_bmbt_get_state(ep
);
3525 xfs_bmbt_get_all(ep
, prevp
);
3527 got
.br_startoff
= xfs_bmbt_get_startoff(ep
);
3528 got
.br_blockcount
= xfs_bmbt_get_blockcount(ep
);
3533 xfs_bmbt_get_all(ep
- 1, prevp
);
3537 got
.br_startblock
= xfs_bmbt_get_startblock(ep
);
3538 got
.br_state
= xfs_bmbt_get_state(ep
);
3546 * Search the extents list for the inode, for the extent containing bno.
3547 * If bno lies in a hole, point to the next entry. If bno lies past eof,
3548 * *eofp will be set, and *prevp will contain the last entry (null if none).
3549 * Else, *lastxp will be set to the index of the found
3550 * entry; *gotp will contain the entry.
3552 STATIC xfs_bmbt_rec_t
* /* pointer to found extent entry */
3553 xfs_bmap_search_extents(
3554 xfs_inode_t
*ip
, /* incore inode pointer */
3555 xfs_fileoff_t bno
, /* block number searched for */
3556 int whichfork
, /* data or attr fork */
3557 int *eofp
, /* out: end of file found */
3558 xfs_extnum_t
*lastxp
, /* out: last extent index */
3559 xfs_bmbt_irec_t
*gotp
, /* out: extent entry found */
3560 xfs_bmbt_irec_t
*prevp
) /* out: previous extent entry found */
3562 xfs_ifork_t
*ifp
; /* inode fork pointer */
3563 xfs_bmbt_rec_t
*base
; /* base of extent list */
3564 xfs_extnum_t lastx
; /* last extent index used */
3565 xfs_extnum_t nextents
; /* extent list size */
3566 xfs_bmbt_rec_t
*ep
; /* extent list entry pointer */
3567 int rt
; /* realtime flag */
3569 XFS_STATS_INC(xs_look_exlist
);
3570 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3571 lastx
= ifp
->if_lastex
;
3572 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
3573 base
= &ifp
->if_u1
.if_extents
[0];
3575 ep
= xfs_bmap_do_search_extents(base
, lastx
, nextents
, bno
, eofp
,
3576 lastxp
, gotp
, prevp
);
3577 rt
= ip
->i_d
.di_flags
& XFS_DIFLAG_REALTIME
;
3578 if(!rt
&& !gotp
->br_startblock
&& (*lastxp
!= NULLEXTNUM
)) {
3579 cmn_err(CE_PANIC
,"Access to block zero: fs: <%s> inode: %lld "
3580 "start_block : %llx start_off : %llx blkcnt : %llx "
3581 "extent-state : %x \n",
3582 (ip
->i_mount
)->m_fsname
,(long long)ip
->i_ino
,
3583 gotp
->br_startblock
, gotp
->br_startoff
,
3584 gotp
->br_blockcount
,gotp
->br_state
);
3590 #ifdef XFS_BMAP_TRACE
3591 ktrace_t
*xfs_bmap_trace_buf
;
3594 * Add a bmap trace buffer entry. Base routine for the others.
3597 xfs_bmap_trace_addentry(
3598 int opcode
, /* operation */
3599 char *fname
, /* function name */
3600 char *desc
, /* operation description */
3601 xfs_inode_t
*ip
, /* incore inode pointer */
3602 xfs_extnum_t idx
, /* index of entry(ies) */
3603 xfs_extnum_t cnt
, /* count of entries, 1 or 2 */
3604 xfs_bmbt_rec_t
*r1
, /* first record */
3605 xfs_bmbt_rec_t
*r2
, /* second record or null */
3606 int whichfork
) /* data or attr fork */
3610 ASSERT(cnt
== 1 || cnt
== 2);
3615 memset(&tr2
, 0, sizeof(tr2
));
3618 ktrace_enter(xfs_bmap_trace_buf
,
3619 (void *)(__psint_t
)(opcode
| (whichfork
<< 16)),
3620 (void *)fname
, (void *)desc
, (void *)ip
,
3621 (void *)(__psint_t
)idx
,
3622 (void *)(__psint_t
)cnt
,
3623 (void *)(__psunsigned_t
)(ip
->i_ino
>> 32),
3624 (void *)(__psunsigned_t
)(unsigned)ip
->i_ino
,
3625 (void *)(__psunsigned_t
)(r1
->l0
>> 32),
3626 (void *)(__psunsigned_t
)(unsigned)(r1
->l0
),
3627 (void *)(__psunsigned_t
)(r1
->l1
>> 32),
3628 (void *)(__psunsigned_t
)(unsigned)(r1
->l1
),
3629 (void *)(__psunsigned_t
)(r2
->l0
>> 32),
3630 (void *)(__psunsigned_t
)(unsigned)(r2
->l0
),
3631 (void *)(__psunsigned_t
)(r2
->l1
>> 32),
3632 (void *)(__psunsigned_t
)(unsigned)(r2
->l1
)
3634 ASSERT(ip
->i_xtrace
);
3635 ktrace_enter(ip
->i_xtrace
,
3636 (void *)(__psint_t
)(opcode
| (whichfork
<< 16)),
3637 (void *)fname
, (void *)desc
, (void *)ip
,
3638 (void *)(__psint_t
)idx
,
3639 (void *)(__psint_t
)cnt
,
3640 (void *)(__psunsigned_t
)(ip
->i_ino
>> 32),
3641 (void *)(__psunsigned_t
)(unsigned)ip
->i_ino
,
3642 (void *)(__psunsigned_t
)(r1
->l0
>> 32),
3643 (void *)(__psunsigned_t
)(unsigned)(r1
->l0
),
3644 (void *)(__psunsigned_t
)(r1
->l1
>> 32),
3645 (void *)(__psunsigned_t
)(unsigned)(r1
->l1
),
3646 (void *)(__psunsigned_t
)(r2
->l0
>> 32),
3647 (void *)(__psunsigned_t
)(unsigned)(r2
->l0
),
3648 (void *)(__psunsigned_t
)(r2
->l1
>> 32),
3649 (void *)(__psunsigned_t
)(unsigned)(r2
->l1
)
3654 * Add bmap trace entry prior to a call to xfs_bmap_delete_exlist.
3657 xfs_bmap_trace_delete(
3658 char *fname
, /* function name */
3659 char *desc
, /* operation description */
3660 xfs_inode_t
*ip
, /* incore inode pointer */
3661 xfs_extnum_t idx
, /* index of entry(entries) deleted */
3662 xfs_extnum_t cnt
, /* count of entries deleted, 1 or 2 */
3663 int whichfork
) /* data or attr fork */
3665 xfs_ifork_t
*ifp
; /* inode fork pointer */
3667 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3668 xfs_bmap_trace_addentry(XFS_BMAP_KTRACE_DELETE
, fname
, desc
, ip
, idx
,
3669 cnt
, &ifp
->if_u1
.if_extents
[idx
],
3670 cnt
== 2 ? &ifp
->if_u1
.if_extents
[idx
+ 1] : NULL
,
3675 * Add bmap trace entry prior to a call to xfs_bmap_insert_exlist, or
3676 * reading in the extents list from the disk (in the btree).
3679 xfs_bmap_trace_insert(
3680 char *fname
, /* function name */
3681 char *desc
, /* operation description */
3682 xfs_inode_t
*ip
, /* incore inode pointer */
3683 xfs_extnum_t idx
, /* index of entry(entries) inserted */
3684 xfs_extnum_t cnt
, /* count of entries inserted, 1 or 2 */
3685 xfs_bmbt_irec_t
*r1
, /* inserted record 1 */
3686 xfs_bmbt_irec_t
*r2
, /* inserted record 2 or null */
3687 int whichfork
) /* data or attr fork */
3689 xfs_bmbt_rec_t tr1
; /* compressed record 1 */
3690 xfs_bmbt_rec_t tr2
; /* compressed record 2 if needed */
3692 xfs_bmbt_set_all(&tr1
, r1
);
3695 xfs_bmbt_set_all(&tr2
, r2
);
3700 xfs_bmap_trace_addentry(XFS_BMAP_KTRACE_INSERT
, fname
, desc
, ip
, idx
,
3701 cnt
, &tr1
, cnt
== 2 ? &tr2
: NULL
, whichfork
);
3705 * Add bmap trace entry after updating an extent list entry in place.
3708 xfs_bmap_trace_post_update(
3709 char *fname
, /* function name */
3710 char *desc
, /* operation description */
3711 xfs_inode_t
*ip
, /* incore inode pointer */
3712 xfs_extnum_t idx
, /* index of entry updated */
3713 int whichfork
) /* data or attr fork */
3715 xfs_ifork_t
*ifp
; /* inode fork pointer */
3717 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3718 xfs_bmap_trace_addentry(XFS_BMAP_KTRACE_POST_UP
, fname
, desc
, ip
, idx
,
3719 1, &ifp
->if_u1
.if_extents
[idx
], NULL
, whichfork
);
3723 * Add bmap trace entry prior to updating an extent list entry in place.
3726 xfs_bmap_trace_pre_update(
3727 char *fname
, /* function name */
3728 char *desc
, /* operation description */
3729 xfs_inode_t
*ip
, /* incore inode pointer */
3730 xfs_extnum_t idx
, /* index of entry to be updated */
3731 int whichfork
) /* data or attr fork */
3733 xfs_ifork_t
*ifp
; /* inode fork pointer */
3735 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
3736 xfs_bmap_trace_addentry(XFS_BMAP_KTRACE_PRE_UP
, fname
, desc
, ip
, idx
, 1,
3737 &ifp
->if_u1
.if_extents
[idx
], NULL
, whichfork
);
3739 #endif /* XFS_BMAP_TRACE */
3742 * Compute the worst-case number of indirect blocks that will be used
3743 * for ip's delayed extent of length "len".
3745 STATIC xfs_filblks_t
3746 xfs_bmap_worst_indlen(
3747 xfs_inode_t
*ip
, /* incore inode pointer */
3748 xfs_filblks_t len
) /* delayed extent length */
3750 int level
; /* btree level number */
3751 int maxrecs
; /* maximum record count at this level */
3752 xfs_mount_t
*mp
; /* mount structure */
3753 xfs_filblks_t rval
; /* return value */
3756 maxrecs
= mp
->m_bmap_dmxr
[0];
3757 for (level
= 0, rval
= 0;
3758 level
< XFS_BM_MAXLEVELS(mp
, XFS_DATA_FORK
);
3761 do_div(len
, maxrecs
);
3764 return rval
+ XFS_BM_MAXLEVELS(mp
, XFS_DATA_FORK
) -
3767 maxrecs
= mp
->m_bmap_dmxr
[1];
3772 #if defined(XFS_RW_TRACE)
3781 if (ip
->i_rwtrace
== NULL
)
3783 ktrace_enter(ip
->i_rwtrace
,
3784 (void *)(__psint_t
)XFS_BUNMAPI
,
3786 (void *)(__psint_t
)((ip
->i_d
.di_size
>> 32) & 0xffffffff),
3787 (void *)(__psint_t
)(ip
->i_d
.di_size
& 0xffffffff),
3788 (void *)(__psint_t
)(((xfs_dfiloff_t
)bno
>> 32) & 0xffffffff),
3789 (void *)(__psint_t
)((xfs_dfiloff_t
)bno
& 0xffffffff),
3790 (void *)(__psint_t
)len
,
3791 (void *)(__psint_t
)flags
,
3792 (void *)(unsigned long)current_cpu(),
3804 * Convert inode from non-attributed to attributed.
3805 * Must not be in a transaction, ip must not be locked.
3807 int /* error code */
3808 xfs_bmap_add_attrfork(
3809 xfs_inode_t
*ip
, /* incore inode pointer */
3810 int size
, /* space new attribute needs */
3811 int rsvd
) /* xact may use reserved blks */
3813 xfs_fsblock_t firstblock
; /* 1st block/ag allocated */
3814 xfs_bmap_free_t flist
; /* freed extent list */
3815 xfs_mount_t
*mp
; /* mount structure */
3816 xfs_trans_t
*tp
; /* transaction pointer */
3817 unsigned long s
; /* spinlock spl value */
3818 int blks
; /* space reservation */
3819 int version
= 1; /* superblock attr version */
3820 int committed
; /* xaction was committed */
3821 int logflags
; /* logging flags */
3822 int error
; /* error return value */
3824 ASSERT(XFS_IFORK_Q(ip
) == 0);
3825 ASSERT(ip
->i_df
.if_ext_max
==
3826 XFS_IFORK_DSIZE(ip
) / (uint
)sizeof(xfs_bmbt_rec_t
));
3829 ASSERT(!XFS_NOT_DQATTACHED(mp
, ip
));
3830 tp
= xfs_trans_alloc(mp
, XFS_TRANS_ADDAFORK
);
3831 blks
= XFS_ADDAFORK_SPACE_RES(mp
);
3833 tp
->t_flags
|= XFS_TRANS_RESERVE
;
3834 if ((error
= xfs_trans_reserve(tp
, blks
, XFS_ADDAFORK_LOG_RES(mp
), 0,
3835 XFS_TRANS_PERM_LOG_RES
, XFS_ADDAFORK_LOG_COUNT
)))
3837 xfs_ilock(ip
, XFS_ILOCK_EXCL
);
3838 error
= XFS_TRANS_RESERVE_QUOTA_NBLKS(mp
, tp
, ip
, blks
, 0, rsvd
?
3839 XFS_QMOPT_RES_REGBLKS
| XFS_QMOPT_FORCE_RES
:
3840 XFS_QMOPT_RES_REGBLKS
);
3842 xfs_iunlock(ip
, XFS_ILOCK_EXCL
);
3843 xfs_trans_cancel(tp
, XFS_TRANS_RELEASE_LOG_RES
);
3846 if (XFS_IFORK_Q(ip
))
3848 if (ip
->i_d
.di_aformat
!= XFS_DINODE_FMT_EXTENTS
) {
3850 * For inodes coming from pre-6.2 filesystems.
3852 ASSERT(ip
->i_d
.di_aformat
== 0);
3853 ip
->i_d
.di_aformat
= XFS_DINODE_FMT_EXTENTS
;
3855 ASSERT(ip
->i_d
.di_anextents
== 0);
3856 VN_HOLD(XFS_ITOV(ip
));
3857 xfs_trans_ijoin(tp
, ip
, XFS_ILOCK_EXCL
);
3858 xfs_trans_log_inode(tp
, ip
, XFS_ILOG_CORE
);
3859 switch (ip
->i_d
.di_format
) {
3860 case XFS_DINODE_FMT_DEV
:
3861 ip
->i_d
.di_forkoff
= roundup(sizeof(xfs_dev_t
), 8) >> 3;
3863 case XFS_DINODE_FMT_UUID
:
3864 ip
->i_d
.di_forkoff
= roundup(sizeof(uuid_t
), 8) >> 3;
3866 case XFS_DINODE_FMT_LOCAL
:
3867 case XFS_DINODE_FMT_EXTENTS
:
3868 case XFS_DINODE_FMT_BTREE
:
3869 ip
->i_d
.di_forkoff
= xfs_attr_shortform_bytesfit(ip
, size
);
3870 if (!ip
->i_d
.di_forkoff
)
3871 ip
->i_d
.di_forkoff
= mp
->m_attroffset
>> 3;
3872 else if (!(mp
->m_flags
& XFS_MOUNT_COMPAT_ATTR
))
3877 error
= XFS_ERROR(EINVAL
);
3880 ip
->i_df
.if_ext_max
=
3881 XFS_IFORK_DSIZE(ip
) / (uint
)sizeof(xfs_bmbt_rec_t
);
3882 ASSERT(ip
->i_afp
== NULL
);
3883 ip
->i_afp
= kmem_zone_zalloc(xfs_ifork_zone
, KM_SLEEP
);
3884 ip
->i_afp
->if_ext_max
=
3885 XFS_IFORK_ASIZE(ip
) / (uint
)sizeof(xfs_bmbt_rec_t
);
3886 ip
->i_afp
->if_flags
= XFS_IFEXTENTS
;
3888 XFS_BMAP_INIT(&flist
, &firstblock
);
3889 switch (ip
->i_d
.di_format
) {
3890 case XFS_DINODE_FMT_LOCAL
:
3891 error
= xfs_bmap_add_attrfork_local(tp
, ip
, &firstblock
, &flist
,
3894 case XFS_DINODE_FMT_EXTENTS
:
3895 error
= xfs_bmap_add_attrfork_extents(tp
, ip
, &firstblock
,
3898 case XFS_DINODE_FMT_BTREE
:
3899 error
= xfs_bmap_add_attrfork_btree(tp
, ip
, &firstblock
, &flist
,
3907 xfs_trans_log_inode(tp
, ip
, logflags
);
3910 if (!XFS_SB_VERSION_HASATTR(&mp
->m_sb
) ||
3911 (!XFS_SB_VERSION_HASATTR2(&mp
->m_sb
) && version
== 2)) {
3912 __int64_t sbfields
= 0;
3914 s
= XFS_SB_LOCK(mp
);
3915 if (!XFS_SB_VERSION_HASATTR(&mp
->m_sb
)) {
3916 XFS_SB_VERSION_ADDATTR(&mp
->m_sb
);
3917 sbfields
|= XFS_SB_VERSIONNUM
;
3919 if (!XFS_SB_VERSION_HASATTR2(&mp
->m_sb
) && version
== 2) {
3920 XFS_SB_VERSION_ADDATTR2(&mp
->m_sb
);
3921 sbfields
|= (XFS_SB_VERSIONNUM
| XFS_SB_FEATURES2
);
3924 XFS_SB_UNLOCK(mp
, s
);
3925 xfs_mod_sb(tp
, sbfields
);
3927 XFS_SB_UNLOCK(mp
, s
);
3929 if ((error
= xfs_bmap_finish(&tp
, &flist
, firstblock
, &committed
)))
3931 error
= xfs_trans_commit(tp
, XFS_TRANS_PERM_LOG_RES
, NULL
);
3932 ASSERT(ip
->i_df
.if_ext_max
==
3933 XFS_IFORK_DSIZE(ip
) / (uint
)sizeof(xfs_bmbt_rec_t
));
3936 xfs_bmap_cancel(&flist
);
3938 ASSERT(ismrlocked(&ip
->i_lock
,MR_UPDATE
));
3939 xfs_iunlock(ip
, XFS_ILOCK_EXCL
);
3941 xfs_trans_cancel(tp
, XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
3942 ASSERT(ip
->i_df
.if_ext_max
==
3943 XFS_IFORK_DSIZE(ip
) / (uint
)sizeof(xfs_bmbt_rec_t
));
3948 * Add the extent to the list of extents to be free at transaction end.
3949 * The list is maintained sorted (by block number).
3954 xfs_fsblock_t bno
, /* fs block number of extent */
3955 xfs_filblks_t len
, /* length of extent */
3956 xfs_bmap_free_t
*flist
, /* list of extents */
3957 xfs_mount_t
*mp
) /* mount point structure */
3959 xfs_bmap_free_item_t
*cur
; /* current (next) element */
3960 xfs_bmap_free_item_t
*new; /* new element */
3961 xfs_bmap_free_item_t
*prev
; /* previous element */
3963 xfs_agnumber_t agno
;
3964 xfs_agblock_t agbno
;
3966 ASSERT(bno
!= NULLFSBLOCK
);
3968 ASSERT(len
<= MAXEXTLEN
);
3969 ASSERT(!ISNULLSTARTBLOCK(bno
));
3970 agno
= XFS_FSB_TO_AGNO(mp
, bno
);
3971 agbno
= XFS_FSB_TO_AGBNO(mp
, bno
);
3972 ASSERT(agno
< mp
->m_sb
.sb_agcount
);
3973 ASSERT(agbno
< mp
->m_sb
.sb_agblocks
);
3974 ASSERT(len
< mp
->m_sb
.sb_agblocks
);
3975 ASSERT(agbno
+ len
<= mp
->m_sb
.sb_agblocks
);
3977 ASSERT(xfs_bmap_free_item_zone
!= NULL
);
3978 new = kmem_zone_alloc(xfs_bmap_free_item_zone
, KM_SLEEP
);
3979 new->xbfi_startblock
= bno
;
3980 new->xbfi_blockcount
= (xfs_extlen_t
)len
;
3981 for (prev
= NULL
, cur
= flist
->xbf_first
;
3983 prev
= cur
, cur
= cur
->xbfi_next
) {
3984 if (cur
->xbfi_startblock
>= bno
)
3988 prev
->xbfi_next
= new;
3990 flist
->xbf_first
= new;
3991 new->xbfi_next
= cur
;
3996 * Compute and fill in the value of the maximum depth of a bmap btree
3997 * in this filesystem. Done once, during mount.
4000 xfs_bmap_compute_maxlevels(
4001 xfs_mount_t
*mp
, /* file system mount structure */
4002 int whichfork
) /* data or attr fork */
4004 int level
; /* btree level */
4005 uint maxblocks
; /* max blocks at this level */
4006 uint maxleafents
; /* max leaf entries possible */
4007 int maxrootrecs
; /* max records in root block */
4008 int minleafrecs
; /* min records in leaf block */
4009 int minnoderecs
; /* min records in node block */
4010 int sz
; /* root block size */
4013 * The maximum number of extents in a file, hence the maximum
4014 * number of leaf entries, is controlled by the type of di_nextents
4015 * (a signed 32-bit number, xfs_extnum_t), or by di_anextents
4016 * (a signed 16-bit number, xfs_aextnum_t).
4018 if (whichfork
== XFS_DATA_FORK
) {
4019 maxleafents
= MAXEXTNUM
;
4020 sz
= (mp
->m_flags
& XFS_MOUNT_COMPAT_ATTR
) ?
4021 mp
->m_attroffset
: XFS_BMDR_SPACE_CALC(MINDBTPTRS
);
4023 maxleafents
= MAXAEXTNUM
;
4024 sz
= (mp
->m_flags
& XFS_MOUNT_COMPAT_ATTR
) ?
4025 mp
->m_sb
.sb_inodesize
- mp
->m_attroffset
:
4026 XFS_BMDR_SPACE_CALC(MINABTPTRS
);
4028 maxrootrecs
= (int)XFS_BTREE_BLOCK_MAXRECS(sz
, xfs_bmdr
, 0);
4029 minleafrecs
= mp
->m_bmap_dmnr
[0];
4030 minnoderecs
= mp
->m_bmap_dmnr
[1];
4031 maxblocks
= (maxleafents
+ minleafrecs
- 1) / minleafrecs
;
4032 for (level
= 1; maxblocks
> 1; level
++) {
4033 if (maxblocks
<= maxrootrecs
)
4036 maxblocks
= (maxblocks
+ minnoderecs
- 1) / minnoderecs
;
4038 mp
->m_bm_maxlevels
[whichfork
] = level
;
4042 * Routine to be called at transaction's end by xfs_bmapi, xfs_bunmapi
4043 * caller. Frees all the extents that need freeing, which must be done
4044 * last due to locking considerations. We never free any extents in
4045 * the first transaction. This is to allow the caller to make the first
4046 * transaction a synchronous one so that the pointers to the data being
4047 * broken in this transaction will be permanent before the data is actually
4048 * freed. This is necessary to prevent blocks from being reallocated
4049 * and written to before the free and reallocation are actually permanent.
4050 * We do not just make the first transaction synchronous here, because
4051 * there are more efficient ways to gain the same protection in some cases
4052 * (see the file truncation code).
4054 * Return 1 if the given transaction was committed and a new one
4055 * started, and 0 otherwise in the committed parameter.
4060 xfs_trans_t
**tp
, /* transaction pointer addr */
4061 xfs_bmap_free_t
*flist
, /* i/o: list extents to free */
4062 xfs_fsblock_t firstblock
, /* controlled ag for allocs */
4063 int *committed
) /* xact committed or not */
4065 xfs_efd_log_item_t
*efd
; /* extent free data */
4066 xfs_efi_log_item_t
*efi
; /* extent free intention */
4067 int error
; /* error return value */
4068 xfs_bmap_free_item_t
*free
; /* free extent list item */
4069 unsigned int logres
; /* new log reservation */
4070 unsigned int logcount
; /* new log count */
4071 xfs_mount_t
*mp
; /* filesystem mount structure */
4072 xfs_bmap_free_item_t
*next
; /* next item on free list */
4073 xfs_trans_t
*ntp
; /* new transaction pointer */
4075 ASSERT((*tp
)->t_flags
& XFS_TRANS_PERM_LOG_RES
);
4076 if (flist
->xbf_count
== 0) {
4081 efi
= xfs_trans_get_efi(ntp
, flist
->xbf_count
);
4082 for (free
= flist
->xbf_first
; free
; free
= free
->xbfi_next
)
4083 xfs_trans_log_efi_extent(ntp
, efi
, free
->xbfi_startblock
,
4084 free
->xbfi_blockcount
);
4085 logres
= ntp
->t_log_res
;
4086 logcount
= ntp
->t_log_count
;
4087 ntp
= xfs_trans_dup(*tp
);
4088 error
= xfs_trans_commit(*tp
, 0, NULL
);
4092 * We have a new transaction, so we should return committed=1,
4093 * even though we're returning an error.
4098 if ((error
= xfs_trans_reserve(ntp
, 0, logres
, 0, XFS_TRANS_PERM_LOG_RES
,
4101 efd
= xfs_trans_get_efd(ntp
, efi
, flist
->xbf_count
);
4102 for (free
= flist
->xbf_first
; free
!= NULL
; free
= next
) {
4103 next
= free
->xbfi_next
;
4104 if ((error
= xfs_free_extent(ntp
, free
->xbfi_startblock
,
4105 free
->xbfi_blockcount
))) {
4107 * The bmap free list will be cleaned up at a
4108 * higher level. The EFI will be canceled when
4109 * this transaction is aborted.
4110 * Need to force shutdown here to make sure it
4111 * happens, since this transaction may not be
4115 if (!XFS_FORCED_SHUTDOWN(mp
))
4116 xfs_force_shutdown(mp
,
4117 (error
== EFSCORRUPTED
) ?
4118 XFS_CORRUPT_INCORE
:
4119 XFS_METADATA_IO_ERROR
);
4122 xfs_trans_log_efd_extent(ntp
, efd
, free
->xbfi_startblock
,
4123 free
->xbfi_blockcount
);
4124 xfs_bmap_del_free(flist
, NULL
, free
);
4130 * Free up any items left in the list.
4134 xfs_bmap_free_t
*flist
) /* list of bmap_free_items */
4136 xfs_bmap_free_item_t
*free
; /* free list item */
4137 xfs_bmap_free_item_t
*next
;
4139 if (flist
->xbf_count
== 0)
4141 ASSERT(flist
->xbf_first
!= NULL
);
4142 for (free
= flist
->xbf_first
; free
; free
= next
) {
4143 next
= free
->xbfi_next
;
4144 xfs_bmap_del_free(flist
, NULL
, free
);
4146 ASSERT(flist
->xbf_count
== 0);
4150 * Returns the file-relative block number of the first unused block(s)
4151 * in the file with at least "len" logically contiguous blocks free.
4152 * This is the lowest-address hole if the file has holes, else the first block
4153 * past the end of file.
4154 * Return 0 if the file is currently local (in-inode).
4157 xfs_bmap_first_unused(
4158 xfs_trans_t
*tp
, /* transaction pointer */
4159 xfs_inode_t
*ip
, /* incore inode */
4160 xfs_extlen_t len
, /* size of hole to find */
4161 xfs_fileoff_t
*first_unused
, /* unused block */
4162 int whichfork
) /* data or attr fork */
4164 xfs_bmbt_rec_t
*base
; /* base of extent array */
4165 xfs_bmbt_rec_t
*ep
; /* pointer to an extent entry */
4166 int error
; /* error return value */
4167 xfs_ifork_t
*ifp
; /* inode fork pointer */
4168 xfs_fileoff_t lastaddr
; /* last block number seen */
4169 xfs_fileoff_t lowest
; /* lowest useful block */
4170 xfs_fileoff_t max
; /* starting useful block */
4171 xfs_fileoff_t off
; /* offset for this block */
4172 xfs_extnum_t nextents
; /* number of extent entries */
4174 ASSERT(XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_BTREE
||
4175 XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_EXTENTS
||
4176 XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_LOCAL
);
4177 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_LOCAL
) {
4181 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4182 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
4183 (error
= xfs_iread_extents(tp
, ip
, whichfork
)))
4185 lowest
= *first_unused
;
4186 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
4187 base
= &ifp
->if_u1
.if_extents
[0];
4188 for (lastaddr
= 0, max
= lowest
, ep
= base
;
4189 ep
< &base
[nextents
];
4191 off
= xfs_bmbt_get_startoff(ep
);
4193 * See if the hole before this extent will work.
4195 if (off
>= lowest
+ len
&& off
- max
>= len
) {
4196 *first_unused
= max
;
4199 lastaddr
= off
+ xfs_bmbt_get_blockcount(ep
);
4200 max
= XFS_FILEOFF_MAX(lastaddr
, lowest
);
4202 *first_unused
= max
;
4207 * Returns the file-relative block number of the last block + 1 before
4208 * last_block (input value) in the file.
4209 * This is not based on i_size, it is based on the extent list.
4210 * Returns 0 for local files, as they do not have an extent list.
4213 xfs_bmap_last_before(
4214 xfs_trans_t
*tp
, /* transaction pointer */
4215 xfs_inode_t
*ip
, /* incore inode */
4216 xfs_fileoff_t
*last_block
, /* last block */
4217 int whichfork
) /* data or attr fork */
4219 xfs_fileoff_t bno
; /* input file offset */
4220 int eof
; /* hit end of file */
4221 xfs_bmbt_rec_t
*ep
; /* pointer to last extent */
4222 int error
; /* error return value */
4223 xfs_bmbt_irec_t got
; /* current extent value */
4224 xfs_ifork_t
*ifp
; /* inode fork pointer */
4225 xfs_extnum_t lastx
; /* last extent used */
4226 xfs_bmbt_irec_t prev
; /* previous extent value */
4228 if (XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
&&
4229 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
&&
4230 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_LOCAL
)
4231 return XFS_ERROR(EIO
);
4232 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_LOCAL
) {
4236 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4237 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
4238 (error
= xfs_iread_extents(tp
, ip
, whichfork
)))
4240 bno
= *last_block
- 1;
4241 ep
= xfs_bmap_search_extents(ip
, bno
, whichfork
, &eof
, &lastx
, &got
,
4243 if (eof
|| xfs_bmbt_get_startoff(ep
) > bno
) {
4244 if (prev
.br_startoff
== NULLFILEOFF
)
4247 *last_block
= prev
.br_startoff
+ prev
.br_blockcount
;
4250 * Otherwise *last_block is already the right answer.
4256 * Returns the file-relative block number of the first block past eof in
4257 * the file. This is not based on i_size, it is based on the extent list.
4258 * Returns 0 for local files, as they do not have an extent list.
4261 xfs_bmap_last_offset(
4262 xfs_trans_t
*tp
, /* transaction pointer */
4263 xfs_inode_t
*ip
, /* incore inode */
4264 xfs_fileoff_t
*last_block
, /* last block */
4265 int whichfork
) /* data or attr fork */
4267 xfs_bmbt_rec_t
*base
; /* base of extent array */
4268 xfs_bmbt_rec_t
*ep
; /* pointer to last extent */
4269 int error
; /* error return value */
4270 xfs_ifork_t
*ifp
; /* inode fork pointer */
4271 xfs_extnum_t nextents
; /* number of extent entries */
4273 if (XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
&&
4274 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
&&
4275 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_LOCAL
)
4276 return XFS_ERROR(EIO
);
4277 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_LOCAL
) {
4281 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4282 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
4283 (error
= xfs_iread_extents(tp
, ip
, whichfork
)))
4285 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
4290 base
= &ifp
->if_u1
.if_extents
[0];
4291 ASSERT(base
!= NULL
);
4292 ep
= &base
[nextents
- 1];
4293 *last_block
= xfs_bmbt_get_startoff(ep
) + xfs_bmbt_get_blockcount(ep
);
4298 * Returns whether the selected fork of the inode has exactly one
4299 * block or not. For the data fork we check this matches di_size,
4300 * implying the file's range is 0..bsize-1.
4302 int /* 1=>1 block, 0=>otherwise */
4304 xfs_inode_t
*ip
, /* incore inode */
4305 int whichfork
) /* data or attr fork */
4307 xfs_bmbt_rec_t
*ep
; /* ptr to fork's extent */
4308 xfs_ifork_t
*ifp
; /* inode fork pointer */
4309 int rval
; /* return value */
4310 xfs_bmbt_irec_t s
; /* internal version of extent */
4313 if (whichfork
== XFS_DATA_FORK
)
4314 return ip
->i_d
.di_size
== ip
->i_mount
->m_sb
.sb_blocksize
;
4316 if (XFS_IFORK_NEXTENTS(ip
, whichfork
) != 1)
4318 if (XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
)
4320 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4321 ASSERT(ifp
->if_flags
& XFS_IFEXTENTS
);
4322 ep
= ifp
->if_u1
.if_extents
;
4323 xfs_bmbt_get_all(ep
, &s
);
4324 rval
= s
.br_startoff
== 0 && s
.br_blockcount
== 1;
4325 if (rval
&& whichfork
== XFS_DATA_FORK
)
4326 ASSERT(ip
->i_d
.di_size
== ip
->i_mount
->m_sb
.sb_blocksize
);
4331 * Read in the extents to if_extents.
4332 * All inode fields are set up by caller, we just traverse the btree
4333 * and copy the records in. If the file system cannot contain unwritten
4334 * extents, the records are checked for no "state" flags.
4337 xfs_bmap_read_extents(
4338 xfs_trans_t
*tp
, /* transaction pointer */
4339 xfs_inode_t
*ip
, /* incore inode */
4340 int whichfork
) /* data or attr fork */
4342 xfs_bmbt_block_t
*block
; /* current btree block */
4343 xfs_fsblock_t bno
; /* block # of "block" */
4344 xfs_buf_t
*bp
; /* buffer for "block" */
4345 int error
; /* error return value */
4346 xfs_exntfmt_t exntf
; /* XFS_EXTFMT_NOSTATE, if checking */
4347 #ifdef XFS_BMAP_TRACE
4348 static char fname
[] = "xfs_bmap_read_extents";
4350 xfs_extnum_t i
, j
; /* index into the extents list */
4351 xfs_ifork_t
*ifp
; /* fork structure */
4352 int level
; /* btree level, for checking */
4353 xfs_mount_t
*mp
; /* file system mount structure */
4354 xfs_bmbt_ptr_t
*pp
; /* pointer to block address */
4356 xfs_extnum_t room
; /* number of entries there's room for */
4357 xfs_bmbt_rec_t
*trp
; /* target record pointer */
4361 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4362 exntf
= (whichfork
!= XFS_DATA_FORK
) ? XFS_EXTFMT_NOSTATE
:
4363 XFS_EXTFMT_INODE(ip
);
4364 block
= ifp
->if_broot
;
4366 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
4368 ASSERT(INT_GET(block
->bb_level
, ARCH_CONVERT
) > 0);
4369 level
= INT_GET(block
->bb_level
, ARCH_CONVERT
);
4370 pp
= XFS_BMAP_BROOT_PTR_ADDR(block
, 1, ifp
->if_broot_bytes
);
4371 ASSERT(INT_GET(*pp
, ARCH_CONVERT
) != NULLDFSBNO
);
4372 ASSERT(XFS_FSB_TO_AGNO(mp
, INT_GET(*pp
, ARCH_CONVERT
)) < mp
->m_sb
.sb_agcount
);
4373 ASSERT(XFS_FSB_TO_AGBNO(mp
, INT_GET(*pp
, ARCH_CONVERT
)) < mp
->m_sb
.sb_agblocks
);
4374 bno
= INT_GET(*pp
, ARCH_CONVERT
);
4376 * Go down the tree until leaf level is reached, following the first
4377 * pointer (leftmost) at each level.
4379 while (level
-- > 0) {
4380 if ((error
= xfs_btree_read_bufl(mp
, tp
, bno
, 0, &bp
,
4381 XFS_BMAP_BTREE_REF
)))
4383 block
= XFS_BUF_TO_BMBT_BLOCK(bp
);
4384 XFS_WANT_CORRUPTED_GOTO(
4385 XFS_BMAP_SANITY_CHECK(mp
, block
, level
),
4389 pp
= XFS_BTREE_PTR_ADDR(mp
->m_sb
.sb_blocksize
, xfs_bmbt
, block
,
4390 1, mp
->m_bmap_dmxr
[1]);
4391 XFS_WANT_CORRUPTED_GOTO(
4392 XFS_FSB_SANITY_CHECK(mp
, INT_GET(*pp
, ARCH_CONVERT
)),
4394 bno
= INT_GET(*pp
, ARCH_CONVERT
);
4395 xfs_trans_brelse(tp
, bp
);
4398 * Here with bp and block set to the leftmost leaf node in the tree.
4400 room
= ifp
->if_bytes
/ (uint
)sizeof(*trp
);
4401 trp
= ifp
->if_u1
.if_extents
;
4404 * Loop over all leaf nodes. Copy information to the extent list.
4407 xfs_bmbt_rec_t
*frp
, *temp
;
4408 xfs_fsblock_t nextbno
;
4409 xfs_extnum_t num_recs
;
4412 num_recs
= INT_GET(block
->bb_numrecs
, ARCH_CONVERT
);
4413 if (unlikely(i
+ num_recs
> room
)) {
4414 ASSERT(i
+ num_recs
<= room
);
4415 xfs_fs_cmn_err(CE_WARN
, ip
->i_mount
,
4416 "corrupt dinode %Lu, (btree extents). Unmount and run xfs_repair.",
4417 (unsigned long long) ip
->i_ino
);
4418 XFS_ERROR_REPORT("xfs_bmap_read_extents(1)",
4423 XFS_WANT_CORRUPTED_GOTO(
4424 XFS_BMAP_SANITY_CHECK(mp
, block
, 0),
4427 * Read-ahead the next leaf block, if any.
4429 nextbno
= INT_GET(block
->bb_rightsib
, ARCH_CONVERT
);
4430 if (nextbno
!= NULLFSBLOCK
)
4431 xfs_btree_reada_bufl(mp
, nextbno
, 1);
4433 * Copy records into the extent list.
4435 frp
= XFS_BTREE_REC_ADDR(mp
->m_sb
.sb_blocksize
, xfs_bmbt
,
4436 block
, 1, mp
->m_bmap_dmxr
[0]);
4438 for (j
= 0; j
< num_recs
; j
++, frp
++, trp
++) {
4439 trp
->l0
= INT_GET(frp
->l0
, ARCH_CONVERT
);
4440 trp
->l1
= INT_GET(frp
->l1
, ARCH_CONVERT
);
4442 if (exntf
== XFS_EXTFMT_NOSTATE
) {
4444 * Check all attribute bmap btree records and
4445 * any "older" data bmap btree records for a
4446 * set bit in the "extent flag" position.
4448 if (unlikely(xfs_check_nostate_extents(temp
, num_recs
))) {
4449 XFS_ERROR_REPORT("xfs_bmap_read_extents(2)",
4456 xfs_trans_brelse(tp
, bp
);
4459 * If we've reached the end, stop.
4461 if (bno
== NULLFSBLOCK
)
4463 if ((error
= xfs_btree_read_bufl(mp
, tp
, bno
, 0, &bp
,
4464 XFS_BMAP_BTREE_REF
)))
4466 block
= XFS_BUF_TO_BMBT_BLOCK(bp
);
4468 ASSERT(i
== ifp
->if_bytes
/ (uint
)sizeof(*trp
));
4469 ASSERT(i
== XFS_IFORK_NEXTENTS(ip
, whichfork
));
4470 xfs_bmap_trace_exlist(fname
, ip
, i
, whichfork
);
4473 xfs_trans_brelse(tp
, bp
);
4474 return XFS_ERROR(EFSCORRUPTED
);
4477 #ifdef XFS_BMAP_TRACE
4479 * Add bmap trace insert entries for all the contents of the extent list.
4482 xfs_bmap_trace_exlist(
4483 char *fname
, /* function name */
4484 xfs_inode_t
*ip
, /* incore inode pointer */
4485 xfs_extnum_t cnt
, /* count of entries in the list */
4486 int whichfork
) /* data or attr fork */
4488 xfs_bmbt_rec_t
*base
; /* base of extent list */
4489 xfs_bmbt_rec_t
*ep
; /* current entry in extent list */
4490 xfs_extnum_t idx
; /* extent list entry number */
4491 xfs_ifork_t
*ifp
; /* inode fork pointer */
4492 xfs_bmbt_irec_t s
; /* extent list record */
4494 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4495 ASSERT(cnt
== ifp
->if_bytes
/ (uint
)sizeof(*base
));
4496 base
= ifp
->if_u1
.if_extents
;
4497 for (idx
= 0, ep
= base
; idx
< cnt
; idx
++, ep
++) {
4498 xfs_bmbt_get_all(ep
, &s
);
4499 xfs_bmap_trace_insert(fname
, "exlist", ip
, idx
, 1, &s
, NULL
,
4507 * Validate that the bmbt_irecs being returned from bmapi are valid
4508 * given the callers original parameters. Specifically check the
4509 * ranges of the returned irecs to ensure that they only extent beyond
4510 * the given parameters if the XFS_BMAPI_ENTIRE flag was set.
4513 xfs_bmap_validate_ret(
4517 xfs_bmbt_irec_t
*mval
,
4521 int i
; /* index to map values */
4523 ASSERT(ret_nmap
<= nmap
);
4525 for (i
= 0; i
< ret_nmap
; i
++) {
4526 ASSERT(mval
[i
].br_blockcount
> 0);
4527 if (!(flags
& XFS_BMAPI_ENTIRE
)) {
4528 ASSERT(mval
[i
].br_startoff
>= bno
);
4529 ASSERT(mval
[i
].br_blockcount
<= len
);
4530 ASSERT(mval
[i
].br_startoff
+ mval
[i
].br_blockcount
<=
4533 ASSERT(mval
[i
].br_startoff
< bno
+ len
);
4534 ASSERT(mval
[i
].br_startoff
+ mval
[i
].br_blockcount
>
4538 mval
[i
- 1].br_startoff
+ mval
[i
- 1].br_blockcount
==
4539 mval
[i
].br_startoff
);
4540 if ((flags
& XFS_BMAPI_WRITE
) && !(flags
& XFS_BMAPI_DELAY
))
4541 ASSERT(mval
[i
].br_startblock
!= DELAYSTARTBLOCK
&&
4542 mval
[i
].br_startblock
!= HOLESTARTBLOCK
);
4543 ASSERT(mval
[i
].br_state
== XFS_EXT_NORM
||
4544 mval
[i
].br_state
== XFS_EXT_UNWRITTEN
);
4551 * Map file blocks to filesystem blocks.
4552 * File range is given by the bno/len pair.
4553 * Adds blocks to file if a write ("flags & XFS_BMAPI_WRITE" set)
4554 * into a hole or past eof.
4555 * Only allocates blocks from a single allocation group,
4556 * to avoid locking problems.
4557 * The returned value in "firstblock" from the first call in a transaction
4558 * must be remembered and presented to subsequent calls in "firstblock".
4559 * An upper bound for the number of blocks to be allocated is supplied to
4560 * the first call in "total"; if no allocation group has that many free
4561 * blocks then the call will fail (return NULLFSBLOCK in "firstblock").
4565 xfs_trans_t
*tp
, /* transaction pointer */
4566 xfs_inode_t
*ip
, /* incore inode */
4567 xfs_fileoff_t bno
, /* starting file offs. mapped */
4568 xfs_filblks_t len
, /* length to map in file */
4569 int flags
, /* XFS_BMAPI_... */
4570 xfs_fsblock_t
*firstblock
, /* first allocated block
4571 controls a.g. for allocs */
4572 xfs_extlen_t total
, /* total blocks needed */
4573 xfs_bmbt_irec_t
*mval
, /* output: map values */
4574 int *nmap
, /* i/o: mval size/count */
4575 xfs_bmap_free_t
*flist
) /* i/o: list extents to free */
4577 xfs_fsblock_t abno
; /* allocated block number */
4578 xfs_extlen_t alen
; /* allocated extent length */
4579 xfs_fileoff_t aoff
; /* allocated file offset */
4580 xfs_bmalloca_t bma
; /* args for xfs_bmap_alloc */
4581 xfs_btree_cur_t
*cur
; /* bmap btree cursor */
4582 xfs_fileoff_t end
; /* end of mapped file region */
4583 int eof
; /* we've hit the end of extent list */
4584 char contig
; /* allocation must be one extent */
4585 char delay
; /* this request is for delayed alloc */
4586 char exact
; /* don't do all of wasdelayed extent */
4587 xfs_bmbt_rec_t
*ep
; /* extent list entry pointer */
4588 int error
; /* error return */
4589 xfs_bmbt_irec_t got
; /* current extent list record */
4590 xfs_ifork_t
*ifp
; /* inode fork pointer */
4591 xfs_extlen_t indlen
; /* indirect blocks length */
4592 xfs_extnum_t lastx
; /* last useful extent number */
4593 int logflags
; /* flags for transaction logging */
4594 xfs_extlen_t minleft
; /* min blocks left after allocation */
4595 xfs_extlen_t minlen
; /* min allocation size */
4596 xfs_mount_t
*mp
; /* xfs mount structure */
4597 int n
; /* current extent index */
4598 int nallocs
; /* number of extents alloc\'d */
4599 xfs_extnum_t nextents
; /* number of extents in file */
4600 xfs_fileoff_t obno
; /* old block number (offset) */
4601 xfs_bmbt_irec_t prev
; /* previous extent list record */
4602 int tmp_logflags
; /* temp flags holder */
4603 int whichfork
; /* data or attr fork */
4604 char inhole
; /* current location is hole in file */
4605 char stateless
; /* ignore state flag set */
4606 char trim
; /* output trimmed to match range */
4607 char userdata
; /* allocating non-metadata */
4608 char wasdelay
; /* old extent was delayed */
4609 char wr
; /* this is a write request */
4610 char rt
; /* this is a realtime file */
4611 char rsvd
; /* OK to allocate reserved blocks */
4613 xfs_fileoff_t orig_bno
; /* original block number value */
4614 int orig_flags
; /* original flags arg value */
4615 xfs_filblks_t orig_len
; /* original value of len arg */
4616 xfs_bmbt_irec_t
*orig_mval
; /* original value of mval */
4617 int orig_nmap
; /* original value of *nmap */
4626 ASSERT(*nmap
<= XFS_BMAP_MAX_NMAP
|| !(flags
& XFS_BMAPI_WRITE
));
4627 whichfork
= (flags
& XFS_BMAPI_ATTRFORK
) ?
4628 XFS_ATTR_FORK
: XFS_DATA_FORK
;
4630 if (unlikely(XFS_TEST_ERROR(
4631 (XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
&&
4632 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
&&
4633 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_LOCAL
),
4634 mp
, XFS_ERRTAG_BMAPIFORMAT
, XFS_RANDOM_BMAPIFORMAT
))) {
4635 XFS_ERROR_REPORT("xfs_bmapi", XFS_ERRLEVEL_LOW
, mp
);
4636 return XFS_ERROR(EFSCORRUPTED
);
4638 if (XFS_FORCED_SHUTDOWN(mp
))
4639 return XFS_ERROR(EIO
);
4640 rt
= XFS_IS_REALTIME_INODE(ip
);
4641 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
4642 ASSERT(ifp
->if_ext_max
==
4643 XFS_IFORK_SIZE(ip
, whichfork
) / (uint
)sizeof(xfs_bmbt_rec_t
));
4644 if ((wr
= (flags
& XFS_BMAPI_WRITE
)) != 0)
4645 XFS_STATS_INC(xs_blk_mapw
);
4647 XFS_STATS_INC(xs_blk_mapr
);
4648 delay
= (flags
& XFS_BMAPI_DELAY
) != 0;
4649 trim
= (flags
& XFS_BMAPI_ENTIRE
) == 0;
4650 userdata
= (flags
& XFS_BMAPI_METADATA
) == 0;
4651 exact
= (flags
& XFS_BMAPI_EXACT
) != 0;
4652 rsvd
= (flags
& XFS_BMAPI_RSVBLOCKS
) != 0;
4653 contig
= (flags
& XFS_BMAPI_CONTIG
) != 0;
4655 * stateless is used to combine extents which
4656 * differ only due to the state of the extents.
4657 * This technique is used from xfs_getbmap()
4658 * when the caller does not wish to see the
4659 * separation (which is the default).
4661 * This technique is also used when writing a
4662 * buffer which has been partially written,
4663 * (usually by being flushed during a chunkread),
4664 * to ensure one write takes place. This also
4665 * prevents a change in the xfs inode extents at
4666 * this time, intentionally. This change occurs
4667 * on completion of the write operation, in
4668 * xfs_strat_comp(), where the xfs_bmapi() call
4669 * is transactioned, and the extents combined.
4671 stateless
= (flags
& XFS_BMAPI_IGSTATE
) != 0;
4672 if (stateless
&& wr
) /* if writing unwritten space, no */
4673 wr
= 0; /* allocations are allowed */
4674 ASSERT(wr
|| !delay
);
4678 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_LOCAL
) {
4680 if ((error
= xfs_bmap_local_to_extents(tp
, ip
,
4681 firstblock
, total
, &logflags
, whichfork
)))
4684 if (wr
&& *firstblock
== NULLFSBLOCK
) {
4685 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_BTREE
)
4686 minleft
= INT_GET(ifp
->if_broot
->bb_level
, ARCH_CONVERT
) + 1;
4691 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
4692 (error
= xfs_iread_extents(tp
, ip
, whichfork
)))
4694 ep
= xfs_bmap_search_extents(ip
, bno
, whichfork
, &eof
, &lastx
, &got
,
4696 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
4701 while (bno
< end
&& n
< *nmap
) {
4703 * Reading past eof, act as though there's a hole
4707 got
.br_startoff
= end
;
4708 inhole
= eof
|| got
.br_startoff
> bno
;
4709 wasdelay
= wr
&& !inhole
&& !delay
&&
4710 ISNULLSTARTBLOCK(got
.br_startblock
);
4712 * First, deal with the hole before the allocated space
4713 * that we found, if any.
4715 if (wr
&& (inhole
|| wasdelay
)) {
4717 * For the wasdelay case, we could also just
4718 * allocate the stuff asked for in this bmap call
4719 * but that wouldn't be as good.
4721 if (wasdelay
&& !exact
) {
4722 alen
= (xfs_extlen_t
)got
.br_blockcount
;
4723 aoff
= got
.br_startoff
;
4724 if (lastx
!= NULLEXTNUM
&& lastx
) {
4725 ep
= &ifp
->if_u1
.if_extents
[lastx
- 1];
4726 xfs_bmbt_get_all(ep
, &prev
);
4728 } else if (wasdelay
) {
4729 alen
= (xfs_extlen_t
)
4730 XFS_FILBLKS_MIN(len
,
4732 got
.br_blockcount
) - bno
);
4735 alen
= (xfs_extlen_t
)
4736 XFS_FILBLKS_MIN(len
, MAXEXTLEN
);
4738 alen
= (xfs_extlen_t
)
4739 XFS_FILBLKS_MIN(alen
,
4740 got
.br_startoff
- bno
);
4743 minlen
= contig
? alen
: 1;
4745 xfs_extlen_t extsz
= 0;
4747 /* Figure out the extent size, adjust alen */
4749 if (!(extsz
= ip
->i_d
.di_extsize
))
4750 extsz
= mp
->m_sb
.sb_rextsize
;
4751 alen
= roundup(alen
, extsz
);
4752 extsz
= alen
/ mp
->m_sb
.sb_rextsize
;
4756 * Make a transaction-less quota reservation for
4757 * delayed allocation blocks. This number gets
4759 * We return EDQUOT if we haven't allocated
4760 * blks already inside this loop;
4762 if (XFS_TRANS_RESERVE_QUOTA_NBLKS(
4763 mp
, NULL
, ip
, (long)alen
, 0,
4764 rt
? XFS_QMOPT_RES_RTBLKS
:
4765 XFS_QMOPT_RES_REGBLKS
)) {
4768 ASSERT(cur
== NULL
);
4769 return XFS_ERROR(EDQUOT
);
4775 * Split changing sb for alen and indlen since
4776 * they could be coming from different places.
4778 indlen
= (xfs_extlen_t
)
4779 xfs_bmap_worst_indlen(ip
, alen
);
4783 error
= xfs_mod_incore_sb(mp
,
4787 error
= xfs_mod_incore_sb(mp
,
4791 error
= xfs_mod_incore_sb(mp
,
4795 xfs_mod_incore_sb(ip
->i_mount
,
4799 xfs_mod_incore_sb(ip
->i_mount
,
4806 if (XFS_IS_QUOTA_ON(ip
->i_mount
))
4807 /* unreserve the blocks now */
4808 XFS_TRANS_UNRESERVE_QUOTA_NBLKS(
4811 XFS_QMOPT_RES_RTBLKS
:
4812 XFS_QMOPT_RES_REGBLKS
);
4816 ip
->i_delayed_blks
+= alen
;
4817 abno
= NULLSTARTBLOCK(indlen
);
4820 * If first time, allocate and fill in
4821 * once-only bma fields.
4823 if (bma
.ip
== NULL
) {
4831 /* Indicate if this is the first user data
4832 * in the file, or just any user data.
4835 bma
.userdata
= (aoff
== 0) ?
4836 XFS_ALLOC_INITIAL_USER_DATA
:
4840 * Fill in changeable bma fields.
4843 bma
.firstblock
= *firstblock
;
4846 bma
.wasdel
= wasdelay
;
4847 bma
.minlen
= minlen
;
4848 bma
.low
= flist
->xbf_low
;
4849 bma
.minleft
= minleft
;
4851 * Only want to do the alignment at the
4852 * eof if it is userdata and allocation length
4853 * is larger than a stripe unit.
4855 if (mp
->m_dalign
&& alen
>= mp
->m_dalign
&&
4856 userdata
&& whichfork
== XFS_DATA_FORK
) {
4857 if ((error
= xfs_bmap_isaeof(ip
, aoff
,
4858 whichfork
, &bma
.aeof
)))
4865 if ((error
= xfs_bmap_alloc(&bma
)))
4868 * Copy out result fields.
4871 if ((flist
->xbf_low
= bma
.low
))
4875 ASSERT(*firstblock
== NULLFSBLOCK
||
4876 XFS_FSB_TO_AGNO(mp
, *firstblock
) ==
4877 XFS_FSB_TO_AGNO(mp
, bma
.firstblock
) ||
4879 XFS_FSB_TO_AGNO(mp
, *firstblock
) <
4880 XFS_FSB_TO_AGNO(mp
, bma
.firstblock
)));
4881 *firstblock
= bma
.firstblock
;
4883 cur
->bc_private
.b
.firstblock
=
4885 if (abno
== NULLFSBLOCK
)
4887 if ((ifp
->if_flags
& XFS_IFBROOT
) && !cur
) {
4888 cur
= xfs_btree_init_cursor(mp
,
4889 tp
, NULL
, 0, XFS_BTNUM_BMAP
,
4891 cur
->bc_private
.b
.firstblock
=
4893 cur
->bc_private
.b
.flist
= flist
;
4896 * Bump the number of extents we've allocated
4902 cur
->bc_private
.b
.flags
=
4903 wasdelay
? XFS_BTCUR_BPRV_WASDEL
: 0;
4904 got
.br_startoff
= aoff
;
4905 got
.br_startblock
= abno
;
4906 got
.br_blockcount
= alen
;
4907 got
.br_state
= XFS_EXT_NORM
; /* assume normal */
4909 * Determine state of extent, and the filesystem.
4910 * A wasdelay extent has been initialized, so
4911 * shouldn't be flagged as unwritten.
4913 if (wr
&& XFS_SB_VERSION_HASEXTFLGBIT(&mp
->m_sb
)) {
4914 if (!wasdelay
&& (flags
& XFS_BMAPI_PREALLOC
))
4915 got
.br_state
= XFS_EXT_UNWRITTEN
;
4917 error
= xfs_bmap_add_extent(ip
, lastx
, &cur
, &got
,
4918 firstblock
, flist
, &tmp_logflags
, whichfork
,
4920 logflags
|= tmp_logflags
;
4923 lastx
= ifp
->if_lastex
;
4924 ep
= &ifp
->if_u1
.if_extents
[lastx
];
4925 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
4926 xfs_bmbt_get_all(ep
, &got
);
4927 ASSERT(got
.br_startoff
<= aoff
);
4928 ASSERT(got
.br_startoff
+ got
.br_blockcount
>=
4932 ASSERT(ISNULLSTARTBLOCK(got
.br_startblock
));
4933 ASSERT(STARTBLOCKVAL(got
.br_startblock
) > 0);
4935 ASSERT(got
.br_state
== XFS_EXT_NORM
||
4936 got
.br_state
== XFS_EXT_UNWRITTEN
);
4939 * Fall down into the found allocated space case.
4941 } else if (inhole
) {
4943 * Reading in a hole.
4945 mval
->br_startoff
= bno
;
4946 mval
->br_startblock
= HOLESTARTBLOCK
;
4947 mval
->br_blockcount
=
4948 XFS_FILBLKS_MIN(len
, got
.br_startoff
- bno
);
4949 mval
->br_state
= XFS_EXT_NORM
;
4950 bno
+= mval
->br_blockcount
;
4951 len
-= mval
->br_blockcount
;
4957 * Then deal with the allocated space we found.
4960 if (trim
&& (got
.br_startoff
+ got
.br_blockcount
> obno
)) {
4963 ASSERT((bno
>= obno
) || (n
== 0));
4965 mval
->br_startoff
= bno
;
4966 if (ISNULLSTARTBLOCK(got
.br_startblock
)) {
4967 ASSERT(!wr
|| delay
);
4968 mval
->br_startblock
= DELAYSTARTBLOCK
;
4970 mval
->br_startblock
=
4972 (bno
- got
.br_startoff
);
4974 * Return the minimum of what we got and what we
4975 * asked for for the length. We can use the len
4976 * variable here because it is modified below
4977 * and we could have been there before coming
4978 * here if the first part of the allocation
4979 * didn't overlap what was asked for.
4981 mval
->br_blockcount
=
4982 XFS_FILBLKS_MIN(end
- bno
, got
.br_blockcount
-
4983 (bno
- got
.br_startoff
));
4984 mval
->br_state
= got
.br_state
;
4985 ASSERT(mval
->br_blockcount
<= len
);
4988 if (ISNULLSTARTBLOCK(mval
->br_startblock
)) {
4989 ASSERT(!wr
|| delay
);
4990 mval
->br_startblock
= DELAYSTARTBLOCK
;
4995 * Check if writing previously allocated but
4996 * unwritten extents.
4998 if (wr
&& mval
->br_state
== XFS_EXT_UNWRITTEN
&&
4999 ((flags
& (XFS_BMAPI_PREALLOC
|XFS_BMAPI_DELAY
)) == 0)) {
5001 * Modify (by adding) the state flag, if writing.
5003 ASSERT(mval
->br_blockcount
<= len
);
5004 if ((ifp
->if_flags
& XFS_IFBROOT
) && !cur
) {
5005 cur
= xfs_btree_init_cursor(mp
,
5006 tp
, NULL
, 0, XFS_BTNUM_BMAP
,
5008 cur
->bc_private
.b
.firstblock
=
5010 cur
->bc_private
.b
.flist
= flist
;
5012 mval
->br_state
= XFS_EXT_NORM
;
5013 error
= xfs_bmap_add_extent(ip
, lastx
, &cur
, mval
,
5014 firstblock
, flist
, &tmp_logflags
, whichfork
,
5016 logflags
|= tmp_logflags
;
5019 lastx
= ifp
->if_lastex
;
5020 ep
= &ifp
->if_u1
.if_extents
[lastx
];
5021 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
5022 xfs_bmbt_get_all(ep
, &got
);
5024 * We may have combined previously unwritten
5025 * space with written space, so generate
5028 if (mval
->br_blockcount
< len
)
5033 ((mval
->br_startoff
+ mval
->br_blockcount
) <= end
));
5034 ASSERT(!trim
|| (mval
->br_blockcount
<= len
) ||
5035 (mval
->br_startoff
< obno
));
5036 bno
= mval
->br_startoff
+ mval
->br_blockcount
;
5038 if (n
> 0 && mval
->br_startoff
== mval
[-1].br_startoff
) {
5039 ASSERT(mval
->br_startblock
== mval
[-1].br_startblock
);
5040 ASSERT(mval
->br_blockcount
> mval
[-1].br_blockcount
);
5041 ASSERT(mval
->br_state
== mval
[-1].br_state
);
5042 mval
[-1].br_blockcount
= mval
->br_blockcount
;
5043 mval
[-1].br_state
= mval
->br_state
;
5044 } else if (n
> 0 && mval
->br_startblock
!= DELAYSTARTBLOCK
&&
5045 mval
[-1].br_startblock
!= DELAYSTARTBLOCK
&&
5046 mval
[-1].br_startblock
!= HOLESTARTBLOCK
&&
5047 mval
->br_startblock
==
5048 mval
[-1].br_startblock
+ mval
[-1].br_blockcount
&&
5049 (stateless
|| mval
[-1].br_state
== mval
->br_state
)) {
5050 ASSERT(mval
->br_startoff
==
5051 mval
[-1].br_startoff
+ mval
[-1].br_blockcount
);
5052 mval
[-1].br_blockcount
+= mval
->br_blockcount
;
5054 mval
->br_startblock
== DELAYSTARTBLOCK
&&
5055 mval
[-1].br_startblock
== DELAYSTARTBLOCK
&&
5056 mval
->br_startoff
==
5057 mval
[-1].br_startoff
+ mval
[-1].br_blockcount
) {
5058 mval
[-1].br_blockcount
+= mval
->br_blockcount
;
5059 mval
[-1].br_state
= mval
->br_state
;
5060 } else if (!((n
== 0) &&
5061 ((mval
->br_startoff
+ mval
->br_blockcount
) <=
5067 * If we're done, stop now. Stop when we've allocated
5068 * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise
5069 * the transaction may get too big.
5071 if (bno
>= end
|| n
>= *nmap
|| nallocs
>= *nmap
)
5074 * Else go on to the next record.
5078 if (lastx
>= nextents
) {
5082 xfs_bmbt_get_all(ep
, &got
);
5084 ifp
->if_lastex
= lastx
;
5087 * Transform from btree to extents, give it cur.
5089 if (tp
&& XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_BTREE
&&
5090 XFS_IFORK_NEXTENTS(ip
, whichfork
) <= ifp
->if_ext_max
) {
5092 error
= xfs_bmap_btree_to_extents(tp
, ip
, cur
,
5093 &tmp_logflags
, whichfork
);
5094 logflags
|= tmp_logflags
;
5098 ASSERT(ifp
->if_ext_max
==
5099 XFS_IFORK_SIZE(ip
, whichfork
) / (uint
)sizeof(xfs_bmbt_rec_t
));
5100 ASSERT(XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
||
5101 XFS_IFORK_NEXTENTS(ip
, whichfork
) > ifp
->if_ext_max
);
5106 * Log everything. Do this after conversion, there's no point in
5107 * logging the extent list if we've converted to btree format.
5109 if ((logflags
& XFS_ILOG_FEXT(whichfork
)) &&
5110 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
)
5111 logflags
&= ~XFS_ILOG_FEXT(whichfork
);
5112 else if ((logflags
& XFS_ILOG_FBROOT(whichfork
)) &&
5113 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
)
5114 logflags
&= ~XFS_ILOG_FBROOT(whichfork
);
5116 * Log whatever the flags say, even if error. Otherwise we might miss
5117 * detecting a case where the data is changed, there's an error,
5118 * and it's not logged so we don't shutdown when we should.
5122 xfs_trans_log_inode(tp
, ip
, logflags
);
5126 ASSERT(*firstblock
== NULLFSBLOCK
||
5127 XFS_FSB_TO_AGNO(mp
, *firstblock
) ==
5129 cur
->bc_private
.b
.firstblock
) ||
5131 XFS_FSB_TO_AGNO(mp
, *firstblock
) <
5133 cur
->bc_private
.b
.firstblock
)));
5134 *firstblock
= cur
->bc_private
.b
.firstblock
;
5136 xfs_btree_del_cursor(cur
,
5137 error
? XFS_BTREE_ERROR
: XFS_BTREE_NOERROR
);
5140 xfs_bmap_validate_ret(orig_bno
, orig_len
, orig_flags
, orig_mval
,
5146 * Map file blocks to filesystem blocks, simple version.
5147 * One block (extent) only, read-only.
5148 * For flags, only the XFS_BMAPI_ATTRFORK flag is examined.
5149 * For the other flag values, the effect is as if XFS_BMAPI_METADATA
5150 * was set and all the others were clear.
5154 xfs_trans_t
*tp
, /* transaction pointer */
5155 xfs_inode_t
*ip
, /* incore inode */
5156 int whichfork
, /* data or attr fork */
5157 xfs_fsblock_t
*fsb
, /* output: mapped block */
5158 xfs_fileoff_t bno
) /* starting file offs. mapped */
5160 int eof
; /* we've hit the end of extent list */
5161 int error
; /* error return */
5162 xfs_bmbt_irec_t got
; /* current extent list record */
5163 xfs_ifork_t
*ifp
; /* inode fork pointer */
5164 xfs_extnum_t lastx
; /* last useful extent number */
5165 xfs_bmbt_irec_t prev
; /* previous extent list record */
5167 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
5169 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
&&
5170 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
)) {
5171 XFS_ERROR_REPORT("xfs_bmapi_single", XFS_ERRLEVEL_LOW
,
5173 return XFS_ERROR(EFSCORRUPTED
);
5175 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
))
5176 return XFS_ERROR(EIO
);
5177 XFS_STATS_INC(xs_blk_mapr
);
5178 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
5179 (error
= xfs_iread_extents(tp
, ip
, whichfork
)))
5181 (void)xfs_bmap_search_extents(ip
, bno
, whichfork
, &eof
, &lastx
, &got
,
5184 * Reading past eof, act as though there's a hole
5187 if (eof
|| got
.br_startoff
> bno
) {
5191 ASSERT(!ISNULLSTARTBLOCK(got
.br_startblock
));
5192 ASSERT(bno
< got
.br_startoff
+ got
.br_blockcount
);
5193 *fsb
= got
.br_startblock
+ (bno
- got
.br_startoff
);
5194 ifp
->if_lastex
= lastx
;
5199 * Unmap (remove) blocks from a file.
5200 * If nexts is nonzero then the number of extents to remove is limited to
5201 * that value. If not all extents in the block range can be removed then
5206 xfs_trans_t
*tp
, /* transaction pointer */
5207 struct xfs_inode
*ip
, /* incore inode */
5208 xfs_fileoff_t bno
, /* starting offset to unmap */
5209 xfs_filblks_t len
, /* length to unmap in file */
5210 int flags
, /* misc flags */
5211 xfs_extnum_t nexts
, /* number of extents max */
5212 xfs_fsblock_t
*firstblock
, /* first allocated block
5213 controls a.g. for allocs */
5214 xfs_bmap_free_t
*flist
, /* i/o: list extents to free */
5215 int *done
) /* set if not done yet */
5217 xfs_btree_cur_t
*cur
; /* bmap btree cursor */
5218 xfs_bmbt_irec_t del
; /* extent being deleted */
5219 int eof
; /* is deleting at eof */
5220 xfs_bmbt_rec_t
*ep
; /* extent list entry pointer */
5221 int error
; /* error return value */
5222 xfs_extnum_t extno
; /* extent number in list */
5223 xfs_bmbt_irec_t got
; /* current extent list entry */
5224 xfs_ifork_t
*ifp
; /* inode fork pointer */
5225 int isrt
; /* freeing in rt area */
5226 xfs_extnum_t lastx
; /* last extent index used */
5227 int logflags
; /* transaction logging flags */
5228 xfs_extlen_t mod
; /* rt extent offset */
5229 xfs_mount_t
*mp
; /* mount structure */
5230 xfs_extnum_t nextents
; /* size of extent list */
5231 xfs_bmbt_irec_t prev
; /* previous extent list entry */
5232 xfs_fileoff_t start
; /* first file offset deleted */
5233 int tmp_logflags
; /* partial logging flags */
5234 int wasdel
; /* was a delayed alloc extent */
5235 int whichfork
; /* data or attribute fork */
5236 int rsvd
; /* OK to allocate reserved blocks */
5239 xfs_bunmap_trace(ip
, bno
, len
, flags
, (inst_t
*)__return_address
);
5240 whichfork
= (flags
& XFS_BMAPI_ATTRFORK
) ?
5241 XFS_ATTR_FORK
: XFS_DATA_FORK
;
5242 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
5244 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
&&
5245 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
)) {
5246 XFS_ERROR_REPORT("xfs_bunmapi", XFS_ERRLEVEL_LOW
,
5248 return XFS_ERROR(EFSCORRUPTED
);
5251 if (XFS_FORCED_SHUTDOWN(mp
))
5252 return XFS_ERROR(EIO
);
5253 rsvd
= (flags
& XFS_BMAPI_RSVBLOCKS
) != 0;
5256 ASSERT(ifp
->if_ext_max
==
5257 XFS_IFORK_SIZE(ip
, whichfork
) / (uint
)sizeof(xfs_bmbt_rec_t
));
5258 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
5259 (error
= xfs_iread_extents(tp
, ip
, whichfork
)))
5261 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
5262 if (nextents
== 0) {
5266 XFS_STATS_INC(xs_blk_unmap
);
5267 isrt
= (whichfork
== XFS_DATA_FORK
) &&
5268 (ip
->i_d
.di_flags
& XFS_DIFLAG_REALTIME
);
5270 bno
= start
+ len
- 1;
5271 ep
= xfs_bmap_search_extents(ip
, bno
, whichfork
, &eof
, &lastx
, &got
,
5274 * Check to see if the given block number is past the end of the
5275 * file, back up to the last block if so...
5278 ep
= &ifp
->if_u1
.if_extents
[--lastx
];
5279 xfs_bmbt_get_all(ep
, &got
);
5280 bno
= got
.br_startoff
+ got
.br_blockcount
- 1;
5283 if (ifp
->if_flags
& XFS_IFBROOT
) {
5284 ASSERT(XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_BTREE
);
5285 cur
= xfs_btree_init_cursor(mp
, tp
, NULL
, 0, XFS_BTNUM_BMAP
, ip
,
5287 cur
->bc_private
.b
.firstblock
= *firstblock
;
5288 cur
->bc_private
.b
.flist
= flist
;
5289 cur
->bc_private
.b
.flags
= 0;
5293 while (bno
!= (xfs_fileoff_t
)-1 && bno
>= start
&& lastx
>= 0 &&
5294 (nexts
== 0 || extno
< nexts
)) {
5296 * Is the found extent after a hole in which bno lives?
5297 * Just back up to the previous extent, if so.
5299 if (got
.br_startoff
> bno
) {
5303 xfs_bmbt_get_all(ep
, &got
);
5306 * Is the last block of this extent before the range
5307 * we're supposed to delete? If so, we're done.
5309 bno
= XFS_FILEOFF_MIN(bno
,
5310 got
.br_startoff
+ got
.br_blockcount
- 1);
5314 * Then deal with the (possibly delayed) allocated space
5319 wasdel
= ISNULLSTARTBLOCK(del
.br_startblock
);
5320 if (got
.br_startoff
< start
) {
5321 del
.br_startoff
= start
;
5322 del
.br_blockcount
-= start
- got
.br_startoff
;
5324 del
.br_startblock
+= start
- got
.br_startoff
;
5326 if (del
.br_startoff
+ del
.br_blockcount
> bno
+ 1)
5327 del
.br_blockcount
= bno
+ 1 - del
.br_startoff
;
5328 sum
= del
.br_startblock
+ del
.br_blockcount
;
5330 (mod
= do_mod(sum
, mp
->m_sb
.sb_rextsize
))) {
5332 * Realtime extent not lined up at the end.
5333 * The extent could have been split into written
5334 * and unwritten pieces, or we could just be
5335 * unmapping part of it. But we can't really
5336 * get rid of part of a realtime extent.
5338 if (del
.br_state
== XFS_EXT_UNWRITTEN
||
5339 !XFS_SB_VERSION_HASEXTFLGBIT(&mp
->m_sb
)) {
5341 * This piece is unwritten, or we're not
5342 * using unwritten extents. Skip over it.
5345 bno
-= mod
> del
.br_blockcount
?
5346 del
.br_blockcount
: mod
;
5347 if (bno
< got
.br_startoff
) {
5349 xfs_bmbt_get_all(--ep
, &got
);
5354 * It's written, turn it unwritten.
5355 * This is better than zeroing it.
5357 ASSERT(del
.br_state
== XFS_EXT_NORM
);
5358 ASSERT(xfs_trans_get_block_res(tp
) > 0);
5360 * If this spans a realtime extent boundary,
5361 * chop it back to the start of the one we end at.
5363 if (del
.br_blockcount
> mod
) {
5364 del
.br_startoff
+= del
.br_blockcount
- mod
;
5365 del
.br_startblock
+= del
.br_blockcount
- mod
;
5366 del
.br_blockcount
= mod
;
5368 del
.br_state
= XFS_EXT_UNWRITTEN
;
5369 error
= xfs_bmap_add_extent(ip
, lastx
, &cur
, &del
,
5370 firstblock
, flist
, &logflags
, XFS_DATA_FORK
, 0);
5375 if (isrt
&& (mod
= do_mod(del
.br_startblock
, mp
->m_sb
.sb_rextsize
))) {
5377 * Realtime extent is lined up at the end but not
5378 * at the front. We'll get rid of full extents if
5381 mod
= mp
->m_sb
.sb_rextsize
- mod
;
5382 if (del
.br_blockcount
> mod
) {
5383 del
.br_blockcount
-= mod
;
5384 del
.br_startoff
+= mod
;
5385 del
.br_startblock
+= mod
;
5386 } else if ((del
.br_startoff
== start
&&
5387 (del
.br_state
== XFS_EXT_UNWRITTEN
||
5388 xfs_trans_get_block_res(tp
) == 0)) ||
5389 !XFS_SB_VERSION_HASEXTFLGBIT(&mp
->m_sb
)) {
5391 * Can't make it unwritten. There isn't
5392 * a full extent here so just skip it.
5394 ASSERT(bno
>= del
.br_blockcount
);
5395 bno
-= del
.br_blockcount
;
5396 if (bno
< got
.br_startoff
) {
5398 xfs_bmbt_get_all(--ep
, &got
);
5401 } else if (del
.br_state
== XFS_EXT_UNWRITTEN
) {
5403 * This one is already unwritten.
5404 * It must have a written left neighbor.
5405 * Unwrite the killed part of that one and
5409 xfs_bmbt_get_all(ep
- 1, &prev
);
5410 ASSERT(prev
.br_state
== XFS_EXT_NORM
);
5411 ASSERT(!ISNULLSTARTBLOCK(prev
.br_startblock
));
5412 ASSERT(del
.br_startblock
==
5413 prev
.br_startblock
+ prev
.br_blockcount
);
5414 if (prev
.br_startoff
< start
) {
5415 mod
= start
- prev
.br_startoff
;
5416 prev
.br_blockcount
-= mod
;
5417 prev
.br_startblock
+= mod
;
5418 prev
.br_startoff
= start
;
5420 prev
.br_state
= XFS_EXT_UNWRITTEN
;
5421 error
= xfs_bmap_add_extent(ip
, lastx
- 1, &cur
,
5422 &prev
, firstblock
, flist
, &logflags
,
5428 ASSERT(del
.br_state
== XFS_EXT_NORM
);
5429 del
.br_state
= XFS_EXT_UNWRITTEN
;
5430 error
= xfs_bmap_add_extent(ip
, lastx
, &cur
,
5431 &del
, firstblock
, flist
, &logflags
,
5439 ASSERT(STARTBLOCKVAL(del
.br_startblock
) > 0);
5440 /* Update realtim/data freespace, unreserve quota */
5442 xfs_filblks_t rtexts
;
5444 rtexts
= XFS_FSB_TO_B(mp
, del
.br_blockcount
);
5445 do_div(rtexts
, mp
->m_sb
.sb_rextsize
);
5446 xfs_mod_incore_sb(mp
, XFS_SBS_FREXTENTS
,
5448 XFS_TRANS_RESERVE_QUOTA_NBLKS(mp
, NULL
, ip
,
5449 -((long)del
.br_blockcount
), 0,
5450 XFS_QMOPT_RES_RTBLKS
);
5452 xfs_mod_incore_sb(mp
, XFS_SBS_FDBLOCKS
,
5453 (int)del
.br_blockcount
, rsvd
);
5454 XFS_TRANS_RESERVE_QUOTA_NBLKS(mp
, NULL
, ip
,
5455 -((long)del
.br_blockcount
), 0,
5456 XFS_QMOPT_RES_REGBLKS
);
5458 ip
->i_delayed_blks
-= del
.br_blockcount
;
5460 cur
->bc_private
.b
.flags
|=
5461 XFS_BTCUR_BPRV_WASDEL
;
5463 cur
->bc_private
.b
.flags
&= ~XFS_BTCUR_BPRV_WASDEL
;
5465 * If it's the case where the directory code is running
5466 * with no block reservation, and the deleted block is in
5467 * the middle of its extent, and the resulting insert
5468 * of an extent would cause transformation to btree format,
5469 * then reject it. The calling code will then swap
5470 * blocks around instead.
5471 * We have to do this now, rather than waiting for the
5472 * conversion to btree format, since the transaction
5475 if (!wasdel
&& xfs_trans_get_block_res(tp
) == 0 &&
5476 XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_EXTENTS
&&
5477 XFS_IFORK_NEXTENTS(ip
, whichfork
) >= ifp
->if_ext_max
&&
5478 del
.br_startoff
> got
.br_startoff
&&
5479 del
.br_startoff
+ del
.br_blockcount
<
5480 got
.br_startoff
+ got
.br_blockcount
) {
5481 error
= XFS_ERROR(ENOSPC
);
5484 error
= xfs_bmap_del_extent(ip
, tp
, lastx
, flist
, cur
, &del
,
5485 &tmp_logflags
, whichfork
, rsvd
);
5486 logflags
|= tmp_logflags
;
5489 bno
= del
.br_startoff
- 1;
5491 lastx
= ifp
->if_lastex
;
5493 * If not done go on to the next (previous) record.
5494 * Reset ep in case the extents array was re-alloced.
5496 ep
= &ifp
->if_u1
.if_extents
[lastx
];
5497 if (bno
!= (xfs_fileoff_t
)-1 && bno
>= start
) {
5498 if (lastx
>= XFS_IFORK_NEXTENTS(ip
, whichfork
) ||
5499 xfs_bmbt_get_startoff(ep
) > bno
) {
5504 xfs_bmbt_get_all(ep
, &got
);
5508 ifp
->if_lastex
= lastx
;
5509 *done
= bno
== (xfs_fileoff_t
)-1 || bno
< start
|| lastx
< 0;
5510 ASSERT(ifp
->if_ext_max
==
5511 XFS_IFORK_SIZE(ip
, whichfork
) / (uint
)sizeof(xfs_bmbt_rec_t
));
5513 * Convert to a btree if necessary.
5515 if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_EXTENTS
&&
5516 XFS_IFORK_NEXTENTS(ip
, whichfork
) > ifp
->if_ext_max
) {
5517 ASSERT(cur
== NULL
);
5518 error
= xfs_bmap_extents_to_btree(tp
, ip
, firstblock
, flist
,
5519 &cur
, 0, &tmp_logflags
, whichfork
);
5520 logflags
|= tmp_logflags
;
5525 * transform from btree to extents, give it cur
5527 else if (XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_BTREE
&&
5528 XFS_IFORK_NEXTENTS(ip
, whichfork
) <= ifp
->if_ext_max
) {
5529 ASSERT(cur
!= NULL
);
5530 error
= xfs_bmap_btree_to_extents(tp
, ip
, cur
, &tmp_logflags
,
5532 logflags
|= tmp_logflags
;
5537 * transform from extents to local?
5539 ASSERT(ifp
->if_ext_max
==
5540 XFS_IFORK_SIZE(ip
, whichfork
) / (uint
)sizeof(xfs_bmbt_rec_t
));
5544 * Log everything. Do this after conversion, there's no point in
5545 * logging the extent list if we've converted to btree format.
5547 if ((logflags
& XFS_ILOG_FEXT(whichfork
)) &&
5548 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_EXTENTS
)
5549 logflags
&= ~XFS_ILOG_FEXT(whichfork
);
5550 else if ((logflags
& XFS_ILOG_FBROOT(whichfork
)) &&
5551 XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
)
5552 logflags
&= ~XFS_ILOG_FBROOT(whichfork
);
5554 * Log inode even in the error case, if the transaction
5555 * is dirty we'll need to shut down the filesystem.
5558 xfs_trans_log_inode(tp
, ip
, logflags
);
5561 *firstblock
= cur
->bc_private
.b
.firstblock
;
5562 cur
->bc_private
.b
.allocated
= 0;
5564 xfs_btree_del_cursor(cur
,
5565 error
? XFS_BTREE_ERROR
: XFS_BTREE_NOERROR
);
5571 * Fcntl interface to xfs_bmapi.
5573 int /* error code */
5575 bhv_desc_t
*bdp
, /* XFS behavior descriptor*/
5576 struct getbmap
*bmv
, /* user bmap structure */
5577 void __user
*ap
, /* pointer to user's array */
5578 int interface
) /* interface flags */
5580 __int64_t bmvend
; /* last block requested */
5581 int error
; /* return value */
5582 __int64_t fixlen
; /* length for -1 case */
5583 int i
; /* extent number */
5584 xfs_inode_t
*ip
; /* xfs incore inode pointer */
5585 vnode_t
*vp
; /* corresponding vnode */
5586 int lock
; /* lock state */
5587 xfs_bmbt_irec_t
*map
; /* buffer for user's data */
5588 xfs_mount_t
*mp
; /* file system mount point */
5589 int nex
; /* # of user extents can do */
5590 int nexleft
; /* # of user extents left */
5591 int subnex
; /* # of bmapi's can do */
5592 int nmap
; /* number of map entries */
5593 struct getbmap out
; /* output structure */
5594 int whichfork
; /* data or attr fork */
5595 int prealloced
; /* this is a file with
5596 * preallocated data space */
5597 int sh_unwritten
; /* true, if unwritten */
5598 /* extents listed separately */
5599 int bmapi_flags
; /* flags for xfs_bmapi */
5600 __int32_t oflags
; /* getbmapx bmv_oflags field */
5602 vp
= BHV_TO_VNODE(bdp
);
5603 ip
= XFS_BHVTOI(bdp
);
5606 whichfork
= interface
& BMV_IF_ATTRFORK
? XFS_ATTR_FORK
: XFS_DATA_FORK
;
5607 sh_unwritten
= (interface
& BMV_IF_PREALLOC
) != 0;
5609 /* If the BMV_IF_NO_DMAPI_READ interface bit specified, do not
5610 * generate a DMAPI read event. Otherwise, if the DM_EVENT_READ
5611 * bit is set for the file, generate a read event in order
5612 * that the DMAPI application may do its thing before we return
5613 * the extents. Usually this means restoring user file data to
5614 * regions of the file that look like holes.
5616 * The "old behavior" (from XFS_IOC_GETBMAP) is to not specify
5617 * BMV_IF_NO_DMAPI_READ so that read events are generated.
5618 * If this were not true, callers of ioctl( XFS_IOC_GETBMAP )
5619 * could misinterpret holes in a DMAPI file as true holes,
5620 * when in fact they may represent offline user data.
5622 if ( (interface
& BMV_IF_NO_DMAPI_READ
) == 0
5623 && DM_EVENT_ENABLED(vp
->v_vfsp
, ip
, DM_EVENT_READ
)
5624 && whichfork
== XFS_DATA_FORK
) {
5626 error
= XFS_SEND_DATA(mp
, DM_EVENT_READ
, vp
, 0, 0, 0, NULL
);
5628 return XFS_ERROR(error
);
5631 if (whichfork
== XFS_ATTR_FORK
) {
5632 if (XFS_IFORK_Q(ip
)) {
5633 if (ip
->i_d
.di_aformat
!= XFS_DINODE_FMT_EXTENTS
&&
5634 ip
->i_d
.di_aformat
!= XFS_DINODE_FMT_BTREE
&&
5635 ip
->i_d
.di_aformat
!= XFS_DINODE_FMT_LOCAL
)
5636 return XFS_ERROR(EINVAL
);
5637 } else if (unlikely(
5638 ip
->i_d
.di_aformat
!= 0 &&
5639 ip
->i_d
.di_aformat
!= XFS_DINODE_FMT_EXTENTS
)) {
5640 XFS_ERROR_REPORT("xfs_getbmap", XFS_ERRLEVEL_LOW
,
5642 return XFS_ERROR(EFSCORRUPTED
);
5644 } else if (ip
->i_d
.di_format
!= XFS_DINODE_FMT_EXTENTS
&&
5645 ip
->i_d
.di_format
!= XFS_DINODE_FMT_BTREE
&&
5646 ip
->i_d
.di_format
!= XFS_DINODE_FMT_LOCAL
)
5647 return XFS_ERROR(EINVAL
);
5648 if (whichfork
== XFS_DATA_FORK
) {
5649 if (ip
->i_d
.di_flags
& XFS_DIFLAG_PREALLOC
) {
5651 fixlen
= XFS_MAXIOFFSET(mp
);
5654 fixlen
= ip
->i_d
.di_size
;
5661 if (bmv
->bmv_length
== -1) {
5662 fixlen
= XFS_FSB_TO_BB(mp
, XFS_B_TO_FSB(mp
, fixlen
));
5663 bmv
->bmv_length
= MAX( (__int64_t
)(fixlen
- bmv
->bmv_offset
),
5665 } else if (bmv
->bmv_length
< 0)
5666 return XFS_ERROR(EINVAL
);
5667 if (bmv
->bmv_length
== 0) {
5668 bmv
->bmv_entries
= 0;
5671 nex
= bmv
->bmv_count
- 1;
5673 return XFS_ERROR(EINVAL
);
5674 bmvend
= bmv
->bmv_offset
+ bmv
->bmv_length
;
5676 xfs_ilock(ip
, XFS_IOLOCK_SHARED
);
5678 if (whichfork
== XFS_DATA_FORK
&& ip
->i_delayed_blks
) {
5679 /* xfs_fsize_t last_byte = xfs_file_last_byte(ip); */
5680 VOP_FLUSH_PAGES(vp
, (xfs_off_t
)0, -1, 0, FI_REMAPF
, error
);
5683 ASSERT(whichfork
== XFS_ATTR_FORK
|| ip
->i_delayed_blks
== 0);
5685 lock
= xfs_ilock_map_shared(ip
);
5688 * Don't let nex be bigger than the number of extents
5689 * we can have assuming alternating holes and real extents.
5691 if (nex
> XFS_IFORK_NEXTENTS(ip
, whichfork
) * 2 + 1)
5692 nex
= XFS_IFORK_NEXTENTS(ip
, whichfork
) * 2 + 1;
5694 bmapi_flags
= XFS_BMAPI_AFLAG(whichfork
) |
5695 ((sh_unwritten
) ? 0 : XFS_BMAPI_IGSTATE
);
5698 * Allocate enough space to handle "subnex" maps at a time.
5701 map
= kmem_alloc(subnex
* sizeof(*map
), KM_SLEEP
);
5703 bmv
->bmv_entries
= 0;
5705 if (XFS_IFORK_NEXTENTS(ip
, whichfork
) == 0) {
5707 goto unlock_and_return
;
5713 nmap
= (nexleft
> subnex
) ? subnex
: nexleft
;
5714 error
= xfs_bmapi(NULL
, ip
, XFS_BB_TO_FSBT(mp
, bmv
->bmv_offset
),
5715 XFS_BB_TO_FSB(mp
, bmv
->bmv_length
),
5716 bmapi_flags
, NULL
, 0, map
, &nmap
, NULL
);
5718 goto unlock_and_return
;
5719 ASSERT(nmap
<= subnex
);
5721 for (i
= 0; i
< nmap
&& nexleft
&& bmv
->bmv_length
; i
++) {
5723 oflags
= (map
[i
].br_state
== XFS_EXT_UNWRITTEN
) ?
5724 BMV_OF_PREALLOC
: 0;
5725 out
.bmv_offset
= XFS_FSB_TO_BB(mp
, map
[i
].br_startoff
);
5726 out
.bmv_length
= XFS_FSB_TO_BB(mp
, map
[i
].br_blockcount
);
5727 ASSERT(map
[i
].br_startblock
!= DELAYSTARTBLOCK
);
5728 if (map
[i
].br_startblock
== HOLESTARTBLOCK
&&
5729 ((prealloced
&& out
.bmv_offset
+ out
.bmv_length
== bmvend
) ||
5730 whichfork
== XFS_ATTR_FORK
)) {
5732 * came to hole at end of file or the end of
5735 goto unlock_and_return
;
5738 (map
[i
].br_startblock
== HOLESTARTBLOCK
) ?
5740 XFS_FSB_TO_DB(ip
, map
[i
].br_startblock
);
5742 /* return either getbmap/getbmapx structure. */
5743 if (interface
& BMV_IF_EXTENDED
) {
5744 struct getbmapx outx
;
5746 GETBMAP_CONVERT(out
,outx
);
5747 outx
.bmv_oflags
= oflags
;
5748 outx
.bmv_unused1
= outx
.bmv_unused2
= 0;
5749 if (copy_to_user(ap
, &outx
,
5751 error
= XFS_ERROR(EFAULT
);
5752 goto unlock_and_return
;
5755 if (copy_to_user(ap
, &out
,
5757 error
= XFS_ERROR(EFAULT
);
5758 goto unlock_and_return
;
5762 out
.bmv_offset
+ out
.bmv_length
;
5763 bmv
->bmv_length
= MAX((__int64_t
)0,
5764 (__int64_t
)(bmvend
- bmv
->bmv_offset
));
5766 ap
= (interface
& BMV_IF_EXTENDED
) ?
5768 ((struct getbmapx __user
*)ap
+ 1) :
5770 ((struct getbmap __user
*)ap
+ 1);
5773 } while (nmap
&& nexleft
&& bmv
->bmv_length
);
5776 xfs_iunlock_map_shared(ip
, lock
);
5777 xfs_iunlock(ip
, XFS_IOLOCK_SHARED
);
5779 kmem_free(map
, subnex
* sizeof(*map
));
5785 * Check the last inode extent to determine whether this allocation will result
5786 * in blocks being allocated at the end of the file. When we allocate new data
5787 * blocks at the end of the file which do not start at the previous data block,
5788 * we will try to align the new blocks at stripe unit boundaries.
5790 STATIC
int /* error */
5792 xfs_inode_t
*ip
, /* incore inode pointer */
5793 xfs_fileoff_t off
, /* file offset in fsblocks */
5794 int whichfork
, /* data or attribute fork */
5795 char *aeof
) /* return value */
5797 int error
; /* error return value */
5798 xfs_ifork_t
*ifp
; /* inode fork pointer */
5799 xfs_bmbt_rec_t
*lastrec
; /* extent list entry pointer */
5800 xfs_extnum_t nextents
; /* size of extent list */
5801 xfs_bmbt_irec_t s
; /* expanded extent list entry */
5803 ASSERT(whichfork
== XFS_DATA_FORK
);
5804 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
5805 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
5806 (error
= xfs_iread_extents(NULL
, ip
, whichfork
)))
5808 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
5809 if (nextents
== 0) {
5814 * Go to the last extent
5816 lastrec
= &ifp
->if_u1
.if_extents
[nextents
- 1];
5817 xfs_bmbt_get_all(lastrec
, &s
);
5819 * Check we are allocating in the last extent (for delayed allocations)
5820 * or past the last extent for non-delayed allocations.
5822 *aeof
= (off
>= s
.br_startoff
&&
5823 off
< s
.br_startoff
+ s
.br_blockcount
&&
5824 ISNULLSTARTBLOCK(s
.br_startblock
)) ||
5825 off
>= s
.br_startoff
+ s
.br_blockcount
;
5830 * Check if the endoff is outside the last extent. If so the caller will grow
5831 * the allocation to a stripe unit boundary.
5835 xfs_inode_t
*ip
, /* incore inode pointer */
5836 xfs_fileoff_t endoff
, /* file offset in fsblocks */
5837 int whichfork
, /* data or attribute fork */
5838 int *eof
) /* result value */
5840 xfs_fsblock_t blockcount
; /* extent block count */
5841 int error
; /* error return value */
5842 xfs_ifork_t
*ifp
; /* inode fork pointer */
5843 xfs_bmbt_rec_t
*lastrec
; /* extent list entry pointer */
5844 xfs_extnum_t nextents
; /* size of extent list */
5845 xfs_fileoff_t startoff
; /* extent starting file offset */
5847 ASSERT(whichfork
== XFS_DATA_FORK
);
5848 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
5849 if (!(ifp
->if_flags
& XFS_IFEXTENTS
) &&
5850 (error
= xfs_iread_extents(NULL
, ip
, whichfork
)))
5852 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
5853 if (nextents
== 0) {
5858 * Go to the last extent
5860 lastrec
= &ifp
->if_u1
.if_extents
[nextents
- 1];
5861 startoff
= xfs_bmbt_get_startoff(lastrec
);
5862 blockcount
= xfs_bmbt_get_blockcount(lastrec
);
5863 *eof
= endoff
>= startoff
+ blockcount
;
5869 * Check that the extents list for the inode ip is in the right order.
5872 xfs_bmap_check_extents(
5873 xfs_inode_t
*ip
, /* incore inode pointer */
5874 int whichfork
) /* data or attr fork */
5876 xfs_bmbt_rec_t
*base
; /* base of extents list */
5877 xfs_bmbt_rec_t
*ep
; /* current extent entry */
5878 xfs_ifork_t
*ifp
; /* inode fork pointer */
5879 xfs_extnum_t nextents
; /* number of extents in list */
5881 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
5882 ASSERT(ifp
->if_flags
& XFS_IFEXTENTS
);
5883 base
= ifp
->if_u1
.if_extents
;
5884 nextents
= ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
);
5885 for (ep
= base
; ep
< &base
[nextents
- 1]; ep
++) {
5886 xfs_btree_check_rec(XFS_BTNUM_BMAP
, (void *)ep
,
5894 xfs_btree_cur_t
*cur
,
5904 for(i
= 0; i
< XFS_BTREE_MAXLEVELS
; i
++) {
5905 bp
= cur
->bc_bufs
[i
];
5907 if (XFS_BUF_ADDR(bp
) == bno
)
5908 break; /* Found it */
5910 if (i
== XFS_BTREE_MAXLEVELS
)
5913 if (!bp
) { /* Chase down all the log items to see if the bp is there */
5914 xfs_log_item_chunk_t
*licp
;
5918 licp
= &tp
->t_items
;
5919 while (!bp
&& licp
!= NULL
) {
5920 if (XFS_LIC_ARE_ALL_FREE(licp
)) {
5921 licp
= licp
->lic_next
;
5924 for (i
= 0; i
< licp
->lic_unused
; i
++) {
5925 xfs_log_item_desc_t
*lidp
;
5926 xfs_log_item_t
*lip
;
5927 xfs_buf_log_item_t
*bip
;
5930 if (XFS_LIC_ISFREE(licp
, i
)) {
5934 lidp
= XFS_LIC_SLOT(licp
, i
);
5935 lip
= lidp
->lid_item
;
5936 if (lip
->li_type
!= XFS_LI_BUF
)
5939 bip
= (xfs_buf_log_item_t
*)lip
;
5942 if (XFS_BUF_ADDR(lbp
) == bno
) {
5944 break; /* Found it */
5947 licp
= licp
->lic_next
;
5955 xfs_bmbt_block_t
*block
,
5961 xfs_bmbt_ptr_t
*pp
, *thispa
; /* pointer to block address */
5962 xfs_bmbt_key_t
*prevp
, *keyp
;
5964 ASSERT(INT_GET(block
->bb_level
, ARCH_CONVERT
) > 0);
5967 for( i
= 1; i
<= INT_GET(block
->bb_numrecs
, ARCH_CONVERT
);i
++) {
5968 dmxr
= mp
->m_bmap_dmxr
[0];
5971 keyp
= XFS_BMAP_BROOT_KEY_ADDR(block
, i
, sz
);
5973 keyp
= XFS_BTREE_KEY_ADDR(mp
->m_sb
.sb_blocksize
,
5974 xfs_bmbt
, block
, i
, dmxr
);
5978 xfs_btree_check_key(XFS_BTNUM_BMAP
, prevp
, keyp
);
5983 * Compare the block numbers to see if there are dups.
5987 pp
= XFS_BMAP_BROOT_PTR_ADDR(block
, i
, sz
);
5989 pp
= XFS_BTREE_PTR_ADDR(mp
->m_sb
.sb_blocksize
,
5990 xfs_bmbt
, block
, i
, dmxr
);
5992 for (j
= i
+1; j
<= INT_GET(block
->bb_numrecs
, ARCH_CONVERT
); j
++) {
5994 thispa
= XFS_BMAP_BROOT_PTR_ADDR(block
, j
, sz
);
5996 thispa
= XFS_BTREE_PTR_ADDR(mp
->m_sb
.sb_blocksize
,
5997 xfs_bmbt
, block
, j
, dmxr
);
5999 if (INT_GET(*thispa
, ARCH_CONVERT
) ==
6000 INT_GET(*pp
, ARCH_CONVERT
)) {
6001 cmn_err(CE_WARN
, "%s: thispa(%d) == pp(%d) %Ld",
6003 INT_GET(*thispa
, ARCH_CONVERT
));
6004 panic("%s: ptrs are equal in node\n",
6012 * Check that the extents for the inode ip are in the right order in all
6017 xfs_bmap_check_leaf_extents(
6018 xfs_btree_cur_t
*cur
, /* btree cursor or null */
6019 xfs_inode_t
*ip
, /* incore inode pointer */
6020 int whichfork
) /* data or attr fork */
6022 xfs_bmbt_block_t
*block
; /* current btree block */
6023 xfs_fsblock_t bno
; /* block # of "block" */
6024 xfs_buf_t
*bp
; /* buffer for "block" */
6025 int error
; /* error return value */
6026 xfs_extnum_t i
=0; /* index into the extents list */
6027 xfs_ifork_t
*ifp
; /* fork structure */
6028 int level
; /* btree level, for checking */
6029 xfs_mount_t
*mp
; /* file system mount structure */
6030 xfs_bmbt_ptr_t
*pp
; /* pointer to block address */
6031 xfs_bmbt_rec_t
*ep
, *lastp
; /* extent pointers in block entry */
6034 if (XFS_IFORK_FORMAT(ip
, whichfork
) != XFS_DINODE_FMT_BTREE
) {
6040 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
6041 block
= ifp
->if_broot
;
6043 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
6045 ASSERT(INT_GET(block
->bb_level
, ARCH_CONVERT
) > 0);
6046 level
= INT_GET(block
->bb_level
, ARCH_CONVERT
);
6047 xfs_check_block(block
, mp
, 1, ifp
->if_broot_bytes
);
6048 pp
= XFS_BMAP_BROOT_PTR_ADDR(block
, 1, ifp
->if_broot_bytes
);
6049 ASSERT(INT_GET(*pp
, ARCH_CONVERT
) != NULLDFSBNO
);
6050 ASSERT(XFS_FSB_TO_AGNO(mp
, INT_GET(*pp
, ARCH_CONVERT
)) < mp
->m_sb
.sb_agcount
);
6051 ASSERT(XFS_FSB_TO_AGBNO(mp
, INT_GET(*pp
, ARCH_CONVERT
)) < mp
->m_sb
.sb_agblocks
);
6052 bno
= INT_GET(*pp
, ARCH_CONVERT
);
6054 * Go down the tree until leaf level is reached, following the first
6055 * pointer (leftmost) at each level.
6057 while (level
-- > 0) {
6058 /* See if buf is in cur first */
6059 bp
= xfs_bmap_get_bp(cur
, XFS_FSB_TO_DADDR(mp
, bno
));
6065 if (!bp
&& (error
= xfs_btree_read_bufl(mp
, NULL
, bno
, 0, &bp
,
6066 XFS_BMAP_BTREE_REF
)))
6068 block
= XFS_BUF_TO_BMBT_BLOCK(bp
);
6069 XFS_WANT_CORRUPTED_GOTO(
6070 XFS_BMAP_SANITY_CHECK(mp
, block
, level
),
6076 * Check this block for basic sanity (increasing keys and
6077 * no duplicate blocks).
6080 xfs_check_block(block
, mp
, 0, 0);
6081 pp
= XFS_BTREE_PTR_ADDR(mp
->m_sb
.sb_blocksize
, xfs_bmbt
, block
,
6082 1, mp
->m_bmap_dmxr
[1]);
6083 XFS_WANT_CORRUPTED_GOTO(XFS_FSB_SANITY_CHECK(mp
, INT_GET(*pp
, ARCH_CONVERT
)), error0
);
6084 bno
= INT_GET(*pp
, ARCH_CONVERT
);
6087 xfs_trans_brelse(NULL
, bp
);
6092 * Here with bp and block set to the leftmost leaf node in the tree.
6097 * Loop over all leaf nodes checking that all extents are in the right order.
6101 xfs_bmbt_rec_t
*frp
;
6102 xfs_fsblock_t nextbno
;
6103 xfs_extnum_t num_recs
;
6106 num_recs
= INT_GET(block
->bb_numrecs
, ARCH_CONVERT
);
6109 * Read-ahead the next leaf block, if any.
6112 nextbno
= INT_GET(block
->bb_rightsib
, ARCH_CONVERT
);
6115 * Check all the extents to make sure they are OK.
6116 * If we had a previous block, the last entry should
6117 * conform with the first entry in this one.
6120 frp
= XFS_BTREE_REC_ADDR(mp
->m_sb
.sb_blocksize
, xfs_bmbt
,
6121 block
, 1, mp
->m_bmap_dmxr
[0]);
6123 for (ep
= frp
;ep
< frp
+ (num_recs
- 1); ep
++) {
6125 xfs_btree_check_rec(XFS_BTNUM_BMAP
,
6126 (void *)lastp
, (void *)ep
);
6128 xfs_btree_check_rec(XFS_BTNUM_BMAP
, (void *)ep
,
6131 lastp
= frp
+ num_recs
- 1; /* For the next iteration */
6136 xfs_trans_brelse(NULL
, bp
);
6140 * If we've reached the end, stop.
6142 if (bno
== NULLFSBLOCK
)
6145 bp
= xfs_bmap_get_bp(cur
, XFS_FSB_TO_DADDR(mp
, bno
));
6151 if (!bp
&& (error
= xfs_btree_read_bufl(mp
, NULL
, bno
, 0, &bp
,
6152 XFS_BMAP_BTREE_REF
)))
6154 block
= XFS_BUF_TO_BMBT_BLOCK(bp
);
6158 xfs_trans_brelse(NULL
, bp
);
6163 cmn_err(CE_WARN
, "%s: at error0", __FUNCTION__
);
6165 xfs_trans_brelse(NULL
, bp
);
6167 cmn_err(CE_WARN
, "%s: BAD after btree leaves for %d extents",
6169 panic("%s: CORRUPTED BTREE OR SOMETHING", __FUNCTION__
);
6175 * Count fsblocks of the given fork.
6178 xfs_bmap_count_blocks(
6179 xfs_trans_t
*tp
, /* transaction pointer */
6180 xfs_inode_t
*ip
, /* incore inode */
6181 int whichfork
, /* data or attr fork */
6182 int *count
) /* out: count of blocks */
6184 xfs_bmbt_block_t
*block
; /* current btree block */
6185 xfs_fsblock_t bno
; /* block # of "block" */
6186 xfs_ifork_t
*ifp
; /* fork structure */
6187 int level
; /* btree level, for checking */
6188 xfs_mount_t
*mp
; /* file system mount structure */
6189 xfs_bmbt_ptr_t
*pp
; /* pointer to block address */
6193 ifp
= XFS_IFORK_PTR(ip
, whichfork
);
6194 if ( XFS_IFORK_FORMAT(ip
, whichfork
) == XFS_DINODE_FMT_EXTENTS
) {
6195 if (unlikely(xfs_bmap_count_leaves(ifp
->if_u1
.if_extents
,
6196 ifp
->if_bytes
/ (uint
)sizeof(xfs_bmbt_rec_t
),
6198 XFS_ERROR_REPORT("xfs_bmap_count_blocks(1)",
6199 XFS_ERRLEVEL_LOW
, mp
);
6200 return XFS_ERROR(EFSCORRUPTED
);
6206 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out.
6208 block
= ifp
->if_broot
;
6209 ASSERT(INT_GET(block
->bb_level
, ARCH_CONVERT
) > 0);
6210 level
= INT_GET(block
->bb_level
, ARCH_CONVERT
);
6211 pp
= XFS_BMAP_BROOT_PTR_ADDR(block
, 1, ifp
->if_broot_bytes
);
6212 ASSERT(INT_GET(*pp
, ARCH_CONVERT
) != NULLDFSBNO
);
6213 ASSERT(XFS_FSB_TO_AGNO(mp
, INT_GET(*pp
, ARCH_CONVERT
)) < mp
->m_sb
.sb_agcount
);
6214 ASSERT(XFS_FSB_TO_AGBNO(mp
, INT_GET(*pp
, ARCH_CONVERT
)) < mp
->m_sb
.sb_agblocks
);
6215 bno
= INT_GET(*pp
, ARCH_CONVERT
);
6217 if (unlikely(xfs_bmap_count_tree(mp
, tp
, bno
, level
, count
) < 0)) {
6218 XFS_ERROR_REPORT("xfs_bmap_count_blocks(2)", XFS_ERRLEVEL_LOW
,
6220 return XFS_ERROR(EFSCORRUPTED
);
6227 * Recursively walks each level of a btree
6228 * to count total fsblocks is use.
6231 xfs_bmap_count_tree(
6232 xfs_mount_t
*mp
, /* file system mount point */
6233 xfs_trans_t
*tp
, /* transaction pointer */
6234 xfs_fsblock_t blockno
, /* file system block number */
6235 int levelin
, /* level in btree */
6236 int *count
) /* Count of blocks */
6239 xfs_buf_t
*bp
, *nbp
;
6240 int level
= levelin
;
6242 xfs_fsblock_t bno
= blockno
;
6243 xfs_fsblock_t nextbno
;
6244 xfs_bmbt_block_t
*block
, *nextblock
;
6246 xfs_bmbt_rec_t
*frp
;
6248 if ((error
= xfs_btree_read_bufl(mp
, tp
, bno
, 0, &bp
, XFS_BMAP_BTREE_REF
)))
6251 block
= XFS_BUF_TO_BMBT_BLOCK(bp
);
6254 /* Not at node above leafs, count this level of nodes */
6255 nextbno
= INT_GET(block
->bb_rightsib
, ARCH_CONVERT
);
6256 while (nextbno
!= NULLFSBLOCK
) {
6257 if ((error
= xfs_btree_read_bufl(mp
, tp
, nextbno
,
6258 0, &nbp
, XFS_BMAP_BTREE_REF
)))
6261 nextblock
= XFS_BUF_TO_BMBT_BLOCK(nbp
);
6262 nextbno
= INT_GET(nextblock
->bb_rightsib
, ARCH_CONVERT
);
6263 xfs_trans_brelse(tp
, nbp
);
6266 /* Dive to the next level */
6267 pp
= XFS_BTREE_PTR_ADDR(mp
->m_sb
.sb_blocksize
,
6268 xfs_bmbt
, block
, 1, mp
->m_bmap_dmxr
[1]);
6269 bno
= INT_GET(*pp
, ARCH_CONVERT
);
6270 if (unlikely((error
=
6271 xfs_bmap_count_tree(mp
, tp
, bno
, level
, count
)) < 0)) {
6272 xfs_trans_brelse(tp
, bp
);
6273 XFS_ERROR_REPORT("xfs_bmap_count_tree(1)",
6274 XFS_ERRLEVEL_LOW
, mp
);
6275 return XFS_ERROR(EFSCORRUPTED
);
6277 xfs_trans_brelse(tp
, bp
);
6279 /* count all level 1 nodes and their leaves */
6281 nextbno
= INT_GET(block
->bb_rightsib
, ARCH_CONVERT
);
6282 numrecs
= INT_GET(block
->bb_numrecs
, ARCH_CONVERT
);
6283 frp
= XFS_BTREE_REC_ADDR(mp
->m_sb
.sb_blocksize
,
6284 xfs_bmbt
, block
, 1, mp
->m_bmap_dmxr
[0]);
6285 if (unlikely(xfs_bmap_count_leaves(frp
, numrecs
, count
) < 0)) {
6286 xfs_trans_brelse(tp
, bp
);
6287 XFS_ERROR_REPORT("xfs_bmap_count_tree(2)",
6288 XFS_ERRLEVEL_LOW
, mp
);
6289 return XFS_ERROR(EFSCORRUPTED
);
6291 xfs_trans_brelse(tp
, bp
);
6292 if (nextbno
== NULLFSBLOCK
)
6295 if ((error
= xfs_btree_read_bufl(mp
, tp
, bno
, 0, &bp
,
6296 XFS_BMAP_BTREE_REF
)))
6299 block
= XFS_BUF_TO_BMBT_BLOCK(bp
);
6306 * Count leaf blocks given a pointer to an extent list.
6309 xfs_bmap_count_leaves(
6310 xfs_bmbt_rec_t
*frp
,
6316 for ( b
= 1; b
<= numrecs
; b
++, frp
++)
6317 *count
+= xfs_bmbt_disk_get_blockcount(frp
);