| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | map_and_batch_fusion.cc | 42 NodeDef MakeMapAndBatchNode(const NodeDef& map_node, const NodeDef& batch_node, in MakeMapAndBatchNode() argument
49 new_node.add_input(map_node.input(0)); in MakeMapAndBatchNode()
53 if (IsParallelMap(map_node)) { in MakeMapAndBatchNode()
54 num_other_args = map_node.input_size() - 2; in MakeMapAndBatchNode()
56 num_other_args = map_node.input_size() - 1; in MakeMapAndBatchNode()
59 new_node.add_input(map_node.input(i + 1)); in MakeMapAndBatchNode()
66 if (map_node.op() == kParallelMap) { in MakeMapAndBatchNode()
70 NodeDef* v = graph->GetNode(map_node.input(map_node.input_size() - 1)); in MakeMapAndBatchNode()
74 } else if (map_node.op() == kParallelMapV2) { in MakeMapAndBatchNode()
75 new_node.add_input(map_node.input(map_node.input_size() - 1)); in MakeMapAndBatchNode()
[all …]
|
| D | map_and_filter_fusion.cc | 45 NodeDef MakeFusedNode(const NodeDef& map_node, in MakeFusedNode() argument
50 fused_node.set_op(map_node.op()); in MakeFusedNode()
53 for (int i = 0; i < map_node.input_size(); ++i) { in MakeFusedNode()
54 fused_node.add_input(map_node.input(i)); in MakeFusedNode()
57 auto attr = map_node.attr().at("f"); in MakeFusedNode()
63 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
69 if (gtl::FindOrNull(map_node.attr(), key)) { in MakeFusedNode()
70 graph_utils::CopyAttribute(key, map_node, &fused_node); in MakeFusedNode()
125 NodeDef map_node; in MakeMapNode() local
126 graph_utils::SetUniqueGraphNodeName("DropLast", graph->graph(), &map_node); in MakeMapNode()
[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 = make_fused_function(parent_map_node, map_node); in OptimizeAndCollectStats()
[all …]
|
| D | map_vectorization.cc | 62 FunctionDef* CreateMapDefunWrapper(const NodeDef& map_node, in CreateMapDefunWrapper() argument
82 graph_utils::CopyAttribute(k, map_node, map_defun_node); in CreateMapDefunWrapper()
91 auto t_captured = map_node.attr().at("Targuments"); in CreateMapDefunWrapper()
116 FunctionDef* AddVectorizedFunction(const NodeDef& map_node, in AddVectorizedFunction() argument
122 CreateMapDefunWrapper(map_node, orig_func, library); in AddVectorizedFunction()
258 NodeDef map_node; in AddNewMapNode() local
260 map_node.set_op(kMapOp); in AddNewMapNode()
262 map_node.set_op(kParallelMapOp); in AddNewMapNode()
264 map_node.set_op(kParallelMapV2Op); in AddNewMapNode()
266 graph_utils::SetUniqueGraphNodeName(map_node.op(), graph->graph(), &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()
91 EXPECT_EQ(map_and_batch_node.input(0), map_node->input(0)); in TEST()
92 EXPECT_EQ(map_and_batch_node.input(1), map_node->input(1)); in TEST()
102 map_node->attr().at("f"))); in TEST()
104 map_node->attr().at("Targuments"))); in TEST()
128 NodeDef *map_node; in TEST() local
140 map_node = in TEST()
[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()
226 int NumberOfPlaceholders(const NodeDef& map_node) { in NumberOfPlaceholders() argument
229 return map_node.input_size() - 1; in NumberOfPlaceholders()
253 const NodeDef* map_node = get_map_node(node); in OptimizeAndCollectStats() local
[all …]
|
| D | map_and_filter_fusion_test.cc | 90 auto& map_node = output.node( in TEST() local
92 EXPECT_FALSE(map_node.attr().at("sloppy").b()) << map_node.DebugString(); in TEST()
94 EXPECT_EQ(map_node.input_size(), 2); in TEST()
157 auto& map_node = output.node( in TEST() local
159 EXPECT_TRUE(map_node.attr().at("sloppy").b()) << map_node.DebugString(); in TEST()
161 EXPECT_EQ(map_node.input_size(), 2); in TEST()
|
| D | map_parallelization.cc | 84 const NodeDef* map_node = get_map_node(node); in OptimizeAndCollectStats() local
85 if (!map_node) continue; in OptimizeAndCollectStats()
88 function_library.Find(map_node->attr().at("f").func().name()); in OptimizeAndCollectStats()
93 graph.AddNode(MakeParallelMap(map_node->name(), &graph)); in OptimizeAndCollectStats()
95 graph.UpdateFanouts(map_node->name(), parallel_map->name())); in OptimizeAndCollectStats()
96 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
|
| D | noop_elimination.cc | 99 bool IsMapIdentity(const NodeDef& map_node, const MutableGraphView& graph) { in IsMapIdentity() argument
100 if (map_node.op() != "MapDataset" && map_node.op() != "ParallelMapDataset" && in IsMapIdentity()
101 map_node.op() != "ParallelMapDatasetV2") { in IsMapIdentity()
108 if (map_node.attr().at("Targuments").list().type_size() != 0) return false; in IsMapIdentity()
113 function_library.Find(map_node.attr().at("f").func().name()); in IsMapIdentity()
|
| D | map_vectorization_test.cc | 180 const NodeDef& map_node = in CheckNotVectorized() local
184 EXPECT_EQ(map_node.input(0), map_input_name); in CheckNotVectorized()
185 EXPECT_EQ(batch_node.input(0), map_node.name()); in CheckNotVectorized()
411 auto map_node = in TEST_P() local
413 auto batch_node = AddBatchNode(&graph, map_node->name(), true); in TEST_P()
522 auto map_node = in TEST() local
524 auto batch_node = AddBatchNode(&graph, map_node->name()); in TEST()
527 CheckNotVectorized(output, map_node->op(), batch_node->op(), in TEST()
541 auto map_node = in TEST() local
543 auto batch_node = AddBatchNode(&graph, map_node->name()); in TEST()
[all …]
|
| D | latency_all_edges_test.cc | 43 NodeDef map_node = NDef("map_node", "MapDataset", in TEST_P() local
59 {component_node, from_tensor_node, captured_input_node, map_node, in TEST_P()
63 captured_input_node, map_node, in TEST_P()
77 std::move(map_node), in TEST_P()
|
| /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 | 81 HT_ENTRY(event_map_entry) map_node;
110 HT_PROTOTYPE(event_io_map, event_map_entry, map_node, hashsocket, eqsocket) in HT_PROTOTYPE() argument
111 HT_GENERATE(event_io_map, event_map_entry, map_node, hashsocket, eqsocket, in HT_PROTOTYPE()
126 HT_FIND_OR_INSERT_(event_io_map, map_node, hashsocket, map, \
137 HT_FOI_INSERT_(map_node, map, &key_, ent_, ptr) \
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | layout_optimizer_test.cc | 666 auto map_node = node_map.GetNode("split-0-DimMapNHWCToNCHW-LayoutOptimizer"); in TEST_F() local
667 EXPECT_EQ(map_node->op(), "DataFormatDimMap"); in TEST_F()
668 EXPECT_EQ(map_node->input(0), "i1"); in TEST_F()
|
| /external/llvm-project/lldb/source/Plugins/Process/gdb-remote/ |
| D | GDBRemoteCommunicationClient.cpp | 1653 XMLNode map_node = xml_document.GetRootElement("memory-map"); in LoadQXferMemoryMap() local
1654 if (!map_node) { in LoadQXferMemoryMap()
1661 map_node.ForEachChildElement([this](const XMLNode &memory_node) -> bool { in LoadQXferMemoryMap()
|