koffi 2.3.6-beta.6 → 2.3.7

package/vendor/brotli/c/enc/metablock.h

@@ -1,105 +0,0 @@
-/* Copyright 2015 Google Inc. All Rights Reserved.
-
-   Distributed under MIT license.
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
-*/
-
-/* Algorithms for distributing the literals and commands of a metablock between
-   block types and contexts. */
-
-#ifndef BROTLI_ENC_METABLOCK_H_
-#define BROTLI_ENC_METABLOCK_H_
-
-#include "../common/context.h"
-#include "../common/platform.h"
-#include <brotli/types.h>
-#include "./block_splitter.h"
-#include "./command.h"
-#include "./histogram.h"
-#include "./memory.h"
-#include "./quality.h"
-
-#if defined(__cplusplus) || defined(c_plusplus)
-extern "C" {
-#endif
-
-typedef struct MetaBlockSplit {
-  BlockSplit literal_split;
-  BlockSplit command_split;
-  BlockSplit distance_split;
-  uint32_t* literal_context_map;
-  size_t literal_context_map_size;
-  uint32_t* distance_context_map;
-  size_t distance_context_map_size;
-  HistogramLiteral* literal_histograms;
-  size_t literal_histograms_size;
-  HistogramCommand* command_histograms;
-  size_t command_histograms_size;
-  HistogramDistance* distance_histograms;
-  size_t distance_histograms_size;
-} MetaBlockSplit;
-
-static BROTLI_INLINE void InitMetaBlockSplit(MetaBlockSplit* mb) {
-  BrotliInitBlockSplit(&mb->literal_split);
-  BrotliInitBlockSplit(&mb->command_split);
-  BrotliInitBlockSplit(&mb->distance_split);
-  mb->literal_context_map = 0;
-  mb->literal_context_map_size = 0;
-  mb->distance_context_map = 0;
-  mb->distance_context_map_size = 0;
-  mb->literal_histograms = 0;
-  mb->literal_histograms_size = 0;
-  mb->command_histograms = 0;
-  mb->command_histograms_size = 0;
-  mb->distance_histograms = 0;
-  mb->distance_histograms_size = 0;
-}
-
-static BROTLI_INLINE void DestroyMetaBlockSplit(
-    MemoryManager* m, MetaBlockSplit* mb) {
-  BrotliDestroyBlockSplit(m, &mb->literal_split);
-  BrotliDestroyBlockSplit(m, &mb->command_split);
-  BrotliDestroyBlockSplit(m, &mb->distance_split);
-  BROTLI_FREE(m, mb->literal_context_map);
-  BROTLI_FREE(m, mb->distance_context_map);
-  BROTLI_FREE(m, mb->literal_histograms);
-  BROTLI_FREE(m, mb->command_histograms);
-  BROTLI_FREE(m, mb->distance_histograms);
-}
-
-/* Uses the slow shortest-path block splitter and does context clustering.
-   The distance parameters are dynamically selected based on the commands
-   which get recomputed under the new distance parameters. The new distance
-   parameters are stored into *params. */
-BROTLI_INTERNAL void BrotliBuildMetaBlock(MemoryManager* m,
-                                          const uint8_t* ringbuffer,
-                                          const size_t pos,
-                                          const size_t mask,
-                                          BrotliEncoderParams* params,
-                                          uint8_t prev_byte,
-                                          uint8_t prev_byte2,
-                                          Command* cmds,
-                                          size_t num_commands,
-                                          ContextType literal_context_mode,
-                                          MetaBlockSplit* mb);
-
-/* Uses a fast greedy block splitter that tries to merge current block with the
-   last or the second last block and uses a static context clustering which
-   is the same for all block types. */
-BROTLI_INTERNAL void BrotliBuildMetaBlockGreedy(
-    MemoryManager* m, const uint8_t* ringbuffer, size_t pos, size_t mask,
-    uint8_t prev_byte, uint8_t prev_byte2, ContextLut literal_context_lut,
-    size_t num_contexts, const uint32_t* static_context_map,
-    const Command* commands, size_t n_commands, MetaBlockSplit* mb);
-
-BROTLI_INTERNAL void BrotliOptimizeHistograms(uint32_t num_distance_codes,
-                                              MetaBlockSplit* mb);
-
-BROTLI_INTERNAL void BrotliInitDistanceParams(BrotliEncoderParams* params,
-    uint32_t npostfix, uint32_t ndirect);
-
-#if defined(__cplusplus) || defined(c_plusplus)
-}  /* extern "C" */
-#endif
-
-#endif  /* BROTLI_ENC_METABLOCK_H_ */

