| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| H A D | state_split_linearizer.cpp | 234 auto &edge = map_.GetEdge(curRegion->preds_[0], curRegion); in TryLoadDependStart() local
235 ASSERT(edge.dependOut != Circuit::NullGate()); in TryLoadDependStart()
236 replacement_.SetDepend(edge.dependOut); in TryLoadDependStart()
237 frameState_ = edge.frameStateOut; in TryLoadDependStart()
264 auto &edge = map_.GetEdge(pred, curRegion); in ConnectStateDepend() local
266 if (edge.stateOut == Circuit::NullGate()) { in ConnectStateDepend()
267 ASSERT(edge.dependOut == Circuit::NullGate()); in ConnectStateDepend()
270 ConnectEdge(edge, currentState, stateInput, i); in ConnectStateDepend()
275 void ConnectEdge(RegionEdge& edge, GateRef currentState, GateRef stateInput, size_t i) in ConnectEdge() argument
277 if (edge in ConnectEdge()
296 auto &edge = map_.GetEdge(regionEdge.from, regionEdge.to); ConnectPendingRegionEdges() local
310 auto &edge = map_.GetEdge(curRegion, succ); StoreStateDepend() local
[all...] |
| H A D | graph_editor.cpp | 62 Edge& edge = workList_.back(); in RemoveGate() local
63 GateRef gate = edge.GetGate(); in RemoveGate()
75 PropagateMerge(edge); in RemoveGate()
78 PropagateGate(edge); in RemoveGate()
84 void GraphEditor::PropagateGate(const Edge& edge) in PropagateGate() argument
86 GateRef gate = edge.GetGate(); in PropagateGate()
88 if (acc_.IsStateIn(gate, edge.GetIndex())) { in PropagateGate()
95 if (acc_.IsValueIn(gate, edge.GetIndex())) { in PropagateGate()
101 void GraphEditor::PropagateMerge(const Edge& edge) in PropagateMerge() argument
103 GateRef gate = edge in PropagateMerge()
[all...] |
| H A D | graph_editor.h | 38 void PropagateGate(const Edge& edge);
39 void PropagateMerge(const Edge& edge);
|
| H A D | graph_linearizer.cpp | 641 void VisitUpperBoundGate(Edge edge) in VisitUpperBoundGate() argument
643 GateRef succGate = edge.GetGate(); in VisitUpperBoundGate()
649 auto curGate = acc_.GetIn(succGate, edge.GetIndex()); in VisitUpperBoundGate()
674 void VisitPreparedGate(Edge edge) in VisitPreparedGate() argument
676 auto curGate = edge.GetGate(); in VisitPreparedGate()
677 auto prevGate = acc_.GetIn(curGate, edge.GetIndex()); in VisitPreparedGate()
|
| /arkcompiler/runtime_core/static_core/runtime/ |
| H A D | lock_order_graph.h | 50 for (auto const &edge : edges_) { in LockOrderGraph()
51 if (nodes_[edge.second]) { in LockOrderGraph()
52 LOG(DEBUG, RUNTIME) << "Edge in LockOrderGraph: " << edge.first << " -> " << edge.second << " [T]"; in LockOrderGraph()
54 LOG(DEBUG, RUNTIME) << "Edge in LockOrderGraph: " << edge.first << " -> " << edge.second; in LockOrderGraph()
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/ |
| H A D | alias_analysis.cpp | 48 * variable is a node in the graph, and an edge from Q to P is added for each
52 * edges, such that an edge from Q to P causes Sol(P) <- Sol(P) union Sol(Q).
241 auto edge = sorted.begin(); in DumpChains() local
242 if (edge != sorted.end()) { in DumpChains()
243 edge->Dump(out); in DumpChains()
244 while (++edge != sorted.end()) { in DumpChains()
246 edge->Dump(out); in DumpChains()
507 void AliasAnalysis::SolveConstraintsMainLoop(Pointer &ref, Pointer &edge, bool &added, PointerSet &sols) in SolveConstraintsMainLoop() argument
511 if (edge.GetType() == OBJECT_FIELD && ref.GetBase() == edge in SolveConstraintsMainLoop()
[all...] |
| H A D | loop_analyzer.cpp | 79 * While doing DFS, if we encounter a block with a gray mark, then edge to this block is back edge.
97 * Append information about its header, back edge and check if this loop is irreducible.
98 * Loop is irreducible when its header doesn't dominate back edge.
160 auto edge = header->GetPredBlockByIndex(predIdx); in UpdateControlFlowWithPreHeader() local
161 edge->ReplaceSucc(header, preHeader); in UpdateControlFlowWithPreHeader()
162 header->RemovePred(edge); in UpdateControlFlowWithPreHeader()
167 auto edge = header->GetPredBlockByIndex(fwEdgesIndexes[0]); in UpdateControlFlowWithPreHeader() local
168 edge->ReplaceSucc(header, preHeader); in UpdateControlFlowWithPreHeader()
169 header->ReplacePred(edge, preHeade in UpdateControlFlowWithPreHeader()
[all...] |
| H A D | alias_analysis.h | 428 void SolveConstraintsMainLoop(Pointer &ref, Pointer &edge, bool &added, PointerSet &sols);
|
| /arkcompiler/runtime_core/bytecode_optimizer/constant_propagation/ |
| H A D | constant_propagation.h | 56 uint32_t operator()(Edge const &edge) const in operator ()()
59 uint32_t lhash = block_hash(edge.first); in operator ()()
60 uint32_t rhash = block_hash(edge.second); in operator ()()
|
| H A D | constant_propagation.cpp | 72 auto &edge = flow_edges_.front(); in RunFlowEdge() local
75 if (executable_flag_.count(edge) != 0) { in RunFlowEdge()
78 executable_flag_.insert(edge); in RunFlowEdge()
79 auto dest = edge.second; in RunFlowEdge()
379 auto edge = Edge(src, dst); in AddUntraversedFlowEdges() local
380 if (executable_flag_.count(edge) != 0) { in AddUntraversedFlowEdges()
383 flow_edges_.push(edge); in AddUntraversedFlowEdges()
|
| /arkcompiler/ets_runtime/ecmascript/dfx/hprof/ |
| H A D | heap_snapshot_json_serializer.cpp | 173 for (auto *edge : *edges) { in SerializeEdges()
174 StringId nameOrIndex = edge->GetType() == EdgeType::ELEMENT ? in SerializeEdges()
175 edge->GetIndex() : stringTable->GetStringId(edge->GetName()); in SerializeEdges()
179 writer->WriteNumber(static_cast<int>(edge->GetType())); // 1. in SerializeEdges()
185 writer->WriteNumber(edge->GetTo()->GetIndex() * Node::NODE_FIELD_COUNT); // 3. in SerializeEdges()
188 writer->WriteNumber(edge->GetTo()->GetIndex() * Node::NODE_FIELD_COUNT); // 3. in SerializeEdges()
|
| H A D | heap_snapshot.cpp | 50 auto edge = chunk->New<Edge>(type, from, to, name); in NewEdge() local
51 if (UNLIKELY(edge == nullptr)) { in NewEdge()
55 return edge; in NewEdge()
60 auto edge = chunk->New<Edge>(type, from, to, index); in NewEdge() local
61 if (UNLIKELY(edge == nullptr)) { in NewEdge()
65 return edge; in NewEdge()
73 for (Edge *edge : edges_) { in ~HeapSnapshot()
74 chunk_->Delete(edge); in ~HeapSnapshot()
1072 Edge *edge = (it.type_ == Reference::ReferenceType::ELEMENT) ? in FillEdges() local
1076 InsertEdgeUnique(edge); in FillEdges()
1123 Edge *edge = (it.type_ == Reference::ReferenceType::ELEMENT) ? FillEdgesForBinMod() local
1141 Edge *edge = Edge::NewEdge(chunk_, AddSyntheticRootForBinMod() local
1252 InsertEdgeUnique(Edge *edge) InsertEdgeUnique() argument
1323 InsertEdgeAt(size_t pos, Edge *edge) InsertEdgeAt() argument
[all...] |
| H A D | heap_snapshot.h | 542 Edge *InsertEdgeUnique(Edge *edge);
547 Edge *InsertEdgeAt(size_t pos, Edge *edge);
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| H A D | loop_analyzer.cpp | 79 * While doing DFS, if we encounter a block with a gray mark, then edge to this block is back edge.
97 * Append information about its header, back edge and check if this loop is irreducible.
98 * Loop is irreducible when its header doesn't dominate back edge.
160 auto edge = header->GetPredBlockByIndex(pred_idx); in UpdateControlFlowWithPreHeader() local
161 edge->ReplaceSucc(header, pre_header); in UpdateControlFlowWithPreHeader()
162 header->RemovePred(edge); in UpdateControlFlowWithPreHeader()
167 auto edge = header->GetPredBlockByIndex(fw_edges_indexes[0]); in UpdateControlFlowWithPreHeader() local
168 edge->ReplaceSucc(header, pre_header); in UpdateControlFlowWithPreHeader()
169 header->ReplacePred(edge, pre_heade in UpdateControlFlowWithPreHeader()
[all...] |
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
| H A D | loop_unroll.cpp | 108 // Unroll loop without side-exits and fix compare in the pre-header and back-edge in TransformLoopImpl()
120 // Unroll loop without side-exits and fix compare in the pre-header and back-edge in TransformLoopImpl()
257 void NormalizeControlFlow(BasicBlock *edge, const BasicBlock *loopHeader) in NormalizeControlFlow() argument
259 auto ifImm = edge->GetLastInst()->CastToIfImm(); in NormalizeControlFlow()
263 edge->SwapTrueFalseSuccessors<true>(); in NormalizeControlFlow()
267 auto newCmp = cmp->Clone(edge->GetGraph()); in NormalizeControlFlow()
272 if (edge->GetFalseSuccessor() == loopHeader) { in NormalizeControlFlow()
275 edge->SwapTrueFalseSuccessors<true>(); in NormalizeControlFlow()
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/ir/ |
| H A D | graph_cloner.h | 191 for (auto edge : *blockEdges) { in CloneEdges()
192 cloneEdges->push_back(GetClone(edge)); in CloneEdges()
200 for (auto edge : *blockEdges) { in CloneEdges()
201 cloneEdges->push_back(GetClone(edge)); in CloneEdges()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir/ |
| H A D | graph_cloner.h | 317 for (auto edge : *block_edges) { in CloneEdges()
318 clone_edges->push_back(GetClone(edge)); in CloneEdges()
|
| /arkcompiler/runtime_core/compiler/tools/ |
| H A D | draw_cfg.py | 138 dot.edge(str(block.id), str(succ))
|
| /arkcompiler/ets_frontend/es2panda/test/compiler/js/ |
| H A D | cocos_worker_test.js | 20347 t.EDGE = "edge";
[all...] |