2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 #include <afsconfig.h>
11 #include "afs/param.h"
18 #include <sys/sleep.h>
21 #include "afs/sysincludes.h" /* Standard vendor system headers */
22 #include "afsincludes.h" /* Afs-based standard headers */
23 #include "afs/afs_stats.h" /* statistics gathering code */
24 #include "afs/afs_cbqueue.h"
26 #include <sys/adspace.h> /* for vm_att(), vm_det() */
29 #if defined(AFS_CACHE_BYPASS)
30 #include "afs/afs_bypasscache.h"
31 #endif// defined(AFS_CACHE_BYPASS)
32 /* background request queue size */
33 afs_lock_t afs_xbrs; /* lock for brs */
34 static int brsInit = 0;
35 short afs_brsWaiters = 0; /* number of users waiting for brs buffers */
36 short afs_brsDaemons = 0; /* number of daemons waiting for brs requests */
37 struct brequest afs_brs[NBRS]; /* request structures */
38 struct afs_osi_WaitHandle AFS_WaitHandler, AFS_CSWaitHandler;
39 static int afs_brs_count = 0; /* request counter, to service reqs in order */
41 static int rxepoch_checked = 0;
42 #define afs_CheckRXEpoch() {if (rxepoch_checked == 0 && rxkad_EpochWasSet) { \
43 rxepoch_checked = 1; afs_GCUserData(/* force flag */ 1); } }
45 /* PAG garbage collection */
46 /* We induce a compile error if param.h does not define AFS_GCPAGS */
47 afs_int32 afs_gcpags = AFS_GCPAGS;
48 afs_int32 afs_gcpags_procsize = 0;
50 afs_int32 afs_CheckServerDaemonStarted = 0;
51 #ifndef DEFAULT_PROBE_INTERVAL
52 #define DEFAULT_PROBE_INTERVAL 30 /* default to 3 min */
54 afs_int32 afs_probe_interval = DEFAULT_PROBE_INTERVAL;
55 afs_int32 afs_probe_all_interval = 600;
56 afs_int32 afs_nat_probe_interval = 60;
57 afs_int32 afs_preCache = 0;
59 #define PROBE_WAIT() (1000 * (afs_probe_interval - ((afs_random() & 0x7fffffff) \
60 % (afs_probe_interval/2))))
63 afs_SetCheckServerNATmode(int isnat)
65 static afs_int32 old_intvl, old_all_intvl;
68 if (isnat && !wasnat) {
69 old_intvl = afs_probe_interval;
70 old_all_intvl = afs_probe_all_interval;
71 afs_probe_interval = afs_nat_probe_interval;
72 afs_probe_all_interval = afs_nat_probe_interval;
73 afs_osi_CancelWait(&AFS_CSWaitHandler);
74 } else if (!isnat && wasnat) {
75 afs_probe_interval = old_intvl;
76 afs_probe_all_interval = old_all_intvl;
82 afs_CheckServerDaemon(void)
84 afs_int32 now, delay, lastCheck, last10MinCheck;
86 afs_CheckServerDaemonStarted = 1;
88 while (afs_initState < 101)
89 afs_osi_Sleep(&afs_initState);
90 afs_osi_Wait(PROBE_WAIT(), &AFS_CSWaitHandler, 0);
92 last10MinCheck = lastCheck = osi_Time();
94 if (afs_termState == AFSOP_STOP_CS) {
95 afs_termState = AFSOP_STOP_BKG;
96 afs_osi_Wakeup(&afs_termState);
101 if (afs_probe_interval + lastCheck <= now) {
102 afs_CheckServers(1, NULL); /* check down servers */
103 lastCheck = now = osi_Time();
106 if (afs_probe_all_interval + last10MinCheck <= now) {
107 afs_Trace1(afs_iclSetp, CM_TRACE_PROBEUP, ICL_TYPE_INT32, afs_probe_all_interval);
108 afs_CheckServers(0, NULL);
109 last10MinCheck = now = osi_Time();
111 /* shutdown check. */
112 if (afs_termState == AFSOP_STOP_CS) {
113 afs_termState = AFSOP_STOP_BKG;
114 afs_osi_Wakeup(&afs_termState);
118 /* Compute time to next probe. */
119 delay = afs_probe_interval + lastCheck;
120 if (delay > afs_probe_all_interval + last10MinCheck)
121 delay = afs_probe_all_interval + last10MinCheck;
125 afs_osi_Wait(delay * 1000, &AFS_CSWaitHandler, 0);
127 afs_CheckServerDaemonStarted = 0;
130 extern int vfs_context_ref;
136 struct afs_exporter *exporter;
138 afs_int32 last3MinCheck, last10MinCheck, last60MinCheck, lastNMinCheck;
139 afs_int32 last1MinCheck;
140 afs_uint32 lastCBSlotBump;
143 AFS_STATCNT(afs_Daemon);
144 last1MinCheck = last3MinCheck = last60MinCheck = last10MinCheck =
147 afs_rootFid.Fid.Volume = 0;
148 while (afs_initState < 101)
149 afs_osi_Sleep(&afs_initState);
151 #ifdef AFS_DARWIN80_ENV
152 if (afs_osi_ctxtp_initialized)
153 osi_Panic("vfs context already initialized");
154 while (afs_osi_ctxtp && vfs_context_ref)
155 afs_osi_Sleep(&afs_osi_ctxtp);
156 if (afs_osi_ctxtp && !vfs_context_ref)
157 vfs_context_rele(afs_osi_ctxtp);
158 afs_osi_ctxtp = vfs_context_create(NULL);
159 afs_osi_ctxtp_initialized = 1;
162 lastCBSlotBump = now;
164 /* when a lot of clients are booted simultaneously, they develop
165 * annoying synchronous VL server bashing behaviors. So we stagger them.
167 last1MinCheck = now + ((afs_random() & 0x7fffffff) % 60); /* an extra 30 */
168 last3MinCheck = now - 90 + ((afs_random() & 0x7fffffff) % 180);
169 last60MinCheck = now - 1800 + ((afs_random() & 0x7fffffff) % 3600);
170 last10MinCheck = now - 300 + ((afs_random() & 0x7fffffff) % 600);
171 lastNMinCheck = now - 90 + ((afs_random() & 0x7fffffff) % 180);
173 /* start off with afs_initState >= 101 (basic init done) */
175 afs_CheckCallbacks(20); /* unstat anything which will expire soon */
177 /* things to do every 20 seconds or less - required by protocol spec */
179 afs_FlushActiveVcaches(0); /* flush NFS writes */
180 afs_FlushVCBs(1); /* flush queued callbacks */
181 afs_MaybeWakeupTruncateDaemon(); /* free cache space if have too */
182 rx_CheckPackets(); /* Does RX need more packets? */
185 if (lastCBSlotBump + CBHTSLOTLEN < now) { /* pretty time-dependant */
186 lastCBSlotBump = now;
187 if (afs_BumpBase()) {
188 afs_CheckCallbacks(20); /* unstat anything which will expire soon */
192 if (last1MinCheck + 60 < now) {
193 /* things to do every minute */
194 DFlush(); /* write out dir buffers */
195 afs_WriteThroughDSlots(); /* write through cacheinfo entries */
196 ObtainWriteLock(&afs_xvcache, 736);
197 afs_FlushReclaimedVcaches();
198 ReleaseWriteLock(&afs_xvcache);
199 afs_FlushActiveVcaches(1); /* keep flocks held & flush nfs writes */
201 #ifdef AFS_DISCON_ENV
202 afs_StoreDirtyVcaches();
209 if (last3MinCheck + 180 < now) {
210 afs_CheckTokenCache(); /* check for access cache resets due to expired
214 if (!afs_CheckServerDaemonStarted) {
215 /* Do the check here if the correct afsd is not installed. */
218 printf("Please install afsd with check server daemon.\n");
220 if (lastNMinCheck + afs_probe_interval < now) {
221 /* only check down servers */
222 afs_CheckServers(1, NULL);
226 if (last10MinCheck + 600 < now) {
227 #ifdef AFS_USERSPACE_IP_ADDR
228 extern int rxi_GetcbiInfo(void);
230 afs_Trace1(afs_iclSetp, CM_TRACE_PROBEUP, ICL_TYPE_INT32, 600);
231 #ifdef AFS_USERSPACE_IP_ADDR
232 if (rxi_GetcbiInfo()) { /* addresses changed from last time */
235 #else /* AFS_USERSPACE_IP_ADDR */
236 if (rxi_GetIFInfo()) { /* addresses changed from last time */
239 #endif /* else AFS_USERSPACE_IP_ADDR */
240 if (!afs_CheckServerDaemonStarted)
241 afs_CheckServers(0, NULL);
242 afs_GCUserData(0); /* gc old conns */
243 /* This is probably the wrong way of doing GC for the various exporters but it will suffice for a while */
244 for (exporter = root_exported; exporter;
245 exporter = exporter->exp_next) {
246 (void)EXP_GC(exporter, 0); /* Generalize params */
251 afs_CheckVolumeNames(AFS_VOLCHECK_EXPIRED |
255 afs_CheckVolumeNames(AFS_VOLCHECK_EXPIRED |
260 last10MinCheck = now;
262 if (last60MinCheck + 3600 < now) {
263 afs_Trace1(afs_iclSetp, CM_TRACE_PROBEVOLUME, ICL_TYPE_INT32,
265 afs_CheckRootVolume();
267 if (afs_gcpags == AFS_GCPAGS_OK) {
272 last60MinCheck = now;
274 if (afs_initState < 300) { /* while things ain't rosy */
275 code = afs_CheckRootVolume();
277 afs_initState = 300; /* succeeded */
278 if (afs_initState < 200)
279 afs_initState = 200; /* tried once */
280 afs_osi_Wakeup(&afs_initState);
283 /* 18285 is because we're trying to divide evenly into 128, that is,
284 * CBSlotLen, while staying just under 20 seconds. If CBSlotLen
285 * changes, should probably change this interval, too.
286 * Some of the preceding actions may take quite some time, so we
287 * might not want to wait the entire interval */
288 now = 18285 - (osi_Time() - now);
290 afs_osi_Wait(now, &AFS_WaitHandler, 0);
293 if (afs_termState == AFSOP_STOP_AFS) {
294 if (afs_CheckServerDaemonStarted)
295 afs_termState = AFSOP_STOP_CS;
297 afs_termState = AFSOP_STOP_BKG;
298 afs_osi_Wakeup(&afs_termState);
305 afs_CheckRootVolume(void)
307 char rootVolName[32];
308 struct volume *tvp = NULL;
309 int usingDynroot = afs_GetDynrootEnable();
312 AFS_STATCNT(afs_CheckRootVolume);
313 if (*afs_rootVolumeName == 0) {
314 strcpy(rootVolName, "root.afs");
316 strcpy(rootVolName, afs_rootVolumeName);
320 afs_GetDynrootFid(&afs_rootFid);
321 tvp = afs_GetVolume(&afs_rootFid, NULL, READ_LOCK);
323 struct cell *lc = afs_GetPrimaryCell(READ_LOCK);
327 localcell = lc->cellNum;
328 afs_PutCell(lc, READ_LOCK);
329 tvp = afs_GetVolumeByName(rootVolName, localcell, 1, NULL, READ_LOCK);
332 int len = strlen(rootVolName);
334 if ((len < 9) || strcmp(&rootVolName[len - 9], ".readonly")) {
335 strcpy(buf, rootVolName);
336 afs_strcat(buf, ".readonly");
337 tvp = afs_GetVolumeByName(buf, localcell, 1, NULL, READ_LOCK);
341 int volid = (tvp->roVol ? tvp->roVol : tvp->volume);
342 afs_rootFid.Cell = localcell;
343 if (afs_rootFid.Fid.Volume && afs_rootFid.Fid.Volume != volid
345 struct vcache *tvc = afs_globalVp;
346 /* If we had a root fid before and it changed location we reset
347 * the afs_globalVp so that it will be reevaluated.
348 * Just decrement the reference count. This only occurs during
349 * initial cell setup and can panic the machine if we set the
350 * count to zero and fs checkv is executed when the current
353 #ifdef AFS_LINUX20_ENV
355 struct vrequest treq;
361 afs_rootFid.Fid.Volume = volid;
362 afs_rootFid.Fid.Vnode = 1;
363 afs_rootFid.Fid.Unique = 1;
366 if (afs_InitReq(&treq, credp))
368 vcp = afs_GetVCache(&afs_rootFid, &treq, NULL, NULL);
371 afs_getattr(vcp, &vattr, credp);
372 afs_fill_inode(AFSTOV(vcp), &vattr);
374 dp = d_find_alias(AFSTOV(afs_globalVp));
376 #if defined(AFS_LINUX24_ENV)
377 spin_lock(&dcache_lock);
378 #if defined(AFS_LINUX26_ENV)
379 spin_lock(&dp->d_lock);
382 list_del_init(&dp->d_alias);
383 list_add(&dp->d_alias, &(AFSTOV(vcp)->i_dentry));
384 dp->d_inode = AFSTOV(vcp);
385 #if defined(AFS_LINUX24_ENV)
386 #if defined(AFS_LINUX26_ENV)
387 spin_unlock(&dp->d_lock);
389 spin_unlock(&dcache_lock);
393 AFS_FAST_RELE(afs_globalVp);
399 #ifdef AFS_DARWIN80_ENV
400 afs_PutVCache(afs_globalVp);
402 AFS_FAST_RELE(afs_globalVp);
407 afs_rootFid.Fid.Volume = volid;
408 afs_rootFid.Fid.Vnode = 1;
409 afs_rootFid.Fid.Unique = 1;
413 afs_initState = 300; /* won */
414 afs_osi_Wakeup(&afs_initState);
415 afs_PutVolume(tvp, READ_LOCK);
417 if (afs_rootFid.Fid.Volume)
423 /* ptr_parm 0 is the pathname, size_parm 0 to the fetch is the chunk number */
425 BPath(register struct brequest *ab)
427 register struct dcache *tdc = NULL;
428 struct vcache *tvc = NULL;
429 struct vnode *tvn = NULL;
430 #ifdef AFS_LINUX22_ENV
431 struct dentry *dp = NULL;
433 afs_size_t offset, len;
434 struct vrequest treq;
438 if ((code = afs_InitReq(&treq, ab->cred)))
441 #ifdef AFS_LINUX22_ENV
442 code = gop_lookupname((char *)ab->ptr_parm[0], AFS_UIOSYS, 1, &dp);
444 tvn = (struct vnode *)dp->d_inode;
446 code = gop_lookupname((char *)ab->ptr_parm[0], AFS_UIOSYS, 1, &tvn);
449 osi_FreeLargeSpace((char *)ab->ptr_parm[0]); /* free path name buffer here */
452 /* now path may not have been in afs, so check that before calling our cache manager */
453 if (!tvn || !IsAfsVnode(tvn)) {
454 /* release it and give up */
456 #ifdef AFS_LINUX22_ENV
465 /* here we know its an afs vnode, so we can get the data for the chunk */
466 tdc = afs_GetDCache(tvc, ab->size_parm[0], &treq, &offset, &len, 1);
470 #ifdef AFS_LINUX22_ENV
477 /* size_parm 0 to the fetch is the chunk number,
478 * ptr_parm 0 is the dcache entry to wakeup,
479 * size_parm 1 is true iff we should release the dcache entry here.
482 BPrefetch(register struct brequest *ab)
484 register struct dcache *tdc;
485 register struct vcache *tvc;
486 afs_size_t offset, len, abyte, totallen = 0;
487 struct vrequest treq;
489 AFS_STATCNT(BPrefetch);
490 if ((len = afs_InitReq(&treq, ab->cred)))
492 abyte = ab->size_parm[0];
495 tdc = afs_GetDCache(tvc, abyte, &treq, &offset, &len, 1);
501 } while ((totallen < afs_preCache) && tdc && (len > 0));
502 /* now, dude may be waiting for us to clear DFFetchReq bit; do so. Can't
503 * use tdc from GetDCache since afs_GetDCache may fail, but someone may
504 * be waiting for our wakeup anyway.
506 tdc = (struct dcache *)(ab->ptr_parm[0]);
507 ObtainSharedLock(&tdc->lock, 640);
508 if (tdc->mflags & DFFetchReq) {
509 UpgradeSToWLock(&tdc->lock, 641);
510 tdc->mflags &= ~DFFetchReq;
511 ReleaseWriteLock(&tdc->lock);
513 ReleaseSharedLock(&tdc->lock);
515 afs_osi_Wakeup(&tdc->validPos);
516 if (ab->size_parm[1]) {
517 afs_PutDCache(tdc); /* put this one back, too */
521 #if defined(AFS_CACHE_BYPASS)
522 #if 1 /* XXX Matt debugging */
526 BPrefetchNoCache(register struct brequest *ab)
528 struct vrequest treq;
531 if ((len = afs_InitReq(&treq, ab->cred)))
535 /* OS-specific prefetch routine */
536 afs_PrefetchNoCache(ab->vc, ab->cred, (struct nocache_read_request *) ab->ptr_parm[0]);
538 #warning Cache-bypass code path not implemented in UKERNEL
544 BStore(register struct brequest *ab)
546 register struct vcache *tvc;
547 register afs_int32 code;
548 struct vrequest treq;
549 #if defined(AFS_SGI_ENV)
550 struct cred *tmpcred;
554 if ((code = afs_InitReq(&treq, ab->cred)))
558 #if defined(AFS_SGI_ENV)
560 * Since StoreOnLastReference can end up calling osi_SyncVM which
561 * calls into VM code that assumes that u.u_cred has the
562 * correct credentials, we set our to theirs for this xaction
564 tmpcred = OSI_GET_CURRENT_CRED();
565 OSI_SET_CURRENT_CRED(ab->cred);
568 * To avoid recursion since the WriteLock may be released during VM
569 * operations, we hold the VOP_RWLOCK across this transaction as
570 * do the other callers of StoreOnLastReference
572 AFS_RWLOCK((vnode_t *) tvc, 1);
574 ObtainWriteLock(&tvc->lock, 209);
575 code = afs_StoreOnLastReference(tvc, &treq);
576 ReleaseWriteLock(&tvc->lock);
577 #if defined(AFS_SGI_ENV)
578 OSI_SET_CURRENT_CRED(tmpcred);
579 AFS_RWUNLOCK((vnode_t *) tvc, 1);
581 /* now set final return code, and wakeup anyone waiting */
582 if ((ab->flags & BUVALID) == 0) {
583 ab->code = afs_CheckCode(code, &treq, 43); /* set final code, since treq doesn't go across processes */
584 ab->flags |= BUVALID;
585 if (ab->flags & BUWAIT) {
586 ab->flags &= ~BUWAIT;
592 /* release a held request buffer */
594 afs_BRelease(register struct brequest *ab)
597 AFS_STATCNT(afs_BRelease);
598 MObtainWriteLock(&afs_xbrs, 294);
599 if (--ab->refCount <= 0) {
603 afs_osi_Wakeup(&afs_brsWaiters);
604 MReleaseWriteLock(&afs_xbrs);
607 /* return true if bkg fetch daemons are all busy */
611 AFS_STATCNT(afs_BBusy);
612 if (afs_brsDaemons > 0)
618 afs_BQueue(register short aopcode, register struct vcache *avc,
619 afs_int32 dontwait, afs_int32 ause, struct AFS_UCRED *acred,
620 afs_size_t asparm0, afs_size_t asparm1, void *apparm0)
623 register struct brequest *tb;
625 AFS_STATCNT(afs_BQueue);
626 MObtainWriteLock(&afs_xbrs, 296);
629 for (i = 0; i < NBRS; i++, tb++) {
630 if (tb->refCount == 0)
635 tb->opcode = aopcode;
640 VN_HOLD(AFSTOV(avc));
642 tb->refCount = ause + 1;
643 tb->size_parm[0] = asparm0;
644 tb->size_parm[1] = asparm1;
645 tb->ptr_parm[0] = apparm0;
648 tb->ts = afs_brs_count++;
649 /* if daemons are waiting for work, wake them up */
650 if (afs_brsDaemons > 0) {
651 afs_osi_Wakeup(&afs_brsDaemons);
653 MReleaseWriteLock(&afs_xbrs);
657 MReleaseWriteLock(&afs_xbrs);
660 /* no free buffers, sleep a while */
662 MReleaseWriteLock(&afs_xbrs);
663 afs_osi_Sleep(&afs_brsWaiters);
664 MObtainWriteLock(&afs_xbrs, 301);
670 /* AIX 4.1 has a much different sleep/wakeup mechanism available for use.
671 * The modifications here will work for either a UP or MP machine.
673 struct buf *afs_asyncbuf = (struct buf *)0;
674 tid_t afs_asyncbuf_cv = EVENT_NULL;
675 afs_int32 afs_biodcnt = 0;
677 /* in implementing this, I assumed that all external linked lists were
680 * Several places in this code traverse a linked list. The algorithm
681 * used here is probably unfamiliar to most people. Careful examination
682 * will show that it eliminates an assignment inside the loop, as compared
683 * to the standard algorithm, at the cost of occasionally using an extra
689 * This function obtains, and returns, a pointer to a buffer for
690 * processing by a daemon. It sleeps until such a buffer is available.
691 * The source of buffers for it is the list afs_asyncbuf (see also
692 * afs_gn_strategy). This function may be invoked concurrently by
693 * several processes, that is, several instances of the same daemon.
694 * afs_gn_strategy, which adds buffers to the list, runs at interrupt
695 * level, while get_bioreq runs at process level.
697 * Since AIX 4.1 can wake just one process at a time, the separate sleep
698 * addresses have been removed.
699 * Note that the kernel_lock is held until the e_sleep_thread() occurs.
700 * The afs_asyncbuf_lock is primarily used to serialize access between
701 * process and interrupts.
703 Simple_lock afs_asyncbuf_lock;
707 struct buf *bp = NULL;
709 struct buf **bestlbpP, **lbpP;
711 struct buf *t1P, *t2P; /* temp pointers for list manipulation */
714 struct afs_bioqueue *s;
716 /* ??? Does the forward pointer of the returned buffer need to be NULL?
719 /* Disable interrupts from the strategy function, and save the
720 * prior priority level and lock access to the afs_asyncbuf.
723 oldPriority = disable_lock(INTMAX, &afs_asyncbuf_lock);
727 /* look for oldest buffer */
728 bp = bestbp = afs_asyncbuf;
729 bestage = (long)bestbp->av_back;
730 bestlbpP = &afs_asyncbuf;
736 if ((long)bp->av_back - bestage < 0) {
739 bestage = (long)bp->av_back;
743 *bestlbpP = bp->av_forw;
746 /* If afs_asyncbuf is null, it is necessary to go to sleep.
747 * e_wakeup_one() ensures that only one thread wakes.
750 /* The LOCK_HANDLER indicates to e_sleep_thread to only drop the
751 * lock on an MP machine.
754 e_sleep_thread(&afs_asyncbuf_cv, &afs_asyncbuf_lock,
755 LOCK_HANDLER | INTERRUPTIBLE);
756 if (interrupted == THREAD_INTERRUPTED) {
757 /* re-enable interrupts from strategy */
758 unlock_enable(oldPriority, &afs_asyncbuf_lock);
762 } /* end of "else asyncbuf is empty" */
763 } /* end of "inner loop" */
767 unlock_enable(oldPriority, &afs_asyncbuf_lock);
770 /* For the convenience of other code, replace the gnodes in
771 * the b_vp field of bp and the other buffers on the b_work
772 * chain with the corresponding vnodes.
774 * ??? what happens to the gnodes? They're not just cut loose,
778 t2P = (struct buf *)t1P->b_work;
779 t1P->b_vp = ((struct gnode *)t1P->b_vp)->gn_vnode;
783 t1P = (struct buf *)t2P->b_work;
784 t2P->b_vp = ((struct gnode *)t2P->b_vp)->gn_vnode;
789 /* If the buffer does not specify I/O, it may immediately
790 * be returned to the caller. This condition is detected
791 * by examining the buffer's flags (the b_flags field). If
792 * the B_PFPROT bit is set, the buffer represents a protection
793 * violation, rather than a request for I/O. The remainder
794 * of the outer loop handles the case where the B_PFPROT bit is clear.
796 if (bp->b_flags & B_PFPROT) {
801 } /* end of function get_bioreq() */
806 * This function is the daemon. It is called from the syscall
807 * interface. Ordinarily, a script or an administrator will run a
808 * daemon startup utility, specifying the number of I/O daemons to
809 * run. The utility will fork off that number of processes,
810 * each making the appropriate syscall, which will cause this
811 * function to be invoked.
813 static int afs_initbiod = 0; /* this is self-initializing code */
816 afs_BioDaemon(afs_int32 nbiods)
818 afs_int32 code, s, pflg = 0;
820 struct buf *bp, *bp1, *tbp1, *tbp2; /* temp pointers only */
828 /* pin lock, since we'll be using it in an interrupt. */
829 lock_alloc(&afs_asyncbuf_lock, LOCK_ALLOC_PIN, 2, 1);
830 simple_lock_init(&afs_asyncbuf_lock);
831 pin(&afs_asyncbuf, sizeof(struct buf *));
832 pin(&afs_asyncbuf_cv, sizeof(afs_int32));
835 /* Ignore HUP signals... */
837 sigset_t sigbits, osigbits;
839 * add SIGHUP to the set of already masked signals
841 SIGFILLSET(sigbits); /* allow all signals */
842 SIGDELSET(sigbits, SIGHUP); /* except SIGHUP */
843 limit_sigs(&sigbits, &osigbits); /* and already masked */
845 /* Main body starts here -- this is an intentional infinite loop, and
848 * Now, the loop will exit if get_bioreq() returns NULL, indicating
849 * that we've been interrupted.
852 bp = afs_get_bioreq();
854 break; /* we were interrupted */
855 if (code = setjmpx(&jmpbuf)) {
856 /* This should not have happend, maybe a lack of resources */
858 s = disable_lock(INTMAX, &afs_asyncbuf_lock);
859 for (bp1 = bp; bp; bp = bp1) {
861 bp1 = (struct buf *)bp1->b_work;
864 bp->b_flags |= B_ERROR;
867 unlock_enable(s, &afs_asyncbuf_lock);
871 vcp = VTOAFS(bp->b_vp);
872 if (bp->b_flags & B_PFSTORE) { /* XXXX */
873 ObtainWriteLock(&vcp->lock, 404);
874 if (vcp->v.v_gnode->gn_mwrcnt) {
875 afs_offs_t newlength =
876 (afs_offs_t) dbtob(bp->b_blkno) + bp->b_bcount;
877 if (vcp->m.Length < newlength) {
878 afs_Trace4(afs_iclSetp, CM_TRACE_SETLENGTH,
879 ICL_TYPE_STRING, __FILE__, ICL_TYPE_LONG,
880 __LINE__, ICL_TYPE_OFFSET,
881 ICL_HANDLE_OFFSET(vcp->m.Length),
882 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(newlength));
883 vcp->m.Length = newlength;
886 ReleaseWriteLock(&vcp->lock);
888 /* If the buffer represents a protection violation, rather than
889 * an actual request for I/O, no special action need be taken.
891 if (bp->b_flags & B_PFPROT) {
892 iodone(bp); /* Notify all users of the buffer that we're done */
897 ObtainWriteLock(&vcp->pvmlock, 211);
899 * First map its data area to a region in the current address space
900 * by calling vm_att with the subspace identifier, and a pointer to
901 * the data area. vm_att returns a new data area pointer, but we
902 * also want to hang onto the old one.
904 tmpaddr = bp->b_baddr;
905 bp->b_baddr = (caddr_t) vm_att(bp->b_xmemd.subspace_id, tmpaddr);
906 tmperr = afs_ustrategy(bp); /* temp variable saves offset calculation */
907 if (tmperr) { /* in non-error case */
908 bp->b_flags |= B_ERROR; /* should other flags remain set ??? */
909 bp->b_error = tmperr;
912 /* Unmap the buffer's data area by calling vm_det. Reset data area
913 * to the value that we saved above.
916 bp->b_baddr = tmpaddr;
919 * buffer may be linked with other buffers via the b_work field.
920 * See also afs_gn_strategy. For each buffer in the chain (including
921 * bp) notify all users of the buffer that the daemon is finished
922 * using it by calling iodone.
923 * assumes iodone can modify the b_work field.
926 tbp2 = (struct buf *)tbp1->b_work;
931 tbp1 = (struct buf *)tbp2->b_work;
937 ReleaseWriteLock(&vcp->pvmlock); /* Unlock the vnode. */
939 } /* infinite loop (unless we're interrupted) */
940 } /* end of afs_BioDaemon() */
942 #endif /* AFS_AIX41_ENV */
947 afs_BackgroundDaemon(void)
952 AFS_STATCNT(afs_BackgroundDaemon);
953 /* initialize subsystem */
955 LOCK_INIT(&afs_xbrs, "afs_xbrs");
956 memset((char *)afs_brs, 0, sizeof(afs_brs));
958 #if defined (AFS_SGI_ENV) && defined(AFS_SGI_SHORTSTACK)
960 * steal the first daemon for doing delayed DSlot flushing
961 * (see afs_GetDownDSlot)
970 MObtainWriteLock(&afs_xbrs, 302);
973 struct brequest *min_tb = NULL;
975 if (afs_termState == AFSOP_STOP_BKG) {
977 afs_termState = AFSOP_STOP_TRUNCDAEMON;
978 MReleaseWriteLock(&afs_xbrs);
979 afs_osi_Wakeup(&afs_termState);
986 for (i = 0; i < NBRS; i++, tb++) {
987 /* look for request with smallest ts */
988 if ((tb->refCount > 0) && !(tb->flags & BSTARTED)) {
989 /* new request, not yet picked up */
990 if ((min_tb && (min_ts - tb->ts > 0)) || !min_tb) {
997 /* claim and process this request */
998 tb->flags |= BSTARTED;
999 MReleaseWriteLock(&afs_xbrs);
1001 afs_Trace1(afs_iclSetp, CM_TRACE_BKG1, ICL_TYPE_INT32,
1003 if (tb->opcode == BOP_FETCH)
1005 #if defined(AFS_CACHE_BYPASS)
1006 else if (tb->opcode == BOP_FETCH_NOCACHE)
1007 BPrefetchNoCache(tb);
1009 else if (tb->opcode == BOP_STORE)
1011 else if (tb->opcode == BOP_PATH)
1014 panic("background bop");
1016 AFS_RELE(AFSTOV(tb->vc)); /* MUST call vnode layer or could lose vnodes */
1021 tb->cred = (struct AFS_UCRED *)0;
1023 afs_BRelease(tb); /* this grabs and releases afs_xbrs lock */
1024 MObtainWriteLock(&afs_xbrs, 305);
1027 /* wait for new request */
1029 MReleaseWriteLock(&afs_xbrs);
1030 afs_osi_Sleep(&afs_brsDaemons);
1031 MObtainWriteLock(&afs_xbrs, 307);
1039 shutdown_daemons(void)
1041 AFS_STATCNT(shutdown_daemons);
1042 if (afs_cold_shutdown) {
1043 afs_brsDaemons = brsInit = 0;
1044 rxepoch_checked = afs_nbrs = 0;
1045 memset((char *)afs_brs, 0, sizeof(afs_brs));
1046 memset((char *)&afs_xbrs, 0, sizeof(afs_lock_t));
1048 #ifdef AFS_AIX41_ENV
1049 lock_free(&afs_asyncbuf_lock);
1050 unpin(&afs_asyncbuf, sizeof(struct buf *));
1051 unpin(&afs_asyncbuf_cv, sizeof(afs_int32));
1057 #if defined(AFS_SGI_ENV) && defined(AFS_SGI_SHORTSTACK)
1059 * sgi - daemon - handles certain operations that otherwise
1060 * would use up too much kernel stack space
1062 * This all assumes that since the caller must have the xdcache lock
1063 * exclusively that the list will never be more than one long
1064 * and noone else can attempt to add anything until we're done.
1066 SV_TYPE afs_sgibksync;
1067 SV_TYPE afs_sgibkwait;
1068 lock_t afs_sgibklock;
1069 struct dcache *afs_sgibklist;
1077 if (afs_sgibklock == NULL) {
1078 SV_INIT(&afs_sgibksync, "bksync", 0, 0);
1079 SV_INIT(&afs_sgibkwait, "bkwait", 0, 0);
1080 SPINLOCK_INIT(&afs_sgibklock, "bklock");
1082 s = SPLOCK(afs_sgibklock);
1084 /* wait for something to do */
1085 SP_WAIT(afs_sgibklock, s, &afs_sgibksync, PINOD);
1086 osi_Assert(afs_sgibklist);
1088 /* XX will probably need to generalize to real list someday */
1089 s = SPLOCK(afs_sgibklock);
1090 while (afs_sgibklist) {
1091 tdc = afs_sgibklist;
1092 afs_sgibklist = NULL;
1093 SPUNLOCK(afs_sgibklock, s);
1095 tdc->dflags &= ~DFEntryMod;
1096 afs_WriteDCache(tdc, 1);
1098 s = SPLOCK(afs_sgibklock);
1101 /* done all the work - wake everyone up */
1102 while (SV_SIGNAL(&afs_sgibkwait));