File Manager

X7ROOT File Manager

Current Path: /opt/alt/tests/alt-php84-brotli_0.5.0-3.el8/brotli/c/enc

opt / alt / tests / alt-php84-brotli_0.5.0-3.el8 / brotli / c / enc /

ðŸ“ ..
ðŸ“ .libs
ðŸ“„ backward_references.c(3.92 KB)
ðŸ“„ backward_references.dep(2.92 KB)
ðŸ“„ backward_references.h(1.25 KB)
ðŸ“„ backward_references.lo(303 B)
ðŸ“„ backward_references_hq.c(29.94 KB)
ðŸ“„ backward_references_hq.dep(3.05 KB)
ðŸ“„ backward_references_hq.h(3.83 KB)
ðŸ“„ backward_references_hq.lo(309 B)
ðŸ“„ backward_references_inc.h(6.36 KB)
ðŸ“„ bit_cost.c(812 B)
ðŸ“„ bit_cost.dep(2.21 KB)
ðŸ“„ bit_cost.h(1.67 KB)
ðŸ“„ bit_cost.lo(281 B)
ðŸ“„ bit_cost_inc.h(4.01 KB)
ðŸ“„ block_encoder_inc.h(1.08 KB)
ðŸ“„ block_splitter.c(6.01 KB)
ðŸ“„ block_splitter.dep(2.31 KB)
ðŸ“„ block_splitter.h(1.63 KB)
ðŸ“„ block_splitter.lo(293 B)
ðŸ“„ block_splitter_inc.h(15.86 KB)
ðŸ“„ brotli_bit_stream.c(48.7 KB)
ðŸ“„ brotli_bit_stream.dep(3.11 KB)
ðŸ“„ brotli_bit_stream.h(4.59 KB)
ðŸ“„ brotli_bit_stream.lo(299 B)
ðŸ“„ cluster.c(1.45 KB)
ðŸ“„ cluster.dep(2.41 KB)
ðŸ“„ cluster.h(1021 B)
ðŸ“„ cluster.lo(279 B)
ðŸ“„ cluster_inc.h(11.14 KB)
ðŸ“„ command.h(6.48 KB)
ðŸ“„ compress_fragment.c(31.53 KB)
ðŸ“„ compress_fragment.dep(2.89 KB)
ðŸ“„ compress_fragment.h(2.75 KB)
ðŸ“„ compress_fragment.lo(299 B)
ðŸ“„ compress_fragment_two_pass.c(23.24 KB)
ðŸ“„ compress_fragment_two_pass.dep(3.07 KB)
ðŸ“„ compress_fragment_two_pass.h(2.34 KB)
ðŸ“„ compress_fragment_two_pass.lo(317 B)
ðŸ“„ context.h(7.27 KB)
ðŸ“„ dictionary_hash.c(86.83 KB)
ðŸ“„ dictionary_hash.dep(344 B)
ðŸ“„ dictionary_hash.h(583 B)
ðŸ“„ dictionary_hash.lo(295 B)
ðŸ“„ encode.c(65.51 KB)
ðŸ“„ encode.dep(4.74 KB)
ðŸ“„ encode.lo(277 B)
ðŸ“„ entropy_encode.c(14.14 KB)
ðŸ“„ entropy_encode.dep(560 B)
ðŸ“„ entropy_encode.h(3.94 KB)
ðŸ“„ entropy_encode.lo(293 B)
ðŸ“„ entropy_encode_static.h(32.12 KB)
ðŸ“„ fast_log.h(6.96 KB)
ðŸ“„ find_match_length.h(2.47 KB)
ðŸ“„ hash.h(13.56 KB)
ðŸ“„ hash_forgetful_chain_inc.h(9.41 KB)
ðŸ“„ hash_longest_match64_inc.h(10.19 KB)
ðŸ“„ hash_longest_match_inc.h(9.75 KB)
ðŸ“„ hash_longest_match_quickly_inc.h(8.5 KB)
ðŸ“„ hash_to_binary_tree_inc.h(12.58 KB)
ðŸ“„ histogram.c(3.05 KB)
ðŸ“„ histogram.dep(1.82 KB)
ðŸ“„ histogram.h(1.68 KB)
ðŸ“„ histogram.lo(283 B)
ðŸ“„ histogram_inc.h(1.37 KB)
ðŸ“„ literal_cost.c(5.47 KB)
ðŸ“„ literal_cost.dep(618 B)
ðŸ“„ literal_cost.h(880 B)
ðŸ“„ literal_cost.lo(289 B)
ðŸ“„ memory.c(4.96 KB)
ðŸ“„ memory.dep(455 B)
ðŸ“„ memory.h(1.66 KB)
ðŸ“„ memory.lo(277 B)
ðŸ“„ metablock.c(20.3 KB)
ðŸ“„ metablock.dep(2.92 KB)
ðŸ“„ metablock.h(3.67 KB)
ðŸ“„ metablock.lo(283 B)
ðŸ“„ metablock_inc.h(7.34 KB)
ðŸ“„ port.h(5.5 KB)
ðŸ“„ prefix.h(1.93 KB)
ðŸ“„ quality.h(5.62 KB)
ðŸ“„ ringbuffer.h(5.57 KB)
ðŸ“„ static_dict.c(18.14 KB)
ðŸ“„ static_dict.dep(796 B)
ðŸ“„ static_dict.h(1.2 KB)
ðŸ“„ static_dict.lo(287 B)
ðŸ“„ static_dict_lut.h(458.65 KB)
ðŸ“„ utf8_util.c(2.21 KB)
ðŸ“„ utf8_util.dep(396 B)
ðŸ“„ utf8_util.h(892 B)
ðŸ“„ utf8_util.lo(283 B)
ðŸ“„ write_bits.h(2.72 KB)

