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 fbuf
->b_ops
= &xfs_inode_buf_ops
;
214 xfs_buf_zero(fbuf
, 0, ninodes
<< mp
->m_sb
.sb_inodelog
);
215 for (i
= 0; i
< ninodes
; i
++) {
216 int ioffset
= i
<< mp
->m_sb
.sb_inodelog
;
217 uint isize
= sizeof(struct xfs_dinode
);
219 free
= xfs_make_iptr(mp
, fbuf
, i
);
220 free
->di_magic
= cpu_to_be16(XFS_DINODE_MAGIC
);
221 free
->di_version
= version
;
222 free
->di_gen
= cpu_to_be32(gen
);
223 free
->di_next_unlinked
= cpu_to_be32(NULLAGINO
);
224 xfs_trans_log_buf(tp
, fbuf
, ioffset
, ioffset
+ isize
- 1);
226 xfs_trans_inode_alloc_buf(tp
, fbuf
);
232 * Allocate new inodes in the allocation group specified by agbp.
233 * Return 0 for success, else error code.
235 STATIC
int /* error code or 0 */
237 xfs_trans_t
*tp
, /* transaction pointer */
238 xfs_buf_t
*agbp
, /* alloc group buffer */
241 xfs_agi_t
*agi
; /* allocation group header */
242 xfs_alloc_arg_t args
; /* allocation argument structure */
243 xfs_btree_cur_t
*cur
; /* inode btree cursor */
247 xfs_agino_t newino
; /* new first inode's number */
248 xfs_agino_t newlen
; /* new number of inodes */
249 xfs_agino_t thisino
; /* current inode number, for loop */
250 int isaligned
= 0; /* inode allocation at stripe unit */
252 struct xfs_perag
*pag
;
254 memset(&args
, 0, sizeof(args
));
256 args
.mp
= tp
->t_mountp
;
259 * Locking will ensure that we don't have two callers in here
262 newlen
= XFS_IALLOC_INODES(args
.mp
);
263 if (args
.mp
->m_maxicount
&&
264 args
.mp
->m_sb
.sb_icount
+ newlen
> args
.mp
->m_maxicount
)
265 return XFS_ERROR(ENOSPC
);
266 args
.minlen
= args
.maxlen
= XFS_IALLOC_BLOCKS(args
.mp
);
268 * First try to allocate inodes contiguous with the last-allocated
269 * chunk of inodes. If the filesystem is striped, this will fill
270 * an entire stripe unit with inodes.
272 agi
= XFS_BUF_TO_AGI(agbp
);
273 newino
= be32_to_cpu(agi
->agi_newino
);
274 agno
= be32_to_cpu(agi
->agi_seqno
);
275 args
.agbno
= XFS_AGINO_TO_AGBNO(args
.mp
, newino
) +
276 XFS_IALLOC_BLOCKS(args
.mp
);
277 if (likely(newino
!= NULLAGINO
&&
278 (args
.agbno
< be32_to_cpu(agi
->agi_length
)))) {
279 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
280 args
.type
= XFS_ALLOCTYPE_THIS_BNO
;
281 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
282 args
.userdata
= args
.minalignslop
= 0;
286 * We need to take into account alignment here to ensure that
287 * we don't modify the free list if we fail to have an exact
288 * block. If we don't have an exact match, and every oher
289 * attempt allocation attempt fails, we'll end up cancelling
290 * a dirty transaction and shutting down.
292 * For an exact allocation, alignment must be 1,
293 * however we need to take cluster alignment into account when
294 * fixing up the freelist. Use the minalignslop field to
295 * indicate that extra blocks might be required for alignment,
296 * but not to use them in the actual exact allocation.
299 args
.minalignslop
= xfs_ialloc_cluster_alignment(&args
) - 1;
301 /* Allow space for the inode btree to split. */
302 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
303 if ((error
= xfs_alloc_vextent(&args
)))
306 args
.fsbno
= NULLFSBLOCK
;
308 if (unlikely(args
.fsbno
== NULLFSBLOCK
)) {
310 * Set the alignment for the allocation.
311 * If stripe alignment is turned on then align at stripe unit
313 * If the cluster size is smaller than a filesystem block
314 * then we're doing I/O for inodes in filesystem block size
315 * pieces, so don't need alignment anyway.
318 if (args
.mp
->m_sinoalign
) {
319 ASSERT(!(args
.mp
->m_flags
& XFS_MOUNT_NOALIGN
));
320 args
.alignment
= args
.mp
->m_dalign
;
323 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
325 * Need to figure out where to allocate the inode blocks.
326 * Ideally they should be spaced out through the a.g.
327 * For now, just allocate blocks up front.
329 args
.agbno
= be32_to_cpu(agi
->agi_root
);
330 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
332 * Allocate a fixed-size extent of inodes.
334 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
335 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
336 args
.userdata
= args
.minalignslop
= 0;
339 * Allow space for the inode btree to split.
341 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
342 if ((error
= xfs_alloc_vextent(&args
)))
347 * If stripe alignment is turned on, then try again with cluster
350 if (isaligned
&& args
.fsbno
== NULLFSBLOCK
) {
351 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
352 args
.agbno
= be32_to_cpu(agi
->agi_root
);
353 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
354 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
355 if ((error
= xfs_alloc_vextent(&args
)))
359 if (args
.fsbno
== NULLFSBLOCK
) {
363 ASSERT(args
.len
== args
.minlen
);
366 * Stamp and write the inode buffers.
368 * Seed the new inode cluster with a random generation number. This
369 * prevents short-term reuse of generation numbers if a chunk is
370 * freed and then immediately reallocated. We use random numbers
371 * rather than a linear progression to prevent the next generation
372 * number from being easily guessable.
374 error
= xfs_ialloc_inode_init(args
.mp
, tp
, agno
, args
.agbno
,
375 args
.len
, random32());
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 pag
= xfs_perag_get(args
.mp
, agno
);
386 pag
->pagi_freecount
+= newlen
;
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 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_agnumber_t
448 xfs_ialloc_ag_select(
449 xfs_trans_t
*tp
, /* transaction pointer */
450 xfs_ino_t parent
, /* parent directory inode number */
451 umode_t mode
, /* bits set to indicate file type */
452 int okalloc
) /* ok to allocate more space */
454 xfs_agnumber_t agcount
; /* number of ag's in the filesystem */
455 xfs_agnumber_t agno
; /* current ag number */
456 int flags
; /* alloc buffer locking flags */
457 xfs_extlen_t ineed
; /* blocks needed for inode allocation */
458 xfs_extlen_t longest
= 0; /* longest extent available */
459 xfs_mount_t
*mp
; /* mount point structure */
460 int needspace
; /* file mode implies space allocated */
461 xfs_perag_t
*pag
; /* per allocation group data */
462 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
)
480 ASSERT(pagno
< agcount
);
483 * Loop through allocation groups, looking for one with a little
484 * free space in it. Note we don't look for free inodes, exactly.
485 * Instead, we include whether there is a need to allocate inodes
486 * to mean that blocks must be allocated for them,
487 * if none are currently free.
490 flags
= XFS_ALLOC_FLAG_TRYLOCK
;
492 pag
= xfs_perag_get(mp
, agno
);
493 if (!pag
->pagi_inodeok
) {
494 xfs_ialloc_next_ag(mp
);
498 if (!pag
->pagi_init
) {
499 error
= xfs_ialloc_pagi_init(mp
, tp
, agno
);
504 if (pag
->pagi_freecount
) {
512 if (!pag
->pagf_init
) {
513 error
= xfs_alloc_pagf_init(mp
, tp
, agno
, flags
);
519 * Is there enough free space for the file plus a block of
520 * inodes? (if we need to allocate some)?
522 ineed
= XFS_IALLOC_BLOCKS(mp
);
523 longest
= pag
->pagf_longest
;
525 longest
= pag
->pagf_flcount
> 0;
527 if (pag
->pagf_freeblks
>= needspace
+ ineed
&&
535 * No point in iterating over the rest, if we're shutting
538 if (XFS_FORCED_SHUTDOWN(mp
))
552 * Try to retrieve the next record to the left/right from the current one.
556 struct xfs_btree_cur
*cur
,
557 xfs_inobt_rec_incore_t
*rec
,
565 error
= xfs_btree_decrement(cur
, 0, &i
);
567 error
= xfs_btree_increment(cur
, 0, &i
);
573 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
576 XFS_WANT_CORRUPTED_RETURN(i
== 1);
584 struct xfs_btree_cur
*cur
,
586 xfs_inobt_rec_incore_t
*rec
,
593 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_EQ
, &i
);
598 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
601 XFS_WANT_CORRUPTED_RETURN(i
== 1);
610 * The caller selected an AG for us, and made sure that free inodes are
615 struct xfs_trans
*tp
,
616 struct xfs_buf
*agbp
,
620 struct xfs_mount
*mp
= tp
->t_mountp
;
621 struct xfs_agi
*agi
= XFS_BUF_TO_AGI(agbp
);
622 xfs_agnumber_t agno
= be32_to_cpu(agi
->agi_seqno
);
623 xfs_agnumber_t pagno
= XFS_INO_TO_AGNO(mp
, parent
);
624 xfs_agino_t pagino
= XFS_INO_TO_AGINO(mp
, parent
);
625 struct xfs_perag
*pag
;
626 struct xfs_btree_cur
*cur
, *tcur
;
627 struct xfs_inobt_rec_incore rec
, trec
;
633 pag
= xfs_perag_get(mp
, agno
);
635 ASSERT(pag
->pagi_init
);
636 ASSERT(pag
->pagi_inodeok
);
637 ASSERT(pag
->pagi_freecount
> 0);
640 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
642 * If pagino is 0 (this is the root inode allocation) use newino.
643 * This must work because we've just allocated some.
646 pagino
= be32_to_cpu(agi
->agi_newino
);
648 error
= xfs_check_agi_freecount(cur
, agi
);
653 * If in the same AG as the parent, try to get near the parent.
656 int doneleft
; /* done, to the left */
657 int doneright
; /* done, to the right */
658 int searchdistance
= 10;
660 error
= xfs_inobt_lookup(cur
, pagino
, XFS_LOOKUP_LE
, &i
);
663 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
665 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
668 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
670 if (rec
.ir_freecount
> 0) {
672 * Found a free inode in the same chunk
673 * as the parent, done.
680 * In the same AG as parent, but parent's chunk is full.
683 /* duplicate the cursor, search left & right simultaneously */
684 error
= xfs_btree_dup_cursor(cur
, &tcur
);
689 * Skip to last blocks looked up if same parent inode.
691 if (pagino
!= NULLAGINO
&&
692 pag
->pagl_pagino
== pagino
&&
693 pag
->pagl_leftrec
!= NULLAGINO
&&
694 pag
->pagl_rightrec
!= NULLAGINO
) {
695 error
= xfs_ialloc_get_rec(tcur
, pag
->pagl_leftrec
,
696 &trec
, &doneleft
, 1);
700 error
= xfs_ialloc_get_rec(cur
, pag
->pagl_rightrec
,
701 &rec
, &doneright
, 0);
705 /* search left with tcur, back up 1 record */
706 error
= xfs_ialloc_next_rec(tcur
, &trec
, &doneleft
, 1);
710 /* search right with cur, go forward 1 record. */
711 error
= xfs_ialloc_next_rec(cur
, &rec
, &doneright
, 0);
717 * Loop until we find an inode chunk with a free inode.
719 while (!doneleft
|| !doneright
) {
720 int useleft
; /* using left inode chunk this time */
722 if (!--searchdistance
) {
724 * Not in range - save last search
725 * location and allocate a new inode
727 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
728 pag
->pagl_leftrec
= trec
.ir_startino
;
729 pag
->pagl_rightrec
= rec
.ir_startino
;
730 pag
->pagl_pagino
= pagino
;
734 /* figure out the closer block if both are valid. */
735 if (!doneleft
&& !doneright
) {
737 (trec
.ir_startino
+ XFS_INODES_PER_CHUNK
- 1) <
738 rec
.ir_startino
- pagino
;
743 /* free inodes to the left? */
744 if (useleft
&& trec
.ir_freecount
) {
746 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
749 pag
->pagl_leftrec
= trec
.ir_startino
;
750 pag
->pagl_rightrec
= rec
.ir_startino
;
751 pag
->pagl_pagino
= pagino
;
755 /* free inodes to the right? */
756 if (!useleft
&& rec
.ir_freecount
) {
757 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
759 pag
->pagl_leftrec
= trec
.ir_startino
;
760 pag
->pagl_rightrec
= rec
.ir_startino
;
761 pag
->pagl_pagino
= pagino
;
765 /* get next record to check */
767 error
= xfs_ialloc_next_rec(tcur
, &trec
,
770 error
= xfs_ialloc_next_rec(cur
, &rec
,
778 * We've reached the end of the btree. because
779 * we are only searching a small chunk of the
780 * btree each search, there is obviously free
781 * inodes closer to the parent inode than we
782 * are now. restart the search again.
784 pag
->pagl_pagino
= NULLAGINO
;
785 pag
->pagl_leftrec
= NULLAGINO
;
786 pag
->pagl_rightrec
= NULLAGINO
;
787 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
788 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
793 * In a different AG from the parent.
794 * See if the most recently allocated block has any free.
797 if (agi
->agi_newino
!= cpu_to_be32(NULLAGINO
)) {
798 error
= xfs_inobt_lookup(cur
, be32_to_cpu(agi
->agi_newino
),
804 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
808 if (j
== 1 && rec
.ir_freecount
> 0) {
810 * The last chunk allocated in the group
811 * still has a free inode.
819 * None left in the last group, search the whole AG
821 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &i
);
824 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
827 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
830 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
831 if (rec
.ir_freecount
> 0)
833 error
= xfs_btree_increment(cur
, 0, &i
);
836 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
840 offset
= xfs_lowbit64(rec
.ir_free
);
842 ASSERT(offset
< XFS_INODES_PER_CHUNK
);
843 ASSERT((XFS_AGINO_TO_OFFSET(mp
, rec
.ir_startino
) %
844 XFS_INODES_PER_CHUNK
) == 0);
845 ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
+ offset
);
846 rec
.ir_free
&= ~XFS_INOBT_MASK(offset
);
848 error
= xfs_inobt_update(cur
, &rec
);
851 be32_add_cpu(&agi
->agi_freecount
, -1);
852 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
853 pag
->pagi_freecount
--;
855 error
= xfs_check_agi_freecount(cur
, agi
);
859 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
860 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -1);
865 xfs_btree_del_cursor(tcur
, XFS_BTREE_ERROR
);
867 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
873 * Allocate an inode on disk.
875 * Mode is used to tell whether the new inode will need space, and whether it
878 * This function is designed to be called twice if it has to do an allocation
879 * to make more free inodes. On the first call, *IO_agbp should be set to NULL.
880 * If an inode is available without having to performn an allocation, an inode
881 * number is returned. In this case, *IO_agbp is set to NULL. If an allocation
882 * needs to be done, xfs_dialloc returns the current AGI buffer in *IO_agbp.
883 * The caller should then commit the current transaction, allocate a
884 * new transaction, and call xfs_dialloc() again, passing in the previous value
885 * of *IO_agbp. IO_agbp should be held across the transactions. Since the AGI
886 * buffer is locked across the two calls, the second call is guaranteed to have
887 * a free inode available.
889 * Once we successfully pick an inode its number is returned and the on-disk
890 * data structures are updated. The inode itself is not read in, since doing so
891 * would break ordering constraints with xfs_reclaim.
895 struct xfs_trans
*tp
,
899 struct xfs_buf
**IO_agbp
,
902 struct xfs_mount
*mp
= tp
->t_mountp
;
903 struct xfs_buf
*agbp
;
908 xfs_agnumber_t start_agno
;
909 struct xfs_perag
*pag
;
913 * If the caller passes in a pointer to the AGI buffer,
914 * continue where we left off before. In this case, we
915 * know that the allocation group has free inodes.
922 * We do not have an agbp, so select an initial allocation
923 * group for inode allocation.
925 start_agno
= xfs_ialloc_ag_select(tp
, parent
, mode
, okalloc
);
926 if (start_agno
== NULLAGNUMBER
) {
932 * If we have already hit the ceiling of inode blocks then clear
933 * okalloc so we scan all available agi structures for a free
936 if (mp
->m_maxicount
&&
937 mp
->m_sb
.sb_icount
+ XFS_IALLOC_INODES(mp
) > mp
->m_maxicount
) {
943 * Loop until we find an allocation group that either has free inodes
944 * or in which we can allocate some inodes. Iterate through the
945 * allocation groups upward, wrapping at the end.
949 pag
= xfs_perag_get(mp
, agno
);
950 if (!pag
->pagi_inodeok
) {
951 xfs_ialloc_next_ag(mp
);
955 if (!pag
->pagi_init
) {
956 error
= xfs_ialloc_pagi_init(mp
, tp
, agno
);
962 * Do a first racy fast path check if this AG is usable.
964 if (!pag
->pagi_freecount
&& !okalloc
)
968 * Then read in the AGI buffer and recheck with the AGI buffer
971 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
975 if (pag
->pagi_freecount
) {
981 goto nextag_relse_buffer
;
984 error
= xfs_ialloc_ag_alloc(tp
, agbp
, &ialloced
);
986 xfs_trans_brelse(tp
, agbp
);
998 * We successfully allocated some inodes, return
999 * the current context to the caller so that it
1000 * can commit the current transaction and call
1001 * us again where we left off.
1003 ASSERT(pag
->pagi_freecount
> 0);
1011 nextag_relse_buffer
:
1012 xfs_trans_brelse(tp
, agbp
);
1015 if (++agno
== mp
->m_sb
.sb_agcount
)
1017 if (agno
== start_agno
) {
1019 return noroom
? ENOSPC
: 0;
1025 return xfs_dialloc_ag(tp
, agbp
, parent
, inop
);
1028 return XFS_ERROR(error
);
1032 * Free disk inode. Carefully avoids touching the incore inode, all
1033 * manipulations incore are the caller's responsibility.
1034 * The on-disk inode is not changed by this operation, only the
1035 * btree (free inode mask) is changed.
1039 xfs_trans_t
*tp
, /* transaction pointer */
1040 xfs_ino_t inode
, /* inode to be freed */
1041 xfs_bmap_free_t
*flist
, /* extents to free */
1042 int *delete, /* set if inode cluster was deleted */
1043 xfs_ino_t
*first_ino
) /* first inode in deleted cluster */
1046 xfs_agblock_t agbno
; /* block number containing inode */
1047 xfs_buf_t
*agbp
; /* buffer containing allocation group header */
1048 xfs_agino_t agino
; /* inode number relative to allocation group */
1049 xfs_agnumber_t agno
; /* allocation group number */
1050 xfs_agi_t
*agi
; /* allocation group header */
1051 xfs_btree_cur_t
*cur
; /* inode btree cursor */
1052 int error
; /* error return value */
1053 int i
; /* result code */
1054 int ilen
; /* inodes in an inode cluster */
1055 xfs_mount_t
*mp
; /* mount structure for filesystem */
1056 int off
; /* offset of inode in inode chunk */
1057 xfs_inobt_rec_incore_t rec
; /* btree record */
1058 struct xfs_perag
*pag
;
1063 * Break up inode number into its components.
1065 agno
= XFS_INO_TO_AGNO(mp
, inode
);
1066 if (agno
>= mp
->m_sb
.sb_agcount
) {
1067 xfs_warn(mp
, "%s: agno >= mp->m_sb.sb_agcount (%d >= %d).",
1068 __func__
, agno
, mp
->m_sb
.sb_agcount
);
1070 return XFS_ERROR(EINVAL
);
1072 agino
= XFS_INO_TO_AGINO(mp
, inode
);
1073 if (inode
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1074 xfs_warn(mp
, "%s: inode != XFS_AGINO_TO_INO() (%llu != %llu).",
1075 __func__
, (unsigned long long)inode
,
1076 (unsigned long long)XFS_AGINO_TO_INO(mp
, agno
, agino
));
1078 return XFS_ERROR(EINVAL
);
1080 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1081 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1082 xfs_warn(mp
, "%s: agbno >= mp->m_sb.sb_agblocks (%d >= %d).",
1083 __func__
, agbno
, mp
->m_sb
.sb_agblocks
);
1085 return XFS_ERROR(EINVAL
);
1088 * Get the allocation group header.
1090 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1092 xfs_warn(mp
, "%s: xfs_ialloc_read_agi() returned error %d.",
1096 agi
= XFS_BUF_TO_AGI(agbp
);
1097 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1098 ASSERT(agbno
< be32_to_cpu(agi
->agi_length
));
1100 * Initialize the cursor.
1102 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1104 error
= xfs_check_agi_freecount(cur
, agi
);
1109 * Look for the entry describing this inode.
1111 if ((error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
))) {
1112 xfs_warn(mp
, "%s: xfs_inobt_lookup() returned error %d.",
1116 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1117 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1119 xfs_warn(mp
, "%s: xfs_inobt_get_rec() returned error %d.",
1123 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1125 * Get the offset in the inode chunk.
1127 off
= agino
- rec
.ir_startino
;
1128 ASSERT(off
>= 0 && off
< XFS_INODES_PER_CHUNK
);
1129 ASSERT(!(rec
.ir_free
& XFS_INOBT_MASK(off
)));
1131 * Mark the inode free & increment the count.
1133 rec
.ir_free
|= XFS_INOBT_MASK(off
);
1137 * When an inode cluster is free, it becomes eligible for removal
1139 if (!(mp
->m_flags
& XFS_MOUNT_IKEEP
) &&
1140 (rec
.ir_freecount
== XFS_IALLOC_INODES(mp
))) {
1143 *first_ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
);
1146 * Remove the inode cluster from the AGI B+Tree, adjust the
1147 * AGI and Superblock inode counts, and mark the disk space
1148 * to be freed when the transaction is committed.
1150 ilen
= XFS_IALLOC_INODES(mp
);
1151 be32_add_cpu(&agi
->agi_count
, -ilen
);
1152 be32_add_cpu(&agi
->agi_freecount
, -(ilen
- 1));
1153 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
);
1154 pag
= xfs_perag_get(mp
, agno
);
1155 pag
->pagi_freecount
-= ilen
- 1;
1157 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, -ilen
);
1158 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -(ilen
- 1));
1160 if ((error
= xfs_btree_delete(cur
, &i
))) {
1161 xfs_warn(mp
, "%s: xfs_btree_delete returned error %d.",
1166 xfs_bmap_add_free(XFS_AGB_TO_FSB(mp
,
1167 agno
, XFS_INO_TO_AGBNO(mp
,rec
.ir_startino
)),
1168 XFS_IALLOC_BLOCKS(mp
), flist
, mp
);
1172 error
= xfs_inobt_update(cur
, &rec
);
1174 xfs_warn(mp
, "%s: xfs_inobt_update returned error %d.",
1180 * Change the inode free counts and log the ag/sb changes.
1182 be32_add_cpu(&agi
->agi_freecount
, 1);
1183 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
1184 pag
= xfs_perag_get(mp
, agno
);
1185 pag
->pagi_freecount
++;
1187 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, 1);
1190 error
= xfs_check_agi_freecount(cur
, agi
);
1194 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1198 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
1204 struct xfs_mount
*mp
,
1205 struct xfs_trans
*tp
,
1206 xfs_agnumber_t agno
,
1208 xfs_agblock_t agbno
,
1209 xfs_agblock_t
*chunk_agbno
,
1210 xfs_agblock_t
*offset_agbno
,
1213 struct xfs_inobt_rec_incore rec
;
1214 struct xfs_btree_cur
*cur
;
1215 struct xfs_buf
*agbp
;
1219 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1222 "%s: xfs_ialloc_read_agi() returned error %d, agno %d",
1223 __func__
, error
, agno
);
1228 * Lookup the inode record for the given agino. If the record cannot be
1229 * found, then it's an invalid inode number and we should abort. Once
1230 * we have a record, we need to ensure it contains the inode number
1231 * we are looking up.
1233 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1234 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
);
1237 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1238 if (!error
&& i
== 0)
1242 xfs_trans_brelse(tp
, agbp
);
1243 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1247 /* check that the returned record contains the required inode */
1248 if (rec
.ir_startino
> agino
||
1249 rec
.ir_startino
+ XFS_IALLOC_INODES(mp
) <= agino
)
1252 /* for untrusted inodes check it is allocated first */
1253 if ((flags
& XFS_IGET_UNTRUSTED
) &&
1254 (rec
.ir_free
& XFS_INOBT_MASK(agino
- rec
.ir_startino
)))
1257 *chunk_agbno
= XFS_AGINO_TO_AGBNO(mp
, rec
.ir_startino
);
1258 *offset_agbno
= agbno
- *chunk_agbno
;
1263 * Return the location of the inode in imap, for mapping it into a buffer.
1267 xfs_mount_t
*mp
, /* file system mount structure */
1268 xfs_trans_t
*tp
, /* transaction pointer */
1269 xfs_ino_t ino
, /* inode to locate */
1270 struct xfs_imap
*imap
, /* location map structure */
1271 uint flags
) /* flags for inode btree lookup */
1273 xfs_agblock_t agbno
; /* block number of inode in the alloc group */
1274 xfs_agino_t agino
; /* inode number within alloc group */
1275 xfs_agnumber_t agno
; /* allocation group number */
1276 int blks_per_cluster
; /* num blocks per inode cluster */
1277 xfs_agblock_t chunk_agbno
; /* first block in inode chunk */
1278 xfs_agblock_t cluster_agbno
; /* first block in inode cluster */
1279 int error
; /* error code */
1280 int offset
; /* index of inode in its buffer */
1281 int offset_agbno
; /* blks from chunk start to inode */
1283 ASSERT(ino
!= NULLFSINO
);
1286 * Split up the inode number into its parts.
1288 agno
= XFS_INO_TO_AGNO(mp
, ino
);
1289 agino
= XFS_INO_TO_AGINO(mp
, ino
);
1290 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1291 if (agno
>= mp
->m_sb
.sb_agcount
|| agbno
>= mp
->m_sb
.sb_agblocks
||
1292 ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1295 * Don't output diagnostic information for untrusted inodes
1296 * as they can be invalid without implying corruption.
1298 if (flags
& XFS_IGET_UNTRUSTED
)
1299 return XFS_ERROR(EINVAL
);
1300 if (agno
>= mp
->m_sb
.sb_agcount
) {
1302 "%s: agno (%d) >= mp->m_sb.sb_agcount (%d)",
1303 __func__
, agno
, mp
->m_sb
.sb_agcount
);
1305 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1307 "%s: agbno (0x%llx) >= mp->m_sb.sb_agblocks (0x%lx)",
1308 __func__
, (unsigned long long)agbno
,
1309 (unsigned long)mp
->m_sb
.sb_agblocks
);
1311 if (ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1313 "%s: ino (0x%llx) != XFS_AGINO_TO_INO() (0x%llx)",
1315 XFS_AGINO_TO_INO(mp
, agno
, agino
));
1319 return XFS_ERROR(EINVAL
);
1322 blks_per_cluster
= XFS_INODE_CLUSTER_SIZE(mp
) >> mp
->m_sb
.sb_blocklog
;
1325 * For bulkstat and handle lookups, we have an untrusted inode number
1326 * that we have to verify is valid. We cannot do this just by reading
1327 * the inode buffer as it may have been unlinked and removed leaving
1328 * inodes in stale state on disk. Hence we have to do a btree lookup
1329 * in all cases where an untrusted inode number is passed.
1331 if (flags
& XFS_IGET_UNTRUSTED
) {
1332 error
= xfs_imap_lookup(mp
, tp
, agno
, agino
, agbno
,
1333 &chunk_agbno
, &offset_agbno
, flags
);
1340 * If the inode cluster size is the same as the blocksize or
1341 * smaller we get to the buffer by simple arithmetics.
1343 if (XFS_INODE_CLUSTER_SIZE(mp
) <= mp
->m_sb
.sb_blocksize
) {
1344 offset
= XFS_INO_TO_OFFSET(mp
, ino
);
1345 ASSERT(offset
< mp
->m_sb
.sb_inopblock
);
1347 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
);
1348 imap
->im_len
= XFS_FSB_TO_BB(mp
, 1);
1349 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1354 * If the inode chunks are aligned then use simple maths to
1355 * find the location. Otherwise we have to do a btree
1356 * lookup to find the location.
1358 if (mp
->m_inoalign_mask
) {
1359 offset_agbno
= agbno
& mp
->m_inoalign_mask
;
1360 chunk_agbno
= agbno
- offset_agbno
;
1362 error
= xfs_imap_lookup(mp
, tp
, agno
, agino
, agbno
,
1363 &chunk_agbno
, &offset_agbno
, flags
);
1369 ASSERT(agbno
>= chunk_agbno
);
1370 cluster_agbno
= chunk_agbno
+
1371 ((offset_agbno
/ blks_per_cluster
) * blks_per_cluster
);
1372 offset
= ((agbno
- cluster_agbno
) * mp
->m_sb
.sb_inopblock
) +
1373 XFS_INO_TO_OFFSET(mp
, ino
);
1375 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, cluster_agbno
);
1376 imap
->im_len
= XFS_FSB_TO_BB(mp
, blks_per_cluster
);
1377 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1380 * If the inode number maps to a block outside the bounds
1381 * of the file system then return NULL rather than calling
1382 * read_buf and panicing when we get an error from the
1385 if ((imap
->im_blkno
+ imap
->im_len
) >
1386 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
)) {
1388 "%s: (im_blkno (0x%llx) + im_len (0x%llx)) > sb_dblocks (0x%llx)",
1389 __func__
, (unsigned long long) imap
->im_blkno
,
1390 (unsigned long long) imap
->im_len
,
1391 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
));
1392 return XFS_ERROR(EINVAL
);
1398 * Compute and fill in value of m_in_maxlevels.
1401 xfs_ialloc_compute_maxlevels(
1402 xfs_mount_t
*mp
) /* file system mount structure */
1410 maxleafents
= (1LL << XFS_INO_AGINO_BITS(mp
)) >>
1411 XFS_INODES_PER_CHUNK_LOG
;
1412 minleafrecs
= mp
->m_alloc_mnr
[0];
1413 minnoderecs
= mp
->m_alloc_mnr
[1];
1414 maxblocks
= (maxleafents
+ minleafrecs
- 1) / minleafrecs
;
1415 for (level
= 1; maxblocks
> 1; level
++)
1416 maxblocks
= (maxblocks
+ minnoderecs
- 1) / minnoderecs
;
1417 mp
->m_in_maxlevels
= level
;
1421 * Log specified fields for the ag hdr (inode section)
1425 xfs_trans_t
*tp
, /* transaction pointer */
1426 xfs_buf_t
*bp
, /* allocation group header buffer */
1427 int fields
) /* bitmask of fields to log */
1429 int first
; /* first byte number */
1430 int last
; /* last byte number */
1431 static const short offsets
[] = { /* field starting offsets */
1432 /* keep in sync with bit definitions */
1433 offsetof(xfs_agi_t
, agi_magicnum
),
1434 offsetof(xfs_agi_t
, agi_versionnum
),
1435 offsetof(xfs_agi_t
, agi_seqno
),
1436 offsetof(xfs_agi_t
, agi_length
),
1437 offsetof(xfs_agi_t
, agi_count
),
1438 offsetof(xfs_agi_t
, agi_root
),
1439 offsetof(xfs_agi_t
, agi_level
),
1440 offsetof(xfs_agi_t
, agi_freecount
),
1441 offsetof(xfs_agi_t
, agi_newino
),
1442 offsetof(xfs_agi_t
, agi_dirino
),
1443 offsetof(xfs_agi_t
, agi_unlinked
),
1447 xfs_agi_t
*agi
; /* allocation group header */
1449 agi
= XFS_BUF_TO_AGI(bp
);
1450 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1453 * Compute byte offsets for the first and last fields.
1455 xfs_btree_offsets(fields
, offsets
, XFS_AGI_NUM_BITS
, &first
, &last
);
1457 * Log the allocation group inode header buffer.
1459 xfs_trans_log_buf(tp
, bp
, first
, last
);
1464 xfs_check_agi_unlinked(
1465 struct xfs_agi
*agi
)
1469 for (i
= 0; i
< XFS_AGI_UNLINKED_BUCKETS
; i
++)
1470 ASSERT(agi
->agi_unlinked
[i
]);
1473 #define xfs_check_agi_unlinked(agi)
1480 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
1481 struct xfs_agi
*agi
= XFS_BUF_TO_AGI(bp
);
1485 * Validate the magic number of the agi block.
1487 agi_ok
= agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
) &&
1488 XFS_AGI_GOOD_VERSION(be32_to_cpu(agi
->agi_versionnum
));
1491 * during growfs operations, the perag is not fully initialised,
1492 * so we can't use it for any useful checking. growfs ensures we can't
1493 * use it by using uncached buffers that don't have the perag attached
1494 * so we can detect and avoid this problem.
1497 agi_ok
= agi_ok
&& be32_to_cpu(agi
->agi_seqno
) ==
1498 bp
->b_pag
->pag_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(__func__
, XFS_ERRLEVEL_LOW
, mp
, agi
);
1503 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
1505 xfs_check_agi_unlinked(agi
);
1509 xfs_agi_read_verify(
1516 xfs_agi_write_verify(
1522 const struct xfs_buf_ops xfs_agi_buf_ops
= {
1523 .verify_read
= xfs_agi_read_verify
,
1524 .verify_write
= xfs_agi_write_verify
,
1528 * Read in the allocation group header (inode allocation section)
1532 struct xfs_mount
*mp
, /* file system mount structure */
1533 struct xfs_trans
*tp
, /* transaction pointer */
1534 xfs_agnumber_t agno
, /* allocation group number */
1535 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1539 ASSERT(agno
!= NULLAGNUMBER
);
1541 error
= xfs_trans_read_buf(mp
, tp
, mp
->m_ddev_targp
,
1542 XFS_AG_DADDR(mp
, agno
, XFS_AGI_DADDR(mp
)),
1543 XFS_FSS_TO_BB(mp
, 1), 0, bpp
, &xfs_agi_buf_ops
);
1547 ASSERT(!xfs_buf_geterror(*bpp
));
1548 xfs_buf_set_ref(*bpp
, XFS_AGI_REF
);
1553 xfs_ialloc_read_agi(
1554 struct xfs_mount
*mp
, /* file system mount structure */
1555 struct xfs_trans
*tp
, /* transaction pointer */
1556 xfs_agnumber_t agno
, /* allocation group number */
1557 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1559 struct xfs_agi
*agi
; /* allocation group header */
1560 struct xfs_perag
*pag
; /* per allocation group data */
1563 error
= xfs_read_agi(mp
, tp
, agno
, bpp
);
1567 agi
= XFS_BUF_TO_AGI(*bpp
);
1568 pag
= xfs_perag_get(mp
, agno
);
1569 if (!pag
->pagi_init
) {
1570 pag
->pagi_freecount
= be32_to_cpu(agi
->agi_freecount
);
1571 pag
->pagi_count
= be32_to_cpu(agi
->agi_count
);
1576 * It's possible for these to be out of sync if
1577 * we are in the middle of a forced shutdown.
1579 ASSERT(pag
->pagi_freecount
== be32_to_cpu(agi
->agi_freecount
) ||
1580 XFS_FORCED_SHUTDOWN(mp
));
1586 * Read in the agi to initialise the per-ag data in the mount structure
1589 xfs_ialloc_pagi_init(
1590 xfs_mount_t
*mp
, /* file system mount structure */
1591 xfs_trans_t
*tp
, /* transaction pointer */
1592 xfs_agnumber_t agno
) /* allocation group number */
1594 xfs_buf_t
*bp
= NULL
;
1597 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &bp
);
1601 xfs_trans_brelse(tp
, bp
);