mirror of
https://github.com/intel/compute-runtime.git
synced 2026-01-14 02:32:59 +08:00
c64eab402e
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>
43 lines
1023 B
C++
43 lines
1023 B
C++
/*
|
|
* Copyright (C) 2019-2020 Intel Corporation
|
|
*
|
|
* SPDX-License-Identifier: MIT
|
|
*
|
|
*/
|
|
|
|
#include "standby.h"
|
|
|
|
#include "shared/source/helpers/basic_math.h"
|
|
|
|
#include "standby_imp.h"
|
|
|
|
namespace L0 {
|
|
|
|
StandbyHandleContext::~StandbyHandleContext() {
|
|
for (Standby *pStandby : handleList) {
|
|
delete pStandby;
|
|
}
|
|
}
|
|
|
|
ze_result_t StandbyHandleContext::init() {
|
|
Standby *pStandby = new StandbyImp(pOsSysman);
|
|
handleList.push_back(pStandby);
|
|
return ZE_RESULT_SUCCESS;
|
|
}
|
|
|
|
ze_result_t StandbyHandleContext::standbyGet(uint32_t *pCount, zet_sysman_standby_handle_t *phStandby) {
|
|
uint32_t handleListSize = static_cast<uint32_t>(handleList.size());
|
|
uint32_t numToCopy = std::min(*pCount, handleListSize);
|
|
if (0 == *pCount || *pCount > handleListSize) {
|
|
*pCount = handleListSize;
|
|
}
|
|
if (nullptr != phStandby) {
|
|
for (uint32_t i = 0; i < numToCopy; i++) {
|
|
phStandby[i] = handleList[i]->toHandle();
|
|
}
|
|
}
|
|
return ZE_RESULT_SUCCESS;
|
|
}
|
|
|
|
} // namespace L0
|