Coverage Report

Created: 2026-09-01 06:57

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.66k
  : m_CtxBinsCodedBuffer( Ctx::NumberOfContexts )
56
4.66k
  , m_NumBinsCtx        ( m_CtxBinsCodedBuffer.data() )
57
4.66k
  , m_NumBinsEP         ( 0 )
58
4.66k
  , m_NumBinsTrm        ( 0 )
59
4.66k
{}
60
61
62
void BinCounter::reset()
63
1.16k
{
64
431k
  for( std::size_t k = 0; k < m_CtxBinsCodedBuffer.size(); k++ )
65
430k
  {
66
430k
    m_NumBinsCtx[k] = 0;
67
430k
  }
68
1.16k
  m_NumBinsEP       = 0;
69
1.16k
  m_NumBinsTrm      = 0;
70
1.16k
}
71
72
73
uint32_t BinCounter::getAll() const
74
1.16k
{
75
1.16k
  uint32_t  count = m_NumBinsEP + m_NumBinsTrm;
76
431k
  for( std::size_t k = 0; k < m_CtxBinsCodedBuffer.size(); k++ )
77
430k
  {
78
430k
    count += m_NumBinsCtx[k];
79
430k
  }
80
1.16k
  return count;
81
1.16k
}
82
83
84
85
BinEncoderBase::BinEncoderBase( const BinProbModel* dummy )
86
4.66k
  : BinEncIf          ( dummy )
87
4.66k
  , m_Bitstream       ( 0 )
88
4.66k
  , m_Low             ( 0 )
89
4.66k
  , m_Range           ( 0 )
90
4.66k
  , m_bufferedByte    ( 0 )
91
4.66k
  , m_numBufferedBytes( 0 )
92
4.66k
  , m_bitsLeft        ( 0 )
