Update XZ Utils to 5.0.4 (third_party)

src/liblzma/lz/lz_encoder_hash.h

 ///////////////////////////////////////////////////////////////////////////////
 //
 /// \file       lz_encoder_hash.h
 /// \brief      Hash macros for match finders
 //
 //  Author:     Igor Pavlov
 //
 //  This file has been put into the public domain.
 //  You can do whatever you want with this file.
 //
@@ skipping 21 matching lines @@
 #define HASH_3_MASK (HASH_3_SIZE - 1)
 #define HASH_4_MASK (HASH_4_SIZE - 1)
 
 #define FIX_3_HASH_SIZE (HASH_2_SIZE)
 #define FIX_4_HASH_SIZE (HASH_2_SIZE + HASH_3_SIZE)
 #define FIX_5_HASH_SIZE (HASH_2_SIZE + HASH_3_SIZE + HASH_4_SIZE)
 
 // Endianness doesn't matter in hash_2_calc() (no effect on the output).
 #ifdef TUKLIB_FAST_UNALIGNED_ACCESS
 #       define hash_2_calc() \
-                const uint32_t hash_value = *(const uint16_t *)(cur);
+                const uint32_t hash_value = *(const uint16_t *)(cur)
 #else
 #       define hash_2_calc() \
                 const uint32_t hash_value \
                         = (uint32_t)(cur[0]) | ((uint32_t)(cur[1]) << 8)
 #endif
 
 #define hash_3_calc() \
         const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
         const uint32_t hash_2_value = temp & HASH_2_MASK; \
         const uint32_t hash_value \
@@ skipping 46 matching lines @@
 
 #define mt_hash_4_calc() \
         const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
         const uint32_t hash_2_value = temp & HASH_2_MASK; \
         const uint32_t hash_3_value \
                         = (temp ^ ((uint32_t)(cur[2]) << 8)) & HASH_3_MASK; \
         const uint32_t hash_4_value = (temp ^ ((uint32_t)(cur[2]) << 8) ^ \
                         (hash_table[cur[3]] << 5)) & HASH_4_MASK
 
 #endif