@@ -109,33 +109,25 @@ namespace ojph {
109109 }
110110 }
111111
112+ // ////////////////////////////////////////////////////////////////////////
113+ static inline
114+ void bb_put_zeros (bit_write_buf *bbp, int num_zeros,
115+ mem_elastic_allocator *elastic,
116+ coded_lists*& cur_coded_list, ui32& ph_bytes)
117+ {
118+ for (int i = num_zeros; i > 0 ; --i)
119+ bb_put_bit (bbp, 0 , elastic, cur_coded_list, ph_bytes);
120+ }
121+
112122 // ////////////////////////////////////////////////////////////////////////
113123 static inline
114124 void bb_put_bits (bit_write_buf *bbp, ui32 data, int num_bits,
115125 mem_elastic_allocator *elastic,
116126 coded_lists*& cur_coded_list, ui32& ph_bytes)
117127 {
118- // assert(num_bits <= 32);
119- for (int i = num_bits - 1 ; i >= 0 ; --i)
128+ assert (num_bits <= 32 );
129+ for (int i = num_bits - 1 ; i >= 0 ; --i)
120130 bb_put_bit (bbp, data >> i, elastic, cur_coded_list, ph_bytes);
121- // while (num_bits) {
122- // int tx_bits = num_bits < bbp->avail_bits ? num_bits : bbp->avail_bits;
123- // bbp->tmp |= (data >> (num_bits - tx_bits)) & ((1 << tx_bits) - 1);
124- // bbp->avail_bits -= tx_bits;
125- // if (bbp->avail_bits <= 0)
126- // {
127- // bbp->avail_bits = 8 - (bbp->tmp != 0xFF ? 0 : 1);
128- // bbp->buf[bbp->buf_size - bbp->avail_size] = (ui8)(bbp->tmp & 0xFF);
129- // bbp->tmp = 0;
130- // --bbp->avail_size;
131- // if (bbp->avail_size == 0)
132- // {
133- // bb_expand_buf(bbp, elastic, cur_coded_list->next_list);
134- // cur_coded_list = cur_coded_list->next_list;
135- // ph_bytes += bit_buffer::needed;
136- // }
137- // }
138- // }
139131 }
140132
141133 // ////////////////////////////////////////////////////////////////////////
0 commit comments