[moira.git] / dbck / phase1.qc

/* $Header$
 *
 *  (c) Copyright 1988 by the Massachusetts Institute of Technology.
 *  For copying and distribution information, please see the file
 *  <mit-copyright.h>.
 */

#include <mit-copyright.h>
#include <moira.h>
#include "dbck.h"

static char phase1_qc_rcsid[] = "$Header$";


show_user_id(u)
struct user *u;
{
    printf("User %s (%s, status %d) has duplicate ID\n",
	   u->login, u->fullname, u->status);
    return(0);
}

handle_duplicate_logins(sq)
struct save_queue *sq;
{
    struct user *u, *uu, *tmp;

    uu = (struct user *)0;
    while (sq_get_data(sq, &u)) {
	if (!strcmp(u->login, uu->login)) {
	    if (uu->status == 1 || u->status == 0) {
		tmp = u;
		u = uu;
		uu = tmp;
	    }
	    printf("User %s (%s, status %d) and\n",
		   u->login, u->fullname, u->status);
	    printf("User %s (%s, status %d) have duplicate logins\n",
		   uu->login, uu->fullname, uu->status);
	    if (!strcmp(u->fullname, uu->fullname) &&
		single_fix("Delete the second one")) {
		single_delete("users", "users_id", uu->users_id);
	    } else if (single_fix("Unregister the second one"))
##	      {
##    		int id = uu->users_id, rowcount;

##		replace users (login = "#"+text(users.uid), status = 0)
##		    where users.users_id = id
##		inquire_equel(rowcount = "rowcount")
    		if (rowcount > 0)
		  printf("%d entr%s fixed\n", rowcount, rowcount==1?"y":"ies");
		else
		  printf("Not fixed\n");
		modified("users");
##	    }
	} else {
	    uu = u;
	}
    }
}

fix_user_id(u)
struct user *u;
{
    u->users_id = generic_fix_id("users", "users_id", "login",
				 u->users_id, u->login);
}


cant_fix(id)
int id;
{
    printf("Sorry, don't know how to fix that\n");
}

show_mach_id(m)
struct machine *m;
{
    printf("Machine %s has duplicate ID %d\n", m->name, m->mach_id);
    return(0);
}

show_mach_name(m)
struct machine *m;
{
    printf("Machine %s (%d) has duplicate name\n", m->name, m->mach_id);
    return(0);
}

fix_mach_id(m)
struct machine *m;
{
    m->mach_id = generic_fix_id("machine", "mach_id", "name",
				m->mach_id, m->name);
}

show_clu_id(c)
struct cluster *c;
{
    printf("Cluster %s has duplicate ID %d\n", c->name, c->clu_id);
    return(0);
}

show_clu_name(c)
struct cluster *c;
{
    printf("Cluster %s (%d) has duplicate name\n", c->name, c->clu_id);
    return(0);
}

fix_clu_id(c)
struct cluster *c;
{
    c->clu_id = generic_fix_id("cluster", "clu_id", "name", c->clu_id, c->name);
}

show_list_id(l)
struct list *l;
{
    printf("List %s has duplicate ID %d\n", l->name, l->list_id);
    return(0);
}

show_list_name(l)
struct list *l;
{
    printf("List %s (%d) has duplicate name\n", l->name, l->list_id);
    return(0);
}

fix_list_id(l)
struct list *l;
{
    l->list_id = generic_fix_id("list", "list_id", "name", l->list_id, l->name);
}

show_fs_id(f)
struct filesys *f;
{
    printf("Filesys %s has duplicate ID %d\n", f->name, f->filsys_id);
    return(0);
}

fix_fs_id(f)
struct filesys *f;
{
    f->filsys_id = generic_fix_id("filesys", "filsys_id", "label",
				  f->filsys_id, f->name);
}


show_np_id(n)
struct nfsphys *n;
{
    printf("NfsPhys %s:%s has duplicate ID %d\n",
	   ((struct machine *)hash_lookup(machines, n->mach_id))->name,
	   n->dir, n->nfsphys_id);
    return(0);
}

fix_np_id(n)
struct nfsphys *n;
{
    n->nfsphys_id = generic_fix_id("nfsphys", "nfsphys_id", "dir",
				   n->nfsphys_id, n->dir);
}

