HomeSort by relevance Sort by last modified time
    Searched refs:Graph (Results 51 - 75 of 1024) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/
GraphTest.java 29 /** Unit tests for {@link org.tensorflow.Graph}. */
36 // Create a graph for A * X + B
37 try (Graph g = new Graph()) {
42 try (Graph g = new Graph()) {
46 try (Graph g = new Graph()) {
54 private static void validateImportedGraph(Graph g, String prefix) {
79 try (Graph g = new Graph())
    [all...]
  /external/tensorflow/tensorflow/core/graph/
graph_constructor.h 19 #include "tensorflow/core/framework/graph.pb.h"
20 #include "tensorflow/core/graph/graph.h"
21 #include "tensorflow/core/graph/tensor_id.h"
27 // Construct a Graph *g out of a GraphDef gdef. Returns non-OK on
30 // *g is expected to be an empty graph (with no more than a source and sink
31 // nodes) when provided to ConvertGraphDefToGraph. To enhance an existing Graph,
39 // If true, the graph def is expected to have fully specified
40 // devices for all nodes. A node in the resulting graph "g" has the
47 const GraphDef& gdef, Graph* g)
    [all...]
testlib.cc 16 #include "tensorflow/core/graph/testlib.h"
19 #include "tensorflow/core/framework/graph.pb.h"
26 #include "tensorflow/core/graph/graph.h"
27 #include "tensorflow/core/graph/node_builder.h"
48 // Used by test::graph::HostConstant.
56 namespace graph { namespace in namespace:tensorflow::test
58 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender,
72 Node* Recv(Graph* g, const string& tensor, const string& type,
89 Node* Constant(Graph* g, const Tensor& tensor)
    [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...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Solution.h 18 #include "Graph.h"
30 typedef std::map<Graph::ConstNodeItr, unsigned,
77 void setSelection(Graph::NodeItr nItr, unsigned selection) {
84 unsigned getSelection(Graph::ConstNodeItr nItr) const {
  /external/v8/src/compiler/
dead-code-elimination.h 9 #include "src/compiler/graph-reducer.h"
20 // Propagates {Dead} control through the graph and thereby removes dead code.
21 // Note that this does not include trimming dead uses from the graph, and it
27 DeadCodeElimination(Editor* editor, Graph* graph,
43 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
47 Graph* const graph_;
typer.h 8 #include "src/compiler/graph.h"
28 Typer(Isolate* isolate, Flags flags, Graph* graph);
32 // TODO(bmeurer,jarin): Remove this once we have a notion of "roots" on Graph.
41 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::Typer
42 Zone* zone() const { return graph()->zone(); }
48 Graph* const graph_;
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/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...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/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...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/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...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/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...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/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...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/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...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/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...]
  /prebuilts/clang/host/linux-x86/clang-4393122/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...]
  /prebuilts/clang/host/linux-x86/clang-4479392/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...]
  /prebuilts/clang/host/linux-x86/clang-4579689/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...]
  /prebuilts/clang/host/linux-x86/clang-4630689/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...]
  /prebuilts/clang/host/linux-x86/clang-4639204/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...]
  /prebuilts/clang/host/linux-x86/clang-4691093/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...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 11 // PBQP graph representing a register allocation problem. Nodes which can be
13 // the PBQP graph first. If no provably allocable node is present in the graph
51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
78 Graph *g;
81 typedef std::list<Graph::NodeItr> RNAllocableList;
84 typedef std::list<Graph::NodeItr> RNUnallocableList;
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
RegAllocPBQP.h 21 #include "llvm/CodeGen/PBQP/Graph.h"
43 PBQP::Graph& getGraph() { return graph; }
45 const PBQP::Graph& getGraph() const { return graph; }
54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
66 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
94 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node
99 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
    [all...]
  /external/tensorflow/tensorflow/compiler/tf2xla/
graph_compiler.h 36 // GraphCompiler compiles the graph in topological order in the current
37 // thread. It also resolves the nondeterminism in the graph by enforcing a
40 // If a function call is visited during the graph traversal, it is then
59 Graph* graph, FunctionLibraryRuntime* flib,
63 graph_(graph),
67 // Compiles the graph. The results are written in `xla_context` that is passed
87 Graph* graph_;
90 // A buffer to hold tensor inputs to a node, this is reused across the graph
  /external/tensorflow/tensorflow/core/common_runtime/
constant_folding.h 22 #include "tensorflow/core/graph/graph.h"
30 std::function<string(Graph* graph, string old_name)>;
52 // Perform constant folding optimization on "graph".
53 // Looks for nodes in "graph" that can be completely evaluated statically, i.e.,
56 // "partition_device", if non-null, is the device where all the graph nodes are
58 // Sets `was_mutated` to true if and only if "graph" has been mutated.
60 // running the graph.
63 Device* partition_device, Graph* graph, bool* was_mutated)
    [all...]

Completed in 869 milliseconds

1 23 4 5 6 7 8 91011>>