blob: 2b7117b70d5a5eac6ed85ece6e6e3a85d9042b64 [file] [log] [blame]
Damien Miller427a1d52006-07-10 20:20:33 +10001/* $OpenBSD: groupaccess.c,v 1.9 2006/07/02 22:45:59 stevesk Exp $ */
Kevin Steves886b06c2001-01-14 00:35:19 +00002/*
3 * Copyright (c) 2001 Kevin Steves. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#include "includes.h"
27
Damien Miller427a1d52006-07-10 20:20:33 +100028#include <sys/types.h>
29
30#include <grp.h>
31
Kevin Steves886b06c2001-01-14 00:35:19 +000032#include "groupaccess.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000033#include "xmalloc.h"
34#include "match.h"
Ben Lindstrom226cfa02001-01-22 05:34:40 +000035#include "log.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000036
37static int ngroups;
Damien Millera811d9a2004-02-24 13:05:11 +110038static char **groups_byname;
Kevin Steves886b06c2001-01-14 00:35:19 +000039
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000040/*
41 * Initialize group access list for user with primary (base) and
42 * supplementary groups. Return the number of groups in the list.
43 */
Kevin Steves886b06c2001-01-14 00:35:19 +000044int
45ga_init(const char *user, gid_t base)
46{
Damien Millera811d9a2004-02-24 13:05:11 +110047 gid_t *groups_bygid;
Kevin Steves886b06c2001-01-14 00:35:19 +000048 int i, j;
49 struct group *gr;
50
51 if (ngroups > 0)
52 ga_free();
53
Damien Millera811d9a2004-02-24 13:05:11 +110054 ngroups = NGROUPS_MAX;
55#if defined(HAVE_SYSCONF) && defined(_SC_NGROUPS_MAX)
56 ngroups = MAX(NGROUPS_MAX, sysconf(_SC_NGROUPS_MAX));
57#endif
58
Darren Tuckerd8093e42006-05-04 16:24:34 +100059 groups_bygid = xcalloc(ngroups, sizeof(*groups_bygid));
60 groups_byname = xcalloc(ngroups, sizeof(*groups_byname));
Damien Millera811d9a2004-02-24 13:05:11 +110061
Kevin Steves886b06c2001-01-14 00:35:19 +000062 if (getgrouplist(user, base, groups_bygid, &ngroups) == -1)
Damien Miller996acd22003-04-09 20:59:48 +100063 logit("getgrouplist: groups list too small");
Kevin Steves886b06c2001-01-14 00:35:19 +000064 for (i = 0, j = 0; i < ngroups; i++)
65 if ((gr = getgrgid(groups_bygid[i])) != NULL)
66 groups_byname[j++] = xstrdup(gr->gr_name);
Damien Millera811d9a2004-02-24 13:05:11 +110067 xfree(groups_bygid);
Kevin Steves886b06c2001-01-14 00:35:19 +000068 return (ngroups = j);
69}
70
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000071/*
72 * Return 1 if one of user's groups is contained in groups.
73 * Return 0 otherwise. Use match_pattern() for string comparison.
74 */
Kevin Steves886b06c2001-01-14 00:35:19 +000075int
76ga_match(char * const *groups, int n)
77{
78 int i, j;
79
80 for (i = 0; i < ngroups; i++)
81 for (j = 0; j < n; j++)
82 if (match_pattern(groups_byname[i], groups[j]))
83 return 1;
84 return 0;
85}
86
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000087/*
88 * Free memory allocated for group access list.
89 */
Kevin Steves886b06c2001-01-14 00:35:19 +000090void
91ga_free(void)
92{
93 int i;
94
95 if (ngroups > 0) {
96 for (i = 0; i < ngroups; i++)
97 xfree(groups_byname[i]);
98 ngroups = 0;
Damien Millera811d9a2004-02-24 13:05:11 +110099 xfree(groups_byname);
Kevin Steves886b06c2001-01-14 00:35:19 +0000100 }
101}