tiny.simd.hashArray

1pub fn hashArray(2    comptime D: type,3    hash: anytype,4    input: []const D.Lane,5    output: []D.Lane,6) void {7    std.debug.assert(input.len == output.len);8    const lanes = D.lane_count;9    var index: usize = 0;10    var remaining = input.len;11    while (remaining >= 4 * lanes) : ({12        index += 4 * lanes;13        remaining -= 4 * lanes;14    }) {15        var first = loadVector(D, input[index + 0 * lanes ..]);16        var second = loadVector(D, input[index + 1 * lanes ..]);17        var third = loadVector(D, input[index + 2 * lanes ..]);18        var fourth = loadVector(D, input[index + 3 * lanes ..]);19        hash.twoVec(D, &first, &second);20        hash.twoVec(D, &third, &fourth);21        storeVector(D, first, output[index + 0 * lanes ..]);22        storeVector(D, second, output[index + 1 * lanes ..]);23        storeVector(D, third, output[index + 2 * lanes ..]);24        storeVector(D, fourth, output[index + 3 * lanes ..]);25    }26    while (remaining >= lanes) : ({27        index += lanes;28        remaining -= lanes;29    }) {30        const value = hash.oneVec(D, loadVector(D, input[index..]));31        storeVector(D, value, output[index..]);32    }33    if (remaining != 0) {34        var tail: [D.lane_count]D.Lane = @splat(0);35        @memcpy(tail[0..remaining], input[index..]);36        const value = hash.oneVec(D, @as(D.Vector, tail));37        const result: [D.lane_count]D.Lane = value;38        @memcpy(output[index..], result[0..remaining]);39    }40}

1pub const hashArray = hash.hashArray;