bitstream: Trivial coding style fixes.

[paraslash.git] / bitstream.c

diff --git a/bitstream.c b/bitstream.c
index d727896fbe107ce56451483074ffd6279268cbe2..00970261805f1dfc7427a8123de110ecde932b03 100644 (file)
--- a/bitstream.c
+++ b/bitstream.c
@@ -69,8 +69,8 @@ static int build_table(struct vlc *vlc, int table_nb_bits, int nb_codes,
        table = &vlc->table[table_index];
 
        for (i = 0; i < table_size; i++) {
-               table[i][1] = 0;        //bits
-               table[i][0] = -1;       //codes
+               table[i][1] = 0; /* bits */
+               table[i][0] = -1; /* codes */
        }
 
        /* map codes and compute auxiliary table sizes */
@@ -95,7 +95,7 @@ static int build_table(struct vlc *vlc, int table_nb_bits, int nb_codes,
                                        PARA_EMERG_LOG("incorrect code\n");
                                        exit(EXIT_FAILURE);
                                }
-                               table[j][1] = n;        //bits
+                               table[j][1] = n; /* bits */
                                table[j][0] = symbol;
                                j++;
                        }
@@ -103,28 +103,28 @@ static int build_table(struct vlc *vlc, int table_nb_bits, int nb_codes,
                        n -= table_nb_bits;
                        j = (code >> n) & ((1 << table_nb_bits) - 1);
                        /* compute table size */
-                       n1 = -table[j][1];      //bits
+                       n1 = -table[j][1]; /* bits */
                        if (n > n1)
                                n1 = n;
-                       table[j][1] = -n1;      //bits
+                       table[j][1] = -n1; /* bits */
                }
        }
 
        /* fill auxiliary tables recursively */
        for (i = 0; i < table_size; i++) {
-               n = table[i][1];        //bits
+               n = table[i][1]; /* bits */
                if (n < 0) {
                        n = -n;
                        if (n > table_nb_bits) {
                                n = table_nb_bits;
-                               table[i][1] = -n;       //bits
+                               table[i][1] = -n; /* bits */
                        }
                        idx = build_table(vlc, n, nb_codes, bits, codes,
                                codes_size, (code_prefix << table_nb_bits) | i,
                                n_prefix + table_nb_bits);
                        /* vlc->table might have changed */
                        table = &vlc->table[table_index];
-                       table[i][0] = idx;      //code
+                       table[i][0] = idx; /* code */
                }
        }
        return table_index;