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
13 #include <afsconfig.h>
14 #include "afs/param.h"
17 #include "afs/sysincludes.h" /*Standard vendor system headers */
18 #include "afsincludes.h" /*AFS-based standard headers */
19 #include "afs/afs_stats.h" /* statistics */
20 #include "afs/afs_cbqueue.h"
21 #include "afs/afs_osidnlc.h"
23 /* Forward declarations. */
24 static void afs_GetDownD(int anumber, int *aneedSpace, afs_int32 buckethint);
25 static void afs_FreeDiscardedDCache(void);
26 static void afs_DiscardDCache(struct dcache *);
27 static void afs_FreeDCache(struct dcache *);
29 static afs_int32 afs_DCGetBucket(struct vcache *);
30 static void afs_DCAdjustSize(struct dcache *, afs_int32, afs_int32);
31 static void afs_DCMoveBucket(struct dcache *, afs_int32, afs_int32);
32 static void afs_DCSizeInit(void);
33 static afs_int32 afs_DCWhichBucket(afs_int32, afs_int32);
36 * --------------------- Exported definitions ---------------------
39 afs_int32 afs_blocksUsed_0; /*!< 1K blocks in cache - in theory is zero */
40 afs_int32 afs_blocksUsed_1; /*!< 1K blocks in cache */
41 afs_int32 afs_blocksUsed_2; /*!< 1K blocks in cache */
42 afs_int32 afs_pct1 = -1;
43 afs_int32 afs_pct2 = -1;
44 afs_uint32 afs_tpct1 = 0;
45 afs_uint32 afs_tpct2 = 0;
46 afs_uint32 splitdcache = 0;
48 afs_lock_t afs_xdcache; /*!< Lock: alloc new disk cache entries */
49 afs_int32 afs_freeDCList; /*!< Free list for disk cache entries */
50 afs_int32 afs_freeDCCount; /*!< Count of elts in freeDCList */
51 afs_int32 afs_discardDCList; /*!< Discarded disk cache entries */
52 afs_int32 afs_discardDCCount; /*!< Count of elts in discardDCList */
53 struct dcache *afs_freeDSList; /*!< Free list for disk slots */
54 struct dcache *afs_Initial_freeDSList; /*!< Initial list for above */
55 afs_dcache_id_t cacheInode; /*!< Inode for CacheItems file */
56 struct osi_file *afs_cacheInodep = 0; /*!< file for CacheItems inode */
57 struct afs_q afs_DLRU; /*!< dcache LRU */
58 afs_int32 afs_dhashsize = 1024;
59 afs_int32 *afs_dvhashTbl; /*!< Data cache hash table: hashed by FID + chunk number. */
60 afs_int32 *afs_dchashTbl; /*!< Data cache hash table: hashed by FID. */
61 afs_int32 *afs_dvnextTbl; /*!< Dcache hash table links */
62 afs_int32 *afs_dcnextTbl; /*!< Dcache hash table links */
63 struct dcache **afs_indexTable; /*!< Pointers to dcache entries */
64 afs_hyper_t *afs_indexTimes; /*!< Dcache entry Access times */
65 afs_int32 *afs_indexUnique; /*!< dcache entry Fid.Unique */
66 unsigned char *afs_indexFlags; /*!< (only one) Is there data there? */
67 afs_hyper_t afs_indexCounter; /*!< Fake time for marking index
69 afs_int32 afs_cacheFiles = 0; /*!< Size of afs_indexTable */
70 afs_int32 afs_cacheBlocks; /*!< 1K blocks in cache */
71 afs_int32 afs_cacheStats; /*!< Stat entries in cache */
72 afs_int32 afs_blocksUsed; /*!< Number of blocks in use */
73 afs_int32 afs_blocksDiscarded; /*!<Blocks freed but not truncated */
74 afs_int32 afs_fsfragsize = AFS_MIN_FRAGSIZE; /*!< Underlying Filesystem minimum unit
75 *of disk allocation usually 1K
76 *this value is (truefrag -1 ) to
77 *save a bunch of subtracts... */
78 #ifdef AFS_64BIT_CLIENT
79 #ifdef AFS_VM_RDWR_ENV
80 afs_size_t afs_vmMappingEnd; /* !< For large files (>= 2GB) the VM
81 * mapping an 32bit addressing machines
82 * can only be used below the 2 GB
83 * line. From this point upwards we
84 * must do direct I/O into the cache
85 * files. The value should be on a
87 #endif /* AFS_VM_RDWR_ENV */
88 #endif /* AFS_64BIT_CLIENT */
90 /* The following is used to ensure that new dcache's aren't obtained when
91 * the cache is nearly full.
93 int afs_WaitForCacheDrain = 0;
94 int afs_TruncateDaemonRunning = 0;
95 int afs_CacheTooFull = 0;
97 afs_int32 afs_dcentries; /*!< In-memory dcache entries */
100 int dcacheDisabled = 0;
102 struct afs_cacheOps afs_UfsCacheOps = {
103 #ifndef HAVE_STRUCT_LABEL_SUPPORT
116 .truncate = osi_UFSTruncate,
117 .fread = afs_osi_Read,
118 .fwrite = afs_osi_Write,
119 .close = osi_UFSClose,
120 .vreadUIO = afs_UFSReadUIO,
121 .vwrite = afs_UFSWrite,
122 .GetDSlot = afs_UFSGetDSlot,
123 .GetVolSlot = afs_UFSGetVolSlot,
124 .HandleLink = afs_UFSHandleLink,
128 struct afs_cacheOps afs_MemCacheOps = {
129 #ifndef HAVE_STRUCT_LABEL_SUPPORT
131 afs_MemCacheTruncate,
141 .open = afs_MemCacheOpen,
142 .truncate = afs_MemCacheTruncate,
143 .fread = afs_MemReadBlk,
144 .fwrite = afs_MemWriteBlk,
145 .close = afs_MemCacheClose,
146 .vreadUIO = afs_MemReadUIO,
147 .vwrite = afs_MemWrite,
148 .GetDSlot = afs_MemGetDSlot,
149 .GetVolSlot = afs_MemGetVolSlot,
150 .HandleLink = afs_MemHandleLink,
154 int cacheDiskType; /*Type of backing disk for cache */
155 struct afs_cacheOps *afs_cacheType;
158 * Where is this vcache's entry associated dcache located/
159 * \param avc The vcache entry.
160 * \return Bucket index:
165 afs_DCGetBucket(struct vcache *avc)
170 /* This should be replaced with some sort of user configurable function */
171 if (avc->f.states & CRO) {
173 } else if (avc->f.states & CBackup) {
183 * Readjust a dcache's size.
185 * \param adc The dcache to be adjusted.
186 * \param oldSize Old size for the dcache.
187 * \param newSize The new size to be adjusted to.
191 afs_DCAdjustSize(struct dcache *adc, afs_int32 oldSize, afs_int32 newSize)
193 afs_int32 adjustSize = newSize - oldSize;
201 afs_blocksUsed_0 += adjustSize;
202 afs_stats_cmperf.cacheBucket0_Discarded += oldSize;
205 afs_blocksUsed_1 += adjustSize;
206 afs_stats_cmperf.cacheBucket1_Discarded += oldSize;
209 afs_blocksUsed_2 += adjustSize;
210 afs_stats_cmperf.cacheBucket2_Discarded += oldSize;
218 * Move a dcache from one bucket to another.
220 * \param adc Operate on this dcache.
221 * \param size Size in bucket (?).
222 * \param newBucket Destination bucket.
226 afs_DCMoveBucket(struct dcache *adc, afs_int32 size, afs_int32 newBucket)
231 /* Substract size from old bucket. */
235 afs_blocksUsed_0 -= size;
238 afs_blocksUsed_1 -= size;
241 afs_blocksUsed_2 -= size;
245 /* Set new bucket and increase destination bucket size. */
246 adc->bucket = newBucket;
251 afs_blocksUsed_0 += size;
254 afs_blocksUsed_1 += size;
257 afs_blocksUsed_2 += size;
265 * Init split caches size.
270 afs_blocksUsed_0 = afs_blocksUsed_1 = afs_blocksUsed_2 = 0;
279 afs_DCWhichBucket(afs_int32 phase, afs_int32 bucket)
284 afs_pct1 = afs_blocksUsed_1 / (afs_cacheBlocks / 100);
285 afs_pct2 = afs_blocksUsed_2 / (afs_cacheBlocks / 100);
287 /* Short cut: if we don't know about it, try to kill it */
288 if (phase < 2 && afs_blocksUsed_0)
291 if (afs_pct1 > afs_tpct1)
293 if (afs_pct2 > afs_tpct2)
295 return 0; /* unlikely */
300 * Warn about failing to store a file.
302 * \param acode Associated error code.
303 * \param avolume Volume involved.
304 * \param aflags How to handle the output:
305 * aflags & 1: Print out on console
306 * aflags & 2: Print out on controlling tty
308 * \note Environment: Call this from close call when vnodeops is RCS unlocked.
312 afs_StoreWarn(afs_int32 acode, afs_int32 avolume,
315 static char problem_fmt[] =
316 "afs: failed to store file in volume %d (%s)\n";
317 static char problem_fmt_w_error[] =
318 "afs: failed to store file in volume %d (error %d)\n";
319 static char netproblems[] = "network problems";
320 static char partfull[] = "partition full";
321 static char overquota[] = "over quota";
323 AFS_STATCNT(afs_StoreWarn);
329 afs_warn(problem_fmt, avolume, netproblems);
331 afs_warnuser(problem_fmt, avolume, netproblems);
332 } else if (acode == ENOSPC) {
337 afs_warn(problem_fmt, avolume, partfull);
339 afs_warnuser(problem_fmt, avolume, partfull);
342 /* EDQUOT doesn't exist on solaris and won't be sent by the server.
343 * Instead ENOSPC will be sent...
345 if (acode == EDQUOT) {
350 afs_warn(problem_fmt, avolume, overquota);
352 afs_warnuser(problem_fmt, avolume, overquota);
360 afs_warn(problem_fmt_w_error, avolume, acode);
362 afs_warnuser(problem_fmt_w_error, avolume, acode);
367 * Try waking up truncation daemon, if it's worth it.
370 afs_MaybeWakeupTruncateDaemon(void)
372 if (!afs_CacheTooFull && afs_CacheIsTooFull()) {
373 afs_CacheTooFull = 1;
374 if (!afs_TruncateDaemonRunning)
375 afs_osi_Wakeup((int *)afs_CacheTruncateDaemon);
376 } else if (!afs_TruncateDaemonRunning
377 && afs_blocksDiscarded > CM_MAXDISCARDEDCHUNKS) {
378 afs_osi_Wakeup((int *)afs_CacheTruncateDaemon);
385 * Keep statistics on run time for afs_CacheTruncateDaemon. This is a
386 * struct so we need only export one symbol for AIX.
388 static struct CTD_stats {
389 osi_timeval_t CTD_beforeSleep;
390 osi_timeval_t CTD_afterSleep;
391 osi_timeval_t CTD_sleepTime;
392 osi_timeval_t CTD_runTime;
396 u_int afs_min_cache = 0;
399 * Keeps the cache clean and free by truncating uneeded files, when used.
404 afs_CacheTruncateDaemon(void)
406 osi_timeval_t CTD_tmpTime;
410 PERCENT((100 - CM_DCACHECOUNTFREEPCT + CM_DCACHEEXTRAPCT), afs_cacheFiles);
412 (((10 * AFS_CHUNKSIZE(0)) + afs_fsfragsize) & ~afs_fsfragsize) >> 10;
414 osi_GetuTime(&CTD_stats.CTD_afterSleep);
415 afs_TruncateDaemonRunning = 1;
417 cb_lowat = PERCENT((CM_DCACHESPACEFREEPCT - CM_DCACHEEXTRAPCT), afs_cacheBlocks);
418 ObtainWriteLock(&afs_xdcache, 266);
419 if (afs_CacheTooFull) {
420 int space_needed, slots_needed;
421 /* if we get woken up, we should try to clean something out */
422 for (counter = 0; counter < 10; counter++) {
424 afs_blocksUsed - afs_blocksDiscarded - cb_lowat;
426 dc_hiwat - afs_freeDCCount - afs_discardDCCount;
427 afs_GetDownD(slots_needed, &space_needed, 0);
428 if ((space_needed <= 0) && (slots_needed <= 0)) {
431 if (afs_termState == AFSOP_STOP_TRUNCDAEMON)
434 if (!afs_CacheIsTooFull())
435 afs_CacheTooFull = 0;
436 } /* end of cache cleanup */
437 ReleaseWriteLock(&afs_xdcache);
440 * This is a defensive check to try to avoid starving threads
441 * that may need the global lock so thay can help free some
442 * cache space. If this thread won't be sleeping or truncating
443 * any cache files then give up the global lock so other
444 * threads get a chance to run.
446 if ((afs_termState != AFSOP_STOP_TRUNCDAEMON) && afs_CacheTooFull
447 && (!afs_blocksDiscarded || afs_WaitForCacheDrain)) {
448 afs_osi_Wait(100, 0, 0); /* 100 milliseconds */
452 * This is where we free the discarded cache elements.
454 while (afs_blocksDiscarded && !afs_WaitForCacheDrain
455 && (afs_termState != AFSOP_STOP_TRUNCDAEMON)) {
456 afs_FreeDiscardedDCache();
459 /* See if we need to continue to run. Someone may have
460 * signalled us while we were executing.
462 if (!afs_WaitForCacheDrain && !afs_CacheTooFull
463 && (afs_termState != AFSOP_STOP_TRUNCDAEMON)) {
464 /* Collect statistics on truncate daemon. */
465 CTD_stats.CTD_nSleeps++;
466 osi_GetuTime(&CTD_stats.CTD_beforeSleep);
467 afs_stats_GetDiff(CTD_tmpTime, CTD_stats.CTD_afterSleep,
468 CTD_stats.CTD_beforeSleep);
469 afs_stats_AddTo(CTD_stats.CTD_runTime, CTD_tmpTime);
471 afs_TruncateDaemonRunning = 0;
472 afs_osi_Sleep((int *)afs_CacheTruncateDaemon);
473 afs_TruncateDaemonRunning = 1;
475 osi_GetuTime(&CTD_stats.CTD_afterSleep);
476 afs_stats_GetDiff(CTD_tmpTime, CTD_stats.CTD_beforeSleep,
477 CTD_stats.CTD_afterSleep);
478 afs_stats_AddTo(CTD_stats.CTD_sleepTime, CTD_tmpTime);
480 if (afs_termState == AFSOP_STOP_TRUNCDAEMON) {
481 afs_termState = AFSOP_STOP_AFSDB;
482 afs_osi_Wakeup(&afs_termState);
490 * Make adjustment for the new size in the disk cache entry
492 * \note Major Assumptions Here:
493 * Assumes that frag size is an integral power of two, less one,
494 * and that this is a two's complement machine. I don't
495 * know of any filesystems which violate this assumption...
497 * \param adc Ptr to dcache entry.
498 * \param anewsize New size desired.
503 afs_AdjustSize(struct dcache *adc, afs_int32 newSize)
507 AFS_STATCNT(afs_AdjustSize);
509 adc->dflags |= DFEntryMod;
510 oldSize = ((adc->f.chunkBytes + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
511 adc->f.chunkBytes = newSize;
514 newSize = ((newSize + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
515 afs_DCAdjustSize(adc, oldSize, newSize);
516 if ((newSize > oldSize) && !AFS_IS_DISCONNECTED) {
518 /* We're growing the file, wakeup the daemon */
519 afs_MaybeWakeupTruncateDaemon();
521 afs_blocksUsed += (newSize - oldSize);
522 afs_stats_cmperf.cacheBlocksInUse = afs_blocksUsed; /* XXX */
527 * This routine is responsible for moving at least one entry (but up
528 * to some number of them) from the LRU queue to the free queue.
530 * \param anumber Number of entries that should ideally be moved.
531 * \param aneedSpace How much space we need (1K blocks);
534 * The anumber parameter is just a hint; at least one entry MUST be
535 * moved, or we'll panic. We must be called with afs_xdcache
536 * write-locked. We should try to satisfy both anumber and aneedspace,
537 * whichever is more demanding - need to do several things:
538 * 1. only grab up to anumber victims if aneedSpace <= 0, not
539 * the whole set of MAXATONCE.
540 * 2. dynamically choose MAXATONCE to reflect severity of
541 * demand: something like (*aneedSpace >> (logChunk - 9))
543 * \note N.B. if we're called with aneedSpace <= 0 and anumber > 0, that
544 * indicates that the cache is not properly configured/tuned or
545 * something. We should be able to automatically correct that problem.
548 #define MAXATONCE 16 /* max we can obtain at once */
550 afs_GetDownD(int anumber, int *aneedSpace, afs_int32 buckethint)
554 struct VenusFid *afid;
559 afs_uint32 victims[MAXATONCE];
560 struct dcache *victimDCs[MAXATONCE];
561 afs_hyper_t victimTimes[MAXATONCE]; /* youngest (largest LRU time) first */
562 afs_uint32 victimPtr; /* next free item in victim arrays */
563 afs_hyper_t maxVictimTime; /* youngest (largest LRU time) victim */
564 afs_uint32 maxVictimPtr; /* where it is */
568 AFS_STATCNT(afs_GetDownD);
570 if (CheckLock(&afs_xdcache) != -1)
571 osi_Panic("getdownd nolock");
572 /* decrement anumber first for all dudes in free list */
573 /* SHOULD always decrement anumber first, even if aneedSpace >0,
574 * because we should try to free space even if anumber <=0 */
575 if (!aneedSpace || *aneedSpace <= 0) {
576 anumber -= afs_freeDCCount;
578 return; /* enough already free */
582 /* bounds check parameter */
583 if (anumber > MAXATONCE)
584 anumber = MAXATONCE; /* all we can do */
586 /* rewrite so phases include a better eligiblity for gc test*/
588 * The phase variable manages reclaims. Set to 0, the first pass,
589 * we don't reclaim active entries, or other than target bucket.
590 * Set to 1, we reclaim even active ones in target bucket.
591 * Set to 2, we reclaim any inactive one.
592 * Set to 3, we reclaim even active ones.
600 for (i = 0; i < afs_cacheFiles; i++)
601 /* turn off all flags */
602 afs_indexFlags[i] &= ~IFFlag;
604 while (anumber > 0 || (aneedSpace && *aneedSpace > 0)) {
605 /* find oldest entries for reclamation */
606 maxVictimPtr = victimPtr = 0;
607 hzero(maxVictimTime);
608 curbucket = afs_DCWhichBucket(phase, buckethint);
609 /* select victims from access time array */
610 for (i = 0; i < afs_cacheFiles; i++) {
611 if (afs_indexFlags[i] & (IFDataMod | IFFree | IFDiscarded)) {
612 /* skip if dirty or already free */
615 tdc = afs_indexTable[i];
616 if (tdc && (curbucket != tdc->bucket) && (phase < 4))
618 /* Wrong bucket; can't use it! */
621 if (tdc && (tdc->refCount != 0)) {
622 /* Referenced; can't use it! */
625 hset(vtime, afs_indexTimes[i]);
627 /* if we've already looked at this one, skip it */
628 if (afs_indexFlags[i] & IFFlag)
631 if (victimPtr < MAXATONCE) {
632 /* if there's at least one free victim slot left */
633 victims[victimPtr] = i;
634 hset(victimTimes[victimPtr], vtime);
635 if (hcmp(vtime, maxVictimTime) > 0) {
636 hset(maxVictimTime, vtime);
637 maxVictimPtr = victimPtr;
640 } else if (hcmp(vtime, maxVictimTime) < 0) {
642 * We're older than youngest victim, so we replace at
645 /* find youngest (largest LRU) victim */
648 osi_Panic("getdownd local");
650 hset(victimTimes[j], vtime);
651 /* recompute maxVictimTime */
652 hset(maxVictimTime, vtime);
653 for (j = 0; j < victimPtr; j++)
654 if (hcmp(maxVictimTime, victimTimes[j]) < 0) {
655 hset(maxVictimTime, victimTimes[j]);
661 /* now really reclaim the victims */
662 j = 0; /* flag to track if we actually got any of the victims */
663 /* first, hold all the victims, since we're going to release the lock
664 * during the truncate operation.
666 for (i = 0; i < victimPtr; i++) {
667 tdc = afs_GetDSlot(victims[i], 0);
668 /* We got tdc->tlock(R) here */
669 if (tdc->refCount == 1)
673 ReleaseReadLock(&tdc->tlock);
677 for (i = 0; i < victimPtr; i++) {
678 /* q is first elt in dcache entry */
680 /* now, since we're dropping the afs_xdcache lock below, we
681 * have to verify, before proceeding, that there are no other
682 * references to this dcache entry, even now. Note that we
683 * compare with 1, since we bumped it above when we called
684 * afs_GetDSlot to preserve the entry's identity.
686 if (tdc && tdc->refCount == 1) {
687 unsigned char chunkFlags;
688 afs_size_t tchunkoffset = 0;
690 /* xdcache is lower than the xvcache lock */
691 ReleaseWriteLock(&afs_xdcache);
692 ObtainReadLock(&afs_xvcache);
693 tvc = afs_FindVCache(afid, 0, 0 /* no stats, no vlru */ );
694 ReleaseReadLock(&afs_xvcache);
695 ObtainWriteLock(&afs_xdcache, 527);
697 if (tdc->refCount > 1)
700 tchunkoffset = AFS_CHUNKTOBASE(tdc->f.chunk);
701 chunkFlags = afs_indexFlags[tdc->index];
702 if (((phase & 1) == 0) && osi_Active(tvc))
704 if (((phase & 1) == 1) && osi_Active(tvc)
705 && (tvc->f.states & CDCLock)
706 && (chunkFlags & IFAnyPages))
708 if (chunkFlags & IFDataMod)
710 afs_Trace4(afs_iclSetp, CM_TRACE_GETDOWND,
711 ICL_TYPE_POINTER, tvc, ICL_TYPE_INT32, skip,
712 ICL_TYPE_INT32, tdc->index, ICL_TYPE_OFFSET,
713 ICL_HANDLE_OFFSET(tchunkoffset));
715 #if defined(AFS_SUN5_ENV)
717 * Now we try to invalidate pages. We do this only for
718 * Solaris. For other platforms, it's OK to recycle a
719 * dcache entry out from under a page, because the strategy
720 * function can call afs_GetDCache().
722 if (!skip && (chunkFlags & IFAnyPages)) {
725 ReleaseWriteLock(&afs_xdcache);
726 ObtainWriteLock(&tvc->vlock, 543);
727 if (tvc->multiPage) {
731 /* block locking pages */
732 tvc->vstates |= VPageCleaning;
733 /* block getting new pages */
735 ReleaseWriteLock(&tvc->vlock);
736 /* One last recheck */
737 ObtainWriteLock(&afs_xdcache, 333);
738 chunkFlags = afs_indexFlags[tdc->index];
739 if (tdc->refCount > 1 || (chunkFlags & IFDataMod)
740 || (osi_Active(tvc) && (tvc->f.states & CDCLock)
741 && (chunkFlags & IFAnyPages))) {
743 ReleaseWriteLock(&afs_xdcache);
746 ReleaseWriteLock(&afs_xdcache);
748 code = osi_VM_GetDownD(tvc, tdc);
750 ObtainWriteLock(&afs_xdcache, 269);
751 /* we actually removed all pages, clean and dirty */
753 afs_indexFlags[tdc->index] &=
754 ~(IFDirtyPages | IFAnyPages);
757 ReleaseWriteLock(&afs_xdcache);
759 ObtainWriteLock(&tvc->vlock, 544);
760 if (--tvc->activeV == 0
761 && (tvc->vstates & VRevokeWait)) {
762 tvc->vstates &= ~VRevokeWait;
763 afs_osi_Wakeup((char *)&tvc->vstates);
766 if (tvc->vstates & VPageCleaning) {
767 tvc->vstates &= ~VPageCleaning;
768 afs_osi_Wakeup((char *)&tvc->vstates);
771 ReleaseWriteLock(&tvc->vlock);
773 #endif /* AFS_SUN5_ENV */
775 ReleaseWriteLock(&afs_xdcache);
778 afs_PutVCache(tvc); /*XXX was AFS_FAST_RELE?*/
779 ObtainWriteLock(&afs_xdcache, 528);
780 if (afs_indexFlags[tdc->index] &
781 (IFDataMod | IFDirtyPages | IFAnyPages))
783 if (tdc->refCount > 1)
786 #if defined(AFS_SUN5_ENV)
788 /* no vnode, so IFDirtyPages is spurious (we don't
789 * sweep dcaches on vnode recycling, so we can have
790 * DIRTYPAGES set even when all pages are gone). Just
792 * Hold vcache lock to prevent vnode from being
793 * created while we're clearing IFDirtyPages.
795 afs_indexFlags[tdc->index] &=
796 ~(IFDirtyPages | IFAnyPages);
800 /* skip this guy and mark him as recently used */
801 afs_indexFlags[tdc->index] |= IFFlag;
802 afs_Trace4(afs_iclSetp, CM_TRACE_GETDOWND,
803 ICL_TYPE_POINTER, tvc, ICL_TYPE_INT32, 2,
804 ICL_TYPE_INT32, tdc->index, ICL_TYPE_OFFSET,
805 ICL_HANDLE_OFFSET(tchunkoffset));
807 /* flush this dude from the data cache and reclaim;
808 * first, make sure no one will care that we damage
809 * it, by removing it from all hash tables. Then,
810 * melt it down for parts. Note that any concurrent
811 * (new possibility!) calls to GetDownD won't touch
812 * this guy because his reference count is > 0. */
813 afs_Trace4(afs_iclSetp, CM_TRACE_GETDOWND,
814 ICL_TYPE_POINTER, tvc, ICL_TYPE_INT32, 3,
815 ICL_TYPE_INT32, tdc->index, ICL_TYPE_OFFSET,
816 ICL_HANDLE_OFFSET(tchunkoffset));
817 AFS_STATCNT(afs_gget);
818 afs_HashOutDCache(tdc, 1);
819 if (tdc->f.chunkBytes != 0) {
823 (tdc->f.chunkBytes + afs_fsfragsize) >> 10;
828 afs_DiscardDCache(tdc);
833 j = 1; /* we reclaimed at least one victim */
837 } /* end of for victims loop */
840 /* Phase is 0 and no one was found, so try phase 1 (ignore
841 * osi_Active flag) */
844 for (i = 0; i < afs_cacheFiles; i++)
845 /* turn off all flags */
846 afs_indexFlags[i] &= ~IFFlag;
849 /* found no one in phases 0-5, we're hosed */
853 } /* big while loop */
861 * Remove adc from any hash tables that would allow it to be located
862 * again by afs_FindDCache or afs_GetDCache.
864 * \param adc Pointer to dcache entry to remove from hash tables.
866 * \note Locks: Must have the afs_xdcache lock write-locked to call this function.
870 afs_HashOutDCache(struct dcache *adc, int zap)
874 AFS_STATCNT(afs_glink);
876 /* we know this guy's in the LRUQ. We'll move dude into DCQ below */
878 /* if this guy is in the hash table, pull him out */
879 if (adc->f.fid.Fid.Volume != 0) {
880 /* remove entry from first hash chains */
881 i = DCHash(&adc->f.fid, adc->f.chunk);
882 us = afs_dchashTbl[i];
883 if (us == adc->index) {
884 /* first dude in the list */
885 afs_dchashTbl[i] = afs_dcnextTbl[adc->index];
887 /* somewhere on the chain */
888 while (us != NULLIDX) {
889 if (afs_dcnextTbl[us] == adc->index) {
890 /* found item pointing at the one to delete */
891 afs_dcnextTbl[us] = afs_dcnextTbl[adc->index];
894 us = afs_dcnextTbl[us];
897 osi_Panic("dcache hc");
899 /* remove entry from *other* hash chain */
900 i = DVHash(&adc->f.fid);
901 us = afs_dvhashTbl[i];
902 if (us == adc->index) {
903 /* first dude in the list */
904 afs_dvhashTbl[i] = afs_dvnextTbl[adc->index];
906 /* somewhere on the chain */
907 while (us != NULLIDX) {
908 if (afs_dvnextTbl[us] == adc->index) {
909 /* found item pointing at the one to delete */
910 afs_dvnextTbl[us] = afs_dvnextTbl[adc->index];
913 us = afs_dvnextTbl[us];
916 osi_Panic("dcache hv");
921 /* prevent entry from being found on a reboot (it is already out of
922 * the hash table, but after a crash, we just look at fid fields of
923 * stable (old) entries).
925 adc->f.fid.Fid.Volume = 0; /* invalid */
927 /* mark entry as modified */
928 adc->dflags |= DFEntryMod;
933 } /*afs_HashOutDCache */
936 * Flush the given dcache entry, pulling it from hash chains
937 * and truncating the associated cache file.
939 * \param adc Ptr to dcache entry to flush.
942 * This routine must be called with the afs_xdcache lock held
946 afs_FlushDCache(struct dcache *adc)
948 AFS_STATCNT(afs_FlushDCache);
950 * Bump the number of cache files flushed.
952 afs_stats_cmperf.cacheFlushes++;
954 /* remove from all hash tables */
955 afs_HashOutDCache(adc, 1);
957 /* Free its space; special case null operation, since truncate operation
958 * in UFS is slow even in this case, and this allows us to pre-truncate
959 * these files at more convenient times with fewer locks set
960 * (see afs_GetDownD).
962 if (adc->f.chunkBytes != 0) {
963 afs_DiscardDCache(adc);
964 afs_MaybeWakeupTruncateDaemon();
969 if (afs_WaitForCacheDrain) {
970 if (afs_blocksUsed <=
971 PERCENT(CM_CACHESIZEDRAINEDPCT, afs_cacheBlocks)) {
972 afs_WaitForCacheDrain = 0;
973 afs_osi_Wakeup(&afs_WaitForCacheDrain);
976 } /*afs_FlushDCache */
980 * Put a dcache entry on the free dcache entry list.
982 * \param adc dcache entry to free.
984 * \note Environment: called with afs_xdcache lock write-locked.
987 afs_FreeDCache(struct dcache *adc)
989 /* Thread on free list, update free list count and mark entry as
990 * freed in its indexFlags element. Also, ensure DCache entry gets
991 * written out (set DFEntryMod).
994 afs_dvnextTbl[adc->index] = afs_freeDCList;
995 afs_freeDCList = adc->index;
997 afs_indexFlags[adc->index] |= IFFree;
998 adc->dflags |= DFEntryMod;
1000 if (afs_WaitForCacheDrain) {
1001 if ((afs_blocksUsed - afs_blocksDiscarded) <=
1002 PERCENT(CM_CACHESIZEDRAINEDPCT, afs_cacheBlocks)) {
1003 afs_WaitForCacheDrain = 0;
1004 afs_osi_Wakeup(&afs_WaitForCacheDrain);
1007 } /* afs_FreeDCache */
1010 * Discard the cache element by moving it to the discardDCList.
1011 * This puts the cache element into a quasi-freed state, where
1012 * the space may be reused, but the file has not been truncated.
1014 * \note Major Assumptions Here:
1015 * Assumes that frag size is an integral power of two, less one,
1016 * and that this is a two's complement machine. I don't
1017 * know of any filesystems which violate this assumption...
1019 * \param adr Ptr to dcache entry.
1021 * \note Environment:
1022 * Must be called with afs_xdcache write-locked.
1026 afs_DiscardDCache(struct dcache *adc)
1030 AFS_STATCNT(afs_DiscardDCache);
1032 osi_Assert(adc->refCount == 1);
1034 size = ((adc->f.chunkBytes + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
1035 afs_blocksDiscarded += size;
1036 afs_stats_cmperf.cacheBlocksDiscarded = afs_blocksDiscarded;
1038 afs_dvnextTbl[adc->index] = afs_discardDCList;
1039 afs_discardDCList = adc->index;
1040 afs_discardDCCount++;
1042 adc->f.fid.Fid.Volume = 0;
1043 adc->dflags |= DFEntryMod;
1044 afs_indexFlags[adc->index] |= IFDiscarded;
1046 if (afs_WaitForCacheDrain) {
1047 if ((afs_blocksUsed - afs_blocksDiscarded) <=
1048 PERCENT(CM_CACHESIZEDRAINEDPCT, afs_cacheBlocks)) {
1049 afs_WaitForCacheDrain = 0;
1050 afs_osi_Wakeup(&afs_WaitForCacheDrain);
1054 } /*afs_DiscardDCache */
1057 * Free the next element on the list of discarded cache elements.
1060 afs_FreeDiscardedDCache(void)
1063 struct osi_file *tfile;
1066 AFS_STATCNT(afs_FreeDiscardedDCache);
1068 ObtainWriteLock(&afs_xdcache, 510);
1069 if (!afs_blocksDiscarded) {
1070 ReleaseWriteLock(&afs_xdcache);
1075 * Get an entry from the list of discarded cache elements
1077 tdc = afs_GetDSlot(afs_discardDCList, 0);
1078 osi_Assert(tdc->refCount == 1);
1079 ReleaseReadLock(&tdc->tlock);
1081 afs_discardDCList = afs_dvnextTbl[tdc->index];
1082 afs_dvnextTbl[tdc->index] = NULLIDX;
1083 afs_discardDCCount--;
1084 size = ((tdc->f.chunkBytes + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
1085 afs_blocksDiscarded -= size;
1086 afs_stats_cmperf.cacheBlocksDiscarded = afs_blocksDiscarded;
1087 /* We can lock because we just took it off the free list */
1088 ObtainWriteLock(&tdc->lock, 626);
1089 ReleaseWriteLock(&afs_xdcache);
1092 * Truncate the element to reclaim its space
1094 tfile = afs_CFileOpen(&tdc->f.inode);
1095 afs_CFileTruncate(tfile, 0);
1096 afs_CFileClose(tfile);
1097 afs_AdjustSize(tdc, 0);
1098 afs_DCMoveBucket(tdc, 0, 0);
1101 * Free the element we just truncated
1103 ObtainWriteLock(&afs_xdcache, 511);
1104 afs_indexFlags[tdc->index] &= ~IFDiscarded;
1105 afs_FreeDCache(tdc);
1106 tdc->f.states &= ~(DRO|DBackup|DRW);
1107 ReleaseWriteLock(&tdc->lock);
1109 ReleaseWriteLock(&afs_xdcache);
1113 * Free as many entries from the list of discarded cache elements
1114 * as we need to get the free space down below CM_WAITFORDRAINPCT (98%).
1119 afs_MaybeFreeDiscardedDCache(void)
1122 AFS_STATCNT(afs_MaybeFreeDiscardedDCache);
1124 while (afs_blocksDiscarded
1125 && (afs_blocksUsed >
1126 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks))) {
1127 afs_FreeDiscardedDCache();
1133 * Try to free up a certain number of disk slots.
1135 * \param anumber Targeted number of disk slots to free up.
1137 * \note Environment:
1138 * Must be called with afs_xdcache write-locked.
1142 afs_GetDownDSlot(int anumber)
1144 struct afs_q *tq, *nq;
1149 AFS_STATCNT(afs_GetDownDSlot);
1150 if (cacheDiskType == AFS_FCACHE_TYPE_MEM)
1151 osi_Panic("diskless getdowndslot");
1153 if (CheckLock(&afs_xdcache) != -1)
1154 osi_Panic("getdowndslot nolock");
1156 /* decrement anumber first for all dudes in free list */
1157 for (tdc = afs_freeDSList; tdc; tdc = (struct dcache *)tdc->lruq.next)
1160 return; /* enough already free */
1162 for (cnt = 0, tq = afs_DLRU.prev; tq != &afs_DLRU && anumber > 0;
1164 tdc = (struct dcache *)tq; /* q is first elt in dcache entry */
1165 nq = QPrev(tq); /* in case we remove it */
1166 if (tdc->refCount == 0) {
1167 if ((ix = tdc->index) == NULLIDX)
1168 osi_Panic("getdowndslot");
1169 /* pull the entry out of the lruq and put it on the free list */
1170 QRemove(&tdc->lruq);
1172 /* write-through if modified */
1173 if (tdc->dflags & DFEntryMod) {
1174 #if defined(AFS_SGI_ENV) && defined(AFS_SGI_SHORTSTACK)
1176 * ask proxy to do this for us - we don't have the stack space
1178 while (tdc->dflags & DFEntryMod) {
1181 s = SPLOCK(afs_sgibklock);
1182 if (afs_sgibklist == NULL) {
1183 /* if slot is free, grab it. */
1184 afs_sgibklist = tdc;
1185 SV_SIGNAL(&afs_sgibksync);
1187 /* wait for daemon to (start, then) finish. */
1188 SP_WAIT(afs_sgibklock, s, &afs_sgibkwait, PINOD);
1192 tdc->dflags &= ~DFEntryMod;
1193 afs_WriteDCache(tdc, 1);
1197 /* finally put the entry in the free list */
1198 afs_indexTable[ix] = NULL;
1199 afs_indexFlags[ix] &= ~IFEverUsed;
1200 tdc->index = NULLIDX;
1201 tdc->lruq.next = (struct afs_q *)afs_freeDSList;
1202 afs_freeDSList = tdc;
1206 } /*afs_GetDownDSlot */
1213 * Increment the reference count on a disk cache entry,
1214 * which already has a non-zero refcount. In order to
1215 * increment the refcount of a zero-reference entry, you
1216 * have to hold afs_xdcache.
1219 * adc : Pointer to the dcache entry to increment.
1222 * Nothing interesting.
1225 afs_RefDCache(struct dcache *adc)
1227 ObtainWriteLock(&adc->tlock, 627);
1228 if (adc->refCount < 0)
1229 osi_Panic("RefDCache: negative refcount");
1231 ReleaseWriteLock(&adc->tlock);
1240 * Decrement the reference count on a disk cache entry.
1243 * ad : Ptr to the dcache entry to decrement.
1246 * Nothing interesting.
1249 afs_PutDCache(struct dcache *adc)
1251 AFS_STATCNT(afs_PutDCache);
1252 ObtainWriteLock(&adc->tlock, 276);
1253 if (adc->refCount <= 0)
1254 osi_Panic("putdcache");
1256 ReleaseWriteLock(&adc->tlock);
1265 * Try to discard all data associated with this file from the
1269 * avc : Pointer to the cache info for the file.
1272 * Both pvnLock and lock are write held.
1275 afs_TryToSmush(struct vcache *avc, afs_ucred_t *acred, int sync)
1280 AFS_STATCNT(afs_TryToSmush);
1281 afs_Trace2(afs_iclSetp, CM_TRACE_TRYTOSMUSH, ICL_TYPE_POINTER, avc,
1282 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(avc->f.m.Length));
1283 sync = 1; /* XX Temp testing XX */
1285 #if defined(AFS_SUN5_ENV)
1286 ObtainWriteLock(&avc->vlock, 573);
1287 avc->activeV++; /* block new getpages */
1288 ReleaseWriteLock(&avc->vlock);
1291 /* Flush VM pages */
1292 osi_VM_TryToSmush(avc, acred, sync);
1295 * Get the hash chain containing all dce's for this fid
1297 i = DVHash(&avc->f.fid);
1298 ObtainWriteLock(&afs_xdcache, 277);
1299 for (index = afs_dvhashTbl[i]; index != NULLIDX; index = i) {
1300 i = afs_dvnextTbl[index]; /* next pointer this hash table */
1301 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1302 int releaseTlock = 1;
1303 tdc = afs_GetDSlot(index, NULL);
1304 if (!FidCmp(&tdc->f.fid, &avc->f.fid)) {
1306 if ((afs_indexFlags[index] & IFDataMod) == 0
1307 && tdc->refCount == 1) {
1308 ReleaseReadLock(&tdc->tlock);
1310 afs_FlushDCache(tdc);
1313 afs_indexTable[index] = 0;
1316 ReleaseReadLock(&tdc->tlock);
1320 #if defined(AFS_SUN5_ENV)
1321 ObtainWriteLock(&avc->vlock, 545);
1322 if (--avc->activeV == 0 && (avc->vstates & VRevokeWait)) {
1323 avc->vstates &= ~VRevokeWait;
1324 afs_osi_Wakeup((char *)&avc->vstates);
1326 ReleaseWriteLock(&avc->vlock);
1328 ReleaseWriteLock(&afs_xdcache);
1330 * It's treated like a callback so that when we do lookups we'll
1331 * invalidate the unique bit if any
1332 * trytoSmush occured during the lookup call
1338 * afs_DCacheMissingChunks
1341 * Given the cached info for a file, return the number of chunks that
1342 * are not available from the dcache.
1345 * avc: Pointer to the (held) vcache entry to look in.
1348 * The number of chunks which are not currently cached.
1351 * The vcache entry is held upon entry.
1355 afs_DCacheMissingChunks(struct vcache *avc)
1358 afs_size_t totalLength = 0;
1359 afs_uint32 totalChunks = 0;
1362 totalLength = avc->f.m.Length;
1363 if (avc->f.truncPos < totalLength)
1364 totalLength = avc->f.truncPos;
1366 /* Length is 0, no chunk missing. */
1367 if (totalLength == 0)
1370 /* If totalLength is a multiple of chunksize, the last byte appears
1371 * as being part of the next chunk, which does not exist.
1372 * Decrementing totalLength by one fixes that.
1375 totalChunks = (AFS_CHUNK(totalLength) + 1);
1377 /* If we're a directory, we only ever have one chunk, regardless of
1378 * the size of the dir.
1380 if (avc->f.fid.Fid.Vnode & 1 || vType(avc) == VDIR)
1384 printf("Should have %d chunks for %u bytes\n",
1385 totalChunks, (totalLength + 1));
1387 i = DVHash(&avc->f.fid);
1388 ObtainWriteLock(&afs_xdcache, 1001);
1389 for (index = afs_dvhashTbl[i]; index != NULLIDX; index = i) {
1390 i = afs_dvnextTbl[index];
1391 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1392 tdc = afs_GetDSlot(index, NULL);
1393 if (!FidCmp(&tdc->f.fid, &avc->f.fid)) {
1396 ReleaseReadLock(&tdc->tlock);
1400 ReleaseWriteLock(&afs_xdcache);
1402 /*printf("Missing %d chunks\n", totalChunks);*/
1404 return (totalChunks);
1411 * Given the cached info for a file and a byte offset into the
1412 * file, make sure the dcache entry for that file and containing
1413 * the given byte is available, returning it to our caller.
1416 * avc : Pointer to the (held) vcache entry to look in.
1417 * abyte : Which byte we want to get to.
1420 * Pointer to the dcache entry covering the file & desired byte,
1421 * or NULL if not found.
1424 * The vcache entry is held upon entry.
1428 afs_FindDCache(struct vcache *avc, afs_size_t abyte)
1432 struct dcache *tdc = NULL;
1434 AFS_STATCNT(afs_FindDCache);
1435 chunk = AFS_CHUNK(abyte);
1438 * Hash on the [fid, chunk] and get the corresponding dcache index
1439 * after write-locking the dcache.
1441 i = DCHash(&avc->f.fid, chunk);
1442 ObtainWriteLock(&afs_xdcache, 278);
1443 for (index = afs_dchashTbl[i]; index != NULLIDX;) {
1444 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1445 tdc = afs_GetDSlot(index, NULL);
1446 ReleaseReadLock(&tdc->tlock);
1447 if (!FidCmp(&tdc->f.fid, &avc->f.fid) && chunk == tdc->f.chunk) {
1448 break; /* leaving refCount high for caller */
1452 index = afs_dcnextTbl[index];
1454 if (index != NULLIDX) {
1455 hset(afs_indexTimes[tdc->index], afs_indexCounter);
1456 hadd32(afs_indexCounter, 1);
1457 ReleaseWriteLock(&afs_xdcache);
1460 ReleaseWriteLock(&afs_xdcache);
1462 } /*afs_FindDCache */
1466 * Get a fresh dcache from the free or discarded list.
1468 * \param avc Who's dcache is this going to be?
1469 * \param chunk The position where it will be placed in.
1470 * \param lock How are locks held.
1471 * \param ashFid If this dcache going to be used for a shadow dir,
1474 * \note Required locks:
1476 * - avc (R if (lock & 1) set and W otherwise)
1477 * \note It write locks the new dcache. The caller must unlock it.
1479 * \return The new dcache.
1482 afs_AllocDCache(struct vcache *avc, afs_int32 chunk, afs_int32 lock,
1483 struct VenusFid *ashFid)
1485 struct dcache *tdc = NULL;
1486 afs_uint32 size = 0;
1487 struct osi_file *file;
1489 if (afs_discardDCList == NULLIDX
1490 || ((lock & 2) && afs_freeDCList != NULLIDX)) {
1492 afs_indexFlags[afs_freeDCList] &= ~IFFree;
1493 tdc = afs_GetDSlot(afs_freeDCList, 0);
1494 osi_Assert(tdc->refCount == 1);
1495 ReleaseReadLock(&tdc->tlock);
1496 ObtainWriteLock(&tdc->lock, 604);
1497 afs_freeDCList = afs_dvnextTbl[tdc->index];
1500 afs_indexFlags[afs_discardDCList] &= ~IFDiscarded;
1501 tdc = afs_GetDSlot(afs_discardDCList, 0);
1502 osi_Assert(tdc->refCount == 1);
1503 ReleaseReadLock(&tdc->tlock);
1504 ObtainWriteLock(&tdc->lock, 605);
1505 afs_discardDCList = afs_dvnextTbl[tdc->index];
1506 afs_discardDCCount--;
1508 ((tdc->f.chunkBytes +
1509 afs_fsfragsize) ^ afs_fsfragsize) >> 10;
1510 tdc->f.states &= ~(DRO|DBackup|DRW);
1511 afs_DCMoveBucket(tdc, size, 0);
1512 afs_blocksDiscarded -= size;
1513 afs_stats_cmperf.cacheBlocksDiscarded = afs_blocksDiscarded;
1515 /* Truncate the chunk so zeroes get filled properly */
1516 file = afs_CFileOpen(&tdc->f.inode);
1517 afs_CFileTruncate(file, 0);
1518 afs_CFileClose(file);
1519 afs_AdjustSize(tdc, 0);
1525 * avc->lock(R) if setLocks
1526 * avc->lock(W) if !setLocks
1532 * Fill in the newly-allocated dcache record.
1534 afs_indexFlags[tdc->index] &= ~(IFDirtyPages | IFAnyPages);
1536 /* Use shadow fid if provided. */
1537 tdc->f.fid = *ashFid;
1539 /* Use normal vcache's fid otherwise. */
1540 tdc->f.fid = avc->f.fid;
1541 if (avc->f.states & CRO)
1542 tdc->f.states = DRO;
1543 else if (avc->f.states & CBackup)
1544 tdc->f.states = DBackup;
1546 tdc->f.states = DRW;
1547 afs_DCMoveBucket(tdc, 0, afs_DCGetBucket(avc));
1548 afs_indexUnique[tdc->index] = tdc->f.fid.Fid.Unique;
1550 hones(tdc->f.versionNo); /* invalid value */
1551 tdc->f.chunk = chunk;
1552 tdc->validPos = AFS_CHUNKTOBASE(chunk);
1554 if (tdc->lruq.prev == &tdc->lruq)
1555 osi_Panic("lruq 1");
1564 * This function is called to obtain a reference to data stored in
1565 * the disk cache, locating a chunk of data containing the desired
1566 * byte and returning a reference to the disk cache entry, with its
1567 * reference count incremented.
1571 * avc : Ptr to a vcache entry (unlocked)
1572 * abyte : Byte position in the file desired
1573 * areq : Request structure identifying the requesting user.
1574 * aflags : Settings as follows:
1576 * 2 : Return after creating entry.
1577 * 4 : called from afs_vnop_write.c
1578 * *alen contains length of data to be written.
1580 * aoffset : Set to the offset within the chunk where the resident
1582 * alen : Set to the number of bytes of data after the desired
1583 * byte (including the byte itself) which can be read
1587 * The vcache entry pointed to by avc is unlocked upon entry.
1591 * Update the vnode-to-dcache hint if we can get the vnode lock
1592 * right away. Assumes dcache entry is at least read-locked.
1595 updateV2DC(int lockVc, struct vcache *v, struct dcache *d, int src)
1597 if (!lockVc || 0 == NBObtainWriteLock(&v->lock, src)) {
1598 if (hsame(v->f.m.DataVersion, d->f.versionNo) && v->callback)
1601 ReleaseWriteLock(&v->lock);
1605 /* avc - Write-locked unless aflags & 1 */
1607 afs_GetDCache(struct vcache *avc, afs_size_t abyte,
1608 struct vrequest *areq, afs_size_t * aoffset,
1609 afs_size_t * alen, int aflags)
1611 afs_int32 i, code, shortcut;
1612 #if defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV)
1613 afs_int32 adjustsize = 0;
1619 afs_size_t maxGoodLength; /* amount of good data at server */
1620 afs_size_t Position = 0;
1621 afs_int32 size, tlen; /* size of segment to transfer */
1622 struct afs_FetchOutput *tsmall = 0;
1624 struct osi_file *file;
1625 struct afs_conn *tc;
1627 struct server *newCallback = NULL;
1628 char setNewCallback;
1629 char setVcacheStatus;
1630 char doVcacheUpdate;
1632 int doAdjustSize = 0;
1633 int doReallyAdjustSize = 0;
1634 int overWriteWholeChunk = 0;
1637 struct afs_stats_AccessInfo *accP; /*Ptr to access record in stats */
1638 int fromReplica; /*Are we reading from a replica? */
1639 int numFetchLoops; /*# times around the fetch/analyze loop */
1640 #endif /* AFS_NOSTATS */
1642 AFS_STATCNT(afs_GetDCache);
1646 setLocks = aflags & 1;
1649 * Determine the chunk number and offset within the chunk corresponding
1650 * to the desired byte.
1652 if (avc->f.fid.Fid.Vnode & 1) { /* if (vType(avc) == VDIR) */
1655 chunk = AFS_CHUNK(abyte);
1658 /* come back to here if we waited for the cache to drain. */
1661 setNewCallback = setVcacheStatus = 0;
1665 ObtainWriteLock(&avc->lock, 616);
1667 ObtainReadLock(&avc->lock);
1672 * avc->lock(R) if setLocks && !slowPass
1673 * avc->lock(W) if !setLocks || slowPass
1678 /* check hints first! (might could use bcmp or some such...) */
1679 if ((tdc = avc->dchint)) {
1683 * The locking order between afs_xdcache and dcache lock matters.
1684 * The hint dcache entry could be anywhere, even on the free list.
1685 * Locking afs_xdcache ensures that noone is trying to pull dcache
1686 * entries from the free list, and thereby assuming them to be not
1687 * referenced and not locked.
1689 ObtainReadLock(&afs_xdcache);
1690 dcLocked = (0 == NBObtainSharedLock(&tdc->lock, 601));
1692 if (dcLocked && (tdc->index != NULLIDX)
1693 && !FidCmp(&tdc->f.fid, &avc->f.fid) && chunk == tdc->f.chunk
1694 && !(afs_indexFlags[tdc->index] & (IFFree | IFDiscarded))) {
1695 /* got the right one. It might not be the right version, and it
1696 * might be fetching, but it's the right dcache entry.
1698 /* All this code should be integrated better with what follows:
1699 * I can save a good bit more time under a write lock if I do..
1701 ObtainWriteLock(&tdc->tlock, 603);
1703 ReleaseWriteLock(&tdc->tlock);
1705 ReleaseReadLock(&afs_xdcache);
1708 if (hsame(tdc->f.versionNo, avc->f.m.DataVersion)
1709 && !(tdc->dflags & DFFetching)) {
1711 afs_stats_cmperf.dcacheHits++;
1712 ObtainWriteLock(&afs_xdcache, 559);
1713 QRemove(&tdc->lruq);
1714 QAdd(&afs_DLRU, &tdc->lruq);
1715 ReleaseWriteLock(&afs_xdcache);
1718 * avc->lock(R) if setLocks && !slowPass
1719 * avc->lock(W) if !setLocks || slowPass
1726 ReleaseSharedLock(&tdc->lock);
1727 ReleaseReadLock(&afs_xdcache);
1735 * avc->lock(R) if setLocks && !slowPass
1736 * avc->lock(W) if !setLocks || slowPass
1737 * tdc->lock(S) if tdc
1740 if (!tdc) { /* If the hint wasn't the right dcache entry */
1742 * Hash on the [fid, chunk] and get the corresponding dcache index
1743 * after write-locking the dcache.
1748 * avc->lock(R) if setLocks && !slowPass
1749 * avc->lock(W) if !setLocks || slowPass
1752 i = DCHash(&avc->f.fid, chunk);
1753 /* check to make sure our space is fine */
1754 afs_MaybeWakeupTruncateDaemon();
1756 ObtainWriteLock(&afs_xdcache, 280);
1758 for (index = afs_dchashTbl[i]; index != NULLIDX;) {
1759 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1760 tdc = afs_GetDSlot(index, NULL);
1761 ReleaseReadLock(&tdc->tlock);
1764 * avc->lock(R) if setLocks && !slowPass
1765 * avc->lock(W) if !setLocks || slowPass
1768 if (!FidCmp(&tdc->f.fid, &avc->f.fid) && chunk == tdc->f.chunk) {
1769 /* Move it up in the beginning of the list */
1770 if (afs_dchashTbl[i] != index) {
1771 afs_dcnextTbl[us] = afs_dcnextTbl[index];
1772 afs_dcnextTbl[index] = afs_dchashTbl[i];
1773 afs_dchashTbl[i] = index;
1775 ReleaseWriteLock(&afs_xdcache);
1776 ObtainSharedLock(&tdc->lock, 606);
1777 break; /* leaving refCount high for caller */
1783 index = afs_dcnextTbl[index];
1787 * If we didn't find the entry, we'll create one.
1789 if (index == NULLIDX) {
1792 * avc->lock(R) if setLocks
1793 * avc->lock(W) if !setLocks
1796 afs_Trace2(afs_iclSetp, CM_TRACE_GETDCACHE1, ICL_TYPE_POINTER,
1797 avc, ICL_TYPE_INT32, chunk);
1799 /* Make sure there is a free dcache entry for us to use */
1800 if (afs_discardDCList == NULLIDX && afs_freeDCList == NULLIDX) {
1803 avc->f.states |= CDCLock;
1804 /* just need slots */
1805 afs_GetDownD(5, (int *)0, afs_DCGetBucket(avc));
1807 avc->f.states &= ~CDCLock;
1808 if (afs_discardDCList != NULLIDX
1809 || afs_freeDCList != NULLIDX)
1811 /* If we can't get space for 5 mins we give up and panic */
1812 if (++downDCount > 300) {
1813 osi_Panic("getdcache");
1815 ReleaseWriteLock(&afs_xdcache);
1818 * avc->lock(R) if setLocks
1819 * avc->lock(W) if !setLocks
1821 afs_osi_Wait(1000, 0, 0);
1826 tdc = afs_AllocDCache(avc, chunk, aflags, NULL);
1829 * Now add to the two hash chains - note that i is still set
1830 * from the above DCHash call.
1832 afs_dcnextTbl[tdc->index] = afs_dchashTbl[i];
1833 afs_dchashTbl[i] = tdc->index;
1834 i = DVHash(&avc->f.fid);
1835 afs_dvnextTbl[tdc->index] = afs_dvhashTbl[i];
1836 afs_dvhashTbl[i] = tdc->index;
1837 tdc->dflags = DFEntryMod;
1839 afs_MaybeWakeupTruncateDaemon();
1840 ReleaseWriteLock(&afs_xdcache);
1841 ConvertWToSLock(&tdc->lock);
1846 /* vcache->dcache hint failed */
1849 * avc->lock(R) if setLocks && !slowPass
1850 * avc->lock(W) if !setLocks || slowPass
1853 afs_Trace4(afs_iclSetp, CM_TRACE_GETDCACHE2, ICL_TYPE_POINTER, avc,
1854 ICL_TYPE_POINTER, tdc, ICL_TYPE_INT32,
1855 hgetlo(tdc->f.versionNo), ICL_TYPE_INT32,
1856 hgetlo(avc->f.m.DataVersion));
1858 * Here we have the entry in tdc, with its refCount incremented.
1859 * Note: we don't use the S-lock on avc; it costs concurrency when
1860 * storing a file back to the server.
1864 * Not a newly created file so we need to check the file's length and
1865 * compare data versions since someone could have changed the data or we're
1866 * reading a file written elsewhere. We only want to bypass doing no-op
1867 * read rpcs on newly created files (dv of 0) since only then we guarantee
1868 * that this chunk's data hasn't been filled by another client.
1870 size = AFS_CHUNKSIZE(abyte);
1871 if (aflags & 4) /* called from write */
1873 else /* called from read */
1874 tlen = tdc->validPos - abyte;
1875 Position = AFS_CHUNKTOBASE(chunk);
1876 afs_Trace4(afs_iclSetp, CM_TRACE_GETDCACHE3, ICL_TYPE_INT32, tlen,
1877 ICL_TYPE_INT32, aflags, ICL_TYPE_OFFSET,
1878 ICL_HANDLE_OFFSET(abyte), ICL_TYPE_OFFSET,
1879 ICL_HANDLE_OFFSET(Position));
1880 if ((aflags & 4) && (hiszero(avc->f.m.DataVersion)))
1882 if ((AFS_CHUNKTOBASE(chunk) >= avc->f.m.Length) ||
1883 ((aflags & 4) && (abyte == Position) && (tlen >= size)))
1884 overWriteWholeChunk = 1;
1885 if (doAdjustSize || overWriteWholeChunk) {
1886 #if defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV)
1888 #ifdef AFS_SGI64_ENV
1891 #else /* AFS_SGI64_ENV */
1894 #endif /* AFS_SGI64_ENV */
1895 #else /* AFS_SGI_ENV */
1898 #endif /* AFS_SGI_ENV */
1899 if (AFS_CHUNKTOBASE(chunk) + adjustsize >= avc->f.m.Length &&
1900 #else /* defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV) */
1901 #if defined(AFS_SUN5_ENV)
1902 if ((doAdjustSize || (AFS_CHUNKTOBASE(chunk) >= avc->f.m.Length)) &&
1904 if (AFS_CHUNKTOBASE(chunk) >= avc->f.m.Length &&
1906 #endif /* defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV) */
1907 !hsame(avc->f.m.DataVersion, tdc->f.versionNo))
1908 doReallyAdjustSize = 1;
1910 if (doReallyAdjustSize || overWriteWholeChunk) {
1911 /* no data in file to read at this position */
1912 UpgradeSToWLock(&tdc->lock, 607);
1913 file = afs_CFileOpen(&tdc->f.inode);
1914 afs_CFileTruncate(file, 0);
1915 afs_CFileClose(file);
1916 afs_AdjustSize(tdc, 0);
1917 hset(tdc->f.versionNo, avc->f.m.DataVersion);
1918 tdc->dflags |= DFEntryMod;
1920 ConvertWToSLock(&tdc->lock);
1925 * We must read in the whole chunk if the version number doesn't
1929 /* don't need data, just a unique dcache entry */
1930 ObtainWriteLock(&afs_xdcache, 608);
1931 hset(afs_indexTimes[tdc->index], afs_indexCounter);
1932 hadd32(afs_indexCounter, 1);
1933 ReleaseWriteLock(&afs_xdcache);
1935 updateV2DC(setLocks, avc, tdc, 553);
1936 if (vType(avc) == VDIR)
1939 *aoffset = AFS_CHUNKOFFSET(abyte);
1940 if (tdc->validPos < abyte)
1941 *alen = (afs_size_t) 0;
1943 *alen = tdc->validPos - abyte;
1944 ReleaseSharedLock(&tdc->lock);
1947 ReleaseWriteLock(&avc->lock);
1949 ReleaseReadLock(&avc->lock);
1951 return tdc; /* check if we're done */
1956 * avc->lock(R) if setLocks && !slowPass
1957 * avc->lock(W) if !setLocks || slowPass
1960 osi_Assert((setLocks && !slowPass) || WriteLocked(&avc->lock));
1962 setNewCallback = setVcacheStatus = 0;
1966 * avc->lock(R) if setLocks && !slowPass
1967 * avc->lock(W) if !setLocks || slowPass
1970 if (!hsame(avc->f.m.DataVersion, tdc->f.versionNo) && !overWriteWholeChunk) {
1972 * Version number mismatch.
1975 * If we are disconnected, then we can't do much of anything
1976 * because the data doesn't match the file.
1978 if (AFS_IS_DISCONNECTED) {
1979 ReleaseSharedLock(&tdc->lock);
1982 ReleaseWriteLock(&avc->lock);
1984 ReleaseReadLock(&avc->lock);
1986 /* Flush the Dcache */
1991 UpgradeSToWLock(&tdc->lock, 609);
1994 * If data ever existed for this vnode, and this is a text object,
1995 * do some clearing. Now, you'd think you need only do the flush
1996 * when VTEXT is on, but VTEXT is turned off when the text object
1997 * is freed, while pages are left lying around in memory marked
1998 * with this vnode. If we would reactivate (create a new text
1999 * object from) this vnode, we could easily stumble upon some of
2000 * these old pages in pagein. So, we always flush these guys.
2001 * Sun has a wonderful lack of useful invariants in this system.
2003 * avc->flushDV is the data version # of the file at the last text
2004 * flush. Clearly, at least, we don't have to flush the file more
2005 * often than it changes
2007 if (hcmp(avc->flushDV, avc->f.m.DataVersion) < 0) {
2009 * By here, the cache entry is always write-locked. We can
2010 * deadlock if we call osi_Flush with the cache entry locked...
2011 * Unlock the dcache too.
2013 ReleaseWriteLock(&tdc->lock);
2014 if (setLocks && !slowPass)
2015 ReleaseReadLock(&avc->lock);
2017 ReleaseWriteLock(&avc->lock);
2021 * Call osi_FlushPages in open, read/write, and map, since it
2022 * is too hard here to figure out if we should lock the
2025 if (setLocks && !slowPass)
2026 ObtainReadLock(&avc->lock);
2028 ObtainWriteLock(&avc->lock, 66);
2029 ObtainWriteLock(&tdc->lock, 610);
2034 * avc->lock(R) if setLocks && !slowPass
2035 * avc->lock(W) if !setLocks || slowPass
2039 /* Watch for standard race condition around osi_FlushText */
2040 if (hsame(avc->f.m.DataVersion, tdc->f.versionNo)) {
2041 updateV2DC(setLocks, avc, tdc, 569); /* set hint */
2042 afs_stats_cmperf.dcacheHits++;
2043 ConvertWToSLock(&tdc->lock);
2047 /* Sleep here when cache needs to be drained. */
2048 if (setLocks && !slowPass
2049 && (afs_blocksUsed >
2050 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks))) {
2051 /* Make sure truncate daemon is running */
2052 afs_MaybeWakeupTruncateDaemon();
2053 ObtainWriteLock(&tdc->tlock, 614);
2054 tdc->refCount--; /* we'll re-obtain the dcache when we re-try. */
2055 ReleaseWriteLock(&tdc->tlock);
2056 ReleaseWriteLock(&tdc->lock);
2057 ReleaseReadLock(&avc->lock);
2058 while ((afs_blocksUsed - afs_blocksDiscarded) >
2059 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
2060 afs_WaitForCacheDrain = 1;
2061 afs_osi_Sleep(&afs_WaitForCacheDrain);
2063 afs_MaybeFreeDiscardedDCache();
2064 /* need to check if someone else got the chunk first. */
2065 goto RetryGetDCache;
2068 /* Do not fetch data beyond truncPos. */
2069 maxGoodLength = avc->f.m.Length;
2070 if (avc->f.truncPos < maxGoodLength)
2071 maxGoodLength = avc->f.truncPos;
2072 Position = AFS_CHUNKBASE(abyte);
2073 if (vType(avc) == VDIR) {
2074 size = avc->f.m.Length;
2075 if (size > tdc->f.chunkBytes) {
2076 /* pre-reserve space for file */
2077 afs_AdjustSize(tdc, size);
2079 size = 999999999; /* max size for transfer */
2081 size = AFS_CHUNKSIZE(abyte); /* expected max size */
2082 /* don't read past end of good data on server */
2083 if (Position + size > maxGoodLength)
2084 size = maxGoodLength - Position;
2086 size = 0; /* Handle random races */
2087 if (size > tdc->f.chunkBytes) {
2088 /* pre-reserve space for file */
2089 afs_AdjustSize(tdc, size); /* changes chunkBytes */
2090 /* max size for transfer still in size */
2093 if (afs_mariner && !tdc->f.chunk)
2094 afs_MarinerLog("fetch$Fetching", avc); /* , Position, size, afs_indexCounter ); */
2096 * Right now, we only have one tool, and it's a hammer. So, we
2097 * fetch the whole file.
2099 DZap(tdc); /* pages in cache may be old */
2100 file = afs_CFileOpen(&tdc->f.inode);
2101 afs_RemoveVCB(&avc->f.fid);
2102 tdc->f.states |= DWriting;
2103 tdc->dflags |= DFFetching;
2104 tdc->validPos = Position; /* which is AFS_CHUNKBASE(abyte) */
2105 if (tdc->mflags & DFFetchReq) {
2106 tdc->mflags &= ~DFFetchReq;
2107 if (afs_osi_Wakeup(&tdc->validPos) == 0)
2108 afs_Trace4(afs_iclSetp, CM_TRACE_DCACHEWAKE, ICL_TYPE_STRING,
2109 __FILE__, ICL_TYPE_INT32, __LINE__,
2110 ICL_TYPE_POINTER, tdc, ICL_TYPE_INT32,
2114 (struct afs_FetchOutput *)osi_AllocLargeSpace(sizeof(struct afs_FetchOutput));
2115 setVcacheStatus = 0;
2118 * Remember if we are doing the reading from a replicated volume,
2119 * and how many times we've zipped around the fetch/analyze loop.
2121 fromReplica = (avc->f.states & CRO) ? 1 : 0;
2123 accP = &(afs_stats_cmfullperf.accessinf);
2125 (accP->replicatedRefs)++;
2127 (accP->unreplicatedRefs)++;
2128 #endif /* AFS_NOSTATS */
2129 /* this is a cache miss */
2130 afs_Trace4(afs_iclSetp, CM_TRACE_FETCHPROC, ICL_TYPE_POINTER, avc,
2131 ICL_TYPE_FID, &(avc->f.fid), ICL_TYPE_OFFSET,
2132 ICL_HANDLE_OFFSET(Position), ICL_TYPE_INT32, size);
2135 afs_stats_cmperf.dcacheMisses++;
2138 * Dynamic root support: fetch data from local memory.
2140 if (afs_IsDynroot(avc)) {
2144 afs_GetDynroot(&dynrootDir, &dynrootLen, &tsmall->OutStatus);
2146 dynrootDir += Position;
2147 dynrootLen -= Position;
2148 if (size > dynrootLen)
2152 code = afs_CFileWrite(file, 0, dynrootDir, size);
2160 tdc->validPos = Position + size;
2161 afs_CFileTruncate(file, size); /* prune it */
2162 } else if (afs_IsDynrootMount(avc)) {
2166 afs_GetDynrootMount(&dynrootDir, &dynrootLen, &tsmall->OutStatus);
2168 dynrootDir += Position;
2169 dynrootLen -= Position;
2170 if (size > dynrootLen)
2174 code = afs_CFileWrite(file, 0, dynrootDir, size);
2182 tdc->validPos = Position + size;
2183 afs_CFileTruncate(file, size); /* prune it */
2186 * Not a dynamic vnode: do the real fetch.
2191 * avc->lock(R) if setLocks && !slowPass
2192 * avc->lock(W) if !setLocks || slowPass
2196 tc = afs_Conn(&avc->f.fid, areq, SHARED_LOCK);
2201 (accP->numReplicasAccessed)++;
2203 #endif /* AFS_NOSTATS */
2204 if (!setLocks || slowPass) {
2205 avc->callback = tc->parent->srvr->server;
2207 newCallback = tc->parent->srvr->server;
2211 code = afs_CacheFetchProc(tc, file, Position, tdc,
2217 /* callback could have been broken (or expired) in a race here,
2218 * but we return the data anyway. It's as good as we knew about
2219 * when we started. */
2221 * validPos is updated by CacheFetchProc, and can only be
2222 * modifed under a dcache write lock, which we've blocked out
2224 size = tdc->validPos - Position; /* actual segment size */
2227 afs_CFileTruncate(file, size); /* prune it */
2229 if (!setLocks || slowPass) {
2230 ObtainWriteLock(&afs_xcbhash, 453);
2231 afs_DequeueCallback(avc);
2232 avc->f.states &= ~(CStatd | CUnique);
2233 avc->callback = NULL;
2234 ReleaseWriteLock(&afs_xcbhash);
2235 if (avc->f.fid.Fid.Vnode & 1 || (vType(avc) == VDIR))
2236 osi_dnlc_purgedp(avc);
2238 /* Something lost. Forget about performance, and go
2239 * back with a vcache write lock.
2241 afs_CFileTruncate(file, 0);
2242 afs_AdjustSize(tdc, 0);
2243 afs_CFileClose(file);
2244 osi_FreeLargeSpace(tsmall);
2246 ReleaseWriteLock(&tdc->lock);
2249 ReleaseReadLock(&avc->lock);
2251 goto RetryGetDCache;
2255 } while (afs_Analyze
2256 (tc, code, &avc->f.fid, areq,
2257 AFS_STATS_FS_RPCIDX_FETCHDATA, SHARED_LOCK, NULL));
2261 * avc->lock(R) if setLocks && !slowPass
2262 * avc->lock(W) if !setLocks || slowPass
2268 * In the case of replicated access, jot down info on the number of
2269 * attempts it took before we got through or gave up.
2272 if (numFetchLoops <= 1)
2273 (accP->refFirstReplicaOK)++;
2274 if (numFetchLoops > accP->maxReplicasPerRef)
2275 accP->maxReplicasPerRef = numFetchLoops;
2277 #endif /* AFS_NOSTATS */
2279 tdc->dflags &= ~DFFetching;
2280 if (afs_osi_Wakeup(&tdc->validPos) == 0)
2281 afs_Trace4(afs_iclSetp, CM_TRACE_DCACHEWAKE, ICL_TYPE_STRING,
2282 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2283 tdc, ICL_TYPE_INT32, tdc->dflags);
2284 if (avc->execsOrWriters == 0)
2285 tdc->f.states &= ~DWriting;
2287 /* now, if code != 0, we have an error and should punt.
2288 * note that we have the vcache write lock, either because
2289 * !setLocks or slowPass.
2292 afs_CFileTruncate(file, 0);
2293 afs_AdjustSize(tdc, 0);
2294 afs_CFileClose(file);
2295 ZapDCE(tdc); /* sets DFEntryMod */
2296 if (vType(avc) == VDIR) {
2299 tdc->f.states &= ~(DRO|DBackup|DRW);
2300 afs_DCMoveBucket(tdc, 0, 0);
2301 ReleaseWriteLock(&tdc->lock);
2303 if (!afs_IsDynroot(avc)) {
2304 ObtainWriteLock(&afs_xcbhash, 454);
2305 afs_DequeueCallback(avc);
2306 avc->f.states &= ~(CStatd | CUnique);
2307 ReleaseWriteLock(&afs_xcbhash);
2308 if (avc->f.fid.Fid.Vnode & 1 || (vType(avc) == VDIR))
2309 osi_dnlc_purgedp(avc);
2312 * avc->lock(W); assert(!setLocks || slowPass)
2314 osi_Assert(!setLocks || slowPass);
2320 /* otherwise we copy in the just-fetched info */
2321 afs_CFileClose(file);
2322 afs_AdjustSize(tdc, size); /* new size */
2324 * Copy appropriate fields into vcache. Status is
2325 * copied later where we selectively acquire the
2326 * vcache write lock.
2329 afs_ProcessFS(avc, &tsmall->OutStatus, areq);
2331 setVcacheStatus = 1;
2332 hset64(tdc->f.versionNo, tsmall->OutStatus.dataVersionHigh,
2333 tsmall->OutStatus.DataVersion);
2334 tdc->dflags |= DFEntryMod;
2335 afs_indexFlags[tdc->index] |= IFEverUsed;
2336 ConvertWToSLock(&tdc->lock);
2337 } /*Data version numbers don't match */
2340 * Data version numbers match.
2342 afs_stats_cmperf.dcacheHits++;
2343 } /*Data version numbers match */
2345 updateV2DC(setLocks, avc, tdc, 335); /* set hint */
2349 * avc->lock(R) if setLocks && !slowPass
2350 * avc->lock(W) if !setLocks || slowPass
2351 * tdc->lock(S) if tdc
2355 * See if this was a reference to a file in the local cell.
2357 if (afs_IsPrimaryCellNum(avc->f.fid.Cell))
2358 afs_stats_cmperf.dlocalAccesses++;
2360 afs_stats_cmperf.dremoteAccesses++;
2362 /* Fix up LRU info */
2365 ObtainWriteLock(&afs_xdcache, 602);
2366 hset(afs_indexTimes[tdc->index], afs_indexCounter);
2367 hadd32(afs_indexCounter, 1);
2368 ReleaseWriteLock(&afs_xdcache);
2370 /* return the data */
2371 if (vType(avc) == VDIR)
2374 *aoffset = AFS_CHUNKOFFSET(abyte);
2375 *alen = (tdc->f.chunkBytes - *aoffset);
2376 ReleaseSharedLock(&tdc->lock);
2381 * avc->lock(R) if setLocks && !slowPass
2382 * avc->lock(W) if !setLocks || slowPass
2385 /* Fix up the callback and status values in the vcache */
2387 if (setLocks && !slowPass) {
2390 * This is our dirty little secret to parallel fetches.
2391 * We don't write-lock the vcache while doing the fetch,
2392 * but potentially we'll need to update the vcache after
2393 * the fetch is done.
2395 * Drop the read lock and try to re-obtain the write
2396 * lock. If the vcache still has the same DV, it's
2397 * ok to go ahead and install the new data.
2399 afs_hyper_t currentDV, statusDV;
2401 hset(currentDV, avc->f.m.DataVersion);
2403 if (setNewCallback && avc->callback != newCallback)
2407 hset64(statusDV, tsmall->OutStatus.dataVersionHigh,
2408 tsmall->OutStatus.DataVersion);
2410 if (setVcacheStatus && avc->f.m.Length != tsmall->OutStatus.Length)
2412 if (setVcacheStatus && !hsame(currentDV, statusDV))
2416 ReleaseReadLock(&avc->lock);
2418 if (doVcacheUpdate) {
2419 ObtainWriteLock(&avc->lock, 615);
2420 if (!hsame(avc->f.m.DataVersion, currentDV)) {
2421 /* We lose. Someone will beat us to it. */
2423 ReleaseWriteLock(&avc->lock);
2428 /* With slow pass, we've already done all the updates */
2430 ReleaseWriteLock(&avc->lock);
2433 /* Check if we need to perform any last-minute fixes with a write-lock */
2434 if (!setLocks || doVcacheUpdate) {
2436 avc->callback = newCallback;
2437 if (tsmall && setVcacheStatus)
2438 afs_ProcessFS(avc, &tsmall->OutStatus, areq);
2440 ReleaseWriteLock(&avc->lock);
2444 osi_FreeLargeSpace(tsmall);
2447 } /*afs_GetDCache */
2451 * afs_WriteThroughDSlots
2454 * Sweep through the dcache slots and write out any modified
2455 * in-memory data back on to our caching store.
2461 * The afs_xdcache is write-locked through this whole affair.
2464 afs_WriteThroughDSlots(void)
2467 afs_int32 i, touchedit = 0;
2469 struct afs_q DirtyQ, *tq;
2471 AFS_STATCNT(afs_WriteThroughDSlots);
2474 * Because of lock ordering, we can't grab dcache locks while
2475 * holding afs_xdcache. So we enter xdcache, get a reference
2476 * for every dcache entry, and exit xdcache.
2478 ObtainWriteLock(&afs_xdcache, 283);
2480 for (i = 0; i < afs_cacheFiles; i++) {
2481 tdc = afs_indexTable[i];
2483 /* Grab tlock in case the existing refcount isn't zero */
2484 if (tdc && !(afs_indexFlags[i] & (IFFree | IFDiscarded))) {
2485 ObtainWriteLock(&tdc->tlock, 623);
2487 ReleaseWriteLock(&tdc->tlock);
2489 QAdd(&DirtyQ, &tdc->dirty);
2492 ReleaseWriteLock(&afs_xdcache);
2495 * Now, for each dcache entry we found, check if it's dirty.
2496 * If so, get write-lock, get afs_xdcache, which protects
2497 * afs_cacheInodep, and flush it. Don't forget to put back
2501 #define DQTODC(q) ((struct dcache *)(((char *) (q)) - sizeof(struct afs_q)))
2503 for (tq = DirtyQ.prev; tq != &DirtyQ; tq = QPrev(tq)) {
2505 if (tdc->dflags & DFEntryMod) {
2508 wrLock = (0 == NBObtainWriteLock(&tdc->lock, 619));
2510 /* Now that we have the write lock, double-check */
2511 if (wrLock && (tdc->dflags & DFEntryMod)) {
2512 tdc->dflags &= ~DFEntryMod;
2513 ObtainWriteLock(&afs_xdcache, 620);
2514 afs_WriteDCache(tdc, 1);
2515 ReleaseWriteLock(&afs_xdcache);
2519 ReleaseWriteLock(&tdc->lock);
2525 ObtainWriteLock(&afs_xdcache, 617);
2526 if (!touchedit && (cacheDiskType != AFS_FCACHE_TYPE_MEM)) {
2527 /* Touch the file to make sure that the mtime on the file is kept
2528 * up-to-date to avoid losing cached files on cold starts because
2529 * their mtime seems old...
2531 struct afs_fheader theader;
2533 theader.magic = AFS_FHMAGIC;
2534 theader.firstCSize = AFS_FIRSTCSIZE;
2535 theader.otherCSize = AFS_OTHERCSIZE;
2536 theader.version = AFS_CI_VERSION;
2537 theader.dataSize = sizeof(struct fcache);
2538 afs_osi_Write(afs_cacheInodep, 0, &theader, sizeof(theader));
2540 ReleaseWriteLock(&afs_xdcache);
2547 * Return a pointer to an freshly initialized dcache entry using
2548 * a memory-based cache. The tlock will be read-locked.
2551 * aslot : Dcache slot to look at.
2552 * tmpdc : Ptr to dcache entry.
2555 * Must be called with afs_xdcache write-locked.
2559 afs_MemGetDSlot(afs_int32 aslot, struct dcache *tmpdc)
2564 AFS_STATCNT(afs_MemGetDSlot);
2565 if (CheckLock(&afs_xdcache) != -1)
2566 osi_Panic("getdslot nolock");
2567 if (aslot < 0 || aslot >= afs_cacheFiles)
2568 osi_Panic("getdslot slot %d (of %d)", aslot, afs_cacheFiles);
2569 tdc = afs_indexTable[aslot];
2571 QRemove(&tdc->lruq); /* move to queue head */
2572 QAdd(&afs_DLRU, &tdc->lruq);
2573 /* We're holding afs_xdcache, but get tlock in case refCount != 0 */
2574 ObtainWriteLock(&tdc->tlock, 624);
2576 ConvertWToRLock(&tdc->tlock);
2579 if (tmpdc == NULL) {
2580 if (!afs_freeDSList)
2581 afs_GetDownDSlot(4);
2582 if (!afs_freeDSList) {
2583 /* none free, making one is better than a panic */
2584 afs_stats_cmperf.dcacheXAllocs++; /* count in case we have a leak */
2585 tdc = afs_osi_Alloc(sizeof(struct dcache));
2586 osi_Assert(tdc != NULL);
2587 #ifdef KERNEL_HAVE_PIN
2588 pin((char *)tdc, sizeof(struct dcache)); /* XXX */
2591 tdc = afs_freeDSList;
2592 afs_freeDSList = (struct dcache *)tdc->lruq.next;
2595 tdc->dflags = 0; /* up-to-date, not in free q */
2597 QAdd(&afs_DLRU, &tdc->lruq);
2598 if (tdc->lruq.prev == &tdc->lruq)
2599 osi_Panic("lruq 3");
2605 /* initialize entry */
2606 tdc->f.fid.Cell = 0;
2607 tdc->f.fid.Fid.Volume = 0;
2609 hones(tdc->f.versionNo);
2610 tdc->f.inode.mem = aslot;
2611 tdc->dflags |= DFEntryMod;
2614 afs_indexUnique[aslot] = tdc->f.fid.Fid.Unique;
2617 osi_Assert(0 == NBObtainWriteLock(&tdc->lock, 674));
2618 osi_Assert(0 == NBObtainWriteLock(&tdc->mflock, 675));
2619 osi_Assert(0 == NBObtainWriteLock(&tdc->tlock, 676));
2622 AFS_RWLOCK_INIT(&tdc->lock, "dcache lock");
2623 AFS_RWLOCK_INIT(&tdc->tlock, "dcache tlock");
2624 AFS_RWLOCK_INIT(&tdc->mflock, "dcache flock");
2625 ObtainReadLock(&tdc->tlock);
2628 afs_indexTable[aslot] = tdc;
2631 } /*afs_MemGetDSlot */
2633 unsigned int last_error = 0, lasterrtime = 0;
2639 * Return a pointer to an freshly initialized dcache entry using
2640 * a UFS-based disk cache. The dcache tlock will be read-locked.
2643 * aslot : Dcache slot to look at.
2644 * tmpdc : Ptr to dcache entry.
2647 * afs_xdcache lock write-locked.
2650 afs_UFSGetDSlot(afs_int32 aslot, struct dcache *tmpdc)
2657 AFS_STATCNT(afs_UFSGetDSlot);
2658 if (CheckLock(&afs_xdcache) != -1)
2659 osi_Panic("getdslot nolock");
2660 if (aslot < 0 || aslot >= afs_cacheFiles)
2661 osi_Panic("getdslot slot %d (of %d)", aslot, afs_cacheFiles);
2662 tdc = afs_indexTable[aslot];
2664 QRemove(&tdc->lruq); /* move to queue head */
2665 QAdd(&afs_DLRU, &tdc->lruq);
2666 /* Grab tlock in case refCount != 0 */
2667 ObtainWriteLock(&tdc->tlock, 625);
2669 ConvertWToRLock(&tdc->tlock);
2672 /* otherwise we should read it in from the cache file */
2674 * If we weren't passed an in-memory region to place the file info,
2675 * we have to allocate one.
2677 if (tmpdc == NULL) {
2678 if (!afs_freeDSList)
2679 afs_GetDownDSlot(4);
2680 if (!afs_freeDSList) {
2681 /* none free, making one is better than a panic */
2682 afs_stats_cmperf.dcacheXAllocs++; /* count in case we have a leak */
2683 tdc = afs_osi_Alloc(sizeof(struct dcache));
2684 osi_Assert(tdc != NULL);
2685 #ifdef KERNEL_HAVE_PIN
2686 pin((char *)tdc, sizeof(struct dcache)); /* XXX */
2689 tdc = afs_freeDSList;
2690 afs_freeDSList = (struct dcache *)tdc->lruq.next;
2693 tdc->dflags = 0; /* up-to-date, not in free q */
2695 QAdd(&afs_DLRU, &tdc->lruq);
2696 if (tdc->lruq.prev == &tdc->lruq)
2697 osi_Panic("lruq 3");
2704 * Seek to the aslot'th entry and read it in.
2707 afs_osi_Read(afs_cacheInodep,
2708 sizeof(struct fcache) * aslot +
2709 sizeof(struct afs_fheader), (char *)(&tdc->f),
2710 sizeof(struct fcache));
2712 if (code != sizeof(struct fcache))
2714 if (!afs_CellNumValid(tdc->f.fid.Cell))
2718 tdc->f.fid.Cell = 0;
2719 tdc->f.fid.Fid.Volume = 0;
2721 hones(tdc->f.versionNo);
2722 tdc->dflags |= DFEntryMod;
2723 #if defined(KERNEL_HAVE_UERROR)
2724 last_error = getuerror();
2726 lasterrtime = osi_Time();
2727 afs_indexUnique[aslot] = tdc->f.fid.Fid.Unique;
2728 tdc->f.states &= ~(DRO|DBackup|DRW);
2729 afs_DCMoveBucket(tdc, 0, 0);
2732 if (tdc->f.states & DRO) {
2733 afs_DCMoveBucket(tdc, 0, 2);
2734 } else if (tdc->f.states & DBackup) {
2735 afs_DCMoveBucket(tdc, 0, 1);
2737 afs_DCMoveBucket(tdc, 0, 1);
2743 if (tdc->f.chunk >= 0)
2744 tdc->validPos = AFS_CHUNKTOBASE(tdc->f.chunk) + tdc->f.chunkBytes;
2749 osi_Assert(0 == NBObtainWriteLock(&tdc->lock, 674));
2750 osi_Assert(0 == NBObtainWriteLock(&tdc->mflock, 675));
2751 osi_Assert(0 == NBObtainWriteLock(&tdc->tlock, 676));
2754 AFS_RWLOCK_INIT(&tdc->lock, "dcache lock");
2755 AFS_RWLOCK_INIT(&tdc->tlock, "dcache tlock");
2756 AFS_RWLOCK_INIT(&tdc->mflock, "dcache flock");
2757 ObtainReadLock(&tdc->tlock);
2760 * If we didn't read into a temporary dcache region, update the
2761 * slot pointer table.
2764 afs_indexTable[aslot] = tdc;
2767 } /*afs_UFSGetDSlot */
2772 * Write a particular dcache entry back to its home in the
2775 * \param adc Pointer to the dcache entry to write.
2776 * \param atime If true, set the modtime on the file to the current time.
2778 * \note Environment:
2779 * Must be called with the afs_xdcache lock at least read-locked,
2780 * and dcache entry at least read-locked.
2781 * The reference count is not changed.
2785 afs_WriteDCache(struct dcache *adc, int atime)
2789 if (cacheDiskType == AFS_FCACHE_TYPE_MEM)
2791 AFS_STATCNT(afs_WriteDCache);
2792 osi_Assert(WriteLocked(&afs_xdcache));
2794 adc->f.modTime = osi_Time();
2796 * Seek to the right dcache slot and write the in-memory image out to disk.
2798 afs_cellname_write();
2800 afs_osi_Write(afs_cacheInodep,
2801 sizeof(struct fcache) * adc->index +
2802 sizeof(struct afs_fheader), (char *)(&adc->f),
2803 sizeof(struct fcache));
2804 if (code != sizeof(struct fcache))
2812 * Wake up users of a particular file waiting for stores to take
2815 * \param avc Ptr to related vcache entry.
2817 * \note Environment:
2818 * Nothing interesting.
2821 afs_wakeup(struct vcache *avc)
2824 struct brequest *tb;
2826 AFS_STATCNT(afs_wakeup);
2827 for (i = 0; i < NBRS; i++, tb++) {
2828 /* if request is valid and for this file, we've found it */
2829 if (tb->refCount > 0 && avc == tb->vc) {
2832 * If CSafeStore is on, then we don't awaken the guy
2833 * waiting for the store until the whole store has finished.
2834 * Otherwise, we do it now. Note that if CSafeStore is on,
2835 * the BStore routine actually wakes up the user, instead
2837 * I think this is redundant now because this sort of thing
2838 * is already being handled by the higher-level code.
2840 if ((avc->f.states & CSafeStore) == 0) {
2842 tb->flags |= BUVALID;
2843 if (tb->flags & BUWAIT) {
2844 tb->flags &= ~BUWAIT;
2856 * Given a file name and inode, set up that file to be an
2857 * active member in the AFS cache. This also involves checking
2858 * the usability of its data.
2860 * \param afile Name of the cache file to initialize.
2861 * \param ainode Inode of the file.
2863 * \note Environment:
2864 * This function is called only during initialization.
2867 afs_InitCacheFile(char *afile, ino_t ainode)
2872 struct osi_file *tfile;
2873 struct osi_stat tstat;
2876 AFS_STATCNT(afs_InitCacheFile);
2877 index = afs_stats_cmperf.cacheNumEntries;
2878 if (index >= afs_cacheFiles)
2881 ObtainWriteLock(&afs_xdcache, 282);
2882 tdc = afs_GetDSlot(index, NULL);
2883 ReleaseReadLock(&tdc->tlock);
2884 ReleaseWriteLock(&afs_xdcache);
2886 ObtainWriteLock(&tdc->lock, 621);
2887 ObtainWriteLock(&afs_xdcache, 622);
2889 code = afs_LookupInodeByPath(afile, &tdc->f.inode.ufs, NULL);
2891 ReleaseWriteLock(&afs_xdcache);
2892 ReleaseWriteLock(&tdc->lock);
2897 /* Add any other 'complex' inode types here ... */
2898 #if !defined(AFS_LINUX26_ENV) && !defined(AFS_CACHE_VNODE_PATH)
2899 tdc->f.inode.ufs = ainode;
2901 osi_Panic("Can't init cache with inode numbers when complex inodes are "
2906 if ((tdc->f.states & DWriting) || tdc->f.fid.Fid.Volume == 0)
2908 tfile = osi_UFSOpen(&tdc->f.inode);
2909 code = afs_osi_Stat(tfile, &tstat);
2911 osi_Panic("initcachefile stat");
2914 * If file size doesn't match the cache info file, it's probably bad.
2916 if (tdc->f.chunkBytes != tstat.size)
2918 tdc->f.chunkBytes = 0;
2921 * If file changed within T (120?) seconds of cache info file, it's
2922 * probably bad. In addition, if slot changed within last T seconds,
2923 * the cache info file may be incorrectly identified, and so slot
2926 if (cacheInfoModTime < tstat.mtime + 120)
2928 if (cacheInfoModTime < tdc->f.modTime + 120)
2930 /* In case write through is behind, make sure cache items entry is
2931 * at least as new as the chunk.
2933 if (tdc->f.modTime < tstat.mtime)
2936 tdc->f.fid.Fid.Volume = 0; /* not in the hash table */
2937 if (tstat.size != 0)
2938 osi_UFSTruncate(tfile, 0);
2939 tdc->f.states &= ~(DRO|DBackup|DRW);
2940 afs_DCMoveBucket(tdc, 0, 0);
2941 /* put entry in free cache slot list */
2942 afs_dvnextTbl[tdc->index] = afs_freeDCList;
2943 afs_freeDCList = index;
2945 afs_indexFlags[index] |= IFFree;
2946 afs_indexUnique[index] = 0;
2949 * We must put this entry in the appropriate hash tables.
2950 * Note that i is still set from the above DCHash call
2952 code = DCHash(&tdc->f.fid, tdc->f.chunk);
2953 afs_dcnextTbl[tdc->index] = afs_dchashTbl[code];
2954 afs_dchashTbl[code] = tdc->index;
2955 code = DVHash(&tdc->f.fid);
2956 afs_dvnextTbl[tdc->index] = afs_dvhashTbl[code];
2957 afs_dvhashTbl[code] = tdc->index;
2958 afs_AdjustSize(tdc, tstat.size); /* adjust to new size */
2960 /* has nontrivial amt of data */
2961 afs_indexFlags[index] |= IFEverUsed;
2962 afs_stats_cmperf.cacheFilesReused++;
2964 * Initialize index times to file's mod times; init indexCounter
2967 hset32(afs_indexTimes[index], tstat.atime);
2968 if (hgetlo(afs_indexCounter) < tstat.atime) {
2969 hset32(afs_indexCounter, tstat.atime);
2971 afs_indexUnique[index] = tdc->f.fid.Fid.Unique;
2972 } /*File is not bad */
2974 osi_UFSClose(tfile);
2975 tdc->f.states &= ~DWriting;
2976 tdc->dflags &= ~DFEntryMod;
2977 /* don't set f.modTime; we're just cleaning up */
2978 afs_WriteDCache(tdc, 0);
2979 ReleaseWriteLock(&afs_xdcache);
2980 ReleaseWriteLock(&tdc->lock);
2982 afs_stats_cmperf.cacheNumEntries++;
2987 /*Max # of struct dcache's resident at any time*/
2989 * If 'dchint' is enabled then in-memory dcache min is increased because of
2995 * Initialize dcache related variables.
3005 afs_dcacheInit(int afiles, int ablocks, int aDentries, int achunk, int aflags)
3011 afs_freeDCList = NULLIDX;
3012 afs_discardDCList = NULLIDX;
3013 afs_freeDCCount = 0;
3014 afs_freeDSList = NULL;
3015 hzero(afs_indexCounter);
3017 LOCK_INIT(&afs_xdcache, "afs_xdcache");
3023 if (achunk < 0 || achunk > 30)
3024 achunk = 13; /* Use default */
3025 AFS_SETCHUNKSIZE(achunk);
3031 if (aflags & AFSCALL_INIT_MEMCACHE) {
3033 * Use a memory cache instead of a disk cache
3035 cacheDiskType = AFS_FCACHE_TYPE_MEM;
3036 afs_cacheType = &afs_MemCacheOps;
3037 afiles = (afiles < aDentries) ? afiles : aDentries; /* min */
3038 ablocks = afiles * (AFS_FIRSTCSIZE / 1024);
3039 /* ablocks is reported in 1K blocks */
3040 code = afs_InitMemCache(afiles, AFS_FIRSTCSIZE, aflags);
3042 afs_warn("afsd: memory cache too large for available memory.\n");
3043 afs_warn("afsd: AFS files cannot be accessed.\n\n");
3045 afiles = ablocks = 0;
3047 afs_warn("Memory cache: Allocating %d dcache entries...",
3050 cacheDiskType = AFS_FCACHE_TYPE_UFS;
3051 afs_cacheType = &afs_UfsCacheOps;
3054 if (aDentries > 512)
3055 afs_dhashsize = 2048;
3056 /* initialize hash tables */
3057 afs_dvhashTbl = afs_osi_Alloc(afs_dhashsize * sizeof(afs_int32));
3058 osi_Assert(afs_dvhashTbl != NULL);
3059 afs_dchashTbl = afs_osi_Alloc(afs_dhashsize * sizeof(afs_int32));
3060 osi_Assert(afs_dchashTbl != NULL);
3061 for (i = 0; i < afs_dhashsize; i++) {
3062 afs_dvhashTbl[i] = NULLIDX;
3063 afs_dchashTbl[i] = NULLIDX;
3065 afs_dvnextTbl = afs_osi_Alloc(afiles * sizeof(afs_int32));
3066 osi_Assert(afs_dvnextTbl != NULL);
3067 afs_dcnextTbl = afs_osi_Alloc(afiles * sizeof(afs_int32));
3068 osi_Assert(afs_dcnextTbl != NULL);
3069 for (i = 0; i < afiles; i++) {
3070 afs_dvnextTbl[i] = NULLIDX;
3071 afs_dcnextTbl[i] = NULLIDX;
3074 /* Allocate and zero the pointer array to the dcache entries */
3075 afs_indexTable = afs_osi_Alloc(sizeof(struct dcache *) * afiles);
3076 osi_Assert(afs_indexTable != NULL);
3077 memset(afs_indexTable, 0, sizeof(struct dcache *) * afiles);
3078 afs_indexTimes = afs_osi_Alloc(afiles * sizeof(afs_hyper_t));
3079 osi_Assert(afs_indexTimes != NULL);
3080 memset(afs_indexTimes, 0, afiles * sizeof(afs_hyper_t));
3081 afs_indexUnique = afs_osi_Alloc(afiles * sizeof(afs_uint32));
3082 osi_Assert(afs_indexUnique != NULL);
3083 memset(afs_indexUnique, 0, afiles * sizeof(afs_uint32));
3084 afs_indexFlags = afs_osi_Alloc(afiles * sizeof(u_char));
3085 osi_Assert(afs_indexFlags != NULL);
3086 memset(afs_indexFlags, 0, afiles * sizeof(char));
3088 /* Allocate and thread the struct dcache entries themselves */
3089 tdp = afs_Initial_freeDSList =
3090 afs_osi_Alloc(aDentries * sizeof(struct dcache));
3091 osi_Assert(tdp != NULL);
3092 memset(tdp, 0, aDentries * sizeof(struct dcache));
3093 #ifdef KERNEL_HAVE_PIN
3094 pin((char *)afs_indexTable, sizeof(struct dcache *) * afiles); /* XXX */
3095 pin((char *)afs_indexTimes, sizeof(afs_hyper_t) * afiles); /* XXX */
3096 pin((char *)afs_indexFlags, sizeof(char) * afiles); /* XXX */
3097 pin((char *)afs_indexUnique, sizeof(afs_int32) * afiles); /* XXX */
3098 pin((char *)tdp, aDentries * sizeof(struct dcache)); /* XXX */
3099 pin((char *)afs_dvhashTbl, sizeof(afs_int32) * afs_dhashsize); /* XXX */
3100 pin((char *)afs_dchashTbl, sizeof(afs_int32) * afs_dhashsize); /* XXX */
3101 pin((char *)afs_dcnextTbl, sizeof(afs_int32) * afiles); /* XXX */
3102 pin((char *)afs_dvnextTbl, sizeof(afs_int32) * afiles); /* XXX */
3105 afs_freeDSList = &tdp[0];
3106 for (i = 0; i < aDentries - 1; i++) {
3107 tdp[i].lruq.next = (struct afs_q *)(&tdp[i + 1]);
3108 AFS_RWLOCK_INIT(&tdp[i].lock, "dcache lock");
3109 AFS_RWLOCK_INIT(&tdp[i].tlock, "dcache tlock");
3110 AFS_RWLOCK_INIT(&tdp[i].mflock, "dcache flock");
3112 tdp[aDentries - 1].lruq.next = (struct afs_q *)0;
3113 AFS_RWLOCK_INIT(&tdp[aDentries - 1].lock, "dcache lock");
3114 AFS_RWLOCK_INIT(&tdp[aDentries - 1].tlock, "dcache tlock");
3115 AFS_RWLOCK_INIT(&tdp[aDentries - 1].mflock, "dcache flock");
3117 afs_stats_cmperf.cacheBlocksOrig = afs_stats_cmperf.cacheBlocksTotal =
3118 afs_cacheBlocks = ablocks;
3119 afs_ComputeCacheParms(); /* compute parms based on cache size */
3121 afs_dcentries = aDentries;
3123 afs_stats_cmperf.cacheBucket0_Discarded =
3124 afs_stats_cmperf.cacheBucket1_Discarded =
3125 afs_stats_cmperf.cacheBucket2_Discarded = 0;
3131 * Shuts down the cache.
3135 shutdown_dcache(void)
3139 #ifdef AFS_CACHE_VNODE_PATH
3140 if (cacheDiskType != AFS_FCACHE_TYPE_MEM) {
3142 for (i = 0; i < afs_cacheFiles; i++) {
3143 tdc = afs_indexTable[i];
3145 afs_osi_FreeStr(tdc->f.inode.ufs);
3151 afs_osi_Free(afs_dvnextTbl, afs_cacheFiles * sizeof(afs_int32));
3152 afs_osi_Free(afs_dcnextTbl, afs_cacheFiles * sizeof(afs_int32));
3153 afs_osi_Free(afs_indexTable, afs_cacheFiles * sizeof(struct dcache *));
3154 afs_osi_Free(afs_indexTimes, afs_cacheFiles * sizeof(afs_hyper_t));
3155 afs_osi_Free(afs_indexUnique, afs_cacheFiles * sizeof(afs_uint32));
3156 afs_osi_Free(afs_indexFlags, afs_cacheFiles * sizeof(u_char));
3157 afs_osi_Free(afs_Initial_freeDSList,
3158 afs_dcentries * sizeof(struct dcache));
3159 #ifdef KERNEL_HAVE_PIN
3160 unpin((char *)afs_dcnextTbl, afs_cacheFiles * sizeof(afs_int32));
3161 unpin((char *)afs_dvnextTbl, afs_cacheFiles * sizeof(afs_int32));
3162 unpin((char *)afs_indexTable, afs_cacheFiles * sizeof(struct dcache *));
3163 unpin((char *)afs_indexTimes, afs_cacheFiles * sizeof(afs_hyper_t));
3164 unpin((char *)afs_indexUnique, afs_cacheFiles * sizeof(afs_uint32));
3165 unpin((u_char *) afs_indexFlags, afs_cacheFiles * sizeof(u_char));
3166 unpin(afs_Initial_freeDSList, afs_dcentries * sizeof(struct dcache));
3170 for (i = 0; i < afs_dhashsize; i++) {
3171 afs_dvhashTbl[i] = NULLIDX;
3172 afs_dchashTbl[i] = NULLIDX;
3175 afs_osi_Free(afs_dvhashTbl, afs_dhashsize * sizeof(afs_int32));
3176 afs_osi_Free(afs_dchashTbl, afs_dhashsize * sizeof(afs_int32));
3178 afs_blocksUsed = afs_dcentries = 0;
3179 afs_stats_cmperf.cacheBucket0_Discarded =
3180 afs_stats_cmperf.cacheBucket1_Discarded =
3181 afs_stats_cmperf.cacheBucket2_Discarded = 0;
3182 hzero(afs_indexCounter);
3184 afs_freeDCCount = 0;
3185 afs_freeDCList = NULLIDX;
3186 afs_discardDCList = NULLIDX;
3187 afs_freeDSList = afs_Initial_freeDSList = 0;
3189 LOCK_INIT(&afs_xdcache, "afs_xdcache");
3195 * Get a dcache ready for writing, respecting the current cache size limits
3197 * len is required because afs_GetDCache with flag == 4 expects the length
3198 * field to be filled. It decides from this whether it's necessary to fetch
3199 * data into the chunk before writing or not (when the whole chunk is
3202 * \param avc The vcache to fetch a dcache for
3203 * \param filePos The start of the section to be written
3204 * \param len The length of the section to be written
3208 * \return If successful, a reference counted dcache with tdc->lock held. Lock
3209 * must be released and afs_PutDCache() called to free dcache.
3212 * \note avc->lock must be held on entry. Function may release and reobtain
3213 * avc->lock and GLOCK.
3217 afs_ObtainDCacheForWriting(struct vcache *avc, afs_size_t filePos,
3218 afs_size_t len, struct vrequest *areq,
3221 struct dcache *tdc = NULL;
3224 /* read the cached info */
3226 tdc = afs_FindDCache(avc, filePos);
3228 ObtainWriteLock(&tdc->lock, 657);
3229 } else if (afs_blocksUsed >
3230 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
3231 tdc = afs_FindDCache(avc, filePos);
3233 ObtainWriteLock(&tdc->lock, 658);
3234 if (!hsame(tdc->f.versionNo, avc->f.m.DataVersion)
3235 || (tdc->dflags & DFFetching)) {
3236 ReleaseWriteLock(&tdc->lock);
3242 afs_MaybeWakeupTruncateDaemon();
3243 while (afs_blocksUsed >
3244 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
3245 ReleaseWriteLock(&avc->lock);
3246 if (afs_blocksUsed - afs_blocksDiscarded >
3247 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
3248 afs_WaitForCacheDrain = 1;
3249 afs_osi_Sleep(&afs_WaitForCacheDrain);
3251 afs_MaybeFreeDiscardedDCache();
3252 afs_MaybeWakeupTruncateDaemon();
3253 ObtainWriteLock(&avc->lock, 509);
3255 avc->f.states |= CDirty;
3256 tdc = afs_GetDCache(avc, filePos, areq, &offset, &len, 4);
3258 ObtainWriteLock(&tdc->lock, 659);
3261 tdc = afs_GetDCache(avc, filePos, areq, &offset, &len, 4);
3263 ObtainWriteLock(&tdc->lock, 660);
3266 if (!(afs_indexFlags[tdc->index] & IFDataMod)) {
3267 afs_stats_cmperf.cacheCurrDirtyChunks++;
3268 afs_indexFlags[tdc->index] |= IFDataMod; /* so it doesn't disappear */
3270 if (!(tdc->f.states & DWriting)) {
3271 /* don't mark entry as mod if we don't have to */
3272 tdc->f.states |= DWriting;
3273 tdc->dflags |= DFEntryMod;
3280 * Make a shadow copy of a dir's dcache. It's used for disconnected
3281 * operations like remove/create/rename to keep the original directory data.
3282 * On reconnection, we can diff the original data with the server and get the
3283 * server changes and with the local data to get the local changes.
3285 * \param avc The dir vnode.
3286 * \param adc The dir dcache.
3288 * \return 0 for success.
3290 * \note The vcache entry must be write locked.
3291 * \note The dcache entry must be read locked.
3294 afs_MakeShadowDir(struct vcache *avc, struct dcache *adc)
3296 int i, code, ret_code = 0, written, trans_size;
3297 struct dcache *new_dc = NULL;
3298 struct osi_file *tfile_src, *tfile_dst;
3299 struct VenusFid shadow_fid;
3302 /* Is this a dir? */
3303 if (vType(avc) != VDIR)
3306 if (avc->f.shadow.vnode || avc->f.shadow.unique)
3309 /* Generate a fid for the shadow dir. */
3310 shadow_fid.Cell = avc->f.fid.Cell;
3311 shadow_fid.Fid.Volume = avc->f.fid.Fid.Volume;
3312 afs_GenShadowFid(&shadow_fid);
3314 ObtainWriteLock(&afs_xdcache, 716);
3316 /* Get a fresh dcache. */
3317 new_dc = afs_AllocDCache(avc, 0, 0, &shadow_fid);
3319 ObtainReadLock(&adc->mflock);
3321 /* Set up the new fid. */
3322 /* Copy interesting data from original dir dcache. */
3323 new_dc->mflags = adc->mflags;
3324 new_dc->dflags = adc->dflags;
3325 new_dc->f.modTime = adc->f.modTime;
3326 new_dc->f.versionNo = adc->f.versionNo;
3327 new_dc->f.states = adc->f.states;
3328 new_dc->f.chunk= adc->f.chunk;
3329 new_dc->f.chunkBytes = adc->f.chunkBytes;
3331 ReleaseReadLock(&adc->mflock);
3333 /* Now add to the two hash chains */
3334 i = DCHash(&shadow_fid, 0);
3335 afs_dcnextTbl[new_dc->index] = afs_dchashTbl[i];
3336 afs_dchashTbl[i] = new_dc->index;
3338 i = DVHash(&shadow_fid);
3339 afs_dvnextTbl[new_dc->index] = afs_dvhashTbl[i];
3340 afs_dvhashTbl[i] = new_dc->index;
3342 ReleaseWriteLock(&afs_xdcache);
3344 /* Alloc a 4k block. */
3345 data = afs_osi_Alloc(4096);
3347 afs_warn("afs_MakeShadowDir: could not alloc data\n");
3352 /* Open the files. */
3353 tfile_src = afs_CFileOpen(&adc->f.inode);
3354 tfile_dst = afs_CFileOpen(&new_dc->f.inode);
3356 /* And now copy dir dcache data into this dcache,
3360 while (written < adc->f.chunkBytes) {
3361 trans_size = adc->f.chunkBytes - written;
3362 if (trans_size > 4096)
3365 /* Read a chunk from the dcache. */
3366 code = afs_CFileRead(tfile_src, written, data, trans_size);
3367 if (code < trans_size) {
3372 /* Write it to the new dcache. */
3373 code = afs_CFileWrite(tfile_dst, written, data, trans_size);
3374 if (code < trans_size) {
3379 written+=trans_size;
3382 afs_CFileClose(tfile_dst);
3383 afs_CFileClose(tfile_src);
3385 afs_osi_Free(data, 4096);
3387 ReleaseWriteLock(&new_dc->lock);
3388 afs_PutDCache(new_dc);
3391 ObtainWriteLock(&afs_xvcache, 763);
3392 ObtainWriteLock(&afs_disconDirtyLock, 765);
3393 QAdd(&afs_disconShadow, &avc->shadowq);
3394 osi_Assert((afs_RefVCache(avc) == 0));
3395 ReleaseWriteLock(&afs_disconDirtyLock);
3396 ReleaseWriteLock(&afs_xvcache);
3398 avc->f.shadow.vnode = shadow_fid.Fid.Vnode;
3399 avc->f.shadow.unique = shadow_fid.Fid.Unique;
3407 * Delete the dcaches of a shadow dir.
3409 * \param avc The vcache containing the shadow fid.
3411 * \note avc must be write locked.
3414 afs_DeleteShadowDir(struct vcache *avc)
3417 struct VenusFid shadow_fid;
3419 shadow_fid.Cell = avc->f.fid.Cell;
3420 shadow_fid.Fid.Volume = avc->f.fid.Fid.Volume;
3421 shadow_fid.Fid.Vnode = avc->f.shadow.vnode;
3422 shadow_fid.Fid.Unique = avc->f.shadow.unique;
3424 tdc = afs_FindDCacheByFid(&shadow_fid);
3426 afs_HashOutDCache(tdc, 1);
3427 afs_DiscardDCache(tdc);
3430 avc->f.shadow.vnode = avc->f.shadow.unique = 0;
3431 ObtainWriteLock(&afs_disconDirtyLock, 708);
3432 QRemove(&avc->shadowq);
3433 ReleaseWriteLock(&afs_disconDirtyLock);
3434 afs_PutVCache(avc); /* Because we held it when we added to the queue */
3438 * Populate a dcache with empty chunks up to a given file size,
3439 * used before extending a file in order to avoid 'holes' which
3440 * we can't access in disconnected mode.
3442 * \param avc The vcache which is being extended (locked)
3443 * \param alen The new length of the file
3447 afs_PopulateDCache(struct vcache *avc, afs_size_t apos, struct vrequest *areq)
3450 afs_size_t len, offset;
3451 afs_int32 start, end;
3453 /* We're doing this to deal with the situation where we extend
3454 * by writing after lseek()ing past the end of the file . If that
3455 * extension skips chunks, then those chunks won't be created, and
3456 * GetDCache will assume that they have to be fetched from the server.
3457 * So, for each chunk between the current file position, and the new
3458 * length we GetDCache for that chunk.
3461 if (AFS_CHUNK(apos) == 0 || apos <= avc->f.m.Length)
3464 if (avc->f.m.Length == 0)
3467 start = AFS_CHUNK(avc->f.m.Length)+1;
3469 end = AFS_CHUNK(apos);
3472 len = AFS_CHUNKTOSIZE(start);
3473 tdc = afs_GetDCache(avc, AFS_CHUNKTOBASE(start), areq, &offset, &len, 4);