Home | History | Annotate | Line # | Download | only in adosfs
adutil.c revision 1.14
      1 /*	$NetBSD: adutil.c,v 1.14 2011/05/23 22:00:30 rmind Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1994 Christian E. Hopps
      5  * Copyright (c) 1996 Matthias Scheler
      6  * All rights reserved.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     11  * 1. Redistributions of source code must retain the above copyright
     12  *    notice, this list of conditions and the following disclaimer.
     13  * 2. Redistributions in binary form must reproduce the above copyright
     14  *    notice, this list of conditions and the following disclaimer in the
     15  *    documentation and/or other materials provided with the distribution.
     16  * 3. All advertising materials mentioning features or use of this software
     17  *    must display the following acknowledgement:
     18  *      This product includes software developed by Christian E. Hopps.
     19  * 4. The name of the author may not be used to endorse or promote products
     20  *    derived from this software without specific prior written permission
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     23  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     24  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     25  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     26  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     27  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     28  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     29  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     30  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     31  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     32  */
     33 
     34 #include <sys/cdefs.h>
     35 __KERNEL_RCSID(0, "$NetBSD: adutil.c,v 1.14 2011/05/23 22:00:30 rmind Exp $");
     36 
     37 #include <sys/param.h>
     38 #include <sys/vnode.h>
     39 #include <sys/mount.h>
     40 #include <sys/proc.h>
     41 #include <sys/systm.h>
     42 #include <sys/time.h>
     43 #include <sys/queue.h>
     44 #include <sys/buf.h>
     45 #include <fs/adosfs/adosfs.h>
     46 
     47 /*
     48  * look for anode in the mount's hash table, return locked.
     49  */
     50 #define AHASH(an) ((an) & (ANODEHASHSZ - 1))
     51 static int CapitalChar(int, int);
     52 
     53 extern kmutex_t adosfs_hashlock;
     54 
     55 struct vnode *
     56 adosfs_ahashget(struct mount *mp, ino_t an)
     57 {
     58 	struct anodechain *hp;
     59 	struct anode *ap;
     60 	struct vnode *vp;
     61 
     62 	hp = &VFSTOADOSFS(mp)->anodetab[AHASH(an)];
     63 
     64 start_over:
     65 	mutex_enter(&adosfs_hashlock);
     66 	for (ap = hp->lh_first; ap != NULL; ap = ap->link.le_next) {
     67 		if (ap->block == an) {
     68 			vp = ATOV(ap);
     69 			mutex_enter(&vp->v_interlock);
     70 			mutex_exit(&adosfs_hashlock);
     71 			if (vget(vp, LK_EXCLUSIVE))
     72 				goto start_over;
     73 			return (ATOV(ap));
     74 		}
     75 	}
     76 	mutex_exit(&adosfs_hashlock);
     77 	return (NULL);
     78 }
     79 
     80 /*
     81  * insert in hash table and lock
     82  *
     83  * ap->vp must have been initialized before this call.
     84  */
     85 void
     86 adosfs_ainshash(struct adosfsmount *amp, struct anode *ap)
     87 {
     88 	VOP_LOCK(ATOV(ap), LK_EXCLUSIVE);
     89 
     90 	mutex_enter(&adosfs_hashlock);
     91 	LIST_INSERT_HEAD(&amp->anodetab[AHASH(ap->block)], ap, link);
     92 	mutex_exit(&adosfs_hashlock);
     93 }
     94 
     95 void
     96 adosfs_aremhash(struct anode *ap)
     97 {
     98 	mutex_enter(&adosfs_hashlock);
     99 	LIST_REMOVE(ap, link);
    100 	mutex_exit(&adosfs_hashlock);
    101 }
    102 
    103 int
    104 adosfs_getblktype(struct adosfsmount *amp, struct buf *bp)
    105 {
    106 	if (adoscksum(bp, amp->nwords)) {
    107 #ifdef DIAGNOSTIC
    108 		printf("adosfs: aget: cksum of blk %" PRId64 " failed\n",
    109 		    bp->b_blkno / (amp->bsize / DEV_BSIZE));
    110 #endif
    111 		return (-1);
    112 	}
    113 
    114 	/*
    115 	 * check primary block type
    116 	 */
    117 	if (adoswordn(bp, 0) != BPT_SHORT) {
    118 #ifdef DIAGNOSTIC
    119 		printf("adosfs: aget: bad primary type blk %" PRId64 " (type = %d)\n",
    120 		    bp->b_blkno / (amp->bsize / DEV_BSIZE), adoswordn(bp,0));
    121 #endif
    122 		return (-1);
    123 	}
    124 
    125 	/*
    126 	 * Check secondary block type.
    127 	 */
    128 	switch (adoswordn(bp, amp->nwords - 1)) {
    129 	case BST_RDIR:		/* root block */
    130 		return (AROOT);
    131 	case BST_LDIR:		/* hard link to dir */
    132 		return (ALDIR);
    133 	case BST_UDIR:		/* user dir */
    134 		return (ADIR);
    135 	case BST_LFILE:		/* hard link to file */
    136 		return (ALFILE);
    137 	case BST_FILE:		/* file header */
    138 		return (AFILE);
    139 	case BST_SLINK:		/* soft link */
    140 		return (ASLINK);
    141 	}
    142 
    143 #ifdef DIAGNOSTIC
    144 	printf("adosfs: aget: bad secondary type blk %" PRId64 " (type = %d)\n",
    145 	    bp->b_blkno / (amp->bsize / DEV_BSIZE), adoswordn(bp, amp->nwords - 1));
    146 #endif
    147 
    148 	return (-1);
    149 }
    150 
    151 int
    152 adunixprot(int adprot)
    153 {
    154 	if (adprot & 0xc000ee00) {
    155 		adprot = (adprot & 0xee0e) >> 1;
    156 		return (((adprot & 0x7) << 6) |
    157 			((adprot & 0x700) >> 5) |
    158 			((adprot & 0x7000) >> 12));
    159 	}
    160 	else {
    161 		adprot = (adprot >> 1) & 0x7;
    162 		return((adprot << 6) | (adprot << 3) | adprot);
    163 	}
    164 }
    165 
    166 static int
    167 CapitalChar(int ch, int inter)
    168 {
    169 	if ((ch >= 'a' && ch <= 'z') ||
    170 	    (inter && ch >= 0xe0 && ch <= 0xfe && ch != 0xf7))
    171 		return(ch - ('a' - 'A'));
    172 	return(ch);
    173 }
    174 
    175 u_int32_t
    176 adoscksum(struct buf *bp, int n)
    177 {
    178 	u_int32_t sum, *lp;
    179 
    180 	lp = (u_int32_t *)bp->b_data;
    181 	sum = 0;
    182 
    183 	while (n--)
    184 		sum += ntohl(*lp++);
    185 	return(sum);
    186 }
    187 
    188 int
    189 adoscaseequ(const u_char *name1, const u_char *name2, int len, int inter)
    190 {
    191 	while (len-- > 0)
    192 		if (CapitalChar(*name1++, inter) !=
    193 		    CapitalChar(*name2++, inter))
    194 			return 0;
    195 
    196 	return 1;
    197 }
    198 
    199 int
    200 adoshash(const u_char *nam, int namlen, int nelt, int inter)
    201 {
    202 	int val;
    203 
    204 	val = namlen;
    205 	while (namlen--)
    206 		val = ((val * 13) + CapitalChar(*nam++, inter)) & 0x7ff;
    207 	return(val % nelt);
    208 }
    209 
    210 #ifdef notyet
    211 /*
    212  * datestamp is local time, tv is to be UTC
    213  */
    214 int
    215 dstotv(struct datestamp *dsp, struct timeval *tvp)
    216 {
    217 }
    218 
    219 /*
    220  * tv is UTC, datestamp is to be local time
    221  */
    222 int
    223 tvtods(struct timeval *tvp, struct datestamp *dsp)
    224 {
    225 }
    226 #endif
    227 
    228 #if BYTE_ORDER != BIG_ENDIAN
    229 u_int32_t
    230 adoswordn(struct buf *bp, int wn)
    231 {
    232 	/*
    233 	 * ados stored in network (big endian) order
    234 	 */
    235 	return(ntohl(*((u_int32_t *)bp->b_data + wn)));
    236 }
    237 #endif
    238