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
|
/*
* Copyright (c) 2017, Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
//!
//! \file heap_manager.cpp
//! \brief Implements functionalities pertaining to the heap manager.
//!
#include "heap_manager.h"
HeapManager::~HeapManager()
{
HEAP_FUNCTION_ENTER;
m_currHeapId = 0;
m_currHeapSize = 0;
m_extendHeapSize = 0;
m_osInterface = nullptr;
}
MOS_STATUS HeapManager::AcquireSpace(
MemoryBlockManager::AcquireParams ¶ms,
std::vector<MemoryBlock> &blocks,
uint32_t &spaceNeeded)
{
HEAP_FUNCTION_ENTER;
// first time space is being acquired, allocate the first heap
if (m_heapIds.empty())
{
HEAP_CHK_STATUS(AllocateHeap(m_currHeapSize));
}
if (m_behavior != Behavior::clientControlled)
{
if (params.m_staticBlock)
{
HEAP_ASSERTMESSAGE("Static blocks are only allowed when the client controls behavior");
return MOS_STATUS_INVALID_PARAMETER;
}
if (!m_blockManager.IsTrackerDataValid())
{
HEAP_ASSERTMESSAGE("A tracker must be registered before acquiring space if client does not control behavior");
return MOS_STATUS_INVALID_PARAMETER;
}
}
spaceNeeded = 0;
if ((m_blockManager.AcquireSpace(params, blocks, spaceNeeded)) ==
MOS_STATUS_CLIENT_AR_NO_SPACE)
{
bool blocksUpdated = false;
// no need to refresh the block states for every space acquisition
// attempt for first AcquireSpace failure
HEAP_CHK_STATUS(m_blockManager.RefreshBlockStates(blocksUpdated));
if (blocksUpdated)
{
if ((m_blockManager.AcquireSpace(params, blocks, spaceNeeded)) ==
MOS_STATUS_CLIENT_AR_NO_SPACE)
{
// if space may not be acquired after refreshing block states, execute behavior
HEAP_CHK_STATUS(BehaveWhenNoSpace());
HEAP_CHK_STATUS(m_blockManager.AcquireSpace(params, blocks, spaceNeeded));
}
}
else
{
// if no blocks updated after refresh, execute behavior
HEAP_CHK_STATUS(BehaveWhenNoSpace());
HEAP_CHK_STATUS(m_blockManager.AcquireSpace(params, blocks, spaceNeeded));
}
}
return MOS_STATUS_SUCCESS;
}
MOS_STATUS HeapManager::ClearSpace(MemoryBlock &block)
{
HEAP_FUNCTION_ENTER;
if (m_behavior != clientControlled)
{
HEAP_ASSERTMESSAGE("Only client controlled behavior allows for clients to clear space");
return MOS_STATUS_INVALID_PARAMETER;
}
HEAP_CHK_STATUS(m_blockManager.ClearSpace(block))
return MOS_STATUS_SUCCESS;
}
MOS_STATUS HeapManager::RegisterTrackerResource(uint32_t *trackerData)
{
HEAP_FUNCTION_ENTER;
return m_blockManager.RegisterTrackerResource(trackerData);
}
MOS_STATUS HeapManager::SetInitialHeapSize(uint32_t size)
{
HEAP_FUNCTION_ENTER;
if (size == 0)
{
HEAP_ASSERTMESSAGE("0 is an invalid size for heap extension");
return MOS_STATUS_INVALID_PARAMETER;
}
m_currHeapSize = MOS_ALIGN_CEIL(size, m_heapAlignment);
return MOS_STATUS_SUCCESS;
}
MOS_STATUS HeapManager::SetExtendHeapSize(uint32_t size)
{
HEAP_FUNCTION_ENTER;
if (size == 0)
{
HEAP_ASSERTMESSAGE("0 is an invalid size for heap extension");
return MOS_STATUS_INVALID_PARAMETER;
}
if (m_behavior == Behavior::wait)
{
HEAP_ASSERTMESSAGE("The heap may not be extended in the case of wait behavior");
return MOS_STATUS_INVALID_PARAMETER;
}
m_extendHeapSize = MOS_ALIGN_CEIL(size, m_heapAlignment);
return MOS_STATUS_SUCCESS;
}
MOS_STATUS HeapManager::RegisterOsInterface(PMOS_INTERFACE osInterface)
{
HEAP_FUNCTION_ENTER;
HEAP_CHK_NULL(osInterface);
m_osInterface = osInterface;
HEAP_CHK_STATUS(m_blockManager.RegisterOsInterface(m_osInterface));
return MOS_STATUS_SUCCESS;
}
uint32_t HeapManager::GetTotalSize()
{
HEAP_FUNCTION_ENTER;
uint32_t totalSize = m_blockManager.GetSize();
// Since allocation is delayed to when space is acquired, it is possible
// for manager to be in a valid state if a size of 0 is returned.
if (totalSize == 0 && m_currHeapId == Heap::m_invalidId)
{
totalSize = m_currHeapSize;
}
return totalSize;
}
MOS_STATUS HeapManager::AllocateHeap(uint32_t size)
{
HEAP_FUNCTION_ENTER;
HEAP_CHK_NULL(m_osInterface);
if (size == 0)
{
HEAP_ASSERTMESSAGE("0 is an invalid size for heap allocation");
return MOS_STATUS_INVALID_PARAMETER;
}
++m_currHeapId;
m_heapIds.push_back(m_currHeapId);
HEAP_CHK_STATUS(m_blockManager.RegisterHeap(m_currHeapId, size));
return MOS_STATUS_SUCCESS;
}
void HeapManager::FreeHeap()
{
// Free oldest heap
auto heapId = m_heapIds.front();
m_heapIds.pop_front();
m_blockManager.UnregisterHeap(heapId);
}
MOS_STATUS HeapManager::Wait()
{
HEAP_FUNCTION_ENTER_VERBOSE;
bool blocksUpdated = false;
for (auto waitMs = m_waitTimeout; waitMs > 0; waitMs -= m_waitIncrement)
{
MOS_Sleep(m_waitIncrement);
HEAP_CHK_STATUS(m_blockManager.RefreshBlockStates(blocksUpdated));
if (blocksUpdated)
{
break;
}
}
return (blocksUpdated) ? MOS_STATUS_SUCCESS : MOS_STATUS_CLIENT_AR_NO_SPACE;
}
MOS_STATUS HeapManager::BehaveWhenNoSpace()
{
HEAP_FUNCTION_ENTER_VERBOSE;
switch (m_behavior)
{
case wait:
HEAP_CHK_STATUS(Wait());
break;
case extend:
m_currHeapSize += m_extendHeapSize;
HEAP_CHK_STATUS(AllocateHeap(m_currHeapSize));
break;
case destructiveExtend:
FreeHeap();
m_currHeapSize += m_extendHeapSize;
HEAP_CHK_STATUS(AllocateHeap(m_currHeapSize));
break;
case waitAndExtend:
if (Wait() == MOS_STATUS_CLIENT_AR_NO_SPACE)
{
m_currHeapSize += m_extendHeapSize;
HEAP_CHK_STATUS(AllocateHeap(m_currHeapSize));
}
break;
case clientControlled:
// heap manager gives control back to the client
return MOS_STATUS_CLIENT_AR_NO_SPACE;
default:
HEAP_ASSERTMESSAGE("The requested behavior is not yet implemented");
return MOS_STATUS_UNIMPLEMENTED;
}
return MOS_STATUS_SUCCESS;
}
|