1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
|
/* $Id: IOBufMgmt.cpp $ */
/** @file
* VBox storage devices: I/O buffer management API.
*/
/*
* Copyright (C) 2016-2019 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modify it under the terms of the GNU
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*/
#define LOG_GROUP LOG_GROUP_IOBUFMGMT
#include <VBox/cdefs.h>
#include <iprt/errcore.h>
#include <VBox/log.h>
#include <iprt/assert.h>
#include <iprt/critsect.h>
#include <iprt/mem.h>
#include <iprt/memsafer.h>
#include <iprt/sg.h>
#include <iprt/string.h>
#include <iprt/asm.h>
/** Set to verify the allocations for distinct memory areas. */
//#define IOBUFMGR_VERIFY_ALLOCATIONS 1
/** The minimum bin size to create - power of two!. */
#define IOBUFMGR_BIN_SIZE_MIN _4K
/** The maximum bin size to create - power of two!. */
#define IOBUFMGR_BIN_SIZE_MAX _1M
/** Pointer to the internal I/O buffer manager data. */
typedef struct IOBUFMGRINT *PIOBUFMGRINT;
/**
* Internal I/O buffer descriptor data.
*/
typedef struct IOBUFDESCINT
{
/** Data segments. */
RTSGSEG aSegs[10];
/** Data segments used for the current allocation. */
unsigned cSegsUsed;
/** Pointer to I/O buffer manager. */
PIOBUFMGRINT pIoBufMgr;
} IOBUFDESCINT;
/**
* A
*/
typedef struct IOBUFMGRBIN
{
/** Index of the next free entry. */
unsigned iFree;
/** Pointer to the array of free objects for this bin. */
void **papvFree;
} IOBUFMGRBIN;
typedef IOBUFMGRBIN *PIOBUFMGRBIN;
/**
* Internal I/O buffer manager data.
*/
typedef struct IOBUFMGRINT
{
/** Critical section protecting the allocation path. */
RTCRITSECT CritSectAlloc;
/** Flags the manager was created with. */
uint32_t fFlags;
/** Maximum size of I/O memory to allocate. */
size_t cbMax;
/** Amount of free memory. */
size_t cbFree;
/** The order of smallest bin. */
uint32_t u32OrderMin;
/** The order of largest bin. */
uint32_t u32OrderMax;
/** Pointer to the base memory of the allocation. */
void *pvMem;
/** Number of bins for free objects. */
uint32_t cBins;
/** Flag whether allocation is on hold waiting for everything to be free
* to be able to defragment the memory. */
bool fAllocSuspended;
/** Array of bins. */
PIOBUFMGRBIN paBins;
#ifdef IOBUFMGR_VERIFY_ALLOCATIONS
/** Pointer to the object state (allocated/free) bitmap. */
void *pbmObjState;
#endif
/** Array of pointer entries for the various bins - variable in size. */
void *apvObj[1];
} IOBUFMGRINT;
/* Must be included after IOBUFDESCINT was defined. */
#define IOBUFDESCINT_DECLARED
#include "IOBufMgmt.h"
/**
* Gets the number of bins required between the given minimum and maximum size
* to have a bin for every power of two size inbetween.
*
* @returns The number of bins required.
* @param cbMin The size of the smallest bin.
* @param cbMax The size of the largest bin.
*/
DECLINLINE(uint32_t) iobufMgrGetBinCount(uint32_t cbMin, uint32_t cbMax)
{
uint32_t u32Max = ASMBitLastSetU32(cbMax);
uint32_t u32Min = ASMBitLastSetU32(cbMin);
Assert(cbMax >= cbMin && cbMax != 0 && cbMin != 0);
return u32Max - u32Min + 1;
}
/**
* Returns the number of entries required in the object array to cover all bins.
*
* @returns Number of entries required in the object array.
* @param cbMem Size of the memory buffer.
* @param cBins Number of bins available.
* @param cbMinBin Minimum object size.
*/
DECLINLINE(uint32_t) iobufMgrGetObjCount(size_t cbMem, unsigned cBins, size_t cbMinBin)
{
size_t cObjs = 0;
size_t cbBin = cbMinBin;
while (cBins-- > 0)
{
cObjs += cbMem / cbBin;
cbBin <<= 1; /* The size doubles for every bin. */
}
Assert((uint32_t)cObjs == cObjs);
return (uint32_t)cObjs;
}
DECLINLINE(void) iobufMgrBinObjAdd(PIOBUFMGRBIN pBin, void *pvObj)
{
LogFlowFunc(("pBin=%#p{.iFree=%u} pvObj=%#p\n", pBin, pBin->iFree, pvObj));
AssertPtr(pvObj);
pBin->papvFree[pBin->iFree] = pvObj;
pBin->iFree++;
LogFlowFunc(("return pBin=%#p{.iFree=%u}\n", pBin, pBin->iFree));
}
DECLINLINE(void *) iobufMgrBinObjRemove(PIOBUFMGRBIN pBin)
{
LogFlowFunc(("pBin=%#p{.iFree=%u}\n", pBin, pBin->iFree));
Assert(pBin->iFree > 0);
pBin->iFree--;
void *pvObj = pBin->papvFree[pBin->iFree];
AssertPtr(pvObj);
LogFlowFunc(("returns pvObj=%#p pBin=%#p{.iFree=%u}\n", pvObj, pBin, pBin->iFree));
return pvObj;
}
/**
* Resets the bins to factory default (memory resigin in the largest bin).
*
* @returns nothing.
* @param pThis The I/O buffer manager instance.
*/
static void iobufMgrResetBins(PIOBUFMGRINT pThis)
{
/* Init the bins. */
size_t cbMax = pThis->cbMax;
size_t iObj = 0;
uint32_t cbBin = IOBUFMGR_BIN_SIZE_MIN;
for (unsigned i = 0; i < pThis->cBins; i++)
{
PIOBUFMGRBIN pBin = &pThis->paBins[i];
pBin->iFree = 0;
pBin->papvFree = &pThis->apvObj[iObj];
iObj += cbMax / cbBin;
/* Init the biggest possible bin with the free objects. */
if ( (cbBin << 1) > cbMax
|| i == pThis->cBins - 1)
{
uint8_t *pbMem = (uint8_t *)pThis->pvMem;
while (cbMax)
{
iobufMgrBinObjAdd(pBin, pbMem);
cbMax -= cbBin;
pbMem += cbBin;
if (cbMax < cbBin) /** @todo Populate smaller bins and don't waste memory. */
break;
}
/* Limit the number of available bins. */
pThis->cBins = i + 1;
break;
}
cbBin <<= 1;
}
}
/**
* Allocate one segment from the manager.
*
* @returns Number of bytes allocated, 0 if there is no free memory.
* @param pThis The I/O buffer manager instance.
* @param pSeg The segment to fill in on success.
* @param cb Maximum number of bytes to allocate.
*/
static size_t iobufMgrAllocSegment(PIOBUFMGRINT pThis, PRTSGSEG pSeg, size_t cb)
{
size_t cbAlloc = 0;
/* Round to the next power of two and get the bin to try first. */
uint32_t u32Order = ASMBitLastSetU32((uint32_t)cb) - 1;
if (cb & (RT_BIT_32(u32Order) - 1))
u32Order++;
u32Order = RT_CLAMP(u32Order, pThis->u32OrderMin, pThis->u32OrderMax);
unsigned iBin = u32Order - pThis->u32OrderMin;
/*
* Check whether the bin can satisfy the request. If not try the next bigger
* bin and so on. If there is nothing to find try the smaller bins.
*/
Assert(iBin < pThis->cBins);
PIOBUFMGRBIN pBin = &pThis->paBins[iBin];
/* Reset the bins if there is nothing in the current one but all the memory is marked as free. */
if ( pThis->cbFree == pThis->cbMax
&& pBin->iFree == 0)
iobufMgrResetBins(pThis);
if (pBin->iFree == 0)
{
unsigned iBinCur = iBin;
PIOBUFMGRBIN pBinCur = &pThis->paBins[iBinCur];
while (iBinCur < pThis->cBins)
{
if (pBinCur->iFree != 0)
{
uint8_t *pbMem = (uint8_t *)iobufMgrBinObjRemove(pBinCur);
AssertPtr(pbMem);
/* Always split into half. */
while (iBinCur > iBin)
{
iBinCur--;
pBinCur = &pThis->paBins[iBinCur];
iobufMgrBinObjAdd(pBinCur, pbMem + (size_t)RT_BIT(iBinCur + pThis->u32OrderMin)); /* (RT_BIT causes weird MSC warning without cast) */
}
/* For the last bin we will get two new memory blocks. */
iobufMgrBinObjAdd(pBinCur, pbMem);
Assert(pBin == pBinCur);
break;
}
pBinCur++;
iBinCur++;
}
}
/*
* If we didn't find something in the higher bins try to accumulate as much as possible from the smaller bins.
*/
if ( pBin->iFree == 0
&& iBin > 0)
{
#if 1
pThis->fAllocSuspended = true;
#else
do
{
iBin--;
pBin = &pThis->paBins[iBin];
if (pBin->iFree != 0)
{
pBin->iFree--;
pSeg->pvSeg = pBin->papvFree[pBin->iFree];
pSeg->cbSeg = (size_t)RT_BIT_32(iBin + pThis->u32OrderMin);
AssertPtr(pSeg->pvSeg);
cbAlloc = pSeg->cbSeg;
break;
}
}
while (iBin > 0);
#endif
}
else if (pBin->iFree != 0)
{
pSeg->pvSeg = iobufMgrBinObjRemove(pBin);
pSeg->cbSeg = (size_t)RT_BIT_32(u32Order);
cbAlloc = pSeg->cbSeg;
AssertPtr(pSeg->pvSeg);
pThis->cbFree -= cbAlloc;
#ifdef IOBUFMGR_VERIFY_ALLOCATIONS
/* Mark the objects as allocated. */
uint32_t iBinStart = ((uintptr_t)pSeg->pvSeg - (uintptr_t)pThis->pvMem) / IOBUFMGR_BIN_SIZE_MIN;
Assert( !(((uintptr_t)pSeg->pvSeg - (uintptr_t)pThis->pvMem) % IOBUFMGR_BIN_SIZE_MIN)
&& !(pSeg->cbSeg % IOBUFMGR_BIN_SIZE_MIN));
uint32_t iBinEnd = iBinStart + (pSeg->cbSeg / IOBUFMGR_BIN_SIZE_MIN);
while (iBinStart < iBinEnd)
{
bool fState = ASMBitTestAndSet(pThis->pbmObjState, iBinStart);
//LogFlowFunc(("iBinStart=%u fState=%RTbool -> true\n", iBinStart, fState));
AssertMsg(!fState, ("Trying to allocate an already allocated object\n"));
iBinStart++;
}
#endif
}
return cbAlloc;
}
DECLHIDDEN(int) IOBUFMgrCreate(PIOBUFMGR phIoBufMgr, size_t cbMax, uint32_t fFlags)
{
int rc = VINF_SUCCESS;
AssertPtrReturn(phIoBufMgr, VERR_INVALID_POINTER);
AssertReturn(cbMax, VERR_NOT_IMPLEMENTED);
/* Allocate the basic structure in one go. */
unsigned cBins = iobufMgrGetBinCount(IOBUFMGR_BIN_SIZE_MIN, IOBUFMGR_BIN_SIZE_MAX);
uint32_t cObjs = iobufMgrGetObjCount(cbMax, cBins, IOBUFMGR_BIN_SIZE_MIN);
PIOBUFMGRINT pThis = (PIOBUFMGRINT)RTMemAllocZ(RT_UOFFSETOF_DYN(IOBUFMGRINT, apvObj[cObjs]) + cBins * sizeof(IOBUFMGRBIN));
if (RT_LIKELY(pThis))
{
pThis->fFlags = fFlags;
pThis->cbMax = cbMax;
pThis->cbFree = cbMax;
pThis->cBins = cBins;
pThis->fAllocSuspended = false;
pThis->u32OrderMin = ASMBitLastSetU32(IOBUFMGR_BIN_SIZE_MIN) - 1;
pThis->u32OrderMax = ASMBitLastSetU32(IOBUFMGR_BIN_SIZE_MAX) - 1;
pThis->paBins = (PIOBUFMGRBIN)((uint8_t *)pThis + RT_UOFFSETOF_DYN(IOBUFMGRINT, apvObj[cObjs]));
#ifdef IOBUFMGR_VERIFY_ALLOCATIONS
pThis->pbmObjState = RTMemAllocZ((cbMax / IOBUFMGR_BIN_SIZE_MIN / 8) + 1);
if (!pThis->pbmObjState)
rc = VERR_NO_MEMORY;
#endif
if (RT_SUCCESS(rc))
rc = RTCritSectInit(&pThis->CritSectAlloc);
if (RT_SUCCESS(rc))
{
if (pThis->fFlags & IOBUFMGR_F_REQUIRE_NOT_PAGABLE)
rc = RTMemSaferAllocZEx(&pThis->pvMem, RT_ALIGN_Z(pThis->cbMax, _4K),
RTMEMSAFER_F_REQUIRE_NOT_PAGABLE);
else
pThis->pvMem = RTMemPageAllocZ(RT_ALIGN_Z(pThis->cbMax, _4K));
if ( RT_LIKELY(pThis->pvMem)
&& RT_SUCCESS(rc))
{
iobufMgrResetBins(pThis);
*phIoBufMgr = pThis;
return VINF_SUCCESS;
}
else
rc = VERR_NO_MEMORY;
RTCritSectDelete(&pThis->CritSectAlloc);
}
RTMemFree(pThis);
}
else
rc = VERR_NO_MEMORY;
return rc;
}
DECLHIDDEN(int) IOBUFMgrDestroy(IOBUFMGR hIoBufMgr)
{
PIOBUFMGRINT pThis = hIoBufMgr;
AssertPtrReturn(pThis, VERR_INVALID_HANDLE);
int rc = RTCritSectEnter(&pThis->CritSectAlloc);
if (RT_SUCCESS(rc))
{
if (pThis->cbFree == pThis->cbMax)
{
if (pThis->fFlags & IOBUFMGR_F_REQUIRE_NOT_PAGABLE)
RTMemSaferFree(pThis->pvMem, RT_ALIGN_Z(pThis->cbMax, _4K));
else
RTMemPageFree(pThis->pvMem, RT_ALIGN_Z(pThis->cbMax, _4K));
#ifdef IOBUFMGR_VERIFY_ALLOCATIONS
AssertPtr(pThis->pbmObjState);
RTMemFree(pThis->pbmObjState);
pThis->pbmObjState = NULL;
#endif
RTCritSectLeave(&pThis->CritSectAlloc);
RTCritSectDelete(&pThis->CritSectAlloc);
RTMemFree(pThis);
}
else
{
rc = VERR_INVALID_STATE;
RTCritSectLeave(&pThis->CritSectAlloc);
}
}
return rc;
}
DECLHIDDEN(int) IOBUFMgrAllocBuf(IOBUFMGR hIoBufMgr, PIOBUFDESC pIoBufDesc, size_t cbIoBuf,
size_t *pcbIoBufAllocated)
{
PIOBUFMGRINT pThis = hIoBufMgr;
LogFlowFunc(("pThis=%#p pIoBufDesc=%#p cbIoBuf=%zu pcbIoBufAllocated=%#p\n",
pThis, pIoBufDesc, cbIoBuf, pcbIoBufAllocated));
AssertPtrReturn(pThis, VERR_INVALID_HANDLE);
AssertReturn(cbIoBuf > 0, VERR_INVALID_PARAMETER);
if ( !pThis->cbFree
|| pThis->fAllocSuspended)
return VERR_NO_MEMORY;
int rc = RTCritSectEnter(&pThis->CritSectAlloc);
if (RT_SUCCESS(rc))
{
unsigned iSeg = 0;
size_t cbLeft = cbIoBuf;
size_t cbIoBufAlloc = 0;
PRTSGSEG pSeg = &pIoBufDesc->Int.aSegs[0];
while ( iSeg < RT_ELEMENTS(pIoBufDesc->Int.aSegs)
&& cbLeft)
{
size_t cbAlloc = iobufMgrAllocSegment(pThis, pSeg, cbLeft);
if (!cbAlloc)
break;
iSeg++;
pSeg++;
cbLeft -= RT_MIN(cbAlloc, cbLeft);
cbIoBufAlloc += cbAlloc;
}
if (iSeg)
RTSgBufInit(&pIoBufDesc->SgBuf, &pIoBufDesc->Int.aSegs[0], iSeg);
else
rc = VERR_NO_MEMORY;
pIoBufDesc->Int.cSegsUsed = iSeg;
pIoBufDesc->Int.pIoBufMgr = pThis;
*pcbIoBufAllocated = cbIoBufAlloc;
Assert( (RT_SUCCESS(rc) && *pcbIoBufAllocated > 0)
|| RT_FAILURE(rc));
RTCritSectLeave(&pThis->CritSectAlloc);
}
return rc;
}
DECLHIDDEN(void) IOBUFMgrFreeBuf(PIOBUFDESC pIoBufDesc)
{
PIOBUFMGRINT pThis = pIoBufDesc->Int.pIoBufMgr;
LogFlowFunc(("pIoBufDesc=%#p{.cSegsUsed=%u}\n", pIoBufDesc, pIoBufDesc->Int.cSegsUsed));
AssertPtr(pThis);
int rc = RTCritSectEnter(&pThis->CritSectAlloc);
AssertRC(rc);
if (RT_SUCCESS(rc))
{
for (unsigned i = 0; i < pIoBufDesc->Int.cSegsUsed; i++)
{
PRTSGSEG pSeg = &pIoBufDesc->Int.aSegs[i];
uint32_t u32Order = ASMBitLastSetU32((uint32_t)pSeg->cbSeg) - 1;
unsigned iBin = u32Order - pThis->u32OrderMin;
Assert(iBin < pThis->cBins);
PIOBUFMGRBIN pBin = &pThis->paBins[iBin];
iobufMgrBinObjAdd(pBin, pSeg->pvSeg);
pThis->cbFree += pSeg->cbSeg;
#ifdef IOBUFMGR_VERIFY_ALLOCATIONS
/* Mark the objects as free. */
uint32_t iBinStart = ((uintptr_t)pSeg->pvSeg - (uintptr_t)pThis->pvMem) / IOBUFMGR_BIN_SIZE_MIN;
Assert( !(((uintptr_t)pSeg->pvSeg - (uintptr_t)pThis->pvMem) % IOBUFMGR_BIN_SIZE_MIN)
&& !(pSeg->cbSeg % IOBUFMGR_BIN_SIZE_MIN));
uint32_t iBinEnd = iBinStart + (pSeg->cbSeg / IOBUFMGR_BIN_SIZE_MIN);
while (iBinStart < iBinEnd)
{
bool fState = ASMBitTestAndClear(pThis->pbmObjState, iBinStart);
//LogFlowFunc(("iBinStart=%u fState=%RTbool -> false\n", iBinStart, fState));
AssertMsg(fState, ("Trying to free a non allocated object\n"));
iBinStart++;
}
/* Poison the state. */
pSeg->cbSeg = ~0;
pSeg->pvSeg = (void *)~(uintptr_t)0;
#endif
}
if ( pThis->cbFree == pThis->cbMax
&& pThis->fAllocSuspended)
{
iobufMgrResetBins(pThis);
pThis->fAllocSuspended = false;
}
RTCritSectLeave(&pThis->CritSectAlloc);
}
pIoBufDesc->Int.cSegsUsed = 0;
#ifdef IOBUFMGR_VERIFY_ALLOCATIONS
memset(&pIoBufDesc->SgBuf, 0xff, sizeof(pIoBufDesc->SgBuf));
#endif
}
|