Merge tag 'tty-3.18-rc4' of git://git.kernel.org/pub/scm/linux/kernel/git/gregkh/tty
[deliverable/linux.git] / fs / xfs / xfs_itable.c
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_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
24 #include "xfs_inum.h"
25 #include "xfs_sb.h"
26 #include "xfs_ag.h"
27 #include "xfs_mount.h"
28 #include "xfs_inode.h"
29 #include "xfs_btree.h"
30 #include "xfs_ialloc.h"
31 #include "xfs_ialloc_btree.h"
32 #include "xfs_itable.h"
33 #include "xfs_error.h"
34 #include "xfs_trace.h"
35 #include "xfs_icache.h"
36 #include "xfs_dinode.h"
37
38 STATIC int
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 ||
44 (xfs_sb_version_hasquota(&mp->m_sb) &&
45 xfs_is_quota_inode(&mp->m_sb, ino)));
46 }
47
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 */
59 int *ubused, /* bytes used by me */
60 int *stat) /* BULKSTAT_RV_... */
61 {
62 struct xfs_icdinode *dic; /* dinode core info pointer */
63 struct xfs_inode *ip; /* incore inode pointer */
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))
70 return -EINVAL;
71
72 buf = kmem_alloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL);
73 if (!buf)
74 return -ENOMEM;
75
76 error = xfs_iget(mp, NULL, ino,
77 (XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED),
78 XFS_ILOCK_SHARED, &ip);
79 if (error)
80 goto out_free;
81
82 ASSERT(ip != NULL);
83 ASSERT(ip->i_imap.im_blkno != 0);
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;
91 buf->bs_projid_lo = dic->di_projid_lo;
92 buf->bs_projid_hi = dic->di_projid_hi;
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;
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;
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;
112 buf->bs_forkoff = XFS_IFORK_BOFF(ip);
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 }
133 xfs_iunlock(ip, XFS_ILOCK_SHARED);
134 IRELE(ip);
135
136 error = formatter(buffer, ubsize, ubused, buf);
137 if (!error)
138 *stat = BULKSTAT_RV_DIDONE;
139
140 out_free:
141 kmem_free(buf);
142 return error;
143 }
144
145 /* Return 0 on success or positive error */
146 STATIC int
147 xfs_bulkstat_one_fmt(
148 void __user *ubuffer,
149 int ubsize,
150 int *ubused,
151 const xfs_bstat_t *buffer)
152 {
153 if (ubsize < sizeof(*buffer))
154 return -ENOMEM;
155 if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
156 return -EFAULT;
157 if (ubused)
158 *ubused = sizeof(*buffer);
159 return 0;
160 }
161
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 */
168 int *ubused, /* bytes used by me */
169 int *stat) /* BULKSTAT_RV_... */
170 {
171 return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
172 xfs_bulkstat_one_fmt, ubused, stat);
173 }
174
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
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 */
239 if (irec->ir_startino + XFS_INODES_PER_CHUNK <= agino) {
240 *icount = 0;
241 return 0;
242 }
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
265 #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
266
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
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 */
277 static int
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,
284 struct xfs_bulkstat_agichunk *acp,
285 xfs_agino_t *last_agino)
286 {
287 char __user **ubufp = acp->ac_ubuffer;
288 int chunkidx;
289 int error = 0;
290 xfs_agino_t agino = irbp->ir_startino;
291
292 for (chunkidx = 0; chunkidx < XFS_INODES_PER_CHUNK;
293 chunkidx++, agino++) {
294 int fmterror;
295 int ubused;
296
297 /* inode won't fit in buffer, we are done */
298 if (acp->ac_ubleft < statstruct_size)
299 break;
300
301 /* Skip if this inode is free */
302 if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free)
303 continue;
304
305 /* Get the inode and fill in a single buffer */
306 ubused = statstruct_size;
307 error = formatter(mp, XFS_AGINO_TO_INO(mp, agno, agino),
308 *ubufp, acp->ac_ubleft, &ubused, &fmterror);
309
310 if (fmterror == BULKSTAT_RV_GIVEUP ||
311 (error && error != -ENOENT && error != -EINVAL)) {
312 acp->ac_ubleft = 0;
313 ASSERT(error);
314 break;
315 }
316
317 /* be careful not to leak error if at end of chunk */
318 if (fmterror == BULKSTAT_RV_NOTHING || error) {
319 error = 0;
320 continue;
321 }
322
323 *ubufp += ubused;
324 acp->ac_ubleft -= ubused;
325 acp->ac_ubelem++;
326 }
327
328 /*
329 * Post-update *last_agino. At this point, agino will always point one
330 * inode past the last inode we processed successfully. Hence we
331 * substract that inode when setting the *last_agino cursor so that we
332 * return the correct cookie to userspace. On the next bulkstat call,
333 * the inode under the lastino cookie will be skipped as we have already
334 * processed it here.
335 */
336 *last_agino = agino - 1;
337
338 return error;
339 }
340
341 /*
342 * Return stat information in bulk (by-inode) for the filesystem.
343 */
344 int /* error status */
345 xfs_bulkstat(
346 xfs_mount_t *mp, /* mount point for filesystem */
347 xfs_ino_t *lastinop, /* last inode returned */
348 int *ubcountp, /* size of buffer/count returned */
349 bulkstat_one_pf formatter, /* func that'd fill a single buf */
350 size_t statstruct_size, /* sizeof struct filling */
351 char __user *ubuffer, /* buffer with inode stats */
352 int *done) /* 1 if there are more stats to get */
353 {
354 xfs_buf_t *agbp; /* agi header buffer */
355 xfs_agi_t *agi; /* agi header data */
356 xfs_agino_t agino; /* inode # in allocation group */
357 xfs_agnumber_t agno; /* allocation group number */
358 xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
359 size_t irbsize; /* size of irec buffer in bytes */
360 xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
361 int nirbuf; /* size of irbuf */
362 int ubcount; /* size of user's buffer */
363 struct xfs_bulkstat_agichunk ac;
364 int error = 0;
365
366 /*
367 * Get the last inode value, see if there's nothing to do.
368 */
369 agno = XFS_INO_TO_AGNO(mp, *lastinop);
370 agino = XFS_INO_TO_AGINO(mp, *lastinop);
371 if (agno >= mp->m_sb.sb_agcount ||
372 *lastinop != XFS_AGINO_TO_INO(mp, agno, agino)) {
373 *done = 1;
374 *ubcountp = 0;
375 return 0;
376 }
377
378 ubcount = *ubcountp; /* statstruct's */
379 ac.ac_ubuffer = &ubuffer;
380 ac.ac_ubleft = ubcount * statstruct_size; /* bytes */;
381 ac.ac_ubelem = 0;
382
383 *ubcountp = 0;
384 *done = 0;
385
386 irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4);
387 if (!irbuf)
388 return -ENOMEM;
389
390 nirbuf = irbsize / sizeof(*irbuf);
391
392 /*
393 * Loop over the allocation groups, starting from the last
394 * inode returned; 0 means start of the allocation group.
395 */
396 while (agno < mp->m_sb.sb_agcount) {
397 struct xfs_inobt_rec_incore *irbp = irbuf;
398 struct xfs_inobt_rec_incore *irbufend = irbuf + nirbuf;
399 bool end_of_ag = false;
400 int icount = 0;
401 int stat;
402
403 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
404 if (error)
405 break;
406 agi = XFS_BUF_TO_AGI(agbp);
407 /*
408 * Allocate and initialize a btree cursor for ialloc btree.
409 */
410 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
411 XFS_BTNUM_INO);
412 if (agino > 0) {
413 /*
414 * In the middle of an allocation group, we need to get
415 * the remainder of the chunk we're in.
416 */
417 struct xfs_inobt_rec_incore r;
418
419 error = xfs_bulkstat_grab_ichunk(cur, agino, &icount, &r);
420 if (error)
421 goto del_cursor;
422 if (icount) {
423 irbp->ir_startino = r.ir_startino;
424 irbp->ir_freecount = r.ir_freecount;
425 irbp->ir_free = r.ir_free;
426 irbp++;
427 }
428 /* Increment to the next record */
429 error = xfs_btree_increment(cur, 0, &stat);
430 } else {
431 /* Start of ag. Lookup the first inode chunk */
432 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &stat);
433 }
434 if (error || stat == 0) {
435 end_of_ag = true;
436 goto del_cursor;
437 }
438
439 /*
440 * Loop through inode btree records in this ag,
441 * until we run out of inodes or space in the buffer.
442 */
443 while (irbp < irbufend && icount < ubcount) {
444 struct xfs_inobt_rec_incore r;
445
446 error = xfs_inobt_get_rec(cur, &r, &stat);
447 if (error || stat == 0) {
448 end_of_ag = true;
449 goto del_cursor;
450 }
451
452 /*
453 * If this chunk has any allocated inodes, save it.
454 * Also start read-ahead now for this chunk.
455 */
456 if (r.ir_freecount < XFS_INODES_PER_CHUNK) {
457 xfs_bulkstat_ichunk_ra(mp, agno, &r);
458 irbp->ir_startino = r.ir_startino;
459 irbp->ir_freecount = r.ir_freecount;
460 irbp->ir_free = r.ir_free;
461 irbp++;
462 icount += XFS_INODES_PER_CHUNK - r.ir_freecount;
463 }
464 error = xfs_btree_increment(cur, 0, &stat);
465 if (error || stat == 0) {
466 end_of_ag = true;
467 goto del_cursor;
468 }
469 cond_resched();
470 }
471
472 /*
473 * Drop the btree buffers and the agi buffer as we can't hold any
474 * of the locks these represent when calling iget. If there is a
475 * pending error, then we are done.
476 */
477 del_cursor:
478 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
479 xfs_buf_relse(agbp);
480 if (error)
481 break;
482 /*
483 * Now format all the good inodes into the user's buffer. The
484 * call to xfs_bulkstat_ag_ichunk() sets up the agino pointer
485 * for the next loop iteration.
486 */
487 irbufend = irbp;
488 for (irbp = irbuf;
489 irbp < irbufend && ac.ac_ubleft >= statstruct_size;
490 irbp++) {
491 error = xfs_bulkstat_ag_ichunk(mp, agno, irbp,
492 formatter, statstruct_size, &ac,
493 &agino);
494 if (error)
495 break;
496
497 cond_resched();
498 }
499
500 /*
501 * If we've run out of space or had a formatting error, we
502 * are now done
503 */
504 if (ac.ac_ubleft < statstruct_size || error)
505 break;
506
507 if (end_of_ag) {
508 agno++;
509 agino = 0;
510 }
511 }
512 /*
513 * Done, we're either out of filesystem or space to put the data.
514 */
515 kmem_free(irbuf);
516 *ubcountp = ac.ac_ubelem;
517
518 /*
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.
524 */
525 if (ac.ac_ubelem)
526 error = 0;
527
528 /*
529 * If we ran out of filesystem, lastino will point off the end of
530 * the filesystem so the next call will return immediately.
531 */
532 *lastinop = XFS_AGINO_TO_INO(mp, agno, agino);
533 if (agno >= mp->m_sb.sb_agcount)
534 *done = 1;
535
536 return error;
537 }
538
539 int
540 xfs_inumbers_fmt(
541 void __user *ubuffer, /* buffer to write to */
542 const struct xfs_inogrp *buffer, /* buffer to read from */
543 long count, /* # of elements to read */
544 long *written) /* # of bytes written */
545 {
546 if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
547 return -EFAULT;
548 *written = count * sizeof(*buffer);
549 return 0;
550 }
551
552 /*
553 * Return inode number table for the filesystem.
554 */
555 int /* error status */
556 xfs_inumbers(
557 struct xfs_mount *mp,/* mount point for filesystem */
558 xfs_ino_t *lastino,/* last inode returned */
559 int *count,/* size of buffer/count returned */
560 void __user *ubuffer,/* buffer with inode descriptions */
561 inumbers_fmt_pf formatter)
562 {
563 xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino);
564 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino);
565 struct xfs_btree_cur *cur = NULL;
566 struct xfs_buf *agbp = NULL;
567 struct xfs_inogrp *buffer;
568 int bcount;
569 int left = *count;
570 int bufidx = 0;
571 int error = 0;
572
573 *count = 0;
574 if (agno >= mp->m_sb.sb_agcount ||
575 *lastino != XFS_AGINO_TO_INO(mp, agno, agino))
576 return error;
577
578 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
579 buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
580 do {
581 struct xfs_inobt_rec_incore r;
582 int stat;
583
584 if (!agbp) {
585 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
586 if (error)
587 break;
588
589 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
590 XFS_BTNUM_INO);
591 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
592 &stat);
593 if (error)
594 break;
595 if (!stat)
596 goto next_ag;
597 }
598
599 error = xfs_inobt_get_rec(cur, &r, &stat);
600 if (error)
601 break;
602 if (!stat)
603 goto next_ag;
604
605 agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
606 buffer[bufidx].xi_startino =
607 XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
608 buffer[bufidx].xi_alloccount =
609 XFS_INODES_PER_CHUNK - r.ir_freecount;
610 buffer[bufidx].xi_allocmask = ~r.ir_free;
611 if (++bufidx == bcount) {
612 long written;
613
614 error = formatter(ubuffer, buffer, bufidx, &written);
615 if (error)
616 break;
617 ubuffer += written;
618 *count += bufidx;
619 bufidx = 0;
620 }
621 if (!--left)
622 break;
623
624 error = xfs_btree_increment(cur, 0, &stat);
625 if (error)
626 break;
627 if (stat)
628 continue;
629
630 next_ag:
631 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
632 cur = NULL;
633 xfs_buf_relse(agbp);
634 agbp = NULL;
635 agino = 0;
636 agno++;
637 } while (agno < mp->m_sb.sb_agcount);
638
639 if (!error) {
640 if (bufidx) {
641 long written;
642
643 error = formatter(ubuffer, buffer, bufidx, &written);
644 if (!error)
645 *count += bufidx;
646 }
647 *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
648 }
649
650 kmem_free(buffer);
651 if (cur)
652 xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
653 XFS_BTREE_NOERROR));
654 if (agbp)
655 xfs_buf_relse(agbp);
656
657 return error;
658 }
This page took 0.058229 seconds and 5 git commands to generate.