show_str_id(s)
struct string *s;
{
    printf("String %s has duplicate ID %d\n", s->name, s->string_id);
    return(0);
}


phase1()
##{
##  char name[81], name1[81], last[17], first[17], buf[257];
##  int id, id2, id3, aid, aid2, status, sid, sid2, sid3;
    struct save_queue *sq;
    struct user *u;
    struct machine *m;
    struct list *l;
    struct cluster *c;
    struct string *s;
    struct filesys *f;
    struct nfsphys *n;

    printf("Phase 1 - Looking for duplicates\n");

    dprintf("Loading strings...\n");
    sq = sq_create();
    strings = create_hash(5000);
##  range of s is strings
##  retrieve (id = s.string_id, buf = s.string) {
    	s = (struct string *) malloc(sizeof(struct string));
	if (s == NULL)
	  out_of_mem("storing strings");
	s->name = strsave(strtrim(buf));
	s->string_id = id;
	s->refc = 0;
	if (hash_store(strings, id, s)) {
	    sq_save_data(sq, hash_lookup(strings, id));
	    sq_save_data(sq, s);
	}
##  }
    generic_delete(sq, show_str_id, "strings", "string_id", 0);

    dprintf("Loading users...\n");
    sq = sq_create();
    users = create_hash(10000);
##  range of u is users
##  retrieve (id = u.users_id, name = u.login, last = u.#last,
##	      first = u.#first, status = u.#status, buf = u.potype,
##	      id2 = u.pop_id, id3 = u.box_id, sid = u.modby, sid2 = u.fmodby,
##	      sid3 = u.pmodby) {
    	u = (struct user *) malloc(sizeof(struct user));
	if (u == NULL)
	  out_of_mem("storing users");
	strcpy(u->login, strtrim(name));
	u->potype = buf[0];
	sprintf(buf, "%s, %s", strtrim(last), strtrim(first));
	u->fullname = strsave(buf);
	u->status = status;
	u->users_id = id;
	switch (u->potype) {
	case 'P':
	    u->pobox_id = id2;
	    break;
	case 'S':
	    u->pobox_id = id3;
	    break;
	default:
	    u->pobox_id = 0;
	}
	if (hash_store(users, id, u)) {
	    sq_save_data(sq, hash_lookup(users, id));
	    sq_save_data(sq, u);
	}
	if (sid < 0)
	  string_check(-sid);
	if (sid2 < 0)
	  string_check(-sid2);
	if (sid3 < 0)
	  string_check(-sid3);
##  }
    generic_fix(sq, show_user_id, "Change ID", fix_user_id, 0);

    if (!fast) {
	sq = sq_create();
##	retrieve (id = u.users_id)
##	    where u.login = users.login and u.tid != users.tid {
	  sq_save_data(sq, hash_lookup(users, id));
##	}
	handle_duplicate_logins(sq);
    }

    dprintf("Loading machines...\n");
    machines = create_hash(1000);
    sq = sq_create();
##  range of m is machine
##  retrieve (id = m.mach_id, name = m.#name, sid = m.modby) {
    	m = (struct machine *) malloc(sizeof(struct machine));
	if (m == NULL)
	  out_of_mem("storing machines");
	strcpy(m->name, strtrim(name));
	m->mach_id = id;
	m->clucount = 0;
	if (hash_store(machines, id, m)) {
	    sq_save_data(sq, hash_lookup(machines, id));
	    sq_save_data(sq, m);
	}
	if (sid < 0)
	  string_check(-sid);
##  }
    generic_fix(sq, show_mach_id, "Change ID", fix_mach_id, 0);

    if (!fast) {
	sq = sq_create();
##	retrieve (id = m.mach_id)
##	    where m.#name = machine.#name and m.tid != machine.tid {
	  sq_save_data(sq, hash_lookup(machines, id));
##	}
	generic_fix(sq, show_mach_name, "Change name", cant_fix, 0);
    }	

    dprintf("Loading clusters...\n");
    sq = sq_create();
    clusters = create_hash(100);
