BaseTools: resolve initialization order errors in VfrFormPkg.h

[mirror_edk2.git] / BaseTools / Source / C / BrotliCompress / enc / bit_cost_inc.h

/* NOLINT(build/header_guard) */\r
/* Copyright 2013 Google Inc. All Rights Reserved.\r
\r
   Distributed under MIT license.\r
   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\r
*/\r
\r
/* template parameters: FN */\r
\r
#define HistogramType FN(Histogram)\r
\r
double FN(BrotliPopulationCost)(const HistogramType* histogram) {\r
  static const double kOneSymbolHistogramCost = 12;\r
  static const double kTwoSymbolHistogramCost = 20;\r
  static const double kThreeSymbolHistogramCost = 28;\r
  static const double kFourSymbolHistogramCost = 37;\r
  const size_t data_size = FN(HistogramDataSize)();\r
  int count = 0;\r
  size_t s[5];\r
  double bits = 0.0;\r
  size_t i;\r
  if (histogram->total_count_ == 0) {\r
    return kOneSymbolHistogramCost;\r
  }\r
  for (i = 0; i < data_size; ++i) {\r
    if (histogram->data_[i] > 0) {\r
      s[count] = i;\r
      ++count;\r
      if (count > 4) break;\r
    }\r
  }\r
  if (count == 1) {\r
    return kOneSymbolHistogramCost;\r
  }\r
  if (count == 2) {\r
    return (kTwoSymbolHistogramCost + (double)histogram->total_count_);\r
  }\r
  if (count == 3) {\r
    const uint32_t histo0 = histogram->data_[s[0]];\r
    const uint32_t histo1 = histogram->data_[s[1]];\r
    const uint32_t histo2 = histogram->data_[s[2]];\r
    const uint32_t histomax =\r
        BROTLI_MAX(uint32_t, histo0, BROTLI_MAX(uint32_t, histo1, histo2));\r
    return (kThreeSymbolHistogramCost +\r
            2 * (histo0 + histo1 + histo2) - histomax);\r
  }\r
  if (count == 4) {\r
    uint32_t histo[4];\r
    uint32_t h23;\r
    uint32_t histomax;\r
    for (i = 0; i < 4; ++i) {\r
      histo[i] = histogram->data_[s[i]];\r
    }\r
    /* Sort */\r
    for (i = 0; i < 4; ++i) {\r
      size_t j;\r
      for (j = i + 1; j < 4; ++j) {\r
        if (histo[j] > histo[i]) {\r
          BROTLI_SWAP(uint32_t, histo, j, i);\r
        }\r
      }\r
    }\r
    h23 = histo[2] + histo[3];\r
    histomax = BROTLI_MAX(uint32_t, h23, histo[0]);\r
    return (kFourSymbolHistogramCost +\r
            3 * h23 + 2 * (histo[0] + histo[1]) - histomax);\r
  }\r
\r
  {\r
    /* In this loop we compute the entropy of the histogram and simultaneously\r
       build a simplified histogram of the code length codes where we use the\r
       zero repeat code 17, but we don't use the non-zero repeat code 16. */\r
    size_t max_depth = 1;\r
    uint32_t depth_histo[BROTLI_CODE_LENGTH_CODES] = { 0 };\r
    const double log2total = FastLog2(histogram->total_count_);\r
    for (i = 0; i < data_size;) {\r
      if (histogram->data_[i] > 0) {\r
        /* Compute -log2(P(symbol)) = -log2(count(symbol)/total_count) =\r
                                    = log2(total_count) - log2(count(symbol)) */\r
        double log2p = log2total - FastLog2(histogram->data_[i]);\r
        /* Approximate the bit depth by round(-log2(P(symbol))) */\r
        size_t depth = (size_t)(log2p + 0.5);\r
        bits += histogram->data_[i] * log2p;\r
        if (depth > 15) {\r
          depth = 15;\r
        }\r
        if (depth > max_depth) {\r
          max_depth = depth;\r
        }\r
        ++depth_histo[depth];\r
        ++i;\r
      } else {\r
        /* Compute the run length of zeros and add the appropriate number of 0\r
           and 17 code length codes to the code length code histogram. */\r
        uint32_t reps = 1;\r
        size_t k;\r
        for (k = i + 1; k < data_size && histogram->data_[k] == 0; ++k) {\r
          ++reps;\r
        }\r
        i += reps;\r
        if (i == data_size) {\r
          /* Don't add any cost for the last zero run, since these are encoded\r
             only implicitly. */\r
          break;\r
        }\r
        if (reps < 3) {\r
          depth_histo[0] += reps;\r
        } else {\r
          reps -= 2;\r
          while (reps > 0) {\r
            ++depth_histo[BROTLI_REPEAT_ZERO_CODE_LENGTH];\r
            /* Add the 3 extra bits for the 17 code length code. */\r
            bits += 3;\r
            reps >>= 3;\r
          }\r
        }\r
      }\r
    }\r
    /* Add the estimated encoding cost of the code length code histogram. */\r
    bits += (double)(18 + 2 * max_depth);\r
    /* Add the entropy of the code length code histogram. */\r
    bits += BitsEntropy(depth_histo, BROTLI_CODE_LENGTH_CODES);\r
  }\r
  return bits;\r
}\r
\r
#undef HistogramType\r