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
9 * Portions Copyright (c) 2006 Sine Nomine Associates
13 * NEW callback package callback.c (replaces vicecb.c)
14 * Updated call back routines, NOW with:
16 * Faster DeleteVenus (Now called DeleteAllCallBacks)
17 * Call back breaking for volumes
18 * Adaptive timeouts on call backs
19 * Architected for Multi RPC
20 * No locks (currently implicit vnode locks--these will go, to)
21 * Delayed call back when rpc connection down.
22 * Bulk break of delayed call backs when rpc connection
24 * Strict limit on number of call backs.
26 * InitCallBack(nblocks)
27 * Initialize: nblocks is max number # of file entries + # of callback entries
28 * nblocks must be < 65536
29 * Space used is nblocks*16 bytes
30 * Note that space will be reclaimed by breaking callbacks of old hosts
32 * time = AddCallBack(host, fid)
34 * Returns the expiration time at the workstation.
36 * BreakCallBack(host, fid)
37 * Break all call backs for fid, except for the specified host.
40 * BreakVolumeCallBacks(volume)
41 * Break all call backs on volume, using single call to each host
42 * Delete all the call backs.
44 * DeleteCallBack(host,fid)
45 * Delete (do not break) single call back for fid.
47 * DeleteFileCallBacks(fid)
48 * Delete (do not break) all call backs for fid.
50 * DeleteAllCallBacks(host)
51 * Delete (do not break) all call backs for host.
53 * CleanupTimedOutCallBacks()
54 * Delete all timed out call back entries
55 * Must be called periodically by file server.
57 * BreakDelayedCallBacks(host)
58 * Break all delayed call backs for host.
59 * Returns 1: one or more failed, 0: success.
61 * PrintCallBackStats()
62 * Print statistics about call backs to stdout.
64 * DumpCallBacks() ---wishful thinking---
65 * Dump call back state to /tmp/callback.state.
66 * This is separately interpretable by the program pcb.
68 * Notes: In general, if a call back to a host doesn't get through,
69 * then HostDown, supplied elsewhere, is called. BreakDelayedCallBacks,
70 * however, does not call HostDown, but instead returns an indication of
71 * success if all delayed call backs were finally broken.
73 * BreakDelayedCallBacks MUST be called at the first sign of activity
74 * from the host after HostDown has been called (or a previous
75 * BreakDelayedCallBacks failed). The BreakDelayedCallBacks must be
76 * allowed to complete before any requests from that host are handled.
77 * If BreakDelayedCallBacks fails, then the host should remain
78 * down (and the request should be failed).
80 * CleanupCallBacks MUST be called periodically by the file server for
81 * this package to work correctly. Every 5 minutes is suggested.
84 #include <afsconfig.h>
85 #include <afs/param.h>
91 #include <stdlib.h> /* for malloc() */
92 #include <time.h> /* ANSI standard location for time stuff */
103 #ifdef HAVE_STRINGS_H
107 #include <afs/assert.h>
109 #include <afs/stds.h>
111 #include <afs/nfs.h> /* yuck. This is an abomination. */
114 #include <afscbint.h>
115 #include <afs/afsutil.h>
117 #include <afs/ihandle.h>
118 #include <afs/vnode.h>
119 #include <afs/volume.h>
120 #include "viced_prototypes.h"
123 #include <afs/ptclient.h> /* need definition of prlist for host.h */
125 #include "callback.h"
126 #ifdef AFS_DEMAND_ATTACH_FS
127 #include "../tviced/serialize_state.h"
128 #endif /* AFS_DEMAND_ATTACH_FS */
131 extern afsUUID FS_HostUUID;
132 extern int hostCount;
133 static int ShowProblems = 1;
135 struct cbcounters cbstuff;
137 static struct FileEntry * FE = NULL; /* don't use FE[0] */
138 static struct CallBack * CB = NULL; /* don't use CB[0] */
140 static struct CallBack * CBfree = NULL;
141 static struct FileEntry * FEfree = NULL;
144 /* Time to live for call backs depends upon number of users of the file.
145 * TimeOuts is indexed by this number/8 (using TimeOut macro). Times
146 * in this table are for the workstation; server timeouts, add
149 static int TimeOuts[] = {
150 /* Note: don't make the first entry larger than 4 hours (see above) */
151 4 * 60 * 60, /* 0-7 users */
152 1 * 60 * 60, /* 8-15 users */
153 30 * 60, /* 16-23 users */
154 15 * 60, /* 24-31 users */
155 15 * 60, /* 32-39 users */
156 10 * 60, /* 40-47 users */
157 10 * 60, /* 48-55 users */
158 10 * 60, /* 56-63 users */
159 }; /* Anything more: MinTimeOut */
161 /* minimum time given for a call back */
162 static int MinTimeOut = (7 * 60);
164 /* Heads of CB queues; a timeout index is 1+index into this array */
165 static afs_uint32 timeout[CB_NUM_TIMEOUT_QUEUES];
167 static afs_int32 tfirst; /* cbtime of oldest unexpired call back time queue */
170 /* 16 byte object get/free routines */
175 /* Prototypes for static routines */
176 static struct FileEntry *FindFE(register AFSFid * fid);
177 static struct CallBack *iGetCB(register int *nused);
178 static int iFreeCB(register struct CallBack *cb, register int *nused);
179 static struct FileEntry *iGetFE(register int *nused);
180 static int iFreeFE(register struct FileEntry *fe, register int *nused);
181 static int TAdd(register struct CallBack *cb, register afs_uint32 * thead);
182 static int TDel(register struct CallBack *cb);
183 static int HAdd(register struct CallBack *cb, register struct host *host);
184 static int HDel(register struct CallBack *cb);
185 static int CDel(struct CallBack *cb, int deletefe);
186 static int CDelPtr(register struct FileEntry *fe, register afs_uint32 * cbp,
188 static afs_uint32 *FindCBPtr(struct FileEntry *fe, struct host *host);
189 static int FDel(register struct FileEntry *fe);
190 static int AddCallBack1_r(struct host *host, AFSFid * fid, afs_uint32 * thead,
191 int type, int locked);
192 static void MultiBreakCallBack_r(struct cbstruct cba[], int ncbas,
193 struct AFSCBFids *afidp, struct host *xhost);
194 static int MultiBreakVolumeCallBack_r(struct host *host, int isheld,
195 struct VCBParams *parms, int deletefe);
196 static int MultiBreakVolumeCallBack(struct host *host, int isheld,
197 struct VCBParams *parms);
198 static int MultiBreakVolumeLaterCallBack(struct host *host, int isheld,
199 struct VCBParams *parms);
200 static int GetSomeSpace_r(struct host *hostp, int locked);
201 static int ClearHostCallbacks_r(struct host *hp, int locked);
203 #define GetCB() ((struct CallBack *)iGetCB(&cbstuff.nCBs))
204 #define GetFE() ((struct FileEntry *)iGetFE(&cbstuff.nFEs))
205 #define FreeCB(cb) iFreeCB((struct CallBack *)cb, &cbstuff.nCBs)
206 #define FreeFE(fe) iFreeFE((struct FileEntry *)fe, &cbstuff.nFEs)
209 /* Other protos - move out sometime */
210 void PrintCB(register struct CallBack *cb, afs_uint32 now);
212 static afs_uint32 HashTable[FEHASH_SIZE]; /* File entry hash table */
214 static struct FileEntry *
215 FindFE(register AFSFid * fid)
219 register struct FileEntry *fe;
221 hash = FEHash(fid->Volume, fid->Unique);
222 for (fei = HashTable[hash]; fei; fei = fe->fnext) {
224 if (fe->volid == fid->Volume && fe->unique == fid->Unique
225 && fe->vnode == fid->Vnode && (fe->status & FE_LATER) != FE_LATER)
231 #ifndef INTERPRET_DUMP
233 static struct CallBack *
234 iGetCB(register int *nused)
236 register struct CallBack *ret;
238 if ((ret = CBfree)) {
239 CBfree = (struct CallBack *)(((struct object *)ret)->next);
246 iFreeCB(register struct CallBack *cb, register int *nused)
248 ((struct object *)cb)->next = (struct object *)CBfree;
254 static struct FileEntry *
255 iGetFE(register int *nused)
257 register struct FileEntry *ret;
259 if ((ret = FEfree)) {
260 FEfree = (struct FileEntry *)(((struct object *)ret)->next);
267 iFreeFE(register struct FileEntry *fe, register int *nused)
269 ((struct object *)fe)->next = (struct object *)FEfree;
275 /* Add cb to end of specified timeout list */
277 TAdd(register struct CallBack *cb, register afs_uint32 * thead)
280 (*thead) = cb->tnext = cb->tprev = cbtoi(cb);
282 register struct CallBack *thp = itocb(*thead);
284 cb->tprev = thp->tprev;
288 thp->tprev = (itocb(thp->tprev)->tnext = cbtoi(cb));
290 thp->tprev = cbtoi(cb);
293 cb->thead = ttoi(thead);
297 /* Delete call back entry from timeout list */
299 TDel(register struct CallBack *cb)
301 register afs_uint32 *thead = itot(cb->thead);
303 if (*thead == cbtoi(cb))
304 *thead = (*thead == cb->tnext ? 0 : cb->tnext);
305 if (itocb(cb->tprev))
306 itocb(cb->tprev)->tnext = cb->tnext;
307 if (itocb(cb->tnext))
308 itocb(cb->tnext)->tprev = cb->tprev;
312 /* Add cb to end of specified host list */
314 HAdd(register struct CallBack *cb, register struct host *host)
316 cb->hhead = h_htoi(host);
318 host->cblist = cb->hnext = cb->hprev = cbtoi(cb);
320 register struct CallBack *fcb = itocb(host->cblist);
322 cb->hprev = fcb->hprev;
323 cb->hnext = cbtoi(fcb);
324 fcb->hprev = (itocb(fcb->hprev)->hnext = cbtoi(cb));
329 /* Delete call back entry from host list */
331 HDel(register struct CallBack *cb)
333 register afs_uint32 *hhead = &h_itoh(cb->hhead)->cblist;
335 if (*hhead == cbtoi(cb))
336 *hhead = (*hhead == cb->hnext ? 0 : cb->hnext);
337 itocb(cb->hprev)->hnext = cb->hnext;
338 itocb(cb->hnext)->hprev = cb->hprev;
342 /* Delete call back entry from fid's chain of cb's */
343 /* N.B. This one also deletes the CB, and also possibly parent FE, so
344 * make sure that it is not on any other list before calling this
347 CDel(struct CallBack *cb, int deletefe)
350 struct FileEntry *fe = itofe(cb->fhead);
351 register afs_uint32 *cbp;
354 for (safety = 0, cbp = &fe->firstcb; *cbp && *cbp != cbi;
355 cbp = &itocb(*cbp)->cnext, safety++) {
356 if (safety > cbstuff.nblks + 10) {
359 ("CDel: Internal Error -- shutting down: wanted %d from %d, now at %d\n",
360 cbi, fe->firstcb, *cbp));
362 ShutDownAndCore(PANIC);
365 CDelPtr(fe, cbp, deletefe);
369 /* Same as CDel, but pointer to parent pointer to CB entry is passed,
370 * as well as file entry */
371 /* N.B. This one also deletes the CB, and also possibly parent FE, so
372 * make sure that it is not on any other list before calling this
374 static int Ccdelpt = 0, CcdelB = 0;
377 CDelPtr(register struct FileEntry *fe, register afs_uint32 * cbp,
380 register struct CallBack *cb;
390 if (deletefe && (--fe->ncbs == 0))
396 FindCBPtr(struct FileEntry *fe, struct host *host)
398 register afs_uint32 hostindex = h_htoi(host);
399 register struct CallBack *cb;
400 register afs_uint32 *cbp;
403 for (safety = 0, cbp = &fe->firstcb; *cbp; cbp = &cb->cnext, safety++) {
404 if (safety > cbstuff.nblks) {
405 ViceLog(0, ("FindCBPtr: Internal Error -- shutting down.\n"));
407 ShutDownAndCore(PANIC);
410 if (cb->hhead == hostindex)
416 /* Delete file entry from hash table */
418 FDel(register struct FileEntry *fe)
420 register int fei = fetoi(fe);
421 register afs_uint32 *p = &HashTable[FEHash(fe->volid, fe->unique)];
423 while (*p && *p != fei)
424 p = &itofe(*p)->fnext;
431 /* initialize the callback package */
433 InitCallBack(int nblks)
436 tfirst = CBtime(FT_ApproxTime());
437 /* N.B. The "-1", below, is because
438 * FE[0] and CB[0] are not used--and not allocated */
439 FE = ((struct FileEntry *)(calloc(nblks, sizeof(struct FileEntry))));
441 ViceLog(0, ("Failed malloc in InitCallBack\n"));
444 FE--; /* FE[0] is supposed to point to junk */
445 cbstuff.nFEs = nblks;
447 FreeFE(&FE[cbstuff.nFEs]); /* This is correct */
448 CB = ((struct CallBack *)(calloc(nblks, sizeof(struct CallBack))));
450 ViceLog(0, ("Failed malloc in InitCallBack\n"));
453 CB--; /* CB[0] is supposed to point to junk */
454 cbstuff.nCBs = nblks;
456 FreeCB(&CB[cbstuff.nCBs]); /* This is correct */
457 cbstuff.nblks = nblks;
458 cbstuff.nbreakers = 0;
464 XCallBackBulk_r(struct host * ahost, struct AFSFid * fids, afs_int32 nfids)
466 struct AFSCallBack tcbs[AFSCBMAX];
472 struct rx_connection *cb_conn = NULL;
475 rx_SetConnDeadTime(ahost->callback_rxcon, 4);
476 rx_SetConnHardDeadTime(ahost->callback_rxcon, AFS_HARDDEADTIME);
483 for (i = 0; i < nfids && i < AFSCBMAX; i++) {
484 tcbs[i].CallBackVersion = CALLBACK_VERSION;
485 tcbs[i].ExpirationTime = 0;
486 tcbs[i].CallBackType = CB_DROPPED;
488 tf.AFSCBFids_len = i;
489 tf.AFSCBFids_val = &(fids[j]);
493 tc.AFSCBs_val = tcbs;
495 cb_conn = ahost->callback_rxcon;
496 rx_GetConnection(cb_conn);
498 code |= RXAFSCB_CallBack(cb_conn, &tf, &tc);
499 rx_PutConnection(cb_conn);
507 /* the locked flag tells us if the host entry has already been locked
508 * by our parent. I don't think anybody actually calls us with the
509 * host locked, but here's how to make that work: GetSomeSpace has to
510 * change so that it doesn't attempt to lock any hosts < "host". That
511 * means that it might be unable to free any objects, so it has to
512 * return an exit status. If it fails, then AddCallBack1 might fail,
513 * as well. If so, the host->ResetDone should probably be set to 0,
514 * and we probably don't want to return a callback promise to the
515 * cache manager, either. */
517 AddCallBack1(struct host *host, AFSFid * fid, afs_uint32 * thead, int type,
525 retVal = AddCallBack1_r(host, fid, thead, type, 1);
535 AddCallBack1_r(struct host *host, AFSFid * fid, afs_uint32 * thead, int type,
538 struct FileEntry *fe;
539 struct CallBack *cb = 0, *lastcb = 0;
540 struct FileEntry *newfe = 0;
542 afs_uint32 *Thead = thead;
543 struct CallBack *newcb = 0;
548 /* allocate these guys first, since we can't call the allocator with
549 * the host structure locked -- or we might deadlock. However, we have
550 * to avoid races with FindFE... */
551 while (!(newcb = GetCB())) {
552 GetSomeSpace_r(host, locked);
554 while (!(newfe = GetFE())) { /* Get it now, so we don't have to call */
555 /* GetSomeSpace with the host locked, later. This might turn out to */
556 /* have been unneccessary, but that's actually kind of unlikely, since */
557 /* most files are not shared. */
558 GetSomeSpace_r(host, locked);
562 h_Lock_r(host); /* this can yield, so do it before we get any */
567 if (type == CB_NORMAL) {
569 TimeCeiling(FT_ApproxTime() + TimeOut(fe ? fe->ncbs : 0) +
571 Thead = THead(CBtime(time_out));
572 } else if (type == CB_VOLUME) {
573 time_out = TimeCeiling((60 * 120 + FT_ApproxTime()) + ServerBias);
574 Thead = THead(CBtime(time_out));
575 } else if (type == CB_BULK) {
576 /* bulk status can get so many callbacks all at once, and most of them
577 * are probably not for things that will be used for long.
580 TimeCeiling(FT_ApproxTime() + ServerBias +
581 TimeOut(22 + (fe ? fe->ncbs : 0)));
582 Thead = THead(CBtime(time_out));
588 register afs_uint32 hash;
593 fe->volid = fid->Volume;
594 fe->vnode = fid->Vnode;
595 fe->unique = fid->Unique;
598 hash = FEHash(fid->Volume, fid->Unique);
599 fe->fnext = HashTable[hash];
600 HashTable[hash] = fetoi(fe);
602 for (safety = 0, lastcb = cb = itocb(fe->firstcb); cb;
603 lastcb = cb, cb = itocb(cb->cnext), safety++) {
604 if (safety > cbstuff.nblks) {
605 ViceLog(0, ("AddCallBack1: Internal Error -- shutting down.\n"));
607 ShutDownAndCore(PANIC);
609 if (cb->hhead == h_htoi(host))
612 if (cb) { /* Already have call back: move to new timeout list */
613 /* don't change delayed callbacks back to normal ones */
614 if (cb->status != CB_DELAYED)
616 /* Only move if new timeout is longer */
617 if (TNorm(ttoi(Thead)) > TNorm(cb->thead)) {
621 if (newfe == NULL) { /* we are using the new FE */
622 fe->firstcb = cbtoi(cb);
624 cb->fhead = fetoi(fe);
629 *(lastcb ? &lastcb->cnext : &fe->firstcb) = cbtoi(cb);
632 cb->fhead = fetoi(fe);
638 /* now free any still-unused callback or host entries */
644 if (!locked) /* freecb and freefe might(?) yield */
647 if (type == CB_NORMAL || type == CB_VOLUME || type == CB_BULK)
648 return time_out - ServerBias; /* Expires sooner at workstation */
653 /* Take an array full of hosts, all held. Break callbacks to them, and
654 * release the holds once you're done, except don't release xhost. xhost
655 * may be NULL. Currently only works for a single Fid in afidp array.
656 * If you want to make this work with multiple fids, you need to fix
657 * the error handling. One approach would be to force a reset if a
658 * multi-fid call fails, or you could add delayed callbacks for each
659 * fid. You probably also need to sort and remove duplicate hosts.
660 * When this is called from the BreakVolumeCallBacks path, it does NOT
661 * force a reset if the RPC fails, it just marks the host down and tries
662 * to create a delayed callback. */
663 /* N.B. be sure that code works when ncbas == 0 */
664 /* N.B. requires all the cba[*].hp pointers to be valid... */
665 /* This routine does not hold a lock on the host for the duration of
666 * the BreakCallBack RPC, which is a significant deviation from tradition.
667 * It _does_ get a lock on the host before setting VenusDown = 1,
668 * which is sufficient only if VenusDown = 0 only happens when the
669 * lock is held over the RPC and the subsequent VenusDown == 0
670 * wherever that is done. */
672 MultiBreakCallBack_r(struct cbstruct cba[], int ncbas,
673 struct AFSCBFids *afidp, struct host *xhost)
676 struct rx_connection *conns[MAX_CB_HOSTS];
677 static struct AFSCBs tc = { 0, 0 };
678 int multi_to_cba_map[MAX_CB_HOSTS];
680 assert(ncbas <= MAX_CB_HOSTS);
682 /* set up conns for multi-call */
683 for (i = 0, j = 0; i < ncbas; i++) {
684 struct host *thishost = cba[i].hp;
685 if (!thishost || (thishost->hostFlags & HOSTDELETED)) {
688 rx_GetConnection(thishost->callback_rxcon);
689 multi_to_cba_map[j] = i;
690 conns[j++] = thishost->callback_rxcon;
693 rx_SetConnDeadTime(thishost->callback_rxcon, 4);
694 rx_SetConnHardDeadTime(thishost->callback_rxcon, AFS_HARDDEADTIME);
698 if (j) { /* who knows what multi would do with 0 conns? */
702 multi_RXAFSCB_CallBack(afidp, &tc);
708 i = multi_to_cba_map[multi_i];
714 ("BCB: INTERNAL ERROR: hp=%x, cba=%x, thead=%u\n",
718 ** try breaking callbacks on alternate interface addresses
720 if (MultiBreakCallBackAlternateAddress(hp, afidp)) {
723 ("BCB: Failed on file %u.%u.%u, Host %s:%d is down\n",
724 afidp->AFSCBFids_val->Volume,
725 afidp->AFSCBFids_val->Vnode,
726 afidp->AFSCBFids_val->Unique,
727 afs_inet_ntoa_r(hp->host, hoststr),
733 hp->hostFlags |= VENUSDOWN;
735 * We always go into AddCallBack1_r with the host locked
737 AddCallBack1_r(hp, afidp->AFSCBFids_val, itot(idx),
750 for (i = 0; i < ncbas; i++) {
753 if (hp && xhost != hp) {
758 /* H_UNLOCK around this so h_FreeConnection does not deadlock.
759 h_FreeConnection should *never* be called on a callback connection,
760 but on 10/27/04 a deadlock occurred where it was, when we know why,
761 this should be reverted. -- shadow */
763 for (i = 0; i < j; i++) {
764 rx_PutConnection(conns[i]);
772 * Break all call backs for fid, except for the specified host (unless flag
773 * is true, in which case all get a callback message. Assumption: the specified
774 * host is h_Held, by the caller; the others aren't.
775 * Specified host may be bogus, that's ok. This used to check to see if the
776 * host was down in two places, once right after the host was h_held, and
777 * again after it was locked. That race condition is incredibly rare and
778 * relatively harmless even when it does occur, so we don't check for it now.
780 /* if flag is true, send a break callback msg to "host", too */
782 BreakCallBack(struct host *xhost, AFSFid * fid, int flag)
784 struct FileEntry *fe;
785 struct CallBack *cb, *nextcb;
786 struct cbstruct cba[MAX_CB_HOSTS];
793 ("BCB: BreakCallBack(all but %s:%d, (%u,%u,%u))\n",
794 afs_inet_ntoa_r(xhost->host, hoststr), ntohs(xhost->port),
795 fid->Volume, fid->Vnode, fid->Unique));
798 cbstuff.BreakCallBacks++;
803 hostindex = h_htoi(xhost);
804 cb = itocb(fe->firstcb);
805 if (!cb || ((fe->ncbs == 1) && (cb->hhead == hostindex) && !flag)) {
806 /* the most common case is what follows the || */
809 tf.AFSCBFids_len = 1;
810 tf.AFSCBFids_val = fid;
813 for (ncbas = 0; cb && ncbas < MAX_CB_HOSTS; cb = nextcb) {
814 nextcb = itocb(cb->cnext);
815 if ((cb->hhead != hostindex || flag)
816 && (cb->status == CB_BULK || cb->status == CB_NORMAL
817 || cb->status == CB_VOLUME)) {
818 struct host *thishost = h_itoh(cb->hhead);
820 ViceLog(0, ("BCB: BOGUS! cb->hhead is NULL!\n"));
821 } else if (thishost->hostFlags & VENUSDOWN) {
823 ("BCB: %s:%d is down; delaying break call back\n",
824 afs_inet_ntoa_r(thishost->host, hoststr),
825 ntohs(thishost->port)));
826 cb->status = CB_DELAYED;
829 cba[ncbas].hp = thishost;
830 cba[ncbas].thead = cb->thead;
834 CDel(cb, 1); /* Usually first; so this delete
835 * is reasonably inexpensive */
841 MultiBreakCallBack_r(cba, ncbas, &tf, xhost);
843 /* we need to to all these initializations again because MultiBreakCallBack may block */
848 cb = itocb(fe->firstcb);
849 if (!cb || ((fe->ncbs == 1) && (cb->hhead == hostindex) && !flag)) {
850 /* the most common case is what follows the || */
861 /* Delete (do not break) single call back for fid */
863 DeleteCallBack(struct host *host, AFSFid * fid)
865 register struct FileEntry *fe;
866 register afs_uint32 *pcb;
869 cbstuff.DeleteCallBacks++;
878 ("DCB: No call backs for fid (%u, %u, %u)\n", fid->Volume,
879 fid->Vnode, fid->Unique));
882 pcb = FindCBPtr(fe, host);
885 ("DCB: No call back for host %s:%d, (%u, %u, %u)\n",
886 afs_inet_ntoa_r(host->host, hoststr), ntohs(host->port),
887 fid->Volume, fid->Vnode, fid->Unique));
901 * Delete (do not break) all call backs for fid. This call doesn't
902 * set all of the various host locks, but it shouldn't really matter
903 * since we're not adding callbacks, but deleting them. I'm not sure
904 * why it doesn't set the lock, however; perhaps it should.
907 DeleteFileCallBacks(AFSFid * fid)
909 register struct FileEntry *fe;
910 register struct CallBack *cb;
911 register afs_uint32 cbi;
915 cbstuff.DeleteFiles++;
920 ("DF: No fid (%u,%u,%u) to delete\n", fid->Volume, fid->Vnode,
924 for (n = 0, cbi = fe->firstcb; cbi; n++) {
936 /* Delete (do not break) all call backs for host. The host should be
939 DeleteAllCallBacks_r(struct host *host, int deletefe)
941 register struct CallBack *cb;
942 register int cbi, first;
944 cbstuff.DeleteAllCallBacks++;
945 cbi = first = host->cblist;
947 ViceLog(8, ("DV: no call backs\n"));
955 } while (cbi != first);
961 * Break all delayed call backs for host. Returns 1 if all call backs
962 * successfully broken; 0 otherwise. Assumes host is h_Held and h_Locked.
963 * Must be called with VenusDown set for this host
966 BreakDelayedCallBacks(struct host *host)
970 retVal = BreakDelayedCallBacks_r(host);
976 BreakDelayedCallBacks_r(struct host *host)
978 struct AFSFid fids[AFSCBMAX];
979 u_byte thead[AFSCBMAX]; /* This should match thead in struct Callback */
980 int cbi, first, nfids;
984 struct rx_connection *cb_conn;
987 if (!(host->hostFlags & RESETDONE) && !(host->hostFlags & HOSTDELETED)) {
988 host->hostFlags &= ~ALTADDR; /* alternate addresses are invalid */
989 cb_conn = host->callback_rxcon;
990 rx_GetConnection(cb_conn);
991 if (host->interface) {
994 RXAFSCB_InitCallBackState3(cb_conn, &FS_HostUUID);
997 code = RXAFSCB_InitCallBackState(cb_conn);
999 rx_PutConnection(cb_conn);
1002 host->hostFlags |= ALTADDR; /* alternate addresses are valid */
1006 ("CB: Call back connect back failed (in break delayed) for Host %s:%d\n",
1007 afs_inet_ntoa_r(host->host, hoststr),
1008 ntohs(host->port)));
1010 host->hostFlags |= VENUSDOWN;
1013 ("InitCallBackState success on %s\n",
1014 afs_inet_ntoa_r(host->host, hoststr)));
1015 /* reset was done successfully */
1016 host->hostFlags |= RESETDONE;
1017 host->hostFlags &= ~VENUSDOWN;
1020 while (!(host->hostFlags & HOSTDELETED)) {
1022 host->hostFlags &= ~VENUSDOWN; /* presume up */
1023 cbi = first = host->cblist;
1027 first = host->cblist;
1030 if (cb->status == CB_DELAYED) {
1031 register struct FileEntry *fe = itofe(cb->fhead);
1032 thead[nfids] = cb->thead;
1033 fids[nfids].Volume = fe->volid;
1034 fids[nfids].Vnode = fe->vnode;
1035 fids[nfids].Unique = fe->unique;
1041 } while (cbi && cbi != first && nfids < AFSCBMAX);
1047 if (XCallBackBulk_r(host, fids, nfids)) {
1048 /* Failed, again: put them back, probably with old
1053 ("CB: XCallBackBulk failed, Host %s:%d; callback list follows:\n",
1054 afs_inet_ntoa_r(host->host, hoststr),
1055 ntohs(host->port)));
1057 for (i = 0; i < nfids; i++) {
1060 ("CB: Host %s:%d, file %u.%u.%u (part of bulk callback)\n",
1061 afs_inet_ntoa_r(host->host, hoststr),
1062 ntohs(host->port), fids[i].Volume,
1063 fids[i].Vnode, fids[i].Unique));
1066 * AddCallBack1_r(host, &fids[i], itot(thead[i]), CB_DELAYED, 1);
1067 * * but it turns out to cause too many tricky locking problems.
1068 * * now, if break delayed fails, screw it. */
1070 host->hostFlags |= VENUSDOWN; /* Failed */
1071 ClearHostCallbacks_r(host, 1 /* locked */ );
1075 if (nfids < AFSCBMAX)
1079 cbstuff.nbreakers--;
1080 /* If we succeeded it's always ok to unset HFE_LATER */
1081 if (!host->hostFlags & VENUSDOWN)
1082 host->hostFlags &= ~HFE_LATER;
1083 return (host->hostFlags & VENUSDOWN);
1087 ** isheld is 0 if the host is held in h_Enumerate
1088 ** isheld is 1 if the host is held in BreakVolumeCallBacks
1091 MultiBreakVolumeCallBack_r(struct host *host, int isheld,
1092 struct VCBParams *parms, int deletefe)
1097 return isheld; /* host is held only by h_Enumerate, do nothing */
1098 if (host->hostFlags & HOSTDELETED)
1099 return 0; /* host is deleted, release hold */
1101 if (host->hostFlags & VENUSDOWN) {
1103 if (host->hostFlags & HOSTDELETED) {
1105 return 0; /* Release hold */
1108 ("BVCB: volume call back for Host %s:%d failed\n",
1109 afs_inet_ntoa_r(host->host, hoststr), ntohs(host->port)));
1112 ("CB: volume callback for Host %s:%d failed\n",
1113 afs_inet_ntoa_r(host->host, hoststr),
1114 ntohs(host->port)));
1116 DeleteAllCallBacks_r(host, deletefe); /* Delete all callback state
1117 * rather than attempting to
1118 * selectively remember to
1119 * delete the volume callbacks
1121 host->hostFlags &= ~RESETDONE; /* Do InitCallBackState when host returns */
1123 return 0; /* release hold */
1125 assert(parms->ncbas <= MAX_CB_HOSTS);
1127 /* Do not call MultiBreakCallBack on the current host structure
1128 ** because it would prematurely release the hold on the host
1130 if (parms->ncbas == MAX_CB_HOSTS) {
1131 struct AFSCBFids tf;
1133 tf.AFSCBFids_len = 1;
1134 tf.AFSCBFids_val = parms->fid;
1136 /* this releases all the hosts */
1137 MultiBreakCallBack_r(parms->cba, parms->ncbas, &tf, 0 /* xhost */ );
1141 parms->cba[parms->ncbas].hp = host;
1142 parms->cba[(parms->ncbas)++].thead = parms->thead;
1143 return 1; /* DON'T release hold, because we still need it. */
1147 ** isheld is 0 if the host is held in h_Enumerate
1148 ** isheld is 1 if the host is held in BreakVolumeCallBacks
1151 MultiBreakVolumeCallBack(struct host *host, int isheld,
1152 struct VCBParams *parms)
1156 retval = MultiBreakVolumeCallBack_r(host, isheld, parms, 1);
1162 ** isheld is 0 if the host is held in h_Enumerate
1163 ** isheld is 1 if the host is held in BreakVolumeCallBacks
1166 MultiBreakVolumeLaterCallBack(struct host *host, int isheld,
1167 struct VCBParams *parms)
1171 retval = MultiBreakVolumeCallBack_r(host, isheld, parms, 0);
1177 * Break all call backs on a single volume. Don't call this with any
1178 * hosts h_held. Note that this routine clears the callbacks before
1179 * actually breaking them, and that the vnode isn't locked during this
1180 * operation, so that people might see temporary callback loss while
1181 * this function is executing. It is just a temporary state, however,
1182 * since the callback will be broken later by this same function.
1184 * Now uses multi-RX for CallBack RPC. Note that the
1185 * multiBreakCallBacks routine does not force a reset if the RPC
1186 * fails, unlike the previous version of this routine, but does create
1187 * a delayed callback. Resets will be forced if the host is
1188 * determined to be down before the RPC is executed.
1191 BreakVolumeCallBacks(afs_uint32 volume)
1196 struct CallBack *cb;
1197 struct FileEntry *fe;
1199 struct VCBParams henumParms;
1200 afs_uint32 tthead = 0; /* zero is illegal value */
1203 fid.Volume = volume, fid.Vnode = fid.Unique = 0;
1204 for (hash = 0; hash < FEHASH_SIZE; hash++) {
1205 for (feip = &HashTable[hash]; (fe = itofe(*feip));) {
1206 if (fe->volid == volume) {
1207 register struct CallBack *cbnext;
1208 for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
1209 host = h_itoh(cb->hhead);
1211 cbnext = itocb(cb->cnext);
1212 if (!tthead || (TNorm(tthead) < TNorm(cb->thead))) {
1218 /* leave hold for MultiBreakVolumeCallBack to clear */
1229 /* didn't find any callbacks, so return right away. */
1233 henumParms.ncbas = 0;
1234 henumParms.fid = &fid;
1235 henumParms.thead = tthead;
1237 h_Enumerate(MultiBreakVolumeCallBack, (char *)&henumParms);
1239 if (henumParms.ncbas) { /* do left-overs */
1240 struct AFSCBFids tf;
1241 tf.AFSCBFids_len = 1;
1242 tf.AFSCBFids_val = &fid;
1244 MultiBreakCallBack_r(henumParms.cba, henumParms.ncbas, &tf, 0);
1246 henumParms.ncbas = 0;
1252 #ifdef AFS_PTHREAD_ENV
1253 extern pthread_cond_t fsync_cond;
1255 extern char fsync_wait[];
1259 BreakVolumeCallBacksLater(afs_uint32 volume)
1263 struct FileEntry *fe;
1264 struct CallBack *cb;
1268 ViceLog(25, ("Setting later on volume %u\n", volume));
1270 for (hash = 0; hash < FEHASH_SIZE; hash++) {
1271 for (feip = &HashTable[hash]; (fe = itofe(*feip)) != NULL; ) {
1272 if (fe->volid == volume) {
1273 register struct CallBack *cbnext;
1274 for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
1275 host = h_itoh(cb->hhead);
1276 host->hostFlags |= HFE_LATER;
1277 cb->status = CB_DELAYED;
1278 cbnext = itocb(cb->cnext);
1281 fe->status |= FE_LATER;
1290 /* didn't find any callbacks, so return right away. */
1294 ViceLog(25, ("Fsync thread wakeup\n"));
1295 #ifdef AFS_PTHREAD_ENV
1297 assert(pthread_cond_broadcast(&fsync_cond) == 0);
1300 LWP_NoYieldSignal(fsync_wait);
1306 BreakLaterCallBacks(void)
1311 struct CallBack *cb;
1312 struct FileEntry *fe = NULL;
1313 struct FileEntry *myfe = NULL;
1315 struct VCBParams henumParms;
1316 unsigned short tthead = 0; /* zero is illegal value */
1320 ViceLog(25, ("Looking for FileEntries to unchain\n"));
1323 /* Pick the first volume we see to clean up */
1324 fid.Volume = fid.Vnode = fid.Unique = 0;
1326 for (hash = 0; hash < FEHASH_SIZE; hash++) {
1327 for (feip = &HashTable[hash]; (fe = itofe(*feip)) != NULL; ) {
1328 if (fe && (fe->status & FE_LATER)
1329 && (fid.Volume == 0 || fid.Volume == fe->volid)) {
1330 /* Ugly, but used to avoid left side casting */
1331 struct object *tmpfe;
1333 ("Unchaining for %u:%u:%u\n", fe->vnode, fe->unique,
1335 fid.Volume = fe->volid;
1337 /* Works since volid is deeper than the largest pointer */
1338 tmpfe = (struct object *)fe;
1339 tmpfe->next = (struct object *)myfe;
1352 /* loop over FEs from myfe and free/break */
1354 for (fe = myfe; fe;) {
1355 register struct CallBack *cbnext;
1356 for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
1357 cbnext = itocb(cb->cnext);
1358 host = h_itoh(cb->hhead);
1359 if (cb->status == CB_DELAYED) {
1361 if (!tthead || (TNorm(tthead) < TNorm(cb->thead))) {
1366 CDel(cb, 0); /* Don't let CDel clean up the fe */
1367 /* leave hold for MultiBreakVolumeCallBack to clear */
1370 ("Found host %s:%d non-DELAYED cb for %u:%u:%u\n",
1371 afs_inet_ntoa_r(host->host, hoststr),
1372 ntohs(host->port), fe->vnode, fe->unique, fe->volid));
1376 fe = (struct FileEntry *)((struct object *)fe)->next;
1381 ViceLog(125, ("Breaking volume %u\n", fid.Volume));
1382 henumParms.ncbas = 0;
1383 henumParms.fid = &fid;
1384 henumParms.thead = tthead;
1386 h_Enumerate(MultiBreakVolumeLaterCallBack, (char *)&henumParms);
1388 if (henumParms.ncbas) { /* do left-overs */
1389 struct AFSCBFids tf;
1390 tf.AFSCBFids_len = 1;
1391 tf.AFSCBFids_val = &fid;
1393 MultiBreakCallBack_r(henumParms.cba, henumParms.ncbas, &tf, 0);
1394 henumParms.ncbas = 0;
1399 /* Arrange to be called again */
1404 * Delete all timed-out call back entries (to be called periodically by file
1408 CleanupTimedOutCallBacks(void)
1411 CleanupTimedOutCallBacks_r();
1417 CleanupTimedOutCallBacks_r(void)
1419 afs_uint32 now = CBtime(FT_ApproxTime());
1420 register afs_uint32 *thead;
1421 register struct CallBack *cb;
1422 register int ntimedout = 0;
1425 while (tfirst <= now) {
1427 cbi = *(thead = THead(tfirst));
1433 ("CCB: deleting timed out call back %s:%d, (%u,%u,%u)\n",
1434 afs_inet_ntoa_r(h_itoh(cb->hhead)->host, hoststr),
1435 h_itoh(cb->hhead)->port, itofe(cb->fhead)->volid,
1436 itofe(cb->fhead)->vnode, itofe(cb->fhead)->unique));
1440 if (ntimedout > cbstuff.nblks) {
1441 ViceLog(0, ("CCB: Internal Error -- shutting down...\n"));
1442 DumpCallBackState();
1443 ShutDownAndCore(PANIC);
1445 } while (cbi != *thead);
1450 cbstuff.CBsTimedOut += ntimedout;
1451 ViceLog(7, ("CCB: deleted %d timed out callbacks\n", ntimedout));
1452 return (ntimedout > 0);
1455 static struct host *lih_host;
1456 static int lih_host_held;
1458 /* This version does not allow 'host' to be selected unless its ActiveCall
1459 * is newer than 'hostp' which is the host with the oldest ActiveCall from
1460 * the last pass (if it is provided). We filter out any hosts that are
1461 * are held by other threads.
1464 lih0_r(register struct host *host, register int held,
1465 register struct host *hostp)
1468 && (hostp && host != hostp)
1469 && (!held && !h_OtherHolds_r(host))
1470 && (!lih_host || host->ActiveCall < lih_host->ActiveCall)
1471 && (!hostp || host->ActiveCall > hostp->ActiveCall)) {
1472 if (lih_host != NULL && lih_host_held) {
1473 h_Release_r(lih_host);
1476 lih_host_held = !held;
1482 /* This version does not allow 'host' to be selected unless its ActiveCall
1483 * is newer than 'hostp' which is the host with the oldest ActiveCall from
1484 * the last pass (if it is provided). In this second varient, we do not
1485 * prevent held hosts from being selected.
1488 lih1_r(register struct host *host, register int held,
1489 register struct host *hostp)
1492 && (hostp && host != hostp)
1493 && (!lih_host || host->ActiveCall < lih_host->ActiveCall)
1494 && (!hostp || host->ActiveCall > hostp->ActiveCall)) {
1495 if (lih_host != NULL && lih_host_held) {
1496 h_Release_r(lih_host);
1499 lih_host_held = !held;
1505 /* This could be upgraded to get more space each time */
1506 /* first pass: sequentially find the oldest host which isn't held by
1507 anyone for which we can clear callbacks;
1509 /* second pass: sequentially find the oldest host regardless of
1510 whether or not the host is held; skipping 'hostp' */
1511 /* third pass: attempt to clear callbacks from 'hostp' */
1512 /* always called with hostp unlocked */
1514 /* Note: hostlist is ordered most recently created host first and
1515 * its order has no relationship to the most recently used. */
1516 extern struct host *hostList;
1518 GetSomeSpace_r(struct host *hostp, int locked)
1520 register struct host *hp, *hp1, *hp2;
1523 cbstuff.GotSomeSpaces++;
1525 ("GSS: First looking for timed out call backs via CleanupCallBacks\n"));
1526 if (CleanupTimedOutCallBacks_r()) {
1536 h_Enumerate_r(i == 0 ? lih0_r : lih1_r, hp2, (char *)hp1);
1539 /* set in lih_r! private copy before giving up H_LOCK */
1540 int lih_host_held2=lih_host_held;
1542 if ((hp != hostp) && !ClearHostCallbacks_r(hp, 0 /* not locked or held */ )) {
1553 * Next time try getting callbacks from any host even if
1554 * it's deleted (that's actually great since we can freely
1555 * remove its callbacks) or it's held since the only other
1556 * option is starvation for the file server (i.e. until the
1557 * callback timeout arrives).
1564 ("GSS: Try harder for longest inactive host cnt= %d\n",
1569 /* Could not obtain space from other hosts, clear hostp's callback state */
1574 ClearHostCallbacks_r(hostp, 1 /*already locked */ );
1581 /* locked - set if caller has already locked the host */
1583 ClearHostCallbacks_r(struct host *hp, int locked)
1588 struct rx_connection *cb_conn = NULL;
1591 ("GSS: Delete longest inactive host %s\n",
1592 afs_inet_ntoa_r(hp->host, hoststr)));
1593 if (!(held = h_Held_r(hp)))
1596 /** Try a non-blocking lock. If the lock is already held return
1597 * after releasing hold on hp
1600 if (h_NBLock_r(hp)) {
1606 if (hp->Console & 2) {
1608 * If the special console field is set it means that a thread
1609 * is waiting in AddCallBack1 after it set pointers to the
1610 * file entry and/or callback entry. Because of the bogus
1611 * usage of h_hold it won't prevent from another thread, this
1612 * one, to remove all the callbacks so just to be safe we keep
1613 * a reference. NOTE, on the last phase we'll free the calling
1614 * host's callbacks but that's ok...
1618 DeleteAllCallBacks_r(hp, 1);
1619 if (hp->hostFlags & VENUSDOWN) {
1620 hp->hostFlags &= ~RESETDONE; /* remember that we must do a reset */
1622 /* host is up, try a call */
1623 hp->hostFlags &= ~ALTADDR; /* alternate addresses are invalid */
1624 cb_conn = hp->callback_rxcon;
1625 rx_GetConnection(hp->callback_rxcon);
1626 if (hp->interface) {
1629 RXAFSCB_InitCallBackState3(cb_conn, &FS_HostUUID);
1632 code = RXAFSCB_InitCallBackState(cb_conn);
1634 rx_PutConnection(cb_conn);
1637 hp->hostFlags |= ALTADDR; /* alternate addresses are valid */
1639 /* failed, mark host down and need reset */
1640 hp->hostFlags |= VENUSDOWN;
1641 hp->hostFlags &= ~RESETDONE;
1643 /* reset succeeded, we're done */
1644 hp->hostFlags |= RESETDONE;
1655 #endif /* INTERPRET_DUMP */
1659 PrintCallBackStats(void)
1662 "%d add CB, %d break CB, %d del CB, %d del FE, %d CB's timed out, %d space reclaim, %d del host\n",
1663 cbstuff.AddCallBacks, cbstuff.BreakCallBacks,
1664 cbstuff.DeleteCallBacks, cbstuff.DeleteFiles, cbstuff.CBsTimedOut,
1665 cbstuff.GotSomeSpaces, cbstuff.DeleteAllCallBacks);
1666 fprintf(stderr, "%d CBs, %d FEs, (%d of total of %d 16-byte blocks)\n",
1667 cbstuff.nCBs, cbstuff.nFEs, cbstuff.nCBs + cbstuff.nFEs,
1673 #define MAGIC 0x12345678 /* To check byte ordering of dump when it is read in */
1675 #ifndef INTERPRET_DUMP
1677 #ifdef AFS_DEMAND_ATTACH_FS
1680 * callback state serialization
1682 static int cb_stateSaveTimeouts(struct fs_dump_state * state);
1683 static int cb_stateSaveFEHash(struct fs_dump_state * state);
1684 static int cb_stateSaveFEs(struct fs_dump_state * state);
1685 static int cb_stateSaveFE(struct fs_dump_state * state, struct FileEntry * fe);
1686 static int cb_stateRestoreTimeouts(struct fs_dump_state * state);
1687 static int cb_stateRestoreFEHash(struct fs_dump_state * state);
1688 static int cb_stateRestoreFEs(struct fs_dump_state * state);
1689 static int cb_stateRestoreFE(struct fs_dump_state * state);
1690 static int cb_stateRestoreCBs(struct fs_dump_state * state, struct FileEntry * fe,
1691 struct iovec * iov, int niovecs);
1693 static int cb_stateVerifyFEHash(struct fs_dump_state * state);
1694 static int cb_stateVerifyFE(struct fs_dump_state * state, struct FileEntry * fe);
1695 static int cb_stateVerifyFCBList(struct fs_dump_state * state, struct FileEntry * fe);
1696 static int cb_stateVerifyTimeoutQueues(struct fs_dump_state * state);
1698 static int cb_stateFEToDiskEntry(struct FileEntry *, struct FEDiskEntry *);
1699 static int cb_stateDiskEntryToFE(struct fs_dump_state * state,
1700 struct FEDiskEntry *, struct FileEntry *);
1702 static int cb_stateCBToDiskEntry(struct CallBack *, struct CBDiskEntry *);
1703 static int cb_stateDiskEntryToCB(struct fs_dump_state * state,
1704 struct CBDiskEntry *, struct CallBack *);
1706 static int cb_stateFillHeader(struct callback_state_header * hdr);
1707 static int cb_stateCheckHeader(struct callback_state_header * hdr);
1709 static int cb_stateAllocMap(struct fs_dump_state * state);
1712 cb_stateSave(struct fs_dump_state * state)
1716 AssignInt64(state->eof_offset, &state->hdr->cb_offset);
1718 /* invalidate callback state header */
1719 memset(state->cb_hdr, 0, sizeof(struct callback_state_header));
1720 if (fs_stateWriteHeader(state, &state->hdr->cb_offset, state->cb_hdr,
1721 sizeof(struct callback_state_header))) {
1726 fs_stateIncEOF(state, sizeof(struct callback_state_header));
1728 /* dump timeout state */
1729 if (cb_stateSaveTimeouts(state)) {
1734 /* dump fe hashtable state */
1735 if (cb_stateSaveFEHash(state)) {
1740 /* dump callback state */
1741 if (cb_stateSaveFEs(state)) {
1746 /* write the callback state header to disk */
1747 cb_stateFillHeader(state->cb_hdr);
1748 if (fs_stateWriteHeader(state, &state->hdr->cb_offset, state->cb_hdr,
1749 sizeof(struct callback_state_header))) {
1759 cb_stateRestore(struct fs_dump_state * state)
1763 if (fs_stateReadHeader(state, &state->hdr->cb_offset, state->cb_hdr,
1764 sizeof(struct callback_state_header))) {
1769 if (cb_stateCheckHeader(state->cb_hdr)) {
1774 if (cb_stateAllocMap(state)) {
1779 if (cb_stateRestoreTimeouts(state)) {
1784 if (cb_stateRestoreFEHash(state)) {
1789 /* restore FEs and CBs from disk */
1790 if (cb_stateRestoreFEs(state)) {
1795 /* restore the timeout queue heads */
1796 tfirst = state->cb_hdr->tfirst;
1803 cb_stateRestoreIndices(struct fs_dump_state * state)
1806 struct FileEntry * fe;
1807 struct CallBack * cb;
1809 /* restore indices in the FileEntry structures */
1810 for (i = 1; i < state->fe_map.len; i++) {
1811 if (state->fe_map.entries[i].new_idx) {
1812 fe = itofe(state->fe_map.entries[i].new_idx);
1814 /* restore the fe->fnext entry */
1815 if (fe_OldToNew(state, fe->fnext, &fe->fnext)) {
1820 /* restore the fe->firstcb entry */
1821 if (cb_OldToNew(state, fe->firstcb, &fe->firstcb)) {
1828 /* restore indices in the CallBack structures */
1829 for (i = 1; i < state->cb_map.len; i++) {
1830 if (state->cb_map.entries[i].new_idx) {
1831 cb = itocb(state->cb_map.entries[i].new_idx);
1833 /* restore the cb->cnext entry */
1834 if (cb_OldToNew(state, cb->cnext, &cb->cnext)) {
1839 /* restore the cb->fhead entry */
1840 if (fe_OldToNew(state, cb->fhead, &cb->fhead)) {
1845 /* restore the cb->hhead entry */
1846 if (h_OldToNew(state, cb->hhead, &cb->hhead)) {
1851 /* restore the cb->tprev entry */
1852 if (cb_OldToNew(state, cb->tprev, &cb->tprev)) {
1857 /* restore the cb->tnext entry */
1858 if (cb_OldToNew(state, cb->tnext, &cb->tnext)) {
1863 /* restore the cb->hprev entry */
1864 if (cb_OldToNew(state, cb->hprev, &cb->hprev)) {
1869 /* restore the cb->hnext entry */
1870 if (cb_OldToNew(state, cb->hnext, &cb->hnext)) {
1877 /* restore the timeout queue head indices */
1878 for (i = 0; i < state->cb_timeout_hdr->records; i++) {
1879 if (cb_OldToNew(state, timeout[i], &timeout[i])) {
1885 /* restore the FE hash table queue heads */
1886 for (i = 0; i < state->cb_fehash_hdr->records; i++) {
1887 if (fe_OldToNew(state, HashTable[i], &HashTable[i])) {
1898 cb_stateVerify(struct fs_dump_state * state)
1902 if (cb_stateVerifyFEHash(state)) {
1906 if (cb_stateVerifyTimeoutQueues(state)) {
1915 cb_stateVerifyFEHash(struct fs_dump_state * state)
1918 struct FileEntry * fe;
1919 afs_uint32 fei, chain_len;
1921 for (i = 0; i < FEHASH_SIZE; i++) {
1923 for (fei = HashTable[i], fe = itofe(fei);
1925 fei = fe->fnext, fe = itofe(fei)) {
1926 if (fei > cbstuff.nblks) {
1927 ViceLog(0, ("cb_stateVerifyFEHash: error: index out of range (fei=%d)\n", fei));
1931 if (cb_stateVerifyFE(state, fe)) {
1934 if (chain_len > FS_STATE_FE_MAX_HASH_CHAIN_LEN) {
1935 ViceLog(0, ("cb_stateVerifyFEHash: error: hash chain %d length exceeds %d; assuming there's a loop\n",
1936 i, FS_STATE_FE_MAX_HASH_CHAIN_LEN));
1949 cb_stateVerifyFE(struct fs_dump_state * state, struct FileEntry * fe)
1953 if ((fe->firstcb && !fe->ncbs) ||
1954 (!fe->firstcb && fe->ncbs)) {
1955 ViceLog(0, ("cb_stateVerifyFE: error: fe->firstcb does not agree with fe->ncbs (fei=%d, fe->firstcb=%d, fe->ncbs=%d)\n",
1956 fetoi(fe), fe->firstcb, fe->ncbs));
1959 if (cb_stateVerifyFCBList(state, fe)) {
1960 ViceLog(0, ("cb_stateVerifyFE: error: FCBList failed verification (fei=%d)\n", fetoi(fe)));
1969 cb_stateVerifyFCBList(struct fs_dump_state * state, struct FileEntry * fe)
1972 afs_uint32 cbi, fei, chain_len = 0;
1973 struct CallBack * cb;
1977 for (cbi = fe->firstcb, cb = itocb(cbi);
1979 cbi = cb->cnext, cb = itocb(cbi)) {
1980 if (cbi > cbstuff.nblks) {
1981 ViceLog(0, ("cb_stateVerifyFCBList: error: list index out of range (cbi=%d, ncbs=%d)\n",
1982 cbi, cbstuff.nblks));
1986 if (cb->fhead != fei) {
1987 ViceLog(0, ("cb_stateVerifyFCBList: error: cb->fhead != fei (fei=%d, cb->fhead=%d)\n",
1991 if (chain_len > FS_STATE_FCB_MAX_LIST_LEN) {
1992 ViceLog(0, ("cb_stateVerifyFCBList: error: list length exceeds %d (fei=%d); assuming there's a loop\n",
1993 FS_STATE_FCB_MAX_LIST_LEN, fei));
2000 if (fe->ncbs != chain_len) {
2001 ViceLog(0, ("cb_stateVerifyFCBList: error: list length mismatch (len=%d, fe->ncbs=%d)\n",
2002 chain_len, fe->ncbs));
2011 cb_stateVerifyHCBList(struct fs_dump_state * state, struct host * host)
2014 afs_uint32 hi, chain_len, cbi;
2015 struct CallBack *cb, *ncb;
2020 for (cbi = host->cblist, cb = itocb(cbi);
2022 cbi = cb->hnext, cb = ncb) {
2023 if (chain_len && (host->cblist == cbi)) {
2024 /* we've wrapped around the circular list, and everything looks ok */
2027 if (cb->hhead != hi) {
2028 ViceLog(0, ("cb_stateVerifyHCBList: error: incorrect cb->hhead (cbi=%d, h->index=%d, cb->hhead=%d)\n",
2029 cbi, hi, cb->hhead));
2032 if (!cb->hprev || !cb->hnext) {
2033 ViceLog(0, ("cb_stateVerifyHCBList: error: null index in circular list (cbi=%d, h->index=%d)\n",
2038 if ((cb->hprev > cbstuff.nblks) ||
2039 (cb->hnext > cbstuff.nblks)) {
2040 ViceLog(0, ("cb_stateVerifyHCBList: error: list index out of range (cbi=%d, h->index=%d, cb->hprev=%d, cb->hnext=%d, nCBs=%d)\n",
2041 cbi, hi, cb->hprev, cb->hnext, cbstuff.nblks));
2045 ncb = itocb(cb->hnext);
2046 if (cbi != ncb->hprev) {
2047 ViceLog(0, ("cb_stateVerifyHCBList: error: corrupt linked list (cbi=%d, h->index=%d)\n",
2052 if (chain_len > FS_STATE_HCB_MAX_LIST_LEN) {
2053 ViceLog(0, ("cb_stateVerifyFCBList: error: list length exceeds %d (h->index=%d); assuming there's a loop\n",
2054 FS_STATE_HCB_MAX_LIST_LEN, hi));
2066 cb_stateVerifyTimeoutQueues(struct fs_dump_state * state)
2069 afs_uint32 cbi, chain_len;
2070 struct CallBack *cb, *ncb;
2072 for (i = 0; i < CB_NUM_TIMEOUT_QUEUES; i++) {
2074 for (cbi = timeout[i], cb = itocb(cbi);
2076 cbi = cb->tnext, cb = ncb) {
2077 if (chain_len && (cbi == timeout[i])) {
2078 /* we've wrapped around the circular list, and everything looks ok */
2081 if (cbi > cbstuff.nblks) {
2082 ViceLog(0, ("cb_stateVerifyTimeoutQueues: error: list index out of range (cbi=%d, tindex=%d)\n",
2087 if (itot(cb->thead) != &timeout[i]) {
2088 ViceLog(0, ("cb_stateVerifyTimeoutQueues: error: cb->thead points to wrong timeout queue (tindex=%d, cbi=%d, cb->thead=%d)\n",
2089 i, cbi, cb->thead));
2092 if (!cb->tprev || !cb->tnext) {
2093 ViceLog(0, ("cb_stateVerifyTimeoutQueues: null index in circular list (cbi=%d, tindex=%d)\n",
2098 if ((cb->tprev > cbstuff.nblks) ||
2099 (cb->tnext > cbstuff.nblks)) {
2100 ViceLog(0, ("cb_stateVerifyTimeoutQueues: list index out of range (cbi=%d, tindex=%d, cb->tprev=%d, cb->tnext=%d, nCBs=%d)\n",
2101 cbi, i, cb->tprev, cb->tnext, cbstuff.nblks));
2105 ncb = itocb(cb->tnext);
2106 if (cbi != ncb->tprev) {
2107 ViceLog(0, ("cb_stateVerifyTimeoutQueues: corrupt linked list (cbi=%d, tindex=%d)\n",
2112 if (chain_len > FS_STATE_TCB_MAX_LIST_LEN) {
2113 ViceLog(0, ("cb_stateVerifyTimeoutQueues: list length exceeds %d (tindex=%d); assuming there's a loop\n",
2114 FS_STATE_TCB_MAX_LIST_LEN, i));
2127 cb_stateSaveTimeouts(struct fs_dump_state * state)
2130 struct iovec iov[2];
2132 AssignInt64(state->eof_offset, &state->cb_hdr->timeout_offset);
2134 memset(state->cb_timeout_hdr, 0, sizeof(struct callback_state_fehash_header));
2135 state->cb_timeout_hdr->magic = CALLBACK_STATE_TIMEOUT_MAGIC;
2136 state->cb_timeout_hdr->records = CB_NUM_TIMEOUT_QUEUES;
2137 state->cb_timeout_hdr->len = sizeof(struct callback_state_timeout_header) +
2138 (state->cb_timeout_hdr->records * sizeof(afs_uint32));
2140 iov[0].iov_base = (char *)state->cb_timeout_hdr;
2141 iov[0].iov_len = sizeof(struct callback_state_timeout_header);
2142 iov[1].iov_base = (char *)timeout;
2143 iov[1].iov_len = sizeof(timeout);
2145 if (fs_stateSeek(state, &state->cb_hdr->timeout_offset)) {
2150 if (fs_stateWriteV(state, iov, 2)) {
2155 fs_stateIncEOF(state, state->cb_timeout_hdr->len);
2162 cb_stateRestoreTimeouts(struct fs_dump_state * state)
2166 if (fs_stateReadHeader(state, &state->cb_hdr->timeout_offset,
2167 state->cb_timeout_hdr,
2168 sizeof(struct callback_state_timeout_header))) {
2173 if (state->cb_timeout_hdr->magic != CALLBACK_STATE_TIMEOUT_MAGIC) {
2177 if (state->cb_timeout_hdr->records != CB_NUM_TIMEOUT_QUEUES) {
2182 len = state->cb_timeout_hdr->records * sizeof(afs_uint32);
2184 if (state->cb_timeout_hdr->len !=
2185 (sizeof(struct callback_state_timeout_header) + len)) {
2190 if (fs_stateRead(state, timeout, len)) {
2200 cb_stateSaveFEHash(struct fs_dump_state * state)
2203 struct iovec iov[2];
2205 AssignInt64(state->eof_offset, &state->cb_hdr->fehash_offset);
2207 memset(state->cb_fehash_hdr, 0, sizeof(struct callback_state_fehash_header));
2208 state->cb_fehash_hdr->magic = CALLBACK_STATE_FEHASH_MAGIC;
2209 state->cb_fehash_hdr->records = FEHASH_SIZE;
2210 state->cb_fehash_hdr->len = sizeof(struct callback_state_fehash_header) +
2211 (state->cb_fehash_hdr->records * sizeof(afs_uint32));
2213 iov[0].iov_base = (char *)state->cb_fehash_hdr;
2214 iov[0].iov_len = sizeof(struct callback_state_fehash_header);
2215 iov[1].iov_base = (char *)HashTable;
2216 iov[1].iov_len = sizeof(HashTable);
2218 if (fs_stateSeek(state, &state->cb_hdr->fehash_offset)) {
2223 if (fs_stateWriteV(state, iov, 2)) {
2228 fs_stateIncEOF(state, state->cb_fehash_hdr->len);
2235 cb_stateRestoreFEHash(struct fs_dump_state * state)
2239 if (fs_stateReadHeader(state, &state->cb_hdr->fehash_offset,
2240 state->cb_fehash_hdr,
2241 sizeof(struct callback_state_fehash_header))) {
2246 if (state->cb_fehash_hdr->magic != CALLBACK_STATE_FEHASH_MAGIC) {
2250 if (state->cb_fehash_hdr->records != FEHASH_SIZE) {
2255 len = state->cb_fehash_hdr->records * sizeof(afs_uint32);
2257 if (state->cb_fehash_hdr->len !=
2258 (sizeof(struct callback_state_fehash_header) + len)) {
2263 if (fs_stateRead(state, HashTable, len)) {
2273 cb_stateSaveFEs(struct fs_dump_state * state)
2276 register int fei, hash;
2277 register struct FileEntry *fe;
2279 AssignInt64(state->eof_offset, &state->cb_hdr->fe_offset);
2281 for (hash = 0; hash < FEHASH_SIZE ; hash++) {
2282 for (fei = HashTable[hash]; fei; fei = fe->fnext) {
2284 if (cb_stateSaveFE(state, fe)) {
2296 cb_stateRestoreFEs(struct fs_dump_state * state)
2298 int count, nFEs, ret = 0;
2300 nFEs = state->cb_hdr->nFEs;
2302 for (count = 0; count < nFEs; count++) {
2303 if (cb_stateRestoreFE(state)) {
2314 cb_stateSaveFE(struct fs_dump_state * state, struct FileEntry * fe)
2316 int ret = 0, iovcnt, cbi, idx, len, written = 0;
2318 struct callback_state_entry_header hdr;
2319 struct FEDiskEntry fedsk;
2320 struct CBDiskEntry cbdsk[16];
2321 struct iovec iov[16];
2322 struct CallBack *cb;
2325 if (fei > state->cb_hdr->fe_max) {
2326 state->cb_hdr->fe_max = fei;
2329 memset(&hdr, 0, sizeof(struct callback_state_entry_header));
2331 if (cb_stateFEToDiskEntry(fe, &fedsk)) {
2336 iov[0].iov_base = (char *)&hdr;
2337 len = iov[0].iov_len = sizeof(hdr);
2338 iov[1].iov_base = (char *)&fedsk;
2339 len += iov[1].iov_len = sizeof(struct FEDiskEntry);
2342 for (cbi = fe->firstcb, cb = itocb(cbi), idx = 2;
2344 cbi = cb->cnext, cb = itocb(cbi), idx++, hdr.nCBs++) {
2345 if (cbi > state->cb_hdr->cb_max) {
2346 state->cb_hdr->cb_max = cbi;
2348 if (cb_stateCBToDiskEntry(cb, &cbdsk[idx])) {
2352 cbdsk[idx].index = cbi;
2353 iov[idx].iov_base = (char *)&cbdsk[idx];
2354 len += iov[idx].iov_len = sizeof(struct CBDiskEntry);
2356 if ((iovcnt == 16) || (!cb->cnext)) {
2357 if (fs_stateWriteV(state, iov, iovcnt)) {
2367 hdr.magic = CALLBACK_STATE_ENTRY_MAGIC;
2368 hdr.len = sizeof(hdr) + sizeof(struct FEDiskEntry) +
2369 (hdr.nCBs * sizeof(struct CBDiskEntry));
2372 if (fs_stateWriteV(state, iov, iovcnt)) {
2377 if (fs_stateWriteHeader(state, &state->eof_offset, &hdr, sizeof(hdr))) {
2383 fs_stateIncEOF(state, hdr.len);
2386 if (fs_stateSeek(state, &state->eof_offset)) {
2392 state->cb_hdr->nFEs++;
2393 state->cb_hdr->nCBs += hdr.nCBs;
2400 cb_stateRestoreFE(struct fs_dump_state * state)
2402 int ret = 0, iovcnt, len, nCBs, idx;
2403 struct callback_state_entry_header hdr;
2404 struct FEDiskEntry fedsk;
2405 struct CBDiskEntry cbdsk[16];
2406 struct iovec iov[16];
2407 struct FileEntry * fe;
2408 struct CallBack * cb;
2410 iov[0].iov_base = (char *)&hdr;
2411 len = iov[0].iov_len = sizeof(hdr);
2412 iov[1].iov_base = (char *)&fedsk;
2413 len += iov[1].iov_len = sizeof(fedsk);
2416 if (fs_stateReadV(state, iov, iovcnt)) {
2421 if (hdr.magic != CALLBACK_STATE_ENTRY_MAGIC) {
2428 ViceLog(0, ("cb_stateRestoreFE: ran out of free FileEntry structures\n"));
2433 if (cb_stateDiskEntryToFE(state, &fedsk, fe)) {
2439 for (iovcnt = 0, idx = 0, len = 0, nCBs = 0;
2442 iov[idx].iov_base = (char *)&cbdsk[idx];
2443 len += iov[idx].iov_len = sizeof(struct CBDiskEntry);
2445 if ((iovcnt == 16) || (nCBs == hdr.nCBs - 1)) {
2446 if (fs_stateReadV(state, iov, iovcnt)) {
2450 if (cb_stateRestoreCBs(state, fe, iov, iovcnt)) {
2465 cb_stateRestoreCBs(struct fs_dump_state * state, struct FileEntry * fe,
2466 struct iovec * iov, int niovecs)
2469 register struct CallBack * cb;
2470 struct CBDiskEntry * cbdsk;
2475 for (idx = 0; idx < niovecs; idx++) {
2476 cbdsk = (struct CBDiskEntry *) iov[idx].iov_base;
2477 if ((cb = GetCB()) == NULL) {
2478 ViceLog(0, ("cb_stateRestoreCBs: ran out of free CallBack structures\n"));
2482 if (cb_stateDiskEntryToCB(state, cbdsk, cb)) {
2483 ViceLog(0, ("cb_stateRestoreCBs: corrupt CallBack disk entry\n"));
2495 cb_stateFillHeader(struct callback_state_header * hdr)
2497 hdr->stamp.magic = CALLBACK_STATE_MAGIC;
2498 hdr->stamp.version = CALLBACK_STATE_VERSION;
2499 hdr->tfirst = tfirst;
2504 cb_stateCheckHeader(struct callback_state_header * hdr)
2508 if (hdr->stamp.magic != CALLBACK_STATE_MAGIC) {
2510 } else if (hdr->stamp.version != CALLBACK_STATE_VERSION) {
2512 } else if ((hdr->nFEs > cbstuff.nblks) || (hdr->nCBs > cbstuff.nblks)) {
2513 ViceLog(0, ("cb_stateCheckHeader: saved callback state larger than callback memory allocation\n"));
2519 /* disk entry conversion routines */
2521 cb_stateFEToDiskEntry(struct FileEntry * in, struct FEDiskEntry * out)
2523 memcpy(&out->fe, in, sizeof(struct FileEntry));
2524 out->index = fetoi(in);
2529 cb_stateDiskEntryToFE(struct fs_dump_state * state,
2530 struct FEDiskEntry * in, struct FileEntry * out)
2534 memcpy(out, &in->fe, sizeof(struct FileEntry));
2536 /* setup FE map entry */
2537 if (!in->index || (in->index >= state->fe_map.len)) {
2538 ViceLog(0, ("cb_stateDiskEntryToFE: index (%d) out of range",
2543 state->fe_map.entries[in->index].old_idx = in->index;
2544 state->fe_map.entries[in->index].new_idx = fetoi(out);
2551 cb_stateCBToDiskEntry(struct CallBack * in, struct CBDiskEntry * out)
2553 memcpy(&out->cb, in, sizeof(struct CallBack));
2554 out->index = cbtoi(in);
2559 cb_stateDiskEntryToCB(struct fs_dump_state * state,
2560 struct CBDiskEntry * in, struct CallBack * out)
2564 memcpy(out, &in->cb, sizeof(struct CallBack));
2566 /* setup CB map entry */
2567 if (!in->index || (in->index >= state->cb_map.len)) {
2568 ViceLog(0, ("cb_stateDiskEntryToCB: index (%d) out of range\n",
2573 state->cb_map.entries[in->index].old_idx = in->index;
2574 state->cb_map.entries[in->index].new_idx = cbtoi(out);
2580 /* index map routines */
2582 cb_stateAllocMap(struct fs_dump_state * state)
2584 state->fe_map.len = state->cb_hdr->fe_max + 1;
2585 state->cb_map.len = state->cb_hdr->cb_max + 1;
2586 state->fe_map.entries = (struct idx_map_entry_t *)
2587 calloc(state->fe_map.len, sizeof(struct idx_map_entry_t));
2588 state->cb_map.entries = (struct idx_map_entry_t *)
2589 calloc(state->cb_map.len, sizeof(struct idx_map_entry_t));
2590 return ((state->fe_map.entries != NULL) && (state->cb_map.entries != NULL)) ? 0 : 1;
2594 fe_OldToNew(struct fs_dump_state * state, afs_uint32 old, afs_uint32 * new)
2598 /* FEs use a one-based indexing system, so old==0 implies no mapping */
2604 if (old >= state->fe_map.len) {
2605 ViceLog(0, ("fe_OldToNew: index %d is out of range\n", old));
2607 } else if (state->fe_map.entries[old].old_idx != old) { /* sanity check */
2608 ViceLog(0, ("fe_OldToNew: index %d points to an invalid FileEntry record\n", old));
2611 *new = state->fe_map.entries[old].new_idx;
2619 cb_OldToNew(struct fs_dump_state * state, afs_uint32 old, afs_uint32 * new)
2623 /* CBs use a one-based indexing system, so old==0 implies no mapping */
2629 if (old >= state->cb_map.len) {
2630 ViceLog(0, ("cb_OldToNew: index %d is out of range\n", old));
2632 } else if (state->cb_map.entries[old].old_idx != old) { /* sanity check */
2633 ViceLog(0, ("cb_OldToNew: index %d points to an invalid CallBack record\n", old));
2636 *new = state->cb_map.entries[old].new_idx;
2642 #endif /* AFS_DEMAND_ATTACH_FS */
2645 DumpCallBackState(void)
2648 afs_uint32 magic = MAGIC, now = FT_ApproxTime(), freelisthead;
2650 fd = open(AFSDIR_SERVER_CBKDUMP_FILEPATH, O_WRONLY | O_CREAT | O_TRUNC,
2654 ("Couldn't create callback dump file %s\n",
2655 AFSDIR_SERVER_CBKDUMP_FILEPATH));
2658 (void)write(fd, &magic, sizeof(magic));
2659 (void)write(fd, &now, sizeof(now));
2660 (void)write(fd, &cbstuff, sizeof(cbstuff));
2661 (void)write(fd, TimeOuts, sizeof(TimeOuts));
2662 (void)write(fd, timeout, sizeof(timeout));
2663 (void)write(fd, &tfirst, sizeof(tfirst));
2664 freelisthead = cbtoi((struct CallBack *)CBfree);
2665 (void)write(fd, &freelisthead, sizeof(freelisthead)); /* This is a pointer */
2666 freelisthead = fetoi((struct FileEntry *)FEfree);
2667 (void)write(fd, &freelisthead, sizeof(freelisthead)); /* This is a pointer */
2668 (void)write(fd, HashTable, sizeof(HashTable));
2669 (void)write(fd, &CB[1], sizeof(CB[1]) * cbstuff.nblks); /* CB stuff */
2670 (void)write(fd, &FE[1], sizeof(FE[1]) * cbstuff.nblks); /* FE stuff */
2676 #endif /* !INTERPRET_DUMP */
2678 #ifdef INTERPRET_DUMP
2680 /* This is only compiled in for the callback analyzer program */
2681 /* Returns the time of the dump */
2683 ReadDump(char *file)
2686 afs_uint32 magic, freelisthead;
2689 fd = open(file, O_RDONLY);
2691 fprintf(stderr, "Couldn't read dump file %s\n", file);
2694 read(fd, &magic, sizeof(magic));
2695 if (magic != MAGIC) {
2697 "Magic number of %s is invalid. You might be trying to\n",
2700 "run this program on a machine type with a different byte ordering.\n");
2703 read(fd, &now, sizeof(now));
2704 read(fd, &cbstuff, sizeof(cbstuff));
2705 read(fd, TimeOuts, sizeof(TimeOuts));
2706 read(fd, timeout, sizeof(timeout));
2707 read(fd, &tfirst, sizeof(tfirst));
2708 read(fd, &freelisthead, sizeof(freelisthead));
2709 CB = ((struct CallBack
2710 *)(calloc(cbstuff.nblks, sizeof(struct FileEntry)))) - 1;
2711 FE = ((struct FileEntry
2712 *)(calloc(cbstuff.nblks, sizeof(struct FileEntry)))) - 1;
2713 CBfree = (struct CallBack *)itocb(freelisthead);
2714 read(fd, &freelisthead, sizeof(freelisthead));
2715 FEfree = (struct FileEntry *)itofe(freelisthead);
2716 read(fd, HashTable, sizeof(HashTable));
2717 read(fd, &CB[1], sizeof(CB[1]) * cbstuff.nblks); /* CB stuff */
2718 read(fd, &FE[1], sizeof(FE[1]) * cbstuff.nblks); /* FE stuff */
2720 perror("Error reading dumpfile");
2727 #include "AFS_component_version_number.h"
2729 #include "AFS_component_version_number.c"
2733 main(int argc, char **argv)
2735 int err = 0, cbi = 0, stats = 0, noptions = 0, all = 0, vol = 0, raw = 0;
2737 register struct FileEntry *fe;
2738 register struct CallBack *cb;
2741 memset(&fid, 0, sizeof(fid));
2744 while (argc && **argv == '-') {
2747 if (!strcmp(*argv, "-host")) {
2753 cbi = atoi(*++argv);
2754 } else if (!strcmp(*argv, "-fid")) {
2760 fid.Volume = atoi(*++argv);
2761 fid.Vnode = atoi(*++argv);
2762 fid.Unique = atoi(*++argv);
2763 } else if (!strcmp(*argv, "-time")) {
2764 fprintf(stderr, "-time not supported\n");
2766 } else if (!strcmp(*argv, "-stats")) {
2768 } else if (!strcmp(*argv, "-all")) {
2770 } else if (!strcmp(*argv, "-raw")) {
2772 } else if (!strcmp(*argv, "-volume")) {
2778 vol = atoi(*++argv);
2783 if (err || argc != 1) {
2785 "Usage: cbd [-host cbid] [-fid volume vnode] [-stats] [-all] callbackdumpfile\n");
2787 "[cbid is shown for each host in the hosts.dump file]\n");
2790 now = ReadDump(*argv);
2791 if (stats || noptions == 0) {
2792 time_t uxtfirst = UXtime(tfirst);
2793 printf("The time of the dump was %u %s", now, ctime(&now));
2794 printf("The last time cleanup ran was %u %s", uxtfirst,
2796 PrintCallBackStats();
2801 struct CallBack *cb;
2802 struct FileEntry *fe;
2804 for (hash = 0; hash < FEHASH_SIZE; hash++) {
2805 for (feip = &HashTable[hash]; fe = itofe(*feip);) {
2806 if (!vol || (fe->volid == vol)) {
2807 register struct CallBack *cbnext;
2808 for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
2810 cbnext = itocb(cb->cnext);
2820 afs_uint32 cfirst = cbi;
2825 } while (cbi != cfirst);
2830 printf("No callback entries for %u.%u\n", fid.Volume, fid.Vnode);
2833 cb = itocb(fe->firstcb);
2836 cb = itocb(cb->cnext);
2841 for (i = 1; i < cbstuff.nblks; i++) {
2842 p = (afs_int32 *) & FE[i];
2843 printf("%d:%12x%12x%12x%12x\n", i, p[0], p[1], p[2], p[3]);
2850 PrintCB(register struct CallBack *cb, afs_uint32 now)
2852 struct FileEntry *fe = itofe(cb->fhead);
2853 time_t expires = TIndexToTime(cb->thead);
2858 printf("vol=%u vn=%u cbs=%d hi=%d st=%d fest=%d, exp in %d secs at %s",
2859 fe->volid, fe->vnode, fe->ncbs, cb->hhead, cb->status, fe->status,
2860 expires - now, ctime(&expires));
2865 #if !defined(INTERPRET_DUMP)
2867 ** try breaking calbacks on afidp from host. Use multi_rx.
2868 ** return 0 on success, non-zero on failure
2871 MultiBreakCallBackAlternateAddress(struct host *host, struct AFSCBFids *afidp)
2875 retVal = MultiBreakCallBackAlternateAddress_r(host, afidp);
2881 MultiBreakCallBackAlternateAddress_r(struct host *host,
2882 struct AFSCBFids *afidp)
2885 struct rx_connection **conns;
2886 struct rx_connection *connSuccess = 0;
2887 struct AddrPort *interfaces;
2888 static struct rx_securityClass *sc = 0;
2889 static struct AFSCBs tc = { 0, 0 };
2892 /* nothing more can be done */
2893 if (!host->interface)
2894 return 1; /* failure */
2896 assert(host->interface->numberOfInterfaces > 0);
2898 /* the only address is the primary interface */
2899 if (host->interface->numberOfInterfaces == 1)
2900 return 1; /* failure */
2902 /* initialise a security object only once */
2904 sc = rxnull_NewClientSecurityObject();
2906 i = host->interface->numberOfInterfaces;
2907 interfaces = calloc(i, sizeof(struct AddrPort));
2908 conns = calloc(i, sizeof(struct rx_connection *));
2909 if (!interfaces || !conns) {
2911 ("Failed malloc in MultiBreakCallBackAlternateAddress_r\n"));
2915 /* initialize alternate rx connections */
2916 for (i = 0, j = 0; i < host->interface->numberOfInterfaces; i++) {
2917 /* this is the current primary address */
2918 if (host->host == host->interface->interface[i].addr &&
2919 host->port == host->interface->interface[i].port)
2922 interfaces[j] = host->interface->interface[i];
2924 rx_NewConnection(interfaces[j].addr,
2925 interfaces[j].port, 1, sc, 0);
2926 rx_SetConnDeadTime(conns[j], 2);
2927 rx_SetConnHardDeadTime(conns[j], AFS_HARDDEADTIME);
2931 assert(j); /* at least one alternate address */
2933 ("Starting multibreakcall back on all addr for host %s\n",
2934 afs_inet_ntoa_r(host->host, hoststr)));
2936 multi_Rx(conns, j) {
2937 multi_RXAFSCB_CallBack(afidp, &tc);
2941 if (host->callback_rxcon)
2942 rx_DestroyConnection(host->callback_rxcon);
2943 host->callback_rxcon = conns[multi_i];
2944 host->host = interfaces[multi_i].addr;
2945 host->port = interfaces[multi_i].port;
2946 connSuccess = conns[multi_i];
2947 rx_SetConnDeadTime(host->callback_rxcon, 50);
2948 rx_SetConnHardDeadTime(host->callback_rxcon, AFS_HARDDEADTIME);
2950 ("multibreakcall success with addr %s\n",
2951 afs_inet_ntoa_r(interfaces[multi_i].addr, hoststr)));
2958 /* Destroy all connections except the one on which we succeeded */
2959 for (i = 0; i < j; i++)
2960 if (conns[i] != connSuccess)
2961 rx_DestroyConnection(conns[i]);
2967 return 0; /* success */
2969 return 1; /* failure */
2974 ** try multi_RX probes to host.
2975 ** return 0 on success, non-0 on failure
2978 MultiProbeAlternateAddress_r(struct host *host)
2981 struct rx_connection **conns;
2982 struct rx_connection *connSuccess = 0;
2983 struct AddrPort *interfaces;
2984 static struct rx_securityClass *sc = 0;
2987 /* nothing more can be done */
2988 if (!host->interface)
2989 return 1; /* failure */
2991 assert(host->interface->numberOfInterfaces > 0);
2993 /* the only address is the primary interface */
2994 if (host->interface->numberOfInterfaces == 1)
2995 return 1; /* failure */
2997 /* initialise a security object only once */
2999 sc = rxnull_NewClientSecurityObject();
3001 i = host->interface->numberOfInterfaces;
3002 interfaces = calloc(i, sizeof(struct AddrPort));
3003 conns = calloc(i, sizeof(struct rx_connection *));
3004 if (!interfaces || !conns) {
3005 ViceLog(0, ("Failed malloc in MultiProbeAlternateAddress_r\n"));
3009 /* initialize alternate rx connections */
3010 for (i = 0, j = 0; i < host->interface->numberOfInterfaces; i++) {
3011 /* this is the current primary address */
3012 if (host->host == host->interface->interface[i].addr &&
3013 host->port == host->interface->interface[i].port)
3016 interfaces[j] = host->interface->interface[i];
3018 rx_NewConnection(interfaces[i].addr,
3019 interfaces[i].port, 1, sc, 0);
3020 rx_SetConnDeadTime(conns[j], 2);
3021 rx_SetConnHardDeadTime(conns[j], AFS_HARDDEADTIME);
3025 assert(j); /* at least one alternate address */
3027 ("Starting multiprobe on all addr for host %s\n",
3028 afs_inet_ntoa_r(host->host, hoststr)));
3030 multi_Rx(conns, j) {
3031 multi_RXAFSCB_ProbeUuid(&host->interface->uuid);
3035 if (host->callback_rxcon)
3036 rx_DestroyConnection(host->callback_rxcon);
3037 host->callback_rxcon = conns[multi_i];
3038 host->host = interfaces[multi_i].addr;
3039 host->port = interfaces[multi_i].port;
3040 connSuccess = conns[multi_i];
3041 rx_SetConnDeadTime(host->callback_rxcon, 50);
3042 rx_SetConnHardDeadTime(host->callback_rxcon, AFS_HARDDEADTIME);
3044 ("multiprobe success with addr %s\n",
3045 afs_inet_ntoa_r(interfaces[multi_i].addr, hoststr)));
3050 ("multiprobe failure with addr %s\n",
3051 afs_inet_ntoa_r(interfaces[multi_i].addr, hoststr)));
3053 /* This is less than desirable but its the best we can do.
3054 * The AFS Cache Manager will return either 0 for a Uuid
3055 * match and a 1 for a non-match. If the error is 1 we
3056 * therefore know that our mapping of IP address to Uuid
3057 * is wrong. We should attempt to find the correct
3058 * Uuid and fix the host tables.
3060 if (multi_error == 1) {
3061 /* remove the current alternate address from this host */
3063 for (i = 0, j = 0; i < host->interface->numberOfInterfaces; i++) {
3064 if (interfaces[multi_i].addr != host->interface->interface[i].addr &&
3065 interfaces[multi_i].port != host->interface->interface[i].port) {
3066 host->interface->interface[j] = host->interface->interface[i];
3070 host->interface->numberOfInterfaces--;
3074 #ifdef AFS_DEMAND_ATTACH_FS
3075 /* try to bail ASAP if the fileserver is shutting down */
3077 if (fs_state.mode == FS_MODE_SHUTDOWN) {
3086 /* Destroy all connections except the one on which we succeeded */
3087 for (i = 0; i < j; i++)
3088 if (conns[i] != connSuccess)
3089 rx_DestroyConnection(conns[i]);
3095 return 0; /* success */
3097 return 1; /* failure */
3100 #endif /* !defined(INTERPRET_DUMP) */