##  range of c is cluster
##  retrieve (id = c.clu_id, name = c.#name, sid = c.modby) {
    	c = (struct cluster *) malloc(sizeof(struct cluster));
	if (c == NULL)
	  out_of_mem("storing clusters");
	strcpy(c->name, strtrim(name));
	c->clu_id = id;
	if (hash_store(clusters, id, c)) {
	    sq_save_data(sq, hash_lookup(clusters, id));
	    sq_save_data(sq, c);
	}
	if (sid < 0)
	  string_check(-sid);
##  }
    generic_fix(sq, show_clu_id, "Change ID", fix_clu_id, 0);

    if (!fast) {
	sq = sq_create();
##	retrieve (id = c.clu_id)
##	    where c.#name = cluster.#name and c.tid != cluster.tid {
    	  sq_save_data(sq, hash_lookup(clusters, id));
##	}
	generic_fix(sq, show_clu_name, "Change name", cant_fix, 0);
    }

    dprintf("Loading lists...\n");
    sq = sq_create();
    lists = create_hash(10000);
##  range of l is list
##  retrieve (id = l.list_id, name = l.#name,
##	      aid = l.acl_id, buf = l.acl_type, sid = l.modby) {
    	l = (struct list *) malloc(sizeof(struct list));
	if (l == NULL)
	  out_of_mem("storing lists");
	strcpy(l->name, strtrim(name));
	l->acl_type = buf[0];
	l->acl_id = aid;
	l->list_id = id;
	l->members = 0;
	if (hash_store(lists, id, l)) {
	    sq_save_data(sq, hash_lookup(lists, id));
	    sq_save_data(sq, l);
	}
	if (sid < 0)
	  string_check(-sid);
##  }
    generic_fix(sq, show_list_id, "Change ID", fix_list_id, 0);

    if (!fast) {
	sq = sq_create();
##	retrieve (id = l.list_id)
##	    where l.#name = list.#name and l.tid != list.tid {
	  sq_save_data(sq, hash_lookup(lists, id));
##	}
	generic_fix(sq, show_list_name, "Change name", cant_fix, 0);
    }

    dprintf("Loading filesys...\n");
    sq = sq_create();
    filesys = create_hash(10000);
##  retrieve (id = filesys.filsys_id, name = filesys.label, aid = filesys.owner,
##	      aid2 = filesys.owners, id2 = filesys.phys_id,
##	      id3 = filesys.mach_id, buf = filesys.type,
##	      name1 = filesys.#name, sid = filesys.modby) {
    	f = (struct filesys *) malloc(sizeof(struct filesys));
	if (f == NULL)
	  out_of_mem("storing filesystems");
	strcpy(f->name, strtrim(name));
	strcpy(f->dir, strtrim(name1));
	f->filsys_id = id;
	f->owner = aid;
	f->owners = aid2;
	f->phys_id = id2;
	f->mach_id = id3;
	f->type = buf[0];
	if (hash_store(filesys, id, f)) {
	    sq_save_data(sq, hash_lookup(filesys, id));
	    sq_save_data(sq, f);
	}
	if (sid < 0)
	  string_check(-sid);
##  }
    generic_fix(sq, show_fs_id, "Change ID", fix_fs_id, 0);

    dprintf("Loading nfsphys...\n");
    sq = sq_create();
    nfsphys = create_hash(500);
##  retrieve (id = nfsphys.nfsphys_id, name = nfsphys.dir,
##	      id2 = nfsphys.mach_id, id3 = nfsphys.allocated,
##	      sid = nfsphys.modby) {
    	n = (struct nfsphys *) malloc(sizeof(struct nfsphys));
	if (n == NULL)
	  out_of_mem("storing nfsphys");
	strcpy(n->dir, strtrim(name));
	n->mach_id = id2;
	n->nfsphys_id = id;
	n->allocated = id3;
	n->count = 0;
	if (hash_store(nfsphys, id, n)) {
	    sq_save_data(sq, hash_lookup(nfsphys, id));
	    sq_save_data(sq, n);
	}
	if (sid < 0)
	  string_check(-sid);
