1 /**************************************************************************
3 * Copyright 2011 Christian König.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
29 * Functions for fast bitwise access to multiple probably unaligned input buffers
35 #include "pipe/p_compiler.h"
37 #include "util/u_math.h"
38 #include "util/u_pointer.h"
39 #include "util/u_debug.h"
48 const void *const *inputs
;
49 const unsigned *sizes
;
59 struct vl_vlc_compressed
62 struct vl_vlc_entry entry
;
66 * initalize and decompress a lookup table
69 vl_vlc_init_table(struct vl_vlc_entry
*dst
, unsigned dst_size
, const struct vl_vlc_compressed
*src
, unsigned src_size
)
71 unsigned i
, bits
= util_logbase2(dst_size
);
73 assert(dst
&& dst_size
);
74 assert(src
&& src_size
);
76 for (i
=0;i
<dst_size
;++i
) {
81 for(; src_size
> 0; --src_size
, ++src
) {
82 for(i
= 0; i
< (1u << (bits
- src
->entry
.length
)); ++i
)
83 dst
[src
->bitcode
>> (16 - bits
) | i
] = src
->entry
;
88 * switch over to next input buffer
91 vl_vlc_next_input(struct vl_vlc
*vlc
)
93 unsigned len
= vlc
->sizes
[0];
96 assert(vlc
->bytes_left
);
98 if (len
< vlc
->bytes_left
)
99 vlc
->bytes_left
-= len
;
101 len
= vlc
->bytes_left
;
105 vlc
->data
= vlc
->inputs
[0];
106 vlc
->end
= vlc
->data
+ len
;
113 * align the data pointer to the next dword
116 vl_vlc_align_data_ptr(struct vl_vlc
*vlc
)
118 /* align the data pointer */
119 while (vlc
->data
!= vlc
->end
&& pointer_to_uintptr(vlc
->data
) & 3) {
120 vlc
->buffer
|= (uint64_t)*vlc
->data
<< (24 + vlc
->invalid_bits
);
122 vlc
->invalid_bits
-= 8;
127 * fill the bit buffer, so that at least 32 bits are valid
130 vl_vlc_fillbits(struct vl_vlc
*vlc
)
134 /* as long as the buffer needs to be filled */
135 while (vlc
->invalid_bits
> 0) {
136 unsigned bytes_left
= vlc
->end
- vlc
->data
;
138 /* if this input is depleted */
139 if (bytes_left
== 0) {
141 if (vlc
->bytes_left
) {
142 /* go on to next input */
143 vl_vlc_next_input(vlc
);
144 vl_vlc_align_data_ptr(vlc
);
146 /* or give up since we don't have anymore inputs */
149 } else if (bytes_left
>= 4) {
151 /* enough bytes in buffer, read in a whole dword */
152 uint64_t value
= *(const uint32_t*)vlc
->data
;
154 #if !PIPE_ARCH_BIG_ENDIAN
155 value
= util_bswap32(value
);
158 vlc
->buffer
|= value
<< vlc
->invalid_bits
;
160 vlc
->invalid_bits
-= 32;
162 /* buffer is now definitely filled up avoid the loop test */
165 } else while (vlc
->data
< vlc
->end
) {
167 /* not enough bytes left in buffer, read single bytes */
168 vlc
->buffer
|= (uint64_t)*vlc
->data
<< (24 + vlc
->invalid_bits
);
170 vlc
->invalid_bits
-= 8;
176 * initialize vlc structure and start reading from first input buffer
179 vl_vlc_init(struct vl_vlc
*vlc
, unsigned num_inputs
,
180 const void *const *inputs
, const unsigned *sizes
)
188 vlc
->invalid_bits
= 32;
189 vlc
->inputs
= inputs
;
193 for (i
= 0; i
< num_inputs
; ++i
)
194 vlc
->bytes_left
+= sizes
[i
];
196 if (vlc
->bytes_left
) {
197 vl_vlc_next_input(vlc
);
198 vl_vlc_align_data_ptr(vlc
);
199 vl_vlc_fillbits(vlc
);
204 * number of bits still valid in bit buffer
206 static inline unsigned
207 vl_vlc_valid_bits(struct vl_vlc
*vlc
)
209 return 32 - vlc
->invalid_bits
;
213 * number of bits left over all inbut buffers
215 static inline unsigned
216 vl_vlc_bits_left(struct vl_vlc
*vlc
)
218 signed bytes_left
= vlc
->end
- vlc
->data
;
219 bytes_left
+= vlc
->bytes_left
;
220 return bytes_left
* 8 + vl_vlc_valid_bits(vlc
);
224 * get num_bits from bit buffer without removing them
226 static inline unsigned
227 vl_vlc_peekbits(struct vl_vlc
*vlc
, unsigned num_bits
)
229 assert(vl_vlc_valid_bits(vlc
) >= num_bits
|| vlc
->data
>= vlc
->end
);
230 return vlc
->buffer
>> (64 - num_bits
);
234 * remove num_bits from bit buffer
237 vl_vlc_eatbits(struct vl_vlc
*vlc
, unsigned num_bits
)
239 assert(vl_vlc_valid_bits(vlc
) >= num_bits
);
241 vlc
->buffer
<<= num_bits
;
242 vlc
->invalid_bits
+= num_bits
;
246 * get num_bits from bit buffer with removing them
248 static inline unsigned
249 vl_vlc_get_uimsbf(struct vl_vlc
*vlc
, unsigned num_bits
)
253 assert(vl_vlc_valid_bits(vlc
) >= num_bits
);
255 value
= vlc
->buffer
>> (64 - num_bits
);
256 vl_vlc_eatbits(vlc
, num_bits
);
262 * treat num_bits as signed value and remove them from bit buffer
265 vl_vlc_get_simsbf(struct vl_vlc
*vlc
, unsigned num_bits
)
269 assert(vl_vlc_valid_bits(vlc
) >= num_bits
);
271 value
= ((int64_t)vlc
->buffer
) >> (64 - num_bits
);
272 vl_vlc_eatbits(vlc
, num_bits
);
278 * lookup a value and length in a decompressed table
281 vl_vlc_get_vlclbf(struct vl_vlc
*vlc
, const struct vl_vlc_entry
*tbl
, unsigned num_bits
)
283 tbl
+= vl_vlc_peekbits(vlc
, num_bits
);
284 vl_vlc_eatbits(vlc
, tbl
->length
);
289 * fast forward search for a specific byte value
291 static inline boolean
292 vl_vlc_search_byte(struct vl_vlc
*vlc
, unsigned num_bits
, uint8_t value
)
294 /* make sure we are on a byte boundary */
295 assert((vl_vlc_valid_bits(vlc
) % 8) == 0);
296 assert(num_bits
== ~0u || (num_bits
% 8) == 0);
298 /* deplete the bit buffer */
299 while (vl_vlc_valid_bits(vlc
) > 0) {
301 if (vl_vlc_peekbits(vlc
, 8) == value
) {
302 vl_vlc_fillbits(vlc
);
306 vl_vlc_eatbits(vlc
, 8);
308 if (num_bits
!= ~0u) {
315 /* deplete the byte buffers */
318 /* if this input is depleted */
319 if (vlc
->data
== vlc
->end
) {
321 /* go on to next input */
322 vl_vlc_next_input(vlc
);
324 /* or give up since we don't have anymore inputs */
328 if (*vlc
->data
== value
) {
329 vl_vlc_align_data_ptr(vlc
);
330 vl_vlc_fillbits(vlc
);
335 if (num_bits
!= ~0u) {
338 vl_vlc_align_data_ptr(vlc
);
346 * remove num_bits bits starting at pos from the bitbuffer
349 vl_vlc_removebits(struct vl_vlc
*vlc
, unsigned pos
, unsigned num_bits
)
351 uint64_t lo
= (vlc
->buffer
& (~0UL >> (pos
+ num_bits
))) << num_bits
;
352 uint64_t hi
= (vlc
->buffer
& (~0UL << (64 - pos
)));
353 vlc
->buffer
= lo
| hi
;
354 vlc
->invalid_bits
+= num_bits
;
358 * limit the number of bits left for fetching
361 vl_vlc_limit(struct vl_vlc
*vlc
, unsigned bits_left
)
363 assert(bits_left
<= vl_vlc_bits_left(vlc
));
365 vl_vlc_fillbits(vlc
);
366 if (bits_left
< vl_vlc_valid_bits(vlc
)) {
367 vlc
->invalid_bits
= 32 - bits_left
;
368 vlc
->buffer
&= ~0L << (vlc
->invalid_bits
+ 32);
369 vlc
->end
= vlc
->data
;
372 assert((bits_left
- vl_vlc_valid_bits(vlc
)) % 8 == 0);
373 vlc
->bytes_left
= (bits_left
- vl_vlc_valid_bits(vlc
)) / 8;
374 if (vlc
->bytes_left
< (vlc
->end
- vlc
->data
)) {
375 vlc
->end
= vlc
->data
+ vlc
->bytes_left
;
378 vlc
->bytes_left
-= vlc
->end
- vlc
->data
;
382 #endif /* vl_vlc_h */