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