2 * Copyright (c) 2000-2002,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"
28 #include "xfs_dmapi.h"
29 #include "xfs_mount.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dir2_sf.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_btree.h"
38 #include "xfs_ialloc.h"
39 #include "xfs_alloc.h"
40 #include "xfs_rtalloc.h"
41 #include "xfs_error.h"
46 * Allocation group level functions.
49 xfs_ialloc_cluster_alignment(
50 xfs_alloc_arg_t
*args
)
52 if (xfs_sb_version_hasalign(&args
->mp
->m_sb
) &&
53 args
->mp
->m_sb
.sb_inoalignmt
>=
54 XFS_B_TO_FSBT(args
->mp
, XFS_INODE_CLUSTER_SIZE(args
->mp
)))
55 return args
->mp
->m_sb
.sb_inoalignmt
;
60 * Lookup a record by ino in the btree given by cur.
64 struct xfs_btree_cur
*cur
, /* btree cursor */
65 xfs_agino_t ino
, /* starting inode of chunk */
66 xfs_lookup_t dir
, /* <=, >=, == */
67 int *stat
) /* success/failure */
69 cur
->bc_rec
.i
.ir_startino
= ino
;
70 cur
->bc_rec
.i
.ir_freecount
= 0;
71 cur
->bc_rec
.i
.ir_free
= 0;
72 return xfs_btree_lookup(cur
, dir
, stat
);
76 * Update the record referred to by cur to the value given.
77 * This either works (return 0) or gets an EFSCORRUPTED error.
79 STATIC
int /* error */
81 struct xfs_btree_cur
*cur
, /* btree cursor */
82 xfs_inobt_rec_incore_t
*irec
) /* btree record */
84 union xfs_btree_rec rec
;
86 rec
.inobt
.ir_startino
= cpu_to_be32(irec
->ir_startino
);
87 rec
.inobt
.ir_freecount
= cpu_to_be32(irec
->ir_freecount
);
88 rec
.inobt
.ir_free
= cpu_to_be64(irec
->ir_free
);
89 return xfs_btree_update(cur
, &rec
);
93 * Get the data from the pointed-to record.
97 struct xfs_btree_cur
*cur
, /* btree cursor */
98 xfs_inobt_rec_incore_t
*irec
, /* btree record */
99 int *stat
) /* output: success/failure */
101 union xfs_btree_rec
*rec
;
104 error
= xfs_btree_get_rec(cur
, &rec
, stat
);
105 if (!error
&& *stat
== 1) {
106 irec
->ir_startino
= be32_to_cpu(rec
->inobt
.ir_startino
);
107 irec
->ir_freecount
= be32_to_cpu(rec
->inobt
.ir_freecount
);
108 irec
->ir_free
= be64_to_cpu(rec
->inobt
.ir_free
);
114 * Verify that the number of free inodes in the AGI is correct.
118 xfs_check_agi_freecount(
119 struct xfs_btree_cur
*cur
,
122 if (cur
->bc_nlevels
== 1) {
123 xfs_inobt_rec_incore_t rec
;
128 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &i
);
133 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
138 freecount
+= rec
.ir_freecount
;
139 error
= xfs_btree_increment(cur
, 0, &i
);
145 if (!XFS_FORCED_SHUTDOWN(cur
->bc_mp
))
146 ASSERT(freecount
== be32_to_cpu(agi
->agi_freecount
));
151 #define xfs_check_agi_freecount(cur, agi) 0
155 * Initialise a new set of inodes.
158 xfs_ialloc_inode_init(
159 struct xfs_mount
*mp
,
160 struct xfs_trans
*tp
,
163 xfs_agblock_t length
,
166 struct xfs_buf
*fbuf
;
167 struct xfs_dinode
*free
;
168 int blks_per_cluster
, nbufs
, ninodes
;
174 * Loop over the new block(s), filling in the inodes.
175 * For small block sizes, manipulate the inodes in buffers
176 * which are multiples of the blocks size.
178 if (mp
->m_sb
.sb_blocksize
>= XFS_INODE_CLUSTER_SIZE(mp
)) {
179 blks_per_cluster
= 1;
181 ninodes
= mp
->m_sb
.sb_inopblock
;
183 blks_per_cluster
= XFS_INODE_CLUSTER_SIZE(mp
) /
184 mp
->m_sb
.sb_blocksize
;
185 nbufs
= length
/ blks_per_cluster
;
186 ninodes
= blks_per_cluster
* mp
->m_sb
.sb_inopblock
;
190 * Figure out what version number to use in the inodes we create.
191 * If the superblock version has caught up to the one that supports
192 * the new inode format, then use the new inode version. Otherwise
193 * use the old version so that old kernels will continue to be
194 * able to use the file system.
196 if (xfs_sb_version_hasnlink(&mp
->m_sb
))
201 for (j
= 0; j
< nbufs
; j
++) {
205 d
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
+ (j
* blks_per_cluster
));
206 fbuf
= xfs_trans_get_buf(tp
, mp
->m_ddev_targp
, d
,
207 mp
->m_bsize
* blks_per_cluster
,
210 ASSERT(!XFS_BUF_GETERROR(fbuf
));
213 * Initialize all inodes in this buffer and then log them.
215 * XXX: It would be much better if we had just one transaction
216 * to log a whole cluster of inodes instead of all the
217 * individual transactions causing a lot of log traffic.
219 xfs_biozero(fbuf
, 0, ninodes
<< mp
->m_sb
.sb_inodelog
);
220 for (i
= 0; i
< ninodes
; i
++) {
221 int ioffset
= i
<< mp
->m_sb
.sb_inodelog
;
222 uint isize
= sizeof(struct xfs_dinode
);
224 free
= xfs_make_iptr(mp
, fbuf
, i
);
225 free
->di_magic
= cpu_to_be16(XFS_DINODE_MAGIC
);
226 free
->di_version
= version
;
227 free
->di_gen
= cpu_to_be32(gen
);
228 free
->di_next_unlinked
= cpu_to_be32(NULLAGINO
);
229 xfs_trans_log_buf(tp
, fbuf
, ioffset
, ioffset
+ isize
- 1);
231 xfs_trans_inode_alloc_buf(tp
, fbuf
);
236 * Allocate new inodes in the allocation group specified by agbp.
237 * Return 0 for success, else error code.
239 STATIC
int /* error code or 0 */
241 xfs_trans_t
*tp
, /* transaction pointer */
242 xfs_buf_t
*agbp
, /* alloc group buffer */
245 xfs_agi_t
*agi
; /* allocation group header */
246 xfs_alloc_arg_t args
; /* allocation argument structure */
247 xfs_btree_cur_t
*cur
; /* inode btree cursor */
251 xfs_agino_t newino
; /* new first inode's number */
252 xfs_agino_t newlen
; /* new number of inodes */
253 xfs_agino_t thisino
; /* current inode number, for loop */
254 int isaligned
= 0; /* inode allocation at stripe unit */
258 args
.mp
= tp
->t_mountp
;
261 * Locking will ensure that we don't have two callers in here
264 newlen
= XFS_IALLOC_INODES(args
.mp
);
265 if (args
.mp
->m_maxicount
&&
266 args
.mp
->m_sb
.sb_icount
+ newlen
> args
.mp
->m_maxicount
)
267 return XFS_ERROR(ENOSPC
);
268 args
.minlen
= args
.maxlen
= XFS_IALLOC_BLOCKS(args
.mp
);
270 * First try to allocate inodes contiguous with the last-allocated
271 * chunk of inodes. If the filesystem is striped, this will fill
272 * an entire stripe unit with inodes.
274 agi
= XFS_BUF_TO_AGI(agbp
);
275 newino
= be32_to_cpu(agi
->agi_newino
);
276 agno
= be32_to_cpu(agi
->agi_seqno
);
277 args
.agbno
= XFS_AGINO_TO_AGBNO(args
.mp
, newino
) +
278 XFS_IALLOC_BLOCKS(args
.mp
);
279 if (likely(newino
!= NULLAGINO
&&
280 (args
.agbno
< be32_to_cpu(agi
->agi_length
)))) {
281 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
282 args
.type
= XFS_ALLOCTYPE_THIS_BNO
;
283 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
284 args
.userdata
= args
.minalignslop
= 0;
288 * We need to take into account alignment here to ensure that
289 * we don't modify the free list if we fail to have an exact
290 * block. If we don't have an exact match, and every oher
291 * attempt allocation attempt fails, we'll end up cancelling
292 * a dirty transaction and shutting down.
294 * For an exact allocation, alignment must be 1,
295 * however we need to take cluster alignment into account when
296 * fixing up the freelist. Use the minalignslop field to
297 * indicate that extra blocks might be required for alignment,
298 * but not to use them in the actual exact allocation.
301 args
.minalignslop
= xfs_ialloc_cluster_alignment(&args
) - 1;
303 /* Allow space for the inode btree to split. */
304 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
305 if ((error
= xfs_alloc_vextent(&args
)))
308 args
.fsbno
= NULLFSBLOCK
;
310 if (unlikely(args
.fsbno
== NULLFSBLOCK
)) {
312 * Set the alignment for the allocation.
313 * If stripe alignment is turned on then align at stripe unit
315 * If the cluster size is smaller than a filesystem block
316 * then we're doing I/O for inodes in filesystem block size
317 * pieces, so don't need alignment anyway.
320 if (args
.mp
->m_sinoalign
) {
321 ASSERT(!(args
.mp
->m_flags
& XFS_MOUNT_NOALIGN
));
322 args
.alignment
= args
.mp
->m_dalign
;
325 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
327 * Need to figure out where to allocate the inode blocks.
328 * Ideally they should be spaced out through the a.g.
329 * For now, just allocate blocks up front.
331 args
.agbno
= be32_to_cpu(agi
->agi_root
);
332 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
334 * Allocate a fixed-size extent of inodes.
336 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
337 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
338 args
.userdata
= args
.minalignslop
= 0;
341 * Allow space for the inode btree to split.
343 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
344 if ((error
= xfs_alloc_vextent(&args
)))
349 * If stripe alignment is turned on, then try again with cluster
352 if (isaligned
&& args
.fsbno
== NULLFSBLOCK
) {
353 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
354 args
.agbno
= be32_to_cpu(agi
->agi_root
);
355 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
356 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
357 if ((error
= xfs_alloc_vextent(&args
)))
361 if (args
.fsbno
== NULLFSBLOCK
) {
365 ASSERT(args
.len
== args
.minlen
);
368 * Stamp and write the inode buffers.
370 * Seed the new inode cluster with a random generation number. This
371 * prevents short-term reuse of generation numbers if a chunk is
372 * freed and then immediately reallocated. We use random numbers
373 * rather than a linear progression to prevent the next generation
374 * number from being easily guessable.
376 xfs_ialloc_inode_init(args
.mp
, tp
, agno
, args
.agbno
, args
.len
,
380 * Convert the results.
382 newino
= XFS_OFFBNO_TO_AGINO(args
.mp
, args
.agbno
, 0);
383 be32_add_cpu(&agi
->agi_count
, newlen
);
384 be32_add_cpu(&agi
->agi_freecount
, newlen
);
385 down_read(&args
.mp
->m_peraglock
);
386 args
.mp
->m_perag
[agno
].pagi_freecount
+= newlen
;
387 up_read(&args
.mp
->m_peraglock
);
388 agi
->agi_newino
= cpu_to_be32(newino
);
391 * Insert records describing the new inode chunk into the btree.
393 cur
= xfs_inobt_init_cursor(args
.mp
, tp
, agbp
, agno
);
394 for (thisino
= newino
;
395 thisino
< newino
+ newlen
;
396 thisino
+= XFS_INODES_PER_CHUNK
) {
397 cur
->bc_rec
.i
.ir_startino
= thisino
;
398 cur
->bc_rec
.i
.ir_freecount
= XFS_INODES_PER_CHUNK
;
399 cur
->bc_rec
.i
.ir_free
= XFS_INOBT_ALL_FREE
;
400 error
= xfs_btree_lookup(cur
, XFS_LOOKUP_EQ
, &i
);
402 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
406 error
= xfs_btree_insert(cur
, &i
);
408 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
413 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
415 * Log allocation group header fields
417 xfs_ialloc_log_agi(tp
, agbp
,
418 XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
| XFS_AGI_NEWINO
);
420 * Modify/log superblock values for inode count and inode free count.
422 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, (long)newlen
);
423 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, (long)newlen
);
428 STATIC_INLINE xfs_agnumber_t
434 spin_lock(&mp
->m_agirotor_lock
);
435 agno
= mp
->m_agirotor
;
436 if (++mp
->m_agirotor
== mp
->m_maxagi
)
438 spin_unlock(&mp
->m_agirotor_lock
);
444 * Select an allocation group to look for a free inode in, based on the parent
445 * inode and then mode. Return the allocation group buffer.
447 STATIC xfs_buf_t
* /* allocation group buffer */
448 xfs_ialloc_ag_select(
449 xfs_trans_t
*tp
, /* transaction pointer */
450 xfs_ino_t parent
, /* parent directory inode number */
451 mode_t mode
, /* bits set to indicate file type */
452 int okalloc
) /* ok to allocate more space */
454 xfs_buf_t
*agbp
; /* allocation group header buffer */
455 xfs_agnumber_t agcount
; /* number of ag's in the filesystem */
456 xfs_agnumber_t agno
; /* current ag number */
457 int flags
; /* alloc buffer locking flags */
458 xfs_extlen_t ineed
; /* blocks needed for inode allocation */
459 xfs_extlen_t longest
= 0; /* longest extent available */
460 xfs_mount_t
*mp
; /* mount point structure */
461 int needspace
; /* file mode implies space allocated */
462 xfs_perag_t
*pag
; /* per allocation group data */
463 xfs_agnumber_t pagno
; /* parent (starting) ag number */
466 * Files of these types need at least one block if length > 0
467 * (and they won't fit in the inode, but that's hard to figure out).
469 needspace
= S_ISDIR(mode
) || S_ISREG(mode
) || S_ISLNK(mode
);
471 agcount
= mp
->m_maxagi
;
473 pagno
= xfs_ialloc_next_ag(mp
);
475 pagno
= XFS_INO_TO_AGNO(mp
, parent
);
476 if (pagno
>= agcount
)
479 ASSERT(pagno
< agcount
);
481 * Loop through allocation groups, looking for one with a little
482 * free space in it. Note we don't look for free inodes, exactly.
483 * Instead, we include whether there is a need to allocate inodes
484 * to mean that blocks must be allocated for them,
485 * if none are currently free.
488 flags
= XFS_ALLOC_FLAG_TRYLOCK
;
489 down_read(&mp
->m_peraglock
);
491 pag
= &mp
->m_perag
[agno
];
492 if (!pag
->pagi_init
) {
493 if (xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
)) {
500 if (!pag
->pagi_inodeok
) {
501 xfs_ialloc_next_ag(mp
);
506 * Is there enough free space for the file plus a block
507 * of inodes (if we need to allocate some)?
509 ineed
= pag
->pagi_freecount
? 0 : XFS_IALLOC_BLOCKS(mp
);
510 if (ineed
&& !pag
->pagf_init
) {
512 xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
)) {
516 (void)xfs_alloc_pagf_init(mp
, tp
, agno
, flags
);
518 if (!ineed
|| pag
->pagf_init
) {
519 if (ineed
&& !(longest
= pag
->pagf_longest
))
520 longest
= pag
->pagf_flcount
> 0;
522 (pag
->pagf_freeblks
>= needspace
+ ineed
&&
526 xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
)) {
530 up_read(&mp
->m_peraglock
);
536 xfs_trans_brelse(tp
, agbp
);
539 * No point in iterating over the rest, if we're shutting
542 if (XFS_FORCED_SHUTDOWN(mp
)) {
543 up_read(&mp
->m_peraglock
);
551 up_read(&mp
->m_peraglock
);
560 * Try to retrieve the next record to the left/right from the current one.
564 struct xfs_btree_cur
*cur
,
565 xfs_inobt_rec_incore_t
*rec
,
573 error
= xfs_btree_decrement(cur
, 0, &i
);
575 error
= xfs_btree_increment(cur
, 0, &i
);
581 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
584 XFS_WANT_CORRUPTED_RETURN(i
== 1);
592 struct xfs_btree_cur
*cur
,
594 xfs_inobt_rec_incore_t
*rec
,
601 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_EQ
, &i
);
606 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
609 XFS_WANT_CORRUPTED_RETURN(i
== 1);
616 * Visible inode allocation functions.
620 * Allocate an inode on disk.
621 * Mode is used to tell whether the new inode will need space, and whether
624 * The arguments IO_agbp and alloc_done are defined to work within
625 * the constraint of one allocation per transaction.
626 * xfs_dialloc() is designed to be called twice if it has to do an
627 * allocation to make more free inodes. On the first call,
628 * IO_agbp should be set to NULL. If an inode is available,
629 * i.e., xfs_dialloc() did not need to do an allocation, an inode
630 * number is returned. In this case, IO_agbp would be set to the
631 * current ag_buf and alloc_done set to false.
632 * If an allocation needed to be done, xfs_dialloc would return
633 * the current ag_buf in IO_agbp and set alloc_done to true.
634 * The caller should then commit the current transaction, allocate a new
635 * transaction, and call xfs_dialloc() again, passing in the previous
636 * value of IO_agbp. IO_agbp should be held across the transactions.
637 * Since the agbp is locked across the two calls, the second call is
638 * guaranteed to have a free inode available.
640 * Once we successfully pick an inode its number is returned and the
641 * on-disk data structures are updated. The inode itself is not read
642 * in, since doing so would break ordering constraints with xfs_reclaim.
646 xfs_trans_t
*tp
, /* transaction pointer */
647 xfs_ino_t parent
, /* parent inode (directory) */
648 mode_t mode
, /* mode bits for new inode */
649 int okalloc
, /* ok to allocate more space */
650 xfs_buf_t
**IO_agbp
, /* in/out ag header's buffer */
651 boolean_t
*alloc_done
, /* true if we needed to replenish
653 xfs_ino_t
*inop
) /* inode number allocated */
655 xfs_agnumber_t agcount
; /* number of allocation groups */
656 xfs_buf_t
*agbp
; /* allocation group header's buffer */
657 xfs_agnumber_t agno
; /* allocation group number */
658 xfs_agi_t
*agi
; /* allocation group header structure */
659 xfs_btree_cur_t
*cur
; /* inode allocation btree cursor */
660 int error
; /* error return value */
661 int i
; /* result code */
662 int ialloced
; /* inode allocation status */
663 int noroom
= 0; /* no space for inode blk allocation */
664 xfs_ino_t ino
; /* fs-relative inode to be returned */
666 int j
; /* result code */
667 xfs_mount_t
*mp
; /* file system mount structure */
668 int offset
; /* index of inode in chunk */
669 xfs_agino_t pagino
; /* parent's AG relative inode # */
670 xfs_agnumber_t pagno
; /* parent's AG number */
671 xfs_inobt_rec_incore_t rec
; /* inode allocation record */
672 xfs_agnumber_t tagno
; /* testing allocation group number */
673 xfs_btree_cur_t
*tcur
; /* temp cursor */
674 xfs_inobt_rec_incore_t trec
; /* temp inode allocation record */
677 if (*IO_agbp
== NULL
) {
679 * We do not have an agbp, so select an initial allocation
680 * group for inode allocation.
682 agbp
= xfs_ialloc_ag_select(tp
, parent
, mode
, okalloc
);
684 * Couldn't find an allocation group satisfying the
691 agi
= XFS_BUF_TO_AGI(agbp
);
692 ASSERT(be32_to_cpu(agi
->agi_magicnum
) == XFS_AGI_MAGIC
);
695 * Continue where we left off before. In this case, we
696 * know that the allocation group has free inodes.
699 agi
= XFS_BUF_TO_AGI(agbp
);
700 ASSERT(be32_to_cpu(agi
->agi_magicnum
) == XFS_AGI_MAGIC
);
701 ASSERT(be32_to_cpu(agi
->agi_freecount
) > 0);
704 agcount
= mp
->m_sb
.sb_agcount
;
705 agno
= be32_to_cpu(agi
->agi_seqno
);
707 pagno
= XFS_INO_TO_AGNO(mp
, parent
);
708 pagino
= XFS_INO_TO_AGINO(mp
, parent
);
711 * If we have already hit the ceiling of inode blocks then clear
712 * okalloc so we scan all available agi structures for a free
716 if (mp
->m_maxicount
&&
717 mp
->m_sb
.sb_icount
+ XFS_IALLOC_INODES(mp
) > mp
->m_maxicount
) {
723 * Loop until we find an allocation group that either has free inodes
724 * or in which we can allocate some inodes. Iterate through the
725 * allocation groups upward, wrapping at the end.
727 *alloc_done
= B_FALSE
;
728 while (!agi
->agi_freecount
) {
730 * Don't do anything if we're not supposed to allocate
731 * any blocks, just go on to the next ag.
735 * Try to allocate some new inodes in the allocation
738 if ((error
= xfs_ialloc_ag_alloc(tp
, agbp
, &ialloced
))) {
739 xfs_trans_brelse(tp
, agbp
);
740 if (error
== ENOSPC
) {
748 * We successfully allocated some inodes, return
749 * the current context to the caller so that it
750 * can commit the current transaction and call
751 * us again where we left off.
753 ASSERT(be32_to_cpu(agi
->agi_freecount
) > 0);
754 *alloc_done
= B_TRUE
;
761 * If it failed, give up on this ag.
763 xfs_trans_brelse(tp
, agbp
);
765 * Go on to the next ag: get its ag header.
768 if (++tagno
== agcount
)
772 return noroom
? ENOSPC
: 0;
774 down_read(&mp
->m_peraglock
);
775 if (mp
->m_perag
[tagno
].pagi_inodeok
== 0) {
776 up_read(&mp
->m_peraglock
);
779 error
= xfs_ialloc_read_agi(mp
, tp
, tagno
, &agbp
);
780 up_read(&mp
->m_peraglock
);
783 agi
= XFS_BUF_TO_AGI(agbp
);
784 ASSERT(be32_to_cpu(agi
->agi_magicnum
) == XFS_AGI_MAGIC
);
787 * Here with an allocation group that has a free inode.
788 * Reset agno since we may have chosen a new ag in the
795 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, be32_to_cpu(agi
->agi_seqno
));
797 * If pagino is 0 (this is the root inode allocation) use newino.
798 * This must work because we've just allocated some.
801 pagino
= be32_to_cpu(agi
->agi_newino
);
803 error
= xfs_check_agi_freecount(cur
, agi
);
808 * If in the same AG as the parent, try to get near the parent.
811 xfs_perag_t
*pag
= &mp
->m_perag
[agno
];
812 int doneleft
; /* done, to the left */
813 int doneright
; /* done, to the right */
814 int searchdistance
= 10;
816 error
= xfs_inobt_lookup(cur
, pagino
, XFS_LOOKUP_LE
, &i
);
819 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
821 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
824 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
826 if (rec
.ir_freecount
> 0) {
828 * Found a free inode in the same chunk
829 * as the parent, done.
836 * In the same AG as parent, but parent's chunk is full.
839 /* duplicate the cursor, search left & right simultaneously */
840 error
= xfs_btree_dup_cursor(cur
, &tcur
);
845 * Skip to last blocks looked up if same parent inode.
847 if (pagino
!= NULLAGINO
&&
848 pag
->pagl_pagino
== pagino
&&
849 pag
->pagl_leftrec
!= NULLAGINO
&&
850 pag
->pagl_rightrec
!= NULLAGINO
) {
851 error
= xfs_ialloc_get_rec(tcur
, pag
->pagl_leftrec
,
852 &trec
, &doneleft
, 1);
856 error
= xfs_ialloc_get_rec(cur
, pag
->pagl_rightrec
,
857 &rec
, &doneright
, 0);
861 /* search left with tcur, back up 1 record */
862 error
= xfs_ialloc_next_rec(tcur
, &trec
, &doneleft
, 1);
866 /* search right with cur, go forward 1 record. */
867 error
= xfs_ialloc_next_rec(cur
, &rec
, &doneright
, 0);
873 * Loop until we find an inode chunk with a free inode.
875 while (!doneleft
|| !doneright
) {
876 int useleft
; /* using left inode chunk this time */
878 if (!--searchdistance
) {
880 * Not in range - save last search
881 * location and allocate a new inode
883 pag
->pagl_leftrec
= trec
.ir_startino
;
884 pag
->pagl_rightrec
= rec
.ir_startino
;
885 pag
->pagl_pagino
= pagino
;
889 /* figure out the closer block if both are valid. */
890 if (!doneleft
&& !doneright
) {
892 (trec
.ir_startino
+ XFS_INODES_PER_CHUNK
- 1) <
893 rec
.ir_startino
- pagino
;
898 /* free inodes to the left? */
899 if (useleft
&& trec
.ir_freecount
) {
901 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
904 pag
->pagl_leftrec
= trec
.ir_startino
;
905 pag
->pagl_rightrec
= rec
.ir_startino
;
906 pag
->pagl_pagino
= pagino
;
910 /* free inodes to the right? */
911 if (!useleft
&& rec
.ir_freecount
) {
912 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
914 pag
->pagl_leftrec
= trec
.ir_startino
;
915 pag
->pagl_rightrec
= rec
.ir_startino
;
916 pag
->pagl_pagino
= pagino
;
920 /* get next record to check */
922 error
= xfs_ialloc_next_rec(tcur
, &trec
,
925 error
= xfs_ialloc_next_rec(cur
, &rec
,
933 * We've reached the end of the btree. because
934 * we are only searching a small chunk of the
935 * btree each search, there is obviously free
936 * inodes closer to the parent inode than we
937 * are now. restart the search again.
939 pag
->pagl_pagino
= NULLAGINO
;
940 pag
->pagl_leftrec
= NULLAGINO
;
941 pag
->pagl_rightrec
= NULLAGINO
;
942 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
943 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
948 * In a different AG from the parent.
949 * See if the most recently allocated block has any free.
952 if (be32_to_cpu(agi
->agi_newino
) != NULLAGINO
) {
953 error
= xfs_inobt_lookup(cur
, be32_to_cpu(agi
->agi_newino
),
959 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
963 if (j
== 1 && rec
.ir_freecount
> 0) {
965 * The last chunk allocated in the group
966 * still has a free inode.
974 * None left in the last group, search the whole AG
976 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &i
);
979 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
982 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
985 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
986 if (rec
.ir_freecount
> 0)
988 error
= xfs_btree_increment(cur
, 0, &i
);
991 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
995 offset
= xfs_ialloc_find_free(&rec
.ir_free
);
997 ASSERT(offset
< XFS_INODES_PER_CHUNK
);
998 ASSERT((XFS_AGINO_TO_OFFSET(mp
, rec
.ir_startino
) %
999 XFS_INODES_PER_CHUNK
) == 0);
1000 ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
+ offset
);
1001 rec
.ir_free
&= ~XFS_INOBT_MASK(offset
);
1003 error
= xfs_inobt_update(cur
, &rec
);
1006 be32_add_cpu(&agi
->agi_freecount
, -1);
1007 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
1008 down_read(&mp
->m_peraglock
);
1009 mp
->m_perag
[tagno
].pagi_freecount
--;
1010 up_read(&mp
->m_peraglock
);
1012 error
= xfs_check_agi_freecount(cur
, agi
);
1016 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1017 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -1);
1021 xfs_btree_del_cursor(tcur
, XFS_BTREE_ERROR
);
1023 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
1028 * Free disk inode. Carefully avoids touching the incore inode, all
1029 * manipulations incore are the caller's responsibility.
1030 * The on-disk inode is not changed by this operation, only the
1031 * btree (free inode mask) is changed.
1035 xfs_trans_t
*tp
, /* transaction pointer */
1036 xfs_ino_t inode
, /* inode to be freed */
1037 xfs_bmap_free_t
*flist
, /* extents to free */
1038 int *delete, /* set if inode cluster was deleted */
1039 xfs_ino_t
*first_ino
) /* first inode in deleted cluster */
1042 xfs_agblock_t agbno
; /* block number containing inode */
1043 xfs_buf_t
*agbp
; /* buffer containing allocation group header */
1044 xfs_agino_t agino
; /* inode number relative to allocation group */
1045 xfs_agnumber_t agno
; /* allocation group number */
1046 xfs_agi_t
*agi
; /* allocation group header */
1047 xfs_btree_cur_t
*cur
; /* inode btree cursor */
1048 int error
; /* error return value */
1049 int i
; /* result code */
1050 int ilen
; /* inodes in an inode cluster */
1051 xfs_mount_t
*mp
; /* mount structure for filesystem */
1052 int off
; /* offset of inode in inode chunk */
1053 xfs_inobt_rec_incore_t rec
; /* btree record */
1058 * Break up inode number into its components.
1060 agno
= XFS_INO_TO_AGNO(mp
, inode
);
1061 if (agno
>= mp
->m_sb
.sb_agcount
) {
1063 "xfs_difree: agno >= mp->m_sb.sb_agcount (%d >= %d) on %s. Returning EINVAL.",
1064 agno
, mp
->m_sb
.sb_agcount
, mp
->m_fsname
);
1066 return XFS_ERROR(EINVAL
);
1068 agino
= XFS_INO_TO_AGINO(mp
, inode
);
1069 if (inode
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1071 "xfs_difree: inode != XFS_AGINO_TO_INO() "
1072 "(%llu != %llu) on %s. Returning EINVAL.",
1073 (unsigned long long)inode
,
1074 (unsigned long long)XFS_AGINO_TO_INO(mp
, agno
, agino
),
1077 return XFS_ERROR(EINVAL
);
1079 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1080 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1082 "xfs_difree: agbno >= mp->m_sb.sb_agblocks (%d >= %d) on %s. Returning EINVAL.",
1083 agbno
, mp
->m_sb
.sb_agblocks
, mp
->m_fsname
);
1085 return XFS_ERROR(EINVAL
);
1088 * Get the allocation group header.
1090 down_read(&mp
->m_peraglock
);
1091 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1092 up_read(&mp
->m_peraglock
);
1095 "xfs_difree: xfs_ialloc_read_agi() returned an error %d on %s. Returning error.",
1096 error
, mp
->m_fsname
);
1099 agi
= XFS_BUF_TO_AGI(agbp
);
1100 ASSERT(be32_to_cpu(agi
->agi_magicnum
) == XFS_AGI_MAGIC
);
1101 ASSERT(agbno
< be32_to_cpu(agi
->agi_length
));
1103 * Initialize the cursor.
1105 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1107 error
= xfs_check_agi_freecount(cur
, agi
);
1112 * Look for the entry describing this inode.
1114 if ((error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
))) {
1116 "xfs_difree: xfs_inobt_lookup returned() an error %d on %s. Returning error.",
1117 error
, mp
->m_fsname
);
1120 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1121 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1124 "xfs_difree: xfs_inobt_get_rec() returned an error %d on %s. Returning error.",
1125 error
, mp
->m_fsname
);
1128 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1130 * Get the offset in the inode chunk.
1132 off
= agino
- rec
.ir_startino
;
1133 ASSERT(off
>= 0 && off
< XFS_INODES_PER_CHUNK
);
1134 ASSERT(!(rec
.ir_free
& XFS_INOBT_MASK(off
)));
1136 * Mark the inode free & increment the count.
1138 rec
.ir_free
|= XFS_INOBT_MASK(off
);
1142 * When an inode cluster is free, it becomes eligible for removal
1144 if (!(mp
->m_flags
& XFS_MOUNT_IKEEP
) &&
1145 (rec
.ir_freecount
== XFS_IALLOC_INODES(mp
))) {
1148 *first_ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
);
1151 * Remove the inode cluster from the AGI B+Tree, adjust the
1152 * AGI and Superblock inode counts, and mark the disk space
1153 * to be freed when the transaction is committed.
1155 ilen
= XFS_IALLOC_INODES(mp
);
1156 be32_add_cpu(&agi
->agi_count
, -ilen
);
1157 be32_add_cpu(&agi
->agi_freecount
, -(ilen
- 1));
1158 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
);
1159 down_read(&mp
->m_peraglock
);
1160 mp
->m_perag
[agno
].pagi_freecount
-= ilen
- 1;
1161 up_read(&mp
->m_peraglock
);
1162 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, -ilen
);
1163 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -(ilen
- 1));
1165 if ((error
= xfs_btree_delete(cur
, &i
))) {
1166 cmn_err(CE_WARN
, "xfs_difree: xfs_btree_delete returned an error %d on %s.\n",
1167 error
, mp
->m_fsname
);
1171 xfs_bmap_add_free(XFS_AGB_TO_FSB(mp
,
1172 agno
, XFS_INO_TO_AGBNO(mp
,rec
.ir_startino
)),
1173 XFS_IALLOC_BLOCKS(mp
), flist
, mp
);
1177 error
= xfs_inobt_update(cur
, &rec
);
1180 "xfs_difree: xfs_inobt_update returned an error %d on %s.",
1181 error
, mp
->m_fsname
);
1186 * Change the inode free counts and log the ag/sb changes.
1188 be32_add_cpu(&agi
->agi_freecount
, 1);
1189 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
1190 down_read(&mp
->m_peraglock
);
1191 mp
->m_perag
[agno
].pagi_freecount
++;
1192 up_read(&mp
->m_peraglock
);
1193 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, 1);
1196 error
= xfs_check_agi_freecount(cur
, agi
);
1200 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1204 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
1209 * Return the location of the inode in imap, for mapping it into a buffer.
1213 xfs_mount_t
*mp
, /* file system mount structure */
1214 xfs_trans_t
*tp
, /* transaction pointer */
1215 xfs_ino_t ino
, /* inode to locate */
1216 struct xfs_imap
*imap
, /* location map structure */
1217 uint flags
) /* flags for inode btree lookup */
1219 xfs_agblock_t agbno
; /* block number of inode in the alloc group */
1220 xfs_agino_t agino
; /* inode number within alloc group */
1221 xfs_agnumber_t agno
; /* allocation group number */
1222 int blks_per_cluster
; /* num blocks per inode cluster */
1223 xfs_agblock_t chunk_agbno
; /* first block in inode chunk */
1224 xfs_agblock_t cluster_agbno
; /* first block in inode cluster */
1225 int error
; /* error code */
1226 int offset
; /* index of inode in its buffer */
1227 int offset_agbno
; /* blks from chunk start to inode */
1229 ASSERT(ino
!= NULLFSINO
);
1232 * Split up the inode number into its parts.
1234 agno
= XFS_INO_TO_AGNO(mp
, ino
);
1235 agino
= XFS_INO_TO_AGINO(mp
, ino
);
1236 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1237 if (agno
>= mp
->m_sb
.sb_agcount
|| agbno
>= mp
->m_sb
.sb_agblocks
||
1238 ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1240 /* no diagnostics for bulkstat, ino comes from userspace */
1241 if (flags
& XFS_IGET_BULKSTAT
)
1242 return XFS_ERROR(EINVAL
);
1243 if (agno
>= mp
->m_sb
.sb_agcount
) {
1244 xfs_fs_cmn_err(CE_ALERT
, mp
,
1245 "xfs_imap: agno (%d) >= "
1246 "mp->m_sb.sb_agcount (%d)",
1247 agno
, mp
->m_sb
.sb_agcount
);
1249 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1250 xfs_fs_cmn_err(CE_ALERT
, mp
,
1251 "xfs_imap: agbno (0x%llx) >= "
1252 "mp->m_sb.sb_agblocks (0x%lx)",
1253 (unsigned long long) agbno
,
1254 (unsigned long) mp
->m_sb
.sb_agblocks
);
1256 if (ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1257 xfs_fs_cmn_err(CE_ALERT
, mp
,
1258 "xfs_imap: ino (0x%llx) != "
1259 "XFS_AGINO_TO_INO(mp, agno, agino) "
1261 ino
, XFS_AGINO_TO_INO(mp
, agno
, agino
));
1265 return XFS_ERROR(EINVAL
);
1269 * If the inode cluster size is the same as the blocksize or
1270 * smaller we get to the buffer by simple arithmetics.
1272 if (XFS_INODE_CLUSTER_SIZE(mp
) <= mp
->m_sb
.sb_blocksize
) {
1273 offset
= XFS_INO_TO_OFFSET(mp
, ino
);
1274 ASSERT(offset
< mp
->m_sb
.sb_inopblock
);
1276 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
);
1277 imap
->im_len
= XFS_FSB_TO_BB(mp
, 1);
1278 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1282 blks_per_cluster
= XFS_INODE_CLUSTER_SIZE(mp
) >> mp
->m_sb
.sb_blocklog
;
1285 * If we get a block number passed from bulkstat we can use it to
1286 * find the buffer easily.
1288 if (imap
->im_blkno
) {
1289 offset
= XFS_INO_TO_OFFSET(mp
, ino
);
1290 ASSERT(offset
< mp
->m_sb
.sb_inopblock
);
1292 cluster_agbno
= xfs_daddr_to_agbno(mp
, imap
->im_blkno
);
1293 offset
+= (agbno
- cluster_agbno
) * mp
->m_sb
.sb_inopblock
;
1295 imap
->im_len
= XFS_FSB_TO_BB(mp
, blks_per_cluster
);
1296 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1301 * If the inode chunks are aligned then use simple maths to
1302 * find the location. Otherwise we have to do a btree
1303 * lookup to find the location.
1305 if (mp
->m_inoalign_mask
) {
1306 offset_agbno
= agbno
& mp
->m_inoalign_mask
;
1307 chunk_agbno
= agbno
- offset_agbno
;
1309 xfs_btree_cur_t
*cur
; /* inode btree cursor */
1310 xfs_inobt_rec_incore_t chunk_rec
;
1311 xfs_buf_t
*agbp
; /* agi buffer */
1312 int i
; /* temp state */
1314 down_read(&mp
->m_peraglock
);
1315 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1316 up_read(&mp
->m_peraglock
);
1318 xfs_fs_cmn_err(CE_ALERT
, mp
, "xfs_imap: "
1319 "xfs_ialloc_read_agi() returned "
1320 "error %d, agno %d",
1325 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1326 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
);
1328 xfs_fs_cmn_err(CE_ALERT
, mp
, "xfs_imap: "
1329 "xfs_inobt_lookup() failed");
1333 error
= xfs_inobt_get_rec(cur
, &chunk_rec
, &i
);
1335 xfs_fs_cmn_err(CE_ALERT
, mp
, "xfs_imap: "
1336 "xfs_inobt_get_rec() failed");
1341 xfs_fs_cmn_err(CE_ALERT
, mp
, "xfs_imap: "
1342 "xfs_inobt_get_rec() failed");
1344 error
= XFS_ERROR(EINVAL
);
1347 xfs_trans_brelse(tp
, agbp
);
1348 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1351 chunk_agbno
= XFS_AGINO_TO_AGBNO(mp
, chunk_rec
.ir_startino
);
1352 offset_agbno
= agbno
- chunk_agbno
;
1355 ASSERT(agbno
>= chunk_agbno
);
1356 cluster_agbno
= chunk_agbno
+
1357 ((offset_agbno
/ blks_per_cluster
) * blks_per_cluster
);
1358 offset
= ((agbno
- cluster_agbno
) * mp
->m_sb
.sb_inopblock
) +
1359 XFS_INO_TO_OFFSET(mp
, ino
);
1361 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, cluster_agbno
);
1362 imap
->im_len
= XFS_FSB_TO_BB(mp
, blks_per_cluster
);
1363 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1366 * If the inode number maps to a block outside the bounds
1367 * of the file system then return NULL rather than calling
1368 * read_buf and panicing when we get an error from the
1371 if ((imap
->im_blkno
+ imap
->im_len
) >
1372 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
)) {
1373 xfs_fs_cmn_err(CE_ALERT
, mp
, "xfs_imap: "
1374 "(imap->im_blkno (0x%llx) + imap->im_len (0x%llx)) > "
1375 " XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks) (0x%llx)",
1376 (unsigned long long) imap
->im_blkno
,
1377 (unsigned long long) imap
->im_len
,
1378 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
));
1379 return XFS_ERROR(EINVAL
);
1386 * Compute and fill in value of m_in_maxlevels.
1389 xfs_ialloc_compute_maxlevels(
1390 xfs_mount_t
*mp
) /* file system mount structure */
1398 maxleafents
= (1LL << XFS_INO_AGINO_BITS(mp
)) >>
1399 XFS_INODES_PER_CHUNK_LOG
;
1400 minleafrecs
= mp
->m_alloc_mnr
[0];
1401 minnoderecs
= mp
->m_alloc_mnr
[1];
1402 maxblocks
= (maxleafents
+ minleafrecs
- 1) / minleafrecs
;
1403 for (level
= 1; maxblocks
> 1; level
++)
1404 maxblocks
= (maxblocks
+ minnoderecs
- 1) / minnoderecs
;
1405 mp
->m_in_maxlevels
= level
;
1409 * Log specified fields for the ag hdr (inode section)
1413 xfs_trans_t
*tp
, /* transaction pointer */
1414 xfs_buf_t
*bp
, /* allocation group header buffer */
1415 int fields
) /* bitmask of fields to log */
1417 int first
; /* first byte number */
1418 int last
; /* last byte number */
1419 static const short offsets
[] = { /* field starting offsets */
1420 /* keep in sync with bit definitions */
1421 offsetof(xfs_agi_t
, agi_magicnum
),
1422 offsetof(xfs_agi_t
, agi_versionnum
),
1423 offsetof(xfs_agi_t
, agi_seqno
),
1424 offsetof(xfs_agi_t
, agi_length
),
1425 offsetof(xfs_agi_t
, agi_count
),
1426 offsetof(xfs_agi_t
, agi_root
),
1427 offsetof(xfs_agi_t
, agi_level
),
1428 offsetof(xfs_agi_t
, agi_freecount
),
1429 offsetof(xfs_agi_t
, agi_newino
),
1430 offsetof(xfs_agi_t
, agi_dirino
),
1431 offsetof(xfs_agi_t
, agi_unlinked
),
1435 xfs_agi_t
*agi
; /* allocation group header */
1437 agi
= XFS_BUF_TO_AGI(bp
);
1438 ASSERT(be32_to_cpu(agi
->agi_magicnum
) == XFS_AGI_MAGIC
);
1441 * Compute byte offsets for the first and last fields.
1443 xfs_btree_offsets(fields
, offsets
, XFS_AGI_NUM_BITS
, &first
, &last
);
1445 * Log the allocation group inode header buffer.
1447 xfs_trans_log_buf(tp
, bp
, first
, last
);
1452 xfs_check_agi_unlinked(
1453 struct xfs_agi
*agi
)
1457 for (i
= 0; i
< XFS_AGI_UNLINKED_BUCKETS
; i
++)
1458 ASSERT(agi
->agi_unlinked
[i
]);
1461 #define xfs_check_agi_unlinked(agi)
1465 * Read in the allocation group header (inode allocation section)
1469 struct xfs_mount
*mp
, /* file system mount structure */
1470 struct xfs_trans
*tp
, /* transaction pointer */
1471 xfs_agnumber_t agno
, /* allocation group number */
1472 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1474 struct xfs_agi
*agi
; /* allocation group header */
1475 int agi_ok
; /* agi is consistent */
1478 ASSERT(agno
!= NULLAGNUMBER
);
1480 error
= xfs_trans_read_buf(mp
, tp
, mp
->m_ddev_targp
,
1481 XFS_AG_DADDR(mp
, agno
, XFS_AGI_DADDR(mp
)),
1482 XFS_FSS_TO_BB(mp
, 1), 0, bpp
);
1486 ASSERT(*bpp
&& !XFS_BUF_GETERROR(*bpp
));
1487 agi
= XFS_BUF_TO_AGI(*bpp
);
1490 * Validate the magic number of the agi block.
1492 agi_ok
= be32_to_cpu(agi
->agi_magicnum
) == XFS_AGI_MAGIC
&&
1493 XFS_AGI_GOOD_VERSION(be32_to_cpu(agi
->agi_versionnum
)) &&
1494 be32_to_cpu(agi
->agi_seqno
) == agno
;
1495 if (unlikely(XFS_TEST_ERROR(!agi_ok
, mp
, XFS_ERRTAG_IALLOC_READ_AGI
,
1496 XFS_RANDOM_IALLOC_READ_AGI
))) {
1497 XFS_CORRUPTION_ERROR("xfs_read_agi", XFS_ERRLEVEL_LOW
,
1499 xfs_trans_brelse(tp
, *bpp
);
1500 return XFS_ERROR(EFSCORRUPTED
);
1503 XFS_BUF_SET_VTYPE_REF(*bpp
, B_FS_AGI
, XFS_AGI_REF
);
1505 xfs_check_agi_unlinked(agi
);
1510 xfs_ialloc_read_agi(
1511 struct xfs_mount
*mp
, /* file system mount structure */
1512 struct xfs_trans
*tp
, /* transaction pointer */
1513 xfs_agnumber_t agno
, /* allocation group number */
1514 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1516 struct xfs_agi
*agi
; /* allocation group header */
1517 struct xfs_perag
*pag
; /* per allocation group data */
1520 error
= xfs_read_agi(mp
, tp
, agno
, bpp
);
1524 agi
= XFS_BUF_TO_AGI(*bpp
);
1525 pag
= &mp
->m_perag
[agno
];
1527 if (!pag
->pagi_init
) {
1528 pag
->pagi_freecount
= be32_to_cpu(agi
->agi_freecount
);
1529 pag
->pagi_count
= be32_to_cpu(agi
->agi_count
);
1534 * It's possible for these to be out of sync if
1535 * we are in the middle of a forced shutdown.
1537 ASSERT(pag
->pagi_freecount
== be32_to_cpu(agi
->agi_freecount
) ||
1538 XFS_FORCED_SHUTDOWN(mp
));
1543 * Read in the agi to initialise the per-ag data in the mount structure
1546 xfs_ialloc_pagi_init(
1547 xfs_mount_t
*mp
, /* file system mount structure */
1548 xfs_trans_t
*tp
, /* transaction pointer */
1549 xfs_agnumber_t agno
) /* allocation group number */
1551 xfs_buf_t
*bp
= NULL
;
1554 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &bp
);
1558 xfs_trans_brelse(tp
, bp
);