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 VLDB_CHECK_NO_VLDB_CHECK_ERROR 0
40 #define VLDB_CHECK_WARNING 1
41 #define VLDB_CHECK_ERROR 2
42 #define VLDB_CHECK_FATAL 4
43 #define vldbread(x,y,z) vldbio(x,y,z,0)
44 #define vldbwrite(x,y,z) vldbio(x,y,z,1)
46 #include <afsconfig.h>
47 #include <afs/param.h>
51 #include <sys/types.h>
58 #include <WINNT/afsevent.h>
61 #include <sys/socket.h>
63 #include <netinet/in.h>
69 #include <afs/afsutil.h>
72 #define ADDR(x) (x/sizeof(struct nvlentry))
75 int listentries, listservers, listheader, listuheader, verbose, quiet;
80 /* if quiet, don't send anything to stdout */
82 /* error level. 0 = no error, 1 = warning, 2 = error, 4 = fatal */
89 int serveraddrs[MAXSERVERID + 2];
91 /* Used to control what goes to stdout based on quiet flag */
93 quiet_println(const char *fmt,...) {
97 vfprintf(stdout, fmt, args);
102 /* Used to set the error level and ship messages to stderr */
104 log_error(int eval, const char *fmt, ...)
107 if (error_level < eval) error_level = eval ; /* bump up the severity */
109 vfprintf(stderr, fmt, args);
112 if (error_level == VLDB_CHECK_FATAL) exit(VLDB_CHECK_FATAL);
120 /* Bump the version number?? We could cheat and push a new db... */
129 struct ubik_hdr uheader;
131 offset = lseek(fd, 0, 0);
133 log_error(VLDB_CHECK_FATAL,"error: lseek to 0 failed: %d %d\n", offset, errno);
134 return (VLDB_CHECK_FATAL);
137 /* now read the info */
138 r = read(fd, &uheader, sizeof(uheader));
139 if (r != sizeof(uheader)) {
140 log_error(VLDB_CHECK_FATAL,"error: read of %lu bytes failed: %d %d\n", sizeof(uheader), r,
142 return (VLDB_CHECK_FATAL);
145 uheader.magic = ntohl(uheader.magic);
146 uheader.size = ntohl(uheader.size);
147 uheader.version.epoch = ntohl(uheader.version.epoch);
148 uheader.version.counter = ntohl(uheader.version.counter);
151 quiet_println("Ubik Header\n");
152 quiet_println(" Magic = 0x%x\n", uheader.magic);
153 quiet_println(" Size = %u\n", uheader.size);
154 quiet_println(" Version.epoch = %u\n", uheader.version.epoch);
155 quiet_println(" Version.counter = %u\n", uheader.version.counter);
158 if (uheader.size != HDRSIZE)
159 log_error(VLDB_CHECK_WARNING,"VLDB_CHECK_WARNING: Ubik header size is %u (should be %u)\n", uheader.size,
161 if (uheader.magic != UBIK_MAGIC)
162 log_error(VLDB_CHECK_ERROR,"Ubik header magic is 0x%x (should be 0x%x)\n", uheader.magic,
169 vldbio(int position, void *buffer, int size, int rdwr)
173 /* seek to the correct spot. skip ubik stuff */
174 p = position + HDRSIZE;
175 offset = lseek(fd, p, 0);
177 log_error(VLDB_CHECK_FATAL,"error: lseek to %d failed: %d %d\n", p, offset, errno);
182 r = write(fd, buffer, size);
184 r = read(fd, buffer, size);
187 log_error(VLDB_CHECK_FATAL,"error: %s of %d bytes failed: %d %d\n", rdwr==1?"write":"read",
211 NameHash(char *volname)
217 for (vchar = volname + strlen(volname) - 1; vchar >= volname; vchar--)
218 hash = (hash * 63) + (*((unsigned char *)vchar) - 63);
219 return (hash % HASHSIZE);
223 IdHash(afs_uint32 volid)
225 return ((abs(volid)) % HASHSIZE);
228 #define LEGALCHARS ".ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
230 InvalidVolname(char *volname)
236 slen = strlen(volname);
237 if (slen >= VL_MAXNAMELEN)
239 return (slen != strspn(volname, map));
243 readheader(struct vlheader *headerp)
247 vldbread(0, (char *)headerp, sizeof(*headerp));
249 headerp->vital_header.vldbversion =
250 ntohl(headerp->vital_header.vldbversion);
251 headerp->vital_header.headersize =
252 ntohl(headerp->vital_header.headersize);
253 headerp->vital_header.freePtr = ntohl(headerp->vital_header.freePtr);
254 headerp->vital_header.eofPtr = ntohl(headerp->vital_header.eofPtr);
255 headerp->vital_header.allocs = ntohl(headerp->vital_header.allocs);
256 headerp->vital_header.frees = ntohl(headerp->vital_header.frees);
257 headerp->vital_header.MaxVolumeId =
258 ntohl(headerp->vital_header.MaxVolumeId);
259 headerp->vital_header.totalEntries[0] =
260 ntohl(headerp->vital_header.totalEntries[0]);
261 for (i = 0; i < MAXTYPES; i++)
262 headerp->vital_header.totalEntries[i] =
263 ntohl(headerp->vital_header.totalEntries[1]);
265 headerp->SIT = ntohl(headerp->SIT);
266 for (i = 0; i < MAXSERVERID; i++)
267 headerp->IpMappedAddr[i] = ntohl(headerp->IpMappedAddr[i]);
268 for (i = 0; i < HASHSIZE; i++)
269 headerp->VolnameHash[i] = ntohl(headerp->VolnameHash[i]);
270 for (i = 0; i < MAXTYPES; i++)
271 for (j = 0; j < HASHSIZE; j++)
272 headerp->VolidHash[i][j] = ntohl(headerp->VolidHash[i][j]);
275 quiet_println("vldb header\n");
276 quiet_println(" vldbversion = %u\n",
277 headerp->vital_header.vldbversion);
278 quiet_println(" headersize = %u [actual=%lu]\n",
279 headerp->vital_header.headersize, sizeof(*headerp));
280 quiet_println(" freePtr = 0x%x\n", headerp->vital_header.freePtr);
281 quiet_println(" eofPtr = %u\n", headerp->vital_header.eofPtr);
282 quiet_println(" allocblock calls = %10u\n", headerp->vital_header.allocs);
283 quiet_println(" freeblock calls = %10u\n", headerp->vital_header.frees);
284 quiet_println(" MaxVolumeId = %u\n",
285 headerp->vital_header.MaxVolumeId);
286 quiet_println(" rw vol entries = %u\n",
287 headerp->vital_header.totalEntries[0]);
288 quiet_println(" ro vol entries = %u\n",
289 headerp->vital_header.totalEntries[1]);
290 quiet_println(" bk vol entries = %u\n",
291 headerp->vital_header.totalEntries[2]);
292 quiet_println(" multihome info = 0x%x (%u)\n", headerp->SIT,
294 quiet_println(" server ip addr table: size = %d entries\n",
296 quiet_println(" volume name hash table: size = %d buckets\n", HASHSIZE);
297 quiet_println(" volume id hash table: %d tables with %d buckets each\n",
301 /* Check the header size */
302 if (headerp->vital_header.headersize != sizeof(*headerp))
303 log_error(VLDB_CHECK_WARNING,"Header reports its size as %d (should be %lu)\n",
304 headerp->vital_header.headersize, sizeof(*headerp));
309 writeheader(struct vlheader *headerp)
313 headerp->vital_header.vldbversion =
314 htonl(headerp->vital_header.vldbversion);
315 headerp->vital_header.headersize =
316 htonl(headerp->vital_header.headersize);
317 headerp->vital_header.freePtr = htonl(headerp->vital_header.freePtr);
318 headerp->vital_header.eofPtr = htonl(headerp->vital_header.eofPtr);
319 headerp->vital_header.allocs = htonl(headerp->vital_header.allocs);
320 headerp->vital_header.frees = htonl(headerp->vital_header.frees);
321 headerp->vital_header.MaxVolumeId =
322 htonl(headerp->vital_header.MaxVolumeId);
323 headerp->vital_header.totalEntries[0] =
324 htonl(headerp->vital_header.totalEntries[0]);
325 for (i = 0; i < MAXTYPES; i++)
326 headerp->vital_header.totalEntries[i] =
327 htonl(headerp->vital_header.totalEntries[1]);
329 headerp->SIT = htonl(headerp->SIT);
330 for (i = 0; i < MAXSERVERID; i++)
331 headerp->IpMappedAddr[i] = htonl(headerp->IpMappedAddr[i]);
332 for (i = 0; i < HASHSIZE; i++)
333 headerp->VolnameHash[i] = htonl(headerp->VolnameHash[i]);
334 for (i = 0; i < MAXTYPES; i++)
335 for (j = 0; j < HASHSIZE; j++)
336 headerp->VolidHash[i][j] = htonl(headerp->VolidHash[i][j]);
338 vldbwrite(0, (char *)headerp, sizeof(*headerp));
342 readMH(afs_int32 addr, struct extentaddr *mhblockP)
345 struct extentaddr *e;
347 vldbread(addr, (char *)mhblockP, VL_ADDREXTBLK_SIZE);
349 mhblockP->ex_count = ntohl(mhblockP->ex_count);
350 mhblockP->ex_flags = ntohl(mhblockP->ex_flags);
351 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++)
352 mhblockP->ex_contaddrs[i] = ntohl(mhblockP->ex_contaddrs[i]);
354 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
357 /* won't convert hostuuid */
358 e->ex_uniquifier = ntohl(e->ex_uniquifier);
359 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++)
360 e->ex_addrs[j] = ntohl(e->ex_addrs[j]);
366 readentry(afs_int32 addr, struct nvlentry *vlentryp, afs_int32 *type)
370 vldbread(addr, (char *)vlentryp, sizeof(*vlentryp));
372 for (i = 0; i < MAXTYPES; i++)
373 vlentryp->volumeId[i] = ntohl(vlentryp->volumeId[i]);
374 vlentryp->flags = ntohl(vlentryp->flags);
375 vlentryp->LockAfsId = ntohl(vlentryp->LockAfsId);
376 vlentryp->LockTimestamp = ntohl(vlentryp->LockTimestamp);
377 vlentryp->cloneId = ntohl(vlentryp->cloneId);
378 for (i = 0; i < MAXTYPES; i++)
379 vlentryp->nextIdHash[i] = ntohl(vlentryp->nextIdHash[i]);
380 vlentryp->nextNameHash = ntohl(vlentryp->nextNameHash);
381 for (i = 0; i < NMAXNSERVERS; i++) {
382 /* make sure not to ntohl these, as they're chars, not ints */
383 vlentryp->serverNumber[i] = vlentryp->serverNumber[i];
384 vlentryp->serverPartition[i] = vlentryp->serverPartition[i];
385 vlentryp->serverFlags[i] = vlentryp->serverFlags[i];
388 if (vlentryp->flags == VLCONTBLOCK) {
390 } else if (vlentryp->flags == VLFREE) {
397 quiet_println("address %u: ", addr);
398 if (vlentryp->flags == VLCONTBLOCK) {
399 quiet_println("mh extension block\n");
400 } else if (vlentryp->flags == VLFREE) {
401 quiet_println("free vlentry\n");
403 quiet_println("vlentry %s\n", vlentryp->name);
404 quiet_println(" rw id = %u ; ro id = %u ; bk id = %u\n",
405 vlentryp->volumeId[0], vlentryp->volumeId[1],
406 vlentryp->volumeId[2]);
407 quiet_println(" flags =");
408 if (vlentryp->flags & VLF_RWEXISTS)
409 quiet_println(" rw");
410 if (vlentryp->flags & VLF_ROEXISTS)
411 quiet_println(" ro");
412 if (vlentryp->flags & VLF_BACKEXISTS)
413 quiet_println(" bk");
414 if (vlentryp->flags & 0xffff8fff)
415 quiet_println(" errorflag(0x%x)", vlentryp->flags);
417 quiet_println(" LockAfsId = %d\n", vlentryp->LockAfsId);
418 quiet_println(" LockTimestamp = %d\n", vlentryp->LockTimestamp);
419 quiet_println(" cloneId = %u\n", vlentryp->cloneId);
421 (" next hash for rw = %u ; ro = %u ; bk = %u ; name = %u\n",
422 vlentryp->nextIdHash[0], vlentryp->nextIdHash[1],
423 vlentryp->nextIdHash[2], vlentryp->nextNameHash);
424 for (i = 0; i < NMAXNSERVERS; i++) {
425 if (vlentryp->serverNumber[i] != 255) {
426 quiet_println(" server %d ; partition %d ; flags =",
427 vlentryp->serverNumber[i],
428 vlentryp->serverPartition[i]);
429 if (vlentryp->serverFlags[i] & VLSF_RWVOL)
430 quiet_println(" rw");
431 if (vlentryp->serverFlags[i] & VLSF_ROVOL)
432 quiet_println(" ro");
433 if (vlentryp->serverFlags[i] & VLSF_BACKVOL)
434 quiet_println(" bk");
435 if (vlentryp->serverFlags[i] & VLSF_NEWREPSITE)
436 quiet_println(" newro");
446 writeentry(afs_int32 addr, struct nvlentry *vlentryp)
450 if (verbose) quiet_println("Writing back entry at addr %u\n", addr);
452 for (i = 0; i < MAXTYPES; i++)
453 vlentryp->volumeId[i] = htonl(vlentryp->volumeId[i]);
454 vlentryp->flags = htonl(vlentryp->flags);
455 vlentryp->LockAfsId = htonl(vlentryp->LockAfsId);
456 vlentryp->LockTimestamp = htonl(vlentryp->LockTimestamp);
457 vlentryp->cloneId = htonl(vlentryp->cloneId);
458 for (i = 0; i < MAXTYPES; i++)
459 vlentryp->nextIdHash[i] = htonl(vlentryp->nextIdHash[i]);
460 vlentryp->nextNameHash = htonl(vlentryp->nextNameHash);
461 for (i = 0; i < NMAXNSERVERS; i++) {
462 vlentryp->serverNumber[i] = htonl(vlentryp->serverNumber[i]);
463 vlentryp->serverPartition[i] = htonl(vlentryp->serverPartition[i]);
464 vlentryp->serverFlags[i] = htonl(vlentryp->serverFlags[i]);
466 vldbwrite(addr, (char *)vlentryp, sizeof(*vlentryp));
470 readSIT(int base, int addr)
473 char sitbuf[VL_ADDREXTBLK_SIZE];
474 struct extentaddr *extent;
478 vldbread(addr, sitbuf, VL_ADDREXTBLK_SIZE);
479 extent = (struct extentaddr *)sitbuf;
481 quiet_println("multihome info block: base %d\n", base);
483 quiet_println(" count = %u\n", ntohl(extent->ex_count));
484 quiet_println(" flags = %u\n", ntohl(extent->ex_flags));
485 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
486 quiet_println(" contaddrs[%d] = %u\n", i,
487 ntohl(extent->ex_contaddrs[i]));
490 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
491 /* should we skip this entry */
492 for (j = 0; j < VL_MAX_ADDREXTBLKS; j++) {
493 if (extent[i].ex_addrs[j])
496 if (j >= VL_MAX_ADDREXTBLKS)
499 quiet_println(" base %d index %d:\n", base, i);
501 quiet_println(" afsuuid = (%x %x %x /%d/%d/ /%x/%x/%x/%x/%x/%x/)\n",
502 ntohl(extent[i].ex_hostuuid.time_low),
503 ntohl(extent[i].ex_hostuuid.time_mid),
504 ntohl(extent[i].ex_hostuuid.time_hi_and_version),
505 ntohl(extent[i].ex_hostuuid.clock_seq_hi_and_reserved),
506 ntohl(extent[i].ex_hostuuid.clock_seq_low),
507 ntohl(extent[i].ex_hostuuid.node[0]),
508 ntohl(extent[i].ex_hostuuid.node[1]),
509 ntohl(extent[i].ex_hostuuid.node[2]),
510 ntohl(extent[i].ex_hostuuid.node[3]),
511 ntohl(extent[i].ex_hostuuid.node[4]),
512 ntohl(extent[i].ex_hostuuid.node[5]));
513 quiet_println(" uniquifier = %u\n", ntohl(extent[i].ex_uniquifier));
514 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
515 a = ntohl(extent[i].ex_addrs[j]);
517 quiet_println(" %d.%d.%d.%d\n", (a >> 24) & 0xff,
518 (a >> 16) & 0xff, (a >> 8) & 0xff, (a) & 0xff);
525 * Read each entry in the database:
526 * Record what type of entry it is and its address in the record array.
527 * Remember what the maximum volume id we found is and check against the header.
530 ReadAllEntries(struct vlheader *header)
532 afs_int32 type, rindex, i, j, e;
533 int freecount = 0, mhcount = 0, vlcount = 0;
534 int rwcount = 0, rocount = 0, bkcount = 0;
535 struct nvlentry vlentry;
537 afs_uint32 entrysize = 0;
538 afs_uint32 maxvolid = 0;
540 if (verbose) quiet_println("Read each entry in the database\n");
541 for (addr = header->vital_header.headersize;
542 addr < header->vital_header.eofPtr; addr += entrysize) {
544 /* Remember the highest volume id */
545 readentry(addr, &vlentry, &type);
547 if (!(vlentry.flags & VLF_RWEXISTS))
548 log_error(VLDB_CHECK_WARNING,"VLDB_CHECK_WARNING: VLDB entry '%s' has no RW volume\n",
551 for (i = 0; i < MAXTYPES; i++)
552 if (maxvolid < vlentry.volumeId[i])
553 maxvolid = vlentry.volumeId[i];
556 for (j = 0; j < NMAXNSERVERS; j++) {
557 if (vlentry.serverNumber[j] == 255)
559 if (vlentry.serverFlags[j] & (VLSF_ROVOL | VLSF_NEWREPSITE)) {
563 if (vlentry.serverFlags[j] & VLSF_RWVOL) {
565 if (vlentry.flags & VLF_BACKEXISTS)
569 if (!vlentry.serverFlags[j]) {
575 (VLDB_CHECK_ERROR,"VLDB entry '%s' contains an unknown RW/RO index serverFlag\n",
580 (" index %d : serverNumber %d : serverPartition %d : serverFlag %d\n",
581 j, vlentry.serverNumber[j], vlentry.serverPartition[j],
582 vlentry.serverFlags[j]);
586 rindex = addr / sizeof(vlentry);
587 if (record[rindex].type) {
588 log_error(VLDB_CHECK_ERROR,"INTERNAL VLDB_CHECK_ERROR: record holder %d already in use\n",
592 record[rindex].addr = addr;
593 record[rindex].type = type;
595 /* Determine entrysize and keep count */
597 entrysize = sizeof(vlentry);
599 } else if (type == FR) {
600 entrysize = sizeof(vlentry);
602 } else if (type == MH) {
603 entrysize = VL_ADDREXTBLK_SIZE;
606 log_error(VLDB_CHECK_ERROR, "Unknown entry at %u. Aborting\n", addr);
611 quiet_println("Found %d entries, %d free entries, %d multihomed blocks\n",
612 vlcount, freecount, mhcount);
613 quiet_println("Found %d RW volumes, %d BK volumes, %d RO volumes\n", rwcount,
617 /* Check the maxmimum volume id in the header */
618 if (maxvolid != header->vital_header.MaxVolumeId - 1)
620 ("Header's maximum volume id is %u and largest id found in VLDB is %u\n",
621 header->vital_header.MaxVolumeId, maxvolid);
626 SetHashEnd(long addr, int type, long new)
628 struct nvlentry vlentry;
629 afs_int32 type2, next = -1;
631 for (; addr; addr = next) {
632 readentry(addr, &vlentry, &type2);
633 switch(type & 0xf0) {
635 next = vlentry.nextIdHash[0];
638 next = vlentry.nextIdHash[1];
641 next = vlentry.nextIdHash[2];
644 next = vlentry.nextNameHash;
651 switch(type & 0xf0) {
653 if (vlentry.nextIdHash[0] != 0) {quiet_println("bwoop\n");}
654 vlentry.nextIdHash[0] = new;
657 if (vlentry.nextIdHash[1] != 0) {quiet_println("bwoop\n");}
658 vlentry.nextIdHash[1] = new;
661 if (vlentry.nextIdHash[2] != 0) {quiet_println("bwoop\n");}
662 vlentry.nextIdHash[2] = new;
665 if (vlentry.nextNameHash != 0) {quiet_println("bwoop\n");}
666 vlentry.nextNameHash = new;
669 writeentry(addr, &vlentry);
676 * Follow each Name hash bucket marking it as read in the record array.
677 * Record we found it in the name hash within the record array.
678 * Check that the name is hashed correctly.
681 FollowNameHash(struct vlheader *header)
683 int count = 0, longest = 0, shortest = -1, chainlength;
684 struct nvlentry vlentry;
686 afs_int32 i, type, rindex;
688 /* Now follow the Name Hash Table */
689 if (verbose) quiet_println("Check Volume Name Hash\n");
690 for (i = 0; i < HASHSIZE; i++) {
692 for (addr = header->VolnameHash[i]; addr; addr = vlentry.nextNameHash) {
693 readentry(addr, &vlentry, &type);
695 log_error(VLDB_CHECK_ERROR,"Name Hash %d: Bad entry at %u: Not a valid vlentry\n",
700 rindex = addr / sizeof(vlentry);
702 if (record[rindex].addr != addr && record[rindex].addr) {
704 (VLDB_CHECK_ERROR,"INTERNAL VLDB_CHECK_ERROR: addresses %ld and %u use same record slot %d\n",
705 record[rindex].addr, addr, rindex);
707 if (record[rindex].type & NH) {
709 (VLDB_CHECK_ERROR,"Name Hash %d: Bad entry '%s': Already in the name hash\n",
711 record[rindex].type |= MULTN;
714 record[rindex].type |= NH;
715 record[rindex].type |= REFN;
720 /* Hash the name and check if in correct hash table */
721 if (NameHash(vlentry.name) != i) {
723 (VLDB_CHECK_ERROR,"Name Hash %d: Bad entry '%s': Incorrect name hash chain (should be in %d)\n",
724 i, vlentry.name, NameHash(vlentry.name));
725 record[rindex].type |= MULTN;
728 if (chainlength > longest)
729 longest = chainlength;
730 if ((shortest == -1) || (chainlength < shortest))
731 shortest = chainlength;
735 ("%d entries in name hash, longest is %d, shortest is %d, average length is %f\n",
736 count, longest, shortest, ((float)count / (float)HASHSIZE));
742 * Follow the ID hash chains for the RW, RO, and BK hash tables.
743 * Record we found it in the id hash within the record array.
744 * Check that the ID is hashed correctly.
747 FollowIdHash(struct vlheader *header)
749 int count = 0, longest = 0, shortest = -1, chainlength;
750 struct nvlentry vlentry;
752 afs_int32 i, j, hash, type, rindex, ref, badref, badhash;
754 /* Now follow the RW, RO, and BK Hash Tables */
755 if (verbose) quiet_println("Check RW, RO, and BK id Hashes\n");
756 for (i = 0; i < MAXTYPES; i++) {
757 hash = ((i == 0) ? RWH : ((i == 1) ? ROH : BKH));
758 ref = ((i == 0) ? REFRW : ((i == 1) ? REFRO : REFBK));
759 badref = ((i == 0) ? MULTRW : ((i == 1) ? MULTRO : MULTBK));
760 badhash = ((i == 0) ? MULTRW : ((i == 1) ? MULTRO : MULTBK));
764 for (j = 0; j < HASHSIZE; j++) {
766 for (addr = header->VolidHash[i][j]; addr;
767 addr = vlentry.nextIdHash[i]) {
768 readentry(addr, &vlentry, &type);
771 (VLDB_CHECK_ERROR,"%s Id Hash %d: Bad entry at %u: Not a valid vlentry\n",
776 rindex = addr / sizeof(vlentry);
777 if (record[rindex].addr != addr && record[rindex].addr) {
779 (VLDB_CHECK_ERROR,"INTERNAL VLDB_CHECK_ERROR: addresses %ld and %u use same record slot %d\n",
780 record[rindex].addr, addr, rindex);
782 if (record[rindex].type & hash) {
784 (VLDB_CHECK_ERROR,"%s Id Hash %d: Bad entry '%s': Already in the hash table\n",
785 vtype(i), j, vlentry.name);
786 record[rindex].type |= badref;
789 record[rindex].type |= hash;
790 record[rindex].type |= ref;
795 /* Hash the id and check if in correct hash table */
796 if (IdHash(vlentry.volumeId[i]) != j) {
798 (VLDB_CHECK_ERROR,"%s Id Hash %d: Bad entry '%s': Incorrect Id hash chain (should be in %d)\n",
799 vtype(i), j, vlentry.name,
800 IdHash(vlentry.volumeId[i]));
801 record[rindex].type |= badhash;
802 printf("%d: %x\n", rindex, record[rindex].type);
806 if (chainlength > longest)
807 longest = chainlength;
808 if ((shortest == -1) || (chainlength < shortest))
809 shortest = chainlength;
813 ("%d entries in %s hash, longest is %d, shortest is %d, average length is %f\n",
814 count, vtype(i), longest, shortest,((float)count / (float)HASHSIZE));
821 * Follow the free chain.
822 * Record we found it in the free chain within the record array.
825 FollowFreeChain(struct vlheader *header)
828 struct nvlentry vlentry;
830 afs_int32 type, rindex;
832 /* Now follow the Free Chain */
833 if (verbose) quiet_println("Check Volume Free Chain\n");
834 for (addr = header->vital_header.freePtr; addr;
835 addr = vlentry.nextIdHash[0]) {
836 readentry(addr, &vlentry, &type);
839 (VLDB_CHECK_ERROR,"Free Chain %d: Bad entry at %u: Not a valid free vlentry (0x%x)\n",
844 rindex = addr / sizeof(vlentry);
845 if (record[rindex].addr != addr && record[rindex].addr) {
847 (VLDB_CHECK_ERROR,"INTERNAL VLDB_CHECK_ERROR: addresses %u and %ld use same record slot %d\n",
848 record[rindex].addr, addr, rindex);
850 if (record[rindex].type & FRC) {
851 log_error(VLDB_CHECK_ERROR,"Free Chain: Bad entry at %u: Already in the free chain\n",
855 record[rindex].type |= FRC;
860 quiet_println("%d entries on free chain\n", count);
865 * Read each multihomed block and mark it as found in the record.
866 * Read each entry in each multihomed block and mark the serveraddrs
867 * array with the number of ip addresses found for this entry.
869 * Then read the IpMappedAddr array in the header.
870 * Verify that multihomed entries base and index are valid and points to
871 * a good multhomed entry.
872 * Mark the serveraddrs array with 1 ip address for regular entries.
874 * By the end, the severaddrs array will have a 0 if the entry has no
875 * IP addresses in it or the count of the number of IP addresses.
877 * The code does not verify if there are duplicate IP addresses in the
878 * list. The vlserver does this when a fileserver registeres itself.
881 CheckIpAddrs(struct vlheader *header)
884 afs_int32 i, j, m, rindex;
885 afs_int32 mhentries, regentries;
886 afs_int32 caddrs[VL_MAX_ADDREXTBLKS];
887 char mhblock[VL_ADDREXTBLK_SIZE];
888 struct extentaddr *MHblock = (struct extentaddr *)mhblock;
889 struct extentaddr *e;
890 int ipindex, ipaddrs;
893 memset(&nulluuid, 0, sizeof(nulluuid));
896 quiet_println("Check Multihomed blocks\n");
899 /* Read the first MH block and from it, gather the
900 * addresses of all the mh blocks.
902 readMH(header->SIT, MHblock);
903 if (MHblock->ex_flags != VLCONTBLOCK) {
905 (VLDB_CHECK_ERROR,"Multihomed Block 0: Bad entry at %u: Not a valid multihomed block\n",
909 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
910 caddrs[i] = MHblock->ex_contaddrs[i];
913 if (header->SIT != caddrs[0]) {
915 (VLDB_CHECK_ERROR,"MH block does not point to self %u in header, %u in block\n",
916 header->SIT, caddrs[0]);
919 /* Now read each MH block and record it in the record array */
920 for (i = 0; i < VL_MAX_ADDREXTBLKS; i++) {
924 readMH(caddrs[i], MHblock);
925 if (MHblock->ex_flags != VLCONTBLOCK) {
927 (VLDB_CHECK_ERROR,"Multihomed Block 0: Bad entry at %u: Not a valid multihomed block\n",
931 rindex = caddrs[i] / sizeof(vlentry);
932 if (record[rindex].addr != caddrs[i] && record[rindex].addr) {
934 (VLDB_CHECK_ERROR,"INTERNAL VLDB_CHECK_ERROR: addresses %u and %u use same record slot %d\n",
935 record[rindex].addr, caddrs[i], rindex);
937 if (record[rindex].type & FRC) {
939 (VLDB_CHECK_ERROR,"MH Blocks Chain %d: Bad entry at %ld: Already a MH block\n",
940 i, record[rindex].addr);
943 record[rindex].type |= MHC;
947 /* Read each entry in a multihomed block.
948 * Find the pointer to the entry in the IpMappedAddr array and
949 * verify that the entry is good (has IP addresses in it).
952 for (j = 1; j < VL_MHSRV_PERBLK; j++) {
953 e = (struct extentaddr *)&(MHblock[j]);
955 /* Search the IpMappedAddr array for the reference to this entry */
956 for (ipindex = 0; ipindex < MAXSERVERID; ipindex++) {
957 if (((header->IpMappedAddr[ipindex] & 0xff000000) ==
961 IpMappedAddr[ipindex] & 0x00ff0000) >> 16) == i)
962 && ((header->IpMappedAddr[ipindex] & 0x0000ffff) ==
967 if (ipindex >= MAXSERVERID)
970 serveraddrs[ipindex] = -1;
972 if (memcmp(&e->ex_hostuuid, &nulluuid, sizeof(afsUUID)) == 0) {
975 (VLDB_CHECK_ERROR,"Server Addrs index %d references null MH block %d, index %d\n",
977 serveraddrs[ipindex] = 0; /* avoids printing 2nd error below */
982 /* Step through each ip address and count the good addresses */
984 for (m = 0; m < VL_MAXIPADDRS_PERMH; m++) {
989 /* If we found any good ip addresses, mark it in the serveraddrs record */
994 (VLDB_CHECK_ERROR,"MH block %d, index %d: Not referenced by server addrs\n",
997 serveraddrs[ipindex] = ipaddrs; /* It is good */
1001 if (listservers && ipaddrs) {
1002 quiet_println("MH block %d, index %d:", i, j);
1003 for (m = 0; m < VL_MAXIPADDRS_PERMH; m++) {
1004 if (!e->ex_addrs[m])
1006 quiet_println(" %d.%d.%d.%d",
1007 (e->ex_addrs[m] & 0xff000000) >> 24,
1008 (e->ex_addrs[m] & 0x00ff0000) >> 16,
1009 (e->ex_addrs[m] & 0x0000ff00) >> 8,
1010 (e->ex_addrs[m] & 0x000000ff));
1012 quiet_println("\n");
1016 * if (mhentries != MHblock->ex_count) {
1017 * quiet_println("MH blocks says it has %d entries (found %d)\n",
1018 * MHblock->ex_count, mhentries);
1024 quiet_println("%d multihomed blocks\n", mhblocks);
1026 /* Check the server addresses */
1028 quiet_println("Check server addresses\n");
1029 mhentries = regentries = 0;
1030 for (i = 0; i <= MAXSERVERID; i++) {
1031 if (header->IpMappedAddr[i]) {
1032 if ((header->IpMappedAddr[i] & 0xff000000) == 0xff000000) {
1034 if (((header->IpMappedAddr[i] & 0x00ff0000) >> 16) >
1037 (VLDB_CHECK_ERROR,"IP Addr for entry %d: Multihome block is bad (%d)\n",
1038 i, ((header->IpMappedAddr[i] & 0x00ff0000) >> 16));
1039 if (((header->IpMappedAddr[i] & 0x0000ffff) > VL_MHSRV_PERBLK)
1040 || ((header->IpMappedAddr[i] & 0x0000ffff) < 1))
1042 (VLDB_CHECK_ERROR,"IP Addr for entry %d: Multihome index is bad (%d)\n",
1043 i, (header->IpMappedAddr[i] & 0x0000ffff));
1044 if (serveraddrs[i] == -1) {
1046 (VLDB_CHECK_WARNING,"warning: IP Addr for entry %d: Multihome entry has no ip addresses\n",
1051 quiet_println(" Server ip addr %d = MH block %d, index %d\n",
1052 i, (header->IpMappedAddr[i] & 0x00ff0000) >> 16,
1053 (header->IpMappedAddr[i] & 0x0000ffff));
1057 serveraddrs[i] = 1; /* It is good */
1059 quiet_println(" Server ip addr %d = %d.%d.%d.%d\n", i,
1060 (header->IpMappedAddr[i] & 0xff000000) >> 24,
1061 (header->IpMappedAddr[i] & 0x00ff0000) >> 16,
1062 (header->IpMappedAddr[i] & 0x0000ff00) >> 8,
1063 (header->IpMappedAddr[i] & 0x000000ff));
1069 quiet_println("%d simple entries, %d multihomed entries, Total = %d\n",
1070 regentries, mhentries, mhentries + regentries);
1076 FixBad(afs_uint32 idx, afs_uint32 addr, afs_uint32 type, afs_uint32 tmp,
1077 struct nvlentry *vlentry, afs_uint32 hash) {
1078 SetHashEnd(addr, type, tmp);
1079 quiet_println("linked unlinked chain %u (index %lu) to end of chain %d for %s hash\n",
1080 tmp, ADDR(tmp), hash, type==NH?"Name":(type==RWH?"RW":(type==ROH?"RO":"BK")));
1084 WorkerBee(struct cmd_syndesc *as, void *arock)
1087 afs_int32 maxentries, type;
1088 struct vlheader header;
1089 struct nvlentry vlentry, vlentry2;
1092 error_level = 0; /* start clean with no error status */
1093 dbfile = as->parms[0].items->data; /* -database */
1094 listuheader = (as->parms[1].items ? 1 : 0); /* -uheader */
1095 listheader = (as->parms[2].items ? 1 : 0); /* -vheader */
1096 listservers = (as->parms[3].items ? 1 : 0); /* -servers */
1097 listentries = (as->parms[4].items ? 1 : 0); /* -entries */
1098 verbose = (as->parms[5].items ? 1 : 0); /* -verbose */
1099 quiet = (as->parms[6].items ? 1 : 0); /* -quiet */
1100 fix = (as->parms[7].items ? 1 : 0); /* -fix */
1103 if (quiet && (verbose || listuheader || listheader ||listservers \
1105 log_error(VLDB_CHECK_FATAL," -quiet cannot be used other display flags\n");
1106 return VLDB_CHECK_FATAL;
1110 /* open the vldb database file */
1111 fd = open(dbfile, (fix > 0)?O_RDWR:O_RDONLY, 0);
1113 log_error(VLDB_CHECK_FATAL,"can't open file '%s'. error = %d\n", dbfile, errno);
1117 /* read the ubik header and the vldb database header */
1119 readheader(&header);
1120 if (header.vital_header.vldbversion < 3) {
1121 log_error(VLDB_CHECK_FATAL,"does not support vldb with version less than 3\n");
1122 return VLDB_CHECK_FATAL;
1125 maxentries = (header.vital_header.eofPtr / sizeof(vlentry)) + 1;
1126 record = (struct er *)malloc(maxentries * sizeof(struct er));
1127 memset(record, 0, (maxentries * sizeof(struct er)));
1128 memset(serveraddrs, 0, sizeof(serveraddrs));
1130 /* Will fill in the record array of entries it found */
1131 ReadAllEntries(&header);
1132 listentries = 0; /* Listed all the entries */
1134 /* Check the multihomed blocks for valid entries as well as
1135 * the IpMappedAddrs array in the header for valid entries.
1137 CheckIpAddrs(&header);
1139 /* Follow the hash tables */
1140 FollowNameHash(&header);
1141 FollowIdHash(&header);
1143 /* Follow the chain of free entries */
1144 FollowFreeChain(&header);
1146 /* Now check the record we have been keeping for inconsistencies
1147 * For valid vlentries, also check that the server we point to is
1148 * valid (the serveraddrs array).
1151 quiet_println("Verify each volume entry\n");
1152 for (i = 0; i < maxentries; i++) {
1160 if (record[i].type == 0)
1163 /* If a vlentry, verify that its name is valid, its name and ids are
1164 * on the hash chains, and its server numbers are good.
1166 if (record[i].type & VL) {
1170 readentry(record[i].addr, &vlentry, &type);
1172 if (InvalidVolname(vlentry.name))
1173 log_error(VLDB_CHECK_ERROR,"Volume '%s' at addr %ld has an invalid name\n",
1174 vlentry.name, record[i].addr);
1176 if (!(record[i].type & NH)) {
1177 nextp = ADDR(vlentry.nextNameHash);
1179 hash = NameHash(vlentry.name);
1180 nextpp = &vlentry.nextNameHash;
1186 if (vlentry.volumeId[0] && !(record[i].type & RWH)) {
1187 nextp = ADDR(vlentry.nextIdHash[0]);
1189 hash = IdHash(vlentry.volumeId[0]);
1190 nextpp = &(vlentry.nextIdHash[0]);
1192 sprintf(volidbuf, "id %u ", vlentry.volumeId[0]);
1196 if (vlentry.volumeId[1] && !(record[i].type & ROH)) {
1197 nextp = ADDR(vlentry.nextIdHash[1]);
1199 hash = IdHash(vlentry.volumeId[1]);
1200 nextpp = &(vlentry.nextIdHash[1]);
1202 sprintf(volidbuf, "id %u ", vlentry.volumeId[1]);
1206 if (vlentry.volumeId[2] && !(record[i].type & BKH)) {
1207 nextp = ADDR(vlentry.nextIdHash[2]);
1209 hash = IdHash(vlentry.volumeId[2]);
1210 nextpp = &(vlentry.nextIdHash[2]);
1212 sprintf(volidbuf, "id %u ", vlentry.volumeId[2]);
1216 if (record[ADDR(vlentry.nextNameHash)].type & MULTN) {
1217 nextp = ADDR(vlentry.nextNameHash);
1219 hash = NameHash(vlentry.name);
1220 nextpp = &vlentry.nextNameHash;
1223 readentry(nextp, &vlentry2, &type);
1224 nexthash = NameHash(vlentry2.name);
1225 if (hash != nexthash)
1229 if ((record[ADDR(vlentry.nextIdHash[0])].type & MULTRW)) {
1230 nextp = ADDR(vlentry.nextIdHash[0]);
1232 hash = IdHash(vlentry.volumeId[0]);
1233 nextpp = &(vlentry.nextIdHash[0]);
1235 sprintf(volidbuf, "id %u ", vlentry.volumeId[0]);
1236 readentry(nextp, &vlentry2, &type);
1237 nexthash = IdHash(vlentry2.volumeId[0]);
1238 if (hash != nexthash)
1242 if ((record[ADDR(vlentry.nextIdHash[1])].type & MULTRO)) {
1243 nextp = ADDR(vlentry.nextIdHash[1]);
1245 hash = IdHash(vlentry.volumeId[1]);
1246 nextpp = &(vlentry.nextIdHash[1]);
1248 sprintf(volidbuf, "id %u ", vlentry.volumeId[1]);
1249 readentry(nextp, &vlentry2, &type);
1250 nexthash = IdHash(vlentry2.volumeId[1]);
1251 if (hash != nexthash)
1255 if ((record[ADDR(vlentry.nextIdHash[2])].type & MULTBK)) {
1256 nextp = ADDR(vlentry.nextIdHash[2]);
1258 hash = IdHash(vlentry.volumeId[2]);
1259 nextpp = &(vlentry.nextIdHash[2]);
1261 sprintf(volidbuf, "id %u ", vlentry.volumeId[2]);
1262 readentry(nextp, &vlentry2, &type);
1263 nexthash = IdHash(vlentry2.volumeId[2]);
1264 if (hash != nexthash)
1269 log_error(VLDB_CHECK_ERROR,"%d: Volume '%s' %snot found in %s hash %d", i,
1270 vlentry.name, volidbuf, which, hash);
1272 log_error(VLDB_CHECK_ERROR," (next %d", nextp);
1273 if (!(record[nextp].type & reft)) {
1274 log_error(VLDB_CHECK_ERROR," not in chain ");
1275 record[nextp].type |= reft;
1276 } else if (nextp != 0) {
1277 log_error(VLDB_CHECK_ERROR," next in chain");
1279 log_error(VLDB_CHECK_ERROR,", unchaining");
1281 writeentry(record[i].addr, &vlentry);
1284 log_error(VLDB_CHECK_ERROR,")");
1286 log_error(VLDB_CHECK_ERROR,"\n");
1289 for (j = 0; j < NMAXNSERVERS; j++) {
1290 if ((vlentry.serverNumber[j] != 255)
1291 && (serveraddrs[vlentry.serverNumber[j]] == 0)) {
1293 (VLDB_CHECK_ERROR,"Volume '%s', index %d points to empty server entry %d\n",
1294 vlentry.name, j, vlentry.serverNumber[j]);
1298 if (record[i].type & 0xffff0f00)
1300 (VLDB_CHECK_ERROR,"Volume '%s' id %u also found on other chains (0x%x)\n",
1301 vlentry.name, vlentry.volumeId[0], record[i].type);
1304 } else if (record[i].type & FR) {
1305 if (!(record[i].type & FRC))
1306 log_error(VLDB_CHECK_ERROR,"Free vlentry at %ld not on free chain\n",
1309 if (record[i].type & 0xfffffdf0)
1311 (VLDB_CHECK_ERROR,"Free vlentry at %ld also found on other chains (0x%x)\n",
1312 record[i].addr, record[i].type);
1314 /* A multihomed entry */
1315 } else if (record[i].type & MH) {
1316 if (!(record[i].type & MHC))
1317 log_error(VLDB_CHECK_ERROR,"Multihomed block at %ld is orphaned\n",
1320 if (record[i].type & 0xfffffef0)
1322 (VLDB_CHECK_ERROR,"Multihomed block at %ld also found on other chains (0x%x)\n",
1323 record[i].addr, record[i].type);
1326 log_error(VLDB_CHECK_ERROR,"Unknown entry type at %u (0x%x)\n", record[i].addr,
1331 if (verbose) quiet_println("Verify each chain head\n");
1336 for (j = 0; j < HASHSIZE; j++) {
1337 for (addr = header.VolnameHash[j]; j < HASHSIZE; j++) {
1338 if (record[ADDR(addr)].type & MULTN) {
1339 hash = NameHash(vlentry.name);
1341 header.VolnameHash[j] = vlentry.nextNameHash;
1342 vlentry.nextNameHash = 0;
1344 writeentry(record[i].addr, &vlentry);
1349 for (i = 0; i <= 2; i++) {
1350 for (j = 0, addr = header.VolidHash[i][j]; j < HASHSIZE; j++) {
1351 if (verbose) quiet_println("got %d %d %d\n", i, j, ADDR(addr));
1352 if (i == 0 && (record[ADDR(addr)].type & MULTRW)) {
1353 hash = IdHash(vlentry.volumeId[i]);
1355 header.VolidHash[i][j] = vlentry.nextIdHash[i];
1356 vlentry.nextIdHash[i] = 0;
1358 quiet_println("fix %d %d %d\n", i, j, ADDR(addr));
1359 writeentry(record[i].addr, &vlentry);
1364 if (i == 1 && (record[ADDR(addr)].type & MULTRO)) {
1365 hash = IdHash(vlentry.volumeId[i]);
1367 header.VolidHash[i][j] = vlentry.nextIdHash[i];
1368 vlentry.nextIdHash[i] = 0;
1370 quiet_println("fix %d %d %d\n", i, j, addr);
1371 writeentry(record[i].addr, &vlentry);
1376 if (i == 2 && (record[ADDR(addr)].type & MULTBK)) {
1377 hash = IdHash(vlentry.volumeId[i]);
1379 header.VolidHash[i][j] = vlentry.nextIdHash[i];
1380 vlentry.nextIdHash[i] = 0;
1382 quiet_println("fix %d %d %d\n", i, j, addr);
1383 writeentry(record[i].addr, &vlentry);
1390 /* By the time we get here, unchained entries are really unchained */
1391 quiet_println("Scanning %u entries for possible repairs\n", maxentries);
1392 for (i = 0; i < maxentries; i++) {
1394 if (record[i].type & VL) {
1395 readentry(record[i].addr, &vlentry, &type);
1396 if (!(record[i].type & REFN)) {
1397 log_error(VLDB_CHECK_ERROR,"%d: Record %ld (type 0x%x) not in a name chain\n", i,
1398 record[i].addr, record[i].type);
1399 if (strlen(vlentry.name)>0) {
1401 if (header.VolnameHash[NameHash(vlentry.name)] == 0)
1402 header.VolnameHash[NameHash(vlentry.name)] = record[i].addr;
1404 FixBad(i, header.VolnameHash[NameHash(vlentry.name)], NH, record[i].addr, &vlentry, NameHash(vlentry.name));
1407 nextpp = &vlentry.nextNameHash;
1408 if (fix && *nextpp) {
1409 printf(", unchaining");
1411 writeentry(record[i].addr, &vlentry);
1415 if (vlentry.volumeId[0] && !(record[i].type & REFRW)) {
1416 log_error(VLDB_CHECK_ERROR,"%d: Record %ld (type 0x%x) not in a RW chain\n", i,
1417 record[i].addr, record[i].type);
1419 if (header.VolidHash[0][IdHash(vlentry.volumeId[0])] == 0)
1420 header.VolidHash[0][IdHash(vlentry.volumeId[0])] = record[i].addr;
1422 FixBad(i, header.VolidHash[0][IdHash(vlentry.volumeId[0])], RWH, record[i].addr, &vlentry, IdHash(vlentry.volumeId[0]));
1425 if (vlentry.volumeId[1] && !(record[i].type & REFRO)) {
1426 log_error(VLDB_CHECK_ERROR,"%d: Record %ld (type 0x%x) not in a RO chain\n", i,
1427 record[i].addr, record[i].type);
1429 if (header.VolidHash[1][IdHash(vlentry.volumeId[1])] == 0)
1430 header.VolidHash[1][IdHash(vlentry.volumeId[1])] = record[i].addr;
1432 FixBad(i, header.VolidHash[1][IdHash(vlentry.volumeId[1])], ROH, record[i].addr, &vlentry, IdHash(vlentry.volumeId[1]));
1435 if (vlentry.volumeId[2] && !(record[i].type & REFBK)) {
1436 log_error(VLDB_CHECK_ERROR,"%d: Record %ld (type 0x%x) not in a BK chain\n", i,
1437 record[i].addr, record[i].type);
1439 if (header.VolidHash[2][IdHash(vlentry.volumeId[2])] == 0)
1440 header.VolidHash[2][IdHash(vlentry.volumeId[2])] = record[i].addr;
1442 FixBad(i, header.VolidHash[2][IdHash(vlentry.volumeId[2])], BKH, record[i].addr, &vlentry, IdHash(vlentry.volumeId[2]));
1449 writeheader(&header);
1465 main(int argc, char **argv)
1467 struct cmd_syndesc *ts;
1471 ts = cmd_CreateSyntax(NULL, WorkerBee, NULL, "vldb check");
1472 cmd_AddParm(ts, "-database", CMD_SINGLE, CMD_REQUIRED, "vldb_file");
1473 cmd_AddParm(ts, "-uheader", CMD_FLAG, CMD_OPTIONAL,
1474 "Display UBIK header");
1475 cmd_AddParm(ts, "-vheader", CMD_FLAG, CMD_OPTIONAL,
1476 "Display VLDB header");
1477 cmd_AddParm(ts, "-servers", CMD_FLAG, CMD_OPTIONAL,
1478 "Display server list");
1479 cmd_AddParm(ts, "-entries", CMD_FLAG, CMD_OPTIONAL, "Display entries");
1480 cmd_AddParm(ts, "-verbose", CMD_FLAG, CMD_OPTIONAL, "verbose");
1481 cmd_AddParm(ts, "-quiet", CMD_FLAG, CMD_OPTIONAL, "quiet");
1482 cmd_AddParm(ts, "-fix", CMD_FLAG, CMD_OPTIONAL, "attempt to patch the database (potentially dangerous)");
1484 return cmd_Dispatch(argc, argv);