93
4.66k
{}
94
95
void BinEncoderBase::init( OutputBitstream* bitstream )
96
3.57k
{
97
3.57k
  m_Bitstream = bitstream;
98
3.57k
}
99
100
void BinEncoderBase::uninit()
101
0
{
102
0
  m_Bitstream = 0;
103
0
}
104
105
void BinEncoderBase::start()
106
1.16k
{
107
1.16k
  m_Low               = 0;
108
1.16k
  m_Range             = 510;
109
1.16k
  m_bufferedByte      = 0xff;
110
1.16k
  m_numBufferedBytes  = 0;
111
1.16k
  m_bitsLeft          = 23;
112
1.16k
  BinCounter::reset();
113
1.16k
  m_BinStore. reset();
114
1.16k
}
115
116
void BinEncoderBase::finish()
117
1.16k
{
118
1.16k
  if( m_Low >> ( 32 - m_bitsLeft ) )
119
6
  {
120
6
    m_Bitstream->write( m_bufferedByte + 1, 8 );
121
7
    while( m_numBufferedBytes > 1 )
122
1
    {
123
1
      m_Bitstream->write( 0x00, 8 );
124
1
      m_numBufferedBytes--;
125
1
    }
126
6
    m_Low -= 1 << ( 32 - m_bitsLeft );
127
6
  }
128
1.16k
  else
129
1.16k
  {
130
1.16k
    if( m_numBufferedBytes > 0 )
131
1.16k
    {
132
1.16k
      m_Bitstream->write( m_bufferedByte, 8 );
133
1.16k
    }
134
1.16k
    while( m_numBufferedBytes > 1 )
135
8
    {
136
8
      m_Bitstream->write( 0xff, 8 );
137
8
      m_numBufferedBytes--;
138
8
    }
139
1.16k
  }
140
1.16k
  m_Bitstream->write( m_Low >> 8, 24 - m_bitsLeft );
141
1.16k
}
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.16k
{
154
1.16k
  Ctx::init( qp, initId );
155
1.16k
  start();
156
1.16k
}
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
446
{
169
446
  DTRACE( g_trace_ctx, D_CABAC, "%d" "  " "%d" "  EP=%d \n", DTRACE_GET_COUNTER( g_trace_ctx, D_CABAC ), m_Range, bin );
170
171
446
  BinCounter::addEP();
172
446
  m_Low <<= 1;
173
446
  if( bin )
174
20
  {
175
20
    m_Low += m_Range;
176
20
  }
177
446
  m_bitsLeft--;
178
446
  if( m_bitsLeft < 12 )
179
18
  {
180
18
    writeOut();
181
18
  }
182
446
}
183
184
void BinEncoderBase::encodeBinsEP( unsigned bins, unsigned numBins )
185
15.3k
{
186
78.7k
  for(int i = 0; i < numBins; i++)
187
63.4k
  {
188
63.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
63.4k
  }
190
191
15.3k
  BinCounter::addEP( numBins );
192
15.3k
  if( m_Range == 256 )
193
1.81k
  {
194
1.81k
    encodeAlignedBinsEP( bins, numBins );
195
1.81k
    return;
196
1.81k
  }
197
15.6k
  while( numBins > 8 )
198
2.17k
  {
199
2.17k
    numBins          -= 8;
200
2.17k
    unsigned pattern  = bins >> numBins;
201
2.17k
    m_Low           <<= 8;
202
2.17k
    m_Low            += m_Range * pattern;
203
2.17k
    bins             -= pattern << numBins;
204
2.17k
    m_bitsLeft       -= 8;
205
2.17k
    if( m_bitsLeft < 12 )
206
2.17k
    {
207
2.17k
      writeOut();
208
2.17k
    }
209
2.17k
  }
210
13.4k
  m_Low     <<= numBins;
211
13.4k
  m_Low      += m_Range * bins;
212
13.4k
  m_bitsLeft -= numBins;
213
13.4k
  if( m_bitsLeft < 12 )
214
4.19k
  {
215
4.19k
    writeOut();
216
4.19k
  }
217
13.4k
}
218
219
void BinEncoderBase::encodeRemAbsEP(unsigned bins, unsigned goRicePar, unsigned cutoff, int maxLog2TrDynamicRange)
220
2.33k
{
221
2.33k
  const unsigned threshold = cutoff << goRicePar;
222
2.33k
  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.33k
  else 
230
2.33k
  {
231
2.33k
    const unsigned  maxPrefixLength = 32 - cutoff - maxLog2TrDynamicRange;
232
2.33k
    unsigned        prefixLength = 0;
233
2.33k
    unsigned        codeValue = (bins >> goRicePar) - cutoff;
234
2.33k
    unsigned        suffixLength;
235
2.33k
    if (codeValue >= ((1 << maxPrefixLength) - 1))
236
51
    {
237
51
      prefixLength = maxPrefixLength;
238
51
      suffixLength = maxLog2TrDynamicRange;
239
51
    }
240
2.28k
    else
241
2.28k
    {
242
16.9k
      while (codeValue > ((2 << prefixLength) - 2))
243
14.6k
      {
244
14.6k
        prefixLength++;
245
14.6k
      }
246
2.28k
      suffixLength = prefixLength + goRicePar + 1; //+1 for the separator bit
247
2.28k
    }
248
2.33k
    const unsigned totalPrefixLength = prefixLength + cutoff;
249
2.33k
    const unsigned bitMask = (1 << goRicePar) - 1;
250
2.33k
    const unsigned prefix = (1 << totalPrefixLength) - 1;
251
2.33k
    const unsigned suffix = ((codeValue - ((1 << prefixLength) - 1)) << goRicePar) | (bins & bitMask);
252
2.33k
    encodeBinsEP(prefix, totalPrefixLength); //prefix
253
2.33k
    encodeBinsEP(suffix, suffixLength); //separator, suffix, and rParam bits
254
2.33k
  }
255
2.33k
}
256
257
void BinEncoderBase::encodeBinTrm( unsigned bin )
258
1.16k
{
259
1.16k
  BinCounter::addTrm();
260
1.16k
  m_Range -= 2;
261
1.16k
  if( bin )
262
1.16k
  {
263
1.16k
    m_Low      += m_Range;
264
1.16k
    m_Low     <<= 7;
265
1.16k
    m_Range     = 2 << 7;
266
1.16k
    m_bitsLeft -= 7;
267
1.16k
  }
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.16k
  if( m_bitsLeft < 12 )
279
1.01k
  {
280
1.01k
    writeOut();
281
1.01k
  }
282
1.16k
}
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.81k
{
293
1.81k
  unsigned remBins = numBins;
294
4.53k
  while( remBins > 0 )
295
2.71k
  {
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.71k
    unsigned binsToCode = std::min<unsigned>( remBins, 8); //code bytes if able to take advantage of the system's byte-write function
312
2.71k
    unsigned binMask    = ( 1 << binsToCode ) - 1;
313
2.71k
    unsigned newBins    = ( bins >> ( remBins - binsToCode ) ) & binMask;
314
2.71k
    m_Low               = ( m_Low << binsToCode ) + ( newBins << 8 ); //range is known to be 256
315
2.71k
    remBins            -= binsToCode;
316
2.71k
    m_bitsLeft         -= binsToCode;
317
2.71k
    if( m_bitsLeft < 12 )
318
1.68k
    {
319
1.68k
      writeOut();
320
1.68k
    }
321
2.71k
  }
322
1.81k
}
323
324
void BinEncoderBase::writeOut()
325
27.3k
{
326
27.3k
  unsigned leadByte = m_Low >> ( 24 - m_bitsLeft );
327
27.3k
  m_bitsLeft       += 8;
328
27.3k
  m_Low            &= 0xffffffffu >> m_bitsLeft;
329
27.3k
  if( leadByte == 0xff )
330
1.68k
  {
331
1.68k
    m_numBufferedBytes++;
332
1.68k
  }
333
25.6k
  else
334
25.6k
  {
335
25.6k
    if( m_numBufferedBytes > 0 )
336
24.5k
    {
337
24.5k
      unsigned carry  = leadByte >> 8;
338
24.5k
      unsigned byte   = m_bufferedByte + carry;
339
24.5k
      m_bufferedByte  = leadByte & 0xff;
340
24.5k
      m_Bitstream->write( byte, 8 );
341
24.5k
      byte            = ( 0xff + carry ) & 0xff;
342
26.1k
      while( m_numBufferedBytes > 1 )
343
1.67k
      {
344
1.67k
        m_Bitstream->write( byte, 8 );
345
1.67k
        m_numBufferedBytes--;
346
1.67k
      }
347
24.5k
    }
348
1.16k
    else
349
1.16k
    {
350
1.16k
      m_numBufferedBytes  = 1;
351
1.16k
      m_bufferedByte      = leadByte;
352
1.16k
    }
353
25.6k
  }
354
27.3k
}
355
356
357
358
BinEncoder::BinEncoder()
359
4.66k
  : BinEncoderBase( static_cast<const BinProbModel*>    ( nullptr ) )
