blob: e73f62b22fdf29bfa6ac29a54f7abc8aef5d87cf [file] [log] [blame]
Damien Millerd7834352006-08-05 12:39:39 +10001/* $OpenBSD: groupaccess.c,v 1.12 2006/08/03 03:34:42 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>
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>
Damien Miller427a1d52006-07-10 20:20:33 +100034
Kevin Steves886b06c2001-01-14 00:35:19 +000035#include "xmalloc.h"
Damien Millerd7834352006-08-05 12:39:39 +100036#include "groupaccess.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000037#include "match.h"
Ben Lindstrom226cfa02001-01-22 05:34:40 +000038#include "log.h"
Kevin Steves886b06c2001-01-14 00:35:19 +000039
40static int ngroups;
Damien Millera811d9a2004-02-24 13:05:11 +110041static char **groups_byname;
Kevin Steves886b06c2001-01-14 00:35:19 +000042
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000043/*
44 * Initialize group access list for user with primary (base) and
45 * supplementary groups. Return the number of groups in the list.
46 */
Kevin Steves886b06c2001-01-14 00:35:19 +000047int
48ga_init(const char *user, gid_t base)
49{
Damien Millera811d9a2004-02-24 13:05:11 +110050 gid_t *groups_bygid;
Kevin Steves886b06c2001-01-14 00:35:19 +000051 int i, j;
52 struct group *gr;
53
54 if (ngroups > 0)
55 ga_free();
56
Damien Millera811d9a2004-02-24 13:05:11 +110057 ngroups = NGROUPS_MAX;
58#if defined(HAVE_SYSCONF) && defined(_SC_NGROUPS_MAX)
59 ngroups = MAX(NGROUPS_MAX, sysconf(_SC_NGROUPS_MAX));
60#endif
61
Darren Tuckerd8093e42006-05-04 16:24:34 +100062 groups_bygid = xcalloc(ngroups, sizeof(*groups_bygid));
63 groups_byname = xcalloc(ngroups, sizeof(*groups_byname));
Damien Millera811d9a2004-02-24 13:05:11 +110064
Kevin Steves886b06c2001-01-14 00:35:19 +000065 if (getgrouplist(user, base, groups_bygid, &ngroups) == -1)
Damien Miller996acd22003-04-09 20:59:48 +100066 logit("getgrouplist: groups list too small");
Kevin Steves886b06c2001-01-14 00:35:19 +000067 for (i = 0, j = 0; i < ngroups; i++)
68 if ((gr = getgrgid(groups_bygid[i])) != NULL)
69 groups_byname[j++] = xstrdup(gr->gr_name);
Damien Millera811d9a2004-02-24 13:05:11 +110070 xfree(groups_bygid);
Kevin Steves886b06c2001-01-14 00:35:19 +000071 return (ngroups = j);
72}
73
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000074/*
75 * Return 1 if one of user's groups is contained in groups.
76 * Return 0 otherwise. Use match_pattern() for string comparison.
77 */
Kevin Steves886b06c2001-01-14 00:35:19 +000078int
79ga_match(char * const *groups, int n)
80{
81 int i, j;
82
83 for (i = 0; i < ngroups; i++)
84 for (j = 0; j < n; j++)
85 if (match_pattern(groups_byname[i], groups[j]))
86 return 1;
87 return 0;
88}
89
Ben Lindstrom4cc240d2001-07-04 04:46:56 +000090/*
91 * Free memory allocated for group access list.
92 */
Kevin Steves886b06c2001-01-14 00:35:19 +000093void
94ga_free(void)
95{
96 int i;
97
98 if (ngroups > 0) {
99 for (i = 0; i < ngroups; i++)
100 xfree(groups_byname[i]);
101 ngroups = 0;
Damien Millera811d9a2004-02-24 13:05:11 +1100102 xfree(groups_byname);
Kevin Steves886b06c2001-01-14 00:35:19 +0000103 }
104}