]>
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 | ||
cd57e594 LM |
175 | #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size) |
176 | ||
1da177e4 LT |
177 | /* |
178 | * Return stat information in bulk (by-inode) for the filesystem. | |
179 | */ | |
180 | int /* error status */ | |
181 | xfs_bulkstat( | |
182 | xfs_mount_t *mp, /* mount point for filesystem */ | |
183 | xfs_ino_t *lastinop, /* last inode returned */ | |
184 | int *ubcountp, /* size of buffer/count returned */ | |
185 | bulkstat_one_pf formatter, /* func that'd fill a single buf */ | |
1da177e4 LT |
186 | size_t statstruct_size, /* sizeof struct filling */ |
187 | char __user *ubuffer, /* buffer with inode stats */ | |
c41564b5 | 188 | int *done) /* 1 if there are more stats to get */ |
1da177e4 LT |
189 | { |
190 | xfs_agblock_t agbno=0;/* allocation group block number */ | |
191 | xfs_buf_t *agbp; /* agi header buffer */ | |
192 | xfs_agi_t *agi; /* agi header data */ | |
193 | xfs_agino_t agino; /* inode # in allocation group */ | |
194 | xfs_agnumber_t agno; /* allocation group number */ | |
1da177e4 LT |
195 | int chunkidx; /* current index into inode chunk */ |
196 | int clustidx; /* current index into inode cluster */ | |
197 | xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */ | |
198 | int end_of_ag; /* set if we've seen the ag end */ | |
199 | int error; /* error code */ | |
200 | int fmterror;/* bulkstat formatter result */ | |
1da177e4 LT |
201 | int i; /* loop index */ |
202 | int icount; /* count of inodes good in irbuf */ | |
215101c3 | 203 | size_t irbsize; /* size of irec buffer in bytes */ |
1da177e4 | 204 | xfs_ino_t ino; /* inode number (filesystem) */ |
26275093 NS |
205 | xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */ |
206 | xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */ | |
207 | xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */ | |
cd57e594 | 208 | xfs_ino_t lastino; /* last inode number returned */ |
a2ba07b2 JL |
209 | int blks_per_cluster; /* # of blocks per cluster */ |
210 | int inodes_per_cluster;/* # of inodes per cluster */ | |
1da177e4 LT |
211 | int nirbuf; /* size of irbuf */ |
212 | int rval; /* return value error code */ | |
213 | int tmp; /* result value from btree calls */ | |
214 | int ubcount; /* size of user's buffer */ | |
215 | int ubleft; /* bytes left in user's buffer */ | |
216 | char __user *ubufp; /* pointer into user's buffer */ | |
217 | int ubelem; /* spaces used in user's buffer */ | |
218 | int ubused; /* bytes used by formatter */ | |
1da177e4 LT |
219 | |
220 | /* | |
221 | * Get the last inode value, see if there's nothing to do. | |
222 | */ | |
223 | ino = (xfs_ino_t)*lastinop; | |
cd57e594 | 224 | lastino = ino; |
1da177e4 LT |
225 | agno = XFS_INO_TO_AGNO(mp, ino); |
226 | agino = XFS_INO_TO_AGINO(mp, ino); | |
227 | if (agno >= mp->m_sb.sb_agcount || | |
228 | ino != XFS_AGINO_TO_INO(mp, agno, agino)) { | |
229 | *done = 1; | |
230 | *ubcountp = 0; | |
231 | return 0; | |
232 | } | |
296dfd7f | 233 | |
1da177e4 LT |
234 | ubcount = *ubcountp; /* statstruct's */ |
235 | ubleft = ubcount * statstruct_size; /* bytes */ | |
236 | *ubcountp = ubelem = 0; | |
237 | *done = 0; | |
238 | fmterror = 0; | |
239 | ubufp = ubuffer; | |
a2ba07b2 JL |
240 | blks_per_cluster = xfs_icluster_size_fsb(mp); |
241 | inodes_per_cluster = blks_per_cluster << mp->m_sb.sb_inopblog; | |
bdfb0430 CH |
242 | irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4); |
243 | if (!irbuf) | |
2451337d | 244 | return -ENOMEM; |
bdfb0430 | 245 | |
bb3c7d29 NS |
246 | nirbuf = irbsize / sizeof(*irbuf); |
247 | ||
1da177e4 LT |
248 | /* |
249 | * Loop over the allocation groups, starting from the last | |
250 | * inode returned; 0 means start of the allocation group. | |
251 | */ | |
252 | rval = 0; | |
cd57e594 LM |
253 | while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) { |
254 | cond_resched(); | |
1da177e4 | 255 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); |
1da177e4 LT |
256 | if (error) { |
257 | /* | |
258 | * Skip this allocation group and go to the next one. | |
259 | */ | |
260 | agno++; | |
261 | agino = 0; | |
262 | continue; | |
263 | } | |
264 | agi = XFS_BUF_TO_AGI(agbp); | |
265 | /* | |
266 | * Allocate and initialize a btree cursor for ialloc btree. | |
267 | */ | |
57bd3dbe BF |
268 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno, |
269 | XFS_BTNUM_INO); | |
1da177e4 LT |
270 | irbp = irbuf; |
271 | irbufend = irbuf + nirbuf; | |
272 | end_of_ag = 0; | |
273 | /* | |
274 | * If we're returning in the middle of an allocation group, | |
275 | * we need to get the remainder of the chunk we're in. | |
276 | */ | |
277 | if (agino > 0) { | |
2e287a73 CH |
278 | xfs_inobt_rec_incore_t r; |
279 | ||
1da177e4 LT |
280 | /* |
281 | * Lookup the inode chunk that this inode lives in. | |
282 | */ | |
21875505 CH |
283 | error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, |
284 | &tmp); | |
1da177e4 LT |
285 | if (!error && /* no I/O error */ |
286 | tmp && /* lookup succeeded */ | |
287 | /* got the record, should always work */ | |
2e287a73 | 288 | !(error = xfs_inobt_get_rec(cur, &r, &i)) && |
1da177e4 LT |
289 | i == 1 && |
290 | /* this is the right chunk */ | |
2e287a73 | 291 | agino < r.ir_startino + XFS_INODES_PER_CHUNK && |
1da177e4 | 292 | /* lastino was not last in chunk */ |
2e287a73 | 293 | (chunkidx = agino - r.ir_startino + 1) < |
1da177e4 LT |
294 | XFS_INODES_PER_CHUNK && |
295 | /* there are some left allocated */ | |
9d87c319 | 296 | xfs_inobt_maskn(chunkidx, |
2e287a73 CH |
297 | XFS_INODES_PER_CHUNK - chunkidx) & |
298 | ~r.ir_free) { | |
1da177e4 LT |
299 | /* |
300 | * Grab the chunk record. Mark all the | |
301 | * uninteresting inodes (because they're | |
302 | * before our start point) free. | |
303 | */ | |
304 | for (i = 0; i < chunkidx; i++) { | |
2e287a73 CH |
305 | if (XFS_INOBT_MASK(i) & ~r.ir_free) |
306 | r.ir_freecount++; | |
1da177e4 | 307 | } |
2e287a73 CH |
308 | r.ir_free |= xfs_inobt_maskn(0, chunkidx); |
309 | irbp->ir_startino = r.ir_startino; | |
310 | irbp->ir_freecount = r.ir_freecount; | |
311 | irbp->ir_free = r.ir_free; | |
1da177e4 | 312 | irbp++; |
2e287a73 CH |
313 | agino = r.ir_startino + XFS_INODES_PER_CHUNK; |
314 | icount = XFS_INODES_PER_CHUNK - r.ir_freecount; | |
1da177e4 LT |
315 | } else { |
316 | /* | |
317 | * If any of those tests failed, bump the | |
318 | * inode number (just in case). | |
319 | */ | |
320 | agino++; | |
321 | icount = 0; | |
322 | } | |
323 | /* | |
324 | * In any case, increment to the next record. | |
325 | */ | |
326 | if (!error) | |
637aa50f | 327 | error = xfs_btree_increment(cur, 0, &tmp); |
1da177e4 LT |
328 | } else { |
329 | /* | |
330 | * Start of ag. Lookup the first inode chunk. | |
331 | */ | |
21875505 | 332 | error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &tmp); |
1da177e4 LT |
333 | icount = 0; |
334 | } | |
335 | /* | |
336 | * Loop through inode btree records in this ag, | |
337 | * until we run out of inodes or space in the buffer. | |
338 | */ | |
339 | while (irbp < irbufend && icount < ubcount) { | |
2e287a73 CH |
340 | xfs_inobt_rec_incore_t r; |
341 | ||
1da177e4 LT |
342 | /* |
343 | * Loop as long as we're unable to read the | |
344 | * inode btree. | |
345 | */ | |
346 | while (error) { | |
347 | agino += XFS_INODES_PER_CHUNK; | |
348 | if (XFS_AGINO_TO_AGBNO(mp, agino) >= | |
16259e7d | 349 | be32_to_cpu(agi->agi_length)) |
1da177e4 | 350 | break; |
21875505 CH |
351 | error = xfs_inobt_lookup(cur, agino, |
352 | XFS_LOOKUP_GE, &tmp); | |
cd57e594 | 353 | cond_resched(); |
1da177e4 LT |
354 | } |
355 | /* | |
356 | * If ran off the end of the ag either with an error, | |
357 | * or the normal way, set end and stop collecting. | |
358 | */ | |
2e287a73 CH |
359 | if (error) { |
360 | end_of_ag = 1; | |
361 | break; | |
362 | } | |
363 | ||
364 | error = xfs_inobt_get_rec(cur, &r, &i); | |
365 | if (error || i == 0) { | |
1da177e4 LT |
366 | end_of_ag = 1; |
367 | break; | |
368 | } | |
2e287a73 | 369 | |
1da177e4 LT |
370 | /* |
371 | * If this chunk has any allocated inodes, save it. | |
26275093 | 372 | * Also start read-ahead now for this chunk. |
1da177e4 | 373 | */ |
2e287a73 | 374 | if (r.ir_freecount < XFS_INODES_PER_CHUNK) { |
cbb2864a | 375 | struct blk_plug plug; |
26275093 NS |
376 | /* |
377 | * Loop over all clusters in the next chunk. | |
378 | * Do a readahead if there are any allocated | |
379 | * inodes in that cluster. | |
380 | */ | |
cbb2864a | 381 | blk_start_plug(&plug); |
2e287a73 CH |
382 | agbno = XFS_AGINO_TO_AGBNO(mp, r.ir_startino); |
383 | for (chunkidx = 0; | |
26275093 | 384 | chunkidx < XFS_INODES_PER_CHUNK; |
a2ba07b2 JL |
385 | chunkidx += inodes_per_cluster, |
386 | agbno += blks_per_cluster) { | |
387 | if (xfs_inobt_maskn(chunkidx, | |
388 | inodes_per_cluster) & ~r.ir_free) | |
26275093 | 389 | xfs_btree_reada_bufs(mp, agno, |
a2ba07b2 | 390 | agbno, blks_per_cluster, |
1813dd64 | 391 | &xfs_inode_buf_ops); |
26275093 | 392 | } |
cbb2864a | 393 | blk_finish_plug(&plug); |
2e287a73 CH |
394 | irbp->ir_startino = r.ir_startino; |
395 | irbp->ir_freecount = r.ir_freecount; | |
396 | irbp->ir_free = r.ir_free; | |
1da177e4 | 397 | irbp++; |
2e287a73 | 398 | icount += XFS_INODES_PER_CHUNK - r.ir_freecount; |
1da177e4 LT |
399 | } |
400 | /* | |
401 | * Set agino to after this chunk and bump the cursor. | |
402 | */ | |
2e287a73 | 403 | agino = r.ir_startino + XFS_INODES_PER_CHUNK; |
637aa50f | 404 | error = xfs_btree_increment(cur, 0, &tmp); |
cd57e594 | 405 | cond_resched(); |
1da177e4 LT |
406 | } |
407 | /* | |
408 | * Drop the btree buffers and the agi buffer. | |
409 | * We can't hold any of the locks these represent | |
410 | * when calling iget. | |
411 | */ | |
412 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); | |
413 | xfs_buf_relse(agbp); | |
414 | /* | |
415 | * Now format all the good inodes into the user's buffer. | |
416 | */ | |
417 | irbufend = irbp; | |
418 | for (irbp = irbuf; | |
cd57e594 | 419 | irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) { |
1da177e4 LT |
420 | /* |
421 | * Now process this chunk of inodes. | |
422 | */ | |
26275093 | 423 | for (agino = irbp->ir_startino, chunkidx = clustidx = 0; |
cd57e594 | 424 | XFS_BULKSTAT_UBLEFT(ubleft) && |
26275093 | 425 | irbp->ir_freecount < XFS_INODES_PER_CHUNK; |
1da177e4 LT |
426 | chunkidx++, clustidx++, agino++) { |
427 | ASSERT(chunkidx < XFS_INODES_PER_CHUNK); | |
9cee4c5b | 428 | |
c2cba57e | 429 | ino = XFS_AGINO_TO_INO(mp, agno, agino); |
1da177e4 LT |
430 | /* |
431 | * Skip if this inode is free. | |
432 | */ | |
c2cba57e LM |
433 | if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) { |
434 | lastino = ino; | |
1da177e4 | 435 | continue; |
c2cba57e | 436 | } |
1da177e4 LT |
437 | /* |
438 | * Count used inodes as free so we can tell | |
439 | * when the chunk is used up. | |
440 | */ | |
26275093 | 441 | irbp->ir_freecount++; |
1da177e4 LT |
442 | |
443 | /* | |
444 | * Get the inode and fill in a single buffer. | |
1da177e4 LT |
445 | */ |
446 | ubused = statstruct_size; | |
7b6259e7 | 447 | error = formatter(mp, ino, ubufp, ubleft, |
7dce11db | 448 | &ubused, &fmterror); |
1da177e4 | 449 | if (fmterror == BULKSTAT_RV_NOTHING) { |
2451337d DC |
450 | if (error && error != -ENOENT && |
451 | error != -EINVAL) { | |
e132f54c | 452 | ubleft = 0; |
cd57e594 LM |
453 | rval = error; |
454 | break; | |
455 | } | |
456 | lastino = ino; | |
1da177e4 LT |
457 | continue; |
458 | } | |
459 | if (fmterror == BULKSTAT_RV_GIVEUP) { | |
460 | ubleft = 0; | |
461 | ASSERT(error); | |
462 | rval = error; | |
463 | break; | |
464 | } | |
465 | if (ubufp) | |
466 | ubufp += ubused; | |
467 | ubleft -= ubused; | |
468 | ubelem++; | |
469 | lastino = ino; | |
470 | } | |
cd57e594 LM |
471 | |
472 | cond_resched(); | |
1da177e4 | 473 | } |
1da177e4 LT |
474 | /* |
475 | * Set up for the next loop iteration. | |
476 | */ | |
cd57e594 | 477 | if (XFS_BULKSTAT_UBLEFT(ubleft)) { |
1da177e4 LT |
478 | if (end_of_ag) { |
479 | agno++; | |
480 | agino = 0; | |
cd57e594 LM |
481 | } else |
482 | agino = XFS_INO_TO_AGINO(mp, lastino); | |
1da177e4 LT |
483 | } else |
484 | break; | |
485 | } | |
486 | /* | |
487 | * Done, we're either out of filesystem or space to put the data. | |
488 | */ | |
fdd3ccee | 489 | kmem_free(irbuf); |
1da177e4 | 490 | *ubcountp = ubelem; |
cd57e594 LM |
491 | /* |
492 | * Found some inodes, return them now and return the error next time. | |
493 | */ | |
494 | if (ubelem) | |
495 | rval = 0; | |
1da177e4 LT |
496 | if (agno >= mp->m_sb.sb_agcount) { |
497 | /* | |
498 | * If we ran out of filesystem, mark lastino as off | |
499 | * the end of the filesystem, so the next call | |
500 | * will return immediately. | |
501 | */ | |
502 | *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0); | |
503 | *done = 1; | |
504 | } else | |
505 | *lastinop = (xfs_ino_t)lastino; | |
506 | ||
507 | return rval; | |
508 | } | |
509 | ||
faa63e95 MM |
510 | int |
511 | xfs_inumbers_fmt( | |
512 | void __user *ubuffer, /* buffer to write to */ | |
549fa006 | 513 | const struct xfs_inogrp *buffer, /* buffer to read from */ |
faa63e95 MM |
514 | long count, /* # of elements to read */ |
515 | long *written) /* # of bytes written */ | |
516 | { | |
517 | if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer))) | |
518 | return -EFAULT; | |
519 | *written = count * sizeof(*buffer); | |
520 | return 0; | |
521 | } | |
522 | ||
1da177e4 LT |
523 | /* |
524 | * Return inode number table for the filesystem. | |
525 | */ | |
526 | int /* error status */ | |
527 | xfs_inumbers( | |
549fa006 JL |
528 | struct xfs_mount *mp,/* mount point for filesystem */ |
529 | xfs_ino_t *lastino,/* last inode returned */ | |
530 | int *count,/* size of buffer/count returned */ | |
531 | void __user *ubuffer,/* buffer with inode descriptions */ | |
532 | inumbers_fmt_pf formatter) | |
1da177e4 | 533 | { |
549fa006 JL |
534 | xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino); |
535 | xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino); | |
536 | struct xfs_btree_cur *cur = NULL; | |
c7cb51dc | 537 | struct xfs_buf *agbp = NULL; |
549fa006 JL |
538 | struct xfs_inogrp *buffer; |
539 | int bcount; | |
540 | int left = *count; | |
541 | int bufidx = 0; | |
542 | int error = 0; | |
543 | ||
1da177e4 | 544 | *count = 0; |
549fa006 JL |
545 | if (agno >= mp->m_sb.sb_agcount || |
546 | *lastino != XFS_AGINO_TO_INO(mp, agno, agino)) | |
547 | return error; | |
548 | ||
e6a4b37f | 549 | bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer))); |
1da177e4 | 550 | buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP); |
c7cb51dc | 551 | do { |
549fa006 JL |
552 | struct xfs_inobt_rec_incore r; |
553 | int stat; | |
554 | ||
c7cb51dc | 555 | if (!agbp) { |
1da177e4 | 556 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); |
c7cb51dc JL |
557 | if (error) |
558 | break; | |
559 | ||
57bd3dbe BF |
560 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno, |
561 | XFS_BTNUM_INO); | |
21875505 | 562 | error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE, |
549fa006 | 563 | &stat); |
c7cb51dc JL |
564 | if (error) |
565 | break; | |
566 | if (!stat) | |
567 | goto next_ag; | |
1da177e4 | 568 | } |
c7cb51dc | 569 | |
549fa006 | 570 | error = xfs_inobt_get_rec(cur, &r, &stat); |
c7cb51dc JL |
571 | if (error) |
572 | break; | |
573 | if (!stat) | |
574 | goto next_ag; | |
575 | ||
2e287a73 CH |
576 | agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1; |
577 | buffer[bufidx].xi_startino = | |
578 | XFS_AGINO_TO_INO(mp, agno, r.ir_startino); | |
579 | buffer[bufidx].xi_alloccount = | |
580 | XFS_INODES_PER_CHUNK - r.ir_freecount; | |
581 | buffer[bufidx].xi_allocmask = ~r.ir_free; | |
c7cb51dc JL |
582 | if (++bufidx == bcount) { |
583 | long written; | |
584 | ||
549fa006 JL |
585 | error = formatter(ubuffer, buffer, bufidx, &written); |
586 | if (error) | |
1da177e4 | 587 | break; |
faa63e95 | 588 | ubuffer += written; |
1da177e4 LT |
589 | *count += bufidx; |
590 | bufidx = 0; | |
591 | } | |
c7cb51dc JL |
592 | if (!--left) |
593 | break; | |
594 | ||
595 | error = xfs_btree_increment(cur, 0, &stat); | |
596 | if (error) | |
597 | break; | |
598 | if (stat) | |
599 | continue; | |
600 | ||
601 | next_ag: | |
602 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); | |
603 | cur = NULL; | |
604 | xfs_buf_relse(agbp); | |
605 | agbp = NULL; | |
606 | agino = 0; | |
607 | } while (++agno < mp->m_sb.sb_agcount); | |
608 | ||
1da177e4 LT |
609 | if (!error) { |
610 | if (bufidx) { | |
c7cb51dc JL |
611 | long written; |
612 | ||
549fa006 JL |
613 | error = formatter(ubuffer, buffer, bufidx, &written); |
614 | if (!error) | |
1da177e4 LT |
615 | *count += bufidx; |
616 | } | |
617 | *lastino = XFS_AGINO_TO_INO(mp, agno, agino); | |
618 | } | |
c7cb51dc | 619 | |
f0e2d93c | 620 | kmem_free(buffer); |
1da177e4 LT |
621 | if (cur) |
622 | xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR : | |
623 | XFS_BTREE_NOERROR)); | |
624 | if (agbp) | |
625 | xfs_buf_relse(agbp); | |
c7cb51dc | 626 | |
1da177e4 LT |
627 | return error; |
628 | } |