Speed up tail processing when hashing aligned C strings, take two
After encountering the NUL terminator, the word-at-a-time loop exits
and we must hash the remaining bytes. Previously we calculated
the terminator's position and re-loaded the remaining bytes from
the input string. This was slower
On Sun, Mar 31, 2024 at 12:32 PM John Naylor wrote:
>
> Speed up tail processing when hashing aligned C strings
Skink reports valgrind error with
Conditional jump or move depends on uninitialised value(s)
I'll revert this soon to analyze, but first I'd like to see if any
big-endian animals
Speed up tail processing when hashing aligned C strings
After encountering the NUL terminator, the word-at-a-time loop exits
and we must hash the remaining bytes. Previously we calculated the
terminator's position and re-loaded the remaining bytes from the input
string. We already have all the
