2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 /* Read a VLDB file and verify it for correctness */
12 #define VL 0x001 /* good volume entry */
13 #define FR 0x002 /* free volume entry */
14 #define MH 0x004 /* multi-homed entry */
16 #define RWH 0x010 /* on rw hash chain */
17 #define ROH 0x020 /* on ro hash chain */
18 #define BKH 0x040 /* on bk hash chain */
19 #define NH 0x080 /* on name hash chain */
21 #define MHC 0x100 /* on multihomed chain */
22 #define FRC 0x200 /* on free chain */
24 #define REFRW 0x1000 /* linked from something (RW) */
25 #define REFRO 0x2000 /* linked from something (RO) */
26 #define REFBK 0x4000 /* linked from something (BK) */
27 #define REFN 0x8000 /* linked from something (name) */
29 #define MULTRW 0x10000 /* multiply-chained (RW) */
30 #define MULTRO 0x20000 /* multiply-chained (RO) */
31 #define MULTBK 0x40000 /* multiply-chained (BK) */
32 #define MULTN 0x80000 /* multiply-chained (name) */
34 #define MISRWH 0x100000 /* mischained (RW) */
35 #define MISROH 0x200000 /* mischained (RO) */
36 #define MISBKH 0x400000 /* mischained (BK) */
37 #define MISNH 0x800000 /* mischained (name) */
39 #define vldbread(x,y,z) vldbio(x,y,z,0)
40 #define vldbwrite(x,y,z) vldbio(x,y,z,1)
42 #include <afsconfig.h>
43 #include <afs/param.h>
48 #include <sys/types.h>
55 #include <WINNT/afsevent.h>
58 #include <sys/socket.h>
60 #include <netinet/in.h>
66 #include <afs/afsutil.h>
69 #define ADDR(x) (x/sizeof(struct nvlentry))
72 int listentries, listservers, listheader, listuheader, verbose;
82 int serveraddrs[MAXSERVERID + 2];
88 /* Bump the version number?? We could cheat and push a new db... */
97 struct ubik_hdr uheader;
99 offset = lseek(fd, 0, 0);
101 printf("error: lseek to 0 failed: %d %d\n", offset, errno);
105 /* now read the info */
106 r = read(fd, &uheader, sizeof(uheader));
107 if (r != sizeof(uheader)) {
108 printf("error: read of %d bytes failed: %d %d\n", sizeof(uheader), r,
113 uheader.magic = ntohl(uheader.magic);
114 uheader.size = ntohl(uheader.size);
115 uheader.version.epoch = ntohl(uheader.version.epoch);
116 uheader.version.counter = ntohl(uheader.version.counter);
119 printf("Ubik Header\n");
120 printf(" Magic = 0x%x\n", uheader.magic);
121 printf(" Size = %u\n", uheader.size);
122 printf(" Version.epoch = %u\n", uheader.version.epoch);
123 printf(" Version.counter = %u\n", uheader.version.counter);
126 if (uheader.size != HDRSIZE)
127 printf("Ubik header size is %u (should be %u)\n", uheader.size,
129 if (uheader.magic != UBIK_MAGIC)
130 printf("Ubik header magic is 0x%x (should be 0x%x)\n", uheader.magic,
137 vldbio(int position, char *buffer, int size, int rdwr)
141 /* seek to the correct spot. skip ubik stuff */
142 p = position + HDRSIZE;
143 offset = lseek(fd, p, 0);
145 printf("error: lseek to %d failed: %d %d\n", p, offset, errno);
150 r = write(fd, buffer, size);
152 r = read(fd, buffer, size);
155 printf("error: %s of %d bytes failed: %d %d\n", rdwr==1?"write":"read",
179 NameHash(char *volname)
185 for (vchar = volname + strlen(volname) - 1; vchar >= volname; vchar--)
186 hash = (hash * 63) + (*((unsigned char *)vchar) - 63);
187 return (hash % HASHSIZE);
191 IdHash(afs_int32 volid)
193 return ((abs(volid)) % HASHSIZE);
196 #define LEGALCHARS ".ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
198 InvalidVolname(char *volname)
204 slen = strlen(volname);
205 if (slen >= VL_MAXNAMELEN)
207 return (slen != strspn(volname, map));
211 readheader(struct vlheader *headerp)
215 vldbread(0, headerp, sizeof(*headerp));
217 headerp->vital_header.vldbversion =
218 ntohl(headerp->vital_header.vldbversion);
219 headerp->vital_header.headersize =
220 ntohl(headerp->vital_header.headersize);
221 headerp->vital_header.freePtr = ntohl(headerp->vital_header.freePtr);
222 headerp->vital_header.eofPtr = ntohl(headerp->vital_header.eofPtr);
223 headerp->vital_header.allocs = ntohl(headerp->vital_header.allocs);
224 headerp->vital_header.frees = ntohl(headerp->vital_header.frees);
225 headerp->vital_header.MaxVolumeId =
226 ntohl(headerp->vital_header.MaxVolumeId);
227 headerp->vital_header.totalEntries[0] =
228 ntohl(headerp->vital_header.totalEntries[0]);
229 for (i = 0; i < MAXTYPES; i++)
230 headerp->vital_header.totalEntries[i] =
231 ntohl(headerp->vital_header.totalEntries[1]);
233 headerp->SIT = ntohl(headerp->SIT);
234 for (i = 0; i < MAXSERVERID; i++)
235 headerp->IpMappedAddr[i] = ntohl(headerp->IpMappedAddr[i]);
236 for (i = 0; i < HASHSIZE; i++)
237 headerp->VolnameHash[i] = ntohl(headerp->VolnameHash[i]);
238 for (i = 0; i < MAXTYPES; i++)
239 for (j = 0; j < HASHSIZE; j++)
240 headerp->VolidHash[i][j] = ntohl(headerp->VolidHash[i][j]);
243 printf("vldb header\n");
244 printf(" vldbversion = %u\n",
245 headerp->vital_header.vldbversion);
246 printf(" headersize = %u [actual=%u]\n",
247 headerp->vital_header.headersize, sizeof(*headerp));
248 printf(" freePtr = 0x%x\n", headerp->vital_header.freePtr);
249 printf(" eofPtr = %u\n", headerp->vital_header.eofPtr);
250 printf(" allocblock calls = %10u\n", headerp->vital_header.allocs);
251 printf(" freeblock calls = %10u\n", headerp->vital_header.frees);
252 printf(" MaxVolumeId = %u\n",
253 headerp->vital_header.MaxVolumeId);
254 printf(" rw vol entries = %u\n",
255 headerp->vital_header.totalEntries[0]);
256 printf(" ro vol entries = %u\n",
257 headerp->vital_header.totalEntries[1]);
258 printf(" bk vol entries = %u\n",
259 headerp->vital_header.totalEntries[2]);
260 printf(" multihome info = 0x%x (%u)\n", headerp->SIT,
262 printf(" server ip addr table: size = %d entries\n",
264 printf(" volume name hash table: size = %d buckets\n", HASHSIZE);
265 printf(" volume id hash table: %d tables with %d buckets each\n",
269 /* Check the header size */
270 if (headerp->vital_header.headersize != sizeof(*headerp))
271 printf("Header reports its size as %d (should be %d)\n",
272 headerp->vital_header.headersize, sizeof(*headerp));
277 writeheader(struct vlheader *headerp)
281 headerp->vital_header.vldbversion =
282 htonl(headerp->vital_header.vldbversion);
283 headerp->vital_header.headersize =
284 htonl(headerp->vital_header.headersize);
285 headerp->vital_header.freePtr = htonl(headerp->vital_header.freePtr);
286 headerp->vital_header.eofPtr = htonl(headerp->vital_header.eofPtr);
287 headerp->vital_header.allocs = htonl(headerp->vital_header.allocs);
288 headerp->vital_header.frees = htonl(headerp->vital_header.frees);
289 headerp->vital_header.MaxVolumeId =
290 htonl(headerp->vital_header.MaxVolumeId);
291 headerp->vital_header.totalEntries[0] =
292 htonl(headerp->vital_header.totalEntries[0]);
293 for (i = 0; i < MAXTYPES; i++)
294 headerp->vital_header.totalEntries[i] =
295 htonl(headerp->vital_header.totalEntries[1]);
297 headerp->SIT = htonl(headerp->SIT);
298 for (i = 0; i < MAXSERVERID; i++)
299 headerp->IpMappedAddr[i] = htonl(headerp->IpMappedAddr[i]);
300 for (i = 0; i < HASHSIZE; i++)
301 headerp->VolnameHash[i] = htonl(headerp->VolnameHash[i]);
302 for (i = 0; i < MAXTYPES; i++)
303 for (j = 0; j < HASHSIZE; j++)
304 headerp->VolidHash[i][j] = htonl(headerp->VolidHash[i][j]);
306 vldbwrite(0, headerp, sizeof(*headerp));
310 readMH(afs_int32 addr, struct extentaddr *mhblockP)
313 struct extentaddr *e;
315 vldbread(addr, mhblockP, VL_ADDREXTBLK_SIZE);
317 mhblockP->ex_count = ntohl(mhblockP->ex_count);
318 mhblockP->ex_flags = ntohl(mhblockP->ex_flags);
319 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++)
320 mhblockP->ex_contaddrs[i] = ntohl(mhblockP->ex_contaddrs[i]);
322 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
325 /* won't convert hostuuid */
326 e->ex_uniquifier = ntohl(e->ex_uniquifier);
327 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++)
328 e->ex_addrs[j] = ntohl(e->ex_addrs[j]);
334 readentry(afs_int32 addr, struct nvlentry *vlentryp, afs_int32 *type)
338 vldbread(addr, vlentryp, sizeof(*vlentryp));
340 for (i = 0; i < MAXTYPES; i++)
341 vlentryp->volumeId[i] = ntohl(vlentryp->volumeId[i]);
342 vlentryp->flags = ntohl(vlentryp->flags);
343 vlentryp->LockAfsId = ntohl(vlentryp->LockAfsId);
344 vlentryp->LockTimestamp = ntohl(vlentryp->LockTimestamp);
345 vlentryp->cloneId = ntohl(vlentryp->cloneId);
346 for (i = 0; i < MAXTYPES; i++)
347 vlentryp->nextIdHash[i] = ntohl(vlentryp->nextIdHash[i]);
348 vlentryp->nextNameHash = ntohl(vlentryp->nextNameHash);
349 for (i = 0; i < NMAXNSERVERS; i++) {
350 vlentryp->serverNumber[i] = ntohl(vlentryp->serverNumber[i]);
351 vlentryp->serverPartition[i] = ntohl(vlentryp->serverPartition[i]);
352 vlentryp->serverFlags[i] = ntohl(vlentryp->serverFlags[i]);
355 if (vlentryp->flags == VLCONTBLOCK) {
357 } else if (vlentryp->flags == VLFREE) {
364 printf("address %u: ", addr);
365 if (vlentryp->flags == VLCONTBLOCK) {
366 printf("mh extension block\n");
367 } else if (vlentryp->flags == VLFREE) {
368 printf("free vlentry\n");
370 printf("vlentry %s\n", vlentryp->name);
371 printf(" rw id = %u ; ro id = %u ; bk id = %u\n",
372 vlentryp->volumeId[0], vlentryp->volumeId[1],
373 vlentryp->volumeId[2]);
375 if (vlentryp->flags & VLF_RWEXISTS)
377 if (vlentryp->flags & VLF_ROEXISTS)
379 if (vlentryp->flags & VLF_BACKEXISTS)
381 if (vlentryp->flags & 0xffff8fff)
382 printf(" errorflag(0x%x)", vlentryp->flags);
384 printf(" LockAfsId = %d\n", vlentryp->LockAfsId);
385 printf(" LockTimestamp = %d\n", vlentryp->LockTimestamp);
386 printf(" cloneId = %u\n", vlentryp->cloneId);
388 (" next hash for rw = %u ; ro = %u ; bk = %u ; name = %u\n",
389 vlentryp->nextIdHash[0], vlentryp->nextIdHash[1],
390 vlentryp->nextIdHash[2], vlentryp->nextNameHash);
391 for (i = 0; i < NMAXNSERVERS; i++) {
392 if (vlentryp->serverNumber[i] != 255) {
393 printf(" server %d ; partition %d ; flags =",
394 vlentryp->serverNumber[i],
395 vlentryp->serverPartition[i]);
396 if (vlentryp->serverFlags[i] & VLSF_RWVOL)
398 if (vlentryp->serverFlags[i] & VLSF_ROVOL)
400 if (vlentryp->serverFlags[i] & VLSF_BACKVOL)
402 if (vlentryp->serverFlags[i] & VLSF_NEWREPSITE)
413 writeentry(afs_int32 addr, struct nvlentry *vlentryp)
418 printf("Writing back entry at addr %u\n", addr);
420 for (i = 0; i < MAXTYPES; i++)
421 vlentryp->volumeId[i] = htonl(vlentryp->volumeId[i]);
422 vlentryp->flags = htonl(vlentryp->flags);
423 vlentryp->LockAfsId = htonl(vlentryp->LockAfsId);
424 vlentryp->LockTimestamp = htonl(vlentryp->LockTimestamp);
425 vlentryp->cloneId = htonl(vlentryp->cloneId);
426 for (i = 0; i < MAXTYPES; i++)
427 vlentryp->nextIdHash[i] = htonl(vlentryp->nextIdHash[i]);
428 vlentryp->nextNameHash = htonl(vlentryp->nextNameHash);
429 for (i = 0; i < NMAXNSERVERS; i++) {
430 vlentryp->serverNumber[i] = htonl(vlentryp->serverNumber[i]);
431 vlentryp->serverPartition[i] = htonl(vlentryp->serverPartition[i]);
432 vlentryp->serverFlags[i] = htonl(vlentryp->serverFlags[i]);
434 vldbwrite(addr, vlentryp, sizeof(*vlentryp));
438 readSIT(int base, int addr)
441 char sitbuf[VL_ADDREXTBLK_SIZE];
442 struct extentaddr *extent;
446 vldbread(addr, sitbuf, VL_ADDREXTBLK_SIZE);
447 extent = (struct extentaddr *)sitbuf;
449 printf("multihome info block: base %d\n", base);
451 printf(" count = %u\n", ntohl(extent->ex_count));
452 printf(" flags = %u\n", ntohl(extent->ex_flags));
453 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
454 printf(" contaddrs[%d] = %u\n", i,
455 ntohl(extent->ex_contaddrs[i]));
458 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
459 /* should we skip this entry */
460 for (j = 0; j < VL_MAX_ADDREXTBLKS; j++) {
461 if (extent[i].ex_addrs[j])
464 if (j >= VL_MAX_ADDREXTBLKS)
467 printf(" base %d index %d:\n", base, i);
469 printf(" afsuuid = (%x %x %x /%d/%d/ /%x/%x/%x/%x/%x/%x/)\n",
470 ntohl(extent[i].ex_hostuuid.time_low),
471 ntohl(extent[i].ex_hostuuid.time_mid),
472 ntohl(extent[i].ex_hostuuid.time_hi_and_version),
473 ntohl(extent[i].ex_hostuuid.clock_seq_hi_and_reserved),
474 ntohl(extent[i].ex_hostuuid.clock_seq_low),
475 ntohl(extent[i].ex_hostuuid.node[0]),
476 ntohl(extent[i].ex_hostuuid.node[1]),
477 ntohl(extent[i].ex_hostuuid.node[2]),
478 ntohl(extent[i].ex_hostuuid.node[3]),
479 ntohl(extent[i].ex_hostuuid.node[4]),
480 ntohl(extent[i].ex_hostuuid.node[5]));
481 printf(" uniquifier = %u\n", ntohl(extent[i].ex_uniquifier));
482 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
483 a = ntohl(extent[i].ex_addrs[j]);
485 printf(" %d.%d.%d.%d\n", (a >> 24) & 0xff,
486 (a >> 16) & 0xff, (a >> 8) & 0xff, (a) & 0xff);
493 * Read each entry in the database:
494 * Record what type of entry it is and its address in the record array.
495 * Remember what the maximum volume id we found is and check against the header.
498 ReadAllEntries(struct vlheader *header)
500 afs_int32 type, rindex, i, j, e;
501 int freecount = 0, mhcount = 0, vlcount = 0;
502 int rwcount = 0, rocount = 0, bkcount = 0;
503 struct nvlentry vlentry;
504 afs_uint32 addr, entrysize, maxvolid = 0;
507 printf("Read each entry in the database\n");
508 for (addr = header->vital_header.headersize;
509 addr < header->vital_header.eofPtr; addr += entrysize) {
511 /* Remember the highest volume id */
512 readentry(addr, &vlentry, &type);
514 if (!(vlentry.flags & VLF_RWEXISTS))
515 printf("WARNING: VLDB entry '%s' has no RW volume\n",
518 for (i = 0; i < MAXTYPES; i++)
519 if (maxvolid < vlentry.volumeId[i])
520 maxvolid = vlentry.volumeId[i];
523 for (j = 0; j < NMAXNSERVERS; j++) {
524 if (vlentry.serverNumber[j] == 255)
526 if (vlentry.serverFlags[j] & (VLSF_ROVOL | VLSF_NEWREPSITE)) {
530 if (vlentry.serverFlags[j] & VLSF_RWVOL) {
532 if (vlentry.flags & VLF_BACKEXISTS)
536 if (!vlentry.serverFlags[j]) {
542 ("VLDB entry '%s' contains an unknown RW/RO index serverFlag\n",
547 (" index %d : serverNumber %d : serverPartition %d : serverFlag %d\n",
548 j, vlentry.serverNumber[j], vlentry.serverPartition[j],
549 vlentry.serverFlags[j]);
553 rindex = addr / sizeof(vlentry);
554 if (record[rindex].type) {
555 printf("INTERNAL ERROR: record holder %d already in use\n",
559 record[rindex].addr = addr;
560 record[rindex].type = type;
562 /* Determine entrysize and keep count */
564 entrysize = sizeof(vlentry);
566 } else if (type == FR) {
567 entrysize = sizeof(vlentry);
569 } else if (type == MH) {
570 entrysize = VL_ADDREXTBLK_SIZE;
573 printf("Unknown entry at %u\n", addr);
577 printf("Found %d entries, %d free entries, %d multihomed blocks\n",
578 vlcount, freecount, mhcount);
579 printf("Found %d RW volumes, %d BK volumes, %d RO volumes\n", rwcount,
583 /* Check the maxmimum volume id in the header */
584 if (maxvolid != header->vital_header.MaxVolumeId - 1)
586 ("Header's maximum volume id is %u and largest id found in VLDB is %u\n",
587 header->vital_header.MaxVolumeId, maxvolid);
592 SetHashEnd(long addr, int type, long new)
594 struct nvlentry vlentry;
595 afs_int32 i, rindex, type2, next = -1;
597 for (; addr; addr = next) {
598 readentry(addr, &vlentry, &type2);
599 switch(type & 0xf0) {
601 next = vlentry.nextIdHash[0];
604 next = vlentry.nextIdHash[1];
607 next = vlentry.nextIdHash[2];
610 next = vlentry.nextNameHash;
617 switch(type & 0xf0) {
619 if (vlentry.nextIdHash[0] != 0) {printf("bwoop\n");}
620 vlentry.nextIdHash[0] = new;
623 if (vlentry.nextIdHash[1] != 0) {printf("bwoop\n");}
624 vlentry.nextIdHash[1] = new;
627 if (vlentry.nextIdHash[2] != 0) {printf("bwoop\n");}
628 vlentry.nextIdHash[2] = new;
631 if (vlentry.nextNameHash != 0) {printf("bwoop\n");}
632 vlentry.nextNameHash = new;
635 writeentry(addr, &vlentry);
642 * Follow each Name hash bucket marking it as read in the record array.
643 * Record we found it in the name hash within the record array.
644 * Check that the name is hashed correctly.
647 FollowNameHash(struct vlheader *header)
649 int count = 0, longest = 0, shortest = -1, chainlength;
650 struct nvlentry vlentry;
652 afs_int32 i, type, rindex;
654 /* Now follow the Name Hash Table */
656 printf("Check Volume Name Hash\n");
657 for (i = 0; i < HASHSIZE; i++) {
659 for (addr = header->VolnameHash[i]; addr; addr = vlentry.nextNameHash) {
660 readentry(addr, &vlentry, &type);
662 printf("Name Hash %d: Bad entry at %u: Not a valid vlentry\n",
667 rindex = addr / sizeof(vlentry);
669 if (record[rindex].addr != addr && record[rindex].addr) {
671 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
672 record[rindex].addr, addr, rindex);
674 if (record[rindex].type & NH) {
676 ("Name Hash %d: Bad entry '%s': Already in the name hash\n",
678 record[rindex].type |= MULTN;
681 record[rindex].type |= NH;
682 record[rindex].type |= REFN;
687 /* Hash the name and check if in correct hash table */
688 if (NameHash(vlentry.name) != i) {
690 ("Name Hash %d: Bad entry '%s': Incorrect name hash chain (should be in %d)\n",
691 i, vlentry.name, NameHash(vlentry.name));
692 record[rindex].type |= MULTN;
695 if (chainlength > longest)
696 longest = chainlength;
697 if ((shortest == -1) || (chainlength < shortest))
698 shortest = chainlength;
702 ("%d entries in name hash, longest is %d, shortest is %d, average length is %f\n",
703 count, longest, shortest, ((float)count / (float)HASHSIZE));
709 * Follow the ID hash chains for the RW, RO, and BK hash tables.
710 * Record we found it in the id hash within the record array.
711 * Check that the ID is hashed correctly.
714 FollowIdHash(struct vlheader *header)
716 int count = 0, longest = 0, shortest = -1, chainlength;
717 struct nvlentry vlentry;
719 afs_int32 i, j, hash, type, rindex, ref, badref, badhash;
721 /* Now follow the RW, RO, and BK Hash Tables */
723 printf("Check RW, RO, and BK id Hashes\n");
724 for (i = 0; i < MAXTYPES; i++) {
725 hash = ((i == 0) ? RWH : ((i == 1) ? ROH : BKH));
726 ref = ((i == 0) ? REFRW : ((i == 1) ? REFRO : REFBK));
727 badref = ((i == 0) ? MULTRW : ((i == 1) ? MULTRO : MULTBK));
728 badhash = ((i == 0) ? MULTRW : ((i == 1) ? MULTRO : MULTBK));
732 for (j = 0; j < HASHSIZE; j++) {
734 for (addr = header->VolidHash[i][j]; addr;
735 addr = vlentry.nextIdHash[i]) {
736 readentry(addr, &vlentry, &type);
739 ("%s Id Hash %d: Bad entry at %u: Not a valid vlentry\n",
744 rindex = addr / sizeof(vlentry);
745 if (record[rindex].addr != addr && record[rindex].addr) {
747 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
748 record[rindex].addr, addr, rindex);
750 if (record[rindex].type & hash) {
752 ("%s Id Hash %d: Bad entry '%s': Already in the hash table\n",
753 vtype(i), j, vlentry.name);
754 record[rindex].type |= badref;
757 record[rindex].type |= hash;
758 record[rindex].type |= ref;
763 /* Hash the id and check if in correct hash table */
764 if (IdHash(vlentry.volumeId[i]) != j) {
766 ("%s Id Hash %d: Bad entry '%s': Incorrect Id hash chain (should be in %d)\n",
767 vtype(i), j, vlentry.name,
768 IdHash(vlentry.volumeId[i]));
769 record[rindex].type |= badhash;
770 printf("%d: %x\n", rindex, record[rindex].type);
774 if (chainlength > longest)
775 longest = chainlength;
776 if ((shortest == -1) || (chainlength < shortest))
777 shortest = chainlength;
781 ("%d entries in %s hash, longest is %d, shortest is %d, average length is %f\n",
782 count, vtype(i), longest, shortest,
783 ((float)count / (float)HASHSIZE));
790 * Follow the free chain.
791 * Record we found it in the free chain within the record array.
794 FollowFreeChain(struct vlheader *header)
797 struct nvlentry vlentry;
799 afs_int32 type, rindex;
801 /* Now follow the Free Chain */
803 printf("Check Volume Free Chain\n");
804 for (addr = header->vital_header.freePtr; addr;
805 addr = vlentry.nextIdHash[0]) {
806 readentry(addr, &vlentry, &type);
809 ("Free Chain %d: Bad entry at %u: Not a valid free vlentry (0x%x)\n",
814 rindex = addr / sizeof(vlentry);
815 if (record[rindex].addr != addr && record[rindex].addr) {
817 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
818 record[rindex].addr, addr, rindex);
820 if (record[rindex].type & FRC) {
821 printf("Free Chain: Bad entry at %u: Already in the free chain\n",
825 record[rindex].type |= FRC;
830 printf("%d entries on free chain\n", count);
835 * Read each multihomed block and mark it as found in the record.
836 * Read each entry in each multihomed block and mark the serveraddrs
837 * array with the number of ip addresses found for this entry.
839 * Then read the IpMappedAddr array in the header.
840 * Verify that multihomed entries base and index are valid and points to
841 * a good multhomed entry.
842 * Mark the serveraddrs array with 1 ip address for regular entries.
844 * By the end, the severaddrs array will have a 0 if the entry has no
845 * IP addresses in it or the count of the number of IP addresses.
847 * The code does not verify if there are duplicate IP addresses in the
848 * list. The vlserver does this when a fileserver registeres itself.
851 CheckIpAddrs(struct vlheader *header)
854 afs_int32 i, j, m, rindex;
855 afs_int32 mhentries, regentries;
856 afs_int32 caddrs[VL_MAX_ADDREXTBLKS];
857 char mhblock[VL_ADDREXTBLK_SIZE];
858 struct extentaddr *MHblock = (struct extentaddr *)mhblock;
859 struct extentaddr *e;
860 int ipindex, ipaddrs;
863 memset(&nulluuid, 0, sizeof(nulluuid));
866 printf("Check Multihomed blocks\n");
869 /* Read the first MH block and from it, gather the
870 * addresses of all the mh blocks.
872 readMH(header->SIT, MHblock);
873 if (MHblock->ex_flags != VLCONTBLOCK) {
875 ("Multihomed Block 0: Bad entry at %u: Not a valid multihomed block\n",
879 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
880 caddrs[i] = MHblock->ex_contaddrs[i];
883 if (header->SIT != caddrs[0]) {
885 ("MH block does not point to self %u in header, %u in block\n",
886 header->SIT, caddrs[0]);
889 /* Now read each MH block and record it in the record array */
890 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
894 readMH(caddrs[i], MHblock);
895 if (MHblock->ex_flags != VLCONTBLOCK) {
897 ("Multihomed Block 0: Bad entry at %u: Not a valid multihomed block\n",
901 rindex = caddrs[i] / sizeof(vlentry);
902 if (record[rindex].addr != caddrs[i] && record[rindex].addr) {
904 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
905 record[rindex].addr, caddrs[i], rindex);
907 if (record[rindex].type & FRC) {
909 ("MH Blocks Chain %d: Bad entry at %u: Already a MH block\n",
910 i, record[rindex].addr);
913 record[rindex].type |= MHC;
917 /* Read each entry in a multihomed block.
918 * Find the pointer to the entry in the IpMappedAddr array and
919 * verify that the entry is good (has IP addresses in it).
922 for (j = 1; j < VL_MHSRV_PERBLK; j++) {
923 e = (struct extentaddr *)&(MHblock[j]);
925 /* Search the IpMappedAddr array for the reference to this entry */
926 for (ipindex = 0; ipindex < MAXSERVERID; ipindex++) {
927 if (((header->IpMappedAddr[ipindex] & 0xff000000) ==
931 IpMappedAddr[ipindex] & 0x00ff0000) >> 16) == i)
932 && ((header->IpMappedAddr[ipindex] & 0x0000ffff) ==
937 if (ipindex >= MAXSERVERID)
940 serveraddrs[ipindex] = -1;
942 if (memcmp(&e->ex_hostuuid, &nulluuid, sizeof(afsUUID)) == 0) {
945 ("Server Addrs index %d references null MH block %d, index %d\n",
947 serveraddrs[ipindex] = 0; /* avoids printing 2nd error below */
952 /* Step through each ip address and count the good addresses */
954 for (m = 0; m < VL_MAXIPADDRS_PERMH; m++) {
959 /* If we found any good ip addresses, mark it in the serveraddrs record */
964 ("MH block %d, index %d: Not referenced by server addrs\n",
967 serveraddrs[ipindex] = ipaddrs; /* It is good */
971 if (listservers && ipaddrs) {
972 printf("MH block %d, index %d:", i, j);
973 for (m = 0; m < VL_MAXIPADDRS_PERMH; m++) {
976 printf(" %d.%d.%d.%d",
977 (e->ex_addrs[m] & 0xff000000) >> 24,
978 (e->ex_addrs[m] & 0x00ff0000) >> 16,
979 (e->ex_addrs[m] & 0x0000ff00) >> 8,
980 (e->ex_addrs[m] & 0x000000ff));
986 * if (mhentries != MHblock->ex_count) {
987 * printf("MH blocks says it has %d entries (found %d)\n",
988 * MHblock->ex_count, mhentries);
994 printf("%d multihomed blocks\n", mhblocks);
996 /* Check the server addresses */
998 printf("Check server addresses\n");
999 mhentries = regentries = 0;
1000 for (i = 0; i <= MAXSERVERID; i++) {
1001 if (header->IpMappedAddr[i]) {
1002 if ((header->IpMappedAddr[i] & 0xff000000) == 0xff000000) {
1004 if (((header->IpMappedAddr[i] & 0x00ff0000) >> 16) >
1007 ("IP Addr for entry %d: Multihome block is bad (%d)\n",
1008 i, ((header->IpMappedAddr[i] & 0x00ff0000) >> 16));
1009 if (((header->IpMappedAddr[i] & 0x0000ffff) > VL_MHSRV_PERBLK)
1010 || ((header->IpMappedAddr[i] & 0x0000ffff) < 1))
1012 ("IP Addr for entry %d: Multihome index is bad (%d)\n",
1013 i, (header->IpMappedAddr[i] & 0x0000ffff));
1014 if (serveraddrs[i] == -1) {
1016 ("warning: IP Addr for entry %d: Multihome entry has no ip addresses\n",
1021 printf(" Server ip addr %d = MH block %d, index %d\n",
1022 i, (header->IpMappedAddr[i] & 0x00ff0000) >> 16,
1023 (header->IpMappedAddr[i] & 0x0000ffff));
1027 serveraddrs[i] = 1; /* It is good */
1029 printf(" Server ip addr %d = %d.%d.%d.%d\n", i,
1030 (header->IpMappedAddr[i] & 0xff000000) >> 24,
1031 (header->IpMappedAddr[i] & 0x00ff0000) >> 16,
1032 (header->IpMappedAddr[i] & 0x0000ff00) >> 8,
1033 (header->IpMappedAddr[i] & 0x000000ff));
1039 printf("%d simple entries, %d multihomed entries, Total = %d\n",
1040 regentries, mhentries, mhentries + regentries);
1046 FixBad(afs_uint32 idx, afs_uint32 addr, afs_uint32 type, afs_uint32 tmp,
1047 struct nvlentry *vlentry, afs_uint32 hash) {
1048 SetHashEnd(addr, type, tmp);
1049 printf("linked unlinked chain %u (index %d) to end of chain %d for %s hash\n",
1050 tmp, ADDR(tmp), hash, type==NH?"Name":(type==RWH?"RW":(type==ROH?"RO":"BK")));
1054 WorkerBee(struct cmd_syndesc *as, void *arock)
1057 afs_int32 maxentries, type, tmp;
1058 struct vlheader header;
1059 struct nvlentry vlentry, vlentry2;
1062 dbfile = as->parms[0].items->data; /* -database */
1063 listuheader = (as->parms[1].items ? 1 : 0); /* -uheader */
1064 listheader = (as->parms[2].items ? 1 : 0); /* -vheader */
1065 listservers = (as->parms[3].items ? 1 : 0); /* -servers */
1066 listentries = (as->parms[4].items ? 1 : 0); /* -entries */
1067 verbose = (as->parms[5].items ? 1 : 0); /* -verbose */
1068 fix = (as->parms[6].items ? 1 : 0); /* -fix */
1071 /* open the vldb database file */
1072 fd = open(dbfile, (fix > 0)?O_RDWR:O_RDONLY, 0);
1074 printf("can't open file '%s'. error = %d\n", dbfile, errno);
1078 /* read the ubik header and the vldb database header */
1080 readheader(&header);
1081 if (header.vital_header.vldbversion < 3) {
1082 printf("does not support vldb with version less than 3\n");
1086 maxentries = (header.vital_header.eofPtr / sizeof(vlentry)) + 1;
1087 record = (struct er *)malloc(maxentries * sizeof(struct er));
1088 memset((char *)record, 0, (maxentries * sizeof(struct er)));
1089 memset((char *)serveraddrs, 0, sizeof(serveraddrs));
1091 /* Will fill in the record array of entries it found */
1092 ReadAllEntries(&header);
1093 listentries = 0; /* Listed all the entries */
1095 /* Check the multihomed blocks for valid entries as well as
1096 * the IpMappedAddrs array in the header for valid entries.
1098 CheckIpAddrs(&header);
1100 /* Follow the hash tables */
1101 FollowNameHash(&header);
1102 FollowIdHash(&header);
1104 /* Follow the chain of free entries */
1105 FollowFreeChain(&header);
1107 /* Now check the record we have been keeping for inconsistencies
1108 * For valid vlentries, also check that the server we point to is
1109 * valid (the serveraddrs array).
1112 printf("Verify each volume entry\n");
1113 for (i = 0; i < maxentries; i++) {
1116 int hash, nexthash = 0;
1120 if (record[i].type == 0)
1123 /* If a vlentry, verify that its name is valid, its name and ids are
1124 * on the hash chains, and its server numbers are good.
1126 if (record[i].type & VL) {
1130 readentry(record[i].addr, &vlentry, &type);
1132 if (InvalidVolname(vlentry.name))
1133 printf("Volume '%s' at addr %u has an invalid name\n",
1134 vlentry.name, record[i].addr);
1136 if (!(record[i].type & NH)) {
1137 nextp = ADDR(vlentry.nextNameHash);
1139 hash = NameHash(vlentry.name);
1140 nextpp = &vlentry.nextNameHash;
1142 sprintf(volidbuf, "");
1146 if (vlentry.volumeId[0] && !(record[i].type & RWH)) {
1147 nextp = ADDR(vlentry.nextIdHash[0]);
1149 hash = IdHash(vlentry.volumeId[0]);
1150 nextpp = &(vlentry.nextIdHash[0]);
1152 sprintf(volidbuf, "id %u ", vlentry.volumeId[0]);
1156 if (vlentry.volumeId[1] && !(record[i].type & ROH)) {
1157 nextp = ADDR(vlentry.nextIdHash[1]);
1159 hash = IdHash(vlentry.volumeId[1]);
1160 nextpp = &(vlentry.nextIdHash[1]);
1162 sprintf(volidbuf, "id %u ", vlentry.volumeId[1]);
1166 if (vlentry.volumeId[2] && !(record[i].type & BKH)) {
1167 nextp = ADDR(vlentry.nextIdHash[2]);
1169 hash = IdHash(vlentry.volumeId[2]);
1170 nextpp = &(vlentry.nextIdHash[2]);
1172 sprintf(volidbuf, "id %u ", vlentry.volumeId[2]);
1176 if (record[ADDR(vlentry.nextNameHash)].type & MULTN) {
1177 nextp = ADDR(vlentry.nextNameHash);
1179 hash = NameHash(vlentry.name);
1180 nextpp = &vlentry.nextNameHash;
1182 sprintf(volidbuf, "");
1183 readentry(nextp, &vlentry2, &type);
1184 nexthash = NameHash(vlentry2.name);
1185 if (hash != nexthash)
1189 if ((record[ADDR(vlentry.nextIdHash[0])].type & MULTRW)) {
1190 nextp = ADDR(vlentry.nextIdHash[0]);
1192 hash = IdHash(vlentry.volumeId[0]);
1193 nextpp = &(vlentry.nextIdHash[0]);
1195 sprintf(volidbuf, "id %u ", vlentry.volumeId[0]);
1196 readentry(nextp, &vlentry2, &type);
1197 nexthash = IdHash(vlentry2.volumeId[0]);
1198 if (hash != nexthash)
1202 if ((record[ADDR(vlentry.nextIdHash[1])].type & MULTRO)) {
1203 nextp = ADDR(vlentry.nextIdHash[1]);
1205 hash = IdHash(vlentry.volumeId[1]);
1206 nextpp = &(vlentry.nextIdHash[1]);
1208 sprintf(volidbuf, "id %u ", vlentry.volumeId[1]);
1209 readentry(nextp, &vlentry2, &type);
1210 nexthash = IdHash(vlentry2.volumeId[1]);
1211 if (hash != nexthash)
1215 if ((record[ADDR(vlentry.nextIdHash[2])].type & MULTBK)) {
1216 nextp = ADDR(vlentry.nextIdHash[2]);
1218 hash = IdHash(vlentry.volumeId[2]);
1219 nextpp = &(vlentry.nextIdHash[2]);
1221 sprintf(volidbuf, "id %u ", vlentry.volumeId[2]);
1222 readentry(nextp, &vlentry2, &type);
1223 nexthash = IdHash(vlentry2.volumeId[2]);
1224 if (hash != nexthash)
1229 printf("%d: Volume '%s' %snot found in %s hash %d", i,
1230 vlentry.name, volidbuf, which, hash);
1232 printf(" (next %d", nextp);
1233 if (!(record[nextp].type & reft)) {
1234 printf(" not in chain ");
1235 record[nextp].type |= reft;
1236 } else if (nextp != 0) {
1237 printf(" next in chain");
1239 printf(", unchaining");
1241 writeentry(record[i].addr, &vlentry);
1249 for (j = 0; j < NMAXNSERVERS; j++) {
1250 if ((vlentry.serverNumber[j] != 255)
1251 && (serveraddrs[vlentry.serverNumber[j]] == 0)) {
1253 ("Volume '%s', index %d points to empty server entry %d\n",
1254 vlentry.name, j, vlentry.serverNumber[j]);
1258 if (record[i].type & 0xffff0f00)
1260 ("Volume '%s' id %u also found on other chains (0x%x)\n",
1261 vlentry.name, vlentry.volumeId[0], record[i].type);
1264 } else if (record[i].type & FR) {
1265 if (!(record[i].type & FRC))
1266 printf("Free vlentry at %u not on free chain\n",
1269 if (record[i].type & 0xfffffdf0)
1271 ("Free vlentry at %u also found on other chains (0x%x)\n",
1272 record[i].addr, record[i].type);
1274 /* A multihomed entry */
1275 } else if (record[i].type & MH) {
1276 if (!(record[i].type & MHC))
1277 printf("Multihomed block at %u is orphaned\n",
1280 if (record[i].type & 0xfffffef0)
1282 ("Multihomed block at %u also found on other chains (0x%x)\n",
1283 record[i].addr, record[i].type);
1286 printf("Unknown entry type at %u (0x%x)\n", record[i].addr,
1292 printf("Verify each chain head\n");
1298 for (j = 0; j < HASHSIZE; j++) {
1299 for (addr = header.VolnameHash[j]; j < HASHSIZE; j++) {
1300 if (record[ADDR(addr)].type & MULTN) {
1301 hash = NameHash(vlentry.name);
1303 header.VolnameHash[j] = vlentry.nextNameHash;
1304 vlentry.nextNameHash = 0;
1306 writeentry(record[i].addr, &vlentry);
1311 for (i = 0; i <= 2; i++) {
1312 for (j = 0; j < HASHSIZE; j++) {
1313 addr = header.VolidHash[i][j];
1314 if (i == 0 && (record[ADDR(addr)].type & MULTRW)) {
1315 hash = IdHash(vlentry.volumeId[i]);
1317 header.VolidHash[i][j] = vlentry.nextIdHash[i];
1318 vlentry.nextIdHash[i] = 0;
1320 writeentry(record[i].addr, &vlentry);
1324 if (i == 1 && (record[ADDR(addr)].type & MULTRO)) {
1325 hash = IdHash(vlentry.volumeId[i]);
1327 header.VolidHash[i][j] = vlentry.nextIdHash[i];
1328 vlentry.nextIdHash[i] = 0;
1330 writeentry(record[i].addr, &vlentry);
1334 if (i == 2 && (record[ADDR(addr)].type & MULTBK)) {
1335 hash = IdHash(vlentry.volumeId[i]);
1337 header.VolidHash[i][j] = vlentry.nextIdHash[i];
1338 vlentry.nextIdHash[i] = 0;
1340 writeentry(record[i].addr, &vlentry);
1346 /* By the time we get here, unchained entries are really unchained */
1347 printf("Scanning %u entries for possible repairs\n", maxentries);
1348 for (i = 0; i < maxentries; i++) {
1350 if (record[i].type & VL) {
1351 readentry(record[i].addr, &vlentry, &type);
1352 if (!(record[i].type & REFN)) {
1353 printf("%d: Record %u (type 0x%x) not in a name chain\n", i,
1354 record[i].addr, record[i].type);
1355 if (strlen(vlentry.name)>0) {
1357 if (header.VolnameHash[NameHash(vlentry.name)] == 0)
1358 header.VolnameHash[NameHash(vlentry.name)] = record[i].addr;
1360 FixBad(i, header.VolnameHash[NameHash(vlentry.name)], NH, record[i].addr, &vlentry, NameHash(vlentry.name));
1363 nextpp = &vlentry.nextNameHash;
1364 if (fix && *nextpp) {
1365 printf(", unchaining");
1367 writeentry(record[i].addr, &vlentry);
1371 if (vlentry.volumeId[0] && !(record[i].type & REFRW)) {
1372 printf("%d: Record %u (type 0x%x) not in a RW chain\n", i,
1373 record[i].addr, record[i].type);
1375 if (header.VolidHash[0][IdHash(vlentry.volumeId[0])] == 0)
1376 header.VolidHash[0][IdHash(vlentry.volumeId[0])] = record[i].addr;
1378 FixBad(i, header.VolidHash[0][IdHash(vlentry.volumeId[0])], RWH, record[i].addr, &vlentry, IdHash(vlentry.volumeId[0]));
1381 if (vlentry.volumeId[1] && !(record[i].type & REFRO)) {
1382 printf("%d: Record %u (type 0x%x) not in a RO chain\n", i,
1383 record[i].addr, record[i].type);
1385 if (header.VolidHash[1][IdHash(vlentry.volumeId[1])] == 0)
1386 header.VolidHash[1][IdHash(vlentry.volumeId[1])] = record[i].addr;
1388 FixBad(i, header.VolidHash[1][IdHash(vlentry.volumeId[1])], ROH, record[i].addr, &vlentry, IdHash(vlentry.volumeId[1]));
1391 if (vlentry.volumeId[2] && !(record[i].type & REFBK)) {
1392 printf("%d: Record %u (type 0x%x) not in a BK chain\n", i,
1393 record[i].addr, record[i].type);
1395 if (header.VolidHash[2][IdHash(vlentry.volumeId[2])] == 0)
1396 header.VolidHash[2][IdHash(vlentry.volumeId[2])] = record[i].addr;
1398 FixBad(i, header.VolidHash[2][IdHash(vlentry.volumeId[2])], BKH, record[i].addr, &vlentry, IdHash(vlentry.volumeId[2]));
1405 writeheader(&header);
1421 main(int argc, char **argv)
1423 struct cmd_syndesc *ts;
1427 ts = cmd_CreateSyntax(NULL, WorkerBee, NULL, "vldb check");
1428 cmd_AddParm(ts, "-database", CMD_SINGLE, CMD_REQUIRED, "vldb_file");
1429 cmd_AddParm(ts, "-uheader", CMD_FLAG, CMD_OPTIONAL,
1430 "Display UBIK header");
1431 cmd_AddParm(ts, "-vheader", CMD_FLAG, CMD_OPTIONAL,
1432 "Display VLDB header");
1433 cmd_AddParm(ts, "-servers", CMD_FLAG, CMD_OPTIONAL,
1434 "Display server list");
1435 cmd_AddParm(ts, "-entries", CMD_FLAG, CMD_OPTIONAL, "Display entries");
1436 cmd_AddParm(ts, "-verbose", CMD_FLAG, CMD_OPTIONAL, "verbose");
1437 cmd_AddParm(ts, "-fix", CMD_FLAG, CMD_OPTIONAL, "attempt to patch the database (potentially dangerous)");
1439 return cmd_Dispatch(argc, argv);