mirror of
https://github.com/intel/compute-runtime.git
synced 2026-01-10 15:12:56 +08:00
Update all L0 Sysman getHandle routines to match spec.
Updated all the getHandle routines to use the following
algorithm:
n = min(*pCount, available)
if (*pCount == 0 || *pCount > available) {
*pCount = available;
}
if (pArrayn != nullptr) {
for(i = 0; i < n; i++) {
pArray[i] = handle[i];
}
}
Change-Id: I3b2a2170c2b52d1651bddae4f85f361fd86167a0
Signed-off-by: Bill Jordan <bill.jordan@intel.com>
This commit is contained in:
@@ -5,6 +5,8 @@
|
||||
*
|
||||
*/
|
||||
|
||||
#include "shared/source/helpers/basic_math.h"
|
||||
|
||||
#include "level_zero/tools/source/sysman/ras/ras_imp.h"
|
||||
|
||||
namespace L0 {
|
||||
@@ -28,18 +30,16 @@ void RasHandleContext::init() {
|
||||
}
|
||||
ze_result_t RasHandleContext::rasGet(uint32_t *pCount,
|
||||
zet_sysman_ras_handle_t *phRas) {
|
||||
if (nullptr == phRas) {
|
||||
*pCount = static_cast<uint32_t>(handleList.size());
|
||||
return ZE_RESULT_SUCCESS;
|
||||
uint32_t handleListSize = static_cast<uint32_t>(handleList.size());
|
||||
uint32_t numToCopy = std::min(*pCount, handleListSize);
|
||||
if (0 == *pCount || *pCount > handleListSize) {
|
||||
*pCount = handleListSize;
|
||||
}
|
||||
uint32_t i = 0;
|
||||
for (Ras *ras : handleList) {
|
||||
if (i >= *pCount) {
|
||||
break;
|
||||
if (nullptr != phRas) {
|
||||
for (uint32_t i = 0; i < numToCopy; i++) {
|
||||
phRas[i] = handleList[i]->toHandle();
|
||||
}
|
||||
phRas[i++] = ras->toHandle();
|
||||
}
|
||||
*pCount = i;
|
||||
return ZE_RESULT_SUCCESS;
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user