-
Notifications
You must be signed in to change notification settings - Fork 2
/
refpic.cc
434 lines (338 loc) · 13.2 KB
/
refpic.cc
1
2
3
4
5
6
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
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
171
172
173
174
175
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
371
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
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
/*
* H.265 video codec.
* Copyright (c) 2013-2014 struktur AG, Dirk Farin <[email protected]>
*
* This file is part of libde265.
*
* libde265 is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3 of
* the License, or (at your option) any later version.
*
* libde265 is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with libde265. If not, see <http://www.gnu.org/licenses/>.
*/
#include "refpic.h"
#include "decctx.h"
#include "util.h"
#include <assert.h>
#include <stdlib.h>
#if defined(_MSC_VER) || defined(__MINGW32__)
# include <malloc.h>
#elif defined(HAVE_ALLOCA_H)
# include <alloca.h>
#endif
void ref_pic_set::reset()
{
NumNegativePics = 0;
NumPositivePics = 0;
NumDeltaPocs = 0;
NumPocTotalCurr_shortterm_only = 0;
for (int i=0;i<MAX_NUM_REF_PICS;i++) {
DeltaPocS0[i] = 0;
DeltaPocS1[i] = 0;
UsedByCurrPicS0[i] = 0;
UsedByCurrPicS1[i] = 0;
}
}
void ref_pic_set::compute_derived_values()
{
NumPocTotalCurr_shortterm_only = 0;
for (int i=0; i<NumNegativePics; i++)
if (UsedByCurrPicS0[i])
NumPocTotalCurr_shortterm_only++;
for (int i=0; i<NumPositivePics; i++)
if (UsedByCurrPicS1[i])
NumPocTotalCurr_shortterm_only++;
NumDeltaPocs = NumNegativePics + NumPositivePics;
/*
NOTE: this is done when reading the slice header.
The value numPocTotalCurr is then stored in the slice header.
for (int i = 0; i < num_long_term_sps + num_long_term_pics; i++ )
if( UsedByCurrPicLt[i] )
NumPocTotalCurr++
}
*/
}
/* A ref-pic-set is coded either coded
- as a list of the relative POC deltas themselves, or
- by shifting an existing ref-pic-set by some number of frames
When shifting an existing set, the frame 0 is also shifted as an additional reference frame.
When coding the ref-pic-sets in the SPS, predicition is always from the previous set.
In the slice header, the ref-pic-set can use any previous set as reference.
*/
bool read_short_term_ref_pic_set(error_queue* errqueue,
const seq_parameter_set* sps,
bitreader* br,
ref_pic_set* out_set, // where to store the read set
int idxRps, // index of the set to be read
const std::vector<ref_pic_set>& sets, // previously read sets
bool sliceRefPicSet) // is this in the slice header?
{
// --- is this set coded in prediction mode (not possible for the first set)
char inter_ref_pic_set_prediction_flag;
if (idxRps != 0) {
inter_ref_pic_set_prediction_flag = get_bits(br,1);
}
else {
inter_ref_pic_set_prediction_flag = 0;
}
if (inter_ref_pic_set_prediction_flag) {
int vlc;
/* Only for the last ref_pic_set (that's the one coded in the slice header),
we can specify relative to which reference set we code the set. */
int delta_idx;
if (sliceRefPicSet) { // idxRps == num_short_term_ref_pic_sets) {
delta_idx = vlc = get_uvlc(br);
if (delta_idx==UVLC_ERROR) {
return false;
}
if (delta_idx>=idxRps) {
return false;
}
delta_idx++;
} else {
delta_idx = 1;
}
int RIdx = idxRps - delta_idx; // this is our source set, which we will modify
assert(RIdx>=0);
int delta_rps_sign = get_bits(br,1);
int abs_delta_rps = vlc = get_uvlc(br);
if (vlc==UVLC_ERROR) { return false; }
abs_delta_rps++;
int DeltaRPS = (delta_rps_sign ? -abs_delta_rps : abs_delta_rps);
// bits are stored in this order:
// - all bits for negative Pocs (forward),
// - then all bits for positive Pocs (forward),
// - then bits for '0', shifting of the current picture
// in total, these are 'nDeltaPocsRIdx'+1 bits
logtrace(LogHeaders,"predicted from %d with delta %d\n",RIdx,DeltaRPS);
int nDeltaPocsRIdx= sets[RIdx].NumDeltaPocs; // size of source set
char *const used_by_curr_pic_flag = (char *)alloca((nDeltaPocsRIdx+1) * sizeof(char));
char *const use_delta_flag = (char *)alloca((nDeltaPocsRIdx+1) * sizeof(char));
for (int j=0;j<=nDeltaPocsRIdx;j++) {
used_by_curr_pic_flag[j] = get_bits(br,1);
if (used_by_curr_pic_flag[j]) {
use_delta_flag[j] = 1; // if this frame is used, we also have to apply the delta
} else {
use_delta_flag[j] = get_bits(br,1); // otherwise, it is only optionally included
}
}
logtrace(LogHeaders,"flags: ");
for (int j=0;j<=nDeltaPocsRIdx;j++) {
logtrace(LogHeaders,"%d ", use_delta_flag[j]);
}
logtrace(LogHeaders,"\n");
int nNegativeRIdx = sets[RIdx].NumNegativePics;
int nPositiveRIdx = sets[RIdx].NumPositivePics;
// --- update list 0 (negative Poc) ---
// Iterate through all Pocs in decreasing value order (positive reverse, 0, negative forward).
int i=0; // target index
// positive list
for (int j=nPositiveRIdx-1;j>=0;j--) {
assert(RIdx >= 0 && RIdx < sets.size());
assert(j>=0 && j < MAX_NUM_REF_PICS);
int dPoc = sets[RIdx].DeltaPocS1[j] + DeltaRPS; // new delta
if (dPoc<0 && use_delta_flag[nNegativeRIdx+j]) {
if (i>= MAX_NUM_REF_PICS) { return false; }
out_set->DeltaPocS0[i] = dPoc;
out_set->UsedByCurrPicS0[i] = used_by_curr_pic_flag[nNegativeRIdx+j];
i++;
}
}
// frame 0
if (DeltaRPS<0 && use_delta_flag[nDeltaPocsRIdx]) {
if (i>= MAX_NUM_REF_PICS) { return false; }
out_set->DeltaPocS0[i] = DeltaRPS;
out_set->UsedByCurrPicS0[i] = used_by_curr_pic_flag[nDeltaPocsRIdx];
i++;
}
// negative list
for (int j=0;j<nNegativeRIdx;j++) {
int dPoc = sets[RIdx].DeltaPocS0[j] + DeltaRPS;
if (dPoc<0 && use_delta_flag[j]) {
if (i>= MAX_NUM_REF_PICS) { return false; }
out_set->DeltaPocS0[i] = dPoc;
out_set->UsedByCurrPicS0[i] = used_by_curr_pic_flag[j];
i++;
}
}
out_set->NumNegativePics = i;
// --- update list 1 (positive Poc) ---
// Iterate through all Pocs in increasing value order (negative reverse, 0, positive forward)
i=0; // target index
// negative list
for (int j=nNegativeRIdx-1;j>=0;j--) {
int dPoc = sets[RIdx].DeltaPocS0[j] + DeltaRPS;
if (dPoc>0 && use_delta_flag[j]) {
if (i>= MAX_NUM_REF_PICS) { return false; }
out_set->DeltaPocS1[i] = dPoc;
out_set->UsedByCurrPicS1[i] = used_by_curr_pic_flag[j];
i++;
}
}
// frame 0
if (DeltaRPS>0 && use_delta_flag[nDeltaPocsRIdx]) {
if (i>= MAX_NUM_REF_PICS) { return false; }
out_set->DeltaPocS1[i] = DeltaRPS;
out_set->UsedByCurrPicS1[i] = used_by_curr_pic_flag[nDeltaPocsRIdx];
i++;
}
// positive list
for (int j=0;j<nPositiveRIdx;j++) {
int dPoc = sets[RIdx].DeltaPocS1[j] + DeltaRPS;
if (dPoc>0 && use_delta_flag[nNegativeRIdx+j]) {
if (i>= MAX_NUM_REF_PICS) { return false; }
out_set->DeltaPocS1[i] = dPoc;
out_set->UsedByCurrPicS1[i] = used_by_curr_pic_flag[nNegativeRIdx+j];
i++;
}
}
out_set->NumPositivePics = i;
} else {
// --- first, read the number of past and future frames in this set ---
int num_negative_pics = get_uvlc(br);
int num_positive_pics = get_uvlc(br);
if (num_negative_pics == UVLC_ERROR ||
num_positive_pics == UVLC_ERROR) {
// invalid num-ref-pics value
errqueue->add_warning(DE265_WARNING_MAX_NUM_REF_PICS_EXCEEDED, false);
return false;
}
// total number of reference pictures may not exceed buffer capacity
if (num_negative_pics + num_positive_pics >
sps->sps_max_dec_pic_buffering[ sps->sps_max_sub_layers-1 ]) {
out_set->NumNegativePics = 0;
out_set->NumPositivePics = 0;
out_set->NumDeltaPocs = 0;
out_set->NumPocTotalCurr_shortterm_only = 0;
errqueue->add_warning(DE265_WARNING_MAX_NUM_REF_PICS_EXCEEDED, false);
return false;
}
if (num_negative_pics > MAX_NUM_REF_PICS ||
num_positive_pics > MAX_NUM_REF_PICS) {
errqueue->add_warning(DE265_WARNING_MAX_NUM_REF_PICS_EXCEEDED, false);
return false;
}
out_set->NumNegativePics = num_negative_pics;
out_set->NumPositivePics = num_positive_pics;
// --- now, read the deltas between the reference frames to fill the lists ---
// past frames
int lastPocS=0;
for (int i=0;i<num_negative_pics;i++) {
int delta_poc_s0 = get_uvlc(br);
if (delta_poc_s0==UVLC_ERROR) { return false; }
delta_poc_s0++;
char used_by_curr_pic_s0_flag = get_bits(br,1);
out_set->DeltaPocS0[i] = lastPocS - delta_poc_s0;
out_set->UsedByCurrPicS0[i] = used_by_curr_pic_s0_flag;
lastPocS = out_set->DeltaPocS0[i];
}
// future frames
lastPocS=0;
for (int i=0;i<num_positive_pics;i++) {
int delta_poc_s1 = get_uvlc(br);
if (delta_poc_s1==UVLC_ERROR) { return false; }
delta_poc_s1++;
char used_by_curr_pic_s1_flag = get_bits(br,1);
out_set->DeltaPocS1[i] = lastPocS + delta_poc_s1;
out_set->UsedByCurrPicS1[i] = used_by_curr_pic_s1_flag;
lastPocS = out_set->DeltaPocS1[i];
}
}
out_set->compute_derived_values();
return true;
}
bool write_short_term_ref_pic_set_nopred(error_queue* errqueue,
const seq_parameter_set* sps,
CABAC_encoder& out,
const ref_pic_set* in_set, // which set to write
int idxRps, // index of the set to be written
const std::vector<ref_pic_set>& sets, // previously read sets
bool sliceRefPicSet) // is this in the slice header?
{
if (idxRps != 0) {
// inter_ref_pic_set_prediction_flag
out.write_bit(0);
}
// --- first, write the number of past and future frames in this set ---
out.write_uvlc(in_set->NumNegativePics);
out.write_uvlc(in_set->NumPositivePics);
// --- now, write the deltas between the reference frames to fill the lists ---
// past frames
int lastPocS=0;
for (int i=0;i<in_set->NumNegativePics;i++) {
int delta_poc_s0 = lastPocS - in_set->DeltaPocS0[i];
char used_by_curr_pic_s0_flag = in_set->UsedByCurrPicS0[i];
assert(delta_poc_s0 >= 1);
out.write_uvlc(delta_poc_s0-1);
out.write_bit(used_by_curr_pic_s0_flag);
lastPocS = in_set->DeltaPocS0[i];
}
// future frames
lastPocS=0;
for (int i=0;i<in_set->NumPositivePics;i++) {
int delta_poc_s1 = in_set->DeltaPocS1[i] - lastPocS;
char used_by_curr_pic_s1_flag = in_set->UsedByCurrPicS1[i];
assert(delta_poc_s1 >= 1);
out.write_uvlc(delta_poc_s1-1);
out.write_bit(used_by_curr_pic_s1_flag);
lastPocS = in_set->DeltaPocS1[i];
}
return true;
}
bool write_short_term_ref_pic_set(error_queue* errqueue,
const seq_parameter_set* sps,
CABAC_encoder& out,
const ref_pic_set* in_set, // which set to write
int idxRps, // index of the set to be read
const std::vector<ref_pic_set>& sets, // previously read sets
bool sliceRefPicSet) // is this in the slice header?
{
return write_short_term_ref_pic_set_nopred(errqueue, sps, out, in_set, idxRps, sets,
sliceRefPicSet);
}
void dump_short_term_ref_pic_set(const ref_pic_set* set, FILE* fh)
{
log2fh(fh,"NumDeltaPocs: %d [-:%d +:%d]\n", set->NumDeltaPocs,
set->NumNegativePics, set->NumPositivePics);
log2fh(fh,"DeltaPocS0:");
for (int i=0;i<set->NumNegativePics;i++) {
if (i) { log2fh(fh,","); }
log2fh(fh," %d/%d",set->DeltaPocS0[i],set->UsedByCurrPicS0[i]);
}
log2fh(fh,"\n");
log2fh(fh,"DeltaPocS1:");
for (int i=0;i<set->NumPositivePics;i++) {
if (i) { log2fh(fh,","); }
log2fh(fh," %d/%d",set->DeltaPocS1[i],set->UsedByCurrPicS1[i]);
}
log2fh(fh,"\n");
}
void dump_compact_short_term_ref_pic_set(const ref_pic_set* set, int range, FILE* fh)
{
char *const log = (char *)alloca((range+1+range+1) * sizeof(char));
log[2*range+1] = 0;
for (int i=0;i<2*range+1;i++) log[i]='.';
log[range]='|';
for (int i=set->NumNegativePics-1;i>=0;i--) {
int n = set->DeltaPocS0[i];
if (n>=-range) {
if (set->UsedByCurrPicS0[i]) log[n+range] = 'X';
else log[n+range] = 'o';
} else { log2fh(fh,"*%d%c ",n, set->UsedByCurrPicS0[i] ? 'X':'o'); }
}
for (int i=set->NumPositivePics-1;i>=0;i--) {
int n = set->DeltaPocS1[i];
if (n<=range) {
if (set->UsedByCurrPicS1[i]) log[n+range] = 'X';
else log[n+range] = 'o';
} else { log2fh(fh,"*%d%c ",n, set->UsedByCurrPicS1[i] ? 'X':'o'); }
}
log2fh(fh,"*%s\n",log);
}