##  }
    generic_fix(sq, show_np_id, "Change ID", fix_np_id, 0);

    if (!fast) {
##	range of s is strings
##	retrieve (id = s.string_id, buf = s.string)
##	    where s.string = strings.string and s.tid != strings.tid {
	  printf("String %s(%d) is a duplicate!\n", strtrim(buf), id);
	  printf("Not fixing this error\n");
##	}
    }

    if (!fast) {
	dprintf("Scanning krbmap...\n");
##	range of k is krbmap
##	retrieve (id = k.users_id)
##	    where k.users_id = krbmap.users_id and k.tid != krbmap.tid {
    	  printf("User %d is in the krbmap more than once!\n", id);
	  printf("Not fixing this error\n");
##	}
##	retrieve (id = k.string_id)
##	    where k.string_id = krbmap.string_id and k.tid != krbmap.tid {
    	  printf("Principal %d is in the krbmap more than once!\n", id);
	  printf("Not fixing this error\n");
##	}
    }
##}
Commit	Line	Data
d2543f8c	1	/* $Header$
	2	*
	3	* (c) Copyright 1988 by the Massachusetts Institute of Technology.
	4	* For copying and distribution information, please see the file
	5	* <mit-copyright.h>.
	6	*/
	7
	8	#include <mit-copyright.h>
2ce085d2	9	#include <moira.h>
d2543f8c	10	#include "dbck.h"
d2543f8c	11
a7a7a3cc	12	static char phase1_qc_rcsid[] = "$Header$";
a7a7a3cc	13
d2543f8c	14
	15	show_user_id(u)
	16	struct user *u;
	17	{
	18	printf("User %s (%s, status %d) has duplicate ID\n",
	19	u->login, u->fullname, u->status);
	20	return(0);
	21	}
	22
	23	handle_duplicate_logins(sq)
	24	struct save_queue *sq;
	25	{
	26	struct user u, uu, *tmp;
	27
	28	uu = (struct user *)0;
	29	while (sq_get_data(sq, &u)) {
	30	if (!strcmp(u->login, uu->login)) {
	31	if (uu->status == 1 \|\| u->status == 0) {
	32	tmp = u;
	33	u = uu;
	34	uu = tmp;
	35	}
	36	printf("User %s (%s, status %d) and\n",
	37	u->login, u->fullname, u->status);
	38	printf("User %s (%s, status %d) have duplicate logins\n",
	39	uu->login, uu->fullname, uu->status);
	40	if (!strcmp(u->fullname, uu->fullname) &&
	41	single_fix("Delete the second one")) {
	42	single_delete("users", "users_id", uu->users_id);
	43	} else if (single_fix("Unregister the second one"))
	44	## {
	45	## int id = uu->users_id, rowcount;
	46
	47	## replace users (login = "#"+text(users.uid), status = 0)
	48	## where users.users_id = id
	49	## inquire_equel(rowcount = "rowcount")
	50	if (rowcount > 0)
	51	printf("%d entr%s fixed\n", rowcount, rowcount==1?"y":"ies");
	52	else
	53	printf("Not fixed\n");
a7a7a3cc	54	modified("users");
d2543f8c	55	## }
	56	} else {
	57	uu = u;
	58	}
	59	}
	60	}
	61
	62	fix_user_id(u)
	63	struct user *u;
	64	{
	65	u->users_id = generic_fix_id("users", "users_id", "login",
	66	u->users_id, u->login);
	67	}
	68
	69
	70	cant_fix(id)
	71	int id;
	72	{
	73	printf("Sorry, don't know how to fix that\n");
	74	}
	75
	76	show_mach_id(m)
	77	struct machine *m;
	78	{
	79	printf("Machine %s has duplicate ID %d\n", m->name, m->mach_id);
	80	return(0);
	81	}
	82
	83	show_mach_name(m)
	84	struct machine *m;
	85	{
	86	printf("Machine %s (%d) has duplicate name\n", m->name, m->mach_id);
	87	return(0);
	88	}
	89
	90	fix_mach_id(m)
	91	struct machine *m;
	92	{
	93	m->mach_id = generic_fix_id("machine", "mach_id", "name",
	94	m->mach_id, m->name);
	95	}
	96
	97	show_clu_id(c)
	98	struct cluster *c;
	99	{
	100	printf("Cluster %s has duplicate ID %d\n", c->name, c->clu_id);
	101	return(0);
	102	}
	103
	104	show_clu_name(c)
	105	struct cluster *c;
	106	{
	107	printf("Cluster %s (%d) has duplicate name\n", c->name, c->clu_id);
	108	return(0);
	109	}
	110
	111	fix_clu_id(c)
	112	struct cluster *c;
	113	{
	114	c->clu_id = generic_fix_id("cluster", "clu_id", "name", c->clu_id, c->name);
	115	}
	116
	117	show_list_id(l)
	118	struct list *l;
