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
|
/*
* Copyright © 2020, VideoLAN and dav1d authors
* Copyright © 2020, Two Orioles, LLC
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. 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.
*
* 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 OWNER 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.
*/
#include "config.h"
#include "vcs_version.h"
#include "cli_config.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "dav1d/dav1d.h"
#include "input/input.h"
#include "input/demuxer.h"
#include "dav1d_cli_parse.h"
#define NUM_RAND_SEEK 3
#define NUM_REL_SEEK 4
#define NUM_END_SEEK 2
const Demuxer annexb_demuxer = { .name = "" };
const Demuxer section5_demuxer = { .name = "" };
#ifdef _WIN32
#include <windows.h>
static unsigned get_seed(void) {
return GetTickCount();
}
#else
#ifdef __APPLE__
#include <mach/mach_time.h>
#else
#include <time.h>
#endif
static unsigned get_seed(void) {
#ifdef __APPLE__
return (unsigned) mach_absolute_time();
#elif defined(HAVE_CLOCK_GETTIME)
struct timespec ts;
clock_gettime(CLOCK_MONOTONIC, &ts);
return (unsigned) (1000000000ULL * ts.tv_sec + ts.tv_nsec);
#endif
}
#endif
static uint32_t xs_state[4];
static void xor128_srand(unsigned seed) {
xs_state[0] = seed;
xs_state[1] = ( seed & 0xffff0000) | (~seed & 0x0000ffff);
xs_state[2] = (~seed & 0xffff0000) | ( seed & 0x0000ffff);
xs_state[3] = ~seed;
}
// xor128 from Marsaglia, George (July 2003). "Xorshift RNGs".
// Journal of Statistical Software. 8 (14).
// doi:10.18637/jss.v008.i14.
static int xor128_rand(void) {
const uint32_t x = xs_state[0];
const uint32_t t = x ^ (x << 11);
xs_state[0] = xs_state[1];
xs_state[1] = xs_state[2];
xs_state[2] = xs_state[3];
uint32_t w = xs_state[3];
w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
xs_state[3] = w;
return w >> 1;
}
static inline int decode_frame(Dav1dPicture *const p,
Dav1dContext *const c, Dav1dData *const data)
{
int res;
memset(p, 0, sizeof(*p));
if ((res = dav1d_send_data(c, data)) < 0) {
if (res != DAV1D_ERR(EAGAIN)) {
fprintf(stderr, "Error decoding frame: %s\n",
strerror(DAV1D_ERR(res)));
return res;
}
}
if ((res = dav1d_get_picture(c, p)) < 0) {
if (res != DAV1D_ERR(EAGAIN)) {
fprintf(stderr, "Error decoding frame: %s\n",
strerror(DAV1D_ERR(res)));
return res;
}
} else dav1d_picture_unref(p);
return 0;
}
static int decode_rand(DemuxerContext *const in, Dav1dContext *const c,
Dav1dData *const data, const double fps)
{
int res = 0;
Dav1dPicture p;
const int num_frames = xor128_rand() % (int)(fps * 5);
for (int i = 0; i < num_frames; i++) {
if ((res = decode_frame(&p, c, data))) break;
if (input_read(in, data) || data->sz == 0) break;
}
return res;
}
static int decode_all(DemuxerContext *const in,
Dav1dContext *const c, Dav1dData *const data)
{
int res = 0;
Dav1dPicture p;
do { if ((res = decode_frame(&p, c, data))) break;
} while (!input_read(in, data) && data->sz > 0);
return res;
}
static int seek(DemuxerContext *const in, Dav1dContext *const c,
const uint64_t pts, Dav1dData *const data)
{
int res;
if ((res = input_seek(in, pts))) return res;
Dav1dSequenceHeader seq;
do { if ((res = input_read(in, data))) break;
} while (dav1d_parse_sequence_header(&seq, data->data, data->sz));
dav1d_flush(c);
return res;
}
int main(const int argc, char *const *const argv) {
const char *version = dav1d_version();
if (strcmp(version, DAV1D_VERSION)) {
fprintf(stderr, "Version mismatch (library: %s, executable: %s)\n",
version, DAV1D_VERSION);
return EXIT_FAILURE;
}
CLISettings cli_settings;
Dav1dSettings lib_settings;
DemuxerContext *in;
Dav1dContext *c;
Dav1dData data;
unsigned total, i_fps[2], i_timebase[2];
double timebase, spf, fps;
uint64_t pts;
xor128_srand(get_seed());
parse(argc, argv, &cli_settings, &lib_settings);
if (input_open(&in, "ivf", cli_settings.inputfile,
i_fps, &total, i_timebase) < 0 ||
!i_timebase[0] || !i_timebase[1] || !i_fps[0] || !i_fps[1])
{
return EXIT_SUCCESS;
}
if (dav1d_open(&c, &lib_settings))
return EXIT_FAILURE;
timebase = (double)i_timebase[1] / i_timebase[0];
spf = (double)i_fps[1] / i_fps[0];
fps = (double)i_fps[0] / i_fps[1];
if (fps < 1) goto end;
#define FRAME_OFFSET_TO_PTS(foff) \
(uint64_t)llround(((foff) * spf) * 1000000000.0)
#define TS_TO_PTS(ts) \
(uint64_t)llround(((ts) * timebase) * 1000000000.0)
// seek at random pts
for (int i = 0; i < NUM_RAND_SEEK; i++) {
pts = FRAME_OFFSET_TO_PTS(xor128_rand() % total);
if (seek(in, c, pts, &data)) continue;
if (decode_rand(in, c, &data, fps)) goto end;
}
pts = TS_TO_PTS(data.m.timestamp);
// seek left / right randomly with random intervals within 1s
for (int i = 0, tries = 0;
i - tries < NUM_REL_SEEK && tries < NUM_REL_SEEK / 2;
i++)
{
const int sign = xor128_rand() & 1 ? -1 : +1;
const float diff = (xor128_rand() % 100) / 100.f;
int64_t new_pts = pts + sign * FRAME_OFFSET_TO_PTS(diff * fps);
const int64_t new_ts = llround(new_pts / (timebase * 1000000000.0));
new_pts = TS_TO_PTS(new_ts);
if (new_pts < 0 || (uint64_t)new_pts >= FRAME_OFFSET_TO_PTS(total)) {
if (seek(in, c, FRAME_OFFSET_TO_PTS(total / 2), &data)) break;
pts = TS_TO_PTS(data.m.timestamp);
tries++;
continue;
}
if (seek(in, c, new_pts, &data))
if (seek(in, c, 0, &data)) goto end;
if (decode_rand(in, c, &data, fps)) goto end;
pts = TS_TO_PTS(data.m.timestamp);
}
unsigned shift = 0;
do {
shift += 5;
if (shift > total)
shift = total;
} while (seek(in, c, FRAME_OFFSET_TO_PTS(total - shift), &data));
// simulate seeking after the end of the file
for (int i = 0; i < NUM_END_SEEK; i++) {
if (seek(in, c, FRAME_OFFSET_TO_PTS(total - shift), &data)) goto end;
if (decode_all(in, c, &data)) goto end;
int num_flush = 1 + 64 + xor128_rand() % 64;
while (num_flush--) dav1d_flush(c);
}
end:
input_close(in);
dav1d_close(&c);
return EXIT_SUCCESS;
}
|
