Searched refs:lowestCommonAncestor (Results 1 - 4 of 4) sorted by relevance
| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| H A D | scheduler.h | 41 const std::function<size_t(size_t, size_t)> &lowestCommonAncestor,
|
| H A D | verifier.h | 61 const std::function<size_t(size_t, size_t)> &lowestCommonAncestor);
|
| H A D | scheduler.cpp | 193 auto lowestCommonAncestor = [&](size_t nodeA, size_t nodeB) -> size_t { in Run() local
210 Scheduler::CalculateSchedulingLowerBound(circuit, bbGatesAddrToIdx, lowestCommonAncestor, lowerBound, &order); in Run()
362 const std::function<size_t(size_t, size_t)> &lowestCommonAncestor, 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 | verifier.cpp | 388 const std::function<size_t(size_t, size_t)> &lowestCommonAncestor) in RunSchedulingBoundsCheck()
401 Scheduler::CalculateSchedulingLowerBound(circuit, bbGatesAddrToIdx, lowestCommonAncestor, lowerBound); in RunSchedulingBoundsCheck()
558 auto lowestCommonAncestor = [&](size_t nodeA, size_t nodeB) -> size_t { in Run() local
611 if (!RunSchedulingBoundsCheck(circuit, schedulableGatesList, bbGatesAddrToIdx, isAncestor, lowestCommonAncestor)) { in Run()
384 RunSchedulingBoundsCheck(const Circuit *circuit, const std::vector<GateRef> &schedulableGatesList, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, const std::function<bool(size_t, size_t)> &isAncestor, const std::function<size_t(size_t, size_t)> &lowestCommonAncestor) RunSchedulingBoundsCheck() argument
|
Completed in 3 milliseconds