| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
32 /// NodeSubset - A subset of the graph's nodes.
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
101 /// Nodes - The list of nodes for this graph
[all...] |
| /external/llvm/lib/Analysis/IPA/ |
| CallPrinter.cpp | 1 //===- CallPrinter.cpp - DOT printer for call graph -----------------------===//
11 // containing the call graph of a module.
28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; }
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
77 INITIALIZE_PASS(CallGraphViewer, "view-callgraph", "View call graph", false,
82 "Print call graph to 'dot' file", false, false)
|
| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering.h | 36 #include "ceres/graph.h"
74 // Builds a graph on the parameter blocks of a Problem, whose
79 Graph<ParameterBlock*>* CreateHessianGraph(const Program& program);
|
| parameter_block_ordering.cc | 33 #include "ceres/graph.h"
49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
51 const HashSet<ParameterBlock*>& vertices = graph->vertices();
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering);
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
76 int independent_set_size = IndependentSetOrdering(*graph, ordering);
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program))
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); local
[all...] |
| single_linkage_clustering_test.cc | 39 #include "ceres/graph.h"
46 Graph<int> graph; local
49 graph.AddVertex(i);
51 // Graph structure:
54 graph.AddEdge(0, 1, 1.0);
55 graph.AddEdge(1, 2, 1.0);
56 graph.AddEdge(2, 3, 1.0);
57 graph.AddEdge(4, 5, 1.0);
61 ComputeSingleLinkageClustering(options, graph, &membership)
73 Graph<int> graph; local
102 Graph<int> graph; local
[all...] |
| graph_algorithms_test.cc | 36 #include "ceres/graph.h"
44 Graph<int> graph; local
45 graph.AddVertex(0);
46 graph.AddVertex(1);
47 graph.AddVertex(2);
48 graph.AddVertex(3);
49 graph.AddVertex(4);
51 graph.AddEdge(0, 1);
52 graph.AddEdge(1, 2)
74 Graph<int> graph; local
105 Graph<int> graph; local
122 Graph<int> graph; local
169 Graph<int> graph; local
201 Graph<int> graph; local
[all...] |
| canonical_views_clustering.cc | 40 #include "ceres/graph.h"
56 // graph. centers will contain the vertices that are the identified
64 const Graph<int>& graph,
77 const Graph<int>* graph_;
88 const Graph<int>& graph,
93 cv.ComputeClustering(options, graph, centers, membership);
101 const Graph<int>& graph,
[all...] |
| graph_algorithms.h | 40 #include "ceres/graph.h"
46 // Compare two vertices of a graph by their degrees, if the degrees
51 explicit VertexTotalOrdering(const Graph<Vertex>& graph)
52 : graph_(graph) {}
62 const Graph<Vertex>& graph_;
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph)
69 : graph_(graph) {}
76 const Graph<Vertex>& graph_
[all...] |
| graph.h | 46 // A weighted undirected graph templated over the vertex ids. Vertex
49 class Graph {
51 Graph() {}
53 // Add a weighted vertex. If the vertex already exists in the graph,
92 // AddEdge on a pair of vertices which do not exist in the graph yet
117 // Calling VertexWeight on a vertex not in the graph will result in
124 // vertices is not present in the graph will result in undefined
135 // Calling Neighbors on a vertex not in the graph will result in
155 CERES_DISALLOW_COPY_AND_ASSIGN(Graph);
|
| visibility.cc | 46 #include "ceres/graph.h"
79 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) {
125 Graph<int>* graph = new Graph<int>(); local
132 graph->AddVertex(i);
133 graph->AddEdge(i, i, kSelfEdgeWeight);
149 graph->AddEdge(camera1, camera2, weight);
152 VLOG(2) << "Schur complement graph time: " << (time(NULL) - start_time);
153 return graph;
[all...] |
| visibility_based_preconditioner.h | 55 #include "ceres/graph.h"
99 // by constructing a weighted graph on the clusters, with the weight
102 // maximum spanning forest is identified in this graph and the camera
159 Graph<int>* CreateClusterGraph(const vector<set<int> >& visibility) const;
160 void ForestToClusterPairs(const Graph<int>& forest,
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| graph-builder-tester.h | 12 #include "src/compiler/graph-builder.h"
16 #include "test/cctest/compiler/simplified-graph-builder.h"
22 // A class that just passes node creation on to the Graph.
25 explicit DirectGraphBuilder(Graph* graph) : GraphBuilder(graph) {}
31 return graph()->NewNode(op, value_input_count, value_inputs);
53 // TODO(dcarney): shouldn't need graph stored.
54 Graph* graph_;
62 : main_graph_(new (zone) Graph(zone))
[all...] |
| /external/chromium_org/cc/layers/ |
| heads_up_display_layer_impl.h | 53 class Graph {
55 Graph(double indicator_value, double start_upper_bound);
58 // graph, so that the graph always scales to either it's max or
99 const Graph& graph) const;
130 Graph fps_graph_;
131 Graph paint_time_graph_;
|
| /external/chromium_org/v8/src/compiler/ |
| js-inlining.h | 8 #include "src/compiler/js-graph.h"
34 static void UnifyReturn(Graph* graph);
|
| source-position.h | 74 explicit SourcePositionTable(Graph* graph);
87 Graph* graph_;
|
| js-graph.h | 10 #include "src/compiler/graph.h"
21 // Implements a facade on a Graph, enhancing the graph with JS-specific
26 JSGraph(Graph* graph, CommonOperatorBuilder* common,
29 : graph_(graph),
86 Graph* graph() { return graph_; } function in class:v8::internal::compiler::JSGraph
87 Zone* zone() { return graph()->zone(); }
91 Graph* graph_
[all...] |
| js-builtin-reducer.h | 8 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/js-graph.h"
28 Graph* graph() const { return jsgraph_->graph(); } function in class:v8::internal::compiler::FINAL
|
| simplified-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h"
39 Graph* graph() const;
|
| source-position.cc | 6 #include "src/compiler/graph.h"
28 SourcePositionTable::SourcePositionTable(Graph* graph)
29 : graph_(graph),
32 table_(graph->zone()) {}
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
113 Graph::Node *dn = dom.parent();
310 Graph::Edge *e = cfg.outgoing(true).getEdge();
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
351 Graph::Node *bn = &that->dom;
352 Graph::Node *dn = &this->dom;
363 Graph::Node *out[2];
365 Graph::Edge::Type eR;
371 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
113 Graph::Node *dn = dom.parent();
310 Graph::Edge *e = cfg.outgoing(true).getEdge();
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
351 Graph::Node *bn = &that->dom;
352 Graph::Node *dn = &this->dom;
363 Graph::Node *out[2];
365 Graph::Edge::Type eR;
371 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
43 /// PBQP Graph class.
47 class Graph : public GraphBase {
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
111 NIds[0] = NIds[1] = Graph::invalidNodeId();
117 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
124 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
133 void connect(Graph &G, EdgeId ThisEdgeId)
[all...] |
| RegAllocSolver.h | 11 // graph reduction approach. Nodes of degree 0, 1 and 2 are eliminated with
13 // nodes are present, a heuristic derived from Brigg's graph coloring approach
22 #include "Graph.h"
148 typedef PBQP::Graph<RegAllocSolverImpl> Graph;
150 RegAllocSolverImpl(Graph &G) : G(G) {}
269 // Compute a reduction order for the graph by iteratively applying PBQP
276 assert(!G.empty() && "Cannot reduce empty graph.");
330 SpillCostComparator(const Graph& G) : G(G) {}
337 const Graph& G
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 92 const Function *Graph) {
94 return getSimpleNodeLabel(Node, Graph);
96 return getCompleteNodeLabel(Node, Graph);
|
| /external/clang/lib/AST/ |
| StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) {
|
