| 40 | |
| 41 | template <int64_t NBYTES> |
| 42 | void CheckBitmapWordAlign(const uint8_t* data, int64_t bit_offset, int64_t length, |
| 43 | BitmapWordAlignParams expected) { |
| 44 | auto p = BitmapWordAlign<static_cast<uint64_t>(NBYTES)>(data, bit_offset, length); |
| 45 | |
| 46 | ASSERT_EQ(p.leading_bits, expected.leading_bits); |
| 47 | ASSERT_EQ(p.trailing_bits, expected.trailing_bits); |
| 48 | if (p.trailing_bits > 0) { |
| 49 | // Only relevant if trailing_bits > 0 |
| 50 | ASSERT_EQ(p.trailing_bit_offset, expected.trailing_bit_offset); |
| 51 | } |
| 52 | ASSERT_EQ(p.aligned_bits, expected.aligned_bits); |
| 53 | ASSERT_EQ(p.aligned_words, expected.aligned_words); |
| 54 | if (p.aligned_bits > 0) { |
| 55 | // Only relevant if aligned_bits > 0 |
| 56 | ASSERT_EQ(p.aligned_start, expected.aligned_start); |
| 57 | } |
| 58 | |
| 59 | // Invariants |
| 60 | ASSERT_LT(p.leading_bits, NBYTES * 8); |
| 61 | ASSERT_LT(p.trailing_bits, NBYTES * 8); |
| 62 | ASSERT_EQ(p.leading_bits + p.aligned_bits + p.trailing_bits, length); |
| 63 | ASSERT_EQ(p.aligned_bits, NBYTES * 8 * p.aligned_words); |
| 64 | if (p.aligned_bits > 0) { |
| 65 | ASSERT_EQ(reinterpret_cast<size_t>(p.aligned_start) & (NBYTES - 1), 0); |
| 66 | } |
| 67 | if (p.trailing_bits > 0) { |
| 68 | ASSERT_EQ(p.trailing_bit_offset, bit_offset + p.leading_bits + p.aligned_bits); |
| 69 | ASSERT_EQ(p.trailing_bit_offset + p.trailing_bits, bit_offset + length); |
| 70 | } |
| 71 | } |
| 72 | |
| 73 | arrow::Result<std::shared_ptr<Array>> CreateUnalignedArray(const Array& array) { |
| 74 | // Slicing by 1 would create an invalid array if the type was wider than |
nothing calls this directly
no outgoing calls
no test coverage detected