| /external/v8/src/compiler/ |
| tail-call-optimization.h | 25 : common_(common), graph_(graph) {}
31 Graph* graph() const { return graph_; }
34 Graph* const graph_; member in class:v8::internal::compiler::final
|
| select-lowering.h | 29 Graph* graph() const { return graph_; }
32 Graph* graph_; member in class:v8::internal::compiler::final
|
| compiler-source-position-table.cc | 28 : graph_(graph),
35 decorator_ = new (graph_->zone()) Decorator(this);
36 graph_->AddDecorator(decorator_);
41 graph_->RemoveDecorator(decorator_);
|
| control-flow-optimizer.h | 37 Graph* graph() const { return graph_; }
42 Graph* const graph_; member in class:v8::internal::compiler::final
|
| dead-code-elimination.h | 43 Graph* graph() const { return graph_; }
47 Graph* const graph_; member in class:v8::internal::compiler::final
|
| graph-trimmer.h | 49 Graph* graph() const { return graph_; }
51 Graph* const graph_; member in class:v8::internal::compiler::final
|
| typer.h | 41 Graph* graph() const { return graph_; }
48 Graph* const graph_; member in class:v8::internal::compiler::Typer
|
| /art/compiler/optimizing/ |
| loop_optimization_test.cc | 32 graph_(CreateGraph(&allocator_)),
33 iva_(new (&allocator_) HInductionVarAnalysis(graph_)),
34 loop_opt_(new (&allocator_) HLoopOptimization(graph_, nullptr, iva_)) {
42 graph_->SetNumberOfVRegs(1);
43 entry_block_ = new (&allocator_) HBasicBlock(graph_);
44 return_block_ = new (&allocator_) HBasicBlock(graph_);
45 exit_block_ = new (&allocator_) HBasicBlock(graph_);
46 graph_->AddBlock(entry_block_);
47 graph_->AddBlock(return_block_);
48 graph_->AddBlock(exit_block_)
106 HGraph* graph_; member in class:art::LoopOptimizationTest
[all...] |
| licm_test.cc | 43 graph_ = CreateGraph(&allocator_);
51 entry_ = new (&allocator_) HBasicBlock(graph_);
52 loop_preheader_ = new (&allocator_) HBasicBlock(graph_);
53 loop_header_ = new (&allocator_) HBasicBlock(graph_);
54 loop_body_ = new (&allocator_) HBasicBlock(graph_);
55 return_ = new (&allocator_) HBasicBlock(graph_);
56 exit_ = new (&allocator_) HBasicBlock(graph_);
58 graph_->AddBlock(entry_);
59 graph_->AddBlock(loop_preheader_);
60 graph_->AddBlock(loop_header_)
102 HGraph* graph_; member in class:art::LICMTest
[all...] |
| ssa_liveness_analysis_test.cc | 34 graph_(CreateGraph(&allocator_)),
40 codegen_ = CodeGenerator::Create(graph_,
46 entry_ = new (&allocator_) HBasicBlock(graph_);
47 graph_->AddBlock(entry_);
48 graph_->SetEntryBlock(entry_);
62 HGraph* graph_; member in class:art::SsaLivenessAnalysisTest
72 graph_->GetDexFile(), dex::TypeIndex(0), 0, Primitive::kPrimInt);
80 graph_->BuildDominatorTree();
81 SsaLivenessAnalysis ssa_analysis(graph_, codegen_.get());
92 graph_->GetDexFile(), dex::TypeIndex(0), 0, Primitive::kPrimNot)
[all...] |
| optimization.h | 34 : graph_(graph),
52 HGraph* const graph_; member in class:art::HOptimization
|
| builder.cc | 74 DCHECK(graph_->GetBlocks().empty());
76 graph_->SetNumberOfVRegs(code_item_.registers_size_);
77 graph_->SetNumberOfInVRegs(code_item_.ins_size_);
78 graph_->SetMaximumNumberOfOutVRegs(code_item_.outs_size_);
79 graph_->SetHasTryCatch(code_item_.tries_size_ != 0);
94 GraphAnalysisResult result = graph_->BuildDominatorTree();
|
| bounds_check_elimination_test.cc | 37 graph_ = CreateGraph(&allocator_);
38 graph_->SetHasBoundsChecks(true);
44 graph_->BuildDominatorTree();
46 InstructionSimplifier(graph_, /* codegen */ nullptr, /* driver */ nullptr).Run();
48 SideEffectsAnalysis side_effects(graph_);
51 GVNOptimization(graph_, side_effects).Run();
53 HInductionVarAnalysis induction(graph_);
56 BoundsCheckElimination(graph_, side_effects, &induction).Run();
61 HGraph* graph_; member in class:art::BoundsCheckEliminationTest
69 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_);
[all...] |
| dead_code_elimination.cc | 185 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
272 graph_->ClearLoopInformation();
273 graph_->ClearDominanceInformation();
274 graph_->BuildDominatorTree();
276 graph_->ClearDominanceInformation();
278 graph_->SimplifyCFG();
279 graph_->ComputeDominanceInformation();
280 graph_->ComputeTryBlockInformation();
289 for (size_t i = 1u, size = graph_->GetReversePostOrder().size(); i != size; ++i) {
290 HBasicBlock* block = graph_->GetReversePostOrder()[i]
[all...] |
| load_store_analysis_test.cc | 28 graph_ = CreateGraph(&allocator_);
33 HGraph* graph_; member in class:art::LoadStoreAnalysisTest
37 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_);
38 graph_->AddBlock(entry);
39 graph_->SetEntryBlock(entry);
52 graph_->GetDexFile(), dex::TypeIndex(0), 0, Primitive::kPrimNot);
54 graph_->GetDexFile(), dex::TypeIndex(1), 1, Primitive::kPrimInt);
55 HInstruction* c1 = graph_->GetIntConstant(1);
56 HInstruction* c2 = graph_->GetIntConstant(2);
57 HInstruction* c3 = graph_->GetIntConstant(3)
[all...] |
| side_effects_analysis.cc | 24 block_effects_.resize(graph_->GetBlocks().size());
25 loop_effects_.resize(graph_->GetBlocks().size());
29 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
40 for (HBasicBlock* block : graph_->GetPostOrder()) {
|
| block_builder.cc | 32 block = new (arena_) HBasicBlock(graph_, semantic_dex_pc);
122 HBasicBlock* block = graph_->GetEntryBlock();
123 graph_->AddBlock(block);
144 graph_->AddBlock(block);
168 block->AddSuccessor(graph_->GetExitBlock());
180 graph_->AddBlock(block);
197 graph_->AddBlock(graph_->GetExitBlock());
224 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty())
261 for (HBasicBlock* block : graph_->GetBlocks())
[all...] |
| scheduler_test.cc | 76 graph_ = CreateGraph(&allocator_);
81 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_);
82 HBasicBlock* block1 = new (&allocator_) HBasicBlock(graph_);
83 graph_->AddBlock(entry);
84 graph_->AddBlock(block1);
85 graph_->SetEntryBlock(entry);
102 HInstruction* array = new (&allocator_) HParameterValue(graph_->GetDexFile(),
106 HInstruction* c1 = graph_->GetIntConstant(1);
107 HInstruction* c2 = graph_->GetIntConstant(10);
137 graph_->GetArtMethod()
340 HGraph* graph_; member in class:art::SchedulerTest
[all...] |
| side_effects_analysis.h | 30 graph_(graph),
49 HGraph* graph_; member in class:art::SideEffectsAnalysis
|
| constant_folding_test.cc | 38 graph_ = CreateGraph(&allocator_);
47 graph_ = CreateCFG(&allocator_, data, return_type);
58 ASSERT_NE(graph_, nullptr);
60 StringPrettyPrinter printer_before(graph_);
67 x86::CodeGeneratorX86 codegenX86(graph_, *features_x86.get(), CompilerOptions());
68 HConstantFolding(graph_, "constant_folding").Run();
69 GraphChecker graph_checker_cf(graph_);
73 StringPrettyPrinter printer_after_cf(graph_);
78 check_after_cf(graph_);
80 HDeadCodeElimination(graph_, nullptr /* stats */, "dead_code_elimination").Run()
93 HGraph* graph_; member in class:art::ConstantFoldingTest
[all...] |
| builder.h | 50 : graph_(graph),
81 : graph_(graph),
115 HGraph* const graph_; member in class:art::HGraphBuilder
|
| ssa_builder.h | 54 : graph_(graph),
62 graph_->InitializeInexactObjectRTI(handles);
119 HGraph* graph_; member in class:art::SsaBuilder
|
| inliner.cc | 127 if (graph_->IsDebuggable()) {
135 if (outermost_graph_ == graph_) {
136 total_number_of_instructions_ = CountNumberOfInstructions(graph_);
155 ArenaVector<HBasicBlock*> blocks = graph_->GetReversePostOrder();
575 ArtMethod* caller = graph_->GetArtMethod();
707 HInstanceFieldGet* result = new (graph_->GetArena()) HInstanceFieldGet(
799 ReferenceTypePropagation rtp_fixup(graph_,
814 HShouldDeoptimizeFlag* deopt_flag = new (graph_->GetArena())
815 HShouldDeoptimizeFlag(graph_->GetArena(), dex_pc)
[all...] |
| induction_var_analysis_test.cc | 47 graph_ = CreateGraph(&allocator_);
55 loop_preheader_[d] = new (&allocator_) HBasicBlock(graph_);
56 graph_->AddBlock(loop_preheader_[d]);
57 loop_header_[d] = new (&allocator_) HBasicBlock(graph_);
58 graph_->AddBlock(loop_header_[d]);
63 loop_body_[d] = new (&allocator_) HBasicBlock(graph_);
64 graph_->AddBlock(loop_body_[d]);
79 graph_->SetNumberOfVRegs(n + 3);
82 entry_ = new (&allocator_) HBasicBlock(graph_);
83 graph_->AddBlock(entry_)
207 HGraph* graph_; member in class:art::InductionVarAnalysisTest
[all...] |
| block_builder.h | 33 graph_(graph),
43 // Creates basic blocks in `graph_` at branch target dex_pc positions of the
75 HGraph* const graph_; member in class:art::HBasicBlockBuilder
|
