Re-visit SHA-1 code

[wimlib] / include / wimlib / lzx.h

diff --git a/include/wimlib/lzx.h b/include/wimlib/lzx.h
index 7104dc14ea91389ca3aff9385ae6dccf59788d4a..ae1c6a9c696ec28bedae3fca69675d48776ac302 100644 (file)
--- a/include/wimlib/lzx.h
+++ b/include/wimlib/lzx.h
@@ -6,6 +6,7 @@
  * */
 
 #include "wimlib/assert.h"
+#include "wimlib/compiler.h"
 #include "wimlib/util.h"
 #include "wimlib/types.h"
 
@@ -122,7 +123,7 @@ extern const u32 lzx_position_base[LZX_MAX_POSITION_SLOTS];
  * the formatted offset without actually looking at the array.
  */
 static inline unsigned
-lzx_get_position_slot_raw(unsigned formatted_offset)
+lzx_get_position_slot_raw(u32 formatted_offset)
 {
        if (formatted_offset >= 196608) {
                return (formatted_offset >> 17) + 34;
@@ -142,7 +143,13 @@ extern unsigned lzx_get_num_main_syms(u32 window_size);
 /* Least-recently used queue for match offsets.  */
 struct lzx_lru_queue {
        u32 R[LZX_NUM_RECENT_OFFSETS];
-};
+}
+#ifdef __x86_64__
+_aligned_attribute(8)  /* Improves performance of LZX compression by 1% - 2%;
+                         specifically, this speeds up
+                         lzx_get_near_optimal_match().  */
+#endif
+;
 
 /* In the LZX format, an offset of n bytes is actually encoded
  * as (n + LZX_OFFSET_OFFSET).  */