Searched refs:isAncestor (Results 1 - 5 of 5) sorted by relevance
/arkcompiler/ets_runtime/ecmascript/compiler/ |
H A D | verifier.h | 42 const std::function<bool(size_t, size_t)> &isAncestor); 48 const std::function<bool(size_t, size_t)> &isAncestor); 60 const std::function<bool(size_t, size_t)> &isAncestor,
|
H A D | verifier.cpp | 193 const std::function<bool(size_t, size_t)> &isAncestor) in RunCFGReducibilityCheck() 204 bool isDom = isAncestor(bbGatesAddrToIdx.at(*use), bbGatesAddrToIdx.at(curGate)); in RunCFGReducibilityCheck() 230 const std::function<bool(size_t, size_t)> &isAncestor) in RunFixedGatesRelationsCheck() 245 if (!isAncestor(a, b)) { in RunFixedGatesRelationsCheck() 387 const std::function<bool(size_t, size_t)> &isAncestor, in RunSchedulingBoundsCheck() 393 if (!Scheduler::CalculateSchedulingUpperBound(circuit, bbGatesAddrToIdx, isAncestor, in RunSchedulingBoundsCheck() 407 if (!isAncestor(upperBound.at(item.first), lowerBound.at(item.first))) { in RunSchedulingBoundsCheck() 555 auto isAncestor = [timeIn, timeOut](size_t nodeA, size_t nodeB) -> bool { in Run() local 559 if (isAncestor(nodeA, nodeB)) { in Run() 562 if (isAncestor(node in Run() 191 RunCFGReducibilityCheck(const Circuit *circuit, const std::vector<GateRef> &bbGatesList, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, const std::function<bool(size_t, size_t)> &isAncestor) RunCFGReducibilityCheck() argument 228 RunFixedGatesRelationsCheck(const Circuit *circuit, const std::vector<GateRef> &fixedGatesList, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, const std::function<bool(size_t, size_t)> &isAncestor) RunFixedGatesRelationsCheck() argument 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 [all...] |
H A D | scheduler.cpp | 190 auto isAncestor = [&](size_t nodeA, size_t nodeB) -> bool { in Run() local 194 if (isAncestor(nodeA, nodeB)) { in Run() 197 if (isAncestor(nodeB, nodeA)) { in Run() 201 if (!isAncestor(jumpUp[nodeA][stepSize - 1], nodeB)) { in Run() 239 const std::function<bool(size_t, size_t)> &isAncestor, in CalculateSchedulingUpperBound() 302 if (!isAncestor(curUpperBound, predUpperBound) && !isAncestor(predUpperBound, curUpperBound)) { in CalculateSchedulingUpperBound() 307 if (isAncestor(curUpperBound, predUpperBound)) { in CalculateSchedulingUpperBound() 237 CalculateSchedulingUpperBound(const Circuit *circuit, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, const std::function<bool(size_t, size_t)> &isAncestor, const std::vector<GateRef> &schedulableGatesList, std::unordered_map<GateRef, size_t> &upperBound) CalculateSchedulingUpperBound() argument
|
H A D | scheduler.h | 35 const std::function<bool(size_t, size_t)> &isAncestor,
|
/arkcompiler/ets_frontend/es2panda/test/compiler/js/ |
H A D | cocos_worker_test.js | [all...] |
Completed in 34 milliseconds