Anthony Barbier | 6ff3b19 | 2017-09-04 18:44:23 +0100 | [diff] [blame] | 1 | /* |
Michele Di Giorgio | d9eaf61 | 2020-07-08 11:12:57 +0100 | [diff] [blame] | 2 | * Copyright (c) 2016, 2017 Arm Limited. |
Anthony Barbier | 6ff3b19 | 2017-09-04 18:44:23 +0100 | [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/runtime/CL/CLLut.h" |
| 25 | |
| 26 | #include "arm_compute/runtime/CL/CLScheduler.h" |
| 27 | |
| 28 | #include <cstring> |
| 29 | |
| 30 | using namespace arm_compute; |
| 31 | |
| 32 | CLLut::CLLut() |
| 33 | : _allocator() |
| 34 | { |
| 35 | } |
| 36 | |
| 37 | CLLut::CLLut(size_t num_elements, DataType data_type) |
| 38 | : _allocator() |
| 39 | { |
| 40 | _allocator.init(num_elements, data_type); |
| 41 | } |
| 42 | |
| 43 | size_t CLLut::num_elements() const |
| 44 | { |
| 45 | return _allocator.num_elements(); |
| 46 | } |
| 47 | |
| 48 | uint32_t CLLut::index_offset() const |
| 49 | { |
| 50 | return (DataType::S16 == _allocator.type()) ? num_elements() / 2 : 0; |
| 51 | } |
| 52 | |
| 53 | size_t CLLut::size_in_bytes() const |
| 54 | { |
| 55 | return _allocator.size(); |
| 56 | } |
| 57 | |
| 58 | DataType CLLut::type() const |
| 59 | { |
| 60 | return _allocator.type(); |
| 61 | } |
| 62 | |
| 63 | const cl::Buffer &CLLut::cl_buffer() const |
| 64 | { |
| 65 | return _allocator.cl_data(); |
| 66 | } |
| 67 | |
| 68 | void CLLut::clear() |
| 69 | { |
| 70 | cl::CommandQueue &q = CLScheduler::get().queue(); |
| 71 | uint8_t *data = _allocator.map(q, true /* blocking */); |
| 72 | std::memset(data, 0, size_in_bytes()); |
| 73 | _allocator.unmap(q, data); |
| 74 | } |
| 75 | |
| 76 | ILutAllocator *CLLut::allocator() |
| 77 | { |
| 78 | return &_allocator; |
| 79 | } |
| 80 | |
| 81 | void CLLut::map(bool blocking) |
| 82 | { |
| 83 | ICLLut::map(CLScheduler::get().queue(), blocking); |
| 84 | } |
| 85 | |
| 86 | void CLLut::unmap() |
| 87 | { |
| 88 | ICLLut::unmap(CLScheduler::get().queue()); |
| 89 | } |
| 90 | |
| 91 | uint8_t *CLLut::do_map(cl::CommandQueue &q, bool blocking) |
| 92 | { |
| 93 | return _allocator.map(q, blocking); |
| 94 | } |
| 95 | |
| 96 | void CLLut::do_unmap(cl::CommandQueue &q) |
| 97 | { |
| 98 | _allocator.unmap(q, buffer()); |
| 99 | } |