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
39
47
48 /**
49 * The two grid state buffers.
50 *
51 * A 0xFF (ALIVE_CELL) value means the cell is alive (or new born), while
52 * the decreasing values from 0xFE to 0 means the cell is dead; the range
53 * of values is used for the slow death effect, or mold (0xFE means dead,
54 * 0xFD means very dead, 0xFC means very very dead... and 0x00 means
55 * definitely dead/mold).
56 */
58
60 uint16_t
stay_rule;
///< encode the behavior for filled cells
61 uint16_t
born_rule;
///< encode the behavior for empty cells
74
75 #define ALIVE_CELL 0xFF
76 #define OFFSET(x) offsetof(LifeContext, x)
77 #define FLAGS AV_OPT_FLAG_VIDEO_PARAM|AV_OPT_FLAG_FILTERING_PARAM
78
89 {
"random_seed",
"set the seed for filling the initial grid randomly",
OFFSET(random_seed),
AV_OPT_TYPE_INT, {.i64=-1}, -1, UINT32_MAX,
FLAGS },
90 {
"seed",
"set the seed for filling the initial grid randomly",
OFFSET(random_seed),
AV_OPT_TYPE_INT, {.i64=-1}, -1, UINT32_MAX,
FLAGS },
97 };
98
100
101 static int parse_rule(uint16_t *born_rule, uint16_t *stay_rule,
102 const char *rule_str, void *log_ctx)
103 {
104 char *tail;
105 const char *p = rule_str;
106 *born_rule = 0;
107 *stay_rule = 0;
108
109 if (strchr("bBsS", *p)) {
110 /* parse rule as a Born / Stay Alive code, see
111 * http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life */
112 do {
113 uint16_t *rule = (*p == 'b' || *p == 'B') ? born_rule : stay_rule;
114 p++;
115 while (*p >= '0' && *p <= '8') {
116 *rule += 1<<(*p - '0');
117 p++;
118 }
119 if (*p != '/')
120 break;
121 p++;
122 } while (strchr("bBsS", *p));
123
124 if (*p)
125 goto error;
126 } else {
127 /* parse rule as a number, expressed in the form STAY|(BORN<<9),
128 * where STAY and BORN encode the corresponding 9-bits rule */
129 long int rule = strtol(rule_str, &tail, 10);
130 if (*tail)
131 goto error;
132 *born_rule = ((1<<9)-1) & rule;
133 *stay_rule = rule >> 9;
134 }
135
136 return 0;
137
138 error:
141 }
142
143 #ifdef DEBUG
145 {
147 int i, j;
148
150 if (!line)
151 return;
152 for (i = 0; i < life->
h; i++) {
153 for (j = 0; j < life->
w; j++)
155 line[j] = 0;
157 }
159 }
160 #endif
161
163 {
165 char *p;
166 int ret, i, i0, j, h = 0, w, max_w = 0;
167
169 0, ctx)) < 0)
172
173 /* prescan file to get the number of lines and the maximum width */
174 w = 0;
177 h++; max_w =
FFMAX(w, max_w); w = 0;
178 } else {
179 w++;
180 }
181 }
183
185 if (max_w > life->
w || h > life->
h) {
187 "The specified size is %dx%d which cannot contain the provided file size of %dx%d\n",
188 life->
w, life->
h, max_w, h);
190 }
191 } else {
192 /* size was not specified, set it to size of the grid */
195 }
196
202 }
203
204 /* fill buf[0] */
206 for (i0 = 0, i = (life->
h - h)/2; i0 < h; i0++, i++) {
207 for (j = (life->
w - max_w)/2;; j++) {
209 if (*p == '\n') {
210 p++; break;
211 } else
213 }
214 }
216
217 return 0;
218 }
219
221 {
224
227
230
233 "Mold color is set while mold isn't, ignoring the color.\n");
234
236 /* fill the grid randomly */
237 int i;
238
244 }
247
249
250 for (i = 0; i < life->
w * life->
h; i++) {
252 if (r <= life->random_fill_ratio)
254 }
256 } else {
258 return ret;
259 }
260
262 "s:%dx%d r:%d/%d rule:%s stay_rule:%d born_rule:%d stitch:%d seed:%u\n",
266 return 0;
267 }
268
270 {
272
277 }
278
280 {
282
283 outlink->
w = life->
w;
284 outlink->
h = life->
h;
286
287 return 0;
288 }
289
291 {
293 int i, j;
296
297 enum { NW,
N, NE,
W,
E, SW,
S,
SE };
298
299 /* evolve the grid */
300 for (i = 0; i < life->
h; i++) {
301 for (j = 0; j < life->
w; j++) {
302 int pos[8][2],
n, alive,
cell;
304 pos[NW][0] = (i-1) < 0 ? life->
h-1 : i-1; pos[NW][1] = (j-1) < 0 ? life->
w-1 : j-1;
305 pos[
N ][0] = (i-1) < 0 ? life->
h-1 : i-1; pos[
N ][1] = j ;
306 pos[NE][0] = (i-1) < 0 ? life->
h-1 : i-1; pos[NE][1] = (j+1) == life->
w ? 0 : j+1;
307 pos[
W ][0] = i ; pos[
W ][1] = (j-1) < 0 ? life->
w-1 : j-1;
308 pos[
E ][0] = i ; pos[
E ][1] = (j+1) == life->
w ? 0 : j+1;
309 pos[SW][0] = (i+1) == life->
h ? 0 : i+1; pos[SW][1] = (j-1) < 0 ? life->
w-1 : j-1;
310 pos[
S ][0] = (i+1) == life->
h ? 0 : i+1; pos[
S ][1] = j ;
311 pos[
SE][0] = (i+1) == life->
h ? 0 : i+1; pos[
SE][1] = (j+1) == life->
w ? 0 : j+1;
312 } else {
313 pos[NW][0] = (i-1) < 0 ? -1 : i-1; pos[NW][1] = (j-1) < 0 ? -1 : j-1;
314 pos[
N ][0] = (i-1) < 0 ? -1 : i-1; pos[
N ][1] = j ;
315 pos[NE][0] = (i-1) < 0 ? -1 : i-1; pos[NE][1] = (j+1) == life->
w ? -1 : j+1;
316 pos[
W ][0] = i ; pos[
W ][1] = (j-1) < 0 ? -1 : j-1;
317 pos[
E ][0] = i ; pos[
E ][1] = (j+1) == life->
w ? -1 : j+1;
318 pos[SW][0] = (i+1) == life->
h ? -1 : i+1; pos[SW][1] = (j-1) < 0 ? -1 : j-1;
319 pos[
S ][0] = (i+1) == life->
h ? -1 : i+1; pos[
S ][1] = j ;
320 pos[
SE][0] = (i+1) == life->
h ? -1 : i+1; pos[
SE][1] = (j+1) == life->
w ? -1 : j+1;
321 }
322
323 /* compute the number of live neighbor cells */
324 n = (pos[NW][0] == -1 || pos[NW][1] == -1 ? 0 : oldbuf[pos[NW][0]*life->
w + pos[NW][1]] ==
ALIVE_CELL) +
325 (pos[
N ][0] == -1 || pos[
N ][1] == -1 ? 0 : oldbuf[pos[
N ][0]*life->
w + pos[
N ][1]] ==
ALIVE_CELL) +
326 (pos[NE][0] == -1 || pos[NE][1] == -1 ? 0 : oldbuf[pos[NE][0]*life->
w + pos[NE][1]] ==
ALIVE_CELL) +
327 (pos[
W ][0] == -1 || pos[
W ][1] == -1 ? 0 : oldbuf[pos[
W ][0]*life->
w + pos[
W ][1]] ==
ALIVE_CELL) +
328 (pos[
E ][0] == -1 || pos[
E ][1] == -1 ? 0 : oldbuf[pos[
E ][0]*life->
w + pos[
E ][1]] ==
ALIVE_CELL) +
329 (pos[SW][0] == -1 || pos[SW][1] == -1 ? 0 : oldbuf[pos[SW][0]*life->
w + pos[SW][1]] ==
ALIVE_CELL) +
330 (pos[
S ][0] == -1 || pos[
S ][1] == -1 ? 0 : oldbuf[pos[
S ][0]*life->
w + pos[
S ][1]] ==
ALIVE_CELL) +
331 (pos[
SE][0] == -1 || pos[
SE][1] == -1 ? 0 : oldbuf[pos[
SE][0]*life->
w + pos[
SE][1]] ==
ALIVE_CELL);
332 cell = oldbuf[i*life->
w + j];
334 if (alive) *newbuf =
ALIVE_CELL;
// new cell is alive
335 else if (cell) *newbuf = cell - 1; // new cell is dead and in the process of mold
336 else *newbuf = 0; // new cell is definitely dead
337 av_dlog(ctx,
"i:%d j:%d live_neighbors:%d cell:%d -> cell:%d\n", i, j, n, cell, *newbuf);
338 newbuf++;
339 }
340 }
341
343 }
344
346 {
349 int i, j, k;
350
351 /* fill the output picture with the old grid buffer */
352 for (i = 0; i < life->
h; i++) {
355 for (k = 0, j = 0; j < life->
w; j++) {
357 if (k==8 || j == life->
w-1) {
358 k = 0;
360 byte = 0;
361 }
362 }
363 }
364 }
365
366 // divide by 255 and round to nearest
367 // apply a fast variant: (X+127)/255 = ((X+127)*257+257)>>16 = ((X+128)*257)>>16
368 #define FAST_DIV255(x) ((((x) + 128) * 257) >> 16)
369
371 {
374 int i, j;
375
376 /* fill the output picture with the old grid buffer */
377 for (i = 0; i < life->
h; i++) {
379 for (j = 0; j < life->
w; j++) {
384 int death_age =
FFMIN((0xff - v) * life->
mold, 0xff);
385 *p++ =
FAST_DIV255((c2[0] << 8) + ((
int)c1[0] - (
int)c2[0]) * death_age);
386 *p++ =
FAST_DIV255((c2[1] << 8) + ((
int)c1[1] - (
int)c2[1]) * death_age);
387 *p++ =
FAST_DIV255((c2[2] << 8) + ((
int)c1[2] - (
int)c2[2]) * death_age);
388 } else {
390 AV_WB24(p, c[0]<<16 | c[1]<<8 | c[2]);
391 p += 3;
392 }
393 }
394 }
395 }
396
398 {
401 if (!picref)
404 picref->
pts = life->
pts++;
405
406 life->
draw(outlink->
src, picref);
408 #ifdef DEBUG
409 show_life_grid(outlink->
src);
410 #endif
412 }
413
415 {
418 if (life->
mold || memcmp(life-> life_color,
"\xff\xff\xff", 3)
422 } else {
425 }
427 return 0;
428 }
429
431 {
436 },
438 };
439
444 .priv_class = &life_class,
450 };