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" |
1da177e4 | 20 | #include "xfs_types.h" |
a844f451 | 21 | #include "xfs_bit.h" |
1da177e4 | 22 | #include "xfs_log.h" |
a844f451 | 23 | #include "xfs_inum.h" |
1da177e4 LT |
24 | #include "xfs_trans.h" |
25 | #include "xfs_sb.h" | |
a844f451 | 26 | #include "xfs_ag.h" |
1da177e4 LT |
27 | #include "xfs_dir2.h" |
28 | #include "xfs_dmapi.h" | |
29 | #include "xfs_mount.h" | |
1da177e4 | 30 | #include "xfs_bmap_btree.h" |
a844f451 | 31 | #include "xfs_alloc_btree.h" |
1da177e4 | 32 | #include "xfs_ialloc_btree.h" |
1da177e4 | 33 | #include "xfs_dir2_sf.h" |
a844f451 | 34 | #include "xfs_attr_sf.h" |
1da177e4 LT |
35 | #include "xfs_dinode.h" |
36 | #include "xfs_inode.h" | |
37 | #include "xfs_ialloc.h" | |
38 | #include "xfs_itable.h" | |
39 | #include "xfs_error.h" | |
a844f451 | 40 | #include "xfs_btree.h" |
1da177e4 | 41 | |
1da177e4 LT |
42 | STATIC int |
43 | xfs_bulkstat_one_iget( | |
44 | xfs_mount_t *mp, /* mount point for filesystem */ | |
45 | xfs_ino_t ino, /* inode number to get data for */ | |
46 | xfs_daddr_t bno, /* starting bno of inode cluster */ | |
47 | xfs_bstat_t *buf, /* return buffer */ | |
48 | int *stat) /* BULKSTAT_RV_... */ | |
49 | { | |
50 | xfs_dinode_core_t *dic; /* dinode core info pointer */ | |
51 | xfs_inode_t *ip; /* incore inode pointer */ | |
67fcaa73 | 52 | bhv_vnode_t *vp; |
1da177e4 LT |
53 | int error; |
54 | ||
745b1f47 NS |
55 | error = xfs_iget(mp, NULL, ino, |
56 | XFS_IGET_BULKSTAT, XFS_ILOCK_SHARED, &ip, bno); | |
1da177e4 LT |
57 | if (error) { |
58 | *stat = BULKSTAT_RV_NOTHING; | |
59 | return error; | |
60 | } | |
61 | ||
62 | ASSERT(ip != NULL); | |
63 | ASSERT(ip->i_blkno != (xfs_daddr_t)0); | |
64 | if (ip->i_d.di_mode == 0) { | |
65 | *stat = BULKSTAT_RV_NOTHING; | |
66 | error = XFS_ERROR(ENOENT); | |
67 | goto out_iput; | |
68 | } | |
69 | ||
42fe2b1f | 70 | vp = XFS_ITOV(ip); |
1da177e4 LT |
71 | dic = &ip->i_d; |
72 | ||
73 | /* xfs_iget returns the following without needing | |
74 | * further change. | |
75 | */ | |
76 | buf->bs_nlink = dic->di_nlink; | |
77 | buf->bs_projid = dic->di_projid; | |
78 | buf->bs_ino = ino; | |
79 | buf->bs_mode = dic->di_mode; | |
80 | buf->bs_uid = dic->di_uid; | |
81 | buf->bs_gid = dic->di_gid; | |
82 | buf->bs_size = dic->di_size; | |
ca5ccbf9 | 83 | vn_atime_to_bstime(vp, &buf->bs_atime); |
1da177e4 LT |
84 | buf->bs_mtime.tv_sec = dic->di_mtime.t_sec; |
85 | buf->bs_mtime.tv_nsec = dic->di_mtime.t_nsec; | |
86 | buf->bs_ctime.tv_sec = dic->di_ctime.t_sec; | |
87 | buf->bs_ctime.tv_nsec = dic->di_ctime.t_nsec; | |
88 | buf->bs_xflags = xfs_ip2xflags(ip); | |
89 | buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog; | |
90 | buf->bs_extents = dic->di_nextents; | |
91 | buf->bs_gen = dic->di_gen; | |
92 | memset(buf->bs_pad, 0, sizeof(buf->bs_pad)); | |
93 | buf->bs_dmevmask = dic->di_dmevmask; | |
94 | buf->bs_dmstate = dic->di_dmstate; | |
95 | buf->bs_aextents = dic->di_anextents; | |
96 | ||
97 | switch (dic->di_format) { | |
98 | case XFS_DINODE_FMT_DEV: | |
99 | buf->bs_rdev = ip->i_df.if_u2.if_rdev; | |
100 | buf->bs_blksize = BLKDEV_IOSIZE; | |
101 | buf->bs_blocks = 0; | |
102 | break; | |
103 | case XFS_DINODE_FMT_LOCAL: | |
104 | case XFS_DINODE_FMT_UUID: | |
105 | buf->bs_rdev = 0; | |
106 | buf->bs_blksize = mp->m_sb.sb_blocksize; | |
107 | buf->bs_blocks = 0; | |
108 | break; | |
109 | case XFS_DINODE_FMT_EXTENTS: | |
110 | case XFS_DINODE_FMT_BTREE: | |
111 | buf->bs_rdev = 0; | |
112 | buf->bs_blksize = mp->m_sb.sb_blocksize; | |
113 | buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks; | |
114 | break; | |
115 | } | |
116 | ||
117 | out_iput: | |
118 | xfs_iput(ip, XFS_ILOCK_SHARED); | |
119 | return error; | |
120 | } | |
121 | ||
122 | STATIC int | |
123 | xfs_bulkstat_one_dinode( | |
124 | xfs_mount_t *mp, /* mount point for filesystem */ | |
125 | xfs_ino_t ino, /* inode number to get data for */ | |
126 | xfs_dinode_t *dip, /* dinode inode pointer */ | |
127 | xfs_bstat_t *buf) /* return buffer */ | |
128 | { | |
129 | xfs_dinode_core_t *dic; /* dinode core info pointer */ | |
130 | ||
131 | dic = &dip->di_core; | |
132 | ||
133 | /* | |
134 | * The inode format changed when we moved the link count and | |
135 | * made it 32 bits long. If this is an old format inode, | |
136 | * convert it in memory to look like a new one. If it gets | |
137 | * flushed to disk we will convert back before flushing or | |
138 | * logging it. We zero out the new projid field and the old link | |
139 | * count field. We'll handle clearing the pad field (the remains | |
140 | * of the old uuid field) when we actually convert the inode to | |
141 | * the new format. We don't change the version number so that we | |
142 | * can distinguish this from a real new format inode. | |
143 | */ | |
144 | if (INT_GET(dic->di_version, ARCH_CONVERT) == XFS_DINODE_VERSION_1) { | |
145 | buf->bs_nlink = INT_GET(dic->di_onlink, ARCH_CONVERT); | |
146 | buf->bs_projid = 0; | |
147 | } else { | |
148 | buf->bs_nlink = INT_GET(dic->di_nlink, ARCH_CONVERT); | |
149 | buf->bs_projid = INT_GET(dic->di_projid, ARCH_CONVERT); | |
150 | } | |
151 | ||
152 | buf->bs_ino = ino; | |
153 | buf->bs_mode = INT_GET(dic->di_mode, ARCH_CONVERT); | |
154 | buf->bs_uid = INT_GET(dic->di_uid, ARCH_CONVERT); | |
155 | buf->bs_gid = INT_GET(dic->di_gid, ARCH_CONVERT); | |
156 | buf->bs_size = INT_GET(dic->di_size, ARCH_CONVERT); | |
157 | buf->bs_atime.tv_sec = INT_GET(dic->di_atime.t_sec, ARCH_CONVERT); | |
158 | buf->bs_atime.tv_nsec = INT_GET(dic->di_atime.t_nsec, ARCH_CONVERT); | |
159 | buf->bs_mtime.tv_sec = INT_GET(dic->di_mtime.t_sec, ARCH_CONVERT); | |
160 | buf->bs_mtime.tv_nsec = INT_GET(dic->di_mtime.t_nsec, ARCH_CONVERT); | |
161 | buf->bs_ctime.tv_sec = INT_GET(dic->di_ctime.t_sec, ARCH_CONVERT); | |
162 | buf->bs_ctime.tv_nsec = INT_GET(dic->di_ctime.t_nsec, ARCH_CONVERT); | |
163 | buf->bs_xflags = xfs_dic2xflags(dic); | |
164 | buf->bs_extsize = INT_GET(dic->di_extsize, ARCH_CONVERT) << mp->m_sb.sb_blocklog; | |
165 | buf->bs_extents = INT_GET(dic->di_nextents, ARCH_CONVERT); | |
166 | buf->bs_gen = INT_GET(dic->di_gen, ARCH_CONVERT); | |
167 | memset(buf->bs_pad, 0, sizeof(buf->bs_pad)); | |
168 | buf->bs_dmevmask = INT_GET(dic->di_dmevmask, ARCH_CONVERT); | |
169 | buf->bs_dmstate = INT_GET(dic->di_dmstate, ARCH_CONVERT); | |
170 | buf->bs_aextents = INT_GET(dic->di_anextents, ARCH_CONVERT); | |
171 | ||
172 | switch (INT_GET(dic->di_format, ARCH_CONVERT)) { | |
173 | case XFS_DINODE_FMT_DEV: | |
174 | buf->bs_rdev = INT_GET(dip->di_u.di_dev, ARCH_CONVERT); | |
175 | buf->bs_blksize = BLKDEV_IOSIZE; | |
176 | buf->bs_blocks = 0; | |
177 | break; | |
178 | case XFS_DINODE_FMT_LOCAL: | |
179 | case XFS_DINODE_FMT_UUID: | |
180 | buf->bs_rdev = 0; | |
181 | buf->bs_blksize = mp->m_sb.sb_blocksize; | |
182 | buf->bs_blocks = 0; | |
183 | break; | |
184 | case XFS_DINODE_FMT_EXTENTS: | |
185 | case XFS_DINODE_FMT_BTREE: | |
186 | buf->bs_rdev = 0; | |
187 | buf->bs_blksize = mp->m_sb.sb_blocksize; | |
188 | buf->bs_blocks = INT_GET(dic->di_nblocks, ARCH_CONVERT); | |
189 | break; | |
190 | } | |
191 | ||
192 | return 0; | |
193 | } | |
194 | ||
195 | /* | |
196 | * Return stat information for one inode. | |
197 | * Return 0 if ok, else errno. | |
198 | */ | |
199 | int /* error status */ | |
200 | xfs_bulkstat_one( | |
201 | xfs_mount_t *mp, /* mount point for filesystem */ | |
202 | xfs_ino_t ino, /* inode number to get data for */ | |
203 | void __user *buffer, /* buffer to place output in */ | |
204 | int ubsize, /* size of buffer */ | |
205 | void *private_data, /* my private data */ | |
206 | xfs_daddr_t bno, /* starting bno of inode cluster */ | |
207 | int *ubused, /* bytes used by me */ | |
208 | void *dibuff, /* on-disk inode buffer */ | |
209 | int *stat) /* BULKSTAT_RV_... */ | |
210 | { | |
211 | xfs_bstat_t *buf; /* return buffer */ | |
212 | int error = 0; /* error value */ | |
213 | xfs_dinode_t *dip; /* dinode inode pointer */ | |
214 | ||
215 | dip = (xfs_dinode_t *)dibuff; | |
216 | ||
217 | if (!buffer || ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino || | |
218 | (XFS_SB_VERSION_HASQUOTA(&mp->m_sb) && | |
219 | (ino == mp->m_sb.sb_uquotino || ino == mp->m_sb.sb_gquotino))) { | |
220 | *stat = BULKSTAT_RV_NOTHING; | |
221 | return XFS_ERROR(EINVAL); | |
222 | } | |
223 | if (ubsize < sizeof(*buf)) { | |
224 | *stat = BULKSTAT_RV_NOTHING; | |
225 | return XFS_ERROR(ENOMEM); | |
226 | } | |
227 | ||
228 | buf = kmem_alloc(sizeof(*buf), KM_SLEEP); | |
229 | ||
230 | if (dip == NULL) { | |
231 | /* We're not being passed a pointer to a dinode. This happens | |
232 | * if BULKSTAT_FG_IGET is selected. Do the iget. | |
233 | */ | |
234 | error = xfs_bulkstat_one_iget(mp, ino, bno, buf, stat); | |
235 | if (error) | |
236 | goto out_free; | |
237 | } else { | |
238 | xfs_bulkstat_one_dinode(mp, ino, dip, buf); | |
239 | } | |
240 | ||
241 | if (copy_to_user(buffer, buf, sizeof(*buf))) { | |
242 | *stat = BULKSTAT_RV_NOTHING; | |
243 | error = EFAULT; | |
244 | goto out_free; | |
245 | } | |
246 | ||
247 | *stat = BULKSTAT_RV_DIDONE; | |
248 | if (ubused) | |
249 | *ubused = sizeof(*buf); | |
250 | ||
251 | out_free: | |
252 | kmem_free(buf, sizeof(*buf)); | |
253 | return error; | |
254 | } | |
255 | ||
8b56f083 NS |
256 | /* |
257 | * Test to see whether we can use the ondisk inode directly, based | |
258 | * on the given bulkstat flags, filling in dipp accordingly. | |
259 | * Returns zero if the inode is dodgey. | |
260 | */ | |
261 | STATIC int | |
262 | xfs_bulkstat_use_dinode( | |
263 | xfs_mount_t *mp, | |
264 | int flags, | |
265 | xfs_buf_t *bp, | |
266 | int clustidx, | |
267 | xfs_dinode_t **dipp) | |
268 | { | |
269 | xfs_dinode_t *dip; | |
270 | unsigned int aformat; | |
271 | ||
272 | *dipp = NULL; | |
273 | if (!bp || (flags & BULKSTAT_FG_IGET)) | |
274 | return 1; | |
275 | dip = (xfs_dinode_t *) | |
276 | xfs_buf_offset(bp, clustidx << mp->m_sb.sb_inodelog); | |
277 | if (INT_GET(dip->di_core.di_magic, ARCH_CONVERT) != XFS_DINODE_MAGIC || | |
278 | !XFS_DINODE_GOOD_VERSION( | |
279 | INT_GET(dip->di_core.di_version, ARCH_CONVERT))) | |
280 | return 0; | |
281 | if (flags & BULKSTAT_FG_QUICK) { | |
282 | *dipp = dip; | |
283 | return 1; | |
284 | } | |
285 | /* BULKSTAT_FG_INLINE: if attr fork is local, or not there, use it */ | |
286 | aformat = INT_GET(dip->di_core.di_aformat, ARCH_CONVERT); | |
287 | if ((XFS_CFORK_Q(&dip->di_core) == 0) || | |
288 | (aformat == XFS_DINODE_FMT_LOCAL) || | |
289 | (aformat == XFS_DINODE_FMT_EXTENTS && !dip->di_core.di_anextents)) { | |
290 | *dipp = dip; | |
291 | return 1; | |
292 | } | |
293 | return 1; | |
294 | } | |
295 | ||
1da177e4 LT |
296 | /* |
297 | * Return stat information in bulk (by-inode) for the filesystem. | |
298 | */ | |
299 | int /* error status */ | |
300 | xfs_bulkstat( | |
301 | xfs_mount_t *mp, /* mount point for filesystem */ | |
302 | xfs_ino_t *lastinop, /* last inode returned */ | |
303 | int *ubcountp, /* size of buffer/count returned */ | |
304 | bulkstat_one_pf formatter, /* func that'd fill a single buf */ | |
305 | void *private_data,/* private data for formatter */ | |
306 | size_t statstruct_size, /* sizeof struct filling */ | |
307 | char __user *ubuffer, /* buffer with inode stats */ | |
308 | int flags, /* defined in xfs_itable.h */ | |
c41564b5 | 309 | int *done) /* 1 if there are more stats to get */ |
1da177e4 LT |
310 | { |
311 | xfs_agblock_t agbno=0;/* allocation group block number */ | |
312 | xfs_buf_t *agbp; /* agi header buffer */ | |
313 | xfs_agi_t *agi; /* agi header data */ | |
314 | xfs_agino_t agino; /* inode # in allocation group */ | |
315 | xfs_agnumber_t agno; /* allocation group number */ | |
316 | xfs_daddr_t bno; /* inode cluster start daddr */ | |
317 | int chunkidx; /* current index into inode chunk */ | |
318 | int clustidx; /* current index into inode cluster */ | |
319 | xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */ | |
320 | int end_of_ag; /* set if we've seen the ag end */ | |
321 | int error; /* error code */ | |
322 | int fmterror;/* bulkstat formatter result */ | |
323 | __int32_t gcnt; /* current btree rec's count */ | |
324 | xfs_inofree_t gfree; /* current btree rec's free mask */ | |
325 | xfs_agino_t gino; /* current btree rec's start inode */ | |
326 | int i; /* loop index */ | |
327 | int icount; /* count of inodes good in irbuf */ | |
215101c3 | 328 | size_t irbsize; /* size of irec buffer in bytes */ |
1da177e4 | 329 | xfs_ino_t ino; /* inode number (filesystem) */ |
26275093 NS |
330 | xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */ |
331 | xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */ | |
332 | xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */ | |
1da177e4 LT |
333 | xfs_ino_t lastino=0; /* last inode number returned */ |
334 | int nbcluster; /* # of blocks in a cluster */ | |
335 | int nicluster; /* # of inodes in a cluster */ | |
336 | int nimask; /* mask for inode clusters */ | |
337 | int nirbuf; /* size of irbuf */ | |
338 | int rval; /* return value error code */ | |
339 | int tmp; /* result value from btree calls */ | |
340 | int ubcount; /* size of user's buffer */ | |
341 | int ubleft; /* bytes left in user's buffer */ | |
342 | char __user *ubufp; /* pointer into user's buffer */ | |
343 | int ubelem; /* spaces used in user's buffer */ | |
344 | int ubused; /* bytes used by formatter */ | |
345 | xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */ | |
346 | xfs_dinode_t *dip; /* ptr into bp for specific inode */ | |
347 | xfs_inode_t *ip; /* ptr to in-core inode struct */ | |
348 | ||
349 | /* | |
350 | * Get the last inode value, see if there's nothing to do. | |
351 | */ | |
352 | ino = (xfs_ino_t)*lastinop; | |
353 | dip = NULL; | |
354 | agno = XFS_INO_TO_AGNO(mp, ino); | |
355 | agino = XFS_INO_TO_AGINO(mp, ino); | |
356 | if (agno >= mp->m_sb.sb_agcount || | |
357 | ino != XFS_AGINO_TO_INO(mp, agno, agino)) { | |
358 | *done = 1; | |
359 | *ubcountp = 0; | |
360 | return 0; | |
361 | } | |
362 | ubcount = *ubcountp; /* statstruct's */ | |
363 | ubleft = ubcount * statstruct_size; /* bytes */ | |
364 | *ubcountp = ubelem = 0; | |
365 | *done = 0; | |
366 | fmterror = 0; | |
367 | ubufp = ubuffer; | |
368 | nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ? | |
369 | mp->m_sb.sb_inopblock : | |
370 | (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog); | |
371 | nimask = ~(nicluster - 1); | |
372 | nbcluster = nicluster >> mp->m_sb.sb_inopblog; | |
77e4635a NS |
373 | irbuf = kmem_zalloc_greedy(&irbsize, NBPC, NBPC * 4, |
374 | KM_SLEEP | KM_MAYFAIL | KM_LARGE); | |
bb3c7d29 NS |
375 | nirbuf = irbsize / sizeof(*irbuf); |
376 | ||
1da177e4 LT |
377 | /* |
378 | * Loop over the allocation groups, starting from the last | |
379 | * inode returned; 0 means start of the allocation group. | |
380 | */ | |
381 | rval = 0; | |
382 | while (ubleft >= statstruct_size && agno < mp->m_sb.sb_agcount) { | |
383 | bp = NULL; | |
384 | down_read(&mp->m_peraglock); | |
385 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); | |
386 | up_read(&mp->m_peraglock); | |
387 | if (error) { | |
388 | /* | |
389 | * Skip this allocation group and go to the next one. | |
390 | */ | |
391 | agno++; | |
392 | agino = 0; | |
393 | continue; | |
394 | } | |
395 | agi = XFS_BUF_TO_AGI(agbp); | |
396 | /* | |
397 | * Allocate and initialize a btree cursor for ialloc btree. | |
398 | */ | |
399 | cur = xfs_btree_init_cursor(mp, NULL, agbp, agno, XFS_BTNUM_INO, | |
26275093 | 400 | (xfs_inode_t *)0, 0); |
1da177e4 LT |
401 | irbp = irbuf; |
402 | irbufend = irbuf + nirbuf; | |
403 | end_of_ag = 0; | |
404 | /* | |
405 | * If we're returning in the middle of an allocation group, | |
406 | * we need to get the remainder of the chunk we're in. | |
407 | */ | |
408 | if (agino > 0) { | |
409 | /* | |
410 | * Lookup the inode chunk that this inode lives in. | |
411 | */ | |
412 | error = xfs_inobt_lookup_le(cur, agino, 0, 0, &tmp); | |
413 | if (!error && /* no I/O error */ | |
414 | tmp && /* lookup succeeded */ | |
415 | /* got the record, should always work */ | |
416 | !(error = xfs_inobt_get_rec(cur, &gino, &gcnt, | |
417 | &gfree, &i)) && | |
418 | i == 1 && | |
419 | /* this is the right chunk */ | |
420 | agino < gino + XFS_INODES_PER_CHUNK && | |
421 | /* lastino was not last in chunk */ | |
422 | (chunkidx = agino - gino + 1) < | |
423 | XFS_INODES_PER_CHUNK && | |
424 | /* there are some left allocated */ | |
425 | XFS_INOBT_MASKN(chunkidx, | |
426 | XFS_INODES_PER_CHUNK - chunkidx) & ~gfree) { | |
427 | /* | |
428 | * Grab the chunk record. Mark all the | |
429 | * uninteresting inodes (because they're | |
430 | * before our start point) free. | |
431 | */ | |
432 | for (i = 0; i < chunkidx; i++) { | |
433 | if (XFS_INOBT_MASK(i) & ~gfree) | |
434 | gcnt++; | |
435 | } | |
436 | gfree |= XFS_INOBT_MASKN(0, chunkidx); | |
26275093 NS |
437 | irbp->ir_startino = gino; |
438 | irbp->ir_freecount = gcnt; | |
439 | irbp->ir_free = gfree; | |
1da177e4 LT |
440 | irbp++; |
441 | agino = gino + XFS_INODES_PER_CHUNK; | |
442 | icount = XFS_INODES_PER_CHUNK - gcnt; | |
443 | } else { | |
444 | /* | |
445 | * If any of those tests failed, bump the | |
446 | * inode number (just in case). | |
447 | */ | |
448 | agino++; | |
449 | icount = 0; | |
450 | } | |
451 | /* | |
452 | * In any case, increment to the next record. | |
453 | */ | |
454 | if (!error) | |
455 | error = xfs_inobt_increment(cur, 0, &tmp); | |
456 | } else { | |
457 | /* | |
458 | * Start of ag. Lookup the first inode chunk. | |
459 | */ | |
460 | error = xfs_inobt_lookup_ge(cur, 0, 0, 0, &tmp); | |
461 | icount = 0; | |
462 | } | |
463 | /* | |
464 | * Loop through inode btree records in this ag, | |
465 | * until we run out of inodes or space in the buffer. | |
466 | */ | |
467 | while (irbp < irbufend && icount < ubcount) { | |
468 | /* | |
469 | * Loop as long as we're unable to read the | |
470 | * inode btree. | |
471 | */ | |
472 | while (error) { | |
473 | agino += XFS_INODES_PER_CHUNK; | |
474 | if (XFS_AGINO_TO_AGBNO(mp, agino) >= | |
16259e7d | 475 | be32_to_cpu(agi->agi_length)) |
1da177e4 LT |
476 | break; |
477 | error = xfs_inobt_lookup_ge(cur, agino, 0, 0, | |
478 | &tmp); | |
479 | } | |
480 | /* | |
481 | * If ran off the end of the ag either with an error, | |
482 | * or the normal way, set end and stop collecting. | |
483 | */ | |
484 | if (error || | |
485 | (error = xfs_inobt_get_rec(cur, &gino, &gcnt, | |
486 | &gfree, &i)) || | |
487 | i == 0) { | |
488 | end_of_ag = 1; | |
489 | break; | |
490 | } | |
491 | /* | |
492 | * If this chunk has any allocated inodes, save it. | |
26275093 | 493 | * Also start read-ahead now for this chunk. |
1da177e4 LT |
494 | */ |
495 | if (gcnt < XFS_INODES_PER_CHUNK) { | |
26275093 NS |
496 | /* |
497 | * Loop over all clusters in the next chunk. | |
498 | * Do a readahead if there are any allocated | |
499 | * inodes in that cluster. | |
500 | */ | |
501 | for (agbno = XFS_AGINO_TO_AGBNO(mp, gino), | |
502 | chunkidx = 0; | |
503 | chunkidx < XFS_INODES_PER_CHUNK; | |
504 | chunkidx += nicluster, | |
505 | agbno += nbcluster) { | |
506 | if (XFS_INOBT_MASKN(chunkidx, | |
507 | nicluster) & ~gfree) | |
508 | xfs_btree_reada_bufs(mp, agno, | |
509 | agbno, nbcluster); | |
510 | } | |
511 | irbp->ir_startino = gino; | |
512 | irbp->ir_freecount = gcnt; | |
513 | irbp->ir_free = gfree; | |
1da177e4 LT |
514 | irbp++; |
515 | icount += XFS_INODES_PER_CHUNK - gcnt; | |
516 | } | |
517 | /* | |
518 | * Set agino to after this chunk and bump the cursor. | |
519 | */ | |
520 | agino = gino + XFS_INODES_PER_CHUNK; | |
521 | error = xfs_inobt_increment(cur, 0, &tmp); | |
522 | } | |
523 | /* | |
524 | * Drop the btree buffers and the agi buffer. | |
525 | * We can't hold any of the locks these represent | |
526 | * when calling iget. | |
527 | */ | |
528 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); | |
529 | xfs_buf_relse(agbp); | |
530 | /* | |
531 | * Now format all the good inodes into the user's buffer. | |
532 | */ | |
533 | irbufend = irbp; | |
534 | for (irbp = irbuf; | |
535 | irbp < irbufend && ubleft >= statstruct_size; irbp++) { | |
1da177e4 LT |
536 | /* |
537 | * Now process this chunk of inodes. | |
538 | */ | |
26275093 | 539 | for (agino = irbp->ir_startino, chunkidx = clustidx = 0; |
1da177e4 | 540 | ubleft > 0 && |
26275093 | 541 | irbp->ir_freecount < XFS_INODES_PER_CHUNK; |
1da177e4 LT |
542 | chunkidx++, clustidx++, agino++) { |
543 | ASSERT(chunkidx < XFS_INODES_PER_CHUNK); | |
544 | /* | |
545 | * Recompute agbno if this is the | |
546 | * first inode of the cluster. | |
547 | * | |
548 | * Careful with clustidx. There can be | |
549 | * multple clusters per chunk, a single | |
550 | * cluster per chunk or a cluster that has | |
551 | * inodes represented from several different | |
552 | * chunks (if blocksize is large). | |
553 | * | |
554 | * Because of this, the starting clustidx is | |
555 | * initialized to zero in this loop but must | |
556 | * later be reset after reading in the cluster | |
557 | * buffer. | |
558 | */ | |
559 | if ((chunkidx & (nicluster - 1)) == 0) { | |
560 | agbno = XFS_AGINO_TO_AGBNO(mp, | |
26275093 | 561 | irbp->ir_startino) + |
1da177e4 LT |
562 | ((chunkidx & nimask) >> |
563 | mp->m_sb.sb_inopblog); | |
564 | ||
8b56f083 NS |
565 | if (flags & (BULKSTAT_FG_QUICK | |
566 | BULKSTAT_FG_INLINE)) { | |
1da177e4 LT |
567 | ino = XFS_AGINO_TO_INO(mp, agno, |
568 | agino); | |
569 | bno = XFS_AGB_TO_DADDR(mp, agno, | |
570 | agbno); | |
571 | ||
572 | /* | |
573 | * Get the inode cluster buffer | |
574 | */ | |
575 | ASSERT(xfs_inode_zone != NULL); | |
576 | ip = kmem_zone_zalloc(xfs_inode_zone, | |
577 | KM_SLEEP); | |
578 | ip->i_ino = ino; | |
579 | ip->i_mount = mp; | |
f273ab84 | 580 | spin_lock_init(&ip->i_flags_lock); |
1da177e4 LT |
581 | if (bp) |
582 | xfs_buf_relse(bp); | |
583 | error = xfs_itobp(mp, NULL, ip, | |
b12dd342 NS |
584 | &dip, &bp, bno, |
585 | XFS_IMAP_BULKSTAT); | |
1da177e4 LT |
586 | if (!error) |
587 | clustidx = ip->i_boffset / mp->m_sb.sb_inodesize; | |
588 | kmem_zone_free(xfs_inode_zone, ip); | |
589 | if (XFS_TEST_ERROR(error != 0, | |
590 | mp, XFS_ERRTAG_BULKSTAT_READ_CHUNK, | |
591 | XFS_RANDOM_BULKSTAT_READ_CHUNK)) { | |
592 | bp = NULL; | |
b12dd342 NS |
593 | ubleft = 0; |
594 | rval = error; | |
1da177e4 LT |
595 | break; |
596 | } | |
597 | } | |
598 | } | |
599 | /* | |
600 | * Skip if this inode is free. | |
601 | */ | |
26275093 | 602 | if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) |
1da177e4 LT |
603 | continue; |
604 | /* | |
605 | * Count used inodes as free so we can tell | |
606 | * when the chunk is used up. | |
607 | */ | |
26275093 | 608 | irbp->ir_freecount++; |
1da177e4 LT |
609 | ino = XFS_AGINO_TO_INO(mp, agno, agino); |
610 | bno = XFS_AGB_TO_DADDR(mp, agno, agbno); | |
8b56f083 NS |
611 | if (!xfs_bulkstat_use_dinode(mp, flags, bp, |
612 | clustidx, &dip)) | |
613 | continue; | |
614 | /* | |
615 | * If we need to do an iget, cannot hold bp. | |
616 | * Drop it, until starting the next cluster. | |
617 | */ | |
618 | if ((flags & BULKSTAT_FG_INLINE) && !dip) { | |
619 | if (bp) | |
620 | xfs_buf_relse(bp); | |
621 | bp = NULL; | |
1da177e4 LT |
622 | } |
623 | ||
624 | /* | |
625 | * Get the inode and fill in a single buffer. | |
626 | * BULKSTAT_FG_QUICK uses dip to fill it in. | |
627 | * BULKSTAT_FG_IGET uses igets. | |
8b56f083 NS |
628 | * BULKSTAT_FG_INLINE uses dip if we have an |
629 | * inline attr fork, else igets. | |
1da177e4 LT |
630 | * See: xfs_bulkstat_one & xfs_dm_bulkstat_one. |
631 | * This is also used to count inodes/blks, etc | |
632 | * in xfs_qm_quotacheck. | |
633 | */ | |
634 | ubused = statstruct_size; | |
635 | error = formatter(mp, ino, ubufp, | |
636 | ubleft, private_data, | |
637 | bno, &ubused, dip, &fmterror); | |
638 | if (fmterror == BULKSTAT_RV_NOTHING) { | |
e132f54c | 639 | if (error == EFAULT) { |
22de606a VA |
640 | ubleft = 0; |
641 | rval = error; | |
642 | break; | |
643 | } | |
e132f54c VA |
644 | else if (error == ENOMEM) |
645 | ubleft = 0; | |
1da177e4 LT |
646 | continue; |
647 | } | |
648 | if (fmterror == BULKSTAT_RV_GIVEUP) { | |
649 | ubleft = 0; | |
650 | ASSERT(error); | |
651 | rval = error; | |
652 | break; | |
653 | } | |
654 | if (ubufp) | |
655 | ubufp += ubused; | |
656 | ubleft -= ubused; | |
657 | ubelem++; | |
658 | lastino = ino; | |
659 | } | |
660 | } | |
661 | ||
662 | if (bp) | |
663 | xfs_buf_relse(bp); | |
664 | ||
665 | /* | |
666 | * Set up for the next loop iteration. | |
667 | */ | |
668 | if (ubleft > 0) { | |
669 | if (end_of_ag) { | |
670 | agno++; | |
671 | agino = 0; | |
672 | } else | |
673 | agino = XFS_INO_TO_AGINO(mp, lastino); | |
674 | } else | |
675 | break; | |
676 | } | |
677 | /* | |
678 | * Done, we're either out of filesystem or space to put the data. | |
679 | */ | |
bb3c7d29 | 680 | kmem_free(irbuf, irbsize); |
1da177e4 LT |
681 | *ubcountp = ubelem; |
682 | if (agno >= mp->m_sb.sb_agcount) { | |
683 | /* | |
684 | * If we ran out of filesystem, mark lastino as off | |
685 | * the end of the filesystem, so the next call | |
686 | * will return immediately. | |
687 | */ | |
688 | *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0); | |
689 | *done = 1; | |
690 | } else | |
691 | *lastinop = (xfs_ino_t)lastino; | |
692 | ||
693 | return rval; | |
694 | } | |
695 | ||
696 | /* | |
697 | * Return stat information in bulk (by-inode) for the filesystem. | |
698 | * Special case for non-sequential one inode bulkstat. | |
699 | */ | |
700 | int /* error status */ | |
701 | xfs_bulkstat_single( | |
702 | xfs_mount_t *mp, /* mount point for filesystem */ | |
703 | xfs_ino_t *lastinop, /* inode to return */ | |
704 | char __user *buffer, /* buffer with inode stats */ | |
c41564b5 | 705 | int *done) /* 1 if there are more stats to get */ |
1da177e4 LT |
706 | { |
707 | int count; /* count value for bulkstat call */ | |
708 | int error; /* return value */ | |
709 | xfs_ino_t ino; /* filesystem inode number */ | |
710 | int res; /* result from bs1 */ | |
711 | ||
712 | /* | |
713 | * note that requesting valid inode numbers which are not allocated | |
714 | * to inodes will most likely cause xfs_itobp to generate warning | |
715 | * messages about bad magic numbers. This is ok. The fact that | |
716 | * the inode isn't actually an inode is handled by the | |
717 | * error check below. Done this way to make the usual case faster | |
718 | * at the expense of the error case. | |
719 | */ | |
720 | ||
721 | ino = (xfs_ino_t)*lastinop; | |
722 | error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t), | |
723 | NULL, 0, NULL, NULL, &res); | |
724 | if (error) { | |
725 | /* | |
726 | * Special case way failed, do it the "long" way | |
727 | * to see if that works. | |
728 | */ | |
729 | (*lastinop)--; | |
730 | count = 1; | |
731 | if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one, | |
732 | NULL, sizeof(xfs_bstat_t), buffer, | |
733 | BULKSTAT_FG_IGET, done)) | |
734 | return error; | |
735 | if (count == 0 || (xfs_ino_t)*lastinop != ino) | |
736 | return error == EFSCORRUPTED ? | |
737 | XFS_ERROR(EINVAL) : error; | |
738 | else | |
739 | return 0; | |
740 | } | |
741 | *done = 0; | |
742 | return 0; | |
743 | } | |
744 | ||
745 | /* | |
746 | * Return inode number table for the filesystem. | |
747 | */ | |
748 | int /* error status */ | |
749 | xfs_inumbers( | |
750 | xfs_mount_t *mp, /* mount point for filesystem */ | |
751 | xfs_ino_t *lastino, /* last inode returned */ | |
752 | int *count, /* size of buffer/count returned */ | |
753 | xfs_inogrp_t __user *ubuffer)/* buffer with inode descriptions */ | |
754 | { | |
755 | xfs_buf_t *agbp; | |
756 | xfs_agino_t agino; | |
757 | xfs_agnumber_t agno; | |
758 | int bcount; | |
759 | xfs_inogrp_t *buffer; | |
760 | int bufidx; | |
761 | xfs_btree_cur_t *cur; | |
762 | int error; | |
763 | __int32_t gcnt; | |
764 | xfs_inofree_t gfree; | |
765 | xfs_agino_t gino; | |
766 | int i; | |
767 | xfs_ino_t ino; | |
768 | int left; | |
769 | int tmp; | |
770 | ||
771 | ino = (xfs_ino_t)*lastino; | |
772 | agno = XFS_INO_TO_AGNO(mp, ino); | |
773 | agino = XFS_INO_TO_AGINO(mp, ino); | |
774 | left = *count; | |
775 | *count = 0; | |
776 | bcount = MIN(left, (int)(NBPP / sizeof(*buffer))); | |
777 | buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP); | |
778 | error = bufidx = 0; | |
779 | cur = NULL; | |
780 | agbp = NULL; | |
781 | while (left > 0 && agno < mp->m_sb.sb_agcount) { | |
782 | if (agbp == NULL) { | |
783 | down_read(&mp->m_peraglock); | |
784 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); | |
785 | up_read(&mp->m_peraglock); | |
786 | if (error) { | |
787 | /* | |
788 | * If we can't read the AGI of this ag, | |
789 | * then just skip to the next one. | |
790 | */ | |
791 | ASSERT(cur == NULL); | |
792 | agbp = NULL; | |
793 | agno++; | |
794 | agino = 0; | |
795 | continue; | |
796 | } | |
797 | cur = xfs_btree_init_cursor(mp, NULL, agbp, agno, | |
798 | XFS_BTNUM_INO, (xfs_inode_t *)0, 0); | |
799 | error = xfs_inobt_lookup_ge(cur, agino, 0, 0, &tmp); | |
800 | if (error) { | |
801 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); | |
802 | cur = NULL; | |
803 | xfs_buf_relse(agbp); | |
804 | agbp = NULL; | |
805 | /* | |
806 | * Move up the the last inode in the current | |
807 | * chunk. The lookup_ge will always get | |
808 | * us the first inode in the next chunk. | |
809 | */ | |
810 | agino += XFS_INODES_PER_CHUNK - 1; | |
811 | continue; | |
812 | } | |
813 | } | |
814 | if ((error = xfs_inobt_get_rec(cur, &gino, &gcnt, &gfree, | |
815 | &i)) || | |
816 | i == 0) { | |
817 | xfs_buf_relse(agbp); | |
818 | agbp = NULL; | |
819 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); | |
820 | cur = NULL; | |
821 | agno++; | |
822 | agino = 0; | |
823 | continue; | |
824 | } | |
825 | agino = gino + XFS_INODES_PER_CHUNK - 1; | |
826 | buffer[bufidx].xi_startino = XFS_AGINO_TO_INO(mp, agno, gino); | |
827 | buffer[bufidx].xi_alloccount = XFS_INODES_PER_CHUNK - gcnt; | |
828 | buffer[bufidx].xi_allocmask = ~gfree; | |
829 | bufidx++; | |
830 | left--; | |
831 | if (bufidx == bcount) { | |
832 | if (copy_to_user(ubuffer, buffer, | |
833 | bufidx * sizeof(*buffer))) { | |
834 | error = XFS_ERROR(EFAULT); | |
835 | break; | |
836 | } | |
837 | ubuffer += bufidx; | |
838 | *count += bufidx; | |
839 | bufidx = 0; | |
840 | } | |
841 | if (left) { | |
842 | error = xfs_inobt_increment(cur, 0, &tmp); | |
843 | if (error) { | |
844 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); | |
845 | cur = NULL; | |
846 | xfs_buf_relse(agbp); | |
847 | agbp = NULL; | |
848 | /* | |
849 | * The agino value has already been bumped. | |
850 | * Just try to skip up to it. | |
851 | */ | |
852 | agino += XFS_INODES_PER_CHUNK; | |
853 | continue; | |
854 | } | |
855 | } | |
856 | } | |
857 | if (!error) { | |
858 | if (bufidx) { | |
859 | if (copy_to_user(ubuffer, buffer, | |
860 | bufidx * sizeof(*buffer))) | |
861 | error = XFS_ERROR(EFAULT); | |
862 | else | |
863 | *count += bufidx; | |
864 | } | |
865 | *lastino = XFS_AGINO_TO_INO(mp, agno, agino); | |
866 | } | |
867 | kmem_free(buffer, bcount * sizeof(*buffer)); | |
868 | if (cur) | |
869 | xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR : | |
870 | XFS_BTREE_NOERROR)); | |
871 | if (agbp) | |
872 | xfs_buf_relse(agbp); | |
873 | return error; | |
874 | } |