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: backward_references_hq.h

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

/* Function to find backward reference copies. */

#ifndef BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_
#define BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_

#include "../common/constants.h"
#include "../common/dictionary.h"
#include <brotli/types.h>
#include "./command.h"
#include "./hash.h"
#include "./memory.h"
#include "./port.h"
#include "./quality.h"

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

BROTLI_INTERNAL void BrotliCreateZopfliBackwardReferences(
    MemoryManager* m, const BrotliDictionary* dictionary, size_t num_bytes,
    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
    const BrotliEncoderParams* params, HasherHandle hasher, int* dist_cache,
    size_t* last_insert_len, Command* commands, size_t* num_commands,
    size_t* num_literals);

BROTLI_INTERNAL void BrotliCreateHqZopfliBackwardReferences(
    MemoryManager* m, const BrotliDictionary* dictionary, size_t num_bytes,
    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
    const BrotliEncoderParams* params, HasherHandle hasher, int* dist_cache,
    size_t* last_insert_len, Command* commands, size_t* num_commands,
    size_t* num_literals);

typedef struct ZopfliNode {
  /* best length to get up to this byte (not including this byte itself)
     highest 8 bit is used to reconstruct the length code */
  uint32_t length;
  /* distance associated with the length
     highest 7 bit contains distance short code + 1 (or zero if no short code)
  */
  uint32_t distance;
  /* number of literal inserts before this copy */
  uint32_t insert_length;

/* This union holds information used by dynamic-programming. During forward
     pass |cost| it used to store the goal function. When node is processed its
     |cost| is invalidated in favor of |shortcut|. On path back-tracing pass
     |next| is assigned the offset to next node on the path. */
  union {
    /* Smallest cost to get to this byte from the beginning, as found so far. */
    float cost;
    /* Offset to the next node on the path. Equals to command_length() of the
       next node on the path. For last node equals to BROTLI_UINT32_MAX */
    uint32_t next;
    /* Node position that provides next distance for distance cache. */
    uint32_t shortcut;
  } u;
} ZopfliNode;

BROTLI_INTERNAL void BrotliInitZopfliNodes(ZopfliNode* array, size_t length);

/* Computes the shortest path of commands from position to at most
   position + num_bytes.

On return, path->size() is the number of commands found and path[i] is the
   length of the i-th command (copy length plus insert length).
   Note that the sum of the lengths of all commands can be less than num_bytes.

On return, the nodes[0..num_bytes] array will have the following
   "ZopfliNode array invariant":
   For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
     (1) nodes[i].copy_length() >= 2
     (2) nodes[i].command_length() <= i and
     (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
BROTLI_INTERNAL size_t BrotliZopfliComputeShortestPath(
    MemoryManager* m, const BrotliDictionary* dictionary, size_t num_bytes,
    size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
    const BrotliEncoderParams* params, const size_t max_backward_limit,
    const int* dist_cache, HasherHandle hasher, ZopfliNode* nodes);

BROTLI_INTERNAL void BrotliZopfliCreateCommands(
    const size_t num_bytes, const size_t block_start,
    const size_t max_backward_limit, const ZopfliNode* nodes,
    int* dist_cache, size_t* last_insert_len, const BrotliEncoderParams* params,
    Command* commands, size_t* num_literals);

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

#endif  /* BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_ */

X7ROOT File Manager

Editing: backward_references_hq.h

Upload File

Create Folder