| /external/tensorflow/tensorflow/core/grappler/utils/ |
| frame.h | 20 #include "tensorflow/core/framework/graph.pb.h"
29 // Returns the number of frames present in the graph, and populates
32 Status IdentifyFrames(const GraphDef& graph, FrameMap* frame_map,
35 // As above, but use an existing NodeMap for graph instead of building it
37 Status IdentifyFramesWithNodeMap(const GraphDef& graph, const NodeMap& node_map,
|
| scc.h | 20 #include "tensorflow/core/framework/graph.pb.h"
34 const GraphDef& graph, std::unordered_map<const NodeDef*, int>* components,
37 // Returns the number of individual loops present in the graph, and populate the
40 int IdentifyLoops(const GraphDef& graph,
|
| scc_test.cc | 55 // Create a simple graph without any loop.
63 StronglyConnectedComponents(item.graph, &components, &num_components);
66 for (const auto& node : item.graph.node()) {
72 GraphDef graph; local
74 *graph.add_node() = CreateNode("a", {"d"});
75 *graph.add_node() = CreateNode("b", {"a"});
76 *graph.add_node() = CreateNode("c", {"b"});
77 *graph.add_node() = CreateNode("d", {"c"});
80 *graph.add_node() = CreateNode("e", {});
81 *graph.add_node() = CreateNode("f", {"e"})
138 GraphDef graph; local
[all...] |
| /external/tensorflow/tensorflow/python/training/ |
| training_util.py | 73 def get_global_step(graph=None):
80 graph: The graph to find the global step in. If missing, use default graph.
89 graph = graph or ops.get_default_graph()
91 global_step_tensors = graph.get_collection(ops.GraphKeys.GLOBAL_STEP)
96 global_step_tensor = graph.get_tensor_by_name('global_step:0')
108 def create_global_step(graph=None):
109 """Create global step tensor in graph
[all...] |
| /external/v8/src/compiler/ |
| diamond.h | 9 #include "src/compiler/graph.h"
18 Graph* graph; member in struct:v8::internal::compiler::Diamond
25 Diamond(Graph* g, CommonOperatorBuilder* b, Node* cond,
27 graph = g;
29 branch = graph->NewNode(common->Branch(hint), cond, graph->start());
30 if_true = graph->NewNode(common->IfTrue(), branch);
31 if_false = graph->NewNode(common->IfFalse(), branch);
32 merge = graph->NewNode(common->Merge(2), if_true, if_false)
[all...] |
| select-lowering.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
22 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
29 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
32 Graph* graph_;
|
| 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());
|
| int64-lowering.cc | 8 #include "src/compiler/graph.h"
23 Int64Lowering::Int64Lowering(Graph* graph, MachineOperatorBuilder* machine,
27 graph_(graph),
30 state_(graph, 3),
34 placeholder_(graph->NewNode(common->Parameter(-2, "placeholder"),
35 graph->start())) {
36 DCHECK_NOT_NULL(graph);
37 DCHECK_NOT_NULL(graph->end());
38 replacements_ = zone->NewArray<Replacement>(graph->NodeCount())
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-dce.h | 16 explicit HDeadCodeEliminationPhase(HGraph* graph)
17 : HPhase("H_Dead code elimination", graph) { }
|
| hydrogen-redundant-phi.h | 18 explicit HRedundantPhiEliminationPhase(HGraph* graph)
19 : HPhase("H_Redundant phi elimination", graph) { }
|
| hydrogen-representation-changes.h | 16 explicit HRepresentationChangesPhase(HGraph* graph)
17 : HPhase("H_Representation changes", graph) { }
|
| hydrogen-store-elimination.h | 16 explicit HStoreEliminationPhase(HGraph* graph)
17 : HPhase("H_Store elimination", graph),
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| Scheduler.java | 31 Scheduler(FilterGraph graph) {
32 mGraph = graph;
|
| SimpleScheduler.java | 28 public SimpleScheduler(FilterGraph graph) {
29 super(graph);
|
| /system/update_engine/payload_generator/ |
| inplace_generator_unittest.cc | 184 Graph graph; local
187 // Create nodes in graph
189 graph.resize(graph.size() + 1);
190 graph.back().aop.op.set_type(InstallOperation::MOVE);
196 StoreExtents(extents, graph.back().aop.op.mutable_src_extents());
197 blocks[3].reader = graph.size() - 1;
198 blocks[5].reader = graph.size() - 1;
199 blocks[7].reader = graph.size() - 1
[all...] |
| /frameworks/support/navigation/runtime/ktx/src/androidTest/java/androidx/navigation/ |
| ActivityNavigatorDestinationBuilderTest.kt | 35 val graph = navController.createGraph(startDestination = DESTINATION_ID) {
40 assertTrue("Destination should be added to the graph",
41 DESTINATION_ID in graph)
44 graph[DESTINATION_ID].label)
49 val graph = navController.createGraph(startDestination = DESTINATION_ID) {
54 assertTrue("Destination should be added to the graph",
55 DESTINATION_ID in graph)
58 (graph[DESTINATION_ID] as ActivityNavigator.Destination).component?.className)
63 val graph = navController.createGraph(startDestination = DESTINATION_ID) {
68 assertTrue("Destination should be added to the graph",
[all...] |
| /art/compiler/optimizing/ |
| codegen_test_utils.h | 72 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) {
73 return create_codegen_(graph, compiler_options);
104 TestCodeGeneratorARMVIXL(HGraph* graph,
107 : arm::CodeGeneratorARMVIXL(graph, isa_features, compiler_options) {
148 TestCodeGeneratorARM64(HGraph* graph,
151 : arm64::CodeGeneratorARM64(graph, isa_features, compiler_options) {}
168 TestCodeGeneratorX86(HGraph* graph,
171 : x86::CodeGeneratorX86(graph, isa_features, compiler_options) {
281 static void ValidateGraph(HGraph* graph) {
282 GraphChecker graph_checker(graph);
[all...] |
| nodes_test.cc | 29 * Test that removing instruction from the graph removes itself from user lists
33 HGraph* graph = CreateGraph(); local
34 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph);
35 graph->AddBlock(entry);
36 graph->SetEntryBlock(entry);
38 graph->GetDexFile(), dex::TypeIndex(0), 0, DataType::Type::kReference);
42 HBasicBlock* first_block = new (GetAllocator()) HBasicBlock(graph);
43 graph->AddBlock(first_block);
49 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph);
50 graph->AddBlock(exit_block)
73 HGraph* graph = CreateGraph(); local
98 HGraph* graph = CreateGraph(); local
116 HGraph* graph = CreateGraph(); local
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| mark_for_compilation_pass_test.cc | 26 #include "tensorflow/core/graph/graph_constructor.h"
27 #include "tensorflow/core/graph/graph_def_builder.h"
28 #include "tensorflow/core/graph/graph_def_builder_util.h"
38 Status MarkForCompilation(std::unique_ptr<Graph>* graph,
42 for (Node* n : (*graph)->nodes()) {
47 opt_options.graph = graph;
53 Status MarkForCompilation(std::unique_ptr<Graph>* graph) {
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| quantize_training.cc | 22 #include "tensorflow/core/graph/quantize_training.h"
29 #include "tensorflow/core/graph/algorithm.h"
30 #include "tensorflow/core/graph/graph_constructor.h"
31 #include "tensorflow/core/graph/node_builder.h"
32 #include "tensorflow/core/graph/subgraph.h"
71 inline bool IsGradientNode(const Graph* graph, const Node* node) {
79 bool FindType(const Graph* graph, const Node* node, bool* signed_input,
112 if (edge->src_output() != Graph::kControlSlot && edge->dst_input() == 0)
[all...] |
| /external/tensorflow/tensorflow/tools/quantization/ |
| graph_to_dot.py | 36 flags.DEFINE_string("graph", "", """TensorFlow 'GraphDef' file to load.""")
43 if not gfile.Exists(FLAGS.graph):
44 print("Input graph file '" + FLAGS.graph + "' does not exist!")
47 graph = graph_pb2.GraphDef()
48 with open(FLAGS.graph, "r") as f:
50 graph.ParseFromString(f.read())
52 text_format.Merge(f.read(), graph)
56 for node in graph.node:
|
| /external/tensorflow/tensorflow/contrib/quantize/python/ |
| input_to_ops_test.py | 32 graph = ops.Graph()
33 with graph.as_default():
36 input_to_ops_map = input_to_ops.InputToOps(graph)
42 graph = ops.Graph()
43 with graph.as_default():
47 input_to_ops_map = input_to_ops.InputToOps(graph)
53 graph = ops.Graph()
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| memory_types_test.cc | 19 #include "tensorflow/core/graph/testlib.h"
26 Graph* g = new Graph(OpRegistry::Global());
29 auto in0 = test::graph::Constant(g, v);
30 auto in1 = test::graph::Constant(g, v);
31 test::graph::Add(g, in0, in1);
44 Graph* g = new Graph(OpRegistry::Global());
47 auto x = test::graph::Constant(g, v);
48 test::graph::Cast(g, x, DT_FLOAT)
[all...] |
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| print_model_analysis.h | 34 bool NewProfiler(const string* graph, const string* op_log);
38 double AddStep(int64 step, const string* graph, const string* run_meta,
55 // 'graph', 'run_meta', 'op_log' are serialized GraphDef, RunMetadata,
57 // 'graph', 'command' and 'options' are required. Others can be nullptr
59 string PrintModelAnalysis(const string* graph, const string* run_meta,
|
| /external/tensorflow/tensorflow/examples/speech_commands/ |
| freeze_test.py | 31 self.assertIsNotNone(sess.graph.get_tensor_by_name('wav_data:0'))
33 sess.graph.get_tensor_by_name('decoded_sample_data:0'))
34 self.assertIsNotNone(sess.graph.get_tensor_by_name('labels_softmax:0'))
|