Editing: write_bits.h

Distributed under MIT license.
   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
*/

/* Write bits into a byte array. */

#ifndef BROTLI_ENC_WRITE_BITS_H_
#define BROTLI_ENC_WRITE_BITS_H_

#include <assert.h>
#include <stdio.h>  /* printf */

#include <brotli/types.h>
#include "./port.h"

#if defined(__cplusplus) || defined(c_plusplus)
extern "C" {
#endif

/*#define BIT_WRITER_DEBUG */

/* This function writes bits into bytes in increasing addresses, and within
   a byte least-significant-bit first.

The function can write up to 56 bits in one go with WriteBits
   Example: let's assume that 3 bits (Rs below) have been written already:

BYTE-0     BYTE+1       BYTE+2

0000 0RRR    0000 0000    0000 0000

Now, we could write 5 or less bits in MSB by just sifting by 3
   and OR'ing to BYTE-0.

For n bits, we take the last 5 bits, OR that with high bits in BYTE-0,
   and locate the rest in BYTE+1, BYTE+2, etc. */
static BROTLI_INLINE void BrotliWriteBits(size_t n_bits,
                                          uint64_t bits,
                                          size_t * BROTLI_RESTRICT pos,
                                          uint8_t * BROTLI_RESTRICT array) {
#ifdef BROTLI_LITTLE_ENDIAN
  /* This branch of the code can write up to 56 bits at a time,
     7 bits are lost by being perhaps already in *p and at least
     1 bit is needed to initialize the bit-stream ahead (i.e. if 7
     bits are in *p and we write 57 bits, then the next write will
     access a byte that was never initialized). */
  uint8_t *p = &array[*pos >> 3];
  uint64_t v = *p;
#ifdef BIT_WRITER_DEBUG
  printf("WriteBits  %2d  0x%016llx  %10d\n", n_bits, bits, *pos);
#endif
  assert((bits >> n_bits) == 0);
  assert(n_bits <= 56);
  v |= bits << (*pos & 7);
  BROTLI_UNALIGNED_STORE64LE(p, v);  /* Set some bits. */
  *pos += n_bits;
#else
  /* implicit & 0xff is assumed for uint8_t arithmetics */
  uint8_t *array_pos = &array[*pos >> 3];
  const size_t bits_reserved_in_first_byte = (*pos & 7);
  size_t bits_left_to_write;
  bits <<= bits_reserved_in_first_byte;
  *array_pos++ |= (uint8_t)bits;
  for (bits_left_to_write = n_bits + bits_reserved_in_first_byte;
       bits_left_to_write >= 9;
       bits_left_to_write -= 8) {
    bits >>= 8;
    *array_pos++ = (uint8_t)bits;
  }
  *array_pos = 0;
  *pos += n_bits;
#endif
}

static BROTLI_INLINE void BrotliWriteBitsPrepareStorage(
    size_t pos, uint8_t *array) {
#ifdef BIT_WRITER_DEBUG
  printf("WriteBitsPrepareStorage            %10d\n", pos);
#endif
  assert((pos & 7) == 0);
  array[pos >> 3] = 0;
}

#if defined(__cplusplus) || defined(c_plusplus)
}  /* extern "C" */
#endif

#endif  /* BROTLI_ENC_WRITE_BITS_H_ */

X7ROOT File Manager

Editing: write_bits.h

Upload File

Create Folder