|
| 1 | +// Licensed to the Apache Software Foundation (ASF) under one |
| 2 | +// or more contributor license agreements. See the NOTICE file |
| 3 | +// distributed with this work for additional information |
| 4 | +// regarding copyright ownership. The ASF licenses this file |
| 5 | +// to you under the Apache License, Version 2.0 (the |
| 6 | +// "License"); you may not use this file except in compliance |
| 7 | +// with the License. You may obtain a copy of the License at |
| 8 | +// |
| 9 | +// http://www.apache.org/licenses/LICENSE-2.0 |
| 10 | +// |
| 11 | +// Unless required by applicable law or agreed to in writing, |
| 12 | +// software distributed under the License is distributed on an |
| 13 | +// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| 14 | +// KIND, either express or implied. See the License for the |
| 15 | +// specific language governing permissions and limitations |
| 16 | +// under the License. |
| 17 | + |
| 18 | +#include "util/simd/bits.h" |
| 19 | + |
| 20 | +#include <gtest/gtest-message.h> |
| 21 | +#include <gtest/gtest-test-part.h> |
| 22 | +#include <gtest/gtest.h> |
| 23 | + |
| 24 | +#include <algorithm> |
| 25 | + |
| 26 | +#include "gtest/gtest_pred_impl.h" |
| 27 | + |
| 28 | +namespace doris::simd { |
| 29 | +TEST(BitsTest, BytesMaskToBitsMask) { |
| 30 | + // Length determined by architecture (16 on NEON/aarch64, else 32) |
| 31 | + constexpr auto len = bits_mask_length(); |
| 32 | + std::vector<uint8_t> data(len, 0); |
| 33 | + // Mark some indices as 1 (non‑zero) |
| 34 | + std::vector<size_t> marked = {0, len / 2, len - 1}; |
| 35 | + for (auto i : marked) { |
| 36 | + data[i] = 1; |
| 37 | + } |
| 38 | + |
| 39 | + // Build mask |
| 40 | + auto mask = bytes_mask_to_bits_mask(data.data()); |
| 41 | + |
| 42 | + // Collect indices via iterate_through_bits_mask |
| 43 | + std::vector<size_t> collected; |
| 44 | + iterate_through_bits_mask([&](size_t idx) { collected.push_back(idx); }, mask); |
| 45 | + |
| 46 | + // Sort to compare (iterate_through_bits_mask already gives ascending, but be safe) |
| 47 | + std::sort(collected.begin(), collected.end()); |
| 48 | + |
| 49 | + // Expect collected matches 'marked' |
| 50 | + EXPECT_EQ(collected.size(), marked.size()); |
| 51 | + for (size_t i = 0; i < marked.size(); ++i) { |
| 52 | + EXPECT_EQ(collected[i], marked[i]); |
| 53 | + } |
| 54 | + |
| 55 | + // All zero -> mask == 0 |
| 56 | + std::vector<uint8_t> zeros(len, 0); |
| 57 | + auto zero_mask = bytes_mask_to_bits_mask(zeros.data()); |
| 58 | + EXPECT_EQ(zero_mask, decltype(zero_mask)(0)); |
| 59 | + |
| 60 | + // All ones -> mask == bits_mask_all() |
| 61 | + std::vector<uint8_t> ones(len, 1); |
| 62 | + auto full_mask = bytes_mask_to_bits_mask(ones.data()); |
| 63 | + EXPECT_EQ(full_mask, bits_mask_all()); |
| 64 | +} |
| 65 | + |
| 66 | +TEST(BitsTest, CountZeroNum) { |
| 67 | + // Case 1: empty |
| 68 | + const int8_t* empty = nullptr; |
| 69 | + EXPECT_EQ(count_zero_num<size_t>(empty, size_t(0)), 0U); |
| 70 | + EXPECT_EQ(count_zero_num<size_t>(empty, static_cast<const uint8_t*>(nullptr), size_t(0)), 0U); |
| 71 | + |
| 72 | + // Case 2: all zero |
| 73 | + { |
| 74 | + std::vector<int8_t> v(10, 0); |
| 75 | + std::vector<uint8_t> null_map(10, 0); |
| 76 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), v.size()), 10U); |
| 77 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), null_map.data(), v.size()), 10U); |
| 78 | + } |
| 79 | + |
| 80 | + // Case 3: no zero, some nulls |
| 81 | + { |
| 82 | + std::vector<int8_t> v = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}; |
| 83 | + std::vector<uint8_t> null_map = {0, 1, 0, 0, 1, 0, 0, 1, 0, 0}; |
| 84 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), v.size()), 0U); |
| 85 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), null_map.data(), v.size()), 3U); |
| 86 | + } |
| 87 | + |
| 88 | + // Case 4: mixed zeros and nulls union |
| 89 | + { |
| 90 | + // zeros at 0,2,5 ; nulls at 1,4,6 |
| 91 | + std::vector<int8_t> v = {0, 1, 0, 1, 1, 0, 1, 1}; |
| 92 | + std::vector<uint8_t> null_map = {0, 1, 0, 0, 1, 0, 1, 0}; |
| 93 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), v.size()), 3U); |
| 94 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), null_map.data(), v.size()), 6U); |
| 95 | + } |
| 96 | + |
| 97 | + // Case 5: large (>64) to exercise SIMD path |
| 98 | + { |
| 99 | + std::vector<int8_t> v(128); |
| 100 | + std::vector<uint8_t> null_map(128); |
| 101 | + size_t expect_zero = 0; |
| 102 | + size_t expect_union = 0; |
| 103 | + for (size_t i = 0; i < v.size(); ++i) { |
| 104 | + v[i] = (i % 5 == 0) ? 0 : 1; |
| 105 | + null_map[i] = (i % 7 == 0) ? 1 : 0; |
| 106 | + if (v[i] == 0) { |
| 107 | + ++expect_zero; |
| 108 | + } |
| 109 | + expect_union += static_cast<uint8_t>(!v[i]) | null_map[i]; |
| 110 | + } |
| 111 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), v.size()), expect_zero); |
| 112 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), null_map.data(), v.size()), expect_union); |
| 113 | + } |
| 114 | + |
| 115 | + // Case 6: tail check (size not multiple of 16/64) |
| 116 | + { |
| 117 | + size_t n = 128 + 13; |
| 118 | + std::vector<int8_t> v(n); |
| 119 | + std::vector<uint8_t> null_map(n); |
| 120 | + size_t expect_zero = 0; |
| 121 | + size_t expect_union = 0; |
| 122 | + for (size_t i = 0; i < n; ++i) { |
| 123 | + v[i] = (i % 5 == 0) ? 0 : 1; |
| 124 | + null_map[i] = (i % 7 == 0) ? 1 : 0; |
| 125 | + if (v[i] == 0) { |
| 126 | + ++expect_zero; |
| 127 | + } |
| 128 | + expect_union += static_cast<uint8_t>(!v[i]) | null_map[i]; |
| 129 | + } |
| 130 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), n), expect_zero); |
| 131 | + EXPECT_EQ(count_zero_num<size_t>(v.data(), null_map.data(), n), expect_union); |
| 132 | + } |
| 133 | +} |
| 134 | + |
| 135 | +TEST(BitsTest, FindByte) { |
| 136 | + std::vector<uint8_t> v = {5, 0, 1, 7, 1, 9, 0, 3}; |
| 137 | + EXPECT_EQ(find_byte<uint8_t>(v, 0, uint8_t(5)), 0U); |
| 138 | + EXPECT_EQ(find_byte<uint8_t>(v, 0, uint8_t(0)), 1U); |
| 139 | + EXPECT_EQ(find_byte<uint8_t>(v, 2, uint8_t(1)), 2U); |
| 140 | + EXPECT_EQ(find_byte<uint8_t>(v, 3, uint8_t(1)), 4U); |
| 141 | + EXPECT_EQ(find_byte<uint8_t>(v, 0, uint8_t(42)), v.size()); |
| 142 | + EXPECT_EQ(find_byte<uint8_t>(v, v.size(), uint8_t(5)), v.size()); |
| 143 | + const uint8_t* data = v.data(); |
| 144 | + EXPECT_EQ(find_byte<uint8_t>(data, 0, 5, uint8_t(0)), 1U); |
| 145 | + EXPECT_EQ(find_byte<uint8_t>(data, 2, 6, uint8_t(1)), 2U); |
| 146 | + EXPECT_EQ(find_byte<uint8_t>(data, 3, 6, uint8_t(0)), 6U); |
| 147 | + EXPECT_EQ(find_byte<uint8_t>(data, 6, 6, uint8_t(3)), 6U); |
| 148 | +} |
| 149 | + |
| 150 | +TEST(BitsTest, ContainByte) { |
| 151 | + std::vector<uint8_t> v = {5, 0, 1, 7, 1, 9, 0, 3}; |
| 152 | + const uint8_t* data = v.data(); |
| 153 | + EXPECT_TRUE(contain_byte<uint8_t>(data, v.size(), static_cast<signed char>(5))); |
| 154 | + EXPECT_TRUE(contain_byte<uint8_t>(data, v.size(), static_cast<signed char>(0))); |
| 155 | + EXPECT_TRUE(contain_byte<uint8_t>(data, v.size(), static_cast<signed char>(1))); |
| 156 | + EXPECT_TRUE(contain_byte<uint8_t>(data, v.size(), static_cast<signed char>(3))); |
| 157 | + EXPECT_FALSE(contain_byte<uint8_t>(data, v.size(), static_cast<signed char>(42))); |
| 158 | + EXPECT_FALSE(contain_byte<uint8_t>(data, 0, static_cast<signed char>(5))); |
| 159 | +} |
| 160 | + |
| 161 | +TEST(BitsTest, FindOne) { |
| 162 | + std::vector<uint8_t> v = {5, 0, 1, 7, 1, 9, 0, 3}; |
| 163 | + const uint8_t* data = v.data(); |
| 164 | + EXPECT_EQ(find_one(v, 0), 2U); |
| 165 | + EXPECT_EQ(find_one(v, 3), 4U); |
| 166 | + EXPECT_EQ(find_one(v, 5), v.size()); |
| 167 | + EXPECT_EQ(find_one(data, 0, v.size()), 2U); |
| 168 | + EXPECT_EQ(find_one(data, 4, v.size()), 4U); |
| 169 | + EXPECT_EQ(find_one(data, 5, v.size()), v.size()); |
| 170 | +} |
| 171 | + |
| 172 | +TEST(BitsTest, FindZero) { |
| 173 | + std::vector<uint8_t> v = {5, 0, 1, 7, 1, 9, 0, 3}; |
| 174 | + EXPECT_EQ(find_zero(v, 0), 1U); |
| 175 | + EXPECT_EQ(find_zero(v, 2), 6U); |
| 176 | + EXPECT_EQ(find_zero(v, 7), v.size()); |
| 177 | +} |
| 178 | +} //namespace doris::simd |
0 commit comments