X-Git-Url: https://wimlib.net/git/?a=blobdiff_plain;f=src%2Fcompress_common.c;h=8b85d9d55d84703ebfa12a99c4240494937bcc29;hb=7a3c99e3ea8add3fe2eaca37cb53ba4c61500d28;hp=7ca7f5bba312831b9d342af875acaf2c19f144a0;hpb=e6a50e92c221b5c4ce2d86caa1ba2093b20f3ac3;p=wimlib

diff --git a/src/compress_common.c b/src/compress_common.c
index 7ca7f5bb..8b85d9d5 100644
--- a/src/compress_common.c
+++ b/src/compress_common.c
@@ -14,12 +14,11 @@
 #  include "config.h"
 #endif
 
-#include "wimlib/assert.h"
+#include <string.h>
+
 #include "wimlib/compress_common.h"
 #include "wimlib/util.h"
 
-#include <string.h>
-
 /* Given the binary tree node A[subtree_idx] whose children already
  * satisfy the maxheap property, swap the node with its greater child
  * until it is greater than both its children, so that the maxheap
@@ -126,7 +125,7 @@ sort_symbols(unsigned num_syms, const u32 freqs[restrict],
 	 * Tests were done with building the codes for LZX.  Results may
 	 * vary for different compression algorithms...!  */
 
-	num_counters = (DIV_ROUND_UP(num_syms, 4) + 3) & ~3;
+	num_counters = ALIGN(DIV_ROUND_UP(num_syms, 4), 4);
 
 	unsigned counters[num_counters];