| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | map_and_batch_fusion.cc | 36 NodeDef MakeMapAndBatchNode(const NodeDef& map_node, const NodeDef& batch_node, in MakeMapAndBatchNode() argument
43 new_node.add_input(map_node.input(0)); in MakeMapAndBatchNode()
47 if (map_node.op() == "ParallelMapDataset") { in MakeMapAndBatchNode()
48 num_other_args = map_node.input_size() - 2; in MakeMapAndBatchNode()
50 num_other_args = map_node.input_size() - 1; in MakeMapAndBatchNode()
53 new_node.add_input(map_node.input(i + 1)); in MakeMapAndBatchNode()
60 if (map_node.op() == "ParallelMapDataset") { in MakeMapAndBatchNode()
64 NodeDef* v = graph->GetNode(map_node.input(map_node.input_size() - 1)); in MakeMapAndBatchNode()
83 graph_utils::CopyAttribute(key, map_node, &new_node); in MakeMapAndBatchNode()
92 if (gtl::FindOrNull(map_node.attr(), key)) { in MakeMapAndBatchNode()
[all …]
|
| D | map_and_filter_fusion.cc | 37 NodeDef MakeFusedNode(const NodeDef& map_node, in MakeFusedNode() argument
42 fused_node.set_op(map_node.op()); in MakeFusedNode()
45 for (int i = 0; i < map_node.input_size(); ++i) { in MakeFusedNode()
46 fused_node.add_input(map_node.input(i)); in MakeFusedNode()
49 auto attr = map_node.attr().at("f"); in MakeFusedNode()
55 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
61 if (gtl::FindOrNull(map_node.attr(), key)) { in MakeFusedNode()
62 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
123 const NodeDef* map_node, in OptimizeAndCollectStats()
125 const auto& parent_fun = map_node->attr().at("f"); in OptimizeAndCollectStats()
[all …]
|
| D | map_fusion.cc | 39 NodeDef MakeFusedNode(const NodeDef& parent_map_node, const NodeDef& map_node, in MakeFusedNode() argument
53 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
63 gtl::FindOrNull(map_node.attr(), "use_inter_op_parallelism"); in MakeFusedNode()
72 gtl::FindOrNull(map_node.attr(), "preserve_cardinality"); in MakeFusedNode()
103 const NodeDef* map_node) -> FunctionDef* { in OptimizeAndCollectStats() argument
107 const auto& fun = map_node->attr().at("f"); in OptimizeAndCollectStats()
124 const NodeDef* map_node = get_map_node(node); in OptimizeAndCollectStats() local
125 if (!map_node) continue; in OptimizeAndCollectStats()
128 get_map_node(*graph_utils::GetInputNode(*map_node, graph)); in OptimizeAndCollectStats()
131 const auto* fused_function = get_fused_function(parent_map_node, map_node); in OptimizeAndCollectStats()
[all …]
|
| D | hoist_random_uniform.cc | 39 NodeDef MakeStatelessMap(const NodeDef& map_node, const NodeDef& zip_node, in MakeStatelessMap() argument
49 for (int i = 1; i < map_node.input_size(); i++) in MakeStatelessMap()
50 stateless_map.add_input(map_node.input(i)); in MakeStatelessMap()
52 auto attr = map_node.attr().at("f"); in MakeStatelessMap()
57 graph_utils::CopyAttribute("Targuments", map_node, &stateless_map); in MakeStatelessMap()
59 graph_utils::CopyAttribute(key, map_node, &stateless_map); in MakeStatelessMap()
62 gtl::FindOrNull(map_node.attr(), "use_inter_op_parallelism")) in MakeStatelessMap()
216 int NumberOfPlaceholders(const NodeDef& map_node) { in NumberOfPlaceholders() argument
219 return map_node.input_size() - 1; in NumberOfPlaceholders()
243 const NodeDef* map_node = get_map_node(node); in OptimizeAndCollectStats() local
[all …]
|
| D | map_vectorization.cc | 59 FunctionDef* CreateMapDefunWrapper(const NodeDef& map_node, in CreateMapDefunWrapper() argument
79 graph_utils::CopyAttribute(k, map_node, map_defun_node); in CreateMapDefunWrapper()
88 auto t_captured = map_node.attr().at("Targuments"); in CreateMapDefunWrapper()
112 FunctionDef* AddVectorizedFunction(const NodeDef& map_node, in AddVectorizedFunction() argument
118 CreateMapDefunWrapper(map_node, orig_func, library); in AddVectorizedFunction()
254 NodeDef map_node; in AddNewMapNode() local
255 map_node.set_op(old_map_node.op() == kMapOp ? kMapOp : kParallelMapOp); in AddNewMapNode()
256 graph_utils::SetUniqueGraphNodeName(map_node.op(), graph->graph(), &map_node); in AddNewMapNode()
259 map_node.add_input(new_batch_node.name()); in AddNewMapNode()
266 CopyInputs("other_arguments", input_map, old_map_node, &map_node)); in AddNewMapNode()
[all …]
|
| D | map_and_batch_fusion_test.cc | 46 NodeDef *map_node; in TEST() local
58 map_node = in TEST()
66 batch_inputs[0] = map_node->name(); in TEST()
84 graph_utils::ContainsGraphNodeWithName(map_node->name(), output)); in TEST()
92 EXPECT_EQ(map_and_batch_node.input(0), map_node->input(0)); in TEST()
93 EXPECT_EQ(map_and_batch_node.input(1), map_node->input(1)); in TEST()
103 map_node->attr().at("f"))); in TEST()
105 map_node->attr().at("Targuments"))); in TEST()
129 NodeDef *map_node; in TEST() local
141 map_node = in TEST()
[all …]
|
| D | map_and_filter_fusion_test.cc | 89 auto& map_node = output.node( in TEST() local
91 EXPECT_FALSE(map_node.attr().at("sloppy").b()) << map_node.DebugString(); in TEST()
126 auto& map_node = output.node(map_id); in TEST() local
127 ASSERT_EQ(map_node.input_size(), 1); in TEST()
128 EXPECT_EQ(map_node.input(0), "range"); in TEST()
134 EXPECT_EQ(filter_by_component.input(0), map_node.name()); in TEST()
175 auto& map_node = output.node(map_id); in TEST() local
176 ASSERT_EQ(map_node.input_size(), 2); in TEST()
177 EXPECT_EQ(map_node.input(0), "range"); in TEST()
178 EXPECT_EQ(map_node.input(1), "num_parallel_calls"); in TEST()
[all …]
|
| D | map_parallelization.cc | 70 const NodeDef* map_node = get_map_node(node); in OptimizeAndCollectStats() local
71 if (!map_node) continue; in OptimizeAndCollectStats()
74 function_library.Find(map_node->attr().at("f").func().name()); in OptimizeAndCollectStats()
79 graph.AddNode(MakeParallelMap(map_node->name(), &graph)); in OptimizeAndCollectStats()
81 graph.UpdateFanouts(map_node->name(), parallel_map->name())); in OptimizeAndCollectStats()
82 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
|
| D | map_vectorization_test.cc | 167 const NodeDef& map_node = in CheckNotVectorized() local
171 EXPECT_EQ(map_node.input(0), map_input_name); in CheckNotVectorized()
172 EXPECT_EQ(batch_node.input(0), map_node.name()); in CheckNotVectorized()
347 auto map_node = in TEST_P() local
349 auto batch_node = AddBatchNode(&graph, map_node->name(), true); in TEST_P()
434 auto map_node = in TEST() local
436 auto batch_node = AddBatchNode(&graph, map_node->name()); in TEST()
440 CheckNotVectorized(output, map_node->op(), batch_node->op(), in TEST()
454 auto map_node = in TEST() local
456 auto batch_node = AddBatchNode(&graph, map_node->name()); in TEST()
[all …]
|
| D | latency_all_edges_test.cc | 40 NodeDef map_node = NDef("map_node", "MapDataset", in TEST() local
53 captured_input_node, map_node, in TEST()
66 std::move(map_node), in TEST()
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | call_graph_test.cc | 159 const CallGraphNode& map_node = call_graph->GetNode(map_computation); in TEST_F() local
160 EXPECT_EQ(map_computation, map_node.computation()); in TEST_F()
161 EXPECT_EQ(map_node.depth(), 1); in TEST_F()
162 EXPECT_EQ(CallContext::kParallel, map_node.context()); in TEST_F()
163 EXPECT_TRUE(map_node.callsites().empty()); in TEST_F()
164 EXPECT_TRUE(map_node.callees().empty()); in TEST_F()
165 EXPECT_EQ(5, map_node.caller_callsites().size()); in TEST_F()
166 EXPECT_EQ(1, map_node.callers().size()); in TEST_F()
|
| /external/libevent/ |
| D | evmap.c | 80 HT_ENTRY(event_map_entry) map_node;
109 HT_PROTOTYPE(event_io_map, event_map_entry, map_node, hashsocket, eqsocket) in HT_PROTOTYPE() argument
110 HT_GENERATE(event_io_map, event_map_entry, map_node, hashsocket, eqsocket, in HT_PROTOTYPE()
125 HT_FIND_OR_INSERT_(event_io_map, map_node, hashsocket, map, \
136 HT_FOI_INSERT_(map_node, map, &key_, ent_, ptr) \
|
| /external/v8/src/compiler/ |
| D | escape-analysis.cc | 524 Node* map_node = jsgraph->HeapConstant(map); in LowerCompareMapsWithoutLoad() local
526 NodeProperties::SetType(map_node, Type::Internal()); in LowerCompareMapsWithoutLoad()
528 jsgraph->simplified()->ReferenceEqual(), checked_map, map_node); in LowerCompareMapsWithoutLoad()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | layout_optimizer_test.cc | 646 auto map_node = node_map.GetNode("split-0-DimMapNHWCToNCHW-LayoutOptimizer"); in TEST_F() local
647 EXPECT_EQ(map_node->op(), "DataFormatDimMap"); in TEST_F()
648 EXPECT_EQ(map_node->input(0), "i1"); in TEST_F()
|