Newer
Older

Karsten Suehring
committed
/* The copyright in this software is being made available under the BSD
* License, included below. This software may be subject to other third party
* and contributor rights, including patent rights, and no such rights are
* granted under this license.
*
* Copyright (c) 2010-2019, ITU/ISO/IEC

Karsten Suehring
committed
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* * Neither the name of the ITU/ISO/IEC nor the names of its contributors may
* be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
/** \file Buffer.h
* \brief Low-overhead class describing 2D memory layout
*/
#ifndef __BUFFER__
#define __BUFFER__
#include "Common.h"
#include "CommonDef.h"
#include "ChromaFormat.h"
#include "MotionInfo.h"
#include <string.h>
#include <type_traits>
#include <typeinfo>
// ---------------------------------------------------------------------------
// AreaBuf struct
// ---------------------------------------------------------------------------
struct PelBufferOps
{
PelBufferOps();
#if ENABLE_SIMD_OPT_BUFFER && defined(TARGET_SIMD_X86)

Karsten Suehring
committed
void initPelBufOpsX86();
template<X86_VEXT vext>
void _initPelBufOpsX86();

Karsten Suehring
committed
void ( *addAvg4 ) ( const Pel* src0, int src0Stride, const Pel* src1, int src1Stride, Pel *dst, int dstStride, int width, int height, int shift, int offset, const ClpRng& clpRng );
void ( *addAvg8 ) ( const Pel* src0, int src0Stride, const Pel* src1, int src1Stride, Pel *dst, int dstStride, int width, int height, int shift, int offset, const ClpRng& clpRng );
void ( *reco4 ) ( const Pel* src0, int src0Stride, const Pel* src1, int src1Stride, Pel *dst, int dstStride, int width, int height, const ClpRng& clpRng );
void ( *reco8 ) ( const Pel* src0, int src0Stride, const Pel* src1, int src1Stride, Pel *dst, int dstStride, int width, int height, const ClpRng& clpRng );
void ( *linTf4 ) ( const Pel* src0, int src0Stride, Pel *dst, int dstStride, int width, int height, int scale, int shift, int offset, const ClpRng& clpRng, bool bClip );
void ( *linTf8 ) ( const Pel* src0, int src0Stride, Pel *dst, int dstStride, int width, int height, int scale, int shift, int offset, const ClpRng& clpRng, bool bClip );
void(*addBIOAvg4) (const Pel* src0, int src0Stride, const Pel* src1, int src1Stride, Pel *dst, int dstStride, const Pel *gradX0, const Pel *gradX1, const Pel *gradY0, const Pel*gradY1, int gradStride, int width, int height, int tmpx, int tmpy, int shift, int offset, const ClpRng& clpRng);
void(*bioGradFilter) (Pel* pSrc, int srcStride, int width, int height, int gradStride, Pel* gradX, Pel* gradY, const int bitDepth);
void(*calcBIOPar) (const Pel* srcY0Temp, const Pel* srcY1Temp, const Pel* gradX0, const Pel* gradX1, const Pel* gradY0, const Pel* gradY1, int* dotProductTemp1, int* dotProductTemp2, int* dotProductTemp3, int* dotProductTemp5, int* dotProductTemp6, const int src0Stride, const int src1Stride, const int gradStride, const int widthG, const int heightG, const int bitDepth);
void(*calcBIOSums) (const Pel* srcY0Tmp, const Pel* srcY1Tmp, Pel* gradX0, Pel* gradX1, Pel* gradY0, Pel* gradY1, int xu, int yu, const int src0Stride, const int src1Stride, const int widthG, const int bitDepth, int* sumAbsGX, int* sumAbsGY, int* sumDIX, int* sumDIY, int* sumSignGY_GX);
void(*calcBlkGradient)(int sx, int sy, int *arraysGx2, int *arraysGxGy, int *arraysGxdI, int *arraysGy2, int *arraysGydI, int &sGx2, int &sGy2, int &sGxGy, int &sGxdI, int &sGydI, int width, int height, int unitSize);
void(*copyBuffer)(Pel *src, int srcStride, Pel *dst, int dstStride, int width, int height);
void(*padding)(Pel *dst, int stride, int width, int height, int padSize);
#if ENABLE_SIMD_OPT_GBI
void ( *removeWeightHighFreq8) ( Pel* src0, int src0Stride, const Pel* src1, int src1Stride, int width, int height, int shift, int gbiWeight);
void ( *removeWeightHighFreq4) ( Pel* src0, int src0Stride, const Pel* src1, int src1Stride, int width, int height, int shift, int gbiWeight);
void ( *removeHighFreq8) ( Pel* src0, int src0Stride, const Pel* src1, int src1Stride, int width, int height);
void ( *removeHighFreq4) ( Pel* src0, int src0Stride, const Pel* src1, int src1Stride, int width, int height);
#endif
void (*profGradFilter) (Pel* pSrc, int srcStride, int width, int height, int gradStride, Pel* gradX, Pel* gradY, const int bitDepth);
void (*applyPROF) (Pel* dst, int dstStride, const Pel* src, int srcStride, int width, int height, const Pel* gradX, const Pel* gradY, int gradStride, const int* dMvX, const int* dMvY, int dMvStride, int shiftNum, Pel offset, const ClpRng& clpRng);
void (*applyBiPROF[2]) (Pel* dst, int dstStride, const Pel* src0, const Pel* src1, int srcStride, int width, int height, const Pel* gradX0, const Pel* gradY0, const Pel* gradX1, const Pel* gradY1, int gradStride, const int* dMvX0, const int* dMvY0, const int* dMvX1, const int* dMvY1, int dMvStride, const int8_t gbiWeightL0, const ClpRng& clpRng);
void (*roundIntVector) (int* v, int size, unsigned int nShift, const int dmvLimit);

Karsten Suehring
committed
};
extern PelBufferOps g_pelBufOP;
void paddingCore(Pel *ptr, int stride, int width, int height, int padSize);
void copyBufferCore(Pel *src, int srcStride, Pel *Dst, int dstStride, int width, int height);

