Coverage Report

Created: 2026-07-30 06:27

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/work/vvenc/source/Lib/CommonLib/TrQuant.cpp
Line
Count
Source
1
/* -----------------------------------------------------------------------------
2
The copyright in this software is being made available under the Clear BSD
3
License, included below. No patent rights, trademark rights and/or 
4
other Intellectual Property Rights other than the copyrights concerning 
5
the Software are granted under this license.
6
7
The Clear BSD License
8
9
Copyright (c) 2019-2026, Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. & The VVenC Authors.
10
All rights reserved.
11
12
Redistribution and use in source and binary forms, with or without modification,
13
are permitted (subject to the limitations in the disclaimer below) provided that
14
the following conditions are met:
15
16
     * Redistributions of source code must retain the above copyright notice,
17
     this list of conditions and the following disclaimer.
18
19
     * Redistributions in binary form must reproduce the above copyright
20
     notice, this list of conditions and the following disclaimer in the
21
     documentation and/or other materials provided with the distribution.
22
23
     * Neither the name of the copyright holder nor the names of its
24
     contributors may be used to endorse or promote products derived from this
25
     software without specific prior written permission.
26
27
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY
28
THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
29
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
31
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
32
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
33
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
34
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
35
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
36
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
37
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
38
POSSIBILITY OF SUCH DAMAGE.
39
40
41
------------------------------------------------------------------------------------------- */
42
43
44
/** \file     TrQuant.cpp
45
    \brief    transform and quantization class
46
*/
47
48
#include "TrQuant.h"
49
#include "TrQuant_EMT.h"
50
#include "QuantRDOQ.h"
51
#include "DepQuant.h"
52
#include "UnitTools.h"
53
#include "ContextModelling.h"
54
#include "CodingStructure.h"
55
#include "dtrace_buffer.h"
56
#include "TimeProfiler.h"
57
#include "SearchSpaceCounter.h"
58
59
#include <stdlib.h>
60
#include <memory.h>
61
62
//! \ingroup CommonLib
63
//! \{
64
65
namespace vvenc {
66
67
struct coeffGroupRDStats
68
{
69
  int    iNNZbeforePos0;
70
  double d64CodedLevelandDist; // distortion and level cost only
71
  double d64UncodedDist;    // all zero coded block distortion
72
  double d64SigCost;
73
  double d64SigCost_0;
74
};
75
76
FwdTrans *const fastFwdTrans[NUM_TRANS_TYPE][g_numTransformMatrixSizes] =
77
{
78
  { fastForwardDCT2_B2, fastForwardDCT2_B4, fastForwardDCT2_B8, fastForwardDCT2_B16, fastForwardDCT2_B32, fastForwardDCT2_B64 },
79
  { nullptr,            fastForwardDCT8_B4, fastForwardDCT8_B8, fastForwardDCT8_B16, fastForwardDCT8_B32, nullptr },
80
  { nullptr,            fastForwardDST7_B4, fastForwardDST7_B8, fastForwardDST7_B16, fastForwardDST7_B32, nullptr },
81
};
82
83
InvTrans *const fastInvTrans[NUM_TRANS_TYPE][g_numTransformMatrixSizes] =
84
{
85
  { fastInverseDCT2_B2, fastInverseDCT2_B4, fastInverseDCT2_B8, fastInverseDCT2_B16, fastInverseDCT2_B32, fastInverseDCT2_B64 },
86
  { nullptr,            fastInverseDCT8_B4, fastInverseDCT8_B8, fastInverseDCT8_B16, fastInverseDCT8_B32, nullptr },
87
  { nullptr,            fastInverseDST7_B4, fastInverseDST7_B8, fastInverseDST7_B16, fastInverseDST7_B32, nullptr },
88
};
89
90
//! \ingroup CommonLib
91
//! \{
92
93
358M
static inline int64_t square( const int d ) { return d * (int64_t)d; }
94
95
template<int signedMode> std::pair<int64_t,int64_t> fwdTransformCbCr( const PelBuf& resCb, const PelBuf& resCr, PelBuf& resC1, PelBuf& resC2 )
96
1.07M
{
97
1.07M
  const Pel*  cb  = resCb.buf;
98
1.07M
  const Pel*  cr  = resCr.buf;
99
1.07M
  Pel*        c1  = resC1.buf;
100
1.07M
  Pel*        c2  = resC2.buf;
101
1.07M
  int64_t     d1  = 0;
102
1.07M
  int64_t     d2  = 0;
103
14.4M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride, c1 += resC1.stride, c2 += resC2.stride )
104
13.3M
  {
105
192M
    for( SizeType x = 0; x < resCb.width; x++ )
106
179M
    {
107
179M
      int cbx = cb[x], crx = cr[x];
108
179M
      if      ( signedMode ==  1 )
109
44.7M
      {
110
44.7M
        c1[x] = Pel( ( 4*cbx + 2*crx ) / 5 );
111
44.7M
        d1   += square( cbx - c1[x] ) + square( crx - (c1[x]>>1) );
112
44.7M
      }
113
134M
      else if ( signedMode == -1 )
114
0
      {
115
0
        c1[x] = Pel( ( 4*cbx - 2*crx ) / 5 );
116
0
        d1   += square( cbx - c1[x] ) + square( crx - (-c1[x]>>1) );
117
0
      }
118
134M
      else if ( signedMode ==  2 )
119
44.7M
      {
120
44.7M
        c1[x] = Pel( ( cbx + crx ) / 2 );
121
44.7M
        d1   += square( cbx - c1[x] ) + square( crx - c1[x] );
122
44.7M
      }
123
89.5M
      else if ( signedMode == -2 )
124
0
      {
125
0
        c1[x] = Pel( ( cbx - crx ) / 2 );
126
0
        d1   += square( cbx - c1[x] ) + square( crx + c1[x] );
127
0
      }
128
89.5M
      else if ( signedMode ==  3 )
129
44.7M
      {
130
44.7M
        c2[x] = Pel( ( 4*crx + 2*cbx ) / 5 );
131
44.7M
        d1   += square( cbx - (c2[x]>>1) ) + square( crx - c2[x] );
132
44.7M
      }
133
44.7M
      else if ( signedMode == -3 )
134
0
      {
135
0
        c2[x] = Pel( ( 4*crx - 2*cbx ) / 5 );
136
0
        d1   += square( cbx - (-c2[x]>>1) ) + square( crx - c2[x] );
137
0
      }
138
44.7M
      else
139
44.7M
      {
140
44.7M
        d1   += square( cbx );
141
44.7M
        d2   += square( crx );
142
44.7M
      }
143
179M
    }
144
13.3M
  }
145
1.07M
  return std::make_pair(d1,d2);
146
1.07M
}
std::__1::pair<long, long> vvenc::fwdTransformCbCr<0>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Line
Count
Source
96
267k
{
97
267k
  const Pel*  cb  = resCb.buf;
98
267k
  const Pel*  cr  = resCr.buf;
99
267k
  Pel*        c1  = resC1.buf;
100
267k
  Pel*        c2  = resC2.buf;
101
267k
  int64_t     d1  = 0;
102
267k
  int64_t     d2  = 0;
103
3.60M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride, c1 += resC1.stride, c2 += resC2.stride )
104
3.33M
  {
105
48.1M
    for( SizeType x = 0; x < resCb.width; x++ )
106
44.7M
    {
107
44.7M
      int cbx = cb[x], crx = cr[x];
108
44.7M
      if      ( signedMode ==  1 )
109
0
      {
110
0
        c1[x] = Pel( ( 4*cbx + 2*crx ) / 5 );
111
0
        d1   += square( cbx - c1[x] ) + square( crx - (c1[x]>>1) );
112
0
      }
113
44.7M
      else if ( signedMode == -1 )
114
0
      {
115
0
        c1[x] = Pel( ( 4*cbx - 2*crx ) / 5 );
116
0
        d1   += square( cbx - c1[x] ) + square( crx - (-c1[x]>>1) );
117
0
      }
118
44.7M
      else if ( signedMode ==  2 )
119
0
      {
120
0
        c1[x] = Pel( ( cbx + crx ) / 2 );
121
0
        d1   += square( cbx - c1[x] ) + square( crx - c1[x] );
122
0
      }
123
44.7M
      else if ( signedMode == -2 )
124
0
      {
125
0
        c1[x] = Pel( ( cbx - crx ) / 2 );
126
0
        d1   += square( cbx - c1[x] ) + square( crx + c1[x] );
127
0
      }
128
44.7M
      else if ( signedMode ==  3 )
129
0
      {
130
0
        c2[x] = Pel( ( 4*crx + 2*cbx ) / 5 );
131
0
        d1   += square( cbx - (c2[x]>>1) ) + square( crx - c2[x] );
132
0
      }
133
44.7M
      else if ( signedMode == -3 )
134
0
      {
135
0
        c2[x] = Pel( ( 4*crx - 2*cbx ) / 5 );
136
0
        d1   += square( cbx - (-c2[x]>>1) ) + square( crx - c2[x] );
137
0
      }
138
44.7M
      else
139
44.7M
      {
140
44.7M
        d1   += square( cbx );
141
44.7M
        d2   += square( crx );
142
44.7M
      }
143
44.7M
    }
144
3.33M
  }
