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
;
253 memset(&args
, 0, sizeof(args
));
255 args
.mp
= tp
->t_mountp
;
258 * Locking will ensure that we don't have two callers in here
261 newlen
= XFS_IALLOC_INODES(args
.mp
);
262 if (args
.mp
->m_maxicount
&&
263 args
.mp
->m_sb
.sb_icount
+ newlen
> args
.mp
->m_maxicount
)
264 return XFS_ERROR(ENOSPC
);
265 args
.minlen
= args
.maxlen
= XFS_IALLOC_BLOCKS(args
.mp
);
267 * First try to allocate inodes contiguous with the last-allocated
268 * chunk of inodes. If the filesystem is striped, this will fill
269 * an entire stripe unit with inodes.
271 agi
= XFS_BUF_TO_AGI(agbp
);
272 newino
= be32_to_cpu(agi
->agi_newino
);
273 agno
= be32_to_cpu(agi
->agi_seqno
);
274 args
.agbno
= XFS_AGINO_TO_AGBNO(args
.mp
, newino
) +
275 XFS_IALLOC_BLOCKS(args
.mp
);
276 if (likely(newino
!= NULLAGINO
&&
277 (args
.agbno
< be32_to_cpu(agi
->agi_length
)))) {
278 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
279 args
.type
= XFS_ALLOCTYPE_THIS_BNO
;
280 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
281 args
.userdata
= args
.minalignslop
= 0;
285 * We need to take into account alignment here to ensure that
286 * we don't modify the free list if we fail to have an exact
287 * block. If we don't have an exact match, and every oher
288 * attempt allocation attempt fails, we'll end up cancelling
289 * a dirty transaction and shutting down.
291 * For an exact allocation, alignment must be 1,
292 * however we need to take cluster alignment into account when
293 * fixing up the freelist. Use the minalignslop field to
294 * indicate that extra blocks might be required for alignment,
295 * but not to use them in the actual exact allocation.
298 args
.minalignslop
= xfs_ialloc_cluster_alignment(&args
) - 1;
300 /* Allow space for the inode btree to split. */
301 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
302 if ((error
= xfs_alloc_vextent(&args
)))
305 args
.fsbno
= NULLFSBLOCK
;
307 if (unlikely(args
.fsbno
== NULLFSBLOCK
)) {
309 * Set the alignment for the allocation.
310 * If stripe alignment is turned on then align at stripe unit
312 * If the cluster size is smaller than a filesystem block
313 * then we're doing I/O for inodes in filesystem block size
314 * pieces, so don't need alignment anyway.
317 if (args
.mp
->m_sinoalign
) {
318 ASSERT(!(args
.mp
->m_flags
& XFS_MOUNT_NOALIGN
));
319 args
.alignment
= args
.mp
->m_dalign
;
322 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
324 * Need to figure out where to allocate the inode blocks.
325 * Ideally they should be spaced out through the a.g.
326 * For now, just allocate blocks up front.
328 args
.agbno
= be32_to_cpu(agi
->agi_root
);
329 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
331 * Allocate a fixed-size extent of inodes.
333 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
334 args
.mod
= args
.total
= args
.wasdel
= args
.isfl
=
335 args
.userdata
= args
.minalignslop
= 0;
338 * Allow space for the inode btree to split.
340 args
.minleft
= args
.mp
->m_in_maxlevels
- 1;
341 if ((error
= xfs_alloc_vextent(&args
)))
346 * If stripe alignment is turned on, then try again with cluster
349 if (isaligned
&& args
.fsbno
== NULLFSBLOCK
) {
350 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
351 args
.agbno
= be32_to_cpu(agi
->agi_root
);
352 args
.fsbno
= XFS_AGB_TO_FSB(args
.mp
, agno
, args
.agbno
);
353 args
.alignment
= xfs_ialloc_cluster_alignment(&args
);
354 if ((error
= xfs_alloc_vextent(&args
)))
358 if (args
.fsbno
== NULLFSBLOCK
) {
362 ASSERT(args
.len
== args
.minlen
);
365 * Stamp and write the inode buffers.
367 * Seed the new inode cluster with a random generation number. This
368 * prevents short-term reuse of generation numbers if a chunk is
369 * freed and then immediately reallocated. We use random numbers
370 * rather than a linear progression to prevent the next generation
371 * number from being easily guessable.
373 error
= xfs_ialloc_inode_init(args
.mp
, tp
, agno
, args
.agbno
,
374 args
.len
, random32());
379 * Convert the results.
381 newino
= XFS_OFFBNO_TO_AGINO(args
.mp
, args
.agbno
, 0);
382 be32_add_cpu(&agi
->agi_count
, newlen
);
383 be32_add_cpu(&agi
->agi_freecount
, newlen
);
384 pag
= xfs_perag_get(args
.mp
, agno
);
385 pag
->pagi_freecount
+= newlen
;
387 agi
->agi_newino
= cpu_to_be32(newino
);
390 * Insert records describing the new inode chunk into the btree.
392 cur
= xfs_inobt_init_cursor(args
.mp
, tp
, agbp
, agno
);
393 for (thisino
= newino
;
394 thisino
< newino
+ newlen
;
395 thisino
+= XFS_INODES_PER_CHUNK
) {
396 cur
->bc_rec
.i
.ir_startino
= thisino
;
397 cur
->bc_rec
.i
.ir_freecount
= XFS_INODES_PER_CHUNK
;
398 cur
->bc_rec
.i
.ir_free
= XFS_INOBT_ALL_FREE
;
399 error
= xfs_btree_lookup(cur
, XFS_LOOKUP_EQ
, &i
);
401 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
405 error
= xfs_btree_insert(cur
, &i
);
407 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
412 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
414 * Log allocation group header fields
416 xfs_ialloc_log_agi(tp
, agbp
,
417 XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
| XFS_AGI_NEWINO
);
419 * Modify/log superblock values for inode count and inode free count.
421 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, (long)newlen
);
422 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, (long)newlen
);
427 STATIC xfs_agnumber_t
433 spin_lock(&mp
->m_agirotor_lock
);
434 agno
= mp
->m_agirotor
;
435 if (++mp
->m_agirotor
>= mp
->m_maxagi
)
437 spin_unlock(&mp
->m_agirotor_lock
);
443 * Select an allocation group to look for a free inode in, based on the parent
444 * inode and then mode. Return the allocation group buffer.
446 STATIC xfs_agnumber_t
447 xfs_ialloc_ag_select(
448 xfs_trans_t
*tp
, /* transaction pointer */
449 xfs_ino_t parent
, /* parent directory inode number */
450 umode_t mode
, /* bits set to indicate file type */
451 int okalloc
) /* ok to allocate more space */
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 */
465 * Files of these types need at least one block if length > 0
466 * (and they won't fit in the inode, but that's hard to figure out).
468 needspace
= S_ISDIR(mode
) || S_ISREG(mode
) || S_ISLNK(mode
);
470 agcount
= mp
->m_maxagi
;
472 pagno
= xfs_ialloc_next_ag(mp
);
474 pagno
= XFS_INO_TO_AGNO(mp
, parent
);
475 if (pagno
>= agcount
)
479 ASSERT(pagno
< agcount
);
482 * Loop through allocation groups, looking for one with a little
483 * free space in it. Note we don't look for free inodes, exactly.
484 * Instead, we include whether there is a need to allocate inodes
485 * to mean that blocks must be allocated for them,
486 * if none are currently free.
489 flags
= XFS_ALLOC_FLAG_TRYLOCK
;
491 pag
= xfs_perag_get(mp
, agno
);
492 if (!pag
->pagi_inodeok
) {
493 xfs_ialloc_next_ag(mp
);
497 if (!pag
->pagi_init
) {
498 error
= xfs_ialloc_pagi_init(mp
, tp
, agno
);
503 if (pag
->pagi_freecount
) {
511 if (!pag
->pagf_init
) {
512 error
= xfs_alloc_pagf_init(mp
, tp
, agno
, flags
);
518 * Is there enough free space for the file plus a block of
519 * inodes? (if we need to allocate some)?
521 ineed
= XFS_IALLOC_BLOCKS(mp
);
522 longest
= pag
->pagf_longest
;
524 longest
= pag
->pagf_flcount
> 0;
526 if (pag
->pagf_freeblks
>= needspace
+ ineed
&&
534 * No point in iterating over the rest, if we're shutting
537 if (XFS_FORCED_SHUTDOWN(mp
))
551 * Try to retrieve the next record to the left/right from the current one.
555 struct xfs_btree_cur
*cur
,
556 xfs_inobt_rec_incore_t
*rec
,
564 error
= xfs_btree_decrement(cur
, 0, &i
);
566 error
= xfs_btree_increment(cur
, 0, &i
);
572 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
575 XFS_WANT_CORRUPTED_RETURN(i
== 1);
583 struct xfs_btree_cur
*cur
,
585 xfs_inobt_rec_incore_t
*rec
,
592 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_EQ
, &i
);
597 error
= xfs_inobt_get_rec(cur
, rec
, &i
);
600 XFS_WANT_CORRUPTED_RETURN(i
== 1);
609 * The caller selected an AG for us, and made sure that free inodes are
614 struct xfs_trans
*tp
,
615 struct xfs_buf
*agbp
,
619 struct xfs_mount
*mp
= tp
->t_mountp
;
620 struct xfs_agi
*agi
= XFS_BUF_TO_AGI(agbp
);
621 xfs_agnumber_t agno
= be32_to_cpu(agi
->agi_seqno
);
622 xfs_agnumber_t pagno
= XFS_INO_TO_AGNO(mp
, parent
);
623 xfs_agino_t pagino
= XFS_INO_TO_AGINO(mp
, parent
);
624 struct xfs_perag
*pag
;
625 struct xfs_btree_cur
*cur
, *tcur
;
626 struct xfs_inobt_rec_incore rec
, trec
;
632 pag
= xfs_perag_get(mp
, agno
);
634 ASSERT(pag
->pagi_init
);
635 ASSERT(pag
->pagi_inodeok
);
636 ASSERT(pag
->pagi_freecount
> 0);
639 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
641 * If pagino is 0 (this is the root inode allocation) use newino.
642 * This must work because we've just allocated some.
645 pagino
= be32_to_cpu(agi
->agi_newino
);
647 error
= xfs_check_agi_freecount(cur
, agi
);
652 * If in the same AG as the parent, try to get near the parent.
655 int doneleft
; /* done, to the left */
656 int doneright
; /* done, to the right */
657 int searchdistance
= 10;
659 error
= xfs_inobt_lookup(cur
, pagino
, XFS_LOOKUP_LE
, &i
);
662 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
664 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
667 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
669 if (rec
.ir_freecount
> 0) {
671 * Found a free inode in the same chunk
672 * as the parent, done.
679 * In the same AG as parent, but parent's chunk is full.
682 /* duplicate the cursor, search left & right simultaneously */
683 error
= xfs_btree_dup_cursor(cur
, &tcur
);
688 * Skip to last blocks looked up if same parent inode.
690 if (pagino
!= NULLAGINO
&&
691 pag
->pagl_pagino
== pagino
&&
692 pag
->pagl_leftrec
!= NULLAGINO
&&
693 pag
->pagl_rightrec
!= NULLAGINO
) {
694 error
= xfs_ialloc_get_rec(tcur
, pag
->pagl_leftrec
,
695 &trec
, &doneleft
, 1);
699 error
= xfs_ialloc_get_rec(cur
, pag
->pagl_rightrec
,
700 &rec
, &doneright
, 0);
704 /* search left with tcur, back up 1 record */
705 error
= xfs_ialloc_next_rec(tcur
, &trec
, &doneleft
, 1);
709 /* search right with cur, go forward 1 record. */
710 error
= xfs_ialloc_next_rec(cur
, &rec
, &doneright
, 0);
716 * Loop until we find an inode chunk with a free inode.
718 while (!doneleft
|| !doneright
) {
719 int useleft
; /* using left inode chunk this time */
721 if (!--searchdistance
) {
723 * Not in range - save last search
724 * location and allocate a new inode
726 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
727 pag
->pagl_leftrec
= trec
.ir_startino
;
728 pag
->pagl_rightrec
= rec
.ir_startino
;
729 pag
->pagl_pagino
= pagino
;
733 /* figure out the closer block if both are valid. */
734 if (!doneleft
&& !doneright
) {
736 (trec
.ir_startino
+ XFS_INODES_PER_CHUNK
- 1) <
737 rec
.ir_startino
- pagino
;
742 /* free inodes to the left? */
743 if (useleft
&& trec
.ir_freecount
) {
745 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
748 pag
->pagl_leftrec
= trec
.ir_startino
;
749 pag
->pagl_rightrec
= rec
.ir_startino
;
750 pag
->pagl_pagino
= pagino
;
754 /* free inodes to the right? */
755 if (!useleft
&& rec
.ir_freecount
) {
756 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
758 pag
->pagl_leftrec
= trec
.ir_startino
;
759 pag
->pagl_rightrec
= rec
.ir_startino
;
760 pag
->pagl_pagino
= pagino
;
764 /* get next record to check */
766 error
= xfs_ialloc_next_rec(tcur
, &trec
,
769 error
= xfs_ialloc_next_rec(cur
, &rec
,
777 * We've reached the end of the btree. because
778 * we are only searching a small chunk of the
779 * btree each search, there is obviously free
780 * inodes closer to the parent inode than we
781 * are now. restart the search again.
783 pag
->pagl_pagino
= NULLAGINO
;
784 pag
->pagl_leftrec
= NULLAGINO
;
785 pag
->pagl_rightrec
= NULLAGINO
;
786 xfs_btree_del_cursor(tcur
, XFS_BTREE_NOERROR
);
787 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
792 * In a different AG from the parent.
793 * See if the most recently allocated block has any free.
796 if (agi
->agi_newino
!= cpu_to_be32(NULLAGINO
)) {
797 error
= xfs_inobt_lookup(cur
, be32_to_cpu(agi
->agi_newino
),
803 error
= xfs_inobt_get_rec(cur
, &rec
, &j
);
807 if (j
== 1 && rec
.ir_freecount
> 0) {
809 * The last chunk allocated in the group
810 * still has a free inode.
818 * None left in the last group, search the whole AG
820 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &i
);
823 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
826 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
829 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
830 if (rec
.ir_freecount
> 0)
832 error
= xfs_btree_increment(cur
, 0, &i
);
835 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
839 offset
= xfs_lowbit64(rec
.ir_free
);
841 ASSERT(offset
< XFS_INODES_PER_CHUNK
);
842 ASSERT((XFS_AGINO_TO_OFFSET(mp
, rec
.ir_startino
) %
843 XFS_INODES_PER_CHUNK
) == 0);
844 ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
+ offset
);
845 rec
.ir_free
&= ~XFS_INOBT_MASK(offset
);
847 error
= xfs_inobt_update(cur
, &rec
);
850 be32_add_cpu(&agi
->agi_freecount
, -1);
851 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
852 pag
->pagi_freecount
--;
854 error
= xfs_check_agi_freecount(cur
, agi
);
858 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
859 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -1);
864 xfs_btree_del_cursor(tcur
, XFS_BTREE_ERROR
);
866 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
872 * Allocate an inode on disk.
874 * Mode is used to tell whether the new inode will need space, and whether it
877 * This function is designed to be called twice if it has to do an allocation
878 * to make more free inodes. On the first call, *IO_agbp should be set to NULL.
879 * If an inode is available without having to performn an allocation, an inode
880 * number is returned. In this case, *IO_agbp is set to NULL. If an allocation
881 * needs to be done, xfs_dialloc returns the current AGI buffer in *IO_agbp.
882 * The caller should then commit the current transaction, allocate a
883 * new transaction, and call xfs_dialloc() again, passing in the previous value
884 * of *IO_agbp. IO_agbp should be held across the transactions. Since the AGI
885 * buffer is locked across the two calls, the second call is guaranteed to have
886 * a free inode available.
888 * Once we successfully pick an inode its number is returned and the on-disk
889 * data structures are updated. The inode itself is not read in, since doing so
890 * would break ordering constraints with xfs_reclaim.
894 struct xfs_trans
*tp
,
898 struct xfs_buf
**IO_agbp
,
901 struct xfs_mount
*mp
= tp
->t_mountp
;
902 struct xfs_buf
*agbp
;
907 xfs_agnumber_t start_agno
;
908 struct xfs_perag
*pag
;
912 * If the caller passes in a pointer to the AGI buffer,
913 * continue where we left off before. In this case, we
914 * know that the allocation group has free inodes.
921 * We do not have an agbp, so select an initial allocation
922 * group for inode allocation.
924 start_agno
= xfs_ialloc_ag_select(tp
, parent
, mode
, okalloc
);
925 if (start_agno
== NULLAGNUMBER
) {
931 * If we have already hit the ceiling of inode blocks then clear
932 * okalloc so we scan all available agi structures for a free
935 if (mp
->m_maxicount
&&
936 mp
->m_sb
.sb_icount
+ XFS_IALLOC_INODES(mp
) > mp
->m_maxicount
) {
942 * Loop until we find an allocation group that either has free inodes
943 * or in which we can allocate some inodes. Iterate through the
944 * allocation groups upward, wrapping at the end.
948 pag
= xfs_perag_get(mp
, agno
);
949 if (!pag
->pagi_inodeok
) {
950 xfs_ialloc_next_ag(mp
);
954 if (!pag
->pagi_init
) {
955 error
= xfs_ialloc_pagi_init(mp
, tp
, agno
);
961 * Do a first racy fast path check if this AG is usable.
963 if (!pag
->pagi_freecount
&& !okalloc
)
967 * Then read in the AGI buffer and recheck with the AGI buffer
970 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
974 if (pag
->pagi_freecount
) {
980 goto nextag_relse_buffer
;
983 error
= xfs_ialloc_ag_alloc(tp
, agbp
, &ialloced
);
985 xfs_trans_brelse(tp
, agbp
);
997 * We successfully allocated some inodes, return
998 * the current context to the caller so that it
999 * can commit the current transaction and call
1000 * us again where we left off.
1002 ASSERT(pag
->pagi_freecount
> 0);
1010 nextag_relse_buffer
:
1011 xfs_trans_brelse(tp
, agbp
);
1014 if (++agno
== mp
->m_sb
.sb_agcount
)
1016 if (agno
== start_agno
) {
1018 return noroom
? ENOSPC
: 0;
1024 return xfs_dialloc_ag(tp
, agbp
, parent
, inop
);
1027 return XFS_ERROR(error
);
1031 * Free disk inode. Carefully avoids touching the incore inode, all
1032 * manipulations incore are the caller's responsibility.
1033 * The on-disk inode is not changed by this operation, only the
1034 * btree (free inode mask) is changed.
1038 xfs_trans_t
*tp
, /* transaction pointer */
1039 xfs_ino_t inode
, /* inode to be freed */
1040 xfs_bmap_free_t
*flist
, /* extents to free */
1041 int *delete, /* set if inode cluster was deleted */
1042 xfs_ino_t
*first_ino
) /* first inode in deleted cluster */
1045 xfs_agblock_t agbno
; /* block number containing inode */
1046 xfs_buf_t
*agbp
; /* buffer containing allocation group header */
1047 xfs_agino_t agino
; /* inode number relative to allocation group */
1048 xfs_agnumber_t agno
; /* allocation group number */
1049 xfs_agi_t
*agi
; /* allocation group header */
1050 xfs_btree_cur_t
*cur
; /* inode btree cursor */
1051 int error
; /* error return value */
1052 int i
; /* result code */
1053 int ilen
; /* inodes in an inode cluster */
1054 xfs_mount_t
*mp
; /* mount structure for filesystem */
1055 int off
; /* offset of inode in inode chunk */
1056 xfs_inobt_rec_incore_t rec
; /* btree record */
1057 struct xfs_perag
*pag
;
1062 * Break up inode number into its components.
1064 agno
= XFS_INO_TO_AGNO(mp
, inode
);
1065 if (agno
>= mp
->m_sb
.sb_agcount
) {
1066 xfs_warn(mp
, "%s: agno >= mp->m_sb.sb_agcount (%d >= %d).",
1067 __func__
, agno
, mp
->m_sb
.sb_agcount
);
1069 return XFS_ERROR(EINVAL
);
1071 agino
= XFS_INO_TO_AGINO(mp
, inode
);
1072 if (inode
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1073 xfs_warn(mp
, "%s: inode != XFS_AGINO_TO_INO() (%llu != %llu).",
1074 __func__
, (unsigned long long)inode
,
1075 (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
) {
1081 xfs_warn(mp
, "%s: agbno >= mp->m_sb.sb_agblocks (%d >= %d).",
1082 __func__
, agbno
, mp
->m_sb
.sb_agblocks
);
1084 return XFS_ERROR(EINVAL
);
1087 * Get the allocation group header.
1089 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1091 xfs_warn(mp
, "%s: xfs_ialloc_read_agi() returned error %d.",
1095 agi
= XFS_BUF_TO_AGI(agbp
);
1096 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1097 ASSERT(agbno
< be32_to_cpu(agi
->agi_length
));
1099 * Initialize the cursor.
1101 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1103 error
= xfs_check_agi_freecount(cur
, agi
);
1108 * Look for the entry describing this inode.
1110 if ((error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
))) {
1111 xfs_warn(mp
, "%s: xfs_inobt_lookup() returned error %d.",
1115 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1116 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1118 xfs_warn(mp
, "%s: xfs_inobt_get_rec() returned error %d.",
1122 XFS_WANT_CORRUPTED_GOTO(i
== 1, error0
);
1124 * Get the offset in the inode chunk.
1126 off
= agino
- rec
.ir_startino
;
1127 ASSERT(off
>= 0 && off
< XFS_INODES_PER_CHUNK
);
1128 ASSERT(!(rec
.ir_free
& XFS_INOBT_MASK(off
)));
1130 * Mark the inode free & increment the count.
1132 rec
.ir_free
|= XFS_INOBT_MASK(off
);
1136 * When an inode cluster is free, it becomes eligible for removal
1138 if (!(mp
->m_flags
& XFS_MOUNT_IKEEP
) &&
1139 (rec
.ir_freecount
== XFS_IALLOC_INODES(mp
))) {
1142 *first_ino
= XFS_AGINO_TO_INO(mp
, agno
, rec
.ir_startino
);
1145 * Remove the inode cluster from the AGI B+Tree, adjust the
1146 * AGI and Superblock inode counts, and mark the disk space
1147 * to be freed when the transaction is committed.
1149 ilen
= XFS_IALLOC_INODES(mp
);
1150 be32_add_cpu(&agi
->agi_count
, -ilen
);
1151 be32_add_cpu(&agi
->agi_freecount
, -(ilen
- 1));
1152 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_COUNT
| XFS_AGI_FREECOUNT
);
1153 pag
= xfs_perag_get(mp
, agno
);
1154 pag
->pagi_freecount
-= ilen
- 1;
1156 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_ICOUNT
, -ilen
);
1157 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, -(ilen
- 1));
1159 if ((error
= xfs_btree_delete(cur
, &i
))) {
1160 xfs_warn(mp
, "%s: xfs_btree_delete returned error %d.",
1165 xfs_bmap_add_free(XFS_AGB_TO_FSB(mp
,
1166 agno
, XFS_INO_TO_AGBNO(mp
,rec
.ir_startino
)),
1167 XFS_IALLOC_BLOCKS(mp
), flist
, mp
);
1171 error
= xfs_inobt_update(cur
, &rec
);
1173 xfs_warn(mp
, "%s: xfs_inobt_update returned error %d.",
1179 * Change the inode free counts and log the ag/sb changes.
1181 be32_add_cpu(&agi
->agi_freecount
, 1);
1182 xfs_ialloc_log_agi(tp
, agbp
, XFS_AGI_FREECOUNT
);
1183 pag
= xfs_perag_get(mp
, agno
);
1184 pag
->pagi_freecount
++;
1186 xfs_trans_mod_sb(tp
, XFS_TRANS_SB_IFREE
, 1);
1189 error
= xfs_check_agi_freecount(cur
, agi
);
1193 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1197 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
1203 struct xfs_mount
*mp
,
1204 struct xfs_trans
*tp
,
1205 xfs_agnumber_t agno
,
1207 xfs_agblock_t agbno
,
1208 xfs_agblock_t
*chunk_agbno
,
1209 xfs_agblock_t
*offset_agbno
,
1212 struct xfs_inobt_rec_incore rec
;
1213 struct xfs_btree_cur
*cur
;
1214 struct xfs_buf
*agbp
;
1218 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &agbp
);
1221 "%s: xfs_ialloc_read_agi() returned error %d, agno %d",
1222 __func__
, error
, agno
);
1227 * Lookup the inode record for the given agino. If the record cannot be
1228 * found, then it's an invalid inode number and we should abort. Once
1229 * we have a record, we need to ensure it contains the inode number
1230 * we are looking up.
1232 cur
= xfs_inobt_init_cursor(mp
, tp
, agbp
, agno
);
1233 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
, &i
);
1236 error
= xfs_inobt_get_rec(cur
, &rec
, &i
);
1237 if (!error
&& i
== 0)
1241 xfs_trans_brelse(tp
, agbp
);
1242 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
1246 /* check that the returned record contains the required inode */
1247 if (rec
.ir_startino
> agino
||
1248 rec
.ir_startino
+ XFS_IALLOC_INODES(mp
) <= agino
)
1251 /* for untrusted inodes check it is allocated first */
1252 if ((flags
& XFS_IGET_UNTRUSTED
) &&
1253 (rec
.ir_free
& XFS_INOBT_MASK(agino
- rec
.ir_startino
)))
1256 *chunk_agbno
= XFS_AGINO_TO_AGBNO(mp
, rec
.ir_startino
);
1257 *offset_agbno
= agbno
- *chunk_agbno
;
1262 * Return the location of the inode in imap, for mapping it into a buffer.
1266 xfs_mount_t
*mp
, /* file system mount structure */
1267 xfs_trans_t
*tp
, /* transaction pointer */
1268 xfs_ino_t ino
, /* inode to locate */
1269 struct xfs_imap
*imap
, /* location map structure */
1270 uint flags
) /* flags for inode btree lookup */
1272 xfs_agblock_t agbno
; /* block number of inode in the alloc group */
1273 xfs_agino_t agino
; /* inode number within alloc group */
1274 xfs_agnumber_t agno
; /* allocation group number */
1275 int blks_per_cluster
; /* num blocks per inode cluster */
1276 xfs_agblock_t chunk_agbno
; /* first block in inode chunk */
1277 xfs_agblock_t cluster_agbno
; /* first block in inode cluster */
1278 int error
; /* error code */
1279 int offset
; /* index of inode in its buffer */
1280 int offset_agbno
; /* blks from chunk start to inode */
1282 ASSERT(ino
!= NULLFSINO
);
1285 * Split up the inode number into its parts.
1287 agno
= XFS_INO_TO_AGNO(mp
, ino
);
1288 agino
= XFS_INO_TO_AGINO(mp
, ino
);
1289 agbno
= XFS_AGINO_TO_AGBNO(mp
, agino
);
1290 if (agno
>= mp
->m_sb
.sb_agcount
|| agbno
>= mp
->m_sb
.sb_agblocks
||
1291 ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1294 * Don't output diagnostic information for untrusted inodes
1295 * as they can be invalid without implying corruption.
1297 if (flags
& XFS_IGET_UNTRUSTED
)
1298 return XFS_ERROR(EINVAL
);
1299 if (agno
>= mp
->m_sb
.sb_agcount
) {
1301 "%s: agno (%d) >= mp->m_sb.sb_agcount (%d)",
1302 __func__
, agno
, mp
->m_sb
.sb_agcount
);
1304 if (agbno
>= mp
->m_sb
.sb_agblocks
) {
1306 "%s: agbno (0x%llx) >= mp->m_sb.sb_agblocks (0x%lx)",
1307 __func__
, (unsigned long long)agbno
,
1308 (unsigned long)mp
->m_sb
.sb_agblocks
);
1310 if (ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
1312 "%s: ino (0x%llx) != XFS_AGINO_TO_INO() (0x%llx)",
1314 XFS_AGINO_TO_INO(mp
, agno
, agino
));
1318 return XFS_ERROR(EINVAL
);
1321 blks_per_cluster
= XFS_INODE_CLUSTER_SIZE(mp
) >> mp
->m_sb
.sb_blocklog
;
1324 * For bulkstat and handle lookups, we have an untrusted inode number
1325 * that we have to verify is valid. We cannot do this just by reading
1326 * the inode buffer as it may have been unlinked and removed leaving
1327 * inodes in stale state on disk. Hence we have to do a btree lookup
1328 * in all cases where an untrusted inode number is passed.
1330 if (flags
& XFS_IGET_UNTRUSTED
) {
1331 error
= xfs_imap_lookup(mp
, tp
, agno
, agino
, agbno
,
1332 &chunk_agbno
, &offset_agbno
, flags
);
1339 * If the inode cluster size is the same as the blocksize or
1340 * smaller we get to the buffer by simple arithmetics.
1342 if (XFS_INODE_CLUSTER_SIZE(mp
) <= mp
->m_sb
.sb_blocksize
) {
1343 offset
= XFS_INO_TO_OFFSET(mp
, ino
);
1344 ASSERT(offset
< mp
->m_sb
.sb_inopblock
);
1346 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
);
1347 imap
->im_len
= XFS_FSB_TO_BB(mp
, 1);
1348 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1353 * If the inode chunks are aligned then use simple maths to
1354 * find the location. Otherwise we have to do a btree
1355 * lookup to find the location.
1357 if (mp
->m_inoalign_mask
) {
1358 offset_agbno
= agbno
& mp
->m_inoalign_mask
;
1359 chunk_agbno
= agbno
- offset_agbno
;
1361 error
= xfs_imap_lookup(mp
, tp
, agno
, agino
, agbno
,
1362 &chunk_agbno
, &offset_agbno
, flags
);
1368 ASSERT(agbno
>= chunk_agbno
);
1369 cluster_agbno
= chunk_agbno
+
1370 ((offset_agbno
/ blks_per_cluster
) * blks_per_cluster
);
1371 offset
= ((agbno
- cluster_agbno
) * mp
->m_sb
.sb_inopblock
) +
1372 XFS_INO_TO_OFFSET(mp
, ino
);
1374 imap
->im_blkno
= XFS_AGB_TO_DADDR(mp
, agno
, cluster_agbno
);
1375 imap
->im_len
= XFS_FSB_TO_BB(mp
, blks_per_cluster
);
1376 imap
->im_boffset
= (ushort
)(offset
<< mp
->m_sb
.sb_inodelog
);
1379 * If the inode number maps to a block outside the bounds
1380 * of the file system then return NULL rather than calling
1381 * read_buf and panicing when we get an error from the
1384 if ((imap
->im_blkno
+ imap
->im_len
) >
1385 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
)) {
1387 "%s: (im_blkno (0x%llx) + im_len (0x%llx)) > sb_dblocks (0x%llx)",
1388 __func__
, (unsigned long long) imap
->im_blkno
,
1389 (unsigned long long) imap
->im_len
,
1390 XFS_FSB_TO_BB(mp
, mp
->m_sb
.sb_dblocks
));
1391 return XFS_ERROR(EINVAL
);
1397 * Compute and fill in value of m_in_maxlevels.
1400 xfs_ialloc_compute_maxlevels(
1401 xfs_mount_t
*mp
) /* file system mount structure */
1409 maxleafents
= (1LL << XFS_INO_AGINO_BITS(mp
)) >>
1410 XFS_INODES_PER_CHUNK_LOG
;
1411 minleafrecs
= mp
->m_alloc_mnr
[0];
1412 minnoderecs
= mp
->m_alloc_mnr
[1];
1413 maxblocks
= (maxleafents
+ minleafrecs
- 1) / minleafrecs
;
1414 for (level
= 1; maxblocks
> 1; level
++)
1415 maxblocks
= (maxblocks
+ minnoderecs
- 1) / minnoderecs
;
1416 mp
->m_in_maxlevels
= level
;
1420 * Log specified fields for the ag hdr (inode section)
1424 xfs_trans_t
*tp
, /* transaction pointer */
1425 xfs_buf_t
*bp
, /* allocation group header buffer */
1426 int fields
) /* bitmask of fields to log */
1428 int first
; /* first byte number */
1429 int last
; /* last byte number */
1430 static const short offsets
[] = { /* field starting offsets */
1431 /* keep in sync with bit definitions */
1432 offsetof(xfs_agi_t
, agi_magicnum
),
1433 offsetof(xfs_agi_t
, agi_versionnum
),
1434 offsetof(xfs_agi_t
, agi_seqno
),
1435 offsetof(xfs_agi_t
, agi_length
),
1436 offsetof(xfs_agi_t
, agi_count
),
1437 offsetof(xfs_agi_t
, agi_root
),
1438 offsetof(xfs_agi_t
, agi_level
),
1439 offsetof(xfs_agi_t
, agi_freecount
),
1440 offsetof(xfs_agi_t
, agi_newino
),
1441 offsetof(xfs_agi_t
, agi_dirino
),
1442 offsetof(xfs_agi_t
, agi_unlinked
),
1446 xfs_agi_t
*agi
; /* allocation group header */
1448 agi
= XFS_BUF_TO_AGI(bp
);
1449 ASSERT(agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
));
1452 * Compute byte offsets for the first and last fields.
1454 xfs_btree_offsets(fields
, offsets
, XFS_AGI_NUM_BITS
, &first
, &last
);
1456 * Log the allocation group inode header buffer.
1458 xfs_trans_log_buf(tp
, bp
, first
, last
);
1463 xfs_check_agi_unlinked(
1464 struct xfs_agi
*agi
)
1468 for (i
= 0; i
< XFS_AGI_UNLINKED_BUCKETS
; i
++)
1469 ASSERT(agi
->agi_unlinked
[i
]);
1472 #define xfs_check_agi_unlinked(agi)
1476 xfs_agi_read_verify(
1479 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
1480 struct xfs_agi
*agi
= XFS_BUF_TO_AGI(bp
);
1484 * Validate the magic number of the agi block.
1486 agi_ok
= agi
->agi_magicnum
== cpu_to_be32(XFS_AGI_MAGIC
) &&
1487 XFS_AGI_GOOD_VERSION(be32_to_cpu(agi
->agi_versionnum
));
1490 * during growfs operations, the perag is not fully initialised,
1491 * so we can't use it for any useful checking. growfs ensures we can't
1492 * use it by using uncached buffers that don't have the perag attached
1493 * so we can detect and avoid this problem.
1496 agi_ok
= agi_ok
&& be32_to_cpu(agi
->agi_seqno
) ==
1497 bp
->b_pag
->pag_agno
;
1499 if (unlikely(XFS_TEST_ERROR(!agi_ok
, mp
, XFS_ERRTAG_IALLOC_READ_AGI
,
1500 XFS_RANDOM_IALLOC_READ_AGI
))) {
1501 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, agi
);
1502 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
1504 xfs_check_agi_unlinked(agi
);
1505 bp
->b_iodone
= NULL
;
1506 xfs_buf_ioend(bp
, 0);
1510 * Read in the allocation group header (inode allocation section)
1514 struct xfs_mount
*mp
, /* file system mount structure */
1515 struct xfs_trans
*tp
, /* transaction pointer */
1516 xfs_agnumber_t agno
, /* allocation group number */
1517 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1521 ASSERT(agno
!= NULLAGNUMBER
);
1523 error
= xfs_trans_read_buf(mp
, tp
, mp
->m_ddev_targp
,
1524 XFS_AG_DADDR(mp
, agno
, XFS_AGI_DADDR(mp
)),
1525 XFS_FSS_TO_BB(mp
, 1), 0, bpp
, xfs_agi_read_verify
);
1529 ASSERT(!xfs_buf_geterror(*bpp
));
1530 xfs_buf_set_ref(*bpp
, XFS_AGI_REF
);
1535 xfs_ialloc_read_agi(
1536 struct xfs_mount
*mp
, /* file system mount structure */
1537 struct xfs_trans
*tp
, /* transaction pointer */
1538 xfs_agnumber_t agno
, /* allocation group number */
1539 struct xfs_buf
**bpp
) /* allocation group hdr buf */
1541 struct xfs_agi
*agi
; /* allocation group header */
1542 struct xfs_perag
*pag
; /* per allocation group data */
1545 error
= xfs_read_agi(mp
, tp
, agno
, bpp
);
1549 agi
= XFS_BUF_TO_AGI(*bpp
);
1550 pag
= xfs_perag_get(mp
, agno
);
1551 if (!pag
->pagi_init
) {
1552 pag
->pagi_freecount
= be32_to_cpu(agi
->agi_freecount
);
1553 pag
->pagi_count
= be32_to_cpu(agi
->agi_count
);
1558 * It's possible for these to be out of sync if
1559 * we are in the middle of a forced shutdown.
1561 ASSERT(pag
->pagi_freecount
== be32_to_cpu(agi
->agi_freecount
) ||
1562 XFS_FORCED_SHUTDOWN(mp
));
1568 * Read in the agi to initialise the per-ag data in the mount structure
1571 xfs_ialloc_pagi_init(
1572 xfs_mount_t
*mp
, /* file system mount structure */
1573 xfs_trans_t
*tp
, /* transaction pointer */
1574 xfs_agnumber_t agno
) /* allocation group number */
1576 xfs_buf_t
*bp
= NULL
;
1579 error
= xfs_ialloc_read_agi(mp
, tp
, agno
, &bp
);
1583 xfs_trans_brelse(tp
, bp
);