Karsten Suehring
committed
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
template<typename T>
struct AreaBuf : public Size
{
T* buf;
int stride;
// the proper type causes awful lot of errors
//ptrdiff_t stride;
AreaBuf() : Size(), buf( NULL ), stride( 0 ) { }
AreaBuf( T *_buf, const Size &size ) : Size( size ), buf( _buf ), stride( size.width ) { }
AreaBuf( T *_buf, const int &_stride, const Size &size ) : Size( size ), buf( _buf ), stride( _stride ) { }
AreaBuf( T *_buf, const SizeType &_width, const SizeType &_height ) : Size( _width, _height ), buf( _buf ), stride( _width ) { }
AreaBuf( T *_buf, const int &_stride, const SizeType &_width, const SizeType &_height ) : Size( _width, _height ), buf( _buf ), stride( _stride ) { }
operator AreaBuf<const T>() const { return AreaBuf<const T>( buf, stride, width, height ); }
void fill ( const T &val );
void memset ( const int val );
void copyFrom ( const AreaBuf<const T> &other );
void reconstruct ( const AreaBuf<const T> &pred, const AreaBuf<const T> &resi, const ClpRng& clpRng);
void copyClip ( const AreaBuf<const T> &src, const ClpRng& clpRng);
void subtract ( const AreaBuf<const T> &other );
void extendSingleBorderPel();
void extendBorderPel ( unsigned margin );
Rickard Sjöberg
committed
#if JVET_O0549_ENCODER_ONLY_FILTER
void extendBorderPel(unsigned marginX, unsigned marginY);
#endif
void addWeightedAvg ( const AreaBuf<const T> &other1, const AreaBuf<const T> &other2, const ClpRng& clpRng, const int8_t gbiIdx);
void removeWeightHighFreq ( const AreaBuf<T>& other, const bool bClip, const ClpRng& clpRng, const int8_t iGbiWeight);

Karsten Suehring
committed
void addAvg ( const AreaBuf<const T> &other1, const AreaBuf<const T> &other2, const ClpRng& clpRng );
void removeHighFreq ( const AreaBuf<T>& other, const bool bClip, const ClpRng& clpRng);
void updateHistogram ( std::vector<int32_t>& hist ) const;
T meanDiff ( const AreaBuf<const T> &other ) const;
void subtract ( const T val );
void linearTransform ( const int scale, const int shift, const int offset, bool bClip, const ClpRng& clpRng );
void transposedFrom ( const AreaBuf<const T> &other );
void toLast ( const ClpRng& clpRng );
void scaleSignal ( const int scale, const bool dir , const ClpRng& clpRng);

Karsten Suehring
committed
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
T& at( const int &x, const int &y ) { return buf[y * stride + x]; }
const T& at( const int &x, const int &y ) const { return buf[y * stride + x]; }
T& at( const Position &pos ) { return buf[pos.y * stride + pos.x]; }
const T& at( const Position &pos ) const { return buf[pos.y * stride + pos.x]; }
T* bufAt( const int &x, const int &y ) { return &at( x, y ); }
const T* bufAt( const int &x, const int &y ) const { return &at( x, y ); }
T* bufAt( const Position& pos ) { return &at( pos ); }
const T* bufAt( const Position& pos ) const { return &at( pos ); }
AreaBuf< T> subBuf( const Position &pos, const Size &size ) { return AreaBuf< T>( bufAt( pos ), stride, size ); }
AreaBuf<const T> subBuf( const Position &pos, const Size &size ) const { return AreaBuf<const T>( bufAt( pos ), stride, size ); }
AreaBuf< T> subBuf( const int &x, const int &y, const unsigned &_w, const unsigned &_h ) { return AreaBuf< T>( bufAt( x, y ), stride, _w, _h ); }
AreaBuf<const T> subBuf( const int &x, const int &y, const unsigned &_w, const unsigned &_h ) const { return AreaBuf<const T>( bufAt( x, y ), stride, _w, _h ); }
};
typedef AreaBuf< Pel> PelBuf;
typedef AreaBuf<const Pel> CPelBuf;
typedef AreaBuf< TCoeff> CoeffBuf;
typedef AreaBuf<const TCoeff> CCoeffBuf;
typedef AreaBuf< MotionInfo> MotionBuf;
typedef AreaBuf<const MotionInfo> CMotionBuf;
typedef AreaBuf< TCoeff> PLTescapeBuf;
Yung-Hsuan Chao (Jessie)
committed
typedef AreaBuf<const TCoeff> CPLTescapeBuf;
Frank Bossen
committed
typedef AreaBuf< bool> PLTtypeBuf;
typedef AreaBuf<const bool> CPLTtypeBuf;

