| | 1 | /* $OpenBSD: groupaccess.c,v 1.11 2006/07/26 02:35:17 stevesk Exp $ */ |
| | 2 | /* |
| | 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 | |
| | 28 | #include <sys/types.h> |
| | 29 | #include <sys/param.h> |
| | 30 | |
| | 31 | #include <grp.h> |
| | 32 | #include <unistd.h> |
| | 33 | |
| | 34 | #include "groupaccess.h" |
| | 35 | #include "xmalloc.h" |
| | 36 | #include "match.h" |
| | 37 | #include "log.h" |
| | 38 | |
| | 39 | static int ngroups; |
| | 40 | static char **groups_byname; |
| | 41 | |
| | 42 | /* |
| | 43 | * Initialize group access list for user with primary (base) and |
| | 44 | * supplementary groups. Return the number of groups in the list. |
| | 45 | */ |
| | 46 | int |
| | 47 | ga_init(const char *user, gid_t base) |
| | 48 | { |
| | 49 | gid_t *groups_bygid; |
| | 50 | int i, j; |
| | 51 | struct group *gr; |
| | 52 | |
| | 53 | if (ngroups > 0) |
| | 54 | ga_free(); |
| | 55 | |
| | 56 | ngroups = NGROUPS_MAX; |
| | 57 | #if defined(HAVE_SYSCONF) && defined(_SC_NGROUPS_MAX) |
| | 58 | ngroups = MAX(NGROUPS_MAX, sysconf(_SC_NGROUPS_MAX)); |
| | 59 | #endif |
| | 60 | |
| | 61 | groups_bygid = xcalloc(ngroups, sizeof(*groups_bygid)); |
| | 62 | groups_byname = xcalloc(ngroups, sizeof(*groups_byname)); |
| | 63 | |
| | 64 | if (getgrouplist(user, base, groups_bygid, &ngroups) == -1) |
| | 65 | logit("getgrouplist: groups list too small"); |
| | 66 | for (i = 0, j = 0; i < ngroups; i++) |
| | 67 | if ((gr = getgrgid(groups_bygid[i])) != NULL) |
| | 68 | groups_byname[j++] = xstrdup(gr->gr_name); |
| | 69 | xfree(groups_bygid); |
| | 70 | return (ngroups = j); |
| | 71 | } |
| | 72 | |
| | 73 | /* |
| | 74 | * Return 1 if one of user's groups is contained in groups. |
| | 75 | * Return 0 otherwise. Use match_pattern() for string comparison. |
| | 76 | */ |
| | 77 | int |
| | 78 | ga_match(char * const *groups, int n) |
| | 79 | { |
| | 80 | int i, j; |
| | 81 | |
| | 82 | for (i = 0; i < ngroups; i++) |
| | 83 | for (j = 0; j < n; j++) |
| | 84 | if (match_pattern(groups_byname[i], groups[j])) |
| | 85 | return 1; |
| | 86 | return 0; |
| | 87 | } |
| | 88 | |
| | 89 | /* |
| | 90 | * Free memory allocated for group access list. |
| | 91 | */ |
| | 92 | void |
| | 93 | ga_free(void) |
| | 94 | { |
| | 95 | int i; |
| | 96 | |
| | 97 | if (ngroups > 0) { |
| | 98 | for (i = 0; i < ngroups; i++) |
| | 99 | xfree(groups_byname[i]); |
| | 100 | ngroups = 0; |
| | 101 | xfree(groups_byname); |
| | 102 | } |
| | 103 | } |
andersk / openssh.git / blame_incremental