Root/
1 | /* |
2 | * Copyright (c) 2000-2002,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 | #include "xfs.h" |
19 | #include "xfs_fs.h" |
20 | #include "xfs_types.h" |
21 | #include "xfs_bit.h" |
22 | #include "xfs_log.h" |
23 | #include "xfs_inum.h" |
24 | #include "xfs_trans.h" |
25 | #include "xfs_sb.h" |
26 | #include "xfs_ag.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_ialloc.h" |
34 | #include "xfs_itable.h" |
35 | #include "xfs_error.h" |
36 | #include "xfs_btree.h" |
37 | #include "xfs_trace.h" |
38 | |
39 | STATIC int |
40 | xfs_internal_inum( |
41 | xfs_mount_t *mp, |
42 | xfs_ino_t ino) |
43 | { |
44 | return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino || |
45 | (xfs_sb_version_hasquota(&mp->m_sb) && |
46 | (ino == mp->m_sb.sb_uquotino || ino == mp->m_sb.sb_gquotino))); |
47 | } |
48 | |
49 | /* |
50 | * Return stat information for one inode. |
51 | * Return 0 if ok, else errno. |
52 | */ |
53 | int |
54 | xfs_bulkstat_one_int( |
55 | struct xfs_mount *mp, /* mount point for filesystem */ |
56 | xfs_ino_t ino, /* inode to get data for */ |
57 | void __user *buffer, /* buffer to place output in */ |
58 | int ubsize, /* size of buffer */ |
59 | bulkstat_one_fmt_pf formatter, /* formatter, copy to user */ |
60 | int *ubused, /* bytes used by me */ |
61 | int *stat) /* BULKSTAT_RV_... */ |
62 | { |
63 | struct xfs_icdinode *dic; /* dinode core info pointer */ |
64 | struct xfs_inode *ip; /* incore inode pointer */ |
65 | struct inode *inode; |
66 | struct xfs_bstat *buf; /* return buffer */ |
67 | int error = 0; /* error value */ |
68 | |
69 | *stat = BULKSTAT_RV_NOTHING; |
70 | |
71 | if (!buffer || xfs_internal_inum(mp, ino)) |
72 | return XFS_ERROR(EINVAL); |
73 | |
74 | buf = kmem_alloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL); |
75 | if (!buf) |
76 | return XFS_ERROR(ENOMEM); |
77 | |
78 | error = xfs_iget(mp, NULL, ino, |
79 | XFS_IGET_UNTRUSTED, XFS_ILOCK_SHARED, &ip); |
80 | if (error) { |
81 | *stat = BULKSTAT_RV_NOTHING; |
82 | goto out_free; |
83 | } |
84 | |
85 | ASSERT(ip != NULL); |
86 | ASSERT(ip->i_imap.im_blkno != 0); |
87 | |
88 | dic = &ip->i_d; |
89 | inode = VFS_I(ip); |
90 | |
91 | /* xfs_iget returns the following without needing |
92 | * further change. |
93 | */ |
94 | buf->bs_nlink = dic->di_nlink; |
95 | buf->bs_projid_lo = dic->di_projid_lo; |
96 | buf->bs_projid_hi = dic->di_projid_hi; |
97 | buf->bs_ino = ino; |
98 | buf->bs_mode = dic->di_mode; |
99 | buf->bs_uid = dic->di_uid; |
100 | buf->bs_gid = dic->di_gid; |
101 | buf->bs_size = dic->di_size; |
102 | |
103 | /* |
104 | * We need to read the timestamps from the Linux inode because |
105 | * the VFS keeps writing directly into the inode structure instead |
106 | * of telling us about the updates. |
107 | */ |
108 | buf->bs_atime.tv_sec = inode->i_atime.tv_sec; |
109 | buf->bs_atime.tv_nsec = inode->i_atime.tv_nsec; |
110 | buf->bs_mtime.tv_sec = inode->i_mtime.tv_sec; |
111 | buf->bs_mtime.tv_nsec = inode->i_mtime.tv_nsec; |
112 | buf->bs_ctime.tv_sec = inode->i_ctime.tv_sec; |
113 | buf->bs_ctime.tv_nsec = inode->i_ctime.tv_nsec; |
114 | |
115 | buf->bs_xflags = xfs_ip2xflags(ip); |
116 | buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog; |
117 | buf->bs_extents = dic->di_nextents; |
118 | buf->bs_gen = dic->di_gen; |
119 | memset(buf->bs_pad, 0, sizeof(buf->bs_pad)); |
120 | buf->bs_dmevmask = dic->di_dmevmask; |
121 | buf->bs_dmstate = dic->di_dmstate; |
122 | buf->bs_aextents = dic->di_anextents; |
123 | buf->bs_forkoff = XFS_IFORK_BOFF(ip); |
124 | |
125 | switch (dic->di_format) { |
126 | case XFS_DINODE_FMT_DEV: |
127 | buf->bs_rdev = ip->i_df.if_u2.if_rdev; |
128 | buf->bs_blksize = BLKDEV_IOSIZE; |
129 | buf->bs_blocks = 0; |
130 | break; |
131 | case XFS_DINODE_FMT_LOCAL: |
132 | case XFS_DINODE_FMT_UUID: |
133 | buf->bs_rdev = 0; |
134 | buf->bs_blksize = mp->m_sb.sb_blocksize; |
135 | buf->bs_blocks = 0; |
136 | break; |
137 | case XFS_DINODE_FMT_EXTENTS: |
138 | case XFS_DINODE_FMT_BTREE: |
139 | buf->bs_rdev = 0; |
140 | buf->bs_blksize = mp->m_sb.sb_blocksize; |
141 | buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks; |
142 | break; |
143 | } |
144 | xfs_iunlock(ip, XFS_ILOCK_SHARED); |
145 | IRELE(ip); |
146 | |
147 | error = formatter(buffer, ubsize, ubused, buf); |
148 | |
149 | if (!error) |
150 | *stat = BULKSTAT_RV_DIDONE; |
151 | |
152 | out_free: |
153 | kmem_free(buf); |
154 | return error; |
155 | } |
156 | |
157 | /* Return 0 on success or positive error */ |
158 | STATIC int |
159 | xfs_bulkstat_one_fmt( |
160 | void __user *ubuffer, |
161 | int ubsize, |
162 | int *ubused, |
163 | const xfs_bstat_t *buffer) |
164 | { |
165 | if (ubsize < sizeof(*buffer)) |
166 | return XFS_ERROR(ENOMEM); |
167 | if (copy_to_user(ubuffer, buffer, sizeof(*buffer))) |
168 | return XFS_ERROR(EFAULT); |
169 | if (ubused) |
170 | *ubused = sizeof(*buffer); |
171 | return 0; |
172 | } |
173 | |
174 | int |
175 | xfs_bulkstat_one( |
176 | xfs_mount_t *mp, /* mount point for filesystem */ |
177 | xfs_ino_t ino, /* inode number to get data for */ |
178 | void __user *buffer, /* buffer to place output in */ |
179 | int ubsize, /* size of buffer */ |
180 | int *ubused, /* bytes used by me */ |
181 | int *stat) /* BULKSTAT_RV_... */ |
182 | { |
183 | return xfs_bulkstat_one_int(mp, ino, buffer, ubsize, |
184 | xfs_bulkstat_one_fmt, ubused, stat); |
185 | } |
186 | |
187 | #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size) |
188 | |
189 | /* |
190 | * Return stat information in bulk (by-inode) for the filesystem. |
191 | */ |
192 | int /* error status */ |
193 | xfs_bulkstat( |
194 | xfs_mount_t *mp, /* mount point for filesystem */ |
195 | xfs_ino_t *lastinop, /* last inode returned */ |
196 | int *ubcountp, /* size of buffer/count returned */ |
197 | bulkstat_one_pf formatter, /* func that'd fill a single buf */ |
198 | size_t statstruct_size, /* sizeof struct filling */ |
199 | char __user *ubuffer, /* buffer with inode stats */ |
200 | int *done) /* 1 if there are more stats to get */ |
201 | { |
202 | xfs_agblock_t agbno=0;/* allocation group block number */ |
203 | xfs_buf_t *agbp; /* agi header buffer */ |
204 | xfs_agi_t *agi; /* agi header data */ |
205 | xfs_agino_t agino; /* inode # in allocation group */ |
206 | xfs_agnumber_t agno; /* allocation group number */ |
207 | int chunkidx; /* current index into inode chunk */ |
208 | int clustidx; /* current index into inode cluster */ |
209 | xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */ |
210 | int end_of_ag; /* set if we've seen the ag end */ |
211 | int error; /* error code */ |
212 | int fmterror;/* bulkstat formatter result */ |
213 | int i; /* loop index */ |
214 | int icount; /* count of inodes good in irbuf */ |
215 | size_t irbsize; /* size of irec buffer in bytes */ |
216 | xfs_ino_t ino; /* inode number (filesystem) */ |
217 | xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */ |
218 | xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */ |
219 | xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */ |
220 | xfs_ino_t lastino; /* last inode number returned */ |
221 | int nbcluster; /* # of blocks in a cluster */ |
222 | int nicluster; /* # of inodes in a cluster */ |
223 | int nimask; /* mask for inode clusters */ |
224 | int nirbuf; /* size of irbuf */ |
225 | int rval; /* return value error code */ |
226 | int tmp; /* result value from btree calls */ |
227 | int ubcount; /* size of user's buffer */ |
228 | int ubleft; /* bytes left in user's buffer */ |
229 | char __user *ubufp; /* pointer into user's buffer */ |
230 | int ubelem; /* spaces used in user's buffer */ |
231 | int ubused; /* bytes used by formatter */ |
232 | xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */ |
233 | |
234 | /* |
235 | * Get the last inode value, see if there's nothing to do. |
236 | */ |
237 | ino = (xfs_ino_t)*lastinop; |
238 | lastino = ino; |
239 | agno = XFS_INO_TO_AGNO(mp, ino); |
240 | agino = XFS_INO_TO_AGINO(mp, ino); |
241 | if (agno >= mp->m_sb.sb_agcount || |
242 | ino != XFS_AGINO_TO_INO(mp, agno, agino)) { |
243 | *done = 1; |
244 | *ubcountp = 0; |
245 | return 0; |
246 | } |
247 | if (!ubcountp || *ubcountp <= 0) { |
248 | return EINVAL; |
249 | } |
250 | ubcount = *ubcountp; /* statstruct's */ |
251 | ubleft = ubcount * statstruct_size; /* bytes */ |
252 | *ubcountp = ubelem = 0; |
253 | *done = 0; |
254 | fmterror = 0; |
255 | ubufp = ubuffer; |
256 | nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ? |
257 | mp->m_sb.sb_inopblock : |
258 | (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog); |
259 | nimask = ~(nicluster - 1); |
260 | nbcluster = nicluster >> mp->m_sb.sb_inopblog; |
261 | irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4); |
262 | if (!irbuf) |
263 | return ENOMEM; |
264 | |
265 | nirbuf = irbsize / sizeof(*irbuf); |
266 | |
267 | /* |
268 | * Loop over the allocation groups, starting from the last |
269 | * inode returned; 0 means start of the allocation group. |
270 | */ |
271 | rval = 0; |
272 | while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) { |
273 | cond_resched(); |
274 | bp = NULL; |
275 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); |
276 | if (error) { |
277 | /* |
278 | * Skip this allocation group and go to the next one. |
279 | */ |
280 | agno++; |
281 | agino = 0; |
282 | continue; |
283 | } |
284 | agi = XFS_BUF_TO_AGI(agbp); |
285 | /* |
286 | * Allocate and initialize a btree cursor for ialloc btree. |
287 | */ |
288 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno); |
289 | irbp = irbuf; |
290 | irbufend = irbuf + nirbuf; |
291 | end_of_ag = 0; |
292 | /* |
293 | * If we're returning in the middle of an allocation group, |
294 | * we need to get the remainder of the chunk we're in. |
295 | */ |
296 | if (agino > 0) { |
297 | xfs_inobt_rec_incore_t r; |
298 | |
299 | /* |
300 | * Lookup the inode chunk that this inode lives in. |
301 | */ |
302 | error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, |
303 | &tmp); |
304 | if (!error && /* no I/O error */ |
305 | tmp && /* lookup succeeded */ |
306 | /* got the record, should always work */ |
307 | !(error = xfs_inobt_get_rec(cur, &r, &i)) && |
308 | i == 1 && |
309 | /* this is the right chunk */ |
310 | agino < r.ir_startino + XFS_INODES_PER_CHUNK && |
311 | /* lastino was not last in chunk */ |
312 | (chunkidx = agino - r.ir_startino + 1) < |
313 | XFS_INODES_PER_CHUNK && |
314 | /* there are some left allocated */ |
315 | xfs_inobt_maskn(chunkidx, |
316 | XFS_INODES_PER_CHUNK - chunkidx) & |
317 | ~r.ir_free) { |
318 | /* |
319 | * Grab the chunk record. Mark all the |
320 | * uninteresting inodes (because they're |
321 | * before our start point) free. |
322 | */ |
323 | for (i = 0; i < chunkidx; i++) { |
324 | if (XFS_INOBT_MASK(i) & ~r.ir_free) |
325 | r.ir_freecount++; |
326 | } |
327 | r.ir_free |= xfs_inobt_maskn(0, chunkidx); |
328 | irbp->ir_startino = r.ir_startino; |
329 | irbp->ir_freecount = r.ir_freecount; |
330 | irbp->ir_free = r.ir_free; |
331 | irbp++; |
332 | agino = r.ir_startino + XFS_INODES_PER_CHUNK; |
333 | icount = XFS_INODES_PER_CHUNK - r.ir_freecount; |
334 | } else { |
335 | /* |
336 | * If any of those tests failed, bump the |
337 | * inode number (just in case). |
338 | */ |
339 | agino++; |
340 | icount = 0; |
341 | } |
342 | /* |
343 | * In any case, increment to the next record. |
344 | */ |
345 | if (!error) |
346 | error = xfs_btree_increment(cur, 0, &tmp); |
347 | } else { |
348 | /* |
349 | * Start of ag. Lookup the first inode chunk. |
350 | */ |
351 | error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &tmp); |
352 | icount = 0; |
353 | } |
354 | /* |
355 | * Loop through inode btree records in this ag, |
356 | * until we run out of inodes or space in the buffer. |
357 | */ |
358 | while (irbp < irbufend && icount < ubcount) { |
359 | xfs_inobt_rec_incore_t r; |
360 | |
361 | /* |
362 | * Loop as long as we're unable to read the |
363 | * inode btree. |
364 | */ |
365 | while (error) { |
366 | agino += XFS_INODES_PER_CHUNK; |
367 | if (XFS_AGINO_TO_AGBNO(mp, agino) >= |
368 | be32_to_cpu(agi->agi_length)) |
369 | break; |
370 | error = xfs_inobt_lookup(cur, agino, |
371 | XFS_LOOKUP_GE, &tmp); |
372 | cond_resched(); |
373 | } |
374 | /* |
375 | * If ran off the end of the ag either with an error, |
376 | * or the normal way, set end and stop collecting. |
377 | */ |
378 | if (error) { |
379 | end_of_ag = 1; |
380 | break; |
381 | } |
382 | |
383 | error = xfs_inobt_get_rec(cur, &r, &i); |
384 | if (error || i == 0) { |
385 | end_of_ag = 1; |
386 | break; |
387 | } |
388 | |
389 | /* |
390 | * If this chunk has any allocated inodes, save it. |
391 | * Also start read-ahead now for this chunk. |
392 | */ |
393 | if (r.ir_freecount < XFS_INODES_PER_CHUNK) { |
394 | /* |
395 | * Loop over all clusters in the next chunk. |
396 | * Do a readahead if there are any allocated |
397 | * inodes in that cluster. |
398 | */ |
399 | agbno = XFS_AGINO_TO_AGBNO(mp, r.ir_startino); |
400 | for (chunkidx = 0; |
401 | chunkidx < XFS_INODES_PER_CHUNK; |
402 | chunkidx += nicluster, |
403 | agbno += nbcluster) { |
404 | if (xfs_inobt_maskn(chunkidx, nicluster) |
405 | & ~r.ir_free) |
406 | xfs_btree_reada_bufs(mp, agno, |
407 | agbno, nbcluster); |
408 | } |
409 | irbp->ir_startino = r.ir_startino; |
410 | irbp->ir_freecount = r.ir_freecount; |
411 | irbp->ir_free = r.ir_free; |
412 | irbp++; |
413 | icount += XFS_INODES_PER_CHUNK - r.ir_freecount; |
414 | } |
415 | /* |
416 | * Set agino to after this chunk and bump the cursor. |
417 | */ |
418 | agino = r.ir_startino + XFS_INODES_PER_CHUNK; |
419 | error = xfs_btree_increment(cur, 0, &tmp); |
420 | cond_resched(); |
421 | } |
422 | /* |
423 | * Drop the btree buffers and the agi buffer. |
424 | * We can't hold any of the locks these represent |
425 | * when calling iget. |
426 | */ |
427 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); |
428 | xfs_buf_relse(agbp); |
429 | /* |
430 | * Now format all the good inodes into the user's buffer. |
431 | */ |
432 | irbufend = irbp; |
433 | for (irbp = irbuf; |
434 | irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) { |
435 | /* |
436 | * Now process this chunk of inodes. |
437 | */ |
438 | for (agino = irbp->ir_startino, chunkidx = clustidx = 0; |
439 | XFS_BULKSTAT_UBLEFT(ubleft) && |
440 | irbp->ir_freecount < XFS_INODES_PER_CHUNK; |
441 | chunkidx++, clustidx++, agino++) { |
442 | ASSERT(chunkidx < XFS_INODES_PER_CHUNK); |
443 | /* |
444 | * Recompute agbno if this is the |
445 | * first inode of the cluster. |
446 | * |
447 | * Careful with clustidx. There can be |
448 | * multiple clusters per chunk, a single |
449 | * cluster per chunk or a cluster that has |
450 | * inodes represented from several different |
451 | * chunks (if blocksize is large). |
452 | * |
453 | * Because of this, the starting clustidx is |
454 | * initialized to zero in this loop but must |
455 | * later be reset after reading in the cluster |
456 | * buffer. |
457 | */ |
458 | if ((chunkidx & (nicluster - 1)) == 0) { |
459 | agbno = XFS_AGINO_TO_AGBNO(mp, |
460 | irbp->ir_startino) + |
461 | ((chunkidx & nimask) >> |
462 | mp->m_sb.sb_inopblog); |
463 | } |
464 | ino = XFS_AGINO_TO_INO(mp, agno, agino); |
465 | /* |
466 | * Skip if this inode is free. |
467 | */ |
468 | if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) { |
469 | lastino = ino; |
470 | continue; |
471 | } |
472 | /* |
473 | * Count used inodes as free so we can tell |
474 | * when the chunk is used up. |
475 | */ |
476 | irbp->ir_freecount++; |
477 | |
478 | /* |
479 | * Get the inode and fill in a single buffer. |
480 | */ |
481 | ubused = statstruct_size; |
482 | error = formatter(mp, ino, ubufp, ubleft, |
483 | &ubused, &fmterror); |
484 | if (fmterror == BULKSTAT_RV_NOTHING) { |
485 | if (error && error != ENOENT && |
486 | error != EINVAL) { |
487 | ubleft = 0; |
488 | rval = error; |
489 | break; |
490 | } |
491 | lastino = ino; |
492 | continue; |
493 | } |
494 | if (fmterror == BULKSTAT_RV_GIVEUP) { |
495 | ubleft = 0; |
496 | ASSERT(error); |
497 | rval = error; |
498 | break; |
499 | } |
500 | if (ubufp) |
501 | ubufp += ubused; |
502 | ubleft -= ubused; |
503 | ubelem++; |
504 | lastino = ino; |
505 | } |
506 | |
507 | cond_resched(); |
508 | } |
509 | |
510 | if (bp) |
511 | xfs_buf_relse(bp); |
512 | |
513 | /* |
514 | * Set up for the next loop iteration. |
515 | */ |
516 | if (XFS_BULKSTAT_UBLEFT(ubleft)) { |
517 | if (end_of_ag) { |
518 | agno++; |
519 | agino = 0; |
520 | } else |
521 | agino = XFS_INO_TO_AGINO(mp, lastino); |
522 | } else |
523 | break; |
524 | } |
525 | /* |
526 | * Done, we're either out of filesystem or space to put the data. |
527 | */ |
528 | kmem_free_large(irbuf); |
529 | *ubcountp = ubelem; |
530 | /* |
531 | * Found some inodes, return them now and return the error next time. |
532 | */ |
533 | if (ubelem) |
534 | rval = 0; |
535 | if (agno >= mp->m_sb.sb_agcount) { |
536 | /* |
537 | * If we ran out of filesystem, mark lastino as off |
538 | * the end of the filesystem, so the next call |
539 | * will return immediately. |
540 | */ |
541 | *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0); |
542 | *done = 1; |
543 | } else |
544 | *lastinop = (xfs_ino_t)lastino; |
545 | |
546 | return rval; |
547 | } |
548 | |
549 | /* |
550 | * Return stat information in bulk (by-inode) for the filesystem. |
551 | * Special case for non-sequential one inode bulkstat. |
552 | */ |
553 | int /* error status */ |
554 | xfs_bulkstat_single( |
555 | xfs_mount_t *mp, /* mount point for filesystem */ |
556 | xfs_ino_t *lastinop, /* inode to return */ |
557 | char __user *buffer, /* buffer with inode stats */ |
558 | int *done) /* 1 if there are more stats to get */ |
559 | { |
560 | int count; /* count value for bulkstat call */ |
561 | int error; /* return value */ |
562 | xfs_ino_t ino; /* filesystem inode number */ |
563 | int res; /* result from bs1 */ |
564 | |
565 | /* |
566 | * note that requesting valid inode numbers which are not allocated |
567 | * to inodes will most likely cause xfs_itobp to generate warning |
568 | * messages about bad magic numbers. This is ok. The fact that |
569 | * the inode isn't actually an inode is handled by the |
570 | * error check below. Done this way to make the usual case faster |
571 | * at the expense of the error case. |
572 | */ |
573 | |
574 | ino = (xfs_ino_t)*lastinop; |
575 | error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t), 0, &res); |
576 | if (error) { |
577 | /* |
578 | * Special case way failed, do it the "long" way |
579 | * to see if that works. |
580 | */ |
581 | (*lastinop)--; |
582 | count = 1; |
583 | if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one, |
584 | sizeof(xfs_bstat_t), buffer, done)) |
585 | return error; |
586 | if (count == 0 || (xfs_ino_t)*lastinop != ino) |
587 | return error == EFSCORRUPTED ? |
588 | XFS_ERROR(EINVAL) : error; |
589 | else |
590 | return 0; |
591 | } |
592 | *done = 0; |
593 | return 0; |
594 | } |
595 | |
596 | int |
597 | xfs_inumbers_fmt( |
598 | void __user *ubuffer, /* buffer to write to */ |
599 | const xfs_inogrp_t *buffer, /* buffer to read from */ |
600 | long count, /* # of elements to read */ |
601 | long *written) /* # of bytes written */ |
602 | { |
603 | if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer))) |
604 | return -EFAULT; |
605 | *written = count * sizeof(*buffer); |
606 | return 0; |
607 | } |
608 | |
609 | /* |
610 | * Return inode number table for the filesystem. |
611 | */ |
612 | int /* error status */ |
613 | xfs_inumbers( |
614 | xfs_mount_t *mp, /* mount point for filesystem */ |
615 | xfs_ino_t *lastino, /* last inode returned */ |
616 | int *count, /* size of buffer/count returned */ |
617 | void __user *ubuffer,/* buffer with inode descriptions */ |
618 | inumbers_fmt_pf formatter) |
619 | { |
620 | xfs_buf_t *agbp; |
621 | xfs_agino_t agino; |
622 | xfs_agnumber_t agno; |
623 | int bcount; |
624 | xfs_inogrp_t *buffer; |
625 | int bufidx; |
626 | xfs_btree_cur_t *cur; |
627 | int error; |
628 | xfs_inobt_rec_incore_t r; |
629 | int i; |
630 | xfs_ino_t ino; |
631 | int left; |
632 | int tmp; |
633 | |
634 | ino = (xfs_ino_t)*lastino; |
635 | agno = XFS_INO_TO_AGNO(mp, ino); |
636 | agino = XFS_INO_TO_AGINO(mp, ino); |
637 | left = *count; |
638 | *count = 0; |
639 | bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer))); |
640 | buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP); |
641 | error = bufidx = 0; |
642 | cur = NULL; |
643 | agbp = NULL; |
644 | while (left > 0 && agno < mp->m_sb.sb_agcount) { |
645 | if (agbp == NULL) { |
646 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); |
647 | if (error) { |
648 | /* |
649 | * If we can't read the AGI of this ag, |
650 | * then just skip to the next one. |
651 | */ |
652 | ASSERT(cur == NULL); |
653 | agbp = NULL; |
654 | agno++; |
655 | agino = 0; |
656 | continue; |
657 | } |
658 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno); |
659 | error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE, |
660 | &tmp); |
661 | if (error) { |
662 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); |
663 | cur = NULL; |
664 | xfs_buf_relse(agbp); |
665 | agbp = NULL; |
666 | /* |
667 | * Move up the last inode in the current |
668 | * chunk. The lookup_ge will always get |
669 | * us the first inode in the next chunk. |
670 | */ |
671 | agino += XFS_INODES_PER_CHUNK - 1; |
672 | continue; |
673 | } |
674 | } |
675 | error = xfs_inobt_get_rec(cur, &r, &i); |
676 | if (error || i == 0) { |
677 | xfs_buf_relse(agbp); |
678 | agbp = NULL; |
679 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); |
680 | cur = NULL; |
681 | agno++; |
682 | agino = 0; |
683 | continue; |
684 | } |
685 | agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1; |
686 | buffer[bufidx].xi_startino = |
687 | XFS_AGINO_TO_INO(mp, agno, r.ir_startino); |
688 | buffer[bufidx].xi_alloccount = |
689 | XFS_INODES_PER_CHUNK - r.ir_freecount; |
690 | buffer[bufidx].xi_allocmask = ~r.ir_free; |
691 | bufidx++; |
692 | left--; |
693 | if (bufidx == bcount) { |
694 | long written; |
695 | if (formatter(ubuffer, buffer, bufidx, &written)) { |
696 | error = XFS_ERROR(EFAULT); |
697 | break; |
698 | } |
699 | ubuffer += written; |
700 | *count += bufidx; |
701 | bufidx = 0; |
702 | } |
703 | if (left) { |
704 | error = xfs_btree_increment(cur, 0, &tmp); |
705 | if (error) { |
706 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); |
707 | cur = NULL; |
708 | xfs_buf_relse(agbp); |
709 | agbp = NULL; |
710 | /* |
711 | * The agino value has already been bumped. |
712 | * Just try to skip up to it. |
713 | */ |
714 | agino += XFS_INODES_PER_CHUNK; |
715 | continue; |
716 | } |
717 | } |
718 | } |
719 | if (!error) { |
720 | if (bufidx) { |
721 | long written; |
722 | if (formatter(ubuffer, buffer, bufidx, &written)) |
723 | error = XFS_ERROR(EFAULT); |
724 | else |
725 | *count += bufidx; |
726 | } |
727 | *lastino = XFS_AGINO_TO_INO(mp, agno, agino); |
728 | } |
729 | kmem_free(buffer); |
730 | if (cur) |
731 | xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR : |
732 | XFS_BTREE_NOERROR)); |
733 | if (agbp) |
734 | xfs_buf_relse(agbp); |
735 | return error; |
736 | } |
737 |
Branches:
ben-wpan
ben-wpan-stefan
javiroman/ks7010
jz-2.6.34
jz-2.6.34-rc5
jz-2.6.34-rc6
jz-2.6.34-rc7
jz-2.6.35
jz-2.6.36
jz-2.6.37
jz-2.6.38
jz-2.6.39
jz-3.0
jz-3.1
jz-3.11
jz-3.12
jz-3.13
jz-3.15
jz-3.16
jz-3.18-dt
jz-3.2
jz-3.3
jz-3.4
jz-3.5
jz-3.6
jz-3.6-rc2-pwm
jz-3.9
jz-3.9-clk
jz-3.9-rc8
jz47xx
jz47xx-2.6.38
master
Tags:
od-2011-09-04
od-2011-09-18
v2.6.34-rc5
v2.6.34-rc6
v2.6.34-rc7
v3.9