1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
/*
* Copyright (c) 1995
* Bill Paul <wpaul@ctr.columbia.edu>. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Bill Paul.
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY Bill Paul AND CONTRIBUTORS ``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 Bill Paul OR CONTRIBUTORS 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.
*
* reverse netgroup map generator program
*
* Written by Bill Paul <wpaul@ctr.columbia.edu>
* Center for Telecommunications Research
* Columbia University, New York City
*/
#ifndef lint
static const char rcsid[] =
"$Id$";
#endif /* not lint */
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "hash.h"
/* Default location of netgroup file. */
char *netgroup = "/etc/netgroup";
/* Stored hash table version of 'forward' netgroup database. */
struct group_entry *gtable[TABLESIZE];
/*
* Stored hash table of 'reverse' netgroup member database
* which we will construct.
*/
struct member_entry *mtable[TABLESIZE];
static void
usage()
{
fprintf (stderr,"usage: revnetgroup -u|-h [-f netgroup file]\n");
exit(1);
}
int
main(argc, argv)
int argc;
char *argv[];
{
FILE *fp;
char readbuf[LINSIZ];
struct group_entry *gcur;
struct member_entry *mcur;
char *host, *user, *domain;
int ch;
char *key = NULL, *data = NULL;
int hosts = -1, i;
if (argc < 2)
usage();
while ((ch = getopt(argc, argv, "uhf:")) != -1) {
switch(ch) {
case 'u':
if (hosts != -1) {
warnx("please use only one of -u or -h");
usage();
}
hosts = 0;
break;
case 'h':
if (hosts != -1) {
warnx("please use only one of -u or -h");
usage();
}
hosts = 1;
break;
case 'f':
netgroup = optarg;
break;
default:
usage();
break;
}
}
if (hosts == -1)
usage();
if (strcmp(netgroup, "-")) {
if ((fp = fopen(netgroup, "r")) == NULL) {
err(1,netgroup);
}
} else {
fp = stdin;
}
/* Stuff all the netgroup names and members into a hash table. */
while (fgets(readbuf, LINSIZ, fp)) {
if (readbuf[0] == '#')
continue;
/* handle backslash line continuations */
while(readbuf[strlen(readbuf) - 2] == '\\') {
fgets((char *)&readbuf[strlen(readbuf) - 2],
sizeof(readbuf) - strlen(readbuf), fp);
}
data = NULL;
if ((data = (char *)(strpbrk(readbuf, " \t") + 1)) < (char *)2)
continue;
key = (char *)&readbuf;
*(data - 1) = '\0';
store(gtable, key, data);
}
fclose(fp);
/*
* Find all members of each netgroup and keep track of which
* group they belong to.
*/
for (i = 0; i < TABLESIZE; i++) {
gcur = gtable[i];
while(gcur) {
__setnetgrent(gcur->key);
while(__getnetgrent(&host, &user, &domain) != 0) {
if (hosts ? host && strcmp(host,"-") : user && strcmp(user, "-"))
mstore(mtable, hosts ? host : user, gcur->key, domain);
}
gcur = gcur->next;
}
}
/* Release resources used by the netgroup parser code. */
__endnetgrent();
/* Spew out the results. */
for (i = 0; i < TABLESIZE; i++) {
mcur = mtable[i];
while(mcur) {
struct grouplist *tmp;
printf ("%s.%s\t", mcur->key, mcur->domain);
tmp = mcur->groups;
while(tmp) {
printf ("%s", tmp->groupname);
tmp = tmp->next;
if (tmp)
printf(",");
}
mcur = mcur->next;
printf ("\n");
}
}
/* Let the OS free all our resources. */
exit(0);
}
|
