566 lines
11 KiB
C
566 lines
11 KiB
C
/* $NetBSD: mknetid.c,v 1.1.1.1 1996/08/09 10:14:55 thorpej Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1996 Mats O Jansson <moj@stacken.kth.se>
|
|
* 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 Mats O Jansson
|
|
* 4. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/*
|
|
* Originally written by Mats O Jansson <moj@stacken.kth.se>
|
|
* Simplified a bit by Jason R. Thorpe <thorpej@NetBSD.ORG>
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/queue.h>
|
|
#include <ctype.h>
|
|
#include <err.h>
|
|
#include <grp.h>
|
|
#include <limits.h>
|
|
#include <netdb.h>
|
|
#include <pwd.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
|
|
#include "protos.h"
|
|
|
|
struct user {
|
|
char *usr_name; /* user name */
|
|
int usr_uid; /* user uid */
|
|
int usr_gid; /* user gid */
|
|
int gid_count; /* number of gids */
|
|
int gid[NGROUPS]; /* additional gids */
|
|
TAILQ_ENTRY(user) read; /* links in read order */
|
|
TAILQ_ENTRY(user) hash; /* links in hash order */
|
|
};
|
|
|
|
#ifdef HOSTS
|
|
char *HostFile = HOSTS;
|
|
#else
|
|
char *HostFile = _PATH_HOSTS;
|
|
#endif
|
|
|
|
#ifdef PASSWD
|
|
char *PasswdFile = PASSWD;
|
|
#else
|
|
char *PasswdFile = _PATH_PASSWD;
|
|
#endif
|
|
|
|
#ifdef GROUP
|
|
char *GroupFile = GROUP;
|
|
#else
|
|
char *GroupFile = _PATH_GROUP;
|
|
#endif
|
|
|
|
#ifdef NETID
|
|
char *NetidFile = NETID;
|
|
#else
|
|
char *NetidFile = "/etc/netid";
|
|
#endif
|
|
|
|
#define HASHMAX 55
|
|
|
|
void print_passwd_group __P((int, char *));
|
|
void print_hosts __P((FILE *, char *, char *));
|
|
void print_netid __P((FILE *, char *));
|
|
void add_user __P((char *, char *, char *));
|
|
void add_group __P((char *, char *));
|
|
void read_passwd __P((FILE *, char *));
|
|
void read_group __P((FILE *, char *));
|
|
void usage __P((void));
|
|
int hashidx __P((char));
|
|
int isgsep __P((char));
|
|
|
|
TAILQ_HEAD(user_list, user);
|
|
struct user_list root;
|
|
struct user_list hroot[HASHMAX];
|
|
|
|
extern char *__progname; /* from crt0.s */
|
|
extern char *optarg;
|
|
extern int optind;
|
|
|
|
int
|
|
main(argc, argv)
|
|
int argc;
|
|
char **argv;
|
|
{
|
|
int qflag, ch;
|
|
char *domain;
|
|
FILE *pfile, *gfile, *hfile, *mfile;
|
|
|
|
TAILQ_INIT(&root);
|
|
for (ch = 0; ch < HASHMAX; ch++)
|
|
TAILQ_INIT((&hroot[ch]));
|
|
|
|
qflag = 0;
|
|
domain = NULL;
|
|
|
|
while ((ch = getopt(argc, argv, "d:g:h:m:p:q")) != -1) {
|
|
switch (ch) {
|
|
case 'd':
|
|
domain = optarg;
|
|
break;
|
|
|
|
case 'g':
|
|
GroupFile = optarg;
|
|
break;
|
|
|
|
case 'h':
|
|
HostFile = optarg;
|
|
break;
|
|
|
|
case 'm':
|
|
NetidFile = optarg;
|
|
break;
|
|
|
|
case 'p':
|
|
PasswdFile = optarg;
|
|
break;
|
|
|
|
case 'q':
|
|
qflag++;
|
|
break;
|
|
|
|
default:
|
|
usage();
|
|
}
|
|
}
|
|
argc -= optind; argv += optind;
|
|
|
|
if (argc != 0)
|
|
usage();
|
|
|
|
if (domain == NULL)
|
|
if (yp_get_default_domain(&domain))
|
|
errx(1, "can't get YP domain name");
|
|
|
|
if ((pfile = fopen(PasswdFile, "r")) == NULL)
|
|
err(1, "%s", PasswdFile);
|
|
|
|
if ((gfile = fopen(GroupFile, "r")) == NULL)
|
|
err(1, "%s", GroupFile);
|
|
|
|
if ((hfile = fopen(HostFile, "r")) == NULL)
|
|
err(1, "%s", HostFile);
|
|
|
|
mfile = fopen(NetidFile, "r");
|
|
|
|
read_passwd(pfile, PasswdFile);
|
|
read_group(gfile, GroupFile);
|
|
|
|
print_passwd_group(qflag, domain);
|
|
print_hosts(hfile, HostFile, domain);
|
|
|
|
if (mfile != NULL)
|
|
print_netid(mfile, NetidFile);
|
|
|
|
exit (0);
|
|
}
|
|
|
|
int
|
|
hashidx(key)
|
|
char key;
|
|
{
|
|
if (key < 'A')
|
|
return(0);
|
|
|
|
if (key <= 'Z')
|
|
return(1 + key - 'A');
|
|
|
|
if (key < 'a')
|
|
return(27);
|
|
|
|
if (key <= 'z')
|
|
return(28 + key - 'a');
|
|
|
|
return(54);
|
|
}
|
|
|
|
void
|
|
add_user(username, uid, gid)
|
|
char *username, *uid, *gid;
|
|
{
|
|
struct user *u;
|
|
int idx;
|
|
|
|
idx = hashidx(username[0]);
|
|
|
|
u = (struct user *)malloc(sizeof(struct user));
|
|
if (u == NULL)
|
|
err(1, "can't allocate user");
|
|
memset(u, 0, sizeof(struct user));
|
|
|
|
u->usr_name = (char *)malloc(strlen(username) + 1);
|
|
if (u->usr_name == NULL)
|
|
err(1, "can't allocate user name");
|
|
strcpy(u->usr_name, username);
|
|
|
|
u->usr_uid = atoi(uid);
|
|
u->usr_gid = atoi(gid);
|
|
u->gid_count = -1;
|
|
|
|
TAILQ_INSERT_TAIL(&root, u, read);
|
|
TAILQ_INSERT_TAIL((&hroot[idx]), u, hash);
|
|
}
|
|
|
|
void
|
|
add_group(username, gid)
|
|
char *username, *gid;
|
|
{
|
|
struct user *u;
|
|
int g, idx;
|
|
|
|
g = atoi(gid);
|
|
idx = hashidx(username[0]);
|
|
|
|
for (u = hroot[idx].tqh_first;
|
|
u != NULL; u = u->hash.tqe_next) {
|
|
if (strcmp(username, u->usr_name) == 0) {
|
|
if (g != u->usr_gid) {
|
|
u->gid_count++;
|
|
if (u->gid_count < NGROUPS)
|
|
u->gid[u->gid_count] = g;
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
read_passwd(pfile, fname)
|
|
FILE *pfile;
|
|
char *fname;
|
|
{
|
|
char line[_POSIX2_LINE_MAX];
|
|
int line_no = 0, len, colon;
|
|
char *p, *k, *u, *g;
|
|
|
|
while (read_line(pfile, line, sizeof(line))) {
|
|
line_no++;
|
|
len = strlen(line);
|
|
|
|
if (len > 1) {
|
|
if (line[0] == '#') {
|
|
continue;
|
|
}
|
|
} else
|
|
continue;
|
|
|
|
/*
|
|
* Check if we have the whole line
|
|
*/
|
|
if (line[len - 1] != '\n') {
|
|
warnx("%s line %d: line to long, skipping",
|
|
fname, line_no);
|
|
continue;
|
|
} else
|
|
line[len - 1] = '\0';
|
|
|
|
p = line;
|
|
|
|
for (k = p, colon = 0; *k != '\0'; k++)
|
|
if (*k == ':')
|
|
colon++;
|
|
|
|
if (colon > 0) {
|
|
/* terminate key */
|
|
for (k = p; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
/* If it's a YP entry, skip it. */
|
|
if (strlen(k) == 1)
|
|
if (*k == '+' || *k == '-')
|
|
continue;
|
|
}
|
|
|
|
if (colon < 4) {
|
|
warnx("%s line %d: syntax error",
|
|
fname, line_no);
|
|
continue;
|
|
}
|
|
|
|
/* terminate password */
|
|
for (; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
/* terminate uid */
|
|
for (u = p; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
/* terminate gid */
|
|
for (g = p; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
add_user(k, u, g);
|
|
}
|
|
}
|
|
|
|
int
|
|
isgsep(ch)
|
|
char ch;
|
|
{
|
|
|
|
switch (ch) {
|
|
case ',':
|
|
case ' ':
|
|
case '\t':
|
|
case '\0':
|
|
return (1);
|
|
}
|
|
|
|
return (0);
|
|
}
|
|
|
|
void
|
|
read_group(gfile, fname)
|
|
FILE *gfile;
|
|
char *fname;
|
|
{
|
|
char line[_POSIX2_LINE_MAX];
|
|
int line_no = 0, len, colon;
|
|
char *p, *k, *u, *g;
|
|
|
|
while (read_line(gfile, line, sizeof(line))) {
|
|
line_no++;
|
|
len = strlen(line);
|
|
|
|
if (len > 1) {
|
|
if (line[0] == '#') {
|
|
continue;
|
|
}
|
|
} else
|
|
continue;
|
|
|
|
/*
|
|
* Check if we have the whole line
|
|
*/
|
|
if (line[len - 1] != '\n') {
|
|
warnx("%s line %d: line to long, skipping",
|
|
fname, line_no);
|
|
continue;
|
|
} else
|
|
line[len - 1] = '\0';
|
|
|
|
p = line;
|
|
|
|
for (k = p, colon = 0; *k != '\0'; k++)
|
|
if (*k == ':')
|
|
colon++;
|
|
|
|
if (colon > 0) {
|
|
/* terminate key */
|
|
for (k = p; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
/* If it's a YP entry, skip it. */
|
|
if (strlen(k) == 1)
|
|
if (*k == '+' || *k == '-')
|
|
continue;
|
|
}
|
|
|
|
if (colon < 3) {
|
|
warnx("%s line %d: syntax error",
|
|
fname, line_no);
|
|
continue;
|
|
}
|
|
|
|
/* terminate password */
|
|
for (; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
/* terminate gid */
|
|
for (g = p; *p != ':'; p++);
|
|
*p++ = '\0';
|
|
|
|
/* get the group list */
|
|
for (u = p; *u != '\0'; u = p) {
|
|
/* find separator */
|
|
for (; isgsep(*p) == 0; p++);
|
|
|
|
if (*p != '\0') {
|
|
*p = '\0';
|
|
if (u != p)
|
|
add_group(u, g);
|
|
p++;
|
|
} else if (u != p)
|
|
add_group(u, g);
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
print_passwd_group(qflag, domain)
|
|
int qflag;
|
|
char *domain;
|
|
{
|
|
struct user *u, *p;
|
|
int i;
|
|
|
|
for (u = root.tqh_first; u != NULL; u = u->read.tqe_next) {
|
|
for (p = root.tqh_first; p->usr_uid != u->usr_uid;
|
|
p = p->read.tqe_next)
|
|
/* empty */ ;
|
|
if (p != u) {
|
|
if (!qflag) {
|
|
warnx("unix.%d@%s %s", u->usr_uid, domain,
|
|
"multiply defined, ignoring duplicate");
|
|
}
|
|
} else {
|
|
printf("unix.%d@%s %d:%d", u->usr_uid, domain,
|
|
u->usr_uid, u->usr_gid);
|
|
if (u->gid_count >= 0)
|
|
for (i = 0; i <= u->gid_count; i++)
|
|
printf(",%d", u->gid[i]);
|
|
printf("\n");
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
print_hosts(pfile, fname, domain)
|
|
FILE *pfile;
|
|
char *fname, *domain;
|
|
{
|
|
char line[_POSIX2_LINE_MAX];
|
|
int line_no = 0, len, colon;
|
|
char *p, *k, *u;
|
|
|
|
while (read_line(pfile, line, sizeof(line))) {
|
|
line_no++;
|
|
len = strlen(line);
|
|
|
|
if (len > 1) {
|
|
if (line[0] == '#') {
|
|
continue;
|
|
}
|
|
} else
|
|
continue;
|
|
|
|
/*
|
|
* Check if we have the whole line
|
|
*/
|
|
if (line[len - 1] != '\n') {
|
|
warnx("%s line %d: line to long, skipping",
|
|
fname, line_no);
|
|
continue;
|
|
} else
|
|
line[len - 1] = '\0';
|
|
|
|
p = line;
|
|
|
|
/* Find the key, replace trailing whitespace will <NUL> */
|
|
for (k = p; isspace(*p) == 0; p++);
|
|
while (isspace(*p))
|
|
*p++ = '\0';
|
|
|
|
/* Get first hostname. */
|
|
for (u = p; ; ) {
|
|
/* Check for EOL */
|
|
if (*p == '\0')
|
|
break;
|
|
|
|
if (isspace(*p) == 0)
|
|
p++;
|
|
else {
|
|
/* Got it. */
|
|
*p = '\0';
|
|
break;
|
|
}
|
|
}
|
|
|
|
printf("unix.%s@%s 0:%s\n", u, domain, u);
|
|
}
|
|
}
|
|
|
|
void
|
|
print_netid(mfile, fname)
|
|
FILE *mfile;
|
|
char *fname;
|
|
{
|
|
char line[_POSIX2_LINE_MAX];
|
|
int line_no = 0, len, colon;
|
|
char *p, *k, *u;
|
|
|
|
while (read_line(mfile, line, sizeof(line))) {
|
|
line_no++;
|
|
len = strlen(line);
|
|
|
|
if (len > 1)
|
|
if (line[0] == '#')
|
|
continue;
|
|
else
|
|
continue;
|
|
|
|
/*
|
|
* Check if we have the while line
|
|
*/
|
|
if (line[len - 1] != '\n') {
|
|
warnx("%s line %d: line to long, skipping",
|
|
fname, line_no);
|
|
continue;
|
|
} else
|
|
line[len - 1] = '\0';
|
|
|
|
p = line;
|
|
|
|
/* Find the key, replace trailing whitespace will <NUL> */
|
|
for (k = p; isspace(*p) == 0; p++);
|
|
while (isspace(*p))
|
|
*p++ = '\0';
|
|
|
|
/* Get netid entry. */
|
|
for (u = p; ; ) {
|
|
/* Check for EOL */
|
|
if (*p == '\0')
|
|
break;
|
|
|
|
if (isspace(*p) == 0)
|
|
p++;
|
|
else {
|
|
/* Got it. */
|
|
*p = '\0';
|
|
break;
|
|
}
|
|
}
|
|
|
|
printf("%s %s\n", k, u);
|
|
}
|
|
}
|
|
|
|
void
|
|
usage()
|
|
{
|
|
|
|
fprintf(stderr, "usage %s: %s %s\n", __progname,
|
|
"[-d domain] [-q] [-p passwdfile] [-g groupfile]");
|
|
fprintf(stderr, " %s",
|
|
"[-g groupfile] [-h hostfile] [-m netidfile]");
|
|
}
|