| /art/compiler/optimizing/ |
| graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
29 HBasicBlock* if_block = new (allocator) HBasicBlock(graph);
30 graph->AddBlock(if_block);
40 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
41 HBasicBlock* block = new (allocator) HBasicBlock(graph);
42 graph->AddBlock(block);
48 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
49 HBasicBlock* block = new (allocator) HBasicBlock(graph);
50 graph->AddBlock(block);
56 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator)
71 HGraph* graph = new (&allocator) HGraph(&allocator); local
106 HGraph* graph = new (&allocator) HGraph(&allocator); local
141 HGraph* graph = new (&allocator) HGraph(&allocator); local
177 HGraph* graph = new (&allocator) HGraph(&allocator); local
213 HGraph* graph = new (&allocator) HGraph(&allocator); local
253 HGraph* graph = new (&allocator) HGraph(&allocator); local
290 HGraph* graph = new (&allocator) HGraph(&allocator); local
[all...] |
| optimizing_compiler.cc | 108 HGraph* graph = builder.BuildGraph(*code_item); local
109 if (graph == nullptr) {
111 LOG(FATAL) << "Could not build graph in optimizing compiler";
116 CodeGenerator* codegen = CodeGenerator::Create(&arena, graph, instruction_set);
125 visualizer_output_.get(), graph, kStringFilter, *codegen, dex_compilation_unit);
130 if (RegisterAllocator::CanAllocateRegistersFor(*graph, instruction_set)) {
131 graph->BuildDominatorTree();
132 graph->TransformToSSA();
134 graph->FindNaturalLoops();
136 SsaRedundantPhiElimination(graph).Run()
[all...] |
| ssa_builder.h | 28 explicit SsaBuilder(HGraph* graph)
29 : HGraphVisitor(graph),
31 loop_headers_(graph->GetArena(), kDefaultNumberOfLoops),
32 locals_for_(graph->GetArena(), graph->GetBlocks().Size()) {
33 locals_for_.SetSize(graph->GetBlocks().Size());
|
| /external/chromium_org/v8/src/compiler/ |
| graph-visualizer.h | 17 class Graph;
20 explicit AsDOT(const Graph& g) : graph(g) {}
21 const Graph& graph; member in struct:v8::internal::compiler::AsDOT
|
| change-lowering.cc | 8 #include "src/compiler/js-graph.h"
18 Node* control = graph()->start();
71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value);
77 Node* heap_number = graph()->NewNode(
81 Node* store = graph()->NewNode(
84 return graph()->NewNode(common()->Finish(1), heap_number, store);
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant());
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value);
98 return graph()->NewNode(machine()->Load(kMachFloat64), value,
100 graph()->NewNode(common()->ControlEffect(), control))
242 Graph* ChangeLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::ChangeLowering
[all...] |
| pipeline.cc | 8 #include "src/compiler/ast-graph-builder.h"
11 #include "src/compiler/graph-replay.h"
12 #include "src/compiler/graph-visualizer.h"
90 void Pipeline::VerifyAndPrintGraph(Graph* graph, const char* phase) {
109 of << AsDOT(*graph);
113 os << "-- " << phase << " graph printed to file " << filename.start()
116 if (VerifyGraphs()) Verifier::Run(graph);
175 // Build the graph.
176 Graph graph(zone())
[all...] |
| pipeline.h | 20 class Graph;
32 // Run the pipeline on a machine graph and generate code. If {schedule}
34 Handle<Code> GenerateCodeForMachineGraph(Linkage* linkage, Graph* graph,
50 Schedule* ComputeSchedule(Graph* graph);
51 void VerifyAndPrintGraph(Graph* graph, const char* phase);
52 Handle<Code> GenerateCode(Linkage* linkage, Graph* graph, Schedule* schedule
[all...] |
| typer.h | 10 #include "src/compiler/graph.h"
23 void Run(Graph* graph, MaybeHandle<Context> context);
24 void Narrow(Graph* graph, Node* node, MaybeHandle<Context> context);
25 void Widen(Graph* graph, Node* node, MaybeHandle<Context> context);
27 void DecorateGraph(Graph* graph);
|
| value-numbering-reducer-unittest.cc | 7 #include "src/compiler/graph.h"
30 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::ValueNumberingReducerTest
33 Graph graph_;
39 Node* na = graph()->NewNode(&kOp0);
40 Node* nb = graph()->NewNode(&kOp0);
41 Node* n1 = graph()->NewNode(&kOp0, na);
42 Node* n2 = graph()->NewNode(&kOp0, nb);
49 Node* n0 = graph()->NewNode(&kOp0);
50 Node* n1 = graph()->NewNode(&kOp1, n0)
[all...] |
| verifier.h | 14 class Graph;
17 // Verifies properties of a graph, such as the well-formedness of inputs to
21 static void Run(Graph* graph);
|
| graph-replay.h | 15 class Graph;
17 // Helper class to print a full replay of a graph. This replay can be used to
18 // materialize the same graph within a C++ unit test and hence test subsequent
19 // optimization passes on a graph without going through the construction steps.
23 static void PrintReplay(Graph* graph);
25 static void PrintReplay(Graph* graph) {}
|
| /external/chromium_org/v8/src/ |
| hydrogen-dce.h | 16 explicit HDeadCodeEliminationPhase(HGraph* graph)
17 : HPhase("H_Dead code elimination", graph) { }
|
| hydrogen-redundant-phi.h | 18 explicit HRedundantPhiEliminationPhase(HGraph* graph)
19 : HPhase("H_Redundant phi elimination", graph) { }
|
| hydrogen-representation-changes.h | 16 explicit HRepresentationChangesPhase(HGraph* graph)
17 : HPhase("H_Representation changes", graph) { }
|
| hydrogen-store-elimination.h | 16 explicit HStoreEliminationPhase(HGraph* graph)
17 : HPhase("H_Store elimination", graph),
|
| hydrogen-uint32-analysis.h | 18 explicit HUint32AnalysisPhase(HGraph* graph)
19 : HPhase("H_Compute safe UInt32 operations", graph), phis_(4, zone()) { }
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| Scheduler.java | 31 Scheduler(FilterGraph graph) {
32 mGraph = graph;
|
| SimpleScheduler.java | 28 public SimpleScheduler(FilterGraph graph) {
29 super(graph);
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-node-cache.cc | 7 #include "graph-tester.h"
15 GraphTester graph; local
19 Node** pos = cache.Find(graph.zone(), i);
22 Node** npos = cache.Find(graph.zone(), i);
30 GraphTester graph; local
32 CommonOperatorBuilder common(graph.zone());
40 Node* node = graph.NewNode(common.Int32Constant(k));
41 *cache.Find(graph.zone(), k) = nodes[i] = node;
46 CHECK_EQ(nodes[i], *cache.Find(graph.zone(), k));
52 GraphTester graph; local
78 GraphTester graph; local
93 GraphTester graph; local
119 GraphTester graph; local
136 GraphTester graph; local
[all...] |
| test-schedule.cc | 9 #include "src/compiler/graph.h"
33 Graph graph(scope.main_zone());
34 Node* n0 = graph.NewNode(&dummy_operator);
35 Node* n1 = graph.NewNode(&dummy_operator);
47 Node* n2 = graph.NewNode(&dummy_operator);
79 Graph graph(scope.main_zone());
81 Node* n0 = graph.NewNode(&dummy_operator);
82 Node* b = graph.NewNode(common.Branch(), n0)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| single_linkage_clustering.h | 40 #include "ceres/graph.h"
50 // Graph edges with edge weight less than min_similarity are ignored
55 // Compute a partitioning of the vertices of the graph using the
60 // the graph to an integer indicating the identity of the cluster that
67 const Graph<int>& graph,
|
| parameter_block_ordering_test.cc | 37 #include "ceres/graph.h"
48 typedef Graph<ParameterBlock*> HessianGraph;
86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
88 const VertexSet& vertices = graph->vertices();
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]);
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
132 EXPECT_EQ(graph->vertices().size(), 0)
[all...] |
| /external/chromium_org/tools/gyp/pylib/gyp/ |
| common_test.py | 16 """Test that sorting works on a valid graph with one possible order."""
17 graph = {
24 return tuple(graph[node])
26 gyp.common.TopologicallySorted(graph.keys(), GetEdge),
30 """Test that an exception is thrown on a cyclic graph."""
31 graph = {
38 return tuple(graph[node])
41 graph.keys(), GetEdge)
|
| /external/libvorbis/examples/ |
| frameview.pl | 289 my($graph)=@_;
294 my$w=$graph->{"canvas"};
304 if($graph->{"vars"}->[$i]){
306 if(!defined($graph->{"minx"})){
308 $graph->{"maxx"}=$1;
309 $graph->{"minx"}=$1;
310 $graph->{"maxy"}=$2;
311 $graph->{"miny"}=$2;
317 $rescale=1 if($1>$graph->{"maxx"});
318 $rescale=1 if($1<$graph->{"minx"})
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/translator/timing/ |
| RestrictFragmentShaderTiming.cpp | 47 void RestrictFragmentShaderTiming::enforceRestrictions(const TDependencyGraph& graph)
51 // FIXME(mvujovic): The dependency graph does not support user defined function calls right now,
53 validateUserDefinedFunctionCallUsage(graph);
55 // Starting from each sampler, traverse the dependency graph and generate an error each time we
57 for (TGraphSymbolVector::const_iterator iter = graph.beginSamplerSymbols();
58 iter != graph.endSamplerSymbols();
67 void RestrictFragmentShaderTiming::validateUserDefinedFunctionCallUsage(const TDependencyGraph& graph)
69 for (TFunctionCallVector::const_iterator iter = graph.beginUserDefinedFunctionCalls();
70 iter != graph.endUserDefinedFunctionCalls();
|
