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"
27 #include "xfs_mount.h"
28 #include "xfs_bmap_btree.h"
29 #include "xfs_alloc_btree.h"
30 #include "xfs_ialloc_btree.h"
31 #include "xfs_dinode.h"
32 #include "xfs_inode.h"
33 #include "xfs_btree.h"
34 #include "xfs_ialloc.h"
35 #include "xfs_alloc.h"
36 #include "xfs_rtalloc.h"
37 #include "xfs_error.h"
42 * Allocation group level functions.
45 xfs_ialloc_cluster_alignment(
46 xfs_alloc_arg_t
*args
)
48 if (xfs_sb_version_hasalign(&args
->mp
->m_sb
) &&
49 args
->mp
->m_sb
.sb_inoalignmt
>=
50 XFS_B_TO_FSBT(args
->mp
, XFS_INODE_CLUSTER_SIZE(args
->mp
)))
51 return args
->mp
->m_sb
.sb_inoalignmt
;
56 * Lookup a record by ino in the btree given by cur.
60 struct xfs_btree_cur
*cur
, /* btree cursor */
61 xfs_agino_t ino
, /* starting inode of chunk */
62 xfs_lookup_t dir
, /* <=, >=, == */
63 int *stat
) /* success/failure */
65 cur
->bc_rec
.i
.ir_startino
= ino
;
66 cur
->bc_rec
.i
.ir_freecount
= 0;
67 cur
->bc_rec
.i
.ir_free
= 0;
68 return xfs_btree_lookup(cur
, dir
, stat
);
72 * Update the record referred to by cur to the value given.
73 * This either works (return 0) or gets an EFSCORRUPTED error.
75 STATIC
int /* error */
77 struct xfs_btree_cur
*cur
, /* btree cursor */
78 xfs_inobt_rec_incore_t
*irec
) /* btree record */
80 union xfs_btree_rec rec
;
82 rec
.inobt
.ir_startino
= cpu_to_be32(irec
->ir_startino
);
83 rec
.inobt
.ir_freecount
= cpu_to_be32(irec
->ir_freecount
);
84 rec
.inobt
.ir_free
= cpu_to_be64(irec
->ir_free
);
85 return xfs_btree_update(cur
, &rec
);
89 * Get the data from the pointed-to record.
93 struct xfs_btree_cur
*cur
, /* btree cursor */
94 xfs_inobt_rec_incore_t
*irec
, /* btree record */
95 int *stat
) /* output: success/failure */
97 union xfs_btree_rec
*rec
;
100 error
= xfs_btree_get_rec(cur
, &rec
, stat
);
101 if (!error
&& *stat
== 1) {
102 irec
->ir_startino
= be32_to_cpu(rec
->inobt
.ir_startino
);
103 irec
->ir_freecount
= be32_to_cpu(rec
->inobt
.ir_freecount
);
104 irec
->ir_free
= be64_to_cpu(rec
->inobt
.ir_free
);
110 * Verify that the number of free inodes in the AGI is correct.
114 xfs_check_agi_freecount(
115 struct xfs_btree_cur
*cur
,
118 if (cur
->bc_nlevels
== 1) {
119 xfs_inobt_rec_incore_t rec
;
124 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &i
);
129 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
134 freecount
+= rec
.ir_freecount
;
135 error
= xfs_btree_increment(cur
, 0, &i
);
141 if (!XFS_FORCED_SHUTDOWN(cur
->bc_mp
))
142 ASSERT(freecount
== be32_to_cpu(agi
->agi_freecount
));
147 #define xfs_check_agi_freecount(cur, agi) 0
151 * Initialise a new set of inodes.
154 xfs_ialloc_inode_init(
155 struct xfs_mount
*mp
,
156 struct xfs_trans
*tp
,
159 xfs_agblock_t length
,
162 struct xfs_buf
*fbuf
;
163 struct xfs_dinode
*free
;
164 int blks_per_cluster
, nbufs
, ninodes
;
170 * Loop over the new block(s), filling in the inodes.
171 * For small block sizes, manipulate the inodes in buffers
172 * which are multiples of the blocks size.
174 if (mp
->m_sb
.sb_blocksize
>= XFS_INODE_CLUSTER_SIZE(mp
)) {
175 blks_per_cluster
= 1;
177 ninodes
= mp
->m_sb
.sb_inopblock
;
179 blks_per_cluster
= XFS_INODE_CLUSTER_SIZE(mp
) /
180 mp
->m_sb
.sb_blocksize
;
181 nbufs
= length
/ blks_per_cluster
;
182 ninodes
= blks_per_cluster
* mp
->m_sb
.sb_inopblock
;
186 * Figure out what version number to use in the inodes we create.
187 * If the superblock version has caught up to the one that supports
188 * the new inode format, then use the new inode version. Otherwise
189 * use the old version so that old kernels will continue to be
190 * able to use the file system.
192 if (xfs_sb_version_hasnlink(&mp
->m_sb
))
197 for (j
= 0; j
< nbufs
; j
++) {
201 d
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
+ (j
* blks_per_cluster
));
202 fbuf
= xfs_trans_get_buf(tp
, mp
->m_ddev_targp
, d
,
203 mp
->m_bsize
* blks_per_cluster
, 0);
207 * Initialize all inodes in this buffer and then log them.
209 * XXX: It would be much better if we had just one transaction
210 * to log a whole cluster of inodes instead of all the
211 * individual transactions causing a lot of log traffic.
213 xfs_buf_zero(fbuf
, 0, ninodes
<< mp
->m_sb
.sb_inodelog
);
214 for (i
= 0; i
< ninodes
; i
++) {
215 int ioffset
= i
<< mp
->m_sb
.sb_inodelog
;
216 uint isize
= sizeof(struct xfs_dinode
);
218 free
= xfs_make_iptr(mp
, fbuf
, i
);
219 free
->di_magic
= cpu_to_be16(XFS_DINODE_MAGIC
);
220 free
->di_version
= version
;
221 free
->di_gen
= cpu_to_be32(gen
);
222 free
->di_next_unlinked
= cpu_to_be32(NULLAGINO
);
223 xfs_trans_log_buf(tp
, fbuf
, ioffset
, ioffset
+ isize
- 1);
225 xfs_trans_inode_alloc_buf(tp
, fbuf
);
231 * Allocate new inodes in the allocation group specified by agbp.
232 * Return 0 for success, else error code.
234 STATIC
int /* error code or 0 */
236 xfs_trans_t
*tp
, /* transaction pointer */
237 xfs_buf_t
*agbp
, /* alloc group buffer */
240 xfs_agi_t
*agi
; /* allocation group header */
241 xfs_alloc_arg_t args
; /* allocation argument structure */
242 xfs_btree_cur_t
*cur
; /* inode btree cursor */
246 xfs_agino_t newino
; /* new first inode's number */
247 xfs_agino_t newlen
; /* new number of inodes */
248 xfs_agino_t thisino
; /* current inode number, for loop */
249 int isaligned
= 0; /* inode allocation at stripe unit */
251 struct xfs_perag
*pag
;
254 args
.mp
= tp
->t_mountp
;
257 * Locking will ensure that we don't have two callers in here
260 newlen
= XFS_IALLOC_INODES(args
.mp
);
261 if (args
.mp
->m_maxicount
&&
262 args
.mp
->m_sb
.sb_icount
+ newlen
> args
.mp
->m_maxicount
)
263 return XFS_ERROR(ENOSPC
);
264 args
.minlen
= args
.maxlen
= XFS_IALLOC_BLOCKS(args
.mp
);
266 * First try to allocate inodes contiguous with the last-allocated
267 * chunk of inodes. If the filesystem is striped, this will fill
268 * an entire stripe unit with inodes.
270 agi
= XFS_BUF_TO_AGI(agbp
);
271 newino
= be32_to_cpu(agi
->agi_newino
);
272 agno
= be32_to_cpu(agi
->agi_seqno
);
273 args
.agbno
= XFS_AGINO_TO_AGBNO(args
.mp
, newino
) +
274 XFS_IALLOC_BLOCKS(args
.mp
);
275 if (likely(newino
!= NULLAGINO
&&
276 (args
.agbno
< be32_to_cpu(agi
->agi_length
)))) {
277 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
278 args
.type
= XFS_ALLOCTYPE_THIS_BNO
;
279 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
280 args
.userdata
= args
.minalignslop
= 0;
284 * We need to take into account alignment here to ensure that
285 * we don't modify the free list if we fail to have an exact
286 * block. If we don't have an exact match, and every oher
287 * attempt allocation attempt fails, we'll end up cancelling
288 * a dirty transaction and shutting down.
290 * For an exact allocation, alignment must be 1,
291 * however we need to take cluster alignment into account when
292 * fixing up the freelist. Use the minalignslop field to
293 * indicate that extra blocks might be required for alignment,
294 * but not to use them in the actual exact allocation.
297 args
.minalignslop
= xfs_ialloc_cluster_alignment(&args
) - 1;
299 /* Allow space for the inode btree to split. */
300 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
301 if ((error
= xfs_alloc_vextent(&args
)))
304 args
.fsbno
= NULLFSBLOCK
;
306 if (unlikely(args
.fsbno
== NULLFSBLOCK
)) {
308 * Set the alignment for the allocation.
309 * If stripe alignment is turned on then align at stripe unit
311 * If the cluster size is smaller than a filesystem block
312 * then we're doing I/O for inodes in filesystem block size
313 * pieces, so don't need alignment anyway.
316 if (args
.mp
->m_sinoalign
) {
317 ASSERT(!(args
.mp
->m_flags
& XFS_MOUNT_NOALIGN
));
318 args
.alignment
= args
.mp
->m_dalign
;
321 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
323 * Need to figure out where to allocate the inode blocks.
324 * Ideally they should be spaced out through the a.g.
325 * For now, just allocate blocks up front.
327 args
.agbno
= be32_to_cpu(agi
->agi_root
);
328 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
330 * Allocate a fixed-size extent of inodes.
332 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
333 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
334 args
.userdata
= args
.minalignslop
= 0;
337 * Allow space for the inode btree to split.
339 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
340 if ((error
= xfs_alloc_vextent(&args
)))
345 * If stripe alignment is turned on, then try again with cluster
348 if (isaligned
&& args
.fsbno
== NULLFSBLOCK
) {
349 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
350 args
.agbno
= be32_to_cpu(agi
->agi_root
);
351 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
352 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
353 if ((error
= xfs_alloc_vextent(&args
)))
357 if (args
.fsbno
== NULLFSBLOCK
) {
361 ASSERT(args
.len
== args
.minlen
);
364 * Stamp and write the inode buffers.
366 * Seed the new inode cluster with a random generation number. This
367 * prevents short-term reuse of generation numbers if a chunk is
368 * freed and then immediately reallocated. We use random numbers
369 * rather than a linear progression to prevent the next generation
370 * number from being easily guessable.
372 error
= xfs_ialloc_inode_init(args
.mp
, tp
, agno
, args
.agbno
,
373 args
.len
, random32());
378 * Convert the results.
380 newino
= XFS_OFFBNO_TO_AGINO(args
.mp
, args
.agbno
, 0);
381 be32_add_cpu(&agi
->agi_count
, newlen
);
382 be32_add_cpu(&agi
->agi_freecount
, newlen
);
383 pag
= xfs_perag_get(args
.mp
, agno
);
384 pag
->pagi_freecount
+= newlen
;
386 agi
->agi_newino
= cpu_to_be32(newino
);
389 * Insert records describing the new inode chunk into the btree.
391 cur
= xfs_inobt_init_cursor(args
.mp
, tp
, agbp
, agno
);
392 for (thisino
= newino
;
393 thisino
< newino
+ newlen
;
394 thisino
+= XFS_INODES_PER_CHUNK
) {
395 cur
->bc_rec
.i
.ir_startino
= thisino
;
396 cur
->bc_rec
.i
.ir_freecount
= XFS_INODES_PER_CHUNK
;
397 cur
->bc_rec
.i
.ir_free
= XFS_INOBT_ALL_FREE
;
398 error
= xfs_btree_lookup(cur
, XFS_LOOKUP_EQ
, &i
);
400 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
404 error
= xfs_btree_insert(cur
, &i
);
406 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
411 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
413 * Log allocation group header fields
415 xfs_ialloc_log_agi(tp
, agbp
,
416 XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
| XFS_AGI_NEWINO
);
418 * Modify/log superblock values for inode count and inode free count.
420 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, (long)newlen
);
421 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, (long)newlen
);
426 STATIC xfs_agnumber_t
432 spin_lock(&mp
->m_agirotor_lock
);
433 agno
= mp
->m_agirotor
;
434 if (++mp
->m_agirotor
== mp
->m_maxagi
)
436 spin_unlock(&mp
->m_agirotor_lock
);
442 * Select an allocation group to look for a free inode in, based on the parent
443 * inode and then mode. Return the allocation group buffer.
445 STATIC xfs_buf_t
* /* allocation group buffer */
446 xfs_ialloc_ag_select(
447 xfs_trans_t
*tp
, /* transaction pointer */
448 xfs_ino_t parent
, /* parent directory inode number */
449 umode_t mode
, /* bits set to indicate file type */
450 int okalloc
) /* ok to allocate more space */
452 xfs_buf_t
*agbp
; /* allocation group header buffer */
453 xfs_agnumber_t agcount
; /* number of ag's in the filesystem */
454 xfs_agnumber_t agno
; /* current ag number */
455 int flags
; /* alloc buffer locking flags */
456 xfs_extlen_t ineed
; /* blocks needed for inode allocation */
457 xfs_extlen_t longest
= 0; /* longest extent available */
458 xfs_mount_t
*mp
; /* mount point structure */
459 int needspace
; /* file mode implies space allocated */
460 xfs_perag_t
*pag
; /* per allocation group data */
461 xfs_agnumber_t pagno
; /* parent (starting) ag number */
464 * Files of these types need at least one block if length > 0
465 * (and they won't fit in the inode, but that's hard to figure out).
467 needspace
= S_ISDIR(mode
) || S_ISREG(mode
) || S_ISLNK(mode
);
469 agcount
= mp
->m_maxagi
;
471 pagno
= xfs_ialloc_next_ag(mp
);
473 pagno
= XFS_INO_TO_AGNO(mp
, parent
);
474 if (pagno
>= agcount
)
477 ASSERT(pagno
< agcount
);
479 * Loop through allocation groups, looking for one with a little
480 * free space in it. Note we don't look for free inodes, exactly.
481 * Instead, we include whether there is a need to allocate inodes
482 * to mean that blocks must be allocated for them,
483 * if none are currently free.
486 flags
= XFS_ALLOC_FLAG_TRYLOCK
;
488 pag
= xfs_perag_get(mp
, agno
);
489 if (!pag
->pagi_init
) {
490 if (xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
)) {
497 if (!pag
->pagi_inodeok
) {
498 xfs_ialloc_next_ag(mp
);
503 * Is there enough free space for the file plus a block
504 * of inodes (if we need to allocate some)?
506 ineed
= pag
->pagi_freecount
? 0 : XFS_IALLOC_BLOCKS(mp
);
507 if (ineed
&& !pag
->pagf_init
) {
509 xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
)) {
513 (void)xfs_alloc_pagf_init(mp
, tp
, agno
, flags
);
515 if (!ineed
|| pag
->pagf_init
) {
516 if (ineed
&& !(longest
= pag
->pagf_longest
))
517 longest
= pag
->pagf_flcount
> 0;
519 (pag
->pagf_freeblks
>= needspace
+ ineed
&&
523 xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
)) {
533 xfs_trans_brelse(tp
, agbp
);
537 * No point in iterating over the rest, if we're shutting
540 if (XFS_FORCED_SHUTDOWN(mp
))
554 * Try to retrieve the next record to the left/right from the current one.
558 struct xfs_btree_cur
*cur
,
559 xfs_inobt_rec_incore_t
*rec
,
567 error
= xfs_btree_decrement(cur
, 0, &i
);
569 error
= xfs_btree_increment(cur
, 0, &i
);
575 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
578 XFS_WANT_CORRUPTED_RETURN(i
== 1);
586 struct xfs_btree_cur
*cur
,
588 xfs_inobt_rec_incore_t
*rec
,
595 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_EQ
, &i
);
600 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
603 XFS_WANT_CORRUPTED_RETURN(i
== 1);
612 * The caller selected an AG for us, and made sure that free inodes are
617 struct xfs_trans
*tp
,
618 struct xfs_buf
*agbp
,
622 struct xfs_mount
*mp
= tp
->t_mountp
;
623 struct xfs_agi
*agi
= XFS_BUF_TO_AGI(agbp
);
624 xfs_agnumber_t agno
= be32_to_cpu(agi
->agi_seqno
);
625 xfs_agnumber_t pagno
= XFS_INO_TO_AGNO(mp
, parent
);
626 xfs_agino_t pagino
= XFS_INO_TO_AGINO(mp
, parent
);
627 struct xfs_perag
*pag
;
628 struct xfs_btree_cur
*cur
, *tcur
;
629 struct xfs_inobt_rec_incore rec
, trec
;
635 pag
= xfs_perag_get(mp
, agno
);
637 ASSERT(pag
->pagi_init
);
638 ASSERT(pag
->pagi_inodeok
);
639 ASSERT(pag
->pagi_freecount
> 0);
642 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
644 * If pagino is 0 (this is the root inode allocation) use newino.
645 * This must work because we've just allocated some.
648 pagino
= be32_to_cpu(agi
->agi_newino
);
650 error
= xfs_check_agi_freecount(cur
, agi
);
655 * If in the same AG as the parent, try to get near the parent.
658 int doneleft
; /* done, to the left */
659 int doneright
; /* done, to the right */
660 int searchdistance
= 10;
662 error
= xfs_inobt_lookup(cur
, pagino
, XFS_LOOKUP_LE
, &i
);
665 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
667 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
670 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
672 if (rec
.ir_freecount
> 0) {
674 * Found a free inode in the same chunk
675 * as the parent, done.
682 * In the same AG as parent, but parent's chunk is full.
685 /* duplicate the cursor, search left & right simultaneously */
686 error
= xfs_btree_dup_cursor(cur
, &tcur
);
691 * Skip to last blocks looked up if same parent inode.
693 if (pagino
!= NULLAGINO
&&
694 pag
->pagl_pagino
== pagino
&&
695 pag
->pagl_leftrec
!= NULLAGINO
&&
696 pag
->pagl_rightrec
!= NULLAGINO
) {
697 error
= xfs_ialloc_get_rec(tcur
, pag
->pagl_leftrec
,
698 &trec
, &doneleft
, 1);
702 error
= xfs_ialloc_get_rec(cur
, pag
->pagl_rightrec
,
703 &rec
, &doneright
, 0);
707 /* search left with tcur, back up 1 record */
708 error
= xfs_ialloc_next_rec(tcur
, &trec
, &doneleft
, 1);
712 /* search right with cur, go forward 1 record. */
713 error
= xfs_ialloc_next_rec(cur
, &rec
, &doneright
, 0);
719 * Loop until we find an inode chunk with a free inode.
721 while (!doneleft
|| !doneright
) {
722 int useleft
; /* using left inode chunk this time */
724 if (!--searchdistance
) {
726 * Not in range - save last search
727 * location and allocate a new inode
729 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
730 pag
->pagl_leftrec
= trec
.ir_startino
;
731 pag
->pagl_rightrec
= rec
.ir_startino
;
732 pag
->pagl_pagino
= pagino
;
736 /* figure out the closer block if both are valid. */
737 if (!doneleft
&& !doneright
) {
739 (trec
.ir_startino
+ XFS_INODES_PER_CHUNK
- 1) <
740 rec
.ir_startino
- pagino
;
745 /* free inodes to the left? */
746 if (useleft
&& trec
.ir_freecount
) {
748 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
751 pag
->pagl_leftrec
= trec
.ir_startino
;
752 pag
->pagl_rightrec
= rec
.ir_startino
;
753 pag
->pagl_pagino
= pagino
;
757 /* free inodes to the right? */
758 if (!useleft
&& rec
.ir_freecount
) {
759 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
761 pag
->pagl_leftrec
= trec
.ir_startino
;
762 pag
->pagl_rightrec
= rec
.ir_startino
;
763 pag
->pagl_pagino
= pagino
;
767 /* get next record to check */
769 error
= xfs_ialloc_next_rec(tcur
, &trec
,
772 error
= xfs_ialloc_next_rec(cur
, &rec
,
780 * We've reached the end of the btree. because
781 * we are only searching a small chunk of the
782 * btree each search, there is obviously free
783 * inodes closer to the parent inode than we
784 * are now. restart the search again.
786 pag
->pagl_pagino
= NULLAGINO
;
787 pag
->pagl_leftrec
= NULLAGINO
;
788 pag
->pagl_rightrec
= NULLAGINO
;
789 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
790 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
795 * In a different AG from the parent.
796 * See if the most recently allocated block has any free.
799 if (agi
->agi_newino
!= cpu_to_be32(NULLAGINO
)) {
800 error
= xfs_inobt_lookup(cur
, be32_to_cpu(agi
->agi_newino
),
806 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
810 if (j
== 1 && rec
.ir_freecount
> 0) {
812 * The last chunk allocated in the group
813 * still has a free inode.
821 * None left in the last group, search the whole AG
823 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &i
);
826 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
829 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
832 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
833 if (rec
.ir_freecount
> 0)
835 error
= xfs_btree_increment(cur
, 0, &i
);
838 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
842 offset
= xfs_lowbit64(rec
.ir_free
);
844 ASSERT(offset
< XFS_INODES_PER_CHUNK
);
845 ASSERT((XFS_AGINO_TO_OFFSET(mp
, rec
.ir_startino
) %
846 XFS_INODES_PER_CHUNK
) == 0);
847 ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
+ offset
);
848 rec
.ir_free
&= ~XFS_INOBT_MASK(offset
);
850 error
= xfs_inobt_update(cur
, &rec
);
853 be32_add_cpu(&agi
->agi_freecount
, -1);
854 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
855 pag
->pagi_freecount
--;
857 error
= xfs_check_agi_freecount(cur
, agi
);
861 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
862 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -1);
867 xfs_btree_del_cursor(tcur
, XFS_BTREE_ERROR
);
869 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
875 * Allocate an inode on disk.
877 * Mode is used to tell whether the new inode will need space, and whether it
880 * This function is designed to be called twice if it has to do an allocation
881 * to make more free inodes. On the first call, *IO_agbp should be set to NULL.
882 * If an inode is available without having to performn an allocation, an inode
883 * number is returned. In this case, *IO_agbp would be NULL. If an allocation
884 * needes to be done, xfs_dialloc would return the current AGI buffer in
885 * *IO_agbp. The caller should then commit the current transaction, allocate a
886 * new transaction, and call xfs_dialloc() again, passing in the previous value
887 * of *IO_agbp. IO_agbp should be held across the transactions. Since the AGI
888 * buffer is locked across the two calls, the second call is guaranteed to have
889 * a free inode available.
891 * Once we successfully pick an inode its number is returned and the on-disk
892 * data structures are updated. The inode itself is not read in, since doing so
893 * would break ordering constraints with xfs_reclaim.
897 struct xfs_trans
*tp
,
901 struct xfs_buf
**IO_agbp
,
904 struct xfs_buf
*agbp
;
910 struct xfs_mount
*mp
;
911 xfs_agnumber_t tagno
;
912 struct xfs_perag
*pag
;
916 * If the caller passes in a pointer to the AGI buffer,
917 * continue where we left off before. In this case, we
918 * know that the allocation group has free inodes.
925 * We do not have an agbp, so select an initial allocation
926 * group for inode allocation.
928 agbp
= xfs_ialloc_ag_select(tp
, parent
, mode
, okalloc
);
931 * Couldn't find an allocation group satisfying the
938 agi
= XFS_BUF_TO_AGI(agbp
);
941 agno
= be32_to_cpu(agi
->agi_seqno
);
945 * If we have already hit the ceiling of inode blocks then clear
946 * okalloc so we scan all available agi structures for a free
950 if (mp
->m_maxicount
&&
951 mp
->m_sb
.sb_icount
+ XFS_IALLOC_INODES(mp
) > mp
->m_maxicount
) {
957 * Loop until we find an allocation group that either has free inodes
958 * or in which we can allocate some inodes. Iterate through the
959 * allocation groups upward, wrapping at the end.
961 while (!agi
->agi_freecount
) {
963 * Don't do anything if we're not supposed to allocate
964 * any blocks, just go on to the next ag.
968 * Try to allocate some new inodes in the allocation
971 if ((error
= xfs_ialloc_ag_alloc(tp
, agbp
, &ialloced
))) {
972 xfs_trans_brelse(tp
, agbp
);
973 if (error
== ENOSPC
) {
981 * We successfully allocated some inodes, return
982 * the current context to the caller so that it
983 * can commit the current transaction and call
984 * us again where we left off.
986 ASSERT(be32_to_cpu(agi
->agi_freecount
) > 0);
993 * If it failed, give up on this ag.
995 xfs_trans_brelse(tp
, agbp
);
997 * Go on to the next ag: get its ag header.
1000 if (++tagno
== mp
->m_sb
.sb_agcount
)
1002 if (tagno
== agno
) {
1004 return noroom
? ENOSPC
: 0;
1006 pag
= xfs_perag_get(mp
, tagno
);
1007 if (pag
->pagi_inodeok
== 0) {
1011 error
= xfs_ialloc_read_agi(mp
, tp
, tagno
, &agbp
);
1015 agi
= XFS_BUF_TO_AGI(agbp
);
1016 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1021 return xfs_dialloc_ag(tp
, agbp
, parent
, inop
);
1025 * Free disk inode. Carefully avoids touching the incore inode, all
1026 * manipulations incore are the caller's responsibility.
1027 * The on-disk inode is not changed by this operation, only the
1028 * btree (free inode mask) is changed.
1032 xfs_trans_t
*tp
, /* transaction pointer */
1033 xfs_ino_t inode
, /* inode to be freed */
1034 xfs_bmap_free_t
*flist
, /* extents to free */
1035 int *delete, /* set if inode cluster was deleted */
1036 xfs_ino_t
*first_ino
) /* first inode in deleted cluster */
1039 xfs_agblock_t agbno
; /* block number containing inode */
1040 xfs_buf_t
*agbp
; /* buffer containing allocation group header */
1041 xfs_agino_t agino
; /* inode number relative to allocation group */
1042 xfs_agnumber_t agno
; /* allocation group number */
1043 xfs_agi_t
*agi
; /* allocation group header */
1044 xfs_btree_cur_t
*cur
; /* inode btree cursor */
1045 int error
; /* error return value */
1046 int i
; /* result code */
1047 int ilen
; /* inodes in an inode cluster */
1048 xfs_mount_t
*mp
; /* mount structure for filesystem */
1049 int off
; /* offset of inode in inode chunk */
1050 xfs_inobt_rec_incore_t rec
; /* btree record */
1051 struct xfs_perag
*pag
;
1056 * Break up inode number into its components.
1058 agno
= XFS_INO_TO_AGNO(mp
, inode
);
1059 if (agno
>= mp
->m_sb
.sb_agcount
) {
1060 xfs_warn(mp
, "%s: agno >= mp->m_sb.sb_agcount (%d >= %d).",
1061 __func__
, agno
, mp
->m_sb
.sb_agcount
);
1063 return XFS_ERROR(EINVAL
);
1065 agino
= XFS_INO_TO_AGINO(mp
, inode
);
1066 if (inode
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1067 xfs_warn(mp
, "%s: inode != XFS_AGINO_TO_INO() (%llu != %llu).",
1068 __func__
, (unsigned long long)inode
,
1069 (unsigned long long)XFS_AGINO_TO_INO(mp
, agno
, agino
));
1071 return XFS_ERROR(EINVAL
);
1073 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1074 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1075 xfs_warn(mp
, "%s: agbno >= mp->m_sb.sb_agblocks (%d >= %d).",
1076 __func__
, agbno
, mp
->m_sb
.sb_agblocks
);
1078 return XFS_ERROR(EINVAL
);
1081 * Get the allocation group header.
1083 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1085 xfs_warn(mp
, "%s: xfs_ialloc_read_agi() returned error %d.",
1089 agi
= XFS_BUF_TO_AGI(agbp
);
1090 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1091 ASSERT(agbno
< be32_to_cpu(agi
->agi_length
));
1093 * Initialize the cursor.
1095 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1097 error
= xfs_check_agi_freecount(cur
, agi
);
1102 * Look for the entry describing this inode.
1104 if ((error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
))) {
1105 xfs_warn(mp
, "%s: xfs_inobt_lookup() returned error %d.",
1109 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1110 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1112 xfs_warn(mp
, "%s: xfs_inobt_get_rec() returned error %d.",
1116 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1118 * Get the offset in the inode chunk.
1120 off
= agino
- rec
.ir_startino
;
1121 ASSERT(off
>= 0 && off
< XFS_INODES_PER_CHUNK
);
1122 ASSERT(!(rec
.ir_free
& XFS_INOBT_MASK(off
)));
1124 * Mark the inode free & increment the count.
1126 rec
.ir_free
|= XFS_INOBT_MASK(off
);
1130 * When an inode cluster is free, it becomes eligible for removal
1132 if (!(mp
->m_flags
& XFS_MOUNT_IKEEP
) &&
1133 (rec
.ir_freecount
== XFS_IALLOC_INODES(mp
))) {
1136 *first_ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
);
1139 * Remove the inode cluster from the AGI B+Tree, adjust the
1140 * AGI and Superblock inode counts, and mark the disk space
1141 * to be freed when the transaction is committed.
1143 ilen
= XFS_IALLOC_INODES(mp
);
1144 be32_add_cpu(&agi
->agi_count
, -ilen
);
1145 be32_add_cpu(&agi
->agi_freecount
, -(ilen
- 1));
1146 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
);
1147 pag
= xfs_perag_get(mp
, agno
);
1148 pag
->pagi_freecount
-= ilen
- 1;
1150 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, -ilen
);
1151 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -(ilen
- 1));
1153 if ((error
= xfs_btree_delete(cur
, &i
))) {
1154 xfs_warn(mp
, "%s: xfs_btree_delete returned error %d.",
1159 xfs_bmap_add_free(XFS_AGB_TO_FSB(mp
,
1160 agno
, XFS_INO_TO_AGBNO(mp
,rec
.ir_startino
)),
1161 XFS_IALLOC_BLOCKS(mp
), flist
, mp
);
1165 error
= xfs_inobt_update(cur
, &rec
);
1167 xfs_warn(mp
, "%s: xfs_inobt_update returned error %d.",
1173 * Change the inode free counts and log the ag/sb changes.
1175 be32_add_cpu(&agi
->agi_freecount
, 1);
1176 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
1177 pag
= xfs_perag_get(mp
, agno
);
1178 pag
->pagi_freecount
++;
1180 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, 1);
1183 error
= xfs_check_agi_freecount(cur
, agi
);
1187 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1191 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
1197 struct xfs_mount
*mp
,
1198 struct xfs_trans
*tp
,
1199 xfs_agnumber_t agno
,
1201 xfs_agblock_t agbno
,
1202 xfs_agblock_t
*chunk_agbno
,
1203 xfs_agblock_t
*offset_agbno
,
1206 struct xfs_inobt_rec_incore rec
;
1207 struct xfs_btree_cur
*cur
;
1208 struct xfs_buf
*agbp
;
1212 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1215 "%s: xfs_ialloc_read_agi() returned error %d, agno %d",
1216 __func__
, error
, agno
);
1221 * Lookup the inode record for the given agino. If the record cannot be
1222 * found, then it's an invalid inode number and we should abort. Once
1223 * we have a record, we need to ensure it contains the inode number
1224 * we are looking up.
1226 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1227 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
);
1230 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1231 if (!error
&& i
== 0)
1235 xfs_trans_brelse(tp
, agbp
);
1236 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1240 /* check that the returned record contains the required inode */
1241 if (rec
.ir_startino
> agino
||
1242 rec
.ir_startino
+ XFS_IALLOC_INODES(mp
) <= agino
)
1245 /* for untrusted inodes check it is allocated first */
1246 if ((flags
& XFS_IGET_UNTRUSTED
) &&
1247 (rec
.ir_free
& XFS_INOBT_MASK(agino
- rec
.ir_startino
)))
1250 *chunk_agbno
= XFS_AGINO_TO_AGBNO(mp
, rec
.ir_startino
);
1251 *offset_agbno
= agbno
- *chunk_agbno
;
1256 * Return the location of the inode in imap, for mapping it into a buffer.
1260 xfs_mount_t
*mp
, /* file system mount structure */
1261 xfs_trans_t
*tp
, /* transaction pointer */
1262 xfs_ino_t ino
, /* inode to locate */
1263 struct xfs_imap
*imap
, /* location map structure */
1264 uint flags
) /* flags for inode btree lookup */
1266 xfs_agblock_t agbno
; /* block number of inode in the alloc group */
1267 xfs_agino_t agino
; /* inode number within alloc group */
1268 xfs_agnumber_t agno
; /* allocation group number */
1269 int blks_per_cluster
; /* num blocks per inode cluster */
1270 xfs_agblock_t chunk_agbno
; /* first block in inode chunk */
1271 xfs_agblock_t cluster_agbno
; /* first block in inode cluster */
1272 int error
; /* error code */
1273 int offset
; /* index of inode in its buffer */
1274 int offset_agbno
; /* blks from chunk start to inode */
1276 ASSERT(ino
!= NULLFSINO
);
1279 * Split up the inode number into its parts.
1281 agno
= XFS_INO_TO_AGNO(mp
, ino
);
1282 agino
= XFS_INO_TO_AGINO(mp
, ino
);
1283 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1284 if (agno
>= mp
->m_sb
.sb_agcount
|| agbno
>= mp
->m_sb
.sb_agblocks
||
1285 ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1288 * Don't output diagnostic information for untrusted inodes
1289 * as they can be invalid without implying corruption.
1291 if (flags
& XFS_IGET_UNTRUSTED
)
1292 return XFS_ERROR(EINVAL
);
1293 if (agno
>= mp
->m_sb
.sb_agcount
) {
1295 "%s: agno (%d) >= mp->m_sb.sb_agcount (%d)",
1296 __func__
, agno
, mp
->m_sb
.sb_agcount
);
1298 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1300 "%s: agbno (0x%llx) >= mp->m_sb.sb_agblocks (0x%lx)",
1301 __func__
, (unsigned long long)agbno
,
1302 (unsigned long)mp
->m_sb
.sb_agblocks
);
1304 if (ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1306 "%s: ino (0x%llx) != XFS_AGINO_TO_INO() (0x%llx)",
1308 XFS_AGINO_TO_INO(mp
, agno
, agino
));
1312 return XFS_ERROR(EINVAL
);
1315 blks_per_cluster
= XFS_INODE_CLUSTER_SIZE(mp
) >> mp
->m_sb
.sb_blocklog
;
1318 * For bulkstat and handle lookups, we have an untrusted inode number
1319 * that we have to verify is valid. We cannot do this just by reading
1320 * the inode buffer as it may have been unlinked and removed leaving
1321 * inodes in stale state on disk. Hence we have to do a btree lookup
1322 * in all cases where an untrusted inode number is passed.
1324 if (flags
& XFS_IGET_UNTRUSTED
) {
1325 error
= xfs_imap_lookup(mp
, tp
, agno
, agino
, agbno
,
1326 &chunk_agbno
, &offset_agbno
, flags
);
1333 * If the inode cluster size is the same as the blocksize or
1334 * smaller we get to the buffer by simple arithmetics.
1336 if (XFS_INODE_CLUSTER_SIZE(mp
) <= mp
->m_sb
.sb_blocksize
) {
1337 offset
= XFS_INO_TO_OFFSET(mp
, ino
);
1338 ASSERT(offset
< mp
->m_sb
.sb_inopblock
);
1340 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
);
1341 imap
->im_len
= XFS_FSB_TO_BB(mp
, 1);
1342 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1347 * If the inode chunks are aligned then use simple maths to
1348 * find the location. Otherwise we have to do a btree
1349 * lookup to find the location.
1351 if (mp
->m_inoalign_mask
) {
1352 offset_agbno
= agbno
& mp
->m_inoalign_mask
;
1353 chunk_agbno
= agbno
- offset_agbno
;
1355 error
= xfs_imap_lookup(mp
, tp
, agno
, agino
, agbno
,
1356 &chunk_agbno
, &offset_agbno
, flags
);
1362 ASSERT(agbno
>= chunk_agbno
);
1363 cluster_agbno
= chunk_agbno
+
1364 ((offset_agbno
/ blks_per_cluster
) * blks_per_cluster
);
1365 offset
= ((agbno
- cluster_agbno
) * mp
->m_sb
.sb_inopblock
) +
1366 XFS_INO_TO_OFFSET(mp
, ino
);
1368 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, cluster_agbno
);
1369 imap
->im_len
= XFS_FSB_TO_BB(mp
, blks_per_cluster
);
1370 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1373 * If the inode number maps to a block outside the bounds
1374 * of the file system then return NULL rather than calling
1375 * read_buf and panicing when we get an error from the
1378 if ((imap
->im_blkno
+ imap
->im_len
) >
1379 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
)) {
1381 "%s: (im_blkno (0x%llx) + im_len (0x%llx)) > sb_dblocks (0x%llx)",
1382 __func__
, (unsigned long long) imap
->im_blkno
,
1383 (unsigned long long) imap
->im_len
,
1384 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
));
1385 return XFS_ERROR(EINVAL
);
1391 * Compute and fill in value of m_in_maxlevels.
1394 xfs_ialloc_compute_maxlevels(
1395 xfs_mount_t
*mp
) /* file system mount structure */
1403 maxleafents
= (1LL << XFS_INO_AGINO_BITS(mp
)) >>
1404 XFS_INODES_PER_CHUNK_LOG
;
1405 minleafrecs
= mp
->m_alloc_mnr
[0];
1406 minnoderecs
= mp
->m_alloc_mnr
[1];
1407 maxblocks
= (maxleafents
+ minleafrecs
- 1) / minleafrecs
;
1408 for (level
= 1; maxblocks
> 1; level
++)
1409 maxblocks
= (maxblocks
+ minnoderecs
- 1) / minnoderecs
;
1410 mp
->m_in_maxlevels
= level
;
1414 * Log specified fields for the ag hdr (inode section)
1418 xfs_trans_t
*tp
, /* transaction pointer */
1419 xfs_buf_t
*bp
, /* allocation group header buffer */
1420 int fields
) /* bitmask of fields to log */
1422 int first
; /* first byte number */
1423 int last
; /* last byte number */
1424 static const short offsets
[] = { /* field starting offsets */
1425 /* keep in sync with bit definitions */
1426 offsetof(xfs_agi_t
, agi_magicnum
),
1427 offsetof(xfs_agi_t
, agi_versionnum
),
1428 offsetof(xfs_agi_t
, agi_seqno
),
1429 offsetof(xfs_agi_t
, agi_length
),
1430 offsetof(xfs_agi_t
, agi_count
),
1431 offsetof(xfs_agi_t
, agi_root
),
1432 offsetof(xfs_agi_t
, agi_level
),
1433 offsetof(xfs_agi_t
, agi_freecount
),
1434 offsetof(xfs_agi_t
, agi_newino
),
1435 offsetof(xfs_agi_t
, agi_dirino
),
1436 offsetof(xfs_agi_t
, agi_unlinked
),
1440 xfs_agi_t
*agi
; /* allocation group header */
1442 agi
= XFS_BUF_TO_AGI(bp
);
1443 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1446 * Compute byte offsets for the first and last fields.
1448 xfs_btree_offsets(fields
, offsets
, XFS_AGI_NUM_BITS
, &first
, &last
);
1450 * Log the allocation group inode header buffer.
1452 xfs_trans_log_buf(tp
, bp
, first
, last
);
1457 xfs_check_agi_unlinked(
1458 struct xfs_agi
*agi
)
1462 for (i
= 0; i
< XFS_AGI_UNLINKED_BUCKETS
; i
++)
1463 ASSERT(agi
->agi_unlinked
[i
]);
1466 #define xfs_check_agi_unlinked(agi)
1470 * Read in the allocation group header (inode allocation section)
1474 struct xfs_mount
*mp
, /* file system mount structure */
1475 struct xfs_trans
*tp
, /* transaction pointer */
1476 xfs_agnumber_t agno
, /* allocation group number */
1477 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1479 struct xfs_agi
*agi
; /* allocation group header */
1480 int agi_ok
; /* agi is consistent */
1483 ASSERT(agno
!= NULLAGNUMBER
);
1485 error
= xfs_trans_read_buf(mp
, tp
, mp
->m_ddev_targp
,
1486 XFS_AG_DADDR(mp
, agno
, XFS_AGI_DADDR(mp
)),
1487 XFS_FSS_TO_BB(mp
, 1), 0, bpp
);
1491 ASSERT(!xfs_buf_geterror(*bpp
));
1492 agi
= XFS_BUF_TO_AGI(*bpp
);
1495 * Validate the magic number of the agi block.
1497 agi_ok
= agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
) &&
1498 XFS_AGI_GOOD_VERSION(be32_to_cpu(agi
->agi_versionnum
)) &&
1499 be32_to_cpu(agi
->agi_seqno
) == agno
;
1500 if (unlikely(XFS_TEST_ERROR(!agi_ok
, mp
, XFS_ERRTAG_IALLOC_READ_AGI
,
1501 XFS_RANDOM_IALLOC_READ_AGI
))) {
1502 XFS_CORRUPTION_ERROR("xfs_read_agi", XFS_ERRLEVEL_LOW
,
1504 xfs_trans_brelse(tp
, *bpp
);
1505 return XFS_ERROR(EFSCORRUPTED
);
1508 xfs_buf_set_ref(*bpp
, XFS_AGI_REF
);
1510 xfs_check_agi_unlinked(agi
);
1515 xfs_ialloc_read_agi(
1516 struct xfs_mount
*mp
, /* file system mount structure */
1517 struct xfs_trans
*tp
, /* transaction pointer */
1518 xfs_agnumber_t agno
, /* allocation group number */
1519 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1521 struct xfs_agi
*agi
; /* allocation group header */
1522 struct xfs_perag
*pag
; /* per allocation group data */
1525 error
= xfs_read_agi(mp
, tp
, agno
, bpp
);
1529 agi
= XFS_BUF_TO_AGI(*bpp
);
1530 pag
= xfs_perag_get(mp
, agno
);
1531 if (!pag
->pagi_init
) {
1532 pag
->pagi_freecount
= be32_to_cpu(agi
->agi_freecount
);
1533 pag
->pagi_count
= be32_to_cpu(agi
->agi_count
);
1538 * It's possible for these to be out of sync if
1539 * we are in the middle of a forced shutdown.
1541 ASSERT(pag
->pagi_freecount
== be32_to_cpu(agi
->agi_freecount
) ||
1542 XFS_FORCED_SHUTDOWN(mp
));
1548 * Read in the agi to initialise the per-ag data in the mount structure
1551 xfs_ialloc_pagi_init(
1552 xfs_mount_t
*mp
, /* file system mount structure */
1553 xfs_trans_t
*tp
, /* transaction pointer */
1554 xfs_agnumber_t agno
) /* allocation group number */
1556 xfs_buf_t
*bp
= NULL
;
1559 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &bp
);
1563 xfs_trans_brelse(tp
, bp
);