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 * %sccs.include.redist.c% 11 * 12 * @(#)inode.h 8.4 (Berkeley) 01/21/94 13 */ 14 15 #include <ufs/ufs/dinode.h> 16 17 /* 18 * Theoretically, directories can be more than 2Gb in length, however, in 19 * practice this seems unlikely. So, we define the type doff_t as a long 20 * to keep down the cost of doing lookup on a 32-bit machine. If you are 21 * porting to a 64-bit architecture, you should make doff_t the same as off_t. 22 */ 23 #define doff_t long 24 25 /* 26 * The inode is used to describe each active (or recently active) 27 * file in the UFS filesystem. It is composed of two types of 28 * information. The first part is the information that is needed 29 * only while the file is active (such as the identity of the file 30 * and linkage to speed its lookup). The second part is the 31 * permannent meta-data associated with the file which is read 32 * in from the permanent dinode from long term storage when the 33 * file becomes active, and is put back when the file is no longer 34 * being used. 35 */ 36 struct inode { 37 struct inode *i_next; /* Hash chain forward. */ 38 struct inode **i_prev; /* Hash chain back. */ 39 struct vnode *i_vnode; /* Vnode associated with this inode. */ 40 struct vnode *i_devvp; /* Vnode for block I/O. */ 41 u_long i_flag; /* I* flags. */ 42 dev_t i_dev; /* Device associated with the inode. */ 43 ino_t i_number; /* The identity of the inode. */ 44 union { /* Associated filesystem. */ 45 struct fs *fs; /* FFS */ 46 struct lfs *lfs; /* LFS */ 47 } inode_u; 48 #define i_fs inode_u.fs 49 #define i_lfs inode_u.lfs 50 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */ 51 u_quad_t i_modrev; /* Revision level for lease. */ 52 struct lockf *i_lockf; /* Head of byte-level lock list. */ 53 pid_t i_lockholder; /* DEBUG: holder of inode lock. */ 54 pid_t i_lockwaiter; /* DEBUG: latest blocked for inode lock. */ 55 /* 56 * Side effects; used during directory lookup. 57 */ 58 long i_count; /* Size of free slot in directory. */ 59 doff_t i_endoff; /* End of useful stuff in directory. */ 60 doff_t i_diroff; /* Offset in dir, where we found last entry. */ 61 doff_t i_offset; /* Offset of free space in directory. */ 62 ino_t i_ino; /* Inode number of found directory. */ 63 u_long i_reclen; /* Size of found directory entry. */ 64 long i_spare[11]; /* Spares to round up to 128 bytes. */ 65 /* 66 * The on-disk dinode itself. 67 */ 68 struct dinode i_din; /* 128 bytes of the on-disk dinode. */ 69 }; 70 71 #define i_atime i_din.di_atime 72 #define i_blocks i_din.di_blocks 73 #define i_ctime i_din.di_ctime 74 #define i_db i_din.di_db 75 #define i_flags i_din.di_flags 76 #define i_gen i_din.di_gen 77 #define i_gid i_din.di_gid 78 #define i_ib i_din.di_ib 79 #define i_mode i_din.di_mode 80 #define i_mtime i_din.di_mtime 81 #define i_nlink i_din.di_nlink 82 #define i_rdev i_din.di_rdev 83 #define i_shortlink i_din.di_shortlink 84 #define i_size i_din.di_size 85 #define i_uid i_din.di_uid 86 87 /* These flags are kept in i_flag. */ 88 #define IN_ACCESS 0x0001 /* Access time update request. */ 89 #define IN_CHANGE 0x0002 /* Inode change time update request. */ 90 #define IN_EXLOCK 0x0004 /* File has exclusive lock. */ 91 #define IN_LOCKED 0x0008 /* Inode lock. */ 92 #define IN_LWAIT 0x0010 /* Process waiting on file lock. */ 93 #define IN_MODIFIED 0x0020 /* Inode has been modified. */ 94 #define IN_RENAME 0x0040 /* Inode is being renamed. */ 95 #define IN_SHLOCK 0x0080 /* File has shared lock. */ 96 #define IN_UPDATE 0x0100 /* Modification time update request. */ 97 #define IN_WANTED 0x0200 /* Inode is wanted by a process. */ 98 99 #ifdef KERNEL 100 /* 101 * Structure used to pass around logical block paths generated by 102 * ufs_getlbns and used by truncate and bmap code. 103 */ 104 struct indir { 105 daddr_t in_lbn; /* Logical block number. */ 106 int in_off; /* Offset in buffer. */ 107 int in_exists; /* Flag if the block exists. */ 108 }; 109 110 /* Convert between inode pointers and vnode pointers. */ 111 #define VTOI(vp) ((struct inode *)(vp)->v_data) 112 #define ITOV(ip) ((ip)->i_vnode) 113 114 #define ITIMES(ip, t1, t2) { \ 115 if ((ip)->i_flag & (IN_ACCESS | IN_CHANGE | IN_UPDATE)) { \ 116 (ip)->i_flag |= IN_MODIFIED; \ 117 if ((ip)->i_flag & IN_ACCESS) \ 118 (ip)->i_atime.ts_sec = (t1)->tv_sec; \ 119 if ((ip)->i_flag & IN_UPDATE) { \ 120 (ip)->i_mtime.ts_sec = (t2)->tv_sec; \ 121 (ip)->i_modrev++; \ 122 } \ 123 if ((ip)->i_flag & IN_CHANGE) \ 124 (ip)->i_ctime.ts_sec = time.tv_sec; \ 125 (ip)->i_flag &= ~(IN_ACCESS | IN_CHANGE | IN_UPDATE); \ 126 } \ 127 } 128 129 /* This overlays the fid structure (see mount.h). */ 130 struct ufid { 131 u_short ufid_len; /* Length of structure. */ 132 u_short ufid_pad; /* Force long alignment. */ 133 ino_t ufid_ino; /* File number (ino). */ 134 long ufid_gen; /* Generation number. */ 135 }; 136 #endif /* KERNEL */ 137