/* Copyright (C) 1998 Transarc Corporation - All rights reserved */ /* * For copyright information, see IPL which you accepted in order to * download this software. * */ /* * NEW callback package callback.c (replaces vicecb.c) * Updated call back routines, NOW with: * * Faster DeleteVenus (Now called DeleteAllCallBacks) * Call back breaking for volumes * Adaptive timeouts on call backs * Architected for Multi RPC * No locks (currently implicit vnode locks--these will go, to) * Delayed call back when rpc connection down. * Bulk break of delayed call backs when rpc connection * reestablished * Strict limit on number of call backs. * * InitCallBack(nblocks) * Initialize: nblocks is max number # of file entries + # of callback entries * nblocks must be < 65536 * Space used is nblocks*16 bytes * Note that space will be reclaimed by breaking callbacks of old hosts * * time = AddCallBack(host, fid) * Add a call back. * Returns the expiration time at the workstation. * * BreakCallBack(host, fid) * Break all call backs for fid, except for the specified host. * Delete all of them. * * BreakVolumeCallBacks(volume) * Break all call backs on volume, using single call to each host * Delete all the call backs. * * DeleteCallBack(host,fid) * Delete (do not break) single call back for fid. * * DeleteFileCallBacks(fid) * Delete (do not break) all call backs for fid. * * DeleteAllCallBacks(host) * Delete (do not break) all call backs for host. * * CleanupTimedOutCallBacks() * Delete all timed out call back entries * Must be called periodically by file server. * * BreakDelayedCallBacks(host) * Break all delayed call backs for host. * Returns 1: one or more failed, 0: success. * * PrintCallBackStats() * Print statistics about call backs to stdout. * * DumpCallBacks() ---wishful thinking--- * Dump call back state to /tmp/callback.state. * This is separately interpretable by the program pcb. * * Notes: In general, if a call back to a host doesn't get through, * then HostDown, supplied elsewhere, is called. BreakDelayedCallBacks, * however, does not call HostDown, but instead returns an indication of * success if all delayed call backs were finally broken. * * BreakDelayedCallBacks MUST be called at the first sign of activity * from the host after HostDown has been called (or a previous * BreakDelayedCallBacks failed). The BreakDelayedCallBacks must be * allowed to complete before any requests from that host are handled. * If BreakDelayedCallBacks fails, then the host should remain * down (and the request should be failed). * CleanupCallBacks MUST be called periodically by the file server for * this package to work correctly. Every 5 minutes is suggested. */ #include #include #include /* for malloc() */ #include /* ANSI standard location for time stuff */ #ifdef AFS_NT40_ENV #include #include #else #include #include #endif #include #include #include /* yuck. This is an abomination. */ #include #include #include #include #include #include #include #include #include "viced.h" #include /* need definition of prlist for host.h */ #include "host.h" extern int hostCount; int ShowProblems = 1; /* Maximum number of call backs to break at once, single fid */ /* There is some debate as to just how large this value should be */ /* Ideally, it would be very very large, but I am afraid that the */ /* cache managers will all send in their responses simultaneously, */ /* thereby swamping the file server. As a result, something like */ /* 10 or 15 might be a better bet. */ #define MAX_CB_HOSTS 10 /* max time to break a callback, otherwise client is dead or net is hosed */ #define MAXCBT 25 #define u_short unsigned short #define u_byte unsigned char struct cbcounters cbstuff; struct cbstruct { struct host * hp; u_short thead; } ; struct FileEntry { afs_uint32 vnode; /* XXX This was u_short XXX */ afs_uint32 unique; afs_uint32 volid; u_short fnext; u_short ncbs; u_short firstcb; u_short spare; #ifdef AFS_ALPHA_ENV u_short spare1; u_short spare2; #endif } *FE; /* Don't use FE[0] */ struct CallBack { u_short cnext; /* Next call back entry */ u_short fhead; /* Head of this call back chain */ u_byte thead; /* Head of timeout chain */ u_byte status; /* Call back status; see definitions, below */ u_short hhead; /* Head of host table chain */ u_short tprev, tnext; /* Timeout chain */ u_short hprev, hnext; /* Chain from host table */ } *CB; /* Don't use CB[0] */ /* status bits for status field of CallBack structure */ #define CB_NORMAL 1 /* Normal call back */ #define CB_DELAYED 2 /* Delayed call back due to rpc problems. The call back entry will be added back to the host list at the END of the list, so that searching backwards in the list will find all the (consecutive)host. delayed call back entries */ #define CB_VOLUME 3 /* Callback for a volume */ #define CB_BULK 4 /* Normal callbacks, handed out from FetchBulkStatus */ /* call back indices to pointers, and vice-versa */ #define itocb(i) ((i)?CB+(i):0) #define cbtoi(cbp) (!(cbp)?0:(cbp)-CB) /* file entry indices to pointers, and vice-versa */ #define itofe(i) ((i)?FE+(i):0) #define fetoi(fep) (!(fep)?0:(fep)-FE) /* Timeouts: there are 128 possible timeout values in effect at any * given time. Each timeout represents timeouts in an interval of 128 * seconds. So the maximum timeout for a call back is 128*128=16384 * seconds, or 4 1/2 hours. The timeout cleanup stuff is called only * if space runs out or by the file server every 5 minutes. This 5 * minute slack should be allowed for--so a maximum time of 4 hours * is safer. * * Timeouts must be chosen to correspond to an exact multiple * of 128, because all times are truncated to a 128 multiple, and * timed out if the current truncated time is <= to the truncated time * corresponding to the timeout queue. */ /* Unix time to Call Back time, and vice-versa. Call back time is in units of 128 seconds, corresponding to time queues. */ #define CBtime(uxtime) ((uxtime)>>7) #define UXtime(cbtime) ((cbtime)<<7) /* Given a Unix time, compute the closest Unix time that corresponds to a time queue, rounding up */ #define TimeCeiling(uxtime) (((uxtime)+127)&~127) /* Time to live for call backs depends upon number of users of the file. * TimeOuts is indexed by this number/8 (using TimeOut macro). Times * in this table are for the workstation; server timeouts, add * ServerBias */ static int TimeOuts[] = { /* Note: don't make the first entry larger than 4 hours (see above) */ 4*60*60, /* 0-7 users */ 1*60*60, /* 8-15 users */ 30*60, /* 16-23 users */ 15*60, /* 24-31 users */ 15*60, /* 32-39 users */ 10*60, /* 40-47 users */ 10*60, /* 48-55 users */ 10*60, /* 56-63 users */ }; /* Anything more: MinTimeOut */ /* minimum time given for a call back */ static int MinTimeOut = (7*60); #define TimeOutCutoff ((sizeof(TimeOuts)/sizeof(TimeOuts[0]))*8) #define TimeOut(nusers) ((nusers)>=TimeOutCutoff? MinTimeOut: TimeOuts[(nusers)>>3]) /* time out at server is 3 minutes more than ws */ #define ServerBias (3*60) /* Heads of CB queues; a timeout index is 1+index into this array */ static u_short timeout[128]; /* Convert cbtime to timeout queue index */ #define TIndex(cbtime) (((cbtime)&127)+1) /* Convert cbtime to pointer to timeout queue head */ #define THead(cbtime) (&timeout[TIndex(cbtime)-1]) static afs_int32 tfirst; /* cbtime of oldest unexpired call back time queue */ /* Normalize index into timeout array so that two such indices will be ordered correctly, so that they can be compared to see which times sooner, or so that the difference in time out times between them can be computed. */ #define TNorm(index) ((index)Volume, fid->Unique); for (fei=HashTable[hash]; fei; fei = fe->fnext) { fe = itofe(fei); if (fe->volid == fid->Volume && fe->unique == fid->Unique && fe->vnode == fid->Vnode) return fe; } return 0; } /*FindFE*/ #ifndef INTERPRET_DUMP extern void ShutDown(); static CDelPtr(), FDel(), AddCallback1(), GetSomeSpace_r(); static struct CallBack *iGetCB(register int *nused) { register struct CallBack *ret; if (ret = CBfree) { CBfree = (struct CallBack *)(((struct object *)ret)->next); (*nused)++; } return ret; } /*cb_GetCB*/ static iFreeCB(cb, nused) register struct CallBack *cb; register int *nused; { ((struct object *)cb)->next = (struct object *)CBfree; CBfree = cb; (*nused)--; } /*FreeCB*/ static struct FileEntry *iGetFE(register int *nused) { register struct FileEntry *ret; if (ret = FEfree) { FEfree = (struct FileEntry *)(((struct object *)ret)->next); (*nused)++; } return ret; } /*cb_GetFE*/ static iFreeFE(fe, nused) register struct FileEntry *fe; register int *nused; { ((struct object *)fe)->next = (struct object *)FEfree; FEfree = fe; (*nused)--; } /*FreeFE*/ /* Add cb to end of specified timeout list */ static TAdd(cb, thead) register struct CallBack *cb; register u_short *thead; { if (!*thead) { (*thead) = cb->tnext = cb->tprev = cbtoi(cb); } else { register struct CallBack *thp = itocb(*thead); cb->tprev = thp->tprev; cb->tnext = *thead; thp->tprev = (itocb(thp->tprev)->tnext = cbtoi(cb)); } cb->thead = ttoi(thead); } /*TAdd*/ /* Delete call back entry from timeout list */ static TDel(cb) register struct CallBack *cb; { register u_short *thead = itot(cb->thead); if (*thead == cbtoi(cb)) *thead = (*thead == cb->tnext? 0: cb->tnext); itocb(cb->tprev)->tnext = cb->tnext; itocb(cb->tnext)->tprev = cb->tprev; } /*TDel*/ /* Add cb to end of specified host list */ static HAdd(cb, host) register struct CallBack *cb; register struct host *host; { cb->hhead = h_htoi(host); if (!host->cblist) { host->cblist = cb->hnext = cb->hprev = cbtoi(cb); } else { register struct CallBack *hhp = itocb(host->cblist); cb->hprev = hhp->hprev; cb->hnext = host->cblist; hhp->hprev = (itocb(hhp->hprev)->hnext = cbtoi(cb)); } } /*HAdd*/ /* Delete call back entry from host list */ static HDel(cb) register struct CallBack *cb; { register u_short *hhead = &h_itoh(cb->hhead)->cblist; if (*hhead == cbtoi(cb)) *hhead = (*hhead == cb->hnext? 0: cb->hnext); itocb(cb->hprev)->hnext = cb->hnext; itocb(cb->hnext)->hprev = cb->hprev; } /*HDel*/ /* Delete call back entry from fid's chain of cb's */ /* N.B. This one also deletes the CB, and also possibly parent FE, so * make sure that it is not on any other list before calling this * routine */ static CDel(cb) struct CallBack *cb; { int cbi = cbtoi(cb); struct FileEntry *fe = itofe(cb->fhead); register u_short *cbp; register int safety; for (safety = 0, cbp = &fe->firstcb; *cbp && *cbp != cbi; cbp = &itocb(*cbp)->cnext, safety++) { if (safety > cbstuff.nblks + 10) { assert(0); ViceLog(0,("CDel: Internal Error -- shutting down: wanted %d from %d, now at %d\n",cbi,fe->firstcb,*cbp)); DumpCallBackState(); ShutDown(); } } CDelPtr(fe, cbp); } /*CDel*/ /* Same as CDel, but pointer to parent pointer to CB entry is passed, * as well as file entry */ /* N.B. This one also deletes the CB, and also possibly parent FE, so * make sure that it is not on any other list before calling this * routine */ int Ccdelpt=0, CcdelB=0; static CDelPtr(fe, cbp) register struct FileEntry *fe; register u_short *cbp; { register struct CallBack *cb; if (!*cbp) return; Ccdelpt++; cb = itocb(*cbp); if (cb != &CB[*cbp]) CcdelB++; *cbp = cb->cnext; FreeCB(cb); if (--fe->ncbs == 0) FDel(fe); } /*CDelPtr*/ static u_short *FindCBPtr(fe, host) struct FileEntry *fe; struct host *host; { register afs_uint32 hostindex = h_htoi(host); register struct CallBack *cb; register u_short *cbp; register int safety; for (safety = 0, cbp = &fe->firstcb; *cbp; cbp = &cb->cnext, safety++) { if (safety > cbstuff.nblks) { ViceLog(0,("FindCBPtr: Internal Error -- shutting down.\n")); DumpCallBackState(); ShutDown(); } cb = itocb(*cbp); if (cb->hhead == hostindex) break; } return cbp; } /*FindCBPtr*/ /* Delete file entry from hash table */ static FDel(fe) register struct FileEntry *fe; { register int fei = fetoi(fe); register unsigned short *p = &HashTable[VHash(fe->volid, fe->unique)]; while (*p && *p != fei) p = &itofe(*p)->fnext; assert(*p); *p = fe->fnext; FreeFE(fe); } /*FDel*/ InitCallBack(nblks) int nblks; { H_LOCK tfirst = CBtime(FT_ApproxTime()); /* N.B. FE's, CB's share same free list. If the sizes of either change, FE and CB will have to be separated. The "-1", below, is because FE[0] and CB[0] are not used--and not allocated */ FE = ((struct FileEntry *)(malloc(sizeof(struct FileEntry)*nblks)))-1; cbstuff.nFEs = nblks; while (cbstuff.nFEs) FreeFE(&FE[cbstuff.nFEs]); /* This is correct */ CB = ((struct CallBack *)(malloc(sizeof(struct CallBack)*nblks)))-1; cbstuff.nCBs = nblks; while (cbstuff.nCBs) FreeCB(&CB[cbstuff.nCBs]); /* This is correct */ cbstuff.nblks = nblks; cbstuff.nbreakers = 0; H_UNLOCK } /*InitCallBack*/ afs_int32 XCallBackBulk_r(ahost, fids, nfids) struct host *ahost; struct AFSFid *fids; afs_int32 nfids; { struct AFSCallBack tcbs[AFSCBMAX]; register int i; struct AFSCBFids tf; struct AFSCBs tc; int code; int j; #ifdef ADAPT_MTU rx_SetConnDeadTime(ahost->callback_rxcon, 4); rx_SetConnHardDeadTime(ahost->callback_rxcon, AFS_HARDDEADTIME); #endif code = 0; j = 0; while (nfids > 0) { for(i=0;icallback_rxcon, &tf, &tc); H_LOCK } return code; } /*XCallBackBulk*/ /* the locked flag tells us if the host entry has already been locked * by our parent. I don't think anybody actually calls us with the * host locked, but here's how to make that work: GetSomeSpace has to * change so that it doesn't attempt to lock any hosts < "host". That * means that it might be unable to free any objects, so it has to * return an exit status. If it fails, then AddCallBack1 might fail, * as well. If so, the host->ResetDone should probably be set to 0, * and we probably don't want to return a callback promise to the * cache manager, either. */ int AddCallBack1(host, fid, thead, type, locked) struct host *host; AFSFid *fid; int locked; int type; u_short *thead; { int retVal; H_LOCK if ( !locked ) { h_Lock_r(host); } retVal = AddCallBack1_r(host, fid, thead, type, 1); if ( !locked ) { h_Unlock_r(host); } H_UNLOCK return retVal; } int AddCallBack1_r(host, fid, thead, type, locked) struct host *host; AFSFid *fid; int locked; int type; u_short *thead; { struct FileEntry *fe; struct CallBack *cb = 0, *lastcb = 0; struct FileEntry *newfe = 0; afs_uint32 time_out; u_short *Thead = thead; struct CallBack *newcb = 0; int safety; host->Console |= 2; /* allocate these guys first, since we can't call the allocator with the host structure locked -- or we might deadlock. However, we have to avoid races with FindFE... */ while (!(newcb = GetCB())) { GetSomeSpace_r(host, locked); } while(!(newfe = GetFE())) { /* Get it now, so we don't have to call */ /* GetSomeSpace with the host locked, later. This might turn out to */ /* have been unneccessary, but that's actually kind of unlikely, since */ /* most files are not shared. */ GetSomeSpace_r(host, locked); } if (!locked) { h_Lock_r(host); /* this can yield, so do it before we get any */ /* fragile info */ } fe = FindFE(fid); if (type == CB_NORMAL) { time_out = TimeCeiling(FT_ApproxTime()+TimeOut(fe?fe->ncbs:0)+ServerBias); Thead = THead(CBtime(time_out)); } else if (type == CB_VOLUME) { time_out = TimeCeiling((60*120+FT_ApproxTime())+ServerBias); Thead = THead(CBtime(time_out)); } else if (type == CB_BULK) { /* bulk status can get so many callbacks all at once, and most of them * are probably not for things that will be used for long. */ time_out = TimeCeiling(FT_ApproxTime() + ServerBias + TimeOut(22 + (fe?fe->ncbs:0))); Thead = THead(CBtime(time_out)); } host->Console &= ~2; if (!fe) { register afs_uint32 hash; fe = newfe; newfe = (struct FileEntry *) 0; fe->firstcb = 0; fe->volid = fid->Volume; fe->vnode = fid->Vnode; fe->unique = fid->Unique; fe->ncbs = 0; hash = VHash(fid->Volume, fid->Unique); fe->fnext = HashTable[hash]; HashTable[hash] = fetoi(fe); } for (safety = 0, lastcb = cb = itocb(fe->firstcb); cb; lastcb = cb, cb = itocb(cb->cnext), safety++) { if (safety > cbstuff.nblks) { ViceLog(0,("AddCallBack1: Internal Error -- shutting down.\n")); DumpCallBackState(); ShutDown(); } if (cb->hhead == h_htoi(host)) break; } if (cb) {/* Already have call back: move to new timeout list */ /* don't change delayed callbacks back to normal ones */ if (cb->status != CB_DELAYED) cb->status = type; /* Only move if new timeout is longer */ if (TNorm(ttoi(Thead)) > TNorm(cb->thead)) { TDel(cb); TAdd(cb, Thead); } } else { cb = newcb; newcb = (struct CallBack *) 0; *(lastcb?&lastcb->cnext:&fe->firstcb) = cbtoi(cb); fe->ncbs++; cb->cnext = 0; cb->fhead = fetoi(fe); cb->status = type; HAdd(cb, host); TAdd(cb, Thead); } /* now free any still-unused callback or host entries */ if (newcb) FreeCB(newcb); if (newfe) FreeFE(newfe); if (!locked) /* freecb and freefe might(?) yield */ h_Unlock_r(host); if (type == CB_NORMAL || type == CB_VOLUME || type == CB_BULK ) return time_out-ServerBias; /* Expires sooner at workstation */ return 0; } /*AddCallBack1*/ /* Take an array full of hosts, all held. Break callbacks to them, and * release the holds once you're done, except don't release xhost. xhost * may be NULL. Currently only works for a single Fid in afidp array. * If you want to make this work with multiple fids, you need to fix * the error handling. One approach would be to force a reset if a * multi-fid call fails, or you could add delayed callbacks for each * fid. You probably also need to sort and remove duplicate hosts. * When this is called from the BreakVolumeCallBacks path, it does NOT * force a reset if the RPC fails, it just marks the host down and tries * to create a delayed callback. */ /* N.B. be sure that code works when ncbas == 0 */ /* N.B. requires all the cba[*].hp pointers to be valid... */ /* This routine does not hold a lock on the host for the duration of * the BreakCallBack RPC, which is a significant deviation from tradition. * It _does_ get a lock on the host before setting VenusDown = 1, * which is sufficient only if VenusDown = 0 only happens when the * lock is held over the RPC and the subsequent VenusDown == 0 * wherever that is done. */ static void MultiBreakCallBack_r(cba, ncbas, afidp, xhost) struct cbstruct cba[]; int ncbas; struct AFSCBFids *afidp; struct host * xhost; { int i,j; struct rx_connection *conns[MAX_CB_HOSTS]; int opt_TO; /* secs, but internal adaptive parms are in ms */ static struct AFSCBs tc = {0,0}; assert(ncbas <= MAX_CB_HOSTS); /* set up conns for multi-call */ for (i=0,j=0; ihostFlags & HOSTDELETED)) { continue; } conns[j++] = thishost->callback_rxcon; #ifdef ADAPT_MTU rx_SetConnDeadTime (thishost->callback_rxcon, 4); rx_SetConnHardDeadTime (thishost->callback_rxcon, AFS_HARDDEADTIME); #endif } if (j) { /* who knows what multi would do with 0 conns? */ cbstuff.nbreakers++; H_UNLOCK multi_Rx(conns, j) { multi_RXAFSCB_CallBack(afidp, &tc); if (multi_error) { unsigned short idx ; struct host *hp; idx = 0; /* If there's an error, we have to hunt for the right host. * The conns array _should_ correspond one-to-one to the cba * array, except in some rare cases it might be missing one * or more elements. So the optimistic case is almost * always right. At worst, it's the starting point for the * hunt. */ for (hp=0,i=multi_i;icallback_rxcon) { idx = cba[i].thead; break; } } if (!hp) { ViceLog(0, ("BCB: INTERNAL ERROR: hp=%x, cba=%x\n",hp,cba)); } else { /* ** try breaking callbacks on alternate interface addresses */ if ( MultiBreakCallBackAlternateAddress(hp, afidp) ) { if (ShowProblems) { ViceLog(7, ("BCB: Failed on file %u.%d.%d, host %x.%d is down\n", afidp->AFSCBFids_val->Volume, afidp->AFSCBFids_val->Vnode, afidp->AFSCBFids_val->Unique, hp->host, hp->port)); } H_LOCK h_Lock_r(hp); hp->hostFlags |= VENUSDOWN; /** * We always go into AddCallBack1_r with the host locked */ AddCallBack1_r(hp,afidp->AFSCBFids_val,itot(idx), CB_DELAYED, 1); h_Unlock_r(hp); H_UNLOCK } } } } multi_End; H_LOCK cbstuff.nbreakers--; } for (i=0; ihost, xhost->port, fid->Volume, fid->Vnode, fid->Unique)); H_LOCK cbstuff.BreakCallBacks++; fe = FindFE(fid); if (!fe) { goto done; } hostindex = h_htoi(xhost); cb = itocb(fe->firstcb); if (!cb || ((fe->ncbs == 1) && (cb->hhead == hostindex) && !flag)) { /* the most common case is what follows the || */ goto done; } tf.AFSCBFids_len = 1; tf.AFSCBFids_val = fid; for(;cb;) { for (ncbas=0; cb && ncbascnext); if ((cb->hhead != hostindex || flag) && (cb->status == CB_BULK || cb->status == CB_NORMAL || cb->status == CB_VOLUME) ) { struct host *thishost = h_itoh(cb->hhead); if (!thishost) { ViceLog(0,("BCB: BOGUS! cb->hhead is NULL!\n")); } else if (thishost->hostFlags & VENUSDOWN) { ViceLog(7,("BCB: %x.%d is down; delaying break call back\n", thishost->host, thishost->port)); cb->status = CB_DELAYED; } else { h_Hold_r(thishost); cba[ncbas].hp = thishost; cba[ncbas].thead = cb->thead; ncbas++; TDel(cb); HDel(cb); CDel(cb); /* Usually first; so this delete */ /* is reasonably inexpensive */ } } } if (ncbas) { MultiBreakCallBack_r(cba, ncbas, &tf, xhost); /* we need to to all these initializations again because MultiBreakCallBack may block */ fe = FindFE(fid); if (!fe) { goto done; } cb = itocb(fe->firstcb); if (!cb || ((fe->ncbs == 1) && (cb->hhead == hostindex) && !flag)) { /* the most common case is what follows the || */ goto done; } } } done: H_UNLOCK return; } /*BreakCallBack*/ /* Delete (do not break) single call back for fid */ DeleteCallBack(host, fid) struct host *host; AFSFid *fid; { register struct FileEntry *fe; register u_short *pcb; cbstuff.DeleteCallBacks++; H_LOCK h_Lock_r(host); fe = FindFE(fid); if (!fe) { h_Unlock_r(host); H_UNLOCK ViceLog(8,("DCB: No call backs for fid (%u, %d, %d)\n", fid->Volume, fid->Vnode, fid->Unique)); return; } pcb = FindCBPtr(fe, host); if (!*pcb) { ViceLog(8,("DCB: No call back for host %x.%d, (%u, %d, %d)\n", host->host, host->port, fid->Volume, fid->Vnode, fid->Unique)); h_Unlock_r(host); H_UNLOCK return; } HDel(itocb(*pcb)); TDel(itocb(*pcb)); CDelPtr(fe, pcb); h_Unlock_r(host); H_UNLOCK } /*DeleteCallBack*/ /* * Delete (do not break) all call backs for fid. This call doesn't * set all of the various host locks, but it shouldn't really matter * since we're not adding callbacks, but deleting them. I'm not sure * why it doesn't set the lock, however; perhaps it should. */ DeleteFileCallBacks(fid) AFSFid *fid; { register struct FileEntry *fe; register struct CallBack *cb; register afs_uint32 cbi; register n; H_LOCK cbstuff.DeleteFiles++; fe = FindFE(fid); if (!fe) { H_UNLOCK ViceLog(8,("DF: No fid (%u,%u,%u) to delete\n", fid->Volume, fid->Vnode, fid->Unique)); return; } for (n=0,cbi = fe->firstcb; cbi; n++) { cb = itocb(cbi); cbi = cb->cnext; TDel(cb); HDel(cb); FreeCB(cb); } FDel(fe); H_UNLOCK } /*DeleteFileCallBacks*/ /* Delete (do not break) all call backs for host. The host should be * locked. */ DeleteAllCallBacks(host) struct host *host; { int retVal; H_LOCK retVal = DeleteAllCallBacks_r(host); H_UNLOCK return retVal; } DeleteAllCallBacks_r(host) struct host *host; { register struct CallBack *cb; register int cbi, first; cbstuff.DeleteAllCallBacks++; cbi = first = host->cblist; if (!cbi) { ViceLog(8,("DV: no call backs\n")); return; } do { cb = itocb(cbi); cbi = cb->hnext; TDel(cb); CDel(cb); } while (cbi != first); host->cblist = 0; } /*DeleteAllCallBacks*/ /* * Break all delayed call backs for host. Returns 1 if all call backs * successfully broken; 0 otherwise. Assumes host is h_Held and h_Locked. * Must be called with VenusDown set for this host */ int BreakDelayedCallBacks(host) struct host *host; { int retVal; H_LOCK retVal = BreakDelayedCallBacks_r(host); H_UNLOCK return retVal; } extern afsUUID FS_HostUUID; int BreakDelayedCallBacks_r(host) struct host *host; { struct AFSFid fids[AFSCBMAX]; u_short thead[AFSCBMAX]; int cbi, first, nfids; struct CallBack *cb; struct interfaceAddr interf; int code; cbstuff.nbreakers++; if (!(host->hostFlags & RESETDONE) && !(host->hostFlags & HOSTDELETED)) { host->hostFlags &= ~ALTADDR; /* alterrnate addresses are invalid */ if ( host->interface ) { H_UNLOCK code = RXAFSCB_InitCallBackState3(host->callback_rxcon, &FS_HostUUID); H_LOCK } else { H_UNLOCK code = RXAFSCB_InitCallBackState(host->callback_rxcon); H_LOCK } host->hostFlags |= ALTADDR; /* alternate addresses are valid */ if (code) { if (ShowProblems) { ViceLog(0, ("CB: Call back connect back failed (in break delayed) for %x.%d\n", host->host, host->port)); } host->hostFlags |= VENUSDOWN; } else { ViceLog(25,("InitCallBackState success on %x\n",host->host)); /* reset was done successfully */ host->hostFlags |= RESETDONE; host->hostFlags &= ~VENUSDOWN; } } else while (!(host->hostFlags & HOSTDELETED)) { nfids = 0; host->hostFlags &= ~VENUSDOWN; /* presume up */ cbi = first = host->cblist; if (!cbi) break; do { first = host->cblist; cb = itocb(cbi); cbi = cb->hnext; if (cb->status == CB_DELAYED) { register struct FileEntry *fe = itofe(cb->fhead); thead[nfids] = cb->thead; fids[nfids].Volume = fe->volid; fids[nfids].Vnode = fe->vnode; fids[nfids].Unique = fe->unique; nfids++; HDel(cb); TDel(cb); CDel(cb); } } while (cbi && cbi != first && nfids < AFSCBMAX); if (nfids==0) { break; } if (XCallBackBulk_r(host, fids, nfids)) { /* Failed, again: put them back, probably with old timeout values */ int i; if (ShowProblems) { ViceLog(0, ("CB: XCallBackBulk failed, host=%x.%d; callback list follows:\n", host->host, host->port)); } for (i = 0; ihost, host->port, fids[i].Volume, fids[i].Vnode, fids[i].Unique)); } /* used to do this: AddCallBack1_r(host, &fids[i], itot(thead[i]), CB_DELAYED, 1); * but it turns out to cause too many tricky locking problems. * now, if break delayed fails, screw it. */ } host->hostFlags |= VENUSDOWN; /* Failed */ ClearHostCallbacks_r(host, 1/* locked */); nfids = 0; break; } if (nfids < AFSCBMAX) break; } cbstuff.nbreakers--; return (host->hostFlags & VENUSDOWN); } /*BreakDelayedCallBacks*/ struct VCBParams { struct cbstruct cba[MAX_CB_HOSTS]; /* re-entrant storage */ unsigned int ncbas; unsigned short thead; /* head of timeout queue for youngest callback */ struct AFSFid *fid; }; /* ** isheld is 0 if the host is held in h_Enumerate ** isheld is 1 if the host is held in BreakVolumeCallBacks */ static int MultiBreakVolumeCallBack_r (host, isheld, parms) struct host *host; int isheld; struct VCBParams *parms; { if ( !isheld ) return isheld; /* host is held only by h_Enumerate, do nothing */ if ( host->hostFlags & HOSTDELETED ) return 0; /* host is deleted, release hold */ if (host->hostFlags & VENUSDOWN) { h_Lock_r(host); if (host->hostFlags & HOSTDELETED) { h_Unlock_r(host); return 0; /* Release hold */ } ViceLog(8,("BVCB: volume call back for host %x.%d failed\n", host->host,host->port)); if (ShowProblems) { ViceLog(0, ("CB: volume callback for host %x.%d failed\n", host->host, host->port)); } DeleteAllCallBacks_r(host); /* Delete all callback state rather than attempting to selectively remember to delete the volume callbacks later */ host->hostFlags &= ~RESETDONE; /* Do InitCallBackState when host returns */ h_Unlock_r(host); return 0; /* release hold */ } assert(parms->ncbas <= MAX_CB_HOSTS); /* Do not call MultiBreakCallBack on the current host structure ** because it would prematurely release the hold on the host */ if ( parms->ncbas == MAX_CB_HOSTS ) { struct AFSCBFids tf; tf.AFSCBFids_len = 1; tf.AFSCBFids_val = parms->fid; /* this releases all the hosts */ MultiBreakCallBack_r(parms->cba, parms->ncbas, &tf, 0 /* xhost */); parms->ncbas = 0; } parms->cba[parms->ncbas].hp = host; parms->cba[(parms->ncbas)++].thead = parms->thead; return 1; /* DON'T release hold, because we still need it. */ } /* ** isheld is 0 if the host is held in h_Enumerate ** isheld is 1 if the host is held in BreakVolumeCallBacks */ static int MultiBreakVolumeCallBack (host, isheld, parms) struct host *host; int isheld; struct VCBParams *parms; { int retval; H_LOCK retval = MultiBreakVolumeCallBack_r(host, isheld, parms); H_UNLOCK return retval; } /* * Break all call backs on a single volume. Don't call this with any * hosts h_held. Note that this routine clears the callbacks before * actually breaking them, and that the vnode isn't locked during this * operation, so that people might see temporary callback loss while * this function is executing. It is just a temporary state, however, * since the callback will be broken later by this same function. * * Now uses multi-RX for CallBack RPC. Note that the * multiBreakCallBacks routine does not force a reset if the RPC * fails, unlike the previous version of this routine, but does create * a delayed callback. Resets will be forced if the host is * determined to be down before the RPC is executed. */ BreakVolumeCallBacks(volume) afs_uint32 volume; { struct AFSFid fid; int hash; u_short *feip; struct CallBack *cb; struct FileEntry *fe; struct host *host; struct VCBParams henumParms; unsigned short tthead = 0; /* zero is illegal value */ H_LOCK fid.Volume = volume, fid.Vnode = fid.Unique = 0; for (hash=0; hashvolid == volume) { register struct CallBack *cbnext; for (cb = itocb(fe->firstcb); cb; cb = cbnext) { host = h_itoh(cb->hhead); h_Hold_r(host); cbnext = itocb(cb->cnext); if (!tthead || (TNorm(tthead) < TNorm(cb->thead))) { tthead = cb->thead; } TDel(cb); HDel(cb); FreeCB(cb); /* leave hold for MultiBreakVolumeCallBack to clear */ } *feip = fe->fnext; FreeFE(fe); } else { feip = &fe->fnext; } } } if (!tthead) { /* didn't find any callbacks, so return right away. */ H_UNLOCK return 0; } henumParms.ncbas = 0; henumParms.fid = &fid; henumParms.thead = tthead; H_UNLOCK h_Enumerate(MultiBreakVolumeCallBack, (char *) &henumParms); H_LOCK if (henumParms.ncbas) { /* do left-overs */ struct AFSCBFids tf; tf.AFSCBFids_len = 1; tf.AFSCBFids_val = &fid; MultiBreakCallBack_r(henumParms.cba, henumParms.ncbas, &tf, 0 ); henumParms.ncbas = 0; } H_UNLOCK return 0; } /*BreakVolumeCallBacks*/ /* * Delete all timed-out call back entries (to be called periodically by file * server) */ CleanupTimedOutCallBacks() { H_LOCK CleanupTimedOutCallBacks_r(); H_UNLOCK } CleanupTimedOutCallBacks_r() { afs_uint32 now = CBtime(FT_ApproxTime()); register u_short *thead; register struct CallBack *cb; register int ntimedout = 0; extern void ShutDown(); while (tfirst <= now) { register int cbi; cbi = *(thead = THead(tfirst)); if (cbi) { do { cb = itocb(cbi); cbi = cb->tnext; ViceLog(8,("CCB: deleting timed out call back %x.%d, (%u,%u,%u)\n", h_itoh(cb->hhead)->host, h_itoh(cb->hhead)->port, itofe(cb->fhead)->volid, itofe(cb->fhead)->vnode, itofe(cb->fhead)->unique)); HDel(cb); CDel(cb); ntimedout++; if (ntimedout > cbstuff.nblks) { ViceLog(0,("CCB: Internal Error -- shutting down...\n")); DumpCallBackState(); ShutDown(); } } while (cbi != *thead); *thead = 0; } tfirst++; } cbstuff.CBsTimedOut += ntimedout; ViceLog(7,("CCB: deleted %d timed out callbacks\n", ntimedout)); return (ntimedout > 0); } /*CleanupTimedOutCallBacks*/ static struct host *lih_host; static int lih_r(host, held, hostp) register struct host *host, *hostp; register int held; { if (host->cblist && ((hostp && host != hostp) || (!held && !h_OtherHolds_r(host))) && (!lih_host || host->ActiveCall < lih_host->ActiveCall) ) { lih_host = host; } return held; } /*lih*/ /* This could be upgraded to get more space each time */ /* first pass: find the oldest host which isn't held by anyone */ /* second pass: find the oldest host who isn't "me" */ /* always called with hostp unlocked */ static int GetSomeSpace_r(hostp, locked) struct host *hostp; int locked; { register struct host *hp, *hp1 = (struct host *)0; int i=0; cbstuff.GotSomeSpaces++; ViceLog(5,("GSS: First looking for timed out call backs via CleanupCallBacks\n")); if (CleanupTimedOutCallBacks_r()) { cbstuff.GSS3++; return; } do { lih_host = 0; h_Enumerate_r(lih_r, (char *)hp1); hp = lih_host; if (hp) { cbstuff.GSS4++; if ( ! ClearHostCallbacks_r(hp, 0 /* not locked or held */) ) return; } else { hp1 = hostp; cbstuff.GSS1++; ViceLog(5,("GSS: Try harder for longest inactive host cnt= %d\n", i)); /* * Next time try getting callbacks from any host even if * it's deleted (that's actually great since we can freely * remove its callbacks) or it's held since the only other * option is starvation for the file server (i.e. until the * callback timeout arrives). */ i++; } } while (i < 2); /* * No choice to clear this host's callback state */ /* third pass: we still haven't gotten any space, so we free what we had * previously passed over. */ cbstuff.GSS2++; if (!locked) { h_Lock_r(hostp); } ClearHostCallbacks_r(hostp, 1/*already locked*/); if (!locked) { h_Unlock_r(hostp); } } /*GetSomeSpace*/ ClearHostCallbacks(hp, locked) struct host *hp; int locked; /* set if caller has already locked the host */ { int retVal; H_LOCK retVal = ClearHostCallbacks_r(hp, locked); H_UNLOCK return retVal; } int ClearHostCallbacks_r(hp, locked) struct host *hp; int locked; /* set if caller has already locked the host */ { struct interfaceAddr interf; int code; int held = 0; ViceLog(5,("GSS: Delete longest inactive host %x\n", hp->host)); if ( !(held = h_Held_r(hp)) ) h_Hold_r(hp); /** Try a non-blocking lock. If the lock is already held return * after releasing hold on hp */ if (!locked) { if ( h_NBLock_r(hp) ) { if ( !held ) h_Release_r(hp); return 1; } } if (hp->Console & 2) { /* * If the special console field is set it means that a thread * is waiting in AddCallBack1 after it set pointers to the * file entry and/or callback entry. Because of the bogus * usage of h_hold it won't prevent from another thread, this * one, to remove all the callbacks so just to be safe we keep * a reference. NOTE, on the last phase we'll free the calling * host's callbacks but that's ok... */ cbstuff.GSS5++; } DeleteAllCallBacks_r(hp); if (hp->hostFlags & VENUSDOWN) { hp->hostFlags &= ~RESETDONE; /* remember that we must do a reset */ } else { /* host is up, try a call */ hp->hostFlags &= ~ALTADDR; /* alternate addresses are invalid */ if (hp->interface) { H_UNLOCK code = RXAFSCB_InitCallBackState3(hp->callback_rxcon, &FS_HostUUID); H_LOCK } else { H_UNLOCK code = RXAFSCB_InitCallBackState(hp->callback_rxcon); H_LOCK } hp->hostFlags |= ALTADDR; /* alternate addresses are valid */ if (code) { /* failed, mark host down and need reset */ hp->hostFlags |= VENUSDOWN; hp->hostFlags &= ~RESETDONE; } else { /* reset succeeded, we're done */ hp->hostFlags |= RESETDONE; } } if (!locked) { h_Unlock_r(hp); } if ( !held ) h_Release_r(hp); return 0; } #endif /* INTERPRET_DUMP */ PrintCallBackStats() { fprintf(stderr, "%d add CB, %d break CB, %d del CB, %d del FE, %d CB's timed out, %d space reclaim, %d del host\n", cbstuff.AddCallBacks, cbstuff.BreakCallBacks, cbstuff.DeleteCallBacks, cbstuff.DeleteFiles, cbstuff.CBsTimedOut, cbstuff.GotSomeSpaces, cbstuff.DeleteAllCallBacks); fprintf(stderr, "%d CBs, %d FEs, (%d of total of %d 16-byte blocks)\n", cbstuff.nCBs, cbstuff.nFEs, cbstuff.nCBs+cbstuff.nFEs, cbstuff.nblks); } /*PrintCallBackStats*/ #define MAGIC 0x12345678 /* To check byte ordering of dump when it is read in */ #ifndef INTERPRET_DUMP DumpCallBackState() { int fd; afs_uint32 magic = MAGIC, now = FT_ApproxTime(), freelisthead; fd = open(AFSDIR_SERVER_CBKDUMP_FILEPATH, O_WRONLY|O_CREAT|O_TRUNC, 0666); if (fd < 0) { ViceLog(0, ("Couldn't create callback dump file %s\n", AFSDIR_SERVER_CBKDUMP_FILEPATH)); return; } write(fd, &magic, sizeof(magic)); write(fd, &now, sizeof(now)); write(fd, &cbstuff, sizeof(cbstuff)); write(fd, TimeOuts, sizeof(TimeOuts)); write(fd, timeout, sizeof(timeout)); write(fd, &tfirst, sizeof(tfirst)); freelisthead = cbtoi((struct CallBack *) CBfree); write(fd, &freelisthead, sizeof(freelisthead)); /* This is a pointer */ freelisthead = fetoi((struct FileEntry *) FEfree); write(fd, &freelisthead, sizeof(freelisthead)); /* This is a pointer */ write(fd, HashTable, sizeof(HashTable)); write(fd, &CB[1], sizeof(CB[1])*cbstuff.nblks); /* CB stuff */ write(fd, &FE[1], sizeof(FE[1])*cbstuff.nblks); /* FE stuff */ close(fd); } /*DumpCallBackState*/ #endif #ifdef INTERPRET_DUMP /* This is only compiled in for the callback analyzer program */ /* Returns the time of the dump */ time_t ReadDump(file) char *file; { int fd; afs_uint32 magic, freelisthead; time_t now; fd = open(file, O_RDONLY); if (fd < 0) { fprintf(stderr, "Couldn't read dump file %s\n", file); exit(1); } read(fd, &magic, sizeof(magic)); if (magic != MAGIC) { fprintf(stderr, "Magic number of %s is invalid. You might be trying to\n", file); fprintf(stderr, "run this program on a machine type with a different byte ordering.\n"); exit(1); } read(fd, &now, sizeof(now)); read(fd, &cbstuff, sizeof(cbstuff)); read(fd, TimeOuts, sizeof(TimeOuts)); read(fd, timeout, sizeof(timeout)); read(fd, &tfirst, sizeof(tfirst)); read(fd, &freelisthead, sizeof(freelisthead)); CB = ((struct CallBack *)(malloc(sizeof(struct FileEntry)*cbstuff.nblks)))-1; FE = ((struct FileEntry *)(malloc(sizeof(struct FileEntry)*cbstuff.nblks)))-1; CBfree = (struct CallBack *) itocb(freelisthead); read(fd, &freelisthead, sizeof(freelisthead)); FEfree = (struct FileEntry *) itofe(freelisthead); read(fd, HashTable, sizeof(HashTable)); read(fd, &CB[1], sizeof(CB[1])*cbstuff.nblks); /* CB stuff */ read(fd, &FE[1], sizeof(FE[1])*cbstuff.nblks); /* FE stuff */ if (close(fd)) { perror("Error reading dumpfile"); exit(1); } return now; } /*ReadDump*/ #include "AFS_component_version_number.c" main(argc, argv) int argc; char **argv; { int err = 0, cbi = 0, stats = 0, noptions = 0, all = 0, vol = 0, raw = 0; static AFSFid fid; register struct FileEntry *fe; register struct CallBack *cb; time_t now; bzero(&fid, sizeof(fid)); argc--; argv++; while (argc && **argv == '-') { noptions++; argc--; if (!strcmp(*argv, "-host")) { if (argc < 1) { err++; break; } argc--; cbi = atoi(*++argv); } else if (!strcmp(*argv, "-fid")) { if (argc < 2) { err++; break; } argc -= 3; fid.Volume = atoi(*++argv); fid.Vnode = atoi(*++argv); fid.Unique = atoi(*++argv); } else if (!strcmp(*argv, "-time")) { fprintf(stderr, "-time not supported\n"); exit(1); } else if (!strcmp(*argv, "-stats")) { stats = 1; } else if (!strcmp(*argv, "-all")) { all = 1; } else if (!strcmp(*argv, "-raw")) { raw = 1; } else if (!strcmp(*argv, "-volume")) { if (argc < 1) { err++; break; } argc--; vol = atoi(*++argv); } else err++; argv++; } if (err || argc != 1) { fprintf(stderr, "Usage: cbd [-host cbid] [-fid volume vnode] [-stats] callbackdumpfile\n"); fprintf(stderr, "[cbid is shown for each host in the hosts.dump file]\n"); exit(1); } now = ReadDump(*argv); if (stats || noptions == 0) { time_t uxtfirst = UXtime(tfirst); printf("The time of the dump was %u %s", now, ctime(&now)); printf("The last time cleanup ran was %u %s", uxtfirst, ctime(&uxtfirst)); PrintCallBackStats(); } if (all || vol) { register hash; register u_short *feip; register struct CallBack *cb; register struct FileEntry *fe; for (hash=0; hashvolid == vol)) { register struct CallBack *cbnext; for (cb = itocb(fe->firstcb); cb; cb = cbnext) { PrintCB(cb,now); cbnext = itocb(cb->cnext); } *feip = fe->fnext; } else { feip = &fe->fnext; } } } } if (cbi) { u_short cfirst = cbi; do { cb = itocb(cbi); PrintCB(cb,now); cbi = cb->hnext; } while (cbi != cfirst); } if (fid.Volume) { fe = FindFE(&fid); if (!fe) { printf("No callback entries for %u.%u\n", fid.Volume, fid.Vnode); exit(1); } cb = itocb(fe->firstcb); while (cb) { PrintCB(cb, now); cb = itocb(cb->cnext); } } if (raw) { struct FileEntry *fe; afs_int32 *p, i; for (i=1; i < cbstuff.nblks; i++) { p = (afs_int32 *) &FE[i]; printf("%d:%12x%12x%12x%12x\n", i, p[0], p[1], p[2], p[3]); } } } PrintCB(cb, now) register struct CallBack *cb; afs_uint32 now; { struct FileEntry *fe = itofe(cb->fhead); time_t expires = TIndexToTime(cb->thead); printf("vol=%u vn=%u cbs=%d hi=%d st=%d, exp in %d secs at %s", fe->volid, fe->vnode, fe->ncbs, cb->hhead, cb->status, expires - now, ctime(&expires)); } /*PrintCB*/ #endif #if !defined(INTERPRET_DUMP) /* ** try breaking calbacks on afidp from host. Use multi_rx. ** return 0 on success, non-zero on failure */ int MultiBreakCallBackAlternateAddress(host, afidp) struct host* host; struct AFSCBFids* afidp; { int retVal; H_LOCK retVal = MultiBreakCallBackAlternateAddress_r(host, afidp); H_UNLOCK return retVal; } int MultiBreakCallBackAlternateAddress_r(host, afidp) struct host* host; struct AFSCBFids* afidp; { int i,j; struct rx_connection* conns[AFS_MAX_INTERFACE_ADDR]; struct rx_connection* connSuccess = 0; afs_int32 addr[AFS_MAX_INTERFACE_ADDR]; static struct rx_securityClass *sc = 0; static struct AFSCBs tc = {0,0}; /* nothing more can be done */ if ( !host->interface ) return 1; /* failure */ assert(host->interface->numberOfInterfaces > 0 ); /* the only address is the primary interface */ if ( host->interface->numberOfInterfaces == 1 ) return 1; /* failure */ /* initialise a security object only once */ if ( !sc ) sc = (struct rx_securityClass *) rxnull_NewClientSecurityObject(); /* initialize alternate rx connections */ for ( i=0,j=0; i < host->interface->numberOfInterfaces; i++) { /* this is the current primary address */ if ( host->host == host->interface->addr[i] ) continue; addr[j] = host->interface->addr[i]; conns[j] = rx_NewConnection (host->interface->addr[i], host->port, 1, sc, 0); rx_SetConnDeadTime(conns[j], 2); rx_SetConnHardDeadTime(conns[j], AFS_HARDDEADTIME); j++; } assert(j); /* at least one alternate address */ ViceLog(125,("Starting multibreakcall back on all addr for host:%x\n", host->host)); H_UNLOCK multi_Rx(conns, j) { multi_RXAFSCB_CallBack(afidp, &tc); if ( !multi_error ) { /* first success */ H_LOCK if ( host->callback_rxcon ) rx_DestroyConnection(host->callback_rxcon); host->callback_rxcon = conns[multi_i]; host->host = addr[multi_i]; connSuccess = conns[multi_i]; rx_SetConnDeadTime(host->callback_rxcon, 50); rx_SetConnHardDeadTime(host->callback_rxcon, AFS_HARDDEADTIME); ViceLog(125,("multibreakcall success with addr:%x\n", addr[multi_i])); H_UNLOCK multi_Abort; } } multi_End_Ignore; H_LOCK /* Destroy all connections except the one on which we succeeded */ for ( i=0; i < j; i++) if ( conns[i] != connSuccess ) rx_DestroyConnection(conns[i] ); if ( connSuccess ) return 0; /* success */ else return 1; /* failure */ } /* ** try multiRX probes to host. ** return 0 on success, non-zero on failure */ int MultiProbeAlternateAddress_r(host) struct host* host; { int i,j; struct rx_connection* conns[AFS_MAX_INTERFACE_ADDR]; struct rx_connection* connSuccess = 0; afs_int32 addr[AFS_MAX_INTERFACE_ADDR]; static struct rx_securityClass *sc = 0; /* nothing more can be done */ if ( !host->interface ) return 1; /* failure */ assert(host->interface->numberOfInterfaces > 0 ); /* the only address is the primary interface */ if ( host->interface->numberOfInterfaces == 1 ) return 1; /* failure */ /* initialise a security object only once */ if ( !sc ) sc = (struct rx_securityClass *) rxnull_NewClientSecurityObject(); /* initialize alternate rx connections */ for ( i=0,j=0; i < host->interface->numberOfInterfaces; i++) { /* this is the current primary address */ if ( host->host == host->interface->addr[i] ) continue; addr[j] = host->interface->addr[i]; conns[j] = rx_NewConnection (host->interface->addr[i], host->port, 1, sc, 0); rx_SetConnDeadTime(conns[j], 2); rx_SetConnHardDeadTime(conns[j], AFS_HARDDEADTIME); j++; } assert(j); /* at least one alternate address */ ViceLog(125,("Starting multiprobe on all addr for host:%x\n", host->host)); H_UNLOCK multi_Rx(conns, j) { multi_RXAFSCB_ProbeUuid(&host->interface->uuid); if ( !multi_error ) { /* first success */ H_LOCK if ( host->callback_rxcon ) rx_DestroyConnection(host->callback_rxcon); host->callback_rxcon = conns[multi_i]; host->host = addr[multi_i]; connSuccess = conns[multi_i]; rx_SetConnDeadTime(host->callback_rxcon, 50); rx_SetConnHardDeadTime(host->callback_rxcon, AFS_HARDDEADTIME); ViceLog(125,("multiprobe success with addr:%x\n", addr[multi_i])); H_UNLOCK multi_Abort; } } multi_End_Ignore; H_LOCK /* Destroy all connections except the one on which we succeeded */ for ( i=0; i < j; i++) if ( conns[i] != connSuccess ) rx_DestroyConnection(conns[i] ); if ( connSuccess ) return 0; /* success */ else return 1; /* failure */ } #endif /* !defined(INTERPRET_DUMP) */