| OLD | NEW |
| (Empty) | |
| 1 /* Copyright 2010 Google Inc. All Rights Reserved. |
| 2 |
| 3 Distributed under MIT license. |
| 4 See file LICENSE for detail or copy at https://opensource.org/licenses/MIT |
| 5 */ |
| 6 |
| 7 // Write bits into a byte array. |
| 8 |
| 9 #ifndef BROTLI_ENC_WRITE_BITS_H_ |
| 10 #define BROTLI_ENC_WRITE_BITS_H_ |
| 11 |
| 12 #include <assert.h> |
| 13 #include <stdio.h> |
| 14 |
| 15 #include "./port.h" |
| 16 #include "./types.h" |
| 17 |
| 18 namespace brotli { |
| 19 |
| 20 //#define BIT_WRITER_DEBUG |
| 21 |
| 22 // This function writes bits into bytes in increasing addresses, and within |
| 23 // a byte least-significant-bit first. |
| 24 // |
| 25 // The function can write up to 56 bits in one go with WriteBits |
| 26 // Example: let's assume that 3 bits (Rs below) have been written already: |
| 27 // |
| 28 // BYTE-0 BYTE+1 BYTE+2 |
| 29 // |
| 30 // 0000 0RRR 0000 0000 0000 0000 |
| 31 // |
| 32 // Now, we could write 5 or less bits in MSB by just sifting by 3 |
| 33 // and OR'ing to BYTE-0. |
| 34 // |
| 35 // For n bits, we take the last 5 bits, OR that with high bits in BYTE-0, |
| 36 // and locate the rest in BYTE+1, BYTE+2, etc. |
| 37 inline void WriteBits(size_t n_bits, |
| 38 uint64_t bits, |
| 39 size_t * __restrict pos, |
| 40 uint8_t * __restrict array) { |
| 41 #ifdef BIT_WRITER_DEBUG |
| 42 printf("WriteBits %2d 0x%016llx %10d\n", n_bits, bits, *pos); |
| 43 #endif |
| 44 assert((bits >> n_bits) == 0); |
| 45 assert(n_bits <= 56); |
| 46 #ifdef IS_LITTLE_ENDIAN |
| 47 // This branch of the code can write up to 56 bits at a time, |
| 48 // 7 bits are lost by being perhaps already in *p and at least |
| 49 // 1 bit is needed to initialize the bit-stream ahead (i.e. if 7 |
| 50 // bits are in *p and we write 57 bits, then the next write will |
| 51 // access a byte that was never initialized). |
| 52 uint8_t *p = &array[*pos >> 3]; |
| 53 uint64_t v = *p; |
| 54 v |= bits << (*pos & 7); |
| 55 BROTLI_UNALIGNED_STORE64(p, v); // Set some bits. |
| 56 *pos += n_bits; |
| 57 #else |
| 58 // implicit & 0xff is assumed for uint8_t arithmetics |
| 59 uint8_t *array_pos = &array[*pos >> 3]; |
| 60 const size_t bits_reserved_in_first_byte = (*pos & 7); |
| 61 bits <<= bits_reserved_in_first_byte; |
| 62 *array_pos++ |= static_cast<uint8_t>(bits); |
| 63 for (size_t bits_left_to_write = n_bits + bits_reserved_in_first_byte; |
| 64 bits_left_to_write >= 9; |
| 65 bits_left_to_write -= 8) { |
| 66 bits >>= 8; |
| 67 *array_pos++ = static_cast<uint8_t>(bits); |
| 68 } |
| 69 *array_pos = 0; |
| 70 *pos += n_bits; |
| 71 #endif |
| 72 } |
| 73 |
| 74 inline void WriteBitsPrepareStorage(size_t pos, uint8_t *array) { |
| 75 #ifdef BIT_WRITER_DEBUG |
| 76 printf("WriteBitsPrepareStorage %10d\n", pos); |
| 77 #endif |
| 78 assert((pos & 7) == 0); |
| 79 array[pos >> 3] = 0; |
| 80 } |
| 81 |
| 82 } // namespace brotli |
| 83 |
| 84 #endif // BROTLI_ENC_WRITE_BITS_H_ |
| OLD | NEW |