blob: 2381aeb15b57edf4deefacd0084ba5697a522149 [file] [log] [blame]
Darren Tuckerb03fd022008-07-04 13:51:12 +10001/* $OpenBSD: groupaccess.c,v 1.13 2008/07/04 03:44:59 djm 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>
Damien Miller8dbffe72006-08-05 11:02:17 +100029#include <sys/param.h>
Damien Miller427a1d52006-07-10 20:20:33 +100030
31#include <grp.h>
Damien Millere6b3b612006-07-24 14:01:23 +100032#include <unistd.h>
Damien Millerd7834352006-08-05 12:39:39 +100033#include <stdarg.h>
Darren Tuckerb03fd022008-07-04 13:51:12 +100034#include <string.h>
Damien Miller427a1d52006-07-10 20:20:33 +100035
Kevin Steves886b06c2001-01-14 00:35:19 +000036#include "xmalloc.h"
Damien Millerd7834352006-08-05 12:39:39 +100037#include "groupaccess.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000038#include "match.h"
Ben Lindstrom226cfa02001-01-22 05:34:40 +000039#include "log.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000040
41static int ngroups;
Damien Millera811d9a2004-02-24 13:05:11 +110042static char **groups_byname;
Kevin Steves886b06c2001-01-14 00:35:19 +000043
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000044/*
45 * Initialize group access list for user with primary (base) and
46 * supplementary groups. Return the number of groups in the list.
47 */
Kevin Steves886b06c2001-01-14 00:35:19 +000048int
49ga_init(const char *user, gid_t base)
50{
Damien Millera811d9a2004-02-24 13:05:11 +110051 gid_t *groups_bygid;
Kevin Steves886b06c2001-01-14 00:35:19 +000052 int i, j;
53 struct group *gr;
54
55 if (ngroups > 0)
56 ga_free();
57
Damien Millera811d9a2004-02-24 13:05:11 +110058 ngroups = NGROUPS_MAX;
59#if defined(HAVE_SYSCONF) && defined(_SC_NGROUPS_MAX)
60 ngroups = MAX(NGROUPS_MAX, sysconf(_SC_NGROUPS_MAX));
61#endif
62
Darren Tuckerd8093e42006-05-04 16:24:34 +100063 groups_bygid = xcalloc(ngroups, sizeof(*groups_bygid));
64 groups_byname = xcalloc(ngroups, sizeof(*groups_byname));
Damien Millera811d9a2004-02-24 13:05:11 +110065
Kevin Steves886b06c2001-01-14 00:35:19 +000066 if (getgrouplist(user, base, groups_bygid, &ngroups) == -1)
Damien Miller996acd22003-04-09 20:59:48 +100067 logit("getgrouplist: groups list too small");
Kevin Steves886b06c2001-01-14 00:35:19 +000068 for (i = 0, j = 0; i < ngroups; i++)
69 if ((gr = getgrgid(groups_bygid[i])) != NULL)
70 groups_byname[j++] = xstrdup(gr->gr_name);
Damien Millera811d9a2004-02-24 13:05:11 +110071 xfree(groups_bygid);
Kevin Steves886b06c2001-01-14 00:35:19 +000072 return (ngroups = j);
73}
74
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000075/*
76 * Return 1 if one of user's groups is contained in groups.
77 * Return 0 otherwise. Use match_pattern() for string comparison.
78 */
Kevin Steves886b06c2001-01-14 00:35:19 +000079int
80ga_match(char * const *groups, int n)
81{
82 int i, j;
83
84 for (i = 0; i < ngroups; i++)
85 for (j = 0; j < n; j++)
86 if (match_pattern(groups_byname[i], groups[j]))
87 return 1;
88 return 0;
89}
90
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000091/*
Darren Tuckerb03fd022008-07-04 13:51:12 +100092 * Return 1 if one of user's groups matches group_pattern list.
93 * Return 0 on negated or no match.
94 */
95int
96ga_match_pattern_list(const char *group_pattern)
97{
98 int i, found = 0;
99 size_t len = strlen(group_pattern);
100
101 for (i = 0; i < ngroups; i++) {
102 switch (match_pattern_list(groups_byname[i],
103 group_pattern, len, 0)) {
104 case -1:
105 return 0; /* Negated match wins */
106 case 0:
107 continue;
108 case 1:
109 found = 1;
110 }
111 }
112 return found;
113}
114
115/*
Ben Lindstrom4cc240d2001-07-04 04:46:56 +0000116 * Free memory allocated for group access list.
117 */
Kevin Steves886b06c2001-01-14 00:35:19 +0000118void
119ga_free(void)
120{
121 int i;
122
123 if (ngroups > 0) {
124 for (i = 0; i < ngroups; i++)
125 xfree(groups_byname[i]);
126 ngroups = 0;
Damien Millera811d9a2004-02-24 13:05:11 +1100127 xfree(groups_byname);
Kevin Steves886b06c2001-01-14 00:35:19 +0000128 }
129}