Home
last modified time | relevance | path

Searched refs:node_lookup (Results 1 – 13 of 13) sorted by relevance

/external/tensorflow/tensorflow/tools/graph_transforms/
Dsparsify_gather_test.cc180 std::map<string, const NodeDef*> node_lookup; in TestSinglePartition() local
181 MapNamesToNodes(result, &node_lookup); in TestSinglePartition()
185 node_lookup.count("w/part_1/Initializer/zeros/shape_as_tensor")); in TestSinglePartition()
186 EXPECT_EQ(0, node_lookup.count("w/part_1/Initializer/zeros/Const")); in TestSinglePartition()
187 EXPECT_EQ(0, node_lookup.count("w/part_1/Initializer/zeros")); in TestSinglePartition()
188 EXPECT_EQ(0, node_lookup.count("w/part_1/Assign")); in TestSinglePartition()
190 EXPECT_EQ(1, node_lookup.count("ids")); in TestSinglePartition()
191 EXPECT_EQ("Const", node_lookup.at("ids")->op()); in TestSinglePartition()
193 EXPECT_EQ(1, node_lookup.count("concat/node")); in TestSinglePartition()
196 EXPECT_EQ(0, node_lookup.count("linear/concat/axis")); in TestSinglePartition()
[all …]
Dstrip_unused_nodes_test.cc62 std::map<string, const NodeDef*> node_lookup; in TestSimpleAdd() local
63 MapNamesToNodes(result, &node_lookup); in TestSimpleAdd()
64 EXPECT_EQ(1, node_lookup.count("add_node")); in TestSimpleAdd()
65 EXPECT_EQ(1, node_lookup.count("a_node")); in TestSimpleAdd()
66 EXPECT_EQ(1, node_lookup.count("b_node")); in TestSimpleAdd()
67 EXPECT_EQ(0, node_lookup.count("c_node")); in TestSimpleAdd()
117 std::map<string, const NodeDef*> node_lookup; in TestCommonAncestor() local
118 MapNamesToNodes(result, &node_lookup); in TestCommonAncestor()
119 EXPECT_EQ(1, node_lookup.count("add_node1")); in TestCommonAncestor()
120 EXPECT_EQ(1, node_lookup.count("add_node2")); in TestCommonAncestor()
[all …]
Dremove_nodes_test.cc100 std::map<string, const NodeDef*> node_lookup; in TestRemoveNodes() local
101 MapNamesToNodes(result, &node_lookup); in TestRemoveNodes()
102 EXPECT_EQ(1, node_lookup.count("add_node1")); in TestRemoveNodes()
103 EXPECT_EQ("add_node2", node_lookup.at("add_node1")->input(0)); in TestRemoveNodes()
104 EXPECT_EQ("add_node3", node_lookup.at("add_node1")->input(1)); in TestRemoveNodes()
105 EXPECT_EQ(1, node_lookup.count("add_node2")); in TestRemoveNodes()
106 EXPECT_EQ("const_node1", node_lookup.at("add_node2")->input(0)); in TestRemoveNodes()
107 EXPECT_EQ("const_node2", node_lookup.at("add_node2")->input(1)); in TestRemoveNodes()
108 EXPECT_EQ(1, node_lookup.count("add_node3")); in TestRemoveNodes()
109 EXPECT_EQ("const_node1", node_lookup.at("add_node3")->input(0)); in TestRemoveNodes()
[all …]
Dbackports_test.cc89 std::map<string, const NodeDef*> node_lookup; in TestBackportConcatV2() local
90 MapNamesToNodes(result, &node_lookup); in TestBackportConcatV2()
91 EXPECT_EQ(1, node_lookup.count("concat_node")); in TestBackportConcatV2()
92 EXPECT_EQ("Concat", node_lookup.at("concat_node")->op()); in TestBackportConcatV2()
93 EXPECT_EQ(0, node_lookup.at("concat_node")->attr().count("Tidx")); in TestBackportConcatV2()
94 EXPECT_EQ("const_node3", node_lookup.at("concat_node")->input(0)); in TestBackportConcatV2()
95 EXPECT_EQ("const_node1", node_lookup.at("concat_node")->input(1)); in TestBackportConcatV2()
96 EXPECT_EQ("const_node2", node_lookup.at("concat_node")->input(2)); in TestBackportConcatV2()
97 EXPECT_EQ(1, node_lookup.count("const_node1")); in TestBackportConcatV2()
98 EXPECT_EQ("Const", node_lookup.at("const_node1")->op()); in TestBackportConcatV2()
[all …]
Dobfuscate_names_test.cc79 std::map<string, const NodeDef*> node_lookup; in TestSimpleTree() local
80 MapNamesToNodes(result, &node_lookup); in TestSimpleTree()
82 EXPECT_EQ(1, node_lookup.count("add_node1")); in TestSimpleTree()
83 EXPECT_EQ(0, node_lookup.count("add_node2")); in TestSimpleTree()
84 EXPECT_EQ(0, node_lookup.count("add_node3")); in TestSimpleTree()
85 EXPECT_EQ(1, node_lookup.count("const_node1")); in TestSimpleTree()
86 EXPECT_EQ(0, node_lookup.count("const_node2")); in TestSimpleTree()
87 EXPECT_EQ(0, node_lookup.count("const_node3")); in TestSimpleTree()
88 EXPECT_EQ(0, node_lookup.count("const_node4")); in TestSimpleTree()
103 std::map<string, const NodeDef*> node_lookup; in TestManyNodes() local
[all …]
Dset_device_test.cc92 std::map<string, const NodeDef*> node_lookup; in TEST() local
93 MapNamesToNodes(result, &node_lookup); in TEST()
94 EXPECT_EQ("/device:CPU:0", node_lookup.at("mul_node1")->device()); in TEST()
95 EXPECT_EQ("/device:CPU:0", node_lookup.at("add_node2")->device()); in TEST()
96 EXPECT_EQ("/device:CPU:0", node_lookup.at("add_node3")->device()); in TEST()
97 EXPECT_EQ("/device:CPU:0", node_lookup.at("const_node1")->device()); in TEST()
98 EXPECT_EQ("/device:CPU:0", node_lookup.at("const_node2")->device()); in TEST()
99 EXPECT_EQ("/device:CPU:0", node_lookup.at("const_node3")->device()); in TEST()
100 EXPECT_EQ("/device:CPU:0", node_lookup.at("add_node4")->device()); in TEST()
115 std::map<string, const NodeDef*> node_lookup; in TEST() local
[all …]
Drename_op_test.cc87 std::map<string, const NodeDef*> node_lookup; in TestRenameOp() local
88 MapNamesToNodes(result, &node_lookup); in TestRenameOp()
89 EXPECT_EQ(1, node_lookup.count("mul_node1")); in TestRenameOp()
90 EXPECT_EQ("Multiply", node_lookup.at("mul_node1")->op()); in TestRenameOp()
91 EXPECT_EQ(1, node_lookup.count("add_node2")); in TestRenameOp()
92 EXPECT_EQ("Add", node_lookup.at("add_node2")->op()); in TestRenameOp()
93 EXPECT_EQ(1, node_lookup.count("add_node3")); in TestRenameOp()
94 EXPECT_EQ("Add", node_lookup.at("add_node3")->op()); in TestRenameOp()
95 EXPECT_EQ(1, node_lookup.count("add_node4")); in TestRenameOp()
96 EXPECT_EQ("Add", node_lookup.at("add_node4")->op()); in TestRenameOp()
[all …]
Drename_attribute_test.cc94 std::map<string, const NodeDef*> node_lookup; in TestRenameAttribute() local
95 MapNamesToNodes(wildcard_result, &node_lookup); in TestRenameAttribute()
96 EXPECT_EQ(0, node_lookup.at("mul_node1")->attr().count("foo")); in TestRenameAttribute()
97 EXPECT_EQ(1, node_lookup.at("mul_node1")->attr().count("baz")); in TestRenameAttribute()
98 EXPECT_EQ(1, node_lookup.at("mul_node1")->attr().count("bar")); in TestRenameAttribute()
99 EXPECT_EQ(0, node_lookup.at("add_node2")->attr().count("foo")); in TestRenameAttribute()
100 EXPECT_EQ(1, node_lookup.at("add_node2")->attr().count("baz")); in TestRenameAttribute()
101 EXPECT_EQ(1, node_lookup.at("add_node2")->attr().count("bar")); in TestRenameAttribute()
102 EXPECT_EQ(1, node_lookup.at("add_node2")->attr().count("bob")); in TestRenameAttribute()
117 MapNamesToNodes(targeted_result, &node_lookup); in TestRenameAttribute()
[all …]
Dremove_attribute_test.cc92 std::map<string, const NodeDef*> node_lookup; in TestRemoveAttribute() local
93 MapNamesToNodes(wildcard_result, &node_lookup); in TestRemoveAttribute()
94 EXPECT_EQ(0, node_lookup.at("mul_node1")->attr().count("foo")); in TestRemoveAttribute()
95 EXPECT_EQ(1, node_lookup.at("mul_node1")->attr().count("bar")); in TestRemoveAttribute()
96 EXPECT_EQ(0, node_lookup.at("add_node2")->attr().count("foo")); in TestRemoveAttribute()
97 EXPECT_EQ(1, node_lookup.at("add_node2")->attr().count("bar")); in TestRemoveAttribute()
98 EXPECT_EQ(1, node_lookup.at("add_node2")->attr().count("bob")); in TestRemoveAttribute()
111 MapNamesToNodes(targeted_result, &node_lookup); in TestRemoveAttribute()
112 EXPECT_EQ(0, node_lookup.at("mul_node1")->attr().count("foo")); in TestRemoveAttribute()
113 EXPECT_EQ(1, node_lookup.at("mul_node1")->attr().count("bar")); in TestRemoveAttribute()
[all …]
Dquantize_weights_test.cc81 std::map<string, const NodeDef*> node_lookup; in TestQuantizeWeights() local
82 MapNamesToNodes(quantized_graph_def, &node_lookup); in TestQuantizeWeights()
83 EXPECT_EQ(1, node_lookup.count("input_op")); in TestQuantizeWeights()
84 const NodeDef* q_input_op = node_lookup.at("input_op"); in TestQuantizeWeights()
86 EXPECT_EQ(1, node_lookup.count("weights_op")); in TestQuantizeWeights()
87 const NodeDef* q_weights_op = node_lookup.at("weights_op"); in TestQuantizeWeights()
91 EXPECT_EQ(1, node_lookup.count(weights_const_name)); in TestQuantizeWeights()
92 const NodeDef* q_weights_const = node_lookup.at(weights_const_name); in TestQuantizeWeights()
135 std::map<string, const NodeDef*> node_lookup; in TEST_F() local
136 MapNamesToNodes(quantized_graph_def, &node_lookup); in TEST_F()
[all …]
Dround_weights_test.cc81 std::map<string, const NodeDef*> node_lookup; in TestRoundWeights() local
82 MapNamesToNodes(rounded_graph_def, &node_lookup); in TestRoundWeights()
83 EXPECT_EQ(1, node_lookup.count("input_op")); in TestRoundWeights()
84 const NodeDef* r_input_op = node_lookup.at("input_op"); in TestRoundWeights()
86 EXPECT_EQ(1, node_lookup.count("weights_op")); in TestRoundWeights()
87 const NodeDef* r_weights_op = node_lookup.at("weights_op"); in TestRoundWeights()
Dremove_device_test.cc85 std::map<string, const NodeDef*> node_lookup; in TestRemoveDevice() local
86 MapNamesToNodes(result, &node_lookup); in TestRemoveDevice()
87 EXPECT_EQ("", node_lookup.at("mul_node1")->device()); in TestRemoveDevice()
88 EXPECT_EQ("", node_lookup.at("add_node2")->device()); in TestRemoveDevice()
Dstrip_unused_nodes.cc130 std::map<string, const NodeDef*> node_lookup; in StripUnusedNodes() local
131 MapNamesToNodes(input_graph_def, &node_lookup); in StripUnusedNodes()
145 if (!node_lookup.count(current_input)) { in StripUnusedNodes()
149 const NodeDef* current_node = node_lookup[current_input]; in StripUnusedNodes()