Coverage Report

Created: 2026-04-01 07:49

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