Home | History | Annotate | Line # | Download | only in umapfs
umap_subr.c revision 1.19
      1 /*	$NetBSD: umap_subr.c,v 1.19 2001/11/15 09:48:23 lukem Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1999 National Aeronautics & Space Administration
      5  * All rights reserved.
      6  *
      7  * This software was written by William Studenmund of the
      8  * Numerical Aerospace Simulation Facility, NASA Ames Research Center.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. Neither the name of the National Aeronautics & Space Administration
     19  *    nor the names of its contributors may be used to endorse or promote
     20  *    products derived from this software without specific prior written
     21  *    permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE NATIONAL AERONAUTICS & SPACE ADMINISTRATION
     24  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     25  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     26  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE ADMINISTRATION OR CONTRIB-
     27  * UTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
     28  * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     29  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     30  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     31  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     32  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     33  * POSSIBILITY OF SUCH DAMAGE.
     34  */
     35 /*
     36  * Copyright (c) 1992, 1993, 1995
     37  *	The Regents of the University of California.  All rights reserved.
     38  *
     39  * This code is derived from software donated to Berkeley by
     40  * Jan-Simon Pendry.
     41  *
     42  * Redistribution and use in source and binary forms, with or without
     43  * modification, are permitted provided that the following conditions
     44  * are met:
     45  * 1. Redistributions of source code must retain the above copyright
     46  *    notice, this list of conditions and the following disclaimer.
     47  * 2. Redistributions in binary form must reproduce the above copyright
     48  *    notice, this list of conditions and the following disclaimer in the
     49  *    documentation and/or other materials provided with the distribution.
     50  * 3. All advertising materials mentioning features or use of this software
     51  *    must display the following acknowledgement:
     52  *	This product includes software developed by the University of
     53  *	California, Berkeley and its contributors.
     54  * 4. Neither the name of the University nor the names of its contributors
     55  *    may be used to endorse or promote products derived from this software
     56  *    without specific prior written permission.
     57  *
     58  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     59  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     60  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     61  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     62  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     63  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     64  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     65  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     66  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     67  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     68  * SUCH DAMAGE.
     69  *
     70  *	from: Id: lofs_subr.c, v 1.11 1992/05/30 10:05:43 jsp Exp
     71  *	@(#)umap_subr.c	8.9 (Berkeley) 5/14/95
     72  */
     73 
     74 #include <sys/cdefs.h>
     75 __KERNEL_RCSID(0, "$NetBSD: umap_subr.c,v 1.19 2001/11/15 09:48:23 lukem Exp $");
     76 
     77 #include <sys/param.h>
     78 #include <sys/systm.h>
     79 #include <sys/proc.h>
     80 #include <sys/time.h>
     81 #include <sys/vnode.h>
     82 #include <sys/mount.h>
     83 #include <sys/namei.h>
     84 #include <sys/malloc.h>
     85 #include <miscfs/specfs/specdev.h>
     86 #include <miscfs/umapfs/umap.h>
     87 
     88 u_long umap_findid __P((u_long, u_long [][2], int));
     89 int umap_node_alloc __P((struct mount *, struct vnode *,
     90 				struct vnode **));
     91 
     92 /*
     93  * umap_findid is called by various routines in umap_vnodeops.c to
     94  * find a user or group id in a map.
     95  */
     96 u_long
     97 umap_findid(id, map, nentries)
     98 	u_long id;
     99 	u_long map[][2];
    100 	int nentries;
    101 {
    102 	int i;
    103 
    104 	/* Find uid entry in map */
    105 	i = 0;
    106 	while ((i<nentries) && ((map[i][0]) != id))
    107 		i++;
    108 
    109 	if (i < nentries)
    110 		return (map[i][1]);
    111 	else
    112 		return (-1);
    113 
    114 }
    115 
    116 /*
    117  * umap_reverse_findid is called by umap_getattr() in umap_vnodeops.c to
    118  * find a user or group id in a map, in reverse.
    119  */
    120 u_long
    121 umap_reverse_findid(id, map, nentries)
    122 	u_long id;
    123 	u_long map[][2];
    124 	int nentries;
    125 {
    126 	int i;
    127 
    128 	/* Find uid entry in map */
    129 	i = 0;
    130 	while ((i<nentries) && ((map[i][1]) != id))
    131 		i++;
    132 
    133 	if (i < nentries)
    134 		return (map[i][0]);
    135 	else
    136 		return (-1);
    137 
    138 }
    139 
    140 /* umap_mapids maps all of the ids in a credential, both user and group. */
    141 
    142 void
    143 umap_mapids(v_mount, credp)
    144 	struct mount *v_mount;
    145 	struct ucred *credp;
    146 {
    147 	int i, unentries, gnentries;
    148 	uid_t uid;
    149 	gid_t gid;
    150 	u_long (*usermap)[2], (*groupmap)[2];
    151 
    152 	if (credp == NOCRED)
    153 		return;
    154 
    155 	unentries =  MOUNTTOUMAPMOUNT(v_mount)->info_nentries;
    156 	usermap =  MOUNTTOUMAPMOUNT(v_mount)->info_mapdata;
    157 	gnentries =  MOUNTTOUMAPMOUNT(v_mount)->info_gnentries;
    158 	groupmap =  MOUNTTOUMAPMOUNT(v_mount)->info_gmapdata;
    159 
    160 	/* Find uid entry in map */
    161 
    162 	uid = (uid_t) umap_findid(credp->cr_uid, usermap, unentries);
    163 
    164 	if (uid != -1)
    165 		credp->cr_uid = uid;
    166 	else
    167 		credp->cr_uid = (uid_t) NOBODY;
    168 
    169 #if 1
    170 	/* cr_gid is the same as cr_groups[0] in 4BSD, but not in NetBSD */
    171 
    172 	/* Find gid entry in map */
    173 
    174 	gid = (gid_t) umap_findid(credp->cr_gid, groupmap, gnentries);
    175 
    176 	if (gid != -1)
    177 		credp->cr_gid = gid;
    178 	else
    179 		credp->cr_gid = NULLGROUP;
    180 #endif
    181 
    182 	/* Now we must map each of the set of groups in the cr_groups
    183 		structure. */
    184 
    185 	for(i=0; i < credp->cr_ngroups; i++) {
    186 		gid = (gid_t) umap_findid(credp->cr_groups[i],
    187 					  groupmap, gnentries);
    188 
    189 		if (gid != -1)
    190 			credp->cr_groups[i] = gid;
    191 		else
    192 			credp->cr_groups[i] = NULLGROUP;
    193 	}
    194 }
    195