Home
last modified time | relevance | path

Searched defs:isAncestor (Results 1 - 2 of 2) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/compiler/
H A Dverifier.cpp555 auto isAncestor = [timeIn, timeOut](size_t nodeA, size_t nodeB) -> bool { in Run() local
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 Dscheduler.cpp190 auto isAncestor = [&](size_t nodeA, size_t nodeB) -> bool { in Run() local
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

Completed in 3 milliseconds