145
267k
  return std::make_pair(d1,d2);
146
267k
}
std::__1::pair<long, long> vvenc::fwdTransformCbCr<1>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Line
Count
Source
96
267k
{
97
267k
  const Pel*  cb  = resCb.buf;
98
267k
  const Pel*  cr  = resCr.buf;
99
267k
  Pel*        c1  = resC1.buf;
100
267k
  Pel*        c2  = resC2.buf;
101
267k
  int64_t     d1  = 0;
102
267k
  int64_t     d2  = 0;
103
3.60M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride, c1 += resC1.stride, c2 += resC2.stride )
104
3.33M
  {
105
48.1M
    for( SizeType x = 0; x < resCb.width; x++ )
106
44.7M
    {
107
44.7M
      int cbx = cb[x], crx = cr[x];
108
44.7M
      if      ( signedMode ==  1 )
109
44.7M
      {
110
44.7M
        c1[x] = Pel( ( 4*cbx + 2*crx ) / 5 );
111
44.7M
        d1   += square( cbx - c1[x] ) + square( crx - (c1[x]>>1) );
112
44.7M
      }
113
0
      else if ( signedMode == -1 )
114
0
      {
115
0
        c1[x] = Pel( ( 4*cbx - 2*crx ) / 5 );
116
0
        d1   += square( cbx - c1[x] ) + square( crx - (-c1[x]>>1) );
117
0
      }
118
0
      else if ( signedMode ==  2 )
119
0
      {
120
0
        c1[x] = Pel( ( cbx + crx ) / 2 );
121
0
        d1   += square( cbx - c1[x] ) + square( crx - c1[x] );
122
0
      }
123
0
      else if ( signedMode == -2 )
124
0
      {
125
0
        c1[x] = Pel( ( cbx - crx ) / 2 );
126
0
        d1   += square( cbx - c1[x] ) + square( crx + c1[x] );
127
0
      }
128
0
      else if ( signedMode ==  3 )
129
0
      {
130
0
        c2[x] = Pel( ( 4*crx + 2*cbx ) / 5 );
131
0
        d1   += square( cbx - (c2[x]>>1) ) + square( crx - c2[x] );
132
0
      }
133
0
      else if ( signedMode == -3 )
134
0
      {
135
0
        c2[x] = Pel( ( 4*crx - 2*cbx ) / 5 );
136
0
        d1   += square( cbx - (-c2[x]>>1) ) + square( crx - c2[x] );
137
0
      }
138
0
      else
139
0
      {
140
0
        d1   += square( cbx );
141
0
        d2   += square( crx );
142
0
      }
143
44.7M
    }
144
3.33M
  }
145
267k
  return std::make_pair(d1,d2);
146
267k
}
Unexecuted instantiation: std::__1::pair<long, long> vvenc::fwdTransformCbCr<-1>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
std::__1::pair<long, long> vvenc::fwdTransformCbCr<2>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Line
Count
Source
96
267k
{
97
267k
  const Pel*  cb  = resCb.buf;
98
267k
  const Pel*  cr  = resCr.buf;
99
267k
  Pel*        c1  = resC1.buf;
100
267k
  Pel*        c2  = resC2.buf;
101
267k
  int64_t     d1  = 0;
102
267k
  int64_t     d2  = 0;
103
3.60M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride, c1 += resC1.stride, c2 += resC2.stride )
104
3.33M
  {
105
48.1M
    for( SizeType x = 0; x < resCb.width; x++ )
106
44.7M
    {
107
44.7M
      int cbx = cb[x], crx = cr[x];
108
44.7M
      if      ( signedMode ==  1 )
109
0
      {
110
0
        c1[x] = Pel( ( 4*cbx + 2*crx ) / 5 );
111
0
        d1   += square( cbx - c1[x] ) + square( crx - (c1[x]>>1) );
112
0
      }
113
44.7M
      else if ( signedMode == -1 )
114
0
      {
115
0
        c1[x] = Pel( ( 4*cbx - 2*crx ) / 5 );
116
0
        d1   += square( cbx - c1[x] ) + square( crx - (-c1[x]>>1) );
117
0
      }
118
44.7M
      else if ( signedMode ==  2 )
119
44.7M
      {
120
44.7M
        c1[x] = Pel( ( cbx + crx ) / 2 );
121
44.7M
        d1   += square( cbx - c1[x] ) + square( crx - c1[x] );
122
44.7M
      }
123
0
      else if ( signedMode == -2 )
124
0
      {
125
0
        c1[x] = Pel( ( cbx - crx ) / 2 );
126
0
        d1   += square( cbx - c1[x] ) + square( crx + c1[x] );
127
0
      }
128
0
      else if ( signedMode ==  3 )
129
0
      {
130
0
        c2[x] = Pel( ( 4*crx + 2*cbx ) / 5 );
131
0
        d1   += square( cbx - (c2[x]>>1) ) + square( crx - c2[x] );
132
0
      }
133
0
      else if ( signedMode == -3 )
134
0
      {
135
0
        c2[x] = Pel( ( 4*crx - 2*cbx ) / 5 );
136
0
        d1   += square( cbx - (-c2[x]>>1) ) + square( crx - c2[x] );
137
0
      }
138
0
      else
139
0
      {
140
0
        d1   += square( cbx );
141
0
        d2   += square( crx );
142
0
      }
143
44.7M
    }
144
3.33M
  }
145
267k
  return std::make_pair(d1,d2);
146
267k
}
Unexecuted instantiation: std::__1::pair<long, long> vvenc::fwdTransformCbCr<-2>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
std::__1::pair<long, long> vvenc::fwdTransformCbCr<3>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Line
Count
Source
96
267k
{
97
267k
  const Pel*  cb  = resCb.buf;
98
267k
  const Pel*  cr  = resCr.buf;
99
267k
  Pel*        c1  = resC1.buf;
100
267k
  Pel*        c2  = resC2.buf;
101
267k
  int64_t     d1  = 0;
102
267k
  int64_t     d2  = 0;
103
3.60M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride, c1 += resC1.stride, c2 += resC2.stride )
104
3.33M
  {
105
48.1M
    for( SizeType x = 0; x < resCb.width; x++ )
106
44.7M
    {
107
44.7M
      int cbx = cb[x], crx = cr[x];
108
44.7M
      if      ( signedMode ==  1 )
109
0
      {
110
0
        c1[x] = Pel( ( 4*cbx + 2*crx ) / 5 );
111
0
        d1   += square( cbx - c1[x] ) + square( crx - (c1[x]>>1) );
112
0
      }
113
44.7M
      else if ( signedMode == -1 )
114
0
      {
115
0
        c1[x] = Pel( ( 4*cbx - 2*crx ) / 5 );
116
0
        d1   += square( cbx - c1[x] ) + square( crx - (-c1[x]>>1) );
117
0
      }
118
44.7M
      else if ( signedMode ==  2 )
119
0
      {
120
0
        c1[x] = Pel( ( cbx + crx ) / 2 );
121
0
        d1   += square( cbx - c1[x] ) + square( crx - c1[x] );
122
0
      }
123
44.7M
      else if ( signedMode == -2 )
124
0
      {
125
0
        c1[x] = Pel( ( cbx - crx ) / 2 );
126
0
        d1   += square( cbx - c1[x] ) + square( crx + c1[x] );
127
0
      }
128
44.7M
      else if ( signedMode ==  3 )
129
44.7M
      {
130
44.7M
        c2[x] = Pel( ( 4*crx + 2*cbx ) / 5 );
131
44.7M
        d1   += square( cbx - (c2[x]>>1) ) + square( crx - c2[x] );
132
44.7M
      }
133
0
      else if ( signedMode == -3 )
134
0
      {
135
0
        c2[x] = Pel( ( 4*crx - 2*cbx ) / 5 );
136
0
        d1   += square( cbx - (-c2[x]>>1) ) + square( crx - c2[x] );
137
0
      }
138
0
      else
139
0
      {
140
0
        d1   += square( cbx );
141
0
        d2   += square( crx );
142
0
      }
143
44.7M
    }
144
3.33M
  }
145
267k
  return std::make_pair(d1,d2);
