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
|
/*
* Copyright 1994-2022 Olivier Girondel
* Copyright 2019-2022 Tavasti
*
* This file is part of lebiniou.
*
* lebiniou is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* lebiniou 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with lebiniou. If not, see <http://www.gnu.org/licenses/>.
*/
/*
* Idea: drops that wash away existing picture, and reveal new behind it
*/
#include "context.h"
#include "images.h"
#define DROPCOUNT 20 /* how many drops there can be same time progressing */
#define INITIAL_WAIT_MAX 2 /* max wait before first drop */
#define WAIT_MIN 2 /* minimum wait between drops */
#define WAIT_MAX 18 /* max wait between drops */
#define DROPSIZE_MIN (WIDTH/14.0) /* minimum radius of drop */
#define DROPSIZE_MAX (WIDTH/5.0) /* maximum radius of drop */
#define HAZY_RADIUS 20.0 /* how many pixels on outer ring are hazy */
#define HAZY_RATIO 23.0 /* 1/x probability hazy pixel to get drawn */
#define PROG_RATIO 0.09 /* how big ratio of diameter progress in one round */
#define INCR_RATIO 0.3 /* Ratio how much color value is changed */
#define READY_TOL 0.65 /* difference to target regarded as ready */
uint32_t version = 0;
uint32_t options = BO_GFX | BO_IMAGE | BO_SCHEMES;
char desc[] = "Image drops";
char dname[] = "Image drops";
typedef struct Drop_s {
int x;
int y;
double target; /* target radius */
double current; /* current radius */
int incr; /* color increment / decrement value */
} Drop_t;
static Drop_t *drops = NULL;
static short *mask = NULL;
static int next_drop; /* counter how many rounds before next drop */
int8_t
create(Context_t *ctx)
{
mask = xmalloc(sizeof(short) * BUFFSIZE);
drops = xcalloc(DROPCOUNT, sizeof(Drop_t));
return 1;
}
void
destroy(Context_t *ctx)
{
xfree(mask);
xfree(drops);
}
void
on_switch_on(Context_t *ctx)
{
/* clear drops */
for (uint8_t i = 0; i < DROPCOUNT ; i++) {
drops[i].x = -1;
}
next_drop = b_rand_uint32_range(0, INITIAL_WAIT_MAX);
/* initialize mask */
for (uint32_t i = 0; i < BUFFSIZE ; i++) {
mask[i] = -1;
}
}
/* helper function for marking affected pixels of circle to mask */
static void
mark_circle_range(int x, int y, double r, short mark, short *mbuff)
{
assert(NULL != mask);
/* calculate bounding box of circle */
int left = x - r;
left = (left < 0) ? 0 : left;
int right = x + r;
right = (right >= WIDTH) ? WIDTH - 1 : right;
int top = y - r;
top = (top < 0) ? 0 : top;
int bottom = y + r;
bottom = (bottom >= HEIGHT) ? HEIGHT - 1 : bottom;
/* we handle distances as squared to speed up things,
no need to calculate sqrt for every pixel */
double distsq = r * r; /* outer ring which is hazy*/
double distsq2 = (r - HAZY_RADIUS) * (r - HAZY_RADIUS); /* inner ring */
/* loop thru bounding box, and check if pixel is in circle */
for (int i = top; i <= bottom; i++) {
for (int j = left ; j <= right; j++) {
int dx = j - x;
int dy = i - y;
if (((dx * dx) + (dy * dy)) < distsq) {
if (((dx * dx) + (dy * dy)) < distsq2) {
mbuff[i * WIDTH + j] = mark;
} else if (b_rand_uint32_range(0, HAZY_RATIO) == 0) {
/* hazy pixel */
mbuff[i * WIDTH + j] = mark;
} else {
/* outside circle */
mbuff[i * WIDTH + j] = -1;
}
}
}
}
}
void
run(Context_t *ctx)
{
static uint32_t imageid = 0; /* we store image id so that we can disable
drops when image changes */
if (ctx->imgf->dst->id != imageid) { /* image change detected */
imageid = ctx->imgf->dst->id;
/* mark all drops unused */
for (uint8_t i = 0; i < DROPCOUNT; i++) {
drops[i].x = -1;
drops[i].target = 1.0;
drops[i].current = 1.0;
}
next_drop = 0; /* get one new drop immediately */
}
/* Grow existing drops, and release fully grown drops for next use */
for (uint8_t i = 0; i < DROPCOUNT; i++) {
if (drops[i].x > -1) { /* in use */
if ((drops[i].current + READY_TOL) < drops[i].target) {
drops[i].current += (drops[i].target - drops[i].current) * PROG_RATIO;
drops[i].incr = (drops[i].target - drops[i].current) * INCR_RATIO;
if (drops[i].incr < 1.0) {
drops[i].incr = 1.0; /* values less that 1 won't have any effect */
}
/* mark area where this drop affects this round */
mark_circle_range(drops[i].x, drops[i].y, drops[i].current, i, mask);
} else {
/* this drop is done */
mark_circle_range(drops[i].x, drops[i].y, drops[i].target, -1, mask);
drops[i].x = -1;
}
}
}
/* start checking if we need and can add new drop */
if (--next_drop <= 0) { /* time to add drop if there is room in struct */
for (uint8_t i = 0; i < DROPCOUNT; i++) {
if (drops[i].x == -1) { /* free entry */
/* new random drop */
drops[i].x = b_rand_uint32_range(0, WIDTH);
drops[i].y = b_rand_uint32_range(0, HEIGHT);
drops[i].target = b_rand_double_range(DROPSIZE_MIN, DROPSIZE_MAX);
drops[i].current = drops[i].target * PROG_RATIO ;
drops[i].incr = drops[i].target;
next_drop = b_rand_uint32_range(WAIT_MIN, WAIT_MAX);
/* mark area where this drop affects this round */
mark_circle_range(drops[i].x, drops[i].y, drops[i].current, i, mask);
break;
}
}
}
/* actual picture handling */
const Pixel_t *src = active_buffer(ctx)->buffer;
Pixel_t *dst = passive_buffer(ctx)->buffer;
for (uint32_t i = 0; i < BUFFSIZE; i++) {
Pixel_t col = src[i];
if (mask[i] >= 0) {
if (col > ctx->imgf->cur->buff->buffer[i]) {
col = ((col - drops[mask[i]].incr) > ctx->imgf->cur->buff->buffer[i]) ?
col - drops[mask[i]].incr : ctx->imgf->cur->buff->buffer[i];
} else if (col < ctx->imgf->cur->buff->buffer[i]) {
col = (col < (ctx->imgf->cur->buff->buffer[i] - drops[mask[i]].incr)) ?
col + drops[mask[i]].incr : ctx->imgf->cur->buff->buffer[i];
}
}
*dst++ = col;
}
}
|