package/vendor/brotli/c/enc/metablock_inc.h

@@ -1,183 +0,0 @@
-/* NOLINT(build/header_guard) */
-/* Copyright 2015 Google Inc. All Rights Reserved.
-
-   Distributed under MIT license.
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
-*/
-
-/* template parameters: FN */
-
-#define HistogramType FN(Histogram)
-
-/* Greedy block splitter for one block category (literal, command or distance).
-*/
-typedef struct FN(BlockSplitter) {
-  /* Alphabet size of particular block category. */
-  size_t alphabet_size_;
-  /* We collect at least this many symbols for each block. */
-  size_t min_block_size_;
-  /* We merge histograms A and B if
-       entropy(A+B) < entropy(A) + entropy(B) + split_threshold_,
-     where A is the current histogram and B is the histogram of the last or the
-     second last block type. */
-  double split_threshold_;
-
-  size_t num_blocks_;
-  BlockSplit* split_;  /* not owned */
-  HistogramType* histograms_;  /* not owned */
-  size_t* histograms_size_;  /* not owned */
-
-  /* The number of symbols that we want to collect before deciding on whether
-     or not to merge the block with a previous one or emit a new block. */
-  size_t target_block_size_;
-  /* The number of symbols in the current histogram. */
-  size_t block_size_;
-  /* Offset of the current histogram. */
-  size_t curr_histogram_ix_;
-  /* Offset of the histograms of the previous two block types. */
-  size_t last_histogram_ix_[2];
-  /* Entropy of the previous two block types. */
-  double last_entropy_[2];
-  /* The number of times we merged the current block with the last one. */
-  size_t merge_last_count_;
-} FN(BlockSplitter);
-
-static void FN(InitBlockSplitter)(
-    MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size,
-    size_t min_block_size, double split_threshold, size_t num_symbols,
-    BlockSplit* split, HistogramType** histograms, size_t* histograms_size) {
-  size_t max_num_blocks = num_symbols / min_block_size + 1;
-  /* We have to allocate one more histogram than the maximum number of block
-     types for the current histogram when the meta-block is too big. */
-  size_t max_num_types =
-      BROTLI_MIN(size_t, max_num_blocks, BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + 1);
-  self->alphabet_size_ = alphabet_size;
-  self->min_block_size_ = min_block_size;
-  self->split_threshold_ = split_threshold;
-  self->num_blocks_ = 0;
-  self->split_ = split;
-  self->histograms_size_ = histograms_size;
-  self->target_block_size_ = min_block_size;
-  self->block_size_ = 0;
-  self->curr_histogram_ix_ = 0;
-  self->merge_last_count_ = 0;
-  BROTLI_ENSURE_CAPACITY(m, uint8_t,
-      split->types, split->types_alloc_size, max_num_blocks);
-  BROTLI_ENSURE_CAPACITY(m, uint32_t,
-      split->lengths, split->lengths_alloc_size, max_num_blocks);
-  if (BROTLI_IS_OOM(m)) return;
-  self->split_->num_blocks = max_num_blocks;
-  BROTLI_DCHECK(*histograms == 0);
-  *histograms_size = max_num_types;
-  *histograms = BROTLI_ALLOC(m, HistogramType, *histograms_size);
-  self->histograms_ = *histograms;
-  if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return;
-  /* Clear only current histogram. */
-  FN(HistogramClear)(&self->histograms_[0]);
-  self->last_histogram_ix_[0] = self->last_histogram_ix_[1] = 0;
-}
-
-/* Does either of three things:
-     (1) emits the current block with a new block type;
-     (2) emits the current block with the type of the second last block;
-     (3) merges the current block with the last block. */
-static void FN(BlockSplitterFinishBlock)(
-    FN(BlockSplitter)* self, BROTLI_BOOL is_final) {
-  BlockSplit* split = self->split_;
-  double* last_entropy = self->last_entropy_;
-  HistogramType* histograms = self->histograms_;
-  self->block_size_ =
-      BROTLI_MAX(size_t, self->block_size_, self->min_block_size_);
-  if (self->num_blocks_ == 0) {
-    /* Create first block. */
-    split->lengths[0] = (uint32_t)self->block_size_;
-    split->types[0] = 0;
-    last_entropy[0] =
-        BitsEntropy(histograms[0].data_, self->alphabet_size_);
-    last_entropy[1] = last_entropy[0];
-    ++self->num_blocks_;
-    ++split->num_types;
-    ++self->curr_histogram_ix_;
-    if (self->curr_histogram_ix_ < *self->histograms_size_)
-      FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
-    self->block_size_ = 0;
-  } else if (self->block_size_ > 0) {
-    double entropy = BitsEntropy(histograms[self->curr_histogram_ix_].data_,
-                                 self->alphabet_size_);
-    HistogramType combined_histo[2];
-    double combined_entropy[2];
-    double diff[2];
-    size_t j;
-    for (j = 0; j < 2; ++j) {
-      size_t last_histogram_ix = self->last_histogram_ix_[j];
-      combined_histo[j] = histograms[self->curr_histogram_ix_];
-      FN(HistogramAddHistogram)(&combined_histo[j],
-          &histograms[last_histogram_ix]);
-      combined_entropy[j] = BitsEntropy(
-          &combined_histo[j].data_[0], self->alphabet_size_);
-      diff[j] = combined_entropy[j] - entropy - last_entropy[j];
-    }
-
-    if (split->num_types < BROTLI_MAX_NUMBER_OF_BLOCK_TYPES &&
-        diff[0] > self->split_threshold_ &&
-        diff[1] > self->split_threshold_) {
-      /* Create new block. */
-      split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;
-      split->types[self->num_blocks_] = (uint8_t)split->num_types;
-      self->last_histogram_ix_[1] = self->last_histogram_ix_[0];
-      self->last_histogram_ix_[0] = (uint8_t)split->num_types;
-      last_entropy[1] = last_entropy[0];
-      last_entropy[0] = entropy;
-      ++self->num_blocks_;
-      ++split->num_types;
-      ++self->curr_histogram_ix_;
-      if (self->curr_histogram_ix_ < *self->histograms_size_)
-        FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
-      self->block_size_ = 0;
-      self->merge_last_count_ = 0;
-      self->target_block_size_ = self->min_block_size_;
-    } else if (diff[1] < diff[0] - 20.0) {
-      /* Combine this block with second last block. */
-      split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;
-      split->types[self->num_blocks_] = split->types[self->num_blocks_ - 2];
-      BROTLI_SWAP(size_t, self->last_histogram_ix_, 0, 1);
-      histograms[self->last_histogram_ix_[0]] = combined_histo[1];
-      last_entropy[1] = last_entropy[0];
-      last_entropy[0] = combined_entropy[1];
-      ++self->num_blocks_;
-      self->block_size_ = 0;
-      FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
-      self->merge_last_count_ = 0;
-      self->target_block_size_ = self->min_block_size_;
-    } else {
-      /* Combine this block with last block. */
-      split->lengths[self->num_blocks_ - 1] += (uint32_t)self->block_size_;
-      histograms[self->last_histogram_ix_[0]] = combined_histo[0];
-      last_entropy[0] = combined_entropy[0];
-      if (split->num_types == 1) {
-        last_entropy[1] = last_entropy[0];
-      }
-      self->block_size_ = 0;
-      FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);
-      if (++self->merge_last_count_ > 1) {
-        self->target_block_size_ += self->min_block_size_;
-      }
-    }
-  }
-  if (is_final) {
-    *self->histograms_size_ = split->num_types;
-    split->num_blocks = self->num_blocks_;
-  }
-}
-
-/* Adds the next symbol to the current histogram. When the current histogram
-   reaches the target size, decides on merging the block. */
-static void FN(BlockSplitterAddSymbol)(FN(BlockSplitter)* self, size_t symbol) {
-  FN(HistogramAdd)(&self->histograms_[self->curr_histogram_ix_], symbol);
-  ++self->block_size_;
-  if (self->block_size_ == self->target_block_size_) {
-    FN(BlockSplitterFinishBlock)(self, /* is_final = */ BROTLI_FALSE);
-  }
-}
-
-#undef HistogramType

