| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 typedef PBQP::Graph<RegAllocSolverImpl> Graph;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
481 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 typedef PBQP::Graph<RegAllocSolverImpl> Graph;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
481 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 22 #include "llvm/CodeGen/PBQP/Graph.h"
130 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
174 // optimally reducible) when reducing the graph.
286 using Graph = PBQP::Graph<RegAllocSolverImpl>;
288 RegAllocSolverImpl(Graph &G) : G(G) {}
301 "PBQP Graph should not contain single or zero-option nodes");
420 // Compute a reduction order for the graph by iteratively applying PBQP
427 assert(!G.empty() && "Cannot reduce empty graph.");
480 SpillCostComparator(const Graph& G) : G(G) {
[all...] |
| /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,
745 Graph graph; local
[all...] |
| /external/tensorflow/tensorflow/contrib/slim/python/slim/ |
| learning_test.py | 242 g = ops.Graph()
275 with ops.Graph().as_default():
313 with ops.Graph().as_default():
346 with ops.Graph().as_default():
371 with ops.Graph().as_default():
397 with ops.Graph().as_default():
429 g = ops.Graph()
444 train_op, logdir, number_of_steps=300, log_every_n_steps=10, graph=g)
449 with ops.Graph().as_default():
468 with ops.Graph().as_default()
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| constant_folding.cc | 33 #include "tensorflow/core/graph/algorithm.h"
34 #include "tensorflow/core/graph/node_builder.h"
35 #include "tensorflow/core/graph/subgraph.h"
273 // but to preserve the graph structure we must transfer the control
318 const Graph* graph, const ConstantFoldingOptions& opts,
325 ReverseDFS(*graph, nullptr,
348 // constant propagation. node_map is the mapping of nodes in the original graph
349 // to nodes in the constant graph. The value of an entry in node_map is a vector
350 // of nodes because a ShapeN node in the original graph is replaced by a vecto
[all...] |
| /external/tensorflow/tensorflow/contrib/kfac/python/kernel_tests/ |
| layer_collection_test.py | 54 with ops.Graph().as_default():
72 with ops.Graph().as_default():
96 with ops.Graph().as_default():
125 with ops.Graph().as_default():
218 with ops.Graph().as_default(), self.test_session() as sess:
234 with ops.Graph().as_default():
253 with ops.Graph().as_default():
264 with ops.Graph().as_default():
310 with ops.Graph().as_default():
318 with ops.Graph().as_default(), self.test_session() as sess
[all...] |
| /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...] |
| /external/llvm/lib/Analysis/ |
| BlockFrequencyInfo.cpp | 36 "display a graph using the "
39 "display a graph using the raw "
41 clEnumValN(GVDT_Count, "count", "display a graph using the real "
93 const BlockFrequencyInfo *Graph) {
95 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph,
100 const BlockFrequencyInfo *Graph) {
101 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph,
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| CFG.h | 240 // graph of basic blocks...
270 // graph of basic blocks... and to walk it in inverse order. Inverse order for
277 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
290 return G.Graph;
307 // graph of basic blocks... these are the same as the basic block iterators,
313 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
322 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
330 // graph of basic blocks... and to walk it in inverse order. Inverse order for
337 return &G.Graph->getEntryBlock();
343 return &G.Graph->getEntryBlock()
[all...] |
| /external/swiftshader/third_party/LLVM/tools/opt/ |
| GraphPrinters.cpp | 1 //===- GraphPrinters.cpp - DOT printers for various graph types -----------===//
11 // by the LLVM infrastructure. It uses the generic graph interface to convert
12 // the graph into a .dot graph. These graphs can then be processed with the
48 // Call Graph Printer
58 return "Call Graph";
61 static std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
91 "Print Call Graph to 'dot' file");
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| const_analysis.cc | 23 #include "tensorflow/core/graph/algorithm.h"
27 // Backwards dataflow analysis that finds arguments to a graph that must be
29 Status BackwardsConstAnalysis(const Graph& g,
88 // acyclic graph.
|
