| /art/compiler/optimizing/ |
| optimization.h | 34 : graph_(graph),
49 HGraph* const graph_; member in class:art::HOptimization
|
| side_effects_analysis.h | 30 graph_(graph),
49 HGraph* graph_; member in class:art::SideEffectsAnalysis
|
| 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
|
| builder.h | 47 : graph_(graph),
73 : graph_(graph),
103 HGraph* const graph_; member in class:art::HGraphBuilder
|
| reference_type_propagation_test.cc | 33 graph_ = CreateGraph(&allocator_);
39 graph_->InitializeInexactObjectRTI(handles);
40 propagation_ = new (&allocator_) ReferenceTypePropagation(graph_,
71 HGraph* graph_; member in class:art::ReferenceTypePropagationTest
86 EXPECT_TRUE(graph_->GetInexactObjectRti().IsEqual(ObjectType(false)));
|
| ssa_builder.h | 53 : graph_(graph),
60 graph_->InitializeInexactObjectRTI(handles);
117 HGraph* graph_; member in class:art::SsaBuilder
|
| graph_visualizer.h | 112 HGraph* const graph_; member in class:art::HGraphVisualizer
|
| instruction_builder.h | 48 graph_(graph),
269 HGraph* const graph_; member in class:art::HInstructionBuilder
|
| 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...] |
| 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...] |
| optimizing_cfi_test.cc | 47 graph_(nullptr),
55 graph_ = CreateGraph(&allocator_);
57 code_gen_ = CodeGenerator::Create(graph_, isa, *isa_features_, opts_);
143 HGraph* graph_; member in class:art::OptimizingCFITest
|
| /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
|
| common-operator-reducer.h | 43 Graph* graph() const { return graph_; }
48 Graph* const graph_; member in class:v8::internal::compiler::final
|
| 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 | 37 Graph* graph() const { return graph_; }
41 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
|
| select-lowering.h | 37 Graph* graph() const { return graph_; }
40 Graph* graph_; member in class:v8::internal::compiler::final
|
| source-position.h | 83 Graph* const graph_; member in class:v8::internal::compiler::final
|
| escape-analysis.h | 66 Graph* graph() const { return graph_; }
70 Graph* const graph_; member in class:v8::internal::compiler::EscapeStatusAnalysis
146 Graph* graph() const { return graph_; }
152 Graph* const graph_; member in class:v8::internal::compiler::EscapeAnalysis
|
| /external/ceres-solver/internal/ceres/ |
| 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
|
| 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...] |
| graph_algorithms.h | 52 : graph_(graph) {}
55 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
58 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
62 const Graph<Vertex>& graph_; member in class:ceres::internal::VertexTotalOrdering
69 : graph_(graph) {}
72 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
76 const Graph<Vertex>& graph_; member in class:ceres::internal::VertexDegreeLessThan
[all...] |
| /external/v8/test/unittests/compiler/ |
| graph-unittest.h | 57 Graph* graph() { return &graph_; }
61 Graph graph_; member in class:v8::internal::compiler::GraphTest
|
| value-numbering-reducer-unittest.cc | 31 ValueNumberingReducerTest() : graph_(zone()), reducer_(zone()) {}
36 Graph* graph() { return &graph_; }
39 Graph graph_; member in class:v8::internal::compiler::ValueNumberingReducerTest
|
| /external/gmock/src/ |
| gmock-matchers.cc | 201 : graph_(&graph),
202 left_(graph_->LhsSize(), kUnused),
203 right_(graph_->RhsSize(), kUnused) {
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
227 // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
228 seen.assign(graph_->RhsSize(), 0);
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
263 if (!graph_->HasEdge(ilhs, irhs))
287 const MatchMatrix* graph_; // not owned member in class:testing::internal::MaxBipartiteMatchState
|
