Home
last modified time | relevance | path

Searched refs:graph_ (Results 1 - 25 of 92) sorted by relevance

1234

/arkcompiler/runtime_core/compiler/optimizer/
H A Dpass_manager_statistics.cpp23 : graph_(graph), in PassManagerStatistics()
65 << std::right << std::setw(OFFSET_DEFAULT) << graph_->GetAllocator()->GetAllocatedSize() in PrintStatistics()
66 << std::setw(OFFSET_DEFAULT) << graph_->GetLocalAllocator()->GetAllocatedSize() in PrintStatistics()
75 size_t allocated_size = graph_->GetAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
86 ASSERT(graph_->GetLocalAllocator()->GetAllocatedSize() >= last_allocated_local_); in ProcessBeforeRun()
87 top_pass->mem_used_local += graph_->GetLocalAllocator()->GetAllocatedSize() - last_allocated_local_; in ProcessBeforeRun()
96 for (auto block : graph_->GetVectorBlocks()) { in ProcessBeforeRun()
109 last_allocated_ir_ = graph_->GetAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
110 last_allocated_local_ = graph_->GetLocalAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
119 ASSERT(graph_ in ProcessAfterRun()
[all...]
H A Dpass_manager.cpp31 : graph_(graph), in PassManager()
33 ANALYSES(details::PredefinedAnalyses::Instantiate<Analysis *>(graph_->GetAllocator(), graph_)), in PassManager()
143 ASSERT(graph_->GetLocalAllocator()->GetAllocatedSize() >= local_mem_size_before_pass); in RunPass()
144 stats_->ProcessAfterRun(graph_->GetLocalAllocator()->GetAllocatedSize() - local_mem_size_before_pass); in RunPass()
162 GraphChecker(graph_).Check(); in RunPass()
170 return graph_->GetAllocator(); in GetAllocator()
175 return graph_->GetLocalAllocator(); in GetLocalAllocator()
H A Dpass.h27 explicit Pass(Graph *graph) : graph_(graph) {} in Pass()
49 return graph_; in GetGraph()
88 Graph *graph_ {nullptr};
/arkcompiler/runtime_core/static_core/compiler/optimizer/
H A 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 allocatedSize = graph_->GetAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
87 ASSERT(graph_->GetLocalAllocator()->GetAllocatedSize() >= lastAllocatedLocal_); in ProcessBeforeRun()
88 topPass->memUsedLocal += graph_->GetLocalAllocator()->GetAllocatedSize() - lastAllocatedLocal_; in ProcessBeforeRun()
97 for (auto block : graph_->GetVectorBlocks()) { in ProcessBeforeRun()
110 lastAllocatedIr_ = graph_->GetAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
111 lastAllocatedLocal_ = graph_->GetLocalAllocator()->GetAllocatedSize(); in ProcessBeforeRun()
120 ASSERT(graph_ in ProcessAfterRun()
[all...]
H A Dpass_manager.cpp52 : graph_(graph), in PassManager()
54 analyses_(details::PredefinedAnalyses::Instantiate<Analysis *>(graph_->GetAllocator(), graph_)), in PassManager()
188 ASSERT(graph_->GetLocalAllocator()->GetAllocatedSize() >= localMemSizeBeforePass); in RunPass()
189 stats_->ProcessAfterRun(graph_->GetLocalAllocator()->GetAllocatedSize() - localMemSizeBeforePass); in RunPass()
213 if (graph_->IsAbcKit()) { in RunPassChecker()
233 result &= GraphChecker(graph_, pass->GetPassName()).Check(); in RunPassChecker()
240 return graph_->GetAllocator(); in GetAllocator()
245 return graph_->GetLocalAllocator(); in GetLocalAllocator()
H A Dpipeline.h33 explicit Pipeline(Graph *graph) : graph_(graph) {} in Pipeline()
43 return graph_; in GetGraph()
55 Graph *graph_ {nullptr};
H A Dpass.h27 explicit Pass(Graph *graph) : graph_(graph) {} in Pass()
49 return graph_; in GetGraph()
88 Graph *graph_ {nullptr};
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dvisualizer_printer.cpp25 PrintProperty("name", ArenaString(passName_, graph_->GetLocalAllocator()->Adapter())); in Print()
26 for (const auto &block : graph_->GetBlocksRPO()) { in Print()
68 (*output_) << "\"B" << BBId(block, graph_->GetLocalAllocator()) << "\" "; in PrintDependences()
76 PrintProperty("name", "B" + BBId(block, graph_->GetLocalAllocator())); in PrintBasicBlock()
81 PrintProperty("xhandlers", ArenaString("", graph_->GetLocalAllocator()->Adapter())); in PrintBasicBlock()
82 PrintProperty("flags", ArenaString("", graph_->GetLocalAllocator()->Adapter())); in PrintBasicBlock()
87 PrintProperty("method", ArenaString("None", graph_->GetLocalAllocator()->Adapter())); in PrintBasicBlock()
122 (*output_) << InstId(inst, graph_->GetLocalAllocator()) << " "; in PrintInst()
H A Dir_constructor.h79 graph_ = graph; in SetGraph()
80 if (graph_->GetStartBlock() == nullptr) { in SetGraph()
81 graph_->CreateStartBlock(); in SetGraph()
83 if (graph_->GetEndBlock() == nullptr) { in SetGraph()
84 graph_->CreateEndBlock(0U); in SetGraph()
86 ASSERT(graph_->GetVectorBlocks().size() == 2U); in SetGraph()
88 bbMap_[ID_ENTRY_BB] = graph_->GetStartBlock(); in SetGraph()
89 bbMap_[ID_EXIT_BB] = graph_->GetEndBlock(); in SetGraph()
104 auto bb = graph_->GetAllocator()->New<BasicBlock>(graph_); in NewBlock()
[all...]
H A Daot_data.cpp22 return -(static_cast<size_t>(RuntimeInterface::IntrinsicId::COUNT) * PointerSize(graph_->GetArch())); in GetEpTableOffset()
31 return offset - (codeAddress_ + pc + CodeInfo::GetCodeOffset(graph_->GetArch())); in GetSharedSlowPathOffset()
36 slowPathData_->SetSharedSlowPathOffset(id, codeAddress_ + pc + CodeInfo::GetCodeOffset(graph_->GetArch())); in SetSharedSlowPathOffset()
44 offset += slotId * static_cast<intptr_t>(PointerSize(graph_->GetArch())); in GetEntrypointOffset()
48 offset -= static_cast<intptr_t>(CodeInfo::GetCodeOffset(graph_->GetArch())); in GetEntrypointOffset()
H A Dvisualizer_printer.h32 : graph_(graph), output_(output), passName_(passName) in VisualizerPrinter()
63 const Graph *graph_; member in ark::compiler::VisualizerPrinter
/arkcompiler/runtime_core/compiler/optimizer/ir/
H A 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()
[all...]
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_resolver.h27 explicit RegAllocResolver(Graph *graph) : graph_(graph), liveness_(&graph->GetAnalysis<LivenessAnalyzer>()) {} 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_; member in panda::compiler::RegAllocResolver
H A Dsplit_resolver.cpp132 auto &dom_tree = graph_->GetAnalysis<DominatorsTree>(); in ConnectSpiltFromPredBlock()
134 graph_->InvalidateAnalysis<LoopAnalyzer>(); in ConnectSpiltFromPredBlock()
149 auto spill_fill = graph_->CreateInstSpillFill(); in CreateSpillFillForSplitMove()
176 auto spill_fill = graph_->CreateInstSpillFill(); in CreateSpillFillForSplitMove()
194 auto spill_fill = graph_->CreateInstSpillFill(); in CreateSpillFillForSiblings()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_resolver.h28 : graph_(graph), in RegAllocResolver()
60 return graph_->IsBytecodeOptimizer() && inst->GetDstReg() == ACC_REG_ID; in CanStoreToAccumulator()
64 return graph_->IsBytecodeOptimizer() && inst->GetSrcReg(inputNumber) == ACC_REG_ID; in CanReadFromAccumulator()
88 return graph_; in GetGraph()
92 Graph *graph_; member in ark::compiler::RegAllocResolver
H A Dsplit_resolver.cpp136 auto &domTree = graph_->GetAnalysis<DominatorsTree>(); in ConnectSplitFromPredBlock()
138 graph_->InvalidateAnalysis<LoopAnalyzer>(); in ConnectSplitFromPredBlock()
153 auto spillFill = graph_->CreateInstSpillFill(SpillFillType::SPLIT_MOVE); in CreateSpillFillForSplitMove()
179 auto spillFill = graph_->CreateInstSpillFill(SpillFillType::SPLIT_MOVE); in CreateSpillFillForSplitMove()
196 auto spillFill = graph_->CreateInstSpillFill(SpillFillType::CONNECT_SPLIT_SIBLINGS); in CreateSpillFillForSiblings()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dunit_test.h261 GraphTest() : graph_(CreateEmptyGraph()) in GraphTest()
263 graph_->SetRuntime(&runtime_); in GraphTest()
265 graph_->GetAllocator()->New<ArenaUnorderedMap<PandaRuntimeInterface::FieldPtr, DataType::Type>>( in GraphTest()
266 graph_->GetAllocator()->Adapter()); in GraphTest()
269 graph_->GetAllocator()->New<ArenaUnorderedMap<PandaRuntimeInterface::ClassPtr, DataType::Type>>( in GraphTest()
270 graph_->GetAllocator()->Adapter()); in GraphTest()
279 return graph_; in GetGraph()
284 graph_ = CreateEmptyGraph(arch); in SetGraphArch()
285 graph_->SetRuntime(&runtime_); in SetGraphArch()
290 graph_ in ResetGraph()
[all...]
/arkcompiler/runtime_core/compiler/tests/
H A 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()
219 graph_->SetVRegsCount(std::max(graph_->GetVRegsCount(), runtime_.vregs_count + runtime_.args_count + 1)); in SetNumVirtRegs()
225 graph_->SetVRegsCount(std::max(graph_->GetVRegsCount(), runtime_.vregs_count + runtime_.args_count + 1)); in SetNumArgs()
230 Graph *graph_ {nullpt
[all...]
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
H A Dphi_resolver.h31 : graph_(graph), in PhiResolver()
44 dead_marker_ = graph_->NewMarker(); in Run()
45 for (auto bb : graph_->GetBlocksRPO()) { in Run()
89 graph_->EraseMarker(marker_); in Run()
92 graph_->EraseMarker(dead_marker_); in Run()
101 marker_ = graph_->NewMarker(); in CleanUp()
179 marker_ = graph_->NewMarker(); in CheckPhiInputs()
182 graph_->EraseMarker(marker_); in CheckPhiInputs()
219 Graph *graph_ {nullptr};
H A Dinst_builder.h35 : graph_(graph), in InstBuilder()
47 defs_.resize(graph_->GetVectorBlocks().size(), InstVector(graph->GetLocalAllocator()->Adapter()));
230 return graph_; in GetGraph()
235 return graph_; in GetGraph()
277 Graph *graph_ {nullptr};
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir_builder/
H A Dinst_builder-inl.h256 auto nullCheck = graph_->CreateInstNullCheck(DataType::REFERENCE, GetPc(bcInst->GetAddress()), def, saveState); in BuildMonitor()
374 graph_->CreateInstNullCheck(DataType::REFERENCE, bcAddr, GetArgDefinition(bcInst, 0, accRead), saveState); in BuildStringLengthIntrinsic()
375 auto arrayLength = graph_->CreateInstLenArray(DataType::INT32, bcAddr, nullCheck, false); in BuildStringLengthIntrinsic()
382 if (graph_->GetRuntime()->IsCompressedStringsEnabled()) { in BuildStringLengthIntrinsic()
383 auto constOneInst = graph_->FindOrCreateConstant(1); in BuildStringLengthIntrinsic()
384 stringLength = graph_->CreateInstShr(DataType::INT32, bcAddr, arrayLength, constOneInst); in BuildStringLengthIntrinsic()
398 graph_->CreateInstNullCheck(DataType::REFERENCE, bcAddr, GetArgDefinition(bcInst, 0, accRead), saveState); in BuildStringIsEmptyIntrinsic()
399 auto length = graph_->CreateInstLenArray(DataType::INT32, bcAddr, nullCheck, false); in BuildStringIsEmptyIntrinsic()
400 auto zeroConst = graph_->FindOrCreateConstant(0); in BuildStringIsEmptyIntrinsic()
402 graph_ in BuildStringIsEmptyIntrinsic()
[all...]
H A Dphi_resolver.h30 : graph_(graph), in PhiResolver()
43 MarkerHolder markerHolder {graph_}; in Run()
45 for (auto bb : graph_->GetBlocksRPO()) { in Run()
54 for (auto bb : graph_->GetBlocksRPO()) { in Run()
89 marker_ = graph_->NewMarker(); in CleanUp()
154 marker_ = graph_->NewMarker(); in CheckPhiRealInputs()
157 graph_->EraseMarker(marker_); in CheckPhiRealInputs()
233 MarkerHolder markerHolder {graph_}; in TryRemoveFromSaveStates()
312 graph_->EraseMarker(marker_); in RemovePhiInst()
349 for (auto bb : graph_ in RemoveDeadPhi()
[all...]
/arkcompiler/runtime_core/static_core/compiler/
H A Dinplace_task_runner.h69 graph_ = graph; in SetGraph()
109 return graph_; in GetGraph()
133 Graph *graph_ {nullptr};
/arkcompiler/runtime_core/libark_defect_scan_aux/
H A Dgraph.cpp182 return BasicBlock(graph_->GetStartBlock()); in GetStartBasicBlock()
187 return BasicBlock(graph_->GetEndBlock()); in GetEndBasicBlock()
193 auto &blocks = graph_->GetBlocksRPO(); in GetBasicBlockList()
202 for (auto &bb : graph_->GetBlocksRPO()) { in VisitAllInstructions()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Descape.cpp463 for (auto loopBlock : graph_->GetVectorBlocks()) {
477 for (auto block : graph_->GetBlocksRPO()) {
493 for (size_t idx = 0; idx < graph_->GetVectorBlocks().size(); ++idx) {
494 liveIn_.emplace_back(graph_->GetLocalAllocator());
497 auto &rpo = graph_->GetBlocksRPO();
1531 auto copy = static_cast<SaveStateInst *>(ss->Clone(graph_));
1550 for (auto bb : graph_->GetVectorBlocks()) {
1556 auto phiInst = graph_->CreateInstPhi(state->GetType(), bb->GetGuestPc());
1605 auto currSs = graph_->CreateInstSaveState();
1611 currSs->SetMethod(graph_
[all...]

Completed in 14 milliseconds

1234