tor-browser

The Tor Browser
git clone https://git.dasho.dev/tor-browser.git
Log | Files | Refs | README | LICENSE

cost_sse2.c (4571B)


      1 // Copyright 2015 Google Inc. All Rights Reserved.
      2 //
      3 // Use of this source code is governed by a BSD-style license
      4 // that can be found in the COPYING file in the root of the source
      5 // tree. An additional intellectual property rights grant can be found
      6 // in the file PATENTS. All contributing project authors may
      7 // be found in the AUTHORS file in the root of the source tree.
      8 // -----------------------------------------------------------------------------
      9 //
     10 // SSE2 version of cost functions
     11 //
     12 // Author: Skal (pascal.massimino@gmail.com)
     13 
     14 #include "src/dsp/dsp.h"
     15 
     16 #if defined(WEBP_USE_SSE2)
     17 #include <emmintrin.h>
     18 
     19 #include <assert.h>
     20 
     21 #include "src/webp/types.h"
     22 #include "src/dsp/cpu.h"
     23 #include "src/enc/cost_enc.h"
     24 #include "src/enc/vp8i_enc.h"
     25 #include "src/utils/utils.h"
     26 
     27 //------------------------------------------------------------------------------
     28 
     29 static void SetResidualCoeffs_SSE2(const int16_t* WEBP_RESTRICT const coeffs,
     30                                   VP8Residual* WEBP_RESTRICT const res) {
     31  const __m128i c0 = _mm_loadu_si128((const __m128i*)(coeffs + 0));
     32  const __m128i c1 = _mm_loadu_si128((const __m128i*)(coeffs + 8));
     33  // Use SSE2 to compare 16 values with a single instruction.
     34  const __m128i zero = _mm_setzero_si128();
     35  const __m128i m0 = _mm_packs_epi16(c0, c1);
     36  const __m128i m1 = _mm_cmpeq_epi8(m0, zero);
     37  // Get the comparison results as a bitmask into 16bits. Negate the mask to get
     38  // the position of entries that are not equal to zero. We don't need to mask
     39  // out least significant bits according to res->first, since coeffs[0] is 0
     40  // if res->first > 0.
     41  const uint32_t mask = 0x0000ffffu ^ (uint32_t)_mm_movemask_epi8(m1);
     42  // The position of the most significant non-zero bit indicates the position of
     43  // the last non-zero value.
     44  assert(res->first == 0 || coeffs[0] == 0);
     45  res->last = mask ? BitsLog2Floor(mask) : -1;
     46  res->coeffs = coeffs;
     47 }
     48 
     49 static int GetResidualCost_SSE2(int ctx0, const VP8Residual* const res) {
     50  uint8_t levels[16], ctxs[16];
     51  uint16_t abs_levels[16];
     52  int n = res->first;
     53  // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1
     54  const int p0 = res->prob[n][ctx0][0];
     55  CostArrayPtr const costs = res->costs;
     56  const uint16_t* t = costs[n][ctx0];
     57  // bit_cost(1, p0) is already incorporated in t[] tables, but only if ctx != 0
     58  // (as required by the syntax). For ctx0 == 0, we need to add it here or it'll
     59  // be missing during the loop.
     60  int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0;
     61 
     62  if (res->last < 0) {
     63    return VP8BitCost(0, p0);
     64  }
     65 
     66  {   // precompute clamped levels and contexts, packed to 8b.
     67    const __m128i zero = _mm_setzero_si128();
     68    const __m128i kCst2 = _mm_set1_epi8(2);
     69    const __m128i kCst67 = _mm_set1_epi8(MAX_VARIABLE_LEVEL);
     70    const __m128i c0 = _mm_loadu_si128((const __m128i*)&res->coeffs[0]);
     71    const __m128i c1 = _mm_loadu_si128((const __m128i*)&res->coeffs[8]);
     72    const __m128i D0 = _mm_sub_epi16(zero, c0);
     73    const __m128i D1 = _mm_sub_epi16(zero, c1);
     74    const __m128i E0 = _mm_max_epi16(c0, D0);   // abs(v), 16b
     75    const __m128i E1 = _mm_max_epi16(c1, D1);
     76    const __m128i F = _mm_packs_epi16(E0, E1);
     77    const __m128i G = _mm_min_epu8(F, kCst2);    // context = 0,1,2
     78    const __m128i H = _mm_min_epu8(F, kCst67);   // clamp_level in [0..67]
     79 
     80    _mm_storeu_si128((__m128i*)&ctxs[0], G);
     81    _mm_storeu_si128((__m128i*)&levels[0], H);
     82 
     83    _mm_storeu_si128((__m128i*)&abs_levels[0], E0);
     84    _mm_storeu_si128((__m128i*)&abs_levels[8], E1);
     85  }
     86  for (; n < res->last; ++n) {
     87    const int ctx = ctxs[n];
     88    const int level = levels[n];
     89    const int flevel = abs_levels[n];   // full level
     90    cost += VP8LevelFixedCosts[flevel] + t[level];  // simplified VP8LevelCost()
     91    t = costs[n + 1][ctx];
     92  }
     93  // Last coefficient is always non-zero
     94  {
     95    const int level = levels[n];
     96    const int flevel = abs_levels[n];
     97    assert(flevel != 0);
     98    cost += VP8LevelFixedCosts[flevel] + t[level];
     99    if (n < 15) {
    100      const int b = VP8EncBands[n + 1];
    101      const int ctx = ctxs[n];
    102      const int last_p0 = res->prob[b][ctx][0];
    103      cost += VP8BitCost(0, last_p0);
    104    }
    105  }
    106  return cost;
    107 }
    108 
    109 //------------------------------------------------------------------------------
    110 // Entry point
    111 
    112 extern void VP8EncDspCostInitSSE2(void);
    113 
    114 WEBP_TSAN_IGNORE_FUNCTION void VP8EncDspCostInitSSE2(void) {
    115  VP8SetResidualCoeffs = SetResidualCoeffs_SSE2;
    116  VP8GetResidualCost = GetResidualCost_SSE2;
    117 }
    118 
    119 #else  // !WEBP_USE_SSE2
    120 
    121 WEBP_DSP_INIT_STUB(VP8EncDspCostInitSSE2)
    122 
    123 #endif  // WEBP_USE_SSE2