- Sync gdiplus with Wine head
[reactos.git] / reactos / dll / win32 / gdiplus / graphicspath.c
1 /*
2 * Copyright (C) 2007 Google (Evan Stade)
3 *
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
8 *
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
13 *
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
17 *
18 */
19
20 #include <stdarg.h>
21 #include <math.h>
22
23 #include "windef.h"
24 #include "winbase.h"
25 #include "winuser.h"
26 #include "wingdi.h"
27
28 #include "objbase.h"
29
30 #include "gdiplus.h"
31 #include "gdiplus_private.h"
32 #include "wine/debug.h"
33
34 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
35
36 typedef struct path_list_node_t path_list_node_t;
37 struct path_list_node_t {
38 GpPointF pt;
39 BYTE type; /* PathPointTypeStart or PathPointTypeLine */
40 path_list_node_t *next;
41 };
42
43 /* init list */
44 static BOOL init_path_list(path_list_node_t **node, REAL x, REAL y)
45 {
46 *node = GdipAlloc(sizeof(path_list_node_t));
47 if(!*node)
48 return FALSE;
49
50 (*node)->pt.X = x;
51 (*node)->pt.Y = y;
52 (*node)->type = PathPointTypeStart;
53 (*node)->next = NULL;
54
55 return TRUE;
56 }
57
58 /* free all nodes including argument */
59 static void free_path_list(path_list_node_t *node)
60 {
61 path_list_node_t *n = node;
62
63 while(n){
64 n = n->next;
65 GdipFree(node);
66 node = n;
67 }
68 }
69
70 /* Add a node after 'node' */
71 /*
72 * Returns
73 * pointer on success
74 * NULL on allocation problems
75 */
76 static path_list_node_t* add_path_list_node(path_list_node_t *node, REAL x, REAL y, BOOL type)
77 {
78 path_list_node_t *new;
79
80 new = GdipAlloc(sizeof(path_list_node_t));
81 if(!new)
82 return NULL;
83
84 new->pt.X = x;
85 new->pt.Y = y;
86 new->type = type;
87 new->next = node->next;
88 node->next = new;
89
90 return new;
91 }
92
93 /* returns element count */
94 static INT path_list_count(path_list_node_t *node)
95 {
96 INT count = 1;
97
98 while((node = node->next))
99 ++count;
100
101 return count;
102 }
103
104 /* GdipFlattenPath helper */
105 /*
106 * Used to recursively flatten single Bezier curve
107 * Parameters:
108 * - start : pointer to start point node;
109 * - (x2, y2): first control point;
110 * - (x3, y3): second control point;
111 * - end : pointer to end point node
112 * - flatness: admissible error of linear approximation.
113 *
114 * Return value:
115 * TRUE : success
116 * FALSE: out of memory
117 *
118 * TODO: used quality criteria should be revised to match native as
119 * closer as possible.
120 */
121 static BOOL flatten_bezier(path_list_node_t *start, REAL x2, REAL y2, REAL x3, REAL y3,
122 path_list_node_t *end, REAL flatness)
123 {
124 /* this 5 middle points with start/end define to half-curves */
125 GpPointF mp[5];
126 GpPointF pt, pt_st;
127 path_list_node_t *node;
128
129 /* calculate bezier curve middle points == new control points */
130 mp[0].X = (start->pt.X + x2) / 2.0;
131 mp[0].Y = (start->pt.Y + y2) / 2.0;
132 /* middle point between control points */
133 pt.X = (x2 + x3) / 2.0;
134 pt.Y = (y2 + y3) / 2.0;
135 mp[1].X = (mp[0].X + pt.X) / 2.0;
136 mp[1].Y = (mp[0].Y + pt.Y) / 2.0;
137 mp[4].X = (end->pt.X + x3) / 2.0;
138 mp[4].Y = (end->pt.Y + y3) / 2.0;
139 mp[3].X = (mp[4].X + pt.X) / 2.0;
140 mp[3].Y = (mp[4].Y + pt.Y) / 2.0;
141
142 mp[2].X = (mp[1].X + mp[3].X) / 2.0;
143 mp[2].Y = (mp[1].Y + mp[3].Y) / 2.0;
144
145 pt = end->pt;
146 pt_st = start->pt;
147 /* check flatness as a half of distance between middle point and a linearized path */
148 if(fabs(((pt.Y - pt_st.Y)*mp[2].X + (pt_st.X - pt.X)*mp[2].Y +
149 (pt_st.Y*pt.X - pt_st.X*pt.Y))) <=
150 (0.5 * flatness*sqrt((powf(pt.Y - pt_st.Y, 2.0) + powf(pt_st.X - pt.X, 2.0))))){
151 return TRUE;
152 }
153 else
154 /* add a middle point */
155 if(!(node = add_path_list_node(start, mp[2].X, mp[2].Y, PathPointTypeLine)))
156 return FALSE;
157
158 /* do the same with halfs */
159 flatten_bezier(start, mp[0].X, mp[0].Y, mp[1].X, mp[1].Y, node, flatness);
160 flatten_bezier(node, mp[3].X, mp[3].Y, mp[4].X, mp[4].Y, end, flatness);
161
162 return TRUE;
163 }
164
165 GpStatus WINGDIPAPI GdipAddPathArc(GpPath *path, REAL x1, REAL y1, REAL x2,
166 REAL y2, REAL startAngle, REAL sweepAngle)
167 {
168 INT count, old_count, i;
169
170 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
171 path, x1, y1, x2, y2, startAngle, sweepAngle);
172
173 if(!path)
174 return InvalidParameter;
175
176 count = arc2polybezier(NULL, x1, y1, x2, y2, startAngle, sweepAngle);
177
178 if(count == 0)
179 return Ok;
180 if(!lengthen_path(path, count))
181 return OutOfMemory;
182
183 old_count = path->pathdata.Count;
184 arc2polybezier(&path->pathdata.Points[old_count], x1, y1, x2, y2,
185 startAngle, sweepAngle);
186
187 for(i = 0; i < count; i++){
188 path->pathdata.Types[old_count + i] = PathPointTypeBezier;
189 }
190
191 path->pathdata.Types[old_count] =
192 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
193 path->newfigure = FALSE;
194 path->pathdata.Count += count;
195
196 return Ok;
197 }
198
199 GpStatus WINGDIPAPI GdipAddPathArcI(GpPath *path, INT x1, INT y1, INT x2,
200 INT y2, REAL startAngle, REAL sweepAngle)
201 {
202 TRACE("(%p, %d, %d, %d, %d, %.2f, %.2f)\n",
203 path, x1, y1, x2, y2, startAngle, sweepAngle);
204
205 return GdipAddPathArc(path,(REAL)x1,(REAL)y1,(REAL)x2,(REAL)y2,startAngle,sweepAngle);
206 }
207
208 GpStatus WINGDIPAPI GdipAddPathBezier(GpPath *path, REAL x1, REAL y1, REAL x2,
209 REAL y2, REAL x3, REAL y3, REAL x4, REAL y4)
210 {
211 INT old_count;
212
213 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
214 path, x1, y1, x2, y2, x3, y3, x4, y4);
215
216 if(!path)
217 return InvalidParameter;
218
219 if(!lengthen_path(path, 4))
220 return OutOfMemory;
221
222 old_count = path->pathdata.Count;
223
224 path->pathdata.Points[old_count].X = x1;
225 path->pathdata.Points[old_count].Y = y1;
226 path->pathdata.Points[old_count + 1].X = x2;
227 path->pathdata.Points[old_count + 1].Y = y2;
228 path->pathdata.Points[old_count + 2].X = x3;
229 path->pathdata.Points[old_count + 2].Y = y3;
230 path->pathdata.Points[old_count + 3].X = x4;
231 path->pathdata.Points[old_count + 3].Y = y4;
232
233 path->pathdata.Types[old_count] =
234 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
235 path->pathdata.Types[old_count + 1] = PathPointTypeBezier;
236 path->pathdata.Types[old_count + 2] = PathPointTypeBezier;
237 path->pathdata.Types[old_count + 3] = PathPointTypeBezier;
238
239 path->newfigure = FALSE;
240 path->pathdata.Count += 4;
241
242 return Ok;
243 }
244
245 GpStatus WINGDIPAPI GdipAddPathBezierI(GpPath *path, INT x1, INT y1, INT x2,
246 INT y2, INT x3, INT y3, INT x4, INT y4)
247 {
248 TRACE("(%p, %d, %d, %d, %d, %d, %d, %d, %d)\n",
249 path, x1, y1, x2, y2, x3, y3, x4, y4);
250
251 return GdipAddPathBezier(path,(REAL)x1,(REAL)y1,(REAL)x2,(REAL)y2,(REAL)x3,(REAL)y3,
252 (REAL)x4,(REAL)y4);
253 }
254
255 GpStatus WINGDIPAPI GdipAddPathBeziers(GpPath *path, GDIPCONST GpPointF *points,
256 INT count)
257 {
258 INT i, old_count;
259
260 TRACE("(%p, %p, %d)\n", path, points, count);
261
262 if(!path || !points || ((count - 1) % 3))
263 return InvalidParameter;
264
265 if(!lengthen_path(path, count))
266 return OutOfMemory;
267
268 old_count = path->pathdata.Count;
269
270 for(i = 0; i < count; i++){
271 path->pathdata.Points[old_count + i].X = points[i].X;
272 path->pathdata.Points[old_count + i].Y = points[i].Y;
273 path->pathdata.Types[old_count + i] = PathPointTypeBezier;
274 }
275
276 path->pathdata.Types[old_count] =
277 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
278 path->newfigure = FALSE;
279 path->pathdata.Count += count;
280
281 return Ok;
282 }
283
284 GpStatus WINGDIPAPI GdipAddPathBeziersI(GpPath *path, GDIPCONST GpPoint *points,
285 INT count)
286 {
287 GpPointF *ptsF;
288 GpStatus ret;
289 INT i;
290
291 TRACE("(%p, %p, %d)\n", path, points, count);
292
293 if(!points || ((count - 1) % 3))
294 return InvalidParameter;
295
296 ptsF = GdipAlloc(sizeof(GpPointF) * count);
297 if(!ptsF)
298 return OutOfMemory;
299
300 for(i = 0; i < count; i++){
301 ptsF[i].X = (REAL)points[i].X;
302 ptsF[i].Y = (REAL)points[i].Y;
303 }
304
305 ret = GdipAddPathBeziers(path, ptsF, count);
306 GdipFree(ptsF);
307
308 return ret;
309 }
310
311 GpStatus WINGDIPAPI GdipAddPathClosedCurve(GpPath *path, GDIPCONST GpPointF *points,
312 INT count)
313 {
314 TRACE("(%p, %p, %d)\n", path, points, count);
315
316 return GdipAddPathClosedCurve2(path, points, count, 1.0);
317 }
318
319 GpStatus WINGDIPAPI GdipAddPathClosedCurveI(GpPath *path, GDIPCONST GpPoint *points,
320 INT count)
321 {
322 TRACE("(%p, %p, %d)\n", path, points, count);
323
324 return GdipAddPathClosedCurve2I(path, points, count, 1.0);
325 }
326
327 GpStatus WINGDIPAPI GdipAddPathClosedCurve2(GpPath *path, GDIPCONST GpPointF *points,
328 INT count, REAL tension)
329 {
330 INT i, len_pt = (count + 1)*3-2;
331 GpPointF *pt;
332 GpPointF *pts;
333 REAL x1, x2, y1, y2;
334 GpStatus stat;
335
336 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
337
338 if(!path || !points || count <= 1)
339 return InvalidParameter;
340
341 pt = GdipAlloc(len_pt * sizeof(GpPointF));
342 pts = GdipAlloc((count + 1)*sizeof(GpPointF));
343 if(!pt || !pts){
344 GdipFree(pt);
345 GdipFree(pts);
346 return OutOfMemory;
347 }
348
349 /* copy source points to extend with the last one */
350 memcpy(pts, points, sizeof(GpPointF)*count);
351 pts[count] = pts[0];
352
353 tension = tension * TENSION_CONST;
354
355 for(i = 0; i < count-1; i++){
356 calc_curve_bezier(&(pts[i]), tension, &x1, &y1, &x2, &y2);
357
358 pt[3*i+2].X = x1;
359 pt[3*i+2].Y = y1;
360 pt[3*i+3].X = pts[i+1].X;
361 pt[3*i+3].Y = pts[i+1].Y;
362 pt[3*i+4].X = x2;
363 pt[3*i+4].Y = y2;
364 }
365
366 /* points [len_pt-2] and [0] are calculated
367 separetely to connect splines properly */
368 pts[0] = points[count-1];
369 pts[1] = points[0]; /* equals to start and end of a resulting path */
370 pts[2] = points[1];
371
372 calc_curve_bezier(pts, tension, &x1, &y1, &x2, &y2);
373 pt[len_pt-2].X = x1;
374 pt[len_pt-2].Y = y1;
375 pt[0].X = pts[1].X;
376 pt[0].Y = pts[1].Y;
377 pt[1].X = x2;
378 pt[1].Y = y2;
379 /* close path */
380 pt[len_pt-1].X = pt[0].X;
381 pt[len_pt-1].Y = pt[0].Y;
382
383 stat = GdipAddPathBeziers(path, pt, len_pt);
384
385 /* close figure */
386 if(stat == Ok){
387 INT count = path->pathdata.Count;
388 path->pathdata.Types[count - 1] |= PathPointTypeCloseSubpath;
389 path->newfigure = TRUE;
390 }
391
392 GdipFree(pts);
393 GdipFree(pt);
394
395 return stat;
396 }
397
398 GpStatus WINGDIPAPI GdipAddPathClosedCurve2I(GpPath *path, GDIPCONST GpPoint *points,
399 INT count, REAL tension)
400 {
401 GpPointF *ptf;
402 INT i;
403 GpStatus stat;
404
405 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
406
407 if(!path || !points || count <= 1)
408 return InvalidParameter;
409
410 ptf = GdipAlloc(sizeof(GpPointF)*count);
411 if(!ptf)
412 return OutOfMemory;
413
414 for(i = 0; i < count; i++){
415 ptf[i].X = (REAL)points[i].X;
416 ptf[i].Y = (REAL)points[i].Y;
417 }
418
419 stat = GdipAddPathClosedCurve2(path, ptf, count, tension);
420
421 GdipFree(ptf);
422
423 return stat;
424 }
425
426 GpStatus WINGDIPAPI GdipAddPathCurve(GpPath *path, GDIPCONST GpPointF *points, INT count)
427 {
428 TRACE("(%p, %p, %d)\n", path, points, count);
429
430 if(!path || !points || count <= 1)
431 return InvalidParameter;
432
433 return GdipAddPathCurve2(path, points, count, 1.0);
434 }
435
436 GpStatus WINGDIPAPI GdipAddPathCurveI(GpPath *path, GDIPCONST GpPoint *points, INT count)
437 {
438 TRACE("(%p, %p, %d)\n", path, points, count);
439
440 if(!path || !points || count <= 1)
441 return InvalidParameter;
442
443 return GdipAddPathCurve2I(path, points, count, 1.0);
444 }
445
446 GpStatus WINGDIPAPI GdipAddPathCurve2(GpPath *path, GDIPCONST GpPointF *points, INT count,
447 REAL tension)
448 {
449 INT i, len_pt = count*3-2;
450 GpPointF *pt;
451 REAL x1, x2, y1, y2;
452 GpStatus stat;
453
454 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
455
456 if(!path || !points || count <= 1)
457 return InvalidParameter;
458
459 pt = GdipAlloc(len_pt * sizeof(GpPointF));
460 if(!pt)
461 return OutOfMemory;
462
463 tension = tension * TENSION_CONST;
464
465 calc_curve_bezier_endp(points[0].X, points[0].Y, points[1].X, points[1].Y,
466 tension, &x1, &y1);
467
468 pt[0].X = points[0].X;
469 pt[0].Y = points[0].Y;
470 pt[1].X = x1;
471 pt[1].Y = y1;
472
473 for(i = 0; i < count-2; i++){
474 calc_curve_bezier(&(points[i]), tension, &x1, &y1, &x2, &y2);
475
476 pt[3*i+2].X = x1;
477 pt[3*i+2].Y = y1;
478 pt[3*i+3].X = points[i+1].X;
479 pt[3*i+3].Y = points[i+1].Y;
480 pt[3*i+4].X = x2;
481 pt[3*i+4].Y = y2;
482 }
483
484 calc_curve_bezier_endp(points[count-1].X, points[count-1].Y,
485 points[count-2].X, points[count-2].Y, tension, &x1, &y1);
486
487 pt[len_pt-2].X = x1;
488 pt[len_pt-2].Y = y1;
489 pt[len_pt-1].X = points[count-1].X;
490 pt[len_pt-1].Y = points[count-1].Y;
491
492 stat = GdipAddPathBeziers(path, pt, len_pt);
493
494 GdipFree(pt);
495
496 return stat;
497 }
498
499 GpStatus WINGDIPAPI GdipAddPathCurve2I(GpPath *path, GDIPCONST GpPoint *points,
500 INT count, REAL tension)
501 {
502 GpPointF *ptf;
503 INT i;
504 GpStatus stat;
505
506 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
507
508 if(!path || !points || count <= 1)
509 return InvalidParameter;
510
511 ptf = GdipAlloc(sizeof(GpPointF)*count);
512 if(!ptf)
513 return OutOfMemory;
514
515 for(i = 0; i < count; i++){
516 ptf[i].X = (REAL)points[i].X;
517 ptf[i].Y = (REAL)points[i].Y;
518 }
519
520 stat = GdipAddPathCurve2(path, ptf, count, tension);
521
522 GdipFree(ptf);
523
524 return stat;
525 }
526
527 GpStatus WINGDIPAPI GdipAddPathCurve3(GpPath *path, GDIPCONST GpPointF *points,
528 INT count, INT offset, INT nseg, REAL tension)
529 {
530 TRACE("(%p, %p, %d, %d, %d, %.2f)\n", path, points, count, offset, nseg, tension);
531
532 if(!path || !points || offset + 1 >= count || count - offset < nseg + 1)
533 return InvalidParameter;
534
535 return GdipAddPathCurve2(path, &points[offset], nseg + 1, tension);
536 }
537
538 GpStatus WINGDIPAPI GdipAddPathCurve3I(GpPath *path, GDIPCONST GpPoint *points,
539 INT count, INT offset, INT nseg, REAL tension)
540 {
541 TRACE("(%p, %p, %d, %d, %d, %.2f)\n", path, points, count, offset, nseg, tension);
542
543 if(!path || !points || offset + 1 >= count || count - offset < nseg + 1)
544 return InvalidParameter;
545
546 return GdipAddPathCurve2I(path, &points[offset], nseg + 1, tension);
547 }
548
549 GpStatus WINGDIPAPI GdipAddPathEllipse(GpPath *path, REAL x, REAL y, REAL width,
550 REAL height)
551 {
552 INT old_count, numpts;
553
554 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
555
556 if(!path)
557 return InvalidParameter;
558
559 if(!lengthen_path(path, MAX_ARC_PTS))
560 return OutOfMemory;
561
562 old_count = path->pathdata.Count;
563 if((numpts = arc2polybezier(&path->pathdata.Points[old_count], x, y, width,
564 height, 0.0, 360.0)) != MAX_ARC_PTS){
565 ERR("expected %d points but got %d\n", MAX_ARC_PTS, numpts);
566 return GenericError;
567 }
568
569 memset(&path->pathdata.Types[old_count + 1], PathPointTypeBezier,
570 MAX_ARC_PTS - 1);
571
572 /* An ellipse is an intrinsic figure (always is its own subpath). */
573 path->pathdata.Types[old_count] = PathPointTypeStart;
574 path->pathdata.Types[old_count + MAX_ARC_PTS - 1] |= PathPointTypeCloseSubpath;
575 path->newfigure = TRUE;
576 path->pathdata.Count += MAX_ARC_PTS;
577
578 return Ok;
579 }
580
581 GpStatus WINGDIPAPI GdipAddPathEllipseI(GpPath *path, INT x, INT y, INT width,
582 INT height)
583 {
584 TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
585
586 return GdipAddPathEllipse(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
587 }
588
589 GpStatus WINGDIPAPI GdipAddPathLine2(GpPath *path, GDIPCONST GpPointF *points,
590 INT count)
591 {
592 INT i, old_count;
593
594 TRACE("(%p, %p, %d)\n", path, points, count);
595
596 if(!path || !points)
597 return InvalidParameter;
598
599 if(!lengthen_path(path, count))
600 return OutOfMemory;
601
602 old_count = path->pathdata.Count;
603
604 for(i = 0; i < count; i++){
605 path->pathdata.Points[old_count + i].X = points[i].X;
606 path->pathdata.Points[old_count + i].Y = points[i].Y;
607 path->pathdata.Types[old_count + i] = PathPointTypeLine;
608 }
609
610 if(path->newfigure){
611 path->pathdata.Types[old_count] = PathPointTypeStart;
612 path->newfigure = FALSE;
613 }
614
615 path->pathdata.Count += count;
616
617 return Ok;
618 }
619
620 GpStatus WINGDIPAPI GdipAddPathLine2I(GpPath *path, GDIPCONST GpPoint *points, INT count)
621 {
622 GpPointF *pointsF;
623 INT i;
624 GpStatus stat;
625
626 TRACE("(%p, %p, %d)\n", path, points, count);
627
628 if(count <= 0)
629 return InvalidParameter;
630
631 pointsF = GdipAlloc(sizeof(GpPointF) * count);
632 if(!pointsF) return OutOfMemory;
633
634 for(i = 0;i < count; i++){
635 pointsF[i].X = (REAL)points[i].X;
636 pointsF[i].Y = (REAL)points[i].Y;
637 }
638
639 stat = GdipAddPathLine2(path, pointsF, count);
640
641 GdipFree(pointsF);
642
643 return stat;
644 }
645
646 GpStatus WINGDIPAPI GdipAddPathLine(GpPath *path, REAL x1, REAL y1, REAL x2, REAL y2)
647 {
648 INT old_count;
649
650 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x1, y1, x2, y2);
651
652 if(!path)
653 return InvalidParameter;
654
655 if(!lengthen_path(path, 2))
656 return OutOfMemory;
657
658 old_count = path->pathdata.Count;
659
660 path->pathdata.Points[old_count].X = x1;
661 path->pathdata.Points[old_count].Y = y1;
662 path->pathdata.Points[old_count + 1].X = x2;
663 path->pathdata.Points[old_count + 1].Y = y2;
664
665 path->pathdata.Types[old_count] =
666 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
667 path->pathdata.Types[old_count + 1] = PathPointTypeLine;
668
669 path->newfigure = FALSE;
670 path->pathdata.Count += 2;
671
672 return Ok;
673 }
674
675 GpStatus WINGDIPAPI GdipAddPathLineI(GpPath *path, INT x1, INT y1, INT x2, INT y2)
676 {
677 TRACE("(%p, %d, %d, %d, %d)\n", path, x1, y1, x2, y2);
678
679 return GdipAddPathLine(path, (REAL)x1, (REAL)y1, (REAL)x2, (REAL)y2);
680 }
681
682 GpStatus WINGDIPAPI GdipAddPathPath(GpPath *path, GDIPCONST GpPath* addingPath,
683 BOOL connect)
684 {
685 INT old_count, count;
686
687 TRACE("(%p, %p, %d)\n", path, addingPath, connect);
688
689 if(!path || !addingPath)
690 return InvalidParameter;
691
692 old_count = path->pathdata.Count;
693 count = addingPath->pathdata.Count;
694
695 if(!lengthen_path(path, count))
696 return OutOfMemory;
697
698 memcpy(&path->pathdata.Points[old_count], addingPath->pathdata.Points,
699 count * sizeof(GpPointF));
700 memcpy(&path->pathdata.Types[old_count], addingPath->pathdata.Types, count);
701
702 if(path->newfigure || !connect)
703 path->pathdata.Types[old_count] = PathPointTypeStart;
704 else
705 path->pathdata.Types[old_count] = PathPointTypeLine;
706
707 path->newfigure = FALSE;
708 path->pathdata.Count += count;
709
710 return Ok;
711 }
712
713 GpStatus WINGDIPAPI GdipAddPathPie(GpPath *path, REAL x, REAL y, REAL width, REAL height,
714 REAL startAngle, REAL sweepAngle)
715 {
716 GpPointF *ptf;
717 GpStatus status;
718 INT i, count;
719
720 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
721 path, x, y, width, height, startAngle, sweepAngle);
722
723 if(!path)
724 return InvalidParameter;
725
726 count = arc2polybezier(NULL, x, y, width, height, startAngle, sweepAngle);
727
728 if(count == 0)
729 return Ok;
730
731 ptf = GdipAlloc(sizeof(GpPointF)*count);
732 if(!ptf)
733 return OutOfMemory;
734
735 arc2polybezier(ptf, x, y, width, height, startAngle, sweepAngle);
736
737 status = GdipAddPathLine(path, (width - x)/2, (height - y)/2, ptf[0].X, ptf[0].Y);
738 if(status != Ok){
739 GdipFree(ptf);
740 return status;
741 }
742 /* one spline is already added as a line endpoint */
743 if(!lengthen_path(path, count - 1)){
744 GdipFree(ptf);
745 return OutOfMemory;
746 }
747
748 memcpy(&(path->pathdata.Points[path->pathdata.Count]), &(ptf[1]),sizeof(GpPointF)*(count-1));
749 for(i = 0; i < count-1; i++)
750 path->pathdata.Types[path->pathdata.Count+i] = PathPointTypeBezier;
751
752 path->pathdata.Count += count-1;
753
754 GdipClosePathFigure(path);
755
756 GdipFree(ptf);
757
758 return status;
759 }
760
761 GpStatus WINGDIPAPI GdipAddPathPieI(GpPath *path, INT x, INT y, INT width, INT height,
762 REAL startAngle, REAL sweepAngle)
763 {
764 TRACE("(%p, %d, %d, %d, %d, %.2f, %.2f)\n",
765 path, x, y, width, height, startAngle, sweepAngle);
766
767 return GdipAddPathPieI(path, (REAL)x, (REAL)y, (REAL)width, (REAL)height, startAngle, sweepAngle);
768 }
769
770 GpStatus WINGDIPAPI GdipAddPathPolygon(GpPath *path, GDIPCONST GpPointF *points, INT count)
771 {
772 INT old_count;
773
774 TRACE("(%p, %p, %d)\n", path, points, count);
775
776 if(!path || !points || count < 3)
777 return InvalidParameter;
778
779 if(!lengthen_path(path, count))
780 return OutOfMemory;
781
782 old_count = path->pathdata.Count;
783
784 memcpy(&path->pathdata.Points[old_count], points, count*sizeof(GpPointF));
785 memset(&path->pathdata.Types[old_count + 1], PathPointTypeLine, count - 1);
786
787 /* A polygon is an intrinsic figure */
788 path->pathdata.Types[old_count] = PathPointTypeStart;
789 path->pathdata.Types[old_count + count - 1] |= PathPointTypeCloseSubpath;
790 path->newfigure = TRUE;
791 path->pathdata.Count += count;
792
793 return Ok;
794 }
795
796 GpStatus WINGDIPAPI GdipAddPathPolygonI(GpPath *path, GDIPCONST GpPoint *points, INT count)
797 {
798 GpPointF *ptf;
799 GpStatus status;
800 INT i;
801
802 TRACE("(%p, %p, %d)\n", path, points, count);
803
804 if(!points || count < 3)
805 return InvalidParameter;
806
807 ptf = GdipAlloc(sizeof(GpPointF) * count);
808 if(!ptf)
809 return OutOfMemory;
810
811 for(i = 0; i < count; i++){
812 ptf[i].X = (REAL)points[i].X;
813 ptf[i].Y = (REAL)points[i].Y;
814 }
815
816 status = GdipAddPathPolygon(path, ptf, count);
817
818 GdipFree(ptf);
819
820 return status;
821 }
822
823 GpStatus WINGDIPAPI GdipClonePath(GpPath* path, GpPath **clone)
824 {
825 TRACE("(%p, %p)\n", path, clone);
826
827 if(!path || !clone)
828 return InvalidParameter;
829
830 *clone = GdipAlloc(sizeof(GpPath));
831 if(!*clone) return OutOfMemory;
832
833 **clone = *path;
834
835 (*clone)->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
836 (*clone)->pathdata.Types = GdipAlloc(path->datalen);
837 if(!(*clone)->pathdata.Points || !(*clone)->pathdata.Types){
838 GdipFree(*clone);
839 GdipFree((*clone)->pathdata.Points);
840 GdipFree((*clone)->pathdata.Types);
841 return OutOfMemory;
842 }
843
844 memcpy((*clone)->pathdata.Points, path->pathdata.Points,
845 path->datalen * sizeof(PointF));
846 memcpy((*clone)->pathdata.Types, path->pathdata.Types, path->datalen);
847
848 return Ok;
849 }
850
851 GpStatus WINGDIPAPI GdipClosePathFigure(GpPath* path)
852 {
853 TRACE("(%p)\n", path);
854
855 if(!path)
856 return InvalidParameter;
857
858 if(path->pathdata.Count > 0){
859 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
860 path->newfigure = TRUE;
861 }
862
863 return Ok;
864 }
865
866 GpStatus WINGDIPAPI GdipClosePathFigures(GpPath* path)
867 {
868 INT i;
869
870 TRACE("(%p)\n", path);
871
872 if(!path)
873 return InvalidParameter;
874
875 for(i = 1; i < path->pathdata.Count; i++){
876 if(path->pathdata.Types[i] == PathPointTypeStart)
877 path->pathdata.Types[i-1] |= PathPointTypeCloseSubpath;
878 }
879
880 path->newfigure = TRUE;
881
882 return Ok;
883 }
884
885 GpStatus WINGDIPAPI GdipCreatePath(GpFillMode fill, GpPath **path)
886 {
887 TRACE("(%d, %p)\n", fill, path);
888
889 if(!path)
890 return InvalidParameter;
891
892 *path = GdipAlloc(sizeof(GpPath));
893 if(!*path) return OutOfMemory;
894
895 (*path)->fill = fill;
896 (*path)->newfigure = TRUE;
897
898 return Ok;
899 }
900
901 GpStatus WINGDIPAPI GdipCreatePath2(GDIPCONST GpPointF* points,
902 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
903 {
904 TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
905
906 if(!path)
907 return InvalidParameter;
908
909 *path = GdipAlloc(sizeof(GpPath));
910 if(!*path) return OutOfMemory;
911
912 (*path)->pathdata.Points = GdipAlloc(count * sizeof(PointF));
913 (*path)->pathdata.Types = GdipAlloc(count);
914
915 if(!(*path)->pathdata.Points || !(*path)->pathdata.Types){
916 GdipFree((*path)->pathdata.Points);
917 GdipFree((*path)->pathdata.Types);
918 GdipFree(*path);
919 return OutOfMemory;
920 }
921
922 memcpy((*path)->pathdata.Points, points, count * sizeof(PointF));
923 memcpy((*path)->pathdata.Types, types, count);
924 (*path)->pathdata.Count = count;
925 (*path)->datalen = count;
926
927 (*path)->fill = fill;
928 (*path)->newfigure = TRUE;
929
930 return Ok;
931 }
932
933 GpStatus WINGDIPAPI GdipCreatePath2I(GDIPCONST GpPoint* points,
934 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
935 {
936 GpPointF *ptF;
937 GpStatus ret;
938 INT i;
939
940 TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
941
942 ptF = GdipAlloc(sizeof(GpPointF)*count);
943
944 for(i = 0;i < count; i++){
945 ptF[i].X = (REAL)points[i].X;
946 ptF[i].Y = (REAL)points[i].Y;
947 }
948
949 ret = GdipCreatePath2(ptF, types, count, fill, path);
950
951 GdipFree(ptF);
952
953 return ret;
954 }
955
956 GpStatus WINGDIPAPI GdipDeletePath(GpPath *path)
957 {
958 TRACE("(%p)\n", path);
959
960 if(!path)
961 return InvalidParameter;
962
963 GdipFree(path->pathdata.Points);
964 GdipFree(path->pathdata.Types);
965 GdipFree(path);
966
967 return Ok;
968 }
969
970 GpStatus WINGDIPAPI GdipFlattenPath(GpPath *path, GpMatrix* matrix, REAL flatness)
971 {
972 path_list_node_t *list, *node;
973 GpPointF pt;
974 INT i = 1;
975 INT startidx = 0;
976
977 TRACE("(%p, %p, %.2f)\n", path, matrix, flatness);
978
979 if(!path)
980 return InvalidParameter;
981
982 if(matrix){
983 WARN("transformation not supported yet!\n");
984 return NotImplemented;
985 }
986
987 if(path->pathdata.Count == 0)
988 return Ok;
989
990 pt = path->pathdata.Points[0];
991 if(!init_path_list(&list, pt.X, pt.Y))
992 return OutOfMemory;
993
994 node = list;
995
996 while(i < path->pathdata.Count){
997
998 BYTE type = path->pathdata.Types[i] & PathPointTypePathTypeMask;
999 path_list_node_t *start;
1000
1001 pt = path->pathdata.Points[i];
1002
1003 /* save last start point index */
1004 if(type == PathPointTypeStart)
1005 startidx = i;
1006
1007 /* always add line points and start points */
1008 if((type == PathPointTypeStart) || (type == PathPointTypeLine)){
1009 if(!add_path_list_node(node, pt.X, pt.Y, path->pathdata.Types[i]))
1010 goto memout;
1011
1012 node = node->next;
1013 ++i;
1014 continue;
1015 }
1016
1017 /* Bezier curve always stored as 4 points */
1018 if((path->pathdata.Types[i-1] & PathPointTypePathTypeMask) != PathPointTypeStart){
1019 type = (path->pathdata.Types[i] & ~PathPointTypePathTypeMask) | PathPointTypeLine;
1020 if(!add_path_list_node(node, pt.X, pt.Y, type))
1021 goto memout;
1022
1023 node = node->next;
1024 }
1025
1026 /* test for closed figure */
1027 if(path->pathdata.Types[i+1] & PathPointTypeCloseSubpath){
1028 pt = path->pathdata.Points[startidx];
1029 ++i;
1030 }
1031 else
1032 {
1033 i += 2;
1034 pt = path->pathdata.Points[i];
1035 };
1036
1037 start = node;
1038 /* add Bezier end point */
1039 type = (path->pathdata.Types[i] & ~PathPointTypePathTypeMask) | PathPointTypeLine;
1040 if(!add_path_list_node(node, pt.X, pt.Y, type))
1041 goto memout;
1042 node = node->next;
1043
1044 /* flatten curve */
1045 if(!flatten_bezier(start, path->pathdata.Points[i-2].X, path->pathdata.Points[i-2].Y,
1046 path->pathdata.Points[i-1].X, path->pathdata.Points[i-1].Y,
1047 node, flatness))
1048 goto memout;
1049
1050 ++i;
1051 }/* while */
1052
1053 /* store path data back */
1054 i = path_list_count(list);
1055 if(!lengthen_path(path, i))
1056 goto memout;
1057 path->pathdata.Count = i;
1058
1059 node = list;
1060 for(i = 0; i < path->pathdata.Count; i++){
1061 path->pathdata.Points[i] = node->pt;
1062 path->pathdata.Types[i] = node->type;
1063 node = node->next;
1064 }
1065
1066 free_path_list(list);
1067 return Ok;
1068
1069 memout:
1070 free_path_list(list);
1071 return OutOfMemory;
1072 }
1073
1074 GpStatus WINGDIPAPI GdipGetPathData(GpPath *path, GpPathData* pathData)
1075 {
1076 TRACE("(%p, %p)\n", path, pathData);
1077
1078 if(!path || !pathData)
1079 return InvalidParameter;
1080
1081 /* Only copy data. pathData allocation/freeing controlled by wrapper class.
1082 Assumed that pathData is enough wide to get all data - controlled by wrapper too. */
1083 memcpy(pathData->Points, path->pathdata.Points, sizeof(PointF) * pathData->Count);
1084 memcpy(pathData->Types , path->pathdata.Types , pathData->Count);
1085
1086 return Ok;
1087 }
1088
1089 GpStatus WINGDIPAPI GdipGetPathFillMode(GpPath *path, GpFillMode *fillmode)
1090 {
1091 TRACE("(%p, %p)\n", path, fillmode);
1092
1093 if(!path || !fillmode)
1094 return InvalidParameter;
1095
1096 *fillmode = path->fill;
1097
1098 return Ok;
1099 }
1100
1101 GpStatus WINGDIPAPI GdipGetPathLastPoint(GpPath* path, GpPointF* lastPoint)
1102 {
1103 INT count;
1104
1105 TRACE("(%p, %p)\n", path, lastPoint);
1106
1107 if(!path || !lastPoint)
1108 return InvalidParameter;
1109
1110 count = path->pathdata.Count;
1111 if(count > 0)
1112 *lastPoint = path->pathdata.Points[count-1];
1113
1114 return Ok;
1115 }
1116
1117 GpStatus WINGDIPAPI GdipGetPathPoints(GpPath *path, GpPointF* points, INT count)
1118 {
1119 TRACE("(%p, %p, %d)\n", path, points, count);
1120
1121 if(!path)
1122 return InvalidParameter;
1123
1124 if(count < path->pathdata.Count)
1125 return InsufficientBuffer;
1126
1127 memcpy(points, path->pathdata.Points, path->pathdata.Count * sizeof(GpPointF));
1128
1129 return Ok;
1130 }
1131
1132 GpStatus WINGDIPAPI GdipGetPathPointsI(GpPath *path, GpPoint* points, INT count)
1133 {
1134 GpStatus ret;
1135 GpPointF *ptf;
1136 INT i;
1137
1138 TRACE("(%p, %p, %d)\n", path, points, count);
1139
1140 if(count <= 0)
1141 return InvalidParameter;
1142
1143 ptf = GdipAlloc(sizeof(GpPointF)*count);
1144 if(!ptf) return OutOfMemory;
1145
1146 ret = GdipGetPathPoints(path,ptf,count);
1147 if(ret == Ok)
1148 for(i = 0;i < count;i++){
1149 points[i].X = roundr(ptf[i].X);
1150 points[i].Y = roundr(ptf[i].Y);
1151 };
1152 GdipFree(ptf);
1153
1154 return ret;
1155 }
1156
1157 GpStatus WINGDIPAPI GdipGetPathTypes(GpPath *path, BYTE* types, INT count)
1158 {
1159 TRACE("(%p, %p, %d)\n", path, types, count);
1160
1161 if(!path)
1162 return InvalidParameter;
1163
1164 if(count < path->pathdata.Count)
1165 return InsufficientBuffer;
1166
1167 memcpy(types, path->pathdata.Types, path->pathdata.Count);
1168
1169 return Ok;
1170 }
1171
1172 /* Windows expands the bounding box to the maximum possible bounding box
1173 * for a given pen. For example, if a line join can extend past the point
1174 * it's joining by x units, the bounding box is extended by x units in every
1175 * direction (even though this is too conservative for most cases). */
1176 GpStatus WINGDIPAPI GdipGetPathWorldBounds(GpPath* path, GpRectF* bounds,
1177 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1178 {
1179 GpPointF * points, temp_pts[4];
1180 INT count, i;
1181 REAL path_width = 1.0, width, height, temp, low_x, low_y, high_x, high_y;
1182
1183 TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1184
1185 /* Matrix and pen can be null. */
1186 if(!path || !bounds)
1187 return InvalidParameter;
1188
1189 /* If path is empty just return. */
1190 count = path->pathdata.Count;
1191 if(count == 0){
1192 bounds->X = bounds->Y = bounds->Width = bounds->Height = 0.0;
1193 return Ok;
1194 }
1195
1196 points = path->pathdata.Points;
1197
1198 low_x = high_x = points[0].X;
1199 low_y = high_y = points[0].Y;
1200
1201 for(i = 1; i < count; i++){
1202 low_x = min(low_x, points[i].X);
1203 low_y = min(low_y, points[i].Y);
1204 high_x = max(high_x, points[i].X);
1205 high_y = max(high_y, points[i].Y);
1206 }
1207
1208 width = high_x - low_x;
1209 height = high_y - low_y;
1210
1211 /* This looks unusual but it's the only way I can imitate windows. */
1212 if(matrix){
1213 temp_pts[0].X = low_x;
1214 temp_pts[0].Y = low_y;
1215 temp_pts[1].X = low_x;
1216 temp_pts[1].Y = high_y;
1217 temp_pts[2].X = high_x;
1218 temp_pts[2].Y = high_y;
1219 temp_pts[3].X = high_x;
1220 temp_pts[3].Y = low_y;
1221
1222 GdipTransformMatrixPoints((GpMatrix*)matrix, temp_pts, 4);
1223 low_x = temp_pts[0].X;
1224 low_y = temp_pts[0].Y;
1225
1226 for(i = 1; i < 4; i++){
1227 low_x = min(low_x, temp_pts[i].X);
1228 low_y = min(low_y, temp_pts[i].Y);
1229 }
1230
1231 temp = width;
1232 width = height * fabs(matrix->matrix[2]) + width * fabs(matrix->matrix[0]);
1233 height = height * fabs(matrix->matrix[3]) + temp * fabs(matrix->matrix[1]);
1234 }
1235
1236 if(pen){
1237 path_width = pen->width / 2.0;
1238
1239 if(count > 2)
1240 path_width = max(path_width, pen->width * pen->miterlimit / 2.0);
1241 /* FIXME: this should probably also check for the startcap */
1242 if(pen->endcap & LineCapNoAnchor)
1243 path_width = max(path_width, pen->width * 2.2);
1244
1245 low_x -= path_width;
1246 low_y -= path_width;
1247 width += 2.0 * path_width;
1248 height += 2.0 * path_width;
1249 }
1250
1251 bounds->X = low_x;
1252 bounds->Y = low_y;
1253 bounds->Width = width;
1254 bounds->Height = height;
1255
1256 return Ok;
1257 }
1258
1259 GpStatus WINGDIPAPI GdipGetPathWorldBoundsI(GpPath* path, GpRect* bounds,
1260 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1261 {
1262 GpStatus ret;
1263 GpRectF boundsF;
1264
1265 TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1266
1267 ret = GdipGetPathWorldBounds(path,&boundsF,matrix,pen);
1268
1269 if(ret == Ok){
1270 bounds->X = roundr(boundsF.X);
1271 bounds->Y = roundr(boundsF.Y);
1272 bounds->Width = roundr(boundsF.Width);
1273 bounds->Height = roundr(boundsF.Height);
1274 }
1275
1276 return ret;
1277 }
1278
1279 GpStatus WINGDIPAPI GdipGetPointCount(GpPath *path, INT *count)
1280 {
1281 TRACE("(%p, %p)\n", path, count);
1282
1283 if(!path)
1284 return InvalidParameter;
1285
1286 *count = path->pathdata.Count;
1287
1288 return Ok;
1289 }
1290
1291 GpStatus WINGDIPAPI GdipReversePath(GpPath* path)
1292 {
1293 INT i, count;
1294 INT start = 0; /* position in reversed path */
1295 GpPathData revpath;
1296
1297 TRACE("(%p)\n", path);
1298
1299 if(!path)
1300 return InvalidParameter;
1301
1302 count = path->pathdata.Count;
1303
1304 if(count == 0) return Ok;
1305
1306 revpath.Points = GdipAlloc(sizeof(GpPointF)*count);
1307 revpath.Types = GdipAlloc(sizeof(BYTE)*count);
1308 revpath.Count = count;
1309 if(!revpath.Points || !revpath.Types){
1310 GdipFree(revpath.Points);
1311 GdipFree(revpath.Types);
1312 return OutOfMemory;
1313 }
1314
1315 for(i = 0; i < count; i++){
1316
1317 /* find next start point */
1318 if(path->pathdata.Types[count-i-1] == PathPointTypeStart){
1319 INT j;
1320 for(j = start; j <= i; j++){
1321 revpath.Points[j] = path->pathdata.Points[count-j-1];
1322 revpath.Types[j] = path->pathdata.Types[count-j-1];
1323 }
1324 /* mark start point */
1325 revpath.Types[start] = PathPointTypeStart;
1326 /* set 'figure' endpoint type */
1327 if(i-start > 1){
1328 revpath.Types[i] = path->pathdata.Types[count-start-1] & ~PathPointTypePathTypeMask;
1329 revpath.Types[i] |= revpath.Types[i-1];
1330 }
1331 else
1332 revpath.Types[i] = path->pathdata.Types[start];
1333
1334 start = i+1;
1335 }
1336 }
1337
1338 memcpy(path->pathdata.Points, revpath.Points, sizeof(GpPointF)*count);
1339 memcpy(path->pathdata.Types, revpath.Types, sizeof(BYTE)*count);
1340
1341 GdipFree(revpath.Points);
1342 GdipFree(revpath.Types);
1343
1344 return Ok;
1345 }
1346
1347 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPointI(GpPath* path, INT x, INT y,
1348 GpPen *pen, GpGraphics *graphics, BOOL *result)
1349 {
1350 TRACE("(%p, %d, %d, %p, %p, %p)\n", path, x, y, pen, graphics, result);
1351
1352 return GdipIsOutlineVisiblePathPoint(path, x, y, pen, graphics, result);
1353 }
1354
1355 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPoint(GpPath* path, REAL x, REAL y,
1356 GpPen *pen, GpGraphics *graphics, BOOL *result)
1357 {
1358 static int calls;
1359
1360 if(!path || !pen)
1361 return InvalidParameter;
1362
1363 if(!(calls++))
1364 FIXME("not implemented\n");
1365
1366 return NotImplemented;
1367 }
1368
1369 GpStatus WINGDIPAPI GdipIsVisiblePathPointI(GpPath* path, INT x, INT y, GpGraphics *graphics, BOOL *result)
1370 {
1371 TRACE("(%p, %d, %d, %p, %p)\n", path, x, y, graphics, result);
1372
1373 return GdipIsVisiblePathPoint(path, x, y, graphics, result);
1374 }
1375
1376 GpStatus WINGDIPAPI GdipIsVisiblePathPoint(GpPath* path, REAL x, REAL y, GpGraphics *graphics, BOOL *result)
1377 {
1378 static int calls;
1379
1380 if(!path) return InvalidParameter;
1381
1382 if(!(calls++))
1383 FIXME("not implemented\n");
1384
1385 return NotImplemented;
1386 }
1387
1388 GpStatus WINGDIPAPI GdipStartPathFigure(GpPath *path)
1389 {
1390 TRACE("(%p)\n", path);
1391
1392 if(!path)
1393 return InvalidParameter;
1394
1395 path->newfigure = TRUE;
1396
1397 return Ok;
1398 }
1399
1400 GpStatus WINGDIPAPI GdipResetPath(GpPath *path)
1401 {
1402 TRACE("(%p)\n", path);
1403
1404 if(!path)
1405 return InvalidParameter;
1406
1407 path->pathdata.Count = 0;
1408 path->newfigure = TRUE;
1409 path->fill = FillModeAlternate;
1410
1411 return Ok;
1412 }
1413
1414 GpStatus WINGDIPAPI GdipSetPathFillMode(GpPath *path, GpFillMode fill)
1415 {
1416 TRACE("(%p, %d)\n", path, fill);
1417
1418 if(!path)
1419 return InvalidParameter;
1420
1421 path->fill = fill;
1422
1423 return Ok;
1424 }
1425
1426 GpStatus WINGDIPAPI GdipTransformPath(GpPath *path, GpMatrix *matrix)
1427 {
1428 TRACE("(%p, %p)\n", path, matrix);
1429
1430 if(!path)
1431 return InvalidParameter;
1432
1433 if(path->pathdata.Count == 0)
1434 return Ok;
1435
1436 return GdipTransformMatrixPoints(matrix, path->pathdata.Points,
1437 path->pathdata.Count);
1438 }
1439
1440 GpStatus WINGDIPAPI GdipAddPathRectangle(GpPath *path, REAL x, REAL y,
1441 REAL width, REAL height)
1442 {
1443 GpPath *backup;
1444 GpPointF ptf[2];
1445 GpStatus retstat;
1446 BOOL old_new;
1447
1448 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
1449
1450 if(!path || width < 0.0 || height < 0.0)
1451 return InvalidParameter;
1452
1453 /* make a backup copy of path data */
1454 if((retstat = GdipClonePath(path, &backup)) != Ok)
1455 return retstat;
1456
1457 /* rectangle should start as new path */
1458 old_new = path->newfigure;
1459 path->newfigure = TRUE;
1460 if((retstat = GdipAddPathLine(path,x,y,x+width,y)) != Ok){
1461 path->newfigure = old_new;
1462 goto fail;
1463 }
1464
1465 ptf[0].X = x+width;
1466 ptf[0].Y = y+height;
1467 ptf[1].X = x;
1468 ptf[1].Y = y+height;
1469
1470 if((retstat = GdipAddPathLine2(path, ptf, 2)) != Ok) goto fail;
1471 path->pathdata.Types[path->pathdata.Count-1] |= PathPointTypeCloseSubpath;
1472
1473 /* free backup */
1474 GdipDeletePath(backup);
1475 return Ok;
1476
1477 fail:
1478 /* reverting */
1479 GdipDeletePath(path);
1480 GdipClonePath(backup, &path);
1481 GdipDeletePath(backup);
1482
1483 return retstat;
1484 }
1485
1486 GpStatus WINGDIPAPI GdipAddPathRectangleI(GpPath *path, INT x, INT y,
1487 INT width, INT height)
1488 {
1489 TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
1490
1491 return GdipAddPathRectangle(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
1492 }
1493
1494 GpStatus WINGDIPAPI GdipAddPathRectangles(GpPath *path, GDIPCONST GpRectF *rects, INT count)
1495 {
1496 GpPath *backup;
1497 GpStatus retstat;
1498 INT i;
1499
1500 TRACE("(%p, %p, %d)\n", path, rects, count);
1501
1502 /* count == 0 - verified condition */
1503 if(!path || !rects || count == 0)
1504 return InvalidParameter;
1505
1506 if(count < 0)
1507 return OutOfMemory;
1508
1509 /* make a backup copy */
1510 if((retstat = GdipClonePath(path, &backup)) != Ok)
1511 return retstat;
1512
1513 for(i = 0; i < count; i++){
1514 if((retstat = GdipAddPathRectangle(path,rects[i].X,rects[i].Y,rects[i].Width,rects[i].Height)) != Ok)
1515 goto fail;
1516 }
1517
1518 /* free backup */
1519 GdipDeletePath(backup);
1520 return Ok;
1521
1522 fail:
1523 /* reverting */
1524 GdipDeletePath(path);
1525 GdipClonePath(backup, &path);
1526 GdipDeletePath(backup);
1527
1528 return retstat;
1529 }
1530
1531 GpStatus WINGDIPAPI GdipAddPathRectanglesI(GpPath *path, GDIPCONST GpRect *rects, INT count)
1532 {
1533 GpRectF *rectsF;
1534 GpStatus retstat;
1535 INT i;
1536
1537 TRACE("(%p, %p, %d)\n", path, rects, count);
1538
1539 if(!rects || count == 0)
1540 return InvalidParameter;
1541
1542 if(count < 0)
1543 return OutOfMemory;
1544
1545 rectsF = GdipAlloc(sizeof(GpRectF)*count);
1546
1547 for(i = 0;i < count;i++){
1548 rectsF[i].X = (REAL)rects[i].X;
1549 rectsF[i].Y = (REAL)rects[i].Y;
1550 rectsF[i].Width = (REAL)rects[i].Width;
1551 rectsF[i].Height = (REAL)rects[i].Height;
1552 }
1553
1554 retstat = GdipAddPathRectangles(path, rectsF, count);
1555 GdipFree(rectsF);
1556
1557 return retstat;
1558 }
1559
1560 GpStatus WINGDIPAPI GdipSetPathMarker(GpPath* path)
1561 {
1562 INT count;
1563
1564 TRACE("(%p)\n", path);
1565
1566 if(!path)
1567 return InvalidParameter;
1568
1569 count = path->pathdata.Count;
1570
1571 /* set marker flag */
1572 if(count > 0)
1573 path->pathdata.Types[count-1] |= PathPointTypePathMarker;
1574
1575 return Ok;
1576 }
1577
1578 GpStatus WINGDIPAPI GdipClearPathMarkers(GpPath* path)
1579 {
1580 INT count;
1581 INT i;
1582
1583 TRACE("(%p)\n", path);
1584
1585 if(!path)
1586 return InvalidParameter;
1587
1588 count = path->pathdata.Count;
1589
1590 for(i = 0; i < count - 1; i++){
1591 path->pathdata.Types[i] &= ~PathPointTypePathMarker;
1592 }
1593
1594 return Ok;
1595 }