| /external/tensorflow/tensorflow/tools/optimization/ |
| optimization_pass_runner.cc | 33 #include "tensorflow/core/framework/graph.pb.h"
36 #include "tensorflow/core/graph/graph.h"
37 #include "tensorflow/core/graph/graph_constructor.h"
79 Flag("input_file_path", &input_file_path, "Location of the input graph."),
81 "Location to write the resulting graph."),
107 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); local
111 options.graph = &graph
[all...] |
| /external/v8/src/compiler/ |
| control-equivalence.h | 9 #include "src/compiler/graph.h"
21 // - Build a program structure tree (PST) for controls in the graph.
22 // - Determine single-entry single-exit (SESE) regions within the graph.
36 ControlEquivalence(Zone* zone, Graph* graph)
38 graph_(graph),
41 node_data_(graph->NodeCount(), zone) {}
44 // the following iterations over control edges of the graph:
111 // Performs and undirected DFS walk of the graph. Conceptually all nodes are
174 Graph* const graph_
[all...] |
| escape-analysis.h | 9 #include "src/compiler/graph-reducer.h"
10 #include "src/compiler/js-graph.h"
40 EffectGraphReducer(Graph* graph,
50 // part of the graph.
67 Graph* graph_;
99 // An object that can track the nodes in the graph whose current reduction
135 // dead nodes in the graph. This is a workaround that should be removed
|
| memory-optimizer.h | 8 #include "src/compiler/graph-assembler.h"
18 class Graph;
68 // An allocation state is propagated on the effect paths through the graph.
106 // path through the graph.
136 Graph* graph() const;
|
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| init_ops_test.py | 57 with tc.test_session(graph=ops.Graph()):
59 with tc.test_session(graph=ops.Graph()):
65 """Tests duplicated random initializer within the same graph.
68 graph, and checks if the results are close enough. Even given the same global,
75 graph_seed: A graph-level seed to use.
83 with tc.test_session(graph=ops.Graph()):
551 with ops.Graph().as_default() as graph
[all...] |
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
36 public class Graph<T> {
|
| /external/bcc/src/cc/frontends/p4/compiler/ |
| topoSorting.py | 38 class Graph(object):
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 129 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
141 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/swiftshader/third_party/llvm-7.0/llvm/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/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| BlockFrequencyInfo.cpp | 42 "display a graph using the "
45 "display a graph using the raw "
47 clEnumValN(GVDT_Count, "count", "display a graph using the real "
74 "-pgo-view-raw-counts instead. To limit graph "
78 clEnumValN(PGOVCT_Graph, "graph", "show a graph."),
132 const BlockFrequencyInfo *Graph) {
134 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph, getGVDT());
138 const BlockFrequencyInfo *Graph) {
139 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph,
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 20 // Test SCC computation against every graph with NUM_NODES nodes or less.
25 typedef Graph<NUM_NODES> GT;
47 // Test the SCC logic on this graph.
|
| /external/tensorflow/tensorflow/cc/ops/ |
| const_op.cc | 28 Graph* graph = scope.graph(); local
34 scope.UpdateStatus(builder.Finalize(graph, &ret));
|
| /external/tensorflow/tensorflow/contrib/predictor/ |
| core_estimator_predictor.py | 54 graph=None,
64 graph: Optional. The Tensorflow `graph` in which prediction should be
68 self._graph = graph or ops.Graph()
|
| /external/tensorflow/tensorflow/contrib/stat_summarizer/python/ |
| stat_summarizer_test.py | 33 with ops.Graph().as_default() as graph:
38 graph_def = graph.as_graph_def()
|
| /external/tensorflow/tensorflow/core/common_runtime/gpu/ |
| gpu_stream_util.cc | 23 #include "tensorflow/core/graph/algorithm.h"
30 Status AssignStreams(const Graph* graph, const AssignStreamsOpts& opts,
36 if (graph == nullptr)
37 status.Update(errors::InvalidArgument("Bad graph argument supplied."));
46 status.Update(errors::InvalidArgument("Bad graph argument supplied."));
52 GetReversePostOrder(*graph, &order);
|
| /external/tensorflow/tensorflow/core/common_runtime/sycl/ |
| sycl_device.cc | 77 Status SYCLDevice::FillContextMap(const Graph* graph,
81 device_context_map->resize(graph->num_node_ids());
82 for (Node* n : graph->nodes()) {
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| scheduler.cc | 22 #include "tensorflow/core/graph/graph.h"
30 void InitializePending(const Graph* graph, std::vector<int>* pending) {
31 pending->resize(graph->num_node_ids());
32 for (const Node* node : graph->nodes()) {
74 SlackAnalysis::SlackAnalysis(const Graph* g, const CostModel* cost_model)
190 const CostModel* cost_model, const Graph* g,
295 const Graph* g)
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph_partition.cc | 16 #include "tensorflow/core/graph/graph_partition.h"
32 #include "tensorflow/core/graph/algorithm.h"
33 #include "tensorflow/core/graph/control_flow.h"
34 #include "tensorflow/core/graph/costmodel.h"
35 #include "tensorflow/core/graph/graph_def_builder.h"
36 #include "tensorflow/core/graph/node_builder.h"
37 #include "tensorflow/core/graph/tensor_id.h"
106 // We collect the following information about the graph before performing
107 // graph partitioning.
161 if (src_slot == Graph::kControlSlot)
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| scoped_allocator_optimizer.h | 27 class Graph;
54 Status ProcessGraphDef(GraphDef* graph,
59 void FindOpOccurrences(GraphDef* graph, const OpNameSet& op_names,
73 // Class that knows how to do graph rewriting for a particular kind of Op in
80 int64 invocation_count, GraphDef* graph,
|
| /external/tensorflow/tensorflow/core/kernels/ |
| concat_op_test.cc | 26 #include "tensorflow/core/graph/node_builder.h"
27 #include "tensorflow/core/graph/testlib.h"
43 Graph* g = new Graph(OpRegistry::Global());
57 .Input(test::graph::Constant(g, concat_dim))
58 .Input({test::graph::Constant(g, in0), test::graph::Constant(g, in1)})
98 Graph* g = new Graph(OpRegistry::Global());
110 inputs.push_back(test::graph::Constant(g, in))
[all...] |
| remote_fused_graph_execute_utils.h | 22 #include "tensorflow/core/graph/graph.h"
23 #include "tensorflow/core/graph/graph_constructor.h"
101 // To determine shapes of output tensors of all nodes, dryrun the graph.
103 // the graph. This function is used to verify shape inference and actual
152 Graph* graph, ShapeRefiner* shape_refiner);
154 static Status BuildTensorShapeMapFromGraph(const Graph& graph,
174 // Build remote fused graph execute info
[all...] |
| /external/tensorflow/tensorflow/python/compiler/tensorrt/test/ |
| binary_tensor_weight_broadcast_test.py | 42 g = ops.Graph()
|
| identity_output_test.py | 46 g = ops.Graph()
|
| memory_alignment_test.py | 40 g = ops.Graph()
|
| neighboring_engine_test.py | 41 g = ops.Graph()
|
