2 * Copyright (c) 2000-2003 Silicon Graphics, Inc. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of version 2 of the GNU General Public License as
6 * published by the Free Software Foundation.
8 * This program is distributed in the hope that it would be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12 * Further, this software is distributed without any warranty that it is
13 * free of the rightful claim of any third person regarding infringement
14 * or the like. Any license provided herein, whether implied or
15 * otherwise, applies only to this software file. Patent licenses, if
16 * any, provided herein do not apply to combinations of this program with
17 * other software, or any other product whatsoever.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write the Free Software Foundation, Inc., 59
21 * Temple Place - Suite 330, Boston MA 02111-1307, USA.
23 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
24 * Mountain View, CA 94043, or:
28 * For further information regarding this notice, see:
30 * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
34 #include "xfs_macros.h"
35 #include "xfs_types.h"
38 #include "xfs_trans.h"
39 #include "xfs_trans_priv.h"
44 #include "xfs_dmapi.h"
45 #include "xfs_mount.h"
46 #include "xfs_alloc_btree.h"
47 #include "xfs_bmap_btree.h"
48 #include "xfs_ialloc_btree.h"
49 #include "xfs_btree.h"
51 #include "xfs_alloc.h"
52 #include "xfs_ialloc.h"
53 #include "xfs_attr_sf.h"
54 #include "xfs_dir_sf.h"
55 #include "xfs_dir2_sf.h"
56 #include "xfs_dinode.h"
57 #include "xfs_inode_item.h"
58 #include "xfs_inode.h"
60 #include "xfs_buf_item.h"
62 #include "xfs_error.h"
64 #include "xfs_utils.h"
65 #include "xfs_dir2_trace.h"
66 #include "xfs_quota.h"
71 kmem_zone_t *xfs_ifork_zone;
72 kmem_zone_t *xfs_inode_zone;
73 kmem_zone_t *xfs_chashlist_zone;
76 * Used in xfs_itruncate(). This is the maximum number of extents
77 * freed from a file in a single transaction.
79 #define XFS_ITRUNC_MAX_EXTENTS 2
81 STATIC int xfs_iflush_int(xfs_inode_t *, xfs_buf_t *);
82 STATIC int xfs_iformat_local(xfs_inode_t *, xfs_dinode_t *, int, int);
83 STATIC int xfs_iformat_extents(xfs_inode_t *, xfs_dinode_t *, int);
84 STATIC int xfs_iformat_btree(xfs_inode_t *, xfs_dinode_t *, int);
89 * Make sure that the extents in the given memory buffer
103 for (i = 0; i < nrecs; i++) {
104 rec.l0 = get_unaligned((__uint64_t*)&ep->l0);
105 rec.l1 = get_unaligned((__uint64_t*)&ep->l1);
107 xfs_bmbt_disk_get_all(&rec, &irec);
109 xfs_bmbt_get_all(&rec, &irec);
110 if (fmt == XFS_EXTFMT_NOSTATE)
111 ASSERT(irec.br_state == XFS_EXT_NORM);
116 #define xfs_validate_extents(ep, nrecs, disk, fmt)
120 * Check that none of the inode's in the buffer have a next
121 * unlinked field of 0.
133 j = mp->m_inode_cluster_size >> mp->m_sb.sb_inodelog;
135 for (i = 0; i < j; i++) {
136 dip = (xfs_dinode_t *)xfs_buf_offset(bp,
137 i * mp->m_sb.sb_inodesize);
138 if (INT_ISZERO(dip->di_next_unlinked, ARCH_CONVERT)) {
139 xfs_fs_cmn_err(CE_ALERT, mp,
140 "Detected a bogus zero next_unlinked field in incore inode buffer 0x%p. About to pop an ASSERT.",
142 ASSERT(!INT_ISZERO(dip->di_next_unlinked, ARCH_CONVERT));
149 * called from bwrite on xfs inode buffers
152 xfs_inobp_bwcheck(xfs_buf_t *bp)
159 ASSERT(XFS_BUF_FSPRIVATE3(bp, void *) != NULL);
161 mp = XFS_BUF_FSPRIVATE3(bp, xfs_mount_t *);
164 j = mp->m_inode_cluster_size >> mp->m_sb.sb_inodelog;
166 for (i = 0; i < j; i++) {
167 dip = (xfs_dinode_t *) xfs_buf_offset(bp,
168 i * mp->m_sb.sb_inodesize);
169 if (INT_GET(dip->di_core.di_magic, ARCH_CONVERT) != XFS_DINODE_MAGIC) {
171 "Bad magic # 0x%x in XFS inode buffer 0x%Lx, starting blockno %Ld, offset 0x%x",
172 INT_GET(dip->di_core.di_magic, ARCH_CONVERT),
173 (__uint64_t)(__psunsigned_t) bp,
174 (__int64_t) XFS_BUF_ADDR(bp),
175 xfs_buf_offset(bp, i * mp->m_sb.sb_inodesize));
176 xfs_fs_cmn_err(CE_WARN, mp,
177 "corrupt, unmount and run xfs_repair");
179 if (INT_ISZERO(dip->di_next_unlinked, ARCH_CONVERT)) {
181 "Bad next_unlinked field (0) in XFS inode buffer 0x%p, starting blockno %Ld, offset 0x%x",
182 (__uint64_t)(__psunsigned_t) bp,
183 (__int64_t) XFS_BUF_ADDR(bp),
184 xfs_buf_offset(bp, i * mp->m_sb.sb_inodesize));
185 xfs_fs_cmn_err(CE_WARN, mp,
186 "corrupt, unmount and run xfs_repair");
194 * This routine is called to map an inode number within a file
195 * system to the buffer containing the on-disk version of the
196 * inode. It returns a pointer to the buffer containing the
197 * on-disk inode in the bpp parameter, and in the dip parameter
198 * it returns a pointer to the on-disk inode within that buffer.
200 * If a non-zero error is returned, then the contents of bpp and
201 * dipp are undefined.
203 * Use xfs_imap() to determine the size and location of the
204 * buffer to read from disk.
222 * Call the space managment code to find the location of the
226 error = xfs_imap(mp, tp, ino, &imap, XFS_IMAP_LOOKUP);
229 "xfs_inotobp: xfs_imap() returned an "
230 "error %d on %s. Returning error.", error, mp->m_fsname);
235 * If the inode number maps to a block outside the bounds of the
236 * file system then return NULL rather than calling read_buf
237 * and panicing when we get an error from the driver.
239 if ((imap.im_blkno + imap.im_len) >
240 XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks)) {
242 "xfs_inotobp: inode number (%d + %d) maps to a block outside the bounds "
243 "of the file system %s. Returning EINVAL.",
244 imap.im_blkno, imap.im_len,mp->m_fsname);
245 return XFS_ERROR(EINVAL);
249 * Read in the buffer. If tp is NULL, xfs_trans_read_buf() will
250 * default to just a read_buf() call.
252 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, imap.im_blkno,
253 (int)imap.im_len, XFS_BUF_LOCK, &bp);
257 "xfs_inotobp: xfs_trans_read_buf() returned an "
258 "error %d on %s. Returning error.", error, mp->m_fsname);
261 dip = (xfs_dinode_t *)xfs_buf_offset(bp, 0);
263 INT_GET(dip->di_core.di_magic, ARCH_CONVERT) == XFS_DINODE_MAGIC &&
264 XFS_DINODE_GOOD_VERSION(INT_GET(dip->di_core.di_version, ARCH_CONVERT));
265 if (unlikely(XFS_TEST_ERROR(!di_ok, mp, XFS_ERRTAG_ITOBP_INOTOBP,
266 XFS_RANDOM_ITOBP_INOTOBP))) {
267 XFS_CORRUPTION_ERROR("xfs_inotobp", XFS_ERRLEVEL_LOW, mp, dip);
268 xfs_trans_brelse(tp, bp);
270 "xfs_inotobp: XFS_TEST_ERROR() returned an "
271 "error on %s. Returning EFSCORRUPTED.", mp->m_fsname);
272 return XFS_ERROR(EFSCORRUPTED);
275 xfs_inobp_check(mp, bp);
278 * Set *dipp to point to the on-disk inode in the buffer.
280 *dipp = (xfs_dinode_t *)xfs_buf_offset(bp, imap.im_boffset);
282 *offset = imap.im_boffset;
288 * This routine is called to map an inode to the buffer containing
289 * the on-disk version of the inode. It returns a pointer to the
290 * buffer containing the on-disk inode in the bpp parameter, and in
291 * the dip parameter it returns a pointer to the on-disk inode within
294 * If a non-zero error is returned, then the contents of bpp and
295 * dipp are undefined.
297 * If the inode is new and has not yet been initialized, use xfs_imap()
298 * to determine the size and location of the buffer to read from disk.
299 * If the inode has already been mapped to its buffer and read in once,
300 * then use the mapping information stored in the inode rather than
301 * calling xfs_imap(). This allows us to avoid the overhead of looking
302 * at the inode btree for small block file systems (see xfs_dilocate()).
303 * We can tell whether the inode has been mapped in before by comparing
304 * its disk block address to 0. Only uninitialized inodes will have
305 * 0 for the disk block address.
324 if (ip->i_blkno == (xfs_daddr_t)0) {
326 * Call the space management code to find the location of the
330 error = xfs_imap(mp, tp, ip->i_ino, &imap, XFS_IMAP_LOOKUP);
336 * If the inode number maps to a block outside the bounds
337 * of the file system then return NULL rather than calling
338 * read_buf and panicing when we get an error from the
341 if ((imap.im_blkno + imap.im_len) >
342 XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks)) {
344 xfs_fs_cmn_err(CE_ALERT, mp, "xfs_itobp: "
345 "(imap.im_blkno (0x%llx) "
346 "+ imap.im_len (0x%llx)) > "
347 " XFS_FSB_TO_BB(mp, "
348 "mp->m_sb.sb_dblocks) (0x%llx)",
349 (unsigned long long) imap.im_blkno,
350 (unsigned long long) imap.im_len,
351 XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks));
353 return XFS_ERROR(EINVAL);
357 * Fill in the fields in the inode that will be used to
358 * map the inode to its buffer from now on.
360 ip->i_blkno = imap.im_blkno;
361 ip->i_len = imap.im_len;
362 ip->i_boffset = imap.im_boffset;
365 * We've already mapped the inode once, so just use the
366 * mapping that we saved the first time.
368 imap.im_blkno = ip->i_blkno;
369 imap.im_len = ip->i_len;
370 imap.im_boffset = ip->i_boffset;
372 ASSERT(bno == 0 || bno == imap.im_blkno);
375 * Read in the buffer. If tp is NULL, xfs_trans_read_buf() will
376 * default to just a read_buf() call.
378 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, imap.im_blkno,
379 (int)imap.im_len, XFS_BUF_LOCK, &bp);
383 xfs_fs_cmn_err(CE_ALERT, mp, "xfs_itobp: "
384 "xfs_trans_read_buf() returned error %d, "
385 "imap.im_blkno 0x%llx, imap.im_len 0x%llx",
386 error, (unsigned long long) imap.im_blkno,
387 (unsigned long long) imap.im_len);
393 * Validate the magic number and version of every inode in the buffer
394 * (if DEBUG kernel) or the first inode in the buffer, otherwise.
397 ni = BBTOB(imap.im_len) >> mp->m_sb.sb_inodelog;
401 for (i = 0; i < ni; i++) {
405 dip = (xfs_dinode_t *)xfs_buf_offset(bp,
406 (i << mp->m_sb.sb_inodelog));
407 di_ok = INT_GET(dip->di_core.di_magic, ARCH_CONVERT) == XFS_DINODE_MAGIC &&
408 XFS_DINODE_GOOD_VERSION(INT_GET(dip->di_core.di_version, ARCH_CONVERT));
409 if (unlikely(XFS_TEST_ERROR(!di_ok, mp, XFS_ERRTAG_ITOBP_INOTOBP,
410 XFS_RANDOM_ITOBP_INOTOBP))) {
412 prdev("bad inode magic/vsn daddr %lld #%d (magic=%x)",
414 (unsigned long long)imap.im_blkno, i,
415 INT_GET(dip->di_core.di_magic, ARCH_CONVERT));
417 XFS_CORRUPTION_ERROR("xfs_itobp", XFS_ERRLEVEL_HIGH,
419 xfs_trans_brelse(tp, bp);
420 return XFS_ERROR(EFSCORRUPTED);
423 #endif /* __KERNEL__ */
425 xfs_inobp_check(mp, bp);
428 * Mark the buffer as an inode buffer now that it looks good
430 XFS_BUF_SET_VTYPE(bp, B_FS_INO);
433 * Set *dipp to point to the on-disk inode in the buffer.
435 *dipp = (xfs_dinode_t *)xfs_buf_offset(bp, imap.im_boffset);
441 * Move inode type and inode format specific information from the
442 * on-disk inode to the in-core inode. For fifos, devs, and sockets
443 * this means set if_rdev to the proper value. For files, directories,
444 * and symlinks this means to bring in the in-line data or extent
445 * pointers. For a file in B-tree format, only the root is immediately
446 * brought in-core. The rest will be in-lined in if_extents when it
447 * is first referenced (see xfs_iread_extents()).
454 xfs_attr_shortform_t *atp;
458 ip->i_df.if_ext_max =
459 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t);
463 INT_GET(dip->di_core.di_nextents, ARCH_CONVERT) +
464 INT_GET(dip->di_core.di_anextents, ARCH_CONVERT) >
465 INT_GET(dip->di_core.di_nblocks, ARCH_CONVERT))) {
466 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
467 "corrupt dinode %Lu, extent total = %d, nblocks = %Lu."
468 " Unmount and run xfs_repair.",
469 (unsigned long long)ip->i_ino,
470 (int)(INT_GET(dip->di_core.di_nextents, ARCH_CONVERT)
471 + INT_GET(dip->di_core.di_anextents, ARCH_CONVERT)),
473 INT_GET(dip->di_core.di_nblocks, ARCH_CONVERT));
474 XFS_CORRUPTION_ERROR("xfs_iformat(1)", XFS_ERRLEVEL_LOW,
476 return XFS_ERROR(EFSCORRUPTED);
479 if (unlikely(INT_GET(dip->di_core.di_forkoff, ARCH_CONVERT) > ip->i_mount->m_sb.sb_inodesize)) {
480 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
481 "corrupt dinode %Lu, forkoff = 0x%x."
482 " Unmount and run xfs_repair.",
483 (unsigned long long)ip->i_ino,
484 (int)(INT_GET(dip->di_core.di_forkoff, ARCH_CONVERT)));
485 XFS_CORRUPTION_ERROR("xfs_iformat(2)", XFS_ERRLEVEL_LOW,
487 return XFS_ERROR(EFSCORRUPTED);
490 switch (ip->i_d.di_mode & S_IFMT) {
495 if (unlikely(INT_GET(dip->di_core.di_format, ARCH_CONVERT) != XFS_DINODE_FMT_DEV)) {
496 XFS_CORRUPTION_ERROR("xfs_iformat(3)", XFS_ERRLEVEL_LOW,
498 return XFS_ERROR(EFSCORRUPTED);
501 ip->i_df.if_u2.if_rdev = INT_GET(dip->di_u.di_dev, ARCH_CONVERT);
507 switch (INT_GET(dip->di_core.di_format, ARCH_CONVERT)) {
508 case XFS_DINODE_FMT_LOCAL:
510 * no local regular files yet
512 if (unlikely((INT_GET(dip->di_core.di_mode, ARCH_CONVERT) & S_IFMT) == S_IFREG)) {
513 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
514 "corrupt inode (local format for regular file) %Lu. Unmount and run xfs_repair.",
515 (unsigned long long) ip->i_ino);
516 XFS_CORRUPTION_ERROR("xfs_iformat(4)",
519 return XFS_ERROR(EFSCORRUPTED);
522 di_size = INT_GET(dip->di_core.di_size, ARCH_CONVERT);
523 if (unlikely(di_size >
524 XFS_DFORK_DSIZE_ARCH(dip, ip->i_mount, ARCH_CONVERT))) {
525 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
526 "corrupt inode %Lu (bad size %Ld for local inode). Unmount and run xfs_repair.",
527 (unsigned long long) ip->i_ino,
528 (long long) di_size);
529 XFS_CORRUPTION_ERROR("xfs_iformat(5)",
532 return XFS_ERROR(EFSCORRUPTED);
536 error = xfs_iformat_local(ip, dip, XFS_DATA_FORK, size);
538 case XFS_DINODE_FMT_EXTENTS:
539 error = xfs_iformat_extents(ip, dip, XFS_DATA_FORK);
541 case XFS_DINODE_FMT_BTREE:
542 error = xfs_iformat_btree(ip, dip, XFS_DATA_FORK);
545 XFS_ERROR_REPORT("xfs_iformat(6)", XFS_ERRLEVEL_LOW,
547 return XFS_ERROR(EFSCORRUPTED);
552 XFS_ERROR_REPORT("xfs_iformat(7)", XFS_ERRLEVEL_LOW, ip->i_mount);
553 return XFS_ERROR(EFSCORRUPTED);
558 if (!XFS_DFORK_Q_ARCH(dip, ARCH_CONVERT))
560 ASSERT(ip->i_afp == NULL);
561 ip->i_afp = kmem_zone_zalloc(xfs_ifork_zone, KM_SLEEP);
562 ip->i_afp->if_ext_max =
563 XFS_IFORK_ASIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t);
564 switch (INT_GET(dip->di_core.di_aformat, ARCH_CONVERT)) {
565 case XFS_DINODE_FMT_LOCAL:
566 atp = (xfs_attr_shortform_t *)XFS_DFORK_APTR_ARCH(dip, ARCH_CONVERT);
567 size = (int)INT_GET(atp->hdr.totsize, ARCH_CONVERT);
568 error = xfs_iformat_local(ip, dip, XFS_ATTR_FORK, size);
570 case XFS_DINODE_FMT_EXTENTS:
571 error = xfs_iformat_extents(ip, dip, XFS_ATTR_FORK);
573 case XFS_DINODE_FMT_BTREE:
574 error = xfs_iformat_btree(ip, dip, XFS_ATTR_FORK);
577 error = XFS_ERROR(EFSCORRUPTED);
581 kmem_zone_free(xfs_ifork_zone, ip->i_afp);
583 xfs_idestroy_fork(ip, XFS_DATA_FORK);
589 * The file is in-lined in the on-disk inode.
590 * If it fits into if_inline_data, then copy
591 * it there, otherwise allocate a buffer for it
592 * and copy the data there. Either way, set
593 * if_data to point at the data.
594 * If we allocate a buffer for the data, make
595 * sure that its size is a multiple of 4 and
596 * record the real size in i_real_bytes.
609 * If the size is unreasonable, then something
610 * is wrong and we just bail out rather than crash in
611 * kmem_alloc() or memcpy() below.
613 if (unlikely(size > XFS_DFORK_SIZE_ARCH(dip, ip->i_mount, whichfork, ARCH_CONVERT))) {
614 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
615 "corrupt inode %Lu (bad size %d for local fork, size = %d). Unmount and run xfs_repair.",
616 (unsigned long long) ip->i_ino, size,
617 XFS_DFORK_SIZE_ARCH(dip, ip->i_mount, whichfork, ARCH_CONVERT));
618 XFS_CORRUPTION_ERROR("xfs_iformat_local", XFS_ERRLEVEL_LOW,
620 return XFS_ERROR(EFSCORRUPTED);
622 ifp = XFS_IFORK_PTR(ip, whichfork);
625 ifp->if_u1.if_data = NULL;
626 else if (size <= sizeof(ifp->if_u2.if_inline_data))
627 ifp->if_u1.if_data = ifp->if_u2.if_inline_data;
629 real_size = roundup(size, 4);
630 ifp->if_u1.if_data = kmem_alloc(real_size, KM_SLEEP);
632 ifp->if_bytes = size;
633 ifp->if_real_bytes = real_size;
635 memcpy(ifp->if_u1.if_data,
636 XFS_DFORK_PTR_ARCH(dip, whichfork, ARCH_CONVERT), size);
637 ifp->if_flags &= ~XFS_IFEXTENTS;
638 ifp->if_flags |= XFS_IFINLINE;
643 * The file consists of a set of extents all
644 * of which fit into the on-disk inode.
645 * If there are few enough extents to fit into
646 * the if_inline_ext, then copy them there.
647 * Otherwise allocate a buffer for them and copy
648 * them into it. Either way, set if_extents
649 * to point at the extents.
657 xfs_bmbt_rec_t *ep, *dp;
664 ifp = XFS_IFORK_PTR(ip, whichfork);
665 nex = XFS_DFORK_NEXTENTS_ARCH(dip, whichfork, ARCH_CONVERT);
666 size = nex * (uint)sizeof(xfs_bmbt_rec_t);
669 * If the number of extents is unreasonable, then something
670 * is wrong and we just bail out rather than crash in
671 * kmem_alloc() or memcpy() below.
673 if (unlikely(size < 0 || size > XFS_DFORK_SIZE_ARCH(dip, ip->i_mount, whichfork, ARCH_CONVERT))) {
674 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
675 "corrupt inode %Lu ((a)extents = %d). Unmount and run xfs_repair.",
676 (unsigned long long) ip->i_ino, nex);
677 XFS_CORRUPTION_ERROR("xfs_iformat_extents(1)", XFS_ERRLEVEL_LOW,
679 return XFS_ERROR(EFSCORRUPTED);
684 ifp->if_u1.if_extents = NULL;
685 else if (nex <= XFS_INLINE_EXTS)
686 ifp->if_u1.if_extents = ifp->if_u2.if_inline_ext;
688 ifp->if_u1.if_extents = kmem_alloc(size, KM_SLEEP);
689 ASSERT(ifp->if_u1.if_extents != NULL);
692 ifp->if_bytes = size;
693 ifp->if_real_bytes = real_size;
695 dp = (xfs_bmbt_rec_t *)
696 XFS_DFORK_PTR_ARCH(dip, whichfork, ARCH_CONVERT);
697 xfs_validate_extents(dp, nex, 1, XFS_EXTFMT_INODE(ip));
698 ep = ifp->if_u1.if_extents;
699 for (i = 0; i < nex; i++, ep++, dp++) {
700 ep->l0 = INT_GET(get_unaligned((__uint64_t*)&dp->l0),
702 ep->l1 = INT_GET(get_unaligned((__uint64_t*)&dp->l1),
705 xfs_bmap_trace_exlist("xfs_iformat_extents", ip, nex,
707 if (whichfork != XFS_DATA_FORK ||
708 XFS_EXTFMT_INODE(ip) == XFS_EXTFMT_NOSTATE)
709 if (unlikely(xfs_check_nostate_extents(
710 ifp->if_u1.if_extents, nex))) {
711 XFS_ERROR_REPORT("xfs_iformat_extents(2)",
714 return XFS_ERROR(EFSCORRUPTED);
717 ifp->if_flags |= XFS_IFEXTENTS;
722 * The file has too many extents to fit into
723 * the inode, so they are in B-tree format.
724 * Allocate a buffer for the root of the B-tree
725 * and copy the root into it. The i_extents
726 * field will remain NULL until all of the
727 * extents are read in (when they are needed).
735 xfs_bmdr_block_t *dfp;
741 ifp = XFS_IFORK_PTR(ip, whichfork);
742 dfp = (xfs_bmdr_block_t *)XFS_DFORK_PTR_ARCH(dip, whichfork, ARCH_CONVERT);
743 size = XFS_BMAP_BROOT_SPACE(dfp);
744 nrecs = XFS_BMAP_BROOT_NUMRECS(dfp);
747 * blow out if -- fork has less extents than can fit in
748 * fork (fork shouldn't be a btree format), root btree
749 * block has more records than can fit into the fork,
750 * or the number of extents is greater than the number of
753 if (unlikely(XFS_IFORK_NEXTENTS(ip, whichfork) <= ifp->if_ext_max
754 || XFS_BMDR_SPACE_CALC(nrecs) >
755 XFS_DFORK_SIZE_ARCH(dip, ip->i_mount, whichfork, ARCH_CONVERT)
756 || XFS_IFORK_NEXTENTS(ip, whichfork) > ip->i_d.di_nblocks)) {
757 xfs_fs_cmn_err(CE_WARN, ip->i_mount,
758 "corrupt inode %Lu (btree). Unmount and run xfs_repair.",
759 (unsigned long long) ip->i_ino);
760 XFS_ERROR_REPORT("xfs_iformat_btree", XFS_ERRLEVEL_LOW,
762 return XFS_ERROR(EFSCORRUPTED);
765 ifp->if_broot_bytes = size;
766 ifp->if_broot = kmem_alloc(size, KM_SLEEP);
767 ASSERT(ifp->if_broot != NULL);
769 * Copy and convert from the on-disk structure
770 * to the in-memory structure.
772 xfs_bmdr_to_bmbt(dfp, XFS_DFORK_SIZE_ARCH(dip, ip->i_mount, whichfork, ARCH_CONVERT),
773 ifp->if_broot, size);
774 ifp->if_flags &= ~XFS_IFEXTENTS;
775 ifp->if_flags |= XFS_IFBROOT;
781 * xfs_xlate_dinode_core - translate an xfs_inode_core_t between ondisk
784 * buf = on-disk representation
785 * dip = native representation
786 * dir = direction - +ve -> disk to native
787 * -ve -> native to disk
788 * arch = on-disk architecture
791 xfs_xlate_dinode_core(
793 xfs_dinode_core_t *dip,
797 xfs_dinode_core_t *buf_core = (xfs_dinode_core_t *)buf;
798 xfs_dinode_core_t *mem_core = (xfs_dinode_core_t *)dip;
801 if (arch == ARCH_NOCONVERT) {
803 memcpy((xfs_caddr_t)mem_core, (xfs_caddr_t)buf_core,
804 sizeof(xfs_dinode_core_t));
806 memcpy((xfs_caddr_t)buf_core, (xfs_caddr_t)mem_core,
807 sizeof(xfs_dinode_core_t));
812 INT_XLATE(buf_core->di_magic, mem_core->di_magic, dir, arch);
813 INT_XLATE(buf_core->di_mode, mem_core->di_mode, dir, arch);
814 INT_XLATE(buf_core->di_version, mem_core->di_version, dir, arch);
815 INT_XLATE(buf_core->di_format, mem_core->di_format, dir, arch);
816 INT_XLATE(buf_core->di_onlink, mem_core->di_onlink, dir, arch);
817 INT_XLATE(buf_core->di_uid, mem_core->di_uid, dir, arch);
818 INT_XLATE(buf_core->di_gid, mem_core->di_gid, dir, arch);
819 INT_XLATE(buf_core->di_nlink, mem_core->di_nlink, dir, arch);
820 INT_XLATE(buf_core->di_projid, mem_core->di_projid, dir, arch);
823 memcpy(mem_core->di_pad, buf_core->di_pad,
824 sizeof(buf_core->di_pad));
826 memcpy(buf_core->di_pad, mem_core->di_pad,
827 sizeof(buf_core->di_pad));
830 INT_XLATE(buf_core->di_flushiter, mem_core->di_flushiter, dir, arch);
832 INT_XLATE(buf_core->di_atime.t_sec, mem_core->di_atime.t_sec,
834 INT_XLATE(buf_core->di_atime.t_nsec, mem_core->di_atime.t_nsec,
836 INT_XLATE(buf_core->di_mtime.t_sec, mem_core->di_mtime.t_sec,
838 INT_XLATE(buf_core->di_mtime.t_nsec, mem_core->di_mtime.t_nsec,
840 INT_XLATE(buf_core->di_ctime.t_sec, mem_core->di_ctime.t_sec,
842 INT_XLATE(buf_core->di_ctime.t_nsec, mem_core->di_ctime.t_nsec,
844 INT_XLATE(buf_core->di_size, mem_core->di_size, dir, arch);
845 INT_XLATE(buf_core->di_nblocks, mem_core->di_nblocks, dir, arch);
846 INT_XLATE(buf_core->di_extsize, mem_core->di_extsize, dir, arch);
847 INT_XLATE(buf_core->di_nextents, mem_core->di_nextents, dir, arch);
848 INT_XLATE(buf_core->di_anextents, mem_core->di_anextents, dir, arch);
849 INT_XLATE(buf_core->di_forkoff, mem_core->di_forkoff, dir, arch);
850 INT_XLATE(buf_core->di_aformat, mem_core->di_aformat, dir, arch);
851 INT_XLATE(buf_core->di_dmevmask, mem_core->di_dmevmask, dir, arch);
852 INT_XLATE(buf_core->di_dmstate, mem_core->di_dmstate, dir, arch);
853 INT_XLATE(buf_core->di_flags, mem_core->di_flags, dir, arch);
854 INT_XLATE(buf_core->di_gen, mem_core->di_gen, dir, arch);
859 xfs_dinode_core_t *dic,
865 di_flags = INT_GET(dic->di_flags, arch);
866 if (di_flags & XFS_DIFLAG_REALTIME)
867 flags |= XFS_XFLAG_REALTIME;
868 if (di_flags & XFS_DIFLAG_PREALLOC)
869 flags |= XFS_XFLAG_PREALLOC;
870 if (di_flags & XFS_DIFLAG_IMMUTABLE)
871 flags |= XFS_XFLAG_IMMUTABLE;
872 if (di_flags & XFS_DIFLAG_APPEND)
873 flags |= XFS_XFLAG_APPEND;
874 if (di_flags & XFS_DIFLAG_SYNC)
875 flags |= XFS_XFLAG_SYNC;
876 if (di_flags & XFS_DIFLAG_NOATIME)
877 flags |= XFS_XFLAG_NOATIME;
878 if (di_flags & XFS_DIFLAG_NODUMP)
879 flags |= XFS_XFLAG_NODUMP;
880 if (XFS_CFORK_Q_ARCH(dic, arch))
881 flags |= XFS_XFLAG_HASATTR;
886 * Given a mount structure and an inode number, return a pointer
887 * to a newly allocated in-core inode coresponding to the given
890 * Initialize the inode's attributes and extent pointers if it
891 * already has them (it will not if the inode has no links).
906 ASSERT(xfs_inode_zone != NULL);
908 ip = kmem_zone_zalloc(xfs_inode_zone, KM_SLEEP);
913 * Get pointer's to the on-disk inode and the buffer containing it.
914 * If the inode number refers to a block outside the file system
915 * then xfs_itobp() will return NULL. In this case we should
916 * return NULL as well. Set i_blkno to 0 so that xfs_itobp() will
917 * know that this is a new incore inode.
919 error = xfs_itobp(mp, tp, ip, &dip, &bp, bno);
922 kmem_zone_free(xfs_inode_zone, ip);
927 * Initialize inode's trace buffers.
928 * Do this before xfs_iformat in case it adds entries.
930 #ifdef XFS_BMAP_TRACE
931 ip->i_xtrace = ktrace_alloc(XFS_BMAP_KTRACE_SIZE, KM_SLEEP);
933 #ifdef XFS_BMBT_TRACE
934 ip->i_btrace = ktrace_alloc(XFS_BMBT_KTRACE_SIZE, KM_SLEEP);
937 ip->i_rwtrace = ktrace_alloc(XFS_RW_KTRACE_SIZE, KM_SLEEP);
939 #ifdef XFS_ILOCK_TRACE
940 ip->i_lock_trace = ktrace_alloc(XFS_ILOCK_KTRACE_SIZE, KM_SLEEP);
942 #ifdef XFS_DIR2_TRACE
943 ip->i_dir_trace = ktrace_alloc(XFS_DIR2_KTRACE_SIZE, KM_SLEEP);
947 * If we got something that isn't an inode it means someone
948 * (nfs or dmi) has a stale handle.
950 if (INT_GET(dip->di_core.di_magic, ARCH_CONVERT) != XFS_DINODE_MAGIC) {
951 kmem_zone_free(xfs_inode_zone, ip);
952 xfs_trans_brelse(tp, bp);
954 xfs_fs_cmn_err(CE_ALERT, mp, "xfs_iread: "
955 "dip->di_core.di_magic (0x%x) != "
956 "XFS_DINODE_MAGIC (0x%x)",
957 INT_GET(dip->di_core.di_magic, ARCH_CONVERT),
960 return XFS_ERROR(EINVAL);
964 * If the on-disk inode is already linked to a directory
965 * entry, copy all of the inode into the in-core inode.
966 * xfs_iformat() handles copying in the inode format
967 * specific information.
968 * Otherwise, just get the truly permanent information.
970 if (!INT_ISZERO(dip->di_core.di_mode, ARCH_CONVERT)) {
971 xfs_xlate_dinode_core((xfs_caddr_t)&dip->di_core,
972 &(ip->i_d), 1, ARCH_CONVERT);
973 error = xfs_iformat(ip, dip);
975 kmem_zone_free(xfs_inode_zone, ip);
976 xfs_trans_brelse(tp, bp);
978 xfs_fs_cmn_err(CE_ALERT, mp, "xfs_iread: "
979 "xfs_iformat() returned error %d",
985 ip->i_d.di_magic = INT_GET(dip->di_core.di_magic, ARCH_CONVERT);
986 ip->i_d.di_version = INT_GET(dip->di_core.di_version, ARCH_CONVERT);
987 ip->i_d.di_gen = INT_GET(dip->di_core.di_gen, ARCH_CONVERT);
988 ip->i_d.di_flushiter = INT_GET(dip->di_core.di_flushiter, ARCH_CONVERT);
990 * Make sure to pull in the mode here as well in
991 * case the inode is released without being used.
992 * This ensures that xfs_inactive() will see that
993 * the inode is already free and not try to mess
994 * with the uninitialized part of it.
998 * Initialize the per-fork minima and maxima for a new
999 * inode here. xfs_iformat will do it for old inodes.
1001 ip->i_df.if_ext_max =
1002 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t);
1005 INIT_LIST_HEAD(&ip->i_reclaim);
1008 * The inode format changed when we moved the link count and
1009 * made it 32 bits long. If this is an old format inode,
1010 * convert it in memory to look like a new one. If it gets
1011 * flushed to disk we will convert back before flushing or
1012 * logging it. We zero out the new projid field and the old link
1013 * count field. We'll handle clearing the pad field (the remains
1014 * of the old uuid field) when we actually convert the inode to
1015 * the new format. We don't change the version number so that we
1016 * can distinguish this from a real new format inode.
1018 if (ip->i_d.di_version == XFS_DINODE_VERSION_1) {
1019 ip->i_d.di_nlink = ip->i_d.di_onlink;
1020 ip->i_d.di_onlink = 0;
1021 ip->i_d.di_projid = 0;
1024 ip->i_delayed_blks = 0;
1027 * Mark the buffer containing the inode as something to keep
1028 * around for a while. This helps to keep recently accessed
1029 * meta-data in-core longer.
1031 XFS_BUF_SET_REF(bp, XFS_INO_REF);
1034 * Use xfs_trans_brelse() to release the buffer containing the
1035 * on-disk inode, because it was acquired with xfs_trans_read_buf()
1036 * in xfs_itobp() above. If tp is NULL, this is just a normal
1037 * brelse(). If we're within a transaction, then xfs_trans_brelse()
1038 * will only release the buffer if it is not dirty within the
1039 * transaction. It will be OK to release the buffer in this case,
1040 * because inodes on disk are never destroyed and we will be
1041 * locking the new in-core inode before putting it in the hash
1042 * table where other processes can find it. Thus we don't have
1043 * to worry about the inode being changed just because we released
1046 xfs_trans_brelse(tp, bp);
1052 * Read in extents from a btree-format inode.
1053 * Allocate and fill in if_extents. Real work is done in xfs_bmap.c.
1065 if (unlikely(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)) {
1066 XFS_ERROR_REPORT("xfs_iread_extents", XFS_ERRLEVEL_LOW,
1068 return XFS_ERROR(EFSCORRUPTED);
1070 size = XFS_IFORK_NEXTENTS(ip, whichfork) * (uint)sizeof(xfs_bmbt_rec_t);
1071 ifp = XFS_IFORK_PTR(ip, whichfork);
1073 * We know that the size is valid (it's checked in iformat_btree)
1075 ifp->if_u1.if_extents = kmem_alloc(size, KM_SLEEP);
1076 ASSERT(ifp->if_u1.if_extents != NULL);
1077 ifp->if_lastex = NULLEXTNUM;
1078 ifp->if_bytes = ifp->if_real_bytes = (int)size;
1079 ifp->if_flags |= XFS_IFEXTENTS;
1080 error = xfs_bmap_read_extents(tp, ip, whichfork);
1082 kmem_free(ifp->if_u1.if_extents, size);
1083 ifp->if_u1.if_extents = NULL;
1084 ifp->if_bytes = ifp->if_real_bytes = 0;
1085 ifp->if_flags &= ~XFS_IFEXTENTS;
1088 xfs_validate_extents((xfs_bmbt_rec_t *)ifp->if_u1.if_extents,
1089 XFS_IFORK_NEXTENTS(ip, whichfork), 0, XFS_EXTFMT_INODE(ip));
1094 * Allocate an inode on disk and return a copy of its in-core version.
1095 * The in-core inode is locked exclusively. Set mode, nlink, and rdev
1096 * appropriately within the inode. The uid and gid for the inode are
1097 * set according to the contents of the given cred structure.
1099 * Use xfs_dialloc() to allocate the on-disk inode. If xfs_dialloc()
1100 * has a free inode available, call xfs_iget()
1101 * to obtain the in-core version of the allocated inode. Finally,
1102 * fill in the inode and log its initial contents. In this case,
1103 * ialloc_context would be set to NULL and call_again set to false.
1105 * If xfs_dialloc() does not have an available inode,
1106 * it will replenish its supply by doing an allocation. Since we can
1107 * only do one allocation within a transaction without deadlocks, we
1108 * must commit the current transaction before returning the inode itself.
1109 * In this case, therefore, we will set call_again to true and return.
1110 * The caller should then commit the current transaction, start a new
1111 * transaction, and call xfs_ialloc() again to actually get the inode.
1113 * To ensure that some other process does not grab the inode that
1114 * was allocated during the first call to xfs_ialloc(), this routine
1115 * also returns the [locked] bp pointing to the head of the freelist
1116 * as ialloc_context. The caller should hold this buffer across
1117 * the commit and pass it back into this routine on the second call.
1129 xfs_buf_t **ialloc_context,
1130 boolean_t *call_again,
1140 * Call the space management code to pick
1141 * the on-disk inode to be allocated.
1143 ASSERT(pip != NULL);
1144 error = xfs_dialloc(tp, pip ? pip->i_ino : 0, mode, okalloc,
1145 ialloc_context, call_again, &ino);
1149 if (*call_again || ino == NULLFSINO) {
1153 ASSERT(*ialloc_context == NULL);
1156 * Get the in-core inode with the lock held exclusively.
1157 * This is because we're setting fields here we need
1158 * to prevent others from looking at until we're done.
1160 error = xfs_trans_iget(tp->t_mountp, tp, ino, XFS_ILOCK_EXCL, &ip);
1167 vp->v_type = IFTOVT(mode);
1168 ip->i_d.di_mode = (__uint16_t)mode;
1169 ip->i_d.di_onlink = 0;
1170 ip->i_d.di_nlink = nlink;
1171 ASSERT(ip->i_d.di_nlink == nlink);
1172 ip->i_d.di_uid = current_fsuid(cr);
1173 ip->i_d.di_gid = current_fsgid(cr);
1174 ip->i_d.di_projid = prid;
1175 memset(&(ip->i_d.di_pad[0]), 0, sizeof(ip->i_d.di_pad));
1178 * If the superblock version is up to where we support new format
1179 * inodes and this is currently an old format inode, then change
1180 * the inode version number now. This way we only do the conversion
1181 * here rather than here and in the flush/logging code.
1183 if (XFS_SB_VERSION_HASNLINK(&tp->t_mountp->m_sb) &&
1184 ip->i_d.di_version == XFS_DINODE_VERSION_1) {
1185 ip->i_d.di_version = XFS_DINODE_VERSION_2;
1187 * We've already zeroed the old link count, the projid field,
1188 * and the pad field.
1193 * Project ids won't be stored on disk if we are using a version 1 inode.
1195 if ( (prid != 0) && (ip->i_d.di_version == XFS_DINODE_VERSION_1))
1196 xfs_bump_ino_vers2(tp, ip);
1198 if (XFS_INHERIT_GID(pip, vp->v_vfsp)) {
1199 ip->i_d.di_gid = pip->i_d.di_gid;
1200 if ((pip->i_d.di_mode & S_ISGID) && (mode & S_IFMT) == S_IFDIR) {
1201 ip->i_d.di_mode |= S_ISGID;
1206 * If the group ID of the new file does not match the effective group
1207 * ID or one of the supplementary group IDs, the S_ISGID bit is cleared
1208 * (and only if the irix_sgid_inherit compatibility variable is set).
1210 if ((irix_sgid_inherit) &&
1211 (ip->i_d.di_mode & S_ISGID) &&
1212 (!in_group_p((gid_t)ip->i_d.di_gid))) {
1213 ip->i_d.di_mode &= ~S_ISGID;
1216 ip->i_d.di_size = 0;
1217 ip->i_d.di_nextents = 0;
1218 ASSERT(ip->i_d.di_nblocks == 0);
1219 xfs_ichgtime(ip, XFS_ICHGTIME_CHG|XFS_ICHGTIME_ACC|XFS_ICHGTIME_MOD);
1221 * di_gen will have been taken care of in xfs_iread.
1223 ip->i_d.di_extsize = 0;
1224 ip->i_d.di_dmevmask = 0;
1225 ip->i_d.di_dmstate = 0;
1226 ip->i_d.di_flags = 0;
1227 flags = XFS_ILOG_CORE;
1228 switch (mode & S_IFMT) {
1233 ip->i_d.di_format = XFS_DINODE_FMT_DEV;
1234 ip->i_df.if_u2.if_rdev = rdev;
1235 ip->i_df.if_flags = 0;
1236 flags |= XFS_ILOG_DEV;
1240 if (pip->i_d.di_flags &
1241 (XFS_DIFLAG_NOATIME|XFS_DIFLAG_NODUMP|XFS_DIFLAG_SYNC)) {
1242 if ((pip->i_d.di_flags & XFS_DIFLAG_NOATIME) &&
1243 xfs_inherit_noatime)
1244 ip->i_d.di_flags |= XFS_DIFLAG_NOATIME;
1245 if ((pip->i_d.di_flags & XFS_DIFLAG_NODUMP) &&
1247 ip->i_d.di_flags |= XFS_DIFLAG_NODUMP;
1248 if ((pip->i_d.di_flags & XFS_DIFLAG_SYNC) &&
1250 ip->i_d.di_flags |= XFS_DIFLAG_SYNC;
1253 ip->i_d.di_format = XFS_DINODE_FMT_EXTENTS;
1254 ip->i_df.if_flags = XFS_IFEXTENTS;
1255 ip->i_df.if_bytes = ip->i_df.if_real_bytes = 0;
1256 ip->i_df.if_u1.if_extents = NULL;
1262 * Attribute fork settings for new inode.
1264 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
1265 ip->i_d.di_anextents = 0;
1268 * Log the new values stuffed into the inode.
1270 xfs_trans_log_inode(tp, ip, flags);
1272 /* now that we have a v_type we can set Linux inode ops (& unlock) */
1273 VFS_INIT_VNODE(XFS_MTOVFS(tp->t_mountp), vp, XFS_ITOBHV(ip), 1);
1280 * Check to make sure that there are no blocks allocated to the
1281 * file beyond the size of the file. We don't check this for
1282 * files with fixed size extents or real time extents, but we
1283 * at least do it for regular files.
1292 xfs_fileoff_t map_first;
1294 xfs_bmbt_irec_t imaps[2];
1296 if ((ip->i_d.di_mode & S_IFMT) != S_IFREG)
1299 if ( ip->i_d.di_flags & XFS_DIFLAG_REALTIME )
1303 map_first = XFS_B_TO_FSB(mp, (xfs_ufsize_t)isize);
1305 * The filesystem could be shutting down, so bmapi may return
1308 if (xfs_bmapi(NULL, ip, map_first,
1310 (xfs_ufsize_t)XFS_MAXIOFFSET(mp)) -
1312 XFS_BMAPI_ENTIRE, NULL, 0, imaps, &nimaps,
1315 ASSERT(nimaps == 1);
1316 ASSERT(imaps[0].br_startblock == HOLESTARTBLOCK);
1321 * Calculate the last possible buffered byte in a file. This must
1322 * include data that was buffered beyond the EOF by the write code.
1323 * This also needs to deal with overflowing the xfs_fsize_t type
1324 * which can happen for sizes near the limit.
1326 * We also need to take into account any blocks beyond the EOF. It
1327 * may be the case that they were buffered by a write which failed.
1328 * In that case the pages will still be in memory, but the inode size
1329 * will never have been updated.
1336 xfs_fsize_t last_byte;
1337 xfs_fileoff_t last_block;
1338 xfs_fileoff_t size_last_block;
1341 ASSERT(ismrlocked(&(ip->i_iolock), MR_UPDATE | MR_ACCESS));
1345 * Only check for blocks beyond the EOF if the extents have
1346 * been read in. This eliminates the need for the inode lock,
1347 * and it also saves us from looking when it really isn't
1350 if (ip->i_df.if_flags & XFS_IFEXTENTS) {
1351 error = xfs_bmap_last_offset(NULL, ip, &last_block,
1359 size_last_block = XFS_B_TO_FSB(mp, (xfs_ufsize_t)ip->i_d.di_size);
1360 last_block = XFS_FILEOFF_MAX(last_block, size_last_block);
1362 last_byte = XFS_FSB_TO_B(mp, last_block);
1363 if (last_byte < 0) {
1364 return XFS_MAXIOFFSET(mp);
1366 last_byte += (1 << mp->m_writeio_log);
1367 if (last_byte < 0) {
1368 return XFS_MAXIOFFSET(mp);
1373 #if defined(XFS_RW_TRACE)
1379 xfs_fsize_t new_size,
1380 xfs_off_t toss_start,
1381 xfs_off_t toss_finish)
1383 if (ip->i_rwtrace == NULL) {
1387 ktrace_enter(ip->i_rwtrace,
1390 (void*)(unsigned long)((ip->i_d.di_size >> 32) & 0xffffffff),
1391 (void*)(unsigned long)(ip->i_d.di_size & 0xffffffff),
1392 (void*)((long)flag),
1393 (void*)(unsigned long)((new_size >> 32) & 0xffffffff),
1394 (void*)(unsigned long)(new_size & 0xffffffff),
1395 (void*)(unsigned long)((toss_start >> 32) & 0xffffffff),
1396 (void*)(unsigned long)(toss_start & 0xffffffff),
1397 (void*)(unsigned long)((toss_finish >> 32) & 0xffffffff),
1398 (void*)(unsigned long)(toss_finish & 0xffffffff),
1399 (void*)(unsigned long)current_cpu(),
1406 #define xfs_itrunc_trace(tag, ip, flag, new_size, toss_start, toss_finish)
1410 * Start the truncation of the file to new_size. The new size
1411 * must be smaller than the current size. This routine will
1412 * clear the buffer and page caches of file data in the removed
1413 * range, and xfs_itruncate_finish() will remove the underlying
1416 * The inode must have its I/O lock locked EXCLUSIVELY, and it
1417 * must NOT have the inode lock held at all. This is because we're
1418 * calling into the buffer/page cache code and we can't hold the
1419 * inode lock when we do so.
1421 * The flags parameter can have either the value XFS_ITRUNC_DEFINITE
1422 * or XFS_ITRUNC_MAYBE. The XFS_ITRUNC_MAYBE value should be used
1423 * in the case that the caller is locking things out of order and
1424 * may not be able to call xfs_itruncate_finish() with the inode lock
1425 * held without dropping the I/O lock. If the caller must drop the
1426 * I/O lock before calling xfs_itruncate_finish(), then xfs_itruncate_start()
1427 * must be called again with all the same restrictions as the initial
1431 xfs_itruncate_start(
1434 xfs_fsize_t new_size)
1436 xfs_fsize_t last_byte;
1437 xfs_off_t toss_start;
1441 ASSERT(ismrlocked(&ip->i_iolock, MR_UPDATE) != 0);
1442 ASSERT((new_size == 0) || (new_size <= ip->i_d.di_size));
1443 ASSERT((flags == XFS_ITRUNC_DEFINITE) ||
1444 (flags == XFS_ITRUNC_MAYBE));
1449 * Call VOP_TOSS_PAGES() or VOP_FLUSHINVAL_PAGES() to get rid of pages and buffers
1450 * overlapping the region being removed. We have to use
1451 * the less efficient VOP_FLUSHINVAL_PAGES() in the case that the
1452 * caller may not be able to finish the truncate without
1453 * dropping the inode's I/O lock. Make sure
1454 * to catch any pages brought in by buffers overlapping
1455 * the EOF by searching out beyond the isize by our
1456 * block size. We round new_size up to a block boundary
1457 * so that we don't toss things on the same block as
1458 * new_size but before it.
1460 * Before calling VOP_TOSS_PAGES() or VOP_FLUSHINVAL_PAGES(), make sure to
1461 * call remapf() over the same region if the file is mapped.
1462 * This frees up mapped file references to the pages in the
1463 * given range and for the VOP_FLUSHINVAL_PAGES() case it ensures
1464 * that we get the latest mapped changes flushed out.
1466 toss_start = XFS_B_TO_FSB(mp, (xfs_ufsize_t)new_size);
1467 toss_start = XFS_FSB_TO_B(mp, toss_start);
1468 if (toss_start < 0) {
1470 * The place to start tossing is beyond our maximum
1471 * file size, so there is no way that the data extended
1476 last_byte = xfs_file_last_byte(ip);
1477 xfs_itrunc_trace(XFS_ITRUNC_START, ip, flags, new_size, toss_start,
1479 if (last_byte > toss_start) {
1480 if (flags & XFS_ITRUNC_DEFINITE) {
1481 VOP_TOSS_PAGES(vp, toss_start, -1, FI_REMAPF_LOCKED);
1483 VOP_FLUSHINVAL_PAGES(vp, toss_start, -1, FI_REMAPF_LOCKED);
1488 if (new_size == 0) {
1489 ASSERT(VN_CACHED(vp) == 0);
1495 * Shrink the file to the given new_size. The new
1496 * size must be smaller than the current size.
1497 * This will free up the underlying blocks
1498 * in the removed range after a call to xfs_itruncate_start()
1499 * or xfs_atruncate_start().
1501 * The transaction passed to this routine must have made
1502 * a permanent log reservation of at least XFS_ITRUNCATE_LOG_RES.
1503 * This routine may commit the given transaction and
1504 * start new ones, so make sure everything involved in
1505 * the transaction is tidy before calling here.
1506 * Some transaction will be returned to the caller to be
1507 * committed. The incoming transaction must already include
1508 * the inode, and both inode locks must be held exclusively.
1509 * The inode must also be "held" within the transaction. On
1510 * return the inode will be "held" within the returned transaction.
1511 * This routine does NOT require any disk space to be reserved
1512 * for it within the transaction.
1514 * The fork parameter must be either xfs_attr_fork or xfs_data_fork,
1515 * and it indicates the fork which is to be truncated. For the
1516 * attribute fork we only support truncation to size 0.
1518 * We use the sync parameter to indicate whether or not the first
1519 * transaction we perform might have to be synchronous. For the attr fork,
1520 * it needs to be so if the unlink of the inode is not yet known to be
1521 * permanent in the log. This keeps us from freeing and reusing the
1522 * blocks of the attribute fork before the unlink of the inode becomes
1525 * For the data fork, we normally have to run synchronously if we're
1526 * being called out of the inactive path or we're being called
1527 * out of the create path where we're truncating an existing file.
1528 * Either way, the truncate needs to be sync so blocks don't reappear
1529 * in the file with altered data in case of a crash. wsync filesystems
1530 * can run the first case async because anything that shrinks the inode
1531 * has to run sync so by the time we're called here from inactive, the
1532 * inode size is permanently set to 0.
1534 * Calls from the truncate path always need to be sync unless we're
1535 * in a wsync filesystem and the file has already been unlinked.
1537 * The caller is responsible for correctly setting the sync parameter.
1538 * It gets too hard for us to guess here which path we're being called
1539 * out of just based on inode state.
1542 xfs_itruncate_finish(
1545 xfs_fsize_t new_size,
1549 xfs_fsblock_t first_block;
1550 xfs_fileoff_t first_unmap_block;
1551 xfs_fileoff_t last_block;
1552 xfs_filblks_t unmap_len=0;
1557 xfs_bmap_free_t free_list;
1560 ASSERT(ismrlocked(&ip->i_iolock, MR_UPDATE) != 0);
1561 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE) != 0);
1562 ASSERT((new_size == 0) || (new_size <= ip->i_d.di_size));
1563 ASSERT(*tp != NULL);
1564 ASSERT((*tp)->t_flags & XFS_TRANS_PERM_LOG_RES);
1565 ASSERT(ip->i_transp == *tp);
1566 ASSERT(ip->i_itemp != NULL);
1567 ASSERT(ip->i_itemp->ili_flags & XFS_ILI_HOLD);
1571 mp = (ntp)->t_mountp;
1572 ASSERT(! XFS_NOT_DQATTACHED(mp, ip));
1575 * We only support truncating the entire attribute fork.
1577 if (fork == XFS_ATTR_FORK) {
1580 first_unmap_block = XFS_B_TO_FSB(mp, (xfs_ufsize_t)new_size);
1581 xfs_itrunc_trace(XFS_ITRUNC_FINISH1, ip, 0, new_size, 0, 0);
1583 * The first thing we do is set the size to new_size permanently
1584 * on disk. This way we don't have to worry about anyone ever
1585 * being able to look at the data being freed even in the face
1586 * of a crash. What we're getting around here is the case where
1587 * we free a block, it is allocated to another file, it is written
1588 * to, and then we crash. If the new data gets written to the
1589 * file but the log buffers containing the free and reallocation
1590 * don't, then we'd end up with garbage in the blocks being freed.
1591 * As long as we make the new_size permanent before actually
1592 * freeing any blocks it doesn't matter if they get writtten to.
1594 * The callers must signal into us whether or not the size
1595 * setting here must be synchronous. There are a few cases
1596 * where it doesn't have to be synchronous. Those cases
1597 * occur if the file is unlinked and we know the unlink is
1598 * permanent or if the blocks being truncated are guaranteed
1599 * to be beyond the inode eof (regardless of the link count)
1600 * and the eof value is permanent. Both of these cases occur
1601 * only on wsync-mounted filesystems. In those cases, we're
1602 * guaranteed that no user will ever see the data in the blocks
1603 * that are being truncated so the truncate can run async.
1604 * In the free beyond eof case, the file may wind up with
1605 * more blocks allocated to it than it needs if we crash
1606 * and that won't get fixed until the next time the file
1607 * is re-opened and closed but that's ok as that shouldn't
1608 * be too many blocks.
1610 * However, we can't just make all wsync xactions run async
1611 * because there's one call out of the create path that needs
1612 * to run sync where it's truncating an existing file to size
1613 * 0 whose size is > 0.
1615 * It's probably possible to come up with a test in this
1616 * routine that would correctly distinguish all the above
1617 * cases from the values of the function parameters and the
1618 * inode state but for sanity's sake, I've decided to let the
1619 * layers above just tell us. It's simpler to correctly figure
1620 * out in the layer above exactly under what conditions we
1621 * can run async and I think it's easier for others read and
1622 * follow the logic in case something has to be changed.
1623 * cscope is your friend -- rcc.
1625 * The attribute fork is much simpler.
1627 * For the attribute fork we allow the caller to tell us whether
1628 * the unlink of the inode that led to this call is yet permanent
1629 * in the on disk log. If it is not and we will be freeing extents
1630 * in this inode then we make the first transaction synchronous
1631 * to make sure that the unlink is permanent by the time we free
1634 if (fork == XFS_DATA_FORK) {
1635 if (ip->i_d.di_nextents > 0) {
1636 ip->i_d.di_size = new_size;
1637 xfs_trans_log_inode(ntp, ip, XFS_ILOG_CORE);
1640 ASSERT(!(mp->m_flags & XFS_MOUNT_WSYNC));
1641 if (ip->i_d.di_anextents > 0)
1642 xfs_trans_set_sync(ntp);
1644 ASSERT(fork == XFS_DATA_FORK ||
1645 (fork == XFS_ATTR_FORK &&
1646 ((sync && !(mp->m_flags & XFS_MOUNT_WSYNC)) ||
1647 (sync == 0 && (mp->m_flags & XFS_MOUNT_WSYNC)))));
1650 * Since it is possible for space to become allocated beyond
1651 * the end of the file (in a crash where the space is allocated
1652 * but the inode size is not yet updated), simply remove any
1653 * blocks which show up between the new EOF and the maximum
1654 * possible file size. If the first block to be removed is
1655 * beyond the maximum file size (ie it is the same as last_block),
1656 * then there is nothing to do.
1658 last_block = XFS_B_TO_FSB(mp, (xfs_ufsize_t)XFS_MAXIOFFSET(mp));
1659 ASSERT(first_unmap_block <= last_block);
1661 if (last_block == first_unmap_block) {
1664 unmap_len = last_block - first_unmap_block + 1;
1668 * Free up up to XFS_ITRUNC_MAX_EXTENTS. xfs_bunmapi()
1669 * will tell us whether it freed the entire range or
1670 * not. If this is a synchronous mount (wsync),
1671 * then we can tell bunmapi to keep all the
1672 * transactions asynchronous since the unlink
1673 * transaction that made this inode inactive has
1674 * already hit the disk. There's no danger of
1675 * the freed blocks being reused, there being a
1676 * crash, and the reused blocks suddenly reappearing
1677 * in this file with garbage in them once recovery
1680 XFS_BMAP_INIT(&free_list, &first_block);
1681 error = xfs_bunmapi(ntp, ip, first_unmap_block,
1683 XFS_BMAPI_AFLAG(fork) |
1684 (sync ? 0 : XFS_BMAPI_ASYNC),
1685 XFS_ITRUNC_MAX_EXTENTS,
1686 &first_block, &free_list, &done);
1689 * If the bunmapi call encounters an error,
1690 * return to the caller where the transaction
1691 * can be properly aborted. We just need to
1692 * make sure we're not holding any resources
1693 * that we were not when we came in.
1695 xfs_bmap_cancel(&free_list);
1700 * Duplicate the transaction that has the permanent
1701 * reservation and commit the old transaction.
1703 error = xfs_bmap_finish(tp, &free_list, first_block,
1708 * If the bmap finish call encounters an error,
1709 * return to the caller where the transaction
1710 * can be properly aborted. We just need to
1711 * make sure we're not holding any resources
1712 * that we were not when we came in.
1714 * Aborting from this point might lose some
1715 * blocks in the file system, but oh well.
1717 xfs_bmap_cancel(&free_list);
1720 * If the passed in transaction committed
1721 * in xfs_bmap_finish(), then we want to
1722 * add the inode to this one before returning.
1723 * This keeps things simple for the higher
1724 * level code, because it always knows that
1725 * the inode is locked and held in the
1726 * transaction that returns to it whether
1727 * errors occur or not. We don't mark the
1728 * inode dirty so that this transaction can
1729 * be easily aborted if possible.
1731 xfs_trans_ijoin(ntp, ip,
1732 XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
1733 xfs_trans_ihold(ntp, ip);
1740 * The first xact was committed,
1741 * so add the inode to the new one.
1742 * Mark it dirty so it will be logged
1743 * and moved forward in the log as
1744 * part of every commit.
1746 xfs_trans_ijoin(ntp, ip,
1747 XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
1748 xfs_trans_ihold(ntp, ip);
1749 xfs_trans_log_inode(ntp, ip, XFS_ILOG_CORE);
1751 ntp = xfs_trans_dup(ntp);
1752 (void) xfs_trans_commit(*tp, 0, NULL);
1754 error = xfs_trans_reserve(ntp, 0, XFS_ITRUNCATE_LOG_RES(mp), 0,
1755 XFS_TRANS_PERM_LOG_RES,
1756 XFS_ITRUNCATE_LOG_COUNT);
1758 * Add the inode being truncated to the next chained
1761 xfs_trans_ijoin(ntp, ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
1762 xfs_trans_ihold(ntp, ip);
1767 * Only update the size in the case of the data fork, but
1768 * always re-log the inode so that our permanent transaction
1769 * can keep on rolling it forward in the log.
1771 if (fork == XFS_DATA_FORK) {
1772 xfs_isize_check(mp, ip, new_size);
1773 ip->i_d.di_size = new_size;
1775 xfs_trans_log_inode(ntp, ip, XFS_ILOG_CORE);
1776 ASSERT((new_size != 0) ||
1777 (fork == XFS_ATTR_FORK) ||
1778 (ip->i_delayed_blks == 0));
1779 ASSERT((new_size != 0) ||
1780 (fork == XFS_ATTR_FORK) ||
1781 (ip->i_d.di_nextents == 0));
1782 xfs_itrunc_trace(XFS_ITRUNC_FINISH2, ip, 0, new_size, 0, 0);
1790 * Do the first part of growing a file: zero any data in the last
1791 * block that is beyond the old EOF. We need to do this before
1792 * the inode is joined to the transaction to modify the i_size.
1793 * That way we can drop the inode lock and call into the buffer
1794 * cache to get the buffer mapping the EOF.
1799 xfs_fsize_t new_size,
1805 ASSERT(ismrlocked(&(ip->i_lock), MR_UPDATE) != 0);
1806 ASSERT(ismrlocked(&(ip->i_iolock), MR_UPDATE) != 0);
1807 ASSERT(new_size > ip->i_d.di_size);
1810 isize = ip->i_d.di_size;
1812 * Zero any pages that may have been created by
1813 * xfs_write_file() beyond the end of the file
1814 * and any blocks between the old and new file sizes.
1816 error = xfs_zero_eof(XFS_ITOV(ip), &ip->i_iocore, new_size, isize,
1824 * This routine is called to extend the size of a file.
1825 * The inode must have both the iolock and the ilock locked
1826 * for update and it must be a part of the current transaction.
1827 * The xfs_igrow_start() function must have been called previously.
1828 * If the change_flag is not zero, the inode change timestamp will
1835 xfs_fsize_t new_size,
1838 ASSERT(ismrlocked(&(ip->i_lock), MR_UPDATE) != 0);
1839 ASSERT(ismrlocked(&(ip->i_iolock), MR_UPDATE) != 0);
1840 ASSERT(ip->i_transp == tp);
1841 ASSERT(new_size > ip->i_d.di_size);
1844 * Update the file size. Update the inode change timestamp
1845 * if change_flag set.
1847 ip->i_d.di_size = new_size;
1849 xfs_ichgtime(ip, XFS_ICHGTIME_CHG);
1850 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
1856 * This is called when the inode's link count goes to 0.
1857 * We place the on-disk inode on a list in the AGI. It
1858 * will be pulled from this list when the inode is freed.
1870 xfs_agnumber_t agno;
1871 xfs_daddr_t agdaddr;
1878 ASSERT(ip->i_d.di_nlink == 0);
1879 ASSERT(ip->i_d.di_mode != 0);
1880 ASSERT(ip->i_transp == tp);
1884 agno = XFS_INO_TO_AGNO(mp, ip->i_ino);
1885 agdaddr = XFS_AG_DADDR(mp, agno, XFS_AGI_DADDR(mp));
1888 * Get the agi buffer first. It ensures lock ordering
1891 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, agdaddr,
1892 XFS_FSS_TO_BB(mp, 1), 0, &agibp);
1897 * Validate the magic number of the agi block.
1899 agi = XFS_BUF_TO_AGI(agibp);
1901 INT_GET(agi->agi_magicnum, ARCH_CONVERT) == XFS_AGI_MAGIC &&
1902 XFS_AGI_GOOD_VERSION(INT_GET(agi->agi_versionnum, ARCH_CONVERT));
1903 if (unlikely(XFS_TEST_ERROR(!agi_ok, mp, XFS_ERRTAG_IUNLINK,
1904 XFS_RANDOM_IUNLINK))) {
1905 XFS_CORRUPTION_ERROR("xfs_iunlink", XFS_ERRLEVEL_LOW, mp, agi);
1906 xfs_trans_brelse(tp, agibp);
1907 return XFS_ERROR(EFSCORRUPTED);
1910 * Get the index into the agi hash table for the
1911 * list this inode will go on.
1913 agino = XFS_INO_TO_AGINO(mp, ip->i_ino);
1915 bucket_index = agino % XFS_AGI_UNLINKED_BUCKETS;
1916 ASSERT(!INT_ISZERO(agi->agi_unlinked[bucket_index], ARCH_CONVERT));
1917 ASSERT(INT_GET(agi->agi_unlinked[bucket_index], ARCH_CONVERT) != agino);
1919 if (INT_GET(agi->agi_unlinked[bucket_index], ARCH_CONVERT) != NULLAGINO) {
1921 * There is already another inode in the bucket we need
1922 * to add ourselves to. Add us at the front of the list.
1923 * Here we put the head pointer into our next pointer,
1924 * and then we fall through to point the head at us.
1926 error = xfs_itobp(mp, tp, ip, &dip, &ibp, 0);
1930 ASSERT(INT_GET(dip->di_next_unlinked, ARCH_CONVERT) == NULLAGINO);
1931 ASSERT(!INT_ISZERO(dip->di_next_unlinked, ARCH_CONVERT));
1932 /* both on-disk, don't endian flip twice */
1933 dip->di_next_unlinked = agi->agi_unlinked[bucket_index];
1934 offset = ip->i_boffset +
1935 offsetof(xfs_dinode_t, di_next_unlinked);
1936 xfs_trans_inode_buf(tp, ibp);
1937 xfs_trans_log_buf(tp, ibp, offset,
1938 (offset + sizeof(xfs_agino_t) - 1));
1939 xfs_inobp_check(mp, ibp);
1943 * Point the bucket head pointer at the inode being inserted.
1946 INT_SET(agi->agi_unlinked[bucket_index], ARCH_CONVERT, agino);
1947 offset = offsetof(xfs_agi_t, agi_unlinked) +
1948 (sizeof(xfs_agino_t) * bucket_index);
1949 xfs_trans_log_buf(tp, agibp, offset,
1950 (offset + sizeof(xfs_agino_t) - 1));
1955 * Pull the on-disk inode from the AGI unlinked list.
1968 xfs_agnumber_t agno;
1969 xfs_daddr_t agdaddr;
1971 xfs_agino_t next_agino;
1972 xfs_buf_t *last_ibp;
1973 xfs_dinode_t *last_dip;
1975 int offset, last_offset;
1980 * First pull the on-disk inode from the AGI unlinked list.
1984 agno = XFS_INO_TO_AGNO(mp, ip->i_ino);
1985 agdaddr = XFS_AG_DADDR(mp, agno, XFS_AGI_DADDR(mp));
1988 * Get the agi buffer first. It ensures lock ordering
1991 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, agdaddr,
1992 XFS_FSS_TO_BB(mp, 1), 0, &agibp);
1995 "xfs_iunlink_remove: xfs_trans_read_buf() returned an error %d on %s. Returning error.",
1996 error, mp->m_fsname);
2000 * Validate the magic number of the agi block.
2002 agi = XFS_BUF_TO_AGI(agibp);
2004 INT_GET(agi->agi_magicnum, ARCH_CONVERT) == XFS_AGI_MAGIC &&
2005 XFS_AGI_GOOD_VERSION(INT_GET(agi->agi_versionnum, ARCH_CONVERT));
2006 if (unlikely(XFS_TEST_ERROR(!agi_ok, mp, XFS_ERRTAG_IUNLINK_REMOVE,
2007 XFS_RANDOM_IUNLINK_REMOVE))) {
2008 XFS_CORRUPTION_ERROR("xfs_iunlink_remove", XFS_ERRLEVEL_LOW,
2010 xfs_trans_brelse(tp, agibp);
2012 "xfs_iunlink_remove: XFS_TEST_ERROR() returned an error on %s. Returning EFSCORRUPTED.",
2014 return XFS_ERROR(EFSCORRUPTED);
2017 * Get the index into the agi hash table for the
2018 * list this inode will go on.
2020 agino = XFS_INO_TO_AGINO(mp, ip->i_ino);
2022 bucket_index = agino % XFS_AGI_UNLINKED_BUCKETS;
2023 ASSERT(INT_GET(agi->agi_unlinked[bucket_index], ARCH_CONVERT) != NULLAGINO);
2024 ASSERT(!INT_ISZERO(agi->agi_unlinked[bucket_index], ARCH_CONVERT));
2026 if (INT_GET(agi->agi_unlinked[bucket_index], ARCH_CONVERT) == agino) {
2028 * We're at the head of the list. Get the inode's
2029 * on-disk buffer to see if there is anyone after us
2030 * on the list. Only modify our next pointer if it
2031 * is not already NULLAGINO. This saves us the overhead
2032 * of dealing with the buffer when there is no need to
2035 error = xfs_itobp(mp, tp, ip, &dip, &ibp, 0);
2038 "xfs_iunlink_remove: xfs_itobp() returned an error %d on %s. Returning error.",
2039 error, mp->m_fsname);
2042 next_agino = INT_GET(dip->di_next_unlinked, ARCH_CONVERT);
2043 ASSERT(next_agino != 0);
2044 if (next_agino != NULLAGINO) {
2045 INT_SET(dip->di_next_unlinked, ARCH_CONVERT, NULLAGINO);
2046 offset = ip->i_boffset +
2047 offsetof(xfs_dinode_t, di_next_unlinked);
2048 xfs_trans_inode_buf(tp, ibp);
2049 xfs_trans_log_buf(tp, ibp, offset,
2050 (offset + sizeof(xfs_agino_t) - 1));
2051 xfs_inobp_check(mp, ibp);
2053 xfs_trans_brelse(tp, ibp);
2056 * Point the bucket head pointer at the next inode.
2058 ASSERT(next_agino != 0);
2059 ASSERT(next_agino != agino);
2060 INT_SET(agi->agi_unlinked[bucket_index], ARCH_CONVERT, next_agino);
2061 offset = offsetof(xfs_agi_t, agi_unlinked) +
2062 (sizeof(xfs_agino_t) * bucket_index);
2063 xfs_trans_log_buf(tp, agibp, offset,
2064 (offset + sizeof(xfs_agino_t) - 1));
2067 * We need to search the list for the inode being freed.
2069 next_agino = INT_GET(agi->agi_unlinked[bucket_index], ARCH_CONVERT);
2071 while (next_agino != agino) {
2073 * If the last inode wasn't the one pointing to
2074 * us, then release its buffer since we're not
2075 * going to do anything with it.
2077 if (last_ibp != NULL) {
2078 xfs_trans_brelse(tp, last_ibp);
2080 next_ino = XFS_AGINO_TO_INO(mp, agno, next_agino);
2081 error = xfs_inotobp(mp, tp, next_ino, &last_dip,
2082 &last_ibp, &last_offset);
2085 "xfs_iunlink_remove: xfs_inotobp() returned an error %d on %s. Returning error.",
2086 error, mp->m_fsname);
2089 next_agino = INT_GET(last_dip->di_next_unlinked, ARCH_CONVERT);
2090 ASSERT(next_agino != NULLAGINO);
2091 ASSERT(next_agino != 0);
2094 * Now last_ibp points to the buffer previous to us on
2095 * the unlinked list. Pull us from the list.
2097 error = xfs_itobp(mp, tp, ip, &dip, &ibp, 0);
2100 "xfs_iunlink_remove: xfs_itobp() returned an error %d on %s. Returning error.",
2101 error, mp->m_fsname);
2104 next_agino = INT_GET(dip->di_next_unlinked, ARCH_CONVERT);
2105 ASSERT(next_agino != 0);
2106 ASSERT(next_agino != agino);
2107 if (next_agino != NULLAGINO) {
2108 INT_SET(dip->di_next_unlinked, ARCH_CONVERT, NULLAGINO);
2109 offset = ip->i_boffset +
2110 offsetof(xfs_dinode_t, di_next_unlinked);
2111 xfs_trans_inode_buf(tp, ibp);
2112 xfs_trans_log_buf(tp, ibp, offset,
2113 (offset + sizeof(xfs_agino_t) - 1));
2114 xfs_inobp_check(mp, ibp);
2116 xfs_trans_brelse(tp, ibp);
2119 * Point the previous inode on the list to the next inode.
2121 INT_SET(last_dip->di_next_unlinked, ARCH_CONVERT, next_agino);
2122 ASSERT(next_agino != 0);
2123 offset = last_offset + offsetof(xfs_dinode_t, di_next_unlinked);
2124 xfs_trans_inode_buf(tp, last_ibp);
2125 xfs_trans_log_buf(tp, last_ibp, offset,
2126 (offset + sizeof(xfs_agino_t) - 1));
2127 xfs_inobp_check(mp, last_ibp);
2132 static __inline__ int xfs_inode_clean(xfs_inode_t *ip)
2134 return (((ip->i_itemp == NULL) ||
2135 !(ip->i_itemp->ili_format.ilf_fields & XFS_ILOG_ALL)) &&
2136 (ip->i_update_core == 0));
2141 xfs_inode_t *free_ip,
2145 xfs_mount_t *mp = free_ip->i_mount;
2146 int blks_per_cluster;
2149 int i, j, found, pre_flushed;
2153 xfs_inode_t *ip, **ip_found;
2154 xfs_inode_log_item_t *iip;
2155 xfs_log_item_t *lip;
2158 if (mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp)) {
2159 blks_per_cluster = 1;
2160 ninodes = mp->m_sb.sb_inopblock;
2161 nbufs = XFS_IALLOC_BLOCKS(mp);
2163 blks_per_cluster = XFS_INODE_CLUSTER_SIZE(mp) /
2164 mp->m_sb.sb_blocksize;
2165 ninodes = blks_per_cluster * mp->m_sb.sb_inopblock;
2166 nbufs = XFS_IALLOC_BLOCKS(mp) / blks_per_cluster;
2169 ip_found = kmem_alloc(ninodes * sizeof(xfs_inode_t *), KM_NOFS);
2171 for (j = 0; j < nbufs; j++, inum += ninodes) {
2172 blkno = XFS_AGB_TO_DADDR(mp, XFS_INO_TO_AGNO(mp, inum),
2173 XFS_INO_TO_AGBNO(mp, inum));
2177 * Look for each inode in memory and attempt to lock it,
2178 * we can be racing with flush and tail pushing here.
2179 * any inode we get the locks on, add to an array of
2180 * inode items to process later.
2182 * The get the buffer lock, we could beat a flush
2183 * or tail pushing thread to the lock here, in which
2184 * case they will go looking for the inode buffer
2185 * and fail, we need some other form of interlock
2189 for (i = 0; i < ninodes; i++) {
2190 ih = XFS_IHASH(mp, inum + i);
2191 read_lock(&ih->ih_lock);
2192 for (ip = ih->ih_next; ip != NULL; ip = ip->i_next) {
2193 if (ip->i_ino == inum + i)
2197 /* Inode not in memory or we found it already,
2200 if (!ip || (ip->i_flags & XFS_ISTALE)) {
2201 read_unlock(&ih->ih_lock);
2205 if (xfs_inode_clean(ip)) {
2206 read_unlock(&ih->ih_lock);
2210 /* If we can get the locks then add it to the
2211 * list, otherwise by the time we get the bp lock
2212 * below it will already be attached to the
2216 /* This inode will already be locked - by us, lets
2220 if (ip == free_ip) {
2221 if (xfs_iflock_nowait(ip)) {
2222 ip->i_flags |= XFS_ISTALE;
2224 if (xfs_inode_clean(ip)) {
2227 ip_found[found++] = ip;
2230 read_unlock(&ih->ih_lock);
2234 if (xfs_ilock_nowait(ip, XFS_ILOCK_EXCL)) {
2235 if (xfs_iflock_nowait(ip)) {
2236 ip->i_flags |= XFS_ISTALE;
2238 if (xfs_inode_clean(ip)) {
2240 xfs_iunlock(ip, XFS_ILOCK_EXCL);
2242 ip_found[found++] = ip;
2245 xfs_iunlock(ip, XFS_ILOCK_EXCL);
2249 read_unlock(&ih->ih_lock);
2252 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, blkno,
2253 mp->m_bsize * blks_per_cluster,
2257 lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *);
2259 if (lip->li_type == XFS_LI_INODE) {
2260 iip = (xfs_inode_log_item_t *)lip;
2261 ASSERT(iip->ili_logged == 1);
2262 lip->li_cb = (void(*)(xfs_buf_t*,xfs_log_item_t*)) xfs_istale_done;
2264 iip->ili_flush_lsn = iip->ili_item.li_lsn;
2266 iip->ili_inode->i_flags |= XFS_ISTALE;
2269 lip = lip->li_bio_list;
2272 for (i = 0; i < found; i++) {
2277 ip->i_update_core = 0;
2279 xfs_iunlock(ip, XFS_ILOCK_EXCL);
2283 iip->ili_last_fields = iip->ili_format.ilf_fields;
2284 iip->ili_format.ilf_fields = 0;
2285 iip->ili_logged = 1;
2287 iip->ili_flush_lsn = iip->ili_item.li_lsn;
2290 xfs_buf_attach_iodone(bp,
2291 (void(*)(xfs_buf_t*,xfs_log_item_t*))
2292 xfs_istale_done, (xfs_log_item_t *)iip);
2293 if (ip != free_ip) {
2294 xfs_iunlock(ip, XFS_ILOCK_EXCL);
2298 if (found || pre_flushed)
2299 xfs_trans_stale_inode_buf(tp, bp);
2300 xfs_trans_binval(tp, bp);
2303 kmem_free(ip_found, ninodes * sizeof(xfs_inode_t *));
2307 * This is called to return an inode to the inode free list.
2308 * The inode should already be truncated to 0 length and have
2309 * no pages associated with it. This routine also assumes that
2310 * the inode is already a part of the transaction.
2312 * The on-disk copy of the inode will have been added to the list
2313 * of unlinked inodes in the AGI. We need to remove the inode from
2314 * that list atomically with respect to freeing it here.
2320 xfs_bmap_free_t *flist)
2324 xfs_ino_t first_ino;
2326 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE));
2327 ASSERT(ip->i_transp == tp);
2328 ASSERT(ip->i_d.di_nlink == 0);
2329 ASSERT(ip->i_d.di_nextents == 0);
2330 ASSERT(ip->i_d.di_anextents == 0);
2331 ASSERT((ip->i_d.di_size == 0) ||
2332 ((ip->i_d.di_mode & S_IFMT) != S_IFREG));
2333 ASSERT(ip->i_d.di_nblocks == 0);
2336 * Pull the on-disk inode from the AGI unlinked list.
2338 error = xfs_iunlink_remove(tp, ip);
2343 error = xfs_difree(tp, ip->i_ino, flist, &delete, &first_ino);
2347 ip->i_d.di_mode = 0; /* mark incore inode as free */
2348 ip->i_d.di_flags = 0;
2349 ip->i_d.di_dmevmask = 0;
2350 ip->i_d.di_forkoff = 0; /* mark the attr fork not in use */
2351 ip->i_df.if_ext_max =
2352 XFS_IFORK_DSIZE(ip) / (uint)sizeof(xfs_bmbt_rec_t);
2353 ip->i_d.di_format = XFS_DINODE_FMT_EXTENTS;
2354 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
2356 * Bump the generation count so no one will be confused
2357 * by reincarnations of this inode.
2360 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
2363 xfs_ifree_cluster(ip, tp, first_ino);
2370 * Reallocate the space for if_broot based on the number of records
2371 * being added or deleted as indicated in rec_diff. Move the records
2372 * and pointers in if_broot to fit the new size. When shrinking this
2373 * will eliminate holes between the records and pointers created by
2374 * the caller. When growing this will create holes to be filled in
2377 * The caller must not request to add more records than would fit in
2378 * the on-disk inode root. If the if_broot is currently NULL, then
2379 * if we adding records one will be allocated. The caller must also
2380 * not request that the number of records go below zero, although
2381 * it can go to zero.
2383 * ip -- the inode whose if_broot area is changing
2384 * ext_diff -- the change in the number of records, positive or negative,
2385 * requested for the if_broot array.
2395 xfs_bmbt_block_t *new_broot;
2402 * Handle the degenerate case quietly.
2404 if (rec_diff == 0) {
2408 ifp = XFS_IFORK_PTR(ip, whichfork);
2411 * If there wasn't any memory allocated before, just
2412 * allocate it now and get out.
2414 if (ifp->if_broot_bytes == 0) {
2415 new_size = (size_t)XFS_BMAP_BROOT_SPACE_CALC(rec_diff);
2416 ifp->if_broot = (xfs_bmbt_block_t*)kmem_alloc(new_size,
2418 ifp->if_broot_bytes = (int)new_size;
2423 * If there is already an existing if_broot, then we need
2424 * to realloc() it and shift the pointers to their new
2425 * location. The records don't change location because
2426 * they are kept butted up against the btree block header.
2428 cur_max = XFS_BMAP_BROOT_MAXRECS(ifp->if_broot_bytes);
2429 new_max = cur_max + rec_diff;
2430 new_size = (size_t)XFS_BMAP_BROOT_SPACE_CALC(new_max);
2431 ifp->if_broot = (xfs_bmbt_block_t *)
2432 kmem_realloc(ifp->if_broot,
2434 (size_t)XFS_BMAP_BROOT_SPACE_CALC(cur_max), /* old size */
2436 op = (char *)XFS_BMAP_BROOT_PTR_ADDR(ifp->if_broot, 1,
2437 ifp->if_broot_bytes);
2438 np = (char *)XFS_BMAP_BROOT_PTR_ADDR(ifp->if_broot, 1,
2440 ifp->if_broot_bytes = (int)new_size;
2441 ASSERT(ifp->if_broot_bytes <=
2442 XFS_IFORK_SIZE(ip, whichfork) + XFS_BROOT_SIZE_ADJ);
2443 memmove(np, op, cur_max * (uint)sizeof(xfs_dfsbno_t));
2448 * rec_diff is less than 0. In this case, we are shrinking the
2449 * if_broot buffer. It must already exist. If we go to zero
2450 * records, just get rid of the root and clear the status bit.
2452 ASSERT((ifp->if_broot != NULL) && (ifp->if_broot_bytes > 0));
2453 cur_max = XFS_BMAP_BROOT_MAXRECS(ifp->if_broot_bytes);
2454 new_max = cur_max + rec_diff;
2455 ASSERT(new_max >= 0);
2457 new_size = (size_t)XFS_BMAP_BROOT_SPACE_CALC(new_max);
2461 new_broot = (xfs_bmbt_block_t *)kmem_alloc(new_size, KM_SLEEP);
2463 * First copy over the btree block header.
2465 memcpy(new_broot, ifp->if_broot, sizeof(xfs_bmbt_block_t));
2468 ifp->if_flags &= ~XFS_IFBROOT;
2472 * Only copy the records and pointers if there are any.
2476 * First copy the records.
2478 op = (char *)XFS_BMAP_BROOT_REC_ADDR(ifp->if_broot, 1,
2479 ifp->if_broot_bytes);
2480 np = (char *)XFS_BMAP_BROOT_REC_ADDR(new_broot, 1,
2482 memcpy(np, op, new_max * (uint)sizeof(xfs_bmbt_rec_t));
2485 * Then copy the pointers.
2487 op = (char *)XFS_BMAP_BROOT_PTR_ADDR(ifp->if_broot, 1,
2488 ifp->if_broot_bytes);
2489 np = (char *)XFS_BMAP_BROOT_PTR_ADDR(new_broot, 1,
2491 memcpy(np, op, new_max * (uint)sizeof(xfs_dfsbno_t));
2493 kmem_free(ifp->if_broot, ifp->if_broot_bytes);
2494 ifp->if_broot = new_broot;
2495 ifp->if_broot_bytes = (int)new_size;
2496 ASSERT(ifp->if_broot_bytes <=
2497 XFS_IFORK_SIZE(ip, whichfork) + XFS_BROOT_SIZE_ADJ);
2503 * This is called when the amount of space needed for if_extents
2504 * is increased or decreased. The change in size is indicated by
2505 * the number of extents that need to be added or deleted in the
2506 * ext_diff parameter.
2508 * If the amount of space needed has decreased below the size of the
2509 * inline buffer, then switch to using the inline buffer. Otherwise,
2510 * use kmem_realloc() or kmem_alloc() to adjust the size of the buffer
2511 * to what is needed.
2513 * ip -- the inode whose if_extents area is changing
2514 * ext_diff -- the change in the number of extents, positive or negative,
2515 * requested for the if_extents array.
2528 if (ext_diff == 0) {
2532 ifp = XFS_IFORK_PTR(ip, whichfork);
2533 byte_diff = ext_diff * (uint)sizeof(xfs_bmbt_rec_t);
2534 new_size = (int)ifp->if_bytes + byte_diff;
2535 ASSERT(new_size >= 0);
2537 if (new_size == 0) {
2538 if (ifp->if_u1.if_extents != ifp->if_u2.if_inline_ext) {
2539 ASSERT(ifp->if_real_bytes != 0);
2540 kmem_free(ifp->if_u1.if_extents, ifp->if_real_bytes);
2542 ifp->if_u1.if_extents = NULL;
2544 } else if (new_size <= sizeof(ifp->if_u2.if_inline_ext)) {
2546 * If the valid extents can fit in if_inline_ext,
2547 * copy them from the malloc'd vector and free it.
2549 if (ifp->if_u1.if_extents != ifp->if_u2.if_inline_ext) {
2551 * For now, empty files are format EXTENTS,
2552 * so the if_extents pointer is null.
2554 if (ifp->if_u1.if_extents) {
2555 memcpy(ifp->if_u2.if_inline_ext,
2556 ifp->if_u1.if_extents, new_size);
2557 kmem_free(ifp->if_u1.if_extents,
2558 ifp->if_real_bytes);
2560 ifp->if_u1.if_extents = ifp->if_u2.if_inline_ext;
2564 rnew_size = new_size;
2565 if ((rnew_size & (rnew_size - 1)) != 0)
2566 rnew_size = xfs_iroundup(rnew_size);
2568 * Stuck with malloc/realloc.
2570 if (ifp->if_u1.if_extents == ifp->if_u2.if_inline_ext) {
2571 ifp->if_u1.if_extents = (xfs_bmbt_rec_t *)
2572 kmem_alloc(rnew_size, KM_SLEEP);
2573 memcpy(ifp->if_u1.if_extents, ifp->if_u2.if_inline_ext,
2574 sizeof(ifp->if_u2.if_inline_ext));
2575 } else if (rnew_size != ifp->if_real_bytes) {
2576 ifp->if_u1.if_extents = (xfs_bmbt_rec_t *)
2577 kmem_realloc(ifp->if_u1.if_extents,
2583 ifp->if_real_bytes = rnew_size;
2584 ifp->if_bytes = new_size;
2589 * This is called when the amount of space needed for if_data
2590 * is increased or decreased. The change in size is indicated by
2591 * the number of bytes that need to be added or deleted in the
2592 * byte_diff parameter.
2594 * If the amount of space needed has decreased below the size of the
2595 * inline buffer, then switch to using the inline buffer. Otherwise,
2596 * use kmem_realloc() or kmem_alloc() to adjust the size of the buffer
2597 * to what is needed.
2599 * ip -- the inode whose if_data area is changing
2600 * byte_diff -- the change in the number of bytes, positive or negative,
2601 * requested for the if_data array.
2613 if (byte_diff == 0) {
2617 ifp = XFS_IFORK_PTR(ip, whichfork);
2618 new_size = (int)ifp->if_bytes + byte_diff;
2619 ASSERT(new_size >= 0);
2621 if (new_size == 0) {
2622 if (ifp->if_u1.if_data != ifp->if_u2.if_inline_data) {
2623 kmem_free(ifp->if_u1.if_data, ifp->if_real_bytes);
2625 ifp->if_u1.if_data = NULL;
2627 } else if (new_size <= sizeof(ifp->if_u2.if_inline_data)) {
2629 * If the valid extents/data can fit in if_inline_ext/data,
2630 * copy them from the malloc'd vector and free it.
2632 if (ifp->if_u1.if_data == NULL) {
2633 ifp->if_u1.if_data = ifp->if_u2.if_inline_data;
2634 } else if (ifp->if_u1.if_data != ifp->if_u2.if_inline_data) {
2635 ASSERT(ifp->if_real_bytes != 0);
2636 memcpy(ifp->if_u2.if_inline_data, ifp->if_u1.if_data,
2638 kmem_free(ifp->if_u1.if_data, ifp->if_real_bytes);
2639 ifp->if_u1.if_data = ifp->if_u2.if_inline_data;
2644 * Stuck with malloc/realloc.
2645 * For inline data, the underlying buffer must be
2646 * a multiple of 4 bytes in size so that it can be
2647 * logged and stay on word boundaries. We enforce
2650 real_size = roundup(new_size, 4);
2651 if (ifp->if_u1.if_data == NULL) {
2652 ASSERT(ifp->if_real_bytes == 0);
2653 ifp->if_u1.if_data = kmem_alloc(real_size, KM_SLEEP);
2654 } else if (ifp->if_u1.if_data != ifp->if_u2.if_inline_data) {
2656 * Only do the realloc if the underlying size
2657 * is really changing.
2659 if (ifp->if_real_bytes != real_size) {
2660 ifp->if_u1.if_data =
2661 kmem_realloc(ifp->if_u1.if_data,
2667 ASSERT(ifp->if_real_bytes == 0);
2668 ifp->if_u1.if_data = kmem_alloc(real_size, KM_SLEEP);
2669 memcpy(ifp->if_u1.if_data, ifp->if_u2.if_inline_data,
2673 ifp->if_real_bytes = real_size;
2674 ifp->if_bytes = new_size;
2675 ASSERT(ifp->if_bytes <= XFS_IFORK_SIZE(ip, whichfork));
2682 * Map inode to disk block and offset.
2684 * mp -- the mount point structure for the current file system
2685 * tp -- the current transaction
2686 * ino -- the inode number of the inode to be located
2687 * imap -- this structure is filled in with the information necessary
2688 * to retrieve the given inode from disk
2689 * flags -- flags to pass to xfs_dilocate indicating whether or not
2690 * lookups in the inode btree were OK or not
2700 xfs_fsblock_t fsbno;
2705 fsbno = imap->im_blkno ?
2706 XFS_DADDR_TO_FSB(mp, imap->im_blkno) : NULLFSBLOCK;
2707 error = xfs_dilocate(mp, tp, ino, &fsbno, &len, &off, flags);
2711 imap->im_blkno = XFS_FSB_TO_DADDR(mp, fsbno);
2712 imap->im_len = XFS_FSB_TO_BB(mp, len);
2713 imap->im_agblkno = XFS_FSB_TO_AGBNO(mp, fsbno);
2714 imap->im_ioffset = (ushort)off;
2715 imap->im_boffset = (ushort)(off << mp->m_sb.sb_inodelog);
2726 ifp = XFS_IFORK_PTR(ip, whichfork);
2727 if (ifp->if_broot != NULL) {
2728 kmem_free(ifp->if_broot, ifp->if_broot_bytes);
2729 ifp->if_broot = NULL;
2733 * If the format is local, then we can't have an extents
2734 * array so just look for an inline data array. If we're
2735 * not local then we may or may not have an extents list,
2736 * so check and free it up if we do.
2738 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) {
2739 if ((ifp->if_u1.if_data != ifp->if_u2.if_inline_data) &&
2740 (ifp->if_u1.if_data != NULL)) {
2741 ASSERT(ifp->if_real_bytes != 0);
2742 kmem_free(ifp->if_u1.if_data, ifp->if_real_bytes);
2743 ifp->if_u1.if_data = NULL;
2744 ifp->if_real_bytes = 0;
2746 } else if ((ifp->if_flags & XFS_IFEXTENTS) &&
2747 (ifp->if_u1.if_extents != NULL) &&
2748 (ifp->if_u1.if_extents != ifp->if_u2.if_inline_ext)) {
2749 ASSERT(ifp->if_real_bytes != 0);
2750 kmem_free(ifp->if_u1.if_extents, ifp->if_real_bytes);
2751 ifp->if_u1.if_extents = NULL;
2752 ifp->if_real_bytes = 0;
2754 ASSERT(ifp->if_u1.if_extents == NULL ||
2755 ifp->if_u1.if_extents == ifp->if_u2.if_inline_ext);
2756 ASSERT(ifp->if_real_bytes == 0);
2757 if (whichfork == XFS_ATTR_FORK) {
2758 kmem_zone_free(xfs_ifork_zone, ip->i_afp);
2764 * This is called free all the memory associated with an inode.
2765 * It must free the inode itself and any buffers allocated for
2766 * if_extents/if_data and if_broot. It must also free the lock
2767 * associated with the inode.
2774 switch (ip->i_d.di_mode & S_IFMT) {
2778 xfs_idestroy_fork(ip, XFS_DATA_FORK);
2782 xfs_idestroy_fork(ip, XFS_ATTR_FORK);
2783 mrfree(&ip->i_lock);
2784 mrfree(&ip->i_iolock);
2785 freesema(&ip->i_flock);
2786 #ifdef XFS_BMAP_TRACE
2787 ktrace_free(ip->i_xtrace);
2789 #ifdef XFS_BMBT_TRACE
2790 ktrace_free(ip->i_btrace);
2793 ktrace_free(ip->i_rwtrace);
2795 #ifdef XFS_ILOCK_TRACE
2796 ktrace_free(ip->i_lock_trace);
2798 #ifdef XFS_DIR2_TRACE
2799 ktrace_free(ip->i_dir_trace);
2802 /* XXXdpd should be able to assert this but shutdown
2803 * is leaving the AIL behind. */
2804 ASSERT(((ip->i_itemp->ili_item.li_flags & XFS_LI_IN_AIL) == 0) ||
2805 XFS_FORCED_SHUTDOWN(ip->i_mount));
2806 xfs_inode_item_destroy(ip);
2808 kmem_zone_free(xfs_inode_zone, ip);
2813 * Increment the pin count of the given buffer.
2814 * This value is protected by ipinlock spinlock in the mount structure.
2820 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE));
2822 atomic_inc(&ip->i_pincount);
2826 * Decrement the pin count of the given inode, and wake up
2827 * anyone in xfs_iwait_unpin() if the count goes to 0. The
2828 * inode must have been previoulsy pinned with a call to xfs_ipin().
2834 ASSERT(atomic_read(&ip->i_pincount) > 0);
2836 if (atomic_dec_and_test(&ip->i_pincount)) {
2837 vnode_t *vp = XFS_ITOV_NULL(ip);
2839 /* make sync come back and flush this inode */
2841 struct inode *inode = LINVFS_GET_IP(vp);
2843 if (!(inode->i_state & I_NEW))
2844 mark_inode_dirty_sync(inode);
2847 wake_up(&ip->i_ipin_wait);
2852 * This is called to wait for the given inode to be unpinned.
2853 * It will sleep until this happens. The caller must have the
2854 * inode locked in at least shared mode so that the buffer cannot
2855 * be subsequently pinned once someone is waiting for it to be
2862 xfs_inode_log_item_t *iip;
2865 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE | MR_ACCESS));
2867 if (atomic_read(&ip->i_pincount) == 0) {
2872 if (iip && iip->ili_last_lsn) {
2873 lsn = iip->ili_last_lsn;
2879 * Give the log a push so we don't wait here too long.
2881 xfs_log_force(ip->i_mount, lsn, XFS_LOG_FORCE);
2883 wait_event(ip->i_ipin_wait, (atomic_read(&ip->i_pincount) == 0));
2888 * xfs_iextents_copy()
2890 * This is called to copy the REAL extents (as opposed to the delayed
2891 * allocation extents) from the inode into the given buffer. It
2892 * returns the number of bytes copied into the buffer.
2894 * If there are no delayed allocation extents, then we can just
2895 * memcpy() the extents into the buffer. Otherwise, we need to
2896 * examine each extent in turn and skip those which are delayed.
2901 xfs_bmbt_rec_t *buffer,
2905 xfs_bmbt_rec_t *dest_ep;
2907 #ifdef XFS_BMAP_TRACE
2908 static char fname[] = "xfs_iextents_copy";
2913 xfs_fsblock_t start_block;
2915 ifp = XFS_IFORK_PTR(ip, whichfork);
2916 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE|MR_ACCESS));
2917 ASSERT(ifp->if_bytes > 0);
2919 nrecs = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t);
2920 xfs_bmap_trace_exlist(fname, ip, nrecs, whichfork);
2924 * There are some delayed allocation extents in the
2925 * inode, so copy the extents one at a time and skip
2926 * the delayed ones. There must be at least one
2927 * non-delayed extent.
2929 ep = ifp->if_u1.if_extents;
2932 for (i = 0; i < nrecs; i++) {
2933 start_block = xfs_bmbt_get_startblock(ep);
2934 if (ISNULLSTARTBLOCK(start_block)) {
2936 * It's a delayed allocation extent, so skip it.
2942 /* Translate to on disk format */
2943 put_unaligned(INT_GET(ep->l0, ARCH_CONVERT),
2944 (__uint64_t*)&dest_ep->l0);
2945 put_unaligned(INT_GET(ep->l1, ARCH_CONVERT),
2946 (__uint64_t*)&dest_ep->l1);
2951 ASSERT(copied != 0);
2952 xfs_validate_extents(buffer, copied, 1, XFS_EXTFMT_INODE(ip));
2954 return (copied * (uint)sizeof(xfs_bmbt_rec_t));
2958 * Each of the following cases stores data into the same region
2959 * of the on-disk inode, so only one of them can be valid at
2960 * any given time. While it is possible to have conflicting formats
2961 * and log flags, e.g. having XFS_ILOG_?DATA set when the fork is
2962 * in EXTENTS format, this can only happen when the fork has
2963 * changed formats after being modified but before being flushed.
2964 * In these cases, the format always takes precedence, because the
2965 * format indicates the current state of the fork.
2972 xfs_inode_log_item_t *iip,
2979 #ifdef XFS_TRANS_DEBUG
2982 static const short brootflag[2] =
2983 { XFS_ILOG_DBROOT, XFS_ILOG_ABROOT };
2984 static const short dataflag[2] =
2985 { XFS_ILOG_DDATA, XFS_ILOG_ADATA };
2986 static const short extflag[2] =
2987 { XFS_ILOG_DEXT, XFS_ILOG_AEXT };
2991 ifp = XFS_IFORK_PTR(ip, whichfork);
2993 * This can happen if we gave up in iformat in an error path,
2994 * for the attribute fork.
2997 ASSERT(whichfork == XFS_ATTR_FORK);
3000 cp = XFS_DFORK_PTR_ARCH(dip, whichfork, ARCH_CONVERT);
3002 switch (XFS_IFORK_FORMAT(ip, whichfork)) {
3003 case XFS_DINODE_FMT_LOCAL:
3004 if ((iip->ili_format.ilf_fields & dataflag[whichfork]) &&
3005 (ifp->if_bytes > 0)) {
3006 ASSERT(ifp->if_u1.if_data != NULL);
3007 ASSERT(ifp->if_bytes <= XFS_IFORK_SIZE(ip, whichfork));
3008 memcpy(cp, ifp->if_u1.if_data, ifp->if_bytes);
3010 if (whichfork == XFS_DATA_FORK) {
3011 if (unlikely(XFS_DIR_SHORTFORM_VALIDATE_ONDISK(mp, dip))) {
3012 XFS_ERROR_REPORT("xfs_iflush_fork",
3013 XFS_ERRLEVEL_LOW, mp);
3014 return XFS_ERROR(EFSCORRUPTED);
3019 case XFS_DINODE_FMT_EXTENTS:
3020 ASSERT((ifp->if_flags & XFS_IFEXTENTS) ||
3021 !(iip->ili_format.ilf_fields & extflag[whichfork]));
3022 ASSERT((ifp->if_u1.if_extents != NULL) || (ifp->if_bytes == 0));
3023 ASSERT((ifp->if_u1.if_extents == NULL) || (ifp->if_bytes > 0));
3024 if ((iip->ili_format.ilf_fields & extflag[whichfork]) &&
3025 (ifp->if_bytes > 0)) {
3026 ASSERT(XFS_IFORK_NEXTENTS(ip, whichfork) > 0);
3027 (void)xfs_iextents_copy(ip, (xfs_bmbt_rec_t *)cp,
3032 case XFS_DINODE_FMT_BTREE:
3033 if ((iip->ili_format.ilf_fields & brootflag[whichfork]) &&
3034 (ifp->if_broot_bytes > 0)) {
3035 ASSERT(ifp->if_broot != NULL);
3036 ASSERT(ifp->if_broot_bytes <=
3037 (XFS_IFORK_SIZE(ip, whichfork) +
3038 XFS_BROOT_SIZE_ADJ));
3039 xfs_bmbt_to_bmdr(ifp->if_broot, ifp->if_broot_bytes,
3040 (xfs_bmdr_block_t *)cp,
3041 XFS_DFORK_SIZE_ARCH(dip, mp, whichfork, ARCH_CONVERT));
3045 case XFS_DINODE_FMT_DEV:
3046 if (iip->ili_format.ilf_fields & XFS_ILOG_DEV) {
3047 ASSERT(whichfork == XFS_DATA_FORK);
3048 INT_SET(dip->di_u.di_dev, ARCH_CONVERT, ip->i_df.if_u2.if_rdev);
3052 case XFS_DINODE_FMT_UUID:
3053 if (iip->ili_format.ilf_fields & XFS_ILOG_UUID) {
3054 ASSERT(whichfork == XFS_DATA_FORK);
3055 memcpy(&dip->di_u.di_muuid, &ip->i_df.if_u2.if_uuid,
3069 * xfs_iflush() will write a modified inode's changes out to the
3070 * inode's on disk home. The caller must have the inode lock held
3071 * in at least shared mode and the inode flush semaphore must be
3072 * held as well. The inode lock will still be held upon return from
3073 * the call and the caller is free to unlock it.
3074 * The inode flush lock will be unlocked when the inode reaches the disk.
3075 * The flags indicate how the inode's buffer should be written out.
3082 xfs_inode_log_item_t *iip;
3090 int clcount; /* count of inodes clustered */
3092 enum { INT_DELWRI = (1 << 0), INT_ASYNC = (1 << 1) };
3095 XFS_STATS_INC(xs_iflush_count);
3097 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE|MR_ACCESS));
3098 ASSERT(valusema(&ip->i_flock) <= 0);
3099 ASSERT(ip->i_d.di_format != XFS_DINODE_FMT_BTREE ||
3100 ip->i_d.di_nextents > ip->i_df.if_ext_max);
3106 * If the inode isn't dirty, then just release the inode
3107 * flush lock and do nothing.
3109 if ((ip->i_update_core == 0) &&
3110 ((iip == NULL) || !(iip->ili_format.ilf_fields & XFS_ILOG_ALL))) {
3111 ASSERT((iip != NULL) ?
3112 !(iip->ili_item.li_flags & XFS_LI_IN_AIL) : 1);
3118 * We can't flush the inode until it is unpinned, so
3119 * wait for it. We know noone new can pin it, because
3120 * we are holding the inode lock shared and you need
3121 * to hold it exclusively to pin the inode.
3123 xfs_iunpin_wait(ip);
3126 * This may have been unpinned because the filesystem is shutting
3127 * down forcibly. If that's the case we must not write this inode
3128 * to disk, because the log record didn't make it to disk!
3130 if (XFS_FORCED_SHUTDOWN(mp)) {
3131 ip->i_update_core = 0;
3133 iip->ili_format.ilf_fields = 0;
3135 return XFS_ERROR(EIO);
3139 * Get the buffer containing the on-disk inode.
3141 error = xfs_itobp(mp, NULL, ip, &dip, &bp, 0);
3148 * Decide how buffer will be flushed out. This is done before
3149 * the call to xfs_iflush_int because this field is zeroed by it.
3151 if (iip != NULL && iip->ili_format.ilf_fields != 0) {
3153 * Flush out the inode buffer according to the directions
3154 * of the caller. In the cases where the caller has given
3155 * us a choice choose the non-delwri case. This is because
3156 * the inode is in the AIL and we need to get it out soon.
3159 case XFS_IFLUSH_SYNC:
3160 case XFS_IFLUSH_DELWRI_ELSE_SYNC:
3163 case XFS_IFLUSH_ASYNC:
3164 case XFS_IFLUSH_DELWRI_ELSE_ASYNC:
3167 case XFS_IFLUSH_DELWRI:
3177 case XFS_IFLUSH_DELWRI_ELSE_SYNC:
3178 case XFS_IFLUSH_DELWRI_ELSE_ASYNC:
3179 case XFS_IFLUSH_DELWRI:
3182 case XFS_IFLUSH_ASYNC:
3185 case XFS_IFLUSH_SYNC:
3196 * First flush out the inode that xfs_iflush was called with.
3198 error = xfs_iflush_int(ip, bp);
3205 * see if other inodes can be gathered into this write
3208 ip->i_chash->chl_buf = bp;
3210 ch = XFS_CHASH(mp, ip->i_blkno);
3211 s = mutex_spinlock(&ch->ch_lock);
3214 for (iq = ip->i_cnext; iq != ip; iq = iq->i_cnext) {
3216 * Do an un-protected check to see if the inode is dirty and
3217 * is a candidate for flushing. These checks will be repeated
3218 * later after the appropriate locks are acquired.
3221 if ((iq->i_update_core == 0) &&
3223 !(iip->ili_format.ilf_fields & XFS_ILOG_ALL)) &&
3224 xfs_ipincount(iq) == 0) {
3229 * Try to get locks. If any are unavailable,
3230 * then this inode cannot be flushed and is skipped.
3233 /* get inode locks (just i_lock) */
3234 if (xfs_ilock_nowait(iq, XFS_ILOCK_SHARED)) {
3235 /* get inode flush lock */
3236 if (xfs_iflock_nowait(iq)) {
3237 /* check if pinned */
3238 if (xfs_ipincount(iq) == 0) {
3239 /* arriving here means that
3240 * this inode can be flushed.
3241 * first re-check that it's
3245 if ((iq->i_update_core != 0)||
3247 (iip->ili_format.ilf_fields & XFS_ILOG_ALL))) {
3249 error = xfs_iflush_int(iq, bp);
3253 goto cluster_corrupt_out;
3262 xfs_iunlock(iq, XFS_ILOCK_SHARED);
3265 mutex_spinunlock(&ch->ch_lock, s);
3268 XFS_STATS_INC(xs_icluster_flushcnt);
3269 XFS_STATS_ADD(xs_icluster_flushinode, clcount);
3273 * If the buffer is pinned then push on the log so we won't
3274 * get stuck waiting in the write for too long.
3276 if (XFS_BUF_ISPINNED(bp)){
3277 xfs_log_force(mp, (xfs_lsn_t)0, XFS_LOG_FORCE);
3280 if (flags & INT_DELWRI) {
3281 xfs_bdwrite(mp, bp);
3282 } else if (flags & INT_ASYNC) {
3283 xfs_bawrite(mp, bp);
3285 error = xfs_bwrite(mp, bp);
3291 xfs_force_shutdown(mp, XFS_CORRUPT_INCORE);
3292 xfs_iflush_abort(ip);
3294 * Unlocks the flush lock
3296 return XFS_ERROR(EFSCORRUPTED);
3298 cluster_corrupt_out:
3299 /* Corruption detected in the clustering loop. Invalidate the
3300 * inode buffer and shut down the filesystem.
3302 mutex_spinunlock(&ch->ch_lock, s);
3305 * Clean up the buffer. If it was B_DELWRI, just release it --
3306 * brelse can handle it with no problems. If not, shut down the
3307 * filesystem before releasing the buffer.
3309 if ((bufwasdelwri= XFS_BUF_ISDELAYWRITE(bp))) {
3313 xfs_force_shutdown(mp, XFS_CORRUPT_INCORE);
3317 * Just like incore_relse: if we have b_iodone functions,
3318 * mark the buffer as an error and call them. Otherwise
3319 * mark it as stale and brelse.
3321 if (XFS_BUF_IODONE_FUNC(bp)) {
3322 XFS_BUF_CLR_BDSTRAT_FUNC(bp);
3326 XFS_BUF_ERROR(bp,EIO);
3334 xfs_iflush_abort(iq);
3336 * Unlocks the flush lock
3338 return XFS_ERROR(EFSCORRUPTED);
3347 xfs_inode_log_item_t *iip;
3350 #ifdef XFS_TRANS_DEBUG
3355 ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE|MR_ACCESS));
3356 ASSERT(valusema(&ip->i_flock) <= 0);
3357 ASSERT(ip->i_d.di_format != XFS_DINODE_FMT_BTREE ||
3358 ip->i_d.di_nextents > ip->i_df.if_ext_max);
3365 * If the inode isn't dirty, then just release the inode
3366 * flush lock and do nothing.
3368 if ((ip->i_update_core == 0) &&
3369 ((iip == NULL) || !(iip->ili_format.ilf_fields & XFS_ILOG_ALL))) {
3374 /* set *dip = inode's place in the buffer */
3375 dip = (xfs_dinode_t *)xfs_buf_offset(bp, ip->i_boffset);
3378 * Clear i_update_core before copying out the data.
3379 * This is for coordination with our timestamp updates
3380 * that don't hold the inode lock. They will always
3381 * update the timestamps BEFORE setting i_update_core,
3382 * so if we clear i_update_core after they set it we
3383 * are guaranteed to see their updates to the timestamps.
3384 * I believe that this depends on strongly ordered memory
3385 * semantics, but we have that. We use the SYNCHRONIZE
3386 * macro to make sure that the compiler does not reorder
3387 * the i_update_core access below the data copy below.
3389 ip->i_update_core = 0;
3392 if (XFS_TEST_ERROR(INT_GET(dip->di_core.di_magic,ARCH_CONVERT) != XFS_DINODE_MAGIC,
3393 mp, XFS_ERRTAG_IFLUSH_1, XFS_RANDOM_IFLUSH_1)) {
3394 xfs_cmn_err(XFS_PTAG_IFLUSH, CE_ALERT, mp,
3395 "xfs_iflush: Bad inode %Lu magic number 0x%x, ptr 0x%p",
3396 ip->i_ino, (int) INT_GET(dip->di_core.di_magic, ARCH_CONVERT), dip);
3399 if (XFS_TEST_ERROR(ip->i_d.di_magic != XFS_DINODE_MAGIC,
3400 mp, XFS_ERRTAG_IFLUSH_2, XFS_RANDOM_IFLUSH_2)) {
3401 xfs_cmn_err(XFS_PTAG_IFLUSH, CE_ALERT, mp,
3402 "xfs_iflush: Bad inode %Lu, ptr 0x%p, magic number 0x%x",
3403 ip->i_ino, ip, ip->i_d.di_magic);
3406 if ((ip->i_d.di_mode & S_IFMT) == S_IFREG) {
3408 (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS) &&
3409 (ip->i_d.di_format != XFS_DINODE_FMT_BTREE),
3410 mp, XFS_ERRTAG_IFLUSH_3, XFS_RANDOM_IFLUSH_3)) {
3411 xfs_cmn_err(XFS_PTAG_IFLUSH, CE_ALERT, mp,
3412 "xfs_iflush: Bad regular inode %Lu, ptr 0x%p",
3416 } else if ((ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
3418 (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS) &&
3419 (ip->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
3420 (ip->i_d.di_format != XFS_DINODE_FMT_LOCAL),
3421 mp, XFS_ERRTAG_IFLUSH_4, XFS_RANDOM_IFLUSH_4)) {
3422 xfs_cmn_err(XFS_PTAG_IFLUSH, CE_ALERT, mp,
3423 "xfs_iflush: Bad directory inode %Lu, ptr 0x%p",
3428 if (XFS_TEST_ERROR(ip->i_d.di_nextents + ip->i_d.di_anextents >
3429 ip->i_d.di_nblocks, mp, XFS_ERRTAG_IFLUSH_5,
3430 XFS_RANDOM_IFLUSH_5)) {
3431 xfs_cmn_err(XFS_PTAG_IFLUSH, CE_ALERT, mp,
3432 "xfs_iflush: detected corrupt incore inode %Lu, total extents = %d, nblocks = %Ld, ptr 0x%p",
3434 ip->i_d.di_nextents + ip->i_d.di_anextents,
3439 if (XFS_TEST_ERROR(ip->i_d.di_forkoff > mp->m_sb.sb_inodesize,
3440 mp, XFS_ERRTAG_IFLUSH_6, XFS_RANDOM_IFLUSH_6)) {
3441 xfs_cmn_err(XFS_PTAG_IFLUSH, CE_ALERT, mp,
3442 "xfs_iflush: bad inode %Lu, forkoff 0x%x, ptr 0x%p",
3443 ip->i_ino, ip->i_d.di_forkoff, ip);
3447 * bump the flush iteration count, used to detect flushes which
3448 * postdate a log record during recovery.
3451 ip->i_d.di_flushiter++;
3454 * Copy the dirty parts of the inode into the on-disk
3455 * inode. We always copy out the core of the inode,
3456 * because if the inode is dirty at all the core must
3459 xfs_xlate_dinode_core((xfs_caddr_t)&(dip->di_core), &(ip->i_d),
3462 /* Wrap, we never let the log put out DI_MAX_FLUSH */
3463 if (ip->i_d.di_flushiter == DI_MAX_FLUSH)
3464 ip->i_d.di_flushiter = 0;
3467 * If this is really an old format inode and the superblock version
3468 * has not been updated to support only new format inodes, then
3469 * convert back to the old inode format. If the superblock version
3470 * has been updated, then make the conversion permanent.
3472 ASSERT(ip->i_d.di_version == XFS_DINODE_VERSION_1 ||
3473 XFS_SB_VERSION_HASNLINK(&mp->m_sb));
3474 if (ip->i_d.di_version == XFS_DINODE_VERSION_1) {
3475 if (!XFS_SB_VERSION_HASNLINK(&mp->m_sb)) {
3479 ASSERT(ip->i_d.di_nlink <= XFS_MAXLINK_1);
3480 INT_SET(dip->di_core.di_onlink, ARCH_CONVERT, ip->i_d.di_nlink);
3483 * The superblock version has already been bumped,
3484 * so just make the conversion to the new inode
3487 ip->i_d.di_version = XFS_DINODE_VERSION_2;
3488 INT_SET(dip->di_core.di_version, ARCH_CONVERT, XFS_DINODE_VERSION_2);
3489 ip->i_d.di_onlink = 0;
3490 INT_ZERO(dip->di_core.di_onlink, ARCH_CONVERT);
3491 memset(&(ip->i_d.di_pad[0]), 0, sizeof(ip->i_d.di_pad));
3492 memset(&(dip->di_core.di_pad[0]), 0,
3493 sizeof(dip->di_core.di_pad));
3494 ASSERT(ip->i_d.di_projid == 0);
3498 if (xfs_iflush_fork(ip, dip, iip, XFS_DATA_FORK, bp) == EFSCORRUPTED) {
3502 if (XFS_IFORK_Q(ip)) {
3504 * The only error from xfs_iflush_fork is on the data fork.
3506 (void) xfs_iflush_fork(ip, dip, iip, XFS_ATTR_FORK, bp);
3508 xfs_inobp_check(mp, bp);
3511 * We've recorded everything logged in the inode, so we'd
3512 * like to clear the ilf_fields bits so we don't log and
3513 * flush things unnecessarily. However, we can't stop
3514 * logging all this information until the data we've copied
3515 * into the disk buffer is written to disk. If we did we might
3516 * overwrite the copy of the inode in the log with all the
3517 * data after re-logging only part of it, and in the face of
3518 * a crash we wouldn't have all the data we need to recover.
3520 * What we do is move the bits to the ili_last_fields field.
3521 * When logging the inode, these bits are moved back to the
3522 * ilf_fields field. In the xfs_iflush_done() routine we
3523 * clear ili_last_fields, since we know that the information
3524 * those bits represent is permanently on disk. As long as
3525 * the flush completes before the inode is logged again, then
3526 * both ilf_fields and ili_last_fields will be cleared.
3528 * We can play with the ilf_fields bits here, because the inode
3529 * lock must be held exclusively in order to set bits there
3530 * and the flush lock protects the ili_last_fields bits.
3531 * Set ili_logged so the flush done
3532 * routine can tell whether or not to look in the AIL.
3533 * Also, store the current LSN of the inode so that we can tell
3534 * whether the item has moved in the AIL from xfs_iflush_done().
3535 * In order to read the lsn we need the AIL lock, because
3536 * it is a 64 bit value that cannot be read atomically.
3538 if (iip != NULL && iip->ili_format.ilf_fields != 0) {
3539 iip->ili_last_fields = iip->ili_format.ilf_fields;
3540 iip->ili_format.ilf_fields = 0;
3541 iip->ili_logged = 1;
3543 ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
3545 iip->ili_flush_lsn = iip->ili_item.li_lsn;
3549 * Attach the function xfs_iflush_done to the inode's
3550 * buffer. This will remove the inode from the AIL
3551 * and unlock the inode's flush lock when the inode is
3552 * completely written to disk.
3554 xfs_buf_attach_iodone(bp, (void(*)(xfs_buf_t*,xfs_log_item_t*))
3555 xfs_iflush_done, (xfs_log_item_t *)iip);
3557 ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
3558 ASSERT(XFS_BUF_IODONE_FUNC(bp) != NULL);
3561 * We're flushing an inode which is not in the AIL and has
3562 * not been logged but has i_update_core set. For this
3563 * case we can use a B_DELWRI flush and immediately drop
3564 * the inode flush lock because we can avoid the whole
3565 * AIL state thing. It's OK to drop the flush lock now,
3566 * because we've already locked the buffer and to do anything
3567 * you really need both.
3570 ASSERT(iip->ili_logged == 0);
3571 ASSERT(iip->ili_last_fields == 0);
3572 ASSERT((iip->ili_item.li_flags & XFS_LI_IN_AIL) == 0);
3580 return XFS_ERROR(EFSCORRUPTED);
3584 * Flush all inactive inodes in mp. Return true if no user references
3585 * were found, false otherwise.
3602 XFS_MOUNT_ILOCK(mp);
3608 /* Make sure we skip markers inserted by sync */
3609 if (ip->i_mount == NULL) {
3615 * It's up to our caller to purge the root
3616 * and quota vnodes later.
3618 vp = XFS_ITOV_NULL(ip);
3621 XFS_MOUNT_IUNLOCK(mp);
3622 xfs_finish_reclaim(ip, 0, XFS_IFLUSH_ASYNC);
3627 if (vn_count(vp) != 0) {
3628 if (vn_count(vp) == 1 &&
3629 (ip == mp->m_rootip ||
3631 (ip->i_ino == mp->m_sb.sb_uquotino ||
3632 ip->i_ino == mp->m_sb.sb_gquotino)))) {
3637 if (!(flag & XFS_FLUSH_ALL)) {
3644 * Ignore busy inodes but continue flushing
3651 * Sample vp mapping while holding mp locked on MP
3652 * systems, so we don't purge a reclaimed or
3653 * nonexistent vnode. We break from the loop
3654 * since we know that we modify
3655 * it by pulling ourselves from it in xfs_reclaim()
3656 * called via vn_purge() below. Set ip to the next
3657 * entry in the list anyway so we'll know below
3658 * whether we reached the end or not.
3661 XFS_MOUNT_IUNLOCK(mp);
3663 vn_purge(vp, &vmap);
3667 } while (ip != mp->m_inodes);
3669 * We need to distinguish between when we exit the loop
3670 * after a purge and when we simply hit the end of the
3671 * list. We can't use the (ip == mp->m_inodes) test,
3672 * because when we purge an inode at the start of the list
3673 * the next inode on the list becomes mp->m_inodes. That
3674 * would cause such a test to bail out early. The purged
3675 * variable tells us how we got out of the loop.
3681 XFS_MOUNT_IUNLOCK(mp);
3687 * xfs_iaccess: check accessibility of inode for mode.
3696 mode_t orgmode = mode;
3697 struct inode *inode = LINVFS_GET_IP(XFS_ITOV(ip));
3700 * Verify that the MAC policy allows the requested access.
3702 if ((error = _MAC_XFS_IACCESS(ip, mode, cr)))
3703 return XFS_ERROR(error);
3705 if (mode & S_IWUSR) {
3706 umode_t imode = inode->i_mode;
3708 if (IS_RDONLY(inode) &&
3709 (S_ISREG(imode) || S_ISDIR(imode) || S_ISLNK(imode)))
3710 return XFS_ERROR(EROFS);
3712 if (IS_IMMUTABLE(inode))
3713 return XFS_ERROR(EACCES);
3717 * If there's an Access Control List it's used instead of
3720 if ((error = _ACL_XFS_IACCESS(ip, mode, cr)) != -1)
3721 return error ? XFS_ERROR(error) : 0;
3723 if (current_fsuid(cr) != ip->i_d.di_uid) {
3725 if (!in_group_p((gid_t)ip->i_d.di_gid))
3730 * If the DACs are ok we don't need any capability check.
3732 if ((ip->i_d.di_mode & mode) == mode)
3735 * Read/write DACs are always overridable.
3736 * Executable DACs are overridable if at least one exec bit is set.
3738 if (!(orgmode & S_IXUSR) ||
3739 (inode->i_mode & S_IXUGO) || S_ISDIR(inode->i_mode))
3740 if (capable_cred(cr, CAP_DAC_OVERRIDE))
3743 if ((orgmode == S_IRUSR) ||
3744 (S_ISDIR(inode->i_mode) && (!(orgmode & S_IWUSR)))) {
3745 if (capable_cred(cr, CAP_DAC_READ_SEARCH))
3748 cmn_err(CE_NOTE, "Ick: mode=%o, orgmode=%o", mode, orgmode);
3750 return XFS_ERROR(EACCES);
3752 return XFS_ERROR(EACCES);
3756 * xfs_iroundup: round up argument to next power of two
3765 if ((v & (v - 1)) == 0)
3767 ASSERT((v & 0x80000000) == 0);
3768 if ((v & (v + 1)) == 0)
3770 for (i = 0, m = 1; i < 31; i++, m <<= 1) {
3774 if ((v & (v + 1)) == 0)
3782 * Change the requested timestamp in the given inode.
3783 * We don't lock across timestamp updates, and we don't log them but
3784 * we do record the fact that there is dirty information in core.
3786 * NOTE -- callers MUST combine XFS_ICHGTIME_MOD or XFS_ICHGTIME_CHG
3787 * with XFS_ICHGTIME_ACC to be sure that access time
3788 * update will take. Calling first with XFS_ICHGTIME_ACC
3789 * and then XFS_ICHGTIME_MOD may fail to modify the access
3790 * timestamp if the filesystem is mounted noacctm.
3793 xfs_ichgtime(xfs_inode_t *ip,
3797 vnode_t *vp = XFS_ITOV(ip);
3798 struct inode *inode = LINVFS_GET_IP(vp);
3801 * We're not supposed to change timestamps in readonly-mounted
3802 * filesystems. Throw it away if anyone asks us.
3804 if (unlikely(vp->v_vfsp->vfs_flag & VFS_RDONLY))
3808 * Don't update access timestamps on reads if mounted "noatime"
3809 * Throw it away if anyone asks us.
3811 if ((ip->i_mount->m_flags & XFS_MOUNT_NOATIME || IS_NOATIME(inode)) &&
3812 ((flags & (XFS_ICHGTIME_ACC|XFS_ICHGTIME_MOD|XFS_ICHGTIME_CHG))
3813 == XFS_ICHGTIME_ACC))
3817 if (flags & XFS_ICHGTIME_MOD) {
3818 VN_MTIMESET(vp, &tv);
3819 ip->i_d.di_mtime.t_sec = (__int32_t)tv.tv_sec;
3820 ip->i_d.di_mtime.t_nsec = (__int32_t)tv.tv_nsec;
3822 if (flags & XFS_ICHGTIME_ACC) {
3823 VN_ATIMESET(vp, &tv);
3824 ip->i_d.di_atime.t_sec = (__int32_t)tv.tv_sec;
3825 ip->i_d.di_atime.t_nsec = (__int32_t)tv.tv_nsec;
3827 if (flags & XFS_ICHGTIME_CHG) {
3828 VN_CTIMESET(vp, &tv);
3829 ip->i_d.di_ctime.t_sec = (__int32_t)tv.tv_sec;
3830 ip->i_d.di_ctime.t_nsec = (__int32_t)tv.tv_nsec;
3834 * We update the i_update_core field _after_ changing
3835 * the timestamps in order to coordinate properly with
3836 * xfs_iflush() so that we don't lose timestamp updates.
3837 * This keeps us from having to hold the inode lock
3838 * while doing this. We use the SYNCHRONIZE macro to
3839 * ensure that the compiler does not reorder the update
3840 * of i_update_core above the timestamp updates above.
3843 ip->i_update_core = 1;
3844 if (!(inode->i_state & I_LOCK))
3845 mark_inode_dirty_sync(inode);
3848 #ifdef XFS_ILOCK_TRACE
3849 ktrace_t *xfs_ilock_trace_buf;
3852 xfs_ilock_trace(xfs_inode_t *ip, int lock, unsigned int lockflags, inst_t *ra)
3854 ktrace_enter(ip->i_lock_trace,
3856 (void *)(unsigned long)lock, /* 1 = LOCK, 3=UNLOCK, etc */
3857 (void *)(unsigned long)lockflags, /* XFS_ILOCK_EXCL etc */
3858 (void *)ra, /* caller of ilock */
3859 (void *)(unsigned long)current_cpu(),
3860 (void *)(unsigned long)current_pid(),
3861 0,0,0,0,0,0,0,0,0,0);