Searched defs:graph_ (Results 1 - 25 of 27) sorted by relevance

12

/external/chromium_org/v8/src/compiler/
H A Dgraph-unittest.h47 Graph* graph() { return &graph_; }
51 Graph graph_; member in class:v8::internal::compiler::GraphTest
H A Dgraph-reducer-unittest.cc36 GraphReducerTest() : graph_(zone()) {}
70 Graph* graph() { return &graph_; }
73 Graph graph_; member in class:v8::internal::compiler::GraphReducerTest
H A Dgraph-reducer.h60 Graph* graph() const { return graph_; }
70 Graph* graph_; member in class:v8::internal::compiler::FINAL
H A Dscheduler.h48 Graph* graph_; member in class:v8::internal::compiler::Scheduler
H A Dvalue-numbering-reducer-unittest.cc25 ValueNumberingReducerTest() : graph_(zone()), reducer_(zone()) {}
30 Graph* graph() { return &graph_; }
33 Graph graph_; member in class:v8::internal::compiler::ValueNumberingReducerTest
H A Djs-graph.h29 : graph_(graph),
86 Graph* graph() { return graph_; }
91 Graph* graph_; member in class:v8::internal::compiler::JSGraph
H A Dsource-position.h87 Graph* graph_; member in class:v8::internal::compiler::FINAL
H A Dgraph-visualizer.cc43 const Graph* const graph_; member in class:v8::internal::compiler::GraphVisualizer
238 const_cast<Graph*>(graph_)->VisitNodeInputsFromEnd(this);
239 white_nodes_.insert(const_cast<Graph*>(graph_)->start());
244 const_cast<Graph*>(graph_), zone_, white_nodes_.begin(),
272 graph_(graph) {}
H A Dgraph-builder.h24 explicit GraphBuilder(Graph* graph) : graph_(graph) {}
65 Graph* graph() const { return graph_; }
73 Graph* graph_; member in class:v8::internal::compiler::GraphBuilder
/external/ceres-solver/internal/ceres/
H A Dcanonical_views_clustering_test.cc57 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_, &centers_, &membership_);
78 Graph<int> graph_; member in class:ceres::internal::CanonicalViewsTest
H A Dcanonical_views_clustering.cc77 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_
[all...]
H A Dgraph_algorithms.h52 : 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/chromium_org/cc/resources/
H A Dbitmap_raster_worker_pool.h68 TaskGraph graph_; member in class:cc::BitmapRasterWorkerPool
H A Dzero_copy_raster_worker_pool.h68 TaskGraph graph_; member in class:cc::ZeroCopyRasterWorkerPool
H A Dgpu_raster_worker_pool.h68 TaskGraph graph_; member in class:cc::GpuRasterWorkerPool
H A Done_copy_raster_worker_pool.h77 TaskGraph graph_; member in class:cc::OneCopyRasterWorkerPool
H A Dpixel_buffer_raster_worker_pool.h129 TaskGraph graph_; member in class:cc::PixelBufferRasterWorkerPool
H A Dtask_graph_runner.cc20 : graph_(graph),
28 DCHECK_LT(current_index_, graph_->edges.size());
29 DCHECK_EQ(graph_->edges[current_index_].task, task_);
35 DCHECK_LT(current_index_, graph_->edges.size());
36 DCHECK_EQ(graph_->edges[current_index_].task, task_);
46 if (current_index_ == graph_->edges.size())
48 } while (graph_->edges[current_index_].task != task_);
52 std::find_if(graph_->nodes.begin(),
53 graph_->nodes.end(),
55 graph_
65 TaskGraph* graph_; member in class:cc::__anon2777::DependentIterator
97 const TaskGraph* graph_; member in class:cc::__anon2777::DependencyMismatchComparator
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dgraph-builder-tester.h54 Graph* graph_; member in class:v8::internal::compiler::MachineCallHelper
H A Dtest-graph-reducer.cc61 explicit NewABReducer(Graph* graph) : graph_(graph) {}
66 return Replace(graph_->NewNode(&OPB0));
69 return Replace(graph_->NewNode(&OPB1, node->InputAt(0)));
73 graph_->NewNode(&OPB2, node->InputAt(0), node->InputAt(1)));
77 Graph* graph_; member in class:NewABReducer
107 explicit A0Wrapper(Graph* graph) : graph_(graph) {}
112 return Replace(graph_->NewNode(&OPB1, node));
116 Graph* graph_; member in class:FINAL
123 explicit B0Wrapper(Graph* graph) : graph_(graph) {}
128 return Replace(graph_
132 Graph* graph_; member in class:FINAL
[all...]
/external/chromium_org/v8/src/
H A Dhydrogen-flow-engine.h71 : graph_(graph),
78 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone);
97 for (int i = root->block_id(); i < graph_->blocks()->length(); i++) {
98 HBasicBlock* block = graph_->blocks()->at(i);
154 HBasicBlock* member = graph_->blocks()->at(i);
191 pred_counts_.AddBlock(0, graph_->blocks()->length(), zone_);
194 block_states_.AddBlock(NULL, graph_->blocks()->length(), zone_);
207 HGraph* graph_; // The hydrogen graph. member in class:v8::internal::HFlowEngine
H A Dhydrogen-bch.cc82 HGraph* graph() const { return graph_; }
178 : graph_(graph), loop_header_(NULL),
365 HGraph* graph_; member in class:v8::internal::BASE_EMBEDDED
H A Dlithium-allocator.h350 HGraph* graph() const { return graph_; }
351 Isolate* isolate() const { return graph_->isolate(); }
545 HGraph* graph_; member in class:v8::internal::BASE_EMBEDDED
H A Dcompiler.h585 graph_(NULL),
622 HGraph* graph_; member in class:v8::internal::OptimizedCompileJob
H A Dlithium.h632 HGraph* graph() const { return graph_; }
633 Isolate* isolate() const { return graph_->isolate(); }
689 HGraph* const graph_; member in class:v8::internal::LChunk
705 graph_(graph),
719 HGraph* graph() const { return graph_; }
721 Isolate* isolate() const { return graph_->isolate(); }
745 HGraph* const graph_; member in class:v8::internal::BASE_EMBEDDED

Completed in 1428 milliseconds

12