Home
last modified time | relevance | path

Searched refs:graph_utils (Results 1 – 25 of 36) sorted by relevance

12

/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dmap_and_batch_fusion_test.cc32 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); in TEST()
33 NodeDef *stop_node = graph_utils::AddScalarConstNode<int64>(10, &graph); in TEST()
34 NodeDef *step_node = graph_utils::AddScalarConstNode<int64>(1, &graph); in TEST()
41 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
44 graph_utils::AddScalarConstNode<StringPiece>("hello", &graph); in TEST()
59 graph_utils::AddNode("", "MapDataset", map_inputs, map_attrs, &graph); in TEST()
62 NodeDef *batch_size_node = graph_utils::AddScalarConstNode<int64>(5, &graph); in TEST()
75 batch_node = graph_utils::AddNode("", "BatchDataset", batch_inputs, in TEST()
84 graph_utils::ContainsGraphNodeWithName(map_node->name(), output)); in TEST()
86 graph_utils::ContainsGraphNodeWithName(batch_node->name(), output)); in TEST()
[all …]
Dmap_and_filter_fusion_test.cc54 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
55 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter", output)); in TEST()
56 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("MapDataset", output)); in TEST()
59 graph_utils::ContainsNodeWithOp("FilterByLastComponentDataset", output)); in TEST()
85 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
86 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter", output)); in TEST()
87 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("ParallelMapDataset", output)) in TEST()
90 graph_utils::FindGraphNodeWithOp("ParallelMapDataset", output)); in TEST()
93 graph_utils::ContainsNodeWithOp("FilterByLastComponentDataset", output)) in TEST()
118 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
[all …]
Dshuffle_and_repeat_fusion_test.cc40 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); in TEST()
41 NodeDef *stop_node = graph_utils::AddScalarConstNode<int64>(10, &graph); in TEST()
42 NodeDef *step_node = graph_utils::AddScalarConstNode<int64>(1, &graph); in TEST()
48 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
52 graph_utils::AddScalarConstNode<int64>(128, &graph); in TEST()
53 NodeDef *seed_node = graph_utils::AddScalarConstNode<int64>(-1, &graph); in TEST()
54 NodeDef *seed2_node = graph_utils::AddScalarConstNode<int64>(-1, &graph); in TEST()
60 NodeDef *shuffle_node = graph_utils::AddNode( in TEST()
63 NodeDef *count_node = graph_utils::AddScalarConstNode<int64>(-1, &graph); in TEST()
67 NodeDef *repeat_node = graph_utils::AddNode( in TEST()
[all …]
Dnoop_elimination_test.cc40 NodeDef *node_count = graph_utils::AddScalarConstNode<int64>(count, graph); in MakeUnaryNode()
41 return graph_utils::AddNode("", node_type, in MakeUnaryNode()
48 NodeDef *node_count = graph_utils::AddScalarPlaceholder(DT_INT32, graph); in MakeUnaryNonConstNode()
49 return graph_utils::AddNode("", node_type, in MakeUnaryNonConstNode()
56 graph_utils::AddScalarConstNode<StringPiece>("", graph); in MakeCacheNode()
57 return graph_utils::AddNode("", "CacheDataset", in MakeCacheNode()
63 auto *start_node = graph_utils::AddScalarConstNode<int64>(0, graph); in MakeRangeNode()
64 auto *stop_node = graph_utils::AddScalarConstNode<int64>(10, graph); in MakeRangeNode()
65 auto *step_node = graph_utils::AddScalarConstNode<int64>(1, graph); in MakeRangeNode()
70 return graph_utils::AddNode("", "RangeDataset", range_inputs, in MakeRangeNode()
[all …]
Dmake_numa_aware_test.cc59 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map_and_batch", output)); in TEST()
60 EXPECT_FALSE(graph_utils::ContainsNodeWithOp("ExperimentalMapAndBatchDataset", in TEST()
62 EXPECT_TRUE(graph_utils::ContainsNodeWithOp( in TEST()
94 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map_and_batch", output)); in TEST()
95 EXPECT_FALSE(graph_utils::ContainsNodeWithOp("ExperimentalMapAndBatchDataset", in TEST()
97 EXPECT_TRUE(graph_utils::ContainsNodeWithOp( in TEST()
99 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("CacheDataset", output)); in TEST()
101 int numa_map_and_batch_component_id = graph_utils::FindGraphNodeWithOp( in TEST()
107 int cache_id = graph_utils::FindGraphNodeWithOp("CacheDataset", output); in TEST()
DBUILD37 ":graph_utils",
60 ":graph_utils",
83 ":graph_utils",
99 ":graph_utils",
121 ":graph_utils",
137 ":graph_utils",
151 ":graph_utils",
165 name = "graph_utils",
166 srcs = ["graph_utils.cc"],
168 "graph_utils.h",
[all …]
Dfilter_fusion_test.cc51 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("FilterDataset", output)); in TEST()
52 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter1", output)); in TEST()
53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter2", output)); in TEST()
76 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("FilterDataset", output)); in TEST()
77 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter1", output)); in TEST()
78 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter2", output)); in TEST()
79 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter3", output)); in TEST()
Dmap_fusion_test.cc51 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("MapDataset", output)); in TEST()
52 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
76 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("MapDataset", output)); in TEST()
77 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
78 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
79 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map3", output)); in TEST()
Dmap_vectorization_test.cc76 graph_utils::AddScalarConstNode(num_parallel_calls, graph); in AddMapNode()
101 graph_utils::SetUniqueGraphNodeName(result.name(), graph->graph(), &result); in AddMapNode()
107 auto buffer_size_node = graph_utils::AddScalarConstNode(buffer_size, graph); in AddPrefetchNode()
121 auto batch_size_node = graph_utils::AddScalarConstNode(batch_size, graph); in AddBatchNode()
125 auto drop_remainder = graph_utils::AddScalarConstNode(true, graph); in AddBatchNode()
143 graph_utils::SetUniqueGraphNodeName(result.name(), graph->graph(), &result); in AddBatchNode()
148 auto start = graph_utils::AddScalarConstNode(static_cast<int64>(0), graph); in AddRangeNode()
149 auto stop = graph_utils::AddScalarConstNode(static_cast<int64>(10), graph); in AddRangeNode()
150 auto step = graph_utils::AddScalarConstNode(static_cast<int64>(1), graph); in AddRangeNode()
159 graph_utils::SetUniqueGraphNodeName(result.name(), graph->graph(), &result); in AddRangeNode()
[all …]
Dhoist_random_uniform.cc43 graph_utils::SetUniqueGraphNodeName("stateless_map", graph->graph(), in MakeStatelessMap()
57 graph_utils::CopyAttribute("Targuments", map_node, &stateless_map); in MakeStatelessMap()
59 graph_utils::CopyAttribute(key, map_node, &stateless_map); in MakeStatelessMap()
72 graph_utils::SetUniqueGraphNodeName("RandomDataset", graph->graph(), in MakeRandomDataset()
75 const auto* seed = graph_utils::AddScalarConstNode<int64>( in MakeRandomDataset()
77 const auto* seed2 = graph_utils::AddScalarConstNode<int64>( in MakeRandomDataset()
93 graph_utils::SetUniqueGraphNodeName("pair_of_random", graph->graph(), in MakeBatchTwo()
95 const auto* batch_size = graph_utils::AddScalarConstNode<int64>(2, graph); in MakeBatchTwo()
96 const auto* drop_reminder = graph_utils::AddScalarConstNode(false, graph); in MakeBatchTwo()
116 graph_utils::SetUniqueGraphNodeName("zip_with_random", graph->graph(), in MakeZipNode()
[all …]
Dmap_and_batch_fusion.cc40 graph_utils::SetUniqueGraphNodeName(kFusedOpName, graph->graph(), &new_node); in MakeMapAndBatchNode()
65 NodeDef* tmp = graph_utils::AddScalarConstNode<int64>( in MakeMapAndBatchNode()
69 NodeDef* tmp = graph_utils::AddScalarConstNode<int64>(1, graph); in MakeMapAndBatchNode()
77 NodeDef* tmp = graph_utils::AddScalarConstNode<bool>(false, graph); in MakeMapAndBatchNode()
83 graph_utils::CopyAttribute(key, map_node, &new_node); in MakeMapAndBatchNode()
86 graph_utils::CopyAttribute(key, batch_node, &new_node); in MakeMapAndBatchNode()
93 graph_utils::CopyAttribute(key, map_node, &new_node); in MakeMapAndBatchNode()
116 NodeDef* node2 = graph_utils::GetInputNode(batch_node, graph); in OptimizeAndCollectStats()
Dmap_parallelization_test.cc52 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("ParallelMapDataset", output)); in TEST()
53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
54 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
78 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("ParallelMapDataset", output)); in TEST()
79 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
80 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
Dmake_sloppy_test.cc59 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("interleave", output)); in TEST()
60 int index = graph_utils::FindGraphNodeWithName("interleave", output); in TEST()
84 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
85 int index = graph_utils::FindGraphNodeWithName("map", output); in TEST()
107 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("parse_example", output)); in TEST()
108 int index = graph_utils::FindGraphNodeWithName("parse_example", output); in TEST()
Dmap_vectorization.cc66 graph_utils::SetUniqueGraphFunctionName("naively_vectorized_fn", library, in CreateMapDefunWrapper()
79 graph_utils::CopyAttribute(k, map_node, map_defun_node); in CreateMapDefunWrapper()
196 graph_utils::SetUniqueGraphNodeName(batch_node.op(), graph->graph(), in AddNewBatchNode()
256 graph_utils::SetUniqueGraphNodeName(map_node.op(), graph->graph(), &map_node); in AddNewMapNode()
275 graph_utils::AddScalarConstNode(static_cast<int32>(kAutotune), graph); in AddNewMapNode()
280 graph_utils::CopyAttribute("Targuments", old_map_node, &map_node); in AddNewMapNode()
285 graph_utils::CopyAttribute(key, old_batch_node, &map_node); in AddNewMapNode()
299 graph_utils::SetUniqueGraphNodeName(kPrefetchOp, graph->graph(), in AddNewPrefetchNode()
309 graph_utils::AddScalarConstNode(static_cast<int64>(kAutotune), graph); in AddNewPrefetchNode()
313 graph_utils::CopyAttribute(key, new_map_node, &prefetch_node); in AddNewPrefetchNode()
[all …]
Dhoist_random_uniform_test.cc53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
54 const int new_map_id = graph_utils::FindGraphNodeWithOp("MapDataset", output); in TEST()
56 graph_utils::FindGraphNodeWithOp("ZipDataset", output); in TEST()
58 graph_utils::FindGraphNodeWithOp("ExperimentalRandomDataset", output); in TEST()
60 graph_utils::FindGraphNodeWithOp("BatchDatasetV2", output); in TEST()
Dauto_shard.cc110 graph_utils::SetUniqueGraphNodeName(kShardDatasetOpName, graph->graph(), in AddShardNode()
115 graph_utils::AddScalarConstNode<int64>(num_workers, graph); in AddShardNode()
116 NodeDef* index_node = graph_utils::AddScalarConstNode<int64>(index, graph); in AddShardNode()
125 graph_utils::CopyAttribute("output_shapes", *add_after, &new_node); in AddShardNode()
131 graph_utils::CopyAttribute("output_types", *add_after, &new_node); in AddShardNode()
187 const NodeDef* input_node = graph_utils::GetInputNode(node, *graph, i); in RecursivelyHandleOp()
222 const NodeDef* input_node = graph_utils::GetInputNode(node, *graph, 0); in RecursivelyHandleOp()
244 TF_RETURN_IF_ERROR(graph_utils::FindSinkNode(item.graph, &sink_node)); in OptimizeGraph()
Drebatch.cc103 graph_utils::SetUniqueGraphNodeName(cast_node.op(), graph->graph(), in AddCastNode()
118 graph_utils::SetUniqueGraphNodeName(op, graph->graph(), &node); in AddBinaryNode()
145 NodeDef* batch_size_node = graph_utils::GetInputNode(node, *graph, 1); in MutateBatchSize()
166 graph_utils::AddScalarConstNode<int64>(batch_size, graph); in MutateBatchSize()
194 NodeDef* input_node = graph_utils::GetInputNode(node, *graph, i); in RecursivelyHandleOp()
201 NodeDef* input_node = graph_utils::GetInputNode(node, *graph, 0); in RecursivelyHandleOp()
252 TF_RETURN_IF_ERROR(graph_utils::FindSinkNode(item.graph, &sink_node)); in OptimizeGraph()
Dmap_and_filter_fusion.cc41 graph_utils::SetUniqueGraphNodeName("fused_map", graph->graph(), &fused_node); in MakeFusedNode()
55 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
62 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
83 graph_utils::SetUniqueGraphNodeName("FilterByLastComponent", graph->graph(), in MakeFilterByLastComponentNode()
149 get_map_node(*graph_utils::GetInputNode(*filter_node, graph)); in OptimizeAndCollectStats()
Dfilter_fusion.cc41 graph_utils::SetUniqueGraphNodeName("fused_filter", graph->graph(), in MakeFusedFilterNode()
51 graph_utils::CopyAttribute("Targuments", first_filter_node, &fused_node); in MakeFusedFilterNode()
54 graph_utils::CopyAttribute(key, second_filter_node, &fused_node); in MakeFusedFilterNode()
106 get_filter_node(*graph_utils::GetInputNode(*second_filter_node, graph)); in OptimizeAndCollectStats()
Dmap_fusion.cc43 graph_utils::SetUniqueGraphNodeName("fused_map", graph->graph(), &fused_node); in MakeFusedNode()
51 graph_utils::CopyAttribute("Targuments", parent_map_node, &fused_node); in MakeFusedNode()
53 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
128 get_map_node(*graph_utils::GetInputNode(*map_node, graph)); in OptimizeAndCollectStats()
Dshuffle_and_repeat_fusion.cc48 graph_utils::SetUniqueGraphNodeName(kFusedOpName, output, &new_node); in OptimizeAndCollectStats()
67 graph_utils::CopyAttribute(key, repeat_node, &new_node); in OptimizeAndCollectStats()
79 NodeDef* node2 = graph_utils::GetInputNode(repeat_node, graph); in OptimizeAndCollectStats()
Dmap_parallelization.cc40 int index = graph_utils::FindGraphNodeWithName(name, *graph->graph()); in MakeParallelMap()
44 graph_utils::SetUniqueGraphNodeName(kParallelMapDataset, graph->graph(), in MakeParallelMap()
47 auto* num_parallel_calls = graph_utils::AddScalarConstNode(kAutotune, graph); in MakeParallelMap()
Dfunction_utils.cc140 return graph_utils::GetFirstElementIndexWithPredicate( in FindFunctionInputWithName()
146 return graph_utils::GetFirstElementIndexWithPredicate( in FindFunctionOutputWithName()
152 return graph_utils::GetFirstElementIndexWithPredicate( in FindFunctionNodeWithName()
158 return graph_utils::GetFirstElementIndexWithPredicate( in FindFunctionNodeWithOp()
Dlatency_all_edges_test.cc60 EXPECT_TRUE(graph_utils::ContainsNodeWithOp("ExperimentalLatencyStatsDataset", in TEST()
62 std::vector<int> latency_node_indices = graph_utils::FindAllGraphNodesWithOp( in TEST()
Dvectorization_utils.cc342 int output_position = graph_utils::GetFirstElementIndexWithPredicate( in VectorizeHelper()
398 int node_id = graph_utils::GetFirstElementIndexWithPredicate( in Initialize()
618 TF_RETURN_IF_ERROR(graph_utils::EnsureNodeNamesUnique(outer_scope_.get())); in GetResult()
619 TF_RETURN_IF_ERROR(graph_utils::EnsureNodeNamesUnique(map_defun_fn_->graph)); in GetResult()
623 graph_utils::SetUniqueGraphFunctionName("map_defun_fn", lib_, map_defun_fn); in GetResult()
633 graph_utils::SetUniqueGraphFunctionName("vectorized_fn", lib_, in GetResult()

12