2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
11 * This package is used to actively manage the expiration of callbacks,
12 * so that the rest of the cache manager doesn't need to compute
13 * whether a callback has expired or not, but can tell with one simple
14 * check, that is, whether the CStatd bit is on or off.
16 * The base of the hash table moves periodically (every 128 seconds)
17 * QueueCallback rarely touches the first 3 slots in the hash table
18 * (only when called from CheckCallbacks) since MinTimeOut in
19 * viced/callback.c is currently 7 minutes.
20 * Therefore, CheckCallbacks should be able to run concurrently with
21 * QueueCallback, given the proper locking, of course.
24 * 1. CheckCallbacks and BumpBase never run simultaneously. This is because
25 * they are only called from afs_Daemon. Therefore, base and basetime will
26 * always be consistent during CheckCallbacks.
27 * 2. cbHashT [base] rarely (if ever) gets stuff queued in it. The only way
28 * that could happen is CheckCallbacks might fencepost and move something in
29 * place, or BumpBase might push some stuff up.
30 * 3. Hash chains aren't particularly sorted.
31 * 4. The file server keeps its callback state around for 3 minutes
32 * longer than it promises the cache manager in order to account for
33 * clock skew, network delay, and other bogeymen.
35 * For now I just use one large lock, which is fine on a uniprocessor,
36 * since it's not held during any RPCs or low-priority I/O operations.
37 * To make this code MP-fast, you need no more locks than processors,
38 * but probably more than one. In measurements on MP-safe implementations,
39 * I have never seen any contention over the xcbhash lock.
41 * Incompatible operations:
42 * Enqueue and "dequeue of first vcache" in same slot
43 * dequeue and "dequeue of preceding vcache" in same slot
44 * dequeue and "dequeue of successive vcache" in same slot
45 * BumpBase pushing a list and enqueue in the new base slot
46 * Two enqueues in same slot
49 * Certain invariants exist:
50 * 1 Callback expiration times granted by a file server will never
51 * decrease for a particular vnode UNLESS a CallBack RPC is invoked
52 * by the server in the interim.
53 * 2 A vcache will always expire no sooner than the slot in which it is
54 * currently enqueued. Callback times granted by the server may
55 * increase, in which case the vcache will be updated in-place. As a
56 * result, it may expire later than the slot in which it is enqueued.
57 * Not to worry, the CheckCallbacks code will move it if neccessary.
58 * This approach means that busy vnodes won't be continually moved
59 * around within the expiry queue: they are only moved when they
60 * finally advance to the lead bucket.
61 * 3 Anything which has a callback on it must be in the expiry
62 * queue. In AFS 3.3, that means everything but symlinks (which
63 * are immutable), including contents of Read-Only volumes
64 * (which have callbacks by virtue of the whole-volume callback)
66 * QueueCallback only checks that its vcache is in the list
67 * somewhere, counting on invariant #1 to guarantee that the vcache
68 * won't be in a slot later than QueueCallback would otherwise place
69 * it. Therefore, whenever we turn off the CStatd bit on the vcache, we
70 * *must* remove the vcache from the expiry queue. Otherwise, we
71 * might have missed a CallBack RPC, and a subsequent callback might be
72 * granted with a shorter expiration time.
74 #include <afsconfig.h>
75 #include "afs/param.h"
79 #include "afs/sysincludes.h" /*Standard vendor system headers*/
80 #include "afsincludes.h" /*AFS-based standard headers*/
81 #include "afs/afs_cbqueue.h"
84 #include "afs/afs_stats.h"
86 static unsigned int base = 0;
87 static unsigned int basetime = 0;
88 static struct vcache *debugvc; /* used only for post-mortem debugging */
91 /* struct afs_lock lock; only if you want lots of locks... */
93 static struct bucket cbHashT[CBHTSIZE];
94 struct afs_lock afs_xcbhash;
97 * Takes a write-locked vcache pointer and a callback expiration time
98 * as returned by the file server (ie, in units of 128 seconds from "now").
100 * Uses the time as an index into a hash table, and inserts the vcache
101 * structure into the overflow chain.
103 * If the vcache is already on some hash chain, leave it there.
104 * CheckCallbacks will get to it eventually. In the meantime, it
105 * might get flushed, or it might already be on the right hash chain,
106 * so why bother messing with it now?
108 * NOTE: The caller must hold a write lock on afs_xcbhash
111 void afs_QueueCallback(struct vcache *avc, unsigned int atime, struct volume *avp)
113 if (avp && (avp->expireTime < avc->cbExpires))
114 avp->expireTime = avc->cbExpires;
115 if (!(avc->callsort.next)) {
116 atime = (atime + base) % CBHTSIZE;
117 QAdd(&(cbHashT[atime].head), &(avc->callsort));
121 } /* afs_QueueCallback */
123 /* afs_DequeueCallback
124 * Takes a write-locked vcache pointer and removes it from the callback
125 * hash table, without knowing beforehand which slot it was in.
127 * for now, just get a lock on everything when doing the dequeue, don't
128 * worry about getting a lock on the individual slot.
130 * the only other places that do anything like dequeues are CheckCallbacks
133 * NOTE: The caller must hold a write lock on afs_xcbhash
135 void afs_DequeueCallback(struct vcache *avc)
139 if (avc->callsort.prev) {
140 QRemove(&(avc->callsort));
141 avc->callsort.prev = avc->callsort.next = NULL;
143 else ; /* must have got dequeued in a race */
144 afs_symhint_inval(avc);
147 } /* afs_DequeueCallback */
149 /* afs_CheckCallbacks
150 * called periodically to determine which callbacks are likely to
151 * expire in the next n second interval. Preemptively marks them as
152 * expired. Rehashes items which are now in the wrong hash bucket.
153 * Preemptively renew recently-accessed items. Only removes things
154 * from the first and second bucket (as long as secs < 128), and
155 * inserts things into other, later buckets. either need to advance
156 * to the second bucket if secs spans two intervals, or else be
157 * certain to call afs_CheckCallbacks immediately after calling
158 * BumpBase (allows a little more slop but it's ok because file server
159 * keeps 3 minutes of slop time)
161 * There is a little race between CheckCallbacks and any code which
162 * updates cbExpires, always just prior to calling QueueCallback. We
163 * don't lock the vcache struct here (can't, or we'd risk deadlock),
164 * so GetVCache (for example) may update cbExpires before or after #1
165 * below. If before, CheckCallbacks moves this entry to its proper
166 * slot. If after, GetVCache blocks in the call to QueueCallbacks,
167 * this code dequeues the vcache, and then QueueCallbacks re-enqueues it.
169 * XXX to avoid the race, make QueueCallback take the "real" time
170 * and update cbExpires under the xcbhash lock.
172 * NB #1: There's a little optimization here: if I go to invalidate a
173 * RO vcache or volume, first check to see if the server is down. If
174 * it _is_, don't invalidate it, cuz we might just as well keep using
175 * it. Possibly, we could do the same thing for items in RW volumes,
176 * but that bears some drinking about.
178 * Don't really need to invalidate the hints, we could just wait to see if
179 * the dv has changed after a subsequent FetchStatus, but this is safer.
182 /* Sanity check on the callback queue. Allow for slop in the computation. */
184 #define CBQ_LIMIT (afs_maxvcount + 10)
186 #define CBQ_LIMIT (afs_cacheStats + afs_stats_cmperf.vcacheXAllocs + 10)
189 void afs_CheckCallbacks(unsigned int secs)
192 register struct afs_q *tq;
198 ObtainWriteLock(&afs_xcbhash,85); /* pretty likely I'm going to remove something */
200 for(safety = 0, tq = cbHashT[base].head.prev;
201 (safety <= CBQ_LIMIT) && (tq != &(cbHashT[base].head));
206 if (tvc->cbExpires < now + secs) { /* race #1 here */
207 /* Get the volume, and if its callback expiration time is more than secs
208 * seconds into the future, update this vcache entry and requeue it below
210 if ((tvc->states & CRO) && (tvp=afs_FindVolume(&(tvc->fid), READ_LOCK))) {
211 if (tvp->expireTime > now + secs) {
212 tvc->cbExpires = tvp->expireTime; /* XXX race here */
216 for (i=0; i < MAXHOSTS && tvp->serverHost[i]; i++) {
217 if (!(tvp->serverHost[i]->flags & SRVR_ISDOWN)) {
218 /* What about locking xvcache or vrefcount++ or
219 * write locking tvc? */
221 tq->prev = tq->next = NULL;
222 tvc->states &= ~(CStatd | CMValid | CUnique);
223 if ((tvc->fid.Fid.Vnode & 1) || (vType(tvc) == VDIR))
224 osi_dnlc_purgedp(tvc);
225 tvc->quick.stamp = 0;
226 tvc->h1.dchint = NULL;/*invalidate em */
227 afs_ResetVolumeInfo(tvp);
232 afs_PutVolume(tvp, READ_LOCK);
235 /* Do I need to worry about things like execsorwriters?
236 * What about locking xvcache or vrefcount++ or write locking tvc?
239 tq->prev = tq->next = NULL;
240 tvc->states &= ~(CStatd | CMValid | CUnique);
241 if ((tvc->fid.Fid.Vnode & 1) || (vType(tvc) == VDIR))
242 osi_dnlc_purgedp(tvc);
246 if ((tvc->cbExpires > basetime) && CBHash(tvc->cbExpires - basetime)) {
247 /* it's been renewed on us. Have to be careful not to put it back
248 * into this slot, or we may never get out of here.
251 slot = (CBHash(tvc->cbExpires - basetime)+base)%CBHTSIZE ;
254 QRemove(&(tvc->callsort));
255 QAdd( &(cbHashT[slot].head), &(tvc->callsort) );
256 /* XXX remember to update volume expiration time */
257 /* -- not needed for correctness, though */
262 if (safety > CBQ_LIMIT) {
263 afs_stats_cmperf.cbloops++;
265 osi_Panic ("CheckCallbacks");
267 afs_warn("AFS Internal Error (minor): please contact AFS Product Support.\n");
268 ReleaseWriteLock(&afs_xcbhash);
272 else ReleaseWriteLock(&afs_xcbhash);
275 /* XXX future optimization:
276 if this item has been recently accessed, queue up a stat for it.
280 ObtainReadLock(&afs_xdcache);
281 if ((adc = tvc->quick.dc) && (adc->stamp == tvc->quick.stamp)
282 && (afs_indexTimes[adc->index] > afs_indexCounter - 20)) {
283 queue up the stat request
285 ReleaseReadLock(&afs_xdcache);
290 } /* afs_CheckCallback */
293 * to be used only in dire circumstances, this drops all callbacks on
294 * the floor, without giving them back to the server. It's ok, the server can
295 * deal with it, but it is a little bit rude.
297 void afs_FlushCBs(void)
300 register struct vcache *tvc;
302 ObtainWriteLock(&afs_xcbhash,86); /* pretty likely I'm going to remove something */
304 for (i = 0; i < VCSIZE; i++) /* reset all the vnodes */
305 for (tvc = afs_vhashT[i]; tvc; tvc = tvc->hnext) {
307 tvc->quick.stamp = 0;
308 tvc->h1.dchint = NULL; /* invalidate hints */
309 tvc->states &= ~(CStatd);
310 if ((tvc->fid.Fid.Vnode & 1) || (vType(tvc) == VDIR))
311 osi_dnlc_purgedp(tvc);
312 tvc->callsort.prev = tvc->callsort.next = NULL;
317 ReleaseWriteLock(&afs_xcbhash);
320 /* afs_FlushServerCBs
321 * to be used only in dire circumstances, this drops all callbacks on
322 * the floor for a specific server, without giving them back to the server.
323 * It's ok, the server can deal with it, but it is a little bit rude.
325 void afs_FlushServerCBs(struct server *srvp)
328 register struct vcache *tvc;
330 ObtainWriteLock(&afs_xcbhash,86); /* pretty likely I'm going to remove something */
332 for (i=0; i<VCSIZE; i++) { /* reset all the vnodes */
333 for (tvc=afs_vhashT[i]; tvc; tvc=tvc->hnext) {
334 if (tvc->callback == srvp) {
336 tvc->quick.stamp = 0;
337 tvc->h1.dchint = NULL; /* invalidate hints */
338 tvc->states &= ~(CStatd);
339 if ((tvc->fid.Fid.Vnode & 1) || (vType(tvc) == VDIR)) {
340 osi_dnlc_purgedp(tvc);
342 afs_DequeueCallback(tvc);
347 ReleaseWriteLock(&afs_xcbhash);
351 * called to initialize static and global variables associated with
352 * the Callback expiration management mechanism.
354 void afs_InitCBQueue(int doLockInit)
358 memset((char *)cbHashT, 0, CBHTSIZE*sizeof(struct bucket));
359 for (i=0;i<CBHTSIZE;i++) {
360 QInit(&(cbHashT[i].head));
361 /* Lock_Init(&(cbHashT[i].lock)); only if you want lots of locks, which
362 * don't seem too useful at present. */
365 basetime = osi_Time();
367 Lock_Init(&afs_xcbhash);
370 /* Because there are no real-time guarantees, and especially because a
371 * thread may wait on a lock indefinitely, this routine has to be
372 * careful that it doesn't get permanently out-of-date. Important
373 * assumption: this routine is only called from afs_Daemon, so there
374 * can't be more than one instance of this running at any one time.
375 * Presumes that basetime is never 0, and is always sane.
377 * Before calling this routine, be sure that the first slot is pretty
378 * empty. This -20 is because the granularity of the checks in
379 * afs_Daemon is pretty large, so I'd rather err on the side of safety
380 * sometimes. The fact that I only bump basetime by CBHTSLOTLEN-1
381 * instead of the whole CBHTSLOTLEN is also for "safety".
382 * Conceptually, it makes this clock run just a little faster than the
383 * clock governing which slot a callback gets hashed into. Both of these
384 * things make CheckCallbacks work a little harder than it would have to
385 * if I wanted to cut things finer.
386 * Everything from the old first slot is carried over into the new first
387 * slot. Thus, if there were some things that ought to have been invalidated,
388 * but weren't (say, if the server was down), they will be examined at every
389 * opportunity thereafter.
391 int afs_BumpBase(void)
397 ObtainWriteLock(&afs_xcbhash,87);
400 while ( basetime + (CBHTSLOTLEN-20) <= now ) {
402 basetime += CBHTSLOTLEN-1;
403 base = (base+1) % CBHTSIZE;
405 if (!QEmpty(&(cbHashT[oldbase].head))) {
406 QCat(&(cbHashT[oldbase].head), &(cbHashT[base].head));
409 ReleaseWriteLock(&afs_xcbhash);