! BIT_addBits() : * can add up to 31 bits into `bitC`. * Note : does not check for register overflow ! */

! BIT_addBitsFast() : * works only if `value` is _clean_, * meaning all high bits above nbBits are 0 */

-************************************************************** * FSE NCount encoding ***************************************************************

fake FSE_CTable, for raw (uncompressed) input */

provides the minimum logSize to safely represent a distribution */

HIST_countFast_wksp() : * Same as HIST_countFast(), but using an externally provided scratch buffer. * `workSpace` is a writable buffer which must b

HIST_count_parallel_wksp() : * store histogram into 4 intermediate tables, recombined at the end. * this design makes better use of OoO cpus, * and

-************************************************************** * Histogram functions *************************************************************

note : same preparation as X4 */

violates C standard, by lying on structure alignment. Only use if no other choice to achieve best performance on target platform */

=========================================================================== * Send the block data compressed using the given Huffman trees */

=========================================================================== * Construct one Huffman tree and assigns the code bit strings and lengths.

Build a set of tables to decode the provided canonical Huffman code. The code lengths are lens[0..codes-1]. The result starts at *table, whose indice

=========================================================================== * Restore the heap property by moving down the tree starting at node k, *

-************************************************* * Functions ***************************************************/

! BIT_lookBits() : * Provides next n bits from local register. * local register is not modified. * On 32-bits, maxNbBits==24. * On 64-bits, ma

! BIT_readBitsFast() : * unsafe version; only works only if nbBits >= 1 */

BMK_benchMem() : * chunkP is expected to be correctly filled */

_******************************************************* * Private functions **********************************************************/

Compressed format : MAGICNUMBER - STREAMDESCRIPTOR - ( BLOCKHEADER - COMPRESSEDBLOCK ) - STREAMCRC MAGICNUMBER - 4 bytes - Designates compression algo

Compressed format : MAGICNUMBER - STREAMDESCRIPTOR - ( BLOCKHEADER - COMPRESSEDBLOCK ) - STREAMCRC MAGICNUMBER - 4 bytes - Designates compression algo

-************************************ * Memory operations **************************************/

U16 Compression functions

FSE_bitCost() : * Approximate symbol cost, as fractional value, using fixed-point format (accuracyLog fractional bits) * note 1 : assume symbolValue

* U16 Compression functions *********************************************************/

FSE_compress_wksp() : * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`). * `wkspSize` size must be `(1<<tabl

Function templates */

FSE_getMaxNbBits() : * Approximate maximum cost of a symbol, in bits. * Fractional get rounded up (i.e : a symbol with a normalized frequency of 3 g