Karsten Suehring
committed
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
#define SIZE_AWARE_PER_EL_OP( OP, INC ) \
if( ( width & 7 ) == 0 ) \
{ \
for( int y = 0; y < height; y++ ) \
{ \
for( int x = 0; x < width; x += 8 ) \
{ \
OP( x + 0 ); \
OP( x + 1 ); \
OP( x + 2 ); \
OP( x + 3 ); \
OP( x + 4 ); \
OP( x + 5 ); \
OP( x + 6 ); \
OP( x + 7 ); \
} \
\
INC; \
} \
} \
else if( ( width & 3 ) == 0 ) \
{ \
for( int y = 0; y < height; y++ ) \
{ \
for( int x = 0; x < width; x += 4 ) \
{ \
OP( x + 0 ); \
OP( x + 1 ); \
OP( x + 2 ); \
OP( x + 3 ); \
} \
\
INC; \
} \
} \
else if( ( width & 1 ) == 0 ) \
{ \
for( int y = 0; y < height; y++ ) \
{ \
for( int x = 0; x < width; x += 2 ) \
{ \
OP( x + 0 ); \
OP( x + 1 ); \
} \
\
INC; \
} \
} \
else \
{ \
for( int y = 0; y < height; y++ ) \
{ \
for( int x = 0; x < width; x++ ) \
{ \
OP( x ); \
} \
\
INC; \
} \
}
template<typename T>
void AreaBuf<T>::fill(const T &val)
{
if( sizeof( T ) == 1 )
{
if( width == stride )
{
::memset( buf, reinterpret_cast< const signed char& >( val ), width * height * sizeof( T ) );
}
else
{
T* dest = buf;
size_t line = width * sizeof( T );
for( unsigned y = 0; y < height; y++ )
{
::memset( dest, reinterpret_cast< const signed char& >( val ), line );
dest += stride;
}
}
}
else if( T( 0 ) == val )
{
if( width == stride )
{
::memset( buf, 0, width * height * sizeof( T ) );
}
else
{
T* dest = buf;
size_t line = width * sizeof( T );
for( unsigned y = 0; y < height; y++ )
{
::memset( dest, 0, line );
dest += stride;
}
}
}
else
{
T* dest = buf;
#define FILL_INC dest += stride
#define FILL_OP( ADDR ) dest[ADDR] = val
SIZE_AWARE_PER_EL_OP( FILL_OP, FILL_INC );
#undef FILL_INC
#undef FILL_OP
}
}
template<typename T>
void AreaBuf<T>::memset( const int val )
{
if( width == stride )
{
::memset( buf, val, width * height * sizeof( T ) );
}
else
{
T* dest = buf;
size_t line = width * sizeof( T );
for( int y = 0; y < height; y++ )
{
::memset( dest, val, line );
dest += stride;
}
}
}
template<typename T>
void AreaBuf<T>::copyFrom( const AreaBuf<const T> &other )
{
#if !defined(__GNUC__) || __GNUC__ > 5
static_assert( std::is_trivially_copyable<T>::value, "Type T is not trivially_copyable" );
#endif
CHECK( width != other.width, "Incompatible size" );
CHECK( height != other.height, "Incompatible size" );
if( buf == other.buf )
{
return;
}
if( width == stride && stride == other.stride )
{
memcpy( buf, other.buf, width * height * sizeof( T ) );
}
else
{
T* dst = buf;
const T* src = other.buf;
const unsigned srcStride = other.stride;
for( unsigned y = 0; y < height; y++ )
{
memcpy( dst, src, width * sizeof( T ) );
dst += stride;
src += srcStride;
}
}
}
template<typename T>
void AreaBuf<T>::subtract( const AreaBuf<const T> &other )
{
CHECK( width != other.width, "Incompatible size" );
CHECK( height != other.height, "Incompatible size" );
T* dest = buf;
const T* subs = other.buf;
#define SUBS_INC \
dest += stride; \
subs += other.stride; \
#define SUBS_OP( ADDR ) dest[ADDR] -= subs[ADDR]
SIZE_AWARE_PER_EL_OP( SUBS_OP, SUBS_INC );
#undef SUBS_OP
#undef SUBS_INC
}

