| /prebuilts/clang/host/linux-x86/clang-4393122/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 {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/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 {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/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 {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/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 {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/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 {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/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 {
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
133 void disconnectFromN(Graph &G, unsigned NIdx) {
141 void disconnectFrom(Graph &G, NodeId NId)
[all...] |
| /external/tensorflow/tensorflow/contrib/learn/python/learn/estimators/ |
| head_test.py | 119 with ops.Graph().as_default(), session.Session():
145 with ops.Graph().as_default(), session.Session():
163 with ops.Graph().as_default(), session.Session():
178 with ops.Graph().as_default(), session.Session():
189 with ops.Graph().as_default(), session.Session():
207 with ops.Graph().as_default(), session.Session():
220 with ops.Graph().as_default(), session.Session():
236 with ops.Graph().as_default(), session.Session():
250 with ops.Graph().as_default(), session.Session():
268 with ops.Graph().as_default(), session.Session()
[all...] |
| /external/clang/lib/AST/ |
| StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) {
|
| /external/llvm/lib/CodeGen/ |
| MachineBlockFrequencyInfo.cpp | 39 "display a graph using the "
42 "display a graph using the raw "
44 clEnumValN(GVDT_Count, "count", "display a graph using the real "
91 const MachineBlockFrequencyInfo *Graph) {
93 Node, Graph, ViewMachineBlockFreqPropagationDAG);
97 const MachineBlockFrequencyInfo *Graph) {
98 return MBFIDOTGraphTraitsBase::getNodeAttributes(Node, Graph,
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| sharding_util_test.cc | 23 Graph graph(OpRegistry::Global());
|
| const_analysis_test.cc | 41 Graph graph(OpRegistry::Global());
42 TF_ASSERT_OK(root.ToGraph(&graph));
45 TF_ASSERT_OK(BackwardsConstAnalysis(graph, &const_args));
47 // Arg 0 doesn't need to be constant since the graph only uses its shape.
72 Graph graph(OpRegistry::Global());
73 TF_ASSERT_OK(root.ToGraph(&graph));
76 TF_ASSERT_OK(BackwardsConstAnalysis(graph, &const_args));
|
| xla_compiler_test.cc | 35 #include "tensorflow/core/graph/graph.h"
36 #include "tensorflow/core/graph/graph_constructor.h"
114 scope.UpdateStatus(builder.Finalize(scope.graph(), &ret));
167 // Tests compilation and execution of an empty graph.
171 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()));
174 std::move(graph),
180 // Tests compilation and execution of a graph that adds two tensors
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| costmodel.h | 25 #include "tensorflow/core/graph/graph.h"
26 #include "tensorflow/core/graph/types.h"
39 // of a single Graph:
70 void InitFromGraph(const Graph& g);
78 void MergeFromLocal(const Graph& g, const CostModel& cm);
111 // Check that an estimate is available for every OP node in graph.
112 void CheckInitialized(const Graph& graph) const;
169 void AddToCostGraphDef(const Graph* graph, CostGraphDef* cost_graph) const
[all...] |
| graph_partition.h | 25 #include "tensorflow/core/framework/graph.pb.h"
26 #include "tensorflow/core/graph/costmodel.h"
27 #include "tensorflow/core/graph/graph.h"
37 // A function that returns a unique graph node name with the given
55 // graph before any partitioning. So this flag should be false for
74 // The start time for each node in the graph computed by some scheduling
76 // in the graph as a node attribute.
81 // Partition "input" graph into a set of graphs, one per location.
87 Status Partition(const PartitionOptions& opts, Graph* input
[all...] |
| tensor_id.cc | 16 #include "tensorflow/core/graph/tensor_id.h"
51 id.second = Graph::kControlSlot;
|
| /external/tensorflow/tensorflow/core/kernels/ |
| sparse_tensor_dense_matmul_op_test.cc | 20 #include "tensorflow/core/graph/node_builder.h"
26 Node* SparseTensorDenseMatMulNode(Graph* g, Node* a_indices, Node* a_values,
42 static Graph* SparseTensorDenseMatmul(int nnz, int m, int k, int n,
44 Graph* g = new Graph(OpRegistry::Global());
65 g, test::graph::Constant(g, a_indices),
66 test::graph::Constant(g, a_values), test::graph::HostConstant(g, a_shape),
67 test::graph::Constant(g, b), adjoint_a, adjoint_b);
|
| /external/tensorflow/tensorflow/python/framework/ |
| proto_test.py | 36 # Serialize the resulting graph def.
37 gdef = a.op.graph.as_graph_def()
39 unserialized = ops.Graph().as_graph_def()
|
| /external/v8/src/compiler/ |
| graph-trimmer.cc | 5 #include "src/compiler/graph-trimmer.h"
7 #include "src/compiler/graph.h"
13 GraphTrimmer::GraphTrimmer(Zone* zone, Graph* graph)
14 : graph_(graph), is_live_(graph, 2), live_(zone) {
15 live_.reserve(graph->NodeCount());
24 MarkAsLive(graph()->end());
|
| js-generic-lowering.h | 9 #include "src/compiler/graph-reducer.h"
48 Graph* graph() const;
|
| select-lowering.cc | 9 #include "src/compiler/graph.h"
17 SelectLowering::SelectLowering(Graph* graph, CommonOperatorBuilder* common)
18 : common_(common), graph_(graph) {}
32 Diamond d(graph(), common(), cond, p.hint());
|
| simplified-operator-reducer.h | 9 #include "src/compiler/graph-reducer.h"
48 Graph* graph() const;
|
| /test/vti/dashboard/src/main/java/com/android/vts/util/ |
| Graph.java | 23 /** Helper object for describing graph data. */
24 public abstract class Graph {
35 * Get the graph type.
37 * @return The graph type.
56 * Get the name of the graph.
58 * @return The name of the graph.
63 * Get the number of data points stored in the graph.
65 * @return The number of data points stored in the graph.
70 * Add data to the graph.
72 * @param id The name of the graph
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| DataFlow.h | 65 return G.Graph;
86 return G.Graph;
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| device.h | 40 #include "tensorflow/core/framework/graph.pb.h"
45 #include "tensorflow/core/graph/graph.h"
46 #include "tensorflow/core/graph/types.h"
113 // 'graph' supplies the partition of the graph assigned to this
115 virtual Status MaybeRewriteGraph(std::unique_ptr<Graph>* /*graph*/) {
119 // Fill in the context map for the graph. Default behavior is to do
124 virtual Status FillContextMap(const Graph* graph
[all...] |
| optimization_registry.h | 16 // Classes to maintain a static registry of whole-graph optimization
17 // passes to be applied by the Session when it initializes a graph.
27 #include "tensorflow/core/graph/costmodel.h"
28 #include "tensorflow/core/graph/graph.h"
50 // The graph to optimize, for optimization passes that run before
52 // An optimization pass may replace *graph with a new graph object.
53 std::unique_ptr<Graph>* graph = nullptr member in struct:tensorflow::GraphOptimizationPassOptions
[all...] |
