| /art/compiler/optimizing/ |
| ssa_phi_elimination.h | 31 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {}
36 HGraph* const graph_; member in class:art::SsaDeadPhiElimination
53 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {}
58 HGraph* const graph_; member in class:art::SsaRedundantPhiElimination
|
| ssa_type_propagation.h | 28 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {}
38 HGraph* const graph_; member in class:art::SsaTypePropagation
|
| graph_visualizer.h | 66 HGraph* const graph_; member in class:art::HGraphVisualizer
|
| builder.h | 44 graph_(nullptr),
122 HGraph* graph_; member in class:art::HGraphBuilder
|
| code_generator.h | 79 HGraph* GetGraph() const { return graph_; }
145 graph_(graph),
173 HGraph* const graph_; member in class:art::CodeGenerator
|
| builder.cc | 45 Temporaries(HGraph* graph, size_t count) : graph_(graph), count_(count), index_(0) {
46 graph_->UpdateNumberOfTemporaries(count_);
53 HInstruction* temp = new (graph_->GetArena()) HTemporary(index_++);
59 HGraph* const graph_; member in class:art::Temporaries
73 graph_->SetNumberOfVRegs(count);
88 graph_->SetNumberOfInVRegs(number_of_parameters);
181 graph_ = new (arena_) HGraph(arena_);
182 entry_block_ = new (arena_) HBasicBlock(graph_);
183 graph_->AddBlock(entry_block_);
184 exit_block_ = new (arena_) HBasicBlock(graph_);
[all...] |
| ssa_liveness_analysis.h | 470 : graph_(graph),
543 const HGraph& graph_; member in class:art::SsaLivenessAnalysis
|
| nodes.h | 263 : graph_(graph),
282 loop_information_ = new (graph_->GetArena()) HLoopInformation(this, graph_);
288 HGraph* GetGraph() const { return graph_; }
397 HGraph* const graph_; member in class:art::HBasicBlock
1572 HGraph* graph_; member in class:art::HGraphVisitor
1586 const HGraph& graph_; member in class:art::HInsertionOrderIterator
1601 const HGraph& graph_; member in class:art::HReversePostOrderIterator
1617 const HGraph& graph_; member in class:art::HPostOrderIterator
[all...] |
| /art/compiler/sea_ir/types/ |
| type_inference_visitor.h | 39 graph_(graph), type_data_(type_data), type_cache_(types), crt_type_() {
73 const SeaGraph* const graph_; member in class:sea_ir::TypeInferenceVisitor
|
| /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/chromium_org/cc/resources/ |
| image_raster_worker_pool.h | 66 TaskGraph graph_; member in class:cc::ImageRasterWorkerPool
|
| direct_raster_worker_pool.h | 71 TaskGraph graph_; member in class:cc::DirectRasterWorkerPool
|
| image_copy_raster_worker_pool.h | 102 TaskGraph graph_; member in class:cc::ImageCopyRasterWorkerPool
|
| pixel_buffer_raster_worker_pool.h | 128 TaskGraph graph_; member in class:cc::PixelBufferRasterWorkerPool
|
| task_graph_runner.cc | 20 : graph_(graph), task_(task), current_index_(-1), current_node_(NULL) {
25 DCHECK_LT(current_index_, graph_->edges.size());
26 DCHECK_EQ(graph_->edges[current_index_].task, task_);
32 DCHECK_LT(current_index_, graph_->edges.size());
33 DCHECK_EQ(graph_->edges[current_index_].task, task_);
43 if (current_index_ == graph_->edges.size())
45 } while (graph_->edges[current_index_].task != task_);
49 std::find_if(graph_->nodes.begin(),
50 graph_->nodes.end(),
52 graph_->edges[current_index_].dependent))
62 TaskGraph* graph_; member in class:cc::__anon7346::DependentIterator
94 const TaskGraph* graph_; member in class:cc::__anon7346::DependencyMismatchComparator
[all...] |
| /art/compiler/sea_ir/debug/ |
| dot_gen.h | 42 art::SafeMap<int, const Type*>* types): graph_(), types_(types), options_(options) { }
92 SeaGraph* graph_; member in class:sea_ir::DotGenerationVisitor
|
| /external/chromium_org/v8/src/ |
| hydrogen-flow-engine.h | 71 : 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
|
| hydrogen-bch.cc | 82 HGraph* graph() const { return graph_; }
178 : graph_(graph), loop_header_(NULL),
365 HGraph* graph_; member in class:v8::internal::BASE_EMBEDDED
|
| lithium-allocator.h | 409 HGraph* graph() const { return graph_; }
410 Isolate* isolate() const { return graph_->isolate(); }
604 HGraph* graph_; member in class:v8::internal::BASE_EMBEDDED
|
| compiler.h | 532 graph_(NULL),
574 HGraph* graph_; member in class:v8::internal::OptimizedCompileJob
|
| lithium.h | 632 HGraph* graph() const { return graph_; }
633 Isolate* isolate() const { return graph_->isolate(); }
689 HGraph* const graph_; member in class:v8::internal::LChunk
|
| /art/compiler/sea_ir/ir/ |
| sea.h | 346 static SeaGraph graph_; member in class:sea_ir::SeaGraph
|
| /external/chromium_org/v8/src/arm/ |
| lithium-arm.h | 2866 HGraph* const graph_; member in class:v8::internal::V8_FINAL
[all...] |
