Repository navigation
GH-54920: [C++][Compute] Support unsigned indices in inverse_permutation and scatter - #55169
zanmato1984 wants to merge 4 commits into
Conversation
|
|
There was a problem hiding this comment.
🟢 Approval recommended
Static review found no blocking issues in dispatch, bounds checks, or validity generation, with added tests covering key boundary cases.
No open issues 🎉
What changed in this PR
Adds unsigned integer support to C++ compute functions inverse_permutation and scatter, addressing GH-54920 while reducing generated code size.
Changes:
- Accept signed and unsigned indices, and allow unsigned inverse-permutation outputs.
- Share input processing and validity generation by integer width while preserving bounds checks.
- Expand boundary, sliced-array, and chunked-array tests and update public documentation.
| File | Description |
|---|---|
python/pyarrow/_compute.pyx |
Document unsigned inverse-permutation output support. |
docs/source/cpp/compute.rst |
List integer input and output support. |
cpp/src/arrow/compute/kernels/vector_swizzle.cc |
Add unsigned support and consolidate kernel implementations. |
cpp/src/arrow/compute/kernels/vector_swizzle_test.cc |
Expand integer-type and boundary-case coverage. |
cpp/src/arrow/compute/api_vector.h |
Document signed and unsigned integer support. |
Review effort: Balanced
| for (const auto& type : IntTypes()) { | ||
| auto indices = ArrayFromJSON(type, "[42, 2, null, 0, 1, 42]")->Slice(1, 4); | ||
| auto expected = ArrayFromJSON(type, "[2, 3, 0, null]"); | ||
| AssertInversePermutation(indices, -1, type, expected, false); |
There was a problem hiding this comment.
Can we make function parameters more explicit?
| AssertInversePermutation(indices, -1, type, expected, false); | |
| AssertInversePermutation(indices, /*xxx=*/ -1, type, expected, /*yyy=*/ false); |
There was a problem hiding this comment.
Added the parameter-name comments to both calls, and checked the other new tests for similar cases.
| Datum(ChunkedArrayFromJSON(type, {"[]", "[" + invalid_index + "]"}))}) { | ||
| ASSERT_RAISES_WITH_MESSAGE( | ||
| IndexError, "Index error: Index out of bounds: " + invalid_index, | ||
| InversePermutation(indices, /*max_index=*/1, /*output_type=*/int64())); |
There was a problem hiding this comment.
Perhaps max_index=41 to make sure that boundary cases are treated properly?
There was a problem hiding this comment.
Changed to max_index = 41, so index 42 is exactly one past the allowed maximum. The negative-index and large-uint64 checks are preserved.
| // Keep it separate from the indexed writes, and generate whole bitmap bytes | ||
| // instead of clearing one bit at a time for every missing destination. | ||
| template <typename OutputCType> | ||
| ARROW_NOINLINE Status InversePermutationValidity(KernelContext* ctx, |
There was a problem hiding this comment.
Return a Result<std::shared_ptr<Buffer>> here?
There was a problem hiding this comment.
Changed to return Result<std::shared_ptr<Buffer>>, removing the output parameter.
| } | ||
| ARROW_ASSIGN_OR_RAISE(*validity_buf, ctx->AllocateBitmap(output_length)); | ||
| auto* validity = (*validity_buf)->mutable_data(); | ||
| bit_util::SetBitmap(validity, 0, offset); |
There was a problem hiding this comment.
AllocateBitmap should already zero-initialize the bitmap, so I don't think this is necessary.
There was a problem hiding this comment.
This call sets the already-valid prefix [0, offset) to ones, rather than zeroing it. The 0 is the starting bit offset. I kept the call and added /*offset=*/0 and /*length=*/offset to make that distinction explicit.
| // Avoid per-block validity dispatch when every input index is valid. | ||
| if (!span.MayHaveNulls()) { |
There was a problem hiding this comment.
Instead of special-casing this, perhaps rewrite indices visiting using VisitBitRuns?
There was a problem hiding this comment.
Switched to VisitBitRuns, removing the separate no-null loop. In isolated inverse-permutation benchmarks on Apple M4 with Clang/O2, the traversal change gave about 1.5–1.9× speedup with 50% random nulls, but about 2.7× runtime with strictly alternating nulls. The unified traversal therefore has a known performance trade-off.
| {InputType(match::Integer())}, OutputType(ResolveInversePermutationOutputType)); | ||
| kernel.init = InversePermutationState::Init; | ||
| kernel.exec = [](KernelContext* ctx, const ExecSpan& span, ExecResult* result) { | ||
| const auto exec = GenerateInteger<UnsignedInversePermutation, void, ArrayKernelExec>( |
There was a problem hiding this comment.
Sounds almost like we would like a GenerateInteger that takes a transformation function for the input type?
There was a problem hiding this comment.
That looks reasonable. I'll review #55291 and adapt this code to the shared generator once it lands.
There was a problem hiding this comment.
Rebased onto main and switched both the array and chunked dispatch paths to GenerateKernelExec with TypeIdToUnsigned, removing the local adapters.
zanmato1984
left a comment
There was a problem hiding this comment.
Thanks for the detailed review and helpful suggestions! I've addressed the comments below, and I'll review #55291 as well.
| for (const auto& type : IntTypes()) { | ||
| auto indices = ArrayFromJSON(type, "[42, 2, null, 0, 1, 42]")->Slice(1, 4); | ||
| auto expected = ArrayFromJSON(type, "[2, 3, 0, null]"); | ||
| AssertInversePermutation(indices, -1, type, expected, false); |
There was a problem hiding this comment.
Added the parameter-name comments to both calls, and checked the other new tests for similar cases.
| Datum(ChunkedArrayFromJSON(type, {"[]", "[" + invalid_index + "]"}))}) { | ||
| ASSERT_RAISES_WITH_MESSAGE( | ||
| IndexError, "Index error: Index out of bounds: " + invalid_index, | ||
| InversePermutation(indices, /*max_index=*/1, /*output_type=*/int64())); |
There was a problem hiding this comment.
Changed to max_index = 41, so index 42 is exactly one past the allowed maximum. The negative-index and large-uint64 checks are preserved.
| // Keep it separate from the indexed writes, and generate whole bitmap bytes | ||
| // instead of clearing one bit at a time for every missing destination. | ||
| template <typename OutputCType> | ||
| ARROW_NOINLINE Status InversePermutationValidity(KernelContext* ctx, |
There was a problem hiding this comment.
Changed to return Result<std::shared_ptr<Buffer>>, removing the output parameter.
| } | ||
| ARROW_ASSIGN_OR_RAISE(*validity_buf, ctx->AllocateBitmap(output_length)); | ||
| auto* validity = (*validity_buf)->mutable_data(); | ||
| bit_util::SetBitmap(validity, 0, offset); |
There was a problem hiding this comment.
This call sets the already-valid prefix [0, offset) to ones, rather than zeroing it. The 0 is the starting bit offset. I kept the call and added /*offset=*/0 and /*length=*/offset to make that distinction explicit.
| // Avoid per-block validity dispatch when every input index is valid. | ||
| if (!span.MayHaveNulls()) { |
There was a problem hiding this comment.
Switched to VisitBitRuns, removing the separate no-null loop. In isolated inverse-permutation benchmarks on Apple M4 with Clang/O2, the traversal change gave about 1.5–1.9× speedup with 50% random nulls, but about 2.7× runtime with strictly alternating nulls. The unified traversal therefore has a known performance trade-off.
| {InputType(match::Integer())}, OutputType(ResolveInversePermutationOutputType)); | ||
| kernel.init = InversePermutationState::Init; | ||
| kernel.exec = [](KernelContext* ctx, const ExecSpan& span, ExecResult* result) { | ||
| const auto exec = GenerateInteger<UnsignedInversePermutation, void, ArrayKernelExec>( |
There was a problem hiding this comment.
That looks reasonable. I'll review #55291 and adapt this code to the shared generator once it lands.
…atter Signed-off-by: Rossi Sun <zanmato1984@gmail.com>
Signed-off-by: Rossi Sun <zanmato1984@gmail.com>
Signed-off-by: Rossi Sun <zanmato1984@gmail.com>
0b0b62c to
4580b18
Compare
pitrou
left a comment
There was a problem hiding this comment.
LGTM, just two minor questions / comments
There was a problem hiding this comment.
This test is superseded by IndexBounds below, no?
There was a problem hiding this comment.
Yes. I've consolidated these checks into IndexBounds, including positive out-of-bounds indices for both signed and unsigned types.
| // Keep output execution specialized so the loops remain inlineable. Sharing | ||
| // output signedness can cause aggressive outlining and regress throughput. |
There was a problem hiding this comment.
I'm not sure what the comment alludes to ("Sharing output signedness")?
There was a problem hiding this comment.
This referred to an earlier experiment with sharing the output handling, which isn't part of this PR. I've removed the comment.
Rationale for this change
inverse_permutationandscattercurrently accept only signed integer indices, requiring unnecessary casts for unsigned arrays. This PR adds unsigned support while reducing generated code size.What changes are included in this PR?
Are these changes tested?
Added unit tests for unsigned types, index bounds, sliced/chunked inputs, and validity bitmap boundaries.
Are there any user-facing changes?
Unsigned integer indices are now accepted. For example, inverse permutation of uint8
[2, null, 0, 1]returns uint8[2, 3, 0, null].No breaking API changes.
Was AI used for this PR?
The changes were thoroughly reviewed by a human with AI assistance.
PR code and description written by:
Reviewed before submission by:
inverse_permutationandscattershould accept unsigned integers #54920