| cd9660_node.h (130585) | cd9660_node.h (130640) |
|---|---|
| 1/*- 2 * Copyright (c) 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley 6 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension 7 * Support code is derived from software contributed to Berkeley 8 * by Atsushi Murai (amurai@spec.co.jp). --- 18 unchanged lines hidden (view full) --- 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * @(#)cd9660_node.h 8.6 (Berkeley) 5/14/95 | 1/*- 2 * Copyright (c) 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley 6 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension 7 * Support code is derived from software contributed to Berkeley 8 * by Atsushi Murai (amurai@spec.co.jp). --- 18 unchanged lines hidden (view full) --- 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * @(#)cd9660_node.h 8.6 (Berkeley) 5/14/95 |
| 35 * $FreeBSD: head/sys/fs/cd9660/cd9660_node.h 130585 2004-06-16 09:47:26Z phk $ | 35 * $FreeBSD: head/sys/fs/cd9660/cd9660_node.h 130640 2004-06-17 17:16:53Z phk $ |
| 36 */ 37 38/* 39 * Theoretically, directories can be more than 2Gb in length, 40 * however, in practice this seems unlikely. So, we define 41 * the type doff_t as a long to keep down the cost of doing 42 * lookup on a 32-bit machine. If you are porting to a 64-bit 43 * architecture, you should make doff_t the same as off_t. 44 */ 45#define doff_t long 46 47typedef struct { 48 struct timespec iso_atime; /* time of last access */ 49 struct timespec iso_mtime; /* time of last modification */ 50 struct timespec iso_ctime; /* time file changed */ 51 u_short iso_mode; /* files access mode and type */ 52 uid_t iso_uid; /* owner user id */ 53 gid_t iso_gid; /* owner group id */ 54 short iso_links; /* links of file */ | 36 */ 37 38/* 39 * Theoretically, directories can be more than 2Gb in length, 40 * however, in practice this seems unlikely. So, we define 41 * the type doff_t as a long to keep down the cost of doing 42 * lookup on a 32-bit machine. If you are porting to a 64-bit 43 * architecture, you should make doff_t the same as off_t. 44 */ 45#define doff_t long 46 47typedef struct { 48 struct timespec iso_atime; /* time of last access */ 49 struct timespec iso_mtime; /* time of last modification */ 50 struct timespec iso_ctime; /* time file changed */ 51 u_short iso_mode; /* files access mode and type */ 52 uid_t iso_uid; /* owner user id */ 53 gid_t iso_gid; /* owner group id */ 54 short iso_links; /* links of file */ |
| 55 udev_t iso_rdev; /* Major/Minor number for special */ | 55 dev_t iso_rdev; /* Major/Minor number for special */ |
| 56} ISO_RRIP_INODE; 57 58 59struct iso_node { 60 struct iso_node *i_next, **i_prev; /* hash chain */ 61 struct vnode *i_vnode; /* vnode associated with this inode */ 62 struct vnode *i_devvp; /* vnode for block I/O */ 63 u_long i_flag; /* see below */ --- 58 unchanged lines hidden --- | 56} ISO_RRIP_INODE; 57 58 59struct iso_node { 60 struct iso_node *i_next, **i_prev; /* hash chain */ 61 struct vnode *i_vnode; /* vnode associated with this inode */ 62 struct vnode *i_devvp; /* vnode for block I/O */ 63 u_long i_flag; /* see below */ --- 58 unchanged lines hidden --- |