blob: e21252a9ed8e8d45b35b0cff98b220ddf58fde58 [file] [log] [blame]
Georgios Pinitasee33ea52018-03-08 16:01:29 +00001/*
2 * Copyright (c) 2018 ARM Limited.
3 *
4 * SPDX-License-Identifier: MIT
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to
8 * deal in the Software without restriction, including without limitation the
9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10 * sell copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22 * SOFTWARE.
23 */
Georgios Pinitasd9eb2752018-04-03 13:44:29 +010024#include "arm_compute/graph/mutators/SplitLayerSubTensorMutator.h"
Georgios Pinitasee33ea52018-03-08 16:01:29 +000025
Georgios Pinitasd9eb2752018-04-03 13:44:29 +010026#include "arm_compute/graph/Graph.h"
27#include "arm_compute/graph/Logger.h"
Anthony Barbier890ad1b2018-08-22 13:44:36 +010028#include "arm_compute/graph/Utils.h"
Georgios Pinitas2a2db592018-08-15 12:14:46 +010029#include "arm_compute/graph/algorithms/TopologicalSort.h"
Georgios Pinitasd9eb2752018-04-03 13:44:29 +010030#include "arm_compute/graph/backends/BackendRegistry.h"
31#include "arm_compute/graph/nodes/SplitLayerNode.h"
Georgios Pinitasee33ea52018-03-08 16:01:29 +000032
33#include "arm_compute/core/utils/misc/Cast.h"
34#include "arm_compute/core/utils/misc/Iterable.h"
35
36namespace arm_compute
37{
Georgios Pinitasd9eb2752018-04-03 13:44:29 +010038namespace graph
Georgios Pinitasee33ea52018-03-08 16:01:29 +000039{
40const char *SplitLayerSubTensorMutator::name()
41{
42 return "SplitLayerSubTensorMutator";
43}
44
45void SplitLayerSubTensorMutator::mutate(Graph &g)
46{
Georgios Pinitas2a2db592018-08-15 12:14:46 +010047 // Early exit if no Split layers exist in graph
48 if(g.nodes(NodeType::SplitLayer).empty())
Georgios Pinitasee33ea52018-03-08 16:01:29 +000049 {
Georgios Pinitas2a2db592018-08-15 12:14:46 +010050 return;
51 }
52
53 // Perform topological sort
54 std::vector<NodeID> topological_sorted_node_ids = dfs(g);
55
56 // Should be in reverse order of execution
57 for(auto &node_id : arm_compute::utils::iterable::reverse_iterate(topological_sorted_node_ids))
58 {
59 INode *node = g.node(node_id);
60 if(node != nullptr && node->type() == NodeType::SplitLayer && node->input(0) != nullptr)
Georgios Pinitasee33ea52018-03-08 16:01:29 +000061 {
62 // Get output tensor
63 Tensor *input_tensor = node->input(0);
64
65 // Check that all tensor have the same target and are valid
66 bool is_valid = std::all_of(node->outputs().cbegin(), node->outputs().cend(),
67 [&](const TensorID & tid)
68 {
69 return (g.tensor(tid) != nullptr) && (g.tensor(tid)->desc().target == input_tensor->desc().target);
70 });
71
72 // Create subtensors
Anthony Barbier890ad1b2018-08-22 13:44:36 +010073 if(is_valid && is_target_supported(input_tensor->desc().target))
Georgios Pinitasee33ea52018-03-08 16:01:29 +000074 {
75 ARM_COMPUTE_LOG_GRAPH_VERBOSE("Using sub-tensors for the node with ID : "
76 << node->id() << " and name : " << node->name() << std::endl);
77
Georgios Pinitas2a2db592018-08-15 12:14:46 +010078 auto *split_node = arm_compute::utils::cast::polymorphic_downcast<SplitLayerNode *>(node);
Georgios Pinitasee33ea52018-03-08 16:01:29 +000079
80 const unsigned int axis = split_node->axis();
81 const unsigned int num_splits = split_node->num_splits();
82 const bool extend_parent = (axis < 2);
83
84 // Create sub-tensor handles
85 for(unsigned int i = 0; i < node->outputs().size(); ++i)
86 {
87 Tensor *output_tensor = node->output(i);
88 const TensorShape output_shape = output_tensor->desc().shape;
89 Coordinates coords;
Georgios Pinitascac13b12018-04-27 19:07:19 +010090 std::tie(std::ignore, coords) = SplitLayerNode::compute_output_descriptor(input_tensor->desc(), num_splits, axis, i);
Georgios Pinitasee33ea52018-03-08 16:01:29 +000091
Anthony Barbier890ad1b2018-08-22 13:44:36 +010092 backends::IDeviceBackend &backend = backends::BackendRegistry::get().get_backend(output_tensor->desc().target);
93 std::unique_ptr<ITensorHandle> handle = backend.create_subtensor(input_tensor->handle(), output_shape, coords, extend_parent);
Georgios Pinitasee33ea52018-03-08 16:01:29 +000094 output_tensor->set_handle(std::move(handle));
95 }
96 }
97 }
98 }
99}
Georgios Pinitasd9eb2752018-04-03 13:44:29 +0100100} // namespace graph
Georgios Pinitasee33ea52018-03-08 16:01:29 +0000101} // namespace arm_compute