+++ /dev/null
-/*
- * lz_extend.h
- *
- * Fast match extension for Lempel-Ziv matchfinding.
- *
- * The author dedicates this file to the public domain.
- * You can do whatever you want with this file.
- */
-
-#ifndef _WIMLIB_LZ_EXTEND_H
-#define _WIMLIB_LZ_EXTEND_H
-
-#include "wimlib/bitops.h"
-#include "wimlib/unaligned.h"
-
-/* Return the number of bytes at @matchptr that match the bytes at @strptr, up
- * to a maximum of @max_len. Initially, @start_len bytes are matched. */
-static inline u32
-lz_extend(const u8 * const strptr, const u8 * const matchptr,
- const u32 start_len, const u32 max_len)
-{
- u32 len = start_len;
-
- if (UNALIGNED_ACCESS_IS_FAST) {
-
- machine_word_t v_word;
-
- if (likely(max_len - len >= 4 * WORDSIZE)) {
-
- #define COMPARE_WORD_STEP \
- v_word = load_word_unaligned(&matchptr[len]) ^ \
- load_word_unaligned(&strptr[len]); \
- if (v_word != 0) \
- goto word_differs; \
- len += WORDSIZE; \
-
- COMPARE_WORD_STEP
- COMPARE_WORD_STEP
- COMPARE_WORD_STEP
- COMPARE_WORD_STEP
- #undef COMPARE_WORD_STEP
- }
-
- while (len + WORDSIZE <= max_len) {
- v_word = load_word_unaligned(&matchptr[len]) ^
- load_word_unaligned(&strptr[len]);
- if (v_word != 0)
- goto word_differs;
- len += WORDSIZE;
- }
-
- while (len < max_len && matchptr[len] == strptr[len])
- len++;
- return len;
-
- word_differs:
- return len + (ffsw(v_word) >> 3);
- } else {
- while (len < max_len && matchptr[len] == strptr[len])
- len++;
- return len;
- }
-}
-
-#endif /* _WIMLIB_LZ_EXTEND_H */