| /external/chromium_org/v8/src/compiler/ |
| graph-visualizer.cc | 5 #include "src/compiler/graph-visualizer.h"
10 #include "src/compiler/graph.h"
11 #include "src/compiler/graph-inl.h"
27 GraphVisualizer(OStream& os, Zone* zone, const Graph* graph); // NOLINT
43 const Graph* const graph_;
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(),
266 const Graph* graph) // NOLIN
[all...] |
| graph-builder.h | 12 #include "src/compiler/graph.h"
21 // A common base class for anything that creates nodes in a graph.
24 explicit GraphBuilder(Graph* graph) : graph_(graph) {}
65 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::GraphBuilder
73 Graph* graph_;
77 // The StructuredGraphBuilder produces a high-level IR graph. It is used as the
82 StructuredGraphBuilder(Graph* graph, CommonOperatorBuilder* common)
212 Graph* graph() const { return builder_->graph(); } function in class:v8::internal::compiler::StructuredGraphBuilder::Environment
[all...] |
| graph.h | 23 class Graph : public GenericGraph<Node> {
25 explicit Graph(Zone* zone);
|
| change-lowering.h | 8 #include "src/compiler/graph-reducer.h"
45 Graph* graph() const;
|
| graph-replay.cc | 5 #include "src/compiler/graph-replay.h"
8 #include "src/compiler/graph.h"
9 #include "src/compiler/graph-inl.h"
20 void GraphReplayPrinter::PrintReplay(Graph* graph) {
22 PrintF(" Node* nil = graph.NewNode(common_builder.Dead());\n");
23 graph->VisitNodeInputsFromEnd(&replay);
29 PrintF(" Node* n%d = graph.NewNode(op", node->id());
|
| instruction-selector-unittest.h | 38 : RawMachineAssembler(new (test->zone()) Graph(test->zone()),
44 new (test->zone()) Graph(test->zone()),
50 new (test->zone()) Graph(test->zone()),
58 new (test->zone()) Graph(test->zone()),
|
| 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
|
| js-typed-lowering.h | 8 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/js-graph.h"
28 Graph* graph() { return jsgraph_->graph(); } function in class:v8::internal::compiler::FINAL
|
| machine-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h"
51 Graph* graph() const;
|
| simplified-lowering.h | 8 #include "src/compiler/js-graph.h"
48 Graph* graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::SimplifiedLowering
|
| 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...] |
| js-inlining.cc | 6 #include "src/compiler/ast-graph-builder.h"
9 #include "src/compiler/graph-inl.h"
10 #include "src/compiler/graph-visualizer.h"
50 jsgraph_->graph()->VisitNodeInputsFromEnd(&visitor);
64 // A facade on a JSFunction's graph to facilitate inlining. It assumes the
65 // that the function graph has only one return statement, and provides
66 // {UnifyReturn} to convert a function graph to that end.
75 // Return the effect output of the graph,
80 // Return the value output of the graph,
85 // Return the unique return statement of the graph
115 Graph* graph = jsgraph->graph(); local
[all...] |
| graph-reducer-unittest.cc | 5 #include "src/compiler/graph.h"
6 #include "src/compiler/graph-reducer.h"
50 GraphReducer reducer(graph());
56 GraphReducer reducer(graph());
63 GraphReducer reducer(graph());
70 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::GraphReducerTest
73 Graph graph_;
79 Node* node0 = graph()->NewNode(&OP0);
80 Node* node1 = graph()->NewNode(&OP1, node0)
[all...] |
| 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...] |
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 54 CvGraph* Graph;
163 // pLCM : in, information about graph
165 // Returns: pointer to graph node
196 // Purpose: Function create graph node
199 // pLCM : in, information about graph
200 // Returns: pointer to graph node
208 // Purpose: Function create graph edge
211 // pLCM : in, information about graph
212 // Returns: pointer to graph edge
223 // LCMNode : in, graph nod
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
52 Graph *cfg;
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
97 void DominatorTree::buildDFS(Graph::Node *node)
101 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
144 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
175 nw->attach(nv, Graph::Edge::TREE);
229 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
270 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
52 Graph *cfg;
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
97 void DominatorTree::buildDFS(Graph::Node *node)
101 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
144 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
175 nw->attach(nv, Graph::Edge::TREE);
229 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
270 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| 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/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 84 const SelectionDAG *Graph) {
92 const SelectionDAG *Graph) {
112 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
114 const SelectionDAG *Graph) {
116 const std::string &Attrs = Graph->getGraphAttrs(N);
163 /// clearGraphAttrs - Clear all previously defined node graph attributes.
175 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".)
187 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".)
293 // Draw a special "GraphRoot" node to indicate the root of the graph.
|
| /external/llvm/lib/Analysis/ |
| BlockFrequencyInfo.cpp | 43 clEnumValN(GVDT_Fraction, "fraction", "display a graph using the "
45 clEnumValN(GVDT_Integer, "integer", "display a graph using the raw "
84 const BlockFrequencyInfo *Graph) {
91 Graph->printBlockFreq(OS, Node);
94 OS << Graph->getBlockFreq(Node).getFrequency();
97 llvm_unreachable("If we are not supposed to render a graph we should "
|
| /external/llvm/lib/CodeGen/ |
| MachineBlockFrequencyInfo.cpp | 44 clEnumValN(GVDT_Fraction, "fraction", "display a graph using the "
46 clEnumValN(GVDT_Integer, "integer", "display a graph using the raw "
91 const MachineBlockFrequencyInfo *Graph) {
98 Graph->printBlockFreq(OS, Node);
101 OS << Graph->getBlockFreq(Node).getFrequency();
104 llvm_unreachable("If we are not supposed to render a graph we should "
|
| /external/ceres-solver/internal/ceres/ |
| 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)) {
|
| visibility_based_preconditioner.cc | 49 #include "ceres/graph.h"
154 // clusters by constructing another graph with the clusters as
164 // Construct a weighted graph on the set of clusters, where the
167 // maximum spanning forest of this graph.
170 scoped_ptr<Graph<int> > cluster_graph(
172 scoped_ptr<Graph<int> > forest(
192 scoped_ptr<Graph<int> > schur_complement_graph(
498 // Convert a graph into a list of edges that includes self edges for
501 const Graph<int>& forest,
541 // Construct a graph whose vertices are the clusters, and the edg
[all...] |
| canonical_views_clustering_test.cc | 40 #include "ceres/graph.h"
50 // The graph structure is as follows.
68 // The graph interface is directed, so remember to create both
78 Graph<int> graph_;
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
36 public class Graph {
|
