blob: 74eb4b63522dca0cdd41c2123e343e260d964ef6 [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
Yann Colletb1f3f4b2015-10-18 22:18:32 +010042/*
Yann Collet01e5b952016-03-19 14:14:31 +010043* This API consists of small unitary functions, which must be inlined for best performance.
Yann Colletb1f3f4b2015-10-18 22:18:32 +010044* Since link-time-optimization is not available for all compilers,
45* these functions are defined into a .h to be included.
46*/
47
Yann Colletae7aa062016-02-03 02:46:46 +010048/*-****************************************
49* Dependencies
Yann Colletb1f3f4b2015-10-18 22:18:32 +010050******************************************/
Yann Collet977f1f32016-01-21 15:38:47 +010051#include "mem.h" /* unaligned access routines */
52#include "error_private.h" /* error codes and messages */
Yann Colletb1f3f4b2015-10-18 22:18:32 +010053
54
Yann Collet202082f2017-04-28 16:56:39 -070055/*-*************************************
56* Debug
57***************************************/
58#if defined(BIT_DEBUG) && (BIT_DEBUG>=1)
59# include <assert.h>
60#else
61# define assert(condition) ((void)0)
62#endif
63
64
Yann Collet74bd1192016-03-26 17:50:26 +010065/*=========================================
66* Target specific
67=========================================*/
68#if defined(__BMI__) && defined(__GNUC__)
69# include <immintrin.h> /* support for bextr (experimental) */
70#endif
71
Sean Purcelld44703d2017-03-01 14:36:25 -080072#define STREAM_ACCUMULATOR_MIN_32 25
73#define STREAM_ACCUMULATOR_MIN_64 57
74#define STREAM_ACCUMULATOR_MIN ((U32)(MEM_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
Yann Collet74bd1192016-03-26 17:50:26 +010075
Yann Colletae7aa062016-02-03 02:46:46 +010076/*-******************************************
77* bitStream encoding API (write forward)
Yann Colletb1f3f4b2015-10-18 22:18:32 +010078********************************************/
Yann Colletd1d210f2016-03-19 12:12:07 +010079/* bitStream can mix input from multiple sources.
80* A critical property of these streams is that they encode and decode in **reverse** direction.
81* 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 +010082*/
83typedef struct
84{
85 size_t bitContainer;
Yann Colletf39a6732017-05-01 09:56:03 -070086 unsigned bitPos;
Yann Colletb1f3f4b2015-10-18 22:18:32 +010087 char* startPtr;
88 char* ptr;
89 char* endPtr;
90} BIT_CStream_t;
91
Yann Colletae7aa062016-02-03 02:46:46 +010092MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* dstBuffer, size_t dstCapacity);
Yann Colletb1f3f4b2015-10-18 22:18:32 +010093MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
94MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC);
95MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC);
96
Yann Collet01e5b952016-03-19 14:14:31 +010097/* Start with initCStream, providing the size of buffer to write into.
98* bitStream will never write outside of this buffer.
Yann Collet1032fbe2016-05-11 18:30:24 +020099* `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100100*
Yann Collet01e5b952016-03-19 14:14:31 +0100101* bits are first added to a local register.
102* Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
103* Writing data into memory is an explicit operation, performed by the flushBits function.
104* Hence keep track how many bits are potentially stored into local register to avoid register overflow.
105* After a flushBits, a maximum of 7 bits might still be stored into local register.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100106*
Yann Collet01e5b952016-03-19 14:14:31 +0100107* Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100108*
Yann Collet01e5b952016-03-19 14:14:31 +0100109* Last operation is to close the bitStream.
110* The function returns the final size of CStream in bytes.
111* If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100112*/
113
114
Yann Colletae7aa062016-02-03 02:46:46 +0100115/*-********************************************
116* bitStream decoding API (read backward)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100117**********************************************/
118typedef struct
119{
120 size_t bitContainer;
121 unsigned bitsConsumed;
122 const char* ptr;
123 const char* start;
Yann Colletf39a6732017-05-01 09:56:03 -0700124 const char* limitPtr;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100125} BIT_DStream_t;
126
127typedef enum { BIT_DStream_unfinished = 0,
128 BIT_DStream_endOfBuffer = 1,
129 BIT_DStream_completed = 2,
130 BIT_DStream_overflow = 3 } BIT_DStream_status; /* result of BIT_reloadDStream() */
131 /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
132
133MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
134MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
135MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);
136MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);
137
138
Yann Collet01e5b952016-03-19 14:14:31 +0100139/* Start by invoking BIT_initDStream().
140* A chunk of the bitStream is then stored into a local register.
141* Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
142* You can then retrieve bitFields stored into the local register, **in reverse order**.
143* Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
Yann Collet1032fbe2016-05-11 18:30:24 +0200144* 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 +0100145* Otherwise, it can be less than that, so proceed accordingly.
Yann Colletb21ce152016-03-24 01:27:55 +0100146* Checking if DStream has reached its end can be performed with BIT_endOfDStream().
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100147*/
148
149
Yann Colletae7aa062016-02-03 02:46:46 +0100150/*-****************************************
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100151* unsafe API
152******************************************/
153MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
154/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
155
156MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC);
157/* unsafe version; does not check buffer overflow */
158
159MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
160/* faster, but works only if nbBits >= 1 */
161
162
163
Yann Colletae7aa062016-02-03 02:46:46 +0100164/*-**************************************************************
Yann Collet6cf45da2016-03-23 14:18:37 +0100165* Internal functions
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100166****************************************************************/
167MEM_STATIC unsigned BIT_highbit32 (register U32 val)
168{
169# if defined(_MSC_VER) /* Visual */
Yann Collet4114f952015-10-30 06:40:22 +0100170 unsigned long r=0;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100171 _BitScanReverse ( &r, val );
172 return (unsigned) r;
173# elif defined(__GNUC__) && (__GNUC__ >= 3) /* Use GCC Intrinsic */
174 return 31 - __builtin_clz (val);
175# else /* Software version */
Yann Colletf39a6732017-05-01 09:56:03 -0700176 static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29,
177 11, 14, 16, 18, 22, 25, 3, 30,
178 8, 12, 20, 28, 15, 17, 24, 7,
179 19, 27, 23, 6, 26, 5, 4, 31 };
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100180 U32 v = val;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100181 v |= v >> 1;
182 v |= v >> 2;
183 v |= v >> 4;
184 v |= v >> 8;
185 v |= v >> 16;
Yann Colletf22a0d62016-05-20 14:36:36 +0200186 return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100187# endif
188}
189
Yann Collet6cf45da2016-03-23 14:18:37 +0100190/*===== Local Constants =====*/
Yann Colletf39a6732017-05-01 09:56:03 -0700191static const unsigned BIT_mask[] = { 0, 1, 3, 7, 0xF, 0x1F, 0x3F, 0x7F,
192 0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF,
193 0xFFFF, 0x1FFFF, 0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF,
194 0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF }; /* up to 26 bits */
Yann Collet6cf45da2016-03-23 14:18:37 +0100195
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100196
Yann Colletae7aa062016-02-03 02:46:46 +0100197/*-**************************************************************
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100198* bitStream encoding
199****************************************************************/
Yann Collet01e5b952016-03-19 14:14:31 +0100200/*! BIT_initCStream() :
Yann Colletf39a6732017-05-01 09:56:03 -0700201 * `dstCapacity` must be > sizeof(size_t)
Yann Collet01e5b952016-03-19 14:14:31 +0100202 * @return : 0 if success,
203 otherwise an error code (can be tested using ERR_isError() ) */
Yann Colletf39a6732017-05-01 09:56:03 -0700204MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
Yann Collet33c38b02017-05-01 11:12:30 -0700205 void* startPtr, size_t dstCapacity)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100206{
207 bitC->bitContainer = 0;
208 bitC->bitPos = 0;
209 bitC->startPtr = (char*)startPtr;
210 bitC->ptr = bitC->startPtr;
Yann Colletf39a6732017-05-01 09:56:03 -0700211 bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->bitContainer);
212 if (dstCapacity <= sizeof(bitC->bitContainer)) return ERROR(dstSize_tooSmall);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100213 return 0;
214}
215
Yann Collet01e5b952016-03-19 14:14:31 +0100216/*! BIT_addBits() :
217 can add up to 26 bits into `bitC`.
218 Does not check for register overflow ! */
Yann Colletf39a6732017-05-01 09:56:03 -0700219MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
Yann Collet33c38b02017-05-01 11:12:30 -0700220 size_t value, unsigned nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100221{
Yann Collet6cf45da2016-03-23 14:18:37 +0100222 bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100223 bitC->bitPos += nbBits;
224}
225
Yann Colletd1d210f2016-03-19 12:12:07 +0100226/*! BIT_addBitsFast() :
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100227 * works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
Yann Colletf39a6732017-05-01 09:56:03 -0700228MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC,
Yann Collet33c38b02017-05-01 11:12:30 -0700229 size_t value, unsigned nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100230{
Yann Collet202082f2017-04-28 16:56:39 -0700231 assert((value>>nbBits) == 0);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100232 bitC->bitContainer |= value << bitC->bitPos;
233 bitC->bitPos += nbBits;
234}
235
Yann Colletd1d210f2016-03-19 12:12:07 +0100236/*! BIT_flushBitsFast() :
Yann Colletf39a6732017-05-01 09:56:03 -0700237 * assumption : bitContainer has not overflowed
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100238 * unsafe version; does not check buffer overflow */
239MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
240{
Yann Colletd64f4352016-03-21 00:07:42 +0100241 size_t const nbBytes = bitC->bitPos >> 3;
Yann Colletf39a6732017-05-01 09:56:03 -0700242 assert( bitC->bitPos <= (sizeof(bitC->bitContainer)*8) );
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100243 MEM_writeLEST(bitC->ptr, bitC->bitContainer);
244 bitC->ptr += nbBytes;
Yann Colletf39a6732017-05-01 09:56:03 -0700245 assert(bitC->ptr <= bitC->endPtr);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100246 bitC->bitPos &= 7;
Yann Colletf39a6732017-05-01 09:56:03 -0700247 bitC->bitContainer >>= nbBytes*8;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100248}
249
Yann Collet01e5b952016-03-19 14:14:31 +0100250/*! BIT_flushBits() :
Yann Colletf39a6732017-05-01 09:56:03 -0700251 * assumption : bitContainer has not overflowed
Yann Collet01e5b952016-03-19 14:14:31 +0100252 * safe version; check for buffer overflow, and prevents it.
Yann Collet33c38b02017-05-01 11:12:30 -0700253 * note : does not signal buffer overflow.
254 * overflow will be revealed later on using BIT_closeCStream() */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100255MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
256{
Yann Colletd64f4352016-03-21 00:07:42 +0100257 size_t const nbBytes = bitC->bitPos >> 3;
Yann Colletf39a6732017-05-01 09:56:03 -0700258 assert( bitC->bitPos <= (sizeof(bitC->bitContainer)*8) );
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100259 MEM_writeLEST(bitC->ptr, bitC->bitContainer);
260 bitC->ptr += nbBytes;
261 if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
262 bitC->bitPos &= 7;
Yann Collet33c38b02017-05-01 11:12:30 -0700263 bitC->bitContainer >>= nbBytes*8;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100264}
265
Yann Colletd1d210f2016-03-19 12:12:07 +0100266/*! BIT_closeCStream() :
Yann Collet01e5b952016-03-19 14:14:31 +0100267 * @return : size of CStream, in bytes,
268 or 0 if it could not fit into dstBuffer */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100269MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
270{
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100271 BIT_addBitsFast(bitC, 1, 1); /* endMark */
272 BIT_flushBits(bitC);
Yann Collet33c38b02017-05-01 11:12:30 -0700273 if (bitC->ptr >= bitC->endPtr) return 0; /* overflow detected */
Yann Collet01e5b952016-03-19 14:14:31 +0100274 return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100275}
276
277
Yann Colletae7aa062016-02-03 02:46:46 +0100278/*-********************************************************
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100279* bitStream decoding
280**********************************************************/
Yann Collet01e5b952016-03-19 14:14:31 +0100281/*! BIT_initDStream() :
282* Initialize a BIT_DStream_t.
283* `bitD` : a pointer to an already allocated BIT_DStream_t structure.
Yann Colletadd08d62016-03-23 01:32:41 +0100284* `srcSize` must be the *exact* size of the bitStream, in bytes.
Yann Collet01e5b952016-03-19 14:14:31 +0100285* @return : size of stream (== srcSize) or an errorCode if a problem is detected
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100286*/
287MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
288{
289 if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
290
Yann Colletf39a6732017-05-01 09:56:03 -0700291 bitD->start = (const char*)srcBuffer;
292 bitD->limitPtr = bitD->start + sizeof(bitD->bitContainer);
293
Yann Collet1032fbe2016-05-11 18:30:24 +0200294 if (srcSize >= sizeof(bitD->bitContainer)) { /* normal case */
Yann Collet1032fbe2016-05-11 18:30:24 +0200295 bitD->ptr = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100296 bitD->bitContainer = MEM_readLEST(bitD->ptr);
Yann Colletb21ce152016-03-24 01:27:55 +0100297 { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
Yann Collet5397a662016-12-13 15:21:06 +0100298 bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0; /* ensures bitsConsumed is always set */
Yann Collet18c8f792016-06-12 22:51:52 +0200299 if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
Yann Colletae7aa062016-02-03 02:46:46 +0100300 } else {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100301 bitD->ptr = bitD->start;
Yann Collet1ceb5a92016-05-12 13:50:13 +0200302 bitD->bitContainer = *(const BYTE*)(bitD->start);
303 switch(srcSize)
304 {
Jos Collin05286fd2017-05-09 08:36:05 +0530305 case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
306 /* fall-through */
307
308 case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
309 /* fall-through */
310
311 case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
312 /* fall-through */
313
314 case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
315 /* fall-through */
316
317 case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
318 /* fall-through */
319
320 case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) << 8;
321 /* fall-through */
322
323 default: break;
Yann Collet1ceb5a92016-05-12 13:50:13 +0200324 }
Yann Colletb21ce152016-03-24 01:27:55 +0100325 { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
Yann Collet18c8f792016-06-12 22:51:52 +0200326 bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
327 if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
Yann Collet1032fbe2016-05-11 18:30:24 +0200328 bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100329 }
330
331 return srcSize;
332}
333
Yann Collet1032fbe2016-05-11 18:30:24 +0200334MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
Yann Collet3c017862016-03-23 14:09:51 +0100335{
Yann Collet1032fbe2016-05-11 18:30:24 +0200336 return bitContainer >> start;
Yann Collet3c017862016-03-23 14:09:51 +0100337}
338
Yann Collet1032fbe2016-05-11 18:30:24 +0200339MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
Yann Collet3c017862016-03-23 14:09:51 +0100340{
Yann Collet5397a662016-12-13 15:21:06 +0100341#if defined(__BMI__) && defined(__GNUC__) && __GNUC__*1000+__GNUC_MINOR__ >= 4008 /* experimental */
Yann Collet6f9c0562016-05-01 10:26:30 +0200342# if defined(__x86_64__)
Yann Collet1032fbe2016-05-11 18:30:24 +0200343 if (sizeof(bitContainer)==8)
344 return _bextr_u64(bitContainer, start, nbBits);
Yann Collet6f9c0562016-05-01 10:26:30 +0200345 else
346# endif
Yann Collet1032fbe2016-05-11 18:30:24 +0200347 return _bextr_u32(bitContainer, start, nbBits);
Yann Collet862a8592016-03-23 18:45:23 +0100348#else
Yann Collet1032fbe2016-05-11 18:30:24 +0200349 return (bitContainer >> start) & BIT_mask[nbBits];
Yann Collet862a8592016-03-23 18:45:23 +0100350#endif
Yann Collet3c017862016-03-23 14:09:51 +0100351}
352
Yann Collet1032fbe2016-05-11 18:30:24 +0200353MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
Yann Colletafab0202016-03-23 13:57:49 +0100354{
Yann Collet1032fbe2016-05-11 18:30:24 +0200355 return bitContainer & BIT_mask[nbBits];
Yann Colletafab0202016-03-23 13:57:49 +0100356}
357
Yann Collet01e5b952016-03-19 14:14:31 +0100358/*! BIT_lookBits() :
359 * Provides next n bits from local register.
Yann Collet1032fbe2016-05-11 18:30:24 +0200360 * local register is not modified.
Yann Collet01e5b952016-03-19 14:14:31 +0100361 * On 32-bits, maxNbBits==24.
362 * On 64-bits, maxNbBits==56.
363 * @return : value extracted
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100364 */
Yann Collet862a8592016-03-23 18:45:23 +0100365 MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100366{
Yann Collet1032fbe2016-05-11 18:30:24 +0200367#if defined(__BMI__) && defined(__GNUC__) /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
368 return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
Yann Collet862a8592016-03-23 18:45:23 +0100369#else
Yann Colletf39a6732017-05-01 09:56:03 -0700370 U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
371 return ((bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> 1) >> ((regMask-nbBits) & regMask);
Yann Collet862a8592016-03-23 18:45:23 +0100372#endif
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100373}
374
Yann Collet01e5b952016-03-19 14:14:31 +0100375/*! BIT_lookBitsFast() :
Yann Collet202082f2017-04-28 16:56:39 -0700376 * unsafe version; only works if nbBits >= 1 */
Yann Colletadd08d62016-03-23 01:32:41 +0100377MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100378{
Yann Colletf39a6732017-05-01 09:56:03 -0700379 U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
Yann Collet202082f2017-04-28 16:56:39 -0700380 assert(nbBits >= 1);
Yann Colletf39a6732017-05-01 09:56:03 -0700381 return (bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> (((regMask+1)-nbBits) & regMask);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100382}
383
384MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
385{
386 bitD->bitsConsumed += nbBits;
387}
388
Yann Collet01e5b952016-03-19 14:14:31 +0100389/*! BIT_readBits() :
Yann Colletb21ce152016-03-24 01:27:55 +0100390 * Read (consume) next n bits from local register and update.
391 * Pay attention to not read more than nbBits contained into local register.
Yann Collet01e5b952016-03-19 14:14:31 +0100392 * @return : extracted value.
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100393 */
394MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
395{
Yann Colletafab0202016-03-23 13:57:49 +0100396 size_t const value = BIT_lookBits(bitD, nbBits);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100397 BIT_skipBits(bitD, nbBits);
398 return value;
399}
400
Yann Collet01e5b952016-03-19 14:14:31 +0100401/*! BIT_readBitsFast() :
402* unsafe version; only works only if nbBits >= 1 */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100403MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
404{
Yann Colletafab0202016-03-23 13:57:49 +0100405 size_t const value = BIT_lookBitsFast(bitD, nbBits);
Yann Collet202082f2017-04-28 16:56:39 -0700406 assert(nbBits >= 1);
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100407 BIT_skipBits(bitD, nbBits);
408 return value;
409}
410
Yann Collet01e5b952016-03-19 14:14:31 +0100411/*! BIT_reloadDStream() :
Yann Collet5397a662016-12-13 15:21:06 +0100412* Refill `bitD` from buffer previously set in BIT_initDStream() .
Yann Collet01e5b952016-03-19 14:14:31 +0100413* This function is safe, it guarantees it will not read beyond src buffer.
414* @return : status of `BIT_DStream_t` internal register.
Yann Collet5397a662016-12-13 15:21:06 +0100415 if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100416MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
417{
Yann Colletf39a6732017-05-01 09:56:03 -0700418 if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8)) /* overflow detected, like end of stream */
Nick Terrell5152fb22017-03-29 18:51:58 -0700419 return BIT_DStream_overflow;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100420
Yann Colletf39a6732017-05-01 09:56:03 -0700421 if (bitD->ptr >= bitD->limitPtr) {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100422 bitD->ptr -= bitD->bitsConsumed >> 3;
423 bitD->bitsConsumed &= 7;
424 bitD->bitContainer = MEM_readLEST(bitD->ptr);
425 return BIT_DStream_unfinished;
426 }
Yann Colletae7aa062016-02-03 02:46:46 +0100427 if (bitD->ptr == bitD->start) {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100428 if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
429 return BIT_DStream_completed;
430 }
Yann Colletf39a6732017-05-01 09:56:03 -0700431 /* start < ptr < limitPtr */
Yann Collet01e5b952016-03-19 14:14:31 +0100432 { U32 nbBytes = bitD->bitsConsumed >> 3;
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100433 BIT_DStream_status result = BIT_DStream_unfinished;
Yann Colletae7aa062016-02-03 02:46:46 +0100434 if (bitD->ptr - nbBytes < bitD->start) {
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100435 nbBytes = (U32)(bitD->ptr - bitD->start); /* ptr > start */
436 result = BIT_DStream_endOfBuffer;
437 }
438 bitD->ptr -= nbBytes;
439 bitD->bitsConsumed -= nbBytes*8;
Yann Colletf39a6732017-05-01 09:56:03 -0700440 bitD->bitContainer = MEM_readLEST(bitD->ptr); /* reminder : srcSize > sizeof(bitD->bitContainer), otherwise bitD->ptr == bitD->start */
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100441 return result;
442 }
443}
444
Yann Colletd1d210f2016-03-19 12:12:07 +0100445/*! BIT_endOfDStream() :
Yann Collet01e5b952016-03-19 14:14:31 +0100446* @return Tells if DStream has exactly reached its end (all bits consumed).
Yann Colletb1f3f4b2015-10-18 22:18:32 +0100447*/
448MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
449{
450 return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
451}
452
453#if defined (__cplusplus)
454}
455#endif
456
457#endif /* BITSTREAM_H_MODULE */