Coverage Report

Created: 2026-09-02 06:43

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/work/vvenc/source/Lib/EncoderLib/BinEncoder.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
45
#include "BinEncoder.h"
46
#include "CommonLib/Rom.h"
47
#include "CommonLib/dtrace_next.h"
48
49
//! \ingroup EncoderLib
50
//! \{
51
52
namespace vvenc {
53
54
BinCounter::BinCounter()
55
4.58k
  : m_CtxBinsCodedBuffer( Ctx::NumberOfContexts )
56
4.58k
  , m_NumBinsCtx        ( m_CtxBinsCodedBuffer.data() )
57
4.58k
  , m_NumBinsEP         ( 0 )
58
4.58k
  , m_NumBinsTrm        ( 0 )
59
4.58k
{}
60
61
62
void BinCounter::reset()
63
1.14k
{
64
424k
  for( std::size_t k = 0; k < m_CtxBinsCodedBuffer.size(); k++ )
65
423k
  {
66
423k
    m_NumBinsCtx[k] = 0;
67
423k
  }
68
1.14k
  m_NumBinsEP       = 0;
69
1.14k
  m_NumBinsTrm      = 0;
70
1.14k
}
71
72
73
uint32_t BinCounter::getAll() const
74
1.14k
{
75
1.14k
  uint32_t  count = m_NumBinsEP + m_NumBinsTrm;
76
424k
  for( std::size_t k = 0; k < m_CtxBinsCodedBuffer.size(); k++ )
77
423k
  {
78
423k
    count += m_NumBinsCtx[k];
79
423k
  }
80
1.14k
  return count;
81
1.14k
}
82
83
84
85
BinEncoderBase::BinEncoderBase( const BinProbModel* dummy )
86
4.58k
  : BinEncIf          ( dummy )
87
4.58k
  , m_Bitstream       ( 0 )
88
4.58k
  , m_Low             ( 0 )
89
4.58k
  , m_Range           ( 0 )
90
4.58k
  , m_bufferedByte    ( 0 )
91
4.58k
  , m_numBufferedBytes( 0 )
92
4.58k
  , m_bitsLeft        ( 0 )
93
4.58k
{}
94
95
void BinEncoderBase::init( OutputBitstream* bitstream )
96
3.59k
{
97
3.59k
  m_Bitstream = bitstream;
98
3.59k
}
99
100
void BinEncoderBase::uninit()
101
0
{
102
0
  m_Bitstream = 0;
103
0
}
104
105
void BinEncoderBase::start()
106
1.14k
{
107
1.14k
  m_Low               = 0;
108
1.14k
  m_Range             = 510;
109
1.14k
  m_bufferedByte      = 0xff;
110
1.14k
  m_numBufferedBytes  = 0;
111
1.14k
  m_bitsLeft          = 23;
112
1.14k
  BinCounter::reset();
113
1.14k
  m_BinStore. reset();
114
1.14k
}
115
116
void BinEncoderBase::finish()
117
1.14k
{
118
1.14k
  if( m_Low >> ( 32 - m_bitsLeft ) )
119
8
  {
120
8
    m_Bitstream->write( m_bufferedByte + 1, 8 );
121
9
    while( m_numBufferedBytes > 1 )
122
1
    {
123
1
      m_Bitstream->write( 0x00, 8 );
124
1
      m_numBufferedBytes--;
125
1
    }
126
8
    m_Low -= 1 << ( 32 - m_bitsLeft );
127
8
  }
128
1.13k
  else
129
1.13k
  {
130
1.13k
    if( m_numBufferedBytes > 0 )
131
1.13k
    {
132
1.13k
      m_Bitstream->write( m_bufferedByte, 8 );
133
1.13k
    }
134
1.14k
    while( m_numBufferedBytes > 1 )
135
7
    {
136
7
      m_Bitstream->write( 0xff, 8 );
137
7
      m_numBufferedBytes--;
138
7
    }
139
1.13k
  }
140
1.14k
  m_Bitstream->write( m_Low >> 8, 24 - m_bitsLeft );
141
1.14k
}
142
143
void BinEncoderBase::restart()
144
0
{
145
0
  m_Low               = 0;
146
0
  m_Range             = 510;
147
0
  m_bufferedByte      = 0xff;
148
0
  m_numBufferedBytes  = 0;
149
0
  m_bitsLeft          = 23;
150
0
}
151
152
void BinEncoderBase::reset( int qp, int initId )
153
1.14k
{
154
1.14k
  Ctx::init( qp, initId );
155
1.14k
  start();
156
1.14k
}
157
158
void BinEncoderBase::resetBits()
159
0
{
160
0
  m_Low               = 0;
161
0
  m_bufferedByte      = 0xff;
162
0
  m_numBufferedBytes  = 0;
163
0
  m_bitsLeft          = 23;
164
0
  BinCounter::reset();
165
0
}
166
167
void BinEncoderBase::encodeBinEP( unsigned bin )
168
443
{
169
443
  DTRACE( g_trace_ctx, D_CABAC, "%d" "  " "%d" "  EP=%d \n", DTRACE_GET_COUNTER( g_trace_ctx, D_CABAC ), m_Range, bin );
170
171
443
  BinCounter::addEP();
172
443
  m_Low <<= 1;
173
443
  if( bin )
174
20
  {
175
20
    m_Low += m_Range;
176
20
  }
177
443
  m_bitsLeft--;
178
443
  if( m_bitsLeft < 12 )
179
20
  {
180
20
    writeOut();
181
20
  }
182
443
}
183
184
void BinEncoderBase::encodeBinsEP( unsigned bins, unsigned numBins )
185
15.0k
{
186
77.5k
  for(int i = 0; i < numBins; i++)
187
62.4k
  {
188
62.4k
    DTRACE( g_trace_ctx, D_CABAC, "%d" "  " "%d" "  EP=%d \n", DTRACE_GET_COUNTER( g_trace_ctx, D_CABAC ), m_Range, ( bins >> ( numBins - 1 - i ) ) & 1 );
189
62.4k
  }
190
191
15.0k
  BinCounter::addEP( numBins );
192
15.0k
  if( m_Range == 256 )
193
1.83k
  {
194
1.83k
    encodeAlignedBinsEP( bins, numBins );
195
1.83k
    return;
196
1.83k
  }
197
15.3k
  while( numBins > 8 )
198
2.11k
  {
199
2.11k
    numBins          -= 8;
200
2.11k
    unsigned pattern  = bins >> numBins;
201
2.11k
    m_Low           <<= 8;
202
2.11k
    m_Low            += m_Range * pattern;
203
2.11k
    bins             -= pattern << numBins;
204
2.11k
    m_bitsLeft       -= 8;
205
2.11k
    if( m_bitsLeft < 12 )
206
2.11k
    {
207
2.11k
      writeOut();
208
2.11k
    }
209
2.11k
  }
210
13.2k
  m_Low     <<= numBins;
211
13.2k
  m_Low      += m_Range * bins;
212
13.2k
  m_bitsLeft -= numBins;
213
13.2k
  if( m_bitsLeft < 12 )
214
4.11k
  {
215
4.11k
    writeOut();
216
4.11k
  }
217
13.2k
}
218
219
void BinEncoderBase::encodeRemAbsEP(unsigned bins, unsigned goRicePar, unsigned cutoff, int maxLog2TrDynamicRange)
220
2.29k
{
221
2.29k
  const unsigned threshold = cutoff << goRicePar;
222
2.29k
  if (bins < threshold)
223
0
  {
224
0
    const unsigned bitMask = (1 << goRicePar) - 1;
225
0
    const unsigned length = (bins >> goRicePar) + 1;
226
0
    encodeBinsEP((1 << length) - 2, length);
227
0
    encodeBinsEP(bins & bitMask, goRicePar);
228
0
  }
229
2.29k
  else 
230
2.29k
  {
231
2.29k
    const unsigned  maxPrefixLength = 32 - cutoff - maxLog2TrDynamicRange;
232
2.29k
    unsigned        prefixLength = 0;
233
2.29k
    unsigned        codeValue = (bins >> goRicePar) - cutoff;
234
2.29k
    unsigned        suffixLength;
235
2.29k
    if (codeValue >= ((1 << maxPrefixLength) - 1))
236
52
    {
237
52
      prefixLength = maxPrefixLength;
238
52
      suffixLength = maxLog2TrDynamicRange;
239
52
    }
240
2.24k
    else
241
2.24k
    {
242
16.6k
      while (codeValue > ((2 << prefixLength) - 2))
243
14.4k
      {
244
14.4k
        prefixLength++;
245
14.4k
      }
246
2.24k
      suffixLength = prefixLength + goRicePar + 1; //+1 for the separator bit
247
2.24k
    }
248
2.29k
    const unsigned totalPrefixLength = prefixLength + cutoff;
249
2.29k
    const unsigned bitMask = (1 << goRicePar) - 1;
250
2.29k
    const unsigned prefix = (1 << totalPrefixLength) - 1;
251
2.29k
    const unsigned suffix = ((codeValue - ((1 << prefixLength) - 1)) << goRicePar) | (bins & bitMask);
252
2.29k
    encodeBinsEP(prefix, totalPrefixLength); //prefix
253
2.29k
    encodeBinsEP(suffix, suffixLength); //separator, suffix, and rParam bits
254
2.29k
  }
255
2.29k
}
256
257
void BinEncoderBase::encodeBinTrm( unsigned bin )
258
1.14k
{
259
1.14k
  BinCounter::addTrm();
260
1.14k
  m_Range -= 2;
261
1.14k
  if( bin )
262
1.14k
  {
263
1.14k
    m_Low      += m_Range;
264
1.14k
    m_Low     <<= 7;
265
1.14k
    m_Range     = 2 << 7;
266
1.14k
    m_bitsLeft -= 7;
267
1.14k
  }
268
0
  else if( m_Range >= 256 )
269
0
  {
270
0
    return;
271
0
  }
272
0
  else
273
0
  {
274
0
    m_Low     <<= 1;
275
0
    m_Range   <<= 1;
276
0
    m_bitsLeft--;
277
0
  }
278
1.14k
  if( m_bitsLeft < 12 )
279
1.00k
  {
280
1.00k
    writeOut();
281
1.00k
  }
282
1.14k
}
283
284
285
void BinEncoderBase::align()
286
0
{
287
0
  m_Range = 256;
288
0
}
289
290
291
void BinEncoderBase::encodeAlignedBinsEP( unsigned bins, unsigned numBins )
292
1.83k
{
293
1.83k
  unsigned remBins = numBins;
294
4.57k
  while( remBins > 0 )
295
2.74k
  {
296
    //The process of encoding an EP bin is the same as that of coding a normal
297
    //bin where the symbol ranges for 1 and 0 are both half the range:
298
    //
299
    //  low = (low + range/2) << 1       (to encode a 1)
300
    //  low =  low            << 1       (to encode a 0)
301
    //
302
    //  i.e.
303
    //  low = (low + (bin * range/2)) << 1
304
    //
305
    //  which is equivalent to:
306
    //
307
    //  low = (low << 1) + (bin * range)
308
    //
309
    //  this can be generalised for multiple bins, producing the following expression:
310
    //
311
2.74k
    unsigned binsToCode = std::min<unsigned>( remBins, 8); //code bytes if able to take advantage of the system's byte-write function
312
2.74k
    unsigned binMask    = ( 1 << binsToCode ) - 1;
313
2.74k
    unsigned newBins    = ( bins >> ( remBins - binsToCode ) ) & binMask;
314
2.74k
    m_Low               = ( m_Low << binsToCode ) + ( newBins << 8 ); //range is known to be 256
315
2.74k
    remBins            -= binsToCode;
316
2.74k
    m_bitsLeft         -= binsToCode;
317
2.74k
    if( m_bitsLeft < 12 )
318
1.69k
    {
319
1.69k
      writeOut();
320
1.69k
    }
321
2.74k
  }
322
1.83k
}
323
324
void BinEncoderBase::writeOut()
325
27.0k
{
326
27.0k
  unsigned leadByte = m_Low >> ( 24 - m_bitsLeft );
327
27.0k
  m_bitsLeft       += 8;
328
27.0k
  m_Low            &= 0xffffffffu >> m_bitsLeft;
329
27.0k
  if( leadByte == 0xff )
330
1.66k
  {
331
1.66k
    m_numBufferedBytes++;
332
1.66k
  }
333
25.4k
  else
334
25.4k
  {
335
25.4k
    if( m_numBufferedBytes > 0 )
336
24.2k
    {
337
24.2k
      unsigned carry  = leadByte >> 8;
338
24.2k
      unsigned byte   = m_bufferedByte + carry;
339
24.2k
      m_bufferedByte  = leadByte & 0xff;
340
24.2k
      m_Bitstream->write( byte, 8 );
341
24.2k
      byte            = ( 0xff + carry ) & 0xff;
342
25.9k
      while( m_numBufferedBytes > 1 )
343
1.66k
      {
344
1.66k
        m_Bitstream->write( byte, 8 );
345
1.66k
        m_numBufferedBytes--;
346
1.66k
      }
347
24.2k
    }
348
1.14k
    else
349
1.14k
    {
350
1.14k
      m_numBufferedBytes  = 1;
351
1.14k
      m_bufferedByte      = leadByte;
352
1.14k
    }
353
25.4k
  }
354
27.0k
}
355
356
357
358
BinEncoder::BinEncoder()
359
4.58k
  : BinEncoderBase( static_cast<const BinProbModel*>    ( nullptr ) )
360
4.58k
  , m_Ctx         ( static_cast<CtxStore&>( *this   ) )
361
4.58k
{}
362
363
void BinEncoder::encodeBin( unsigned bin, unsigned ctxId )
364
297k
{
365
297k
  BinCounter::addCtx( ctxId );
366
297k
  BinProbModel& rcProbModel = m_Ctx[ctxId];
367
297k
  uint32_t      LPS         = rcProbModel.getLPS( m_Range );
368
369
//  DTRACE( g_trace_ctx, D_CABAC, "%d" " %d " "%d" "  " "[%d:%d]" "  " "%2d(MPS=%d)"  "  " "  -  " "%d" "\n", DTRACE_GET_COUNTER( g_trace_ctx, D_CABAC ), ctxId, m_Range, m_Range - LPS, LPS, ( unsigned int ) ( rcProbModel.state() ), bin == rcProbModel.mps(), bin );
370
297k
  DTRACE( g_trace_ctx, D_CABAC, " %d " "%d" "  " "[%d:%d]" "  " "%2d(MPS=%d)"  "  " "  -  " "%d" "\n", DTRACE_GET_COUNTER( g_trace_ctx, D_CABAC ), m_Range, m_Range - LPS, LPS, (unsigned int)( rcProbModel.state() ), bin == rcProbModel.mps(), bin );
371
372
297k
  m_Range   -=  LPS;
373
297k
  if( bin != rcProbModel.mps() )
374
38.2k
  {
375
38.2k
    int numBits   = rcProbModel.getRenormBitsLPS( LPS );
376
38.2k
    m_bitsLeft   -= numBits;
377
38.2k
    m_Low        += m_Range;
378
38.2k
    m_Low         = m_Low << numBits;
379
38.2k
    m_Range       = LPS   << numBits;
380
38.2k
    if( m_bitsLeft < 12 )
381
8.77k
    {
382
8.77k
      writeOut();
383
8.77k
    }
384
38.2k
  }
385
259k
  else
386
259k
  {
387
259k
    if( m_Range < 256 )
388
80.0k
    {
389
      //int numBits   = rcProbModel.getRenormBitsRange();
390
80.0k
      int numBits   = 1;
391
80.0k
      m_bitsLeft   -= numBits;
392
80.0k
      m_Low       <<= numBits;
393
80.0k
      m_Range     <<= numBits;
394
80.0k
      if( m_bitsLeft < 12 )
395
9.35k
      {
396
9.35k
        writeOut();
397
9.35k
      }
398
80.0k
    }
399
259k
  }
400
297k
  rcProbModel.update( bin );
401
297k
  BinEncoderBase::m_BinStore.addBin( bin, ctxId );
402
297k
}
403
404
BinEncIf* BinEncoder::getTestBinEncoder() const
405
0
{
406
0
  BinEncIf* testBinEncoder = 0;
407
0
  if( m_BinStore.inUse() )
408
0
  {
409
0
    testBinEncoder = new BinEncoder();
410
0
  }
411
0
  return testBinEncoder;
412
0
}
413
414
415
416
417
418
BitEstimatorBase::BitEstimatorBase( const BinProbModel* dummy )
419
28.9k
  : BinEncIf      ( dummy )
420
28.9k
{
421
28.9k
  m_EstFracBits = 0;
422
28.9k
}
423
424
void BitEstimatorBase::encodeRemAbsEP(unsigned bins, unsigned goRicePar, unsigned cutoff, int maxLog2TrDynamicRange)
425
4.89M
{
426
4.89M
  const unsigned threshold = cutoff << goRicePar;
427
4.89M
  if (bins < threshold)
428
2.60M
  {
429
2.60M
    m_EstFracBits += BinProbModelBase::estFracBitsEP((bins >> goRicePar) + 1 + goRicePar);
430
2.60M
  }
431
2.29M
  else 
432
2.29M
  {
433
2.29M
    const unsigned  maxPrefixLength = 32 - cutoff - maxLog2TrDynamicRange;
434
2.29M
    unsigned        prefixLength = 0;
435
2.29M
    unsigned        codeValue = (bins >> goRicePar) - cutoff;
436
2.29M
    unsigned        suffixLength;
437
2.29M
    if (codeValue >= ((1 << maxPrefixLength) - 1))
438
312
    {
439
312
      prefixLength = maxPrefixLength;
440
312
      suffixLength = maxLog2TrDynamicRange;
441
312
    }
442
2.29M
    else
443
2.29M
    {
444
8.74M
      while (codeValue > ((2 << prefixLength) - 2))
445
6.45M
      {
446
6.45M
        prefixLength++;
447
6.45M
      }
448
2.29M
      suffixLength = prefixLength + goRicePar + 1; //+1 for the separator bit
449
2.29M
    }
450
2.29M
    m_EstFracBits += BinProbModelBase::estFracBitsEP(cutoff + prefixLength + suffixLength);
451
2.29M
  }
452
4.89M
}
453
454
void BitEstimatorBase::align()
455
0
{
456
0
  static const uint64_t add   = BinProbModelBase::estFracBitsEP() - 1;
457
0
  static const uint64_t mask  = ~add;
458
0
  m_EstFracBits += add;
459
0
  m_EstFracBits &= mask;
460
0
}
461
462
463
BitEstimator::BitEstimator()
464
28.9k
  : BitEstimatorBase  ( static_cast<const BinProbModel*>    ( nullptr) )
465
28.9k
  , m_Ctx             ( static_cast<CtxStore&>              ( *this  ) )
466
28.9k
{}
467
468
} // namespace vvenc
469
470
//! \}
471