Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	usr.bin/ssh/sshd/../groupaccess.c	Lines:	0	23	0.0 %
Date:	2017-11-13	Branches:	0	23	0.0 %


/* $OpenBSD: groupaccess.c,v 1.16 2015/05/04 06:10:48 djm Exp $ */
/*
 * Copyright (c) 2001 Kevin Steves.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <sys/types.h>

#include <grp.h>
#include <unistd.h>
#include <stdarg.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>

#include "xmalloc.h"
#include "groupaccess.h"
#include "match.h"
#include "log.h"

static int ngroups;
static char *groups_byname[NGROUPS_MAX + 1];	/* +1 for base/primary group */

/*
 * Initialize group access list for user with primary (base) and
 * supplementary groups.  Return the number of groups in the list.
 */
int
ga_init(const char *user, gid_t base)
{
	gid_t groups_bygid[NGROUPS_MAX + 1];
	int i, j;
	struct group *gr;

	if (ngroups > 0)
		ga_free();

	ngroups = sizeof(groups_bygid) / sizeof(gid_t);
	if (getgrouplist(user, base, groups_bygid, &ngroups) == -1)
		logit("getgrouplist: groups list too small");
	for (i = 0, j = 0; i < ngroups; i++)
		if ((gr = getgrgid(groups_bygid[i])) != NULL)
			groups_byname[j++] = xstrdup(gr->gr_name);
	return (ngroups = j);
}

/*
 * Return 1 if one of user's groups is contained in groups.
 * Return 0 otherwise.  Use match_pattern() for string comparison.
 */
int
ga_match(char * const *groups, int n)
{
	int i, j;

	for (i = 0; i < ngroups; i++)
		for (j = 0; j < n; j++)
			if (match_pattern(groups_byname[i], groups[j]))
				return 1;
	return 0;
}

/*
 * Return 1 if one of user's groups matches group_pattern list.
 * Return 0 on negated or no match.
 */
int
ga_match_pattern_list(const char *group_pattern)
{
	int i, found = 0;

	for (i = 0; i < ngroups; i++) {
		switch (match_pattern_list(groups_byname[i], group_pattern, 0)) {
		case -1:
			return 0;	/* Negated match wins */
		case 0:
			continue;
		case 1:
			found = 1;
		}
	}
	return found;
}

/*
 * Free memory allocated for group access list.
 */
void
ga_free(void)
{
	int i;

	if (ngroups > 0) {
		for (i = 0; i < ngroups; i++)
			free(groups_byname[i]);
		ngroups = 0;
	}
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: groupaccess.c,v 1.16 2015/05/04 06:10:48 djm 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 <sys/types.h>
27
28			#include <grp.h>
29			#include <unistd.h>
30			#include <stdarg.h>
31			#include <stdlib.h>
32			#include <string.h>
33			#include <limits.h>
34
35			#include "xmalloc.h"
36			#include "groupaccess.h"
37			#include "match.h"
38			#include "log.h"
39
40			static int ngroups;
41			static char groups_byname[NGROUPS_MAX + 1]; / +1 for base/primary group */
42
43			/*
44			* Initialize group access list for user with primary (base) and
45			* supplementary groups. Return the number of groups in the list.
46			*/
47			int
48			ga_init(const char *user, gid_t base)
49			{
50			gid_t groups_bygid[NGROUPS_MAX + 1];
51			int i, j;
52			struct group *gr;
53
54			if (ngroups > 0)
55			ga_free();
56
57			ngroups = sizeof(groups_bygid) / sizeof(gid_t);
58			if (getgrouplist(user, base, groups_bygid, &ngroups) == -1)
59			logit("getgrouplist: groups list too small");
60			for (i = 0, j = 0; i < ngroups; i++)
61			if ((gr = getgrgid(groups_bygid[i])) != NULL)
62			groups_byname[j++] = xstrdup(gr->gr_name);
63			return (ngroups = j);
64			}
65
66			/*
67			* Return 1 if one of user's groups is contained in groups.
68			* Return 0 otherwise. Use match_pattern() for string comparison.
69			*/
70			int
71			ga_match(char * const *groups, int n)
72			{
73			int i, j;
74
75			for (i = 0; i < ngroups; i++)
76			for (j = 0; j < n; j++)
77			if (match_pattern(groups_byname[i], groups[j]))
78			return 1;
79			return 0;
80			}
81
82			/*
83			* Return 1 if one of user's groups matches group_pattern list.
84			* Return 0 on negated or no match.
85			*/
86			int
87			ga_match_pattern_list(const char *group_pattern)
88			{
89			int i, found = 0;
90
91			for (i = 0; i < ngroups; i++) {
92			switch (match_pattern_list(groups_byname[i], group_pattern, 0)) {
93			case -1:
94			return 0; /* Negated match wins */
95			case 0:
96			continue;
97			case 1:
98			found = 1;
99			}
100			}
101			return found;
102			}
103
104			/*
105			* Free memory allocated for group access list.
106			*/
107			void
108			ga_free(void)
109			{
110			int i;
111
112			if (ngroups > 0) {
113			for (i = 0; i < ngroups; i++)
114			free(groups_byname[i]);
115			ngroups = 0;
116			}
117			}