* This software has been released under the terms of the IBM Public
* License. For details, see the LICENSE file in the top-level source
* directory or online at http://www.openafs.org/dl/license10.html
+ *
+ * Portions Copyright (c) 2006 Sine Nomine Associates
*/
/*
#include <afsconfig.h>
#include <afs/param.h>
-RCSID("$Header$");
+RCSID
+ ("$Header$");
-#include <stdio.h>
-#include <stdlib.h> /* for malloc() */
-#include <time.h> /* ANSI standard location for time stuff */
+#include <stdio.h>
+#include <stdlib.h> /* for malloc() */
+#include <time.h> /* ANSI standard location for time stuff */
+#include <string.h>
#ifdef AFS_NT40_ENV
#include <fcntl.h>
#include <io.h>
#include <sys/time.h>
#include <sys/file.h>
#endif
-#ifdef HAVE_STRING_H
-#include <string.h>
-#else
-#ifdef HAVE_STRINGS_H
-#include <strings.h>
-#endif
-#endif
#include <afs/assert.h>
#include <afs/stds.h>
-#include <afs/nfs.h> /* yuck. This is an abomination. */
+#include <afs/nfs.h> /* yuck. This is an abomination. */
#include <lwp.h>
#include <rx/rx.h>
#include <afscbint.h>
#include "viced_prototypes.h"
#include "viced.h"
-#include <afs/ptclient.h> /* need definition of prlist for host.h */
+#include <afs/ptclient.h> /* need definition of prlist for host.h */
#include "host.h"
+#include "callback.h"
+#ifdef AFS_DEMAND_ATTACH_FS
+#include "../tviced/serialize_state.h"
+#endif /* AFS_DEMAND_ATTACH_FS */
+
extern afsUUID FS_HostUUID;
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_byte unsigned char
+#ifndef INTERPRET_DUMP
+static int ShowProblems = 1;
+#endif
struct cbcounters cbstuff;
-struct cbstruct {
- struct host * hp;
- afs_uint32 thead;
-} ;
-
-struct FileEntry {
- afs_uint32 vnode;
- afs_uint32 unique;
- afs_uint32 volid;
- afs_uint32 fnext;
- afs_uint32 ncbs;
- afs_uint32 firstcb;
- afs_uint32 status;
- afs_uint32 spare;
-} *FE; /* Don't use FE[0] */
-#define FE_LATER 0x1
-
-struct CallBack {
- afs_uint32 cnext; /* Next call back entry */
- afs_uint32 fhead; /* Head of this call back chain */
- u_byte thead; /* Head of timeout chain */
- u_byte status; /* Call back status; see definitions, below */
- afs_uint32 hhead; /* Head of host table chain */
- afs_uint32 tprev, tnext; /* Timeout chain */
- afs_uint32 hprev, hnext; /* Chain from host table */
- unsigned short spare; /* make it a multiple of 32 bits. */
-} *CB; /* Don't use CB[0] */
-
-/* status values 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.
- */
+static struct FileEntry * FE = NULL; /* don't use FE[0] */
+static struct CallBack * CB = NULL; /* don't use CB[0] */
-/* 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)
+static struct CallBack * CBfree = NULL;
+static struct FileEntry * FEfree = NULL;
-/* 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
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 */
+ 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)
+#ifndef INTERPRET_DUMP
+static int MinTimeOut = (7 * 60);
+#endif
/* Heads of CB queues; a timeout index is 1+index into this array */
-static afs_uint32 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_uint32 timeout[CB_NUM_TIMEOUT_QUEUES];
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)<TIndex(tfirst)?(index)+128:(index))
-
-/* This converts a timeout index into the actual time it will expire */
-#define TIndexToTime(index) (UXtime(TNorm(index) - TIndex(tfirst) + tfirst))
-
-
-/* Convert pointer to timeout queue head to index, and vice versa */
-#define ttoi(t) ((t-timeout)+1)
-#define itot(i) ((timeout)+(i-1))
/* 16 byte object get/free routines */
struct object {
struct object *next;
};
-struct VCBParams {
- struct cbstruct cba[MAX_CB_HOSTS]; /* re-entrant storage */
- unsigned int ncbas;
- afs_uint32 thead; /* head of timeout queue for youngest callback */
- struct AFSFid *fid;
-};
-
-struct CallBack *CBfree = 0;
-struct FileEntry *FEfree = 0;
-
/* Prototypes for static routines */
-static struct FileEntry *FindFE (register AFSFid *fid);
+static struct FileEntry *FindFE(register AFSFid * fid);
+
+#ifndef INTERPRET_DUMP
static struct CallBack *iGetCB(register int *nused);
static int iFreeCB(register struct CallBack *cb, register int *nused);
static struct FileEntry *iGetFE(register int *nused);
static int iFreeFE(register struct FileEntry *fe, register int *nused);
-static int TAdd(register struct CallBack *cb, register afs_uint32 *thead);
+static int TAdd(register struct CallBack *cb, register afs_uint32 * thead);
static int TDel(register struct CallBack *cb);
static int HAdd(register struct CallBack *cb, register struct host *host);
static int HDel(register struct CallBack *cb);
static int CDel(struct CallBack *cb, int deletefe);
-static int CDelPtr(register struct FileEntry *fe, register afs_uint32 *cbp, int deletefe);
+static int CDelPtr(register struct FileEntry *fe, register afs_uint32 * cbp,
+ int deletefe);
static afs_uint32 *FindCBPtr(struct FileEntry *fe, struct host *host);
static int FDel(register struct FileEntry *fe);
-static int AddCallBack1_r(struct host *host, AFSFid *fid, afs_uint32 *thead, int type, int locked);
-static void MultiBreakCallBack_r(struct cbstruct cba[], int ncbas, struct AFSCBFids *afidp, struct host *xhost);
-static int MultiBreakVolumeCallBack_r(struct host *host, int isheld, struct VCBParams *parms, int deletefe);
-static int MultiBreakVolumeCallBack(struct host *host, int isheld, struct VCBParams *parms);
-static int MultiBreakVolumeLaterCallBack(struct host *host, int isheld, struct VCBParams *parms);
-static int lih_r(register struct host *host, register int held, register struct host *hostp);
+static int AddCallBack1_r(struct host *host, AFSFid * fid, afs_uint32 * thead,
+ int type, int locked);
+static void MultiBreakCallBack_r(struct cbstruct cba[], int ncbas,
+ struct AFSCBFids *afidp, struct host *xhost);
+static int MultiBreakVolumeCallBack_r(struct host *host, int isheld,
+ struct VCBParams *parms, int deletefe);
+static int MultiBreakVolumeCallBack(struct host *host, int isheld,
+ void *rock);
+static int MultiBreakVolumeLaterCallBack(struct host *host, int isheld,
+ void *rock);
static int GetSomeSpace_r(struct host *hostp, int locked);
+static int ClearHostCallbacks_r(struct host *hp, int locked);
+#endif
#define GetCB() ((struct CallBack *)iGetCB(&cbstuff.nCBs))
#define GetFE() ((struct FileEntry *)iGetFE(&cbstuff.nFEs))
#define FreeCB(cb) iFreeCB((struct CallBack *)cb, &cbstuff.nCBs)
#define FreeFE(fe) iFreeFE((struct FileEntry *)fe, &cbstuff.nFEs)
+
/* Other protos - move out sometime */
-extern void ShutDown();
+void PrintCB(register struct CallBack *cb, afs_uint32 now);
-#define VHASH 512 /* Power of 2 */
-static afs_uint32 HashTable[VHASH]; /* File entry hash table */
-#define VHash(volume, unique) (((volume)+(unique))&(VHASH-1))
+static afs_uint32 HashTable[FEHASH_SIZE]; /* File entry hash table */
-static struct FileEntry *FindFE (register AFSFid *fid)
+static struct FileEntry *
+FindFE(register AFSFid * fid)
{
int hash;
register int fei;
register struct FileEntry *fe;
- hash = VHash(fid->Volume, fid->Unique);
- for (fei=HashTable[hash]; fei; fei = fe->fnext) {
+ hash = FEHash(fid->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)
+ if (fe->volid == fid->Volume && fe->unique == fid->Unique
+ && fe->vnode == fid->Vnode && (fe->status & FE_LATER) != FE_LATER)
return fe;
}
return 0;
#ifndef INTERPRET_DUMP
-static struct CallBack *iGetCB(register int *nused)
+static struct CallBack *
+iGetCB(register int *nused)
{
register struct CallBack *ret;
return ret;
}
-static int iFreeCB(register struct CallBack *cb, register int *nused)
+static int
+iFreeCB(register struct CallBack *cb, register int *nused)
{
((struct object *)cb)->next = (struct object *)CBfree;
CBfree = cb;
return 0;
}
-static struct FileEntry *iGetFE(register int *nused)
+static struct FileEntry *
+iGetFE(register int *nused)
{
register struct FileEntry *ret;
return ret;
}
-static int iFreeFE(register struct FileEntry *fe, register int *nused)
+static int
+iFreeFE(register struct FileEntry *fe, register int *nused)
{
((struct object *)fe)->next = (struct object *)FEfree;
FEfree = fe;
}
/* Add cb to end of specified timeout list */
-static int TAdd(register struct CallBack *cb, register afs_uint32 *thead)
+static int
+TAdd(register struct CallBack *cb, register afs_uint32 * thead)
{
if (!*thead) {
(*thead) = cb->tnext = cb->tprev = cbtoi(cb);
cb->tprev = thp->tprev;
cb->tnext = *thead;
if (thp) {
- if (thp->tprev)
- thp->tprev = (itocb(thp->tprev)->tnext = cbtoi(cb));
- else
- thp->tprev = cbtoi(cb);
+ if (thp->tprev)
+ thp->tprev = (itocb(thp->tprev)->tnext = cbtoi(cb));
+ else
+ thp->tprev = cbtoi(cb);
}
}
cb->thead = ttoi(thead);
}
/* Delete call back entry from timeout list */
-static int TDel(register struct CallBack *cb)
+static int
+TDel(register struct CallBack *cb)
{
register afs_uint32 *thead = itot(cb->thead);
if (*thead == cbtoi(cb))
- *thead = (*thead == cb->tnext? 0: cb->tnext);
- if (itocb(cb->tprev))
- itocb(cb->tprev)->tnext = cb->tnext;
- if (itocb(cb->tnext))
- itocb(cb->tnext)->tprev = cb->tprev;
+ *thead = (*thead == cb->tnext ? 0 : cb->tnext);
+ if (itocb(cb->tprev))
+ itocb(cb->tprev)->tnext = cb->tnext;
+ if (itocb(cb->tnext))
+ itocb(cb->tnext)->tprev = cb->tprev;
return 0;
}
/* Add cb to end of specified host list */
-static int HAdd(register struct CallBack *cb, register struct host *host)
+static int
+HAdd(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);
+ host->cblist = cb->hnext = cb->hprev = cbtoi(cb);
+ } else {
+ register struct CallBack *fcb = itocb(host->cblist);
- cb->hprev = hhp->hprev;
- cb->hnext = host->cblist;
- hhp->hprev = (itocb(hhp->hprev)->hnext = cbtoi(cb));
+ cb->hprev = fcb->hprev;
+ cb->hnext = cbtoi(fcb);
+ fcb->hprev = (itocb(fcb->hprev)->hnext = cbtoi(cb));
}
return 0;
}
/* Delete call back entry from host list */
-static int HDel(register struct CallBack *cb)
+static int
+HDel(register struct CallBack *cb)
{
register afs_uint32 *hhead = &h_itoh(cb->hhead)->cblist;
if (*hhead == cbtoi(cb))
- *hhead = (*hhead == cb->hnext? 0: cb->hnext);
+ *hhead = (*hhead == cb->hnext ? 0 : cb->hnext);
itocb(cb->hprev)->hnext = cb->hnext;
itocb(cb->hnext)->hprev = cb->hprev;
return 0;
/* 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 int CDel(struct CallBack *cb, int deletefe)
+static int
+CDel(struct CallBack *cb, int deletefe)
{
int cbi = cbtoi(cb);
struct FileEntry *fe = itofe(cb->fhead);
register afs_uint32 *cbp;
register int safety;
- for (safety = 0, cbp = &fe->firstcb; *cbp && *cbp != cbi;
+ 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();
- }
+ 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();
+ ShutDownAndCore(PANIC);
+ }
}
CDelPtr(fe, cbp, deletefe);
return 0;
/* 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 int Ccdelpt = 0, CcdelB = 0;
-static int CDelPtr(register struct FileEntry *fe,
- register afs_uint32 *cbp, int deletefe)
+static int
+CDelPtr(register struct FileEntry *fe, register afs_uint32 * cbp,
+ int deletefe)
{
register struct CallBack *cb;
return 0;
Ccdelpt++;
cb = itocb(*cbp);
- if (cb != &CB[*cbp])
+ if (cb != &CB[*cbp])
CcdelB++;
*cbp = cb->cnext;
FreeCB(cb);
- if (deletefe && (--fe->ncbs == 0))
+ if ((--fe->ncbs == 0) && deletefe)
FDel(fe);
return 0;
}
-static afs_uint32 *FindCBPtr(struct FileEntry *fe, struct host *host)
+static afs_uint32 *
+FindCBPtr(struct FileEntry *fe, struct host *host)
{
register afs_uint32 hostindex = h_htoi(host);
register struct CallBack *cb;
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();
+ ViceLog(0, ("FindCBPtr: Internal Error -- shutting down.\n"));
+ DumpCallBackState();
+ ShutDownAndCore(PANIC);
}
cb = itocb(*cbp);
if (cb->hhead == hostindex)
}
/* Delete file entry from hash table */
-static int FDel(register struct FileEntry *fe)
+static int
+FDel(register struct FileEntry *fe)
{
register int fei = fetoi(fe);
- register afs_uint32 *p = &HashTable[VHash(fe->volid, fe->unique)];
+ register afs_uint32 *p = &HashTable[FEHash(fe->volid, fe->unique)];
while (*p && *p != fei)
p = &itofe(*p)->fnext;
return 0;
}
-int InitCallBack(int nblks)
+/* initialize the callback package */
+int
+InitCallBack(int nblks)
{
- H_LOCK
+ H_LOCK;
tfirst = CBtime(FT_ApproxTime());
/* N.B. 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;
+ * FE[0] and CB[0] are not used--and not allocated */
+ FE = ((struct FileEntry *)(calloc(nblks, sizeof(struct FileEntry))));
+ if (!FE) {
+ ViceLog(0, ("Failed malloc in InitCallBack\n"));
+ assert(0);
+ }
+ FE--; /* FE[0] is supposed to point to junk */
cbstuff.nFEs = nblks;
while (cbstuff.nFEs)
- FreeFE(&FE[cbstuff.nFEs]); /* This is correct */
- CB = ((struct CallBack *)(malloc(sizeof(struct CallBack)*nblks)))-1;
+ FreeFE(&FE[cbstuff.nFEs]); /* This is correct */
+ CB = ((struct CallBack *)(calloc(nblks, sizeof(struct CallBack))));
+ if (!CB) {
+ ViceLog(0, ("Failed malloc in InitCallBack\n"));
+ assert(0);
+ }
+ CB--; /* CB[0] is supposed to point to junk */
cbstuff.nCBs = nblks;
while (cbstuff.nCBs)
- FreeCB(&CB[cbstuff.nCBs]); /* This is correct */
+ FreeCB(&CB[cbstuff.nCBs]); /* This is correct */
cbstuff.nblks = nblks;
cbstuff.nbreakers = 0;
- H_UNLOCK
+ H_UNLOCK;
return 0;
}
-afs_int32 XCallBackBulk_r(struct host *ahost, struct AFSFid *fids,
- afs_int32 nfids)
+afs_int32
+XCallBackBulk_r(struct host * ahost, struct AFSFid * fids, afs_int32 nfids)
{
struct AFSCallBack tcbs[AFSCBMAX];
register int i;
struct AFSCBs tc;
int code;
int j;
+ struct rx_connection *cb_conn = NULL;
#ifdef ADAPT_MTU
- rx_SetConnDeadTime(ahost->callback_rxcon, 4);
+ rx_SetConnDeadTime(ahost->callback_rxcon, 4);
rx_SetConnHardDeadTime(ahost->callback_rxcon, AFS_HARDDEADTIME);
#endif
j = 0;
while (nfids > 0) {
- for(i=0;i<nfids && i < AFSCBMAX;i++) {
- tcbs[i].CallBackVersion = CALLBACK_VERSION;
- tcbs[i].ExpirationTime = 0;
- tcbs[i].CallBackType = CB_DROPPED;
- }
- tf.AFSCBFids_len = i;
- tf.AFSCBFids_val = &(fids[j]);
- nfids -= i;
- j += i;
- tc.AFSCBs_len = i;
- tc.AFSCBs_val = tcbs;
-
- H_UNLOCK
- code |= RXAFSCB_CallBack(ahost->callback_rxcon, &tf, &tc);
- H_LOCK
+ for (i = 0; i < nfids && i < AFSCBMAX; i++) {
+ tcbs[i].CallBackVersion = CALLBACK_VERSION;
+ tcbs[i].ExpirationTime = 0;
+ tcbs[i].CallBackType = CB_DROPPED;
+ }
+ tf.AFSCBFids_len = i;
+ tf.AFSCBFids_val = &(fids[j]);
+ nfids -= i;
+ j += i;
+ tc.AFSCBs_len = i;
+ tc.AFSCBs_val = tcbs;
+
+ cb_conn = ahost->callback_rxcon;
+ rx_GetConnection(cb_conn);
+ H_UNLOCK;
+ code |= RXAFSCB_CallBack(cb_conn, &tf, &tc);
+ rx_PutConnection(cb_conn);
+ cb_conn = NULL;
+ H_LOCK;
}
return code;
* 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(struct host *host, AFSFid *fid, afs_uint32 *thead,
- int type, int locked)
+int
+AddCallBack1(struct host *host, AFSFid * fid, afs_uint32 * thead, int type,
+ int locked)
{
int retVal;
- H_LOCK
- if ( !locked ) {
+ H_LOCK;
+ if (!locked) {
h_Lock_r(host);
}
retVal = AddCallBack1_r(host, fid, thead, type, 1);
- if ( !locked ) {
+ if (!locked) {
h_Unlock_r(host);
}
- H_UNLOCK
+ H_UNLOCK;
return retVal;
}
-static int AddCallBack1_r(struct host *host, AFSFid *fid, afs_uint32 *thead,
- int type, int locked)
+static int
+AddCallBack1_r(struct host *host, AFSFid * fid, afs_uint32 * thead, int type,
+ int locked)
{
struct FileEntry *fe;
struct CallBack *cb = 0, *lastcb = 0;
struct FileEntry *newfe = 0;
- afs_uint32 time_out;
+ afs_uint32 time_out = 0;
afs_uint32 *Thead = thead;
struct CallBack *newcb = 0;
int safety;
-
+
+ cbstuff.AddCallBacks++;
+
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... */
+ * 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);
+ 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 */
+ 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);
+ 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);
+ } 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)));
+ } 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));
}
fe = newfe;
newfe = NULL;
fe->firstcb = 0;
- fe->volid = fid->Volume;
+ fe->volid = fid->Volume;
fe->vnode = fid->Vnode;
fe->unique = fid->Unique;
fe->ncbs = 0;
- hash = VHash(fid->Volume, fid->Unique);
+ fe->status = 0;
+ hash = FEHash(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();
+ ViceLog(0, ("AddCallBack1: Internal Error -- shutting down.\n"));
+ DumpCallBackState();
+ ShutDownAndCore(PANIC);
}
if (cb->hhead == h_htoi(host))
break;
}
- if (cb) {/* Already have call back: move to new timeout list */
+ 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;
TDel(cb);
TAdd(cb, Thead);
}
+ if (newfe == NULL) { /* we are using the new FE */
+ fe->firstcb = cbtoi(cb);
+ fe->ncbs++;
+ cb->fhead = fetoi(fe);
+ }
} else {
cb = newcb;
newcb = NULL;
- *(lastcb?&lastcb->cnext:&fe->firstcb) = cbtoi(cb);
+ *(lastcb ? &lastcb->cnext : &fe->firstcb) = cbtoi(cb);
fe->ncbs++;
cb->cnext = 0;
cb->fhead = fetoi(fe);
}
/* now free any still-unused callback or host entries */
- if (newcb) FreeCB(newcb);
- if (newfe) FreeFE(newfe);
+ if (newcb)
+ FreeCB(newcb);
+ if (newfe)
+ FreeFE(newfe);
- if (!locked) /* freecb and freefe might(?) yield */
+ 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 */
+ if (type == CB_NORMAL || type == CB_VOLUME || type == CB_BULK)
+ return time_out - ServerBias; /* Expires sooner at workstation */
return 0;
}
+static int
+CompareCBA(const void *e1, const void *e2)
+{
+ const struct cbstruct *cba1 = (const struct cbstruct *)e1;
+ const struct cbstruct *cba2 = (const struct cbstruct *)e2;
+ return ((cba1->hp)->index - (cba2->hp)->index);
+}
+
/* 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.
* 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(struct cbstruct cba[], int ncbas,
- struct AFSCBFids *afidp, struct host *xhost)
+static void
+MultiBreakCallBack_r(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};
+ int i, j;
+ struct rx_connection *conns[MAX_CB_HOSTS];
+ static struct AFSCBs tc = { 0, 0 };
+ int multi_to_cba_map[MAX_CB_HOSTS];
- assert(ncbas <= MAX_CB_HOSTS);
+ assert(ncbas <= MAX_CB_HOSTS);
+
+ /* sort cba list to avoid makecall issues */
+ qsort(cba, ncbas, sizeof(struct cbstruct), CompareCBA);
+
+ /* set up conns for multi-call */
+ for (i = 0, j = 0; i < ncbas; i++) {
+ struct host *thishost = cba[i].hp;
+ if (!thishost || (thishost->hostFlags & HOSTDELETED)) {
+ continue;
+ }
+ rx_GetConnection(thishost->callback_rxcon);
+ multi_to_cba_map[j] = i;
+ conns[j++] = thishost->callback_rxcon;
- /* set up conns for multi-call */
- for (i=0,j=0; i<ncbas; i++) {
- struct host *thishost = cba[i].hp;
- if (!thishost || (thishost->hostFlags & HOSTDELETED)) {
- continue;
- }
- conns[j++] = thishost->callback_rxcon;
-
#ifdef ADAPT_MTU
- rx_SetConnDeadTime (thishost->callback_rxcon, 4);
- rx_SetConnHardDeadTime (thishost->callback_rxcon, AFS_HARDDEADTIME);
+ 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) {
- afs_uint32 idx ;
- struct host *hp;
- char hoststr[16];
-
- 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;i<j;i++) {
- hp = cba[i].hp; /* optimistic, but usually right */
- if (!hp) {
- break;
- }
- if (conns[multi_i] == hp->callback_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 %s:%d is down\n",
- afidp->AFSCBFids_val->Volume, afidp->AFSCBFids_val->Vnode,
- afidp->AFSCBFids_val->Unique, afs_inet_ntoa_r(hp->host,hoststr), hp->port));
- }
+ }
- H_LOCK
- h_Lock_r(hp);
- hp->hostFlags |= VENUSDOWN;
- /**
+ 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) {
+ afs_uint32 idx;
+ struct host *hp;
+ char hoststr[16];
+
+ i = multi_to_cba_map[multi_i];
+ hp = cba[i].hp;
+ idx = cba[i].thead;
+
+ if (!hp || !idx) {
+ ViceLog(0,
+ ("BCB: INTERNAL ERROR: hp=%x, cba=%x, thead=%u\n",
+ hp, cba, idx));
+ } else {
+ /*
+ ** try breaking callbacks on alternate interface addresses
+ */
+ if (MultiBreakCallBackAlternateAddress(hp, afidp)) {
+ if (ShowProblems) {
+ ViceLog(7,
+ ("BCB: Failed on file %u.%u.%u, Host %x (%s:%d) is down\n",
+ afidp->AFSCBFids_val->Volume,
+ afidp->AFSCBFids_val->Vnode,
+ afidp->AFSCBFids_val->Unique,
+ hp,
+ afs_inet_ntoa_r(hp->host, hoststr),
+ ntohs(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
+ 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; i < ncbas; i++) {
+ struct host *hp;
+ hp = cba[i].hp;
+ if (hp && xhost != hp) {
+ h_Release_r(hp);
}
- }
}
- } multi_End;
- H_LOCK
- cbstuff.nbreakers--;
- }
-
- for (i=0; i<ncbas; i++) {
- struct host *hp;
- hp = cba[i].hp;
- if (hp && xhost != hp)
- h_Release_r(hp);
- }
- return;
+ /* H_UNLOCK around this so h_FreeConnection does not deadlock.
+ h_FreeConnection should *never* be called on a callback connection,
+ but on 10/27/04 a deadlock occurred where it was, when we know why,
+ this should be reverted. -- shadow */
+ H_UNLOCK;
+ for (i = 0; i < j; i++) {
+ rx_PutConnection(conns[i]);
+ }
+ H_LOCK;
+
+ return;
}
/*
* relatively harmless even when it does occur, so we don't check for it now.
*/
/* if flag is true, send a break callback msg to "host", too */
-int BreakCallBack(struct host *xhost, AFSFid *fid, int flag)
+int
+BreakCallBack(struct host *xhost, AFSFid * fid, int flag)
{
struct FileEntry *fe;
struct CallBack *cb, *nextcb;
struct cbstruct cba[MAX_CB_HOSTS];
int ncbas;
- struct rx_connection *conns[MAX_CB_HOSTS];
struct AFSCBFids tf;
int hostindex;
char hoststr[16];
- ViceLog(7,("BCB: BreakCallBack(all but %s:%d, (%u,%d,%d))\n",
- afs_inet_ntoa_r(xhost->host,hoststr), xhost->port, fid->Volume, fid->Vnode,
- fid->Unique));
+ ViceLog(7,
+ ("BCB: BreakCallBack(Host %x all but %s:%d, (%u,%u,%u))\n",
+ xhost, afs_inet_ntoa_r(xhost->host, hoststr), ntohs(xhost->port),
+ fid->Volume, fid->Vnode, fid->Unique));
- H_LOCK
-
- cbstuff.BreakCallBacks++;
+ H_LOCK;
+ cbstuff.BreakCallBacks++;
fe = FindFE(fid);
if (!fe) {
- goto done;
+ 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;
+ /* the most common case is what follows the || */
+ goto done;
}
tf.AFSCBFids_len = 1;
tf.AFSCBFids_val = fid;
- for(;cb;) {
- for (ncbas=0; cb && ncbas<MAX_CB_HOSTS; cb=nextcb) {
- nextcb = itocb(cb->cnext);
- 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: %s:%d is down; delaying break call back\n",
- afs_inet_ntoa_r(thishost->host,hoststr), 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, 1); /* Usually first; so this delete
- is reasonably inexpensive */
- }
+ for (; cb;) {
+ for (ncbas = 0; cb && ncbas < MAX_CB_HOSTS; cb = nextcb) {
+ nextcb = itocb(cb->cnext);
+ 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 (%s:%d) is down; delaying break call back\n",
+ thishost, afs_inet_ntoa_r(thishost->host, hoststr),
+ ntohs(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, 1); /* 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;
+ }
}
- }
-
- 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
+ H_UNLOCK;
return 0;
}
/* Delete (do not break) single call back for fid */
-int DeleteCallBack(struct host *host, AFSFid *fid)
+int
+DeleteCallBack(struct host *host, AFSFid * fid)
{
register struct FileEntry *fe;
register afs_uint32 *pcb;
char hoststr[16];
+ H_LOCK;
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));
+ h_Unlock_r(host);
+ H_UNLOCK;
+ ViceLog(8,
+ ("DCB: No call backs for fid (%u, %u, %u)\n", fid->Volume,
+ fid->Vnode, fid->Unique));
return 0;
}
pcb = FindCBPtr(fe, host);
if (!*pcb) {
- ViceLog(8,("DCB: No call back for host %s:%d, (%u, %d, %d)\n",
- afs_inet_ntoa_r(host->host,hoststr), host->port, fid->Volume, fid->Vnode, fid->Unique));
+ ViceLog(8,
+ ("DCB: No call back for host %x (%s:%d), (%u, %u, %u)\n",
+ host, afs_inet_ntoa_r(host->host, hoststr), ntohs(host->port),
+ fid->Volume, fid->Vnode, fid->Unique));
h_Unlock_r(host);
- H_UNLOCK
+ H_UNLOCK;
return 0;
}
HDel(itocb(*pcb));
TDel(itocb(*pcb));
CDelPtr(fe, pcb, 1);
h_Unlock_r(host);
- H_UNLOCK
+ H_UNLOCK;
return 0;
}
* since we're not adding callbacks, but deleting them. I'm not sure
* why it doesn't set the lock, however; perhaps it should.
*/
-int DeleteFileCallBacks(AFSFid *fid)
+int
+DeleteFileCallBacks(AFSFid * fid)
{
register struct FileEntry *fe;
register struct CallBack *cb;
register afs_uint32 cbi;
register int n;
- H_LOCK
+ 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));
+ H_UNLOCK;
+ ViceLog(8,
+ ("DF: No fid (%u,%u,%u) to delete\n", fid->Volume, fid->Vnode,
+ fid->Unique));
return 0;
}
- for (n=0,cbi = fe->firstcb; cbi; n++) {
+ for (n = 0, cbi = fe->firstcb; cbi; n++) {
cb = itocb(cbi);
cbi = cb->cnext;
TDel(cb);
HDel(cb);
FreeCB(cb);
+ fe->ncbs--;
}
FDel(fe);
- H_UNLOCK
+ H_UNLOCK;
return 0;
}
/* Delete (do not break) all call backs for host. The host should be
* locked. */
-int DeleteAllCallBacks_r(struct host *host, int deletefe)
+int
+DeleteAllCallBacks_r(struct host *host, int deletefe)
{
register struct CallBack *cb;
register int cbi, first;
cbstuff.DeleteAllCallBacks++;
cbi = first = host->cblist;
if (!cbi) {
- ViceLog(8,("DV: no call backs\n"));
+ ViceLog(8, ("DV: no call backs\n"));
return 0;
}
- do {
+ do {
cb = itocb(cbi);
cbi = cb->hnext;
TDel(cb);
* successfully broken; 0 otherwise. Assumes host is h_Held and h_Locked.
* Must be called with VenusDown set for this host
*/
-int BreakDelayedCallBacks(struct host *host)
+int
+BreakDelayedCallBacks(struct host *host)
{
int retVal;
- H_LOCK
+ H_LOCK;
retVal = BreakDelayedCallBacks_r(host);
- H_UNLOCK
+ H_UNLOCK;
return retVal;
}
-int BreakDelayedCallBacks_r(struct host *host)
+int
+BreakDelayedCallBacks_r(struct host *host)
{
struct AFSFid fids[AFSCBMAX];
- u_byte thead[AFSCBMAX]; /* This should match thead in struct Callback */
+ u_byte thead[AFSCBMAX]; /* This should match thead in struct Callback */
int cbi, first, nfids;
struct CallBack *cb;
- struct interfaceAddr interf;
int code;
char hoststr[16];
+ struct rx_connection *cb_conn;
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
+ host->hostFlags &= ~ALTADDR; /* alternate addresses are invalid */
+ cb_conn = host->callback_rxcon;
+ rx_GetConnection(cb_conn);
+ if (host->interface) {
+ H_UNLOCK;
+ code =
+ RXAFSCB_InitCallBackState3(cb_conn, &FS_HostUUID);
} else {
- H_UNLOCK
- code = RXAFSCB_InitCallBackState(host->callback_rxcon);
- H_LOCK
- }
- host->hostFlags |= ALTADDR; /* alternate addresses are valid */
+ H_UNLOCK;
+ code = RXAFSCB_InitCallBackState(cb_conn);
+ }
+ rx_PutConnection(cb_conn);
+ cb_conn = NULL;
+ 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 %s:%d\n",
- afs_inet_ntoa_r(host->host,hoststr), host->port));
- }
+ ("CB: Call back connect back failed (in break delayed) for Host %x (%s:%d)\n",
+ host, afs_inet_ntoa_r(host->host, hoststr),
+ ntohs(host->port)));
+ }
host->hostFlags |= VENUSDOWN;
- }
- else {
- ViceLog(25,("InitCallBackState success on %s\n",afs_inet_ntoa_r(host->host,hoststr)));
+ } else {
+ ViceLog(25,
+ ("InitCallBackState success on %x (%s:%d)\n",
+ host, afs_inet_ntoa_r(host->host, hoststr), ntohs(host->port)));
/* 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, 1);
- }
- } while (cbi && cbi != first && nfids < AFSCBMAX);
-
- if (nfids==0) {
- break;
- }
+ } 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, 1);
+ }
+ } while (cbi && cbi != first && nfids < AFSCBMAX);
- 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=%s:%d; callback list follows:\n",
- afs_inet_ntoa_r(host->host,hoststr), host->port));
+ if (nfids == 0) {
+ break;
}
- for (i = 0; i<nfids; i++) {
+
+ if (XCallBackBulk_r(host, fids, nfids)) {
+ /* Failed, again: put them back, probably with old
+ * timeout values */
+ int i;
if (ShowProblems) {
ViceLog(0,
- ("CB: Host %s:%d, file %u.%u.%u (part of bulk callback)\n",
- afs_inet_ntoa_r(host->host,hoststr), host->port,
- fids[i].Volume, fids[i].Vnode, fids[i].Unique));
+ ("CB: XCallBackBulk failed, Host %x (%s:%d); callback list follows:\n",
+ host, afs_inet_ntoa_r(host->host, hoststr),
+ ntohs(host->port)));
}
- /* 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. */
+ for (i = 0; i < nfids; i++) {
+ if (ShowProblems) {
+ ViceLog(0,
+ ("CB: Host %x (%s:%d), file %u.%u.%u (part of bulk callback)\n",
+ host, afs_inet_ntoa_r(host->host, hoststr),
+ ntohs(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;
}
- host->hostFlags |= VENUSDOWN; /* Failed */
- ClearHostCallbacks_r(host, 1/* locked */);
- nfids = 0;
- break;
+ if (nfids < AFSCBMAX)
+ break;
}
- if (nfids < AFSCBMAX)
- break;
- }
cbstuff.nbreakers--;
/* If we succeeded it's always ok to unset HFE_LATER */
- if (!host->hostFlags & VENUSDOWN)
+ if (!(host->hostFlags & VENUSDOWN))
host->hostFlags &= ~HFE_LATER;
return (host->hostFlags & VENUSDOWN);
}
** 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(struct host *host,
- int isheld, struct VCBParams *parms, int deletefe)
+static int
+MultiBreakVolumeCallBack_r(struct host *host, int isheld,
+ struct VCBParams *parms, int deletefe)
{
char hoststr[16];
- 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 (!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 */
+ return 0; /* Release hold */
}
- ViceLog(8,("BVCB: volume call back for host %s:%d failed\n",
- afs_inet_ntoa_r(host->host,hoststr),host->port));
+ ViceLog(8,
+ ("BVCB: volume call back for Host %x (%s:%d) failed\n",
+ host, afs_inet_ntoa_r(host->host, hoststr), ntohs(host->port)));
if (ShowProblems) {
- ViceLog(0, ("CB: volume callback for host %s:%d failed\n",
- afs_inet_ntoa_r(host->host,hoststr), host->port));
+ ViceLog(0,
+ ("CB: volume callback for Host %x (%s:%d) failed\n",
+ host, afs_inet_ntoa_r(host->host, hoststr),
+ ntohs(host->port)));
}
- DeleteAllCallBacks_r(host, deletefe); /* Delete all callback state
- rather than attempting to
- selectively remember to
- delete the volume callbacks
- later */
- host->hostFlags &= ~RESETDONE; /* Do InitCallBackState when host returns */
+ DeleteAllCallBacks_r(host, deletefe); /* 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 */
+ 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;
- }
+ ** 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. */
+ 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(struct host *host, int isheld,
- struct VCBParams *parms)
+static int
+MultiBreakVolumeCallBack(struct host *host, int isheld, void *rock)
{
+ struct VCBParams *parms = (struct VCBParams *) rock;
+
int retval;
- H_LOCK
+ H_LOCK;
retval = MultiBreakVolumeCallBack_r(host, isheld, parms, 1);
- H_UNLOCK
+ H_UNLOCK;
return retval;
}
** isheld is 0 if the host is held in h_Enumerate
** isheld is 1 if the host is held in BreakVolumeCallBacks
*/
-static int MultiBreakVolumeLaterCallBack(struct host *host, int isheld,
- struct VCBParams *parms)
+static int
+MultiBreakVolumeLaterCallBack(struct host *host, int isheld, void *rock)
{
+ struct VCBParams *parms = (struct VCBParams *)rock;
int retval;
- H_LOCK
+ H_LOCK;
retval = MultiBreakVolumeCallBack_r(host, isheld, parms, 0);
- H_UNLOCK
+ H_UNLOCK;
return retval;
}
* a delayed callback. Resets will be forced if the host is
* determined to be down before the RPC is executed.
*/
-int BreakVolumeCallBacks(afs_uint32 volume)
+int
+BreakVolumeCallBacks(afs_uint32 volume)
{
struct AFSFid fid;
int hash;
struct FileEntry *fe;
struct host *host;
struct VCBParams henumParms;
- afs_uint32 tthead = 0; /* zero is illegal value */
+ afs_uint32 tthead = 0; /* zero is illegal value */
- H_LOCK
+ H_LOCK;
fid.Volume = volume, fid.Vnode = fid.Unique = 0;
- for (hash=0; hash<VHASH; hash++) {
- for (feip = &HashTable[hash]; (fe = itofe(*feip)); ) {
+ for (hash = 0; hash < FEHASH_SIZE; hash++) {
+ for (feip = &HashTable[hash]; (fe = itofe(*feip));) {
if (fe->volid == volume) {
register struct CallBack *cbnext;
for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
h_Hold_r(host);
cbnext = itocb(cb->cnext);
if (!tthead || (TNorm(tthead) < TNorm(cb->thead))) {
- tthead = cb->thead;
+ tthead = cb->thead;
}
TDel(cb);
HDel(cb);
}
if (!tthead) {
- /* didn't find any callbacks, so return right away. */
- H_UNLOCK
- return 0;
+ /* 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
+ H_UNLOCK;
+ h_Enumerate(MultiBreakVolumeCallBack, &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;
}
extern char fsync_wait[];
#endif
-int BreakVolumeCallBacksLater(afs_uint32 volume)
+int
+BreakVolumeCallBacksLater(afs_uint32 volume)
{
int hash;
- afs_int32 *feip;
+ afs_uint32 *feip;
struct FileEntry *fe;
struct CallBack *cb;
struct host *host;
int found = 0;
- ViceLog(25, ("Setting later on volume %d\n", volume));
- H_LOCK
- for (hash=0; hash<VHASH; hash++) {
- for (feip = &HashTable[hash]; fe = itofe(*feip); ) {
+ ViceLog(25, ("Setting later on volume %u\n", volume));
+ H_LOCK;
+ for (hash = 0; hash < FEHASH_SIZE; hash++) {
+ for (feip = &HashTable[hash]; (fe = itofe(*feip)) != NULL; ) {
if (fe->volid == volume) {
register struct CallBack *cbnext;
- for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
+ for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
host = h_itoh(cb->hhead);
host->hostFlags |= HFE_LATER;
cb->status = CB_DELAYED;
- cbnext = itocb(cb->cnext);
- }
- FSYNC_LOCK
+ cbnext = itocb(cb->cnext);
+ }
+ FSYNC_LOCK;
fe->status |= FE_LATER;
- FSYNC_UNLOCK
- found++;
+ FSYNC_UNLOCK;
+ found = 1;
}
feip = &fe->fnext;
}
}
- H_UNLOCK
-
+ H_UNLOCK;
if (!found) {
/* didn't find any callbacks, so return right away. */
return 0;
ViceLog(25, ("Fsync thread wakeup\n"));
#ifdef AFS_PTHREAD_ENV
+ FSYNC_LOCK;
assert(pthread_cond_broadcast(&fsync_cond) == 0);
+ FSYNC_UNLOCK;
#else
- LWP_NoYieldSignal(&fsync_wait);
+ LWP_NoYieldSignal(fsync_wait);
#endif
return 0;
}
-int BreakLaterCallBacks(void)
+int
+BreakLaterCallBacks(void)
{
struct AFSFid fid;
int hash;
- afs_int32 *feip;
+ afs_uint32 *feip;
struct CallBack *cb;
struct FileEntry *fe = NULL;
struct FileEntry *myfe = NULL;
- struct FileEntry **fepp;
struct host *host;
struct VCBParams henumParms;
- unsigned short tthead = 0; /* zero is illegal value */
-
+ unsigned short tthead = 0; /* zero is illegal value */
+ char hoststr[16];
+
/* Unchain first */
ViceLog(25, ("Looking for FileEntries to unchain\n"));
- H_LOCK
-restart:
- tthead = 0;
- for (hash=0; hash<VHASH; hash++) {
- for (feip = &HashTable[hash]; fe = itofe(*feip); ) {
- if (fe && fe->status & FE_LATER) {
- ViceLog(125, ("Unchaining for %d:%d:%d\n", fe->vnode,
- fe->unique, fe->volid));
+ H_LOCK;
+ FSYNC_LOCK;
+ /* Pick the first volume we see to clean up */
+ fid.Volume = fid.Vnode = fid.Unique = 0;
+
+ for (hash = 0; hash < FEHASH_SIZE; hash++) {
+ for (feip = &HashTable[hash]; (fe = itofe(*feip)) != NULL; ) {
+ if (fe && (fe->status & FE_LATER)
+ && (fid.Volume == 0 || fid.Volume == fe->volid)) {
+ /* Ugly, but used to avoid left side casting */
+ struct object *tmpfe;
+ ViceLog(125,
+ ("Unchaining for %u:%u:%u\n", fe->vnode, fe->unique,
+ fe->volid));
+ fid.Volume = fe->volid;
*feip = fe->fnext;
/* Works since volid is deeper than the largest pointer */
- ((struct object *)fe)->next = (struct object *)myfe;
+ tmpfe = (struct object *)fe;
+ tmpfe->next = (struct object *)myfe;
myfe = fe;
- } else {
+ } else
feip = &fe->fnext;
- }
}
}
-
+ FSYNC_UNLOCK;
+
if (!myfe) {
- H_UNLOCK
- return 0;
- }
-
- /* loop over myfe and free/break */
- FSYNC_UNLOCK
- while (myfe) {
- /* Clear for next pass */
- fid.Volume = 0, fid.Vnode = fid.Unique = 0;
- tthead = 0;
- for (fepp = &myfe; fe = *fepp; ) {
- /* Pick up first volid we see and break callbacks for it */
- if (fid.Volume == 0 || fid.Volume == fe->volid) {
- register struct CallBack *cbnext;
- ViceLog(125, ("Caught volume %d for breaking\n", fe->volid));
- fid.Volume = fe->volid;
- 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 */
+ H_UNLOCK;
+ return 0;
+ }
+
+ /* loop over FEs from myfe and free/break */
+ tthead = 0;
+ for (fe = myfe; fe;) {
+ register struct CallBack *cbnext;
+ for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
+ cbnext = itocb(cb->cnext);
+ host = h_itoh(cb->hhead);
+ if (cb->status == CB_DELAYED) {
+ h_Hold_r(host);
+ if (!tthead || (TNorm(tthead) < TNorm(cb->thead))) {
+ tthead = cb->thead;
}
- /* relink chain */
- (struct object *) *fepp = ((struct object *)fe)->next;
- FreeFE(fe);
+ TDel(cb);
+ HDel(cb);
+ CDel(cb, 0); /* Don't let CDel clean up the fe */
+ /* leave hold for MultiBreakVolumeCallBack to clear */
} else {
- (struct object **) fepp = &(((struct object *)fe)->next);
+ ViceLog(125,
+ ("Found host %x (%s:%d) non-DELAYED cb for %u:%u:%u\n",
+ host, afs_inet_ntoa_r(host->host, hoststr),
+ ntohs(host->port), fe->vnode, fe->unique, fe->volid));
}
}
+ myfe = fe;
+ fe = (struct FileEntry *)((struct object *)fe)->next;
+ FreeFE(myfe);
+ }
- if (tthead) {
- ViceLog(125, ("Breaking volume %d\n", fid.Volume));
+ if (tthead) {
+ ViceLog(125, ("Breaking volume %u\n", fid.Volume));
+ henumParms.ncbas = 0;
+ henumParms.fid = &fid;
+ henumParms.thead = tthead;
+ H_UNLOCK;
+ h_Enumerate(MultiBreakVolumeLaterCallBack, (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;
- henumParms.fid = &fid;
- henumParms.thead = tthead;
- H_UNLOCK
- h_Enumerate(MultiBreakVolumeLaterCallBack, (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;
- }
- }
+ }
}
- FSYNC_LOCK
-
- if (tthead) goto restart;
- H_UNLOCK
+ H_UNLOCK;
+ /* Arrange to be called again */
return 1;
}
* Delete all timed-out call back entries (to be called periodically by file
* server)
*/
-int CleanupTimedOutCallBacks(void)
+int
+CleanupTimedOutCallBacks(void)
{
- H_LOCK
+ H_LOCK;
CleanupTimedOutCallBacks_r();
- H_UNLOCK
+ H_UNLOCK;
+ return 0;
}
-int CleanupTimedOutCallBacks_r(void)
+int
+CleanupTimedOutCallBacks_r(void)
{
afs_uint32 now = CBtime(FT_ApproxTime());
register afs_uint32 *thead;
do {
cb = itocb(cbi);
cbi = cb->tnext;
- ViceLog(8,("CCB: deleting timed out call back %s:%d, (%u,%u,%u)\n",
- afs_inet_ntoa_r(h_itoh(cb->hhead)->host, hoststr), h_itoh(cb->hhead)->port,
- itofe(cb->fhead)->volid, itofe(cb->fhead)->vnode,
- itofe(cb->fhead)->unique));
+ ViceLog(8,
+ ("CCB: deleting timed out call back %x (%s:%d), (%u,%u,%u)\n",
+ h_itoh(cb->hhead)->host,
+ afs_inet_ntoa_r(h_itoh(cb->hhead)->host, hoststr),
+ h_itoh(cb->hhead)->port, itofe(cb->fhead)->volid,
+ itofe(cb->fhead)->vnode, itofe(cb->fhead)->unique));
HDel(cb);
CDel(cb, 1);
ntimedout++;
if (ntimedout > cbstuff.nblks) {
- ViceLog(0,("CCB: Internal Error -- shutting down...\n"));
- DumpCallBackState();
- ShutDown();
+ ViceLog(0, ("CCB: Internal Error -- shutting down...\n"));
+ DumpCallBackState();
+ ShutDownAndCore(PANIC);
}
} while (cbi != *thead);
*thead = 0;
tfirst++;
}
cbstuff.CBsTimedOut += ntimedout;
- ViceLog(7,("CCB: deleted %d timed out callbacks\n", ntimedout));
+ ViceLog(7, ("CCB: deleted %d timed out callbacks\n", ntimedout));
return (ntimedout > 0);
}
static struct host *lih_host;
+static int lih_host_held;
-static int lih_r(register struct host *host, register int held,
- register struct host *hostp)
+/* This version does not allow 'host' to be selected unless its ActiveCall
+ * is newer than 'hostp' which is the host with the oldest ActiveCall from
+ * the last pass (if it is provided). We filter out any hosts that are
+ * are held by other threads.
+ */
+static int
+lih0_r(register struct host *host, register int held, void *rock)
+{
+ struct host *hostp = (struct host *) rock;
+ if (host->cblist
+ && (hostp && host != hostp)
+ && (!held && !h_OtherHolds_r(host))
+ && (!lih_host || host->ActiveCall < lih_host->ActiveCall)
+ && (!hostp || host->ActiveCall > hostp->ActiveCall)) {
+ if (lih_host != NULL && lih_host_held) {
+ h_Release_r(lih_host);
+ }
+ lih_host = host;
+ lih_host_held = !held;
+ held = 1;
+ }
+ return held;
+}
+
+/* This version does not allow 'host' to be selected unless its ActiveCall
+ * is newer than 'hostp' which is the host with the oldest ActiveCall from
+ * the last pass (if it is provided). In this second varient, we do not
+ * prevent held hosts from being selected.
+ */
+static int
+lih1_r(register struct host *host, register int held, void *rock)
{
+ struct host *hostp = (struct host *) rock;
+
if (host->cblist
- && ((hostp && host != hostp) || (!held && !h_OtherHolds_r(host)))
- && (!lih_host || host->ActiveCall < lih_host->ActiveCall) ) {
+ && (hostp && host != hostp)
+ && (!lih_host || host->ActiveCall < lih_host->ActiveCall)
+ && (!hostp || host->ActiveCall > hostp->ActiveCall)) {
+ if (lih_host != NULL && lih_host_held) {
+ h_Release_r(lih_host);
+ }
lih_host = host;
+ lih_host_held = !held;
+ held = 1;
}
return held;
}
/* 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" */
+/* first pass: sequentially find the oldest host which isn't held by
+ anyone for which we can clear callbacks;
+ skipping 'hostp' */
+/* second pass: sequentially find the oldest host regardless of
+ whether or not the host is held; skipping 'hostp' */
+/* third pass: attempt to clear callbacks from 'hostp' */
/* always called with hostp unlocked */
+
+/* Note: hostlist is ordered most recently created host first and
+ * its order has no relationship to the most recently used. */
extern struct host *hostList;
-static int GetSomeSpace_r(struct host *hostp, int locked)
+static int
+GetSomeSpace_r(struct host *hostp, int locked)
{
- register struct host *hp, *hp1 = (struct host *)0, *hp2 = hostList;
- int i=0;
+ register struct host *hp, *hp1, *hp2;
+ int i = 0;
cbstuff.GotSomeSpaces++;
- ViceLog(5,("GSS: First looking for timed out call backs via CleanupCallBacks\n"));
+ ViceLog(5,
+ ("GSS: First looking for timed out call backs via CleanupCallBacks\n"));
if (CleanupTimedOutCallBacks_r()) {
cbstuff.GSS3++;
return 0;
}
+
+ i = 0;
+ hp1 = NULL;
+ hp2 = hostList;
do {
lih_host = 0;
- h_Enumerate_r(lih_r, hp2, (char *)hp1);
+ h_Enumerate_r(i == 0 ? lih0_r : lih1_r, hp2, (char *)hp1);
hp = lih_host;
if (hp) {
+ /* set in lih_r! private copy before giving up H_LOCK */
+ int lih_host_held2=lih_host_held;
cbstuff.GSS4++;
- if ( ! ClearHostCallbacks_r(hp, 0 /* not locked or held */) )
+ if ((hp != hostp) && !ClearHostCallbacks_r(hp, 0 /* not locked or held */ )) {
+ if (lih_host_held2)
+ h_Release_r(hp);
return 0;
- hp2 = hp->next;
- } else {
+ }
+ if (lih_host_held2)
+ h_Release_r(hp);
+ hp1 = hp;
hp2 = hostList;
- hp1 = hostp;
- cbstuff.GSS1++;
- ViceLog(5,("GSS: Try harder for longest inactive host cnt= %d\n", i));
+ } else {
/*
* Next time try getting callbacks from any host even if
* it's deleted (that's actually great since we can freely
* callback timeout arrives).
*/
i++;
+ hp1 = NULL;
+ hp2 = hostList;
+ cbstuff.GSS1++;
+ ViceLog(5,
+ ("GSS: Try harder for longest inactive host cnt= %d\n",
+ 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. */
+
+ /* Could not obtain space from other hosts, clear hostp's callback state */
cbstuff.GSS2++;
if (!locked) {
- h_Lock_r(hostp);
+ h_Lock_r(hostp);
}
- ClearHostCallbacks_r(hostp, 1/*already locked*/);
+ ClearHostCallbacks_r(hostp, 1 /*already locked */ );
if (!locked) {
- h_Unlock_r(hostp);
+ h_Unlock_r(hostp);
}
return 0;
}
/* locked - set if caller has already locked the host */
-int ClearHostCallbacks(struct host *hp, int locked)
-{
- int retVal;
- H_LOCK
- retVal = ClearHostCallbacks_r(hp, locked);
- H_UNLOCK
- return retVal;
-}
-
-/* locked - set if caller has already locked the host */
-int ClearHostCallbacks_r(struct host *hp, int locked)
+static int
+ClearHostCallbacks_r(struct host *hp, int locked)
{
- struct interfaceAddr interf;
int code;
int held = 0;
char hoststr[16];
+ struct rx_connection *cb_conn = NULL;
- ViceLog(5,("GSS: Delete longest inactive host %s\n", afs_inet_ntoa_r(hp->host,hoststr)));
- if ( !(held = h_Held_r(hp)) )
+ ViceLog(5,
+ ("GSS: Delete longest inactive host %x (%s:%d)\n",
+ hp, afs_inet_ntoa_r(hp->host, hoststr), ntohs(hp->port)));
+ 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 (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...
- */
+ * 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, 1);
hp->hostFlags &= ~RESETDONE; /* remember that we must do a reset */
} else {
/* host is up, try a call */
- hp->hostFlags &= ~ALTADDR; /* alternate addresses are invalid */
+ hp->hostFlags &= ~ALTADDR; /* alternate addresses are invalid */
+ cb_conn = hp->callback_rxcon;
+ rx_GetConnection(hp->callback_rxcon);
if (hp->interface) {
- H_UNLOCK
- code = RXAFSCB_InitCallBackState3(hp->callback_rxcon, &FS_HostUUID);
- H_LOCK
+ H_UNLOCK;
+ code =
+ RXAFSCB_InitCallBackState3(cb_conn, &FS_HostUUID);
} else {
- H_UNLOCK
- code = RXAFSCB_InitCallBackState(hp->callback_rxcon);
- H_LOCK
+ H_UNLOCK;
+ code = RXAFSCB_InitCallBackState(cb_conn);
}
- hp->hostFlags |= ALTADDR; /* alternate addresses are valid */
- if (code)
- {
+ rx_PutConnection(cb_conn);
+ cb_conn = NULL;
+ H_LOCK;
+ hp->hostFlags |= ALTADDR; /* alternate addresses are valid */
+ if (code) {
/* failed, mark host down and need reset */
hp->hostFlags |= VENUSDOWN;
hp->hostFlags &= ~RESETDONE;
}
}
if (!locked) {
- h_Unlock_r(hp);
+ h_Unlock_r(hp);
}
- if ( !held )
+ if (!held)
h_Release_r(hp);
return 0;
#endif /* INTERPRET_DUMP */
-int PrintCallBackStats(void)
+int
+PrintCallBackStats(void)
{
- 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 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);
+ cbstuff.nCBs, cbstuff.nFEs, cbstuff.nCBs + cbstuff.nFEs,
+ cbstuff.nblks);
return 0;
}
-#define MAGIC 0x12345678 /* To check byte ordering of dump when it is read in */
+#define MAGIC 0x12345678 /* To check byte ordering of dump when it is read in */
+#define MAGICV2 0x12345679 /* To check byte ordering & version of dump when it is read in */
+
#ifndef INTERPRET_DUMP
-int DumpCallBackState(void)
+#ifdef AFS_DEMAND_ATTACH_FS
+/*
+ * demand attach fs
+ * callback state serialization
+ */
+static int cb_stateSaveTimeouts(struct fs_dump_state * state);
+static int cb_stateSaveFEHash(struct fs_dump_state * state);
+static int cb_stateSaveFEs(struct fs_dump_state * state);
+static int cb_stateSaveFE(struct fs_dump_state * state, struct FileEntry * fe);
+static int cb_stateRestoreTimeouts(struct fs_dump_state * state);
+static int cb_stateRestoreFEHash(struct fs_dump_state * state);
+static int cb_stateRestoreFEs(struct fs_dump_state * state);
+static int cb_stateRestoreFE(struct fs_dump_state * state);
+static int cb_stateRestoreCBs(struct fs_dump_state * state, struct FileEntry * fe,
+ struct iovec * iov, int niovecs);
+
+static int cb_stateVerifyFEHash(struct fs_dump_state * state);
+static int cb_stateVerifyFE(struct fs_dump_state * state, struct FileEntry * fe);
+static int cb_stateVerifyFCBList(struct fs_dump_state * state, struct FileEntry * fe);
+static int cb_stateVerifyTimeoutQueues(struct fs_dump_state * state);
+
+static int cb_stateFEToDiskEntry(struct FileEntry *, struct FEDiskEntry *);
+static int cb_stateDiskEntryToFE(struct fs_dump_state * state,
+ struct FEDiskEntry *, struct FileEntry *);
+
+static int cb_stateCBToDiskEntry(struct CallBack *, struct CBDiskEntry *);
+static int cb_stateDiskEntryToCB(struct fs_dump_state * state,
+ struct CBDiskEntry *, struct CallBack *);
+
+static int cb_stateFillHeader(struct callback_state_header * hdr);
+static int cb_stateCheckHeader(struct callback_state_header * hdr);
+
+static int cb_stateAllocMap(struct fs_dump_state * state);
+
+int
+cb_stateSave(struct fs_dump_state * state)
{
- int fd;
- afs_uint32 magic = MAGIC, now = FT_ApproxTime(), freelisthead;
+ int ret = 0;
- 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 0;
+ AssignInt64(state->eof_offset, &state->hdr->cb_offset);
+
+ /* invalidate callback state header */
+ memset(state->cb_hdr, 0, sizeof(struct callback_state_header));
+ if (fs_stateWriteHeader(state, &state->hdr->cb_offset, state->cb_hdr,
+ sizeof(struct callback_state_header))) {
+ ret = 1;
+ goto done;
}
- 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);
- return 0;
-}
+ fs_stateIncEOF(state, sizeof(struct callback_state_header));
-#endif
+ /* dump timeout state */
+ if (cb_stateSaveTimeouts(state)) {
+ ret = 1;
+ goto done;
+ }
-#ifdef INTERPRET_DUMP
+ /* dump fe hashtable state */
+ if (cb_stateSaveFEHash(state)) {
+ ret = 1;
+ goto done;
+ }
-/* This is only compiled in for the callback analyzer program */
-/* Returns the time of the dump */
-time_t ReadDump(char *file)
+ /* dump callback state */
+ if (cb_stateSaveFEs(state)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* write the callback state header to disk */
+ cb_stateFillHeader(state->cb_hdr);
+ if (fs_stateWriteHeader(state, &state->hdr->cb_offset, state->cb_hdr,
+ sizeof(struct callback_state_header))) {
+ ret = 1;
+ goto done;
+ }
+
+ done:
+ return ret;
+}
+
+int
+cb_stateRestore(struct fs_dump_state * state)
{
- int fd;
- afs_uint32 magic, freelisthead;
- time_t now;
+ int ret = 0;
- fd = open(file, O_RDONLY);
- if (fd < 0) {
- fprintf(stderr, "Couldn't read dump file %s\n", file);
- exit(1);
+ if (fs_stateReadHeader(state, &state->hdr->cb_offset, state->cb_hdr,
+ sizeof(struct callback_state_header))) {
+ ret = 1;
+ goto done;
}
- 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);
+
+ if (cb_stateCheckHeader(state->cb_hdr)) {
+ ret = 1;
+ goto done;
}
- 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);
+
+ if (cb_stateAllocMap(state)) {
+ ret = 1;
+ goto done;
}
- return now;
-}
-#include "AFS_component_version_number.c"
+ if (cb_stateRestoreTimeouts(state)) {
+ ret = 1;
+ goto done;
+ }
-int main(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;
+ if (cb_stateRestoreFEHash(state)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore FEs and CBs from disk */
+ if (cb_stateRestoreFEs(state)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the timeout queue heads */
+ tfirst = state->cb_hdr->tfirst;
+
+ done:
+ return ret;
+}
+
+int
+cb_stateRestoreIndices(struct fs_dump_state * state)
+{
+ int i, ret = 0;
+ struct FileEntry * fe;
+ struct CallBack * cb;
+
+ /* restore indices in the FileEntry structures */
+ for (i = 1; i < state->fe_map.len; i++) {
+ if (state->fe_map.entries[i].new_idx) {
+ fe = itofe(state->fe_map.entries[i].new_idx);
+
+ /* restore the fe->fnext entry */
+ if (fe_OldToNew(state, fe->fnext, &fe->fnext)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the fe->firstcb entry */
+ if (cb_OldToNew(state, fe->firstcb, &fe->firstcb)) {
+ ret = 1;
+ goto done;
+ }
+ }
+ }
+
+ /* restore indices in the CallBack structures */
+ for (i = 1; i < state->cb_map.len; i++) {
+ if (state->cb_map.entries[i].new_idx) {
+ cb = itocb(state->cb_map.entries[i].new_idx);
+
+ /* restore the cb->cnext entry */
+ if (cb_OldToNew(state, cb->cnext, &cb->cnext)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the cb->fhead entry */
+ if (fe_OldToNew(state, cb->fhead, &cb->fhead)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the cb->hhead entry */
+ if (h_OldToNew(state, cb->hhead, &cb->hhead)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the cb->tprev entry */
+ if (cb_OldToNew(state, cb->tprev, &cb->tprev)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the cb->tnext entry */
+ if (cb_OldToNew(state, cb->tnext, &cb->tnext)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the cb->hprev entry */
+ if (cb_OldToNew(state, cb->hprev, &cb->hprev)) {
+ ret = 1;
+ goto done;
+ }
+
+ /* restore the cb->hnext entry */
+ if (cb_OldToNew(state, cb->hnext, &cb->hnext)) {
+ ret = 1;
+ goto done;
+ }
+ }
+ }
+
+ /* restore the timeout queue head indices */
+ for (i = 0; i < state->cb_timeout_hdr->records; i++) {
+ if (cb_OldToNew(state, timeout[i], &timeout[i])) {
+ ret = 1;
+ goto done;
+ }
+ }
+
+ /* restore the FE hash table queue heads */
+ for (i = 0; i < state->cb_fehash_hdr->records; i++) {
+ if (fe_OldToNew(state, HashTable[i], &HashTable[i])) {
+ ret = 1;
+ goto done;
+ }
+ }
+
+ done:
+ return ret;
+}
+
+int
+cb_stateVerify(struct fs_dump_state * state)
+{
+ int ret = 0;
+
+ if (cb_stateVerifyFEHash(state)) {
+ ret = 1;
+ }
+
+ if (cb_stateVerifyTimeoutQueues(state)) {
+ ret = 1;
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateVerifyFEHash(struct fs_dump_state * state)
+{
+ int ret = 0, i;
+ struct FileEntry * fe;
+ afs_uint32 fei, chain_len;
+
+ for (i = 0; i < FEHASH_SIZE; i++) {
+ chain_len = 0;
+ for (fei = HashTable[i], fe = itofe(fei);
+ fe;
+ fei = fe->fnext, fe = itofe(fei)) {
+ if (fei > cbstuff.nblks) {
+ ViceLog(0, ("cb_stateVerifyFEHash: error: index out of range (fei=%d)\n", fei));
+ ret = 1;
+ break;
+ }
+ if (cb_stateVerifyFE(state, fe)) {
+ ret = 1;
+ }
+ if (chain_len > FS_STATE_FE_MAX_HASH_CHAIN_LEN) {
+ ViceLog(0, ("cb_stateVerifyFEHash: error: hash chain %d length exceeds %d; assuming there's a loop\n",
+ i, FS_STATE_FE_MAX_HASH_CHAIN_LEN));
+ ret = 1;
+ break;
+ }
+ chain_len++;
+ }
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateVerifyFE(struct fs_dump_state * state, struct FileEntry * fe)
+{
+ int ret = 0;
+
+ if ((fe->firstcb && !fe->ncbs) ||
+ (!fe->firstcb && fe->ncbs)) {
+ ViceLog(0, ("cb_stateVerifyFE: error: fe->firstcb does not agree with fe->ncbs (fei=%d, fe->firstcb=%d, fe->ncbs=%d)\n",
+ fetoi(fe), fe->firstcb, fe->ncbs));
+ ret = 1;
+ }
+ if (cb_stateVerifyFCBList(state, fe)) {
+ ViceLog(0, ("cb_stateVerifyFE: error: FCBList failed verification (fei=%d)\n", fetoi(fe)));
+ ret = 1;
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateVerifyFCBList(struct fs_dump_state * state, struct FileEntry * fe)
+{
+ int ret = 0;
+ afs_uint32 cbi, fei, chain_len = 0;
+ struct CallBack * cb;
+
+ fei = fetoi(fe);
+
+ for (cbi = fe->firstcb, cb = itocb(cbi);
+ cb;
+ cbi = cb->cnext, cb = itocb(cbi)) {
+ if (cbi > cbstuff.nblks) {
+ ViceLog(0, ("cb_stateVerifyFCBList: error: list index out of range (cbi=%d, ncbs=%d)\n",
+ cbi, cbstuff.nblks));
+ ret = 1;
+ goto done;
+ }
+ if (cb->fhead != fei) {
+ ViceLog(0, ("cb_stateVerifyFCBList: error: cb->fhead != fei (fei=%d, cb->fhead=%d)\n",
+ fei, cb->fhead));
+ ret = 1;
+ }
+ if (chain_len > FS_STATE_FCB_MAX_LIST_LEN) {
+ ViceLog(0, ("cb_stateVerifyFCBList: error: list length exceeds %d (fei=%d); assuming there's a loop\n",
+ FS_STATE_FCB_MAX_LIST_LEN, fei));
+ ret = 1;
+ goto done;
+ }
+ chain_len++;
+ }
+
+ if (fe->ncbs != chain_len) {
+ ViceLog(0, ("cb_stateVerifyFCBList: error: list length mismatch (len=%d, fe->ncbs=%d)\n",
+ chain_len, fe->ncbs));
+ ret = 1;
+ }
+
+ done:
+ return ret;
+}
+
+int
+cb_stateVerifyHCBList(struct fs_dump_state * state, struct host * host)
+{
+ int ret = 0;
+ afs_uint32 hi, chain_len, cbi;
+ struct CallBack *cb, *ncb;
+
+ hi = h_htoi(host);
+ chain_len = 0;
+
+ for (cbi = host->cblist, cb = itocb(cbi);
+ cb;
+ cbi = cb->hnext, cb = ncb) {
+ if (chain_len && (host->cblist == cbi)) {
+ /* we've wrapped around the circular list, and everything looks ok */
+ break;
+ }
+ if (cb->hhead != hi) {
+ ViceLog(0, ("cb_stateVerifyHCBList: error: incorrect cb->hhead (cbi=%d, h->index=%d, cb->hhead=%d)\n",
+ cbi, hi, cb->hhead));
+ ret = 1;
+ }
+ if (!cb->hprev || !cb->hnext) {
+ ViceLog(0, ("cb_stateVerifyHCBList: error: null index in circular list (cbi=%d, h->index=%d)\n",
+ cbi, hi));
+ ret = 1;
+ goto done;
+ }
+ if ((cb->hprev > cbstuff.nblks) ||
+ (cb->hnext > cbstuff.nblks)) {
+ ViceLog(0, ("cb_stateVerifyHCBList: error: list index out of range (cbi=%d, h->index=%d, cb->hprev=%d, cb->hnext=%d, nCBs=%d)\n",
+ cbi, hi, cb->hprev, cb->hnext, cbstuff.nblks));
+ ret = 1;
+ goto done;
+ }
+ ncb = itocb(cb->hnext);
+ if (cbi != ncb->hprev) {
+ ViceLog(0, ("cb_stateVerifyHCBList: error: corrupt linked list (cbi=%d, h->index=%d)\n",
+ cbi, hi));
+ ret = 1;
+ goto done;
+ }
+ if (chain_len > FS_STATE_HCB_MAX_LIST_LEN) {
+ ViceLog(0, ("cb_stateVerifyFCBList: error: list length exceeds %d (h->index=%d); assuming there's a loop\n",
+ FS_STATE_HCB_MAX_LIST_LEN, hi));
+ ret = 1;
+ goto done;
+ }
+ chain_len++;
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateVerifyTimeoutQueues(struct fs_dump_state * state)
+{
+ int ret = 0, i;
+ afs_uint32 cbi, chain_len;
+ struct CallBack *cb, *ncb;
+
+ for (i = 0; i < CB_NUM_TIMEOUT_QUEUES; i++) {
+ chain_len = 0;
+ for (cbi = timeout[i], cb = itocb(cbi);
+ cb;
+ cbi = cb->tnext, cb = ncb) {
+ if (chain_len && (cbi == timeout[i])) {
+ /* we've wrapped around the circular list, and everything looks ok */
+ break;
+ }
+ if (cbi > cbstuff.nblks) {
+ ViceLog(0, ("cb_stateVerifyTimeoutQueues: error: list index out of range (cbi=%d, tindex=%d)\n",
+ cbi, i));
+ ret = 1;
+ break;
+ }
+ if (itot(cb->thead) != &timeout[i]) {
+ ViceLog(0, ("cb_stateVerifyTimeoutQueues: error: cb->thead points to wrong timeout queue (tindex=%d, cbi=%d, cb->thead=%d)\n",
+ i, cbi, cb->thead));
+ ret = 1;
+ }
+ if (!cb->tprev || !cb->tnext) {
+ ViceLog(0, ("cb_stateVerifyTimeoutQueues: null index in circular list (cbi=%d, tindex=%d)\n",
+ cbi, i));
+ ret = 1;
+ break;
+ }
+ if ((cb->tprev > cbstuff.nblks) ||
+ (cb->tnext > cbstuff.nblks)) {
+ ViceLog(0, ("cb_stateVerifyTimeoutQueues: list index out of range (cbi=%d, tindex=%d, cb->tprev=%d, cb->tnext=%d, nCBs=%d)\n",
+ cbi, i, cb->tprev, cb->tnext, cbstuff.nblks));
+ ret = 1;
+ break;
+ }
+ ncb = itocb(cb->tnext);
+ if (cbi != ncb->tprev) {
+ ViceLog(0, ("cb_stateVerifyTimeoutQueues: corrupt linked list (cbi=%d, tindex=%d)\n",
+ cbi, i));
+ ret = 1;
+ break;
+ }
+ if (chain_len > FS_STATE_TCB_MAX_LIST_LEN) {
+ ViceLog(0, ("cb_stateVerifyTimeoutQueues: list length exceeds %d (tindex=%d); assuming there's a loop\n",
+ FS_STATE_TCB_MAX_LIST_LEN, i));
+ ret = 1;
+ break;
+ }
+ chain_len++;
+ }
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateSaveTimeouts(struct fs_dump_state * state)
+{
+ int ret = 0;
+ struct iovec iov[2];
+
+ AssignInt64(state->eof_offset, &state->cb_hdr->timeout_offset);
+
+ memset(state->cb_timeout_hdr, 0, sizeof(struct callback_state_fehash_header));
+ state->cb_timeout_hdr->magic = CALLBACK_STATE_TIMEOUT_MAGIC;
+ state->cb_timeout_hdr->records = CB_NUM_TIMEOUT_QUEUES;
+ state->cb_timeout_hdr->len = sizeof(struct callback_state_timeout_header) +
+ (state->cb_timeout_hdr->records * sizeof(afs_uint32));
+
+ iov[0].iov_base = (char *)state->cb_timeout_hdr;
+ iov[0].iov_len = sizeof(struct callback_state_timeout_header);
+ iov[1].iov_base = (char *)timeout;
+ iov[1].iov_len = sizeof(timeout);
+
+ if (fs_stateSeek(state, &state->cb_hdr->timeout_offset)) {
+ ret = 1;
+ goto done;
+ }
+
+ if (fs_stateWriteV(state, iov, 2)) {
+ ret = 1;
+ goto done;
+ }
+
+ fs_stateIncEOF(state, state->cb_timeout_hdr->len);
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateRestoreTimeouts(struct fs_dump_state * state)
+{
+ int ret = 0, len;
+
+ if (fs_stateReadHeader(state, &state->cb_hdr->timeout_offset,
+ state->cb_timeout_hdr,
+ sizeof(struct callback_state_timeout_header))) {
+ ret = 1;
+ goto done;
+ }
+
+ if (state->cb_timeout_hdr->magic != CALLBACK_STATE_TIMEOUT_MAGIC) {
+ ret = 1;
+ goto done;
+ }
+ if (state->cb_timeout_hdr->records != CB_NUM_TIMEOUT_QUEUES) {
+ ret = 1;
+ goto done;
+ }
+
+ len = state->cb_timeout_hdr->records * sizeof(afs_uint32);
+
+ if (state->cb_timeout_hdr->len !=
+ (sizeof(struct callback_state_timeout_header) + len)) {
+ ret = 1;
+ goto done;
+ }
+
+ if (fs_stateRead(state, timeout, len)) {
+ ret = 1;
+ goto done;
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateSaveFEHash(struct fs_dump_state * state)
+{
+ int ret = 0;
+ struct iovec iov[2];
+
+ AssignInt64(state->eof_offset, &state->cb_hdr->fehash_offset);
+
+ memset(state->cb_fehash_hdr, 0, sizeof(struct callback_state_fehash_header));
+ state->cb_fehash_hdr->magic = CALLBACK_STATE_FEHASH_MAGIC;
+ state->cb_fehash_hdr->records = FEHASH_SIZE;
+ state->cb_fehash_hdr->len = sizeof(struct callback_state_fehash_header) +
+ (state->cb_fehash_hdr->records * sizeof(afs_uint32));
+
+ iov[0].iov_base = (char *)state->cb_fehash_hdr;
+ iov[0].iov_len = sizeof(struct callback_state_fehash_header);
+ iov[1].iov_base = (char *)HashTable;
+ iov[1].iov_len = sizeof(HashTable);
+
+ if (fs_stateSeek(state, &state->cb_hdr->fehash_offset)) {
+ ret = 1;
+ goto done;
+ }
+
+ if (fs_stateWriteV(state, iov, 2)) {
+ ret = 1;
+ goto done;
+ }
+
+ fs_stateIncEOF(state, state->cb_fehash_hdr->len);
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateRestoreFEHash(struct fs_dump_state * state)
+{
+ int ret = 0, len;
+
+ if (fs_stateReadHeader(state, &state->cb_hdr->fehash_offset,
+ state->cb_fehash_hdr,
+ sizeof(struct callback_state_fehash_header))) {
+ ret = 1;
+ goto done;
+ }
+
+ if (state->cb_fehash_hdr->magic != CALLBACK_STATE_FEHASH_MAGIC) {
+ ret = 1;
+ goto done;
+ }
+ if (state->cb_fehash_hdr->records != FEHASH_SIZE) {
+ ret = 1;
+ goto done;
+ }
+
+ len = state->cb_fehash_hdr->records * sizeof(afs_uint32);
+
+ if (state->cb_fehash_hdr->len !=
+ (sizeof(struct callback_state_fehash_header) + len)) {
+ ret = 1;
+ goto done;
+ }
+
+ if (fs_stateRead(state, HashTable, len)) {
+ ret = 1;
+ goto done;
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateSaveFEs(struct fs_dump_state * state)
+{
+ int ret = 0;
+ register int fei, hash;
+ register struct FileEntry *fe;
+
+ AssignInt64(state->eof_offset, &state->cb_hdr->fe_offset);
+
+ for (hash = 0; hash < FEHASH_SIZE ; hash++) {
+ for (fei = HashTable[hash]; fei; fei = fe->fnext) {
+ fe = itofe(fei);
+ if (cb_stateSaveFE(state, fe)) {
+ ret = 1;
+ goto done;
+ }
+ }
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateRestoreFEs(struct fs_dump_state * state)
+{
+ int count, nFEs, ret = 0;
+
+ nFEs = state->cb_hdr->nFEs;
+
+ for (count = 0; count < nFEs; count++) {
+ if (cb_stateRestoreFE(state)) {
+ ret = 1;
+ goto done;
+ }
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateSaveFE(struct fs_dump_state * state, struct FileEntry * fe)
+{
+ int ret = 0, iovcnt, cbi, written = 0;
+ afs_uint32 fei;
+ struct callback_state_entry_header hdr;
+ struct FEDiskEntry fedsk;
+ struct CBDiskEntry cbdsk[16];
+ struct iovec iov[16];
+ struct CallBack *cb;
+
+ fei = fetoi(fe);
+ if (fei > state->cb_hdr->fe_max) {
+ state->cb_hdr->fe_max = fei;
+ }
+
+ memset(&hdr, 0, sizeof(struct callback_state_entry_header));
+
+ if (cb_stateFEToDiskEntry(fe, &fedsk)) {
+ ret = 1;
+ goto done;
+ }
+
+ iov[0].iov_base = (char *)&hdr;
+ iov[0].iov_len = sizeof(hdr);
+ iov[1].iov_base = (char *)&fedsk;
+ iov[1].iov_len = sizeof(struct FEDiskEntry);
+ iovcnt = 2;
+
+ for (cbi = fe->firstcb, cb = itocb(cbi);
+ cb != NULL;
+ cbi = cb->cnext, cb = itocb(cbi), hdr.nCBs++) {
+ if (cbi > state->cb_hdr->cb_max) {
+ state->cb_hdr->cb_max = cbi;
+ }
+ if (cb_stateCBToDiskEntry(cb, &cbdsk[iovcnt])) {
+ ret = 1;
+ goto done;
+ }
+ cbdsk[iovcnt].index = cbi;
+ iov[iovcnt].iov_base = (char *)&cbdsk[iovcnt];
+ iov[iovcnt].iov_len = sizeof(struct CBDiskEntry);
+ iovcnt++;
+ if ((iovcnt == 16) || (!cb->cnext)) {
+ if (fs_stateWriteV(state, iov, iovcnt)) {
+ ret = 1;
+ goto done;
+ }
+ written = 1;
+ iovcnt = 0;
+ }
+ }
+ hdr.magic = CALLBACK_STATE_ENTRY_MAGIC;
+ hdr.len = sizeof(hdr) + sizeof(struct FEDiskEntry) +
+ (hdr.nCBs * sizeof(struct CBDiskEntry));
+
+ if (!written) {
+ if (fs_stateWriteV(state, iov, iovcnt)) {
+ ret = 1;
+ goto done;
+ }
+ } else {
+ if (fs_stateWriteHeader(state, &state->eof_offset, &hdr, sizeof(hdr))) {
+ ret = 1;
+ goto done;
+ }
+ }
+
+ fs_stateIncEOF(state, hdr.len);
+
+ if (written) {
+ if (fs_stateSeek(state, &state->eof_offset)) {
+ ret = 1;
+ goto done;
+ }
+ }
+
+ state->cb_hdr->nFEs++;
+ state->cb_hdr->nCBs += hdr.nCBs;
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateRestoreFE(struct fs_dump_state * state)
+{
+ int ret = 0, iovcnt, nCBs;
+ struct callback_state_entry_header hdr;
+ struct FEDiskEntry fedsk;
+ struct CBDiskEntry cbdsk[16];
+ struct iovec iov[16];
+ struct FileEntry * fe;
+ struct CallBack * cb;
+
+ iov[0].iov_base = (char *)&hdr;
+ iov[0].iov_len = sizeof(hdr);
+ iov[1].iov_base = (char *)&fedsk;
+ iov[1].iov_len = sizeof(fedsk);
+ iovcnt = 2;
+
+ if (fs_stateReadV(state, iov, iovcnt)) {
+ ret = 1;
+ goto done;
+ }
+
+ if (hdr.magic != CALLBACK_STATE_ENTRY_MAGIC) {
+ ret = 1;
+ goto done;
+ }
+
+ fe = GetFE();
+ if (fe == NULL) {
+ ViceLog(0, ("cb_stateRestoreFE: ran out of free FileEntry structures\n"));
+ ret = 1;
+ goto done;
+ }
+
+ if (cb_stateDiskEntryToFE(state, &fedsk, fe)) {
+ ret = 1;
+ goto done;
+ }
+
+ if (hdr.nCBs) {
+ for (iovcnt = 0, nCBs = 0;
+ nCBs < hdr.nCBs;
+ nCBs++) {
+ iov[iovcnt].iov_base = (char *)&cbdsk[iovcnt];
+ iov[iovcnt].iov_len = sizeof(struct CBDiskEntry);
+ iovcnt++;
+ if ((iovcnt == 16) || (nCBs == hdr.nCBs - 1)) {
+ if (fs_stateReadV(state, iov, iovcnt)) {
+ ret = 1;
+ goto done;
+ }
+ if (cb_stateRestoreCBs(state, fe, iov, iovcnt)) {
+ ret = 1;
+ goto done;
+ }
+ iovcnt = 0;
+ }
+ }
+ }
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateRestoreCBs(struct fs_dump_state * state, struct FileEntry * fe,
+ struct iovec * iov, int niovecs)
+{
+ int ret = 0, idx;
+ register struct CallBack * cb;
+ struct CBDiskEntry * cbdsk;
+ afs_uint32 fei;
+
+ fei = fetoi(fe);
+
+ for (idx = 0; idx < niovecs; idx++) {
+ cbdsk = (struct CBDiskEntry *) iov[idx].iov_base;
+ if ((cb = GetCB()) == NULL) {
+ ViceLog(0, ("cb_stateRestoreCBs: ran out of free CallBack structures\n"));
+ ret = 1;
+ goto done;
+ }
+ if (cb_stateDiskEntryToCB(state, cbdsk, cb)) {
+ ViceLog(0, ("cb_stateRestoreCBs: corrupt CallBack disk entry\n"));
+ ret = 1;
+ goto done;
+ }
+ }
+
+ done:
+ return ret;
+}
+
+
+static int
+cb_stateFillHeader(struct callback_state_header * hdr)
+{
+ hdr->stamp.magic = CALLBACK_STATE_MAGIC;
+ hdr->stamp.version = CALLBACK_STATE_VERSION;
+ hdr->tfirst = tfirst;
+ return 0;
+}
+
+static int
+cb_stateCheckHeader(struct callback_state_header * hdr)
+{
+ int ret = 0;
+
+ if (hdr->stamp.magic != CALLBACK_STATE_MAGIC) {
+ ret = 1;
+ } else if (hdr->stamp.version != CALLBACK_STATE_VERSION) {
+ ret = 1;
+ } else if ((hdr->nFEs > cbstuff.nblks) || (hdr->nCBs > cbstuff.nblks)) {
+ ViceLog(0, ("cb_stateCheckHeader: saved callback state larger than callback memory allocation\n"));
+ ret = 1;
+ }
+ return ret;
+}
+
+/* disk entry conversion routines */
+static int
+cb_stateFEToDiskEntry(struct FileEntry * in, struct FEDiskEntry * out)
+{
+ memcpy(&out->fe, in, sizeof(struct FileEntry));
+ out->index = fetoi(in);
+ return 0;
+}
+
+static int
+cb_stateDiskEntryToFE(struct fs_dump_state * state,
+ struct FEDiskEntry * in, struct FileEntry * out)
+{
+ int ret = 0;
+
+ memcpy(out, &in->fe, sizeof(struct FileEntry));
+
+ /* setup FE map entry */
+ if (!in->index || (in->index >= state->fe_map.len)) {
+ ViceLog(0, ("cb_stateDiskEntryToFE: index (%d) out of range",
+ in->index));
+ ret = 1;
+ goto done;
+ }
+ state->fe_map.entries[in->index].old_idx = in->index;
+ state->fe_map.entries[in->index].new_idx = fetoi(out);
+
+ done:
+ return ret;
+}
+
+static int
+cb_stateCBToDiskEntry(struct CallBack * in, struct CBDiskEntry * out)
+{
+ memcpy(&out->cb, in, sizeof(struct CallBack));
+ out->index = cbtoi(in);
+ return 0;
+}
+
+static int
+cb_stateDiskEntryToCB(struct fs_dump_state * state,
+ struct CBDiskEntry * in, struct CallBack * out)
+{
+ int ret = 0;
+
+ memcpy(out, &in->cb, sizeof(struct CallBack));
+
+ /* setup CB map entry */
+ if (!in->index || (in->index >= state->cb_map.len)) {
+ ViceLog(0, ("cb_stateDiskEntryToCB: index (%d) out of range\n",
+ in->index));
+ ret = 1;
+ goto done;
+ }
+ state->cb_map.entries[in->index].old_idx = in->index;
+ state->cb_map.entries[in->index].new_idx = cbtoi(out);
+
+ done:
+ return ret;
+}
+
+/* index map routines */
+static int
+cb_stateAllocMap(struct fs_dump_state * state)
+{
+ state->fe_map.len = state->cb_hdr->fe_max + 1;
+ state->cb_map.len = state->cb_hdr->cb_max + 1;
+ state->fe_map.entries = (struct idx_map_entry_t *)
+ calloc(state->fe_map.len, sizeof(struct idx_map_entry_t));
+ state->cb_map.entries = (struct idx_map_entry_t *)
+ calloc(state->cb_map.len, sizeof(struct idx_map_entry_t));
+ return ((state->fe_map.entries != NULL) && (state->cb_map.entries != NULL)) ? 0 : 1;
+}
+
+int
+fe_OldToNew(struct fs_dump_state * state, afs_uint32 old, afs_uint32 * new)
+{
+ int ret = 0;
+
+ /* FEs use a one-based indexing system, so old==0 implies no mapping */
+ if (!old) {
+ *new = 0;
+ goto done;
+ }
+
+ if (old >= state->fe_map.len) {
+ ViceLog(0, ("fe_OldToNew: index %d is out of range\n", old));
+ ret = 1;
+ } else if (state->fe_map.entries[old].old_idx != old) { /* sanity check */
+ ViceLog(0, ("fe_OldToNew: index %d points to an invalid FileEntry record\n", old));
+ ret = 1;
+ } else {
+ *new = state->fe_map.entries[old].new_idx;
+ }
+
+ done:
+ return ret;
+}
+
+int
+cb_OldToNew(struct fs_dump_state * state, afs_uint32 old, afs_uint32 * new)
+{
+ int ret = 0;
+
+ /* CBs use a one-based indexing system, so old==0 implies no mapping */
+ if (!old) {
+ *new = 0;
+ goto done;
+ }
+
+ if (old >= state->cb_map.len) {
+ ViceLog(0, ("cb_OldToNew: index %d is out of range\n", old));
+ ret = 1;
+ } else if (state->cb_map.entries[old].old_idx != old) { /* sanity check */
+ ViceLog(0, ("cb_OldToNew: index %d points to an invalid CallBack record\n", old));
+ ret = 1;
+ } else {
+ *new = state->cb_map.entries[old].new_idx;
+ }
+
+ done:
+ return ret;
+}
+#endif /* AFS_DEMAND_ATTACH_FS */
+
+int
+DumpCallBackState(void)
+{
+ int fd, oflag;
+ afs_uint32 magic = MAGICV2, now = (afs_int32) FT_ApproxTime(), freelisthead;
+
+ oflag = O_WRONLY | O_CREAT | O_TRUNC;
+#ifdef AFS_NT40_ENV
+ oflag |= O_BINARY;
+#endif
+ fd = open(AFSDIR_SERVER_CBKDUMP_FILEPATH, oflag, 0666);
+ if (fd < 0) {
+ ViceLog(0,
+ ("Couldn't create callback dump file %s\n",
+ AFSDIR_SERVER_CBKDUMP_FILEPATH));
+ return 0;
+ }
+ (void)write(fd, &magic, sizeof(magic));
+ (void)write(fd, &now, sizeof(now));
+ (void)write(fd, &cbstuff, sizeof(cbstuff));
+ (void)write(fd, TimeOuts, sizeof(TimeOuts));
+ (void)write(fd, timeout, sizeof(timeout));
+ (void)write(fd, &tfirst, sizeof(tfirst));
+ freelisthead = cbtoi((struct CallBack *)CBfree);
+ (void)write(fd, &freelisthead, sizeof(freelisthead)); /* This is a pointer */
+ freelisthead = fetoi((struct FileEntry *)FEfree);
+ (void)write(fd, &freelisthead, sizeof(freelisthead)); /* This is a pointer */
+ (void)write(fd, HashTable, sizeof(HashTable));
+ (void)write(fd, &CB[1], sizeof(CB[1]) * cbstuff.nblks); /* CB stuff */
+ (void)write(fd, &FE[1], sizeof(FE[1]) * cbstuff.nblks); /* FE stuff */
+ close(fd);
+
+ return 0;
+}
+
+#endif /* !INTERPRET_DUMP */
+
+#ifdef INTERPRET_DUMP
+
+/* This is only compiled in for the callback analyzer program */
+/* Returns the time of the dump */
+time_t
+ReadDump(char *file, int timebits)
+{
+ int fd, oflag;
+ afs_uint32 magic, freelisthead;
+ afs_uint32 now;
+#ifdef AFS_64BIT_ENV
+ afs_int64 now64;
+#endif
+
+ oflag = O_RDONLY;
+#ifdef AFS_NT40_ENV
+ oflag |= O_BINARY;
+#endif
+ fd = open(file, oflag);
+ if (fd < 0) {
+ fprintf(stderr, "Couldn't read dump file %s\n", file);
+ exit(1);
+ }
+ read(fd, &magic, sizeof(magic));
+ if (magic == MAGICV2) {
+ timebits = 32;
+ } else {
+ 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);
+ }
+ }
+#ifdef AFS_64BIT_ENV
+ if (timebits == 64) {
+ read(fd, &now64, sizeof(afs_int64));
+ now = (afs_int32) now64;
+ } else
+#endif
+ read(fd, &now, sizeof(afs_int32));
+ 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
+ *)(calloc(cbstuff.nblks, sizeof(struct CallBack)))) - 1;
+ FE = ((struct FileEntry
+ *)(calloc(cbstuff.nblks, sizeof(struct FileEntry)))) - 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;
+}
+
+#ifdef AFS_NT40_ENV
+#include "AFS_component_version_number.h"
+#else
+#include "AFS_component_version_number.c"
+#endif
+
+int
+main(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;
+ afs_int32 now;
+ int timebits = 32;
+
memset(&fid, 0, sizeof(fid));
- argc--; argv++;
+ argc--;
+ argv++;
while (argc && **argv == '-') {
noptions++;
- argc--;
- if (!strcmp(*argv, "-host")) {
+ argc--;
+ if (!strcmp(*argv, "-host")) {
if (argc < 1) {
err++;
break;
}
argc--;
cbi = atoi(*++argv);
- }
- else if (!strcmp(*argv, "-fid")) {
+ } else if (!strcmp(*argv, "-fid")) {
if (argc < 2) {
err++;
break;
fid.Volume = atoi(*++argv);
fid.Vnode = atoi(*++argv);
fid.Unique = atoi(*++argv);
- }
- else if (!strcmp(*argv, "-time")) {
+ } else if (!strcmp(*argv, "-time")) {
fprintf(stderr, "-time not supported\n");
exit(1);
- }
- else if (!strcmp(*argv, "-stats")) {
+ } else if (!strcmp(*argv, "-stats")) {
stats = 1;
- }
- else if (!strcmp(*argv, "-all")) {
+ } else if (!strcmp(*argv, "-all")) {
all = 1;
- }
- else if (!strcmp(*argv, "-raw")) {
+ } else if (!strcmp(*argv, "-raw")) {
raw = 1;
- }
- else if (!strcmp(*argv, "-volume")) {
+ } else if (!strcmp(*argv, "-timebits")) {
+ if (argc < 1) {
+ err++;
+ break;
+ }
+ argc--;
+ timebits = atoi(*++argv);
+ if ((timebits != 32)
+#ifdef AFS_64BIT_ENV
+ && (timebits != 64)
+#endif
+ )
+ err++;
+ } else if (!strcmp(*argv, "-volume")) {
if (argc < 1) {
err++;
break;
}
argc--;
vol = atoi(*++argv);
- }
- else err++;
- 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");
+ "Usage: cbd [-host cbid] [-fid volume vnode] [-stats] [-all] [-timebits 32"
+#ifdef AFS_64BIT_ENV
+ "|64"
+#endif
+ "] callbackdumpfile\n");
+ fprintf(stderr,
+ "[cbid is shown for each host in the hosts.dump file]\n");
exit(1);
}
- now = ReadDump(*argv);
+ now = ReadDump(*argv, timebits);
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();
+ printf("The time of the dump was %u %s", (unsigned int) now, ctime(&now));
+ printf("The last time cleanup ran was %u %s", (unsigned int) uxtfirst,
+ ctime(&uxtfirst));
+ PrintCallBackStats();
}
if (all || vol) {
- register hash;
- register afs_uint32 *feip;
- register struct CallBack *cb;
- register struct FileEntry *fe;
+ int hash;
+ afs_uint32 *feip;
+ struct CallBack *cb;
+ struct FileEntry *fe;
- for (hash=0; hash<VHASH; hash++) {
- for (feip = &HashTable[hash]; fe = itofe(*feip); ) {
+ for (hash = 0; hash < FEHASH_SIZE; hash++) {
+ for (feip = &HashTable[hash]; fe = itofe(*feip);) {
if (!vol || (fe->volid == vol)) {
register struct CallBack *cbnext;
for (cb = itocb(fe->firstcb); cb; cb = cbnext) {
- PrintCB(cb,now);
+ PrintCB(cb, now);
cbnext = itocb(cb->cnext);
}
*feip = fe->fnext;
afs_uint32 cfirst = cbi;
do {
cb = itocb(cbi);
- PrintCB(cb,now);
+ PrintCB(cb, now);
cbi = cb->hnext;
} while (cbi != cfirst);
}
}
}
if (raw) {
- struct FileEntry *fe;
afs_int32 *p, i;
- for (i=1; i < cbstuff.nblks; i++) {
- p = (afs_int32 *) &FE[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]);
}
}
+ exit(0);
}
-int PrintCB(register struct CallBack *cb, afs_uint32 now)
+void
+PrintCB(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 fest=%d, exp in %d secs at %s",
- fe->volid, fe->vnode, fe->ncbs, cb->hhead, cb->status,
- fe->status, expires - now, ctime(&expires));
+ if (fe == NULL)
+ return;
+
+ printf("vol=%u vn=%u cbs=%d hi=%d st=%d fest=%d, exp in %lu secs at %s",
+ fe->volid, fe->vnode, fe->ncbs, cb->hhead, cb->status, fe->status,
+ expires - now, ctime(&expires));
}
#endif
** try breaking calbacks on afidp from host. Use multi_rx.
** return 0 on success, non-zero on failure
*/
-int MultiBreakCallBackAlternateAddress(struct host *host, struct AFSCBFids *afidp)
+int
+MultiBreakCallBackAlternateAddress(struct host *host, struct AFSCBFids *afidp)
{
int retVal;
- H_LOCK
+ H_LOCK;
retVal = MultiBreakCallBackAlternateAddress_r(host, afidp);
- H_UNLOCK
+ H_UNLOCK;
return retVal;
}
-int MultiBreakCallBackAlternateAddress_r(struct host *host, struct AFSCBFids *afidp)
-{
- int i,j;
- struct rx_connection** conns;
- struct rx_connection* connSuccess = 0;
- afs_int32 *addr;
- static struct rx_securityClass *sc = 0;
- static struct AFSCBs tc = {0,0};
- char hoststr[16];
-
- /* 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 = rxnull_NewClientSecurityObject();
-
- i = host->interface->numberOfInterfaces;
- addr = malloc(i * sizeof(afs_int32));
- if (!addr) return 1;
- conns = malloc(i * sizeof(struct rx_connection *));
- if (!conns) { free(addr); return 1; }
-
- /* 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++;
- }
+int
+MultiBreakCallBackAlternateAddress_r(struct host *host,
+ struct AFSCBFids *afidp)
+{
+ int i, j;
+ struct rx_connection **conns;
+ struct rx_connection *connSuccess = 0;
+ struct AddrPort *interfaces;
+ static struct rx_securityClass *sc = 0;
+ static struct AFSCBs tc = { 0, 0 };
+ char hoststr[16];
- assert(j); /* at least one alternate address */
- ViceLog(125,("Starting multibreakcall back on all addr for host %s\n",
- afs_inet_ntoa_r(host->host,hoststr)));
- 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 %s\n",
- afs_inet_ntoa_r(addr[multi_i],hoststr)));
- H_UNLOCK
- multi_Abort;
- }
- } multi_End_Ignore;
- H_LOCK
+ /* nothing more can be done */
+ if (!host->interface)
+ return 1; /* failure */
- /* Destroy all connections except the one on which we succeeded */
- for ( i=0; i < j; i++)
- if ( conns[i] != connSuccess )
- rx_DestroyConnection(conns[i] );
+ /* the only address is the primary interface */
+ if (host->interface->numberOfInterfaces <= 1)
+ return 1; /* failure */
- free(addr);
- free(conns);
+ /* initialise a security object only once */
+ if (!sc)
+ sc = rxnull_NewClientSecurityObject();
- if ( connSuccess ) return 0; /* success */
- else return 1; /* failure */
+ i = host->interface->numberOfInterfaces;
+ interfaces = calloc(i, sizeof(struct AddrPort));
+ conns = calloc(i, sizeof(struct rx_connection *));
+ if (!interfaces || !conns) {
+ ViceLog(0,
+ ("Failed malloc in MultiBreakCallBackAlternateAddress_r\n"));
+ assert(0);
+ }
+
+ /* 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->interface[i].addr &&
+ host->port == host->interface->interface[i].port)
+ continue;
+
+ interfaces[j] = host->interface->interface[i];
+ conns[j] =
+ rx_NewConnection(interfaces[j].addr,
+ interfaces[j].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 (%s:%d)\n",
+ host, afs_inet_ntoa_r(host->host, hoststr), ntohs(host->port)));
+ 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];
+ h_DeleteHostFromAddrHashTable_r(host->host, host->port, host);
+ host->host = interfaces[multi_i].addr;
+ host->port = interfaces[multi_i].port;
+ h_AddHostToAddrHashTable_r(host->host, host->port, host);
+ connSuccess = conns[multi_i];
+ rx_SetConnDeadTime(host->callback_rxcon, 50);
+ rx_SetConnHardDeadTime(host->callback_rxcon, AFS_HARDDEADTIME);
+ ViceLog(125,
+ ("multibreakcall success with addr %s:%d\n",
+ afs_inet_ntoa_r(interfaces[multi_i].addr, hoststr),
+ ntohs(interfaces[multi_i].port)));
+ 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]);
+
+ free(interfaces);
+ free(conns);
+
+ if (connSuccess)
+ return 0; /* success */
+ else
+ return 1; /* failure */
}
/*
-** try multiRX probes to host.
-** return 0 on success, non-zero on failure
+** try multi_RX probes to host.
+** return 0 on success, non-0 on failure
*/
-int MultiProbeAlternateAddress_r(struct host *host)
-{
- int i,j;
- struct rx_connection** conns;
- struct rx_connection* connSuccess = 0;
- afs_int32 *addr;
- static struct rx_securityClass *sc = 0;
- char hoststr[16];
-
- /* 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 = rxnull_NewClientSecurityObject();
-
- i = host->interface->numberOfInterfaces;
- addr = malloc(i * sizeof(afs_int32));
- if (!addr) return 1;
- conns = malloc(i * sizeof(struct rx_connection *));
- if (!conns) { free(addr); return 1; }
-
- /* 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++;
- }
+int
+MultiProbeAlternateAddress_r(struct host *host)
+{
+ int i, j;
+ struct rx_connection **conns;
+ struct rx_connection *connSuccess = 0;
+ struct AddrPort *interfaces;
+ static struct rx_securityClass *sc = 0;
+ char hoststr[16];
- assert(j); /* at least one alternate address */
- ViceLog(125,("Starting multiprobe on all addr for host %s\n",
- afs_inet_ntoa_r(host->host,hoststr)));
- 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 %s\n",
- afs_inet_ntoa_r(addr[multi_i],hoststr)));
- H_UNLOCK
- multi_Abort;
- }
- } multi_End_Ignore;
- H_LOCK
+ /* nothing more can be done */
+ if (!host->interface)
+ return 1; /* failure */
+
+ /* the only address is the primary interface */
+ if (host->interface->numberOfInterfaces <= 1)
+ return 1; /* failure */
- /* Destroy all connections except the one on which we succeeded */
- for ( i=0; i < j; i++)
- if ( conns[i] != connSuccess )
- rx_DestroyConnection(conns[i] );
+ /* initialise a security object only once */
+ if (!sc)
+ sc = rxnull_NewClientSecurityObject();
+
+ i = host->interface->numberOfInterfaces;
+ interfaces = calloc(i, sizeof(struct AddrPort));
+ conns = calloc(i, sizeof(struct rx_connection *));
+ if (!interfaces || !conns) {
+ ViceLog(0, ("Failed malloc in MultiProbeAlternateAddress_r\n"));
+ assert(0);
+ }
- free(addr);
- free(conns);
+ /* 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->interface[i].addr &&
+ host->port == host->interface->interface[i].port)
+ continue;
+
+ interfaces[j] = host->interface->interface[i];
+ conns[j] =
+ rx_NewConnection(interfaces[j].addr,
+ interfaces[j].port, 1, sc, 0);
+ rx_SetConnDeadTime(conns[j], 2);
+ rx_SetConnHardDeadTime(conns[j], AFS_HARDDEADTIME);
+ j++;
+ }
- if ( connSuccess ) return 0; /* success */
- else return 1; /* failure */
+ assert(j); /* at least one alternate address */
+ ViceLog(125,
+ ("Starting multiprobe on all addr for host %x (%s:%d)\n",
+ host, afs_inet_ntoa_r(host->host, hoststr),
+ ntohs(host->port)));
+ 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];
+ h_DeleteHostFromAddrHashTable_r(host->host, host->port, host);
+ host->host = interfaces[multi_i].addr;
+ host->port = interfaces[multi_i].port;
+ h_AddHostToAddrHashTable_r(host->host, host->port, host);
+ connSuccess = conns[multi_i];
+ rx_SetConnDeadTime(host->callback_rxcon, 50);
+ rx_SetConnHardDeadTime(host->callback_rxcon, AFS_HARDDEADTIME);
+ ViceLog(125,
+ ("multiprobe success with addr %s:%d\n",
+ afs_inet_ntoa_r(interfaces[multi_i].addr, hoststr),
+ ntohs(interfaces[multi_i].port)));
+ H_UNLOCK;
+ multi_Abort;
+ } else {
+ ViceLog(125,
+ ("multiprobe failure with addr %s:%d\n",
+ afs_inet_ntoa_r(interfaces[multi_i].addr, hoststr),
+ ntohs(interfaces[multi_i].port)));
+
+ /* This is less than desirable but its the best we can do.
+ * The AFS Cache Manager will return either 0 for a Uuid
+ * match and a 1 for a non-match. If the error is 1 we
+ * therefore know that our mapping of IP address to Uuid
+ * is wrong. We should attempt to find the correct
+ * Uuid and fix the host tables.
+ */
+ if (multi_error == 1) {
+ /* remove the current alternate address from this host */
+ H_LOCK;
+ removeInterfaceAddr_r(host, interfaces[multi_i].addr, interfaces[multi_i].port);
+ H_UNLOCK;
+ }
+ }
+#ifdef AFS_DEMAND_ATTACH_FS
+ /* try to bail ASAP if the fileserver is shutting down */
+ FS_STATE_RDLOCK;
+ if (fs_state.mode == FS_MODE_SHUTDOWN) {
+ FS_STATE_UNLOCK;
+ multi_Abort;
+ }
+ FS_STATE_UNLOCK;
+#endif
+ }
+ 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]);
+
+ free(interfaces);
+ free(conns);
+
+ if (connSuccess)
+ return 0; /* success */
+ else
+ return 1; /* failure */
}
#endif /* !defined(INTERPRET_DUMP) */
git://git.openafs.org / openafs.git / blobdiff