| /external/v8/src/compiler/ |
| machine-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h"
85 Graph* graph() const;
|
| effect-control-linearizer.h | 23 class Graph;
28 EffectControlLinearizer(JSGraph* graph, Schedule* schedule, Zone* temp_zone);
135 Graph* graph() const;
|
| escape-analysis.cc | 13 #include "src/compiler/graph-reducer.h"
70 EscapeStatusAnalysis(EscapeAnalysis* object_analysis, Graph* graph,
80 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::EscapeStatusAnalysis
111 Graph* const graph_;
203 bool MergeFrom(MergeCache* cache, Node* at, Graph* graph,
220 bool MergeFields(size_t i, Node* at, MergeCache* cache, Graph* graph,
1611 Graph* EscapeAnalysis::graph() const { return status_analysis_->graph(); } function in class:v8::internal::compiler::EscapeAnalysis
[all...] |
| basic-block-instrumentor.cc | 11 #include "src/compiler/graph.h"
51 CompilationInfo* info, Graph* graph, Schedule* schedule) {
70 CommonOperatorBuilder common(graph->zone());
71 Node* zero = graph->NewNode(common.Int32Constant(0));
72 Node* one = graph->NewNode(common.Int32Constant(1));
73 MachineOperatorBuilder machine(graph->zone());
82 Node* base = graph->NewNode(
84 Node* load = graph->NewNode(machine.Load(MachineType::Uint32()), base, zero,
85 graph->start(), graph->start())
[all...] |
| dead-code-elimination.cc | 8 #include "src/compiler/graph.h"
16 DeadCodeElimination::DeadCodeElimination(Editor* editor, Graph* graph,
19 graph_(graph),
21 dead_(graph->NewNode(common->Dead())) {}
|
| js-typed-lowering.h | 9 #include "src/compiler/graph-reducer.h"
95 Graph* graph() const;
|
| loop-analysis.h | 9 #include "src/compiler/graph.h"
24 // Represents a tree of loops in a graph.
149 // Build a loop tree for the entire graph.
150 static LoopTree* BuildLoopTree(Graph* graph, Zone* temp_zone);
|
| pipeline.cc | 12 #include "src/compiler/ast-graph-builder.h"
16 #include "src/compiler/bytecode-graph-builder.h"
26 #include "src/compiler/graph-replay.h"
27 #include "src/compiler/graph-trimmer.h"
28 #include "src/compiler/graph-visualizer.h"
97 graph_ = new (graph_zone_) Graph(graph_zone_);
110 PipelineData(ZonePool* zone_pool, CompilationInfo* info, Graph* graph,
117 graph_(graph),
124 // For machine graph testing entry point
176 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::PipelineData
1334 Graph* graph = data->graph(); local
[all...] |
| ast-graph-builder.h | 9 #include "src/compiler/js-graph.h"
24 class Graph;
31 // The AstGraphBuilder produces a high-level IR graph, based on an
32 // underlying AST. The produced graph can either be compiled into a
33 // stand-alone function or be wired into another graph for the purposes
41 // Creates a graph by visiting the entire AST.
115 // Result of loop assignment analysis performed before graph creation.
118 // Result of type hint analysis performed before graph creation.
144 Graph* graph() { return jsgraph_->graph(); function in class:v8::internal::compiler::AstGraphBuilder
594 Graph* graph() const { return builder_->graph(); } function in class:v8::internal::compiler::AstGraphBuilder::Environment
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-run-stubs.cc | 8 #include "src/compiler/graph.h"
9 #include "src/compiler/js-graph.h"
39 Graph graph(zone);
42 Node* start = graph.NewNode(common.Start(6));
44 Node* receiverParam = graph.NewNode(common.Parameter(1), start);
45 Node* nameParam = graph.NewNode(common.Parameter(2), start);
46 Node* slotParam = graph.NewNode(common.Parameter(3), start);
47 Node* vectorParam = graph.NewNode(common.Parameter(4), start);
48 Node* theCode = graph.NewNode(common.HeapConstant(code))
[all...] |
| function-tester.h | 38 FunctionTester(Graph* graph, int param_count)
42 CompileGraph(graph);
193 static Handle<JSFunction> ForMachineGraph(Graph* graph, int param_count) {
196 FunctionTester f(graph, param_count);
248 // Compile the given machine graph instead of the source of the function
250 Handle<JSFunction> CompileGraph(Graph* graph) {
258 Handle<Code> code = Pipeline::GenerateCodeForTesting(&info, graph);
[all...] |
| graph-builder-tester.h | 25 : main_graph_(new (zone) Graph(zone)),
31 Graph* graph() const { return main_graph_; } function in class:v8::internal::compiler::GraphAndBuilders
32 Zone* zone() const { return graph()->zone(); }
39 Graph* main_graph_;
78 // Initialize graph and builder.
80 CHECK_NULL(graph()->start());
81 Node* start = graph()->NewNode(common()->Start(num_parameters + 3));
82 graph()->SetStart(start);
88 graph()->NewNode(common()->Return(), value, effect_, graph()->start())
[all...] |
| test-multiple-return.cc | 76 new (handles.main_zone()) Graph(handles.main_zone()),
90 Pipeline::GenerateCodeForTesting(&info, desc, m.graph(), m.Export());
|
| test-run-native-calls.cc | 14 #include "test/cctest/compiler/graph-builder-tester.h"
255 Handle<Code> CompileGraph(const char* name, CallDescriptor* desc, Graph* graph,
258 CompilationInfo info(ArrayVector("testing"), isolate, graph->zone());
260 Pipeline::GenerateCodeForTesting(&info, desc, graph, schedule);
280 Node* start = b.graph()->NewNode(b.common()->Start(param_count + 3));
281 b.graph()->SetStart(start);
282 Node* target = b.graph()->NewNode(b.common()->HeapConstant(inner));
289 args[index] = b.graph()->NewNode(b.common()->Parameter(i), start);
297 b.graph()->NewNode(b.common()->Call(desc), param_count + 3, args)
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir.h | 899 static inline BasicBlock *get(Graph::Node *);
902 Graph::Node cfg; // first edge is branch *taken* (the ELSE branch)
903 Graph::Node dom;
938 static inline Function *get(Graph::Node *node);
969 Graph cfg;
970 Graph::Node *cfgExit;
971 Graph *domTree;
972 Graph::Node call; // node in the call graph
1052 Graph calls
[all...] |
| nv50_ir_inlines.h | 372 BasicBlock *BasicBlock::get(Graph::Node *node)
378 Function *Function::get(Graph::Node *node)
|
| nv50_ir_from_sm4.cpp | [all...] |
| nv50_ir_from_tgsi.cpp | [all...] |
| /external/v8/test/unittests/compiler/ |
| graph-reducer-unittest.cc | 6 #include "src/compiler/graph.h"
10 #include "test/unittests/compiler/graph-reducer-unittest.h"
86 explicit NewABReducer(Graph* graph) : graph_(graph) {}
105 Graph* const graph_;
112 explicit A0Wrapper(Graph* graph) : graph_(graph) {}
124 Graph* const graph_
226 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::AdvancedReducerTest
449 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::GraphReducerTest
[all...] |
| /external/ceres-solver/internal/ceres/ |
| visibility_test.cc | 42 #include "ceres/graph.h"
111 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility));
112 EXPECT_EQ(graph->vertices().size(), visibility.size());
114 EXPECT_EQ(graph->VertexWeight(i), 1.0);
124 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight)
126 << " weight: " << graph->EdgeWeight(i, j)
187 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility));
188 EXPECT_EQ(graph->vertices().size(), visibility.size())
[all...] |
| 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/llvm/lib/Analysis/ |
| DomPrinter.cpp | 12 // program, with a graph of the dominance/postdominance tree of that
34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) {
|
| /external/opencv3/modules/stitching/include/opencv2/stitching/detail/ |
| motion_estimators.hpp | 256 // Returns matches graph representation in DOT language
267 Graph &span_tree, std::vector<int> ¢ers);
|
| /system/update_engine/payload_generator/ |
| inplace_generator_unittest.cc | 184 Graph graph; local
187 // Create nodes in graph
189 graph.resize(graph.size() + 1);
190 graph.back().aop.op.set_type(InstallOperation::MOVE);
196 StoreExtents(extents, graph.back().aop.op.mutable_src_extents());
197 blocks[3].reader = graph.size() - 1;
198 blocks[5].reader = graph.size() - 1;
199 blocks[7].reader = graph.size() - 1
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_object_graph.py | 4 from altgraph.Graph import Graph
31 graph = ObjectGraph()
32 self.assertTrue(isinstance(graph, ObjectGraph))
34 g = Graph()
35 graph = ObjectGraph(g)
36 self.assertTrue(graph.graph is g)
37 self.assertEqual(graph.debug, 0)
38 self.assertEqual(graph.indent, 0
[all...] |
