Home
last modified time | relevance | path

Searched refs:original_graph (Results 1 – 10 of 10) sorted by relevance

/external/tensorflow/tensorflow/core/kernels/
Dremote_fused_graph_execute_op_test.cc129 const GraphDef& original_graph) { in BuildRemoteFusedGraphExecuteInfo() argument
135 for (const NodeDef& node : original_graph.node()) { in BuildRemoteFusedGraphExecuteInfo()
251 static Status RewriteGraphToFusedGraph(const GraphDef& original_graph, in RewriteGraphToFusedGraph() argument
258 BuildRemoteFusedGraphExecuteInfo(original_graph); in RewriteGraphToFusedGraph()
282 GraphDef original_graph; in TEST() local
284 NAME_A, NODE_A_VAL, NAME_B, NODE_B_VAL, NAME_A_PLUS_B, &original_graph)); in TEST()
288 TF_ASSERT_OK(RewriteGraphToFusedGraph(original_graph, &fused_graph)); in TEST()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dcommon_subgraph_elimination_test.cc37 void VerifyGraphsMatch(const GraphDef& original_graph, in VerifyGraphsMatch() argument
39 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << line; in VerifyGraphsMatch()
40 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsMatch()
41 const NodeDef& original = original_graph.node(i); in VerifyGraphsMatch()
Ddependency_optimizer_test.cc38 void VerifyGraphsEqual(const GraphDef& original_graph, in VerifyGraphsEqual() argument
40 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func; in VerifyGraphsEqual()
41 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsEqual()
42 const NodeDef& original = original_graph.node(i); in VerifyGraphsEqual()
Dloop_optimizer_test.cc616 void VerifyGraphsEqual(const GraphDef& original_graph, in VerifyGraphsEqual() argument
618 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func; in VerifyGraphsEqual()
619 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsEqual()
620 const NodeDef& original = original_graph.node(i); in VerifyGraphsEqual()
Dauto_mixed_precision_test.cc70 void VerifyGraphsEquivalent(const GraphDef& original_graph, in VerifyGraphsEquivalent() argument
73 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << func; in VerifyGraphsEquivalent()
75 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsEquivalent()
76 const NodeDef& original = original_graph.node(i); in VerifyGraphsEquivalent()
Darithmetic_optimizer_test.cc80 void VerifyGraphsMatch(const GraphDef& original_graph, in VerifyGraphsMatch() argument
82 EXPECT_EQ(original_graph.node_size(), optimized_graph.node_size()) << line; in VerifyGraphsMatch()
83 for (int i = 0; i < original_graph.node_size(); ++i) { in VerifyGraphsMatch()
84 const NodeDef& original = original_graph.node(i); in VerifyGraphsMatch()
/external/tensorflow/tensorflow/lite/python/
Dutil.py362 def build_debug_info_func(original_graph): argument
375 if not original_graph:
382 useful_ops.append((func, original_graph.get_operation_by_name(name)))
384 sub_func = original_graph._get_function(func) # pylint: disable=protected-access
/external/tensorflow/tensorflow/python/framework/
Dmeta_graph_test.py1014 with ops.Graph().as_default() as original_graph:
1018 graph=original_graph,
Dops.py6081 original_graph = getattr(original_item, "graph", None)
6083 if original_graph and graph and original_graph is not graph:
6086 (item, original_item, graph, original_graph))
/external/tensorflow/tensorflow/python/keras/
Dbackend.py620 original_graph = getattr(original_item, 'graph', None)
622 if original_graph and graph and original_graph is not graph:
625 (item, original_item, graph, original_graph))