| /external/tensorflow/tensorflow/core/graph/ |
| validate.cc | 16 #include "tensorflow/core/graph/validate.h"
29 namespace graph { namespace in namespace:tensorflow
64 Status ValidateGraphHasNoCycle(const Graph& graph) {
67 std::vector<int> pending_count(graph.num_node_ids(), 0);
69 for (int i = 0; i < graph.num_node_ids(); ++i) {
70 const Node* n = graph.FindNodeId(i);
102 if (processed < graph.num_nodes()) {
107 nodes_in_cycle.push_back(graph.FindNodeId(i)->name());
111 "Graph is invalid, contains a cycle with "
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| graph_utils.h | 21 #include "tensorflow/core/framework/graph.pb.h"
26 #include "tensorflow/core/graph/graph.h"
50 // Adds a node to the graph.
54 MutableGraphView* graph);
57 NodeDef* AddScalarPlaceholder(DataType dtype, MutableGraphView* graph);
59 // Adds a Const node with the given value to the graph.
61 NodeDef* AddScalarConstNode(T v, MutableGraphView* graph) {
70 NodeDef* AddScalarConstNode(bool v, MutableGraphView* graph);
72 NodeDef* AddScalarConstNode(double v, MutableGraphView* graph);
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/vectorization/ |
| parse_single_example_vectorizer.cc | 18 #include "tensorflow/core/graph/node_builder.h"
29 Status Vectorize(const Node& node, Graph* outer_scope,
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| meta_optimizer.h | 22 #include "tensorflow/core/graph/graph.h"
64 // Returns the config for a custom graph optimizer. Null if none was found.
75 // multiple such passes: 1) for the main graph 2) for the function library
120 // `device_set`: the set of devices that graph can refer to.
127 // **g is a graph constructed based on the runtime library 'lib'.
137 std::unique_ptr<tensorflow::Graph>* g);
|
| /external/tensorflow/tensorflow/core/util/ |
| dump_graph.cc | 118 string DumpGraphToFile(const string& name, Graph const& graph,
122 graph.ToGraphDef(&graph_def);
|
| /external/tensorflow/tensorflow/python/compiler/tensorrt/test/ |
| batch_matmul_test.py | 45 g = ops.Graph()
|
| const_broadcast_test.py | 40 g = ops.Graph()
|
| dynamic_input_shapes_test.py | 46 g = ops.Graph()
|
| int32_test.py | 44 g = ops.Graph()
|
| lru_cache_test.py | 44 g = ops.Graph()
|
| multi_connection_neighbor_engine_test.py | 40 g = ops.Graph()
|
| rank_two_test.py | 39 g = ops.Graph()
|
| vgg_block_nchw_test.py | 42 g = ops.Graph()
|
| vgg_block_test.py | 42 g = ops.Graph()
|
| /external/tensorflow/tensorflow/python/data/benchmarks/ |
| list_files_benchmark.py | 59 with ops.Graph().as_default():
|
| /external/tensorflow/tensorflow/python/data/experimental/benchmarks/ |
| matching_files_benchmark.py | 61 with ops.Graph().as_default():
|
| parallel_interleave_benchmark.py | 58 with ops.Graph().as_default():
|
| /external/tensorflow/tensorflow/python/debug/examples/ |
| debug_fibonacci.py | 103 with tf.Graph().as_default():
|
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| constant_op_test.py | 194 with ops.Graph().as_default():
206 with ops.Graph().as_default():
212 with ops.Graph().as_default():
217 with ops.Graph().as_default():
222 with ops.Graph().as_default():
227 with ops.Graph().as_default():
232 with ops.Graph().as_default():
236 with ops.Graph().as_default():
242 with ops.Graph().as_default():
245 with ops.Graph().as_default()
[all...] |
| /external/tensorflow/tensorflow/python/tpu/ |
| tpu_strategy_util.py | 98 with ops.Graph().as_default():
|
| /external/v8/src/compiler/ |
| basic-block-instrumentor.cc | 10 #include "src/compiler/graph.h"
49 OptimizedCompilationInfo* info, Graph* graph, Schedule* schedule,
67 CommonOperatorBuilder common(graph->zone());
68 Node* zero = graph->NewNode(common.Int32Constant(0));
69 Node* one = graph->NewNode(common.Int32Constant(1));
70 MachineOperatorBuilder machine(graph->zone());
79 Node* base = graph->NewNode(
81 Node* load = graph->NewNode(machine.Load(MachineType::Uint32()), base, zero,
82 graph->start(), graph->start())
[all...] |
| js-graph.h | 9 #include "src/compiler/graph.h"
11 #include "src/compiler/machine-graph.h"
23 // Implements a facade on a Graph, enhancing the graph with JS-specific
28 JSGraph(Isolate* isolate, Graph* graph, CommonOperatorBuilder* common,
31 : MachineGraph(graph, common, machine),
|
| js-intrinsic-lowering.h | 10 #include "src/compiler/graph-reducer.h"
74 Graph* graph() const;
|
| simplified-lowering.h | 8 #include "src/compiler/js-graph.h"
92 Graph* graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::final
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 323 /// Probability weight for an edge in the graph (including the
420 /// Separate irreducible SCCs from \c G, which is an explict graph of \c
540 /// \brief Graph of irreducible control flow.
542 /// This graph is used for determining the SCCs in a loop (or top-level
550 /// \a IrreducibleGraph makes this graph explicit. It's in a form that can use
577 /// \brief Construct an explicit graph containing irreducible control flow.
579 /// Construct an explicit graph of the control flow in \c OuterLoop (or the
668 /// type of graph being modelled (BasicBlock vs. MachineBasicBlock), and
[all...] |
