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 #include <afsconfig.h>
25 #include <afs/param.h>
30 #include <sys/types.h>
37 #include <WINNT/afsevent.h>
40 #include <sys/socket.h>
42 #include <netinet/in.h>
48 #include <afs/afsutil.h>
52 int listentries, listservers, listheader, listuheader, verbose;
58 int serveraddrs[MAXSERVERID + 2];
66 struct ubik_hdr uheader;
68 offset = lseek(fd, 0, 0);
70 printf("error: lseek to 0 failed: %d %d\n", offset, errno);
74 /* now read the info */
75 r = read(fd, &uheader, sizeof(uheader));
76 if (r != sizeof(uheader)) {
77 printf("error: read of %d bytes failed: %d %d\n", sizeof(uheader), r,
82 uheader.magic = ntohl(uheader.magic);
83 uheader.size = ntohl(uheader.size);
84 uheader.version.epoch = ntohl(uheader.version.epoch);
85 uheader.version.counter = ntohl(uheader.version.counter);
88 printf("Ubik Header\n");
89 printf(" Magic = 0x%x\n", uheader.magic);
90 printf(" Size = %u\n", uheader.size);
91 printf(" Version.epoch = %u\n", uheader.version.epoch);
92 printf(" Version.counter = %u\n", uheader.version.counter);
95 if (uheader.size != HDRSIZE)
96 printf("Ubik header size is %u (should be %u)\n", uheader.size,
98 if (uheader.magic != UBIK_MAGIC)
99 printf("Ubik header magic is 0x%x (should be 0x%x)\n", uheader.magic,
106 vldbread(position, buffer, size)
113 /* seek to the correct spot. skip ubik stuff */
114 p = position + HDRSIZE;
115 offset = lseek(fd, p, 0);
117 printf("error: lseek to %d failed: %d %d\n", p, offset, errno);
121 /* now read the info */
122 r = read(fd, buffer, size);
124 printf("error: read of %d bytes failed: %d %d\n", size, r, errno);
155 for (vchar = volname + strlen(volname) - 1; vchar >= volname; vchar--)
156 hash = (hash * 63) + (*((unsigned char *)vchar) - 63);
157 return (hash % HASHSIZE);
164 return ((abs(volid)) % HASHSIZE);
167 #define LEGALCHARS ".ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
169 InvalidVolname(volname)
176 slen = strlen(volname);
177 if (slen >= VL_MAXNAMELEN)
179 return (slen != strspn(volname, map));
183 struct vlheader *headerp;
187 vldbread(0, headerp, sizeof(*headerp));
189 headerp->vital_header.vldbversion =
190 ntohl(headerp->vital_header.vldbversion);
191 headerp->vital_header.headersize =
192 ntohl(headerp->vital_header.headersize);
193 headerp->vital_header.freePtr = ntohl(headerp->vital_header.freePtr);
194 headerp->vital_header.eofPtr = ntohl(headerp->vital_header.eofPtr);
195 headerp->vital_header.allocs = ntohl(headerp->vital_header.allocs);
196 headerp->vital_header.frees = ntohl(headerp->vital_header.frees);
197 headerp->vital_header.MaxVolumeId =
198 ntohl(headerp->vital_header.MaxVolumeId);
199 headerp->vital_header.totalEntries[0] =
200 ntohl(headerp->vital_header.totalEntries[0]);
201 for (i = 0; i < MAXTYPES; i++)
202 headerp->vital_header.totalEntries[i] =
203 ntohl(headerp->vital_header.totalEntries[1]);
205 headerp->SIT = ntohl(headerp->SIT);
206 for (i = 0; i < MAXSERVERID; i++)
207 headerp->IpMappedAddr[i] = ntohl(headerp->IpMappedAddr[i]);
208 for (i = 0; i < HASHSIZE; i++)
209 headerp->VolnameHash[i] = ntohl(headerp->VolnameHash[i]);
210 for (i = 0; i < MAXTYPES; i++)
211 for (j = 0; j < HASHSIZE; j++)
212 headerp->VolidHash[i][j] = ntohl(headerp->VolidHash[i][j]);
215 printf("vldb header\n");
216 printf(" vldbversion = %u\n",
217 headerp->vital_header.vldbversion);
218 printf(" headersize = %u [actual=%u]\n",
219 headerp->vital_header.headersize, sizeof(*headerp));
220 printf(" freePtr = 0x%x\n", headerp->vital_header.freePtr);
221 printf(" eofPtr = %u\n", headerp->vital_header.eofPtr);
222 printf(" allocblock calls = %10u\n", headerp->vital_header.allocs);
223 printf(" freeblock calls = %10u\n", headerp->vital_header.frees);
224 printf(" MaxVolumeId = %u\n",
225 headerp->vital_header.MaxVolumeId);
226 printf(" rw vol entries = %u\n",
227 headerp->vital_header.totalEntries[0]);
228 printf(" ro vol entries = %u\n",
229 headerp->vital_header.totalEntries[1]);
230 printf(" bk vol entries = %u\n",
231 headerp->vital_header.totalEntries[2]);
232 printf(" multihome info = 0x%x (%u)\n", headerp->SIT,
234 printf(" server ip addr table: size = %d entries\n",
236 printf(" volume name hash table: size = %d buckets\n", HASHSIZE);
237 printf(" volume id hash table: %d tables with %d buckets each\n",
241 /* Check the header size */
242 if (headerp->vital_header.headersize != sizeof(*headerp))
243 printf("Header reports its size as %d (should be %d)\n",
244 headerp->vital_header.headersize, sizeof(*headerp));
247 readMH(addr, mhblockP)
249 struct extentaddr *mhblockP;
252 struct extentaddr *e;
254 vldbread(addr, mhblockP, VL_ADDREXTBLK_SIZE);
256 mhblockP->ex_count = ntohl(mhblockP->ex_count);
257 mhblockP->ex_flags = ntohl(mhblockP->ex_flags);
258 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++)
259 mhblockP->ex_contaddrs[i] = ntohl(mhblockP->ex_contaddrs[i]);
261 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
264 /* won't convert hostuuid */
265 e->ex_uniquifier = ntohl(e->ex_uniquifier);
266 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++)
267 e->ex_addrs[j] = ntohl(e->ex_addrs[j]);
271 readentry(addr, vlentryp, type)
273 struct nvlentry *vlentryp;
278 vldbread(addr, vlentryp, sizeof(*vlentryp));
280 for (i = 0; i < MAXTYPES; i++)
281 vlentryp->volumeId[i] = ntohl(vlentryp->volumeId[i]);
282 vlentryp->flags = ntohl(vlentryp->flags);
283 vlentryp->LockAfsId = ntohl(vlentryp->LockAfsId);
284 vlentryp->LockTimestamp = ntohl(vlentryp->LockTimestamp);
285 vlentryp->cloneId = ntohl(vlentryp->cloneId);
286 for (i = 0; i < MAXTYPES; i++)
287 vlentryp->nextIdHash[i] = ntohl(vlentryp->nextIdHash[i]);
288 vlentryp->nextNameHash = ntohl(vlentryp->nextNameHash);
289 for (i = 0; i < NMAXNSERVERS; i++) {
290 vlentryp->serverNumber[i] = ntohl(vlentryp->serverNumber[i]);
291 vlentryp->serverPartition[i] = ntohl(vlentryp->serverPartition[i]);
292 vlentryp->serverFlags[i] = ntohl(vlentryp->serverFlags[i]);
295 if (vlentryp->flags == VLCONTBLOCK) {
297 } else if (vlentryp->flags == VLFREE) {
304 printf("address %u: ", addr);
305 if (vlentryp->flags == VLCONTBLOCK) {
306 printf("mh extension block\n");
307 } else if (vlentryp->flags == VLFREE) {
308 printf("free vlentry\n");
310 printf("vlentry %s\n", vlentryp->name);
311 printf(" rw id = %u ; ro id = %u ; bk id = %u\n",
312 vlentryp->volumeId[0], vlentryp->volumeId[1],
313 vlentryp->volumeId[2]);
315 if (vlentryp->flags & VLF_RWEXISTS)
317 if (vlentryp->flags & VLF_ROEXISTS)
319 if (vlentryp->flags & VLF_BACKEXISTS)
321 if (vlentryp->flags & 0xffff8fff)
322 printf(" errorflag(0x%x)", vlentryp->flags);
324 printf(" LockAfsId = %d\n", vlentryp->LockAfsId);
325 printf(" LockTimestamp = %d\n", vlentryp->LockTimestamp);
326 printf(" cloneId = %u\n", vlentryp->cloneId);
328 (" next hash for rw = %u ; ro = %u ; bk = %u ; name = %u\n",
329 vlentryp->nextIdHash[0], vlentryp->nextIdHash[1],
330 vlentryp->nextIdHash[2], vlentryp->nextNameHash);
331 for (i = 0; i < NMAXNSERVERS; i++) {
332 if (vlentryp->serverNumber[i] != 255) {
333 printf(" server %d ; partition %d ; flags =",
334 vlentryp->serverNumber[i],
335 vlentryp->serverPartition[i]);
336 if (vlentryp->serverFlags[i] & VLSF_RWVOL)
338 if (vlentryp->serverFlags[i] & VLSF_ROVOL)
340 if (vlentryp->serverFlags[i] & VLSF_BACKVOL)
342 if (vlentryp->serverFlags[i] & VLSF_NEWREPSITE)
357 char sitbuf[VL_ADDREXTBLK_SIZE];
358 struct extentaddr *extent;
362 vldbread(addr, sitbuf, VL_ADDREXTBLK_SIZE);
363 extent = (struct extentaddr *)sitbuf;
365 printf("multihome info block: base %d\n", base);
367 printf(" count = %u\n", ntohl(extent->ex_count));
368 printf(" flags = %u\n", ntohl(extent->ex_flags));
369 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
370 printf(" contaddrs[%d] = %u\n", i,
371 ntohl(extent->ex_contaddrs[i]));
374 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
375 /* should we skip this entry */
376 for (j = 0; j < VL_MAX_ADDREXTBLKS; j++) {
377 if (extent[i].ex_addrs[j])
380 if (j >= VL_MAX_ADDREXTBLKS)
383 printf(" base %d index %d:\n", base, i);
385 printf(" afsuuid = (%x %x %x /%d/%d/ /%x/%x/%x/%x/%x/%x/)\n",
386 ntohl(extent[i].ex_hostuuid.time_low),
387 ntohl(extent[i].ex_hostuuid.time_mid),
388 ntohl(extent[i].ex_hostuuid.time_hi_and_version),
389 ntohl(extent[i].ex_hostuuid.clock_seq_hi_and_reserved),
390 ntohl(extent[i].ex_hostuuid.clock_seq_low),
391 ntohl(extent[i].ex_hostuuid.node[0]),
392 ntohl(extent[i].ex_hostuuid.node[1]),
393 ntohl(extent[i].ex_hostuuid.node[2]),
394 ntohl(extent[i].ex_hostuuid.node[3]),
395 ntohl(extent[i].ex_hostuuid.node[4]),
396 ntohl(extent[i].ex_hostuuid.node[5]));
397 printf(" uniquifier = %u\n", ntohl(extent[i].ex_uniquifier));
398 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
399 a = ntohl(extent[i].ex_addrs[j]);
401 printf(" %d.%d.%d.%d\n", (a >> 24) & 0xff,
402 (a >> 16) & 0xff, (a >> 8) & 0xff, (a) & 0xff);
409 * Read each entry in the database:
410 * Record what type of entry it is and its address in the record array.
411 * Remember what the maximum volume id we found is and check against the header.
414 ReadAllEntries(header)
415 struct vlheader *header;
417 afs_int32 type, rindex, i, j, e;
418 int freecount = 0, mhcount = 0, vlcount = 0;
419 int rwcount = 0, rocount = 0, bkcount = 0;
420 struct nvlentry vlentry;
421 afs_uint32 addr, entrysize, maxvolid = 0;
424 printf("Read each entry in the database\n");
425 for (addr = header->vital_header.headersize;
426 addr < header->vital_header.eofPtr; addr += entrysize) {
428 /* Remember the highest volume id */
429 readentry(addr, &vlentry, &type);
431 if (!(vlentry.flags & VLF_RWEXISTS))
432 printf("WARNING: VLDB entry '%s' has no RW volume\n",
435 for (i = 0; i < MAXTYPES; i++)
436 if (maxvolid < vlentry.volumeId[i])
437 maxvolid = vlentry.volumeId[i];
440 for (j = 0; j < NMAXNSERVERS; j++) {
441 if (vlentry.serverNumber[j] == 255)
443 if (vlentry.serverFlags[j] & (VLSF_ROVOL | VLSF_NEWREPSITE)) {
447 if (vlentry.serverFlags[j] & VLSF_RWVOL) {
449 if (vlentry.flags & VLF_BACKEXISTS)
455 ("VLDB entry '%s' contains an unknown RW/RO index serverFlag\n",
460 (" index %d : serverNumber %d : serverPartition %d : serverFlag %d\n",
461 j, vlentry.serverNumber[j], vlentry.serverPartition[j],
462 vlentry.serverFlags[j]);
466 rindex = addr / sizeof(vlentry);
467 if (record[rindex].type) {
468 printf("INTERNAL ERROR: record holder %d already in use\n",
472 record[rindex].addr = addr;
473 record[rindex].type = type;
475 /* Determine entrysize and keep count */
477 entrysize = sizeof(vlentry);
479 } else if (type == FR) {
480 entrysize = sizeof(vlentry);
482 } else if (type == MH) {
483 entrysize = VL_ADDREXTBLK_SIZE;
486 printf("Unknown entry at %u\n", addr);
490 printf("Found %d entries, %d free entries, %d multihomed blocks\n",
491 vlcount, freecount, mhcount);
492 printf("Found %d RW volumes, %d BK volumes, %d RO volumes\n", rwcount,
496 /* Check the maxmimum volume id in the header */
497 if (maxvolid != header->vital_header.MaxVolumeId - 1)
499 ("Header's maximum volume id is %u and largest id found in VLDB is %u\n",
500 header->vital_header.MaxVolumeId, maxvolid);
505 * Follow each Name hash bucket marking it as read in the record array.
506 * Record we found it in the name hash within the record array.
507 * Check that the name is hashed correctly.
509 FollowNameHash(header)
510 struct vlheader *header;
512 int count = 0, longest = 0, shortest = -1, chainlength;
513 struct nvlentry vlentry;
515 afs_int32 i, type, rindex;
517 /* Now follow the Name Hash Table */
519 printf("Check Volume Name Hash\n");
520 for (i = 0; i < HASHSIZE; i++) {
522 for (addr = header->VolnameHash[i]; addr; addr = vlentry.nextNameHash) {
523 readentry(addr, &vlentry, &type);
525 printf("Name Hash %d: Bad entry at %u: Not a valid vlentry\n",
530 rindex = addr / sizeof(vlentry);
532 if (record[rindex].addr != addr && record[rindex].addr) {
534 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
535 record[rindex].addr, addr, rindex);
537 if (record[rindex].type & NH) {
539 ("Name Hash %d: Bad entry '%s': Already in the name hash\n",
543 record[rindex].type |= NH;
548 /* Hash the name and check if in correct hash table */
549 if (NameHash(vlentry.name) != i) {
551 ("Name Hash %d: Bad entry '%s': Incorrect name hash chain (should be in %d)\n",
552 i, vlentry.name, NameHash(vlentry.name));
555 if (chainlength > longest)
556 longest = chainlength;
557 if ((shortest == -1) || (chainlength < shortest))
558 shortest = chainlength;
562 ("%d entries in name hash, longest is %d, shortest is %d, average length is %f\n",
563 count, longest, shortest, ((float)count / (float)HASHSIZE));
568 * Follow the ID hash chains for the RW, RO, and BK hash tables.
569 * Record we found it in the id hash within the record array.
570 * Check that the ID is hashed correctly.
573 struct vlheader *header;
575 int count = 0, longest = 0, shortest = -1, chainlength;
576 struct nvlentry vlentry;
578 afs_int32 i, j, hash, type, rindex;
580 /* Now follow the RW, RO, and BK Hash Tables */
582 printf("Check RW, RO, and BK id Hashes\n");
583 for (i = 0; i < MAXTYPES; i++) {
584 hash = ((i == 0) ? RWH : ((i == 1) ? ROH : BKH));
588 for (j = 0; j < HASHSIZE; j++) {
590 for (addr = header->VolidHash[i][j]; addr;
591 addr = vlentry.nextIdHash[i]) {
592 readentry(addr, &vlentry, &type);
595 ("%s Id Hash %d: Bad entry at %u: Not a valid vlentry\n",
600 rindex = addr / sizeof(vlentry);
601 if (record[rindex].addr != addr && record[rindex].addr) {
603 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
604 record[rindex].addr, addr, rindex);
606 if (record[rindex].type & hash) {
608 ("%s Id Hash %d: Bad entry '%s': Already in the the hash table\n",
609 vtype(i), j, vlentry.name);
612 record[rindex].type |= hash;
617 /* Hash the id and check if in correct hash table */
618 if (IdHash(vlentry.volumeId[i]) != j) {
620 ("%s Id Hash %d: Bad entry '%s': Incorrect Id hash chain (should be in %d)\n",
621 vtype(i), j, vlentry.name,
622 IdHash(vlentry.volumeId[i]));
626 if (chainlength > longest)
627 longest = chainlength;
628 if ((shortest == -1) || (chainlength < shortest))
629 shortest = chainlength;
633 ("%d entries in %s hash, longest is %d, shortest is %d, average length is %f\n",
634 count, vtype(i), longest, shortest,
635 ((float)count / (float)HASHSIZE));
641 * Follow the free chain.
642 * Record we found it in the free chain within the record array.
644 FollowFreeChain(header)
645 struct vlheader *header;
648 struct nvlentry vlentry;
650 afs_int32 type, rindex;
652 /* Now follow the Free Chain */
654 printf("Check Volume Free Chain\n");
655 for (addr = header->vital_header.freePtr; addr;
656 addr = vlentry.nextIdHash[0]) {
657 readentry(addr, &vlentry, &type);
660 ("Free Chain %d: Bad entry at %u: Not a valid free vlentry (0x%x)\n",
665 rindex = addr / sizeof(vlentry);
666 if (record[rindex].addr != addr && record[rindex].addr) {
668 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
669 record[rindex].addr, addr, rindex);
671 if (record[rindex].type & FRC) {
672 printf("Free Chain: Bad entry at %u: Already in the free chain\n",
676 record[rindex].type |= FRC;
681 printf("%d entries on free chain\n", count);
685 * Read each multihomed block and mark it as found in the record.
686 * Read each entry in each multihomed block and mark the serveraddrs
687 * array with the number of ip addresses found for this entry.
689 * Then read the IpMappedAddr array in the header.
690 * Verify that multihomed entries base and index are valid and points to
691 * a good multhomed entry.
692 * Mark the serveraddrs array with 1 ip address for regular entries.
694 * By the end, the severaddrs array will have a 0 if the entry has no
695 * IP addresses in it or the count of the number of IP addresses.
697 * The code does not verify if there are duplicate IP addresses in the
698 * list. The vlserver does this when a fileserver registeres itself.
701 struct vlheader *header;
704 afs_int32 i, j, m, rindex;
705 afs_int32 mhentries, regentries;
706 afs_int32 caddrs[VL_MAX_ADDREXTBLKS];
707 char mhblock[VL_ADDREXTBLK_SIZE];
708 struct extentaddr *MHblock = (struct extentaddr *)mhblock;
709 struct extentaddr *e;
710 int ipindex, ipaddrs;
713 memset(&nulluuid, 0, sizeof(nulluuid));
716 printf("Check Multihomed blocks\n");
719 /* Read the first MH block and from it, gather the
720 * addresses of all the mh blocks.
722 readMH(header->SIT, MHblock);
723 if (MHblock->ex_flags != VLCONTBLOCK) {
725 ("Multihomed Block 0: Bad entry at %u: Not a valid multihomed block\n",
729 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
730 caddrs[i] = MHblock->ex_contaddrs[i];
733 if (header->SIT != caddrs[0]) {
735 ("MH block does not point to self %u in header, %u in block\n",
736 header->SIT, caddrs[0]);
739 /* Now read each MH block and record it in the record array */
740 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
744 readMH(caddrs[i], MHblock);
745 if (MHblock->ex_flags != VLCONTBLOCK) {
747 ("Multihomed Block 0: Bad entry at %u: Not a valid multihomed block\n",
751 rindex = caddrs[i] / sizeof(vlentry);
752 if (record[rindex].addr != caddrs[i] && record[rindex].addr) {
754 ("INTERNAL ERROR: addresses %u and %u use same record slot %d\n",
755 record[rindex].addr, caddrs[i], rindex);
757 if (record[rindex].type & FRC) {
759 ("MH Blocks Chain %d: Bad entry at %u: Already a MH block\n",
760 i, record[rindex].addr);
763 record[rindex].type |= MHC;
767 /* Read each entry in a multihomed block.
768 * Find the pointer to the entry in the IpMappedAddr array and
769 * verify that the entry is good (has IP addresses in it).
772 for (j = 1; j < VL_MHSRV_PERBLK; j++) {
773 e = (struct extentaddr *)&(MHblock[j]);
775 /* Search the IpMappedAddr array for the reference to this entry */
776 for (ipindex = 0; ipindex < MAXSERVERID; ipindex++) {
777 if (((header->IpMappedAddr[ipindex] & 0xff000000) ==
781 IpMappedAddr[ipindex] & 0x00ff0000) >> 16) == i)
782 && ((header->IpMappedAddr[ipindex] & 0x0000ffff) ==
787 if (ipindex >= MAXSERVERID)
790 serveraddrs[ipindex] = -1;
792 if (memcmp(&e->ex_hostuuid, &nulluuid, sizeof(afsUUID)) == 0) {
795 ("Server Addrs index %d references null MH block %d, index %d\n",
797 serveraddrs[ipindex] = 0; /* avoids printing 2nd error below */
802 /* Step through each ip address and count the good addresses */
804 for (m = 0; m < VL_MAXIPADDRS_PERMH; m++) {
809 /* If we found any good ip addresses, mark it in the serveraddrs record */
814 ("MH block %d, index %d: Not referenced by server addrs\n",
817 serveraddrs[ipindex] = ipaddrs; /* It is good */
821 if (listservers && ipaddrs) {
822 printf("MH block %d, index %d:", i, j);
823 for (m = 0; m < VL_MAXIPADDRS_PERMH; m++) {
826 printf(" %d.%d.%d.%d",
827 (e->ex_addrs[m] & 0xff000000) >> 24,
828 (e->ex_addrs[m] & 0x00ff0000) >> 16,
829 (e->ex_addrs[m] & 0x0000ff00) >> 8,
830 (e->ex_addrs[m] & 0x000000ff));
836 * if (mhentries != MHblock->ex_count) {
837 * printf("MH blocks says it has %d entries (found %d)\n",
838 * MHblock->ex_count, mhentries);
844 printf("%d multihomed blocks\n", mhblocks);
846 /* Check the server addresses */
848 printf("Check server addresses\n");
849 mhentries = regentries = 0;
850 for (i = 0; i <= MAXSERVERID; i++) {
851 if (header->IpMappedAddr[i]) {
852 if ((header->IpMappedAddr[i] & 0xff000000) == 0xff000000) {
854 if (((header->IpMappedAddr[i] & 0x00ff0000) >> 16) >
857 ("IP Addr for entry %d: Multihome block is bad (%d)\n",
858 i, ((header->IpMappedAddr[i] & 0x00ff0000) >> 16));
859 if (((header->IpMappedAddr[i] & 0x0000ffff) > VL_MHSRV_PERBLK)
860 || ((header->IpMappedAddr[i] & 0x0000ffff) < 1))
862 ("IP Addr for entry %d: Multihome index is bad (%d)\n",
863 i, (header->IpMappedAddr[i] & 0x0000ffff));
864 if (serveraddrs[i] == -1) {
866 ("warning: IP Addr for entry %d: Multihome entry has no ip addresses\n",
871 printf(" Server ip addr %d = MH block %d, index %d\n",
872 i, (header->IpMappedAddr[i] & 0x00ff0000) >> 16,
873 (header->IpMappedAddr[i] & 0x0000ffff));
877 serveraddrs[i] = 1; /* It is good */
879 printf(" Server ip addr %d = %d.%d.%d.%d\n", i,
880 (header->IpMappedAddr[i] & 0xff000000) >> 24,
881 (header->IpMappedAddr[i] & 0x00ff0000) >> 16,
882 (header->IpMappedAddr[i] & 0x0000ff00) >> 8,
883 (header->IpMappedAddr[i] & 0x000000ff));
889 printf("%d simple entries, %d multihomed entries, Total = %d\n",
890 regentries, mhentries, mhentries + regentries);
897 struct cmd_syndesc *as;
901 afs_int32 maxentries, type;
902 struct vlheader header;
903 struct nvlentry vlentry;
906 dbfile = as->parms[0].items->data; /* -database */
907 listuheader = (as->parms[1].items ? 1 : 0); /* -uheader */
908 listheader = (as->parms[2].items ? 1 : 0); /* -vheader */
909 listservers = (as->parms[3].items ? 1 : 0); /* -servers */
910 listentries = (as->parms[4].items ? 1 : 0); /* -entries */
911 verbose = (as->parms[5].items ? 1 : 0); /* -verbose */
913 /* open the vldb database file */
914 fd = open(dbfile, O_RDONLY, 0);
916 printf("can't open file '%s'. error = %d\n", dbfile, errno);
920 /* read the ubik header and the vldb database header */
923 if (header.vital_header.vldbversion < 3) {
924 printf("does not support vldb with version less than 3\n");
928 maxentries = (header.vital_header.eofPtr / sizeof(vlentry)) + 1;
929 record = (struct er *)malloc(maxentries * sizeof(struct er));
930 memset((char *)record, 0, (maxentries * sizeof(struct er)));
931 memset((char *)serveraddrs, 0, sizeof(serveraddrs));
933 /* Will fill in the record array of entries it found */
934 ReadAllEntries(&header);
935 listentries = 0; /* Listed all the entries */
937 /* Check the multihomed blocks for valid entries as well as
938 * the IpMappedAddrs array in the header for valid entries.
940 CheckIpAddrs(&header);
942 /* Follow the hash tables */
943 FollowNameHash(&header);
944 FollowIdHash(&header);
946 /* Follow the chain of free entries */
947 FollowFreeChain(&header);
949 /* Now check the record we have been keeping for inconsistancies
950 * For valid vlentries, also check that the server we point to is
951 * valid (the serveraddrs array).
954 printf("Verify each volume entry\n");
955 for (i = 0; i < maxentries; i++) {
956 if (record[i].type == 0)
959 /* If a vlentry, verify that its name is valid, its name and ids are
960 * on the hash chains, and its server numbers are good.
962 if (record[i].type & VL) {
963 readentry(record[i].addr, &vlentry, &type);
965 if (InvalidVolname(vlentry.name))
966 printf("Volume '%s' at addr %u has an invalid name\n",
967 vlentry.name, record[i].addr);
969 if (!(record[i].type & NH))
970 printf("Volume '%s' not found in name hash\n", vlentry.name);
972 if (vlentry.volumeId[0] && !(record[i].type & RWH))
973 printf("Volume '%s' id %u not found in RW hash chain\n",
974 vlentry.name, vlentry.volumeId[0]);
976 if (vlentry.volumeId[1] && !(record[i].type & ROH))
977 printf("Volume '%s' id %u not found in RO hash chain\n",
978 vlentry.name, vlentry.volumeId[1]);
980 if (vlentry.volumeId[2] && !(record[i].type & BKH))
981 printf("Volume '%s' id %u not found in BK hash chain\n",
982 vlentry.name, vlentry.volumeId[2]);
984 for (j = 0; j < NMAXNSERVERS; j++) {
985 if ((vlentry.serverNumber[j] != 255)
986 && (serveraddrs[vlentry.serverNumber[j]] == 0)) {
988 ("Volume '%s', index %d points to empty server entry %d\n",
989 vlentry.name, j, vlentry.serverNumber[j]);
993 if (record[i].type & 0xffffff00)
995 ("Volume '%s' id %u also found on other chains (0x%x)\n",
996 vlentry.name, vlentry.volumeId[0], record[i].type);
999 } else if (record[i].type & FR) {
1000 if (!(record[i].type & FRC))
1001 printf("Free vlentry at %u not on free chain\n",
1004 if (record[i].type & 0xfffffdf0)
1006 ("Free vlentry at %u also found on other chains (0x%x)\n",
1007 record[i].addr, record[i].type);
1009 /* A multihomed entry */
1010 } else if (record[i].type & MH) {
1011 if (!(record[i].type & MHC))
1012 printf("Multihomed block at %u is orphaned\n",
1015 if (record[i].type & 0xfffffef0)
1017 ("Multihomed block at %u also found on other chains (0x%x)\n",
1018 record[i].addr, record[i].type);
1021 printf("Unknown entry type at %u (0x%x)\n", record[i].addr,
1032 struct cmd_syndesc *ts;
1036 ts = cmd_CreateSyntax(NULL, WorkerBee, NULL, "vldb check");
1037 cmd_AddParm(ts, "-database", CMD_SINGLE, CMD_REQUIRED, "vldb_file");
1038 cmd_AddParm(ts, "-uheader", CMD_FLAG, CMD_OPTIONAL,
1039 "Display UBIK header");
1040 cmd_AddParm(ts, "-vheader", CMD_FLAG, CMD_OPTIONAL,
1041 "Display VLDB header");
1042 cmd_AddParm(ts, "-servers", CMD_FLAG, CMD_OPTIONAL,
1043 "Display server list");
1044 cmd_AddParm(ts, "-entries", CMD_FLAG, CMD_OPTIONAL, "Display entries");
1045 cmd_AddParm(ts, "-verbose", CMD_FLAG, CMD_OPTIONAL, "verbose");
1047 return cmd_Dispatch(argc, argv);