This will make a number of things easier in the future, as well as (finally!) avoiding the Id-smashing problem which has plagued developers for so long. Boy, I'm glad we're not using sup anymore. This update would have been insane otherwise.
292 lines
7.0 KiB
C
292 lines
7.0 KiB
C
/*
|
|
* Copyright (c) 1995, 1996
|
|
* 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.
|
|
*
|
|
* netid map generator program
|
|
*
|
|
* Written by Bill Paul <wpaul@ctr.columbia.edu>
|
|
* Center for Telecommunications Research
|
|
* Columbia University, New York City
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <rpc/rpc.h>
|
|
#include <rpcsvc/yp_prot.h>
|
|
#include <rpcsvc/ypclnt.h>
|
|
|
|
#include <err.h>
|
|
#include <grp.h>
|
|
#include <pwd.h>
|
|
#include <netdb.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "hash.h"
|
|
|
|
#ifndef lint
|
|
static const char rcsid[] = "$FreeBSD$";
|
|
#endif
|
|
|
|
#define LINSIZ 1024
|
|
#define OPSYS "unix"
|
|
|
|
/* Default location of group file. */
|
|
char *groupfile = _PATH_GROUP;
|
|
/* Default location of master.passwd file. */
|
|
char *passfile = _PATH_PASSWD;
|
|
/* Default location of hosts file. */
|
|
char *hostsfile = _PATH_HOSTS;
|
|
/* Default location of netid file */
|
|
char *netidfile = "/etc/netid";
|
|
|
|
/*
|
|
* Stored hash table of 'reverse' group member database
|
|
* which we will construct.
|
|
*/
|
|
struct member_entry *mtable[TABLESIZE];
|
|
|
|
/*
|
|
* Dupe table: used to keep track of entries so we don't
|
|
* print the same thing twice.
|
|
*/
|
|
struct member_entry *dtable[TABLESIZE];
|
|
|
|
extern struct group *_getgrent __P(( void ));
|
|
extern int _setgrent __P(( void ));
|
|
extern void _endgrent __P(( void ));
|
|
void usage(prog)
|
|
char *prog;
|
|
{
|
|
fprintf (stderr,"usage: %s [-q] [-g group file] [-p passwd file] \
|
|
[-h hosts file]\n\t\t\t[-d netid file] [-d domain]\n",prog);
|
|
exit(1);
|
|
}
|
|
|
|
extern char *optarg;
|
|
extern FILE *_gr_fp;
|
|
|
|
main(argc, argv)
|
|
int argc;
|
|
char *argv[];
|
|
{
|
|
FILE *gfp, *pfp, *hfp, *nfp;
|
|
char readbuf[LINSIZ];
|
|
char writebuf[LINSIZ];
|
|
struct group *gr;
|
|
struct grouplist *glist;
|
|
char *domain;
|
|
int ch;
|
|
gid_t i;
|
|
char *ptr, *pidptr, *gidptr, *hptr;
|
|
int quiet = 0;
|
|
|
|
while ((ch = getopt(argc, argv, "g:p:h:n:d:q")) != EOF) {
|
|
switch(ch) {
|
|
case 'g':
|
|
groupfile = optarg;
|
|
break;
|
|
case 'p':
|
|
passfile = optarg;
|
|
break;
|
|
case 'h':
|
|
hostsfile = optarg;
|
|
break;
|
|
case 'n':
|
|
netidfile = optarg;
|
|
break;
|
|
case 'd':
|
|
domain = optarg;
|
|
break;
|
|
case 'q':
|
|
quiet++;
|
|
break;
|
|
default:
|
|
usage(argv[0]);
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (domain == NULL) {
|
|
if (yp_get_default_domain(&domain))
|
|
errx(1, "no domain name specified and default \
|
|
domain not set");
|
|
}
|
|
|
|
if ((gfp = fopen(groupfile, "r")) == NULL) {
|
|
err(1, "%s", groupfile);
|
|
}
|
|
|
|
if ((pfp = fopen(passfile, "r")) == NULL) {
|
|
err(1, "%s", passfile);
|
|
}
|
|
|
|
if ((hfp = fopen(hostsfile, "r")) == NULL) {
|
|
err(1, "%s", hostsfile);
|
|
}
|
|
|
|
if ((nfp = fopen(netidfile, "r")) == NULL) {
|
|
/* netid is optional -- just continue */
|
|
nfp = NULL;
|
|
}
|
|
|
|
_gr_fp = gfp;
|
|
|
|
/* Load all the group membership info into a hash table. */
|
|
|
|
_setgrent();
|
|
while((gr = _getgrent()) != NULL) {
|
|
while(*gr->gr_mem) {
|
|
mstore(mtable, *gr->gr_mem, gr->gr_gid, 0);
|
|
gr->gr_mem++;
|
|
}
|
|
}
|
|
|
|
fclose(gfp);
|
|
_endgrent();
|
|
|
|
/*
|
|
* Now parse the passwd database, spewing out the extra
|
|
* group information we just stored if necessary.
|
|
*/
|
|
while(fgets(readbuf, LINSIZ, pfp)) {
|
|
if ((ptr = strchr(readbuf, ':')) == NULL)
|
|
warnx("bad passwd file entry: %s", readbuf);
|
|
*ptr = '\0';
|
|
ptr++;
|
|
if ((ptr = strchr(ptr, ':')) == NULL)
|
|
warnx("bad passwd file entry: %s", readbuf);
|
|
*ptr = '\0';
|
|
ptr++;
|
|
pidptr = ptr;
|
|
if ((ptr = strchr(ptr, ':')) == NULL)
|
|
warnx("bad passwd file entry: %s", readbuf);
|
|
*ptr = '\0';
|
|
ptr++;
|
|
gidptr = ptr;
|
|
if ((ptr = strchr(ptr, ':')) == NULL)
|
|
warnx("bad passwd file entry: %s", readbuf);
|
|
*ptr = '\0';
|
|
i = atol(gidptr);
|
|
|
|
snprintf(writebuf, sizeof(writebuf), "%s.%s@%s", OPSYS,
|
|
pidptr, domain);
|
|
|
|
if (lookup(dtable, writebuf)) {
|
|
if (!quiet)
|
|
warnx("duplicate netid '%s.%s@%s' -- skipping",
|
|
OPSYS, pidptr, domain);
|
|
continue;
|
|
} else {
|
|
mstore(dtable, writebuf, 0, 1);
|
|
}
|
|
printf("%s.%s@%s %s:%s", OPSYS, pidptr, domain, pidptr, gidptr);
|
|
if ((glist = lookup(mtable, (char *)&readbuf)) != NULL) {
|
|
while(glist) {
|
|
if (glist->groupid != i)
|
|
printf(",%lu", glist->groupid);
|
|
glist = glist->next;
|
|
}
|
|
}
|
|
printf ("\n");
|
|
}
|
|
|
|
fclose(pfp);
|
|
|
|
/*
|
|
* Now parse the hosts database (this part sucks).
|
|
*/
|
|
|
|
while ((ptr = fgets(readbuf, LINSIZ, hfp))) {
|
|
if (*ptr == '#')
|
|
continue;
|
|
if (!(hptr = strpbrk(ptr, "#\n")))
|
|
continue;
|
|
*hptr = '\0';
|
|
if (!(hptr = strpbrk(ptr, " \t")))
|
|
continue;
|
|
*hptr++ = '\0';
|
|
ptr = hptr;
|
|
while (*ptr == ' ' || *ptr == '\t')
|
|
ptr++;
|
|
if (!(hptr = strpbrk(ptr, " \t")))
|
|
continue;
|
|
*hptr++ = '\0';
|
|
snprintf(writebuf, sizeof(writebuf), "%s.%s@%s", OPSYS,
|
|
ptr, domain);
|
|
if (lookup(dtable, (char *)&writebuf)) {
|
|
if (!quiet)
|
|
warnx("duplicate netid '%s' -- skipping",
|
|
writebuf);
|
|
continue;
|
|
} else {
|
|
mstore(dtable, (char *)&writebuf, 0, 1);
|
|
}
|
|
printf ("%s.%s@%s 0:%s\n", OPSYS, ptr, domain, ptr);
|
|
}
|
|
|
|
fclose(hfp);
|
|
|
|
/*
|
|
* Lastly, copy out any extra information in the netid
|
|
* file. If it's not open, just ignore it: it's optional anyway.
|
|
*/
|
|
|
|
if (nfp != NULL) {
|
|
while(fgets(readbuf, LINSIZ, nfp)) {
|
|
if (readbuf[0] == '#')
|
|
continue;
|
|
if ((ptr = strpbrk((char*)&readbuf, " \t")) == NULL) {
|
|
warnx("bad netid entry: '%s'", readbuf);
|
|
continue;
|
|
}
|
|
|
|
writebuf[0] = *ptr;
|
|
*ptr = '\0';
|
|
if (lookup(dtable, (char *)&readbuf)) {
|
|
if (!quiet)
|
|
warnx("duplicate netid '%s' -- skipping",
|
|
readbuf);
|
|
continue;
|
|
} else {
|
|
mstore(dtable, (char *)&readbuf, 0, 1);
|
|
}
|
|
*ptr = writebuf[0];
|
|
printf("%s",readbuf);
|
|
}
|
|
fclose(nfp);
|
|
}
|
|
|
|
exit(0);
|
|
}
|