bbGatesAddrToIdx (reference) in projects: arkcompiler - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:bbGatesAddrToIdx (Results 1 - 4 of 4) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/compiler/
H A D	scheduler.h	`27 std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, 34 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, 40 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, 51 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx,`
H A D	verifier.h	`36 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx); 41 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, 47 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, 59 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx,`
H A D	scheduler.cpp	46 std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, in CalculateDominatorTree() 77 bbGatesAddrToIdx[bbGatesList[idx]] = idx; in CalculateDominatorTree() 99 if (bbGatesAddrToIdx.count(predGate) > 0) { in CalculateDominatorTree() 100 size_t preGateIdx = bbGatesAddrToIdx[predGate]; in CalculateDominatorTree() 135 std::unordered_map<GateRef, size_t> bbGatesAddrToIdx; in Run() local 137 Scheduler::CalculateDominatorTree(circuit, bbGatesList, bbGatesAddrToIdx, immDom); in Run() 210 Scheduler::CalculateSchedulingLowerBound(circuit, bbGatesAddrToIdx, lowestCommonAncestor, lowerBound, &order); in Run() 227 result[bbGatesAddrToIdx.at(acc.GetIn(succGate, 0))].push_back(succGate); in Run() 238 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, in CalculateSchedulingUpperBound() 262 returnValue = bbGatesAddrToIdx in CalculateSchedulingUpperBound() 44 CalculateDominatorTree(const Circuit circuit, std::vector<GateRef>& bbGatesList, std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, std::vector<size_t> &immDom) CalculateDominatorTree() argument 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 343 CalculateFixedGatesList(const Circuit circuit, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, std::vector<GateRef> &bbAndFixedGatesList) CalculateFixedGatesList() argument 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 468 std::unordered_map<GateRef, size_t> bbGatesAddrToIdx; Print() local [all...]
H A D	verifier.cpp	122 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx) in RunCFGSoundnessCheck() 128 if (bbGatesAddrToIdx.count(predGate) == 0) { in RunCFGSoundnessCheck() 192 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, in RunCFGReducibilityCheck() 204 bool isDom = isAncestor(bbGatesAddrToIdx.at(use), bbGatesAddrToIdx.at(curGate)); in RunCFGReducibilityCheck() 229 const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx, in RunFixedGatesRelationsCheck() 242 auto a = bbGatesAddrToIdx.at(circuit->GetIn(predGate, 0)); in RunFixedGatesRelationsCheck() 243 auto b = bbGatesAddrToIdx.at(circuit->GetIn(circuit->GetIn(fixedGate, 0), in RunFixedGatesRelationsCheck() 252 LOG_COMPILER(ERROR) << "BB_" << bbGatesAddrToIdx.at(circuit->GetIn(predGate, 0)) in RunFixedGatesRelationsCheck() 254 << bbGatesAddrToIdx in RunFixedGatesRelationsCheck() 121 RunCFGSoundnessCheck(const Circuit circuit, const std::vector<GateRef> &bbGatesList, const std::unordered_map<GateRef, size_t> &bbGatesAddrToIdx) RunCFGSoundnessCheck() argument 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 488 std::unordered_map<GateRef, size_t> bbGatesAddrToIdx; Run() local [all...]

Completed in 3 milliseconds