]> git.ipfire.org Git - thirdparty/samba.git/commitdiff
lib:compression: Fix code spelling
authorJoseph Sutton <josephsutton@catalyst.net.nz>
Mon, 4 Sep 2023 04:43:20 +0000 (16:43 +1200)
committerAndrew Bartlett <abartlet@samba.org>
Mon, 11 Sep 2023 02:42:41 +0000 (02:42 +0000)
Signed-off-by: Joseph Sutton <josephsutton@catalyst.net.nz>
Reviewed-by: Andrew Bartlett <abartlet@samba.org>
lib/compression/lzxpress_huffman.c

index 4d69cc406ec5c9c022fb6880e29c1ac144505d41..30744332e6e9029fcb11c6d1796a143232db53fd 100644 (file)
@@ -568,7 +568,7 @@ static int generate_huffman_codes(struct huffman_node *leaf_nodes,
                        if (tail_branch == n_leaves) {
                                /*
                                 * We're not getting here, no way, never ever.
-                                * Unless we made a terible mistake.
+                                * Unless we made a terrible mistake.
                                 *
                                 * That is, in a binary tree with n leaves,
                                 * there are ALWAYS n-1 internal nodes.
@@ -607,7 +607,7 @@ static int generate_huffman_codes(struct huffman_node *leaf_nodes,
                }
 
                /*
-                * requantize by halfing and rounding up, so that small counts
+                * requantize by halving and rounding up, so that small counts
                 * become relatively bigger. This will lead to a flatter tree.
                 */
                for (i = 0; i < n_leaves; i++) {
@@ -1739,11 +1739,11 @@ static ssize_t lzx_huffman_decompress_block(struct bitstream *input,
         * # input bytes are read for match lengths.
         *
         * Note that we *don't* specifically check for the EOF marker (symbol
-        * 256) in this loop, because the precondition for stopping for the
+        * 256) in this loop, because the precondition for stopping for the
         * EOF marker is that the output buffer is full (otherwise, you
         * wouldn't know which 256 is EOF, rather than an actual symbol), and
         * we *always* want to stop when the buffer is full. So we work out if
-        * there is an EOF in in another loop after we stop writing.
+        * there is an EOF in another loop after we stop writing.
         */
 
        index = 0;