blob: ca42850df3244499469ef9358a4ccd05e3a0ae2c [file] [log] [blame]
Yann Colletb1f3f4b2015-10-18 22:18:32 +01001/* ******************************************************************
2 bitstream
Yann Colletae7aa062016-02-03 02:46:46 +01003 Part of FSE library
Yann Colletb1f3f4b2015-10-18 22:18:32 +01004 header file (to include)
Yann Collet202082f2017-04-28 16:56:39 -07005 Copyright (C) 2013-2017, Yann Collet.
Yann Colletb1f3f4b2015-10-18 22:18:32 +01006
7 BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
8
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are
11 met:
12
13 * Redistributions of source code must retain the above copyright
14 notice, this list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above
16 copyright notice, this list of conditions and the following disclaimer
17 in the documentation and/or other materials provided with the
18 distribution.
19
20 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31
32 You can contact the author at :
33 - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
Yann Colletb1f3f4b2015-10-18 22:18:32 +010034****************************************************************** */
35#ifndef BITSTREAM_H_MODULE
36#define BITSTREAM_H_MODULE
37
38#if defined (__cplusplus)
39extern "C" {
40#endif
41
42
43/*
Yann Collet01e5b952016-03-19 14:14:31 +010044* This API consists of small unitary functions, which must be inlined for best performance.
Yann Colletb1f3f4b2015-10-18 22:18:32 +010045* Since link-time-optimization is not available for all compilers,
46* these functions are defined into a .h to be included.
47*/
48
Yann Colletae7aa062016-02-03 02:46:46 +010049/*-****************************************
50* Dependencies
Yann Colletb1f3f4b2015-10-18 22:18:32 +010051******************************************/
Yann Collet977f1f32016-01-21 15:38:47 +010052#include "mem.h" /* unaligned access routines */
53#include "error_private.h" /* error codes and messages */
Yann Colletb1f3f4b2015-10-18 22:18:32 +010054
55
Yann Collet202082f2017-04-28 16:56:39 -070056/*-*************************************
57* Debug
58***************************************/
59#if defined(BIT_DEBUG) && (BIT_DEBUG>=1)
60# include <assert.h>
61#else
62# define assert(condition) ((void)0)
63#endif
64
65
Yann Collet74bd1192016-03-26 17:50:26 +010066/*=========================================
67* Target specific
68=========================================*/
69#if defined(__BMI__) && defined(__GNUC__)
70# include <immintrin.h> /* support for bextr (experimental) */
71#endif
72
Sean Purcelld44703d2017-03-01 14:36:25 -080073#define STREAM_ACCUMULATOR_MIN_32 25
74#define STREAM_ACCUMULATOR_MIN_64 57
75#define STREAM_ACCUMULATOR_MIN ((U32)(MEM_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
Yann Collet74bd1192016-03-26 17:50:26 +010076
Yann Colletae7aa062016-02-03 02:46:46 +010077/*-******************************************
78* bitStream encoding API (write forward)
Yann Colletb1f3f4b2015-10-18 22:18:32 +010079********************************************/
Yann Colletd1d210f2016-03-19 12:12:07 +010080/* bitStream can mix input from multiple sources.
81* A critical property of these streams is that they encode and decode in **reverse** direction.
82* So the first bit sequence you add will be the last to be read, like a LIFO stack.
Yann Colletb1f3f4b2015-10-18 22:18:32 +010083*/
84typedef struct
85{
86 size_t bitContainer;
Yann Colletf39a6732017-05-01 09:56:03 -070087 unsigned bitPos;
Yann Colletb1f3f4b2015-10-18 22:18:32 +010088 char* startPtr;
89 char* ptr;
90 char* endPtr;
91} BIT_CStream_t;
92
Yann Colletae7aa062016-02-03 02:46:46 +010093MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* dstBuffer, size_t dstCapacity);
Yann Colletb1f3f4b2015-10-18 22:18:32 +010094MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
95MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC);
96MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC);
97
Yann Collet01e5b952016-03-19 14:14:31 +010098/* Start with initCStream, providing the size of buffer to write into.
99* bitStream will never write outside of this buffer.
Yann Collet1032fbe2016-05-11 18:30:24 +0200100* `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100101*
Yann Collet01e5b952016-03-19 14:14:31 +0100102* bits are first added to a local register.
103* Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
104* Writing data into memory is an explicit operation, performed by the flushBits function.
105* Hence keep track how many bits are potentially stored into local register to avoid register overflow.
106* After a flushBits, a maximum of 7 bits might still be stored into local register.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100107*
Yann Collet01e5b952016-03-19 14:14:31 +0100108* Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100109*
Yann Collet01e5b952016-03-19 14:14:31 +0100110* Last operation is to close the bitStream.
111* The function returns the final size of CStream in bytes.
112* If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100113*/
114
115
Yann Colletae7aa062016-02-03 02:46:46 +0100116/*-********************************************
117* bitStream decoding API (read backward)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100118**********************************************/
119typedef struct
120{
121 size_t bitContainer;
122 unsigned bitsConsumed;
123 const char* ptr;
124 const char* start;
Yann Colletf39a6732017-05-01 09:56:03 -0700125 const char* limitPtr;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100126} BIT_DStream_t;
127
128typedef enum { BIT_DStream_unfinished = 0,
129 BIT_DStream_endOfBuffer = 1,
130 BIT_DStream_completed = 2,
131 BIT_DStream_overflow = 3 } BIT_DStream_status; /* result of BIT_reloadDStream() */
132 /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
133
134MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
135MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
136MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);
137MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);
138
139
Yann Collet01e5b952016-03-19 14:14:31 +0100140/* Start by invoking BIT_initDStream().
141* A chunk of the bitStream is then stored into a local register.
142* Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
143* You can then retrieve bitFields stored into the local register, **in reverse order**.
144* Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
Yann Collet1032fbe2016-05-11 18:30:24 +0200145* A reload guarantee a minimum of ((8*sizeof(bitD->bitContainer))-7) bits when its result is BIT_DStream_unfinished.
Yann Collet01e5b952016-03-19 14:14:31 +0100146* Otherwise, it can be less than that, so proceed accordingly.
Yann Colletb21ce152016-03-24 01:27:55 +0100147* Checking if DStream has reached its end can be performed with BIT_endOfDStream().
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100148*/
149
150
Yann Colletae7aa062016-02-03 02:46:46 +0100151/*-****************************************
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100152* unsafe API
153******************************************/
154MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
155/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
156
157MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC);
158/* unsafe version; does not check buffer overflow */
159
160MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
161/* faster, but works only if nbBits >= 1 */
162
163
164
Yann Colletae7aa062016-02-03 02:46:46 +0100165/*-**************************************************************
Yann Collet6cf45da2016-03-23 14:18:37 +0100166* Internal functions
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100167****************************************************************/
168MEM_STATIC unsigned BIT_highbit32 (register U32 val)
169{
170# if defined(_MSC_VER) /* Visual */
Yann Collet4114f952015-10-30 06:40:22 +0100171 unsigned long r=0;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100172 _BitScanReverse ( &r, val );
173 return (unsigned) r;
174# elif defined(__GNUC__) && (__GNUC__ >= 3) /* Use GCC Intrinsic */
175 return 31 - __builtin_clz (val);
176# else /* Software version */
Yann Colletf39a6732017-05-01 09:56:03 -0700177 static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29,
178 11, 14, 16, 18, 22, 25, 3, 30,
179 8, 12, 20, 28, 15, 17, 24, 7,
180 19, 27, 23, 6, 26, 5, 4, 31 };
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100181 U32 v = val;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100182 v |= v >> 1;
183 v |= v >> 2;
184 v |= v >> 4;
185 v |= v >> 8;
186 v |= v >> 16;
Yann Colletf22a0d62016-05-20 14:36:36 +0200187 return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100188# endif
189}
190
Yann Collet6cf45da2016-03-23 14:18:37 +0100191/*===== Local Constants =====*/
Yann Colletf39a6732017-05-01 09:56:03 -0700192static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F,
193 0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF,
194 0xFFFF, 0x1FFFF, 0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF,
195 0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF }; /* up to 26 bits */
Yann Collet6cf45da2016-03-23 14:18:37 +0100196
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100197
Yann Colletae7aa062016-02-03 02:46:46 +0100198/*-**************************************************************
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100199* bitStream encoding
200****************************************************************/
Yann Collet01e5b952016-03-19 14:14:31 +0100201/*! BIT_initCStream() :
Yann Colletf39a6732017-05-01 09:56:03 -0700202 * `dstCapacity` must be > sizeof(size_t)
Yann Collet01e5b952016-03-19 14:14:31 +0100203 * @return : 0 if success,
204 otherwise an error code (can be tested using ERR_isError() ) */
Yann Colletf39a6732017-05-01 09:56:03 -0700205MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
Yann Collet33c38b02017-05-01 11:12:30 -0700206 void* startPtr, size_t dstCapacity)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100207{
208 bitC->bitContainer = 0;
209 bitC->bitPos = 0;
210 bitC->startPtr = (char*)startPtr;
211 bitC->ptr = bitC->startPtr;
Yann Colletf39a6732017-05-01 09:56:03 -0700212 bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->bitContainer);
213 if (dstCapacity <= sizeof(bitC->bitContainer)) return ERROR(dstSize_tooSmall);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100214 return 0;
215}
216
Yann Collet01e5b952016-03-19 14:14:31 +0100217/*! BIT_addBits() :
218 can add up to 26 bits into `bitC`.
219 Does not check for register overflow ! */
Yann Colletf39a6732017-05-01 09:56:03 -0700220MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
Yann Collet33c38b02017-05-01 11:12:30 -0700221 size_t value, unsigned nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100222{
Yann Collet6cf45da2016-03-23 14:18:37 +0100223 bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100224 bitC->bitPos += nbBits;
225}
226
Yann Colletd1d210f2016-03-19 12:12:07 +0100227/*! BIT_addBitsFast() :
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100228 * works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
Yann Colletf39a6732017-05-01 09:56:03 -0700229MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC,
Yann Collet33c38b02017-05-01 11:12:30 -0700230 size_t value, unsigned nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100231{
Yann Collet202082f2017-04-28 16:56:39 -0700232 assert((value>>nbBits) == 0);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100233 bitC->bitContainer |= value << bitC->bitPos;
234 bitC->bitPos += nbBits;
235}
236
Yann Colletd1d210f2016-03-19 12:12:07 +0100237/*! BIT_flushBitsFast() :
Yann Colletf39a6732017-05-01 09:56:03 -0700238 * assumption : bitContainer has not overflowed
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100239 * unsafe version; does not check buffer overflow */
240MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
241{
Yann Colletd64f4352016-03-21 00:07:42 +0100242 size_t const nbBytes = bitC->bitPos >> 3;
Yann Colletf39a6732017-05-01 09:56:03 -0700243 assert( bitC->bitPos <= (sizeof(bitC->bitContainer)*8) );
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100244 MEM_writeLEST(bitC->ptr, bitC->bitContainer);
245 bitC->ptr += nbBytes;
Yann Colletf39a6732017-05-01 09:56:03 -0700246 assert(bitC->ptr <= bitC->endPtr);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100247 bitC->bitPos &= 7;
Yann Colletf39a6732017-05-01 09:56:03 -0700248 bitC->bitContainer >>= nbBytes*8;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100249}
250
Yann Collet01e5b952016-03-19 14:14:31 +0100251/*! BIT_flushBits() :
Yann Colletf39a6732017-05-01 09:56:03 -0700252 * assumption : bitContainer has not overflowed
Yann Collet01e5b952016-03-19 14:14:31 +0100253 * safe version; check for buffer overflow, and prevents it.
Yann Collet33c38b02017-05-01 11:12:30 -0700254 * note : does not signal buffer overflow.
255 * overflow will be revealed later on using BIT_closeCStream() */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100256MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
257{
Yann Colletd64f4352016-03-21 00:07:42 +0100258 size_t const nbBytes = bitC->bitPos >> 3;
Yann Colletf39a6732017-05-01 09:56:03 -0700259 assert( bitC->bitPos <= (sizeof(bitC->bitContainer)*8) );
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100260 MEM_writeLEST(bitC->ptr, bitC->bitContainer);
261 bitC->ptr += nbBytes;
262 if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
263 bitC->bitPos &= 7;
Yann Collet33c38b02017-05-01 11:12:30 -0700264 bitC->bitContainer >>= nbBytes*8;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100265}
266
Yann Colletd1d210f2016-03-19 12:12:07 +0100267/*! BIT_closeCStream() :
Yann Collet01e5b952016-03-19 14:14:31 +0100268 * @return : size of CStream, in bytes,
269 or 0 if it could not fit into dstBuffer */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100270MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
271{
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100272 BIT_addBitsFast(bitC, 1, 1); /* endMark */
273 BIT_flushBits(bitC);
Yann Collet33c38b02017-05-01 11:12:30 -0700274 if (bitC->ptr >= bitC->endPtr) return 0; /* overflow detected */
Yann Collet01e5b952016-03-19 14:14:31 +0100275 return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100276}
277
278
Yann Colletae7aa062016-02-03 02:46:46 +0100279/*-********************************************************
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100280* bitStream decoding
281**********************************************************/
Yann Collet01e5b952016-03-19 14:14:31 +0100282/*! BIT_initDStream() :
283* Initialize a BIT_DStream_t.
284* `bitD` : a pointer to an already allocated BIT_DStream_t structure.
Yann Colletadd08d62016-03-23 01:32:41 +0100285* `srcSize` must be the *exact* size of the bitStream, in bytes.
Yann Collet01e5b952016-03-19 14:14:31 +0100286* @return : size of stream (== srcSize) or an errorCode if a problem is detected
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100287*/
288MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
289{
290 if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
291
Yann Colletf39a6732017-05-01 09:56:03 -0700292 bitD->start = (const char*)srcBuffer;
293 bitD->limitPtr = bitD->start + sizeof(bitD->bitContainer);
294
Yann Collet1032fbe2016-05-11 18:30:24 +0200295 if (srcSize >= sizeof(bitD->bitContainer)) { /* normal case */
Yann Collet1032fbe2016-05-11 18:30:24 +0200296 bitD->ptr = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100297 bitD->bitContainer = MEM_readLEST(bitD->ptr);
Yann Colletb21ce152016-03-24 01:27:55 +0100298 { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
Yann Collet5397a662016-12-13 15:21:06 +0100299 bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0; /* ensures bitsConsumed is always set */
Yann Collet18c8f792016-06-12 22:51:52 +0200300 if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
Yann Colletae7aa062016-02-03 02:46:46 +0100301 } else {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100302 bitD->ptr = bitD->start;
Yann Collet1ceb5a92016-05-12 13:50:13 +0200303 bitD->bitContainer = *(const BYTE*)(bitD->start);
304 switch(srcSize)
305 {
306 case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
307 case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
308 case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
309 case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
310 case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
311 case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) << 8;
312 default:;
313 }
Yann Colletb21ce152016-03-24 01:27:55 +0100314 { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
Yann Collet18c8f792016-06-12 22:51:52 +0200315 bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
316 if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
Yann Collet1032fbe2016-05-11 18:30:24 +0200317 bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100318 }
319
320 return srcSize;
321}
322
Yann Collet1032fbe2016-05-11 18:30:24 +0200323MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
Yann Collet3c017862016-03-23 14:09:51 +0100324{
Yann Collet1032fbe2016-05-11 18:30:24 +0200325 return bitContainer >> start;
Yann Collet3c017862016-03-23 14:09:51 +0100326}
327
Yann Collet1032fbe2016-05-11 18:30:24 +0200328MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
Yann Collet3c017862016-03-23 14:09:51 +0100329{
Yann Collet5397a662016-12-13 15:21:06 +0100330#if defined(__BMI__) && defined(__GNUC__) && __GNUC__*1000+__GNUC_MINOR__ >= 4008 /* experimental */
Yann Collet6f9c0562016-05-01 10:26:30 +0200331# if defined(__x86_64__)
Yann Collet1032fbe2016-05-11 18:30:24 +0200332 if (sizeof(bitContainer)==8)
333 return _bextr_u64(bitContainer, start, nbBits);
Yann Collet6f9c0562016-05-01 10:26:30 +0200334 else
335# endif
Yann Collet1032fbe2016-05-11 18:30:24 +0200336 return _bextr_u32(bitContainer, start, nbBits);
Yann Collet862a8592016-03-23 18:45:23 +0100337#else
Yann Collet1032fbe2016-05-11 18:30:24 +0200338 return (bitContainer >> start) & BIT_mask[nbBits];
Yann Collet862a8592016-03-23 18:45:23 +0100339#endif
Yann Collet3c017862016-03-23 14:09:51 +0100340}
341
Yann Collet1032fbe2016-05-11 18:30:24 +0200342MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
Yann Colletafab0202016-03-23 13:57:49 +0100343{
Yann Collet1032fbe2016-05-11 18:30:24 +0200344 return bitContainer & BIT_mask[nbBits];
Yann Colletafab0202016-03-23 13:57:49 +0100345}
346
Yann Collet01e5b952016-03-19 14:14:31 +0100347/*! BIT_lookBits() :
348 * Provides next n bits from local register.
Yann Collet1032fbe2016-05-11 18:30:24 +0200349 * local register is not modified.
Yann Collet01e5b952016-03-19 14:14:31 +0100350 * On 32-bits, maxNbBits==24.
351 * On 64-bits, maxNbBits==56.
352 * @return : value extracted
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100353 */
Yann Collet862a8592016-03-23 18:45:23 +0100354 MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100355{
Yann Collet1032fbe2016-05-11 18:30:24 +0200356#if defined(__BMI__) && defined(__GNUC__) /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
357 return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
Yann Collet862a8592016-03-23 18:45:23 +0100358#else
Yann Colletf39a6732017-05-01 09:56:03 -0700359 U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
360 return ((bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> 1) >> ((regMask-nbBits) & regMask);
Yann Collet862a8592016-03-23 18:45:23 +0100361#endif
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100362}
363
Yann Collet01e5b952016-03-19 14:14:31 +0100364/*! BIT_lookBitsFast() :
Yann Collet202082f2017-04-28 16:56:39 -0700365 * unsafe version; only works if nbBits >= 1 */
Yann Colletadd08d62016-03-23 01:32:41 +0100366MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100367{
Yann Colletf39a6732017-05-01 09:56:03 -0700368 U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
Yann Collet202082f2017-04-28 16:56:39 -0700369 assert(nbBits >= 1);
Yann Colletf39a6732017-05-01 09:56:03 -0700370 return (bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> (((regMask+1)-nbBits) & regMask);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100371}
372
373MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
374{
375 bitD->bitsConsumed += nbBits;
376}
377
Yann Collet01e5b952016-03-19 14:14:31 +0100378/*! BIT_readBits() :
Yann Colletb21ce152016-03-24 01:27:55 +0100379 * Read (consume) next n bits from local register and update.
380 * Pay attention to not read more than nbBits contained into local register.
Yann Collet01e5b952016-03-19 14:14:31 +0100381 * @return : extracted value.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100382 */
383MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
384{
Yann Colletafab0202016-03-23 13:57:49 +0100385 size_t const value = BIT_lookBits(bitD, nbBits);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100386 BIT_skipBits(bitD, nbBits);
387 return value;
388}
389
Yann Collet01e5b952016-03-19 14:14:31 +0100390/*! BIT_readBitsFast() :
391* unsafe version; only works only if nbBits >= 1 */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100392MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
393{
Yann Colletafab0202016-03-23 13:57:49 +0100394 size_t const value = BIT_lookBitsFast(bitD, nbBits);
Yann Collet202082f2017-04-28 16:56:39 -0700395 assert(nbBits >= 1);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100396 BIT_skipBits(bitD, nbBits);
397 return value;
398}
399
Yann Collet01e5b952016-03-19 14:14:31 +0100400/*! BIT_reloadDStream() :
Yann Collet5397a662016-12-13 15:21:06 +0100401* Refill `bitD` from buffer previously set in BIT_initDStream() .
Yann Collet01e5b952016-03-19 14:14:31 +0100402* This function is safe, it guarantees it will not read beyond src buffer.
403* @return : status of `BIT_DStream_t` internal register.
Yann Collet5397a662016-12-13 15:21:06 +0100404 if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100405MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
406{
Yann Colletf39a6732017-05-01 09:56:03 -0700407 if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8)) /* overflow detected, like end of stream */
Nick Terrell5152fb22017-03-29 18:51:58 -0700408 return BIT_DStream_overflow;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100409
Yann Colletf39a6732017-05-01 09:56:03 -0700410 if (bitD->ptr >= bitD->limitPtr) {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100411 bitD->ptr -= bitD->bitsConsumed >> 3;
412 bitD->bitsConsumed &= 7;
413 bitD->bitContainer = MEM_readLEST(bitD->ptr);
414 return BIT_DStream_unfinished;
415 }
Yann Colletae7aa062016-02-03 02:46:46 +0100416 if (bitD->ptr == bitD->start) {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100417 if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
418 return BIT_DStream_completed;
419 }
Yann Colletf39a6732017-05-01 09:56:03 -0700420 /* start < ptr < limitPtr */
Yann Collet01e5b952016-03-19 14:14:31 +0100421 { U32 nbBytes = bitD->bitsConsumed >> 3;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100422 BIT_DStream_status result = BIT_DStream_unfinished;
Yann Colletae7aa062016-02-03 02:46:46 +0100423 if (bitD->ptr - nbBytes < bitD->start) {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100424 nbBytes = (U32)(bitD->ptr - bitD->start); /* ptr > start */
425 result = BIT_DStream_endOfBuffer;
426 }
427 bitD->ptr -= nbBytes;
428 bitD->bitsConsumed -= nbBytes*8;
Yann Colletf39a6732017-05-01 09:56:03 -0700429 bitD->bitContainer = MEM_readLEST(bitD->ptr); /* reminder : srcSize > sizeof(bitD->bitContainer), otherwise bitD->ptr == bitD->start */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100430 return result;
431 }
432}
433
Yann Colletd1d210f2016-03-19 12:12:07 +0100434/*! BIT_endOfDStream() :
Yann Collet01e5b952016-03-19 14:14:31 +0100435* @return Tells if DStream has exactly reached its end (all bits consumed).
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100436*/
437MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
438{
439 return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
440}
441
442#if defined (__cplusplus)
443}
444#endif
445
446#endif /* BITSTREAM_H_MODULE */