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
|
/*
* Generic frame queue
* Copyright (c) 2016 Nicolas George
*
* This file is part of FFmpeg.
*
* FFmpeg 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 2.1 of the License, or (at your option) any later version.
*
* FFmpeg 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 FFmpeg; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "libavutil/avassert.h"
#include "framequeue.h"
static inline FFFrameBucket *bucket(FFFrameQueue *fq, size_t idx)
{
return &fq->queue[(fq->tail + idx) & (fq->allocated - 1)];
}
void ff_framequeue_global_init(FFFrameQueueGlobal *fqg)
{
}
static void check_consistency(FFFrameQueue *fq)
{
#if defined(ASSERT_LEVEL) && ASSERT_LEVEL >= 2
uint64_t nb_samples = 0;
size_t i;
av_assert0(fq->queued == fq->total_frames_head - fq->total_frames_tail);
for (i = 0; i < fq->queued; i++)
nb_samples += bucket(fq, i)->frame->nb_samples;
av_assert0(nb_samples == fq->total_samples_head - fq->total_samples_tail);
#endif
}
void ff_framequeue_init(FFFrameQueue *fq, FFFrameQueueGlobal *fqg)
{
fq->queue = &fq->first_bucket;
fq->allocated = 1;
}
void ff_framequeue_free(FFFrameQueue *fq)
{
while (fq->queued) {
AVFrame *frame = ff_framequeue_take(fq);
av_frame_free(&frame);
}
if (fq->queue != &fq->first_bucket)
av_freep(&fq->queue);
}
int ff_framequeue_add(FFFrameQueue *fq, AVFrame *frame)
{
FFFrameBucket *b;
check_consistency(fq);
if (fq->queued == fq->allocated) {
if (fq->allocated == 1) {
size_t na = 8;
FFFrameBucket *nq = av_realloc_array(NULL, na, sizeof(*nq));
if (!nq)
return AVERROR(ENOMEM);
nq[0] = fq->queue[0];
fq->queue = nq;
fq->allocated = na;
} else {
size_t na = fq->allocated << 1;
FFFrameBucket *nq = av_realloc_array(fq->queue, na, sizeof(*nq));
if (!nq)
return AVERROR(ENOMEM);
if (fq->tail + fq->queued > fq->allocated)
memmove(nq + fq->allocated, nq,
(fq->tail + fq->queued - fq->allocated) * sizeof(*nq));
fq->queue = nq;
fq->allocated = na;
}
}
b = bucket(fq, fq->queued);
b->frame = frame;
fq->queued++;
fq->total_frames_head++;
fq->total_samples_head += frame->nb_samples;
check_consistency(fq);
return 0;
}
AVFrame *ff_framequeue_take(FFFrameQueue *fq)
{
FFFrameBucket *b;
check_consistency(fq);
av_assert1(fq->queued);
b = bucket(fq, 0);
fq->queued--;
fq->tail++;
fq->tail &= fq->allocated - 1;
fq->total_frames_tail++;
fq->total_samples_tail += b->frame->nb_samples;
check_consistency(fq);
return b->frame;
}
AVFrame *ff_framequeue_peek(FFFrameQueue *fq, size_t idx)
{
FFFrameBucket *b;
check_consistency(fq);
av_assert1(idx < fq->queued);
b = bucket(fq, idx);
check_consistency(fq);
return b->frame;
}
|