Karsten Suehring
committed
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
template<typename T>
void AreaBuf<T>::copyClip( const AreaBuf<const T> &src, const ClpRng& clpRng )
{
THROW( "Type not supported" );
}
template<>
void AreaBuf<Pel>::copyClip( const AreaBuf<const Pel> &src, const ClpRng& clpRng );
template<typename T>
void AreaBuf<T>::reconstruct( const AreaBuf<const T> &pred, const AreaBuf<const T> &resi, const ClpRng& clpRng )
{
THROW( "Type not supported" );
}
template<>
void AreaBuf<Pel>::reconstruct( const AreaBuf<const Pel> &pred, const AreaBuf<const Pel> &resi, const ClpRng& clpRng );
template<typename T>
void AreaBuf<T>::addAvg( const AreaBuf<const T> &other1, const AreaBuf<const T> &other2, const ClpRng& clpRng )
{
THROW( "Type not supported" );
}
template<>
void AreaBuf<Pel>::addAvg( const AreaBuf<const Pel> &other1, const AreaBuf<const Pel> &other2, const ClpRng& clpRng );
template<typename T>
void AreaBuf<T>::linearTransform( const int scale, const int shift, const int offset, bool bClip, const ClpRng& clpRng )
{
THROW( "Type not supported" );
}
template<>
void AreaBuf<Pel>::linearTransform( const int scale, const int shift, const int offset, bool bClip, const ClpRng& clpRng );
template<typename T>
void AreaBuf<T>::toLast( const ClpRng& clpRng )
{
THROW( "Type not supported" );
}
template<>
void AreaBuf<Pel>::toLast( const ClpRng& clpRng );
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
template<typename T>
void AreaBuf<T>::removeWeightHighFreq(const AreaBuf<T>& other, const bool bClip, const ClpRng& clpRng, const int8_t gbiWeight)
{
const int8_t gbiWeightOther = g_GbiWeightBase - gbiWeight;
const int8_t log2WeightBase = g_GbiLog2WeightBase;
const Pel* src = other.buf;
const int srcStride = other.stride;
Pel* dst = buf;
const int dstStride = stride;
#if ENABLE_SIMD_OPT_GBI
if(!bClip)
{
if(!(width & 7))
g_pelBufOP.removeWeightHighFreq8(dst, dstStride, src, srcStride, width, height, 16, gbiWeight);
else if(!(width & 3))
g_pelBufOP.removeWeightHighFreq4(dst, dstStride, src, srcStride, width, height, 16, gbiWeight);
else
CHECK(true, "Not supported");
}
else
{
#endif
int normalizer = ((1 << 16) + (gbiWeight > 0 ? (gbiWeight >> 1) : -(gbiWeight >> 1))) / gbiWeight;
int weight0 = normalizer << log2WeightBase;
int weight1 = gbiWeightOther * normalizer;
#define REM_HF_INC \
src += srcStride; \
dst += dstStride; \
#define REM_HF_OP_CLIP( ADDR ) dst[ADDR] = ClipPel<T>( (dst[ADDR]*weight0 - src[ADDR]*weight1 + (1<<15))>>16, clpRng )
#define REM_HF_OP( ADDR ) dst[ADDR] = (dst[ADDR]*weight0 - src[ADDR]*weight1 + (1<<15))>>16
if(bClip)
{
SIZE_AWARE_PER_EL_OP(REM_HF_OP_CLIP, REM_HF_INC);
}
else
{
SIZE_AWARE_PER_EL_OP(REM_HF_OP, REM_HF_INC);
}
#undef REM_HF_INC
#undef REM_HF_OP
#undef REM_HF_OP_CLIP
#if ENABLE_SIMD_OPT_GBI
}
#endif
}

