VirtualBox

source: vbox/trunk/src/VBox/VMM/VMMR3/PDMBlkCache.cpp@ 38880

Last change on this file since 38880 was 38880, checked in by vboxsync, 13 years ago

PDMBlkCache: Fix burn
  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 98.2 KB
Line 
1/* $Id: PDMBlkCache.cpp 38880 2011-09-27 09:23:03Z vboxsync $ */
2/** @file
3 * PDM Block Cache.
4 */
5
6/*
7 * Copyright (C) 2006-2008 Oracle Corporation
8 *
9 * This file is part of VirtualBox Open Source Edition (OSE), as
10 * available from http://www.virtualbox.org. This file is free software;
11 * you can redistribute it and/or modify it under the terms of the GNU
12 * General Public License (GPL) as published by the Free Software
13 * Foundation, in version 2 as it comes in the "COPYING" file of the
14 * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
15 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
16 */
17
18/** @page pg_pdm_block_cache PDM Block Cache - The I/O cache
19 * This component implements an I/O cache based on the 2Q cache algorithm.
20 */
21
22/*******************************************************************************
23* Header Files *
24*******************************************************************************/
25#define LOG_GROUP LOG_GROUP_PDM_BLK_CACHE
26#include "PDMInternal.h"
27#include <iprt/asm.h>
28#include <iprt/mem.h>
29#include <iprt/path.h>
30#include <iprt/string.h>
31#include <VBox/log.h>
32#include <VBox/vmm/stam.h>
33#include <VBox/vmm/uvm.h>
34#include <VBox/vmm/vm.h>
35
36#include "PDMBlkCacheInternal.h"
37
38#ifdef VBOX_STRICT
39# define PDMACFILECACHE_IS_CRITSECT_OWNER(Cache) \
40 do \
41 { \
42 AssertMsg(RTCritSectIsOwner(&Cache->CritSect), \
43 ("Thread does not own critical section\n"));\
44 } while(0)
45
46# define PDMACFILECACHE_EP_IS_SEMRW_WRITE_OWNER(pEpCache) \
47 do \
48 { \
49 AssertMsg(RTSemRWIsWriteOwner(pEpCache->SemRWEntries), \
50 ("Thread is not exclusive owner of the per endpoint RW semaphore\n")); \
51 } while(0)
52
53# define PDMACFILECACHE_EP_IS_SEMRW_READ_OWNER(pEpCache) \
54 do \
55 { \
56 AssertMsg(RTSemRWIsReadOwner(pEpCache->SemRWEntries), \
57 ("Thread is not read owner of the per endpoint RW semaphore\n")); \
58 } while(0)
59
60#else
61# define PDMACFILECACHE_IS_CRITSECT_OWNER(Cache) do { } while(0)
62# define PDMACFILECACHE_EP_IS_SEMRW_WRITE_OWNER(pEpCache) do { } while(0)
63# define PDMACFILECACHE_EP_IS_SEMRW_READ_OWNER(pEpCache) do { } while(0)
64#endif
65
66#define PDM_BLK_CACHE_SAVED_STATE_VERSION 1
67
68/*******************************************************************************
69* Internal Functions *
70*******************************************************************************/
71
72static PPDMBLKCACHEENTRY pdmBlkCacheEntryAlloc(PPDMBLKCACHE pBlkCache,
73 uint64_t off, size_t cbData, uint8_t *pbBuffer);
74static bool pdmBlkCacheAddDirtyEntry(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEENTRY pEntry);
75
76/**
77 * Decrement the reference counter of the given cache entry.
78 *
79 * @returns nothing.
80 * @param pEntry The entry to release.
81 */
82DECLINLINE(void) pdmBlkCacheEntryRelease(PPDMBLKCACHEENTRY pEntry)
83{
84 AssertMsg(pEntry->cRefs > 0, ("Trying to release a not referenced entry\n"));
85 ASMAtomicDecU32(&pEntry->cRefs);
86}
87
88/**
89 * Increment the reference counter of the given cache entry.
90 *
91 * @returns nothing.
92 * @param pEntry The entry to reference.
93 */
94DECLINLINE(void) pdmBlkCacheEntryRef(PPDMBLKCACHEENTRY pEntry)
95{
96 ASMAtomicIncU32(&pEntry->cRefs);
97}
98
99#ifdef VBOX_STRICT
100static void pdmBlkCacheValidate(PPDMBLKCACHEGLOBAL pCache)
101{
102 /* Amount of cached data should never exceed the maximum amount. */
103 AssertMsg(pCache->cbCached <= pCache->cbMax,
104 ("Current amount of cached data exceeds maximum\n"));
105
106 /* The amount of cached data in the LRU and FRU list should match cbCached */
107 AssertMsg(pCache->LruRecentlyUsedIn.cbCached + pCache->LruFrequentlyUsed.cbCached == pCache->cbCached,
108 ("Amount of cached data doesn't match\n"));
109
110 AssertMsg(pCache->LruRecentlyUsedOut.cbCached <= pCache->cbRecentlyUsedOutMax,
111 ("Paged out list exceeds maximum\n"));
112}
113#endif
114
115DECLINLINE(void) pdmBlkCacheLockEnter(PPDMBLKCACHEGLOBAL pCache)
116{
117 RTCritSectEnter(&pCache->CritSect);
118#ifdef VBOX_STRICT
119 pdmBlkCacheValidate(pCache);
120#endif
121}
122
123DECLINLINE(void) pdmBlkCacheLockLeave(PPDMBLKCACHEGLOBAL pCache)
124{
125#ifdef VBOX_STRICT
126 pdmBlkCacheValidate(pCache);
127#endif
128 RTCritSectLeave(&pCache->CritSect);
129}
130
131DECLINLINE(void) pdmBlkCacheSub(PPDMBLKCACHEGLOBAL pCache, uint32_t cbAmount)
132{
133 PDMACFILECACHE_IS_CRITSECT_OWNER(pCache);
134 pCache->cbCached -= cbAmount;
135}
136
137DECLINLINE(void) pdmBlkCacheAdd(PPDMBLKCACHEGLOBAL pCache, uint32_t cbAmount)
138{
139 PDMACFILECACHE_IS_CRITSECT_OWNER(pCache);
140 pCache->cbCached += cbAmount;
141}
142
143DECLINLINE(void) pdmBlkCacheListAdd(PPDMBLKLRULIST pList, uint32_t cbAmount)
144{
145 pList->cbCached += cbAmount;
146}
147
148DECLINLINE(void) pdmBlkCacheListSub(PPDMBLKLRULIST pList, uint32_t cbAmount)
149{
150 pList->cbCached -= cbAmount;
151}
152
153#ifdef PDMACFILECACHE_WITH_LRULIST_CHECKS
154/**
155 * Checks consistency of a LRU list.
156 *
157 * @returns nothing
158 * @param pList The LRU list to check.
159 * @param pNotInList Element which is not allowed to occur in the list.
160 */
161static void pdmBlkCacheCheckList(PPDMBLKLRULIST pList, PPDMBLKCACHEENTRY pNotInList)
162{
163 PPDMBLKCACHEENTRY pCurr = pList->pHead;
164
165 /* Check that there are no double entries and no cycles in the list. */
166 while (pCurr)
167 {
168 PPDMBLKCACHEENTRY pNext = pCurr->pNext;
169
170 while (pNext)
171 {
172 AssertMsg(pCurr != pNext,
173 ("Entry %#p is at least two times in list %#p or there is a cycle in the list\n",
174 pCurr, pList));
175 pNext = pNext->pNext;
176 }
177
178 AssertMsg(pCurr != pNotInList, ("Not allowed entry %#p is in list\n", pCurr));
179
180 if (!pCurr->pNext)
181 AssertMsg(pCurr == pList->pTail, ("End of list reached but last element is not list tail\n"));
182
183 pCurr = pCurr->pNext;
184 }
185}
186#endif
187
188/**
189 * Unlinks a cache entry from the LRU list it is assigned to.
190 *
191 * @returns nothing.
192 * @param pEntry The entry to unlink.
193 */
194static void pdmBlkCacheEntryRemoveFromList(PPDMBLKCACHEENTRY pEntry)
195{
196 PPDMBLKLRULIST pList = pEntry->pList;
197 PPDMBLKCACHEENTRY pPrev, pNext;
198
199 LogFlowFunc((": Deleting entry %#p from list %#p\n", pEntry, pList));
200
201 AssertPtr(pList);
202
203#ifdef PDMACFILECACHE_WITH_LRULIST_CHECKS
204 pdmBlkCacheCheckList(pList, NULL);
205#endif
206
207 pPrev = pEntry->pPrev;
208 pNext = pEntry->pNext;
209
210 AssertMsg(pEntry != pPrev, ("Entry links to itself as previous element\n"));
211 AssertMsg(pEntry != pNext, ("Entry links to itself as next element\n"));
212
213 if (pPrev)
214 pPrev->pNext = pNext;
215 else
216 {
217 pList->pHead = pNext;
218
219 if (pNext)
220 pNext->pPrev = NULL;
221 }
222
223 if (pNext)
224 pNext->pPrev = pPrev;
225 else
226 {
227 pList->pTail = pPrev;
228
229 if (pPrev)
230 pPrev->pNext = NULL;
231 }
232
233 pEntry->pList = NULL;
234 pEntry->pPrev = NULL;
235 pEntry->pNext = NULL;
236 pdmBlkCacheListSub(pList, pEntry->cbData);
237#ifdef PDMACFILECACHE_WITH_LRULIST_CHECKS
238 pdmBlkCacheCheckList(pList, pEntry);
239#endif
240}
241
242/**
243 * Adds a cache entry to the given LRU list unlinking it from the currently
244 * assigned list if needed.
245 *
246 * @returns nothing.
247 * @param pList List to the add entry to.
248 * @param pEntry Entry to add.
249 */
250static void pdmBlkCacheEntryAddToList(PPDMBLKLRULIST pList, PPDMBLKCACHEENTRY pEntry)
251{
252 LogFlowFunc((": Adding entry %#p to list %#p\n", pEntry, pList));
253#ifdef PDMACFILECACHE_WITH_LRULIST_CHECKS
254 pdmBlkCacheCheckList(pList, NULL);
255#endif
256
257 /* Remove from old list if needed */
258 if (pEntry->pList)
259 pdmBlkCacheEntryRemoveFromList(pEntry);
260
261 pEntry->pNext = pList->pHead;
262 if (pList->pHead)
263 pList->pHead->pPrev = pEntry;
264 else
265 {
266 Assert(!pList->pTail);
267 pList->pTail = pEntry;
268 }
269
270 pEntry->pPrev = NULL;
271 pList->pHead = pEntry;
272 pdmBlkCacheListAdd(pList, pEntry->cbData);
273 pEntry->pList = pList;
274#ifdef PDMACFILECACHE_WITH_LRULIST_CHECKS
275 pdmBlkCacheCheckList(pList, NULL);
276#endif
277}
278
279/**
280 * Destroys a LRU list freeing all entries.
281 *
282 * @returns nothing
283 * @param pList Pointer to the LRU list to destroy.
284 *
285 * @note The caller must own the critical section of the cache.
286 */
287static void pdmBlkCacheDestroyList(PPDMBLKLRULIST pList)
288{
289 while (pList->pHead)
290 {
291 PPDMBLKCACHEENTRY pEntry = pList->pHead;
292
293 pList->pHead = pEntry->pNext;
294
295 AssertMsg(!(pEntry->fFlags & (PDMBLKCACHE_ENTRY_IO_IN_PROGRESS | PDMBLKCACHE_ENTRY_IS_DIRTY)),
296 ("Entry is dirty and/or still in progress fFlags=%#x\n", pEntry->fFlags));
297
298 RTMemPageFree(pEntry->pbData, pEntry->cbData);
299 RTMemFree(pEntry);
300 }
301}
302
303/**
304 * Tries to remove the given amount of bytes from a given list in the cache
305 * moving the entries to one of the given ghosts lists
306 *
307 * @returns Amount of data which could be freed.
308 * @param pCache Pointer to the global cache data.
309 * @param cbData The amount of the data to free.
310 * @param pListSrc The source list to evict data from.
311 * @param pGhostListSrc The ghost list removed entries should be moved to
312 * NULL if the entry should be freed.
313 * @param fReuseBuffer Flag whether a buffer should be reused if it has the same size
314 * @param ppbBuf Where to store the address of the buffer if an entry with the
315 * same size was found and fReuseBuffer is true.
316 *
317 * @note This function may return fewer bytes than requested because entries
318 * may be marked as non evictable if they are used for I/O at the
319 * moment.
320 */
321static size_t pdmBlkCacheEvictPagesFrom(PPDMBLKCACHEGLOBAL pCache, size_t cbData,
322 PPDMBLKLRULIST pListSrc, PPDMBLKLRULIST pGhostListDst,
323 bool fReuseBuffer, uint8_t **ppbBuffer)
324{
325 size_t cbEvicted = 0;
326
327 PDMACFILECACHE_IS_CRITSECT_OWNER(pCache);
328
329 AssertMsg(cbData > 0, ("Evicting 0 bytes not possible\n"));
330 AssertMsg( !pGhostListDst
331 || (pGhostListDst == &pCache->LruRecentlyUsedOut),
332 ("Destination list must be NULL or the recently used but paged out list\n"));
333
334 if (fReuseBuffer)
335 {
336 AssertPtr(ppbBuffer);
337 *ppbBuffer = NULL;
338 }
339
340 /* Start deleting from the tail. */
341 PPDMBLKCACHEENTRY pEntry = pListSrc->pTail;
342
343 while ((cbEvicted < cbData) && pEntry)
344 {
345 PPDMBLKCACHEENTRY pCurr = pEntry;
346
347 pEntry = pEntry->pPrev;
348
349 /* We can't evict pages which are currently in progress or dirty but not in progress */
350 if ( !(pCurr->fFlags & PDMBLKCACHE_NOT_EVICTABLE)
351 && (ASMAtomicReadU32(&pCurr->cRefs) == 0))
352 {
353 /* Ok eviction candidate. Grab the endpoint semaphore and check again
354 * because somebody else might have raced us. */
355 PPDMBLKCACHE pBlkCache = pCurr->pBlkCache;
356 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
357
358 if (!(pCurr->fFlags & PDMBLKCACHE_NOT_EVICTABLE)
359 && (ASMAtomicReadU32(&pCurr->cRefs) == 0))
360 {
361 LogFlow(("Evicting entry %#p (%u bytes)\n", pCurr, pCurr->cbData));
362
363 if (fReuseBuffer && (pCurr->cbData == cbData))
364 {
365 STAM_COUNTER_INC(&pCache->StatBuffersReused);
366 *ppbBuffer = pCurr->pbData;
367 }
368 else if (pCurr->pbData)
369 RTMemPageFree(pCurr->pbData, pCurr->cbData);
370
371 pCurr->pbData = NULL;
372 cbEvicted += pCurr->cbData;
373
374 pdmBlkCacheEntryRemoveFromList(pCurr);
375 pdmBlkCacheSub(pCache, pCurr->cbData);
376
377 if (pGhostListDst)
378 {
379 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
380
381 PPDMBLKCACHEENTRY pGhostEntFree = pGhostListDst->pTail;
382
383 /* We have to remove the last entries from the paged out list. */
384 while ( ((pGhostListDst->cbCached + pCurr->cbData) > pCache->cbRecentlyUsedOutMax)
385 && pGhostEntFree)
386 {
387 PPDMBLKCACHEENTRY pFree = pGhostEntFree;
388 PPDMBLKCACHE pBlkCacheFree = pFree->pBlkCache;
389
390 pGhostEntFree = pGhostEntFree->pPrev;
391
392 RTSemRWRequestWrite(pBlkCacheFree->SemRWEntries, RT_INDEFINITE_WAIT);
393
394 if (ASMAtomicReadU32(&pFree->cRefs) == 0)
395 {
396 pdmBlkCacheEntryRemoveFromList(pFree);
397
398 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
399 RTAvlrU64Remove(pBlkCacheFree->pTree, pFree->Core.Key);
400 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
401
402 RTMemFree(pFree);
403 }
404
405 RTSemRWReleaseWrite(pBlkCacheFree->SemRWEntries);
406 }
407
408 if (pGhostListDst->cbCached + pCurr->cbData > pCache->cbRecentlyUsedOutMax)
409 {
410 /* Couldn't remove enough entries. Delete */
411 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
412 RTAvlrU64Remove(pCurr->pBlkCache->pTree, pCurr->Core.Key);
413 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
414
415 RTMemFree(pCurr);
416 }
417 else
418 pdmBlkCacheEntryAddToList(pGhostListDst, pCurr);
419 }
420 else
421 {
422 /* Delete the entry from the AVL tree it is assigned to. */
423 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
424 RTAvlrU64Remove(pCurr->pBlkCache->pTree, pCurr->Core.Key);
425 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
426
427 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
428 RTMemFree(pCurr);
429 }
430 }
431
432 }
433 else
434 LogFlow(("Entry %#p (%u bytes) is still in progress and can't be evicted\n", pCurr, pCurr->cbData));
435 }
436
437 return cbEvicted;
438}
439
440static bool pdmBlkCacheReclaim(PPDMBLKCACHEGLOBAL pCache, size_t cbData, bool fReuseBuffer, uint8_t **ppbBuffer)
441{
442 size_t cbRemoved = 0;
443
444 if ((pCache->cbCached + cbData) < pCache->cbMax)
445 return true;
446 else if ((pCache->LruRecentlyUsedIn.cbCached + cbData) > pCache->cbRecentlyUsedInMax)
447 {
448 /* Try to evict as many bytes as possible from A1in */
449 cbRemoved = pdmBlkCacheEvictPagesFrom(pCache, cbData, &pCache->LruRecentlyUsedIn,
450 &pCache->LruRecentlyUsedOut, fReuseBuffer, ppbBuffer);
451
452 /*
453 * If it was not possible to remove enough entries
454 * try the frequently accessed cache.
455 */
456 if (cbRemoved < cbData)
457 {
458 Assert(!fReuseBuffer || !*ppbBuffer); /* It is not possible that we got a buffer with the correct size but we didn't freed enough data. */
459
460 /*
461 * If we removed something we can't pass the reuse buffer flag anymore because
462 * we don't need to evict that much data
463 */
464 if (!cbRemoved)
465 cbRemoved += pdmBlkCacheEvictPagesFrom(pCache, cbData, &pCache->LruFrequentlyUsed,
466 NULL, fReuseBuffer, ppbBuffer);
467 else
468 cbRemoved += pdmBlkCacheEvictPagesFrom(pCache, cbData - cbRemoved, &pCache->LruFrequentlyUsed,
469 NULL, false, NULL);
470 }
471 }
472 else
473 {
474 /* We have to remove entries from frequently access list. */
475 cbRemoved = pdmBlkCacheEvictPagesFrom(pCache, cbData, &pCache->LruFrequentlyUsed,
476 NULL, fReuseBuffer, ppbBuffer);
477 }
478
479 LogFlowFunc((": removed %u bytes, requested %u\n", cbRemoved, cbData));
480 return (cbRemoved >= cbData);
481}
482
483DECLINLINE(int) pdmBlkCacheEnqueue(PPDMBLKCACHE pBlkCache, uint64_t off, size_t cbXfer, PPDMBLKCACHEIOXFER pIoXfer)
484{
485 int rc = VINF_SUCCESS;
486
487 LogFlowFunc(("%s: Enqueuing hIoXfer=%#p enmXferDir=%d\n",
488 __FUNCTION__, pIoXfer, pIoXfer->enmXferDir));
489
490 switch (pBlkCache->enmType)
491 {
492 case PDMBLKCACHETYPE_DEV:
493 {
494 rc = pBlkCache->u.Dev.pfnXferEnqueue(pBlkCache->u.Dev.pDevIns,
495 pIoXfer->enmXferDir,
496 off, cbXfer,
497 &pIoXfer->SgBuf, pIoXfer);
498 break;
499 }
500 case PDMBLKCACHETYPE_DRV:
501 {
502 rc = pBlkCache->u.Drv.pfnXferEnqueue(pBlkCache->u.Drv.pDrvIns,
503 pIoXfer->enmXferDir,
504 off, cbXfer,
505 &pIoXfer->SgBuf, pIoXfer);
506 break;
507 }
508 case PDMBLKCACHETYPE_USB:
509 {
510 rc = pBlkCache->u.Usb.pfnXferEnqueue(pBlkCache->u.Usb.pUsbIns,
511 pIoXfer->enmXferDir,
512 off, cbXfer,
513 &pIoXfer->SgBuf, pIoXfer);
514 break;
515 }
516 case PDMBLKCACHETYPE_INTERNAL:
517 {
518 rc = pBlkCache->u.Int.pfnXferEnqueue(pBlkCache->u.Int.pvUser,
519 pIoXfer->enmXferDir,
520 off, cbXfer,
521 &pIoXfer->SgBuf, pIoXfer);
522 break;
523 }
524 default:
525 AssertMsgFailed(("Unknown block cache type!\n"));
526 }
527
528 LogFlowFunc(("%s: returns rc=%Rrc\n", __FUNCTION__, rc));
529 return rc;
530}
531
532/**
533 * Initiates a read I/O task for the given entry.
534 *
535 * @returns VBox status code.
536 * @param pEntry The entry to fetch the data to.
537 */
538static int pdmBlkCacheEntryReadFromMedium(PPDMBLKCACHEENTRY pEntry)
539{
540 PPDMBLKCACHE pBlkCache = pEntry->pBlkCache;
541 LogFlowFunc((": Reading data into cache entry %#p\n", pEntry));
542
543 /* Make sure no one evicts the entry while it is accessed. */
544 pEntry->fFlags |= PDMBLKCACHE_ENTRY_IO_IN_PROGRESS;
545
546 PPDMBLKCACHEIOXFER pIoXfer = (PPDMBLKCACHEIOXFER)RTMemAllocZ(sizeof(PDMBLKCACHEIOXFER));
547 if (RT_UNLIKELY(!pIoXfer))
548 return VERR_NO_MEMORY;
549
550 AssertMsg(pEntry->pbData, ("Entry is in ghost state\n"));
551
552 pIoXfer->fIoCache = true;
553 pIoXfer->pEntry = pEntry;
554 pIoXfer->SgSeg.pvSeg = pEntry->pbData;
555 pIoXfer->SgSeg.cbSeg = pEntry->cbData;
556 pIoXfer->enmXferDir = PDMBLKCACHEXFERDIR_READ;
557 RTSgBufInit(&pIoXfer->SgBuf, &pIoXfer->SgSeg, 1);
558
559 return pdmBlkCacheEnqueue(pBlkCache, pEntry->Core.Key, pEntry->cbData, pIoXfer);
560}
561
562/**
563 * Initiates a write I/O task for the given entry.
564 *
565 * @returns nothing.
566 * @param pEntry The entry to read the data from.
567 */
568static int pdmBlkCacheEntryWriteToMedium(PPDMBLKCACHEENTRY pEntry)
569{
570 PPDMBLKCACHE pBlkCache = pEntry->pBlkCache;
571 LogFlowFunc((": Writing data from cache entry %#p\n", pEntry));
572
573 /* Make sure no one evicts the entry while it is accessed. */
574 pEntry->fFlags |= PDMBLKCACHE_ENTRY_IO_IN_PROGRESS;
575
576 PPDMBLKCACHEIOXFER pIoXfer = (PPDMBLKCACHEIOXFER)RTMemAllocZ(sizeof(PDMBLKCACHEIOXFER));
577 if (RT_UNLIKELY(!pIoXfer))
578 return VERR_NO_MEMORY;
579
580 AssertMsg(pEntry->pbData, ("Entry is in ghost state\n"));
581
582 pIoXfer->fIoCache = true;
583 pIoXfer->pEntry = pEntry;
584 pIoXfer->SgSeg.pvSeg = pEntry->pbData;
585 pIoXfer->SgSeg.cbSeg = pEntry->cbData;
586 pIoXfer->enmXferDir = PDMBLKCACHEXFERDIR_WRITE;
587 RTSgBufInit(&pIoXfer->SgBuf, &pIoXfer->SgSeg, 1);
588
589 return pdmBlkCacheEnqueue(pBlkCache, pEntry->Core.Key, pEntry->cbData, pIoXfer);
590}
591
592/**
593 * Passthrough a part of a request directly to the I/O manager
594 * handling the endpoint.
595 *
596 * @returns VBox status code.
597 * @param pEndpoint The endpoint.
598 * @param pTask The task.
599 * @param pIoMemCtx The I/O memory context to use.
600 * @param offStart Offset to start transfer from.
601 * @param cbData Amount of data to transfer.
602 * @param enmTransferType The transfer type (read/write)
603 */
604static int pdmBlkCacheRequestPassthrough(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEREQ pReq,
605 PRTSGBUF pSgBuf, uint64_t offStart, size_t cbData,
606 PDMBLKCACHEXFERDIR enmXferDir)
607{
608
609 PPDMBLKCACHEIOXFER pIoXfer = (PPDMBLKCACHEIOXFER)RTMemAllocZ(sizeof(PDMBLKCACHEIOXFER));
610 if (RT_UNLIKELY(!pIoXfer))
611 return VERR_NO_MEMORY;
612
613 ASMAtomicIncU32(&pReq->cXfersPending);
614 pIoXfer->fIoCache = false;
615 pIoXfer->pReq = pReq;
616 pIoXfer->enmXferDir = enmXferDir;
617 if (pSgBuf)
618 {
619 RTSgBufClone(&pIoXfer->SgBuf, pSgBuf);
620 RTSgBufAdvance(pSgBuf, cbData);
621 }
622
623 return pdmBlkCacheEnqueue(pBlkCache, offStart, cbData, pIoXfer);
624}
625
626/**
627 * Commit a single dirty entry to the endpoint
628 *
629 * @returns nothing
630 * @param pEntry The entry to commit.
631 */
632static void pdmBlkCacheEntryCommit(PPDMBLKCACHEENTRY pEntry)
633{
634 AssertMsg( (pEntry->fFlags & PDMBLKCACHE_ENTRY_IS_DIRTY)
635 && !(pEntry->fFlags & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS),
636 ("Invalid flags set for entry %#p\n", pEntry));
637
638 pdmBlkCacheEntryWriteToMedium(pEntry);
639}
640
641/**
642 * Commit all dirty entries for a single endpoint.
643 *
644 * @returns nothing.
645 * @param pBlkCache The endpoint cache to commit.
646 */
647static void pdmBlkCacheCommit(PPDMBLKCACHE pBlkCache)
648{
649 uint32_t cbCommitted = 0;
650
651 /* Return if the cache was suspended. */
652 if (pBlkCache->fSuspended)
653 return;
654
655 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
656
657 /* The list is moved to a new header to reduce locking overhead. */
658 RTLISTNODE ListDirtyNotCommitted;
659 RTSPINLOCKTMP Tmp;
660
661 RTListInit(&ListDirtyNotCommitted);
662 RTSpinlockAcquire(pBlkCache->LockList, &Tmp);
663 RTListMove(&ListDirtyNotCommitted, &pBlkCache->ListDirtyNotCommitted);
664 RTSpinlockRelease(pBlkCache->LockList, &Tmp);
665
666 if (!RTListIsEmpty(&ListDirtyNotCommitted))
667 {
668 PPDMBLKCACHEENTRY pEntry = RTListGetFirst(&ListDirtyNotCommitted, PDMBLKCACHEENTRY, NodeNotCommitted);
669
670 while (!RTListNodeIsLast(&ListDirtyNotCommitted, &pEntry->NodeNotCommitted))
671 {
672 PPDMBLKCACHEENTRY pNext = RTListNodeGetNext(&pEntry->NodeNotCommitted, PDMBLKCACHEENTRY,
673 NodeNotCommitted);
674 pdmBlkCacheEntryCommit(pEntry);
675 cbCommitted += pEntry->cbData;
676 RTListNodeRemove(&pEntry->NodeNotCommitted);
677 pEntry = pNext;
678 }
679
680 /* Commit the last endpoint */
681 Assert(RTListNodeIsLast(&ListDirtyNotCommitted, &pEntry->NodeNotCommitted));
682 pdmBlkCacheEntryCommit(pEntry);
683 RTListNodeRemove(&pEntry->NodeNotCommitted);
684 AssertMsg(RTListIsEmpty(&ListDirtyNotCommitted),
685 ("Committed all entries but list is not empty\n"));
686 }
687
688 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
689 AssertMsg(pBlkCache->pCache->cbDirty >= cbCommitted,
690 ("Number of committed bytes exceeds number of dirty bytes\n"));
691 uint32_t cbDirtyOld = ASMAtomicSubU32(&pBlkCache->pCache->cbDirty, cbCommitted);
692
693 /* Reset the commit timer if we don't have any dirty bits. */
694 if ( !(cbDirtyOld - cbCommitted)
695 && pBlkCache->pCache->u32CommitTimeoutMs != 0)
696 TMTimerStop(pBlkCache->pCache->pTimerCommit);
697}
698
699/**
700 * Commit all dirty entries in the cache.
701 *
702 * @returns nothing.
703 * @param pCache The global cache instance.
704 */
705static void pdmBlkCacheCommitDirtyEntries(PPDMBLKCACHEGLOBAL pCache)
706{
707 bool fCommitInProgress = ASMAtomicXchgBool(&pCache->fCommitInProgress, true);
708
709 if (!fCommitInProgress)
710 {
711 pdmBlkCacheLockEnter(pCache);
712 Assert(!RTListIsEmpty(&pCache->ListUsers));
713
714 PPDMBLKCACHE pBlkCache = RTListGetFirst(&pCache->ListUsers, PDMBLKCACHE, NodeCacheUser);
715 AssertPtr(pBlkCache);
716
717 while (!RTListNodeIsLast(&pCache->ListUsers, &pBlkCache->NodeCacheUser))
718 {
719 pdmBlkCacheCommit(pBlkCache);
720
721 pBlkCache = RTListNodeGetNext(&pBlkCache->NodeCacheUser, PDMBLKCACHE,
722 NodeCacheUser);
723 }
724
725 /* Commit the last endpoint */
726 Assert(RTListNodeIsLast(&pCache->ListUsers, &pBlkCache->NodeCacheUser));
727 pdmBlkCacheCommit(pBlkCache);
728
729 pdmBlkCacheLockLeave(pCache);
730 ASMAtomicWriteBool(&pCache->fCommitInProgress, false);
731 }
732}
733
734/**
735 * Adds the given entry as a dirty to the cache.
736 *
737 * @returns Flag whether the amount of dirty bytes in the cache exceeds the threshold
738 * @param pBlkCache The endpoint cache the entry belongs to.
739 * @param pEntry The entry to add.
740 */
741static bool pdmBlkCacheAddDirtyEntry(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEENTRY pEntry)
742{
743 bool fDirtyBytesExceeded = false;
744 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
745
746 /* If the commit timer is disabled we commit right away. */
747 if (pCache->u32CommitTimeoutMs == 0)
748 {
749 pEntry->fFlags |= PDMBLKCACHE_ENTRY_IS_DIRTY;
750 pdmBlkCacheEntryCommit(pEntry);
751 }
752 else if (!(pEntry->fFlags & PDMBLKCACHE_ENTRY_IS_DIRTY))
753 {
754 pEntry->fFlags |= PDMBLKCACHE_ENTRY_IS_DIRTY;
755
756 RTSPINLOCKTMP Tmp;
757 RTSpinlockAcquire(pBlkCache->LockList, &Tmp);
758 RTListAppend(&pBlkCache->ListDirtyNotCommitted, &pEntry->NodeNotCommitted);
759 RTSpinlockRelease(pBlkCache->LockList, &Tmp);
760
761 uint32_t cbDirty = ASMAtomicAddU32(&pCache->cbDirty, pEntry->cbData);
762
763 /* Prevent committing if the VM was suspended. */
764 if (RT_LIKELY(!ASMAtomicReadBool(&pCache->fIoErrorVmSuspended)))
765 fDirtyBytesExceeded = (cbDirty + pEntry->cbData >= pCache->cbCommitDirtyThreshold);
766 else if (!cbDirty && pCache->u32CommitTimeoutMs > 0)
767 {
768 /* Arm the commit timer. */
769 TMTimerSetMillies(pCache->pTimerCommit, pCache->u32CommitTimeoutMs);
770 }
771 }
772
773 return fDirtyBytesExceeded;
774}
775
776static PPDMBLKCACHE pdmR3BlkCacheFindById(PPDMBLKCACHEGLOBAL pBlkCacheGlobal, const char *pcszId)
777{
778 bool fFound = false;
779 PPDMBLKCACHE pBlkCache = NULL;
780
781 RTListForEach(&pBlkCacheGlobal->ListUsers, pBlkCache, PDMBLKCACHE, NodeCacheUser)
782 {
783 if (!RTStrCmp(pBlkCache->pszId, pcszId))
784 {
785 fFound = true;
786 break;
787 }
788 }
789
790 return fFound ? pBlkCache : NULL;
791}
792
793/**
794 * Commit timer callback.
795 */
796static void pdmBlkCacheCommitTimerCallback(PVM pVM, PTMTIMER pTimer, void *pvUser)
797{
798 PPDMBLKCACHEGLOBAL pCache = (PPDMBLKCACHEGLOBAL)pvUser;
799
800 LogFlowFunc(("Commit interval expired, commiting dirty entries\n"));
801
802 if ( ASMAtomicReadU32(&pCache->cbDirty) > 0
803 && !ASMAtomicReadBool(&pCache->fIoErrorVmSuspended))
804 pdmBlkCacheCommitDirtyEntries(pCache);
805
806 LogFlowFunc(("Entries committed, going to sleep\n"));
807}
808
809static DECLCALLBACK(int) pdmR3BlkCacheSaveExec(PVM pVM, PSSMHANDLE pSSM)
810{
811 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
812
813 AssertPtr(pBlkCacheGlobal);
814
815 pdmBlkCacheLockEnter(pBlkCacheGlobal);
816
817 SSMR3PutU32(pSSM, pBlkCacheGlobal->cRefs);
818
819 /* Go through the list and save all dirty entries. */
820 PPDMBLKCACHE pBlkCache;
821 RTListForEach(&pBlkCacheGlobal->ListUsers, pBlkCache, PDMBLKCACHE, NodeCacheUser)
822 {
823 uint32_t cEntries = 0;
824 PPDMBLKCACHEENTRY pEntry;
825
826 RTSemRWRequestRead(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
827 SSMR3PutU32(pSSM, strlen(pBlkCache->pszId));
828 SSMR3PutStrZ(pSSM, pBlkCache->pszId);
829
830 /* Count the number of entries to safe. */
831 RTListForEach(&pBlkCache->ListDirtyNotCommitted, pEntry, PDMBLKCACHEENTRY, NodeNotCommitted)
832 {
833 cEntries++;
834 }
835
836 SSMR3PutU32(pSSM, cEntries);
837
838 /* Walk the list of all dirty entries and save them. */
839 RTListForEach(&pBlkCache->ListDirtyNotCommitted, pEntry, PDMBLKCACHEENTRY, NodeNotCommitted)
840 {
841 /* A few sanity checks. */
842 AssertMsg(!pEntry->cRefs, ("The entry is still referenced\n"));
843 AssertMsg(pEntry->fFlags & PDMBLKCACHE_ENTRY_IS_DIRTY, ("Entry is not dirty\n"));
844 AssertMsg(!(pEntry->fFlags & ~PDMBLKCACHE_ENTRY_IS_DIRTY), ("Invalid flags set\n"));
845 AssertMsg(!pEntry->pWaitingHead && !pEntry->pWaitingTail, ("There are waiting requests\n"));
846 AssertMsg( pEntry->pList == &pBlkCacheGlobal->LruRecentlyUsedIn
847 || pEntry->pList == &pBlkCacheGlobal->LruFrequentlyUsed,
848 ("Invalid list\n"));
849 AssertMsg(pEntry->cbData == pEntry->Core.KeyLast - pEntry->Core.Key + 1,
850 ("Size and range do not match\n"));
851
852 /* Save */
853 SSMR3PutU64(pSSM, pEntry->Core.Key);
854 SSMR3PutU32(pSSM, pEntry->cbData);
855 SSMR3PutMem(pSSM, pEntry->pbData, pEntry->cbData);
856 }
857
858 RTSemRWReleaseRead(pBlkCache->SemRWEntries);
859 }
860
861 pdmBlkCacheLockLeave(pBlkCacheGlobal);
862
863 /* Terminator */
864 return SSMR3PutU32(pSSM, UINT32_MAX);
865}
866
867static DECLCALLBACK(int) pdmR3BlkCacheLoadExec(PVM pVM, PSSMHANDLE pSSM, uint32_t uVersion, uint32_t uPass)
868{
869 int rc = VINF_SUCCESS;
870 uint32_t cRefs;
871 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
872
873 AssertPtr(pBlkCacheGlobal);
874
875 pdmBlkCacheLockEnter(pBlkCacheGlobal);
876
877 if (uVersion != PDM_BLK_CACHE_SAVED_STATE_VERSION)
878 return VERR_SSM_UNSUPPORTED_DATA_UNIT_VERSION;
879
880 SSMR3GetU32(pSSM, &cRefs);
881
882 /*
883 * Fewer users in the saved state than in the current VM are allowed
884 * because that means that there are only new ones which don't have any saved state
885 * which can get lost.
886 * More saved entries that current ones are not allowed because this could result in
887 * lost data.
888 */
889 if (cRefs <= pBlkCacheGlobal->cRefs)
890 {
891 char *pszId = NULL;
892
893 while ( cRefs > 0
894 && RT_SUCCESS(rc))
895 {
896 PPDMBLKCACHE pBlkCache = NULL;
897 uint32_t cbId = 0;
898
899 SSMR3GetU32(pSSM, &cbId);
900 Assert(cbId > 0);
901
902 cbId++; /* Include terminator */
903 pszId = (char *)RTMemAllocZ(cbId * sizeof(char));
904 if (!pszId)
905 {
906 rc = VERR_NO_MEMORY;
907 break;
908 }
909
910 rc = SSMR3GetStrZ(pSSM, pszId, cbId);
911 AssertRC(rc);
912
913 /* Search for the block cache with the provided id. */
914 pBlkCache = pdmR3BlkCacheFindById(pBlkCacheGlobal, pszId);
915 if (!pBlkCache)
916 {
917 rc = SSMR3SetCfgError(pSSM, RT_SRC_POS,
918 N_("The VM is missing a block device. Please make sure the source and target VMs have compatible storage configurations"));
919 break;
920 }
921
922 RTStrFree(pszId);
923 pszId = NULL;
924
925 /* Get the entries */
926 uint32_t cEntries;
927 SSMR3GetU32(pSSM, &cEntries);
928
929 while (cEntries > 0)
930 {
931 PPDMBLKCACHEENTRY pEntry;
932 uint64_t off;
933 uint32_t cbEntry;
934
935 SSMR3GetU64(pSSM, &off);
936 SSMR3GetU32(pSSM, &cbEntry);
937
938 pEntry = pdmBlkCacheEntryAlloc(pBlkCache, off, cbEntry, NULL);
939 if (!pEntry)
940 {
941 rc = VERR_NO_MEMORY;
942 break;
943 }
944
945 rc = SSMR3GetMem(pSSM, pEntry->pbData, cbEntry);
946 if (RT_FAILURE(rc))
947 {
948 RTMemFree(pEntry->pbData);
949 RTMemFree(pEntry);
950 break;
951 }
952
953 /* Insert into the tree. */
954 bool fInserted = RTAvlrU64Insert(pBlkCache->pTree, &pEntry->Core);
955 Assert(fInserted);
956
957 /* Add to the dirty list. */
958 pdmBlkCacheAddDirtyEntry(pBlkCache, pEntry);
959 pdmBlkCacheEntryAddToList(&pBlkCacheGlobal->LruRecentlyUsedIn, pEntry);
960 pdmBlkCacheAdd(pBlkCacheGlobal, cbEntry);
961 pdmBlkCacheEntryRelease(pEntry);
962 cEntries--;
963 }
964
965 cRefs--;
966 }
967
968 if (pszId)
969 RTStrFree(pszId);
970 }
971 else
972 rc = SSMR3SetCfgError(pSSM, RT_SRC_POS,
973 N_("The VM is missing a block device. Please make sure the source and target VMs have compatible storage configurations"));
974
975 pdmBlkCacheLockLeave(pBlkCacheGlobal);
976
977 if (RT_SUCCESS(rc))
978 {
979 uint32_t u32 = 0;
980 rc = SSMR3GetU32(pSSM, &u32);
981 if (RT_SUCCESS(rc))
982 AssertMsgReturn(u32 == UINT32_MAX, ("%#x\n", u32), VERR_SSM_DATA_UNIT_FORMAT_CHANGED);
983 }
984
985 return rc;
986}
987
988int pdmR3BlkCacheInit(PVM pVM)
989{
990 int rc = VINF_SUCCESS;
991 PUVM pUVM = pVM->pUVM;
992 PPDMBLKCACHEGLOBAL pBlkCacheGlobal;
993
994 LogFlowFunc((": pVM=%p\n", pVM));
995
996 VM_ASSERT_EMT(pVM);
997
998 PCFGMNODE pCfgRoot = CFGMR3GetRoot(pVM);
999 PCFGMNODE pCfgBlkCache = CFGMR3GetChild(CFGMR3GetChild(pCfgRoot, "PDM"), "BlkCache");
1000
1001 pBlkCacheGlobal = (PPDMBLKCACHEGLOBAL)RTMemAllocZ(sizeof(PDMBLKCACHEGLOBAL));
1002 if (!pBlkCacheGlobal)
1003 return VERR_NO_MEMORY;
1004
1005 RTListInit(&pBlkCacheGlobal->ListUsers);
1006 pBlkCacheGlobal->pVM = pVM;
1007 pBlkCacheGlobal->cRefs = 0;
1008 pBlkCacheGlobal->cbCached = 0;
1009 pBlkCacheGlobal->fCommitInProgress = false;
1010
1011 /* Initialize members */
1012 pBlkCacheGlobal->LruRecentlyUsedIn.pHead = NULL;
1013 pBlkCacheGlobal->LruRecentlyUsedIn.pTail = NULL;
1014 pBlkCacheGlobal->LruRecentlyUsedIn.cbCached = 0;
1015
1016 pBlkCacheGlobal->LruRecentlyUsedOut.pHead = NULL;
1017 pBlkCacheGlobal->LruRecentlyUsedOut.pTail = NULL;
1018 pBlkCacheGlobal->LruRecentlyUsedOut.cbCached = 0;
1019
1020 pBlkCacheGlobal->LruFrequentlyUsed.pHead = NULL;
1021 pBlkCacheGlobal->LruFrequentlyUsed.pTail = NULL;
1022 pBlkCacheGlobal->LruFrequentlyUsed.cbCached = 0;
1023
1024 do
1025 {
1026 rc = CFGMR3QueryU32Def(pCfgBlkCache, "CacheSize", &pBlkCacheGlobal->cbMax, 5 * _1M);
1027 AssertLogRelRCBreak(rc);
1028 LogFlowFunc(("Maximum number of bytes cached %u\n", pBlkCacheGlobal->cbMax));
1029
1030 pBlkCacheGlobal->cbRecentlyUsedInMax = (pBlkCacheGlobal->cbMax / 100) * 25; /* 25% of the buffer size */
1031 pBlkCacheGlobal->cbRecentlyUsedOutMax = (pBlkCacheGlobal->cbMax / 100) * 50; /* 50% of the buffer size */
1032 LogFlowFunc(("cbRecentlyUsedInMax=%u cbRecentlyUsedOutMax=%u\n",
1033 pBlkCacheGlobal->cbRecentlyUsedInMax, pBlkCacheGlobal->cbRecentlyUsedOutMax));
1034
1035 /** @todo r=aeichner: Experiment to find optimal default values */
1036 rc = CFGMR3QueryU32Def(pCfgBlkCache, "CacheCommitIntervalMs", &pBlkCacheGlobal->u32CommitTimeoutMs, 10000 /* 10sec */);
1037 AssertLogRelRCBreak(rc);
1038 rc = CFGMR3QueryU32Def(pCfgBlkCache, "CacheCommitThreshold", &pBlkCacheGlobal->cbCommitDirtyThreshold, pBlkCacheGlobal->cbMax / 2);
1039 AssertLogRelRCBreak(rc);
1040 } while (0);
1041
1042 if (RT_SUCCESS(rc))
1043 {
1044 STAMR3Register(pVM, &pBlkCacheGlobal->cbMax,
1045 STAMTYPE_U32, STAMVISIBILITY_ALWAYS,
1046 "/PDM/BlkCache/cbMax",
1047 STAMUNIT_BYTES,
1048 "Maximum cache size");
1049 STAMR3Register(pVM, &pBlkCacheGlobal->cbCached,
1050 STAMTYPE_U32, STAMVISIBILITY_ALWAYS,
1051 "/PDM/BlkCache/cbCached",
1052 STAMUNIT_BYTES,
1053 "Currently used cache");
1054 STAMR3Register(pVM, &pBlkCacheGlobal->LruRecentlyUsedIn.cbCached,
1055 STAMTYPE_U32, STAMVISIBILITY_ALWAYS,
1056 "/PDM/BlkCache/cbCachedMruIn",
1057 STAMUNIT_BYTES,
1058 "Number of bytes cached in MRU list");
1059 STAMR3Register(pVM, &pBlkCacheGlobal->LruRecentlyUsedOut.cbCached,
1060 STAMTYPE_U32, STAMVISIBILITY_ALWAYS,
1061 "/PDM/BlkCache/cbCachedMruOut",
1062 STAMUNIT_BYTES,
1063 "Number of bytes cached in FRU list");
1064 STAMR3Register(pVM, &pBlkCacheGlobal->LruFrequentlyUsed.cbCached,
1065 STAMTYPE_U32, STAMVISIBILITY_ALWAYS,
1066 "/PDM/BlkCache/cbCachedFru",
1067 STAMUNIT_BYTES,
1068 "Number of bytes cached in FRU ghost list");
1069
1070#ifdef VBOX_WITH_STATISTICS
1071 STAMR3Register(pVM, &pBlkCacheGlobal->cHits,
1072 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1073 "/PDM/BlkCache/CacheHits",
1074 STAMUNIT_COUNT, "Number of hits in the cache");
1075 STAMR3Register(pVM, &pBlkCacheGlobal->cPartialHits,
1076 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1077 "/PDM/BlkCache/CachePartialHits",
1078 STAMUNIT_COUNT, "Number of partial hits in the cache");
1079 STAMR3Register(pVM, &pBlkCacheGlobal->cMisses,
1080 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1081 "/PDM/BlkCache/CacheMisses",
1082 STAMUNIT_COUNT, "Number of misses when accessing the cache");
1083 STAMR3Register(pVM, &pBlkCacheGlobal->StatRead,
1084 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1085 "/PDM/BlkCache/CacheRead",
1086 STAMUNIT_BYTES, "Number of bytes read from the cache");
1087 STAMR3Register(pVM, &pBlkCacheGlobal->StatWritten,
1088 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1089 "/PDM/BlkCache/CacheWritten",
1090 STAMUNIT_BYTES, "Number of bytes written to the cache");
1091 STAMR3Register(pVM, &pBlkCacheGlobal->StatTreeGet,
1092 STAMTYPE_PROFILE_ADV, STAMVISIBILITY_ALWAYS,
1093 "/PDM/BlkCache/CacheTreeGet",
1094 STAMUNIT_TICKS_PER_CALL, "Time taken to access an entry in the tree");
1095 STAMR3Register(pVM, &pBlkCacheGlobal->StatTreeInsert,
1096 STAMTYPE_PROFILE_ADV, STAMVISIBILITY_ALWAYS,
1097 "/PDM/BlkCache/CacheTreeInsert",
1098 STAMUNIT_TICKS_PER_CALL, "Time taken to insert an entry in the tree");
1099 STAMR3Register(pVM, &pBlkCacheGlobal->StatTreeRemove,
1100 STAMTYPE_PROFILE_ADV, STAMVISIBILITY_ALWAYS,
1101 "/PDM/BlkCache/CacheTreeRemove",
1102 STAMUNIT_TICKS_PER_CALL, "Time taken to remove an entry an the tree");
1103 STAMR3Register(pVM, &pBlkCacheGlobal->StatBuffersReused,
1104 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1105 "/PDM/BlkCache/CacheBuffersReused",
1106 STAMUNIT_COUNT, "Number of times a buffer could be reused");
1107#endif
1108
1109 /* Initialize the critical section */
1110 rc = RTCritSectInit(&pBlkCacheGlobal->CritSect);
1111 }
1112
1113 if (RT_SUCCESS(rc))
1114 {
1115 /* Create the commit timer */
1116 if (pBlkCacheGlobal->u32CommitTimeoutMs > 0)
1117 rc = TMR3TimerCreateInternal(pVM, TMCLOCK_REAL,
1118 pdmBlkCacheCommitTimerCallback,
1119 pBlkCacheGlobal,
1120 "BlkCache-Commit",
1121 &pBlkCacheGlobal->pTimerCommit);
1122
1123 if (RT_SUCCESS(rc))
1124 {
1125 /* Register saved state handler. */
1126 rc = SSMR3RegisterInternal(pVM, "pdmblkcache", 0, PDM_BLK_CACHE_SAVED_STATE_VERSION, pBlkCacheGlobal->cbMax,
1127 NULL, NULL, NULL,
1128 NULL, pdmR3BlkCacheSaveExec, NULL,
1129 NULL, pdmR3BlkCacheLoadExec, NULL);
1130 if (RT_SUCCESS(rc))
1131 {
1132 LogRel(("BlkCache: Cache successfully initialised. Cache size is %u bytes\n", pBlkCacheGlobal->cbMax));
1133 LogRel(("BlkCache: Cache commit interval is %u ms\n", pBlkCacheGlobal->u32CommitTimeoutMs));
1134 LogRel(("BlkCache: Cache commit threshold is %u bytes\n", pBlkCacheGlobal->cbCommitDirtyThreshold));
1135 pUVM->pdm.s.pBlkCacheGlobal = pBlkCacheGlobal;
1136 return VINF_SUCCESS;
1137 }
1138 }
1139
1140 RTCritSectDelete(&pBlkCacheGlobal->CritSect);
1141 }
1142
1143 if (pBlkCacheGlobal)
1144 RTMemFree(pBlkCacheGlobal);
1145
1146 LogFlowFunc((": returns rc=%Rrc\n", pVM, rc));
1147 return rc;
1148}
1149
1150void pdmR3BlkCacheTerm(PVM pVM)
1151{
1152 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
1153
1154 if (pBlkCacheGlobal)
1155 {
1156 /* Make sure no one else uses the cache now */
1157 pdmBlkCacheLockEnter(pBlkCacheGlobal);
1158
1159 /* Cleanup deleting all cache entries waiting for in progress entries to finish. */
1160 pdmBlkCacheDestroyList(&pBlkCacheGlobal->LruRecentlyUsedIn);
1161 pdmBlkCacheDestroyList(&pBlkCacheGlobal->LruRecentlyUsedOut);
1162 pdmBlkCacheDestroyList(&pBlkCacheGlobal->LruFrequentlyUsed);
1163
1164 pdmBlkCacheLockLeave(pBlkCacheGlobal);
1165
1166 RTCritSectDelete(&pBlkCacheGlobal->CritSect);
1167 RTMemFree(pBlkCacheGlobal);
1168 pVM->pUVM->pdm.s.pBlkCacheGlobal = NULL;
1169 }
1170}
1171
1172int pdmR3BlkCacheResume(PVM pVM)
1173{
1174 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
1175
1176 LogFlowFunc(("pVM=%#p\n", pVM));
1177
1178 if ( pBlkCacheGlobal
1179 && ASMAtomicXchgBool(&pBlkCacheGlobal->fIoErrorVmSuspended, false))
1180 {
1181 /* The VM was suspended because of an I/O error, commit all dirty entries. */
1182 pdmBlkCacheCommitDirtyEntries(pBlkCacheGlobal);
1183 }
1184
1185 return VINF_SUCCESS;
1186}
1187
1188static int pdmR3BlkCacheRetain(PVM pVM, PPPDMBLKCACHE ppBlkCache, const char *pcszId)
1189{
1190 int rc = VINF_SUCCESS;
1191 PPDMBLKCACHE pBlkCache = NULL;
1192 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
1193
1194 if (!pBlkCacheGlobal)
1195 return VERR_NOT_SUPPORTED;
1196
1197 /*
1198 * Check that no other user cache has the same id first,
1199 * Unique id's are necessary in case the state is saved.
1200 */
1201 pdmBlkCacheLockEnter(pBlkCacheGlobal);
1202
1203 pBlkCache = pdmR3BlkCacheFindById(pBlkCacheGlobal, pcszId);
1204
1205 if (!pBlkCache)
1206 {
1207 pBlkCache = (PPDMBLKCACHE)RTMemAllocZ(sizeof(PDMBLKCACHE));
1208
1209 if (pBlkCache)
1210 pBlkCache->pszId = RTStrDup(pcszId);
1211
1212 if ( pBlkCache
1213 && pBlkCache->pszId)
1214 {
1215 pBlkCache->fSuspended = false;
1216 pBlkCache->pCache = pBlkCacheGlobal;
1217 RTListInit(&pBlkCache->ListDirtyNotCommitted);
1218
1219 rc = RTSpinlockCreate(&pBlkCache->LockList);
1220 if (RT_SUCCESS(rc))
1221 {
1222 rc = RTSemRWCreate(&pBlkCache->SemRWEntries);
1223 if (RT_SUCCESS(rc))
1224 {
1225 pBlkCache->pTree = (PAVLRU64TREE)RTMemAllocZ(sizeof(AVLRFOFFTREE));
1226 if (pBlkCache->pTree)
1227 {
1228#ifdef VBOX_WITH_STATISTICS
1229 STAMR3RegisterF(pBlkCacheGlobal->pVM, &pBlkCache->StatWriteDeferred,
1230 STAMTYPE_COUNTER, STAMVISIBILITY_ALWAYS,
1231 STAMUNIT_COUNT, "Number of deferred writes",
1232 "/PDM/BlkCache/%s/Cache/DeferredWrites", pBlkCache->pszId);
1233#endif
1234
1235 /* Add to the list of users. */
1236 pBlkCacheGlobal->cRefs++;
1237 RTListAppend(&pBlkCacheGlobal->ListUsers, &pBlkCache->NodeCacheUser);
1238 pdmBlkCacheLockLeave(pBlkCacheGlobal);
1239
1240 *ppBlkCache = pBlkCache;
1241 LogFlowFunc(("returns success\n"));
1242 return VINF_SUCCESS;
1243 }
1244 else
1245 rc = VERR_NO_MEMORY;
1246
1247 RTSemRWDestroy(pBlkCache->SemRWEntries);
1248 }
1249
1250 RTSpinlockDestroy(pBlkCache->LockList);
1251 }
1252
1253 RTStrFree(pBlkCache->pszId);
1254 }
1255 else
1256 rc = VERR_NO_MEMORY;
1257
1258 if (pBlkCache)
1259 RTMemFree(pBlkCache);
1260 }
1261 else
1262 rc = VERR_ALREADY_EXISTS;
1263
1264 pdmBlkCacheLockLeave(pBlkCacheGlobal);
1265
1266 LogFlowFunc(("Leave rc=%Rrc\n", rc));
1267 return rc;
1268}
1269
1270VMMR3DECL(int) PDMR3BlkCacheRetainDriver(PVM pVM, PPDMDRVINS pDrvIns, PPPDMBLKCACHE ppBlkCache,
1271 PFNPDMBLKCACHEXFERCOMPLETEDRV pfnXferComplete,
1272 PFNPDMBLKCACHEXFERENQUEUEDRV pfnXferEnqueue,
1273 PFNPDMBLKCACHEXFERENQUEUEDISCARDDRV pfnXferEnqueueDiscard,
1274 const char *pcszId)
1275{
1276 int rc = VINF_SUCCESS;
1277 PPDMBLKCACHE pBlkCache;
1278
1279 rc = pdmR3BlkCacheRetain(pVM, &pBlkCache, pcszId);
1280 if (RT_SUCCESS(rc))
1281 {
1282 pBlkCache->enmType = PDMBLKCACHETYPE_DRV;
1283 pBlkCache->u.Drv.pfnXferComplete = pfnXferComplete;
1284 pBlkCache->u.Drv.pfnXferEnqueue = pfnXferEnqueue;
1285 pBlkCache->u.Drv.pfnXferEnqueueDiscard = pfnXferEnqueueDiscard;
1286 pBlkCache->u.Drv.pDrvIns = pDrvIns;
1287 *ppBlkCache = pBlkCache;
1288 }
1289
1290 LogFlowFunc(("Leave rc=%Rrc\n", rc));
1291 return rc;
1292}
1293
1294VMMR3DECL(int) PDMR3BlkCacheRetainDevice(PVM pVM, PPDMDEVINS pDevIns, PPPDMBLKCACHE ppBlkCache,
1295 PFNPDMBLKCACHEXFERCOMPLETEDEV pfnXferComplete,
1296 PFNPDMBLKCACHEXFERENQUEUEDEV pfnXferEnqueue,
1297 PFNPDMBLKCACHEXFERENQUEUEDISCARDDEV pfnXferEnqueueDiscard,
1298 const char *pcszId)
1299{
1300 int rc = VINF_SUCCESS;
1301 PPDMBLKCACHE pBlkCache;
1302
1303 rc = pdmR3BlkCacheRetain(pVM, &pBlkCache, pcszId);
1304 if (RT_SUCCESS(rc))
1305 {
1306 pBlkCache->enmType = PDMBLKCACHETYPE_DEV;
1307 pBlkCache->u.Dev.pfnXferComplete = pfnXferComplete;
1308 pBlkCache->u.Dev.pfnXferEnqueue = pfnXferEnqueue;
1309 pBlkCache->u.Dev.pfnXferEnqueueDiscard = pfnXferEnqueueDiscard;
1310 pBlkCache->u.Dev.pDevIns = pDevIns;
1311 *ppBlkCache = pBlkCache;
1312 }
1313
1314 LogFlowFunc(("Leave rc=%Rrc\n", rc));
1315 return rc;
1316
1317}
1318
1319VMMR3DECL(int) PDMR3BlkCacheRetainUsb(PVM pVM, PPDMUSBINS pUsbIns, PPPDMBLKCACHE ppBlkCache,
1320 PFNPDMBLKCACHEXFERCOMPLETEUSB pfnXferComplete,
1321 PFNPDMBLKCACHEXFERENQUEUEUSB pfnXferEnqueue,
1322 PFNPDMBLKCACHEXFERENQUEUEDISCARDUSB pfnXferEnqueueDiscard,
1323 const char *pcszId)
1324{
1325 int rc = VINF_SUCCESS;
1326 PPDMBLKCACHE pBlkCache;
1327
1328 rc = pdmR3BlkCacheRetain(pVM, &pBlkCache, pcszId);
1329 if (RT_SUCCESS(rc))
1330 {
1331 pBlkCache->enmType = PDMBLKCACHETYPE_USB;
1332 pBlkCache->u.Usb.pfnXferComplete = pfnXferComplete;
1333 pBlkCache->u.Usb.pfnXferEnqueue = pfnXferEnqueue;
1334 pBlkCache->u.Usb.pfnXferEnqueueDiscard = pfnXferEnqueueDiscard;
1335 pBlkCache->u.Usb.pUsbIns = pUsbIns;
1336 *ppBlkCache = pBlkCache;
1337 }
1338
1339 LogFlowFunc(("Leave rc=%Rrc\n", rc));
1340 return rc;
1341
1342}
1343
1344VMMR3DECL(int) PDMR3BlkCacheRetainInt(PVM pVM, void *pvUser, PPPDMBLKCACHE ppBlkCache,
1345 PFNPDMBLKCACHEXFERCOMPLETEINT pfnXferComplete,
1346 PFNPDMBLKCACHEXFERENQUEUEINT pfnXferEnqueue,
1347 PFNPDMBLKCACHEXFERENQUEUEDISCARDINT pfnXferEnqueueDiscard,
1348 const char *pcszId)
1349{
1350 int rc = VINF_SUCCESS;
1351 PPDMBLKCACHE pBlkCache;
1352
1353 rc = pdmR3BlkCacheRetain(pVM, &pBlkCache, pcszId);
1354 if (RT_SUCCESS(rc))
1355 {
1356 pBlkCache->enmType = PDMBLKCACHETYPE_INTERNAL;
1357 pBlkCache->u.Int.pfnXferComplete = pfnXferComplete;
1358 pBlkCache->u.Int.pfnXferEnqueue = pfnXferEnqueue;
1359 pBlkCache->u.Int.pfnXferEnqueueDiscard = pfnXferEnqueueDiscard;
1360 pBlkCache->u.Int.pvUser = pvUser;
1361 *ppBlkCache = pBlkCache;
1362 }
1363
1364 LogFlowFunc(("Leave rc=%Rrc\n", rc));
1365 return rc;
1366
1367}
1368
1369/**
1370 * Callback for the AVL destroy routine. Frees a cache entry for this endpoint.
1371 *
1372 * @returns IPRT status code.
1373 * @param pNode The node to destroy.
1374 * @param pvUser Opaque user data.
1375 */
1376static int pdmBlkCacheEntryDestroy(PAVLRU64NODECORE pNode, void *pvUser)
1377{
1378 PPDMBLKCACHEENTRY pEntry = (PPDMBLKCACHEENTRY)pNode;
1379 PPDMBLKCACHEGLOBAL pCache = (PPDMBLKCACHEGLOBAL)pvUser;
1380 PPDMBLKCACHE pBlkCache = pEntry->pBlkCache;
1381
1382 while (ASMAtomicReadU32(&pEntry->fFlags) & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS)
1383 {
1384 /* Leave the locks to let the I/O thread make progress but reference the entry to prevent eviction. */
1385 pdmBlkCacheEntryRef(pEntry);
1386 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
1387 pdmBlkCacheLockLeave(pCache);
1388
1389 RTThreadSleep(250);
1390
1391 /* Re-enter all locks */
1392 pdmBlkCacheLockEnter(pCache);
1393 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
1394 pdmBlkCacheEntryRelease(pEntry);
1395 }
1396
1397 AssertMsg(!(pEntry->fFlags & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS),
1398 ("Entry is dirty and/or still in progress fFlags=%#x\n", pEntry->fFlags));
1399
1400 bool fUpdateCache = pEntry->pList == &pCache->LruFrequentlyUsed
1401 || pEntry->pList == &pCache->LruRecentlyUsedIn;
1402
1403 pdmBlkCacheEntryRemoveFromList(pEntry);
1404
1405 if (fUpdateCache)
1406 pdmBlkCacheSub(pCache, pEntry->cbData);
1407
1408 RTMemPageFree(pEntry->pbData, pEntry->cbData);
1409 RTMemFree(pEntry);
1410
1411 return VINF_SUCCESS;
1412}
1413
1414/**
1415 * Destroys all cache resources used by the given endpoint.
1416 *
1417 * @returns nothing.
1418 * @param pEndpoint The endpoint to the destroy.
1419 */
1420VMMR3DECL(void) PDMR3BlkCacheRelease(PPDMBLKCACHE pBlkCache)
1421{
1422 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
1423
1424 /*
1425 * Commit all dirty entries now (they are waited on for completion during the
1426 * destruction of the AVL tree below).
1427 * The exception is if the VM was paused because of an I/O error before.
1428 */
1429 if (!ASMAtomicReadBool(&pCache->fIoErrorVmSuspended))
1430 pdmBlkCacheCommit(pBlkCache);
1431
1432 /* Make sure nobody is accessing the cache while we delete the tree. */
1433 pdmBlkCacheLockEnter(pCache);
1434 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
1435 RTAvlrU64Destroy(pBlkCache->pTree, pdmBlkCacheEntryDestroy, pCache);
1436 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
1437
1438 RTSpinlockDestroy(pBlkCache->LockList);
1439
1440 pCache->cRefs--;
1441 RTListNodeRemove(&pBlkCache->NodeCacheUser);
1442
1443 pdmBlkCacheLockLeave(pCache);
1444
1445 RTSemRWDestroy(pBlkCache->SemRWEntries);
1446
1447#ifdef VBOX_WITH_STATISTICS
1448 STAMR3Deregister(pCache->pVM, &pBlkCache->StatWriteDeferred);
1449#endif
1450
1451 RTStrFree(pBlkCache->pszId);
1452 RTMemFree(pBlkCache);
1453}
1454
1455VMMR3DECL(void) PDMR3BlkCacheReleaseDevice(PVM pVM, PPDMDEVINS pDevIns)
1456{
1457 LogFlow(("%s: pDevIns=%p\n", __FUNCTION__, pDevIns));
1458
1459 /*
1460 * Validate input.
1461 */
1462 if (!pDevIns)
1463 return;
1464 VM_ASSERT_EMT(pVM);
1465
1466 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
1467 PPDMBLKCACHE pBlkCache, pBlkCacheNext;
1468
1469 /* Return silently if not supported. */
1470 if (!pBlkCacheGlobal)
1471 return;
1472
1473 pdmBlkCacheLockEnter(pBlkCacheGlobal);
1474
1475 RTListForEachSafe(&pBlkCacheGlobal->ListUsers, pBlkCache, pBlkCacheNext, PDMBLKCACHE, NodeCacheUser)
1476 {
1477 if ( pBlkCache->enmType == PDMBLKCACHETYPE_DEV
1478 && pBlkCache->u.Dev.pDevIns == pDevIns)
1479 PDMR3BlkCacheRelease(pBlkCache);
1480 }
1481
1482 pdmBlkCacheLockLeave(pBlkCacheGlobal);
1483}
1484
1485VMMR3DECL(void) PDMR3BlkCacheReleaseDriver(PVM pVM, PPDMDRVINS pDrvIns)
1486{
1487 LogFlow(("%s: pDrvIns=%p\n", __FUNCTION__, pDrvIns));
1488
1489 /*
1490 * Validate input.
1491 */
1492 if (!pDrvIns)
1493 return;
1494 VM_ASSERT_EMT(pVM);
1495
1496 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
1497 PPDMBLKCACHE pBlkCache, pBlkCacheNext;
1498
1499 /* Return silently if not supported. */
1500 if (!pBlkCacheGlobal)
1501 return;
1502
1503 pdmBlkCacheLockEnter(pBlkCacheGlobal);
1504
1505 RTListForEachSafe(&pBlkCacheGlobal->ListUsers, pBlkCache, pBlkCacheNext, PDMBLKCACHE, NodeCacheUser)
1506 {
1507 if ( pBlkCache->enmType == PDMBLKCACHETYPE_DRV
1508 && pBlkCache->u.Drv.pDrvIns == pDrvIns)
1509 PDMR3BlkCacheRelease(pBlkCache);
1510 }
1511
1512 pdmBlkCacheLockLeave(pBlkCacheGlobal);
1513}
1514
1515VMMR3DECL(void) PDMR3BlkCacheReleaseUsb(PVM pVM, PPDMUSBINS pUsbIns)
1516{
1517 LogFlow(("%s: pUsbIns=%p\n", __FUNCTION__, pUsbIns));
1518
1519 /*
1520 * Validate input.
1521 */
1522 if (!pUsbIns)
1523 return;
1524 VM_ASSERT_EMT(pVM);
1525
1526 PPDMBLKCACHEGLOBAL pBlkCacheGlobal = pVM->pUVM->pdm.s.pBlkCacheGlobal;
1527 PPDMBLKCACHE pBlkCache, pBlkCacheNext;
1528
1529 /* Return silently if not supported. */
1530 if (!pBlkCacheGlobal)
1531 return;
1532
1533 pdmBlkCacheLockEnter(pBlkCacheGlobal);
1534
1535 RTListForEachSafe(&pBlkCacheGlobal->ListUsers, pBlkCache, pBlkCacheNext, PDMBLKCACHE, NodeCacheUser)
1536 {
1537 if ( pBlkCache->enmType == PDMBLKCACHETYPE_USB
1538 && pBlkCache->u.Usb.pUsbIns == pUsbIns)
1539 PDMR3BlkCacheRelease(pBlkCache);
1540 }
1541
1542 pdmBlkCacheLockLeave(pBlkCacheGlobal);
1543}
1544
1545static PPDMBLKCACHEENTRY pdmBlkCacheGetCacheEntryByOffset(PPDMBLKCACHE pBlkCache, uint64_t off)
1546{
1547 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
1548 PPDMBLKCACHEENTRY pEntry = NULL;
1549
1550 STAM_PROFILE_ADV_START(&pCache->StatTreeGet, Cache);
1551
1552 RTSemRWRequestRead(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
1553 pEntry = (PPDMBLKCACHEENTRY)RTAvlrU64RangeGet(pBlkCache->pTree, off);
1554 if (pEntry)
1555 pdmBlkCacheEntryRef(pEntry);
1556 RTSemRWReleaseRead(pBlkCache->SemRWEntries);
1557
1558 STAM_PROFILE_ADV_STOP(&pCache->StatTreeGet, Cache);
1559
1560 return pEntry;
1561}
1562
1563/**
1564 * Return the best fit cache entries for the given offset.
1565 *
1566 * @returns nothing.
1567 * @param pBlkCache The endpoint cache.
1568 * @param off The offset.
1569 * @param pEntryAbove Where to store the pointer to the best fit entry above the
1570 * the given offset. NULL if not required.
1571 */
1572static void pdmBlkCacheGetCacheBestFitEntryByOffset(PPDMBLKCACHE pBlkCache, uint64_t off,
1573 PPDMBLKCACHEENTRY *ppEntryAbove)
1574{
1575 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
1576
1577 STAM_PROFILE_ADV_START(&pCache->StatTreeGet, Cache);
1578
1579 RTSemRWRequestRead(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
1580 if (ppEntryAbove)
1581 {
1582 *ppEntryAbove = (PPDMBLKCACHEENTRY)RTAvlrU64GetBestFit(pBlkCache->pTree, off, true /*fAbove*/);
1583 if (*ppEntryAbove)
1584 pdmBlkCacheEntryRef(*ppEntryAbove);
1585 }
1586
1587 RTSemRWReleaseRead(pBlkCache->SemRWEntries);
1588
1589 STAM_PROFILE_ADV_STOP(&pCache->StatTreeGet, Cache);
1590}
1591
1592static void pdmBlkCacheInsertEntry(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEENTRY pEntry)
1593{
1594 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
1595
1596 STAM_PROFILE_ADV_START(&pCache->StatTreeInsert, Cache);
1597 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
1598 bool fInserted = RTAvlrU64Insert(pBlkCache->pTree, &pEntry->Core);
1599 AssertMsg(fInserted, ("Node was not inserted into tree\n"));
1600 STAM_PROFILE_ADV_STOP(&pCache->StatTreeInsert, Cache);
1601 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
1602}
1603
1604/**
1605 * Allocates and initializes a new entry for the cache.
1606 * The entry has a reference count of 1.
1607 *
1608 * @returns Pointer to the new cache entry or NULL if out of memory.
1609 * @param pBlkCache The cache the entry belongs to.
1610 * @param off Start offset.
1611 * @param cbData Size of the cache entry.
1612 * @param pbBuffer Pointer to the buffer to use.
1613 * NULL if a new buffer should be allocated.
1614 * The buffer needs to have the same size of the entry.
1615 */
1616static PPDMBLKCACHEENTRY pdmBlkCacheEntryAlloc(PPDMBLKCACHE pBlkCache,
1617 uint64_t off, size_t cbData, uint8_t *pbBuffer)
1618{
1619 PPDMBLKCACHEENTRY pEntryNew = (PPDMBLKCACHEENTRY)RTMemAllocZ(sizeof(PDMBLKCACHEENTRY));
1620
1621 if (RT_UNLIKELY(!pEntryNew))
1622 return NULL;
1623
1624 pEntryNew->Core.Key = off;
1625 pEntryNew->Core.KeyLast = off + cbData - 1;
1626 pEntryNew->pBlkCache = pBlkCache;
1627 pEntryNew->fFlags = 0;
1628 pEntryNew->cRefs = 1; /* We are using it now. */
1629 pEntryNew->pList = NULL;
1630 pEntryNew->cbData = cbData;
1631 pEntryNew->pWaitingHead = NULL;
1632 pEntryNew->pWaitingTail = NULL;
1633 if (pbBuffer)
1634 pEntryNew->pbData = pbBuffer;
1635 else
1636 pEntryNew->pbData = (uint8_t *)RTMemPageAlloc(cbData);
1637
1638 if (RT_UNLIKELY(!pEntryNew->pbData))
1639 {
1640 RTMemFree(pEntryNew);
1641 return NULL;
1642 }
1643
1644 return pEntryNew;
1645}
1646
1647/**
1648 * Checks that a set of flags is set/clear acquiring the R/W semaphore
1649 * in exclusive mode.
1650 *
1651 * @returns true if the flag in fSet is set and the one in fClear is clear.
1652 * false otherwise.
1653 * The R/W semaphore is only held if true is returned.
1654 *
1655 * @param pBlkCache The endpoint cache instance data.
1656 * @param pEntry The entry to check the flags for.
1657 * @param fSet The flag which is tested to be set.
1658 * @param fClear The flag which is tested to be clear.
1659 */
1660DECLINLINE(bool) pdmBlkCacheEntryFlagIsSetClearAcquireLock(PPDMBLKCACHE pBlkCache,
1661 PPDMBLKCACHEENTRY pEntry,
1662 uint32_t fSet, uint32_t fClear)
1663{
1664 uint32_t fFlags = ASMAtomicReadU32(&pEntry->fFlags);
1665 bool fPassed = ((fFlags & fSet) && !(fFlags & fClear));
1666
1667 if (fPassed)
1668 {
1669 /* Acquire the lock and check again because the completion callback might have raced us. */
1670 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
1671
1672 fFlags = ASMAtomicReadU32(&pEntry->fFlags);
1673 fPassed = ((fFlags & fSet) && !(fFlags & fClear));
1674
1675 /* Drop the lock if we didn't passed the test. */
1676 if (!fPassed)
1677 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
1678 }
1679
1680 return fPassed;
1681}
1682
1683/**
1684 * Adds a segment to the waiting list for a cache entry
1685 * which is currently in progress.
1686 *
1687 * @returns nothing.
1688 * @param pEntry The cache entry to add the segment to.
1689 * @param pSeg The segment to add.
1690 */
1691DECLINLINE(void) pdmBlkCacheEntryAddWaiter(PPDMBLKCACHEENTRY pEntry,
1692 PPDMBLKCACHEWAITER pWaiter)
1693{
1694 pWaiter->pNext = NULL;
1695
1696 if (pEntry->pWaitingHead)
1697 {
1698 AssertPtr(pEntry->pWaitingTail);
1699
1700 pEntry->pWaitingTail->pNext = pWaiter;
1701 pEntry->pWaitingTail = pWaiter;
1702 }
1703 else
1704 {
1705 Assert(!pEntry->pWaitingTail);
1706
1707 pEntry->pWaitingHead = pWaiter;
1708 pEntry->pWaitingTail = pWaiter;
1709 }
1710}
1711
1712/**
1713 * Add a buffer described by the I/O memory context
1714 * to the entry waiting for completion.
1715 *
1716 * @returns VBox status code.
1717 * @param pEntry The entry to add the buffer to.
1718 * @param pTask Task associated with the buffer.
1719 * @param pIoMemCtx The memory context to use.
1720 * @param offDiff Offset from the start of the buffer
1721 * in the entry.
1722 * @param cbData Amount of data to wait for onthis entry.
1723 * @param fWrite Flag whether the task waits because it wants to write
1724 * to the cache entry.
1725 */
1726static int pdmBlkCacheEntryWaitersAdd(PPDMBLKCACHEENTRY pEntry,
1727 PPDMBLKCACHEREQ pReq,
1728 PRTSGBUF pSgBuf, uint64_t offDiff,
1729 size_t cbData, bool fWrite)
1730{
1731 PPDMBLKCACHEWAITER pWaiter = (PPDMBLKCACHEWAITER)RTMemAllocZ(sizeof(PDMBLKCACHEWAITER));
1732 if (!pWaiter)
1733 return VERR_NO_MEMORY;
1734
1735 ASMAtomicIncU32(&pReq->cXfersPending);
1736 pWaiter->pReq = pReq;
1737 pWaiter->offCacheEntry = offDiff;
1738 pWaiter->cbTransfer = cbData;
1739 pWaiter->fWrite = fWrite;
1740 RTSgBufClone(&pWaiter->SgBuf, pSgBuf);
1741 RTSgBufAdvance(pSgBuf, cbData);
1742
1743 pdmBlkCacheEntryAddWaiter(pEntry, pWaiter);
1744
1745 return VINF_SUCCESS;
1746}
1747
1748/**
1749 * Calculate aligned offset and size for a new cache entry
1750 * which do not intersect with an already existing entry and the
1751 * file end.
1752 *
1753 * @returns The number of bytes the entry can hold of the requested amount
1754 * of byte.
1755 * @param pEndpoint The endpoint.
1756 * @param pBlkCache The endpoint cache.
1757 * @param off The start offset.
1758 * @param cb The number of bytes the entry needs to hold at least.
1759 * @param uAlignment Alignment of the boundary sizes.
1760 * @param poffAligned Where to store the aligned offset.
1761 * @param pcbAligned Where to store the aligned size of the entry.
1762 */
1763static size_t pdmBlkCacheEntryBoundariesCalc(PPDMBLKCACHE pBlkCache,
1764 uint64_t off, size_t cb,
1765 unsigned uAlignment,
1766 uint64_t *poffAligned, size_t *pcbAligned)
1767{
1768 size_t cbAligned;
1769 size_t cbInEntry = 0;
1770 uint64_t offAligned;
1771 PPDMBLKCACHEENTRY pEntryAbove = NULL;
1772
1773 /* Get the best fit entries around the offset */
1774 pdmBlkCacheGetCacheBestFitEntryByOffset(pBlkCache, off, &pEntryAbove);
1775
1776 /* Log the info */
1777 LogFlow(("%sest fit entry above off=%llu (BestFit=%llu BestFitEnd=%llu BestFitSize=%u)\n",
1778 pEntryAbove ? "B" : "No b",
1779 off,
1780 pEntryAbove ? pEntryAbove->Core.Key : 0,
1781 pEntryAbove ? pEntryAbove->Core.KeyLast : 0,
1782 pEntryAbove ? pEntryAbove->cbData : 0));
1783
1784 offAligned = off;
1785
1786 if ( pEntryAbove
1787 && off + cb > pEntryAbove->Core.Key)
1788 {
1789 cbInEntry = pEntryAbove->Core.Key - off;
1790 cbAligned = pEntryAbove->Core.Key - offAligned;
1791 }
1792 else
1793 {
1794 cbAligned = cb;
1795 cbInEntry = cb;
1796 }
1797
1798 /* A few sanity checks */
1799 AssertMsg(!pEntryAbove || (offAligned + cbAligned) <= pEntryAbove->Core.Key,
1800 ("Aligned size intersects with another cache entry\n"));
1801 Assert(cbInEntry <= cbAligned);
1802
1803 if (pEntryAbove)
1804 pdmBlkCacheEntryRelease(pEntryAbove);
1805
1806 LogFlow(("offAligned=%llu cbAligned=%u\n", offAligned, cbAligned));
1807
1808 *poffAligned = offAligned;
1809 *pcbAligned = cbAligned;
1810
1811 return cbInEntry;
1812}
1813
1814/**
1815 * Create a new cache entry evicting data from the cache if required.
1816 *
1817 * @returns Pointer to the new cache entry or NULL
1818 * if not enough bytes could be evicted from the cache.
1819 * @param pEndpoint The endpoint.
1820 * @param pBlkCache The endpoint cache.
1821 * @param off The offset.
1822 * @param cb Number of bytes the cache entry should have.
1823 * @param uAlignment Alignment the size of the entry should have.
1824 * @param pcbData Where to store the number of bytes the new
1825 * entry can hold. May be lower than actually requested
1826 * due to another entry intersecting the access range.
1827 */
1828static PPDMBLKCACHEENTRY pdmBlkCacheEntryCreate(PPDMBLKCACHE pBlkCache,
1829 uint64_t off, size_t cb,
1830 unsigned uAlignment,
1831 size_t *pcbData)
1832{
1833 uint64_t offStart = 0;
1834 size_t cbEntry = 0;
1835 PPDMBLKCACHEENTRY pEntryNew = NULL;
1836 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
1837 uint8_t *pbBuffer = NULL;
1838
1839 *pcbData = pdmBlkCacheEntryBoundariesCalc(pBlkCache, off, cb, uAlignment,
1840 &offStart, &cbEntry);
1841
1842 pdmBlkCacheLockEnter(pCache);
1843 bool fEnough = pdmBlkCacheReclaim(pCache, cbEntry, true, &pbBuffer);
1844
1845 if (fEnough)
1846 {
1847 LogFlow(("Evicted enough bytes (%u requested). Creating new cache entry\n", cbEntry));
1848
1849 pEntryNew = pdmBlkCacheEntryAlloc(pBlkCache, offStart, cbEntry, pbBuffer);
1850 if (RT_LIKELY(pEntryNew))
1851 {
1852 pdmBlkCacheEntryAddToList(&pCache->LruRecentlyUsedIn, pEntryNew);
1853 pdmBlkCacheAdd(pCache, cbEntry);
1854 pdmBlkCacheLockLeave(pCache);
1855
1856 pdmBlkCacheInsertEntry(pBlkCache, pEntryNew);
1857
1858 AssertMsg( (off >= pEntryNew->Core.Key)
1859 && (off + *pcbData <= pEntryNew->Core.KeyLast + 1),
1860 ("Overflow in calculation off=%llu OffsetAligned=%llu\n",
1861 off, pEntryNew->Core.Key));
1862 }
1863 else
1864 pdmBlkCacheLockLeave(pCache);
1865 }
1866 else
1867 pdmBlkCacheLockLeave(pCache);
1868
1869 return pEntryNew;
1870}
1871
1872static PPDMBLKCACHEREQ pdmBlkCacheReqAlloc(void *pvUser)
1873{
1874 PPDMBLKCACHEREQ pReq = (PPDMBLKCACHEREQ)RTMemAlloc(sizeof(PDMBLKCACHEREQ));
1875
1876 if (RT_LIKELY(pReq))
1877 {
1878 pReq->pvUser = pvUser;
1879 pReq->rcReq = VINF_SUCCESS;
1880 pReq->cXfersPending = 0;
1881 }
1882
1883 return pReq;
1884}
1885
1886static void pdmBlkCacheReqComplete(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEREQ pReq)
1887{
1888 switch (pBlkCache->enmType)
1889 {
1890 case PDMBLKCACHETYPE_DEV:
1891 {
1892 pBlkCache->u.Dev.pfnXferComplete(pBlkCache->u.Dev.pDevIns,
1893 pReq->pvUser, pReq->rcReq);
1894 break;
1895 }
1896 case PDMBLKCACHETYPE_DRV:
1897 {
1898 pBlkCache->u.Drv.pfnXferComplete(pBlkCache->u.Drv.pDrvIns,
1899 pReq->pvUser, pReq->rcReq);
1900 break;
1901 }
1902 case PDMBLKCACHETYPE_USB:
1903 {
1904 pBlkCache->u.Usb.pfnXferComplete(pBlkCache->u.Usb.pUsbIns,
1905 pReq->pvUser, pReq->rcReq);
1906 break;
1907 }
1908 case PDMBLKCACHETYPE_INTERNAL:
1909 {
1910 pBlkCache->u.Int.pfnXferComplete(pBlkCache->u.Int.pvUser,
1911 pReq->pvUser, pReq->rcReq);
1912 break;
1913 }
1914 default:
1915 AssertMsgFailed(("Unknown block cache type!\n"));
1916 }
1917
1918 RTMemFree(pReq);
1919}
1920
1921static bool pdmBlkCacheReqUpdate(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEREQ pReq,
1922 int rcReq, bool fCallHandler)
1923{
1924 if (RT_FAILURE(rcReq))
1925 ASMAtomicCmpXchgS32(&pReq->rcReq, rcReq, VINF_SUCCESS);
1926
1927 AssertMsg(pReq->cXfersPending > 0, ("No transfers are pending for this request\n"));
1928 uint32_t cXfersPending = ASMAtomicDecU32(&pReq->cXfersPending);
1929
1930 if (!cXfersPending)
1931 {
1932 if (fCallHandler)
1933 pdmBlkCacheReqComplete(pBlkCache, pReq);
1934 else
1935 RTMemFree(pReq);
1936 return true;
1937 }
1938
1939 LogFlowFunc(("pReq=%#p cXfersPending=%u\n", pReq, cXfersPending));
1940 return false;
1941}
1942
1943VMMR3DECL(int) PDMR3BlkCacheRead(PPDMBLKCACHE pBlkCache, uint64_t off,
1944 PCRTSGBUF pcSgBuf, size_t cbRead, void *pvUser)
1945{
1946 int rc = VINF_SUCCESS;
1947 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
1948 PPDMBLKCACHEENTRY pEntry;
1949 PPDMBLKCACHEREQ pReq;
1950
1951 LogFlowFunc((": pBlkCache=%#p{%s} off=%llu pcSgBuf=%#p cbRead=%u pvUser=%#p\n",
1952 pBlkCache, pBlkCache->pszId, off, pcSgBuf, cbRead, pvUser));
1953
1954 AssertPtrReturn(pBlkCache, VERR_INVALID_POINTER);
1955 AssertReturn(!pBlkCache->fSuspended, VERR_INVALID_STATE);
1956
1957 RTSGBUF SgBuf;
1958 RTSgBufClone(&SgBuf, pcSgBuf);
1959
1960 /* Allocate new request structure. */
1961 pReq = pdmBlkCacheReqAlloc(pvUser);
1962 if (RT_UNLIKELY(!pReq))
1963 return VERR_NO_MEMORY;
1964
1965 /* Increment data transfer counter to keep the request valid while we access it. */
1966 ASMAtomicIncU32(&pReq->cXfersPending);
1967
1968 while (cbRead)
1969 {
1970 size_t cbToRead;
1971
1972 pEntry = pdmBlkCacheGetCacheEntryByOffset(pBlkCache, off);
1973
1974 /*
1975 * If there is no entry we try to create a new one eviciting unused pages
1976 * if the cache is full. If this is not possible we will pass the request through
1977 * and skip the caching (all entries may be still in progress so they can't
1978 * be evicted)
1979 * If we have an entry it can be in one of the LRU lists where the entry
1980 * contains data (recently used or frequently used LRU) so we can just read
1981 * the data we need and put the entry at the head of the frequently used LRU list.
1982 * In case the entry is in one of the ghost lists it doesn't contain any data.
1983 * We have to fetch it again evicting pages from either T1 or T2 to make room.
1984 */
1985 if (pEntry)
1986 {
1987 uint64_t offDiff = off - pEntry->Core.Key;
1988
1989 AssertMsg(off >= pEntry->Core.Key,
1990 ("Overflow in calculation off=%llu OffsetAligned=%llu\n",
1991 off, pEntry->Core.Key));
1992
1993 AssertPtr(pEntry->pList);
1994
1995 cbToRead = RT_MIN(pEntry->cbData - offDiff, cbRead);
1996
1997 AssertMsg(off + cbToRead <= pEntry->Core.Key + pEntry->Core.KeyLast + 1,
1998 ("Buffer of cache entry exceeded off=%llu cbToRead=%d\n",
1999 off, cbToRead));
2000
2001 cbRead -= cbToRead;
2002
2003 if (!cbRead)
2004 STAM_COUNTER_INC(&pCache->cHits);
2005 else
2006 STAM_COUNTER_INC(&pCache->cPartialHits);
2007
2008 STAM_COUNTER_ADD(&pCache->StatRead, cbToRead);
2009
2010 /* Ghost lists contain no data. */
2011 if ( (pEntry->pList == &pCache->LruRecentlyUsedIn)
2012 || (pEntry->pList == &pCache->LruFrequentlyUsed))
2013 {
2014 if (pdmBlkCacheEntryFlagIsSetClearAcquireLock(pBlkCache, pEntry,
2015 PDMBLKCACHE_ENTRY_IO_IN_PROGRESS,
2016 PDMBLKCACHE_ENTRY_IS_DIRTY))
2017 {
2018 /* Entry didn't completed yet. Append to the list */
2019 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2020 &SgBuf, offDiff, cbToRead,
2021 false /* fWrite */);
2022 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2023 }
2024 else
2025 {
2026 /* Read as much as we can from the entry. */
2027 RTSgBufCopyFromBuf(&SgBuf, pEntry->pbData + offDiff, cbToRead);
2028 }
2029
2030 /* Move this entry to the top position */
2031 if (pEntry->pList == &pCache->LruFrequentlyUsed)
2032 {
2033 pdmBlkCacheLockEnter(pCache);
2034 pdmBlkCacheEntryAddToList(&pCache->LruFrequentlyUsed, pEntry);
2035 pdmBlkCacheLockLeave(pCache);
2036 }
2037 /* Release the entry */
2038 pdmBlkCacheEntryRelease(pEntry);
2039 }
2040 else
2041 {
2042 uint8_t *pbBuffer = NULL;
2043
2044 LogFlow(("Fetching data for ghost entry %#p from file\n", pEntry));
2045
2046 pdmBlkCacheLockEnter(pCache);
2047 pdmBlkCacheEntryRemoveFromList(pEntry); /* Remove it before we remove data, otherwise it may get freed when evicting data. */
2048 bool fEnough = pdmBlkCacheReclaim(pCache, pEntry->cbData, true, &pbBuffer);
2049
2050 /* Move the entry to Am and fetch it to the cache. */
2051 if (fEnough)
2052 {
2053 pdmBlkCacheEntryAddToList(&pCache->LruFrequentlyUsed, pEntry);
2054 pdmBlkCacheAdd(pCache, pEntry->cbData);
2055 pdmBlkCacheLockLeave(pCache);
2056
2057 if (pbBuffer)
2058 pEntry->pbData = pbBuffer;
2059 else
2060 pEntry->pbData = (uint8_t *)RTMemPageAlloc(pEntry->cbData);
2061 AssertPtr(pEntry->pbData);
2062
2063 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2064 &SgBuf, offDiff, cbToRead,
2065 false /* fWrite */);
2066 pdmBlkCacheEntryReadFromMedium(pEntry);
2067 /* Release the entry */
2068 pdmBlkCacheEntryRelease(pEntry);
2069 }
2070 else
2071 {
2072 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2073 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
2074 RTAvlrU64Remove(pBlkCache->pTree, pEntry->Core.Key);
2075 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
2076 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2077
2078 pdmBlkCacheLockLeave(pCache);
2079
2080 RTMemFree(pEntry);
2081
2082 pdmBlkCacheRequestPassthrough(pBlkCache, pReq,
2083 &SgBuf, off, cbToRead,
2084 PDMBLKCACHEXFERDIR_READ);
2085 }
2086 }
2087 }
2088 else
2089 {
2090#ifdef VBOX_WITH_IO_READ_CACHE
2091 /* No entry found for this offset. Create a new entry and fetch the data to the cache. */
2092 PPDMBLKCACHEENTRY pEntryNew = pdmBlkCacheEntryCreate(pBlkCache,
2093 off, cbRead,
2094 PAGE_SIZE,
2095 &cbToRead);
2096
2097 cbRead -= cbToRead;
2098
2099 if (pEntryNew)
2100 {
2101 if (!cbRead)
2102 STAM_COUNTER_INC(&pCache->cMisses);
2103 else
2104 STAM_COUNTER_INC(&pCache->cPartialHits);
2105
2106 pdmBlkCacheEntryWaitersAdd(pEntryNew, pReq,
2107 &SgBuf,
2108 off - pEntryNew->Core.Key,
2109 cbToRead,
2110 false /* fWrite */);
2111 pdmBlkCacheEntryReadFromMedium(pEntryNew);
2112 pdmBlkCacheEntryRelease(pEntryNew); /* it is protected by the I/O in progress flag now. */
2113 }
2114 else
2115 {
2116 /*
2117 * There is not enough free space in the cache.
2118 * Pass the request directly to the I/O manager.
2119 */
2120 LogFlow(("Couldn't evict %u bytes from the cache. Remaining request will be passed through\n", cbToRead));
2121
2122 pdmBlkCacheRequestPassthrough(pBlkCache, pReq,
2123 &SgBuf, off, cbToRead,
2124 PDMBLKCACHEXFERDIR_READ);
2125 }
2126#else
2127 /* Clip read size if necessary. */
2128 PPDMBLKCACHEENTRY pEntryAbove;
2129 pdmBlkCacheGetCacheBestFitEntryByOffset(pBlkCache, off, &pEntryAbove);
2130
2131 if (pEntryAbove)
2132 {
2133 if (off + cbRead > pEntryAbove->Core.Key)
2134 cbToRead = pEntryAbove->Core.Key - off;
2135 else
2136 cbToRead = cbRead;
2137
2138 pdmBlkCacheEntryRelease(pEntryAbove);
2139 }
2140 else
2141 cbToRead = cbRead;
2142
2143 cbRead -= cbToRead;
2144 pdmBlkCacheRequestPassthrough(pBlkCache, pReq,
2145 &SgBuf, off, cbToRead,
2146 PDMBLKCACHEXFERDIR_READ);
2147#endif
2148 }
2149 off += cbToRead;
2150 }
2151
2152 if (!pdmBlkCacheReqUpdate(pBlkCache, pReq, rc, false))
2153 rc = VINF_AIO_TASK_PENDING;
2154
2155 LogFlowFunc((": Leave rc=%Rrc\n", rc));
2156
2157 return rc;
2158}
2159
2160VMMR3DECL(int) PDMR3BlkCacheWrite(PPDMBLKCACHE pBlkCache, uint64_t off,
2161 PCRTSGBUF pcSgBuf, size_t cbWrite, void *pvUser)
2162{
2163 int rc = VINF_SUCCESS;
2164 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
2165 PPDMBLKCACHEENTRY pEntry;
2166 PPDMBLKCACHEREQ pReq;
2167
2168 LogFlowFunc((": pBlkCache=%#p{%s} off=%llu pcSgBuf=%#p cbWrite=%u pvUser=%#p\n",
2169 pBlkCache, pBlkCache->pszId, off, pcSgBuf, cbWrite, pvUser));
2170
2171 AssertPtrReturn(pBlkCache, VERR_INVALID_POINTER);
2172 AssertReturn(!pBlkCache->fSuspended, VERR_INVALID_STATE);
2173
2174 RTSGBUF SgBuf;
2175 RTSgBufClone(&SgBuf, pcSgBuf);
2176
2177 /* Allocate new request structure. */
2178 pReq = pdmBlkCacheReqAlloc(pvUser);
2179 if (RT_UNLIKELY(!pReq))
2180 return VERR_NO_MEMORY;
2181
2182 /* Increment data transfer counter to keep the request valid while we access it. */
2183 ASMAtomicIncU32(&pReq->cXfersPending);
2184
2185 while (cbWrite)
2186 {
2187 size_t cbToWrite;
2188
2189 pEntry = pdmBlkCacheGetCacheEntryByOffset(pBlkCache, off);
2190
2191 if (pEntry)
2192 {
2193 /* Write the data into the entry and mark it as dirty */
2194 AssertPtr(pEntry->pList);
2195
2196 uint64_t offDiff = off - pEntry->Core.Key;
2197
2198 AssertMsg(off >= pEntry->Core.Key,
2199 ("Overflow in calculation off=%llu OffsetAligned=%llu\n",
2200 off, pEntry->Core.Key));
2201
2202 cbToWrite = RT_MIN(pEntry->cbData - offDiff, cbWrite);
2203 cbWrite -= cbToWrite;
2204
2205 if (!cbWrite)
2206 STAM_COUNTER_INC(&pCache->cHits);
2207 else
2208 STAM_COUNTER_INC(&pCache->cPartialHits);
2209
2210 STAM_COUNTER_ADD(&pCache->StatWritten, cbToWrite);
2211
2212 /* Ghost lists contain no data. */
2213 if ( (pEntry->pList == &pCache->LruRecentlyUsedIn)
2214 || (pEntry->pList == &pCache->LruFrequentlyUsed))
2215 {
2216 /* Check if the entry is dirty. */
2217 if (pdmBlkCacheEntryFlagIsSetClearAcquireLock(pBlkCache, pEntry,
2218 PDMBLKCACHE_ENTRY_IS_DIRTY,
2219 0))
2220 {
2221 /* If it is already dirty but not in progress just update the data. */
2222 if (!(pEntry->fFlags & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS))
2223 {
2224 RTSgBufCopyToBuf(&SgBuf, pEntry->pbData + offDiff,
2225 cbToWrite);
2226 }
2227 else
2228 {
2229 /* The data isn't written to the file yet */
2230 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2231 &SgBuf, offDiff, cbToWrite,
2232 true /* fWrite */);
2233 STAM_COUNTER_INC(&pBlkCache->StatWriteDeferred);
2234 }
2235
2236 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2237 }
2238 else /* Dirty bit not set */
2239 {
2240 /*
2241 * Check if a read is in progress for this entry.
2242 * We have to defer processing in that case.
2243 */
2244 if(pdmBlkCacheEntryFlagIsSetClearAcquireLock(pBlkCache, pEntry,
2245 PDMBLKCACHE_ENTRY_IO_IN_PROGRESS,
2246 0))
2247 {
2248 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2249 &SgBuf, offDiff, cbToWrite,
2250 true /* fWrite */);
2251 STAM_COUNTER_INC(&pBlkCache->StatWriteDeferred);
2252 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2253 }
2254 else /* I/O in progress flag not set */
2255 {
2256 /* Write as much as we can into the entry and update the file. */
2257 RTSgBufCopyToBuf(&SgBuf, pEntry->pbData + offDiff, cbToWrite);
2258
2259 bool fCommit = pdmBlkCacheAddDirtyEntry(pBlkCache, pEntry);
2260 if (fCommit)
2261 pdmBlkCacheCommitDirtyEntries(pCache);
2262 }
2263 } /* Dirty bit not set */
2264
2265 /* Move this entry to the top position */
2266 if (pEntry->pList == &pCache->LruFrequentlyUsed)
2267 {
2268 pdmBlkCacheLockEnter(pCache);
2269 pdmBlkCacheEntryAddToList(&pCache->LruFrequentlyUsed, pEntry);
2270 pdmBlkCacheLockLeave(pCache);
2271 }
2272
2273 pdmBlkCacheEntryRelease(pEntry);
2274 }
2275 else /* Entry is on the ghost list */
2276 {
2277 uint8_t *pbBuffer = NULL;
2278
2279 pdmBlkCacheLockEnter(pCache);
2280 pdmBlkCacheEntryRemoveFromList(pEntry); /* Remove it before we remove data, otherwise it may get freed when evicting data. */
2281 bool fEnough = pdmBlkCacheReclaim(pCache, pEntry->cbData, true, &pbBuffer);
2282
2283 if (fEnough)
2284 {
2285 /* Move the entry to Am and fetch it to the cache. */
2286 pdmBlkCacheEntryAddToList(&pCache->LruFrequentlyUsed, pEntry);
2287 pdmBlkCacheAdd(pCache, pEntry->cbData);
2288 pdmBlkCacheLockLeave(pCache);
2289
2290 if (pbBuffer)
2291 pEntry->pbData = pbBuffer;
2292 else
2293 pEntry->pbData = (uint8_t *)RTMemPageAlloc(pEntry->cbData);
2294 AssertPtr(pEntry->pbData);
2295
2296 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2297 &SgBuf, offDiff, cbToWrite,
2298 true /* fWrite */);
2299 STAM_COUNTER_INC(&pBlkCache->StatWriteDeferred);
2300 pdmBlkCacheEntryReadFromMedium(pEntry);
2301
2302 /* Release the reference. If it is still needed the I/O in progress flag should protect it now. */
2303 pdmBlkCacheEntryRelease(pEntry);
2304 }
2305 else
2306 {
2307 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2308 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
2309 RTAvlrU64Remove(pBlkCache->pTree, pEntry->Core.Key);
2310 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
2311 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2312
2313 pdmBlkCacheLockLeave(pCache);
2314
2315 RTMemFree(pEntry);
2316 pdmBlkCacheRequestPassthrough(pBlkCache, pReq,
2317 &SgBuf, off, cbToWrite,
2318 PDMBLKCACHEXFERDIR_WRITE);
2319 }
2320 }
2321 }
2322 else /* No entry found */
2323 {
2324 /*
2325 * No entry found. Try to create a new cache entry to store the data in and if that fails
2326 * write directly to the file.
2327 */
2328 PPDMBLKCACHEENTRY pEntryNew = pdmBlkCacheEntryCreate(pBlkCache,
2329 off, cbWrite,
2330 512, &cbToWrite);
2331
2332 cbWrite -= cbToWrite;
2333
2334 if (pEntryNew)
2335 {
2336 uint64_t offDiff = off - pEntryNew->Core.Key;
2337
2338 STAM_COUNTER_INC(&pCache->cHits);
2339
2340 /*
2341 * Check if it is possible to just write the data without waiting
2342 * for it to get fetched first.
2343 */
2344 if (!offDiff && pEntryNew->cbData == cbToWrite)
2345 {
2346 RTSgBufCopyToBuf(&SgBuf, pEntryNew->pbData, cbToWrite);
2347
2348 bool fCommit = pdmBlkCacheAddDirtyEntry(pBlkCache, pEntryNew);
2349 if (fCommit)
2350 pdmBlkCacheCommitDirtyEntries(pCache);
2351 STAM_COUNTER_ADD(&pCache->StatWritten, cbToWrite);
2352 }
2353 else
2354 {
2355 /* Defer the write and fetch the data from the endpoint. */
2356 pdmBlkCacheEntryWaitersAdd(pEntryNew, pReq,
2357 &SgBuf, offDiff, cbToWrite,
2358 true /* fWrite */);
2359 STAM_COUNTER_INC(&pBlkCache->StatWriteDeferred);
2360 pdmBlkCacheEntryReadFromMedium(pEntryNew);
2361 }
2362
2363 pdmBlkCacheEntryRelease(pEntryNew);
2364 }
2365 else
2366 {
2367 /*
2368 * There is not enough free space in the cache.
2369 * Pass the request directly to the I/O manager.
2370 */
2371 LogFlow(("Couldn't evict %u bytes from the cache. Remaining request will be passed through\n", cbToWrite));
2372
2373 STAM_COUNTER_INC(&pCache->cMisses);
2374
2375 pdmBlkCacheRequestPassthrough(pBlkCache, pReq,
2376 &SgBuf, off, cbToWrite,
2377 PDMBLKCACHEXFERDIR_WRITE);
2378 }
2379 }
2380
2381 off += cbToWrite;
2382 }
2383
2384 if (!pdmBlkCacheReqUpdate(pBlkCache, pReq, rc, false))
2385 rc = VINF_AIO_TASK_PENDING;
2386
2387 LogFlowFunc((": Leave rc=%Rrc\n", rc));
2388
2389 return rc;
2390}
2391
2392VMMR3DECL(int) PDMR3BlkCacheFlush(PPDMBLKCACHE pBlkCache, void *pvUser)
2393{
2394 int rc = VINF_SUCCESS;
2395 PPDMBLKCACHEREQ pReq;
2396
2397 LogFlowFunc((": pBlkCache=%#p{%s}\n", pBlkCache, pBlkCache->pszId));
2398
2399 AssertPtrReturn(pBlkCache, VERR_INVALID_POINTER);
2400 AssertReturn(!pBlkCache->fSuspended, VERR_INVALID_STATE);
2401
2402 /* Commit dirty entries in the cache. */
2403 pdmBlkCacheCommit(pBlkCache);
2404
2405 /* Allocate new request structure. */
2406 pReq = pdmBlkCacheReqAlloc(pvUser);
2407 if (RT_UNLIKELY(!pReq))
2408 return VERR_NO_MEMORY;
2409
2410 rc = pdmBlkCacheRequestPassthrough(pBlkCache, pReq, NULL, 0, 0,
2411 PDMBLKCACHEXFERDIR_FLUSH);
2412 AssertRC(rc);
2413
2414 LogFlowFunc((": Leave rc=%Rrc\n", rc));
2415 return VINF_AIO_TASK_PENDING;
2416}
2417
2418VMMR3DECL(int) PDMR3BlkCacheDiscard(PPDMBLKCACHE pBlkCache, PCRTRANGE paRanges,
2419 unsigned cRanges, void *pvUser)
2420{
2421 int rc = VINF_SUCCESS;
2422 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
2423 PPDMBLKCACHEENTRY pEntry;
2424 PPDMBLKCACHEREQ pReq;
2425
2426 LogFlowFunc((": pBlkCache=%#p{%s} paRanges=%#p cRanges=%u pvUser=%#p\n",
2427 pBlkCache, pBlkCache->pszId, paRanges, cRanges, pvUser));
2428
2429 AssertPtrReturn(pBlkCache, VERR_INVALID_POINTER);
2430 AssertReturn(!pBlkCache->fSuspended, VERR_INVALID_STATE);
2431
2432 /* Allocate new request structure. */
2433 pReq = pdmBlkCacheReqAlloc(pvUser);
2434 if (RT_UNLIKELY(!pReq))
2435 return VERR_NO_MEMORY;
2436
2437 /* Increment data transfer counter to keep the request valid while we access it. */
2438 ASMAtomicIncU32(&pReq->cXfersPending);
2439
2440 for (unsigned i = 0; i < cRanges; i++)
2441 {
2442 uint64_t offCur = paRanges[i].offStart;
2443 size_t cbLeft = paRanges[i].cbRange;
2444
2445 while (cbLeft)
2446 {
2447 size_t cbThisDiscard = 0;
2448
2449 pEntry = pdmBlkCacheGetCacheEntryByOffset(pBlkCache, offCur);
2450
2451 if (pEntry)
2452 {
2453 /* Write the data into the entry and mark it as dirty */
2454 AssertPtr(pEntry->pList);
2455
2456 uint64_t offDiff = offCur - pEntry->Core.Key;
2457
2458 AssertMsg(offCur >= pEntry->Core.Key,
2459 ("Overflow in calculation offCur=%llu OffsetAligned=%llu\n",
2460 offCur, pEntry->Core.Key));
2461
2462 cbThisDiscard = RT_MIN(pEntry->cbData - offDiff, cbLeft);
2463
2464 /* Ghost lists contain no data. */
2465 if ( (pEntry->pList == &pCache->LruRecentlyUsedIn)
2466 || (pEntry->pList == &pCache->LruFrequentlyUsed))
2467 {
2468 /* Check if the entry is dirty. */
2469 if (pdmBlkCacheEntryFlagIsSetClearAcquireLock(pBlkCache, pEntry,
2470 PDMBLKCACHE_ENTRY_IS_DIRTY,
2471 0))
2472 {
2473 /* If it is dirty but not yet in progress remove it. */
2474 if (!(pEntry->fFlags & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS))
2475 {
2476 pdmBlkCacheLockEnter(pCache);
2477 pdmBlkCacheEntryRemoveFromList(pEntry);
2478
2479 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
2480 RTAvlrU64Remove(pBlkCache->pTree, pEntry->Core.Key);
2481 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
2482
2483 pdmBlkCacheLockLeave(pCache);
2484
2485 RTMemFree(pEntry);
2486 }
2487 else
2488 {
2489#if 0
2490 /* The data isn't written to the file yet */
2491 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2492 &SgBuf, offDiff, cbToWrite,
2493 true /* fWrite */);
2494 STAM_COUNTER_INC(&pBlkCache->StatWriteDeferred);
2495#endif
2496 }
2497
2498 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2499 pdmBlkCacheEntryRelease(pEntry);
2500 }
2501 else /* Dirty bit not set */
2502 {
2503 /*
2504 * Check if a read is in progress for this entry.
2505 * We have to defer processing in that case.
2506 */
2507 if(pdmBlkCacheEntryFlagIsSetClearAcquireLock(pBlkCache, pEntry,
2508 PDMBLKCACHE_ENTRY_IO_IN_PROGRESS,
2509 0))
2510 {
2511#if 0
2512 pdmBlkCacheEntryWaitersAdd(pEntry, pReq,
2513 &SgBuf, offDiff, cbToWrite,
2514 true /* fWrite */);
2515#endif
2516 STAM_COUNTER_INC(&pBlkCache->StatWriteDeferred);
2517 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2518 pdmBlkCacheEntryRelease(pEntry);
2519 }
2520 else /* I/O in progress flag not set */
2521 {
2522 pdmBlkCacheLockEnter(pCache);
2523 pdmBlkCacheEntryRemoveFromList(pEntry);
2524
2525 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2526 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
2527 RTAvlrU64Remove(pBlkCache->pTree, pEntry->Core.Key);
2528 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
2529 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2530
2531 pdmBlkCacheLockLeave(pCache);
2532
2533 RTMemFree(pEntry);
2534 }
2535 } /* Dirty bit not set */
2536 }
2537 else /* Entry is on the ghost list just remove cache entry. */
2538 {
2539 pdmBlkCacheLockEnter(pCache);
2540 pdmBlkCacheEntryRemoveFromList(pEntry);
2541
2542 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2543 STAM_PROFILE_ADV_START(&pCache->StatTreeRemove, Cache);
2544 RTAvlrU64Remove(pBlkCache->pTree, pEntry->Core.Key);
2545 STAM_PROFILE_ADV_STOP(&pCache->StatTreeRemove, Cache);
2546 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2547
2548 pdmBlkCacheLockLeave(pCache);
2549
2550 RTMemFree(pEntry);
2551 }
2552 }
2553 /* else: no entry found. */
2554
2555 offCur += cbThisDiscard;
2556 cbLeft -= cbThisDiscard;
2557 }
2558 }
2559
2560 if (!pdmBlkCacheReqUpdate(pBlkCache, pReq, rc, false))
2561 rc = VINF_AIO_TASK_PENDING;
2562
2563 LogFlowFunc((": Leave rc=%Rrc\n", rc));
2564
2565 return rc;
2566}
2567
2568/**
2569 * Completes a task segment freeing all resources and completes the task handle
2570 * if everything was transferred.
2571 *
2572 * @returns Next task segment handle.
2573 * @param pTaskSeg Task segment to complete.
2574 * @param rc Status code to set.
2575 */
2576static PPDMBLKCACHEWAITER pdmBlkCacheWaiterComplete(PPDMBLKCACHE pBlkCache,
2577 PPDMBLKCACHEWAITER pWaiter,
2578 int rc)
2579{
2580 PPDMBLKCACHEWAITER pNext = pWaiter->pNext;
2581 PPDMBLKCACHEREQ pReq = pWaiter->pReq;
2582
2583 pdmBlkCacheReqUpdate(pBlkCache, pWaiter->pReq, rc, true);
2584
2585 RTMemFree(pWaiter);
2586
2587 return pNext;
2588}
2589
2590static void pdmBlkCacheIoXferCompleteEntry(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEIOXFER hIoXfer, int rcIoXfer)
2591{
2592 PPDMBLKCACHEENTRY pEntry = hIoXfer->pEntry;
2593 PPDMBLKCACHEGLOBAL pCache = pBlkCache->pCache;
2594
2595 /* Reference the entry now as we are clearing the I/O in progress flag
2596 * which protected the entry till now. */
2597 pdmBlkCacheEntryRef(pEntry);
2598
2599 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2600 pEntry->fFlags &= ~PDMBLKCACHE_ENTRY_IO_IN_PROGRESS;
2601
2602 /* Process waiting segment list. The data in entry might have changed in-between. */
2603 bool fDirty = false;
2604 PPDMBLKCACHEWAITER pComplete = pEntry->pWaitingHead;
2605 PPDMBLKCACHEWAITER pCurr = pComplete;
2606
2607 AssertMsg((pCurr && pEntry->pWaitingTail) || (!pCurr && !pEntry->pWaitingTail),
2608 ("The list tail was not updated correctly\n"));
2609 pEntry->pWaitingTail = NULL;
2610 pEntry->pWaitingHead = NULL;
2611
2612 if (hIoXfer->enmXferDir == PDMBLKCACHEXFERDIR_WRITE)
2613 {
2614 /*
2615 * An error here is difficult to handle as the original request completed already.
2616 * The error is logged for now and the VM is paused.
2617 * If the user continues the entry is written again in the hope
2618 * the user fixed the problem and the next write succeeds.
2619 */
2620 if (RT_FAILURE(rcIoXfer))
2621 {
2622 LogRel(("I/O cache: Error while writing entry at offset %llu (%u bytes) to medium \"%s\" (rc=%Rrc)\n",
2623 pEntry->Core.Key, pEntry->cbData, pBlkCache->pszId, rcIoXfer));
2624
2625 if (!ASMAtomicXchgBool(&pCache->fIoErrorVmSuspended, true))
2626 {
2627 int rc = VMSetRuntimeError(pCache->pVM, VMSETRTERR_FLAGS_SUSPEND | VMSETRTERR_FLAGS_NO_WAIT, "BLKCACHE_IOERR",
2628 N_("The I/O cache encountered an error while updating data in medium \"%s\" (rc=%Rrc). "
2629 "Make sure there is enough free space on the disk and that the disk is working properly. "
2630 "Operation can be resumed afterwards"),
2631 pBlkCache->pszId, rcIoXfer);
2632 AssertRC(rc);
2633 }
2634
2635 /* Mark the entry as dirty again to get it added to the list later on. */
2636 fDirty = true;
2637 }
2638
2639 pEntry->fFlags &= ~PDMBLKCACHE_ENTRY_IS_DIRTY;
2640
2641 while (pCurr)
2642 {
2643 AssertMsg(pCurr->fWrite, ("Completed write entries should never have read tasks attached\n"));
2644
2645 RTSgBufCopyToBuf(&pCurr->SgBuf, pEntry->pbData + pCurr->offCacheEntry, pCurr->cbTransfer);
2646 fDirty = true;
2647 pCurr = pCurr->pNext;
2648 }
2649 }
2650 else
2651 {
2652 AssertMsg(hIoXfer->enmXferDir == PDMBLKCACHEXFERDIR_READ, ("Invalid transfer type\n"));
2653 AssertMsg(!(pEntry->fFlags & PDMBLKCACHE_ENTRY_IS_DIRTY),
2654 ("Invalid flags set\n"));
2655
2656 while (pCurr)
2657 {
2658 if (pCurr->fWrite)
2659 {
2660 RTSgBufCopyToBuf(&pCurr->SgBuf, pEntry->pbData + pCurr->offCacheEntry, pCurr->cbTransfer);
2661 fDirty = true;
2662 }
2663 else
2664 RTSgBufCopyFromBuf(&pCurr->SgBuf, pEntry->pbData + pCurr->offCacheEntry, pCurr->cbTransfer);
2665
2666 pCurr = pCurr->pNext;
2667 }
2668 }
2669
2670 bool fCommit = false;
2671 if (fDirty)
2672 fCommit = pdmBlkCacheAddDirtyEntry(pBlkCache, pEntry);
2673
2674 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2675
2676 /* Dereference so that it isn't protected anymore except we issued anyother write for it. */
2677 pdmBlkCacheEntryRelease(pEntry);
2678
2679 if (fCommit)
2680 pdmBlkCacheCommitDirtyEntries(pCache);
2681
2682 /* Complete waiters now. */
2683 while (pComplete)
2684 pComplete = pdmBlkCacheWaiterComplete(pBlkCache, pComplete, rcIoXfer);
2685}
2686
2687VMMR3DECL(void) PDMR3BlkCacheIoXferComplete(PPDMBLKCACHE pBlkCache, PPDMBLKCACHEIOXFER hIoXfer, int rcIoXfer)
2688{
2689 LogFlowFunc(("pBlkCache=%#p hIoXfer=%#p rcIoXfer=%Rrc\n", pBlkCache, hIoXfer, rcIoXfer));
2690
2691 if (hIoXfer->fIoCache)
2692 pdmBlkCacheIoXferCompleteEntry(pBlkCache, hIoXfer, rcIoXfer);
2693 else
2694 pdmBlkCacheReqUpdate(pBlkCache, hIoXfer->pReq, rcIoXfer, true);
2695 RTMemFree(hIoXfer);
2696}
2697
2698/**
2699 * Callback for the AVL do with all routine. Waits for a cachen entry to finish any pending I/O.
2700 *
2701 * @returns IPRT status code.
2702 * @param pNode The node to destroy.
2703 * @param pvUser Opaque user data.
2704 */
2705static int pdmBlkCacheEntryQuiesce(PAVLRU64NODECORE pNode, void *pvUser)
2706{
2707 PPDMBLKCACHEENTRY pEntry = (PPDMBLKCACHEENTRY)pNode;
2708 PPDMBLKCACHE pBlkCache = pEntry->pBlkCache;
2709
2710 while (ASMAtomicReadU32(&pEntry->fFlags) & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS)
2711 {
2712 /* Leave the locks to let the I/O thread make progress but reference the entry to prevent eviction. */
2713 pdmBlkCacheEntryRef(pEntry);
2714 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2715
2716 RTThreadSleep(1);
2717
2718 /* Re-enter all locks and drop the reference. */
2719 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2720 pdmBlkCacheEntryRelease(pEntry);
2721 }
2722
2723 AssertMsg(!(pEntry->fFlags & PDMBLKCACHE_ENTRY_IO_IN_PROGRESS),
2724 ("Entry is dirty and/or still in progress fFlags=%#x\n", pEntry->fFlags));
2725
2726 return VINF_SUCCESS;
2727}
2728
2729VMMR3DECL(int) PDMR3BlkCacheSuspend(PPDMBLKCACHE pBlkCache)
2730{
2731 int rc = VINF_SUCCESS;
2732 LogFlowFunc(("pBlkCache=%#p\n", pBlkCache));
2733
2734 AssertPtrReturn(pBlkCache, VERR_INVALID_POINTER);
2735
2736 if (!ASMAtomicReadBool(&pBlkCache->pCache->fIoErrorVmSuspended))
2737 pdmBlkCacheCommit(pBlkCache); /* Can issue new I/O requests. */
2738 ASMAtomicXchgBool(&pBlkCache->fSuspended, true);
2739
2740 /* Wait for all I/O to complete. */
2741 RTSemRWRequestWrite(pBlkCache->SemRWEntries, RT_INDEFINITE_WAIT);
2742 rc = RTAvlrU64DoWithAll(pBlkCache->pTree, true, pdmBlkCacheEntryQuiesce, NULL);
2743 AssertRC(rc);
2744 RTSemRWReleaseWrite(pBlkCache->SemRWEntries);
2745
2746 return rc;
2747}
2748
2749VMMR3DECL(int) PDMR3BlkCacheResume(PPDMBLKCACHE pBlkCache)
2750{
2751 LogFlowFunc(("pBlkCache=%#p\n", pBlkCache));
2752
2753 AssertPtrReturn(pBlkCache, VERR_INVALID_POINTER);
2754
2755 ASMAtomicXchgBool(&pBlkCache->fSuspended, false);
2756
2757 return VINF_SUCCESS;
2758}
2759
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette