Home
last modified time | relevance | path

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

123

/external/ceres-solver/internal/ceres/
Dcanonical_views_clustering.cc77 const Graph<int>* graph_; member in ceres::internal::CanonicalViewsClustering
107 graph_ = &graph; in ComputeClustering()
149 const IntSet& views = graph_->vertices(); in FindValidViews()
153 if (graph_->VertexWeight(*view) != Graph<int>::InvalidWeight()) { in FindValidViews()
166 options_.view_score_weight * graph_->VertexWeight(candidate); in ComputeClusteringQualityDifference()
171 const IntSet& neighbors = graph_->Neighbors(candidate); in ComputeClusteringQualityDifference()
177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate); in ComputeClusteringQualityDifference()
189 graph_->EdgeWeight(centers[i], candidate); in ComputeClusteringQualityDifference()
198 const IntSet& neighbors = graph_->Neighbors(canonical_view); in UpdateCanonicalViewAssignments()
205 graph_->EdgeWeight(*neighbor, canonical_view); in UpdateCanonicalViewAssignments()
[all …]
Dgraph_algorithms.h52 : graph_(graph) {} in VertexTotalOrdering()
55 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) { in operator()
58 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size(); in operator()
62 const Graph<Vertex>& graph_;
69 : graph_(graph) {} in VertexDegreeLessThan()
72 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size(); in operator()
76 const Graph<Vertex>& graph_;
Dcanonical_views_clustering_test.cc57 graph_.AddVertex(i, kVertexWeights[i]); in SetUp()
62 graph_.AddEdge(i, i, 1.0); in SetUp()
70 graph_.AddEdge(kVertexIds[i], kVertexIds[i + 1], kEdgeWeights[i]); in SetUp()
75 ComputeCanonicalViewsClustering(options_, graph_, &centers_, &membership_); in ComputeClustering()
78 Graph<int> graph_; member in ceres::internal::CanonicalViewsTest
/external/v8/src/compiler/
Dinstruction-scheduler.cc36 graph_(zone), in InstructionScheduler()
44 DCHECK(graph_.empty()); in StartBlock()
55 graph_.clear(); in EndBlock()
68 for (auto node : graph_) { in AddInstruction()
102 for (auto node : graph_) { in AddInstruction()
109 graph_.push_back(new_node); in AddInstruction()
126 for (auto node : graph_) { in ScheduleBlock()
264 for (auto node : base::Reversed(graph_)) { in ComputeTotalLatencies()
Dsource-position.cc28 : graph_(graph), in SourcePositionTable()
36 decorator_ = new (graph_->zone()) Decorator(this); in AddDecorator()
37 graph_->AddDecorator(decorator_); in AddDecorator()
43 graph_->RemoveDecorator(decorator_); in RemoveDecorator()
Dtail-call-optimization.h24 : common_(common), graph_(graph) {} in TailCallOptimization()
30 Graph* graph() const { return graph_; } in graph()
33 Graph* const graph_; variable
Descape-analysis.h66 Graph* graph() const { return graph_; } in graph()
70 Graph* const graph_; variable
146 Graph* graph() const { return graph_; } in graph()
152 Graph* const graph_; variable
Dselect-lowering.h37 Graph* graph() const { return graph_; } in graph()
40 Graph* graph_; variable
Ddead-code-elimination.h37 Graph* graph() const { return graph_; } in graph()
41 Graph* const graph_; variable
Dgraph-trimmer.h44 Graph* graph() const { return graph_; } in graph()
46 Graph* const graph_; variable
Dcontrol-flow-optimizer.h37 Graph* graph() const { return graph_; } in graph()
42 Graph* const graph_; variable
Djs-graph.h32 graph_(graph), in JSGraph()
128 Graph* graph() const { return graph_; } in graph()
153 Graph* graph_; variable
Dtyper.h44 Graph* graph() const { return graph_; } in graph()
52 Graph* const graph_; variable
Dcommon-operator-reducer.h43 Graph* graph() const { return graph_; } in graph()
48 Graph* const graph_; variable
Dcontrol-equivalence.h35 graph_(graph), in ControlEquivalence()
161 Graph* const graph_; variable
Dgraph-reducer.h128 Graph* graph() const { return graph_; } in graph()
171 Graph* const graph_; variable
Dpipeline.cc88 graph_(nullptr), in PipelineData()
104 graph_ = new (graph_zone_) Graph(graph_zone_); in PipelineData()
105 source_positions_.Reset(new SourcePositionTable(graph_)); in PipelineData()
113 JSGraph(isolate_, graph_, common_, javascript_, simplified_, machine_); in PipelineData()
128 graph_(graph), in PipelineData()
129 source_positions_(new SourcePositionTable(graph_)), in PipelineData()
157 graph_(nullptr), in PipelineData()
195 Graph* graph() const { return graph_; } in graph()
244 graph_ = nullptr; in DeleteGraphZone()
310 Graph* graph_; member in v8::internal::compiler::PipelineData
Dgraph-trimmer.cc14 : graph_(graph), is_live_(graph, 2), live_(zone) { in GraphTrimmer()
/external/v8/src/crankshaft/
Dhydrogen-flow-engine.h71 : graph_(graph), in HFlowEngine()
78 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone); in HFlowEngine()
97 for (int i = root->block_id(); i < graph_->blocks()->length(); i++) { in AnalyzeDominatedBlocks()
98 HBasicBlock* block = graph_->blocks()->at(i); in AnalyzeDominatedBlocks()
154 HBasicBlock* member = graph_->blocks()->at(i); in ComputeLoopEffects()
191 pred_counts_.AddBlock(0, graph_->blocks()->length(), zone_); in InitializeStates()
194 block_states_.AddBlock(NULL, graph_->blocks()->length(), zone_); in InitializeStates()
207 HGraph* graph_; // The hydrogen graph. variable
Dlithium.h643 HGraph* graph() const { return graph_; } in graph()
644 Isolate* isolate() const { return graph_->isolate(); } in isolate()
696 HGraph* const graph_; variable
712 graph_(graph), in LChunkBuilderBase()
726 HGraph* graph() const { return graph_; } in graph()
728 Isolate* isolate() const { return graph_->isolate(); } in isolate()
752 HGraph* const graph_; variable
Dhydrogen-bch.cc82 HGraph* graph() const { return graph_; } in graph()
178 : graph_(graph), loop_header_(NULL), in InductionVariableBlocksTable()
364 HGraph* graph_; member in v8::internal::BASE_EMBEDDED
/external/gmock/src/
Dgmock-matchers.cc201 : graph_(&graph), in MaxBipartiteMatchState()
202 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()
203 right_(graph_->RhsSize(), kUnused) { in MaxBipartiteMatchState()
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute()
228 seen.assign(graph_->RhsSize(), 0); in Compute()
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment()
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
287 const MatchMatrix* graph_; // not owned member in testing::internal::MaxBipartiteMatchState
/external/v8/test/unittests/compiler/
Dgraph-reducer-unittest.cc86 explicit NewABReducer(Graph* graph) : graph_(graph) {} in NewABReducer()
92 return Replace(graph_->NewNode(&kOpB0)); in Reduce()
95 return Replace(graph_->NewNode(&kOpB1, node->InputAt(0))); in Reduce()
99 graph_->NewNode(&kOpB2, node->InputAt(0), node->InputAt(1))); in Reduce()
105 Graph* const graph_; member in v8::internal::compiler::__anon050697780111::NewABReducer
112 explicit A0Wrapper(Graph* graph) : graph_(graph) {} in A0Wrapper()
118 return Replace(graph_->NewNode(&kOpB1, node)); in Reduce()
124 Graph* const graph_; member in v8::internal::compiler::__anon050697780111::A0Wrapper
131 explicit B0Wrapper(Graph* graph) : graph_(graph) {} in B0Wrapper()
137 return Replace(graph_->NewNode(&kOpC1, graph_->NewNode(&kOpC1, node))); in Reduce()
[all …]
Dgraph-unittest.h57 Graph* graph() { return &graph_; } in graph()
61 Graph graph_; variable
Dvalue-numbering-reducer-unittest.cc31 ValueNumberingReducerTest() : graph_(zone()), reducer_(zone()) {} in ValueNumberingReducerTest()
36 Graph* graph() { return &graph_; } in graph()
39 Graph graph_; member in v8::internal::compiler::ValueNumberingReducerTest

123