/* $NetBSD: cd9660_node.c,v 1.8 2004/05/20 05:39:34 atatat Exp $ */ /*- * Copyright (c) 1982, 1986, 1989, 1994 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension * Support code is derived from software contributed to Berkeley * by Atsushi Murai (amurai@spec.co.jp). * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)cd9660_node.c 8.8 (Berkeley) 5/22/95 */ #include __KERNEL_RCSID(0, "$NetBSD: cd9660_node.c,v 1.8 2004/05/20 05:39:34 atatat Exp $"); #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* * Structures associated with iso_node caching. */ LIST_HEAD(ihashhead, iso_node) *isohashtbl; u_long isohash; #define INOHASH(device, inum) (((device) + ((inum)>>12)) & isohash) struct simplelock cd9660_ihash_slock; #ifdef ISODEVMAP LIST_HEAD(idvhashhead, iso_dnode) *idvhashtbl; u_long idvhash; #define DNOHASH(device, inum) (((device) + ((inum)>>12)) & idvhash) #endif extern int prtactive; /* 1 => print out reclaim of active vnodes */ POOL_INIT(cd9660_node_pool, sizeof(struct iso_node), 0, 0, 0, "cd9660nopl", &pool_allocator_nointr); static u_int cd9660_chars2ui __P((u_char *, int)); /* * Initialize hash links for inodes and dnodes. */ void cd9660_init() { #ifdef _LKM malloc_type_attach(M_ISOFSMNT); pool_init(&cd9660_node_pool, sizeof(struct iso_node), 0, 0, 0, "cd9660nopl", &pool_allocator_nointr); #endif isohashtbl = hashinit(desiredvnodes, HASH_LIST, M_ISOFSMNT, M_WAITOK, &isohash); simple_lock_init(&cd9660_ihash_slock); #ifdef ISODEVMAP idvhashtbl = hashinit(desiredvnodes / 8, HASH_LIST, M_ISOFSMNT, M_WAITOK, &idvhash); #endif } /* * Reinitialize inode hash table. */ void cd9660_reinit() { struct iso_node *ip; struct ihashhead *oldhash1, *hash1; u_long oldmask1, mask1, val; #ifdef ISODEVMAP struct iso_dnode *dp; struct idvhashhead *oldhash2, *hash2; u_long oldmask2, mask2; #endif u_int i; hash1 = hashinit(desiredvnodes, HASH_LIST, M_ISOFSMNT, M_WAITOK, &mask1); #ifdef ISODEVMAP hash2 = hashinit(desiredvnodes / 8, HASH_LIST, M_ISOFSMNT, M_WAITOK, &mask2); #endif simple_lock(&cd9660_ihash_slock); oldhash1 = isohashtbl; oldmask1 = isohash; isohashtbl = hash1; isohash = mask1; #ifdef ISODEVMAP oldhash2 = idvhashtbl; oldmask2 = idvhash; idvhashtbl = hash2; idvhash = mask2; for (i = 0; i <= oldmask2; i++) { while ((dp = LIST_FIRST(&oldhash2[i])) != NULL) { LIST_REMOVE(dp, d_hash); val = DNOHASH(dp->i_dev, dp->i_number); LIST_INSERT_HEAD(&hash2[val], dp, d_hash); } } #endif for (i = 0; i <= oldmask1; i++) { while ((ip = LIST_FIRST(&oldhash1[i])) != NULL) { LIST_REMOVE(ip, i_hash); val = INOHASH(ip->i_dev, ip->i_number); LIST_INSERT_HEAD(&hash1[val], ip, i_hash); } } simple_unlock(&cd9660_ihash_slock); hashdone(oldhash1, M_ISOFSMNT); #ifdef ISODEVMAP hashdone(oldhash2, M_ISOFSMNT); #endif } /* * Destroy node pool and hash table. */ void cd9660_done() { hashdone(isohashtbl, M_ISOFSMNT); #ifdef ISODEVMAP hashdone(idvhashtbl, M_ISOFSMNT); #endif #ifdef _LKM pool_destroy(&cd9660_node_pool); malloc_type_detach(M_ISOFSMNT); #endif } #ifdef ISODEVMAP /* * Enter a new node into the device hash list */ struct iso_dnode * iso_dmap(device, inum, create) dev_t device; ino_t inum; int create; { struct iso_dnode *dp; struct idvhashhead *hp; hp = &idvhashtbl[DNOHASH(device, inum)]; LIST_FOREACH(dp, hp, d_hash) { if (inum == dp->i_number && device == dp->i_dev) return (dp); } if (!create) return (NULL); MALLOC(dp, struct iso_dnode *, sizeof(struct iso_dnode), M_CACHE, M_WAITOK); dp->i_dev = device; dp->i_number = inum; LIST_INSERT_HEAD(hp, dp, d_hash); return (dp); } void iso_dunmap(device) dev_t device; { struct idvhashhead *dpp; struct iso_dnode *dp, *dq; for (dpp = idvhashtbl; dpp <= idvhashtbl + idvhash; dpp++) { for (dp = LIST_FIRST(dpp); dp != NULL; dp = dq) { dq = LIST_NEXT(dp, d_hash); if (device == dp->i_dev) { LIST_REMOVE(dp, d_hash); FREE(dp, M_CACHE); } } } } #endif /* * Use the device/inum pair to find the incore inode, and return a pointer * to it. If it is in core, but locked, wait for it. */ struct vnode * cd9660_ihashget(dev, inum) dev_t dev; ino_t inum; { struct iso_node *ip; struct vnode *vp; loop: simple_lock(&cd9660_ihash_slock); LIST_FOREACH(ip, &isohashtbl[INOHASH(dev, inum)], i_hash) { if (inum == ip->i_number && dev == ip->i_dev) { vp = ITOV(ip); simple_lock(&vp->v_interlock); simple_unlock(&cd9660_ihash_slock); if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK)) goto loop; return (vp); } } simple_unlock(&cd9660_ihash_slock); return (NULL); } /* * Insert the inode into the hash table, and return it locked. * * ip->i_vnode must be initialized first. */ void cd9660_ihashins(ip) struct iso_node *ip; { struct ihashhead *ipp; simple_lock(&cd9660_ihash_slock); ipp = &isohashtbl[INOHASH(ip->i_dev, ip->i_number)]; LIST_INSERT_HEAD(ipp, ip, i_hash); simple_unlock(&cd9660_ihash_slock); lockmgr(&ip->i_vnode->v_lock, LK_EXCLUSIVE, &ip->i_vnode->v_interlock); } /* * Remove the inode from the hash table. */ void cd9660_ihashrem(ip) struct iso_node *ip; { simple_lock(&cd9660_ihash_slock); LIST_REMOVE(ip, i_hash); simple_unlock(&cd9660_ihash_slock); } /* * Last reference to an inode, write the inode out and if necessary, * truncate and deallocate the file. */ int cd9660_inactive(v) void *v; { struct vop_inactive_args /* { struct vnode *a_vp; struct proc *a_p; } */ *ap = v; struct vnode *vp = ap->a_vp; struct proc *p = ap->a_p; struct iso_node *ip = VTOI(vp); int error = 0; if (prtactive && vp->v_usecount != 0) vprint("cd9660_inactive: pushing active", vp); ip->i_flag = 0; VOP_UNLOCK(vp, 0); /* * If we are done with the inode, reclaim it * so that it can be reused immediately. */ if (ip->inode.iso_mode == 0) vrecycle(vp, (struct simplelock *)0, p); return error; } /* * Reclaim an inode so that it can be used for other purposes. */ int cd9660_reclaim(v) void *v; { struct vop_reclaim_args /* { struct vnode *a_vp; struct proc *a_p; } */ *ap = v; struct vnode *vp = ap->a_vp; struct iso_node *ip = VTOI(vp); if (prtactive && vp->v_usecount != 0) vprint("cd9660_reclaim: pushing active", vp); /* * Remove the inode from its hash chain. */ cd9660_ihashrem(ip); /* * Purge old data structures associated with the inode. */ cache_purge(vp); if (ip->i_devvp) { vrele(ip->i_devvp); ip->i_devvp = 0; } pool_put(&cd9660_node_pool, vp->v_data); vp->v_data = NULL; return (0); } /* * File attributes */ void cd9660_defattr(isodir, inop, bp) struct iso_directory_record *isodir; struct iso_node *inop; struct buf *bp; { struct buf *bp2 = NULL; struct iso_mnt *imp; struct iso_extended_attributes *ap = NULL; int off; if (isonum_711(isodir->flags)&2) { inop->inode.iso_mode = S_IFDIR; /* * If we return 2, fts() will assume there are no subdirectories * (just links for the path and .), so instead we return 1. */ inop->inode.iso_links = 1; } else { inop->inode.iso_mode = S_IFREG; inop->inode.iso_links = 1; } if (!bp && ((imp = inop->i_mnt)->im_flags & ISOFSMNT_EXTATT) && (off = isonum_711(isodir->ext_attr_length))) { VOP_BLKATOFF(ITOV(inop), (off_t)-(off << imp->im_bshift), NULL, &bp2); bp = bp2; } if (bp) { ap = (struct iso_extended_attributes *)bp->b_data; if (isonum_711(ap->version) == 1) { if (!(ap->perm[1]&0x10)) inop->inode.iso_mode |= S_IRUSR; if (!(ap->perm[1]&0x40)) inop->inode.iso_mode |= S_IXUSR; if (!(ap->perm[0]&0x01)) inop->inode.iso_mode |= S_IRGRP; if (!(ap->perm[0]&0x04)) inop->inode.iso_mode |= S_IXGRP; if (!(ap->perm[0]&0x10)) inop->inode.iso_mode |= S_IROTH; if (!(ap->perm[0]&0x40)) inop->inode.iso_mode |= S_IXOTH; inop->inode.iso_uid = isonum_723(ap->owner); /* what about 0? */ inop->inode.iso_gid = isonum_723(ap->group); /* what about 0? */ } else ap = NULL; } if (!ap) { inop->inode.iso_mode |= S_IRUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH; inop->inode.iso_uid = (uid_t)0; inop->inode.iso_gid = (gid_t)0; } if (bp2) brelse(bp2); } /* * Time stamps */ void cd9660_deftstamp(isodir,inop,bp) struct iso_directory_record *isodir; struct iso_node *inop; struct buf *bp; { struct buf *bp2 = NULL; struct iso_mnt *imp; struct iso_extended_attributes *ap = NULL; int off; if (!bp && ((imp = inop->i_mnt)->im_flags & ISOFSMNT_EXTATT) && (off = isonum_711(isodir->ext_attr_length))) { VOP_BLKATOFF(ITOV(inop), (off_t)-(off << imp->im_bshift), NULL, &bp2); bp = bp2; } if (bp) { ap = (struct iso_extended_attributes *)bp->b_data; if (isonum_711(ap->version) == 1) { if (!cd9660_tstamp_conv17(ap->ftime,&inop->inode.iso_atime)) cd9660_tstamp_conv17(ap->ctime,&inop->inode.iso_atime); if (!cd9660_tstamp_conv17(ap->ctime,&inop->inode.iso_ctime)) inop->inode.iso_ctime = inop->inode.iso_atime; if (!cd9660_tstamp_conv17(ap->mtime,&inop->inode.iso_mtime)) inop->inode.iso_mtime = inop->inode.iso_ctime; } else ap = NULL; } if (!ap) { cd9660_tstamp_conv7(isodir->date,&inop->inode.iso_ctime); inop->inode.iso_atime = inop->inode.iso_ctime; inop->inode.iso_mtime = inop->inode.iso_ctime; } if (bp2) brelse(bp2); } int cd9660_tstamp_conv7(pi,pu) u_char *pi; struct timespec *pu; { int crtime, days; int y, m, d, hour, minute, second, tz; y = pi[0] + 1900; m = pi[1]; d = pi[2]; hour = pi[3]; minute = pi[4]; second = pi[5]; tz = pi[6]; if (y < 1970) { pu->tv_sec = 0; pu->tv_nsec = 0; return 0; } else { #ifdef ORIGINAL /* computes day number relative to Sept. 19th,1989 */ /* don't even *THINK* about changing formula. It works! */ days = 367*(y-1980)-7*(y+(m+9)/12)/4-3*((y+(m-9)/7)/100+1)/4+275*m/9+d-100; #else /* * Changed :-) to make it relative to Jan. 1st, 1970 * and to disambiguate negative division */ days = 367*(y-1960)-7*(y+(m+9)/12)/4-3*((y+(m+9)/12-1)/100+1)/4+275*m/9+d-239; #endif crtime = ((((days * 24) + hour) * 60 + minute) * 60) + second; /* timezone offset is unreliable on some disks */ if (-48 <= tz && tz <= 52) crtime -= tz * 15 * 60; } pu->tv_sec = crtime; pu->tv_nsec = 0; return 1; } static u_int cd9660_chars2ui(begin,len) u_char *begin; int len; { u_int rc; for (rc = 0; --len >= 0;) { rc *= 10; rc += *begin++ - '0'; } return rc; } int cd9660_tstamp_conv17(pi,pu) u_char *pi; struct timespec *pu; { u_char buf[7]; /* year:"0001"-"9999" -> -1900 */ buf[0] = cd9660_chars2ui(pi,4) - 1900; /* month: " 1"-"12" -> 1 - 12 */ buf[1] = cd9660_chars2ui(pi + 4,2); /* day: " 1"-"31" -> 1 - 31 */ buf[2] = cd9660_chars2ui(pi + 6,2); /* hour: " 0"-"23" -> 0 - 23 */ buf[3] = cd9660_chars2ui(pi + 8,2); /* minute:" 0"-"59" -> 0 - 59 */ buf[4] = cd9660_chars2ui(pi + 10,2); /* second:" 0"-"59" -> 0 - 59 */ buf[5] = cd9660_chars2ui(pi + 12,2); /* difference of GMT */ buf[6] = pi[16]; return cd9660_tstamp_conv7(buf,pu); } ino_t isodirino(isodir, imp) struct iso_directory_record *isodir; struct iso_mnt *imp; { ino_t ino; ino = (isonum_733(isodir->extent) + isonum_711(isodir->ext_attr_length)) << imp->im_bshift; return (ino); }