Coverage Report

Created: 2026-06-15 06:25

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