1/*
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. 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 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
| 1/*
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. 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 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
|
40
41/*
42 * get credential
43 */
44#include <sys/types.h>
45#include <string.h>
46#include <grp.h>
47
48int
49getgrouplist(uname, agroup, groups, grpcnt)
50 const char *uname;
51 gid_t agroup;
52 gid_t *groups;
53 int *grpcnt;
54{
55 struct group *grp;
56 int i, ngroups;
57 int ret, maxgroups;
58
59 ret = 0;
60 ngroups = 0;
61 maxgroups = *grpcnt;
62 /*
63 * When installing primary group, duplicate it;
64 * the first element of groups is the effective gid
65 * and will be overwritten when a setgid file is executed.
66 */
67 groups[ngroups++] = agroup;
68 if (maxgroups > 1)
69 groups[ngroups++] = agroup;
70 /*
71 * Scan the group file to find additional groups.
72 */
73 setgrent();
74 while (grp = getgrent()) {
75 for (i = 0; i < ngroups; i++) {
76 if (grp->gr_gid == groups[i])
77 goto skip;
78 }
79 for (i = 0; grp->gr_mem[i]; i++) {
80 if (!strcmp(grp->gr_mem[i], uname)) {
81 if (ngroups >= maxgroups) {
82 ret = -1;
83 break;
84 }
85 groups[ngroups++] = grp->gr_gid;
86 break;
87 }
88 }
89skip:
90 }
91 endgrent();
92 *grpcnt = ngroups;
93 return (ret);
94}
| 39
40/*
41 * get credential
42 */
43#include <sys/types.h>
44#include <string.h>
45#include <grp.h>
46
47int
48getgrouplist(uname, agroup, groups, grpcnt)
49 const char *uname;
50 gid_t agroup;
51 gid_t *groups;
52 int *grpcnt;
53{
54 struct group *grp;
55 int i, ngroups;
56 int ret, maxgroups;
57
58 ret = 0;
59 ngroups = 0;
60 maxgroups = *grpcnt;
61 /*
62 * When installing primary group, duplicate it;
63 * the first element of groups is the effective gid
64 * and will be overwritten when a setgid file is executed.
65 */
66 groups[ngroups++] = agroup;
67 if (maxgroups > 1)
68 groups[ngroups++] = agroup;
69 /*
70 * Scan the group file to find additional groups.
71 */
72 setgrent();
73 while (grp = getgrent()) {
74 for (i = 0; i < ngroups; i++) {
75 if (grp->gr_gid == groups[i])
76 goto skip;
77 }
78 for (i = 0; grp->gr_mem[i]; i++) {
79 if (!strcmp(grp->gr_mem[i], uname)) {
80 if (ngroups >= maxgroups) {
81 ret = -1;
82 break;
83 }
84 groups[ngroups++] = grp->gr_gid;
85 break;
86 }
87 }
88skip:
89 }
90 endgrent();
91 *grpcnt = ngroups;
92 return (ret);
93}
|