| cd9660_node.h (33052) | cd9660_node.h (47028) |
|---|---|
| 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). --- 22 unchanged lines hidden (view full) --- 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 * @(#)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). --- 22 unchanged lines hidden (view full) --- 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 * @(#)cd9660_node.h 8.6 (Berkeley) 5/14/95 |
| 39 * $Id: cd9660_node.h,v 1.16 1997/11/18 14:40:34 phk Exp $ | 39 * $Id: cd9660_node.h,v 1.17 1998/02/03 21:39:30 bde Exp $ |
| 40 */ 41 42/* 43 * Theoretically, directories can be more than 2Gb in length, 44 * however, in practice this seems unlikely. So, we define 45 * the type doff_t as a long to keep down the cost of doing 46 * lookup on a 32-bit machine. If you are porting to a 64-bit 47 * architecture, you should make doff_t the same as off_t. 48 */ 49#define doff_t long 50 51typedef struct { 52 struct timespec iso_atime; /* time of last access */ 53 struct timespec iso_mtime; /* time of last modification */ 54 struct timespec iso_ctime; /* time file changed */ 55 u_short iso_mode; /* files access mode and type */ 56 uid_t iso_uid; /* owner user id */ 57 gid_t iso_gid; /* owner group id */ 58 short iso_links; /* links of file */ | 40 */ 41 42/* 43 * Theoretically, directories can be more than 2Gb in length, 44 * however, in practice this seems unlikely. So, we define 45 * the type doff_t as a long to keep down the cost of doing 46 * lookup on a 32-bit machine. If you are porting to a 64-bit 47 * architecture, you should make doff_t the same as off_t. 48 */ 49#define doff_t long 50 51typedef struct { 52 struct timespec iso_atime; /* time of last access */ 53 struct timespec iso_mtime; /* time of last modification */ 54 struct timespec iso_ctime; /* time file changed */ 55 u_short iso_mode; /* files access mode and type */ 56 uid_t iso_uid; /* owner user id */ 57 gid_t iso_gid; /* owner group id */ 58 short iso_links; /* links of file */ |
| 59 dev_t iso_rdev; /* Major/Minor number for special */ | 59 udev_t iso_rdev; /* Major/Minor number for special */ |
| 60} ISO_RRIP_INODE; 61 62 63struct iso_node { 64 struct lock i_lock; /* node lock > Keep this first< */ 65 struct iso_node *i_next, **i_prev; /* hash chain */ 66 struct vnode *i_vnode; /* vnode associated with this inode */ 67 struct vnode *i_devvp; /* vnode for block I/O */ --- 59 unchanged lines hidden --- | 60} ISO_RRIP_INODE; 61 62 63struct iso_node { 64 struct lock i_lock; /* node lock > Keep this first< */ 65 struct iso_node *i_next, **i_prev; /* hash chain */ 66 struct vnode *i_vnode; /* vnode associated with this inode */ 67 struct vnode *i_devvp; /* vnode for block I/O */ --- 59 unchanged lines hidden --- |