119	{
120	printf("List %s has duplicate ID %d\n", l->name, l->list_id);
121	return(0);
122	}
123
124	show_list_name(l)
125	struct list *l;
126	{
127	printf("List %s (%d) has duplicate name\n", l->name, l->list_id);
128	return(0);
129	}
130
131	fix_list_id(l)
132	struct list *l;
133	{
134	l->list_id = generic_fix_id("list", "list_id", "name", l->list_id, l->name);
135	}
136
137	show_fs_id(f)
138	struct filesys *f;
139	{
140	printf("Filesys %s has duplicate ID %d\n", f->name, f->filsys_id);
141	return(0);
142	}
143
144	fix_fs_id(f)
145	struct filesys *f;
146	{
147	f->filsys_id = generic_fix_id("filesys", "filsys_id", "label",
148	f->filsys_id, f->name);
149	}
150
151
152	show_np_id(n)
153	struct nfsphys *n;
154	{
155	printf("NfsPhys %s:%s has duplicate ID %d\n",
156	((struct machine *)hash_lookup(machines, n->mach_id))->name,
157	n->dir, n->nfsphys_id);
158	return(0);
159	}
160
161	fix_np_id(n)
162	struct nfsphys *n;
163	{
164	n->nfsphys_id = generic_fix_id("nfsphys", "nfsphys_id", "dir",
165	n->nfsphys_id, n->dir);
166	}
167
168	show_str_id(s)
169	struct string *s;
170	{
171	printf("String %s has duplicate ID %d\n", s->name, s->string_id);
172	return(0);
173	}
174
175
176	phase1()
177	##{
a3b4927d	178	## char name[81], name1[81], last[17], first[17], buf[257];
a3b4927d	179	## int id, id2, id3, aid, aid2, status, sid, sid2, sid3;
d2543f8c	180	struct save_queue *sq;
	181	struct user *u;
	182	struct machine *m;
	183	struct list *l;
	184	struct cluster *c;
	185	struct string *s;
	186	struct filesys *f;
	187	struct nfsphys *n;
	188
	189	printf("Phase 1 - Looking for duplicates\n");
	190
a3b4927d	191	dprintf("Loading strings...\n");
	192	sq = sq_create();
	193	strings = create_hash(5000);
	194	## range of s is strings
	195	## retrieve (id = s.string_id, buf = s.string) {
	196	s = (struct string *) malloc(sizeof(struct string));
	197	if (s == NULL)
	198	out_of_mem("storing strings");
	199	s->name = strsave(strtrim(buf));
	200	s->string_id = id;
	201	s->refc = 0;
	202	if (hash_store(strings, id, s)) {
	203	sq_save_data(sq, hash_lookup(strings, id));
	204	sq_save_data(sq, s);
	205	}
	206	## }
	207	generic_delete(sq, show_str_id, "strings", "string_id", 0);
	208
d2543f8c	209	dprintf("Loading users...\n");
	210	sq = sq_create();
	211	users = create_hash(10000);
	212	## range of u is users
	213	## retrieve (id = u.users_id, name = u.login, last = u.#last,
	214	## first = u.#first, status = u.#status, buf = u.potype,
a3b4927d	215	## id2 = u.pop_id, id3 = u.box_id, sid = u.modby, sid2 = u.fmodby,
a3b4927d	216	## sid3 = u.pmodby) {
d2543f8c	217	u = (struct user *) malloc(sizeof(struct user));
a3b4927d	218	if (u == NULL)
a3b4927d	219	out_of_mem("storing users");
d2543f8c	220	strcpy(u->login, strtrim(name));
	221	u->potype = buf[0];
	222	sprintf(buf, "%s, %s", strtrim(last), strtrim(first));
	223	u->fullname = strsave(buf);
	224	u->status = status;
	225	u->users_id = id;
	226	switch (u->potype) {
	227	case 'P':
	228	u->pobox_id = id2;
	229	break;
	230	case 'S':
	231	u->pobox_id = id3;
	232	break;
	233	default:
	234	u->pobox_id = 0;
	235	}
	236	if (hash_store(users, id, u)) {
	237	sq_save_data(sq, hash_lookup(users, id));
	238	sq_save_data(sq, u);
	239	}
