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