mirror of
https://git.openafs.org/openafs.git
synced 2025-02-01 14:07:39 +00:00
e0fa8ff72f
nag nag nag
568 lines
13 KiB
C
568 lines
13 KiB
C
/* $Id$ */
|
|
|
|
/*
|
|
*
|
|
* pt_util: Program to dump the AFS protection server database
|
|
* into an ascii file.
|
|
*
|
|
* Assumptions: We *cheat* here and read the datafile directly, ie.
|
|
* not going through the ubik distributed data manager.
|
|
* therefore the database must be quiescent for the
|
|
* output of this program to be valid.
|
|
*/
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/time.h>
|
|
#include <stdio.h>
|
|
#include <ctype.h>
|
|
#include <string.h>
|
|
#include <errno.h>
|
|
#include <sys/file.h>
|
|
|
|
#include <afsconfig.h>
|
|
#include <afs/param.h>
|
|
|
|
RCSID
|
|
("$Header$");
|
|
|
|
#include <afs/cmd.h> /*Command line parsing */
|
|
#include <errno.h>
|
|
#include <lock.h>
|
|
#include <netinet/in.h>
|
|
#define UBIK_INTERNALS
|
|
#include <ubik.h>
|
|
#include <rx/xdr.h>
|
|
#include <rx/rx.h>
|
|
#include "ptint.h"
|
|
#include "ptserver.h"
|
|
#include "pterror.h"
|
|
|
|
#define IDHash(x) (abs(x) % HASHSIZE)
|
|
#define print_id(x) ( ((flags&DO_SYS)==0 && (x<-32767 || x>97536)) || \
|
|
((flags&DO_OTR)==0 && (x>-32768 && x<97537)))
|
|
|
|
extern char *optarg;
|
|
extern int optind;
|
|
|
|
int restricted = 0;
|
|
int display_entry();
|
|
void add_group();
|
|
void display_groups();
|
|
void display_group();
|
|
void fix_pre();
|
|
char *checkin();
|
|
char *check_core();
|
|
char *id_to_name();
|
|
int CommandProc(struct cmd_syndesc *);
|
|
|
|
struct hash_entry {
|
|
char h_name[PR_MAXNAMELEN];
|
|
int h_id;
|
|
struct hash_entry *next;
|
|
};
|
|
struct hash_entry *hat[HASHSIZE];
|
|
|
|
static struct contentry prco;
|
|
static struct prentry pre;
|
|
static struct prheader prh;
|
|
static struct ubik_version uv;
|
|
|
|
struct grp_list {
|
|
struct grp_list *next;
|
|
long groups[1024];
|
|
};
|
|
static struct grp_list *grp_head = 0;
|
|
static long grp_count = 0;
|
|
|
|
struct usr_list {
|
|
struct usr_list *next;
|
|
char name[PR_MAXNAMELEN];
|
|
long uid;
|
|
};
|
|
static struct usr_list *usr_head = 0;
|
|
|
|
char buffer[1024];
|
|
int dbase_fd;
|
|
FILE *dfp;
|
|
|
|
#define FMT_BASE "%-10s %d/%d %d %d %d\n"
|
|
#define FMT_MEM " %-8s %d\n"
|
|
|
|
#define DO_USR 1
|
|
#define DO_GRP 2
|
|
#define DO_MEM 4
|
|
#define DO_SYS 8
|
|
#define DO_OTR 16
|
|
|
|
int nflag = 0;
|
|
int wflag = 0;
|
|
int flags = 0;
|
|
|
|
int
|
|
main(int argc, char **argv)
|
|
{
|
|
|
|
register struct cmd_syndesc *cs; /*Command line syntax descriptor */
|
|
register afs_int32 code; /*Return code */
|
|
|
|
cs = cmd_CreateSyntax((char *)0, CommandProc, 0,
|
|
"access protection database");
|
|
cmd_AddParm(cs, "-w", CMD_FLAG, CMD_OPTIONAL,
|
|
"update prdb with contents of data file");
|
|
cmd_AddParm(cs, "-user", CMD_FLAG, CMD_OPTIONAL, "display users");
|
|
cmd_AddParm(cs, "-group", CMD_FLAG, CMD_OPTIONAL, "display groups");
|
|
cmd_AddParm(cs, "-members", CMD_FLAG, CMD_OPTIONAL,
|
|
"display group members");
|
|
cmd_AddParm(cs, "-name", CMD_FLAG, CMD_OPTIONAL,
|
|
"follow name hash chains (not id hashes)");
|
|
cmd_AddParm(cs, "-system", CMD_FLAG, CMD_OPTIONAL,
|
|
"display only system data");
|
|
cmd_AddParm(cs, "-xtra", CMD_FLAG, CMD_OPTIONAL,
|
|
"display extra users/groups");
|
|
cmd_AddParm(cs, "-prdb", CMD_SINGLE, CMD_OPTIONAL, "prdb file");
|
|
cmd_AddParm(cs, "-datafile", CMD_SINGLE, CMD_OPTIONAL, "data file");
|
|
code = cmd_Dispatch(argc, argv);
|
|
|
|
exit(code);
|
|
|
|
}
|
|
|
|
int
|
|
CommandProc(register struct cmd_syndesc *a_as)
|
|
{
|
|
register int i;
|
|
register long code;
|
|
long cc, upos, gpos;
|
|
struct prentry uentry, gentry;
|
|
struct ubik_hdr *uh;
|
|
char *dfile = 0;
|
|
char *pfile = "/usr/afs/db/prdb.DB0";
|
|
struct cmd_parmdesc *tparm;
|
|
|
|
tparm = a_as->parms;
|
|
|
|
if (tparm[0].items) {
|
|
wflag++;
|
|
}
|
|
if (tparm[1].items) {
|
|
flags |= DO_USR;
|
|
}
|
|
if (tparm[2].items) {
|
|
flags |= DO_GRP;
|
|
}
|
|
if (tparm[3].items) {
|
|
flags |= (DO_GRP | DO_MEM);
|
|
}
|
|
if (tparm[4].items) {
|
|
nflag++;
|
|
}
|
|
if (tparm[5].items) {
|
|
flags |= DO_SYS;
|
|
}
|
|
if (tparm[6].items) {
|
|
flags |= DO_OTR;
|
|
}
|
|
if (tparm[7].items) {
|
|
pfile = tparm[7].items->data;
|
|
}
|
|
if (tparm[8].items) {
|
|
dfile = tparm[8].items->data;
|
|
}
|
|
|
|
if ((dbase_fd = open(pfile, (wflag ? O_RDWR : O_RDONLY) | O_CREAT, 0600))
|
|
< 0) {
|
|
fprintf(stderr, "pt_util: cannot open %s: %s\n", pfile,
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
if (read(dbase_fd, buffer, HDRSIZE) < 0) {
|
|
fprintf(stderr, "pt_util: error reading %s: %s\n", pfile,
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
|
|
if (dfile) {
|
|
if ((dfp = fopen(dfile, wflag ? "r" : "w")) == 0) {
|
|
fprintf(stderr, "pt_util: error opening %s: %s\n", dfile,
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
} else
|
|
dfp = (wflag ? stdin : stdout);
|
|
|
|
uh = (struct ubik_hdr *)buffer;
|
|
if (ntohl(uh->magic) != UBIK_MAGIC)
|
|
fprintf(stderr, "pt_util: %s: Bad UBIK_MAGIC. Is %x should be %x\n",
|
|
pfile, ntohl(uh->magic), UBIK_MAGIC);
|
|
memcpy(&uv, &uh->version, sizeof(struct ubik_version));
|
|
if (wflag && uv.epoch == 0 && uv.counter == 0) {
|
|
uv.epoch = 2; /* a ubik version of 0 or 1 has special meaning */
|
|
memcpy(&uh->version, &uv, sizeof(struct ubik_version));
|
|
lseek(dbase_fd, 0, SEEK_SET);
|
|
if (write(dbase_fd, buffer, HDRSIZE) < 0) {
|
|
fprintf(stderr, "pt_util: error writing ubik version to %s: %s\n",
|
|
pfile, strerror(errno));
|
|
exit(1);
|
|
}
|
|
}
|
|
fprintf(stderr, "Ubik Version is: %d.%d\n", uv.epoch, uv.counter);
|
|
if (read(dbase_fd, &prh, sizeof(struct prheader)) < 0) {
|
|
fprintf(stderr, "pt_util: error reading %s: %s\n", pfile,
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
|
|
Initdb();
|
|
initialize_PT_error_table();
|
|
|
|
if (wflag) {
|
|
struct usr_list *u;
|
|
|
|
while (fgets(buffer, sizeof(buffer), dfp)) {
|
|
int id, oid, cid, flags, quota, uid;
|
|
char name[PR_MAXNAMELEN], mem[PR_MAXNAMELEN];
|
|
|
|
if (isspace(*buffer)) {
|
|
sscanf(buffer, "%s %d", mem, &uid);
|
|
|
|
for (u = usr_head; u; u = u->next)
|
|
if (u->uid && u->uid == uid)
|
|
break;
|
|
if (u) {
|
|
/* Add user - deferred because it is probably foreign */
|
|
u->uid = 0;
|
|
if (FindByID(0, uid))
|
|
code = PRIDEXIST;
|
|
else {
|
|
if (!code
|
|
&& (flags & (PRGRP | PRQUOTA)) ==
|
|
(PRGRP | PRQUOTA)) {
|
|
gentry.ngroups++;
|
|
code = pr_WriteEntry(0, 0, gpos, &gentry);
|
|
if (code)
|
|
fprintf(stderr,
|
|
"Error setting group count on %s: %s\n",
|
|
name, afs_error_message(code));
|
|
}
|
|
code = CreateEntry(0, u->name, &uid, 1 /*idflag */ ,
|
|
1 /*gflag */ ,
|
|
SYSADMINID /*oid */ ,
|
|
SYSADMINID /*cid */ );
|
|
}
|
|
if (code)
|
|
fprintf(stderr, "Error while creating %s: %s\n",
|
|
u->name, afs_error_message(code));
|
|
continue;
|
|
}
|
|
/* Add user to group */
|
|
if (id == ANYUSERID || id == AUTHUSERID || uid == ANONYMOUSID) {
|
|
code = PRPERM;
|
|
} else if ((upos = FindByID(0, uid))
|
|
&& (gpos = FindByID(0, id))) {
|
|
code = pr_ReadEntry(0, 0, upos, &uentry);
|
|
if (!code)
|
|
code = pr_ReadEntry(0, 0, gpos, &gentry);
|
|
if (!code)
|
|
code = AddToEntry(0, &gentry, gpos, uid);
|
|
if (!code)
|
|
code = AddToEntry(0, &uentry, upos, id);
|
|
} else
|
|
code = PRNOENT;
|
|
|
|
if (code)
|
|
fprintf(stderr, "Error while adding %s to %s: %s\n", mem,
|
|
name, afs_error_message(code));
|
|
} else {
|
|
sscanf(buffer, "%s %d/%d %d %d %d", name, &flags, "a, &id,
|
|
&oid, &cid);
|
|
|
|
if (FindByID(0, id))
|
|
code = PRIDEXIST;
|
|
else
|
|
code = CreateEntry(0, name, &id, 1 /*idflag */ ,
|
|
flags & PRGRP, oid, cid);
|
|
if (code == PRBADNAM) {
|
|
u = (struct usr_list *)malloc(sizeof(struct usr_list));
|
|
u->next = usr_head;
|
|
u->uid = id;
|
|
strcpy(u->name, name);
|
|
usr_head = u;
|
|
} else if (code) {
|
|
fprintf(stderr, "Error while creating %s: %s\n", name,
|
|
afs_error_message(code));
|
|
} else if ((flags & PRACCESS)
|
|
|| (flags & (PRGRP | PRQUOTA)) ==
|
|
(PRGRP | PRQUOTA)) {
|
|
gpos = FindByID(0, id);
|
|
code = pr_ReadEntry(0, 0, gpos, &gentry);
|
|
if (!code) {
|
|
gentry.flags = flags;
|
|
gentry.ngroups = quota;
|
|
code = pr_WriteEntry(0, 0, gpos, &gentry);
|
|
}
|
|
if (code)
|
|
fprintf(stderr,
|
|
"Error while setting flags on %s: %s\n", name,
|
|
afs_error_message(code));
|
|
}
|
|
}
|
|
}
|
|
for (u = usr_head; u; u = u->next)
|
|
if (u->uid)
|
|
fprintf(stderr, "Error while creating %s: %s\n", u->name,
|
|
afs_error_message(PRBADNAM));
|
|
} else {
|
|
for (i = 0; i < HASHSIZE; i++) {
|
|
upos = nflag ? ntohl(prh.nameHash[i]) : ntohl(prh.idHash[i]);
|
|
while (upos)
|
|
upos = display_entry(upos);
|
|
}
|
|
if (flags & DO_GRP)
|
|
display_groups();
|
|
}
|
|
|
|
lseek(dbase_fd, 0, L_SET); /* rewind to beginning of file */
|
|
if (read(dbase_fd, buffer, HDRSIZE) < 0) {
|
|
fprintf(stderr, "pt_util: error reading %s: %s\n", pfile,
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
uh = (struct ubik_hdr *)buffer;
|
|
if ((uh->version.epoch != uv.epoch)
|
|
|| (uh->version.counter != uv.counter)) {
|
|
fprintf(stderr,
|
|
"pt_util: Ubik Version number changed during execution.\n");
|
|
fprintf(stderr, "Old Version = %d.%d, new version = %d.%d\n",
|
|
uv.epoch, uv.counter, uh->version.epoch, uh->version.counter);
|
|
}
|
|
close(dbase_fd);
|
|
exit(0);
|
|
}
|
|
|
|
int
|
|
display_entry(int offset)
|
|
{
|
|
register int i;
|
|
|
|
lseek(dbase_fd, offset + HDRSIZE, L_SET);
|
|
read(dbase_fd, &pre, sizeof(struct prentry));
|
|
|
|
fix_pre(&pre);
|
|
|
|
if ((pre.flags & PRFREE) == 0) {
|
|
if (pre.flags & PRGRP) {
|
|
if (flags & DO_GRP)
|
|
add_group(pre.id);
|
|
} else {
|
|
if (print_id(pre.id) && (flags & DO_USR))
|
|
fprintf(dfp, FMT_BASE, pre.name, pre.flags, pre.ngroups,
|
|
pre.id, pre.owner, pre.creator);
|
|
checkin(&pre);
|
|
}
|
|
}
|
|
return (nflag ? pre.nextName : pre.nextID);
|
|
}
|
|
|
|
void
|
|
add_group(long id)
|
|
{
|
|
struct grp_list *g;
|
|
register long i;
|
|
|
|
i = grp_count++ % 1024;
|
|
if (i == 0) {
|
|
g = (struct grp_list *)malloc(sizeof(struct grp_list));
|
|
g->next = grp_head;
|
|
grp_head = g;
|
|
}
|
|
g = grp_head;
|
|
g->groups[i] = id;
|
|
}
|
|
|
|
void
|
|
display_groups()
|
|
{
|
|
register int i, id;
|
|
struct grp_list *g;
|
|
|
|
g = grp_head;
|
|
while (grp_count--) {
|
|
i = grp_count % 1024;
|
|
id = g->groups[i];
|
|
display_group(id);
|
|
if (i == 0) {
|
|
grp_head = g->next;
|
|
free(g);
|
|
g = grp_head;
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
display_group(int id)
|
|
{
|
|
register int i, offset;
|
|
int print_grp = 0;
|
|
|
|
offset = ntohl(prh.idHash[IDHash(id)]);
|
|
while (offset) {
|
|
lseek(dbase_fd, offset + HDRSIZE, L_SET);
|
|
if (read(dbase_fd, &pre, sizeof(struct prentry)) < 0) {
|
|
fprintf(stderr, "pt_util: read i/o error: %s\n", strerror(errno));
|
|
exit(1);
|
|
}
|
|
fix_pre(&pre);
|
|
if (pre.id == id)
|
|
break;
|
|
offset = pre.nextID;
|
|
}
|
|
|
|
if (print_id(id)) {
|
|
fprintf(dfp, FMT_BASE, pre.name, pre.flags, pre.ngroups, pre.id,
|
|
pre.owner, pre.creator);
|
|
print_grp = 1;
|
|
}
|
|
|
|
if ((flags & DO_MEM) == 0)
|
|
return;
|
|
|
|
for (i = 0; i < PRSIZE; i++) {
|
|
if ((id = pre.entries[i]) == 0)
|
|
break;
|
|
if (id == PRBADID)
|
|
continue;
|
|
if (print_id(id) || print_grp == 1) {
|
|
if (print_grp == 0) {
|
|
fprintf(dfp, FMT_BASE, pre.name, pre.flags, pre.ngroups,
|
|
pre.id, pre.owner, pre.creator);
|
|
print_grp = 2;
|
|
}
|
|
fprintf(dfp, FMT_MEM, id_to_name(id), id);
|
|
}
|
|
}
|
|
if (i == PRSIZE) {
|
|
offset = pre.next;
|
|
while (offset) {
|
|
lseek(dbase_fd, offset + HDRSIZE, L_SET);
|
|
read(dbase_fd, &prco, sizeof(struct contentry));
|
|
prco.next = ntohl(prco.next);
|
|
for (i = 0; i < COSIZE; i++) {
|
|
prco.entries[i] = ntohl(prco.entries[i]);
|
|
if ((id = prco.entries[i]) == 0)
|
|
break;
|
|
if (id == PRBADID)
|
|
continue;
|
|
if (print_id(id) || print_grp == 1) {
|
|
if (print_grp == 0) {
|
|
fprintf(dfp, FMT_BASE, pre.name, pre.flags,
|
|
pre.ngroups, pre.id, pre.owner, pre.creator);
|
|
print_grp = 2;
|
|
}
|
|
fprintf(dfp, FMT_MEM, id_to_name(id), id);
|
|
}
|
|
}
|
|
if ((i == COSIZE) && prco.next)
|
|
offset = prco.next;
|
|
else
|
|
offset = 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
fix_pre(struct prentry *pre)
|
|
{
|
|
register int i;
|
|
|
|
pre->flags = ntohl(pre->flags);
|
|
pre->id = ntohl(pre->id);
|
|
pre->cellid = ntohl(pre->cellid);
|
|
pre->next = ntohl(pre->next);
|
|
pre->nextID = ntohl(pre->nextID);
|
|
pre->nextName = ntohl(pre->nextName);
|
|
pre->owner = ntohl(pre->owner);
|
|
pre->creator = ntohl(pre->creator);
|
|
pre->ngroups = ntohl(pre->ngroups);
|
|
pre->nusers = ntohl(pre->nusers);
|
|
pre->count = ntohl(pre->count);
|
|
pre->instance = ntohl(pre->instance);
|
|
pre->owned = ntohl(pre->owned);
|
|
pre->nextOwned = ntohl(pre->nextOwned);
|
|
pre->parent = ntohl(pre->parent);
|
|
pre->sibling = ntohl(pre->sibling);
|
|
pre->child = ntohl(pre->child);
|
|
for (i = 0; i < PRSIZE; i++) {
|
|
pre->entries[i] = ntohl(pre->entries[i]);
|
|
}
|
|
}
|
|
|
|
char *
|
|
id_to_name(int id)
|
|
{
|
|
register int offset;
|
|
static struct prentry pre;
|
|
char *name;
|
|
|
|
name = check_core(id);
|
|
if (name)
|
|
return (name);
|
|
offset = ntohl(prh.idHash[IDHash(id)]);
|
|
while (offset) {
|
|
lseek(dbase_fd, offset + HDRSIZE, L_SET);
|
|
if (read(dbase_fd, &pre, sizeof(struct prentry)) < 0) {
|
|
fprintf(stderr, "pt_util: read i/o error: %s\n", strerror(errno));
|
|
exit(1);
|
|
}
|
|
pre.id = ntohl(pre.id);
|
|
if (pre.id == id) {
|
|
name = checkin(&pre);
|
|
return (name);
|
|
}
|
|
offset = ntohl(pre.nextID);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
char *
|
|
checkin(struct prentry *pre)
|
|
{
|
|
struct hash_entry *he, *last;
|
|
register int id;
|
|
|
|
id = pre->id;
|
|
last = (struct hash_entry *)0;
|
|
he = hat[IDHash(id)];
|
|
while (he) {
|
|
if (id == he->h_id)
|
|
return (he->h_name);
|
|
last = he;
|
|
he = he->next;
|
|
}
|
|
he = (struct hash_entry *)malloc(sizeof(struct hash_entry));
|
|
if (he == 0) {
|
|
fprintf(stderr, "pt_util: No Memory for internal hash table.\n");
|
|
exit(1);
|
|
}
|
|
he->h_id = id;
|
|
he->next = (struct hash_entry *)0;
|
|
strncpy(he->h_name, pre->name, PR_MAXNAMELEN);
|
|
if (last == (struct hash_entry *)0)
|
|
hat[IDHash(id)] = he;
|
|
else
|
|
last->next = he;
|
|
return (he->h_name);
|
|
}
|
|
|
|
char *
|
|
check_core(register int id)
|
|
{
|
|
struct hash_entry *he;
|
|
he = hat[IDHash(id)];
|
|
while (he) {
|
|
if (id == he->h_id)
|
|
return (he->h_name);
|
|
he = he->next;
|
|
}
|
|
return 0;
|
|
}
|