Home
last modified time | relevance | path

Searched refs:graph_ (Results 1 – 25 of 37) sorted by relevance

12

/arkcompiler/runtime_core/compiler/optimizer/
Dpass_manager_statistics.cpp25 : graph_(graph), in PassManagerStatistics()
67 << std::right << std::setw(OFFSET_DEFAULT) << graph_->GetAllocator()->GetAllocatedSize() in PrintStatistics()
68 << std::setw(OFFSET_DEFAULT) << graph_->GetLocalAllocator()->GetAllocatedSize() in PrintStatistics()
77 size_t allocated_size = graph_->GetAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
87 ASSERT(graph_->GetLocalAllocator()->GetAllocatedSize() >= last_allocated_local_); in ProcessBeforeRun()
88 …top_pass->mem_used_local += graph_->GetLocalAllocator()->GetAllocatedSize() - last_allocated_local… in ProcessBeforeRun()
97 for (auto block : graph_->GetVectorBlocks()) { in ProcessBeforeRun()
110 last_allocated_ir_ = graph_->GetAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
111 last_allocated_local_ = graph_->GetLocalAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
120 ASSERT(graph_->GetAllocator()->GetAllocatedSize() >= last_allocated_ir_); in ProcessAfterRun()
[all …]
Dpass_manager.cpp43 : graph_(graph), in PassManager()
45 … ANALYSES(details::PredefinedAnalyses::Instantiate<Analysis *>(graph_->GetAllocator(), graph_)), in PassManager()
155 ASSERT(graph_->GetLocalAllocator()->GetAllocatedSize() >= local_mem_size_before_pass); in RunPass()
156 …stats_->ProcessAfterRun(graph_->GetLocalAllocator()->GetAllocatedSize() - local_mem_size_before_pa… in RunPass()
174 GraphChecker(graph_).Check(); in RunPass()
182 return graph_->GetAllocator(); in GetAllocator()
187 return graph_->GetLocalAllocator(); in GetLocalAllocator()
Dpass.h27 explicit Pass(Graph *graph) : graph_(graph) {} in Pass()
49 return graph_; in GetGraph()
88 Graph *graph_ {nullptr};
Dpass_manager.h96 T pass(graph_, std::forward<Args>(args)...); in RunPass()
120 return graph_; in GetGraph()
153 Graph *graph_ {nullptr};
Dpass_manager_statistics.h85 Graph *graph_;
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
Dreg_alloc_resolver.h27 …explicit RegAllocResolver(Graph *graph) : graph_(graph), liveness_(&graph->GetAnalysis<LivenessAna… in RegAllocResolver()
53 return graph_->IsBytecodeOptimizer() && inst->GetDstReg() == ACC_REG_ID; in CanStoreToAccumulator()
57 return graph_->IsBytecodeOptimizer() && inst->GetSrcReg(input_number) == ACC_REG_ID; in CanReadFromAccumulator()
81 return graph_; in GetGraph()
85 Graph *graph_;
Dsplit_resolver.cpp134 auto &dom_tree = graph_->GetAnalysis<DominatorsTree>(); in ConnectSpiltFromPredBlock()
136 graph_->InvalidateAnalysis<LoopAnalyzer>(); in ConnectSpiltFromPredBlock()
151 auto spill_fill = graph_->CreateInstSpillFill(); in CreateSpillFillForSplitMove()
178 auto spill_fill = graph_->CreateInstSpillFill(); in CreateSpillFillForSplitMove()
196 auto spill_fill = graph_->CreateInstSpillFill(); in CreateSpillFillForSiblings()
Dsplit_resolver.h26 …explicit SplitResolver(Graph *graph, LivenessAnalyzer *liveness) : graph_(graph), liveness_(livene… in SplitResolver()
56 Graph *graph_;
Dspill_fills_resolver.h126 Graph *graph_ {nullptr};
/arkcompiler/runtime_core/compiler/optimizer/ir/
Dir_constructor.h74 graph_ = graph; in SetGraph()
75 if (graph_->GetStartBlock() == nullptr) { in SetGraph()
76 graph_->CreateStartBlock(); in SetGraph()
78 if (graph_->GetEndBlock() == nullptr) { in SetGraph()
79 graph_->CreateEndBlock(0U); in SetGraph()
81 ASSERT(graph_->GetVectorBlocks().size() == 2U); in SetGraph()
83 bb_map_[ID_ENTRY_BB] = graph_->GetStartBlock(); in SetGraph()
84 bb_map_[ID_EXIT_BB] = graph_->GetEndBlock(); in SetGraph()
99 auto bb = graph_->GetAllocator()->New<BasicBlock>(graph_); in NewBlock()
102 graph_->AddBlock(bb); in NewBlock()
[all …]
Dbasicblock.cpp25 : graph_(graph), in BasicBlock()
26 preds_(graph_->GetAllocator()->Adapter()), in BasicBlock()
27 succs_(graph_->GetAllocator()->Adapter()), in BasicBlock()
28 dom_blocks_(graph_->GetAllocator()->Adapter()), in BasicBlock()
35 return (graph_->GetStartBlock() == this); in IsStartBlock()
39 return (graph_->GetEndBlock() == this); in IsEndBlock()
548 if (graph_->IsInstThrowable(old_inst)) { in ReplaceInst()
549 graph_->ReplaceThrowableInst(old_inst, new_inst); in ReplaceInst()
586 graph_->RemoveConstFromList(static_cast<ConstantInst *>(inst)); in RemoveInst()
589 if (graph_->IsInstThrowable(inst)) { in RemoveInst()
[all …]
Dgraph_checker.h94 return graph_; in GetGraph()
131 Graph *graph_;
/arkcompiler/runtime_core/compiler/tests/
Dunit_test.h199 GraphTest() : graph_(CreateEmptyGraph()) in GraphTest()
201 graph_->SetRuntime(&runtime_); in GraphTest()
207 return graph_; in GetGraph()
212 graph_ = CreateEmptyGraph(); in ResetGraph()
213 graph_->SetRuntime(&runtime_); in ResetGraph()
219graph_->SetVRegsCount(std::max(graph_->GetVRegsCount(), runtime_.vregs_count + runtime_.args_count… in SetNumVirtRegs()
225graph_->SetVRegsCount(std::max(graph_->GetVRegsCount(), runtime_.vregs_count + runtime_.args_count… in SetNumArgs()
230 Graph *graph_ {nullptr};
291 return graph_; in GetGraph()
316 Graph *graph_ {nullptr};
Dlife_intervals_test.cpp22 LifeIntervalsTest() : graph_(CreateEmptyGraph()) {} in LifeIntervalsTest()
26 auto inst = graph_->CreateInstConstant(42); in Create()
66 Graph *graph_; member in panda::compiler::LifeIntervalsTest
Dloop_analyzer_test.cpp21 LoopAnalyzerTest() : graph_(CreateGraphStartEndBlocks()) {} in LoopAnalyzerTest()
56 return graph_; in GetGraph()
60 Graph *graph_; member in panda::compiler::LoopAnalyzerTest
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
Dphi_resolver.h31 : graph_(graph), in PhiResolver()
44 for (auto bb : graph_->GetBlocksRPO()) { in Run()
83 graph_->EraseMarker(marker_); in Run()
94 marker_ = graph_->NewMarker(); in CleanUp()
172 marker_ = graph_->NewMarker(); in CheckPhiInputs()
175 graph_->EraseMarker(marker_); in CheckPhiInputs()
212 Graph *graph_ {nullptr};
Dinst_builder.h35 : graph_(graph), in InstBuilder()
47 … defs_.resize(graph_->GetVectorBlocks().size(), InstVector(graph->GetLocalAllocator()->Adapter()));
236 return graph_; in GetGraph()
241 return graph_; in GetGraph()
283 Graph *graph_ {nullptr};
Dinst_builder-inl.h56 auto box = graph_->CreateInstCastValueToAnyType(GetPc(bc_inst->GetAddress())); in BuildCastToAnyString()
82 auto box = graph_->CreateInstCastValueToAnyType(GetPc(bc_inst->GetAddress())); in BuildCastToAnyNumber()
/arkcompiler/runtime_core/libark_defect_scan_aux/
Dgraph.cpp177 return BasicBlock(graph_->GetStartBlock()); in GetStartBasicBlock()
182 return BasicBlock(graph_->GetEndBlock()); in GetEndBasicBlock()
188 auto &blocks = graph_->GetBlocksRPO(); in GetBasicBlockList()
197 for (auto &bb : graph_->GetBlocksRPO()) { in VisitAllInstructions()
Dfunction.cpp34 return graph_; in GetGraph()
88 graph_.VisitAllInstructions([&](const Inst &inst) { in GetReturnInstList()
/arkcompiler/ets_runtime/ecmascript/compiler/
Dbytecode_circuit_builder.cpp143 BytecodeRegion &entryBlock = graph_[0]; in BuildEntryBlock()
144 BytecodeRegion &nextBlock = graph_[1]; in BuildEntryBlock()
158 graph_.resize(blockSize + 1); in BuildRegions()
170 auto &prevBlock = graph_[blockId - 1]; in BuildRegions()
181 auto &lastBlock = graph_[blockId - 1]; // 1: last block in BuildRegions()
207 for (size_t i = 0; i < graph_.size(); i++) { in BuildCatchBlocks()
208 auto &bb = graph_[i]; in BuildCatchBlocks()
217 for (size_t j = i + 1; j < graph_.size(); j++) { in BuildCatchBlocks()
218 auto &catchBB = graph_[j]; in BuildCatchBlocks()
243 std::vector<size_t> visited(graph_.size(), 0); in ComputeDominatorTree()
[all …]
Dbytecode_circuit_builder.h397 ASSERT(id < graph_.size()); in GetBasicBlockById()
398 return graph_[id]; in GetBasicBlockById()
403 return graph_.size(); in GetBasicBlockCount()
597 BytecodeGraph graph_; variable
/arkcompiler/runtime_core/libark_defect_scan_aux/include/
Dgraph.h81 explicit Graph(const compiler::Graph *graph) : graph_(graph) {} in Graph()
90 const compiler::Graph *graph_ {nullptr};
Dfunction.h35 … : func_name_(func_name), m_id_(m_id), arg_count_(arg_count), graph_(graph), abc_file_(abc_file) in Function()
68 const Graph graph_; variable
/arkcompiler/runtime_core/compiler/optimizer/templates/
Dinst_checker_gen.h.erb23 explicit InstChecker(const Graph *graph) : graph_(graph) {}
27 return graph_->GetBlocksRPO();
73 const Graph *graph_{nullptr};

12