10 #define max(x, y) ((x) > (y) ? (x) : (y))
12 EXEC SQL INCLUDE sqlca;
21 unsigned short u_direct:1;
22 unsigned short u_baddirect:1;
23 unsigned short u_found:1;
24 unsigned short u_scanned:1;
27 } *find_member(), *allocmember();
28 #define frefc flags.u_flags.u_ref_count
29 #define fdirect flags.u_flags.u_direct
30 #define fbaddirect flags.u_flags.u_baddirect
31 #define ffound flags.u_flags.u_found
32 #define fscanned flags.u_flags.u_scanned
33 #define fall flags.all
35 #define member2id(c, id) (((c & 0xff) << 24) | (id & 0xffffff))
36 #define id2type(id) ((id >> 24) & 0xff)
37 #define id2id(id) (id & 0xffffff)
40 struct member_list *next;
41 struct member *member;
44 struct hash *lists, *members;
45 void fix_member(), display_member();
46 int debug = 0, records = 0;
57 debug = atoi(argv[1]);
61 EXEC SQL CONNECT moira;
62 /* begin transaction */
63 /* range of m is imembers */
66 lists = create_hash(50000);
67 members = create_hash(300000);
73 hash_step(lists, display_member, NULL);
79 printf("Commit changes (Y/N)?");
81 fgets(buf, sizeof(buf), stdin);
82 if (buf[0] == 'Y' || buf[0] == 'y') {
83 printf("Ending transaction\n");
88 printf("Aborting transaction\n");
90 EXEC SQL ROLLBACK WORK;
96 /* No equivalent (?) */
105 struct member *m, *m1, *md, *ma;
106 struct member_list *descendants, *ancestors, *desc, *ance, la, ld;
107 EXEC SQL BEGIN DECLARE SECTION;
108 int list_id, member_id, ref_count, ref;
110 EXEC SQL END DECLARE SECTION;
111 struct save_queue *sq;
113 printf("Loading members\n");
116 /* retrieve (list_id = m.#list_id, member_id = m.#member_id,
117 * mtype = m.#member_type, ref_count = m.#ref_count)
118 * where m.direct = 1 { */
119 EXEC SQL DECLARE csrm1 CURSOR FOR
120 SELECT list_id, member_id, member_type, ref_count FROM imembers
124 EXEC SQL FETCH csrm1 INTO :list_id, :member_id, :mtype, :ref_count;
125 if(sqlca.sqlcode != 0) break;
129 printf("Working on list %d member %s %d refc %d\n",
130 list_id, mtype, member_id, ref_count);
132 if ((m = find_member(list_id, member2id(mtype[0], member_id))) == NULL) {
134 m->list_id = list_id;
135 m->member_id = member2id(mtype[0], member_id);
140 la.next = (struct member_list *) hash_lookup(members,
141 member2id('L', list_id));
143 if (isinchain(m, la.next))
148 ld.next = (struct member_list *) hash_lookup(lists, member_id);
152 if (isinchain(m, ld.next))
158 printf("%d ancestors, %d descendants\n",
159 chainlen(ance), chainlen(desc));
161 for (ancestors = ance; ancestors; ancestors = ancestors->next) {
162 ma = ancestors->member;
163 for (descendants = desc; descendants; descendants=descendants->next) {
164 md = descendants->member;
165 if (member2id('L', ma->list_id) == md->member_id)
166 fprintf(stderr, "Loop detected! list %d member %d\n",
167 md->list_id, ma->member_id);
168 ref = md->frefc * ma->frefc;
170 ref = max(md->frefc, ma->frefc);
176 printf("Checking list %d member %d, ref = %d\n",
177 ma->list_id, id2id(md->member_id), ref);
179 if (m1 = find_member(ma->list_id, md->member_id)) {
183 printf("set refc to %d (%d) on list %d, member %d\n",
184 m1->frefc, ref, m1->list_id, id2id(m1->member_id));
186 if (ma == m && md == m)
190 m1->list_id = ma->list_id;
191 m1->member_id = md->member_id;
195 printf("set new refc to %d (%d) on list %d, member %d\n",
196 m1->frefc, ref, m1->list_id, id2id(m1->member_id));
198 sq_save_data(sq, m1);
202 while (sq_get_data(sq, &m)) {
209 EXEC SQL CLOSE csrm1;
210 printf("created %d records\n", records);
216 struct save_queue *sq;
217 EXEC SQL BEGIN DECLARE SECTION;
218 int list_id, member_id, ref_count, dflag;
220 EXEC SQL END DECLARE SECTION;
221 int errxtra, errbref, errbdir;
223 int ref0, ref1, ref2, ref3, refg;
224 int db0, db1, db2, db3, dbg;
227 /* verify members from database */
228 printf("Verifying members\n");
229 errxtra = errbref = errbdir = 0;
231 ref0 = ref1 = ref2 = ref3 = refg = 0;
232 db0 = db1 = db2 = db3 = dbg = 0;
235 /* retrieve (list_id = m.#list_id, member_id = m.#member_id,
236 * mtype = m.member_type, ref_count = m.#ref_count,
237 * dflag = m.#direct) { */
238 EXEC SQL DECLARE csrm2 CURSOR FOR
239 SELECT list_id, member_id, member_type, ref_count, direct
244 INTO :list_id, :member_id, :mtype, :ref_count, :dflag;
245 if(sqlca.sqlcode != 0) break;
250 case 0: db0++; break;
251 case 1: db1++; break;
252 case 2: db2++; break;
253 case 3: db3++; break;
257 m = find_member(list_id, member2id(mtype[0], member_id));
260 m->list_id = list_id;
261 m->member_id = member2id(mtype[0], member_id);
263 m->frefc = ref_count;
271 case 0: ref0++; break;
272 case 1: ref1++; break;
273 case 2: ref2++; break;
274 case 3: ref3++; break;
278 m->frefc -= ref_count;
281 if (m->fdirect != dflag) {
287 EXEC SQL CLOSE csrm2;
288 printf("Found %d extra records, %d bad ref counts, %d bad direct flags\n",
289 errxtra, errbref, errbdir);
292 printf("Found in db: %d 0; %d 1; %d 2; %d 3; %d > 3\n",
293 db0, db1, db2, db3, dbg);
294 printf("Found refs: %d 0; %d 1; %d 2; %d 3; %d > 3\n",
295 ref0, ref1, ref2, ref3, refg);
304 struct save_queue *sq;
306 EXEC SQL BEGIN DECLARE SECTION;
307 int list_id, member_id, rowcount;
309 EXEC SQL END DECLARE SECTION;
313 printf("Fixing errors\n");
314 hash_step(lists, fix_member, &errmis);
315 while (sq_get_data(sq, &m)) {
316 printf("Extraneous member record, deleting:\n");
317 list_id = m->list_id;
318 member_id = id2id(m->member_id);
319 switch (id2type(m->member_id)) {
320 case 'U': strcpy(mtype, "USER"); break;
321 case 'L': strcpy(mtype, "LIST"); break;
322 case 'S': strcpy(mtype, "STRING"); break;
323 case 'K': strcpy(mtype, "KERBEROS"); break;
325 mtype[0] = id2type(m->member_id);
328 printf(" List: %d, Member: %s %d, Refc: %d, Direct %d\n",
329 list_id, mtype, member_id, m->frefc, m->fdirect);
331 /* delete m where m.#list_id = list_id and m.#member_id = member_id
332 * and m.member_type = mtype */
333 EXEC SQL DELETE FROM imembers WHERE list_id = :list_id AND
334 member_id = :member_id AND member_type = :mtype;
335 EXEC SQL INQUIRE_SQL(:rowcount = rowcount);
336 printf(" %d rows deleted\n", rowcount);
340 printf("Added %d missing records\n", errmis);
347 struct member_list *l, *l1;
349 l = (struct member_list *) hash_lookup(lists, m->list_id);
351 l = (struct member_list *)malloc(sizeof(struct member_list));
353 fprintf(stderr, "No memory for insert_list\n");
358 if( hash_store(lists, m->list_id, l) == -1 ) {
359 fprintf(stderr,"Out of mem while storing lists in hash table\n");
364 for (l1 = l; l1; l1 = l1->next)
365 if (l1->member->member_id == m->member_id) {
366 fprintf(stderr, "Found 2nd copy of list record for\n");
367 fprintf(stderr, "List: %d, Member: %c %d, Refc: %d, Direct %d\n",
368 m->list_id, id2type(m->member_id), id2id(m->member_id),
369 m->frefc, m->fdirect);
370 kill(getpid(), SIGQUIT);
374 l1 = (struct member_list *)malloc(sizeof(struct member_list));
376 fprintf(stderr, "No memory for insert_list\n");
388 struct member_list *l, *l1;
390 l = (struct member_list *) hash_lookup(members, m->member_id);
392 l = (struct member_list *)malloc(sizeof(struct member_list));
394 fprintf(stderr, "No memory for insert_member\n");
399 if( hash_store(members, m->member_id, l) == -1 ) {
400 fprintf(stderr,"Out of mem while storing members in hash table\n");
406 for (l1 = l; l1; l1 = l1->next)
407 if (l1->member->list_id == m->list_id) {
408 fprintf(stderr, "Found 2nd copy of member record for\n");
409 fprintf(stderr, "List: %d, Member: %c %d, Refc: %d, Direct %d\n",
410 m->list_id, id2type(m->member_id), id2id(m->member_id),
411 m->frefc, m->fdirect);
412 kill(getpid(), SIGQUIT);
416 l1 = (struct member_list *)malloc(sizeof(struct member_list));
418 fprintf(stderr, "No memory for insert_member\n");
427 struct member *find_member(listid, memberid)
431 struct member_list *l;
433 for (l = (struct member_list *) hash_lookup(lists, listid); l; l = l->next)
434 if (l->member->member_id == memberid)
441 void fix_member(dummy, l, errmis)
443 struct member_list *l;
446 EXEC SQL BEGIN DECLARE SECTION;
447 int list_id, member_id, ref_count, dflag, rowcount;
449 EXEC SQL END DECLARE SECTION;
453 for (; l; l = l->next) {
459 if (m->fbaddirect == 0 && m->frefc == 0 && m->ffound == 1)
461 if (m->ffound == 0) {
462 printf("Missing member record, adding:\n");
463 list_id = m->list_id;
464 member_id = id2id(m->member_id);
465 ref_count = m->frefc;
467 switch (id2type(m->member_id)) {
468 case 'U': mtype = "USER"; break;
469 case 'L': mtype = "LIST"; break;
470 case 'S': mtype = "STRING"; break;
471 case 'K': mtype = "KERBEROS"; break;
474 buf[0] = id2type(m->member_id);
477 printf(" List: %d, Member: %s %d, Refc: %d, Direct %d\n",
478 list_id, mtype, member_id, ref_count, dflag);
481 /* append imembers (#list_id = list_id, #member_id = member_id,
482 * member_type = mtype, #ref_count = ref_count,
483 * direct = dflag); */
484 EXEC SQL INSERT INTO imembers (list_id, member_id,
485 member_type, ref_count, direct)
486 VALUES (:list_id, :member_id, :mtype, :ref_count, :dflag);
487 EXEC SQL INQUIRE_SQL(:rowcount = rowcount);
488 printf(" %d rows added\n", rowcount);
492 printf("Member record has bad ref_count and/or direct flag, fixing\n");
493 list_id = m->list_id;
494 member_id = id2id(m->member_id);
495 ref_count = m->frefc;
497 switch (id2type(m->member_id)) {
498 case 'U': mtype = "USER"; break;
499 case 'L': mtype = "LIST"; break;
500 case 'S': mtype = "STRING"; break;
501 case 'K': mtype = "KERBEROS"; break;
504 buf[0] = id2type(m->member_id);
507 printf(" List: %d, Member: %s %d, Refc: %d, Direct %d\n",
508 list_id, mtype, member_id, ref_count, dflag);
510 /* replace m (#ref_count = m.#ref_count + ref_count, direct = dflag)
511 * where m.#list_id = list_id and m.#member_id = member_id and
512 * m.member_type = mtype */
513 EXEC SQL UPDATE imembers
514 SET ref_count=ref_count+:ref_count, direct = :dflag
515 WHERE list_id = :list_id AND member_id = :member_id AND
517 EXEC SQL INQUIRE_SQL(:rowcount = rowcount);
518 printf(" %d rows fixed\n", rowcount);
524 struct member *allocmember()
528 m = (struct member *) malloc(sizeof(struct member));
530 fprintf(stderr, "No memory for new member\n");
541 struct member_list *l;
543 for (; l; l = l->next)
551 struct member_list *l;
554 for (i = 0; l; l = l->next, i++);
562 void display_member(key, l, dummy1)
564 struct member_list *l;
570 for(; l; l = l->next) {
572 switch (id2type(m->member_id)) {
573 case 'U': mtype = "USER"; break;
574 case 'L': mtype = "LIST"; break;
575 case 'S': mtype = "STRING"; break;
576 case 'K': mtype = "KERBEROS"; break;
577 default: mtype = "???"; break;
579 printf("List: %d, Member: %s %d, Refc: %d, Direct %d\n",
580 m->list_id, mtype, id2id(m->member_id), m->frefc,