Searched refs:lowerBound (Results 1 - 4 of 4) sorted by relevance
| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| H A D | scheduler.cpp | 209 std::unordered_map<GateRef, size_t> lowerBound; in Run() local
210 Scheduler::CalculateSchedulingLowerBound(circuit, bbGatesAddrToIdx, lowestCommonAncestor, lowerBound, &order); in Run()
212 result[lowerBound.at(schedulableGate)].push_back(schedulableGate); in Run()
363 std::unordered_map<GateRef, size_t> &lowerBound, in CalculateSchedulingLowerBound()
442 curLowerBound = lowerBound.at(curGate); in CalculateSchedulingLowerBound()
444 if (lowerBound.count(prevGate) == 0) { in CalculateSchedulingLowerBound()
445 lowerBound[prevGate] = curLowerBound; in CalculateSchedulingLowerBound()
447 lowerBound[prevGate] = lowestCommonAncestor(lowerBound[prevGate], curLowerBound); in CalculateSchedulingLowerBound()
360 CalculateSchedulingLowerBound(const Circuit *circuit, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, const std::function<size_t(size_t, size_t)> &lowestCommonAncestor, std::unordered_map<GateRef, size_t> &lowerBound, std::vector<GateRef> *order) CalculateSchedulingLowerBound() argument
|
| H A D | scheduler.h | 42 std::unordered_map<GateRef, size_t> &lowerBound,
|
| H A D | verifier.cpp | 399 std::unordered_map<GateRef, size_t> lowerBound; in RunSchedulingBoundsCheck() local
401 Scheduler::CalculateSchedulingLowerBound(circuit, bbGatesAddrToIdx, lowestCommonAncestor, lowerBound); in RunSchedulingBoundsCheck()
405 ASSERT(upperBound.size() == lowerBound.size()); in RunSchedulingBoundsCheck()
406 for (const auto &item : lowerBound) { in RunSchedulingBoundsCheck()
407 if (!isAncestor(upperBound.at(item.first), lowerBound.at(item.first))) { in RunSchedulingBoundsCheck()
412 LOG_COMPILER(ERROR) << "Lower bound is BB_" << lowerBound.at(item.first); in RunSchedulingBoundsCheck()
|
| /arkcompiler/ets_frontend/es2panda/test/compiler/js/ |
| H A D | cocos_worker_test.js | [all...] |
Completed in 32 milliseconds