2 * Copyright (c) 2015 Advanced Micro Devices, Inc.
5 * For use for simulation and test purposes only
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are met:
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright notice,
14 * this list of conditions and the following disclaimer in the documentation
15 * and/or other materials provided with the distribution.
17 * 3. Neither the name of the copyright holder nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
22 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
25 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 * POSSIBILITY OF SUCH DAMAGE.
33 * Author: John Kalamatianos
36 #include "gpu-compute/simple_pool_manager.hh"
38 #include "base/logging.hh"
40 // return the min number of elements that the manager can reserve given
41 // a request for "size" elements
43 SimplePoolManager::minAllocatedElements(uint32_t size
)
45 fatal_if(size
<= 0 || size
> poolSize(), "Illegal VGPR region size=%d\n",
48 return size
% minAllocation() > 0 ?
49 (minAllocation() - (size
% minAllocation())) + size
: size
;
53 SimplePoolManager::printRegion()
56 if (_reservedGroups
== 0)
57 _cout
= "VRF is empty\n";
58 else if (_reservedGroups
> 0) {
59 uint32_t reservedEntries
= _reservedGroups
* _regionSize
;
60 _cout
= "VRF reserves " + std::to_string(reservedEntries
) + " VGPRs\n";
67 SimplePoolManager::canAllocate(uint32_t numRegions
, uint32_t size
)
69 assert(numRegions
* minAllocatedElements(size
) <= poolSize());
71 return _reservedGroups
== 0;
75 SimplePoolManager::freeRegion(uint32_t firstIdx
, uint32_t lastIdx
)
77 assert(_reservedGroups
> 0);
85 SimplePoolManager::allocateRegion(const uint32_t size
,
86 uint32_t *reservedPoolSize
)
88 uint32_t actualSize
= minAllocatedElements(size
);
89 uint32_t startIdx
= _nxtFreeIdx
;
90 _nxtFreeIdx
+= actualSize
;
91 _regionSize
= actualSize
;
92 assert(_nxtFreeIdx
< poolSize());
93 *reservedPoolSize
= actualSize
;
100 SimplePoolManager::regionSize(std::pair
<uint32_t, uint32_t> ®ion
)
102 bool wrapAround
= (region
.first
> region
.second
);
104 return region
.second
- region
.first
+ 1;
106 return region
.second
+ poolSize() - region
.first
+ 1;