/external/ceres-solver/internal/ceres/ |
D | canonical_views_clustering.cc | 77 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 …]
|
D | graph_algorithms.h | 52 : 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_;
|
D | canonical_views_clustering_test.cc | 57 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_, ¢ers_, &membership_); in ComputeClustering() 78 Graph<int> graph_; member in ceres::internal::CanonicalViewsTest
|
/external/v8/src/crankshaft/ |
D | hydrogen-flow-engine.h | 71 : 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
|
D | lithium.h | 650 HGraph* graph() const { return graph_; } in graph() 651 Isolate* isolate() const { return graph_->isolate(); } in isolate() 704 HGraph* const graph_; variable 720 graph_(graph), in LChunkBuilderBase() 734 HGraph* graph() const { return graph_; } in graph() 736 Isolate* isolate() const { return graph_->isolate(); } in isolate() 770 HGraph* const graph_; variable
|
/external/v8/src/compiler/ |
D | source-position.cc | 29 : graph_(graph), in SourcePositionTable() 37 decorator_ = new (graph_->zone()) Decorator(this); in AddDecorator() 38 graph_->AddDecorator(decorator_); in AddDecorator() 44 graph_->RemoveDecorator(decorator_); in RemoveDecorator()
|
D | instruction-scheduler.cc | 82 graph_(zone), in InstructionScheduler() 91 DCHECK(graph_.empty()); in StartBlock() 107 graph_.clear(); in EndBlock() 121 for (ScheduleGraphNode* node : graph_) { in AddInstruction() 168 for (ScheduleGraphNode* node : graph_) { in AddInstruction() 175 graph_.push_back(new_node); in AddInstruction() 187 for (ScheduleGraphNode* node : graph_) { in ScheduleBlock() 345 for (ScheduleGraphNode* node : base::Reversed(graph_)) { in ComputeTotalLatencies()
|
D | tail-call-optimization.h | 24 : common_(common), graph_(graph) {} in TailCallOptimization() 30 Graph* graph() const { return graph_; } in graph() 33 Graph* const graph_; variable
|
D | load-elimination.h | 21 : AdvancedReducer(editor), graph_(graph), simplified_(simplified) {} in LoadElimination() 28 Graph* graph() const { return graph_; } in graph() 32 Graph* const graph_; variable
|
D | select-lowering.h | 29 Graph* graph() const { return graph_; } in graph() 32 Graph* graph_; variable
|
D | dead-code-elimination.h | 37 Graph* graph() const { return graph_; } in graph() 41 Graph* const graph_; variable
|
D | control-flow-optimizer.h | 37 Graph* graph() const { return graph_; } in graph() 42 Graph* const graph_; variable
|
D | graph-trimmer.h | 48 Graph* graph() const { return graph_; } in graph() 50 Graph* const graph_; variable
|
D | graph.h | 41 : graph_(graph), start_(graph->start()), end_(graph->end()) {} in SubgraphScope() 43 graph_->SetStart(start_); in ~SubgraphScope() 44 graph_->SetEnd(end_); in ~SubgraphScope() 48 Graph* const graph_;
|
D | common-operator-reducer.h | 43 Graph* graph() const { return graph_; } in graph() 48 Graph* const graph_; variable
|
D | typer.h | 46 Graph* graph() const { return graph_; } in graph() 55 Graph* const graph_; variable
|
D | js-graph.h | 32 graph_(graph), in JSGraph() 139 Graph* graph() const { return graph_; } in graph() 171 Graph* graph_; variable
|
D | int64-lowering.h | 41 Graph* graph() const { return graph_; } in graph() 68 Graph* const graph_; variable
|
D | control-equivalence.h | 35 graph_(graph), in ControlEquivalence() 161 Graph* const graph_; variable
|
D | graph-reducer.h | 127 Graph* graph() const { return graph_; } in graph() 170 Graph* const graph_; variable
|
/external/gmock/src/ |
D | gmock-matchers.cc | 201 : 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/ |
D | graph-reducer-unittest.cc | 86 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::__anon2b48dd340111::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::__anon2b48dd340111::A0Wrapper 131 explicit B0Wrapper(Graph* graph) : graph_(graph) {} in B0Wrapper() 137 return Replace(graph_->NewNode(&kOpC1, graph_->NewNode(&kOpC1, node))); in Reduce() [all …]
|
D | value-numbering-reducer-unittest.cc | 31 ValueNumberingReducerTest() : graph_(zone()), reducer_(zone()) {} in ValueNumberingReducerTest() 36 Graph* graph() { return &graph_; } in graph() 39 Graph graph_; member in v8::internal::compiler::ValueNumberingReducerTest
|
D | graph-unittest.h | 59 Graph* graph() { return &graph_; } in graph() 63 Graph graph_; variable
|
/external/v8/test/cctest/compiler/ |
D | test-js-context-specialization.cc | 22 : graph_(new (main_zone()) Graph(main_zone())), in ContextSpecializationTester() 38 Graph* graph() { return graph_; } in graph() 41 Graph* graph_; member in v8::internal::compiler::ContextSpecializationTester
|