blob: 4fca04471b09c673a6030278bcccb69710680df2 [file] [log] [blame]
deraadt@openbsd.org087266e2015-01-20 23:14:00 +00001/* $OpenBSD: groupaccess.c,v 1.15 2015/01/20 23:14:00 deraadt 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>
Damien Millere6b3b612006-07-24 14:01:23 +100031#include <unistd.h>
Damien Millerd7834352006-08-05 12:39:39 +100032#include <stdarg.h>
Darren Tuckera627d422013-06-02 07:31:17 +100033#include <stdlib.h>
Darren Tuckerb03fd022008-07-04 13:51:12 +100034#include <string.h>
deraadt@openbsd.org087266e2015-01-20 23:14:00 +000035#include <limits.h>
Damien Miller427a1d52006-07-10 20:20:33 +100036
Kevin Steves886b06c2001-01-14 00:35:19 +000037#include "xmalloc.h"
Damien Millerd7834352006-08-05 12:39:39 +100038#include "groupaccess.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000039#include "match.h"
Ben Lindstrom226cfa02001-01-22 05:34:40 +000040#include "log.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000041
42static int ngroups;
Damien Millera811d9a2004-02-24 13:05:11 +110043static char **groups_byname;
Kevin Steves886b06c2001-01-14 00:35:19 +000044
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000045/*
46 * Initialize group access list for user with primary (base) and
47 * supplementary groups. Return the number of groups in the list.
48 */
Kevin Steves886b06c2001-01-14 00:35:19 +000049int
50ga_init(const char *user, gid_t base)
51{
Damien Millera811d9a2004-02-24 13:05:11 +110052 gid_t *groups_bygid;
Kevin Steves886b06c2001-01-14 00:35:19 +000053 int i, j;
54 struct group *gr;
55
56 if (ngroups > 0)
57 ga_free();
58
Damien Millera811d9a2004-02-24 13:05:11 +110059 ngroups = NGROUPS_MAX;
60#if defined(HAVE_SYSCONF) && defined(_SC_NGROUPS_MAX)
61 ngroups = MAX(NGROUPS_MAX, sysconf(_SC_NGROUPS_MAX));
62#endif
63
Darren Tuckerd8093e42006-05-04 16:24:34 +100064 groups_bygid = xcalloc(ngroups, sizeof(*groups_bygid));
65 groups_byname = xcalloc(ngroups, sizeof(*groups_byname));
Damien Millera811d9a2004-02-24 13:05:11 +110066
Kevin Steves886b06c2001-01-14 00:35:19 +000067 if (getgrouplist(user, base, groups_bygid, &ngroups) == -1)
Damien Miller996acd22003-04-09 20:59:48 +100068 logit("getgrouplist: groups list too small");
Kevin Steves886b06c2001-01-14 00:35:19 +000069 for (i = 0, j = 0; i < ngroups; i++)
70 if ((gr = getgrgid(groups_bygid[i])) != NULL)
71 groups_byname[j++] = xstrdup(gr->gr_name);
Darren Tuckerf60845f2013-06-02 08:07:31 +100072 free(groups_bygid);
Kevin Steves886b06c2001-01-14 00:35:19 +000073 return (ngroups = j);
74}
75
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000076/*
77 * Return 1 if one of user's groups is contained in groups.
78 * Return 0 otherwise. Use match_pattern() for string comparison.
79 */
Kevin Steves886b06c2001-01-14 00:35:19 +000080int
81ga_match(char * const *groups, int n)
82{
83 int i, j;
84
85 for (i = 0; i < ngroups; i++)
86 for (j = 0; j < n; j++)
87 if (match_pattern(groups_byname[i], groups[j]))
88 return 1;
89 return 0;
90}
91
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000092/*
Darren Tuckerb03fd022008-07-04 13:51:12 +100093 * Return 1 if one of user's groups matches group_pattern list.
94 * Return 0 on negated or no match.
95 */
96int
97ga_match_pattern_list(const char *group_pattern)
98{
99 int i, found = 0;
100 size_t len = strlen(group_pattern);
101
102 for (i = 0; i < ngroups; i++) {
103 switch (match_pattern_list(groups_byname[i],
104 group_pattern, len, 0)) {
105 case -1:
106 return 0; /* Negated match wins */
107 case 0:
108 continue;
109 case 1:
110 found = 1;
111 }
112 }
113 return found;
114}
115
116/*
Ben Lindstrom4cc240d2001-07-04 04:46:56 +0000117 * Free memory allocated for group access list.
118 */
Kevin Steves886b06c2001-01-14 00:35:19 +0000119void
120ga_free(void)
121{
122 int i;
123
124 if (ngroups > 0) {
125 for (i = 0; i < ngroups; i++)
Darren Tuckera627d422013-06-02 07:31:17 +1000126 free(groups_byname[i]);
Kevin Steves886b06c2001-01-14 00:35:19 +0000127 ngroups = 0;
Darren Tuckerf60845f2013-06-02 08:07:31 +1000128 free(groups_byname);
Kevin Steves886b06c2001-01-14 00:35:19 +0000129 }
130}