Coverage Report

Created: 2026-08-31 06:22

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