Coverage Report

Created: 2026-06-10 07:00

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