package/vendor/brotli/c/enc/params.h

@@ -1,46 +0,0 @@
-/* Copyright 2017 Google Inc. All Rights Reserved.
-
-   Distributed under MIT license.
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
-*/
-
-/* Parameters for the Brotli encoder with chosen quality levels. */
-
-#ifndef BROTLI_ENC_PARAMS_H_
-#define BROTLI_ENC_PARAMS_H_
-
-#include <brotli/encode.h>
-#include "./encoder_dict.h"
-
-typedef struct BrotliHasherParams {
-  int type;
-  int bucket_bits;
-  int block_bits;
-  int hash_len;
-  int num_last_distances_to_check;
-} BrotliHasherParams;
-
-typedef struct BrotliDistanceParams {
-  uint32_t distance_postfix_bits;
-  uint32_t num_direct_distance_codes;
-  uint32_t alphabet_size_max;
-  uint32_t alphabet_size_limit;
-  size_t max_distance;
-} BrotliDistanceParams;
-
-/* Encoding parameters */
-typedef struct BrotliEncoderParams {
-  BrotliEncoderMode mode;
-  int quality;
-  int lgwin;
-  int lgblock;
-  size_t stream_offset;
-  size_t size_hint;
-  BROTLI_BOOL disable_literal_context_modeling;
-  BROTLI_BOOL large_window;
-  BrotliHasherParams hasher;
-  BrotliDistanceParams dist;
-  BrotliEncoderDictionary dictionary;
-} BrotliEncoderParams;
-
-#endif  /* BROTLI_ENC_PARAMS_H_ */

package/vendor/brotli/c/enc/prefix.h

@@ -1,53 +0,0 @@
-/* Copyright 2013 Google Inc. All Rights Reserved.
-
-   Distributed under MIT license.
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
-*/
-
-/* Functions for encoding of integers into prefix codes the amount of extra
-   bits, and the actual values of the extra bits. */
-
-#ifndef BROTLI_ENC_PREFIX_H_
-#define BROTLI_ENC_PREFIX_H_
-
-#include "../common/constants.h"
-#include "../common/platform.h"
-#include <brotli/types.h>
-#include "./fast_log.h"
-
-#if defined(__cplusplus) || defined(c_plusplus)
-extern "C" {
-#endif
-
-/* Here distance_code is an intermediate code, i.e. one of the special codes or
-   the actual distance increased by BROTLI_NUM_DISTANCE_SHORT_CODES - 1. */
-static BROTLI_INLINE void PrefixEncodeCopyDistance(size_t distance_code,
-                                                   size_t num_direct_codes,
-                                                   size_t postfix_bits,
-                                                   uint16_t* code,
-                                                   uint32_t* extra_bits) {
-  if (distance_code < BROTLI_NUM_DISTANCE_SHORT_CODES + num_direct_codes) {
-    *code = (uint16_t)distance_code;
-    *extra_bits = 0;
-    return;
-  } else {
-    size_t dist = ((size_t)1 << (postfix_bits + 2u)) +
-        (distance_code - BROTLI_NUM_DISTANCE_SHORT_CODES - num_direct_codes);
-    size_t bucket = Log2FloorNonZero(dist) - 1;
-    size_t postfix_mask = (1u << postfix_bits) - 1;
-    size_t postfix = dist & postfix_mask;
-    size_t prefix = (dist >> bucket) & 1;
-    size_t offset = (2 + prefix) << bucket;
-    size_t nbits = bucket - postfix_bits;
-    *code = (uint16_t)((nbits << 10) |
-        (BROTLI_NUM_DISTANCE_SHORT_CODES + num_direct_codes +
-         ((2 * (nbits - 1) + prefix) << postfix_bits) + postfix));
-    *extra_bits = (uint32_t)((dist - offset) >> postfix_bits);
-  }
-}
-
-#if defined(__cplusplus) || defined(c_plusplus)
-}  /* extern "C" */
-#endif
-
-#endif  /* BROTLI_ENC_PREFIX_H_ */

package/vendor/brotli/c/enc/quality.h

@@ -1,165 +0,0 @@
-/* Copyright 2016 Google Inc. All Rights Reserved.
-
-   Distributed under MIT license.
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
-*/
-
-/* Constants and formulas that affect speed-ratio trade-offs and thus define
-   quality levels. */
-
-#ifndef BROTLI_ENC_QUALITY_H_
-#define BROTLI_ENC_QUALITY_H_
-
-#include "../common/platform.h"
-#include <brotli/encode.h>
-#include "./params.h"
-
-#define FAST_ONE_PASS_COMPRESSION_QUALITY 0
-#define FAST_TWO_PASS_COMPRESSION_QUALITY 1
-#define ZOPFLIFICATION_QUALITY 10
-#define HQ_ZOPFLIFICATION_QUALITY 11
-
-#define MAX_QUALITY_FOR_STATIC_ENTROPY_CODES 2
-#define MIN_QUALITY_FOR_BLOCK_SPLIT 4
-#define MIN_QUALITY_FOR_NONZERO_DISTANCE_PARAMS 4
-#define MIN_QUALITY_FOR_OPTIMIZE_HISTOGRAMS 4
-#define MIN_QUALITY_FOR_EXTENSIVE_REFERENCE_SEARCH 5
-#define MIN_QUALITY_FOR_CONTEXT_MODELING 5
-#define MIN_QUALITY_FOR_HQ_CONTEXT_MODELING 7
-#define MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING 10
-
-/* For quality below MIN_QUALITY_FOR_BLOCK_SPLIT there is no block splitting,
-   so we buffer at most this much literals and commands. */
-#define MAX_NUM_DELAYED_SYMBOLS 0x2FFF
-
-/* Returns hash-table size for quality levels 0 and 1. */
-static BROTLI_INLINE size_t MaxHashTableSize(int quality) {
-  return quality == FAST_ONE_PASS_COMPRESSION_QUALITY ? 1 << 15 : 1 << 17;
-}
-
-/* The maximum length for which the zopflification uses distinct distances. */
-#define MAX_ZOPFLI_LEN_QUALITY_10 150
-#define MAX_ZOPFLI_LEN_QUALITY_11 325
-
-/* Do not thoroughly search when a long copy is found. */
-#define BROTLI_LONG_COPY_QUICK_STEP 16384
-
-static BROTLI_INLINE size_t MaxZopfliLen(const BrotliEncoderParams* params) {
-  return params->quality <= 10 ?
-      MAX_ZOPFLI_LEN_QUALITY_10 :
-      MAX_ZOPFLI_LEN_QUALITY_11;
-}
-
-/* Number of best candidates to evaluate to expand Zopfli chain. */
-static BROTLI_INLINE size_t MaxZopfliCandidates(
-  const BrotliEncoderParams* params) {
-  return params->quality <= 10 ? 1 : 5;
-}
-
-static BROTLI_INLINE void SanitizeParams(BrotliEncoderParams* params) {
-  params->quality = BROTLI_MIN(int, BROTLI_MAX_QUALITY,
-      BROTLI_MAX(int, BROTLI_MIN_QUALITY, params->quality));
-  if (params->quality <= MAX_QUALITY_FOR_STATIC_ENTROPY_CODES) {
-    params->large_window = BROTLI_FALSE;
-  }
-  if (params->lgwin < BROTLI_MIN_WINDOW_BITS) {
-    params->lgwin = BROTLI_MIN_WINDOW_BITS;
-  } else {
-    int max_lgwin = params->large_window ? BROTLI_LARGE_MAX_WINDOW_BITS :
-                                           BROTLI_MAX_WINDOW_BITS;
-    if (params->lgwin > max_lgwin) params->lgwin = max_lgwin;
-  }
-}
-
-/* Returns optimized lg_block value. */
-static BROTLI_INLINE int ComputeLgBlock(const BrotliEncoderParams* params) {
-  int lgblock = params->lgblock;
-  if (params->quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||
-      params->quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {
-    lgblock = params->lgwin;
-  } else if (params->quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {
-    lgblock = 14;
-  } else if (lgblock == 0) {
-    lgblock = 16;
-    if (params->quality >= 9 && params->lgwin > lgblock) {
-      lgblock = BROTLI_MIN(int, 18, params->lgwin);
-    }
-  } else {
-    lgblock = BROTLI_MIN(int, BROTLI_MAX_INPUT_BLOCK_BITS,
-        BROTLI_MAX(int, BROTLI_MIN_INPUT_BLOCK_BITS, lgblock));
-  }
-  return lgblock;
-}
-
-/* Returns log2 of the size of main ring buffer area.
-   Allocate at least lgwin + 1 bits for the ring buffer so that the newly
-   added block fits there completely and we still get lgwin bits and at least
-   read_block_size_bits + 1 bits because the copy tail length needs to be
-   smaller than ring-buffer size. */
-static BROTLI_INLINE int ComputeRbBits(const BrotliEncoderParams* params) {
-  return 1 + BROTLI_MAX(int, params->lgwin, params->lgblock);
-}
-
-static BROTLI_INLINE size_t MaxMetablockSize(
-    const BrotliEncoderParams* params) {
-  int bits =
-      BROTLI_MIN(int, ComputeRbBits(params), BROTLI_MAX_INPUT_BLOCK_BITS);
-  return (size_t)1 << bits;
-}
-
-/* When searching for backward references and have not seen matches for a long
-   time, we can skip some match lookups. Unsuccessful match lookups are very
-   expensive and this kind of a heuristic speeds up compression quite a lot.
-   At first 8 byte strides are taken and every second byte is put to hasher.
-   After 4x more literals stride by 16 bytes, every put 4-th byte to hasher.
-   Applied only to qualities 2 to 9. */
-static BROTLI_INLINE size_t LiteralSpreeLengthForSparseSearch(
-    const BrotliEncoderParams* params) {
-  return params->quality < 9 ? 64 : 512;
-}
-
-static BROTLI_INLINE void ChooseHasher(const BrotliEncoderParams* params,
-                                       BrotliHasherParams* hparams) {
-  if (params->quality > 9) {
-    hparams->type = 10;
-  } else if (params->quality == 4 && params->size_hint >= (1 << 20)) {
-    hparams->type = 54;
-  } else if (params->quality < 5) {
-    hparams->type = params->quality;
-  } else if (params->lgwin <= 16) {
-    hparams->type = params->quality < 7 ? 40 : params->quality < 9 ? 41 : 42;
-  } else if (params->size_hint >= (1 << 20) && params->lgwin >= 19) {
-    hparams->type = 6;
-    hparams->block_bits = params->quality - 1;
-    hparams->bucket_bits = 15;
-    hparams->hash_len = 5;
-    hparams->num_last_distances_to_check =
-        params->quality < 7 ? 4 : params->quality < 9 ? 10 : 16;
-  } else {
-    hparams->type = 5;
-    hparams->block_bits = params->quality - 1;
-    hparams->bucket_bits = params->quality < 7 ? 14 : 15;
-    hparams->num_last_distances_to_check =
-        params->quality < 7 ? 4 : params->quality < 9 ? 10 : 16;
-  }
-
-  if (params->lgwin > 24) {
-    /* Different hashers for large window brotli: not for qualities <= 2,
-       these are too fast for large window. Not for qualities >= 10: their
-       hasher already works well with large window. So the changes are:
-       H3 --> H35: for quality 3.
-       H54 --> H55: for quality 4 with size hint > 1MB
-       H6 --> H65: for qualities 5, 6, 7, 8, 9. */
-    if (hparams->type == 3) {
-      hparams->type = 35;
-    }
-    if (hparams->type == 54) {
-      hparams->type = 55;
-    }
-    if (hparams->type == 6) {
-      hparams->type = 65;
-    }
-  }
-}
-
-#endif  /* BROTLI_ENC_QUALITY_H_ */