| /external/v8/src/compiler/ |
| tail-call-optimization.h | 24 : common_(common), graph_(graph) {}
30 Graph* graph() const { return graph_; }
33 Graph* const graph_; member in class:v8::internal::compiler::final
|
| dead-code-elimination.h | 37 Graph* graph() const { return graph_; }
41 Graph* const graph_; member in class:v8::internal::compiler::final
|
| select-lowering.h | 37 Graph* graph() const { return graph_; }
40 Graph* graph_; member in class:v8::internal::compiler::final
|
| source-position.cc | 28 : graph_(graph),
36 decorator_ = new (graph_->zone()) Decorator(this);
37 graph_->AddDecorator(decorator_);
43 graph_->RemoveDecorator(decorator_);
|
| control-flow-optimizer.h | 37 Graph* graph() const { return graph_; }
42 Graph* const graph_; member in class:v8::internal::compiler::final
|
| graph-trimmer.h | 44 Graph* graph() const { return graph_; }
46 Graph* const graph_; member in class:v8::internal::compiler::final
|
| common-operator-reducer.h | 43 Graph* graph() const { return graph_; }
48 Graph* const graph_; member in class:v8::internal::compiler::final
|
| /art/compiler/optimizing/ |
| licm_test.cc | 32 graph_ = CreateGraph(&allocator_);
40 entry_ = new (&allocator_) HBasicBlock(graph_);
41 loop_preheader_ = new (&allocator_) HBasicBlock(graph_);
42 loop_header_ = new (&allocator_) HBasicBlock(graph_);
43 loop_body_ = new (&allocator_) HBasicBlock(graph_);
44 return_ = new (&allocator_) HBasicBlock(graph_);
45 exit_ = new (&allocator_) HBasicBlock(graph_);
47 graph_->AddBlock(entry_);
48 graph_->AddBlock(loop_preheader_);
49 graph_->AddBlock(loop_header_)
88 HGraph* graph_; member in class:art::LICMTest
[all...] |
| optimization.h | 34 : graph_(graph),
49 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();
|
| dead_code_elimination.cc | 92 if (graph_->HasIrreducibleLoops()) {
99 ArenaAllocator* allocator = graph_->GetArena();
100 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE);
102 MarkReachableBlocks(graph_, &live_blocks);
109 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
126 graph_->ClearLoopInformation();
127 graph_->ClearDominanceInformation();
128 graph_->BuildDominatorTree();
130 graph_->ClearDominanceInformation();
131 graph_->ComputeDominanceInformation()
[all...] |
| bounds_check_elimination_test.cc | 37 graph_ = CreateGraph(&allocator_);
38 graph_->SetHasBoundsChecks(true);
44 graph_->BuildDominatorTree();
46 InstructionSimplifier(graph_).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...] |
| block_builder.cc | 31 block = new (arena_) HBasicBlock(graph_, semantic_dex_pc);
121 HBasicBlock* block = graph_->GetEntryBlock();
122 graph_->AddBlock(block);
138 graph_->AddBlock(block);
158 block->AddSuccessor(graph_->GetExitBlock());
170 graph_->AddBlock(block);
187 graph_->AddBlock(graph_->GetExitBlock());
214 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty())
251 for (HBasicBlock* block : graph_->GetBlocks())
[all...] |
| side_effects_analysis.h | 30 graph_(graph),
49 HGraph* graph_; member in class:art::SideEffectsAnalysis
|
| side_effects_analysis.cc | 24 block_effects_.resize(graph_->GetBlocks().size());
25 loop_effects_.resize(graph_->GetBlocks().size());
29 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
41 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
|
| induction_var_analysis_test.cc | 33 graph_ = CreateGraph(&allocator_);
41 loop_preheader_[d] = new (&allocator_) HBasicBlock(graph_);
42 graph_->AddBlock(loop_preheader_[d]);
43 loop_header_[d] = new (&allocator_) HBasicBlock(graph_);
44 graph_->AddBlock(loop_header_[d]);
49 loop_body_[d] = new (&allocator_) HBasicBlock(graph_);
50 graph_->AddBlock(loop_body_[d]);
65 graph_->SetNumberOfVRegs(n + 3);
68 entry_ = new (&allocator_) HBasicBlock(graph_);
69 graph_->AddBlock(entry_)
177 HGraph* graph_; member in class:art::InductionVarAnalysisTest
[all...] |
| 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_).Run();
69 GraphChecker graph_checker_cf(graph_);
73 StringPrettyPrinter printer_after_cf(graph_);
78 check_after_cf(graph_);
80 HDeadCodeElimination(graph_).Run()
93 HGraph* graph_; member in class:art::ConstantFoldingTest
[all...] |
| inliner.cc | 66 if (graph_->IsDebuggable()) {
71 const ArenaVector<HBasicBlock*>& blocks = graph_->GetReversePostOrder();
303 ArtMethod* caller = graph_->GetArtMethod();
350 HInstanceFieldGet* result = new (graph_->GetArena()) HInstanceFieldGet(
413 ReferenceTypePropagation rtp_fixup(graph_,
437 HLoadClass* load_class = new (graph_->GetArena()) HLoadClass(graph_->GetCurrentMethod(),
445 HNotEqual* compare = new (graph_->GetArena()) HNotEqual(load_class, receiver_class);
455 HDeoptimize* deoptimize = new (graph_->GetArena()) HDeoptimize(
542 ReferenceTypePropagation rtp_fixup(graph_,
[all...] |
| builder.h | 47 : graph_(graph),
73 : graph_(graph),
103 HGraph* const graph_; member in class:art::HGraphBuilder
|
| ssa_builder.h | 53 : graph_(graph),
60 graph_->InitializeInexactObjectRTI(handles);
117 HGraph* graph_; member in class:art::SsaBuilder
|
| instruction_simplifier_arm.h | 52 InstructionSimplifierArmVisitor visitor(graph_, stats_);
|
| block_builder.h | 33 graph_(graph),
42 // Creates basic blocks in `graph_` at branch target dex_pc positions of the
72 HGraph* const graph_; member in class:art::HBasicBlockBuilder
|
| ssa_phi_elimination.cc | 34 ArenaSet<HPhi*> initially_live(graph_->GetArena()->Adapter(kArenaAllocSsaPhiElimination));
37 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
45 bool keep_alive = (graph_->IsDebuggable() && phi->HasEnvironmentUses());
87 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
124 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
131 ArenaBitVector visited_phis_in_cycle(graph_->GetArena(),
132 graph_->GetCurrentInstructionId(),
135 ArenaVector<HPhi*> cycle_worklist(graph_->GetArena()->Adapter(kArenaAllocSsaPhiElimination));
|
| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 77 const Graph<int>* graph_; member in class:ceres::internal::CanonicalViewsClustering
107 graph_ = &graph;
149 const IntSet& views = graph_->vertices();
153 if (graph_->VertexWeight(*view) != Graph<int>::InvalidWeight()) {
166 options_.view_score_weight * graph_->VertexWeight(candidate);
171 const IntSet& neighbors = graph_->Neighbors(candidate);
177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
189 graph_->EdgeWeight(centers[i], candidate);
198 const IntSet& neighbors = graph_->Neighbors(canonical_view);
205 graph_->EdgeWeight(*neighbor, canonical_view)
[all...] |
| canonical_views_clustering_test.cc | 57 graph_.AddVertex(i, kVertexWeights[i]);
62 graph_.AddEdge(i, i, 1.0);
70 graph_.AddEdge(kVertexIds[i], kVertexIds[i + 1], kEdgeWeights[i]);
75 ComputeCanonicalViewsClustering(options_, graph_, ¢ers_, &membership_);
78 Graph<int> graph_; member in class:ceres::internal::CanonicalViewsTest
|
