1 | /* $Id: bs3-cmn-SlabAllocEx.c 96407 2022-08-22 17:43:14Z vboxsync $ */
|
---|
2 | /** @file
|
---|
3 | * BS3Kit - Bs3SlabAllocEx
|
---|
4 | */
|
---|
5 |
|
---|
6 | /*
|
---|
7 | * Copyright (C) 2007-2022 Oracle and/or its affiliates.
|
---|
8 | *
|
---|
9 | * This file is part of VirtualBox base platform packages, as
|
---|
10 | * available from https://www.virtualbox.org.
|
---|
11 | *
|
---|
12 | * This program is free software; you can redistribute it and/or
|
---|
13 | * modify it under the terms of the GNU General Public License
|
---|
14 | * as published by the Free Software Foundation, in version 3 of the
|
---|
15 | * License.
|
---|
16 | *
|
---|
17 | * This program is distributed in the hope that it will be useful, but
|
---|
18 | * WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
19 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
---|
20 | * General Public License for more details.
|
---|
21 | *
|
---|
22 | * You should have received a copy of the GNU General Public License
|
---|
23 | * along with this program; if not, see <https://www.gnu.org/licenses>.
|
---|
24 | *
|
---|
25 | * The contents of this file may alternatively be used under the terms
|
---|
26 | * of the Common Development and Distribution License Version 1.0
|
---|
27 | * (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
|
---|
28 | * in the VirtualBox distribution, in which case the provisions of the
|
---|
29 | * CDDL are applicable instead of those of the GPL.
|
---|
30 | *
|
---|
31 | * You may elect to license modified versions of this file under the
|
---|
32 | * terms and conditions of either the GPL or the CDDL or both.
|
---|
33 | *
|
---|
34 | * SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
|
---|
35 | */
|
---|
36 |
|
---|
37 |
|
---|
38 | /*********************************************************************************************************************************
|
---|
39 | * Header Files *
|
---|
40 | *********************************************************************************************************************************/
|
---|
41 | #include "bs3kit-template-header.h"
|
---|
42 | #include <iprt/asm.h>
|
---|
43 |
|
---|
44 |
|
---|
45 | #undef Bs3SlabAllocEx
|
---|
46 | BS3_CMN_DEF(void BS3_FAR *, Bs3SlabAllocEx,(PBS3SLABCTL pSlabCtl, uint16_t cChunks, uint16_t fFlags))
|
---|
47 | {
|
---|
48 | BS3_ASSERT(cChunks > 0);
|
---|
49 | if (pSlabCtl->cFreeChunks >= cChunks)
|
---|
50 | {
|
---|
51 | int32_t iBit = ASMBitFirstClear(&pSlabCtl->bmAllocated, pSlabCtl->cChunks);
|
---|
52 | if (iBit >= 0)
|
---|
53 | {
|
---|
54 | BS3_ASSERT(!ASMBitTest(&pSlabCtl->bmAllocated, iBit));
|
---|
55 |
|
---|
56 | while ((uint32_t)iBit + cChunks <= pSlabCtl->cChunks)
|
---|
57 | {
|
---|
58 | /* Check that we've got the requested number of free chunks here. */
|
---|
59 | uint16_t i;
|
---|
60 | for (i = 1; i < cChunks; i++)
|
---|
61 | if (ASMBitTest(&pSlabCtl->bmAllocated, iBit + i))
|
---|
62 | break;
|
---|
63 | if (i == cChunks)
|
---|
64 | {
|
---|
65 | /* Check if the chunks are all in the same tiled segment. */
|
---|
66 | BS3_XPTR_AUTO(void, pvRet);
|
---|
67 | BS3_XPTR_SET_FLAT(void, pvRet,
|
---|
68 | BS3_XPTR_GET_FLAT(uint8_t, pSlabCtl->pbStart) + ((uint32_t)iBit << pSlabCtl->cChunkShift));
|
---|
69 | if ( !(fFlags & BS3_SLAB_ALLOC_F_SAME_TILE)
|
---|
70 | || (BS3_XPTR_GET_FLAT(void, pvRet) >> 16)
|
---|
71 | == ((BS3_XPTR_GET_FLAT(void, pvRet) + ((uint32_t)cChunks << pSlabCtl->cChunkShift) - 1) >> 16) )
|
---|
72 | {
|
---|
73 | /* Complete the allocation. */
|
---|
74 | void *fpRet;
|
---|
75 | for (i = 0; i < cChunks; i++)
|
---|
76 | ASMBitSet(&pSlabCtl->bmAllocated, iBit + i);
|
---|
77 | pSlabCtl->cFreeChunks -= cChunks;
|
---|
78 | fpRet = BS3_XPTR_GET(void, pvRet);
|
---|
79 | #if ARCH_BITS == 16
|
---|
80 | BS3_ASSERT(fpRet != NULL);
|
---|
81 | #endif
|
---|
82 | return fpRet;
|
---|
83 | }
|
---|
84 |
|
---|
85 | /*
|
---|
86 | * We're crossing a tiled segment boundrary.
|
---|
87 | * Skip to the start of the next segment and retry there.
|
---|
88 | * (We already know that the first chunk in the next tiled
|
---|
89 | * segment is free, otherwise we wouldn't have a crossing.)
|
---|
90 | */
|
---|
91 | BS3_ASSERT(((uint32_t)cChunks << pSlabCtl->cChunkShift) <= _64K);
|
---|
92 | i = BS3_XPTR_GET_FLAT_LOW(void, pvRet);
|
---|
93 | i = UINT16_C(0) - i;
|
---|
94 | i >>= pSlabCtl->cChunkShift;
|
---|
95 | iBit += i;
|
---|
96 | }
|
---|
97 | else
|
---|
98 | {
|
---|
99 | /*
|
---|
100 | * Continue searching.
|
---|
101 | */
|
---|
102 | iBit = ASMBitNextClear(&pSlabCtl->bmAllocated, pSlabCtl->cChunks, iBit + i);
|
---|
103 | if (iBit < 0)
|
---|
104 | break;
|
---|
105 | }
|
---|
106 | }
|
---|
107 | }
|
---|
108 | }
|
---|
109 | return NULL;
|
---|
110 | }
|
---|
111 |
|
---|