Karsten Suehring
committed
template<typename T>
void AreaBuf<T>::removeHighFreq( const AreaBuf<T>& other, const bool bClip, const ClpRng& clpRng )
{
const T* src = other.buf;
const int srcStride = other.stride;
T* dst = buf;
const int dstStride = stride;
if (!bClip)
{
if(!(width & 7))
g_pelBufOP.removeHighFreq8(dst, dstStride, src, srcStride, width, height);
else if (!(width & 3))
g_pelBufOP.removeHighFreq4(dst, dstStride, src, srcStride, width, height);
else
CHECK(true, "Not supported");
}
else
{
#endif

Karsten Suehring
committed
#define REM_HF_INC \
src += srcStride; \
dst += dstStride; \
#define REM_HF_OP_CLIP( ADDR ) dst[ADDR] = ClipPel<T>( 2 * dst[ADDR] - src[ADDR], clpRng )
#define REM_HF_OP( ADDR ) dst[ADDR] = 2 * dst[ADDR] - src[ADDR]
if( bClip )
{
SIZE_AWARE_PER_EL_OP( REM_HF_OP_CLIP, REM_HF_INC );
}
else
{
SIZE_AWARE_PER_EL_OP( REM_HF_OP, REM_HF_INC );
}
#undef REM_HF_INC
#undef REM_HF_OP
#undef REM_HF_OP_CLIP

Karsten Suehring
committed
}
template<typename T>
void AreaBuf<T>::updateHistogram( std::vector<int32_t>& hist ) const
{
const T* data = buf;
for( std::size_t y = 0; y < height; y++, data += stride )
{
for( std::size_t x = 0; x < width; x++ )
{
hist[ data[x] ]++;
}
}
}
Rickard Sjöberg
committed
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
#if JVET_O0549_ENCODER_ONLY_FILTER
template<typename T>
void AreaBuf<T>::extendBorderPel(unsigned marginX, unsigned marginY)
{
T* p = buf;
int h = height;
int w = width;
int s = stride;
CHECK((w + 2 * marginX) > s, "Size of buffer too small to extend");
// do left and right margins
for (int y = 0; y < h; y++)
{
for (int x = 0; x < marginX; x++)
{
*(p - marginX + x) = p[0];
p[w + x] = p[w - 1];
}
p += s;
}
// p is now the (0,height) (bottom left of image within bigger picture
p -= (s + marginX);
// p is now the (-margin, height-1)
for (int y = 0; y < marginY; y++)
{
::memcpy(p + (y + 1) * s, p, sizeof(T) * (w + (marginX << 1)));
}
// p is still (-marginX, height-1)
p -= ((h - 1) * s);
// p is now (-marginX, 0)
for (int y = 0; y < marginY; y++)
{
::memcpy(p - (y + 1) * s, p, sizeof(T) * (w + (marginX << 1)));
}
}
#endif

Karsten Suehring
committed
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
template<typename T>
void AreaBuf<T>::extendBorderPel( unsigned margin )
{
T* p = buf;
int h = height;
int w = width;
int s = stride;
CHECK( ( w + 2 * margin ) > s, "Size of buffer too small to extend" );
// do left and right margins
for( int y = 0; y < h; y++ )
{
for( int x = 0; x < margin; x++ )
{
*( p - margin + x ) = p[0];
p[w + x] = p[w - 1];
}
p += s;
}
// p is now the (0,height) (bottom left of image within bigger picture
p -= ( s + margin );
// p is now the (-margin, height-1)
for( int y = 0; y < margin; y++ )
{
::memcpy( p + ( y + 1 ) * s, p, sizeof( T ) * ( w + ( margin << 1 ) ) );
}
// pi is still (-marginX, height-1)
p -= ( ( h - 1 ) * s );
// pi is now (-marginX, 0)
for( int y = 0; y < margin; y++ )
{
::memcpy( p - ( y + 1 ) * s, p, sizeof( T ) * ( w + ( margin << 1 ) ) );
}
}

Christian Helmrich
committed

Karsten Suehring
committed
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
template<typename T>
T AreaBuf<T>::meanDiff( const AreaBuf<const T> &other ) const
{
int64_t acc = 0;
CHECK( width != other.width, "Incompatible size" );
CHECK( height != other.height, "Incompatible size" );
const T* src1 = buf;
const T* src2 = other.buf;
#define MEAN_DIFF_INC \
src1 += stride; \
src2 += other.stride; \
#define MEAN_DIFF_OP(ADDR) acc += src1[ADDR] - src2[ADDR]
SIZE_AWARE_PER_EL_OP( MEAN_DIFF_OP, MEAN_DIFF_INC );
#undef MEAN_DIFF_INC
#undef MEAN_DIFF_OP
return T( acc / area() );
}
#if ENABLE_SIMD_OPT_BUFFER && defined(TARGET_SIMD_X86)
template<> void AreaBuf<Pel>::subtract( const Pel val );
#endif
template<typename T>
void AreaBuf<T>::subtract( const T val )
{
T* dst = buf;
#define OFFSET_INC dst += stride
#define OFFSET_OP(ADDR) dst[ADDR] -= val
SIZE_AWARE_PER_EL_OP( OFFSET_OP, OFFSET_INC );
#undef OFFSET_INC
#undef OFFSET_OP
}
template<typename T>
void AreaBuf<T>::transposedFrom( const AreaBuf<const T> &other )
{
CHECK( width * height != other.width * other.height, "Incompatible size" );
T* dst = buf;
const T* src = other.buf;
width = other.height;
height = other.width;
stride = stride < width ? width : stride;
for( unsigned y = 0; y < other.height; y++ )
{
for( unsigned x = 0; x < other.width; x++ )
{
dst[y + x*stride] = src[x + y*other.stride];
}
}
}
template<typename T>
T AreaBuf <T> ::computeAvg() const
{
const T* src = buf;
#if ENABLE_QPA
int64_t acc = 0; // for picture-wise use in getGlaringColorQPOffset() and applyQPAdaptationChroma()
#else
int32_t acc = 0;
#endif
#define AVG_INC src += stride
#define AVG_OP(ADDR) acc += src[ADDR]
SIZE_AWARE_PER_EL_OP(AVG_OP, AVG_INC);
#undef AVG_INC
#undef AVG_OP
return T ((acc + (area() >> 1)) / area());
}

Karsten Suehring
committed
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
#ifndef DONT_UNDEF_SIZE_AWARE_PER_EL_OP
#undef SIZE_AWARE_PER_EL_OP
#endif // !DONT_UNDEF_SIZE_AWARE_PER_EL_OP
// ---------------------------------------------------------------------------
// UnitBuf struct
// ---------------------------------------------------------------------------
struct UnitArea;
template<typename T>
struct UnitBuf
{
typedef static_vector<AreaBuf<T>, MAX_NUM_COMPONENT> UnitBufBuffers;
typedef static_vector<AreaBuf<const T>, MAX_NUM_COMPONENT> ConstUnitBufBuffers;
ChromaFormat chromaFormat;
UnitBufBuffers bufs;
UnitBuf() : chromaFormat( NUM_CHROMA_FORMAT ) { }
UnitBuf( const ChromaFormat &_chromaFormat, const UnitBufBuffers& _bufs ) : chromaFormat( _chromaFormat ), bufs( _bufs ) { }
UnitBuf( const ChromaFormat &_chromaFormat, UnitBufBuffers&& _bufs ) : chromaFormat( _chromaFormat ), bufs( std::forward<UnitBufBuffers>( _bufs ) ) { }
UnitBuf( const ChromaFormat &_chromaFormat, const AreaBuf<T> &blkY ) : chromaFormat( _chromaFormat ), bufs{ blkY } { }
UnitBuf( const ChromaFormat &_chromaFormat, AreaBuf<T> &&blkY ) : chromaFormat( _chromaFormat ), bufs{ std::forward<AreaBuf<T> >(blkY) } { }
UnitBuf( const ChromaFormat &_chromaFormat, const AreaBuf<T> &blkY, const AreaBuf<T> &blkCb, const AreaBuf<T> &blkCr ) : chromaFormat( _chromaFormat ), bufs{ blkY, blkCb, blkCr } { }
UnitBuf( const ChromaFormat &_chromaFormat, AreaBuf<T> &&blkY, AreaBuf<T> &&blkCb, AreaBuf<T> &&blkCr ) : chromaFormat( _chromaFormat ), bufs{ std::forward<AreaBuf<T> >(blkY), std::forward<AreaBuf<T> >(blkCb), std::forward<AreaBuf<T> >(blkCr) } { }
operator UnitBuf<const T>() const
{
return UnitBuf<const T>( chromaFormat, ConstUnitBufBuffers( bufs.begin(), bufs.end() ) );
}
AreaBuf<T>& get( const ComponentID comp ) { return bufs[comp]; }
const AreaBuf<T>& get( const ComponentID comp ) const { return bufs[comp]; }
AreaBuf<T>& Y() { return bufs[0]; }
const AreaBuf<T>& Y() const { return bufs[0]; }
AreaBuf<T>& Cb() { return bufs[1]; }
const AreaBuf<T>& Cb() const { return bufs[1]; }
AreaBuf<T>& Cr() { return bufs[2]; }
const AreaBuf<T>& Cr() const { return bufs[2]; }
void fill ( const T &val );
void copyFrom ( const UnitBuf<const T> &other );
void reconstruct ( const UnitBuf<const T> &pred, const UnitBuf<const T> &resi, const ClpRngs& clpRngs );
void copyClip ( const UnitBuf<const T> &src, const ClpRngs& clpRngs );
void subtract ( const UnitBuf<const T> &other );
void addWeightedAvg ( const UnitBuf<const T> &other1, const UnitBuf<const T> &other2, const ClpRngs& clpRngs, const uint8_t gbiIdx = GBI_DEFAULT, const bool chromaOnly = false, const bool lumaOnly = false);

Karsten Suehring
committed
void addAvg ( const UnitBuf<const T> &other1, const UnitBuf<const T> &other2, const ClpRngs& clpRngs, const bool chromaOnly = false, const bool lumaOnly = false);
void extendSingleBorderPel();
Rickard Sjöberg
committed
#if JVET_O0549_ENCODER_ONLY_FILTER
void extendBorderPel(unsigned marginX, unsigned marginY);
#endif

Karsten Suehring
committed
void extendBorderPel ( unsigned margin );
void removeHighFreq ( const UnitBuf<T>& other, const bool bClip, const ClpRngs& clpRngs
, const int8_t gbiWeight = g_GbiWeights[GBI_DEFAULT]

Karsten Suehring
committed
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
UnitBuf< T> subBuf (const UnitArea& subArea);
const UnitBuf<const T> subBuf (const UnitArea& subArea) const;
};
typedef UnitBuf< Pel> PelUnitBuf;
typedef UnitBuf<const Pel> CPelUnitBuf;
typedef UnitBuf< TCoeff> CoeffUnitBuf;
typedef UnitBuf<const TCoeff> CCoeffUnitBuf;
template<typename T>
void UnitBuf<T>::fill( const T &val )
{
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].fill( val );
}
}
template<typename T>
void UnitBuf<T>::copyFrom( const UnitBuf<const T> &other )
{
CHECK( chromaFormat != other.chromaFormat, "Incompatible formats" );
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].copyFrom( other.bufs[i] );
}
}
template<typename T>
void UnitBuf<T>::subtract( const UnitBuf<const T> &other )
{
CHECK( chromaFormat != other.chromaFormat, "Incompatible formats" );
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].subtract( other.bufs[i] );
}
}
template<typename T>
void UnitBuf<T>::copyClip(const UnitBuf<const T> &src, const ClpRngs& clpRngs)
{
CHECK( chromaFormat != src.chromaFormat, "Incompatible formats" );
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].copyClip( src.bufs[i], clpRngs.comp[i] );
}
}
template<typename T>
void UnitBuf<T>::reconstruct(const UnitBuf<const T> &pred, const UnitBuf<const T> &resi, const ClpRngs& clpRngs)
{
CHECK( chromaFormat != pred.chromaFormat, "Incompatible formats" );
CHECK( chromaFormat != resi.chromaFormat, "Incompatible formats" );
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].reconstruct( pred.bufs[i], resi.bufs[i], clpRngs.comp[i] );
}
}
template<typename T>
void UnitBuf<T>::addWeightedAvg(const UnitBuf<const T> &other1, const UnitBuf<const T> &other2, const ClpRngs& clpRngs, const uint8_t gbiIdx /* = GBI_DEFAULT */, const bool chromaOnly /* = false */, const bool lumaOnly /* = false */)
{
const size_t istart = chromaOnly ? 1 : 0;
const size_t iend = lumaOnly ? 1 : bufs.size();
CHECK(lumaOnly && chromaOnly, "should not happen");
for(size_t i = istart; i < iend; i++)
{
bufs[i].addWeightedAvg(other1.bufs[i], other2.bufs[i], clpRngs.comp[i], gbiIdx);
}
}

