Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000,2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#ifndef __XFS_IALLOC_H__
7#define __XFS_IALLOC_H__
8
9struct xfs_buf;
10struct xfs_dinode;
11struct xfs_imap;
12struct xfs_mount;
13struct xfs_trans;
14struct xfs_btree_cur;
15struct xfs_perag;
16
17/* Move inodes in clusters of this size */
18#define XFS_INODE_BIG_CLUSTER_SIZE 8192
19
20struct xfs_icluster {
21 bool deleted; /* record is deleted */
22 xfs_ino_t first_ino; /* first inode number */
23 uint64_t alloc; /* inode phys. allocation bitmap for
24 * sparse chunks */
25};
26
27/*
28 * Make an inode pointer out of the buffer/offset.
29 */
30static inline struct xfs_dinode *
31xfs_make_iptr(struct xfs_mount *mp, struct xfs_buf *b, int o)
32{
33 return xfs_buf_offset(b, o << (mp)->m_sb.sb_inodelog);
34}
35
36struct xfs_icreate_args;
37
38/*
39 * Allocate an inode on disk. Mode is used to tell whether the new inode will
40 * need space, and whether it is a directory.
41 */
42int xfs_dialloc(struct xfs_trans **tpp, const struct xfs_icreate_args *args,
43 xfs_ino_t *new_ino);
44
45int xfs_difree(struct xfs_trans *tp, struct xfs_perag *pag,
46 xfs_ino_t ino, struct xfs_icluster *ifree);
47
48/*
49 * Return the location of the inode in imap, for mapping it into a buffer.
50 */
51int
52xfs_imap(
53 struct xfs_perag *pag,
54 struct xfs_trans *tp, /* transaction pointer */
55 xfs_ino_t ino, /* inode to locate */
56 struct xfs_imap *imap, /* location map structure */
57 uint flags); /* flags for inode btree lookup */
58
59/*
60 * Log specified fields for the ag hdr (inode section)
61 */
62void
63xfs_ialloc_log_agi(
64 struct xfs_trans *tp, /* transaction pointer */
65 struct xfs_buf *bp, /* allocation group header buffer */
66 uint32_t fields); /* bitmask of fields to log */
67
68int xfs_read_agi(struct xfs_perag *pag, struct xfs_trans *tp, xfs_buf_flags_t flags,
69 struct xfs_buf **agibpp);
70int xfs_ialloc_read_agi(struct xfs_perag *pag, struct xfs_trans *tp,
71 int flags, struct xfs_buf **agibpp);
72#define XFS_IALLOC_FLAG_TRYLOCK (1U << 0) /* use trylock for buffer locking */
73
74/*
75 * Lookup a record by ino in the btree given by cur.
76 */
77int xfs_inobt_lookup(struct xfs_btree_cur *cur, xfs_agino_t ino,
78 xfs_lookup_t dir, int *stat);
79
80/*
81 * Get the data from the pointed-to record.
82 */
83int xfs_inobt_get_rec(struct xfs_btree_cur *cur,
84 xfs_inobt_rec_incore_t *rec, int *stat);
85uint8_t xfs_inobt_rec_freecount(const struct xfs_inobt_rec_incore *irec);
86
87/*
88 * Inode chunk initialisation routine
89 */
90int xfs_ialloc_inode_init(struct xfs_mount *mp, struct xfs_trans *tp,
91 struct list_head *buffer_list, int icount,
92 xfs_agnumber_t agno, xfs_agblock_t agbno,
93 xfs_agblock_t length, unsigned int gen);
94
95
96union xfs_btree_rec;
97void xfs_inobt_btrec_to_irec(struct xfs_mount *mp,
98 const union xfs_btree_rec *rec,
99 struct xfs_inobt_rec_incore *irec);
100xfs_failaddr_t xfs_inobt_check_irec(struct xfs_perag *pag,
101 const struct xfs_inobt_rec_incore *irec);
102int xfs_ialloc_has_inodes_at_extent(struct xfs_btree_cur *cur,
103 xfs_agblock_t bno, xfs_extlen_t len,
104 enum xbtree_recpacking *outcome);
105int xfs_ialloc_count_inodes(struct xfs_btree_cur *cur, xfs_agino_t *count,
106 xfs_agino_t *freecount);
107int xfs_inobt_insert_rec(struct xfs_btree_cur *cur, uint16_t holemask,
108 uint8_t count, int32_t freecount, xfs_inofree_t free,
109 int *stat);
110
111int xfs_ialloc_cluster_alignment(struct xfs_mount *mp);
112void xfs_ialloc_setup_geometry(struct xfs_mount *mp);
113xfs_ino_t xfs_ialloc_calc_rootino(struct xfs_mount *mp, int sunit);
114
115int xfs_ialloc_check_shrink(struct xfs_perag *pag, struct xfs_trans *tp,
116 struct xfs_buf *agibp, xfs_agblock_t new_length);
117
118#endif /* __XFS_IALLOC_H__ */
1/*
2 * Copyright (c) 2000,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
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.
8 *
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.
13 *
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
17 */
18#ifndef __XFS_IALLOC_H__
19#define __XFS_IALLOC_H__
20
21struct xfs_buf;
22struct xfs_dinode;
23struct xfs_imap;
24struct xfs_mount;
25struct xfs_trans;
26struct xfs_btree_cur;
27
28/* Move inodes in clusters of this size */
29#define XFS_INODE_BIG_CLUSTER_SIZE 8192
30
31struct xfs_icluster {
32 bool deleted; /* record is deleted */
33 xfs_ino_t first_ino; /* first inode number */
34 uint64_t alloc; /* inode phys. allocation bitmap for
35 * sparse chunks */
36};
37
38/* Calculate and return the number of filesystem blocks per inode cluster */
39static inline int
40xfs_icluster_size_fsb(
41 struct xfs_mount *mp)
42{
43 if (mp->m_sb.sb_blocksize >= mp->m_inode_cluster_size)
44 return 1;
45 return mp->m_inode_cluster_size >> mp->m_sb.sb_blocklog;
46}
47
48/*
49 * Make an inode pointer out of the buffer/offset.
50 */
51static inline struct xfs_dinode *
52xfs_make_iptr(struct xfs_mount *mp, struct xfs_buf *b, int o)
53{
54 return xfs_buf_offset(b, o << (mp)->m_sb.sb_inodelog);
55}
56
57/*
58 * Allocate an inode on disk.
59 * Mode is used to tell whether the new inode will need space, and whether
60 * it is a directory.
61 *
62 * To work within the constraint of one allocation per transaction,
63 * xfs_dialloc() is designed to be called twice if it has to do an
64 * allocation to make more free inodes. If an inode is
65 * available without an allocation, agbp would be set to the current
66 * agbp and alloc_done set to false.
67 * If an allocation needed to be done, agbp would be set to the
68 * inode header of the allocation group and alloc_done set to true.
69 * The caller should then commit the current transaction and allocate a new
70 * transaction. xfs_dialloc() should then be called again with
71 * the agbp value returned from the previous call.
72 *
73 * Once we successfully pick an inode its number is returned and the
74 * on-disk data structures are updated. The inode itself is not read
75 * in, since doing so would break ordering constraints with xfs_reclaim.
76 *
77 * *agbp should be set to NULL on the first call, *alloc_done set to FALSE.
78 */
79int /* error */
80xfs_dialloc(
81 struct xfs_trans *tp, /* transaction pointer */
82 xfs_ino_t parent, /* parent inode (directory) */
83 umode_t mode, /* mode bits for new inode */
84 int okalloc, /* ok to allocate more space */
85 struct xfs_buf **agbp, /* buf for a.g. inode header */
86 xfs_ino_t *inop); /* inode number allocated */
87
88/*
89 * Free disk inode. Carefully avoids touching the incore inode, all
90 * manipulations incore are the caller's responsibility.
91 * The on-disk inode is not changed by this operation, only the
92 * btree (free inode mask) is changed.
93 */
94int /* error */
95xfs_difree(
96 struct xfs_trans *tp, /* transaction pointer */
97 xfs_ino_t inode, /* inode to be freed */
98 struct xfs_bmap_free *flist, /* extents to free */
99 struct xfs_icluster *ifree); /* cluster info if deleted */
100
101/*
102 * Return the location of the inode in imap, for mapping it into a buffer.
103 */
104int
105xfs_imap(
106 struct xfs_mount *mp, /* file system mount structure */
107 struct xfs_trans *tp, /* transaction pointer */
108 xfs_ino_t ino, /* inode to locate */
109 struct xfs_imap *imap, /* location map structure */
110 uint flags); /* flags for inode btree lookup */
111
112/*
113 * Compute and fill in value of m_in_maxlevels.
114 */
115void
116xfs_ialloc_compute_maxlevels(
117 struct xfs_mount *mp); /* file system mount structure */
118
119/*
120 * Log specified fields for the ag hdr (inode section)
121 */
122void
123xfs_ialloc_log_agi(
124 struct xfs_trans *tp, /* transaction pointer */
125 struct xfs_buf *bp, /* allocation group header buffer */
126 int fields); /* bitmask of fields to log */
127
128/*
129 * Read in the allocation group header (inode allocation section)
130 */
131int /* error */
132xfs_ialloc_read_agi(
133 struct xfs_mount *mp, /* file system mount structure */
134 struct xfs_trans *tp, /* transaction pointer */
135 xfs_agnumber_t agno, /* allocation group number */
136 struct xfs_buf **bpp); /* allocation group hdr buf */
137
138/*
139 * Read in the allocation group header to initialise the per-ag data
140 * in the mount structure
141 */
142int
143xfs_ialloc_pagi_init(
144 struct xfs_mount *mp, /* file system mount structure */
145 struct xfs_trans *tp, /* transaction pointer */
146 xfs_agnumber_t agno); /* allocation group number */
147
148/*
149 * Lookup a record by ino in the btree given by cur.
150 */
151int xfs_inobt_lookup(struct xfs_btree_cur *cur, xfs_agino_t ino,
152 xfs_lookup_t dir, int *stat);
153
154/*
155 * Get the data from the pointed-to record.
156 */
157int xfs_inobt_get_rec(struct xfs_btree_cur *cur,
158 xfs_inobt_rec_incore_t *rec, int *stat);
159
160/*
161 * Inode chunk initialisation routine
162 */
163int xfs_ialloc_inode_init(struct xfs_mount *mp, struct xfs_trans *tp,
164 struct list_head *buffer_list, int icount,
165 xfs_agnumber_t agno, xfs_agblock_t agbno,
166 xfs_agblock_t length, unsigned int gen);
167
168int xfs_read_agi(struct xfs_mount *mp, struct xfs_trans *tp,
169 xfs_agnumber_t agno, struct xfs_buf **bpp);
170
171
172#endif /* __XFS_IALLOC_H__ */