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
|
/* cairo - a vector graphics library with display and print output
*
* Copyright © 2005 Red Hat, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it either under the terms of the GNU Lesser General Public
* License version 2.1 as published by the Free Software Foundation
* (the "LGPL") or, at your option, under the terms of the Mozilla
* Public License Version 1.1 (the "MPL"). If you do not alter this
* notice, a recipient may use your version of this file under either
* the MPL or the LGPL.
*
* You should have received a copy of the LGPL along with this library
* in the file COPYING-LGPL-2.1; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* You should have received a copy of the MPL along with this library
* in the file COPYING-MPL-1.1
*
* The contents of this file are subject to the Mozilla Public License
* Version 1.1 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
* OF ANY KIND, either express or implied. See the LGPL or the MPL for
* the specific language governing rights and limitations.
*
* The Original Code is the cairo graphics library.
*
* The Initial Developer of the Original Code is Red Hat, Inc.
*
* Contributor(s):
* Carl D. Worth <cworth@redhat.com>
*/
#include "cairo-path-data-private.h"
cairo_path_t
_cairo_path_nil = { NULL, 0 };
/* Closure for path interpretation. */
typedef struct cairo_path_data_count {
int count;
} cpdc_t;
static void
_cpdc_move_to (void *closure, double x, double y)
{
cpdc_t *cpdc = closure;
cpdc->count += 2;
}
static void
_cpdc_line_to (void *closure, double x, double y)
{
cpdc_t *cpdc = closure;
cpdc->count += 2;
}
static void
_cpdc_curve_to (void *closure,
double x1, double y1,
double x2, double y2,
double x3, double y3)
{
cpdc_t *cpdc = closure;
cpdc->count += 4;
}
static void
_cpdc_close_path (void *closure)
{
cpdc_t *cpdc = closure;
cpdc->count += 1;
}
static int
_cairo_path_data_count (cairo_gstate_t *gstate, cairo_bool_t flatten)
{
cpdc_t cpdc;
cpdc.count = 0;
_cairo_gstate_interpret_path (gstate,
_cpdc_move_to,
_cpdc_line_to,
flatten ? NULL : _cpdc_curve_to,
_cpdc_close_path,
&cpdc);
return cpdc.count;
}
/* Closure for path interpretation. */
typedef struct cairo_path_data_populate {
cairo_path_data_t *data;
} cpdp_t;
static void
_cpdp_move_to (void *closure, double x, double y)
{
cpdp_t *cpdp = closure;
cairo_path_data_t *data = cpdp->data;
data->header.type = CAIRO_PATH_MOVE_TO;
data->header.length = 2;
/* We index from 1 to leave room for data->header */
data[1].point.x = x;
data[1].point.y = y;
cpdp->data += data->header.length;
}
static void
_cpdp_line_to (void *closure, double x, double y)
{
cpdp_t *cpdp = closure;
cairo_path_data_t *data = cpdp->data;
data->header.type = CAIRO_PATH_LINE_TO;
data->header.length = 2;
/* We index from 1 to leave room for data->header */
data[1].point.x = x;
data[1].point.y = y;
cpdp->data += data->header.length;
}
static void
_cpdp_curve_to (void *closure,
double x1, double y1,
double x2, double y2,
double x3, double y3)
{
cpdp_t *cpdp = closure;
cairo_path_data_t *data = cpdp->data;
data->header.type = CAIRO_PATH_CURVE_TO;
data->header.length = 4;
/* We index from 1 to leave room for data->header */
data[1].point.x = x1;
data[1].point.y = y1;
data[2].point.x = x2;
data[2].point.y = y2;
data[3].point.x = x3;
data[3].point.y = y3;
cpdp->data += data->header.length;
}
static void
_cpdp_close_path (void *closure)
{
cpdp_t *cpdp = closure;
cairo_path_data_t *data = cpdp->data;
data->header.type = CAIRO_PATH_CLOSE_PATH;
data->header.length = 1;
cpdp->data += data->header.length;
}
static void
_cairo_path_data_populate (cairo_path_t *path,
cairo_gstate_t *gstate,
cairo_bool_t flatten)
{
cpdp_t cpdp;
cpdp.data = path->data;
_cairo_gstate_interpret_path (gstate,
_cpdp_move_to,
_cpdp_line_to,
flatten ? NULL : _cpdp_curve_to,
_cpdp_close_path,
&cpdp);
/* Sanity check the count */
assert (cpdp.data - path->data == path->num_data);
}
static cairo_path_t *
_cairo_path_data_create_real (cairo_gstate_t *gstate, cairo_bool_t flatten)
{
cairo_path_t *path;
path = malloc (sizeof (cairo_path_t));
if (path == NULL)
return &_cairo_path_nil;
path->num_data = _cairo_path_data_count (gstate, flatten);
path->data = malloc (path->num_data * sizeof (cairo_path_data_t));
if (path->data == NULL) {
free (path);
return &_cairo_path_nil;
}
_cairo_path_data_populate (path, gstate, flatten);
return path;
}
void
cairo_path_destroy (cairo_path_t *path)
{
free (path->data);
path->num_data = 0;
free (path);
}
cairo_path_t *
_cairo_path_data_create (cairo_gstate_t *gstate)
{
return _cairo_path_data_create_real (gstate, FALSE);
}
cairo_path_t *
_cairo_path_data_create_flat (cairo_gstate_t *gstate)
{
return _cairo_path_data_create_real (gstate, TRUE);
}
cairo_status_t
_cairo_path_data_append_to_context (cairo_path_t *path,
cairo_t *cr)
{
int i;
cairo_path_data_t *p;
for (i=0; i < path->num_data; i += path->data[i].header.length) {
p = &path->data[i];
switch (p->header.type) {
case CAIRO_PATH_MOVE_TO:
cairo_move_to (cr,
p[1].point.x, p[1].point.y);
if (p->header.length != 2)
return CAIRO_STATUS_INVALID_PATH_DATA;
break;
case CAIRO_PATH_LINE_TO:
cairo_line_to (cr,
p[1].point.x, p[1].point.y);
if (p->header.length != 2)
return CAIRO_STATUS_INVALID_PATH_DATA;
break;
case CAIRO_PATH_CURVE_TO:
cairo_curve_to (cr,
p[1].point.x, p[1].point.y,
p[2].point.x, p[2].point.y,
p[3].point.x, p[3].point.y);
if (p->header.length != 4)
return CAIRO_STATUS_INVALID_PATH_DATA;
break;
case CAIRO_PATH_CLOSE_PATH:
cairo_close_path (cr);
if (p->header.length != 1)
return CAIRO_STATUS_INVALID_PATH_DATA;
break;
default:
return CAIRO_STATUS_INVALID_PATH_DATA;
}
}
return CAIRO_STATUS_SUCCESS;
}
|