Line | Branch | Exec | Source |
---|---|---|---|
1 | /* | ||
2 | * Copyright (c) Stefano Sabatini 2010 | ||
3 | * | ||
4 | * This file is part of FFmpeg. | ||
5 | * | ||
6 | * FFmpeg is free software; you can redistribute it and/or | ||
7 | * modify it under the terms of the GNU Lesser General Public | ||
8 | * License as published by the Free Software Foundation; either | ||
9 | * version 2.1 of the License, or (at your option) any later version. | ||
10 | * | ||
11 | * FFmpeg is distributed in the hope that it will be useful, | ||
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
14 | * Lesser General Public License for more details. | ||
15 | * | ||
16 | * You should have received a copy of the GNU Lesser General Public | ||
17 | * License along with FFmpeg; if not, write to the Free Software | ||
18 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
19 | */ | ||
20 | |||
21 | /** | ||
22 | * @file | ||
23 | * life video source, based on John Conways' Life Game | ||
24 | */ | ||
25 | |||
26 | /* #define DEBUG */ | ||
27 | |||
28 | #include "libavutil/file.h" | ||
29 | #include "libavutil/internal.h" | ||
30 | #include "libavutil/intreadwrite.h" | ||
31 | #include "libavutil/lfg.h" | ||
32 | #include "libavutil/mem.h" | ||
33 | #include "libavutil/opt.h" | ||
34 | #include "libavutil/random_seed.h" | ||
35 | #include "libavutil/avstring.h" | ||
36 | #include "avfilter.h" | ||
37 | #include "filters.h" | ||
38 | #include "formats.h" | ||
39 | #include "video.h" | ||
40 | |||
41 | typedef struct LifeContext { | ||
42 | const AVClass *class; | ||
43 | int w, h; | ||
44 | char *filename; | ||
45 | char *rule_str; | ||
46 | uint8_t *file_buf; | ||
47 | size_t file_bufsize; | ||
48 | |||
49 | /** | ||
50 | * The two grid state buffers. | ||
51 | * | ||
52 | * A 0xFF (ALIVE_CELL) value means the cell is alive (or new born), while | ||
53 | * the decreasing values from 0xFE to 0 means the cell is dead; the range | ||
54 | * of values is used for the slow death effect, or mold (0xFE means dead, | ||
55 | * 0xFD means very dead, 0xFC means very very dead... and 0x00 means | ||
56 | * definitely dead/mold). | ||
57 | */ | ||
58 | uint8_t *buf[2]; | ||
59 | |||
60 | uint8_t buf_idx; | ||
61 | uint16_t stay_rule; ///< encode the behavior for filled cells | ||
62 | uint16_t born_rule; ///< encode the behavior for empty cells | ||
63 | uint64_t pts; | ||
64 | AVRational frame_rate; | ||
65 | double random_fill_ratio; | ||
66 | int64_t random_seed; | ||
67 | int stitch; | ||
68 | int mold; | ||
69 | uint8_t life_color[4]; | ||
70 | uint8_t death_color[4]; | ||
71 | uint8_t mold_color[4]; | ||
72 | AVLFG lfg; | ||
73 | void (*draw)(AVFilterContext*, AVFrame*); | ||
74 | } LifeContext; | ||
75 | |||
76 | #define ALIVE_CELL 0xFF | ||
77 | #define OFFSET(x) offsetof(LifeContext, x) | ||
78 | #define FLAGS AV_OPT_FLAG_VIDEO_PARAM|AV_OPT_FLAG_FILTERING_PARAM | ||
79 | |||
80 | static const AVOption life_options[] = { | ||
81 | { "filename", "set source file", OFFSET(filename), AV_OPT_TYPE_STRING, {.str = NULL}, 0, 0, FLAGS }, | ||
82 | { "f", "set source file", OFFSET(filename), AV_OPT_TYPE_STRING, {.str = NULL}, 0, 0, FLAGS }, | ||
83 | { "size", "set video size", OFFSET(w), AV_OPT_TYPE_IMAGE_SIZE, {.str = NULL}, 0, 0, FLAGS }, | ||
84 | { "s", "set video size", OFFSET(w), AV_OPT_TYPE_IMAGE_SIZE, {.str = NULL}, 0, 0, FLAGS }, | ||
85 | { "rate", "set video rate", OFFSET(frame_rate), AV_OPT_TYPE_VIDEO_RATE, {.str = "25"}, 0, INT_MAX, FLAGS }, | ||
86 | { "r", "set video rate", OFFSET(frame_rate), AV_OPT_TYPE_VIDEO_RATE, {.str = "25"}, 0, INT_MAX, FLAGS }, | ||
87 | { "rule", "set rule", OFFSET(rule_str), AV_OPT_TYPE_STRING, {.str = "B3/S23"}, 0, 0, FLAGS }, | ||
88 | { "random_fill_ratio", "set fill ratio for filling initial grid randomly", OFFSET(random_fill_ratio), AV_OPT_TYPE_DOUBLE, {.dbl=1/M_PHI}, 0, 1, FLAGS }, | ||
89 | { "ratio", "set fill ratio for filling initial grid randomly", OFFSET(random_fill_ratio), AV_OPT_TYPE_DOUBLE, {.dbl=1/M_PHI}, 0, 1, FLAGS }, | ||
90 | { "random_seed", "set the seed for filling the initial grid randomly", OFFSET(random_seed), AV_OPT_TYPE_INT64, {.i64=-1}, -1, UINT32_MAX, FLAGS }, | ||
91 | { "seed", "set the seed for filling the initial grid randomly", OFFSET(random_seed), AV_OPT_TYPE_INT64, {.i64=-1}, -1, UINT32_MAX, FLAGS }, | ||
92 | { "stitch", "stitch boundaries", OFFSET(stitch), AV_OPT_TYPE_BOOL, {.i64=1}, 0, 1, FLAGS }, | ||
93 | { "mold", "set mold speed for dead cells", OFFSET(mold), AV_OPT_TYPE_INT, {.i64=0}, 0, 0xFF, FLAGS }, | ||
94 | { "life_color", "set life color", OFFSET( life_color), AV_OPT_TYPE_COLOR, {.str="white"}, 0, 0, FLAGS }, | ||
95 | { "death_color", "set death color", OFFSET(death_color), AV_OPT_TYPE_COLOR, {.str="black"}, 0, 0, FLAGS }, | ||
96 | { "mold_color", "set mold color", OFFSET( mold_color), AV_OPT_TYPE_COLOR, {.str="black"}, 0, 0, FLAGS }, | ||
97 | { NULL } | ||
98 | }; | ||
99 | |||
100 | AVFILTER_DEFINE_CLASS(life); | ||
101 | |||
102 | 1 | static int parse_rule(uint16_t *born_rule, uint16_t *stay_rule, | |
103 | const char *rule_str, void *log_ctx) | ||
104 | { | ||
105 | char *tail; | ||
106 | 1 | const char *p = rule_str; | |
107 | 1 | *born_rule = 0; | |
108 | 1 | *stay_rule = 0; | |
109 | |||
110 |
1/2✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
|
1 | if (strchr("bBsS", *p)) { |
111 | /* parse rule as a Born / Stay Alive code, see | ||
112 | * http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life */ | ||
113 | do { | ||
114 |
3/4✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 1 times.
|
2 | uint16_t *rule = (*p == 'b' || *p == 'B') ? born_rule : stay_rule; |
115 | 2 | p++; | |
116 |
3/4✓ Branch 0 taken 3 times.
✓ Branch 1 taken 2 times.
✓ Branch 2 taken 3 times.
✗ Branch 3 not taken.
|
5 | while (*p >= '0' && *p <= '8') { |
117 | 3 | *rule += 1<<(*p - '0'); | |
118 | 3 | p++; | |
119 | } | ||
120 |
2/2✓ Branch 0 taken 1 times.
✓ Branch 1 taken 1 times.
|
2 | if (*p != '/') |
121 | 1 | break; | |
122 | 1 | p++; | |
123 |
1/2✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
|
1 | } while (strchr("bBsS", *p)); |
124 | |||
125 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
|
1 | if (*p) |
126 | ✗ | goto error; | |
127 | } else { | ||
128 | /* parse rule as a number, expressed in the form STAY|(BORN<<9), | ||
129 | * where STAY and BORN encode the corresponding 9-bits rule */ | ||
130 | ✗ | long int rule = strtol(rule_str, &tail, 10); | |
131 | ✗ | if (*tail) | |
132 | ✗ | goto error; | |
133 | ✗ | *born_rule = ((1<<9)-1) & rule; | |
134 | ✗ | *stay_rule = rule >> 9; | |
135 | } | ||
136 | |||
137 | 1 | return 0; | |
138 | |||
139 | ✗ | error: | |
140 | ✗ | av_log(log_ctx, AV_LOG_ERROR, "Invalid rule code '%s' provided\n", rule_str); | |
141 | ✗ | return AVERROR(EINVAL); | |
142 | } | ||
143 | |||
144 | #ifdef DEBUG | ||
145 | static void show_life_grid(AVFilterContext *ctx) | ||
146 | { | ||
147 | LifeContext *life = ctx->priv; | ||
148 | int i, j; | ||
149 | |||
150 | char *line = av_malloc(life->w + 1); | ||
151 | if (!line) | ||
152 | return; | ||
153 | for (i = 0; i < life->h; i++) { | ||
154 | for (j = 0; j < life->w; j++) | ||
155 | line[j] = life->buf[life->buf_idx][i*life->w + j] == ALIVE_CELL ? '@' : ' '; | ||
156 | line[j] = 0; | ||
157 | av_log(ctx, AV_LOG_DEBUG, "%3d: %s\n", i, line); | ||
158 | } | ||
159 | av_free(line); | ||
160 | } | ||
161 | #endif | ||
162 | |||
163 | ✗ | static void fill_picture_monoblack(AVFilterContext *ctx, AVFrame *picref) | |
164 | { | ||
165 | ✗ | LifeContext *life = ctx->priv; | |
166 | ✗ | uint8_t *buf = life->buf[life->buf_idx]; | |
167 | int i, j, k; | ||
168 | |||
169 | /* fill the output picture with the old grid buffer */ | ||
170 | ✗ | for (i = 0; i < life->h; i++) { | |
171 | ✗ | uint8_t byte = 0; | |
172 | ✗ | uint8_t *p = picref->data[0] + i * picref->linesize[0]; | |
173 | ✗ | for (k = 0, j = 0; j < life->w; j++) { | |
174 | ✗ | byte |= (buf[i*life->w+j] == ALIVE_CELL)<<(7-k++); | |
175 | ✗ | if (k==8 || j == life->w-1) { | |
176 | ✗ | k = 0; | |
177 | ✗ | *p++ = byte; | |
178 | ✗ | byte = 0; | |
179 | } | ||
180 | } | ||
181 | } | ||
182 | ✗ | } | |
183 | |||
184 | // divide by 255 and round to nearest | ||
185 | // apply a fast variant: (X+127)/255 = ((X+127)*257+257)>>16 = ((X+128)*257)>>16 | ||
186 | #define FAST_DIV255(x) ((((x) + 128) * 257) >> 16) | ||
187 | |||
188 | 20 | static void fill_picture_rgb(AVFilterContext *ctx, AVFrame *picref) | |
189 | { | ||
190 | 20 | LifeContext *life = ctx->priv; | |
191 | 20 | uint8_t *buf = life->buf[life->buf_idx]; | |
192 | int i, j; | ||
193 | |||
194 | /* fill the output picture with the old grid buffer */ | ||
195 |
2/2✓ Branch 0 taken 800 times.
✓ Branch 1 taken 20 times.
|
820 | for (i = 0; i < life->h; i++) { |
196 | 800 | uint8_t *p = picref->data[0] + i * picref->linesize[0]; | |
197 |
2/2✓ Branch 0 taken 32000 times.
✓ Branch 1 taken 800 times.
|
32800 | for (j = 0; j < life->w; j++) { |
198 | 32000 | uint8_t v = buf[i*life->w + j]; | |
199 |
3/4✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 29682 times.
✓ Branch 3 taken 2318 times.
|
32000 | if (life->mold && v != ALIVE_CELL) { |
200 | 29682 | const uint8_t *c1 = life-> mold_color; | |
201 | 29682 | const uint8_t *c2 = life->death_color; | |
202 | 29682 | int death_age = FFMIN((0xff - v) * life->mold, 0xff); | |
203 | 29682 | *p++ = FAST_DIV255((c2[0] << 8) + ((int)c1[0] - (int)c2[0]) * death_age); | |
204 | 29682 | *p++ = FAST_DIV255((c2[1] << 8) + ((int)c1[1] - (int)c2[1]) * death_age); | |
205 | 29682 | *p++ = FAST_DIV255((c2[2] << 8) + ((int)c1[2] - (int)c2[2]) * death_age); | |
206 | } else { | ||
207 |
1/2✓ Branch 0 taken 2318 times.
✗ Branch 1 not taken.
|
2318 | const uint8_t *c = v == ALIVE_CELL ? life->life_color : life->death_color; |
208 | 2318 | AV_WB24(p, c[0]<<16 | c[1]<<8 | c[2]); | |
209 | 2318 | p += 3; | |
210 | } | ||
211 | } | ||
212 | } | ||
213 | 20 | } | |
214 | |||
215 | ✗ | static int init_pattern_from_file(AVFilterContext *ctx) | |
216 | { | ||
217 | ✗ | LifeContext *life = ctx->priv; | |
218 | char *p; | ||
219 | ✗ | int ret, i, i0, j, h = 0, w, max_w = 0; | |
220 | |||
221 | ✗ | if ((ret = av_file_map(life->filename, &life->file_buf, &life->file_bufsize, | |
222 | 0, ctx)) < 0) | ||
223 | ✗ | return ret; | |
224 | ✗ | av_freep(&life->filename); | |
225 | |||
226 | /* prescan file to get the number of lines and the maximum width */ | ||
227 | ✗ | w = 0; | |
228 | ✗ | for (i = 0; i < life->file_bufsize; i++) { | |
229 | ✗ | if (life->file_buf[i] == '\n') { | |
230 | ✗ | h++; max_w = FFMAX(w, max_w); w = 0; | |
231 | } else { | ||
232 | ✗ | w++; | |
233 | } | ||
234 | } | ||
235 | ✗ | av_log(ctx, AV_LOG_DEBUG, "h:%d max_w:%d\n", h, max_w); | |
236 | |||
237 | ✗ | if (life->w) { | |
238 | ✗ | if (max_w > life->w || h > life->h) { | |
239 | ✗ | av_log(ctx, AV_LOG_ERROR, | |
240 | "The specified size is %dx%d which cannot contain the provided file size of %dx%d\n", | ||
241 | life->w, life->h, max_w, h); | ||
242 | ✗ | return AVERROR(EINVAL); | |
243 | } | ||
244 | } else { | ||
245 | /* size was not specified, set it to size of the grid */ | ||
246 | ✗ | life->w = max_w; | |
247 | ✗ | life->h = h; | |
248 | } | ||
249 | |||
250 | ✗ | if (!(life->buf[0] = av_calloc(life->h * life->w, sizeof(*life->buf[0]))) || | |
251 | ✗ | !(life->buf[1] = av_calloc(life->h * life->w, sizeof(*life->buf[1])))) { | |
252 | ✗ | av_freep(&life->buf[0]); | |
253 | ✗ | av_freep(&life->buf[1]); | |
254 | ✗ | return AVERROR(ENOMEM); | |
255 | } | ||
256 | |||
257 | /* fill buf[0] */ | ||
258 | ✗ | p = life->file_buf; | |
259 | ✗ | for (i0 = 0, i = (life->h - h)/2; i0 < h; i0++, i++) { | |
260 | ✗ | for (j = (life->w - max_w)/2;; j++) { | |
261 | ✗ | av_log(ctx, AV_LOG_DEBUG, "%d:%d %c\n", i, j, *p == '\n' ? 'N' : *p); | |
262 | ✗ | if (*p == '\n') { | |
263 | ✗ | p++; break; | |
264 | } else | ||
265 | ✗ | life->buf[0][i*life->w + j] = av_isgraph(*(p++)) ? ALIVE_CELL : 0; | |
266 | } | ||
267 | } | ||
268 | ✗ | life->buf_idx = 0; | |
269 | |||
270 | ✗ | return 0; | |
271 | } | ||
272 | |||
273 | 1 | static av_cold int init(AVFilterContext *ctx) | |
274 | { | ||
275 | 1 | LifeContext *life = ctx->priv; | |
276 | int ret; | ||
277 | |||
278 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
1 | if (!life->w && !life->filename) |
279 | ✗ | av_opt_set(life, "size", "320x240", 0); | |
280 | |||
281 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 1 times.
|
1 | if ((ret = parse_rule(&life->born_rule, &life->stay_rule, life->rule_str, ctx)) < 0) |
282 | ✗ | return ret; | |
283 | |||
284 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
1 | if (!life->mold && memcmp(life->mold_color, "\x00\x00\x00", 3)) |
285 | ✗ | av_log(ctx, AV_LOG_WARNING, | |
286 | "Mold color is set while mold isn't, ignoring the color.\n"); | ||
287 | |||
288 |
1/2✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
|
1 | if (!life->filename) { |
289 | /* fill the grid randomly */ | ||
290 | int i; | ||
291 | |||
292 |
1/2✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
|
1 | if (!(life->buf[0] = av_calloc(life->h * life->w, sizeof(*life->buf[0]))) || |
293 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 1 times.
|
1 | !(life->buf[1] = av_calloc(life->h * life->w, sizeof(*life->buf[1])))) { |
294 | ✗ | av_freep(&life->buf[0]); | |
295 | ✗ | av_freep(&life->buf[1]); | |
296 | ✗ | return AVERROR(ENOMEM); | |
297 | } | ||
298 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
|
1 | if (life->random_seed == -1) |
299 | ✗ | life->random_seed = av_get_random_seed(); | |
300 | |||
301 | 1 | av_lfg_init(&life->lfg, life->random_seed); | |
302 | |||
303 |
2/2✓ Branch 0 taken 1600 times.
✓ Branch 1 taken 1 times.
|
1601 | for (i = 0; i < life->w * life->h; i++) { |
304 | 1600 | double r = (double)av_lfg_get(&life->lfg) / UINT32_MAX; | |
305 |
2/2✓ Branch 0 taken 171 times.
✓ Branch 1 taken 1429 times.
|
1600 | if (r <= life->random_fill_ratio) |
306 | 171 | life->buf[0][i] = ALIVE_CELL; | |
307 | } | ||
308 | 1 | life->buf_idx = 0; | |
309 | } else { | ||
310 | ✗ | if ((ret = init_pattern_from_file(ctx)) < 0) | |
311 | ✗ | return ret; | |
312 | } | ||
313 | |||
314 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
1 | if (life->mold || memcmp(life-> life_color, "\xff\xff\xff", 3) |
315 | ✗ | || memcmp(life->death_color, "\x00\x00\x00", 3)) { | |
316 | 1 | life->draw = fill_picture_rgb; | |
317 | } else { | ||
318 | ✗ | life->draw = fill_picture_monoblack; | |
319 | } | ||
320 | |||
321 | 1 | av_log(ctx, AV_LOG_VERBOSE, | |
322 | "s:%dx%d r:%d/%d rule:%s stay_rule:%d born_rule:%d stitch:%d seed:%"PRId64"\n", | ||
323 | life->w, life->h, life->frame_rate.num, life->frame_rate.den, | ||
324 | 1 | life->rule_str, life->stay_rule, life->born_rule, life->stitch, | |
325 | life->random_seed); | ||
326 | 1 | return 0; | |
327 | } | ||
328 | |||
329 | 1 | static av_cold void uninit(AVFilterContext *ctx) | |
330 | { | ||
331 | 1 | LifeContext *life = ctx->priv; | |
332 | |||
333 | 1 | av_file_unmap(life->file_buf, life->file_bufsize); | |
334 | 1 | av_freep(&life->rule_str); | |
335 | 1 | av_freep(&life->buf[0]); | |
336 | 1 | av_freep(&life->buf[1]); | |
337 | 1 | } | |
338 | |||
339 | 1 | static int config_props(AVFilterLink *outlink) | |
340 | { | ||
341 | 1 | LifeContext *life = outlink->src->priv; | |
342 | 1 | FilterLink *l = ff_filter_link(outlink); | |
343 | |||
344 | 1 | outlink->w = life->w; | |
345 | 1 | outlink->h = life->h; | |
346 | 1 | outlink->time_base = av_inv_q(life->frame_rate); | |
347 | 1 | l->frame_rate = life->frame_rate; | |
348 | |||
349 | 1 | return 0; | |
350 | } | ||
351 | |||
352 | 20 | static void evolve(AVFilterContext *ctx) | |
353 | { | ||
354 | 20 | LifeContext *life = ctx->priv; | |
355 | int i, j; | ||
356 | 20 | uint8_t *oldbuf = life->buf[ life->buf_idx]; | |
357 | 20 | uint8_t *newbuf = life->buf[!life->buf_idx]; | |
358 | |||
359 | enum { NW, N, NE, W, E, SW, S, SE }; | ||
360 | |||
361 | /* evolve the grid */ | ||
362 |
2/2✓ Branch 0 taken 800 times.
✓ Branch 1 taken 20 times.
|
820 | for (i = 0; i < life->h; i++) { |
363 |
2/2✓ Branch 0 taken 32000 times.
✓ Branch 1 taken 800 times.
|
32800 | for (j = 0; j < life->w; j++) { |
364 | int pos[8][2], n, alive, cell; | ||
365 |
1/2✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
|
32000 | if (life->stitch) { |
366 |
4/4✓ Branch 0 taken 800 times.
✓ Branch 1 taken 31200 times.
✓ Branch 2 taken 800 times.
✓ Branch 3 taken 31200 times.
|
32000 | pos[NW][0] = (i-1) < 0 ? life->h-1 : i-1; pos[NW][1] = (j-1) < 0 ? life->w-1 : j-1; |
367 |
2/2✓ Branch 0 taken 800 times.
✓ Branch 1 taken 31200 times.
|
32000 | pos[N ][0] = (i-1) < 0 ? life->h-1 : i-1; pos[N ][1] = j ; |
368 |
4/4✓ Branch 0 taken 800 times.
✓ Branch 1 taken 31200 times.
✓ Branch 2 taken 31200 times.
✓ Branch 3 taken 800 times.
|
32000 | pos[NE][0] = (i-1) < 0 ? life->h-1 : i-1; pos[NE][1] = (j+1) == life->w ? 0 : j+1; |
369 |
2/2✓ Branch 0 taken 800 times.
✓ Branch 1 taken 31200 times.
|
32000 | pos[W ][0] = i ; pos[W ][1] = (j-1) < 0 ? life->w-1 : j-1; |
370 |
2/2✓ Branch 0 taken 31200 times.
✓ Branch 1 taken 800 times.
|
32000 | pos[E ][0] = i ; pos[E ][1] = (j+1) == life->w ? 0 : j+1; |
371 |
4/4✓ Branch 0 taken 31200 times.
✓ Branch 1 taken 800 times.
✓ Branch 2 taken 800 times.
✓ Branch 3 taken 31200 times.
|
32000 | pos[SW][0] = (i+1) == life->h ? 0 : i+1; pos[SW][1] = (j-1) < 0 ? life->w-1 : j-1; |
372 |
2/2✓ Branch 0 taken 31200 times.
✓ Branch 1 taken 800 times.
|
32000 | pos[S ][0] = (i+1) == life->h ? 0 : i+1; pos[S ][1] = j ; |
373 |
4/4✓ Branch 0 taken 31200 times.
✓ Branch 1 taken 800 times.
✓ Branch 2 taken 31200 times.
✓ Branch 3 taken 800 times.
|
32000 | pos[SE][0] = (i+1) == life->h ? 0 : i+1; pos[SE][1] = (j+1) == life->w ? 0 : j+1; |
374 | } else { | ||
375 | ✗ | pos[NW][0] = (i-1) < 0 ? -1 : i-1; pos[NW][1] = (j-1) < 0 ? -1 : j-1; | |
376 | ✗ | pos[N ][0] = (i-1) < 0 ? -1 : i-1; pos[N ][1] = j ; | |
377 | ✗ | pos[NE][0] = (i-1) < 0 ? -1 : i-1; pos[NE][1] = (j+1) == life->w ? -1 : j+1; | |
378 | ✗ | pos[W ][0] = i ; pos[W ][1] = (j-1) < 0 ? -1 : j-1; | |
379 | ✗ | pos[E ][0] = i ; pos[E ][1] = (j+1) == life->w ? -1 : j+1; | |
380 | ✗ | pos[SW][0] = (i+1) == life->h ? -1 : i+1; pos[SW][1] = (j-1) < 0 ? -1 : j-1; | |
381 | ✗ | pos[S ][0] = (i+1) == life->h ? -1 : i+1; pos[S ][1] = j ; | |
382 | ✗ | pos[SE][0] = (i+1) == life->h ? -1 : i+1; pos[SE][1] = (j+1) == life->w ? -1 : j+1; | |
383 | } | ||
384 | |||
385 | /* compute the number of live neighbor cells */ | ||
386 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | n = (pos[NW][0] == -1 || pos[NW][1] == -1 ? 0 : oldbuf[pos[NW][0]*life->w + pos[NW][1]] == ALIVE_CELL) + |
387 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[N ][0] == -1 || pos[N ][1] == -1 ? 0 : oldbuf[pos[N ][0]*life->w + pos[N ][1]] == ALIVE_CELL) + |
388 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[NE][0] == -1 || pos[NE][1] == -1 ? 0 : oldbuf[pos[NE][0]*life->w + pos[NE][1]] == ALIVE_CELL) + |
389 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[W ][0] == -1 || pos[W ][1] == -1 ? 0 : oldbuf[pos[W ][0]*life->w + pos[W ][1]] == ALIVE_CELL) + |
390 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[E ][0] == -1 || pos[E ][1] == -1 ? 0 : oldbuf[pos[E ][0]*life->w + pos[E ][1]] == ALIVE_CELL) + |
391 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[SW][0] == -1 || pos[SW][1] == -1 ? 0 : oldbuf[pos[SW][0]*life->w + pos[SW][1]] == ALIVE_CELL) + |
392 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[S ][0] == -1 || pos[S ][1] == -1 ? 0 : oldbuf[pos[S ][0]*life->w + pos[S ][1]] == ALIVE_CELL) + |
393 |
4/6✓ Branch 0 taken 32000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32000 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2318 times.
✓ Branch 5 taken 29682 times.
|
32000 | (pos[SE][0] == -1 || pos[SE][1] == -1 ? 0 : oldbuf[pos[SE][0]*life->w + pos[SE][1]] == ALIVE_CELL); |
394 | 32000 | cell = oldbuf[i*life->w + j]; | |
395 |
2/2✓ Branch 0 taken 2318 times.
✓ Branch 1 taken 29682 times.
|
32000 | alive = 1<<n & (cell == ALIVE_CELL ? life->stay_rule : life->born_rule); |
396 |
2/2✓ Branch 0 taken 2269 times.
✓ Branch 1 taken 29731 times.
|
32000 | if (alive) *newbuf = ALIVE_CELL; // new cell is alive |
397 |
2/2✓ Branch 0 taken 5262 times.
✓ Branch 1 taken 24469 times.
|
29731 | else if (cell) *newbuf = cell - 1; // new cell is dead and in the process of mold |
398 | 24469 | else *newbuf = 0; // new cell is definitely dead | |
399 | ff_dlog(ctx, "i:%d j:%d live_neighbors:%d cell:%d -> cell:%d\n", i, j, n, cell, *newbuf); | ||
400 | 32000 | newbuf++; | |
401 | } | ||
402 | } | ||
403 | |||
404 | 20 | life->buf_idx = !life->buf_idx; | |
405 | 20 | } | |
406 | |||
407 | 20 | static int request_frame(AVFilterLink *outlink) | |
408 | { | ||
409 | 20 | LifeContext *life = outlink->src->priv; | |
410 | 20 | AVFrame *picref = ff_get_video_buffer(outlink, life->w, life->h); | |
411 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 20 times.
|
20 | if (!picref) |
412 | ✗ | return AVERROR(ENOMEM); | |
413 | 20 | picref->sample_aspect_ratio = (AVRational) {1, 1}; | |
414 | 20 | picref->pts = life->pts++; | |
415 | 20 | picref->duration = 1; | |
416 | |||
417 | 20 | life->draw(outlink->src, picref); | |
418 | 20 | evolve(outlink->src); | |
419 | #ifdef DEBUG | ||
420 | show_life_grid(outlink->src); | ||
421 | #endif | ||
422 | 20 | return ff_filter_frame(outlink, picref); | |
423 | } | ||
424 | |||
425 | 1 | static int query_formats(const AVFilterContext *ctx, | |
426 | AVFilterFormatsConfig **cfg_in, | ||
427 | AVFilterFormatsConfig **cfg_out) | ||
428 | { | ||
429 | 1 | const LifeContext *life = ctx->priv; | |
430 | 1 | const enum AVPixelFormat pix_fmts[] = { | |
431 |
1/2✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
|
1 | life->draw == fill_picture_rgb ? AV_PIX_FMT_RGB24 : AV_PIX_FMT_MONOBLACK, |
432 | AV_PIX_FMT_NONE | ||
433 | }; | ||
434 | |||
435 | 1 | return ff_set_common_formats_from_list2(ctx, cfg_in, cfg_out, pix_fmts); | |
436 | } | ||
437 | |||
438 | static const AVFilterPad life_outputs[] = { | ||
439 | { | ||
440 | .name = "default", | ||
441 | .type = AVMEDIA_TYPE_VIDEO, | ||
442 | .request_frame = request_frame, | ||
443 | .config_props = config_props, | ||
444 | }, | ||
445 | }; | ||
446 | |||
447 | const AVFilter ff_vsrc_life = { | ||
448 | .name = "life", | ||
449 | .description = NULL_IF_CONFIG_SMALL("Create life."), | ||
450 | .priv_size = sizeof(LifeContext), | ||
451 | .priv_class = &life_class, | ||
452 | .init = init, | ||
453 | .uninit = uninit, | ||
454 | .inputs = NULL, | ||
455 | FILTER_OUTPUTS(life_outputs), | ||
456 | FILTER_QUERY_FUNC2(query_formats), | ||
457 | }; | ||
458 |