Pablo Tello | 3252143 | 2018-11-15 14:43:10 +0000 | [diff] [blame] | 1 | /* |
Michele Di Giorgio | d9eaf61 | 2020-07-08 11:12:57 +0100 | [diff] [blame] | 2 | * Copyright (c) 2018 Arm Limited. |
Pablo Tello | 3252143 | 2018-11-15 14:43:10 +0000 | [diff] [blame] | 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 | */ |
| 24 | #include "arm_compute/graph/nodes/PriorBoxLayerNode.h" |
| 25 | |
| 26 | #include "arm_compute/core/Utils.h" |
| 27 | #include "arm_compute/graph/Graph.h" |
| 28 | #include "arm_compute/graph/INodeVisitor.h" |
| 29 | #include "arm_compute/graph/Utils.h" |
| 30 | |
| 31 | namespace arm_compute |
| 32 | { |
| 33 | namespace graph |
| 34 | { |
| 35 | PriorBoxLayerNode::PriorBoxLayerNode(PriorBoxLayerInfo prior_info) |
| 36 | : _info(std::move(prior_info)) |
| 37 | { |
| 38 | _input_edges.resize(2, EmptyEdgeID); |
| 39 | _outputs.resize(1, NullTensorID); |
| 40 | } |
| 41 | |
| 42 | PriorBoxLayerInfo PriorBoxLayerNode::priorbox_info() const |
| 43 | { |
| 44 | return _info; |
| 45 | } |
| 46 | |
| 47 | TensorDescriptor PriorBoxLayerNode::compute_output_descriptor(const TensorDescriptor &input_descriptor, |
| 48 | const PriorBoxLayerInfo &info) |
| 49 | { |
| 50 | const unsigned int layer_width = get_dimension_size(input_descriptor, DataLayoutDimension::WIDTH); |
| 51 | const unsigned int layer_height = get_dimension_size(input_descriptor, DataLayoutDimension::HEIGHT); |
| 52 | const unsigned int num_priors = info.aspect_ratios().size() * info.min_sizes().size() + info.max_sizes().size(); |
| 53 | |
| 54 | TensorDescriptor output_descriptor = input_descriptor; |
| 55 | output_descriptor.shape.set(0, layer_width * layer_height * num_priors * 4); |
| 56 | output_descriptor.shape.set(1, 2); |
| 57 | output_descriptor.shape.set(2, 1); |
| 58 | |
| 59 | return output_descriptor; |
| 60 | } |
| 61 | |
| 62 | bool PriorBoxLayerNode::forward_descriptors() |
| 63 | { |
| 64 | if((input_id(0) != NullTensorID) && (output_id(0) != NullTensorID)) |
| 65 | { |
| 66 | Tensor *dst = output(0); |
| 67 | ARM_COMPUTE_ERROR_ON(dst == nullptr); |
| 68 | dst->desc() = configure_output(0); |
| 69 | return true; |
| 70 | } |
| 71 | return false; |
| 72 | } |
| 73 | |
| 74 | TensorDescriptor PriorBoxLayerNode::configure_output(size_t idx) const |
| 75 | { |
| 76 | ARM_COMPUTE_UNUSED(idx); |
| 77 | ARM_COMPUTE_ERROR_ON(idx >= _outputs.size()); |
| 78 | |
| 79 | const Tensor *input0 = input(0); |
| 80 | ARM_COMPUTE_ERROR_ON(input0 == nullptr); |
| 81 | |
| 82 | return compute_output_descriptor(input0->desc(), _info); |
| 83 | } |
| 84 | |
| 85 | NodeType PriorBoxLayerNode::type() const |
| 86 | { |
| 87 | return NodeType::PriorBoxLayer; |
| 88 | } |
| 89 | |
| 90 | void PriorBoxLayerNode::accept(INodeVisitor &v) |
| 91 | { |
| 92 | v.visit(*this); |
| 93 | } |
| 94 | } // namespace graph |
| 95 | } // namespace arm_compute |