146
267k
}
Unexecuted instantiation: std::__1::pair<long, long> vvenc::fwdTransformCbCr<-3>(vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short> const&, vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
147
148
template<int signedMode> void invTransformCbCr( PelBuf& resCb, PelBuf& resCr )
149
264k
{
150
264k
  Pel*  cb  = resCb.buf;
151
264k
  Pel*  cr  = resCr.buf;
152
3.56M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride )
153
3.29M
  {
154
47.6M
    for( SizeType x = 0; x < resCb.width; x++ )
155
44.3M
    {
156
44.3M
      if      ( signedMode ==  1 )  { cr[x] =  cb[x] >> 1;  }
157
44.3M
      else if ( signedMode == -1 )  { cr[x] = -cb[x] >> 1;  }
158
44.3M
      else if ( signedMode ==  2 )  { cr[x] =  cb[x]; }
159
247k
      else if ( signedMode == -2 )  { cr[x] = -cb[x]; }
160
247k
      else if ( signedMode ==  3 )  { cb[x] =  cr[x] >> 1; }
161
0
      else if ( signedMode == -3 )  { cb[x] = -cr[x] >> 1; }
162
44.3M
    }
163
3.29M
  }
164
264k
}
Unexecuted instantiation: void vvenc::invTransformCbCr<0>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Unexecuted instantiation: void vvenc::invTransformCbCr<1>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Unexecuted instantiation: void vvenc::invTransformCbCr<-1>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
void vvenc::invTransformCbCr<2>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Line
Count
Source
149
262k
{
150
262k
  Pel*  cb  = resCb.buf;
151
262k
  Pel*  cr  = resCr.buf;
152
3.53M
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride )
153
3.27M
  {
154
47.3M
    for( SizeType x = 0; x < resCb.width; x++ )
155
44.0M
    {
156
44.0M
      if      ( signedMode ==  1 )  { cr[x] =  cb[x] >> 1;  }
157
44.0M
      else if ( signedMode == -1 )  { cr[x] = -cb[x] >> 1;  }
158
44.0M
      else if ( signedMode ==  2 )  { cr[x] =  cb[x]; }
159
0
      else if ( signedMode == -2 )  { cr[x] = -cb[x]; }
160
0
      else if ( signedMode ==  3 )  { cb[x] =  cr[x] >> 1; }
161
0
      else if ( signedMode == -3 )  { cb[x] = -cr[x] >> 1; }
162
44.0M
    }
163
3.27M
  }
164
262k
}
Unexecuted instantiation: void vvenc::invTransformCbCr<-2>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
void vvenc::invTransformCbCr<3>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
Line
Count
Source
149
1.79k
{
150
1.79k
  Pel*  cb  = resCb.buf;
151
1.79k
  Pel*  cr  = resCr.buf;
152
23.6k
  for( SizeType y = 0; y < resCb.height; y++, cb += resCb.stride, cr += resCr.stride )
153
21.8k
  {
154
268k
    for( SizeType x = 0; x < resCb.width; x++ )
155
247k
    {
156
247k
      if      ( signedMode ==  1 )  { cr[x] =  cb[x] >> 1;  }
157
247k
      else if ( signedMode == -1 )  { cr[x] = -cb[x] >> 1;  }
158
247k
      else if ( signedMode ==  2 )  { cr[x] =  cb[x]; }
159
247k
      else if ( signedMode == -2 )  { cr[x] = -cb[x]; }
160
247k
      else if ( signedMode ==  3 )  { cb[x] =  cr[x] >> 1; }
161
0
      else if ( signedMode == -3 )  { cb[x] = -cr[x] >> 1; }
162
247k
    }
163
21.8k
  }
164
1.79k
}
Unexecuted instantiation: void vvenc::invTransformCbCr<-3>(vvenc::AreaBuf<short>&, vvenc::AreaBuf<short>&)
165
166
void xFwdLfnstNxNCore(int *src, int *dst, const uint32_t mode, const uint32_t index, const uint32_t size, int zeroOutSize)
167
1.18M
{
168
1.18M
  const int8_t *trMat  = (size > 4) ? g_lfnstFwd8x8[mode][index][0] : g_lfnstFwd4x4[mode][index][0];
169
1.18M
  const int     trSize = (size > 4) ? 48 : 16;
170
1.18M
  int           coef;
171
1.18M
  int *         out = dst;
172
173
18.3M
  for (int j = 0; j < zeroOutSize; j++)
174
17.2M
  {
175
17.2M
    int *         srcPtr   = src;
176
17.2M
    const int8_t *trMatTmp = trMat;
177
17.2M
    coef                   = 0;
178
651M
    for (int i = 0; i < trSize; i++)
179
634M
    {
180
634M
      coef += *srcPtr++ * *trMatTmp++;
181
634M
    }
182
17.2M
    *out++ = (coef + 64) >> 7;
183
17.2M
    trMat += trSize;
184
17.2M
  }
185
186
1.18M
  ::memset(out, 0, (trSize - zeroOutSize) * sizeof(int));
187
1.18M
}
188
189
190
void xInvLfnstNxNCore(int *src, int *dst, const uint32_t mode, const uint32_t index, const uint32_t size, int zeroOutSize)
191
503k
{
192
503k
  int           maxLog2TrDynamicRange = 15;
193
503k
  const TCoeff  outputMinimum         = -(1 << maxLog2TrDynamicRange);
194
503k
  const TCoeff  outputMaximum         = (1 << maxLog2TrDynamicRange) - 1;
195
503k
  const int8_t *trMat                 = (size > 4) ? g_lfnstInv8x8[mode][index][0] : g_lfnstInv4x4[mode][index][0];
196
503k
  const int     trSize                = (size > 4) ? 48 : 16;
197
503k
  int           resi;
198
503k
  int *         out                   = dst;
199
200
18.8M
  for( int j = 0; j < trSize; j++, trMat += 16 )
201
18.3M
  {
202
18.3M
    resi = 0;
203
18.3M
    const int8_t* trMatTmp = trMat;
204
18.3M
    int*          srcPtr   = src;
205
206
278M
    for( int i = 0; i < zeroOutSize; i++ )
207
260M
    {
208
260M
      resi += *srcPtr++ * *trMatTmp++;
209
260M
    }
210
211
18.3M
    *out++ = Clip3( outputMinimum, outputMaximum, ( int ) ( resi + 64 ) >> 7 );
212
18.3M
  }
213
503k
}
214
215
// ====================================================================================================================
216
// TrQuant class member functions
217
// ====================================================================================================================
218
19.4k
TrQuant::TrQuant() : m_scalingListEnabled(false), m_quant( nullptr )
219
19.4k
{
220
  // allocate temporary buffers
221
19.4k
  m_plTempCoeff = ( TCoeff* ) xMalloc( TCoeff, MAX_TB_SIZEY * MAX_TB_SIZEY );
222
19.4k
  m_tmp         = ( TCoeff* ) xMalloc( TCoeff, MAX_TB_SIZEY * MAX_TB_SIZEY );
223
19.4k
  m_blk         = ( TCoeff* ) xMalloc( TCoeff, MAX_TB_SIZEY * MAX_TB_SIZEY );
224
225
136k
  for( int i = 0; i < NUM_TRAFO_MODES_MTS; i++ )
226
116k
  {
227
116k
    m_mtsCoeffs[i] = ( TCoeff* ) xMalloc( TCoeff, MAX_TB_SIZEY * MAX_TB_SIZEY );
228
116k
  }
229
230
19.4k
  {
231
19.4k
    m_invICT      = m_invICTMem + maxAbsIctMode;
232
19.4k
    m_invICT[ 0]  = invTransformCbCr< 0>;
233
19.4k
    m_invICT[ 1]  = invTransformCbCr< 1>;
234
19.4k
    m_invICT[-1]  = invTransformCbCr<-1>;
235
19.4k
    m_invICT[ 2]  = invTransformCbCr< 2>;
236
19.4k
    m_invICT[-2]  = invTransformCbCr<-2>;
237
19.4k
    m_invICT[ 3]  = invTransformCbCr< 3>;
238
19.4k
    m_invICT[-3]  = invTransformCbCr<-3>;
239
19.4k
    m_fwdICT      = m_fwdICTMem + maxAbsIctMode;
240
19.4k
    m_fwdICT[ 0]  = fwdTransformCbCr< 0>;
241
19.4k
    m_fwdICT[ 1]  = fwdTransformCbCr< 1>;
242
19.4k
    m_fwdICT[-1]  = fwdTransformCbCr<-1>;
243
19.4k
    m_fwdICT[ 2]  = fwdTransformCbCr< 2>;
244
19.4k
    m_fwdICT[-2]  = fwdTransformCbCr<-2>;
245
19.4k
    m_fwdICT[ 3]  = fwdTransformCbCr< 3>;
246
19.4k
    m_fwdICT[-3]  = fwdTransformCbCr<-3>;
247
19.4k
  }
248
249
19.4k
  m_invLfnstNxN = xInvLfnstNxNCore;
250
19.4k
  m_fwdLfnstNxN = xFwdLfnstNxNCore;
251
252
#if defined( TARGET_SIMD_X86 ) && ENABLE_SIMD_TRAFO
253
  initTrQuantX86();
254
#endif
255
19.4k
}
256
257
TrQuant::~TrQuant()
258
19.4k
{
259
19.4k
  if( m_quant )
260
19.4k
  {
261
19.4k
    delete m_quant;
262
19.4k
    m_quant = nullptr;
263
19.4k
  }
264
265
  // delete temporary buffers
266
19.4k
  if( m_plTempCoeff )
267
19.4k
  {
268
19.4k
    xFree( m_plTempCoeff );
269
19.4k
    m_plTempCoeff = nullptr;
270
19.4k
  }
271
272
19.4k
  if( m_blk )
273
19.4k
  {
274
19.4k
    xFree( m_blk );
275
19.4k
    m_blk = nullptr;
276
19.4k
  }
277
278
19.4k
  if( m_tmp )
279
19.4k
  {
280
19.4k
    xFree( m_tmp );
281
19.4k
    m_tmp = nullptr;
282
19.4k
  }
283
284
136k
  for( int i = 0; i < NUM_TRAFO_MODES_MTS; i++ )
285
116k
  {
286
116k
     xFree( m_mtsCoeffs[i] );
287
116k
  }
288
19.4k
}
289
290
void TrQuant::xDeQuant(const TransformUnit& tu,
291
                             CoeffBuf      &dstCoeff,
292
                       const ComponentID   &compID,
293
                       const QpParam       &cQP)
