| /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/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/opencv3/modules/cudaimgproc/src/ |
| mssegmentation.cpp | 86 class Graph
91 Graph(int numv, int nume_max);
102 Graph(const Graph&);
103 void operator =(const Graph&);
182 Graph<T>::Graph(int numv_, int nume_max_) : start(numv_, -1), edges(nume_max_)
191 inline void Graph<T>::addEdge(int from, int to, const T& val)
245 Graph<SegmLinkVal> g(nrows * ncols, 4 * (nrows - 1) * (ncols - 1)
248 // Make region adjacent graph from imag
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 84 const SelectionDAG *Graph) {
99 const SelectionDAG *Graph) {
119 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
121 const SelectionDAG *Graph) {
123 const std::string &Attrs = Graph->getGraphAttrs(N);
170 /// clearGraphAttrs - Clear all previously defined node graph attributes.
182 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".)
194 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".)
300 // Draw a special "GraphRoot" node to indicate the root of the graph.
|
| /external/v8/src/compiler/ |
| graph.h | 21 // Marks are used during traversal of the graph to distinguish states of nodes.
31 class Graph final : public ZoneObject {
33 explicit Graph(Zone* zone);
36 // the original start and end nodes of the graph, and resets them when you
40 explicit SubgraphScope(Graph* graph)
41 : graph_(graph), start_(graph->start()), end_(graph->end()) {}
48 Graph* const graph_
[all...] |
| js-graph.h | 10 #include "src/compiler/graph.h"
23 // Implements a facade on a Graph, enhancing the graph with JS-specific
28 JSGraph(Isolate* isolate, Graph* graph, CommonOperatorBuilder* common,
32 graph_(graph),
139 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::JSGraph
140 Zone* zone() const { return graph()->zone(); }
171 Graph* graph_
[all...] |
| control-equivalence.h | 8 #include "src/compiler/graph.h"
19 // - Build a program structure tree (PST) for controls in the graph.
20 // - Determine single-entry single-exit (SESE) regions within the graph.
33 ControlEquivalence(Zone* zone, Graph* graph)
35 graph_(graph),
38 node_data_(graph->NodeCount(), EmptyData(), zone) {}
41 // the following iterations over control edges of the graph:
104 // Performs and undirected DFS walk of the graph. Conceptually all nodes are
161 Graph* const graph_
[all...] |
| memory-optimizer.h | 17 class Graph;
63 // An allocation state is propagated on the effect paths through the graph.
101 // path through the graph.
128 Graph* graph() const;
|
| state-values-utils.h | 8 #include "src/compiler/js-graph.h"
15 class Graph;
52 Graph* graph() { return js_graph_->graph(); } function in class:v8::internal::compiler::StateValuesCache
55 Zone* zone() { return graph()->zone(); }
|
| js-call-reducer.h | 9 #include "src/compiler/graph-reducer.h"
48 Graph* graph() const;
|
| js-global-object-specialization.h | 8 #include "src/compiler/graph-reducer.h"
50 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/v8/test/cctest/compiler/ |
| test-graph-visualizer.cc | 6 #include "src/compiler/graph.h"
7 #include "src/compiler/graph-visualizer.h"
30 Graph graph(scope.main_zone());
33 Node* start = graph.NewNode(common.Start(0));
34 graph.SetStart(start);
35 Node* k = graph.NewNode(common.Int32Constant(0));
37 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
39 graph.SetEnd(phi);
42 SourcePositionTable table(&graph);
[all...] |
| test-node.cc | 7 #include "src/compiler/graph.h"
146 Graph graph(&zone);
147 Node* n0 = graph.NewNode(&dummy_operator0);
148 Node* n1 = graph.NewNode(&dummy_operator1, n0);
149 Node* n2 = graph.NewNode(&dummy_operator1, n0);
150 Node* n3 = graph.NewNode(&dummy_operator0);
172 Graph graph(&zone);
173 Node* n0 = graph.NewNode(&dummy_operator0)
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_graphutil.py | 3 from altgraph import Graph, GraphError
57 graph = GraphUtil.generate_scale_free_graph(50, 10)
58 self.assertEqual(graph.number_of_nodes(), 500)
61 for node in graph:
62 degree = graph.inc_degree(node)
83 g = Graph.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/opencv3/modules/stitching/include/opencv2/stitching/detail/ |
| util.hpp | 135 class CV_EXPORTS Graph
138 Graph(int num_vertices = 0) { create(num_vertices); }
|
| /system/update_engine/payload_generator/ |
| graph_utils_unittest.cc | 36 Graph graph(2);
38 graph[0].out_edges.insert(make_pair(1, EdgeProperties()));
40 vector<Extent>& extents = graph[0].out_edges[1].extents;
56 EXPECT_EQ(4U, graph_utils::EdgeWeight(graph, make_pair(0, 1)));
61 Graph graph(3);
63 graph_utils::AddReadBeforeDep(&graph[0], 1, 3);
64 EXPECT_EQ(1U, graph[0].out_edges.size());
66 Extent& extent = graph[0].out_edges[1].extents[0]
[all...] |
| topological_sort_unittest.cc | 64 const Graph::size_type kNodeCount = counter++;
66 Graph graph(kNodeCount);
68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties()));
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties()));
70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties()));
71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties()));
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties()));
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
74 graph[n_e].out_edges.insert(make_pair(n_d, EdgeProperties()))
[all...] |
| inplace_generator.cc | 83 // their destination extents given the index of the operations in the graph.
86 explicit IndexedInstallOperationsDstComparator(Graph* graph)
87 : graph_(graph) {}
96 const Graph* const graph_;
101 void InplaceGenerator::CheckGraph(const Graph& graph) {
102 for (const Vertex& v : graph) {
139 bool InplaceGenerator::CutEdges(Graph* graph,
744 Graph graph; local
[all...] |
| graph_types.h | 33 // for the graph work.
63 // We sometimes wish to consider a subgraph of a graph. A subgraph would have
64 // a subset of the vertices from the graph and a subset of the edges.
81 typedef std::vector<Vertex> Graph;
|
| /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)) {
|
| /external/llvm/include/llvm/IR/ |
| CFG.h | 154 // graph of basic blocks...
184 // graph of basic blocks... and to walk it in inverse order. Inverse order for
191 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
204 return G.Graph;
221 // graph of basic blocks... these are the same as the basic block iterators,
227 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
237 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
246 // graph of basic blocks... and to walk it in inverse order. Inverse order for
253 return &G.Graph->getEntryBlock();
259 return &G.Graph->getEntryBlock()
[all...] |
| /system/core/libmemunreachable/ |
| LeakFolding.h | 85 Graph<LeakInfo> leak_graph_;
|
