repIndex         1142 lib/zstd/compress.c 		const U32 repIndex = curr + 1 - offset_1; /* offset_1 expected <= curr +1 */
repIndex         1143 lib/zstd/compress.c 		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
repIndex         1144 lib/zstd/compress.c 		const BYTE *repMatch = repBase + repIndex;
repIndex         1148 lib/zstd/compress.c 		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
repIndex         1150 lib/zstd/compress.c 			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex         1429 lib/zstd/compress.c 		const U32 repIndex = curr + 1 - offset_1; /* offset_1 expected <= curr +1 */
repIndex         1430 lib/zstd/compress.c 		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
repIndex         1431 lib/zstd/compress.c 		const BYTE *repMatch = repBase + repIndex;
repIndex         1435 lib/zstd/compress.c 		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
repIndex         1437 lib/zstd/compress.c 			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex         2095 lib/zstd/compress.c 			const U32 repIndex = (U32)(curr + 1 - offset_1);
repIndex         2096 lib/zstd/compress.c 			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
repIndex         2097 lib/zstd/compress.c 			const BYTE *const repMatch = repBase + repIndex;
repIndex         2098 lib/zstd/compress.c 			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
repIndex         2101 lib/zstd/compress.c 					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex         2129 lib/zstd/compress.c 					const U32 repIndex = (U32)(curr - offset_1);
repIndex         2130 lib/zstd/compress.c 					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
repIndex         2131 lib/zstd/compress.c 					const BYTE *const repMatch = repBase + repIndex;
repIndex         2132 lib/zstd/compress.c 					if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
repIndex         2135 lib/zstd/compress.c 							const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex         2164 lib/zstd/compress.c 						const U32 repIndex = (U32)(curr - offset_1);
repIndex         2165 lib/zstd/compress.c 						const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
repIndex         2166 lib/zstd/compress.c 						const BYTE *const repMatch = repBase + repIndex;
repIndex         2167 lib/zstd/compress.c 						if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
repIndex         2170 lib/zstd/compress.c 								const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex         2219 lib/zstd/compress.c 			const U32 repIndex = (U32)((ip - base) - offset_2);
repIndex         2220 lib/zstd/compress.c 			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
repIndex         2221 lib/zstd/compress.c 			const BYTE *const repMatch = repBase + repIndex;
repIndex         2222 lib/zstd/compress.c 			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
repIndex         2225 lib/zstd/compress.c 					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex          750 lib/zstd/zstd_opt.h 				const U32 repIndex = (U32)(curr - repCur);
repIndex          751 lib/zstd/zstd_opt.h 				const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
repIndex          752 lib/zstd/zstd_opt.h 				const BYTE *const repMatch = repBase + repIndex;
repIndex          754 lib/zstd/zstd_opt.h 				    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
repIndex          757 lib/zstd/zstd_opt.h 					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
repIndex          863 lib/zstd/zstd_opt.h 					const U32 repIndex = (U32)(curr + cur - repCur);
repIndex          864 lib/zstd/zstd_opt.h 					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
repIndex          865 lib/zstd/zstd_opt.h 					const BYTE *const repMatch = repBase + repIndex;
repIndex          867 lib/zstd/zstd_opt.h 					    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
repIndex          870 lib/zstd/zstd_opt.h 						const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;