360
4.66k
  , m_Ctx         ( static_cast<CtxStore&>( *this   ) )
361
4.66k
{}
362
363
void BinEncoder::encodeBin( unsigned bin, unsigned ctxId )
364
298k
{
365
298k
  BinCounter::addCtx( ctxId );
366
298k
  BinProbModel& rcProbModel = m_Ctx[ctxId];
367
298k
  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
298k
  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
298k
  m_Range   -=  LPS;
373
298k
  if( bin != rcProbModel.mps() )
374
38.7k
  {
375
38.7k
    int numBits   = rcProbModel.getRenormBitsLPS( LPS );
376
38.7k
    m_bitsLeft   -= numBits;
377
38.7k
    m_Low        += m_Range;
378
38.7k
    m_Low         = m_Low << numBits;
379
38.7k
    m_Range       = LPS   << numBits;
380
38.7k
    if( m_bitsLeft < 12 )
381
8.86k
    {
382
8.86k
      writeOut();
383
8.86k
    }
384
38.7k
  }
385
259k
  else
386
259k
  {
387
259k
    if( m_Range < 256 )
388
80.4k
    {
389
      //int numBits   = rcProbModel.getRenormBitsRange();
390
80.4k
      int numBits   = 1;
391
80.4k
      m_bitsLeft   -= numBits;
392
80.4k
      m_Low       <<= numBits;
393
80.4k
      m_Range     <<= numBits;
394
80.4k
      if( m_bitsLeft < 12 )
395
9.40k
      {
396
9.40k
        writeOut();
397
9.40k
      }
398
80.4k
    }
399
259k
  }
400
298k
  rcProbModel.update( bin );
401
298k
  BinEncoderBase::m_BinStore.addBin( bin, ctxId );
402
298k
}
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
29.0k
  : BinEncIf      ( dummy )
420
29.0k
{
421
29.0k
  m_EstFracBits = 0;
422
29.0k
}
423
424
void BitEstimatorBase::encodeRemAbsEP(unsigned bins, unsigned goRicePar, unsigned cutoff, int maxLog2TrDynamicRange)
425
4.99M
{
426
4.99M
  const unsigned threshold = cutoff << goRicePar;
427
4.99M
  if (bins < threshold)
428
2.66M
  {
429
2.66M
    m_EstFracBits += BinProbModelBase::estFracBitsEP((bins >> goRicePar) + 1 + goRicePar);
430
2.66M
  }
431
2.32M
  else 
432
2.32M
  {
433
2.32M
    const unsigned  maxPrefixLength = 32 - cutoff - maxLog2TrDynamicRange;
434
2.32M
    unsigned        prefixLength = 0;
435
2.32M
    unsigned        codeValue = (bins >> goRicePar) - cutoff;
436
2.32M
    unsigned        suffixLength;
437
2.32M
    if (codeValue >= ((1 << maxPrefixLength) - 1))
438
306
    {
439
306
      prefixLength = maxPrefixLength;
440
306
      suffixLength = maxLog2TrDynamicRange;
441
306
    }
442
2.32M
    else
443
2.32M
    {
444
8.85M
      while (codeValue > ((2 << prefixLength) - 2))
445
6.53M
      {
446
6.53M
        prefixLength++;
447
6.53M
      }
448
2.32M
      suffixLength = prefixLength + goRicePar + 1; //+1 for the separator bit
449
2.32M
    }
450
2.32M
    m_EstFracBits += BinProbModelBase::estFracBitsEP(cutoff + prefixLength + suffixLength);
451
2.32M
  }
452
4.99M
}
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
29.0k
  : BitEstimatorBase  ( static_cast<const BinProbModel*>    ( nullptr) )
465
29.0k
  , m_Ctx             ( static_cast<CtxStore&>              ( *this  ) )
466
29.0k
{}
467
468
} // namespace vvenc
469
470
//! \}
471