| /external/v8/src/compiler/ |
| js-call-reducer.h | 9 #include "src/compiler/graph-reducer.h"
70 Graph* graph() const;
|
| simplified-lowering.h | 8 #include "src/compiler/js-graph.h"
83 Graph* graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::final
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
137 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
137 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
137 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
137 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
137 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
137 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| Interval.h | 126 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/tensorflow/tensorflow/contrib/cudnn_rnn/python/kernel_tests/ |
| cudnn_rnn_ops_benchmark.py | 96 with ops.Graph().as_default(), ops.device("/device:GPU:0"):
128 with ops.Graph().as_default(), ops.device("/device:GPU:0"):
152 with ops.Graph().as_default(), ops.device("/device:GPU:0"):
|
| /external/tensorflow/tensorflow/contrib/data/python/kernel_tests/ |
| range_dataset_op_test.py | 121 with ops.Graph().as_default() as g:
123 with self.test_session(graph=g) as sess:
130 with ops.Graph().as_default() as g:
132 with self.test_session(graph=g) as sess:
141 with ops.Graph().as_default() as g:
143 with self.test_session(graph=g) as sess:
|
| /external/tensorflow/tensorflow/contrib/quantize/python/ |
| quantize_test.py | 15 """Unit tests for quantizing a Tensorflow graph."""
47 graph = ops.Graph()
48 with graph.as_default():
68 graph = ops.Graph()
69 with graph.as_default():
82 quantize.Quantize(graph, is_training, weight_bits=8, activation_bits=8)
85 add_quant = graph.get_operation_by_name('test/add_quant/' +
94 graph = ops.Graph(
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| graph_runner.cc | 27 #include "tensorflow/core/graph/algorithm.h"
28 #include "tensorflow/core/graph/graph_constructor.h"
29 #include "tensorflow/core/graph/node_builder.h"
30 #include "tensorflow/core/graph/subgraph.h"
104 Status GraphRunner::Run(Graph* graph, FunctionLibraryRuntime* function_library,
123 // TODO(vrv): Instead of copying the entire graph, consider modifying
124 // the existing graph, and then removing those removed edges.
126 std::unique_ptr<Graph> graph_to_run(new Graph(graph->op_registry()))
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| optimizer_cse.cc | 17 // process the nodes in the graph in reverse postorder
26 // remove n from graph
39 #include "tensorflow/core/graph/optimizer_cse.h"
46 #include "tensorflow/core/graph/algorithm.h"
55 explicit OptimizerCSE(Graph* g) : g_(g) {}
64 Graph* g_;
164 // This very simple implementation works if the whole graph is one
173 // the graph.
211 // come from "*candidate", and then delete n from the graph
223 bool OptimizeCSE(Graph* g
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| cast_op_test.cc | 31 static Graph* Cast(int num) {
32 Graph* g = new Graph(OpRegistry::Global());
36 test::graph::Cast(g, test::graph::Constant(g, data),
|
| gather_op_test.cc | 28 #include "tensorflow/core/graph/testlib.h"
181 static Graph* Gather(int dim) {
182 Graph* g = new Graph(OpRegistry::Global());
203 test::graph::Gather(g, test::graph::Constant(g, params),
204 test::graph::Constant(g, indices),
205 test::graph::HostConstant(g, axis));
|
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| rnn_test.py | 158 # test in graph mode.
290 with session.Session(config=config, graph=ops_lib.Graph()):
298 with session.Session(config=config, graph=ops_lib.Graph()):
338 with session.Session(config=config, graph=ops_lib.Graph()) as sess:
350 with session.Session(config=config, graph=ops_lib.Graph()) as sess:
400 with session.Session(config=config, graph=ops_lib.Graph()) as sess
[all...] |
| /system/update_engine/payload_generator/ |
| cycle_breaker.cc | 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) {
45 subgraph_ = graph;
47 // The paper calls for the "adjacency structure (i.e., graph) of
50 // We arbitrarily order each vertex by its index in the graph. Thus,
57 for (Graph::size_type i = 0; i < subgraph_.size(); i++) {
58 InstallOperation_Type op_type = graph[i].aop.op.type();
69 for (Graph::size_type j = i; j < subgraph_.size(); j++) {
84 // If there's a link from *it -> *jt in the graph,
|
