X-Git-Url: https://wimlib.net/git/?p=wimlib;a=blobdiff_plain;f=src%2Fcompress.c;h=dfaabe6b1c49d42e42ec035cb9de64e5e0b6250a;hp=b25938f15d5dacda8fe590163eefe9483a5b7bef;hb=2254a0fc3f1d7af1151ee83f3458f44339b5028b;hpb=5123a1ae75747ddc4984bfe104c75e3974cede35

diff --git a/src/compress.c b/src/compress.c
index b25938f1..dfaabe6b 100644
--- a/src/compress.c
+++ b/src/compress.c
@@ -237,9 +237,9 @@ huffman_tree_compute_path_lengths(HuffmanNode *base_node, u16 cur_len)
 void
 make_canonical_huffman_code(unsigned num_syms,
 			    unsigned max_codeword_len,
-			    const freq_t * restrict freq_tab,
-			    u8 * restrict lens,
-			    u16 * restrict codewords)
+			    const freq_t freq_tab[restrict],
+			    u8 lens[restrict],
+			    u16 codewords[restrict])
 {
 	/* We require at least 2 possible symbols in the alphabet to produce a
 	 * valid Huffman decoding table. It is allowed that fewer than 2 symbols