From eb52e2f45e91bfea0531b2e23ca13c44a0837b83 Mon Sep 17 00:00:00 2001 From: Yann Collet Date: Sat, 30 Dec 2017 11:13:52 +0100 Subject: [PATCH] simplify ZSTD_preserveUnsortedMark() implementation since no compiler attempts to auto-vectorize it. --- lib/compress/zstd_lazy.c | 25 ++++++------------------- 1 file changed, 6 insertions(+), 19 deletions(-) diff --git a/lib/compress/zstd_lazy.c b/lib/compress/zstd_lazy.c index 1ed63b9d..2688a78d 100644 --- a/lib/compress/zstd_lazy.c +++ b/lib/compress/zstd_lazy.c @@ -21,29 +21,16 @@ But candidate 1 cannot hide a large tree of candidates, so it's a moderate loss. The benefit is that ZSTD_DUBT_UNSORTED_MARK cannot be misdhandled by a table re-use using a different strategy */ -#define ZSTD_ROWSIZE 16 -/*! ZSTD_preserveUnsortedMark_internal() : - * Helps auto-vectorization */ -static void ZSTD_preserveUnsortedMark_internal (U32* const table, int const nbRows, U32 const reducerValue) -{ - int cellNb = 0; - int rowNb; - for (rowNb=0 ; rowNb < nbRows ; rowNb++) { - int column; - for (column=0; column