| /external/chromium_org/v8/src/compiler/ |
| 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-visualizer.h | 17 class Graph;
20 explicit AsDOT(const Graph& g) : graph(g) {}
21 const Graph& graph; member in struct:v8::internal::compiler::AsDOT
|
| graph-inl.h | 9 #include "src/compiler/graph.h"
16 void Graph::VisitNodeUsesFrom(Node* node, Visitor* visitor) {
23 void Graph::VisitNodeUsesFromStart(Visitor* visitor) {
29 void Graph::VisitNodeInputsFromEnd(Visitor* visitor) {
|
| 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) {}
|
| 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...] |
| graph.cc | 5 #include "src/compiler/graph.h"
9 #include "src/compiler/graph-inl.h"
21 Graph::Graph(Zone* zone) : GenericGraph<Node>(zone), decorators_(zone) {}
24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) {
|
| graph-reducer.h | 15 class Graph;
19 // Represents the result of trying to reduce a node in the graph.
33 // inputs. This class functions as an extension point for the graph reducer for
35 // folding of low-level operators) can be integrated into the graph reduction
55 // Performs an iterative reduction of a node graph.
58 explicit GraphReducer(Graph* graph);
60 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::FINAL
66 // Reduce the whole graph
[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);
|
| node-aux-data.h | 15 class Graph;
|
| scheduler.h | 18 // Computes a schedule from a graph, placing nodes into basic blocks and
23 // Create a new schedule and place all nodes from the graph into it.
24 static Schedule* ComputeSchedule(Graph* graph);
30 // Build and connect the CFG for a node graph, but don't schedule nodes.
31 static void ComputeCFG(Graph* graph, Schedule* schedule);
48 Graph* graph_;
55 Scheduler(Zone* zone, Graph* graph, Schedule* schedule)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| graph_test.cc | 31 #include "ceres/graph.h"
40 TEST(Graph, EmptyGraph) {
41 Graph<int> graph; local
42 EXPECT_EQ(graph.vertices().size(), 0);
45 TEST(Graph, AddVertexAndEdge) {
46 Graph<int> graph; local
47 graph.AddVertex(0, 1.0);
48 graph.AddVertex(1, 2.0)
62 Graph<int> graph; local
87 Graph<int> graph; local
97 Graph<int> graph; local
[all...] |
| 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,
|
| visibility.h | 45 #include "ceres/graph.h"
65 // function above, construct and return a graph whose vertices are
71 // This graph reflects the sparsity structure of reduced camera
75 // Caller acquires ownership of the returned Graph pointer
77 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility);
|
| 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,
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
[all...] |
| 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...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
[all...] |
| 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...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
39 Graph g = new Graph();
60 Graph g = new Graph();
74 Graph g = new Graph();
88 Graph g = new Graph();
102 Graph g = new Graph()
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| graph-tester.h | 12 #include "src/compiler/graph.h"
18 class GraphTester : public HandleAndZoneScope, public Graph {
20 GraphTester() : Graph(main_zone()) {}
|
| /external/srec/tools/grxmlcompile/ |
| gr_iface.cpp | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
30 int Graph::addSubGraph (SubGraph *sbGraph)
68 int Graph::getSubGraphIndex (int subId)
76 int Graph::getSubGraphIndex (SubGraph *sGraph)
86 void Graph::BeginRule (SubGraph *subg)
95 void Graph::EndRule (SubGraph *subg)
104 void Graph::BeginItem (SubGraph *subg)
113 void Graph::BeginItemRepeat (SubGraph *subg, int minCount, int maxCount)
122 void Graph::AddRuleRef (SubGraph *subg, int ruleNo)
132 void Graph::AddLabel (SubGraph *subg, int labNo
[all...] |
| grph.h | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
23 class Graph
26 Graph (const char *name)
36 ~Graph()
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
46 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
49 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 23 /// \brief Default traits class for extracting a graph from an analysis pass.
40 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
41 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
44 ViewGraph(Graph, Name, IsSimple, Title);
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
74 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
78 WriteGraph(File, Graph, IsSimple, Title);
104 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
105 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
107 ViewGraph(Graph, Name, IsSimple, Title)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 48 const ScheduleDAG *Graph) {
56 const ScheduleDAG *Graph) {
65 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
67 const ScheduleDAG *Graph) {
98 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
|