294
826k
{
295
826k
  PROFILER_SCOPE_AND_STAGE( 1, _TPROF, P_DEQUANT );
296
826k
  m_quant->dequant( tu, dstCoeff, compID, cQP );
297
826k
}
298
299
void TrQuant::init( const Quant* otherQuant,
300
                    const int  rdoq,
301
                    const bool bUseRDOQTS,
302
                    const bool scalingListsEnabled,
303
                    const bool bEnc,
304
                    const int  thrVal
305
)
306
19.4k
{
307
19.4k
  m_bEnc = bEnc;
308
309
19.4k
  delete m_quant;
310
19.4k
  m_quant = nullptr;
311
312
19.4k
  m_quant = new(std::nothrow) DepQuant( otherQuant, bEnc, scalingListsEnabled );
313
19.4k
  CHECK( !m_quant, "allocation failed" );
314
19.4k
  m_quant->init( rdoq, bUseRDOQTS, thrVal );
315
19.4k
}
316
317
318
void TrQuant::invTransformNxN( TransformUnit& tu, const ComponentID compID, PelBuf& pResi, const QpParam& cQP )
319
826k
{
320
826k
  const CompArea& area    = tu.blocks[compID];
321
826k
  const uint32_t uiWidth  = area.width;
322
826k
  const uint32_t uiHeight = area.height;
323
324
826k
  CHECK( uiWidth > tu.cs->sps->getMaxTbSize() || uiHeight > tu.cs->sps->getMaxTbSize(), "Maximal allowed transformation size exceeded!" );
325
326
826k
  {
327
826k
    CoeffBuf tempCoeff = CoeffBuf( m_plTempCoeff, area );
328
826k
    xDeQuant( tu, tempCoeff, compID, cQP );
329
330
826k
    DTRACE_COEFF_BUF( D_TCOEFF, tempCoeff, tu, tu.cu->predMode, compID );
331
332
826k
    if (tu.cs->sps->LFNST)
333
826k
    {
334
826k
      xInvLfnst(tu, compID);
335
826k
    }
336
826k
    if (tu.mtsIdx[compID] == MTS_SKIP)
337
48.4k
    {
338
48.4k
      xITransformSkip(tempCoeff, pResi, tu, compID);
339
48.4k
    }
340
778k
    else
341
778k
    {
342
778k
      xIT(tu, compID, tempCoeff, pResi);
343
778k
    }
344
826k
  }
345
346
  //DTRACE_BLOCK_COEFF(tu.getCoeffs(compID), tu, tu.cu->predMode, compID);
347
826k
  DTRACE_PEL_BUF( D_RESIDUALS, pResi, tu, tu.cu->predMode, compID);
348
826k
}
349
350
std::pair<int64_t,int64_t> TrQuant::fwdTransformICT( const TransformUnit& tu, const PelBuf& resCb, const PelBuf& resCr, PelBuf& resC1, PelBuf& resC2, int jointCbCr )
351
1.07M
{
352
1.07M
  CHECK( Size(resCb) != Size(resCr), "resCb and resCr have different sizes" );
353
1.07M
  CHECK( Size(resCb) != Size(resC1), "resCb and resC1 have different sizes" );
354
1.07M
  CHECK( Size(resCb) != Size(resC2), "resCb and resC2 have different sizes" );
355
1.07M
  return (*m_fwdICT[ TU::getICTMode(tu, jointCbCr) ])( resCb, resCr, resC1, resC2 );
356
1.07M
}
357
358
void TrQuant::invTransformICT( const TransformUnit& tu, PelBuf& resCb, PelBuf& resCr )
359
264k
{
360
264k
  CHECK( Size(resCb) != Size(resCr), "resCb and resCr have different sizes" );
361
264k
  (*m_invICT[ TU::getICTMode(tu) ])( resCb, resCr );
362
264k
}
363
364
std::vector<int> TrQuant::selectICTCandidates( const TransformUnit& tu, CompStorage* resCb, CompStorage* resCr )
365
267k
{
366
267k
  CHECK( !resCb[0].valid() || !resCr[0].valid(), "standard components are not valid" );
367
368
267k
  if( !CU::isIntra( *tu.cu ) )
369
0
  {
370
0
    int cbfMask = 3;
371
0
    fwdTransformICT( tu, resCb[0], resCr[0], resCb[cbfMask], resCr[cbfMask], cbfMask );
372
0
    std::vector<int> cbfMasksToTest;
373
0
    cbfMasksToTest.push_back( cbfMask );
374
0
    return cbfMasksToTest;
375
0
  }
376
377
267k
  std::pair<int64_t,int64_t> pairDist[4];
378
1.33M
  for( int cbfMask = 0; cbfMask < 4; cbfMask++ )
379
1.07M
  {
380
1.07M
    pairDist[cbfMask] = fwdTransformICT( tu, resCb[0], resCr[0], resCb[cbfMask], resCr[cbfMask], cbfMask );
381
1.07M
  }
382
383
267k
  std::vector<int> cbfMasksToTest;
384
267k
  int64_t minDist1  = std::min<int64_t>( pairDist[0].first, pairDist[0].second );
385
267k
  int64_t minDist2  = std::numeric_limits<int64_t>::max();
386
267k
  int     cbfMask1  = 0;
387
267k
  int     cbfMask2  = 0;
388
267k
  for( int cbfMask : { 1, 2, 3 } )
389
803k
  {
390
803k
    if( pairDist[cbfMask].first < minDist1 )
391
530k
    {
392
530k
      cbfMask2  = cbfMask1; minDist2  = minDist1;
393
530k
      cbfMask1  = cbfMask;  minDist1  = pairDist[cbfMask1].first;
394
530k
    }
395
273k
    else if( pairDist[cbfMask].first < minDist2 )
396
267k
    {
397
267k
      cbfMask2  = cbfMask;  minDist2  = pairDist[cbfMask2].first;
398
267k
    }
399
803k
  }
400
267k
  if( cbfMask1 )
401
267k
  {
402
267k
    cbfMasksToTest.push_back( cbfMask1 );
403
267k
  }
404
267k
  if( cbfMask2 && ( ( minDist2 < (9*minDist1)/8 ) || ( !cbfMask1 && minDist2 < (3*minDist1)/2 ) ) )
405
0
  {
406
0
    cbfMasksToTest.push_back( cbfMask2 );
407
0
  }
408
409
267k
  return cbfMasksToTest;
410
267k
}
411
412
413
414
// ------------------------------------------------------------------------------------------------
415
// Logical transform
416
// ------------------------------------------------------------------------------------------------
417
void TrQuant::xSetTrTypes( const TransformUnit& tu, const ComponentID compID, const int width, const int height, int &trTypeHor, int &trTypeVer )
418
2.67M
{
419
2.67M
  const bool isISP = CU::isIntra(*tu.cu) && tu.cu->ispMode && isLuma(compID);
420
2.67M
  if (isISP && tu.cu->lfnstIdx)
421
18.7k
  {
422
18.7k
    return;
423
18.7k
  }
424
2.65M
  if (!tu.cs->sps->MTS)
425
0
  {
426
0
    return;
427
0
  }
428
2.65M
  if (CU::isIntra(*tu.cu) && isLuma(compID) && ((tu.cs->sps->getUseImplicitMTS() && tu.cu->lfnstIdx == 0 && tu.cu->mipFlag == 0) || tu.cu->ispMode))
429
83.4k
  {
430
83.4k
    if (width >= 4 && width <= 16)
431
37.1k
      trTypeHor = DST7;
432
83.4k
    if (height >= 4 && height <= 16)
433
36.7k
      trTypeVer = DST7;
434
83.4k
  }
435
2.57M
  else if( tu.cs->sps->MTS && tu.cu->sbtInfo && isLuma(compID)/*isSBT*/ )
436
0
  {
437
0
    const uint8_t sbtIdx = CU::getSbtIdx( tu.cu->sbtInfo );
438
0
    const uint8_t sbtPos = CU::getSbtPos( tu.cu->sbtInfo );
439
440
0
    if( sbtIdx == SBT_VER_HALF || sbtIdx == SBT_VER_QUAD )
441
0
    {
442
0
      assert( tu.lwidth() <= MTS_INTER_MAX_CU_SIZE );
443
0
      if( tu.lheight() > MTS_INTER_MAX_CU_SIZE )
444
0
      {
445
0
        trTypeHor = trTypeVer = DCT2;
446
0
      }
447
0
      else
448
0
      {
449
0
        if( sbtPos == SBT_POS0 )  { trTypeHor = DCT8;  trTypeVer = DST7; }
450
0
        else                      { trTypeHor = DST7;  trTypeVer = DST7; }
451
0
      }
452
0
    }
453
0
    else
454
0
    {
455
0
      assert( tu.lheight() <= MTS_INTER_MAX_CU_SIZE );
456
0
      if( tu.lwidth() > MTS_INTER_MAX_CU_SIZE )
457
0
      {
458
0
        trTypeHor = trTypeVer = DCT2;
459
0
      }
460
0
      else
461
0
      {
462
0
        if( sbtPos == SBT_POS0 )  { trTypeHor = DST7;  trTypeVer = DCT8; }
463
0
        else                      { trTypeHor = DST7;  trTypeVer = DST7; }
464
0
      }
465
0
    }
466
0
  }
467
2.65M
  const bool isExplicitMTS = (CU::isIntra(*tu.cu) ? tu.cs->sps->MTS : tu.cs->sps->MTSInter && CU::isInter(*tu.cu)) && isLuma(compID);
468
2.65M
  if (isExplicitMTS)
469
197k
  {
470
197k
    if (tu.mtsIdx[compID] > MTS_SKIP)
471
0
    {
472
0
      int indHor = (tu.mtsIdx[compID] - MTS_DST7_DST7) & 1;
473
0
      int indVer = (tu.mtsIdx[compID] - MTS_DST7_DST7) >> 1;
474
0
      trTypeHor  = indHor ? DCT8 : DST7;
475
0
      trTypeVer  = indVer ? DCT8 : DST7;
476
0
    }
477
197k
  }
478
2.65M
}
479
480
481
void TrQuant::xT( const TransformUnit& tu, const ComponentID compID, const CPelBuf& resi, CoeffBuf& dstCoeff, const int width, const int height )
482
1.89M
{
483
1.89M
  PROFILER_SCOPE_AND_STAGE( 1, _TPROF, P_TRAFO );
484
485
1.89M
  const unsigned maxLog2TrDynamicRange  = tu.cs->sps->getMaxLog2TrDynamicRange();
486
1.89M
  const unsigned bitDepth               = tu.cs->sps->bitDepths[toChannelType( compID )];
487
1.89M
  const int      TRANSFORM_MATRIX_SHIFT = g_transformMatrixShift[TRANSFORM_FORWARD];
488
1.89M
  const uint32_t transformWidthIndex    = Log2(width ) - 1;  // nLog2WidthMinus1, since transform start from 2-point
489
1.89M
  const uint32_t transformHeightIndex   = Log2(height) - 1;  // nLog2HeightMinus1, since transform start from 2-point
490
491
1.89M
  int trTypeHor = DCT2;
492
1.89M
  int trTypeVer = DCT2;
493
494
1.89M
  xSetTrTypes( tu, compID, width, height, trTypeHor, trTypeVer );
495
496
1.89M
  int  skipWidth  = ( trTypeHor != DCT2 && width  == 32 ) ? 16 : width  > JVET_C0024_ZERO_OUT_TH ? width  - JVET_C0024_ZERO_OUT_TH : 0;
497
1.89M
  int  skipHeight = ( trTypeVer != DCT2 && height == 32 ) ? 16 : height > JVET_C0024_ZERO_OUT_TH ? height - JVET_C0024_ZERO_OUT_TH : 0;
498
499
1.89M
  if( tu.cu->lfnstIdx )
500
1.18M
  {
501
1.18M
    if ((width == 4 && height > 4) || (width > 4 && height == 4))
502
336k
    {
503
336k
      skipWidth  = width - 4;
504
336k
      skipHeight = height - 4;
505
336k
    }
506
846k
    else if ((width >= 8 && height >= 8))
507
772k
    {
508
772k
      skipWidth  = width - 8;
509
772k
      skipHeight = height - 8;
510
772k
    }
511
1.18M
  }
512
513
1.89M
  TCoeff* block = m_blk;
514
1.89M
  TCoeff* tmp   = m_tmp;
515
516
1.89M
  const Pel* resiBuf    = resi.buf;
517
1.89M
  const int  resiStride = resi.stride;
518
519
1.89M
#if ENABLE_SIMD_TRAFO
520
1.89M
  if( width & 3 )
521
0
#endif
522
0
  {
523
0
    for( int y = 0; y < height; y++ )
524
0
    {
525
0
      for( int x = 0; x < width; x++ )
526
0
      {
527
0
        block[( y * width ) + x] = resiBuf[( y * resiStride ) + x];
528
0
      }
529
0
    }
530
0
  }
531
1.89M
#if ENABLE_SIMD_TRAFO
532
1.89M
  else if( width & 7 )
533
360k
  {
534
360k
    g_tCoeffOps.cpyCoeff4( resiBuf, resiStride, block, width, height );
535
360k
  }
536
1.53M
  else
537
1.53M
  {
538
1.53M
    g_tCoeffOps.cpyCoeff8( resiBuf, resiStride, block, width, height );
539
1.53M
  }
540
1.89M
#endif //ENABLE_SIMD_TRAFO
541
542
1.89M
  if (width > 1 && height > 1)
543
1.89M
  {
544
1.89M
    const int shift_1st = ((Log2(width )) + bitDepth + TRANSFORM_MATRIX_SHIFT) - maxLog2TrDynamicRange;
545
1.89M
    const int shift_2nd =  (Log2(height))            + TRANSFORM_MATRIX_SHIFT;
546
1.89M
    CHECK( shift_1st < 0, "Negative shift" );
547
1.89M
    CHECK( shift_2nd < 0, "Negative shift" );
548
1.89M
    fastFwdTrans[trTypeHor][transformWidthIndex](block, tmp, shift_1st, height, 0, skipWidth);
549
1.89M
    fastFwdTrans[trTypeVer][transformHeightIndex](tmp, dstCoeff.buf, shift_2nd, width, skipWidth, skipHeight);
550
1.89M
  }
551
204
  else if (height == 1)   // 1-D horizontal transform
552
276
  {
553
276
    const int shift = ((Log2(width )) + bitDepth + TRANSFORM_MATRIX_SHIFT) - maxLog2TrDynamicRange;
554
276
    CHECK( shift < 0, "Negative shift" );
555
276
    fastFwdTrans[trTypeHor][transformWidthIndex](block, dstCoeff.buf, shift, 1, 0, skipWidth);
556
276
  }
557
18.4E
  else   // if (iWidth == 1) //1-D vertical transform
558
18.4E
  {
559
18.4E
    int shift = ((floorLog2(height)) + bitDepth + TRANSFORM_MATRIX_SHIFT) - maxLog2TrDynamicRange;
560
18.4E
    CHECK(shift < 0, "Negative shift");
561
18.4E
    CHECKD((transformHeightIndex < 0), "There is a problem with the height.");
562
18.4E
    fastFwdTrans[trTypeVer][transformHeightIndex](block, dstCoeff.buf, shift, 1, 0, skipHeight);
563
18.4E
  }
564
1.89M
}
565
566
567
void TrQuant::xIT( const TransformUnit& tu, const ComponentID compID, const CCoeffBuf& pCoeff, PelBuf& pResidual )
568
778k
{
569
778k
  PROFILER_SCOPE_AND_STAGE( 1, _TPROF, P_TRAFO );
570
571
778k
  const int      width                  = pCoeff.width;
572
778k
  const int      height                 = pCoeff.height;
573
778k
  const unsigned maxLog2TrDynamicRange  = tu.cs->sps->getMaxLog2TrDynamicRange();
574
778k
  const unsigned bitDepth               = tu.cs->sps->bitDepths[toChannelType( compID )];
575
778k
  const int      TRANSFORM_MATRIX_SHIFT = g_transformMatrixShift[TRANSFORM_INVERSE];
576
778k
  const TCoeff   clipMinimum            = -( 1 << maxLog2TrDynamicRange );
577
778k
  const TCoeff   clipMaximum            =  ( 1 << maxLog2TrDynamicRange ) - 1;
578
778k
  const uint32_t transformWidthIndex    = Log2(width )- 1;                                // nLog2WidthMinus1, since transform start from 2-point
579
778k
  const uint32_t transformHeightIndex   = Log2(height) - 1;                                // nLog2HeightMinus1, since transform start from 2-point
580
581
582
778k
  int trTypeHor = DCT2;
583
778k
  int trTypeVer = DCT2;
584
585
778k
  xSetTrTypes( tu, compID, width, height, trTypeHor, trTypeVer );
586
587
778k
  int skipWidth  = ( trTypeHor != DCT2 && width  == 32 ) ? 16 : width  > JVET_C0024_ZERO_OUT_TH ? width  - JVET_C0024_ZERO_OUT_TH : 0;
588
778k
  int skipHeight = ( trTypeVer != DCT2 && height == 32 ) ? 16 : height > JVET_C0024_ZERO_OUT_TH ? height - JVET_C0024_ZERO_OUT_TH : 0;
589
590
778k
  if (tu.cs->sps->LFNST && tu.cu->lfnstIdx)
591
503k
  {
592
503k
    if ((width == 4 && height > 4) || (width > 4 && height == 4))
593
143k
    {
594
143k
      skipWidth = width - 4;
595
143k
      skipHeight = height - 4;
596
143k
    }
597
360k
    else if ((width >= 8 && height >= 8))
598
320k
    {
599
320k
      skipWidth = width - 8;
600
320k
      skipHeight = height - 8;
601
320k
    }
602
503k
  }
603
604
778k
  TCoeff *block = m_blk;
605
778k
  TCoeff *tmp   = m_tmp;
606
778k
  if (width > 1 && height > 1)   // 2-D transform
607
778k
  {
608
778k
    const int shift_1st =   TRANSFORM_MATRIX_SHIFT + 1; // 1 has been added to shift_1st at the expense of shift_2nd
609
778k
    const int shift_2nd = ( TRANSFORM_MATRIX_SHIFT + maxLog2TrDynamicRange - 1 ) - bitDepth;
610
778k
    CHECK( shift_1st < 0, "Negative shift" );
611
778k
    CHECK( shift_2nd < 0, "Negative shift" );
612
778k
    fastInvTrans[trTypeVer][transformHeightIndex](pCoeff.buf, tmp, shift_1st, width, skipWidth, skipHeight, clipMinimum, clipMaximum);
613
778k
    fastInvTrans[trTypeHor][transformWidthIndex](tmp, block, shift_2nd, height, 0, skipWidth, clipMinimum, clipMaximum);
614
778k
  }
615
69
  else if (width == 1)   // 1-D vertical transform
616
0
  {
617
0
    int shift = (TRANSFORM_MATRIX_SHIFT + maxLog2TrDynamicRange - 1) - bitDepth;
618
0
    CHECK(shift < 0, "Negative shift");
619
0
    fastInvTrans[trTypeVer][transformHeightIndex](pCoeff.buf, block, shift + 1, 1, 0, skipHeight, clipMinimum, clipMaximum);
620
0
  }
621
69
  else   // if(iHeight == 1) //1-D horizontal transform
622
69
  {
623
69
    const int shift = (TRANSFORM_MATRIX_SHIFT + maxLog2TrDynamicRange - 1) - bitDepth;
624
69
    CHECK(shift < 0, "Negative shift");
625
69
    fastInvTrans[trTypeHor][transformWidthIndex](pCoeff.buf, block, shift + 1, 1, 0, skipWidth, clipMinimum, clipMaximum);
626
69
  }
627
628
778k
#if ENABLE_SIMD_TRAFO
629
778k
  if( width & 3 )
630
0
#endif //ENABLE_SIMD_TRAFO
631
0
  {
632
0
    Pel       *dst    = pResidual.buf;
633
0
    ptrdiff_t  stride = pResidual.stride;
634
635
0
    for( int y = 0; y < height; y++ )
636
0
    {
637
0
      for( int x = 0; x < width; x++ )
638
0
      {
639
0
        dst[x] = ( Pel ) *block++;
640
0
      }
641
642
0
      dst += stride;
643
0
    }
644
0
  }
645
778k
#if ENABLE_SIMD_TRAFO
646
778k
  else if( width & 7 )
647
166k
  {
648
166k
    g_tCoeffOps.cpyResi4( block, pResidual.buf, pResidual.stride, width, height );
649
166k
  }
650
611k
  else
651
611k
  {
652
611k
    g_tCoeffOps.cpyResi8( block, pResidual.buf, pResidual.stride, width, height );
653
611k
  }
654
778k
#endif //ENABLE_SIMD_TRAFO
655
778k
}
656
657
/** Wrapper function between HM interface and core NxN transform skipping
658
 */
