Home
last modified time | relevance | path

Searched refs:bitPos (Results 1 - 3 of 3) sorted by relevance

/kernel/linux/linux-5.10/lib/zstd/
H A Dbitstream.h72 int bitPos; member
165 bitC->bitPos = 0; in BIT_initCStream()
179 bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos; in BIT_addBits()
180 bitC->bitPos += nbBits; in BIT_addBits()
187 bitC->bitContainer |= value << bitC->bitPos; in BIT_addBitsFast()
188 bitC->bitPos += nbBits; in BIT_addBitsFast()
195 size_t const nbBytes = bitC->bitPos >> 3; in BIT_flushBitsFast()
198 bitC->bitPos &= 7; in BIT_flushBitsFast()
199 bitC->bitContainer >>= nbBytes * 8; /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */ in BIT_flushBitsFast()
207 size_t const nbBytes = bitC->bitPos >> in BIT_flushBits()
[all...]
/kernel/linux/linux-6.6/lib/zstd/common/
H A Dbitstream.h50 unsigned bitPos; member
173 bitC->bitPos = 0; in BIT_initCStream()
189 assert(nbBits + bitC->bitPos < sizeof(bitC->bitContainer) * 8); in BIT_addBits()
190 bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos; in BIT_addBits()
191 bitC->bitPos += nbBits; in BIT_addBits()
201 assert(nbBits + bitC->bitPos < sizeof(bitC->bitContainer) * 8); in BIT_addBitsFast()
202 bitC->bitContainer |= value << bitC->bitPos; in BIT_addBitsFast()
203 bitC->bitPos += nbBits; in BIT_addBitsFast()
211 size_t const nbBytes = bitC->bitPos >> 3; in BIT_flushBitsFast()
212 assert(bitC->bitPos < sizeo in BIT_flushBitsFast()
[all...]
/kernel/linux/linux-6.6/lib/zstd/compress/
H A Dhuf_compress.c752 size_t bitPos[2]; member
795 /* We only read the low 8 bits of bitC->bitPos[idx] so it in HUF_addBits()
798 bitC->bitPos[idx] += HUF_getNbBitsFast(elt); in HUF_addBits()
799 assert((bitC->bitPos[idx] & 0xFF) <= HUF_BITS_IN_CONTAINER); in HUF_addBits()
812 assert(!kFast || (bitC->bitPos[idx] & 0xFF) <= HUF_BITS_IN_CONTAINER); in HUF_addBits()
821 bitC->bitPos[1] = 0; in HUF_zeroIndex1()
830 assert((bitC->bitPos[1] & 0xFF) < HUF_BITS_IN_CONTAINER); in HUF_mergeIndex1()
831 bitC->bitContainer[0] >>= (bitC->bitPos[1] & 0xFF); in HUF_mergeIndex1()
833 bitC->bitPos[0] += bitC->bitPos[ in HUF_mergeIndex1()
[all...]

Completed in 4 milliseconds