Home
last modified time | relevance | path

Searched refs:gateList_ (Results 1 - 6 of 6) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/compiler/
H A Duseless_gate_elimination.cpp34 circuit_->GetAllGates(gateList_); in InitList()
35 for (auto gate : gateList_) { in InitList()
70 for (auto gate : gateList_) { in EliminateUnmarkedGate()
H A Dgraph_linearizer.h29 GateRegion(Chunk* chunk) : gateList_(chunk), preds_(chunk), in GateRegion()
35 gateList_.emplace_back(gate); in AddGate()
140 gateList_.insert(gateList_.end(), gates.begin(), gates.end()); in AddGates()
145 return gateList_; in GetGates()
163 gateList_.clear(); in Clear()
232 ChunkVector<GateRef> gateList_; member in panda::ecmascript::kungfu::GateRegion
H A Duseless_gate_elimination.h42 std::vector<GateRef> gateList_; member in panda::ecmascript::kungfu::UselessGateElimination
H A Dstate_split_linearizer.cpp133 auto curGate = curRegion->gateList_[currentIndex_]; in TryFindDependStart()
151 ASSERT(curRegion->gateList_.size() > 0); in VisitRegion()
153 currentIndex_ = static_cast<int32_t>(curRegion->gateList_.size() - 1); // 1: -1 for size in VisitRegion()
160 auto curGate = curRegion->gateList_[currentIndex_]; in VisitRegion()
216 auto curGate = curRegion->gateList_[currentIndex_]; in TryInsertRelay()
H A Dgraph_linearizer.cpp903 regionList_.front()->gateList_.emplace_back(*useIt); in LinearizeRegions()
921 for (auto g : gateList_) { in IsSimple()
1026 auto front = bb->gateList_.front(); in PrintGraph()
1046 for (auto it = bb->gateList_.crbegin(); it != bb->gateList_.crend(); it++) { in PrintGraph()
H A Darray_bounds_check_elimination.cpp962 auto& gateList_ = block->GetGates(); in CalcBounds() local
963 for (size_t i = 0; i < gateList_.size(); i++) { // Visit GateUnion in CalcBounds()
964 GateRef gate = gateList_[i]; in CalcBounds()

Completed in 8 milliseconds