| /art/compiler/optimizing/ |
| live_ranges_test.cc | 33 HGraph* graph = builder.BuildGraph(*item); local
34 graph->BuildDominatorTree();
35 graph->TransformToSSA();
36 graph->FindNaturalLoops();
37 return graph;
45 * Which becomes the following graph (numbered by lifetime position):
59 HGraph* graph = BuildGraph(data, &allocator); local
61 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, InstructionSet::kX86);
62 SsaLivenessAnalysis liveness(*graph, codegen);
70 HBasicBlock* block = graph->GetBlocks().Get(1)
106 HGraph* graph = BuildGraph(data, &allocator); local
155 HGraph* graph = BuildGraph(data, &allocator); local
231 HGraph* graph = BuildGraph(data, &allocator); local
[all...] |
| graph_visualizer.h | 44 HGraph* graph,
54 HGraph* graph,
|
| register_allocator_test.cc | 39 HGraph* graph = builder.BuildGraph(*item); local
40 graph->BuildDominatorTree();
41 graph->TransformToSSA();
42 graph->FindNaturalLoops();
43 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, kX86);
44 SsaLivenessAnalysis liveness(*graph, codegen);
58 HGraph* graph = new (&allocator) HGraph(&allocator); local
59 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, kX86);
147 * Which becomes the following graph:
171 * Which becomes the following graph
253 HGraph* graph = builder.BuildGraph(*item); local
299 HGraph* graph = BuildSSAGraph(data, &allocator); local
331 HGraph* graph = BuildSSAGraph(data, &allocator); local
[all...] |
| linearize_test.cc | 41 HGraph* graph = builder.BuildGraph(*item); local
42 ASSERT_NE(graph, nullptr);
44 graph->BuildDominatorTree();
45 graph->TransformToSSA();
46 graph->FindNaturalLoops();
48 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, InstructionSet::kX86);
49 SsaLivenessAnalysis liveness(*graph, codegen);
60 // Structure of this graph (+ are back edges)
85 // Structure of this graph (+ are back edges)
110 // Structure of this graph (+ are back edges
[all...] |
| /art/compiler/sea_ir/types/ |
| type_inference.h | 37 // Computes the types for the method with SEA IR representation provided by @graph.
38 void ComputeTypes(SeaGraph* graph);
52 // Finds method information about the method encoded by a SEA IR graph.
53 // @graph provides the input method SEA IR representation.
56 FunctionTypeInfo(const SeaGraph* graph, art::verifier::RegTypeCache* types);
58 // an invocation instruction in a SEA IR graph.
59 // @graph provides the input method SEA IR representation.
63 FunctionTypeInfo(const SeaGraph* graph, InstructionNode* inst,
|
| type_inference_visitor.h | 37 TypeInferenceVisitor(SeaGraph* graph, TypeData* type_data,
39 graph_(graph), type_data_(type_data), type_cache_(types), crt_type_() {
42 void Initialize(SeaGraph* graph) { }
43 void Visit(SeaGraph* graph);
|
| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering.cc | 33 #include "ceres/graph.h"
49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
51 const HashSet<ParameterBlock*>& vertices = graph->vertices();
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering);
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
76 int independent_set_size = IndependentSetOrdering(*graph, ordering);
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program))
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); local
[all...] |
| canonical_views_clustering.h | 52 #include "ceres/graph.h"
59 // Compute a partitioning of the vertices of the graph using the
63 // interchangably. Given a weighted Graph G(V,E), the canonical views
65 // of the graph. If w_ij i s the weight connecting the vertex i to
80 // for each vertex in the graph which best explains it, while trying
104 const Graph<int>& graph,
|
| single_linkage_clustering.cc | 38 #include "ceres/graph.h"
47 const Graph<int>& graph,
52 const HashSet<int>& vertices = graph.vertices();
63 const HashSet<int>& neighbors = graph.Neighbors(vertex1);
69 // Since the graph is undirected, only pay attention to one side
72 (graph.EdgeWeight(vertex1, vertex2) < options.min_similarity)) {
|
| /external/chromium_org/cc/resources/ |
| raster_worker_pool.h | 44 // each task in |graph|.
46 TaskGraph* graph);
48 // Utility function that can be used to build a task graph. Inserts a node
49 // that represents |task| in |graph|. See TaskGraph definition for valid
51 static void InsertNodeForTask(TaskGraph* graph,
56 // Utility function that can be used to build a task graph. Inserts nodes that
57 // represent |task| and all its image decode dependencies in |graph|.
59 TaskGraph* graph,
|
| task_graph_runner_perftest.cc | 71 // Avoid unnecessary heap allocations by reusing the same graph.
72 TaskGraph graph; local
76 graph.Reset();
77 BuildTaskGraph(top_level_tasks, tasks, leaf_tasks, &graph);
100 // Avoid unnecessary heap allocations by reusing the same graph and
102 TaskGraph graph; local
107 graph.Reset();
108 BuildTaskGraph(top_level_tasks, tasks, leaf_tasks, &graph);
109 task_graph_runner_->ScheduleTasks(namespace_token_, &graph);
142 // Avoid unnecessary heap allocations by reusing the same graph an
144 TaskGraph graph; local
187 TaskGraph graph; local
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
| DependencyGraphOutput.cpp | 53 void TDependencyGraphOutput::outputAllSpanningTrees(TDependencyGraph& graph)
57 for (TGraphNodeVector::const_iterator iter = graph.begin(); iter != graph.end(); ++iter)
60 mSink << "--- Dependency graph spanning tree ---\n";
|
| /external/chromium_org/v8/src/compiler/ |
| source-position.cc | 6 #include "src/compiler/graph.h"
28 SourcePositionTable::SourcePositionTable(Graph* graph)
29 : graph_(graph),
32 table_(graph->zone()) {}
|
| generic-algorithm-inl.h | 11 #include "src/compiler/generic-graph.h"
27 static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); }
40 static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); }
|
| js-generic-lowering.h | 12 #include "src/compiler/graph.h"
13 #include "src/compiler/graph-reducer.h"
14 #include "src/compiler/js-graph.h"
29 JSGenericLowering(CompilationInfo* info, JSGraph* graph);
47 // Helpers to patch existing nodes in the graph.
57 Zone* zone() const { return graph()->zone(); }
60 Graph* graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSGenericLowering
|
| /external/chromium_org/v8/src/ |
| hydrogen-bce.h | 31 explicit HBoundsCheckEliminationPhase(HGraph* graph)
32 : HPhase("H_Bounds checks elimination", graph), table_(zone()) { }
35 EliminateRedundantBoundsChecks(graph()->entry_block());
|
| hydrogen-range-analysis.h | 16 explicit HRangeAnalysisPhase(HGraph* graph)
17 : HPhase("H_Range analysis", graph), changed_ranges_(16, zone()),
18 in_worklist_(graph->GetMaximumValueID(), zone()),
|
| hydrogen-osr.cc | 21 HGraph* graph = builder_->graph(); local
24 DCHECK(graph->osr() == NULL);
26 // remember this builder as the one OSR builder in the graph.
27 graph->set_osr(this);
29 HBasicBlock* non_osr_entry = graph->CreateBasicBlock();
30 osr_entry_ = graph->CreateBasicBlock();
31 HValue* true_value = graph->GetConstantTrue();
36 HBasicBlock* loop_predecessor = graph->CreateBasicBlock();
|
| hydrogen-sce.cc | 16 for (int i = 0; i < graph()->blocks()->length(); i++) {
17 HBasicBlock* block = graph()->blocks()->at(i);
|
| /external/chromium_org/third_party/angle/src/compiler/translator/timing/ |
| RestrictFragmentShaderTiming.h | 18 void enforceRestrictions(const TDependencyGraph& graph);
28 void validateUserDefinedFunctionCallUsage(const TDependencyGraph& graph);
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| RandomScheduler.java | 33 public RandomScheduler(FilterGraph graph) {
34 super(graph);
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-scheduler.cc | 11 #include "src/compiler/graph.h"
12 #include "src/compiler/graph-visualizer.h"
88 static Schedule* ComputeAndVerifySchedule(int expected, Graph* graph) {
91 os << AsDOT(*graph);
94 Schedule* schedule = Scheduler::ComputeSchedule(graph);
622 Graph graph(scope.main_zone());
624 graph.SetStart(graph.NewNode(builder.Start(0)))
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/bits/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
