?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Linux 3.17-rc2
[linux/fpc-iii.git] / fs / xfs / xfs_itable.c
blobf71be9c68017ea993808827918201b5eff31a833
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 return -EINVAL;
241
242 idx = agino - irec->ir_startino + 1;
243 if (idx < XFS_INODES_PER_CHUNK &&
244 (xfs_inobt_maskn(idx, XFS_INODES_PER_CHUNK - idx) & ~irec->ir_free)) {
245 int i;
246
247 /* We got a right chunk with some left inodes allocated at it.
248 * Grab the chunk record. Mark all the uninteresting inodes
249 * free -- because they're before our start point.
250 */
251 for (i = 0; i < idx; i++) {
252 if (XFS_INOBT_MASK(i) & ~irec->ir_free)
253 irec->ir_freecount++;
254 }
255
256 irec->ir_free |= xfs_inobt_maskn(0, idx);
257 *icount = XFS_INODES_PER_CHUNK - irec->ir_freecount;
258 }
259
260 return 0;
261 }
262
263 #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
264
265 /*
266 * Process inodes in chunk with a pointer to a formatter function
267 * that will iget the inode and fill in the appropriate structure.
268 */
269 int
270 xfs_bulkstat_ag_ichunk(
271 struct xfs_mount *mp,
272 xfs_agnumber_t agno,
273 struct xfs_inobt_rec_incore *irbp,
274 bulkstat_one_pf formatter,
275 size_t statstruct_size,
276 struct xfs_bulkstat_agichunk *acp)
277 {
278 xfs_ino_t lastino = acp->ac_lastino;
279 char __user **ubufp = acp->ac_ubuffer;
280 int ubleft = acp->ac_ubleft;
281 int ubelem = acp->ac_ubelem;
282 int chunkidx, clustidx;
283 int error = 0;
284 xfs_agino_t agino;
285
286 for (agino = irbp->ir_startino, chunkidx = clustidx = 0;
287 XFS_BULKSTAT_UBLEFT(ubleft) &&
288 irbp->ir_freecount < XFS_INODES_PER_CHUNK;
289 chunkidx++, clustidx++, agino++) {
290 int fmterror; /* bulkstat formatter result */
291 int ubused;
292 xfs_ino_t ino = XFS_AGINO_TO_INO(mp, agno, agino);
293
294 ASSERT(chunkidx < XFS_INODES_PER_CHUNK);
295
296 /* Skip if this inode is free */
297 if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) {
298 lastino = ino;
299 continue;
300 }
301
302 /*
303 * Count used inodes as free so we can tell when the
304 * chunk is used up.
305 */
306 irbp->ir_freecount++;
307
308 /* Get the inode and fill in a single buffer */
309 ubused = statstruct_size;
310 error = formatter(mp, ino, *ubufp, ubleft, &ubused, &fmterror);
311 if (fmterror == BULKSTAT_RV_NOTHING) {
312 if (error && error != -ENOENT && error != -EINVAL) {
313 ubleft = 0;
314 break;
315 }
316 lastino = ino;
317 continue;
318 }
319 if (fmterror == BULKSTAT_RV_GIVEUP) {
320 ubleft = 0;
321 ASSERT(error);
322 break;
323 }
324 if (*ubufp)
325 *ubufp += ubused;
326 ubleft -= ubused;
327 ubelem++;
328 lastino = ino;
329 }
330
331 acp->ac_lastino = lastino;
332 acp->ac_ubleft = ubleft;
333 acp->ac_ubelem = ubelem;
334
335 return error;
336 }
337
338 /*
339 * Return stat information in bulk (by-inode) for the filesystem.
340 */
341 int /* error status */
342 xfs_bulkstat(
343 xfs_mount_t *mp, /* mount point for filesystem */
344 xfs_ino_t *lastinop, /* last inode returned */
345 int *ubcountp, /* size of buffer/count returned */
346 bulkstat_one_pf formatter, /* func that'd fill a single buf */
347 size_t statstruct_size, /* sizeof struct filling */
348 char __user *ubuffer, /* buffer with inode stats */
349 int *done) /* 1 if there are more stats to get */
350 {
351 xfs_buf_t *agbp; /* agi header buffer */
352 xfs_agi_t *agi; /* agi header data */
353 xfs_agino_t agino; /* inode # in allocation group */
354 xfs_agnumber_t agno; /* allocation group number */
355 xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
356 int end_of_ag; /* set if we've seen the ag end */
357 int error; /* error code */
358 int fmterror;/* bulkstat formatter result */
359 int i; /* loop index */
360 int icount; /* count of inodes good in irbuf */
361 size_t irbsize; /* size of irec buffer in bytes */
362 xfs_ino_t ino; /* inode number (filesystem) */
363 xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */
364 xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
365 xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */
366 xfs_ino_t lastino; /* last inode number returned */
367 int nirbuf; /* size of irbuf */
368 int rval; /* return value error code */
369 int tmp; /* result value from btree calls */
370 int ubcount; /* size of user's buffer */
371 int ubleft; /* bytes left in user's buffer */
372 char __user *ubufp; /* pointer into user's buffer */
373 int ubelem; /* spaces used in user's buffer */
374
375 /*
376 * Get the last inode value, see if there's nothing to do.
377 */
378 ino = (xfs_ino_t)*lastinop;
379 lastino = ino;
380 agno = XFS_INO_TO_AGNO(mp, ino);
381 agino = XFS_INO_TO_AGINO(mp, ino);
382 if (agno >= mp->m_sb.sb_agcount ||
383 ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
384 *done = 1;
385 *ubcountp = 0;
386 return 0;
387 }
388
389 ubcount = *ubcountp; /* statstruct's */
390 ubleft = ubcount * statstruct_size; /* bytes */
391 *ubcountp = ubelem = 0;
392 *done = 0;
393 fmterror = 0;
394 ubufp = ubuffer;
395 irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4);
396 if (!irbuf)
397 return -ENOMEM;
398
399 nirbuf = irbsize / sizeof(*irbuf);
400
401 /*
402 * Loop over the allocation groups, starting from the last
403 * inode returned; 0 means start of the allocation group.
404 */
405 rval = 0;
406 while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) {
407 cond_resched();
408 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
409 if (error)
410 break;
411 agi = XFS_BUF_TO_AGI(agbp);
412 /*
413 * Allocate and initialize a btree cursor for ialloc btree.
414 */
415 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
416 XFS_BTNUM_INO);
417 irbp = irbuf;
418 irbufend = irbuf + nirbuf;
419 end_of_ag = 0;
420 icount = 0;
421 if (agino > 0) {
422 /*
423 * In the middle of an allocation group, we need to get
424 * the remainder of the chunk we're in.
425 */
426 struct xfs_inobt_rec_incore r;
427
428 error = xfs_bulkstat_grab_ichunk(cur, agino, &icount, &r);
429 if (error)
430 break;
431 if (icount) {
432 irbp->ir_startino = r.ir_startino;
433 irbp->ir_freecount = r.ir_freecount;
434 irbp->ir_free = r.ir_free;
435 irbp++;
436 agino = r.ir_startino + XFS_INODES_PER_CHUNK;
437 }
438 /* Increment to the next record */
439 error = xfs_btree_increment(cur, 0, &tmp);
440 } else {
441 /* Start of ag. Lookup the first inode chunk */
442 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &tmp);
443 }
444 if (error)
445 break;
446
447 /*
448 * Loop through inode btree records in this ag,
449 * until we run out of inodes or space in the buffer.
450 */
451 while (irbp < irbufend && icount < ubcount) {
452 struct xfs_inobt_rec_incore r;
453
454 error = xfs_inobt_get_rec(cur, &r, &i);
455 if (error || i == 0) {
456 end_of_ag = 1;
457 break;
458 }
459
460 /*
461 * If this chunk has any allocated inodes, save it.
462 * Also start read-ahead now for this chunk.
463 */
464 if (r.ir_freecount < XFS_INODES_PER_CHUNK) {
465 xfs_bulkstat_ichunk_ra(mp, agno, &r);
466 irbp->ir_startino = r.ir_startino;
467 irbp->ir_freecount = r.ir_freecount;
468 irbp->ir_free = r.ir_free;
469 irbp++;
470 icount += XFS_INODES_PER_CHUNK - r.ir_freecount;
471 }
472 /*
473 * Set agino to after this chunk and bump the cursor.
474 */
475 agino = r.ir_startino + XFS_INODES_PER_CHUNK;
476 error = xfs_btree_increment(cur, 0, &tmp);
477 cond_resched();
478 }
479 /*
480 * Drop the btree buffers and the agi buffer.
481 * We can't hold any of the locks these represent
482 * when calling iget.
483 */
484 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
485 xfs_buf_relse(agbp);
486 /*
487 * Now format all the good inodes into the user's buffer.
488 */
489 irbufend = irbp;
490 for (irbp = irbuf;
491 irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) {
492 struct xfs_bulkstat_agichunk ac;
493
494 ac.ac_lastino = lastino;
495 ac.ac_ubuffer = &ubuffer;
496 ac.ac_ubleft = ubleft;
497 ac.ac_ubelem = ubelem;
498 error = xfs_bulkstat_ag_ichunk(mp, agno, irbp,
499 formatter, statstruct_size, &ac);
500 if (error)
501 rval = error;
502
503 lastino = ac.ac_lastino;
504 ubleft = ac.ac_ubleft;
505 ubelem = ac.ac_ubelem;
506
507 cond_resched();
508 }
509 /*
510 * Set up for the next loop iteration.
511 */
512 if (XFS_BULKSTAT_UBLEFT(ubleft)) {
513 if (end_of_ag) {
514 agno++;
515 agino = 0;
516 } else
517 agino = XFS_INO_TO_AGINO(mp, lastino);
518 } else
519 break;
520 }
521 /*
522 * Done, we're either out of filesystem or space to put the data.
523 */
524 kmem_free(irbuf);
525 *ubcountp = ubelem;
526 /*
527 * Found some inodes, return them now and return the error next time.
528 */
529 if (ubelem)
530 rval = 0;
531 if (agno >= mp->m_sb.sb_agcount) {
532 /*
533 * If we ran out of filesystem, mark lastino as off
534 * the end of the filesystem, so the next call
535 * will return immediately.
536 */
537 *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0);
538 *done = 1;
539 } else
540 *lastinop = (xfs_ino_t)lastino;
541
542 return rval;
543 }
544
545 int
546 xfs_inumbers_fmt(
547 void __user *ubuffer, /* buffer to write to */
548 const struct xfs_inogrp *buffer, /* buffer to read from */
549 long count, /* # of elements to read */
550 long *written) /* # of bytes written */
551 {
552 if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
553 return -EFAULT;
554 *written = count * sizeof(*buffer);
555 return 0;
556 }
557
558 /*
559 * Return inode number table for the filesystem.
560 */
561 int /* error status */
562 xfs_inumbers(
563 struct xfs_mount *mp,/* mount point for filesystem */
564 xfs_ino_t *lastino,/* last inode returned */
565 int *count,/* size of buffer/count returned */
566 void __user *ubuffer,/* buffer with inode descriptions */
567 inumbers_fmt_pf formatter)
568 {
569 xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino);
570 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino);
571 struct xfs_btree_cur *cur = NULL;
572 struct xfs_buf *agbp = NULL;
573 struct xfs_inogrp *buffer;
574 int bcount;
575 int left = *count;
576 int bufidx = 0;
577 int error = 0;
578
579 *count = 0;
580 if (agno >= mp->m_sb.sb_agcount ||
581 *lastino != XFS_AGINO_TO_INO(mp, agno, agino))
582 return error;
583
584 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
585 buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
586 do {
587 struct xfs_inobt_rec_incore r;
588 int stat;
589
590 if (!agbp) {
591 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
592 if (error)
593 break;
594
595 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
596 XFS_BTNUM_INO);
597 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
598 &stat);
599 if (error)
600 break;
601 if (!stat)
602 goto next_ag;
603 }
604
605 error = xfs_inobt_get_rec(cur, &r, &stat);
606 if (error)
607 break;
608 if (!stat)
609 goto next_ag;
610
611 agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
612 buffer[bufidx].xi_startino =
613 XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
614 buffer[bufidx].xi_alloccount =
615 XFS_INODES_PER_CHUNK - r.ir_freecount;
616 buffer[bufidx].xi_allocmask = ~r.ir_free;
617 if (++bufidx == bcount) {
618 long written;
619
620 error = formatter(ubuffer, buffer, bufidx, &written);
621 if (error)
622 break;
623 ubuffer += written;
624 *count += bufidx;
625 bufidx = 0;
626 }
627 if (!--left)
628 break;
629
630 error = xfs_btree_increment(cur, 0, &stat);
631 if (error)
632 break;
633 if (stat)
634 continue;
635
636 next_ag:
637 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
638 cur = NULL;
639 xfs_buf_relse(agbp);
640 agbp = NULL;
641 agino = 0;
642 } while (++agno < mp->m_sb.sb_agcount);
643
644 if (!error) {
645 if (bufidx) {
646 long written;
647
648 error = formatter(ubuffer, buffer, bufidx, &written);
649 if (!error)
650 *count += bufidx;
651 }
652 *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
653 }
654
655 kmem_free(buffer);
656 if (cur)
657 xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
658 XFS_BTREE_NOERROR));
659 if (agbp)
660 xfs_buf_relse(agbp);
661
662 return error;
663 }
Linux with added FPC-III support