a3b4927d	240	if (sid < 0)
	241	string_check(-sid);
	242	if (sid2 < 0)
	243	string_check(-sid2);
	244	if (sid3 < 0)
	245	string_check(-sid3);
d2543f8c	246	## }
	247	generic_fix(sq, show_user_id, "Change ID", fix_user_id, 0);
	248
	249	if (!fast) {
	250	sq = sq_create();
	251	## retrieve (id = u.users_id)
	252	## where u.login = users.login and u.tid != users.tid {
	253	sq_save_data(sq, hash_lookup(users, id));
	254	## }
	255	handle_duplicate_logins(sq);
	256	}
	257
	258	dprintf("Loading machines...\n");
	259	machines = create_hash(1000);
	260	sq = sq_create();
	261	## range of m is machine
a3b4927d	262	## retrieve (id = m.mach_id, name = m.#name, sid = m.modby) {
d2543f8c	263	m = (struct machine *) malloc(sizeof(struct machine));
a3b4927d	264	if (m == NULL)
a3b4927d	265	out_of_mem("storing machines");
d2543f8c	266	strcpy(m->name, strtrim(name));
	267	m->mach_id = id;
	268	m->clucount = 0;
	269	if (hash_store(machines, id, m)) {
	270	sq_save_data(sq, hash_lookup(machines, id));
	271	sq_save_data(sq, m);
	272	}
a3b4927d	273	if (sid < 0)
a3b4927d	274	string_check(-sid);
d2543f8c	275	## }
	276	generic_fix(sq, show_mach_id, "Change ID", fix_mach_id, 0);
	277
	278	if (!fast) {
	279	sq = sq_create();
	280	## retrieve (id = m.mach_id)
	281	## where m.#name = machine.#name and m.tid != machine.tid {
	282	sq_save_data(sq, hash_lookup(machines, id));
	283	## }
	284	generic_fix(sq, show_mach_name, "Change name", cant_fix, 0);
	285	}
	286
	287	dprintf("Loading clusters...\n");
	288	sq = sq_create();
	289	clusters = create_hash(100);
	290	## range of c is cluster
a3b4927d	291	## retrieve (id = c.clu_id, name = c.#name, sid = c.modby) {
d2543f8c	292	c = (struct cluster *) malloc(sizeof(struct cluster));
a3b4927d	293	if (c == NULL)
a3b4927d	294	out_of_mem("storing clusters");
d2543f8c	295	strcpy(c->name, strtrim(name));
	296	c->clu_id = id;
	297	if (hash_store(clusters, id, c)) {
	298	sq_save_data(sq, hash_lookup(clusters, id));
	299	sq_save_data(sq, c);
	300	}
a3b4927d	301	if (sid < 0)
a3b4927d	302	string_check(-sid);
d2543f8c	303	## }
	304	generic_fix(sq, show_clu_id, "Change ID", fix_clu_id, 0);
	305
	306	if (!fast) {
	307	sq = sq_create();
	308	## retrieve (id = c.clu_id)
	309	## where c.#name = cluster.#name and c.tid != cluster.tid {
	310	sq_save_data(sq, hash_lookup(clusters, id));
	311	## }
	312	generic_fix(sq, show_clu_name, "Change name", cant_fix, 0);
	313	}
	314
	315	dprintf("Loading lists...\n");
	316	sq = sq_create();
	317	lists = create_hash(10000);
	318	## range of l is list
	319	## retrieve (id = l.list_id, name = l.#name,
a3b4927d	320	## aid = l.acl_id, buf = l.acl_type, sid = l.modby) {
d2543f8c	321	l = (struct list *) malloc(sizeof(struct list));
a3b4927d	322	if (l == NULL)
a3b4927d	323	out_of_mem("storing lists");
d2543f8c	324	strcpy(l->name, strtrim(name));
	325	l->acl_type = buf[0];
	326	l->acl_id = aid;
	327	l->list_id = id;
	328	l->members = 0;
	329	if (hash_store(lists, id, l)) {
	330	sq_save_data(sq, hash_lookup(lists, id));
	331	sq_save_data(sq, l);
	332	}
