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 .vwriteUIO = afs_UFSWriteUIO,
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 .vwriteUIO = afs_MemWriteUIO,
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;
425 if (space_needed < 0)
428 dc_hiwat - afs_freeDCCount - afs_discardDCCount;
429 if (slots_needed < 0)
431 if (slots_needed || space_needed)
432 afs_GetDownD(slots_needed, &space_needed, 0);
433 if ((space_needed <= 0) && (slots_needed <= 0)) {
434 afs_CacheTooFull = 0;
437 if (afs_termState == AFSOP_STOP_TRUNCDAEMON)
440 if (!afs_CacheIsTooFull())
441 afs_CacheTooFull = 0;
442 } /* end of cache cleanup */
443 ReleaseWriteLock(&afs_xdcache);
446 * This is a defensive check to try to avoid starving threads
447 * that may need the global lock so thay can help free some
448 * cache space. If this thread won't be sleeping or truncating
449 * any cache files then give up the global lock so other
450 * threads get a chance to run.
452 if ((afs_termState != AFSOP_STOP_TRUNCDAEMON) && afs_CacheTooFull
453 && (!afs_blocksDiscarded || afs_WaitForCacheDrain)) {
454 afs_osi_Wait(100, 0, 0); /* 100 milliseconds */
458 * This is where we free the discarded cache elements.
460 while (afs_blocksDiscarded && !afs_WaitForCacheDrain
461 && (afs_termState != AFSOP_STOP_TRUNCDAEMON)) {
462 afs_FreeDiscardedDCache();
465 /* See if we need to continue to run. Someone may have
466 * signalled us while we were executing.
468 if (!afs_WaitForCacheDrain && !afs_CacheTooFull
469 && (afs_termState != AFSOP_STOP_TRUNCDAEMON)) {
470 /* Collect statistics on truncate daemon. */
471 CTD_stats.CTD_nSleeps++;
472 osi_GetuTime(&CTD_stats.CTD_beforeSleep);
473 afs_stats_GetDiff(CTD_tmpTime, CTD_stats.CTD_afterSleep,
474 CTD_stats.CTD_beforeSleep);
475 afs_stats_AddTo(CTD_stats.CTD_runTime, CTD_tmpTime);
477 afs_TruncateDaemonRunning = 0;
478 afs_osi_Sleep((int *)afs_CacheTruncateDaemon);
479 afs_TruncateDaemonRunning = 1;
481 osi_GetuTime(&CTD_stats.CTD_afterSleep);
482 afs_stats_GetDiff(CTD_tmpTime, CTD_stats.CTD_beforeSleep,
483 CTD_stats.CTD_afterSleep);
484 afs_stats_AddTo(CTD_stats.CTD_sleepTime, CTD_tmpTime);
486 if (afs_termState == AFSOP_STOP_TRUNCDAEMON) {
487 afs_termState = AFSOP_STOP_AFSDB;
488 afs_osi_Wakeup(&afs_termState);
496 * Make adjustment for the new size in the disk cache entry
498 * \note Major Assumptions Here:
499 * Assumes that frag size is an integral power of two, less one,
500 * and that this is a two's complement machine. I don't
501 * know of any filesystems which violate this assumption...
503 * \param adc Ptr to dcache entry.
504 * \param anewsize New size desired.
509 afs_AdjustSize(struct dcache *adc, afs_int32 newSize)
513 AFS_STATCNT(afs_AdjustSize);
515 adc->dflags |= DFEntryMod;
516 oldSize = ((adc->f.chunkBytes + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
517 adc->f.chunkBytes = newSize;
520 newSize = ((newSize + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
521 afs_DCAdjustSize(adc, oldSize, newSize);
522 if ((newSize > oldSize) && !AFS_IS_DISCONNECTED) {
524 /* We're growing the file, wakeup the daemon */
525 afs_MaybeWakeupTruncateDaemon();
527 afs_blocksUsed += (newSize - oldSize);
528 afs_stats_cmperf.cacheBlocksInUse = afs_blocksUsed; /* XXX */
533 * This routine is responsible for moving at least one entry (but up
534 * to some number of them) from the LRU queue to the free queue.
536 * \param anumber Number of entries that should ideally be moved.
537 * \param aneedSpace How much space we need (1K blocks);
540 * The anumber parameter is just a hint; at least one entry MUST be
541 * moved, or we'll panic. We must be called with afs_xdcache
542 * write-locked. We should try to satisfy both anumber and aneedspace,
543 * whichever is more demanding - need to do several things:
544 * 1. only grab up to anumber victims if aneedSpace <= 0, not
545 * the whole set of MAXATONCE.
546 * 2. dynamically choose MAXATONCE to reflect severity of
547 * demand: something like (*aneedSpace >> (logChunk - 9))
549 * \note N.B. if we're called with aneedSpace <= 0 and anumber > 0, that
550 * indicates that the cache is not properly configured/tuned or
551 * something. We should be able to automatically correct that problem.
554 #define MAXATONCE 16 /* max we can obtain at once */
556 afs_GetDownD(int anumber, int *aneedSpace, afs_int32 buckethint)
560 struct VenusFid *afid;
565 afs_uint32 victims[MAXATONCE];
566 struct dcache *victimDCs[MAXATONCE];
567 afs_hyper_t victimTimes[MAXATONCE]; /* youngest (largest LRU time) first */
568 afs_uint32 victimPtr; /* next free item in victim arrays */
569 afs_hyper_t maxVictimTime; /* youngest (largest LRU time) victim */
570 afs_uint32 maxVictimPtr; /* where it is */
574 AFS_STATCNT(afs_GetDownD);
576 if (CheckLock(&afs_xdcache) != -1)
577 osi_Panic("getdownd nolock");
578 /* decrement anumber first for all dudes in free list */
579 /* SHOULD always decrement anumber first, even if aneedSpace >0,
580 * because we should try to free space even if anumber <=0 */
581 if (!aneedSpace || *aneedSpace <= 0) {
582 anumber -= afs_freeDCCount;
584 return; /* enough already free */
588 /* bounds check parameter */
589 if (anumber > MAXATONCE)
590 anumber = MAXATONCE; /* all we can do */
592 /* rewrite so phases include a better eligiblity for gc test*/
594 * The phase variable manages reclaims. Set to 0, the first pass,
595 * we don't reclaim active entries, or other than target bucket.
596 * Set to 1, we reclaim even active ones in target bucket.
597 * Set to 2, we reclaim any inactive one.
598 * Set to 3, we reclaim even active ones. On Solaris, we also reclaim
599 * entries whose corresponding vcache has a nonempty multiPage list, when
608 for (i = 0; i < afs_cacheFiles; i++)
609 /* turn off all flags */
610 afs_indexFlags[i] &= ~IFFlag;
612 while (anumber > 0 || (aneedSpace && *aneedSpace > 0)) {
613 /* find oldest entries for reclamation */
614 maxVictimPtr = victimPtr = 0;
615 hzero(maxVictimTime);
616 curbucket = afs_DCWhichBucket(phase, buckethint);
617 /* select victims from access time array */
618 for (i = 0; i < afs_cacheFiles; i++) {
619 if (afs_indexFlags[i] & (IFDataMod | IFFree | IFDiscarded)) {
620 /* skip if dirty or already free */
623 tdc = afs_indexTable[i];
624 if (tdc && (curbucket != tdc->bucket) && (phase < 4))
626 /* Wrong bucket; can't use it! */
629 if (tdc && (tdc->refCount != 0)) {
630 /* Referenced; can't use it! */
633 hset(vtime, afs_indexTimes[i]);
635 /* if we've already looked at this one, skip it */
636 if (afs_indexFlags[i] & IFFlag)
639 if (victimPtr < MAXATONCE) {
640 /* if there's at least one free victim slot left */
641 victims[victimPtr] = i;
642 hset(victimTimes[victimPtr], vtime);
643 if (hcmp(vtime, maxVictimTime) > 0) {
644 hset(maxVictimTime, vtime);
645 maxVictimPtr = victimPtr;
648 } else if (hcmp(vtime, maxVictimTime) < 0) {
650 * We're older than youngest victim, so we replace at
653 /* find youngest (largest LRU) victim */
656 osi_Panic("getdownd local");
658 hset(victimTimes[j], vtime);
659 /* recompute maxVictimTime */
660 hset(maxVictimTime, vtime);
661 for (j = 0; j < victimPtr; j++)
662 if (hcmp(maxVictimTime, victimTimes[j]) < 0) {
663 hset(maxVictimTime, victimTimes[j]);
669 /* now really reclaim the victims */
670 j = 0; /* flag to track if we actually got any of the victims */
671 /* first, hold all the victims, since we're going to release the lock
672 * during the truncate operation.
674 for (i = 0; i < victimPtr; i++) {
675 tdc = afs_GetValidDSlot(victims[i]);
676 /* We got tdc->tlock(R) here */
677 if (tdc && tdc->refCount == 1)
682 ReleaseReadLock(&tdc->tlock);
687 for (i = 0; i < victimPtr; i++) {
688 /* q is first elt in dcache entry */
690 /* now, since we're dropping the afs_xdcache lock below, we
691 * have to verify, before proceeding, that there are no other
692 * references to this dcache entry, even now. Note that we
693 * compare with 1, since we bumped it above when we called
694 * afs_GetValidDSlot to preserve the entry's identity.
696 if (tdc && tdc->refCount == 1) {
697 unsigned char chunkFlags;
698 afs_size_t tchunkoffset = 0;
700 /* xdcache is lower than the xvcache lock */
701 ReleaseWriteLock(&afs_xdcache);
702 ObtainReadLock(&afs_xvcache);
703 tvc = afs_FindVCache(afid, 0, 0 /* no stats, no vlru */ );
704 ReleaseReadLock(&afs_xvcache);
705 ObtainWriteLock(&afs_xdcache, 527);
707 if (tdc->refCount > 1)
710 tchunkoffset = AFS_CHUNKTOBASE(tdc->f.chunk);
711 chunkFlags = afs_indexFlags[tdc->index];
712 if (((phase & 1) == 0) && osi_Active(tvc))
714 if (((phase & 1) == 1) && osi_Active(tvc)
715 && (tvc->f.states & CDCLock)
716 && (chunkFlags & IFAnyPages))
718 if (chunkFlags & IFDataMod)
720 afs_Trace4(afs_iclSetp, CM_TRACE_GETDOWND,
721 ICL_TYPE_POINTER, tvc, ICL_TYPE_INT32, skip,
722 ICL_TYPE_INT32, tdc->index, ICL_TYPE_OFFSET,
723 ICL_HANDLE_OFFSET(tchunkoffset));
725 #if defined(AFS_SUN5_ENV)
727 * Now we try to invalidate pages. We do this only for
728 * Solaris. For other platforms, it's OK to recycle a
729 * dcache entry out from under a page, because the strategy
730 * function can call afs_GetDCache().
732 if (!skip && (chunkFlags & IFAnyPages)) {
735 ReleaseWriteLock(&afs_xdcache);
736 ObtainWriteLock(&tvc->vlock, 543);
737 if (!QEmpty(&tvc->multiPage)) {
738 if (phase < 3 || osi_VM_MultiPageConflict(tvc, tdc)) {
743 /* block locking pages */
744 tvc->vstates |= VPageCleaning;
745 /* block getting new pages */
747 ReleaseWriteLock(&tvc->vlock);
748 /* One last recheck */
749 ObtainWriteLock(&afs_xdcache, 333);
750 chunkFlags = afs_indexFlags[tdc->index];
751 if (tdc->refCount > 1 || (chunkFlags & IFDataMod)
752 || (osi_Active(tvc) && (tvc->f.states & CDCLock)
753 && (chunkFlags & IFAnyPages))) {
755 ReleaseWriteLock(&afs_xdcache);
758 ReleaseWriteLock(&afs_xdcache);
760 code = osi_VM_GetDownD(tvc, tdc);
762 ObtainWriteLock(&afs_xdcache, 269);
763 /* we actually removed all pages, clean and dirty */
765 afs_indexFlags[tdc->index] &=
766 ~(IFDirtyPages | IFAnyPages);
769 ReleaseWriteLock(&afs_xdcache);
771 ObtainWriteLock(&tvc->vlock, 544);
772 if (--tvc->activeV == 0
773 && (tvc->vstates & VRevokeWait)) {
774 tvc->vstates &= ~VRevokeWait;
775 afs_osi_Wakeup((char *)&tvc->vstates);
778 if (tvc->vstates & VPageCleaning) {
779 tvc->vstates &= ~VPageCleaning;
780 afs_osi_Wakeup((char *)&tvc->vstates);
783 ReleaseWriteLock(&tvc->vlock);
785 #endif /* AFS_SUN5_ENV */
787 ReleaseWriteLock(&afs_xdcache);
790 afs_PutVCache(tvc); /*XXX was AFS_FAST_RELE?*/
791 ObtainWriteLock(&afs_xdcache, 528);
792 if (afs_indexFlags[tdc->index] &
793 (IFDataMod | IFDirtyPages | IFAnyPages))
795 if (tdc->refCount > 1)
798 #if defined(AFS_SUN5_ENV)
800 /* no vnode, so IFDirtyPages is spurious (we don't
801 * sweep dcaches on vnode recycling, so we can have
802 * DIRTYPAGES set even when all pages are gone). Just
804 * Hold vcache lock to prevent vnode from being
805 * created while we're clearing IFDirtyPages.
807 afs_indexFlags[tdc->index] &=
808 ~(IFDirtyPages | IFAnyPages);
812 /* skip this guy and mark him as recently used */
813 afs_indexFlags[tdc->index] |= IFFlag;
814 afs_Trace4(afs_iclSetp, CM_TRACE_GETDOWND,
815 ICL_TYPE_POINTER, tvc, ICL_TYPE_INT32, 2,
816 ICL_TYPE_INT32, tdc->index, ICL_TYPE_OFFSET,
817 ICL_HANDLE_OFFSET(tchunkoffset));
819 /* flush this dude from the data cache and reclaim;
820 * first, make sure no one will care that we damage
821 * it, by removing it from all hash tables. Then,
822 * melt it down for parts. Note that any concurrent
823 * (new possibility!) calls to GetDownD won't touch
824 * this guy because his reference count is > 0. */
825 afs_Trace4(afs_iclSetp, CM_TRACE_GETDOWND,
826 ICL_TYPE_POINTER, tvc, ICL_TYPE_INT32, 3,
827 ICL_TYPE_INT32, tdc->index, ICL_TYPE_OFFSET,
828 ICL_HANDLE_OFFSET(tchunkoffset));
829 AFS_STATCNT(afs_gget);
830 afs_HashOutDCache(tdc, 1);
831 if (tdc->f.chunkBytes != 0) {
835 (tdc->f.chunkBytes + afs_fsfragsize) >> 10;
840 afs_DiscardDCache(tdc);
845 j = 1; /* we reclaimed at least one victim */
850 } /* end of for victims loop */
853 /* Phase is 0 and no one was found, so try phase 1 (ignore
854 * osi_Active flag) */
857 for (i = 0; i < afs_cacheFiles; i++)
858 /* turn off all flags */
859 afs_indexFlags[i] &= ~IFFlag;
862 /* found no one in phases 0-5, we're hosed */
866 } /* big while loop */
874 * Remove adc from any hash tables that would allow it to be located
875 * again by afs_FindDCache or afs_GetDCache.
877 * \param adc Pointer to dcache entry to remove from hash tables.
879 * \note Locks: Must have the afs_xdcache lock write-locked to call this function.
883 afs_HashOutDCache(struct dcache *adc, int zap)
887 AFS_STATCNT(afs_glink);
889 /* we know this guy's in the LRUQ. We'll move dude into DCQ below */
891 /* if this guy is in the hash table, pull him out */
892 if (adc->f.fid.Fid.Volume != 0) {
893 /* remove entry from first hash chains */
894 i = DCHash(&adc->f.fid, adc->f.chunk);
895 us = afs_dchashTbl[i];
896 if (us == adc->index) {
897 /* first dude in the list */
898 afs_dchashTbl[i] = afs_dcnextTbl[adc->index];
900 /* somewhere on the chain */
901 while (us != NULLIDX) {
902 if (afs_dcnextTbl[us] == adc->index) {
903 /* found item pointing at the one to delete */
904 afs_dcnextTbl[us] = afs_dcnextTbl[adc->index];
907 us = afs_dcnextTbl[us];
910 osi_Panic("dcache hc");
912 /* remove entry from *other* hash chain */
913 i = DVHash(&adc->f.fid);
914 us = afs_dvhashTbl[i];
915 if (us == adc->index) {
916 /* first dude in the list */
917 afs_dvhashTbl[i] = afs_dvnextTbl[adc->index];
919 /* somewhere on the chain */
920 while (us != NULLIDX) {
921 if (afs_dvnextTbl[us] == adc->index) {
922 /* found item pointing at the one to delete */
923 afs_dvnextTbl[us] = afs_dvnextTbl[adc->index];
926 us = afs_dvnextTbl[us];
929 osi_Panic("dcache hv");
934 /* prevent entry from being found on a reboot (it is already out of
935 * the hash table, but after a crash, we just look at fid fields of
936 * stable (old) entries).
938 adc->f.fid.Fid.Volume = 0; /* invalid */
940 /* mark entry as modified */
941 adc->dflags |= DFEntryMod;
946 } /*afs_HashOutDCache */
949 * Flush the given dcache entry, pulling it from hash chains
950 * and truncating the associated cache file.
952 * \param adc Ptr to dcache entry to flush.
955 * This routine must be called with the afs_xdcache lock held
959 afs_FlushDCache(struct dcache *adc)
961 AFS_STATCNT(afs_FlushDCache);
963 * Bump the number of cache files flushed.
965 afs_stats_cmperf.cacheFlushes++;
967 /* remove from all hash tables */
968 afs_HashOutDCache(adc, 1);
970 /* Free its space; special case null operation, since truncate operation
971 * in UFS is slow even in this case, and this allows us to pre-truncate
972 * these files at more convenient times with fewer locks set
973 * (see afs_GetDownD).
975 if (adc->f.chunkBytes != 0) {
976 afs_DiscardDCache(adc);
977 afs_MaybeWakeupTruncateDaemon();
982 if (afs_WaitForCacheDrain) {
983 if (afs_blocksUsed <=
984 PERCENT(CM_CACHESIZEDRAINEDPCT, afs_cacheBlocks)) {
985 afs_WaitForCacheDrain = 0;
986 afs_osi_Wakeup(&afs_WaitForCacheDrain);
989 } /*afs_FlushDCache */
993 * Put a dcache entry on the free dcache entry list.
995 * \param adc dcache entry to free.
997 * \note Environment: called with afs_xdcache lock write-locked.
1000 afs_FreeDCache(struct dcache *adc)
1002 /* Thread on free list, update free list count and mark entry as
1003 * freed in its indexFlags element. Also, ensure DCache entry gets
1004 * written out (set DFEntryMod).
1007 afs_dvnextTbl[adc->index] = afs_freeDCList;
1008 afs_freeDCList = adc->index;
1010 afs_indexFlags[adc->index] |= IFFree;
1011 adc->dflags |= DFEntryMod;
1013 if (afs_WaitForCacheDrain) {
1014 if ((afs_blocksUsed - afs_blocksDiscarded) <=
1015 PERCENT(CM_CACHESIZEDRAINEDPCT, afs_cacheBlocks)) {
1016 afs_WaitForCacheDrain = 0;
1017 afs_osi_Wakeup(&afs_WaitForCacheDrain);
1020 } /* afs_FreeDCache */
1023 * Discard the cache element by moving it to the discardDCList.
1024 * This puts the cache element into a quasi-freed state, where
1025 * the space may be reused, but the file has not been truncated.
1027 * \note Major Assumptions Here:
1028 * Assumes that frag size is an integral power of two, less one,
1029 * and that this is a two's complement machine. I don't
1030 * know of any filesystems which violate this assumption...
1032 * \param adr Ptr to dcache entry.
1034 * \note Environment:
1035 * Must be called with afs_xdcache write-locked.
1039 afs_DiscardDCache(struct dcache *adc)
1043 AFS_STATCNT(afs_DiscardDCache);
1045 osi_Assert(adc->refCount == 1);
1047 size = ((adc->f.chunkBytes + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
1048 afs_blocksDiscarded += size;
1049 afs_stats_cmperf.cacheBlocksDiscarded = afs_blocksDiscarded;
1051 afs_dvnextTbl[adc->index] = afs_discardDCList;
1052 afs_discardDCList = adc->index;
1053 afs_discardDCCount++;
1055 adc->f.fid.Fid.Volume = 0;
1056 adc->dflags |= DFEntryMod;
1057 afs_indexFlags[adc->index] |= IFDiscarded;
1059 if (afs_WaitForCacheDrain) {
1060 if ((afs_blocksUsed - afs_blocksDiscarded) <=
1061 PERCENT(CM_CACHESIZEDRAINEDPCT, afs_cacheBlocks)) {
1062 afs_WaitForCacheDrain = 0;
1063 afs_osi_Wakeup(&afs_WaitForCacheDrain);
1067 } /*afs_DiscardDCache */
1070 * Free the next element on the list of discarded cache elements.
1073 afs_FreeDiscardedDCache(void)
1076 struct osi_file *tfile;
1079 AFS_STATCNT(afs_FreeDiscardedDCache);
1081 ObtainWriteLock(&afs_xdcache, 510);
1082 if (!afs_blocksDiscarded) {
1083 ReleaseWriteLock(&afs_xdcache);
1088 * Get an entry from the list of discarded cache elements
1090 tdc = afs_GetNewDSlot(afs_discardDCList);
1091 osi_Assert(tdc->refCount == 1);
1092 ReleaseReadLock(&tdc->tlock);
1094 afs_discardDCList = afs_dvnextTbl[tdc->index];
1095 afs_dvnextTbl[tdc->index] = NULLIDX;
1096 afs_discardDCCount--;
1097 size = ((tdc->f.chunkBytes + afs_fsfragsize) ^ afs_fsfragsize) >> 10; /* round up */
1098 afs_blocksDiscarded -= size;
1099 afs_stats_cmperf.cacheBlocksDiscarded = afs_blocksDiscarded;
1100 /* We can lock because we just took it off the free list */
1101 ObtainWriteLock(&tdc->lock, 626);
1102 ReleaseWriteLock(&afs_xdcache);
1105 * Truncate the element to reclaim its space
1107 tfile = afs_CFileOpen(&tdc->f.inode);
1108 afs_CFileTruncate(tfile, 0);
1109 afs_CFileClose(tfile);
1110 afs_AdjustSize(tdc, 0);
1111 afs_DCMoveBucket(tdc, 0, 0);
1114 * Free the element we just truncated
1116 ObtainWriteLock(&afs_xdcache, 511);
1117 afs_indexFlags[tdc->index] &= ~IFDiscarded;
1118 afs_FreeDCache(tdc);
1119 tdc->f.states &= ~(DRO|DBackup|DRW);
1120 ReleaseWriteLock(&tdc->lock);
1122 ReleaseWriteLock(&afs_xdcache);
1126 * Free as many entries from the list of discarded cache elements
1127 * as we need to get the free space down below CM_WAITFORDRAINPCT (98%).
1132 afs_MaybeFreeDiscardedDCache(void)
1135 AFS_STATCNT(afs_MaybeFreeDiscardedDCache);
1137 while (afs_blocksDiscarded
1138 && (afs_blocksUsed >
1139 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks))) {
1140 afs_FreeDiscardedDCache();
1146 * Try to free up a certain number of disk slots.
1148 * \param anumber Targeted number of disk slots to free up.
1150 * \note Environment:
1151 * Must be called with afs_xdcache write-locked.
1155 afs_GetDownDSlot(int anumber)
1157 struct afs_q *tq, *nq;
1162 AFS_STATCNT(afs_GetDownDSlot);
1163 if (cacheDiskType == AFS_FCACHE_TYPE_MEM)
1164 osi_Panic("diskless getdowndslot");
1166 if (CheckLock(&afs_xdcache) != -1)
1167 osi_Panic("getdowndslot nolock");
1169 /* decrement anumber first for all dudes in free list */
1170 for (tdc = afs_freeDSList; tdc; tdc = (struct dcache *)tdc->lruq.next)
1173 return; /* enough already free */
1175 for (cnt = 0, tq = afs_DLRU.prev; tq != &afs_DLRU && anumber > 0;
1177 tdc = (struct dcache *)tq; /* q is first elt in dcache entry */
1178 nq = QPrev(tq); /* in case we remove it */
1179 if (tdc->refCount == 0) {
1180 if ((ix = tdc->index) == NULLIDX)
1181 osi_Panic("getdowndslot");
1182 /* pull the entry out of the lruq and put it on the free list */
1183 QRemove(&tdc->lruq);
1185 /* write-through if modified */
1186 if (tdc->dflags & DFEntryMod) {
1187 #if defined(AFS_SGI_ENV) && defined(AFS_SGI_SHORTSTACK)
1189 * ask proxy to do this for us - we don't have the stack space
1191 while (tdc->dflags & DFEntryMod) {
1194 s = SPLOCK(afs_sgibklock);
1195 if (afs_sgibklist == NULL) {
1196 /* if slot is free, grab it. */
1197 afs_sgibklist = tdc;
1198 SV_SIGNAL(&afs_sgibksync);
1200 /* wait for daemon to (start, then) finish. */
1201 SP_WAIT(afs_sgibklock, s, &afs_sgibkwait, PINOD);
1205 tdc->dflags &= ~DFEntryMod;
1206 osi_Assert(afs_WriteDCache(tdc, 1) == 0);
1210 /* finally put the entry in the free list */
1211 afs_indexTable[ix] = NULL;
1212 afs_indexFlags[ix] &= ~IFEverUsed;
1213 tdc->index = NULLIDX;
1214 tdc->lruq.next = (struct afs_q *)afs_freeDSList;
1215 afs_freeDSList = tdc;
1219 } /*afs_GetDownDSlot */
1226 * Increment the reference count on a disk cache entry,
1227 * which already has a non-zero refcount. In order to
1228 * increment the refcount of a zero-reference entry, you
1229 * have to hold afs_xdcache.
1232 * adc : Pointer to the dcache entry to increment.
1235 * Nothing interesting.
1238 afs_RefDCache(struct dcache *adc)
1240 ObtainWriteLock(&adc->tlock, 627);
1241 if (adc->refCount < 0)
1242 osi_Panic("RefDCache: negative refcount");
1244 ReleaseWriteLock(&adc->tlock);
1253 * Decrement the reference count on a disk cache entry.
1256 * ad : Ptr to the dcache entry to decrement.
1259 * Nothing interesting.
1262 afs_PutDCache(struct dcache *adc)
1264 AFS_STATCNT(afs_PutDCache);
1265 ObtainWriteLock(&adc->tlock, 276);
1266 if (adc->refCount <= 0)
1267 osi_Panic("putdcache");
1269 ReleaseWriteLock(&adc->tlock);
1278 * Try to discard all data associated with this file from the
1282 * avc : Pointer to the cache info for the file.
1285 * Both pvnLock and lock are write held.
1288 afs_TryToSmush(struct vcache *avc, afs_ucred_t *acred, int sync)
1293 AFS_STATCNT(afs_TryToSmush);
1294 afs_Trace2(afs_iclSetp, CM_TRACE_TRYTOSMUSH, ICL_TYPE_POINTER, avc,
1295 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(avc->f.m.Length));
1296 sync = 1; /* XX Temp testing XX */
1298 #if defined(AFS_SUN5_ENV)
1299 ObtainWriteLock(&avc->vlock, 573);
1300 avc->activeV++; /* block new getpages */
1301 ReleaseWriteLock(&avc->vlock);
1304 /* Flush VM pages */
1305 osi_VM_TryToSmush(avc, acred, sync);
1308 * Get the hash chain containing all dce's for this fid
1310 i = DVHash(&avc->f.fid);
1311 ObtainWriteLock(&afs_xdcache, 277);
1312 for (index = afs_dvhashTbl[i]; index != NULLIDX; index = i) {
1313 i = afs_dvnextTbl[index]; /* next pointer this hash table */
1314 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1315 int releaseTlock = 1;
1316 tdc = afs_GetValidDSlot(index);
1317 if (!tdc) osi_Panic("afs_TryToSmush tdc");
1318 if (!FidCmp(&tdc->f.fid, &avc->f.fid)) {
1320 if ((afs_indexFlags[index] & IFDataMod) == 0
1321 && tdc->refCount == 1) {
1322 ReleaseReadLock(&tdc->tlock);
1324 afs_FlushDCache(tdc);
1327 afs_indexTable[index] = 0;
1330 ReleaseReadLock(&tdc->tlock);
1334 #if defined(AFS_SUN5_ENV)
1335 ObtainWriteLock(&avc->vlock, 545);
1336 if (--avc->activeV == 0 && (avc->vstates & VRevokeWait)) {
1337 avc->vstates &= ~VRevokeWait;
1338 afs_osi_Wakeup((char *)&avc->vstates);
1340 ReleaseWriteLock(&avc->vlock);
1342 ReleaseWriteLock(&afs_xdcache);
1344 * It's treated like a callback so that when we do lookups we'll
1345 * invalidate the unique bit if any
1346 * trytoSmush occured during the lookup call
1352 * afs_DCacheMissingChunks
1355 * Given the cached info for a file, return the number of chunks that
1356 * are not available from the dcache.
1359 * avc: Pointer to the (held) vcache entry to look in.
1362 * The number of chunks which are not currently cached.
1365 * The vcache entry is held upon entry.
1369 afs_DCacheMissingChunks(struct vcache *avc)
1372 afs_size_t totalLength = 0;
1373 afs_uint32 totalChunks = 0;
1376 totalLength = avc->f.m.Length;
1377 if (avc->f.truncPos < totalLength)
1378 totalLength = avc->f.truncPos;
1380 /* Length is 0, no chunk missing. */
1381 if (totalLength == 0)
1384 /* If totalLength is a multiple of chunksize, the last byte appears
1385 * as being part of the next chunk, which does not exist.
1386 * Decrementing totalLength by one fixes that.
1389 totalChunks = (AFS_CHUNK(totalLength) + 1);
1391 /* If we're a directory, we only ever have one chunk, regardless of
1392 * the size of the dir.
1394 if (avc->f.fid.Fid.Vnode & 1 || vType(avc) == VDIR)
1398 printf("Should have %d chunks for %u bytes\n",
1399 totalChunks, (totalLength + 1));
1401 i = DVHash(&avc->f.fid);
1402 ObtainWriteLock(&afs_xdcache, 1001);
1403 for (index = afs_dvhashTbl[i]; index != NULLIDX; index = i) {
1404 i = afs_dvnextTbl[index];
1405 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1406 tdc = afs_GetValidDSlot(index);
1408 if (!FidCmp(&tdc->f.fid, &avc->f.fid)) {
1411 ReleaseReadLock(&tdc->tlock);
1416 ReleaseWriteLock(&afs_xdcache);
1418 /*printf("Missing %d chunks\n", totalChunks);*/
1420 return (totalChunks);
1427 * Given the cached info for a file and a byte offset into the
1428 * file, make sure the dcache entry for that file and containing
1429 * the given byte is available, returning it to our caller.
1432 * avc : Pointer to the (held) vcache entry to look in.
1433 * abyte : Which byte we want to get to.
1436 * Pointer to the dcache entry covering the file & desired byte,
1437 * or NULL if not found.
1440 * The vcache entry is held upon entry.
1444 afs_FindDCache(struct vcache *avc, afs_size_t abyte)
1448 struct dcache *tdc = NULL;
1450 AFS_STATCNT(afs_FindDCache);
1451 chunk = AFS_CHUNK(abyte);
1454 * Hash on the [fid, chunk] and get the corresponding dcache index
1455 * after write-locking the dcache.
1457 i = DCHash(&avc->f.fid, chunk);
1458 ObtainWriteLock(&afs_xdcache, 278);
1459 for (index = afs_dchashTbl[i]; index != NULLIDX;) {
1460 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1461 tdc = afs_GetValidDSlot(index);
1462 if (!tdc) osi_Panic("afs_FindDCache tdc");
1463 ReleaseReadLock(&tdc->tlock);
1464 if (!FidCmp(&tdc->f.fid, &avc->f.fid) && chunk == tdc->f.chunk) {
1465 break; /* leaving refCount high for caller */
1469 index = afs_dcnextTbl[index];
1471 if (index != NULLIDX) {
1472 hset(afs_indexTimes[tdc->index], afs_indexCounter);
1473 hadd32(afs_indexCounter, 1);
1474 ReleaseWriteLock(&afs_xdcache);
1477 ReleaseWriteLock(&afs_xdcache);
1479 } /*afs_FindDCache */
1483 * Get a fresh dcache from the free or discarded list.
1485 * \param avc Who's dcache is this going to be?
1486 * \param chunk The position where it will be placed in.
1487 * \param lock How are locks held.
1488 * \param ashFid If this dcache going to be used for a shadow dir,
1491 * \note Required locks:
1493 * - avc (R if (lock & 1) set and W otherwise)
1494 * \note It write locks the new dcache. The caller must unlock it.
1496 * \return The new dcache.
1499 afs_AllocDCache(struct vcache *avc, afs_int32 chunk, afs_int32 lock,
1500 struct VenusFid *ashFid)
1502 struct dcache *tdc = NULL;
1503 afs_uint32 size = 0;
1504 struct osi_file *file;
1506 if (afs_discardDCList == NULLIDX
1507 || ((lock & 2) && afs_freeDCList != NULLIDX)) {
1509 afs_indexFlags[afs_freeDCList] &= ~IFFree;
1510 tdc = afs_GetNewDSlot(afs_freeDCList);
1511 osi_Assert(tdc->refCount == 1);
1512 ReleaseReadLock(&tdc->tlock);
1513 ObtainWriteLock(&tdc->lock, 604);
1514 afs_freeDCList = afs_dvnextTbl[tdc->index];
1517 afs_indexFlags[afs_discardDCList] &= ~IFDiscarded;
1518 tdc = afs_GetNewDSlot(afs_discardDCList);
1519 osi_Assert(tdc->refCount == 1);
1520 ReleaseReadLock(&tdc->tlock);
1521 ObtainWriteLock(&tdc->lock, 605);
1522 afs_discardDCList = afs_dvnextTbl[tdc->index];
1523 afs_discardDCCount--;
1525 ((tdc->f.chunkBytes +
1526 afs_fsfragsize) ^ afs_fsfragsize) >> 10;
1527 tdc->f.states &= ~(DRO|DBackup|DRW);
1528 afs_DCMoveBucket(tdc, size, 0);
1529 afs_blocksDiscarded -= size;
1530 afs_stats_cmperf.cacheBlocksDiscarded = afs_blocksDiscarded;
1532 /* Truncate the chunk so zeroes get filled properly */
1533 file = afs_CFileOpen(&tdc->f.inode);
1534 afs_CFileTruncate(file, 0);
1535 afs_CFileClose(file);
1536 afs_AdjustSize(tdc, 0);
1542 * avc->lock(R) if setLocks
1543 * avc->lock(W) if !setLocks
1549 * Fill in the newly-allocated dcache record.
1551 afs_indexFlags[tdc->index] &= ~(IFDirtyPages | IFAnyPages);
1553 /* Use shadow fid if provided. */
1554 tdc->f.fid = *ashFid;
1556 /* Use normal vcache's fid otherwise. */
1557 tdc->f.fid = avc->f.fid;
1558 if (avc->f.states & CRO)
1559 tdc->f.states = DRO;
1560 else if (avc->f.states & CBackup)
1561 tdc->f.states = DBackup;
1563 tdc->f.states = DRW;
1564 afs_DCMoveBucket(tdc, 0, afs_DCGetBucket(avc));
1565 afs_indexUnique[tdc->index] = tdc->f.fid.Fid.Unique;
1567 hones(tdc->f.versionNo); /* invalid value */
1568 tdc->f.chunk = chunk;
1569 tdc->validPos = AFS_CHUNKTOBASE(chunk);
1571 if (tdc->lruq.prev == &tdc->lruq)
1572 osi_Panic("lruq 1");
1581 * This function is called to obtain a reference to data stored in
1582 * the disk cache, locating a chunk of data containing the desired
1583 * byte and returning a reference to the disk cache entry, with its
1584 * reference count incremented.
1588 * avc : Ptr to a vcache entry (unlocked)
1589 * abyte : Byte position in the file desired
1590 * areq : Request structure identifying the requesting user.
1591 * aflags : Settings as follows:
1593 * 2 : Return after creating entry.
1594 * 4 : called from afs_vnop_write.c
1595 * *alen contains length of data to be written.
1597 * aoffset : Set to the offset within the chunk where the resident
1599 * alen : Set to the number of bytes of data after the desired
1600 * byte (including the byte itself) which can be read
1604 * The vcache entry pointed to by avc is unlocked upon entry.
1608 * Update the vnode-to-dcache hint if we can get the vnode lock
1609 * right away. Assumes dcache entry is at least read-locked.
1612 updateV2DC(int lockVc, struct vcache *v, struct dcache *d, int src)
1614 if (!lockVc || 0 == NBObtainWriteLock(&v->lock, src)) {
1615 if (hsame(v->f.m.DataVersion, d->f.versionNo) && v->callback)
1618 ReleaseWriteLock(&v->lock);
1622 /* avc - Write-locked unless aflags & 1 */
1624 afs_GetDCache(struct vcache *avc, afs_size_t abyte,
1625 struct vrequest *areq, afs_size_t * aoffset,
1626 afs_size_t * alen, int aflags)
1628 afs_int32 i, code, shortcut;
1629 #if defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV)
1630 afs_int32 adjustsize = 0;
1636 afs_size_t Position = 0;
1637 afs_int32 size, tlen; /* size of segment to transfer */
1638 struct afs_FetchOutput *tsmall = 0;
1640 struct osi_file *file;
1641 struct afs_conn *tc;
1643 struct server *newCallback = NULL;
1644 char setNewCallback;
1645 char setVcacheStatus;
1646 char doVcacheUpdate;
1648 int doAdjustSize = 0;
1649 int doReallyAdjustSize = 0;
1650 int overWriteWholeChunk = 0;
1651 struct rx_connection *rxconn;
1654 struct afs_stats_AccessInfo *accP; /*Ptr to access record in stats */
1655 int fromReplica; /*Are we reading from a replica? */
1656 int numFetchLoops; /*# times around the fetch/analyze loop */
1657 #endif /* AFS_NOSTATS */
1659 AFS_STATCNT(afs_GetDCache);
1663 setLocks = aflags & 1;
1666 * Determine the chunk number and offset within the chunk corresponding
1667 * to the desired byte.
1669 if (avc->f.fid.Fid.Vnode & 1) { /* if (vType(avc) == VDIR) */
1672 chunk = AFS_CHUNK(abyte);
1675 /* come back to here if we waited for the cache to drain. */
1678 setNewCallback = setVcacheStatus = 0;
1682 ObtainWriteLock(&avc->lock, 616);
1684 ObtainReadLock(&avc->lock);
1689 * avc->lock(R) if setLocks && !slowPass
1690 * avc->lock(W) if !setLocks || slowPass
1695 /* check hints first! (might could use bcmp or some such...) */
1696 if ((tdc = avc->dchint)) {
1700 * The locking order between afs_xdcache and dcache lock matters.
1701 * The hint dcache entry could be anywhere, even on the free list.
1702 * Locking afs_xdcache ensures that noone is trying to pull dcache
1703 * entries from the free list, and thereby assuming them to be not
1704 * referenced and not locked.
1706 ObtainReadLock(&afs_xdcache);
1707 dcLocked = (0 == NBObtainSharedLock(&tdc->lock, 601));
1709 if (dcLocked && (tdc->index != NULLIDX)
1710 && !FidCmp(&tdc->f.fid, &avc->f.fid) && chunk == tdc->f.chunk
1711 && !(afs_indexFlags[tdc->index] & (IFFree | IFDiscarded))) {
1712 /* got the right one. It might not be the right version, and it
1713 * might be fetching, but it's the right dcache entry.
1715 /* All this code should be integrated better with what follows:
1716 * I can save a good bit more time under a write lock if I do..
1718 ObtainWriteLock(&tdc->tlock, 603);
1720 ReleaseWriteLock(&tdc->tlock);
1722 ReleaseReadLock(&afs_xdcache);
1725 if (hsame(tdc->f.versionNo, avc->f.m.DataVersion)
1726 && !(tdc->dflags & DFFetching)) {
1728 afs_stats_cmperf.dcacheHits++;
1729 ObtainWriteLock(&afs_xdcache, 559);
1730 QRemove(&tdc->lruq);
1731 QAdd(&afs_DLRU, &tdc->lruq);
1732 ReleaseWriteLock(&afs_xdcache);
1735 * avc->lock(R) if setLocks && !slowPass
1736 * avc->lock(W) if !setLocks || slowPass
1743 ReleaseSharedLock(&tdc->lock);
1744 ReleaseReadLock(&afs_xdcache);
1752 * avc->lock(R) if setLocks && !slowPass
1753 * avc->lock(W) if !setLocks || slowPass
1754 * tdc->lock(S) if tdc
1757 if (!tdc) { /* If the hint wasn't the right dcache entry */
1759 * Hash on the [fid, chunk] and get the corresponding dcache index
1760 * after write-locking the dcache.
1765 * avc->lock(R) if setLocks && !slowPass
1766 * avc->lock(W) if !setLocks || slowPass
1769 i = DCHash(&avc->f.fid, chunk);
1770 /* check to make sure our space is fine */
1771 afs_MaybeWakeupTruncateDaemon();
1773 ObtainWriteLock(&afs_xdcache, 280);
1775 for (index = afs_dchashTbl[i]; index != NULLIDX;) {
1776 if (afs_indexUnique[index] == avc->f.fid.Fid.Unique) {
1777 tdc = afs_GetValidDSlot(index);
1779 ReleaseWriteLock(&afs_xdcache);
1782 ReleaseReadLock(&tdc->tlock);
1785 * avc->lock(R) if setLocks && !slowPass
1786 * avc->lock(W) if !setLocks || slowPass
1789 if (!FidCmp(&tdc->f.fid, &avc->f.fid) && chunk == tdc->f.chunk) {
1790 /* Move it up in the beginning of the list */
1791 if (afs_dchashTbl[i] != index) {
1792 afs_dcnextTbl[us] = afs_dcnextTbl[index];
1793 afs_dcnextTbl[index] = afs_dchashTbl[i];
1794 afs_dchashTbl[i] = index;
1796 ReleaseWriteLock(&afs_xdcache);
1797 ObtainSharedLock(&tdc->lock, 606);
1798 break; /* leaving refCount high for caller */
1804 index = afs_dcnextTbl[index];
1808 * If we didn't find the entry, we'll create one.
1810 if (index == NULLIDX) {
1813 * avc->lock(R) if setLocks
1814 * avc->lock(W) if !setLocks
1817 afs_Trace2(afs_iclSetp, CM_TRACE_GETDCACHE1, ICL_TYPE_POINTER,
1818 avc, ICL_TYPE_INT32, chunk);
1820 /* Make sure there is a free dcache entry for us to use */
1821 if (afs_discardDCList == NULLIDX && afs_freeDCList == NULLIDX) {
1824 avc->f.states |= CDCLock;
1825 /* just need slots */
1826 afs_GetDownD(5, (int *)0, afs_DCGetBucket(avc));
1828 avc->f.states &= ~CDCLock;
1829 if (afs_discardDCList != NULLIDX
1830 || afs_freeDCList != NULLIDX)
1832 /* If we can't get space for 5 mins we give up and panic */
1833 if (++downDCount > 300) {
1834 osi_Panic("getdcache");
1836 ReleaseWriteLock(&afs_xdcache);
1839 * avc->lock(R) if setLocks
1840 * avc->lock(W) if !setLocks
1842 afs_osi_Wait(1000, 0, 0);
1847 tdc = afs_AllocDCache(avc, chunk, aflags, NULL);
1850 * Now add to the two hash chains - note that i is still set
1851 * from the above DCHash call.
1853 afs_dcnextTbl[tdc->index] = afs_dchashTbl[i];
1854 afs_dchashTbl[i] = tdc->index;
1855 i = DVHash(&avc->f.fid);
1856 afs_dvnextTbl[tdc->index] = afs_dvhashTbl[i];
1857 afs_dvhashTbl[i] = tdc->index;
1858 tdc->dflags = DFEntryMod;
1860 afs_MaybeWakeupTruncateDaemon();
1861 ReleaseWriteLock(&afs_xdcache);
1862 ConvertWToSLock(&tdc->lock);
1867 /* vcache->dcache hint failed */
1870 * avc->lock(R) if setLocks && !slowPass
1871 * avc->lock(W) if !setLocks || slowPass
1874 afs_Trace4(afs_iclSetp, CM_TRACE_GETDCACHE2, ICL_TYPE_POINTER, avc,
1875 ICL_TYPE_POINTER, tdc, ICL_TYPE_INT32,
1876 hgetlo(tdc->f.versionNo), ICL_TYPE_INT32,
1877 hgetlo(avc->f.m.DataVersion));
1879 * Here we have the entry in tdc, with its refCount incremented.
1880 * Note: we don't use the S-lock on avc; it costs concurrency when
1881 * storing a file back to the server.
1885 * Not a newly created file so we need to check the file's length and
1886 * compare data versions since someone could have changed the data or we're
1887 * reading a file written elsewhere. We only want to bypass doing no-op
1888 * read rpcs on newly created files (dv of 0) since only then we guarantee
1889 * that this chunk's data hasn't been filled by another client.
1891 size = AFS_CHUNKSIZE(abyte);
1892 if (aflags & 4) /* called from write */
1894 else /* called from read */
1895 tlen = tdc->validPos - abyte;
1896 Position = AFS_CHUNKTOBASE(chunk);
1897 afs_Trace4(afs_iclSetp, CM_TRACE_GETDCACHE3, ICL_TYPE_INT32, tlen,
1898 ICL_TYPE_INT32, aflags, ICL_TYPE_OFFSET,
1899 ICL_HANDLE_OFFSET(abyte), ICL_TYPE_OFFSET,
1900 ICL_HANDLE_OFFSET(Position));
1901 if ((aflags & 4) && (hiszero(avc->f.m.DataVersion)))
1903 if ((AFS_CHUNKTOBASE(chunk) >= avc->f.m.Length) ||
1904 ((aflags & 4) && (abyte == Position) && (tlen >= size)))
1905 overWriteWholeChunk = 1;
1906 if (doAdjustSize || overWriteWholeChunk) {
1907 #if defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV)
1909 #ifdef AFS_SGI64_ENV
1912 #else /* AFS_SGI64_ENV */
1915 #endif /* AFS_SGI64_ENV */
1916 #else /* AFS_SGI_ENV */
1919 #endif /* AFS_SGI_ENV */
1920 if (AFS_CHUNKTOBASE(chunk) + adjustsize >= avc->f.m.Length &&
1921 #else /* defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV) */
1922 #if defined(AFS_SUN5_ENV)
1923 if ((doAdjustSize || (AFS_CHUNKTOBASE(chunk) >= avc->f.m.Length)) &&
1925 if (AFS_CHUNKTOBASE(chunk) >= avc->f.m.Length &&
1927 #endif /* defined(AFS_AIX32_ENV) || defined(AFS_SGI_ENV) */
1928 !hsame(avc->f.m.DataVersion, tdc->f.versionNo))
1929 doReallyAdjustSize = 1;
1931 if (doReallyAdjustSize || overWriteWholeChunk) {
1932 /* no data in file to read at this position */
1933 UpgradeSToWLock(&tdc->lock, 607);
1934 file = afs_CFileOpen(&tdc->f.inode);
1935 afs_CFileTruncate(file, 0);
1936 afs_CFileClose(file);
1937 afs_AdjustSize(tdc, 0);
1938 hset(tdc->f.versionNo, avc->f.m.DataVersion);
1939 tdc->dflags |= DFEntryMod;
1941 ConvertWToSLock(&tdc->lock);
1946 * We must read in the whole chunk if the version number doesn't
1950 /* don't need data, just a unique dcache entry */
1951 ObtainWriteLock(&afs_xdcache, 608);
1952 hset(afs_indexTimes[tdc->index], afs_indexCounter);
1953 hadd32(afs_indexCounter, 1);
1954 ReleaseWriteLock(&afs_xdcache);
1956 updateV2DC(setLocks, avc, tdc, 553);
1957 if (vType(avc) == VDIR)
1960 *aoffset = AFS_CHUNKOFFSET(abyte);
1961 if (tdc->validPos < abyte)
1962 *alen = (afs_size_t) 0;
1964 *alen = tdc->validPos - abyte;
1965 ReleaseSharedLock(&tdc->lock);
1968 ReleaseWriteLock(&avc->lock);
1970 ReleaseReadLock(&avc->lock);
1972 return tdc; /* check if we're done */
1977 * avc->lock(R) if setLocks && !slowPass
1978 * avc->lock(W) if !setLocks || slowPass
1981 osi_Assert((setLocks && !slowPass) || WriteLocked(&avc->lock));
1983 setNewCallback = setVcacheStatus = 0;
1987 * avc->lock(R) if setLocks && !slowPass
1988 * avc->lock(W) if !setLocks || slowPass
1991 if (!hsame(avc->f.m.DataVersion, tdc->f.versionNo) && !overWriteWholeChunk) {
1993 * Version number mismatch.
1996 * If we are disconnected, then we can't do much of anything
1997 * because the data doesn't match the file.
1999 if (AFS_IS_DISCONNECTED) {
2000 ReleaseSharedLock(&tdc->lock);
2003 ReleaseWriteLock(&avc->lock);
2005 ReleaseReadLock(&avc->lock);
2007 /* Flush the Dcache */
2012 UpgradeSToWLock(&tdc->lock, 609);
2015 * If data ever existed for this vnode, and this is a text object,
2016 * do some clearing. Now, you'd think you need only do the flush
2017 * when VTEXT is on, but VTEXT is turned off when the text object
2018 * is freed, while pages are left lying around in memory marked
2019 * with this vnode. If we would reactivate (create a new text
2020 * object from) this vnode, we could easily stumble upon some of
2021 * these old pages in pagein. So, we always flush these guys.
2022 * Sun has a wonderful lack of useful invariants in this system.
2024 * avc->flushDV is the data version # of the file at the last text
2025 * flush. Clearly, at least, we don't have to flush the file more
2026 * often than it changes
2028 if (hcmp(avc->flushDV, avc->f.m.DataVersion) < 0) {
2030 * By here, the cache entry is always write-locked. We can
2031 * deadlock if we call osi_Flush with the cache entry locked...
2032 * Unlock the dcache too.
2034 ReleaseWriteLock(&tdc->lock);
2035 if (setLocks && !slowPass)
2036 ReleaseReadLock(&avc->lock);
2038 ReleaseWriteLock(&avc->lock);
2042 * Call osi_FlushPages in open, read/write, and map, since it
2043 * is too hard here to figure out if we should lock the
2046 if (setLocks && !slowPass)
2047 ObtainReadLock(&avc->lock);
2049 ObtainWriteLock(&avc->lock, 66);
2050 ObtainWriteLock(&tdc->lock, 610);
2055 * avc->lock(R) if setLocks && !slowPass
2056 * avc->lock(W) if !setLocks || slowPass
2060 /* Watch for standard race condition around osi_FlushText */
2061 if (hsame(avc->f.m.DataVersion, tdc->f.versionNo)) {
2062 updateV2DC(setLocks, avc, tdc, 569); /* set hint */
2063 afs_stats_cmperf.dcacheHits++;
2064 ConvertWToSLock(&tdc->lock);
2068 /* Sleep here when cache needs to be drained. */
2069 if (setLocks && !slowPass
2070 && (afs_blocksUsed >
2071 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks))) {
2072 /* Make sure truncate daemon is running */
2073 afs_MaybeWakeupTruncateDaemon();
2074 ObtainWriteLock(&tdc->tlock, 614);
2075 tdc->refCount--; /* we'll re-obtain the dcache when we re-try. */
2076 ReleaseWriteLock(&tdc->tlock);
2077 ReleaseWriteLock(&tdc->lock);
2078 ReleaseReadLock(&avc->lock);
2079 while ((afs_blocksUsed - afs_blocksDiscarded) >
2080 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
2081 afs_WaitForCacheDrain = 1;
2082 afs_osi_Sleep(&afs_WaitForCacheDrain);
2084 afs_MaybeFreeDiscardedDCache();
2085 /* need to check if someone else got the chunk first. */
2086 goto RetryGetDCache;
2089 Position = AFS_CHUNKBASE(abyte);
2090 if (vType(avc) == VDIR) {
2091 size = avc->f.m.Length;
2092 if (size > tdc->f.chunkBytes) {
2093 /* pre-reserve space for file */
2094 afs_AdjustSize(tdc, size);
2096 size = 999999999; /* max size for transfer */
2098 afs_size_t maxGoodLength;
2100 /* estimate how much data we're expecting back from the server,
2101 * and reserve space in the dcache entry for it */
2103 maxGoodLength = avc->f.m.Length;
2104 if (avc->f.truncPos < maxGoodLength)
2105 maxGoodLength = avc->f.truncPos;
2107 size = AFS_CHUNKSIZE(abyte); /* expected max size */
2108 if (Position + size > maxGoodLength)
2109 size = maxGoodLength - Position;
2111 size = 0; /* Handle random races */
2112 if (size > tdc->f.chunkBytes) {
2113 /* pre-reserve estimated space for file */
2114 afs_AdjustSize(tdc, size); /* changes chunkBytes */
2118 /* For the actual fetch, do not limit the request to the
2119 * length of the file. If this results in a read past EOF on
2120 * the server, the server will just reply with less data than
2121 * requested. If we limit ourselves to only requesting data up
2122 * to the avc file length, we open ourselves up to races if the
2123 * file is extended on the server at about the same time.
2125 * However, we must restrict ourselves to the avc->f.truncPos
2126 * length, since this represents an outstanding local
2127 * truncation of the file that will be committed to the
2128 * fileserver when we actually write the fileserver contents.
2129 * If we do not restrict the fetch length based on
2130 * avc->f.truncPos, a different truncate operation extending
2131 * the file length could cause the old data after
2132 * avc->f.truncPos to reappear, instead of extending the file
2133 * with NUL bytes. */
2134 size = AFS_CHUNKSIZE(abyte);
2135 if (Position + size > avc->f.truncPos) {
2136 size = avc->f.truncPos - Position;
2143 if (afs_mariner && !tdc->f.chunk)
2144 afs_MarinerLog("fetch$Fetching", avc); /* , Position, size, afs_indexCounter ); */
2146 * Right now, we only have one tool, and it's a hammer. So, we
2147 * fetch the whole file.
2149 DZap(tdc); /* pages in cache may be old */
2150 file = afs_CFileOpen(&tdc->f.inode);
2151 afs_RemoveVCB(&avc->f.fid);
2152 tdc->f.states |= DWriting;
2153 tdc->dflags |= DFFetching;
2154 tdc->validPos = Position; /* which is AFS_CHUNKBASE(abyte) */
2155 if (tdc->mflags & DFFetchReq) {
2156 tdc->mflags &= ~DFFetchReq;
2157 if (afs_osi_Wakeup(&tdc->validPos) == 0)
2158 afs_Trace4(afs_iclSetp, CM_TRACE_DCACHEWAKE, ICL_TYPE_STRING,
2159 __FILE__, ICL_TYPE_INT32, __LINE__,
2160 ICL_TYPE_POINTER, tdc, ICL_TYPE_INT32,
2163 tsmall = osi_AllocLargeSpace(sizeof(struct afs_FetchOutput));
2164 setVcacheStatus = 0;
2167 * Remember if we are doing the reading from a replicated volume,
2168 * and how many times we've zipped around the fetch/analyze loop.
2170 fromReplica = (avc->f.states & CRO) ? 1 : 0;
2172 accP = &(afs_stats_cmfullperf.accessinf);
2174 (accP->replicatedRefs)++;
2176 (accP->unreplicatedRefs)++;
2177 #endif /* AFS_NOSTATS */
2178 /* this is a cache miss */
2179 afs_Trace4(afs_iclSetp, CM_TRACE_FETCHPROC, ICL_TYPE_POINTER, avc,
2180 ICL_TYPE_FID, &(avc->f.fid), ICL_TYPE_OFFSET,
2181 ICL_HANDLE_OFFSET(Position), ICL_TYPE_INT32, size);
2184 afs_stats_cmperf.dcacheMisses++;
2187 * Dynamic root support: fetch data from local memory.
2189 if (afs_IsDynroot(avc)) {
2193 afs_GetDynroot(&dynrootDir, &dynrootLen, &tsmall->OutStatus);
2195 dynrootDir += Position;
2196 dynrootLen -= Position;
2197 if (size > dynrootLen)
2201 code = afs_CFileWrite(file, 0, dynrootDir, size);
2209 tdc->validPos = Position + size;
2210 afs_CFileTruncate(file, size); /* prune it */
2211 } else if (afs_IsDynrootMount(avc)) {
2215 afs_GetDynrootMount(&dynrootDir, &dynrootLen, &tsmall->OutStatus);
2217 dynrootDir += Position;
2218 dynrootLen -= Position;
2219 if (size > dynrootLen)
2223 code = afs_CFileWrite(file, 0, dynrootDir, size);
2231 tdc->validPos = Position + size;
2232 afs_CFileTruncate(file, size); /* prune it */
2235 * Not a dynamic vnode: do the real fetch.
2240 * avc->lock(R) if setLocks && !slowPass
2241 * avc->lock(W) if !setLocks || slowPass
2245 tc = afs_Conn(&avc->f.fid, areq, SHARED_LOCK, &rxconn);
2250 (accP->numReplicasAccessed)++;
2252 #endif /* AFS_NOSTATS */
2253 if (!setLocks || slowPass) {
2254 avc->callback = tc->parent->srvr->server;
2256 newCallback = tc->parent->srvr->server;
2260 code = afs_CacheFetchProc(tc, rxconn, file, Position, tdc,
2266 /* callback could have been broken (or expired) in a race here,
2267 * but we return the data anyway. It's as good as we knew about
2268 * when we started. */
2270 * validPos is updated by CacheFetchProc, and can only be
2271 * modifed under a dcache write lock, which we've blocked out
2273 size = tdc->validPos - Position; /* actual segment size */
2276 afs_CFileTruncate(file, size); /* prune it */
2278 if (!setLocks || slowPass) {
2279 ObtainWriteLock(&afs_xcbhash, 453);
2280 afs_DequeueCallback(avc);
2281 avc->f.states &= ~(CStatd | CUnique);
2282 avc->callback = NULL;
2283 ReleaseWriteLock(&afs_xcbhash);
2284 if (avc->f.fid.Fid.Vnode & 1 || (vType(avc) == VDIR))
2285 osi_dnlc_purgedp(avc);
2287 /* Something lost. Forget about performance, and go
2288 * back with a vcache write lock.
2290 afs_CFileTruncate(file, 0);
2291 afs_AdjustSize(tdc, 0);
2292 afs_CFileClose(file);
2293 osi_FreeLargeSpace(tsmall);
2295 ReleaseWriteLock(&tdc->lock);
2298 ReleaseReadLock(&avc->lock);
2300 goto RetryGetDCache;
2304 } while (afs_Analyze
2305 (tc, rxconn, code, &avc->f.fid, areq,
2306 AFS_STATS_FS_RPCIDX_FETCHDATA, SHARED_LOCK, NULL));
2310 * avc->lock(R) if setLocks && !slowPass
2311 * avc->lock(W) if !setLocks || slowPass
2317 * In the case of replicated access, jot down info on the number of
2318 * attempts it took before we got through or gave up.
2321 if (numFetchLoops <= 1)
2322 (accP->refFirstReplicaOK)++;
2323 if (numFetchLoops > accP->maxReplicasPerRef)
2324 accP->maxReplicasPerRef = numFetchLoops;
2326 #endif /* AFS_NOSTATS */
2328 tdc->dflags &= ~DFFetching;
2329 if (afs_osi_Wakeup(&tdc->validPos) == 0)
2330 afs_Trace4(afs_iclSetp, CM_TRACE_DCACHEWAKE, ICL_TYPE_STRING,
2331 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2332 tdc, ICL_TYPE_INT32, tdc->dflags);
2333 if (avc->execsOrWriters == 0)
2334 tdc->f.states &= ~DWriting;
2336 /* now, if code != 0, we have an error and should punt.
2337 * note that we have the vcache write lock, either because
2338 * !setLocks or slowPass.
2341 afs_CFileTruncate(file, 0);
2342 afs_AdjustSize(tdc, 0);
2343 afs_CFileClose(file);
2344 ZapDCE(tdc); /* sets DFEntryMod */
2345 if (vType(avc) == VDIR) {
2348 tdc->f.states &= ~(DRO|DBackup|DRW);
2349 afs_DCMoveBucket(tdc, 0, 0);
2350 ReleaseWriteLock(&tdc->lock);
2352 if (!afs_IsDynroot(avc)) {
2353 ObtainWriteLock(&afs_xcbhash, 454);
2354 afs_DequeueCallback(avc);
2355 avc->f.states &= ~(CStatd | CUnique);
2356 ReleaseWriteLock(&afs_xcbhash);
2357 if (avc->f.fid.Fid.Vnode & 1 || (vType(avc) == VDIR))
2358 osi_dnlc_purgedp(avc);
2361 * avc->lock(W); assert(!setLocks || slowPass)
2363 osi_Assert(!setLocks || slowPass);
2369 /* otherwise we copy in the just-fetched info */
2370 afs_CFileClose(file);
2371 afs_AdjustSize(tdc, size); /* new size */
2373 * Copy appropriate fields into vcache. Status is
2374 * copied later where we selectively acquire the
2375 * vcache write lock.
2378 afs_ProcessFS(avc, &tsmall->OutStatus, areq);
2380 setVcacheStatus = 1;
2381 hset64(tdc->f.versionNo, tsmall->OutStatus.dataVersionHigh,
2382 tsmall->OutStatus.DataVersion);
2383 tdc->dflags |= DFEntryMod;
2384 afs_indexFlags[tdc->index] |= IFEverUsed;
2385 ConvertWToSLock(&tdc->lock);
2386 } /*Data version numbers don't match */
2389 * Data version numbers match.
2391 afs_stats_cmperf.dcacheHits++;
2392 } /*Data version numbers match */
2394 updateV2DC(setLocks, avc, tdc, 335); /* set hint */
2398 * avc->lock(R) if setLocks && !slowPass
2399 * avc->lock(W) if !setLocks || slowPass
2400 * tdc->lock(S) if tdc
2404 * See if this was a reference to a file in the local cell.
2406 if (afs_IsPrimaryCellNum(avc->f.fid.Cell))
2407 afs_stats_cmperf.dlocalAccesses++;
2409 afs_stats_cmperf.dremoteAccesses++;
2411 /* Fix up LRU info */
2414 ObtainWriteLock(&afs_xdcache, 602);
2415 hset(afs_indexTimes[tdc->index], afs_indexCounter);
2416 hadd32(afs_indexCounter, 1);
2417 ReleaseWriteLock(&afs_xdcache);
2419 /* return the data */
2420 if (vType(avc) == VDIR)
2423 *aoffset = AFS_CHUNKOFFSET(abyte);
2424 *alen = (tdc->f.chunkBytes - *aoffset);
2425 ReleaseSharedLock(&tdc->lock);
2430 * avc->lock(R) if setLocks && !slowPass
2431 * avc->lock(W) if !setLocks || slowPass
2434 /* Fix up the callback and status values in the vcache */
2436 if (setLocks && !slowPass) {
2439 * This is our dirty little secret to parallel fetches.
2440 * We don't write-lock the vcache while doing the fetch,
2441 * but potentially we'll need to update the vcache after
2442 * the fetch is done.
2444 * Drop the read lock and try to re-obtain the write
2445 * lock. If the vcache still has the same DV, it's
2446 * ok to go ahead and install the new data.
2448 afs_hyper_t currentDV, statusDV;
2450 hset(currentDV, avc->f.m.DataVersion);
2452 if (setNewCallback && avc->callback != newCallback)
2456 hset64(statusDV, tsmall->OutStatus.dataVersionHigh,
2457 tsmall->OutStatus.DataVersion);
2459 if (setVcacheStatus && avc->f.m.Length != tsmall->OutStatus.Length)
2461 if (setVcacheStatus && !hsame(currentDV, statusDV))
2465 ReleaseReadLock(&avc->lock);
2467 if (doVcacheUpdate) {
2468 ObtainWriteLock(&avc->lock, 615);
2469 if (!hsame(avc->f.m.DataVersion, currentDV)) {
2470 /* We lose. Someone will beat us to it. */
2472 ReleaseWriteLock(&avc->lock);
2477 /* With slow pass, we've already done all the updates */
2479 ReleaseWriteLock(&avc->lock);
2482 /* Check if we need to perform any last-minute fixes with a write-lock */
2483 if (!setLocks || doVcacheUpdate) {
2485 avc->callback = newCallback;
2486 if (tsmall && setVcacheStatus)
2487 afs_ProcessFS(avc, &tsmall->OutStatus, areq);
2489 ReleaseWriteLock(&avc->lock);
2493 osi_FreeLargeSpace(tsmall);
2496 } /*afs_GetDCache */
2500 * afs_WriteThroughDSlots
2503 * Sweep through the dcache slots and write out any modified
2504 * in-memory data back on to our caching store.
2510 * The afs_xdcache is write-locked through this whole affair.
2513 afs_WriteThroughDSlots(void)
2516 afs_int32 i, touchedit = 0;
2518 struct afs_q DirtyQ, *tq;
2520 AFS_STATCNT(afs_WriteThroughDSlots);
2523 * Because of lock ordering, we can't grab dcache locks while
2524 * holding afs_xdcache. So we enter xdcache, get a reference
2525 * for every dcache entry, and exit xdcache.
2527 ObtainWriteLock(&afs_xdcache, 283);
2529 for (i = 0; i < afs_cacheFiles; i++) {
2530 tdc = afs_indexTable[i];
2532 /* Grab tlock in case the existing refcount isn't zero */
2533 if (tdc && !(afs_indexFlags[i] & (IFFree | IFDiscarded))) {
2534 ObtainWriteLock(&tdc->tlock, 623);
2536 ReleaseWriteLock(&tdc->tlock);
2538 QAdd(&DirtyQ, &tdc->dirty);
2541 ReleaseWriteLock(&afs_xdcache);
2544 * Now, for each dcache entry we found, check if it's dirty.
2545 * If so, get write-lock, get afs_xdcache, which protects
2546 * afs_cacheInodep, and flush it. Don't forget to put back
2550 #define DQTODC(q) ((struct dcache *)(((char *) (q)) - sizeof(struct afs_q)))
2552 for (tq = DirtyQ.prev; tq != &DirtyQ; tq = QPrev(tq)) {
2554 if (tdc->dflags & DFEntryMod) {
2557 wrLock = (0 == NBObtainWriteLock(&tdc->lock, 619));
2559 /* Now that we have the write lock, double-check */
2560 if (wrLock && (tdc->dflags & DFEntryMod)) {
2561 tdc->dflags &= ~DFEntryMod;
2562 ObtainWriteLock(&afs_xdcache, 620);
2563 osi_Assert(afs_WriteDCache(tdc, 1) == 0);
2564 ReleaseWriteLock(&afs_xdcache);
2568 ReleaseWriteLock(&tdc->lock);
2574 ObtainWriteLock(&afs_xdcache, 617);
2575 if (!touchedit && (cacheDiskType != AFS_FCACHE_TYPE_MEM)) {
2576 /* Touch the file to make sure that the mtime on the file is kept
2577 * up-to-date to avoid losing cached files on cold starts because
2578 * their mtime seems old...
2580 struct afs_fheader theader;
2582 theader.magic = AFS_FHMAGIC;
2583 theader.firstCSize = AFS_FIRSTCSIZE;
2584 theader.otherCSize = AFS_OTHERCSIZE;
2585 theader.version = AFS_CI_VERSION;
2586 theader.dataSize = sizeof(struct fcache);
2587 afs_osi_Write(afs_cacheInodep, 0, &theader, sizeof(theader));
2589 ReleaseWriteLock(&afs_xdcache);
2596 * Return a pointer to an freshly initialized dcache entry using
2597 * a memory-based cache. The tlock will be read-locked.
2600 * aslot : Dcache slot to look at.
2601 * needvalid : Whether the specified slot should already exist
2604 * Must be called with afs_xdcache write-locked.
2608 afs_MemGetDSlot(afs_int32 aslot, int needvalid)
2613 AFS_STATCNT(afs_MemGetDSlot);
2614 if (CheckLock(&afs_xdcache) != -1)
2615 osi_Panic("getdslot nolock");
2616 if (aslot < 0 || aslot >= afs_cacheFiles)
2617 osi_Panic("getdslot slot %d (of %d)", aslot, afs_cacheFiles);
2618 tdc = afs_indexTable[aslot];
2620 QRemove(&tdc->lruq); /* move to queue head */
2621 QAdd(&afs_DLRU, &tdc->lruq);
2622 /* We're holding afs_xdcache, but get tlock in case refCount != 0 */
2623 ObtainWriteLock(&tdc->tlock, 624);
2625 ConvertWToRLock(&tdc->tlock);
2629 /* if 'needvalid' is true, the slot must already exist and be populated
2630 * somewhere. for memcache, the only place that dcache entries exist is
2631 * in memory, so if we did not find it above, something is very wrong. */
2632 osi_Assert(!needvalid);
2634 if (!afs_freeDSList)
2635 afs_GetDownDSlot(4);
2636 if (!afs_freeDSList) {
2637 /* none free, making one is better than a panic */
2638 afs_stats_cmperf.dcacheXAllocs++; /* count in case we have a leak */
2639 tdc = afs_osi_Alloc(sizeof(struct dcache));
2640 osi_Assert(tdc != NULL);
2641 #ifdef KERNEL_HAVE_PIN
2642 pin((char *)tdc, sizeof(struct dcache)); /* XXX */
2645 tdc = afs_freeDSList;
2646 afs_freeDSList = (struct dcache *)tdc->lruq.next;
2649 tdc->dflags = 0; /* up-to-date, not in free q */
2651 QAdd(&afs_DLRU, &tdc->lruq);
2652 if (tdc->lruq.prev == &tdc->lruq)
2653 osi_Panic("lruq 3");
2655 /* initialize entry */
2656 tdc->f.fid.Cell = 0;
2657 tdc->f.fid.Fid.Volume = 0;
2659 hones(tdc->f.versionNo);
2660 tdc->f.inode.mem = aslot;
2661 tdc->dflags |= DFEntryMod;
2664 afs_indexUnique[aslot] = tdc->f.fid.Fid.Unique;
2667 osi_Assert(0 == NBObtainWriteLock(&tdc->lock, 674));
2668 osi_Assert(0 == NBObtainWriteLock(&tdc->mflock, 675));
2669 osi_Assert(0 == NBObtainWriteLock(&tdc->tlock, 676));
2672 AFS_RWLOCK_INIT(&tdc->lock, "dcache lock");
2673 AFS_RWLOCK_INIT(&tdc->tlock, "dcache tlock");
2674 AFS_RWLOCK_INIT(&tdc->mflock, "dcache flock");
2675 ObtainReadLock(&tdc->tlock);
2677 afs_indexTable[aslot] = tdc;
2680 } /*afs_MemGetDSlot */
2682 unsigned int last_error = 0, lasterrtime = 0;
2688 * Return a pointer to an freshly initialized dcache entry using
2689 * a UFS-based disk cache. The dcache tlock will be read-locked.
2692 * aslot : Dcache slot to look at.
2693 * needvalid : Whether the specified slot should already exist
2696 * afs_xdcache lock write-locked.
2699 afs_UFSGetDSlot(afs_int32 aslot, int needvalid)
2707 AFS_STATCNT(afs_UFSGetDSlot);
2708 if (CheckLock(&afs_xdcache) != -1)
2709 osi_Panic("getdslot nolock");
2710 if (aslot < 0 || aslot >= afs_cacheFiles)
2711 osi_Panic("getdslot slot %d (of %d)", aslot, afs_cacheFiles);
2712 tdc = afs_indexTable[aslot];
2714 QRemove(&tdc->lruq); /* move to queue head */
2715 QAdd(&afs_DLRU, &tdc->lruq);
2716 /* Grab tlock in case refCount != 0 */
2717 ObtainWriteLock(&tdc->tlock, 625);
2719 ConvertWToRLock(&tdc->tlock);
2723 /* otherwise we should read it in from the cache file */
2724 if (!afs_freeDSList)
2725 afs_GetDownDSlot(4);
2726 if (!afs_freeDSList) {
2727 /* none free, making one is better than a panic */
2728 afs_stats_cmperf.dcacheXAllocs++; /* count in case we have a leak */
2729 tdc = afs_osi_Alloc(sizeof(struct dcache));
2730 osi_Assert(tdc != NULL);
2731 #ifdef KERNEL_HAVE_PIN
2732 pin((char *)tdc, sizeof(struct dcache)); /* XXX */
2735 tdc = afs_freeDSList;
2736 afs_freeDSList = (struct dcache *)tdc->lruq.next;
2739 tdc->dflags = 0; /* up-to-date, not in free q */
2741 QAdd(&afs_DLRU, &tdc->lruq);
2742 if (tdc->lruq.prev == &tdc->lruq)
2743 osi_Panic("lruq 3");
2746 * Seek to the aslot'th entry and read it in.
2748 off = sizeof(struct fcache)*aslot + sizeof(struct afs_fheader);
2750 afs_osi_Read(afs_cacheInodep,
2751 off, (char *)(&tdc->f),
2752 sizeof(struct fcache));
2754 if (code != sizeof(struct fcache)) {
2756 #if defined(KERNEL_HAVE_UERROR)
2757 last_error = getuerror();
2759 lasterrtime = osi_Time();
2761 struct osi_stat tstat;
2762 if (afs_osi_Stat(afs_cacheInodep, &tstat)) {
2765 afs_warn("afs: disk cache read error in CacheItems off %d/%d "
2767 off, (int)tstat.size,
2768 (int)code, (int)sizeof(struct fcache));
2769 /* put tdc back on the free dslot list */
2770 QRemove(&tdc->lruq);
2771 tdc->index = NULLIDX;
2772 tdc->lruq.next = (struct afs_q *)afs_freeDSList;
2773 afs_freeDSList = tdc;
2777 if (!afs_CellNumValid(tdc->f.fid.Cell)) {
2780 osi_Panic("afs: needed valid dcache but index %d off %d has "
2781 "invalid cell num %d\n",
2782 (int)aslot, off, (int)tdc->f.fid.Cell);
2786 if (needvalid && tdc->f.fid.Fid.Volume == 0) {
2787 osi_Panic("afs: invalid zero-volume dcache entry at slot %d off %d",
2792 tdc->f.fid.Cell = 0;
2793 tdc->f.fid.Fid.Volume = 0;
2795 hones(tdc->f.versionNo);
2796 tdc->dflags |= DFEntryMod;
2797 afs_indexUnique[aslot] = tdc->f.fid.Fid.Unique;
2798 tdc->f.states &= ~(DRO|DBackup|DRW);
2799 afs_DCMoveBucket(tdc, 0, 0);
2802 if (tdc->f.states & DRO) {
2803 afs_DCMoveBucket(tdc, 0, 2);
2804 } else if (tdc->f.states & DBackup) {
2805 afs_DCMoveBucket(tdc, 0, 1);
2807 afs_DCMoveBucket(tdc, 0, 1);
2813 if (tdc->f.chunk >= 0)
2814 tdc->validPos = AFS_CHUNKTOBASE(tdc->f.chunk) + tdc->f.chunkBytes;
2819 osi_Assert(0 == NBObtainWriteLock(&tdc->lock, 674));
2820 osi_Assert(0 == NBObtainWriteLock(&tdc->mflock, 675));
2821 osi_Assert(0 == NBObtainWriteLock(&tdc->tlock, 676));
2824 AFS_RWLOCK_INIT(&tdc->lock, "dcache lock");
2825 AFS_RWLOCK_INIT(&tdc->tlock, "dcache tlock");
2826 AFS_RWLOCK_INIT(&tdc->mflock, "dcache flock");
2827 ObtainReadLock(&tdc->tlock);
2830 * If we didn't read into a temporary dcache region, update the
2831 * slot pointer table.
2833 afs_indexTable[aslot] = tdc;
2836 } /*afs_UFSGetDSlot */
2841 * Write a particular dcache entry back to its home in the
2844 * \param adc Pointer to the dcache entry to write.
2845 * \param atime If true, set the modtime on the file to the current time.
2847 * \note Environment:
2848 * Must be called with the afs_xdcache lock at least read-locked,
2849 * and dcache entry at least read-locked.
2850 * The reference count is not changed.
2854 afs_WriteDCache(struct dcache *adc, int atime)
2858 if (cacheDiskType == AFS_FCACHE_TYPE_MEM)
2860 AFS_STATCNT(afs_WriteDCache);
2861 osi_Assert(WriteLocked(&afs_xdcache));
2863 adc->f.modTime = osi_Time();
2865 if ((afs_indexFlags[adc->index] & (IFFree | IFDiscarded)) == 0 &&
2866 adc->f.fid.Fid.Volume == 0) {
2867 /* If a dcache slot is not on the free or discard list, it must be
2868 * in the hash table. Thus, the volume must be non-zero, since that
2869 * is how we determine whether or not to unhash the entry when kicking
2870 * it out of the cache. Do this check now, since otherwise this can
2871 * cause hash table corruption and a panic later on after we read the
2873 osi_Panic("afs_WriteDCache zero volume index %d flags 0x%x\n",
2874 adc->index, (unsigned)afs_indexFlags[adc->index]);
2878 * Seek to the right dcache slot and write the in-memory image out to disk.
2880 afs_cellname_write();
2882 afs_osi_Write(afs_cacheInodep,
2883 sizeof(struct fcache) * adc->index +
2884 sizeof(struct afs_fheader), (char *)(&adc->f),
2885 sizeof(struct fcache));
2886 if (code != sizeof(struct fcache)) {
2887 afs_warn("afs: failed to write to CacheItems off %ld code %d/%d\n",
2888 (long)(sizeof(struct fcache) * adc->index + sizeof(struct afs_fheader)),
2889 (int)code, (int)sizeof(struct fcache));
2898 * Wake up users of a particular file waiting for stores to take
2901 * \param avc Ptr to related vcache entry.
2903 * \note Environment:
2904 * Nothing interesting.
2907 afs_wakeup(struct vcache *avc)
2910 struct brequest *tb;
2912 AFS_STATCNT(afs_wakeup);
2913 for (i = 0; i < NBRS; i++, tb++) {
2914 /* if request is valid and for this file, we've found it */
2915 if (tb->refCount > 0 && avc == tb->vc) {
2918 * If CSafeStore is on, then we don't awaken the guy
2919 * waiting for the store until the whole store has finished.
2920 * Otherwise, we do it now. Note that if CSafeStore is on,
2921 * the BStore routine actually wakes up the user, instead
2923 * I think this is redundant now because this sort of thing
2924 * is already being handled by the higher-level code.
2926 if ((avc->f.states & CSafeStore) == 0) {
2928 tb->flags |= BUVALID;
2929 if (tb->flags & BUWAIT) {
2930 tb->flags &= ~BUWAIT;
2942 * Given a file name and inode, set up that file to be an
2943 * active member in the AFS cache. This also involves checking
2944 * the usability of its data.
2946 * \param afile Name of the cache file to initialize.
2947 * \param ainode Inode of the file.
2949 * \note Environment:
2950 * This function is called only during initialization.
2953 afs_InitCacheFile(char *afile, ino_t ainode)
2958 struct osi_file *tfile;
2959 struct osi_stat tstat;
2962 AFS_STATCNT(afs_InitCacheFile);
2963 index = afs_stats_cmperf.cacheNumEntries;
2964 if (index >= afs_cacheFiles)
2967 ObtainWriteLock(&afs_xdcache, 282);
2968 tdc = afs_GetNewDSlot(index);
2969 ReleaseReadLock(&tdc->tlock);
2970 ReleaseWriteLock(&afs_xdcache);
2972 ObtainWriteLock(&tdc->lock, 621);
2973 ObtainWriteLock(&afs_xdcache, 622);
2975 code = afs_LookupInodeByPath(afile, &tdc->f.inode.ufs, NULL);
2977 ReleaseWriteLock(&afs_xdcache);
2978 ReleaseWriteLock(&tdc->lock);
2983 /* Add any other 'complex' inode types here ... */
2984 #if !defined(AFS_LINUX26_ENV) && !defined(AFS_CACHE_VNODE_PATH)
2985 tdc->f.inode.ufs = ainode;
2987 osi_Panic("Can't init cache with inode numbers when complex inodes are "
2992 if ((tdc->f.states & DWriting) || tdc->f.fid.Fid.Volume == 0)
2994 tfile = osi_UFSOpen(&tdc->f.inode);
2995 code = afs_osi_Stat(tfile, &tstat);
2997 osi_Panic("initcachefile stat");
3000 * If file size doesn't match the cache info file, it's probably bad.
3002 if (tdc->f.chunkBytes != tstat.size)
3004 tdc->f.chunkBytes = 0;
3007 * If file changed within T (120?) seconds of cache info file, it's
3008 * probably bad. In addition, if slot changed within last T seconds,
3009 * the cache info file may be incorrectly identified, and so slot
3012 if (cacheInfoModTime < tstat.mtime + 120)
3014 if (cacheInfoModTime < tdc->f.modTime + 120)
3016 /* In case write through is behind, make sure cache items entry is
3017 * at least as new as the chunk.
3019 if (tdc->f.modTime < tstat.mtime)
3022 tdc->f.fid.Fid.Volume = 0; /* not in the hash table */
3023 if (tstat.size != 0)
3024 osi_UFSTruncate(tfile, 0);
3025 tdc->f.states &= ~(DRO|DBackup|DRW);
3026 afs_DCMoveBucket(tdc, 0, 0);
3027 /* put entry in free cache slot list */
3028 afs_dvnextTbl[tdc->index] = afs_freeDCList;
3029 afs_freeDCList = index;
3031 afs_indexFlags[index] |= IFFree;
3032 afs_indexUnique[index] = 0;
3035 * We must put this entry in the appropriate hash tables.
3036 * Note that i is still set from the above DCHash call
3038 code = DCHash(&tdc->f.fid, tdc->f.chunk);
3039 afs_dcnextTbl[tdc->index] = afs_dchashTbl[code];
3040 afs_dchashTbl[code] = tdc->index;
3041 code = DVHash(&tdc->f.fid);
3042 afs_dvnextTbl[tdc->index] = afs_dvhashTbl[code];
3043 afs_dvhashTbl[code] = tdc->index;
3044 afs_AdjustSize(tdc, tstat.size); /* adjust to new size */
3046 /* has nontrivial amt of data */
3047 afs_indexFlags[index] |= IFEverUsed;
3048 afs_stats_cmperf.cacheFilesReused++;
3050 * Initialize index times to file's mod times; init indexCounter
3053 hset32(afs_indexTimes[index], tstat.atime);
3054 if (hgetlo(afs_indexCounter) < tstat.atime) {
3055 hset32(afs_indexCounter, tstat.atime);
3057 afs_indexUnique[index] = tdc->f.fid.Fid.Unique;
3058 } /*File is not bad */
3060 osi_UFSClose(tfile);
3061 tdc->f.states &= ~DWriting;
3062 tdc->dflags &= ~DFEntryMod;
3063 /* don't set f.modTime; we're just cleaning up */
3064 osi_Assert(afs_WriteDCache(tdc, 0) == 0);
3065 ReleaseWriteLock(&afs_xdcache);
3066 ReleaseWriteLock(&tdc->lock);
3068 afs_stats_cmperf.cacheNumEntries++;
3073 /*Max # of struct dcache's resident at any time*/
3075 * If 'dchint' is enabled then in-memory dcache min is increased because of
3081 * Initialize dcache related variables.
3091 afs_dcacheInit(int afiles, int ablocks, int aDentries, int achunk, int aflags)
3097 afs_freeDCList = NULLIDX;
3098 afs_discardDCList = NULLIDX;
3099 afs_freeDCCount = 0;
3100 afs_freeDSList = NULL;
3101 hzero(afs_indexCounter);
3103 LOCK_INIT(&afs_xdcache, "afs_xdcache");
3109 if (achunk < 0 || achunk > 30)
3110 achunk = 13; /* Use default */
3111 AFS_SETCHUNKSIZE(achunk);
3117 if (aflags & AFSCALL_INIT_MEMCACHE) {
3119 * Use a memory cache instead of a disk cache
3121 cacheDiskType = AFS_FCACHE_TYPE_MEM;
3122 afs_cacheType = &afs_MemCacheOps;
3123 afiles = (afiles < aDentries) ? afiles : aDentries; /* min */
3124 ablocks = afiles * (AFS_FIRSTCSIZE / 1024);
3125 /* ablocks is reported in 1K blocks */
3126 code = afs_InitMemCache(afiles, AFS_FIRSTCSIZE, aflags);
3128 afs_warn("afsd: memory cache too large for available memory.\n");
3129 afs_warn("afsd: AFS files cannot be accessed.\n\n");
3131 afiles = ablocks = 0;
3133 afs_warn("Memory cache: Allocating %d dcache entries...",
3136 cacheDiskType = AFS_FCACHE_TYPE_UFS;
3137 afs_cacheType = &afs_UfsCacheOps;
3140 if (aDentries > 512)
3141 afs_dhashsize = 2048;
3142 /* initialize hash tables */
3143 afs_dvhashTbl = afs_osi_Alloc(afs_dhashsize * sizeof(afs_int32));
3144 osi_Assert(afs_dvhashTbl != NULL);
3145 afs_dchashTbl = afs_osi_Alloc(afs_dhashsize * sizeof(afs_int32));
3146 osi_Assert(afs_dchashTbl != NULL);
3147 for (i = 0; i < afs_dhashsize; i++) {
3148 afs_dvhashTbl[i] = NULLIDX;
3149 afs_dchashTbl[i] = NULLIDX;
3151 afs_dvnextTbl = afs_osi_Alloc(afiles * sizeof(afs_int32));
3152 osi_Assert(afs_dvnextTbl != NULL);
3153 afs_dcnextTbl = afs_osi_Alloc(afiles * sizeof(afs_int32));
3154 osi_Assert(afs_dcnextTbl != NULL);
3155 for (i = 0; i < afiles; i++) {
3156 afs_dvnextTbl[i] = NULLIDX;
3157 afs_dcnextTbl[i] = NULLIDX;
3160 /* Allocate and zero the pointer array to the dcache entries */
3161 afs_indexTable = afs_osi_Alloc(sizeof(struct dcache *) * afiles);
3162 osi_Assert(afs_indexTable != NULL);
3163 memset(afs_indexTable, 0, sizeof(struct dcache *) * afiles);
3164 afs_indexTimes = afs_osi_Alloc(afiles * sizeof(afs_hyper_t));
3165 osi_Assert(afs_indexTimes != NULL);
3166 memset(afs_indexTimes, 0, afiles * sizeof(afs_hyper_t));
3167 afs_indexUnique = afs_osi_Alloc(afiles * sizeof(afs_uint32));
3168 osi_Assert(afs_indexUnique != NULL);
3169 memset(afs_indexUnique, 0, afiles * sizeof(afs_uint32));
3170 afs_indexFlags = afs_osi_Alloc(afiles * sizeof(u_char));
3171 osi_Assert(afs_indexFlags != NULL);
3172 memset(afs_indexFlags, 0, afiles * sizeof(char));
3174 /* Allocate and thread the struct dcache entries themselves */
3175 tdp = afs_Initial_freeDSList =
3176 afs_osi_Alloc(aDentries * sizeof(struct dcache));
3177 osi_Assert(tdp != NULL);
3178 memset(tdp, 0, aDentries * sizeof(struct dcache));
3179 #ifdef KERNEL_HAVE_PIN
3180 pin((char *)afs_indexTable, sizeof(struct dcache *) * afiles); /* XXX */
3181 pin((char *)afs_indexTimes, sizeof(afs_hyper_t) * afiles); /* XXX */
3182 pin((char *)afs_indexFlags, sizeof(char) * afiles); /* XXX */
3183 pin((char *)afs_indexUnique, sizeof(afs_int32) * afiles); /* XXX */
3184 pin((char *)tdp, aDentries * sizeof(struct dcache)); /* XXX */
3185 pin((char *)afs_dvhashTbl, sizeof(afs_int32) * afs_dhashsize); /* XXX */
3186 pin((char *)afs_dchashTbl, sizeof(afs_int32) * afs_dhashsize); /* XXX */
3187 pin((char *)afs_dcnextTbl, sizeof(afs_int32) * afiles); /* XXX */
3188 pin((char *)afs_dvnextTbl, sizeof(afs_int32) * afiles); /* XXX */
3191 afs_freeDSList = &tdp[0];
3192 for (i = 0; i < aDentries - 1; i++) {
3193 tdp[i].lruq.next = (struct afs_q *)(&tdp[i + 1]);
3194 AFS_RWLOCK_INIT(&tdp[i].lock, "dcache lock");
3195 AFS_RWLOCK_INIT(&tdp[i].tlock, "dcache tlock");
3196 AFS_RWLOCK_INIT(&tdp[i].mflock, "dcache flock");
3198 tdp[aDentries - 1].lruq.next = (struct afs_q *)0;
3199 AFS_RWLOCK_INIT(&tdp[aDentries - 1].lock, "dcache lock");
3200 AFS_RWLOCK_INIT(&tdp[aDentries - 1].tlock, "dcache tlock");
3201 AFS_RWLOCK_INIT(&tdp[aDentries - 1].mflock, "dcache flock");
3203 afs_stats_cmperf.cacheBlocksOrig = afs_stats_cmperf.cacheBlocksTotal =
3204 afs_cacheBlocks = ablocks;
3205 afs_ComputeCacheParms(); /* compute parms based on cache size */
3207 afs_dcentries = aDentries;
3209 afs_stats_cmperf.cacheBucket0_Discarded =
3210 afs_stats_cmperf.cacheBucket1_Discarded =
3211 afs_stats_cmperf.cacheBucket2_Discarded = 0;
3217 * Shuts down the cache.
3221 shutdown_dcache(void)
3225 #ifdef AFS_CACHE_VNODE_PATH
3226 if (cacheDiskType != AFS_FCACHE_TYPE_MEM) {
3228 for (i = 0; i < afs_cacheFiles; i++) {
3229 tdc = afs_indexTable[i];
3231 afs_osi_FreeStr(tdc->f.inode.ufs);
3237 afs_osi_Free(afs_dvnextTbl, afs_cacheFiles * sizeof(afs_int32));
3238 afs_osi_Free(afs_dcnextTbl, afs_cacheFiles * sizeof(afs_int32));
3239 afs_osi_Free(afs_indexTable, afs_cacheFiles * sizeof(struct dcache *));
3240 afs_osi_Free(afs_indexTimes, afs_cacheFiles * sizeof(afs_hyper_t));
3241 afs_osi_Free(afs_indexUnique, afs_cacheFiles * sizeof(afs_uint32));
3242 afs_osi_Free(afs_indexFlags, afs_cacheFiles * sizeof(u_char));
3243 afs_osi_Free(afs_Initial_freeDSList,
3244 afs_dcentries * sizeof(struct dcache));
3245 #ifdef KERNEL_HAVE_PIN
3246 unpin((char *)afs_dcnextTbl, afs_cacheFiles * sizeof(afs_int32));
3247 unpin((char *)afs_dvnextTbl, afs_cacheFiles * sizeof(afs_int32));
3248 unpin((char *)afs_indexTable, afs_cacheFiles * sizeof(struct dcache *));
3249 unpin((char *)afs_indexTimes, afs_cacheFiles * sizeof(afs_hyper_t));
3250 unpin((char *)afs_indexUnique, afs_cacheFiles * sizeof(afs_uint32));
3251 unpin((u_char *) afs_indexFlags, afs_cacheFiles * sizeof(u_char));
3252 unpin(afs_Initial_freeDSList, afs_dcentries * sizeof(struct dcache));
3256 for (i = 0; i < afs_dhashsize; i++) {
3257 afs_dvhashTbl[i] = NULLIDX;
3258 afs_dchashTbl[i] = NULLIDX;
3261 afs_osi_Free(afs_dvhashTbl, afs_dhashsize * sizeof(afs_int32));
3262 afs_osi_Free(afs_dchashTbl, afs_dhashsize * sizeof(afs_int32));
3264 afs_blocksUsed = afs_dcentries = 0;
3265 afs_stats_cmperf.cacheBucket0_Discarded =
3266 afs_stats_cmperf.cacheBucket1_Discarded =
3267 afs_stats_cmperf.cacheBucket2_Discarded = 0;
3268 hzero(afs_indexCounter);
3270 afs_freeDCCount = 0;
3271 afs_freeDCList = NULLIDX;
3272 afs_discardDCList = NULLIDX;
3273 afs_freeDSList = afs_Initial_freeDSList = 0;
3275 LOCK_INIT(&afs_xdcache, "afs_xdcache");
3281 * Get a dcache ready for writing, respecting the current cache size limits
3283 * len is required because afs_GetDCache with flag == 4 expects the length
3284 * field to be filled. It decides from this whether it's necessary to fetch
3285 * data into the chunk before writing or not (when the whole chunk is
3288 * \param avc The vcache to fetch a dcache for
3289 * \param filePos The start of the section to be written
3290 * \param len The length of the section to be written
3294 * \return If successful, a reference counted dcache with tdc->lock held. Lock
3295 * must be released and afs_PutDCache() called to free dcache.
3298 * \note avc->lock must be held on entry. Function may release and reobtain
3299 * avc->lock and GLOCK.
3303 afs_ObtainDCacheForWriting(struct vcache *avc, afs_size_t filePos,
3304 afs_size_t len, struct vrequest *areq,
3307 struct dcache *tdc = NULL;
3310 /* read the cached info */
3312 tdc = afs_FindDCache(avc, filePos);
3314 ObtainWriteLock(&tdc->lock, 657);
3315 } else if (afs_blocksUsed >
3316 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
3317 tdc = afs_FindDCache(avc, filePos);
3319 ObtainWriteLock(&tdc->lock, 658);
3320 if (!hsame(tdc->f.versionNo, avc->f.m.DataVersion)
3321 || (tdc->dflags & DFFetching)) {
3322 ReleaseWriteLock(&tdc->lock);
3328 afs_MaybeWakeupTruncateDaemon();
3329 while (afs_blocksUsed >
3330 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
3331 ReleaseWriteLock(&avc->lock);
3332 if (afs_blocksUsed - afs_blocksDiscarded >
3333 PERCENT(CM_WAITFORDRAINPCT, afs_cacheBlocks)) {
3334 afs_WaitForCacheDrain = 1;
3335 afs_osi_Sleep(&afs_WaitForCacheDrain);
3337 afs_MaybeFreeDiscardedDCache();
3338 afs_MaybeWakeupTruncateDaemon();
3339 ObtainWriteLock(&avc->lock, 509);
3341 avc->f.states |= CDirty;
3342 tdc = afs_GetDCache(avc, filePos, areq, &offset, &len, 4);
3344 ObtainWriteLock(&tdc->lock, 659);
3347 tdc = afs_GetDCache(avc, filePos, areq, &offset, &len, 4);
3349 ObtainWriteLock(&tdc->lock, 660);
3352 if (!(afs_indexFlags[tdc->index] & IFDataMod)) {
3353 afs_stats_cmperf.cacheCurrDirtyChunks++;
3354 afs_indexFlags[tdc->index] |= IFDataMod; /* so it doesn't disappear */
3356 if (!(tdc->f.states & DWriting)) {
3357 /* don't mark entry as mod if we don't have to */
3358 tdc->f.states |= DWriting;
3359 tdc->dflags |= DFEntryMod;
3366 * Make a shadow copy of a dir's dcache. It's used for disconnected
3367 * operations like remove/create/rename to keep the original directory data.
3368 * On reconnection, we can diff the original data with the server and get the
3369 * server changes and with the local data to get the local changes.
3371 * \param avc The dir vnode.
3372 * \param adc The dir dcache.
3374 * \return 0 for success.
3376 * \note The vcache entry must be write locked.
3377 * \note The dcache entry must be read locked.
3380 afs_MakeShadowDir(struct vcache *avc, struct dcache *adc)
3382 int i, code, ret_code = 0, written, trans_size;
3383 struct dcache *new_dc = NULL;
3384 struct osi_file *tfile_src, *tfile_dst;
3385 struct VenusFid shadow_fid;
3388 /* Is this a dir? */
3389 if (vType(avc) != VDIR)
3392 if (avc->f.shadow.vnode || avc->f.shadow.unique)
3395 /* Generate a fid for the shadow dir. */
3396 shadow_fid.Cell = avc->f.fid.Cell;
3397 shadow_fid.Fid.Volume = avc->f.fid.Fid.Volume;
3398 afs_GenShadowFid(&shadow_fid);
3400 ObtainWriteLock(&afs_xdcache, 716);
3402 /* Get a fresh dcache. */
3403 new_dc = afs_AllocDCache(avc, 0, 0, &shadow_fid);
3405 ObtainReadLock(&adc->mflock);
3407 /* Set up the new fid. */
3408 /* Copy interesting data from original dir dcache. */
3409 new_dc->mflags = adc->mflags;
3410 new_dc->dflags = adc->dflags;
3411 new_dc->f.modTime = adc->f.modTime;
3412 new_dc->f.versionNo = adc->f.versionNo;
3413 new_dc->f.states = adc->f.states;
3414 new_dc->f.chunk= adc->f.chunk;
3415 new_dc->f.chunkBytes = adc->f.chunkBytes;
3417 ReleaseReadLock(&adc->mflock);
3419 /* Now add to the two hash chains */
3420 i = DCHash(&shadow_fid, 0);
3421 afs_dcnextTbl[new_dc->index] = afs_dchashTbl[i];
3422 afs_dchashTbl[i] = new_dc->index;
3424 i = DVHash(&shadow_fid);
3425 afs_dvnextTbl[new_dc->index] = afs_dvhashTbl[i];
3426 afs_dvhashTbl[i] = new_dc->index;
3428 ReleaseWriteLock(&afs_xdcache);
3430 /* Alloc a 4k block. */
3431 data = afs_osi_Alloc(4096);
3433 afs_warn("afs_MakeShadowDir: could not alloc data\n");
3438 /* Open the files. */
3439 tfile_src = afs_CFileOpen(&adc->f.inode);
3440 tfile_dst = afs_CFileOpen(&new_dc->f.inode);
3442 /* And now copy dir dcache data into this dcache,
3446 while (written < adc->f.chunkBytes) {
3447 trans_size = adc->f.chunkBytes - written;
3448 if (trans_size > 4096)
3451 /* Read a chunk from the dcache. */
3452 code = afs_CFileRead(tfile_src, written, data, trans_size);
3453 if (code < trans_size) {
3458 /* Write it to the new dcache. */
3459 code = afs_CFileWrite(tfile_dst, written, data, trans_size);
3460 if (code < trans_size) {
3465 written+=trans_size;
3468 afs_CFileClose(tfile_dst);
3469 afs_CFileClose(tfile_src);
3471 afs_osi_Free(data, 4096);
3473 ReleaseWriteLock(&new_dc->lock);
3474 afs_PutDCache(new_dc);
3477 ObtainWriteLock(&afs_xvcache, 763);
3478 ObtainWriteLock(&afs_disconDirtyLock, 765);
3479 QAdd(&afs_disconShadow, &avc->shadowq);
3480 osi_Assert((afs_RefVCache(avc) == 0));
3481 ReleaseWriteLock(&afs_disconDirtyLock);
3482 ReleaseWriteLock(&afs_xvcache);
3484 avc->f.shadow.vnode = shadow_fid.Fid.Vnode;
3485 avc->f.shadow.unique = shadow_fid.Fid.Unique;
3493 * Delete the dcaches of a shadow dir.
3495 * \param avc The vcache containing the shadow fid.
3497 * \note avc must be write locked.
3500 afs_DeleteShadowDir(struct vcache *avc)
3503 struct VenusFid shadow_fid;
3505 shadow_fid.Cell = avc->f.fid.Cell;
3506 shadow_fid.Fid.Volume = avc->f.fid.Fid.Volume;
3507 shadow_fid.Fid.Vnode = avc->f.shadow.vnode;
3508 shadow_fid.Fid.Unique = avc->f.shadow.unique;
3510 tdc = afs_FindDCacheByFid(&shadow_fid);
3512 afs_HashOutDCache(tdc, 1);
3513 afs_DiscardDCache(tdc);
3516 avc->f.shadow.vnode = avc->f.shadow.unique = 0;
3517 ObtainWriteLock(&afs_disconDirtyLock, 708);
3518 QRemove(&avc->shadowq);
3519 ReleaseWriteLock(&afs_disconDirtyLock);
3520 afs_PutVCache(avc); /* Because we held it when we added to the queue */
3524 * Populate a dcache with empty chunks up to a given file size,
3525 * used before extending a file in order to avoid 'holes' which
3526 * we can't access in disconnected mode.
3528 * \param avc The vcache which is being extended (locked)
3529 * \param alen The new length of the file
3533 afs_PopulateDCache(struct vcache *avc, afs_size_t apos, struct vrequest *areq)
3536 afs_size_t len, offset;
3537 afs_int32 start, end;
3539 /* We're doing this to deal with the situation where we extend
3540 * by writing after lseek()ing past the end of the file . If that
3541 * extension skips chunks, then those chunks won't be created, and
3542 * GetDCache will assume that they have to be fetched from the server.
3543 * So, for each chunk between the current file position, and the new
3544 * length we GetDCache for that chunk.
3547 if (AFS_CHUNK(apos) == 0 || apos <= avc->f.m.Length)
3550 if (avc->f.m.Length == 0)
3553 start = AFS_CHUNK(avc->f.m.Length)+1;
3555 end = AFS_CHUNK(apos);
3558 len = AFS_CHUNKTOSIZE(start);
3559 tdc = afs_GetDCache(avc, AFS_CHUNKTOBASE(start), areq, &offset, &len, 4);