1/* 2 * Copyright (c) 1982, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * (c) UNIX System Laboratories, Inc. 5 * All or some portions of this file are derived from material licensed 6 * to the University of California by American Telephone and Telegraph 7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 8 * the permission of UNIX System Laboratories, Inc. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)inode.h 8.9 (Berkeley) 5/14/95
|
46#include <ufs/ufs/dinode.h> 47 48/* 49 * This must agree with the definition in <ufs/ufs/dir.h>. 50 */ 51#define doff_t int32_t 52 53/* 54 * The inode is used to describe each active (or recently active) file in the 55 * UFS filesystem. It is composed of two types of information. The first part 56 * is the information that is needed only while the file is active (such as 57 * the identity of the file and linkage to speed its lookup). The second part 58 * is the permanent meta-data associated with the file which is read in 59 * from the permanent dinode from long term storage when the file becomes 60 * active, and is put back when the file is no longer being used. 61 */ 62struct inode { 63 struct lock i_lock; /* Inode lock. >Keep this first< */ 64 LIST_ENTRY(inode) i_hash;/* Hash chain. */ 65 struct vnode *i_vnode;/* Vnode associated with this inode. */ 66 struct vnode *i_devvp;/* Vnode for block I/O. */ 67 u_int32_t i_flag; /* flags, see below */ 68 dev_t i_dev; /* Device associated with the inode. */ 69 ino_t i_number; /* The identity of the inode. */ 70 71 union { /* Associated filesystem. */ 72 struct fs *fs; /* FFS */ 73 struct lfs *lfs; /* LFS */ 74 struct ext2_sb_info *e2fs; /* EXT2FS */ 75 } inode_u; 76#define i_fs inode_u.fs 77#define i_lfs inode_u.lfs 78#define i_e2fs inode_u.e2fs 79 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */ 80 u_quad_t i_modrev; /* Revision level for NFS lease. */ 81 struct lockf *i_lockf;/* Head of byte-level lock list. */ 82 /* 83 * Side effects; used during directory lookup. 84 */ 85 int32_t i_count; /* Size of free slot in directory. */ 86 doff_t i_endoff; /* End of useful stuff in directory. */ 87 doff_t i_diroff; /* Offset in dir, where we found last entry. */ 88 doff_t i_offset; /* Offset of free space in directory. */ 89 ino_t i_ino; /* Inode number of found directory. */ 90 u_int32_t i_reclen; /* Size of found directory entry. */ 91 int i_spare[5]; /* XXX actually non-spare (for ext2fs). */ 92 /* 93 * The on-disk dinode itself. 94 */ 95 struct dinode i_din; /* 128 bytes of the on-disk dinode. */ 96}; 97 98#define i_atime i_din.di_atime 99#define i_atimensec i_din.di_atimensec 100#define i_blocks i_din.di_blocks 101#define i_ctime i_din.di_ctime 102#define i_ctimensec i_din.di_ctimensec 103#define i_db i_din.di_db 104#define i_flags i_din.di_flags 105#define i_gen i_din.di_gen 106#define i_gid i_din.di_gid 107#define i_ib i_din.di_ib 108#define i_mode i_din.di_mode 109#define i_mtime i_din.di_mtime 110#define i_mtimensec i_din.di_mtimensec 111#define i_nlink i_din.di_nlink 112#define i_rdev i_din.di_rdev 113#define i_shortlink i_din.di_shortlink 114#define i_size i_din.di_size 115#define i_uid i_din.di_uid 116 117/* These flags are kept in i_flag. */ 118#define IN_ACCESS 0x0001 /* Access time update request. */ 119#define IN_CHANGE 0x0002 /* Inode change time update request. */ 120#define IN_UPDATE 0x0004 /* Modification time update request. */ 121#define IN_MODIFIED 0x0008 /* Inode has been modified. */ 122#define IN_RENAME 0x0010 /* Inode is being renamed. */ 123#define IN_SHLOCK 0x0020 /* File has shared lock. */ 124#define IN_EXLOCK 0x0040 /* File has exclusive lock. */ 125#define IN_HASHED 0x0080 /* Inode is on hash list */ 126 127#ifdef KERNEL 128/* 129 * Structure used to pass around logical block paths generated by 130 * ufs_getlbns and used by truncate and bmap code. 131 */ 132struct indir { 133 ufs_daddr_t in_lbn; /* Logical block number. */ 134 int in_off; /* Offset in buffer. */ 135 int in_exists; /* Flag if the block exists. */ 136}; 137 138/* Convert between inode pointers and vnode pointers. */ 139#define VTOI(vp) ((struct inode *)(vp)->v_data) 140#define ITOV(ip) ((ip)->i_vnode) 141 142/* 143 * XXX this is too long to be a macro, and isn't used in any time-critical 144 * place; in fact it is only used in ufs_vnops.c so it shouldn't be in a 145 * header file. 146 */ 147#define ITIMES(ip, t1, t2) { \ 148 long tv_sec = time.tv_sec; \ 149 if ((ip)->i_flag & (IN_ACCESS | IN_CHANGE | IN_UPDATE)) { \ 150 (ip)->i_flag |= IN_MODIFIED; \ 151 if ((ip)->i_flag & IN_ACCESS) \ 152 (ip)->i_atime \ 153 = ((t1) == &time ? tv_sec : (t1)->tv_sec); \ 154 if ((ip)->i_flag & IN_UPDATE) { \ 155 (ip)->i_mtime \ 156 = ((t2) == &time ? tv_sec : (t2)->tv_sec); \ 157 (ip)->i_modrev++; \ 158 } \ 159 if ((ip)->i_flag & IN_CHANGE) \ 160 (ip)->i_ctime = tv_sec; \ 161 (ip)->i_flag &= ~(IN_ACCESS | IN_CHANGE | IN_UPDATE); \ 162 } \ 163} 164 165/* This overlays the fid structure (see mount.h). */ 166struct ufid { 167 u_int16_t ufid_len; /* Length of structure. */ 168 u_int16_t ufid_pad; /* Force 32-bit alignment. */ 169 ino_t ufid_ino; /* File number (ino). */ 170 int32_t ufid_gen; /* Generation number. */ 171}; 172#endif /* KERNEL */ 173 174#endif /* !_UFS_UFS_INODE_H_ */
|