a3b4927d	333	if (sid < 0)
a3b4927d	334	string_check(-sid);
d2543f8c	335	## }
	336	generic_fix(sq, show_list_id, "Change ID", fix_list_id, 0);
	337
	338	if (!fast) {
	339	sq = sq_create();
	340	## retrieve (id = l.list_id)
	341	## where l.#name = list.#name and l.tid != list.tid {
	342	sq_save_data(sq, hash_lookup(lists, id));
	343	## }
	344	generic_fix(sq, show_list_name, "Change name", cant_fix, 0);
	345	}
	346
	347	dprintf("Loading filesys...\n");
	348	sq = sq_create();
	349	filesys = create_hash(10000);
	350	## retrieve (id = filesys.filsys_id, name = filesys.label, aid = filesys.owner,
	351	## aid2 = filesys.owners, id2 = filesys.phys_id,
	352	## id3 = filesys.mach_id, buf = filesys.type,
a3b4927d	353	## name1 = filesys.#name, sid = filesys.modby) {
d2543f8c	354	f = (struct filesys *) malloc(sizeof(struct filesys));
a3b4927d	355	if (f == NULL)
a3b4927d	356	out_of_mem("storing filesystems");
d2543f8c	357	strcpy(f->name, strtrim(name));
	358	strcpy(f->dir, strtrim(name1));
	359	f->filsys_id = id;
	360	f->owner = aid;
	361	f->owners = aid2;
	362	f->phys_id = id2;
	363	f->mach_id = id3;
	364	f->type = buf[0];
	365	if (hash_store(filesys, id, f)) {
	366	sq_save_data(sq, hash_lookup(filesys, id));
	367	sq_save_data(sq, f);
	368	}
a3b4927d	369	if (sid < 0)
a3b4927d	370	string_check(-sid);
d2543f8c	371	## }
	372	generic_fix(sq, show_fs_id, "Change ID", fix_fs_id, 0);
	373
	374	dprintf("Loading nfsphys...\n");
	375	sq = sq_create();
	376	nfsphys = create_hash(500);
	377	## retrieve (id = nfsphys.nfsphys_id, name = nfsphys.dir,
a3b4927d	378	## id2 = nfsphys.mach_id, id3 = nfsphys.allocated,
a3b4927d	379	## sid = nfsphys.modby) {
d2543f8c	380	n = (struct nfsphys *) malloc(sizeof(struct nfsphys));
a3b4927d	381	if (n == NULL)
a3b4927d	382	out_of_mem("storing nfsphys");
d2543f8c	383	strcpy(n->dir, strtrim(name));
	384	n->mach_id = id2;
	385	n->nfsphys_id = id;
	386	n->allocated = id3;
	387	n->count = 0;
	388	if (hash_store(nfsphys, id, n)) {
	389	sq_save_data(sq, hash_lookup(nfsphys, id));
	390	sq_save_data(sq, n);
	391	}
a3b4927d	392	if (sid < 0)
a3b4927d	393	string_check(-sid);
d2543f8c	394	## }
	395	generic_fix(sq, show_np_id, "Change ID", fix_np_id, 0);
	396
d2543f8c	397	if (!fast) {
a3b4927d	398	## range of s is strings
d2543f8c	399	## retrieve (id = s.string_id, buf = s.string)
	400	## where s.string = strings.string and s.tid != strings.tid {
	401	printf("String %s(%d) is a duplicate!\n", strtrim(buf), id);
38e6880d	402	printf("Not fixing this error\n");
a3b4927d	403	## }
	404	}
	405
	406	if (!fast) {
	407	dprintf("Scanning krbmap...\n");
	408	## range of k is krbmap
	409	## retrieve (id = k.users_id)
	410	## where k.users_id = krbmap.users_id and k.tid != krbmap.tid {
	411	printf("User %d is in the krbmap more than once!\n", id);
	412	printf("Not fixing this error\n");
	413	## }
	414	## retrieve (id = k.string_id)
	415	## where k.string_id = krbmap.string_id and k.tid != krbmap.tid {
	416	printf("Principal %d is in the krbmap more than once!\n", id);
	417	printf("Not fixing this error\n");
d2543f8c	418	## }
	419	}
	420	##}
	421