659
void TrQuant::xITransformSkip(const CCoeffBuf& pCoeff,
660
  PelBuf& pResidual,
661
  const TransformUnit& tu,
662
  const ComponentID compID)
663
48.4k
{
664
48.4k
  const CompArea& area = tu.blocks[compID];
665
48.4k
  const int width = area.width;
666
48.4k
  const int height = area.height;
667
668
486k
  for (uint32_t y = 0; y < height; y++)
669
437k
  {
670
4.86M
    for (uint32_t x = 0; x < width; x++)
671
4.42M
    {
672
4.42M
      pResidual.at(x, y) = Pel(pCoeff.at(x, y));
673
4.42M
    }
674
437k
  }
675
48.4k
}
676
677
void TrQuant::xQuant(TransformUnit& tu, const ComponentID compID, const CCoeffBuf& pSrc, TCoeff &uiAbsSum, const QpParam& cQP, const Ctx& ctx)
678
2.00M
{
679
2.00M
  PROFILER_SCOPE_AND_STAGE( 1, _TPROF, P_QUANT );
680
2.00M
  m_quant->quant( tu, compID, pSrc, uiAbsSum, cQP, ctx );
681
#if ENABLE_MEASURE_SEARCH_SPACE
682
683
  g_searchSpaceAcc.addQuant( tu, toChannelType( compID ) );
684
#endif
685
2.00M
}
686
687
688
void TrQuant::transformNxN(TransformUnit &tu, const ComponentID compID, const QpParam &cQP, TCoeff &uiAbsSum, const Ctx &ctx, const bool loadTr)
689
2.00M
{
690
2.00M
        CodingStructure &cs = *tu.cs;
691
2.00M
  const CompArea& rect      = tu.blocks[compID];
692
2.00M
  const uint32_t uiWidth        = rect.width;
693
2.00M
  const uint32_t uiHeight       = rect.height;
694
695
2.00M
  const CPelBuf resiBuf     = cs.getResiBuf(rect);
696
697
2.00M
  if( tu.noResidual )
698
0
  {
699
0
    uiAbsSum = 0;
700
0
    TU::setCbfAtDepth( tu, compID, tu.depth, uiAbsSum > 0 );
701
0
    return;
702
0
  }
703
2.00M
  if (tu.cu->bdpcmM[toChannelType(compID)])
704
100k
  {
705
100k
    tu.mtsIdx[compID] = MTS_SKIP;
706
100k
  }
707
708
2.00M
  uiAbsSum = 0;
709
2.00M
  CHECK( cs.sps->getMaxTbSize() < uiWidth, "Unsupported transformation size" );
710
711
2.00M
  CoeffBuf tempCoeff(loadTr ? m_mtsCoeffs[tu.mtsIdx[compID]] : m_plTempCoeff, rect);
712
2.00M
  if (!loadTr)
713
1.98M
  {
714
1.98M
    DTRACE_PEL_BUF( D_RESIDUALS, resiBuf, tu, tu.cu->predMode, compID );
715
1.98M
    if (tu.mtsIdx[compID] == MTS_SKIP)
716
100k
    {
717
100k
      xTransformSkip(tu, compID, resiBuf, tempCoeff.buf);
718
100k
    }
719
1.88M
    else
720
1.88M
    {
721
1.88M
      xT(tu, compID, resiBuf, tempCoeff, uiWidth, uiHeight);
722
1.88M
    }
723
1.98M
  }
724
2.00M
  if (cs.sps->LFNST)
725
2.00M
  {
726
2.00M
    xFwdLfnst(tu, compID, loadTr);
727
2.00M
  }
728
2.00M
  DTRACE_COEFF_BUF( D_TCOEFF, tempCoeff, tu, tu.cu->predMode, compID );
729
730
2.00M
  xQuant( tu, compID, tempCoeff, uiAbsSum, cQP, ctx );
731
732
2.00M
  DTRACE_COEFF_BUF( D_TCOEFF, tu.getCoeffs( compID ), tu, tu.cu->predMode, compID );
733
734
  // set coded block flag (CBF)
735
2.00M
  TU::setCbfAtDepth (tu, compID, tu.depth, uiAbsSum > 0);
736
2.00M
}
737
738
void TrQuant::checktransformsNxN( TransformUnit &tu, std::vector<TrMode> *trModes, const int maxCand, const ComponentID compID)
739
18.0k
{
740
18.0k
  CodingStructure &cs     = *tu.cs;
741
18.0k
  const CompArea& rect    = tu.blocks[compID];
742
18.0k
  const uint32_t   width  = rect.width;
743
18.0k
  const uint32_t   height = rect.height;
744
745
18.0k
  const CPelBuf resiBuf = cs.getResiBuf(rect);
746
747
18.0k
  CHECK(cs.sps->getMaxTbSize() < width, "Unsupported transformation size");
748
18.0k
  int                           pos = 0;
749
18.0k
  std::vector<TrCost>           trCosts;
750
18.0k
  std::vector<TrMode>::iterator it      = trModes->begin();
751
18.0k
  const double                  facBB[] = { 1.2, 1.3, 1.3, 1.4, 1.5 };
752
54.2k
  while (it != trModes->end())
753
36.1k
  {
754
36.1k
    tu.mtsIdx[compID] = it->first;
755
36.1k
    CoeffBuf tempCoeff(m_mtsCoeffs[tu.mtsIdx[compID]], rect);
756
36.1k
    if (tu.noResidual)
757
0
    {
758
0
      int sumAbs = 0;
759
0
      trCosts.push_back(TrCost(sumAbs, pos++));
760
0
      it++;
761
0
      continue;
762
0
    }
763
36.1k
    if (tu.mtsIdx[compID] == MTS_SKIP)
764
18.0k
    {
765
18.0k
      xTransformSkip(tu, compID, resiBuf, tempCoeff.buf);
766
18.0k
    }
767
18.0k
    else
768
18.0k
    {
769
18.0k
      xT(tu, compID, resiBuf, tempCoeff, width, height);
770
18.0k
    }
771
772
36.1k
    int sumAbs = 0;
773
6.39M
    for (int pos = 0; pos < width * height; pos++)
774
6.35M
    {
775
6.35M
      sumAbs += abs(tempCoeff.buf[pos]);
776
6.35M
    }
777
778
36.1k
    double scaleSAD = 1.0;
779
36.1k
    if (tu.mtsIdx[compID] == MTS_SKIP && ((floorLog2(width) + floorLog2(height)) & 1) == 1)
780
7.69k
    {
781
7.69k
      scaleSAD = 1.0 / 1.414213562;   // compensate for not scaling transform skip coefficients by 1/sqrt(2)
782
7.69k
    }
783
36.1k
    if (tu.mtsIdx[compID] == MTS_SKIP)
784
18.0k
    {
785
18.0k
      int trShift = getTransformShift(tu.cu->slice->sps->bitDepths[CH_L], rect.size(), tu.cu->slice->sps->getMaxLog2TrDynamicRange());
786
18.0k
      scaleSAD *= pow(2, trShift);
787
18.0k
    }
788
36.1k
    trCosts.push_back(TrCost(int(std::min<double>(sumAbs * scaleSAD, std::numeric_limits<int>::max())), pos++));
789
36.1k
    it++;
790
36.1k
  }
791
792
18.0k
  int                           numTests = 0;
793
18.0k
  std::vector<TrCost>::iterator itC      = trCosts.begin();
794
18.0k
  const double                  fac      = facBB[std::max(0, floorLog2(std::max(width, height)) - 2)];
795
18.0k
  const double                  thr      = fac * trCosts.begin()->first;
796
18.0k
  const double                  thrTS    = trCosts.begin()->first;
797
54.2k
  while (itC != trCosts.end())
798
36.1k
  {
799
36.1k
    const bool testTr               = itC->first <= (trModes->at(itC->second).first == 1 ? thrTS : thr) && numTests <= maxCand;
800
36.1k
    trModes->at(itC->second).second = testTr;
801
36.1k
    numTests += testTr;
802
36.1k
    itC++;
803
36.1k
  }
804
18.0k
}
805
806
uint32_t TrQuant::xGetLFNSTIntraMode( const Area& tuArea, const uint32_t dirMode )
807
1.68M
{
808
1.68M
  if (dirMode < 2)
809
950k
  {
810
950k
    return dirMode;
811
950k
  }
812
813
736k
  static const int modeShift[] = { 0, 6, 10, 12, 14, 15 };
814
815
736k
  const int width  = int(tuArea.width);
816
736k
  const int height = int(tuArea.height);
817
818
736k
  if (width > height && dirMode < 2 + modeShift[floorLog2(width) - floorLog2(height)])
819
216
  {
820
216
    return dirMode + (VDIA_IDX - 1) + (NUM_EXT_LUMA_MODE >> 1);
821
216
  }
822
736k
  else if (height > width && dirMode > VDIA_IDX - modeShift[floorLog2(height) - floorLog2(width)])
823
68.8k
  {
824
68.8k
    return dirMode - (VDIA_IDX + 1) + (NUM_EXT_LUMA_MODE >> 1) + NUM_LUMA_MODE;
825
68.8k
  }
826
827
667k
  return dirMode;
828
736k
}
829
830
831
bool TrQuant::xGetTransposeFlag(uint32_t intraMode)
832
1.68M
{
833
1.68M
  return ((intraMode >= NUM_LUMA_MODE) && (intraMode >= (NUM_LUMA_MODE + (NUM_EXT_LUMA_MODE >> 1))))
834
1.68M
         || ((intraMode < NUM_LUMA_MODE) && (intraMode > DIA_IDX));
835
1.68M
}
836
837
838
void TrQuant::xInvLfnst(const TransformUnit &tu, const ComponentID compID)
839
826k
{
840
826k
  const CompArea &area     = tu.blocks[compID];
841
826k
  const uint32_t  width    = area.width;
842
826k
  const uint32_t  height   = area.height;
843
826k
  const uint32_t  lfnstIdx = tu.cu->lfnstIdx;
844
826k
  if (lfnstIdx && tu.mtsIdx[compID] != MTS_SKIP && (CU::isSepTree(*tu.cu) ? true : isLuma(compID)))
845
503k
  {
846
503k
    const CodingUnit& cu = *tu.cs->getCU(area.pos(), toChannelType(compID), TREE_D);
847
503k
    const bool         whge3 = width >= 8 && height >= 8;
848
503k
    const ScanElement *scan =
849
503k
      whge3
850
503k
        ? g_coefTopLeftDiagScan8x8[Log2(width)] 
851
503k
        : getScanOrder(SCAN_GROUPED_4x4, Log2(area.width), Log2(area.height));
852
503k
    uint32_t intraMode = CU::getFinalIntraMode(cu, toChannelType(compID));
853
854
503k
    if (CU::isLMCMode( cu.intraDir[toChannelType(compID)]))
855
83.0k
    {
856
83.0k
      intraMode = CU::getCoLocatedIntraLumaMode(cu);
857
83.0k
    }
858
503k
    if (CU::isMIP(cu, toChannelType(compID)))
859
4.90k
    {
860
4.90k
      intraMode = PLANAR_IDX;
861
4.90k
    }
862
503k
    CHECK(intraMode >= NUM_INTRA_MODE - 1, "Invalid intra mode");
863
864
503k
    if (lfnstIdx < 3)
865
503k
    {
866
503k
      if (tu.cu->ispMode && isLuma(compID))
867
7.31k
      {
868
7.31k
        intraMode = xGetLFNSTIntraMode(tu.cu->blocks[compID], intraMode);
869
7.31k
      }
870
496k
      else
871
496k
        intraMode = xGetLFNSTIntraMode(tu.blocks[compID], intraMode);
872
503k
      bool      transposeFlag = xGetTransposeFlag(intraMode);
873
503k
      const int sbSize        = whge3 ? 8 : 4;
874
503k
      bool      tu4x4Flag     = (width == 4 && height == 4);
875
503k
      bool      tu8x8Flag     = (width == 8 && height == 8);
876
503k
      TCoeff *  lfnstTemp;
877
503k
      TCoeff *  coeffTemp;
878
503k
      int       y;
879
503k
      lfnstTemp                  = m_tempInMatrix;   // inverse spectral rearrangement
880
503k
      coeffTemp                  = m_plTempCoeff;
881
503k
      TCoeff *           dst     = lfnstTemp;
882
503k
      const ScanElement *scanPtr = scan;
883
8.56M
      for (y = 0; y < 16; y++)
884
8.06M
      {
885
8.06M
        *dst++ = coeffTemp[scanPtr->idx];
886
8.06M
        scanPtr++;
887
8.06M
      }
888
889
503k
      m_invLfnstNxN( m_tempInMatrix, m_tempOutMatrix, g_lfnstLut[intraMode], lfnstIdx - 1, sbSize, ( tu4x4Flag || tu8x8Flag ) ? 8 : 16 );
890
891
503k
      lfnstTemp = m_tempOutMatrix;   // inverse spectral rearrangement
892
893
503k
      if (transposeFlag)
894
46.4k
      {
895
46.4k
        if (sbSize == 4)
896
9.00k
        {
897
45.0k
          for (y = 0; y < 4; y++)
898
36.0k
          {
899
36.0k
            coeffTemp[0] = lfnstTemp[0];
900
36.0k
            coeffTemp[1] = lfnstTemp[4];
901
36.0k
            coeffTemp[2] = lfnstTemp[8];
902
36.0k
            coeffTemp[3] = lfnstTemp[12];
903
36.0k
            lfnstTemp++;
904
36.0k
            coeffTemp += width;
905
36.0k
          }
906
9.00k
        }
907
37.4k
        else   // ( sbSize == 8 )
908
37.4k
        {
909
336k
          for (y = 0; y < 8; y++)
910
299k
          {
911
299k
            coeffTemp[0] = lfnstTemp[0];
912
299k
            coeffTemp[1] = lfnstTemp[8];
913
299k
            coeffTemp[2] = lfnstTemp[16];
914
299k
            coeffTemp[3] = lfnstTemp[24];
915
299k
            if (y < 4)
916
149k
            {
917
149k
              coeffTemp[4] = lfnstTemp[32];
918
149k
              coeffTemp[5] = lfnstTemp[36];
919
149k
              coeffTemp[6] = lfnstTemp[40];
920
149k
              coeffTemp[7] = lfnstTemp[44];
921
149k
            }
922
299k
            lfnstTemp++;
923
299k
            coeffTemp += width;
924
299k
          }
925
37.4k
        }
926
46.4k
      }
927
457k
      else
928
457k
      {
929
3.41M
        for (y = 0; y < sbSize; y++)
930
2.96M
        {
931
2.96M
          uint32_t uiStride = (y < 4) ? sbSize : 4;
932
2.96M
          ::memcpy(coeffTemp, lfnstTemp, uiStride * sizeof(TCoeff));
933
2.96M
          lfnstTemp += uiStride;
934
2.96M
          coeffTemp += width;
935
2.96M
        }
936
457k
      }
937
503k
    }
938
503k
  }
939
826k
}
940
941
942
void TrQuant::xFwdLfnst(const TransformUnit &tu, const ComponentID compID, const bool loadTr)
943
2.00M
{
944
2.00M
  const CompArea &area     = tu.blocks[compID];
945
2.00M
  const uint32_t  width    = area.width;
946
2.00M
  const uint32_t  height   = area.height;
947
2.00M
  const uint32_t  lfnstIdx = tu.cu->lfnstIdx;
948
2.00M
  if (lfnstIdx && tu.mtsIdx[compID] != MTS_SKIP && (CU::isSepTree(*tu.cu) ? true : isLuma(compID)))
949
1.18M
  {
950
1.18M
    const CodingUnit& cu = *tu.cs->getCU(area.pos(), toChannelType(compID), TREE_D);
951
1.18M
    const bool         whge3 = width >= 8 && height >= 8;
952
1.18M
    const ScanElement *scan =
953
1.18M
      whge3
954
1.18M
        ? g_coefTopLeftDiagScan8x8[Log2(width)] 
955
1.18M
        : getScanOrder(SCAN_GROUPED_4x4, Log2(area.width), Log2(area.height));   
956
1.18M
    uint32_t intraMode = CU::getFinalIntraMode(cu, toChannelType(compID));
957
958
1.18M
    if (CU::isLMCMode(cu.intraDir[toChannelType(compID)]))
959
105k
    {
960
105k
      intraMode = CU::getCoLocatedIntraLumaMode(cu);
961
105k
    }
962
1.18M
    if (CU::isMIP(cu, toChannelType(compID)))
963
8.07k
    {
964
8.07k
      intraMode = PLANAR_IDX;
965
8.07k
    }
966
1.18M
    CHECK(intraMode >= NUM_INTRA_MODE - 1, "Invalid intra mode");
967
968
1.18M
    if (lfnstIdx < 3)
969
1.18M
    {
970
1.18M
      if (tu.cu->ispMode && isLuma(compID))
971
11.4k
      {
972
11.4k
        intraMode = xGetLFNSTIntraMode(tu.cu->blocks[compID], intraMode);
973
11.4k
      }
974
1.17M
      else
975
1.17M
      {
976
1.17M
        intraMode = xGetLFNSTIntraMode(tu.blocks[compID], intraMode);
977
1.17M
      }
978
1.18M
      bool      transposeFlag = xGetTransposeFlag(intraMode);
979
1.18M
      const int sbSize        = whge3 ? 8 : 4;
980
1.18M
      bool      tu4x4Flag     = (width == 4 && height == 4);
981
1.18M
      bool      tu8x8Flag     = (width == 8 && height == 8);
982
1.18M
      TCoeff*   lfnstTemp;
983
1.18M
      TCoeff*   coeffTemp;
984
1.18M
      TCoeff*   tempCoeff     = loadTr ? m_mtsCoeffs[tu.mtsIdx[compID]] : m_plTempCoeff;
985
986
1.18M
      int y;
987
1.18M
      lfnstTemp = m_tempInMatrix;   // forward low frequency non-separable transform
988
1.18M
      coeffTemp = tempCoeff;
989
990
1.18M
      if (transposeFlag)
991
251k
      {
992
251k
        if (sbSize == 4)
993
74.6k
        {
994
373k
          for (y = 0; y < 4; y++)
995
298k
          {
996
298k
            lfnstTemp[0]  = coeffTemp[0];
997
298k
            lfnstTemp[4]  = coeffTemp[1];
998
298k
            lfnstTemp[8]  = coeffTemp[2];
999
298k
            lfnstTemp[12] = coeffTemp[3];
1000
298k
            lfnstTemp++;
1001
298k
            coeffTemp += width;
1002
298k
          }
1003
74.6k
        }
1004
177k
        else   // ( sbSize == 8 )
1005
177k
        {
1006
1.59M
          for (y = 0; y < 8; y++)
1007
1.41M
          {
1008
1.41M
            lfnstTemp[0]  = coeffTemp[0];
1009
1.41M
            lfnstTemp[8]  = coeffTemp[1];
1010
1.41M
            lfnstTemp[16] = coeffTemp[2];
1011
1.41M
            lfnstTemp[24] = coeffTemp[3];
1012
1.41M
            if (y < 4)
1013
708k
            {
1014
708k
              lfnstTemp[32] = coeffTemp[4];
1015
708k
              lfnstTemp[36] = coeffTemp[5];
1016
708k
              lfnstTemp[40] = coeffTemp[6];
1017
708k
              lfnstTemp[44] = coeffTemp[7];
1018
708k
            }
1019
1.41M
            lfnstTemp++;
1020
1.41M
            coeffTemp += width;
1021
1.41M
          }
1022
177k
        }
1023
251k
      }
1024
931k
      else
1025
931k
      {
1026
7.03M
        for (y = 0; y < sbSize; y++)
1027
6.10M
        {
1028
6.10M
          uint32_t uiStride = (y < 4) ? sbSize : 4;
1029
6.10M
          ::memcpy(lfnstTemp, coeffTemp, uiStride * sizeof(TCoeff));
1030
6.10M
          lfnstTemp += uiStride;
1031
6.10M
          coeffTemp += width;
1032
6.10M
        }
1033
931k
      }
1034
1035
1.18M
      m_fwdLfnstNxN( m_tempInMatrix, m_tempOutMatrix, g_lfnstLut[intraMode], lfnstIdx - 1, sbSize, ( tu4x4Flag || tu8x8Flag ) ? 8 : 16 );
1036
1037
1.18M
      lfnstTemp                        = m_tempOutMatrix;   // forward spectral rearrangement
1038
1.18M
      coeffTemp                        = tempCoeff;
1039
1.18M
      const ScanElement *scanPtr       = scan;
1040
1.18M
      int                lfnstCoeffNum = (sbSize == 4) ? sbSize * sbSize : 48;
1041
44.8M
      for (y = 0; y < lfnstCoeffNum; y++)
1042
43.6M
      {
1043
43.6M
        coeffTemp[scanPtr->idx] = *lfnstTemp++;
1044
43.6M
        scanPtr++;
1045
43.6M
      }
1046
1.18M
    }
1047
1.18M
  }
1048
2.00M
}
1049
1050
void TrQuant::xTransformSkip(const TransformUnit& tu, const ComponentID& compID, const CPelBuf& resi, TCoeff* psCoeff)
1051
118k
{
1052
118k
  const CompArea& rect = tu.blocks[compID];
1053
118k
  const uint32_t width = rect.width;
1054
118k
  const uint32_t height = rect.height;
1055
1056
1.28M
  for (uint32_t y = 0, coefficientIndex = 0; y < height; y++)
1057
1.17M
  {
1058
13.9M
    for (uint32_t x = 0; x < width; x++, coefficientIndex++)
1059
12.8M
    {
1060
12.8M
      psCoeff[coefficientIndex] = TCoeff(resi.at(x, y));
1061
12.8M
    }
1062
1.17M
  }
1063
118k
}
1064
} // namespace vvenc
1065
1066
//! \}
1067