|
| 1 | +/* |
| 2 | + * Copyright (c) 2026 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 | + */ |
| 24 | +#ifndef ACL_SRC_CPU_KERNELS_TOPKV_GENERIC_SVE_IMPL_H |
| 25 | +#define ACL_SRC_CPU_KERNELS_TOPKV_GENERIC_SVE_IMPL_H |
| 26 | + |
| 27 | +#include "arm_compute/core/Coordinates.h" |
| 28 | +#include "arm_compute/core/Error.h" |
| 29 | +#include "arm_compute/core/Helpers.h" |
| 30 | +#include "arm_compute/core/ITensor.h" |
| 31 | +#include "arm_compute/core/Types.h" |
| 32 | +#include "arm_compute/core/Window.h" |
| 33 | + |
| 34 | +#include <cstdint> |
| 35 | +#include <cstring> |
| 36 | + |
| 37 | +namespace arm_compute |
| 38 | +{ |
| 39 | +namespace cpu |
| 40 | +{ |
| 41 | +namespace detail |
| 42 | +{ |
| 43 | + |
| 44 | +/* |
| 45 | + * Type-specific hooks (declared here, defined in each cpp). |
| 46 | + * |
| 47 | + * - vector_length<Scalar>() |
| 48 | + * Return the SVE vector length in elements for Scalar (no clamping). |
| 49 | + * |
| 50 | + * - count_gt_block<Scalar>(ptr, thr, block_elems) |
| 51 | + * Count how many elements in [ptr, ptr + block_elems) are > thr. |
| 52 | + * Tail-safe via predicate. block_elems is always <= vector_length<Scalar>(). |
| 53 | + * |
| 54 | + t contains the SVE intrinsics |
| 55 | + * (e.g., qasymm8.cpp, qasymm8_signed.cpp, fp16.cpp, fp32.cpp, integer.cpp). |
| 56 | + */ |
| 57 | + |
| 58 | +template <typename Scalar> |
| 59 | +uint32_t vector_length(); |
| 60 | + |
| 61 | +template <typename Scalar> |
| 62 | +uint32_t count_gt_block(const Scalar *ptr, Scalar thr, uint32_t block_elems); |
| 63 | + |
| 64 | +// ---------------------------------------------------------------------------- |
| 65 | +// Generic wrapper (type-agnostic) - uses the above hooks. |
| 66 | +// Semantics (matching TopKV tests you showed): |
| 67 | +// - predictions is N x C |
| 68 | +// - window iterates across output elements (classes) => id.x() == class index c |
| 69 | +// - for each class c, targets[c] gives the sample index t |
| 70 | +// - scan across N samples and compute rank (#samples with value > predictions[t]) |
| 71 | +// - output is U8 boolean: (rank < k) |
| 72 | +// ---------------------------------------------------------------------------- |
| 73 | +template <typename Scalar> |
| 74 | +inline void |
| 75 | +topkv_sve_wrapper(const ITensor *predictions, const ITensor *targets, ITensor *out, uint32_t k, const Window &window) |
| 76 | +{ |
| 77 | + ARM_COMPUTE_ERROR_ON_NULLPTR(predictions, targets, out); |
| 78 | + ARM_COMPUTE_ERROR_ON(k == 0); |
| 79 | + |
| 80 | + const ITensorInfo *pred_info = predictions->info(); |
| 81 | + const uint32_t N = pred_info->dimension(0); // samples |
| 82 | + const uint32_t C = pred_info->dimension(1); // classes |
| 83 | + |
| 84 | + const uint32_t vl = vector_length<Scalar>(); // cache once per kernel invocation |
| 85 | + |
| 86 | + Iterator tgt_it(targets, window); |
| 87 | + Iterator out_it(out, window); |
| 88 | + |
| 89 | + execute_window_loop( |
| 90 | + window, |
| 91 | + [&](const Coordinates &id) |
| 92 | + { |
| 93 | + const uint32_t c = static_cast<uint32_t>(id.x()); // class index |
| 94 | + ARM_COMPUTE_ERROR_ON(c >= C); |
| 95 | + |
| 96 | + uint32_t t = {*reinterpret_cast<uint32_t *>(tgt_it.ptr())}; |
| 97 | + ARM_COMPUTE_ERROR_ON(t >= N); |
| 98 | + |
| 99 | + const Scalar *col_ptr = reinterpret_cast<const Scalar *>(predictions->ptr_to_element(Coordinates(0, c))); |
| 100 | + ARM_COMPUTE_ERROR_ON(col_ptr == nullptr); |
| 101 | + |
| 102 | + const Scalar thr = col_ptr[t]; |
| 103 | + |
| 104 | + uint32_t rank = 0; |
| 105 | + uint32_t idx = 0; |
| 106 | + |
| 107 | + while (idx < N) |
| 108 | + { |
| 109 | + const uint32_t remaining = N - idx; |
| 110 | + const uint32_t bw = (remaining < vl) ? remaining : vl; |
| 111 | + |
| 112 | + rank += count_gt_block<Scalar>(col_ptr + idx, thr, bw); |
| 113 | + |
| 114 | + if (rank >= k) |
| 115 | + { |
| 116 | + break; |
| 117 | + } |
| 118 | + |
| 119 | + idx += bw; |
| 120 | + } |
| 121 | + |
| 122 | + *reinterpret_cast<uint8_t *>(out_it.ptr()) = static_cast<uint8_t>(rank < k); |
| 123 | + }, |
| 124 | + tgt_it, out_it); |
| 125 | +} |
| 126 | + |
| 127 | +} // namespace detail |
| 128 | +} // namespace cpu |
| 129 | +} // namespace arm_compute |
| 130 | + |
| 131 | +#endif // ACL_SRC_CPU_KERNELS_TOPKV_GENERIC_SVE_IMPL_H |
0 commit comments