| /external/v8/src/compiler/ |
| 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) {}
|
| select-lowering.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
22 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
29 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
32 Graph* graph_;
|
| basic-block-instrumentor.h | 18 class Graph;
24 Graph* graph, Schedule* schedule);
|
| tail-call-optimization.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
23 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph)
24 : common_(common), graph_(graph) {}
30 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
33 Graph* const graph_;
|
| load-elimination.h | 8 #include "src/compiler/graph-reducer.h"
14 class Graph;
19 explicit LoadElimination(Editor* editor, Graph* graph,
21 : AdvancedReducer(editor), graph_(graph), simplified_(simplified) {}
28 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
32 Graph* const graph_;
|
| graph.cc | 5 #include "src/compiler/graph.h"
18 Graph::Graph(Zone* zone)
27 void Graph::Decorate(Node* node) {
34 void Graph::AddDecorator(GraphDecorator* decorator) {
39 void Graph::RemoveDecorator(GraphDecorator* decorator) {
45 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs,
52 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count,
61 Node* Graph::CloneNode(const Node* node) {
69 NodeId Graph::NextNodeId()
[all...] |
| pipeline.h | 22 class Graph;
34 CompilationInfo* info, Graph* graph, CallDescriptor* descriptor,
37 // Run the pipeline on a machine graph and generate code. The {schedule} must
38 // be valid, hence the given {graph} does not need to be schedulable.
41 Graph* graph, Schedule* schedule,
49 // Run the pipeline on a machine graph and generate code. If {schedule} is
52 Graph* graph,
[all...] |
| dead-code-elimination.h | 8 #include "src/compiler/graph-reducer.h"
18 // Propagates {Dead} control through the graph and thereby removes dead code.
19 // Note that this does not include trimming dead uses from the graph, and it
24 DeadCodeElimination(Editor* editor, Graph* graph,
37 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
41 Graph* const graph_;
|
| control-flow-optimizer.h | 17 class Graph;
24 ControlFlowOptimizer(Graph* graph, CommonOperatorBuilder* common,
37 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
42 Graph* const graph_;
|
| graph-trimmer.h | 15 class Graph;
18 // Trims dead nodes from the node graph.
21 GraphTrimmer(Zone* zone, Graph* graph);
24 // Trim nodes in the {graph} that are not reachable from {graph->end()}.
27 // Trim nodes in the {graph} that are not reachable from either {graph->end()}
48 Graph* graph() const { return graph_; function in class:v8::internal::compiler::final
[all...] |
| graph-visualizer.h | 20 class Graph;
30 AsJSON(const Graph& g, SourcePositionTable* p) : graph(g), positions(p) {}
31 const Graph& graph; member in struct:v8::internal::compiler::AsJSON
38 explicit AsRPO(const Graph& g) : graph(g) {}
39 const Graph& graph; member in struct:v8::internal::compiler::AsRPO
|
| verifier.h | 14 class Graph;
19 // Verifies properties of a graph, such as the well-formedness of inputs to
26 static void Run(Graph* graph, Typing typing = TYPED,
|
| /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,
|
| /system/update_engine/payload_generator/ |
| topological_sort.h | 26 // Performs a topological sort on the directed graph 'graph' and stores
28 // For example, this graph:
37 // Note: results are undefined if there is a cycle in the graph.
38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| cycle_breaker.h | 21 // finding all elementary cycles (a.k.a. circuits) in a directed graph.
22 // See the paper "Finding All the Elementary Circuits of a Directed Graph"
32 // In a sample graph representative of a typical workload, I found over
46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges);
59 Graph subgraph_; // "A_K" in the paper
60 Graph blocked_graph_; // "B" in the paper
|
| graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
36 // These add a read-before dependency from graph[src] -> graph[dst]. If the dep
47 // For each node N in graph, drop all edges N->|index|.
48 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
50 void DumpGraph(const Graph& graph);
|
| tarjan.h | 21 // Strongly Connected Components in a graph.
24 // in the graph. This implementation will only find the strongly connected
39 Graph* graph,
42 void Tarjan(Vertex::Index vertex, Graph* graph);
|
| /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/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.
55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
59 ViewGraph(Graph, Name, IsSimple, Title);
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph);
108 WriteGraph(File, Graph, IsSimple, Title);
134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph);
137 ViewGraph(Graph, Name, IsSimple, Title)
[all...] |