Karsten Suehring
committed
template<typename T>
void UnitBuf<T>::addAvg(const UnitBuf<const T> &other1, const UnitBuf<const T> &other2, const ClpRngs& clpRngs, const bool chromaOnly /* = false */, const bool lumaOnly /* = false */)
{
const size_t istart = chromaOnly ? 1 : 0;
const size_t iend = lumaOnly ? 1 : bufs.size();
CHECK( lumaOnly && chromaOnly, "should not happen" );
for( size_t i = istart; i < iend; i++)
{
bufs[i].addAvg( other1.bufs[i], other2.bufs[i], clpRngs.comp[i]);
}
}
template<typename T>
void UnitBuf<T>::extendSingleBorderPel()
{
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].extendSingleBorderPel();
}
}
Rickard Sjöberg
committed
#if JVET_O0549_ENCODER_ONLY_FILTER
template<typename T>
void UnitBuf<T>::extendBorderPel(unsigned marginX, unsigned marginY)
{
for (unsigned i = 0; i < bufs.size(); i++)
{
bufs[i].extendBorderPel(marginX >> getComponentScaleX(ComponentID(i), chromaFormat), marginY >> getComponentScaleY(ComponentID(i), chromaFormat));
}
}
#endif

Karsten Suehring
committed
template<typename T>
void UnitBuf<T>::extendBorderPel( unsigned margin )
{
for( unsigned i = 0; i < bufs.size(); i++ )
{
bufs[i].extendBorderPel( margin );
}
}
template<typename T>
void UnitBuf<T>::removeHighFreq( const UnitBuf<T>& other, const bool bClip, const ClpRngs& clpRngs

Karsten Suehring
committed
{
if(gbiWeight != g_GbiWeights[GBI_DEFAULT])

Karsten Suehring
committed
{
bufs[0].removeWeightHighFreq(other.bufs[0], bClip, clpRngs.comp[0], gbiWeight);
return;

Karsten Suehring
committed
}
bufs[0].removeHighFreq(other.bufs[0], bClip, clpRngs.comp[0]);

Karsten Suehring
committed
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
}
template<typename T>
UnitBuf<T> UnitBuf<T>::subBuf( const UnitArea& subArea )
{
UnitBuf<T> subBuf;
subBuf.chromaFormat = chromaFormat;
unsigned blockIdx = 0;
for( auto &subAreaBuf : bufs )
{
subBuf.bufs.push_back( subAreaBuf.subBuf( subArea.blocks[blockIdx].pos(), subArea.blocks[blockIdx].size() ) );
blockIdx++;
}
return subBuf;
}
template<typename T>
const UnitBuf<const T> UnitBuf<T>::subBuf( const UnitArea& subArea ) const
{
UnitBuf<const T> subBuf;
subBuf.chromaFormat = chromaFormat;
unsigned blockIdx = 0;
for( const auto &subAreaBuf : bufs )
{
subBuf.bufs.push_back( subAreaBuf.subBuf( subArea.blocks[blockIdx].pos(), subArea.blocks[blockIdx].size() ) );
blockIdx++;
}
return subBuf;
}
// ---------------------------------------------------------------------------
// PelStorage struct (PelUnitBuf which allocates its own memory)
// ---------------------------------------------------------------------------
struct UnitArea;
struct CompArea;
struct PelStorage : public PelUnitBuf
{
PelStorage();
~PelStorage();
void swap( PelStorage& other );
void createFromBuf( PelUnitBuf buf );
void create( const UnitArea &_unit );
void create( const ChromaFormat &_chromaFormat, const Area& _area, const unsigned _maxCUSize = 0, const unsigned _margin = 0, const unsigned _alignment = 0, const bool _scaleChromaMargin = true );
void destroy();
PelBuf getBuf( const CompArea &blk );
const CPelBuf getBuf( const CompArea &blk ) const;
PelBuf getBuf( const ComponentID CompID );
const CPelBuf getBuf( const ComponentID CompID ) const;
PelUnitBuf getBuf( const UnitArea &unit );
const CPelUnitBuf getBuf( const UnitArea &unit ) const;
Pel *getOrigin( const int id ) const { return m_origin[id]; }
private:
Pel *m_origin[MAX_NUM_COMPONENT];
};
struct CompStorage : public PelBuf
{
CompStorage () { m_memory = nullptr; }
~CompStorage() { if (valid()) delete [] m_memory; }
void create( const Size& size )
{
CHECK( m_memory, "Trying to re-create an already initialized buffer" );
m_memory = new Pel [ size.area() ];
*static_cast<PelBuf*>(this) = PelBuf( m_memory, size );
}
void destroy()
{
if (valid()) delete [] m_memory;
m_memory = nullptr;
}
bool valid() { return m_memory != nullptr; }
private:
Pel* m_memory;
};