| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| D | graph_editor.cpp | 60 Edge& edge = workList_.back(); in RemoveGate() local
82 void GraphEditor::PropagateGate(const Edge& edge) in PropagateGate()
99 void GraphEditor::PropagateMerge(const Edge& edge) in PropagateMerge()
|
| D | state_split_linearizer.cpp | 233 auto &edge = map_.GetEdge(curRegion->preds_[0], curRegion); in TryLoadDependStart() local
263 auto &edge = map_.GetEdge(pred, curRegion); in ConnectStateDepend() local
274 void ConnectEdge(RegionEdge& edge, GateRef currentState, GateRef stateInput, size_t i) in ConnectEdge()
295 auto &edge = map_.GetEdge(regionEdge.from, regionEdge.to); in ConnectPendingRegionEdges() local
312 auto &edge = map_.GetEdge(curRegion, succ); in StoreStateDepend() local
|
| D | graph_linearizer.cpp | 639 void VisitUpperBoundGate(Edge edge) in VisitUpperBoundGate()
672 void VisitPreparedGate(Edge edge) in VisitPreparedGate()
|
| /arkcompiler/ets_frontend/ets2panda/linter/homecheck/src/tools/depGraph/ |
| D | fileDeps.ts | 46 const edge = depsGraph.addEdge(src, dst, {kind: 0, attr: new Map()}); constant
|
| D | moduleDeps.ts | 46 const edge = depsGraph.addEdge(src, dst, { kind: 0 }); constant
|
| /arkcompiler/ets_frontend/ets2panda/linter/arkanalyzer/src/save/ |
| D | GraphPrinter.ts | 120 for (let edge of node.getOutgoingEdges()) { variable
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/ |
| D | alias_analysis.cpp | 206 auto edge = sorted.begin(); in DumpChains() local
525 void AliasAnalysis::SolveConstraintsMainLoop(const PointerWithInfo *ref, PointerWithInfo *edge, boo… in SolveConstraintsMainLoop()
705 auto *edge = &GetPointerInfo(edgePointer); in SolveConstraints() local
|
| D | loop_analyzer.cpp | 164 auto edge = header->GetPredBlockByIndex(predIdx); in UpdateControlFlowWithPreHeader() local
171 auto edge = header->GetPredBlockByIndex(fwEdgesIndexes[0]); in UpdateControlFlowWithPreHeader() local
|
| /arkcompiler/ets_frontend/ets2panda/linter/arkanalyzer/src/core/dataflow/ |
| D | DataflowSolver.ts | 86 let edge: PathEdge<D> = new PathEdge<D>(edgePoint, edgePoint); variable
247 const edge = new PathEdge<D>(start, edgePoint); constant
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| D | loop_analyzer.cpp | 160 auto edge = header->GetPredBlockByIndex(pred_idx); in UpdateControlFlowWithPreHeader() local
167 auto edge = header->GetPredBlockByIndex(fw_edges_indexes[0]); in UpdateControlFlowWithPreHeader() local
|
| /arkcompiler/ets_runtime/ecmascript/dfx/hprof/ |
| D | heap_snapshot.cpp | 48 auto edge = chunk.New<Edge>(type, from, to, name); in NewEdge() local
58 auto edge = chunk.New<Edge>(type, from, to, index); in NewEdge() local
1187 Edge *edge = (it.type_ == Reference::ReferenceType::ELEMENT) ? in FillEdges() local
1280 Edge *HeapSnapshot::InsertEdgeUnique(Edge *edge) in InsertEdgeUnique()
1319 …Edge *edge = Edge::NewEdge(chunk_, EdgeType::SHORTCUT, syntheticRoot, rootNode, GetString("-subroo… in NewRootEdge() local
1448 Edge *HeapSnapshot::InsertEdgeAt(size_t pos, Edge *edge) in InsertEdgeAt()
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
| D | loop_unroll.cpp | 262 void NormalizeControlFlow(BasicBlock *edge, const BasicBlock *loopHeader) in NormalizeControlFlow()
|
| /arkcompiler/runtime_core/bytecode_optimizer/constant_propagation/ |
| D | constant_propagation.cpp | 68 auto &edge = flow_edges_.front(); in RunFlowEdge() local
375 auto edge = Edge(src, dst); in AddUntraversedFlowEdges() local
|
| /arkcompiler/ets_frontend/ets2panda/linter/arkanalyzer/src/callgraph/pointerAnalysis/ |
| D | Pag.ts | 984 let edge = new PagEdge(src, dst, kind, stmt); variable
|
| D | PagBuilder.ts | 1466 for (const edge of edges) { constant
|
| /arkcompiler/ets_runtime/ecmascript/dfx/hprof/rawheap_translate/ |
| D | rawheap_translate.cpp | 169 Edge *edge = new Edge(toNode, indexOrStrId, type); in InsertEdge() local
|
| /arkcompiler/ets_frontend/es2panda/test/compiler/js/ |
| D | cocos_worker_test.js | 35655 edge(t, e) { method in anonymousFunction63e674a939400.iw
|