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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
|
#include "mupdf/fitz.h"
#include "draw-imp.h"
#include <assert.h>
#include <math.h>
enum { MAXN = 2 + FZ_MAX_COLORS };
static void paint_scan(fz_pixmap *restrict pix, int y, int fx0, int fx1, int cx0, int cx1, const int *restrict v0, const int *restrict v1, int n)
{
unsigned char *p;
int c[MAXN], dc[MAXN];
int k, w;
float div, mul;
int x0, x1, pa;
/* Ensure that fx0 is left edge, and fx1 is right */
if (fx0 > fx1)
{
const int *v;
int t = fx0; fx0 = fx1; fx1 = t;
v = v0; v0 = v1; v1 = v;
}
else if (fx0 == fx1)
return;
/* Clip fx0, fx1 to range */
if (fx0 >= cx1)
return;
if (fx1 <= cx0)
return;
x0 = (fx0 > cx0 ? fx0 : cx0);
x1 = (fx1 < cx1 ? fx1 : cx1);
w = x1 - x0;
if (w == 0)
return;
div = 1.0f / (fx1 - fx0);
mul = (x0 - fx0);
for (k = 0; k < n; k++)
{
dc[k] = (v1[k] - v0[k]) * div;
c[k] = v0[k] + dc[k] * mul;
}
p = pix->samples + ((x0 - pix->x) * pix->n) + ((y - pix->y) * pix->stride);
pa = pix->alpha;
do
{
for (k = 0; k < n; k++)
{
*p++ = c[k]>>16;
c[k] += dc[k];
}
if (pa)
*p++ = 255;
}
while (--w);
}
typedef struct edge_data_s edge_data;
struct edge_data_s
{
float x;
float dx;
int v[2*MAXN];
};
static inline void prepare_edge(const float *restrict vtop, const float *restrict vbot, edge_data *restrict edge, float y, int n)
{
float r = 1.0f / (vbot[1] - vtop[1]);
float t = (y - vtop[1]) * r;
float diff = vbot[0] - vtop[0];
int i;
edge->x = vtop[0] + diff * t;
edge->dx = diff * r;
for (i = 0; i < n; i++)
{
diff = vbot[i+2] - vtop[i+2];
edge->v[i] = (int)(65536.0f * (vtop[i+2] + diff * t));
edge->v[i+MAXN] = (int)(65536.0f * diff * r);
}
}
static inline void step_edge(edge_data *edge, int n)
{
int i;
edge->x += edge->dx;
for (i = 0; i < n; i++)
{
edge->v[i] += edge->v[i + MAXN];
}
}
static void
fz_paint_triangle(fz_pixmap *pix, float *v[3], int n, const fz_irect *bbox)
{
edge_data e0, e1;
int top, mid, bot;
float y, y1;
int minx, maxx;
top = bot = 0;
if (v[1][1] < v[0][1]) top = 1; else bot = 1;
if (v[2][1] < v[top][1]) top = 2;
else if (v[2][1] > v[bot][1]) bot = 2;
if (v[top][1] == v[bot][1]) return;
/* Test if the triangle is completely outside the scissor rect */
if (v[bot][1] < bbox->y0) return;
if (v[top][1] > bbox->y1) return;
/* Magic! Ensure that mid/top/bot are all different */
mid = 3^top^bot;
assert(top != bot && top != mid && mid != bot);
minx = fz_maxi(bbox->x0, pix->x);
maxx = fz_mini(bbox->x1, pix->x + pix->w);
y = ceilf(fz_max(bbox->y0, v[top][1]));
y1 = ceilf(fz_min(bbox->y1, v[mid][1]));
n -= 2;
prepare_edge(v[top], v[bot], &e0, y, n);
if (y < y1)
{
prepare_edge(v[top], v[mid], &e1, y, n);
do
{
paint_scan(pix, y, (int)e0.x, (int)e1.x, minx, maxx, &e0.v[0], &e1.v[0], n);
step_edge(&e0, n);
step_edge(&e1, n);
y ++;
}
while (y < y1);
}
y1 = ceilf(fz_min(bbox->y1, v[bot][1]));
if (y < y1)
{
prepare_edge(v[mid], v[bot], &e1, y, n);
do
{
paint_scan(pix, y, (int)e0.x, (int)e1.x, minx, maxx, &e0.v[0], &e1.v[0], n);
y ++;
if (y >= y1)
break;
step_edge(&e0, n);
step_edge(&e1, n);
}
while (1);
}
}
struct paint_tri_data
{
const fz_shade *shade;
fz_pixmap *dest;
const fz_irect *bbox;
fz_color_converter cc;
};
static void
prepare_mesh_vertex(fz_context *ctx, void *arg, fz_vertex *v, const float *input)
{
struct paint_tri_data *ptd = (struct paint_tri_data *)arg;
const fz_shade *shade = ptd->shade;
fz_pixmap *dest = ptd->dest;
float *output = v->c;
int i;
if (shade->use_function)
output[0] = input[0] * 255;
else
{
int n = fz_colorspace_n(ctx, dest->colorspace);
ptd->cc.convert(ctx, &ptd->cc, output, input);
for (i = 0; i < n; i++)
output[i] *= 255;
}
}
static void
do_paint_tri(fz_context *ctx, void *arg, fz_vertex *av, fz_vertex *bv, fz_vertex *cv)
{
struct paint_tri_data *ptd = (struct paint_tri_data *)arg;
float *vertices[3];
fz_pixmap *dest;
vertices[0] = (float *)av;
vertices[1] = (float *)bv;
vertices[2] = (float *)cv;
dest = ptd->dest;
fz_paint_triangle(dest, vertices, 2 + fz_colorspace_n(ctx, dest->colorspace), ptd->bbox);
}
void
fz_paint_shade(fz_context *ctx, fz_shade *shade, const fz_matrix *ctm, fz_pixmap *dest, const fz_irect *bbox)
{
unsigned char clut[256][FZ_MAX_COLORS];
fz_pixmap *temp = NULL;
fz_pixmap *conv = NULL;
float color[FZ_MAX_COLORS];
struct paint_tri_data ptd = { 0 };
int i, k, n;
fz_matrix local_ctm;
fz_var(temp);
fz_var(conv);
fz_try(ctx)
{
fz_concat(&local_ctm, &shade->matrix, ctm);
if (shade->use_function)
{
fz_color_converter cc;
int cn = fz_colorspace_n(ctx, shade->colorspace);
n = fz_colorspace_n(ctx, dest->colorspace);
fz_lookup_color_converter(ctx, &cc, dest->colorspace, shade->colorspace);
for (i = 0; i < 256; i++)
{
cc.convert(ctx, &cc, color, shade->function[i]);
for (k = 0; k < n; k++)
clut[i][k] = color[k] * 255;
clut[i][k] = shade->function[i][cn] * 255;
}
/* We need to use alpha = 1 here, because the shade might not fill
* the bbox. */
conv = fz_new_pixmap_with_bbox(ctx, dest->colorspace, bbox, 1);
temp = fz_new_pixmap_with_bbox(ctx, fz_device_gray(ctx), bbox, 1);
fz_clear_pixmap(ctx, temp);
}
else
{
temp = dest;
}
ptd.dest = temp;
ptd.shade = shade;
ptd.bbox = bbox;
fz_init_cached_color_converter(ctx, &ptd.cc, temp->colorspace, shade->colorspace);
fz_process_shade(ctx, shade, &local_ctm, &prepare_mesh_vertex, &do_paint_tri, &ptd);
if (shade->use_function)
{
unsigned char *s = temp->samples;
unsigned char *d = conv->samples;
int da = conv->alpha;
int sa = temp->alpha;
int hh = temp->h;
while (hh--)
{
int len = temp->w;
while (len--)
{
int v = *s++;
int a = (da ? clut[v][conv->n - 1] : 255);
if (sa)
a = fz_mul255(*s++, a);
for (k = 0; k < conv->n - da; k++)
*d++ = fz_mul255(clut[v][k], a);
if (da)
*d++ = a;
}
d += conv->stride - conv->w * conv->n;
s += temp->stride - temp->w * temp->n;
}
fz_paint_pixmap(dest, conv, 255);
fz_drop_pixmap(ctx, conv);
fz_drop_pixmap(ctx, temp);
}
}
fz_always(ctx)
{
fz_fin_cached_color_converter(ctx, &ptd.cc);
}
fz_catch(ctx)
{
fz_drop_pixmap(ctx, conv);
fz_drop_pixmap(ctx, temp);
fz_rethrow(ctx);
}
}
|
