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
244
245
246
|
/* Copyright (C) 2001-2021 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 1305 Grant Avenue - Suite 200, Novato,
CA 94945, U.S.A., +1(415)492-9861, for further information.
*/
/* Configurable algorithm for filling a path by scanlines. */
/*
* Since we need several statically defined variants of this agorithm,
* we store it in .h file and include it several times into gxfill.c .
* Configuration macros (template arguments) are :
*
* FILL_DIRECT - See LOOP_FILL_RECTANGLE_DIRECT.
* TEMPLATE_spot_into_scanlines - the name of the procedure to generate.
*/
#if defined(TEMPLATE_spot_into_scanlines) && defined(INCR) && defined(LOOP_FILL_RECTANGLE_DIRECT)
static int
TEMPLATE_spot_into_scanlines (line_list *ll, fixed band_mask)
{
const fill_options fo = *ll->fo;
active_line *yll = ll->y_list;
fixed y_limit = fo.ymax;
/*
* The meaning of adjust_below (B) and adjust_above (A) is that the
* pixels that would normally be painted at coordinate Y get "smeared"
* to coordinates Y-B through Y+A-epsilon, inclusive. This is
* equivalent to saying that the pixels actually painted at coordinate Y
* are those contributed by scan lines Y-A+epsilon through Y+B,
* inclusive. (A = B = 0 is a special case, equivalent to B = 0, A =
* epsilon.)
*/
fixed y_frac_min =
(fo.adjust_above == fixed_0 ? fixed_half :
fixed_half + fixed_epsilon - fo.adjust_above);
fixed y_frac_max =
fixed_half + fo.adjust_below;
int y0 = fixed2int(min_fixed);
fixed y_bot = min_fixed; /* normally int2fixed(y0) + y_frac_min */
fixed y_top = min_fixed; /* normally int2fixed(y0) + y_frac_max */
fixed y = min_fixed;
coord_range_list_t rlist;
coord_range_t rlocal[MAX_LOCAL_ACTIVE];
int code = 0;
if (yll == 0) /* empty list */
return 0;
range_list_init(&rlist, rlocal, countof(rlocal), ll->memory);
ll->x_list = 0;
ll->x_head.x_current = min_fixed; /* stop backward scan */
do {
active_line *alp, *nlp;
fixed x;
bool new_band;
INCR(iter);
code = move_al_by_y(ll, y); /* Skip horizontal pieces. */
if (code < 0)
return code;
/*
* Find the next sampling point, either the bottom of a sampling
* band or a line start.
*/
if (ll->x_list == 0)
y = (yll == 0 ? ll->y_break : yll->start.y);
else {
y = y_bot + fixed_1;
if (yll != 0)
y = min(y, yll->start.y);
for (alp = ll->x_list; alp != 0; alp = alp->next) {
fixed yy = max(alp->fi.y3, alp->fi.y0);
yy = max(yy, alp->end.y); /* Non-monotonic curves may have an inner extreme. */
y = min(y, yy);
}
}
/* Move newly active lines from y to x list. */
while (yll != 0 && yll->start.y == y) {
active_line *ynext = yll->next; /* insert smashes next/prev links */
if (yll->direction == DIR_HORIZONTAL) {
insert_h_new(yll, ll);
} else
insert_x_new(yll, ll);
yll = ynext;
}
/* Update active lines to y. */
x = min_fixed;
for (alp = ll->x_list; alp != 0; alp = nlp) {
fixed nx;
nlp = alp->next;
e:if (alp->end.y <= y || alp->start.y == alp->end.y) {
if (end_x_line(alp, ll, true))
continue;
if (alp->more_flattened)
if (alp->end.y <= y || alp->start.y == alp->end.y) {
code = step_al(alp, true);
if (code < 0)
return code;
}
goto e;
}
nx = alp->x_current = (alp->start.y >= y ? alp->start.x : AL_X_AT_Y(alp, y));
if (nx < x) {
/* Move this line backward in the list. */
active_line *ilp = alp;
while (nx < (ilp = ilp->prev)->x_current)
DO_NOTHING;
/* Now ilp->x_current <= nx < ilp->next->x_cur. */
alp->prev->next = alp->next;
if (alp->next)
alp->next->prev = alp->prev;
if (ilp->next)
ilp->next->prev = alp;
alp->next = ilp->next;
ilp->next = alp;
alp->prev = ilp;
continue;
}
x = nx;
}
if (y > y_top || y >= y_limit) {
/* We're beyond the end of the previous sampling band. */
const coord_range_t *pcr;
/* Fill the ranges for y0. */
for (pcr = rlist.first.next; pcr != &rlist.last;
pcr = pcr->next
) {
int x0 = pcr->rmin, x1 = pcr->rmax;
if_debug4m('Q', ll->memory, "[Qr]draw "PRI_INTPTR": [%d,%d),%d\n",
(intptr_t)pcr, x0, x1, y0);
code = LOOP_FILL_RECTANGLE_DIRECT(&fo, x0, y0, x1 - x0, 1);
if_debug3m('F', ll->memory, "[F]drawing [%d:%d),%d\n", x0, x1, y0);
if (code < 0)
goto done;
}
range_list_reset(&rlist);
/* Check whether we've reached the maximum y. */
if (y >= y_limit)
break;
/* Reset the sampling band. */
y0 = fixed2int(y);
if (fixed_fraction(y) < y_frac_min)
--y0;
y_bot = int2fixed(y0) + y_frac_min;
y_top = int2fixed(y0) + y_frac_max;
new_band = true;
} else
new_band = false;
if (y <= y_top) {
/*
* We're within the same Y pixel. Merge regions for segments
* starting here (at y), up to y_top or the end of the segment.
* If this is the first sampling within the band, run the
* fill/eofill algorithm.
*/
fixed y_min;
if (new_band) {
int inside = 0;
INCR(band);
for (alp = ll->x_list; alp != 0; alp = alp->next) {
int x0 = fixed2int_pixround(alp->x_current - fo.adjust_left);
for (;;) {
/* We're inside a filled region. */
print_al(ll->memory, "step", alp);
INCR(band_step);
inside += alp->direction;
if (!INSIDE_PATH_P(inside, fo.rule))
break;
/*
* Since we're dealing with closed paths, the test
* for alp == 0 shouldn't be needed, but we may have
* omitted lines that are to the right of the
* clipping region.
*/
if ((alp = alp->next) == 0)
goto out;
}
/* We just went from inside to outside, so fill the region. */
code = range_list_add(&rlist, x0,
fixed2int_rounded(alp->x_current +
fo.adjust_right));
if (code < 0)
goto done;
}
out:
y_min = min_fixed;
} else
y_min = y;
/* Process horizontal segments */
for (alp = ll->h_list0; alp != NULL; alp = alp->next) {
fixed x0 = min(alp->start.x, alp->end.x);
fixed x1 = max(alp->start.x, alp->end.x);
code = range_list_add(&rlist, fixed2int_rounded(x0 - fo.adjust_left),
fixed2int_rounded(x1 + fo.adjust_right));
if (code < 0)
goto done;
}
code = merge_ranges(&rlist, ll, y_min, y_top);
} /* else y < y_bot + 1, do nothing */
ll->h_list0 = NULL;
} while (code >= 0);
done:
range_list_free(&rlist);
return code;
}
#else
int dummy;
#endif
|
