1*7c478bd9Sstevel@tonic-gate /* 2*7c478bd9Sstevel@tonic-gate * Copyright (c) 2001 Kevin Steves. All rights reserved. 3*7c478bd9Sstevel@tonic-gate * 4*7c478bd9Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without 5*7c478bd9Sstevel@tonic-gate * modification, are permitted provided that the following conditions 6*7c478bd9Sstevel@tonic-gate * are met: 7*7c478bd9Sstevel@tonic-gate * 1. Redistributions of source code must retain the above copyright 8*7c478bd9Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer. 9*7c478bd9Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright 10*7c478bd9Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer in the 11*7c478bd9Sstevel@tonic-gate * documentation and/or other materials provided with the distribution. 12*7c478bd9Sstevel@tonic-gate * 13*7c478bd9Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 14*7c478bd9Sstevel@tonic-gate * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 15*7c478bd9Sstevel@tonic-gate * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 16*7c478bd9Sstevel@tonic-gate * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 17*7c478bd9Sstevel@tonic-gate * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 18*7c478bd9Sstevel@tonic-gate * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 19*7c478bd9Sstevel@tonic-gate * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 20*7c478bd9Sstevel@tonic-gate * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 21*7c478bd9Sstevel@tonic-gate * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 22*7c478bd9Sstevel@tonic-gate * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 23*7c478bd9Sstevel@tonic-gate */ 24*7c478bd9Sstevel@tonic-gate 25*7c478bd9Sstevel@tonic-gate #include "includes.h" 26*7c478bd9Sstevel@tonic-gate RCSID("$OpenBSD: groupaccess.c,v 1.5 2002/03/04 17:27:39 stevesk Exp $"); 27*7c478bd9Sstevel@tonic-gate 28*7c478bd9Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI" 29*7c478bd9Sstevel@tonic-gate 30*7c478bd9Sstevel@tonic-gate #include "groupaccess.h" 31*7c478bd9Sstevel@tonic-gate #include "xmalloc.h" 32*7c478bd9Sstevel@tonic-gate #include "match.h" 33*7c478bd9Sstevel@tonic-gate #include "log.h" 34*7c478bd9Sstevel@tonic-gate 35*7c478bd9Sstevel@tonic-gate static int ngroups; 36*7c478bd9Sstevel@tonic-gate static char *groups_byname[NGROUPS_MAX + 1]; /* +1 for base/primary group */ 37*7c478bd9Sstevel@tonic-gate 38*7c478bd9Sstevel@tonic-gate /* 39*7c478bd9Sstevel@tonic-gate * Initialize group access list for user with primary (base) and 40*7c478bd9Sstevel@tonic-gate * supplementary groups. Return the number of groups in the list. 41*7c478bd9Sstevel@tonic-gate */ 42*7c478bd9Sstevel@tonic-gate int 43*7c478bd9Sstevel@tonic-gate ga_init(const char *user, gid_t base) 44*7c478bd9Sstevel@tonic-gate { 45*7c478bd9Sstevel@tonic-gate gid_t groups_bygid[NGROUPS_MAX + 1]; 46*7c478bd9Sstevel@tonic-gate int i, j; 47*7c478bd9Sstevel@tonic-gate struct group *gr; 48*7c478bd9Sstevel@tonic-gate 49*7c478bd9Sstevel@tonic-gate if (ngroups > 0) 50*7c478bd9Sstevel@tonic-gate ga_free(); 51*7c478bd9Sstevel@tonic-gate 52*7c478bd9Sstevel@tonic-gate ngroups = sizeof(groups_bygid) / sizeof(gid_t); 53*7c478bd9Sstevel@tonic-gate if (getgrouplist(user, base, groups_bygid, &ngroups) == -1) 54*7c478bd9Sstevel@tonic-gate log("getgrouplist: groups list too small"); 55*7c478bd9Sstevel@tonic-gate for (i = 0, j = 0; i < ngroups; i++) 56*7c478bd9Sstevel@tonic-gate if ((gr = getgrgid(groups_bygid[i])) != NULL) 57*7c478bd9Sstevel@tonic-gate groups_byname[j++] = xstrdup(gr->gr_name); 58*7c478bd9Sstevel@tonic-gate return (ngroups = j); 59*7c478bd9Sstevel@tonic-gate } 60*7c478bd9Sstevel@tonic-gate 61*7c478bd9Sstevel@tonic-gate /* 62*7c478bd9Sstevel@tonic-gate * Return 1 if one of user's groups is contained in groups. 63*7c478bd9Sstevel@tonic-gate * Return 0 otherwise. Use match_pattern() for string comparison. 64*7c478bd9Sstevel@tonic-gate */ 65*7c478bd9Sstevel@tonic-gate int 66*7c478bd9Sstevel@tonic-gate ga_match(char * const *groups, int n) 67*7c478bd9Sstevel@tonic-gate { 68*7c478bd9Sstevel@tonic-gate int i, j; 69*7c478bd9Sstevel@tonic-gate 70*7c478bd9Sstevel@tonic-gate for (i = 0; i < ngroups; i++) 71*7c478bd9Sstevel@tonic-gate for (j = 0; j < n; j++) 72*7c478bd9Sstevel@tonic-gate if (match_pattern(groups_byname[i], groups[j])) 73*7c478bd9Sstevel@tonic-gate return 1; 74*7c478bd9Sstevel@tonic-gate return 0; 75*7c478bd9Sstevel@tonic-gate } 76*7c478bd9Sstevel@tonic-gate 77*7c478bd9Sstevel@tonic-gate /* 78*7c478bd9Sstevel@tonic-gate * Free memory allocated for group access list. 79*7c478bd9Sstevel@tonic-gate */ 80*7c478bd9Sstevel@tonic-gate void 81*7c478bd9Sstevel@tonic-gate ga_free(void) 82*7c478bd9Sstevel@tonic-gate { 83*7c478bd9Sstevel@tonic-gate int i; 84*7c478bd9Sstevel@tonic-gate 85*7c478bd9Sstevel@tonic-gate if (ngroups > 0) { 86*7c478bd9Sstevel@tonic-gate for (i = 0; i < ngroups; i++) 87*7c478bd9Sstevel@tonic-gate xfree(groups_byname[i]); 88*7c478bd9Sstevel@tonic-gate ngroups = 0; 89*7c478bd9Sstevel@tonic-gate } 90*7c478bd9Sstevel@tonic-gate } 91