You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
While this avoids writing into result out of bounds, it still reads from the left and right arrays at out of bounds indices and valgrind complains about that. I propose to rewrite the logic to use chunked iteration, with a scalar loop for the remainder, similar to the change for arithmetic kernels in ARROW-10914.
The simd compare kernels use the following pattern to handle the remainder that is not a multiple of the number of vector lanes:
While this avoids writing into result out of bounds, it still reads from the
left
andright
arrays at out of bounds indices and valgrind complains about that. I propose to rewrite the logic to use chunked iteration, with a scalar loop for the remainder, similar to the change for arithmetic kernels in ARROW-10914.Reporter: Jörn Horstmann / @jhorstmann
Assignee: Jörn Horstmann / @jhorstmann
PRs and other links:
Note: This issue was originally created as ARROW-10990. Please see the migration documentation for further details.
The text was updated successfully, but these errors were encountered: