Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
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. | |
1da177e4 | 13 | * |
7b718769 NS |
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 | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
70a9883c | 20 | #include "xfs_shared.h" |
a4fbe6ab | 21 | #include "xfs_format.h" |
239880ef DC |
22 | #include "xfs_log_format.h" |
23 | #include "xfs_trans_resv.h" | |
a844f451 | 24 | #include "xfs_inum.h" |
1da177e4 | 25 | #include "xfs_sb.h" |
a844f451 | 26 | #include "xfs_ag.h" |
1da177e4 | 27 | #include "xfs_mount.h" |
1da177e4 | 28 | #include "xfs_inode.h" |
a4fbe6ab | 29 | #include "xfs_btree.h" |
1da177e4 | 30 | #include "xfs_ialloc.h" |
a4fbe6ab | 31 | #include "xfs_ialloc_btree.h" |
1da177e4 LT |
32 | #include "xfs_itable.h" |
33 | #include "xfs_error.h" | |
f2d67614 | 34 | #include "xfs_trace.h" |
33479e05 | 35 | #include "xfs_icache.h" |
a4fbe6ab | 36 | #include "xfs_dinode.h" |
1da177e4 | 37 | |
d96f8f89 | 38 | STATIC int |
6f1f2168 VA |
39 | xfs_internal_inum( |
40 | xfs_mount_t *mp, | |
41 | xfs_ino_t ino) | |
42 | { | |
43 | return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino || | |
62118709 | 44 | (xfs_sb_version_hasquota(&mp->m_sb) && |
9cad19d2 | 45 | xfs_is_quota_inode(&mp->m_sb, ino))); |
6f1f2168 VA |
46 | } |
47 | ||
7dce11db CH |
48 | /* |
49 | * Return stat information for one inode. | |
50 | * Return 0 if ok, else errno. | |
51 | */ | |
52 | int | |
53 | xfs_bulkstat_one_int( | |
54 | struct xfs_mount *mp, /* mount point for filesystem */ | |
55 | xfs_ino_t ino, /* inode to get data for */ | |
56 | void __user *buffer, /* buffer to place output in */ | |
57 | int ubsize, /* size of buffer */ | |
58 | bulkstat_one_fmt_pf formatter, /* formatter, copy to user */ | |
7dce11db CH |
59 | int *ubused, /* bytes used by me */ |
60 | int *stat) /* BULKSTAT_RV_... */ | |
1da177e4 | 61 | { |
7dce11db CH |
62 | struct xfs_icdinode *dic; /* dinode core info pointer */ |
63 | struct xfs_inode *ip; /* incore inode pointer */ | |
7dce11db CH |
64 | struct xfs_bstat *buf; /* return buffer */ |
65 | int error = 0; /* error value */ | |
66 | ||
67 | *stat = BULKSTAT_RV_NOTHING; | |
68 | ||
69 | if (!buffer || xfs_internal_inum(mp, ino)) | |
2451337d | 70 | return -EINVAL; |
7dce11db CH |
71 | |
72 | buf = kmem_alloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL); | |
73 | if (!buf) | |
2451337d | 74 | return -ENOMEM; |
1da177e4 | 75 | |
745b1f47 | 76 | error = xfs_iget(mp, NULL, ino, |
5132ba8f DC |
77 | (XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED), |
78 | XFS_ILOCK_SHARED, &ip); | |
8fe65776 | 79 | if (error) |
7dce11db | 80 | goto out_free; |
1da177e4 LT |
81 | |
82 | ASSERT(ip != NULL); | |
92bfc6e7 | 83 | ASSERT(ip->i_imap.im_blkno != 0); |
1da177e4 LT |
84 | |
85 | dic = &ip->i_d; | |
86 | ||
87 | /* xfs_iget returns the following without needing | |
88 | * further change. | |
89 | */ | |
90 | buf->bs_nlink = dic->di_nlink; | |
6743099c AM |
91 | buf->bs_projid_lo = dic->di_projid_lo; |
92 | buf->bs_projid_hi = dic->di_projid_hi; | |
1da177e4 LT |
93 | buf->bs_ino = ino; |
94 | buf->bs_mode = dic->di_mode; | |
95 | buf->bs_uid = dic->di_uid; | |
96 | buf->bs_gid = dic->di_gid; | |
97 | buf->bs_size = dic->di_size; | |
8a9c9980 CH |
98 | buf->bs_atime.tv_sec = dic->di_atime.t_sec; |
99 | buf->bs_atime.tv_nsec = dic->di_atime.t_nsec; | |
100 | buf->bs_mtime.tv_sec = dic->di_mtime.t_sec; | |
101 | buf->bs_mtime.tv_nsec = dic->di_mtime.t_nsec; | |
102 | buf->bs_ctime.tv_sec = dic->di_ctime.t_sec; | |
103 | buf->bs_ctime.tv_nsec = dic->di_ctime.t_nsec; | |
1da177e4 LT |
104 | buf->bs_xflags = xfs_ip2xflags(ip); |
105 | buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog; | |
106 | buf->bs_extents = dic->di_nextents; | |
107 | buf->bs_gen = dic->di_gen; | |
108 | memset(buf->bs_pad, 0, sizeof(buf->bs_pad)); | |
109 | buf->bs_dmevmask = dic->di_dmevmask; | |
110 | buf->bs_dmstate = dic->di_dmstate; | |
111 | buf->bs_aextents = dic->di_anextents; | |
07000ee6 | 112 | buf->bs_forkoff = XFS_IFORK_BOFF(ip); |
1da177e4 LT |
113 | |
114 | switch (dic->di_format) { | |
115 | case XFS_DINODE_FMT_DEV: | |
116 | buf->bs_rdev = ip->i_df.if_u2.if_rdev; | |
117 | buf->bs_blksize = BLKDEV_IOSIZE; | |
118 | buf->bs_blocks = 0; | |
119 | break; | |
120 | case XFS_DINODE_FMT_LOCAL: | |
121 | case XFS_DINODE_FMT_UUID: | |
122 | buf->bs_rdev = 0; | |
123 | buf->bs_blksize = mp->m_sb.sb_blocksize; | |
124 | buf->bs_blocks = 0; | |
125 | break; | |
126 | case XFS_DINODE_FMT_EXTENTS: | |
127 | case XFS_DINODE_FMT_BTREE: | |
128 | buf->bs_rdev = 0; | |
129 | buf->bs_blksize = mp->m_sb.sb_blocksize; | |
130 | buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks; | |
131 | break; | |
132 | } | |
f2d67614 CH |
133 | xfs_iunlock(ip, XFS_ILOCK_SHARED); |
134 | IRELE(ip); | |
1da177e4 | 135 | |
7dce11db | 136 | error = formatter(buffer, ubsize, ubused, buf); |
7dce11db CH |
137 | if (!error) |
138 | *stat = BULKSTAT_RV_DIDONE; | |
1da177e4 | 139 | |
7dce11db CH |
140 | out_free: |
141 | kmem_free(buf); | |
142 | return error; | |
1da177e4 LT |
143 | } |
144 | ||
65fbaf24 | 145 | /* Return 0 on success or positive error */ |
faa63e95 MM |
146 | STATIC int |
147 | xfs_bulkstat_one_fmt( | |
148 | void __user *ubuffer, | |
65fbaf24 | 149 | int ubsize, |
150 | int *ubused, | |
faa63e95 MM |
151 | const xfs_bstat_t *buffer) |
152 | { | |
65fbaf24 | 153 | if (ubsize < sizeof(*buffer)) |
2451337d | 154 | return -ENOMEM; |
faa63e95 | 155 | if (copy_to_user(ubuffer, buffer, sizeof(*buffer))) |
2451337d | 156 | return -EFAULT; |
65fbaf24 | 157 | if (ubused) |
158 | *ubused = sizeof(*buffer); | |
159 | return 0; | |
faa63e95 MM |
160 | } |
161 | ||
2ee4fa5c | 162 | int |
163 | xfs_bulkstat_one( | |
164 | xfs_mount_t *mp, /* mount point for filesystem */ | |
165 | xfs_ino_t ino, /* inode number to get data for */ | |
166 | void __user *buffer, /* buffer to place output in */ | |
167 | int ubsize, /* size of buffer */ | |
2ee4fa5c | 168 | int *ubused, /* bytes used by me */ |
2ee4fa5c | 169 | int *stat) /* BULKSTAT_RV_... */ |
170 | { | |
171 | return xfs_bulkstat_one_int(mp, ino, buffer, ubsize, | |
7b6259e7 | 172 | xfs_bulkstat_one_fmt, ubused, stat); |
8b56f083 NS |
173 | } |
174 | ||
4b8fdfec JL |
175 | /* |
176 | * Loop over all clusters in a chunk for a given incore inode allocation btree | |
177 | * record. Do a readahead if there are any allocated inodes in that cluster. | |
178 | */ | |
179 | STATIC void | |
180 | xfs_bulkstat_ichunk_ra( | |
181 | struct xfs_mount *mp, | |
182 | xfs_agnumber_t agno, | |
183 | struct xfs_inobt_rec_incore *irec) | |
184 | { | |
185 | xfs_agblock_t agbno; | |
186 | struct blk_plug plug; | |
187 | int blks_per_cluster; | |
188 | int inodes_per_cluster; | |
189 | int i; /* inode chunk index */ | |
190 | ||
191 | agbno = XFS_AGINO_TO_AGBNO(mp, irec->ir_startino); | |
192 | blks_per_cluster = xfs_icluster_size_fsb(mp); | |
193 | inodes_per_cluster = blks_per_cluster << mp->m_sb.sb_inopblog; | |
194 | ||
195 | blk_start_plug(&plug); | |
196 | for (i = 0; i < XFS_INODES_PER_CHUNK; | |
197 | i += inodes_per_cluster, agbno += blks_per_cluster) { | |
198 | if (xfs_inobt_maskn(i, inodes_per_cluster) & ~irec->ir_free) { | |
199 | xfs_btree_reada_bufs(mp, agno, agbno, blks_per_cluster, | |
200 | &xfs_inode_buf_ops); | |
201 | } | |
202 | } | |
203 | blk_finish_plug(&plug); | |
204 | } | |
205 | ||
f3d1e587 JL |
206 | /* |
207 | * Lookup the inode chunk that the given inode lives in and then get the record | |
208 | * if we found the chunk. If the inode was not the last in the chunk and there | |
209 | * are some left allocated, update the data for the pointed-to record as well as | |
210 | * return the count of grabbed inodes. | |
211 | */ | |
212 | STATIC int | |
213 | xfs_bulkstat_grab_ichunk( | |
214 | struct xfs_btree_cur *cur, /* btree cursor */ | |
215 | xfs_agino_t agino, /* starting inode of chunk */ | |
216 | int *icount,/* return # of inodes grabbed */ | |
217 | struct xfs_inobt_rec_incore *irec) /* btree record */ | |
218 | { | |
219 | int idx; /* index into inode chunk */ | |
220 | int stat; | |
221 | int error = 0; | |
222 | ||
223 | /* Lookup the inode chunk that this inode lives in */ | |
224 | error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &stat); | |
225 | if (error) | |
226 | return error; | |
227 | if (!stat) { | |
228 | *icount = 0; | |
229 | return error; | |
230 | } | |
231 | ||
232 | /* Get the record, should always work */ | |
233 | error = xfs_inobt_get_rec(cur, irec, &stat); | |
234 | if (error) | |
235 | return error; | |
236 | XFS_WANT_CORRUPTED_RETURN(stat == 1); | |
237 | ||
238 | /* Check if the record contains the inode in request */ | |
febe3cbe DC |
239 | if (irec->ir_startino + XFS_INODES_PER_CHUNK <= agino) { |
240 | *icount = 0; | |
241 | return 0; | |
242 | } | |
f3d1e587 JL |
243 | |
244 | idx = agino - irec->ir_startino + 1; | |
245 | if (idx < XFS_INODES_PER_CHUNK && | |
246 | (xfs_inobt_maskn(idx, XFS_INODES_PER_CHUNK - idx) & ~irec->ir_free)) { | |
247 | int i; | |
248 | ||
249 | /* We got a right chunk with some left inodes allocated at it. | |
250 | * Grab the chunk record. Mark all the uninteresting inodes | |
251 | * free -- because they're before our start point. | |
252 | */ | |
253 | for (i = 0; i < idx; i++) { | |
254 | if (XFS_INOBT_MASK(i) & ~irec->ir_free) | |
255 | irec->ir_freecount++; | |
256 | } | |
257 | ||
258 | irec->ir_free |= xfs_inobt_maskn(0, idx); | |
259 | *icount = XFS_INODES_PER_CHUNK - irec->ir_freecount; | |
260 | } | |
261 | ||
262 | return 0; | |
263 | } | |
264 | ||
cd57e594 LM |
265 | #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size) |
266 | ||
bf4a5af2 DC |
267 | struct xfs_bulkstat_agichunk { |
268 | char __user **ac_ubuffer;/* pointer into user's buffer */ | |
269 | int ac_ubleft; /* bytes left in user's buffer */ | |
270 | int ac_ubelem; /* spaces used in user's buffer */ | |
271 | }; | |
272 | ||
1e773c49 JL |
273 | /* |
274 | * Process inodes in chunk with a pointer to a formatter function | |
275 | * that will iget the inode and fill in the appropriate structure. | |
276 | */ | |
bf4a5af2 | 277 | static int |
1e773c49 JL |
278 | xfs_bulkstat_ag_ichunk( |
279 | struct xfs_mount *mp, | |
280 | xfs_agnumber_t agno, | |
281 | struct xfs_inobt_rec_incore *irbp, | |
282 | bulkstat_one_pf formatter, | |
283 | size_t statstruct_size, | |
bf4a5af2 DC |
284 | struct xfs_bulkstat_agichunk *acp, |
285 | xfs_ino_t *lastino) | |
1e773c49 | 286 | { |
1e773c49 | 287 | char __user **ubufp = acp->ac_ubuffer; |
2b831ac6 | 288 | int chunkidx; |
1e773c49 JL |
289 | int error = 0; |
290 | xfs_agino_t agino; | |
291 | ||
2b831ac6 DC |
292 | agino = irbp->ir_startino; |
293 | for (chunkidx = 0; chunkidx < XFS_INODES_PER_CHUNK; | |
294 | chunkidx++, agino++) { | |
295 | int fmterror; | |
1e773c49 JL |
296 | int ubused; |
297 | xfs_ino_t ino = XFS_AGINO_TO_INO(mp, agno, agino); | |
298 | ||
1e773c49 JL |
299 | /* Skip if this inode is free */ |
300 | if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) { | |
bf4a5af2 | 301 | *lastino = ino; |
1e773c49 JL |
302 | continue; |
303 | } | |
304 | ||
1e773c49 JL |
305 | /* Get the inode and fill in a single buffer */ |
306 | ubused = statstruct_size; | |
2b831ac6 DC |
307 | error = formatter(mp, ino, *ubufp, acp->ac_ubleft, |
308 | &ubused, &fmterror); | |
309 | if (fmterror == BULKSTAT_RV_GIVEUP || | |
310 | (error && error != -ENOENT && error != -EINVAL)) { | |
311 | acp->ac_ubleft = 0; | |
1e773c49 JL |
312 | ASSERT(error); |
313 | break; | |
314 | } | |
2b831ac6 DC |
315 | |
316 | /* be careful not to leak error if at end of chunk */ | |
317 | if (fmterror == BULKSTAT_RV_NOTHING || error) { | |
318 | *lastino = ino; | |
319 | error = 0; | |
320 | continue; | |
321 | } | |
322 | ||
323 | *ubufp += ubused; | |
324 | acp->ac_ubleft -= ubused; | |
325 | acp->ac_ubelem++; | |
bf4a5af2 | 326 | *lastino = ino; |
1e773c49 | 327 | |
2b831ac6 DC |
328 | if (acp->ac_ubleft < statstruct_size) |
329 | break; | |
330 | } | |
1e773c49 JL |
331 | |
332 | return error; | |
333 | } | |
334 | ||
1da177e4 LT |
335 | /* |
336 | * Return stat information in bulk (by-inode) for the filesystem. | |
337 | */ | |
338 | int /* error status */ | |
339 | xfs_bulkstat( | |
340 | xfs_mount_t *mp, /* mount point for filesystem */ | |
341 | xfs_ino_t *lastinop, /* last inode returned */ | |
342 | int *ubcountp, /* size of buffer/count returned */ | |
343 | bulkstat_one_pf formatter, /* func that'd fill a single buf */ | |
1da177e4 LT |
344 | size_t statstruct_size, /* sizeof struct filling */ |
345 | char __user *ubuffer, /* buffer with inode stats */ | |
c41564b5 | 346 | int *done) /* 1 if there are more stats to get */ |
1da177e4 | 347 | { |
1da177e4 LT |
348 | xfs_buf_t *agbp; /* agi header buffer */ |
349 | xfs_agi_t *agi; /* agi header data */ | |
350 | xfs_agino_t agino; /* inode # in allocation group */ | |
351 | xfs_agnumber_t agno; /* allocation group number */ | |
1da177e4 | 352 | xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */ |
215101c3 | 353 | size_t irbsize; /* size of irec buffer in bytes */ |
26275093 | 354 | xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */ |
cd57e594 | 355 | xfs_ino_t lastino; /* last inode number returned */ |
1da177e4 | 356 | int nirbuf; /* size of irbuf */ |
1da177e4 | 357 | int ubcount; /* size of user's buffer */ |
bf4a5af2 | 358 | struct xfs_bulkstat_agichunk ac; |
6e57c542 | 359 | int error = 0; |
1da177e4 LT |
360 | |
361 | /* | |
362 | * Get the last inode value, see if there's nothing to do. | |
363 | */ | |
6e57c542 DC |
364 | lastino = *lastinop; |
365 | agno = XFS_INO_TO_AGNO(mp, lastino); | |
366 | agino = XFS_INO_TO_AGINO(mp, lastino); | |
1da177e4 | 367 | if (agno >= mp->m_sb.sb_agcount || |
6e57c542 | 368 | lastino != XFS_AGINO_TO_INO(mp, agno, agino)) { |
1da177e4 LT |
369 | *done = 1; |
370 | *ubcountp = 0; | |
371 | return 0; | |
372 | } | |
296dfd7f | 373 | |
1da177e4 | 374 | ubcount = *ubcountp; /* statstruct's */ |
bf4a5af2 DC |
375 | ac.ac_ubuffer = &ubuffer; |
376 | ac.ac_ubleft = ubcount * statstruct_size; /* bytes */; | |
377 | ac.ac_ubelem = 0; | |
378 | ||
379 | *ubcountp = 0; | |
1da177e4 | 380 | *done = 0; |
bf4a5af2 | 381 | |
bdfb0430 CH |
382 | irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4); |
383 | if (!irbuf) | |
2451337d | 384 | return -ENOMEM; |
bdfb0430 | 385 | |
bb3c7d29 NS |
386 | nirbuf = irbsize / sizeof(*irbuf); |
387 | ||
1da177e4 LT |
388 | /* |
389 | * Loop over the allocation groups, starting from the last | |
390 | * inode returned; 0 means start of the allocation group. | |
391 | */ | |
6e57c542 DC |
392 | while (agno < mp->m_sb.sb_agcount) { |
393 | struct xfs_inobt_rec_incore *irbp = irbuf; | |
394 | struct xfs_inobt_rec_incore *irbufend = irbuf + nirbuf; | |
395 | bool end_of_ag = false; | |
396 | int icount = 0; | |
397 | int stat; | |
398 | ||
1da177e4 | 399 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); |
d4c27348 JL |
400 | if (error) |
401 | break; | |
1da177e4 LT |
402 | agi = XFS_BUF_TO_AGI(agbp); |
403 | /* | |
404 | * Allocate and initialize a btree cursor for ialloc btree. | |
405 | */ | |
57bd3dbe BF |
406 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno, |
407 | XFS_BTNUM_INO); | |
1da177e4 LT |
408 | if (agino > 0) { |
409 | /* | |
f3d1e587 JL |
410 | * In the middle of an allocation group, we need to get |
411 | * the remainder of the chunk we're in. | |
1da177e4 | 412 | */ |
f3d1e587 JL |
413 | struct xfs_inobt_rec_incore r; |
414 | ||
415 | error = xfs_bulkstat_grab_ichunk(cur, agino, &icount, &r); | |
416 | if (error) | |
a6bbce54 | 417 | goto del_cursor; |
f3d1e587 | 418 | if (icount) { |
2e287a73 CH |
419 | irbp->ir_startino = r.ir_startino; |
420 | irbp->ir_freecount = r.ir_freecount; | |
421 | irbp->ir_free = r.ir_free; | |
1da177e4 | 422 | irbp++; |
2e287a73 | 423 | agino = r.ir_startino + XFS_INODES_PER_CHUNK; |
1da177e4 | 424 | } |
f3d1e587 | 425 | /* Increment to the next record */ |
afa947cb | 426 | error = xfs_btree_increment(cur, 0, &stat); |
1da177e4 | 427 | } else { |
f3d1e587 | 428 | /* Start of ag. Lookup the first inode chunk */ |
afa947cb | 429 | error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &stat); |
1da177e4 | 430 | } |
afa947cb | 431 | if (error || stat == 0) { |
6e57c542 | 432 | end_of_ag = true; |
a6bbce54 | 433 | goto del_cursor; |
afa947cb | 434 | } |
d4c27348 | 435 | |
1da177e4 LT |
436 | /* |
437 | * Loop through inode btree records in this ag, | |
438 | * until we run out of inodes or space in the buffer. | |
439 | */ | |
440 | while (irbp < irbufend && icount < ubcount) { | |
d4c27348 | 441 | struct xfs_inobt_rec_incore r; |
2e287a73 | 442 | |
afa947cb DC |
443 | error = xfs_inobt_get_rec(cur, &r, &stat); |
444 | if (error || stat == 0) { | |
6e57c542 | 445 | end_of_ag = true; |
a6bbce54 | 446 | goto del_cursor; |
1da177e4 | 447 | } |
2e287a73 | 448 | |
1da177e4 LT |
449 | /* |
450 | * If this chunk has any allocated inodes, save it. | |
26275093 | 451 | * Also start read-ahead now for this chunk. |
1da177e4 | 452 | */ |
2e287a73 | 453 | if (r.ir_freecount < XFS_INODES_PER_CHUNK) { |
4b8fdfec | 454 | xfs_bulkstat_ichunk_ra(mp, agno, &r); |
2e287a73 CH |
455 | irbp->ir_startino = r.ir_startino; |
456 | irbp->ir_freecount = r.ir_freecount; | |
457 | irbp->ir_free = r.ir_free; | |
1da177e4 | 458 | irbp++; |
2e287a73 | 459 | icount += XFS_INODES_PER_CHUNK - r.ir_freecount; |
1da177e4 LT |
460 | } |
461 | /* | |
462 | * Set agino to after this chunk and bump the cursor. | |
463 | */ | |
2e287a73 | 464 | agino = r.ir_startino + XFS_INODES_PER_CHUNK; |
afa947cb DC |
465 | error = xfs_btree_increment(cur, 0, &stat); |
466 | if (error || stat == 0) { | |
6e57c542 | 467 | end_of_ag = true; |
7a19dee1 JK |
468 | goto del_cursor; |
469 | } | |
cd57e594 | 470 | cond_resched(); |
1da177e4 | 471 | } |
a6bbce54 | 472 | |
1da177e4 | 473 | /* |
a6bbce54 DC |
474 | * Drop the btree buffers and the agi buffer as we can't hold any |
475 | * of the locks these represent when calling iget. If there is a | |
476 | * pending error, then we are done. | |
1da177e4 | 477 | */ |
a6bbce54 | 478 | del_cursor: |
1da177e4 LT |
479 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); |
480 | xfs_buf_relse(agbp); | |
a6bbce54 DC |
481 | if (error) |
482 | break; | |
1da177e4 LT |
483 | /* |
484 | * Now format all the good inodes into the user's buffer. | |
485 | */ | |
486 | irbufend = irbp; | |
487 | for (irbp = irbuf; | |
6e57c542 | 488 | irbp < irbufend && ac.ac_ubleft >= statstruct_size; |
bf4a5af2 | 489 | irbp++) { |
1e773c49 | 490 | error = xfs_bulkstat_ag_ichunk(mp, agno, irbp, |
bf4a5af2 DC |
491 | formatter, statstruct_size, &ac, |
492 | &lastino); | |
1e773c49 | 493 | if (error) |
febe3cbe | 494 | break; |
1e773c49 | 495 | |
cd57e594 | 496 | cond_resched(); |
1da177e4 | 497 | } |
bf4a5af2 | 498 | |
febe3cbe DC |
499 | /* |
500 | * If we've run out of space or had a formatting error, we | |
501 | * are now done | |
502 | */ | |
503 | if (ac.ac_ubleft < statstruct_size || error) | |
1da177e4 | 504 | break; |
6e57c542 DC |
505 | |
506 | if (end_of_ag) { | |
507 | agno++; | |
508 | agino = 0; | |
509 | } else | |
510 | agino = XFS_INO_TO_AGINO(mp, lastino); | |
1da177e4 LT |
511 | } |
512 | /* | |
513 | * Done, we're either out of filesystem or space to put the data. | |
514 | */ | |
fdd3ccee | 515 | kmem_free(irbuf); |
bf4a5af2 | 516 | *ubcountp = ac.ac_ubelem; |
febe3cbe | 517 | |
cd57e594 | 518 | /* |
febe3cbe DC |
519 | * We found some inodes, so clear the error status and return them. |
520 | * The lastino pointer will point directly at the inode that triggered | |
521 | * any error that occurred, so on the next call the error will be | |
522 | * triggered again and propagated to userspace as there will be no | |
523 | * formatted inodes in the buffer. | |
cd57e594 | 524 | */ |
bf4a5af2 | 525 | if (ac.ac_ubelem) |
febe3cbe DC |
526 | error = 0; |
527 | ||
1da177e4 LT |
528 | if (agno >= mp->m_sb.sb_agcount) { |
529 | /* | |
530 | * If we ran out of filesystem, mark lastino as off | |
531 | * the end of the filesystem, so the next call | |
532 | * will return immediately. | |
533 | */ | |
534 | *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0); | |
535 | *done = 1; | |
536 | } else | |
537 | *lastinop = (xfs_ino_t)lastino; | |
538 | ||
febe3cbe | 539 | return error; |
1da177e4 LT |
540 | } |
541 | ||
faa63e95 MM |
542 | int |
543 | xfs_inumbers_fmt( | |
544 | void __user *ubuffer, /* buffer to write to */ | |
549fa006 | 545 | const struct xfs_inogrp *buffer, /* buffer to read from */ |
faa63e95 MM |
546 | long count, /* # of elements to read */ |
547 | long *written) /* # of bytes written */ | |
548 | { | |
549 | if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer))) | |
550 | return -EFAULT; | |
551 | *written = count * sizeof(*buffer); | |
552 | return 0; | |
553 | } | |
554 | ||
1da177e4 LT |
555 | /* |
556 | * Return inode number table for the filesystem. | |
557 | */ | |
558 | int /* error status */ | |
559 | xfs_inumbers( | |
549fa006 JL |
560 | struct xfs_mount *mp,/* mount point for filesystem */ |
561 | xfs_ino_t *lastino,/* last inode returned */ | |
562 | int *count,/* size of buffer/count returned */ | |
563 | void __user *ubuffer,/* buffer with inode descriptions */ | |
564 | inumbers_fmt_pf formatter) | |
1da177e4 | 565 | { |
549fa006 JL |
566 | xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino); |
567 | xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino); | |
568 | struct xfs_btree_cur *cur = NULL; | |
c7cb51dc | 569 | struct xfs_buf *agbp = NULL; |
549fa006 JL |
570 | struct xfs_inogrp *buffer; |
571 | int bcount; | |
572 | int left = *count; | |
573 | int bufidx = 0; | |
574 | int error = 0; | |
575 | ||
1da177e4 | 576 | *count = 0; |
549fa006 JL |
577 | if (agno >= mp->m_sb.sb_agcount || |
578 | *lastino != XFS_AGINO_TO_INO(mp, agno, agino)) | |
579 | return error; | |
580 | ||
e6a4b37f | 581 | bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer))); |
1da177e4 | 582 | buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP); |
c7cb51dc | 583 | do { |
549fa006 JL |
584 | struct xfs_inobt_rec_incore r; |
585 | int stat; | |
586 | ||
c7cb51dc | 587 | if (!agbp) { |
1da177e4 | 588 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); |
c7cb51dc JL |
589 | if (error) |
590 | break; | |
591 | ||
57bd3dbe BF |
592 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno, |
593 | XFS_BTNUM_INO); | |
21875505 | 594 | error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE, |
549fa006 | 595 | &stat); |
c7cb51dc JL |
596 | if (error) |
597 | break; | |
598 | if (!stat) | |
599 | goto next_ag; | |
1da177e4 | 600 | } |
c7cb51dc | 601 | |
549fa006 | 602 | error = xfs_inobt_get_rec(cur, &r, &stat); |
c7cb51dc JL |
603 | if (error) |
604 | break; | |
605 | if (!stat) | |
606 | goto next_ag; | |
607 | ||
2e287a73 CH |
608 | agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1; |
609 | buffer[bufidx].xi_startino = | |
610 | XFS_AGINO_TO_INO(mp, agno, r.ir_startino); | |
611 | buffer[bufidx].xi_alloccount = | |
612 | XFS_INODES_PER_CHUNK - r.ir_freecount; | |
613 | buffer[bufidx].xi_allocmask = ~r.ir_free; | |
c7cb51dc JL |
614 | if (++bufidx == bcount) { |
615 | long written; | |
616 | ||
549fa006 JL |
617 | error = formatter(ubuffer, buffer, bufidx, &written); |
618 | if (error) | |
1da177e4 | 619 | break; |
faa63e95 | 620 | ubuffer += written; |
1da177e4 LT |
621 | *count += bufidx; |
622 | bufidx = 0; | |
623 | } | |
c7cb51dc JL |
624 | if (!--left) |
625 | break; | |
626 | ||
627 | error = xfs_btree_increment(cur, 0, &stat); | |
628 | if (error) | |
629 | break; | |
630 | if (stat) | |
631 | continue; | |
632 | ||
633 | next_ag: | |
634 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); | |
635 | cur = NULL; | |
636 | xfs_buf_relse(agbp); | |
637 | agbp = NULL; | |
638 | agino = 0; | |
a8b1ee8b ES |
639 | agno++; |
640 | } while (agno < mp->m_sb.sb_agcount); | |
c7cb51dc | 641 | |
1da177e4 LT |
642 | if (!error) { |
643 | if (bufidx) { | |
c7cb51dc JL |
644 | long written; |
645 | ||
549fa006 JL |
646 | error = formatter(ubuffer, buffer, bufidx, &written); |
647 | if (!error) | |
1da177e4 LT |
648 | *count += bufidx; |
649 | } | |
650 | *lastino = XFS_AGINO_TO_INO(mp, agno, agino); | |
651 | } | |
c7cb51dc | 652 | |
f0e2d93c | 653 | kmem_free(buffer); |
1da177e4 LT |
654 | if (cur) |
655 | xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR : | |
656 | XFS_BTREE_NOERROR)); | |
657 | if (agbp) | |
658 | xfs_buf_relse(agbp); | |
c7cb51dc | 659 | |
1da177e4 LT |
660 | return error; |
661 | } |