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*sqrtf((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 separately 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 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
388 path->newfigure = TRUE;
389 }
390
391 GdipFree(pts);
392 GdipFree(pt);
393
394 return stat;
395 }
396
397 GpStatus WINGDIPAPI GdipAddPathClosedCurve2I(GpPath *path, GDIPCONST GpPoint *points,
398 INT count, REAL tension)
399 {
400 GpPointF *ptf;
401 INT i;
402 GpStatus stat;
403
404 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
405
406 if(!path || !points || count <= 1)
407 return InvalidParameter;
408
409 ptf = GdipAlloc(sizeof(GpPointF)*count);
410 if(!ptf)
411 return OutOfMemory;
412
413 for(i = 0; i < count; i++){
414 ptf[i].X = (REAL)points[i].X;
415 ptf[i].Y = (REAL)points[i].Y;
416 }
417
418 stat = GdipAddPathClosedCurve2(path, ptf, count, tension);
419
420 GdipFree(ptf);
421
422 return stat;
423 }
424
425 GpStatus WINGDIPAPI GdipAddPathCurve(GpPath *path, GDIPCONST GpPointF *points, INT count)
426 {
427 TRACE("(%p, %p, %d)\n", path, points, count);
428
429 if(!path || !points || count <= 1)
430 return InvalidParameter;
431
432 return GdipAddPathCurve2(path, points, count, 1.0);
433 }
434
435 GpStatus WINGDIPAPI GdipAddPathCurveI(GpPath *path, GDIPCONST GpPoint *points, INT count)
436 {
437 TRACE("(%p, %p, %d)\n", path, points, count);
438
439 if(!path || !points || count <= 1)
440 return InvalidParameter;
441
442 return GdipAddPathCurve2I(path, points, count, 1.0);
443 }
444
445 GpStatus WINGDIPAPI GdipAddPathCurve2(GpPath *path, GDIPCONST GpPointF *points, INT count,
446 REAL tension)
447 {
448 INT i, len_pt = count*3-2;
449 GpPointF *pt;
450 REAL x1, x2, y1, y2;
451 GpStatus stat;
452
453 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
454
455 if(!path || !points || count <= 1)
456 return InvalidParameter;
457
458 pt = GdipAlloc(len_pt * sizeof(GpPointF));
459 if(!pt)
460 return OutOfMemory;
461
462 tension = tension * TENSION_CONST;
463
464 calc_curve_bezier_endp(points[0].X, points[0].Y, points[1].X, points[1].Y,
465 tension, &x1, &y1);
466
467 pt[0].X = points[0].X;
468 pt[0].Y = points[0].Y;
469 pt[1].X = x1;
470 pt[1].Y = y1;
471
472 for(i = 0; i < count-2; i++){
473 calc_curve_bezier(&(points[i]), tension, &x1, &y1, &x2, &y2);
474
475 pt[3*i+2].X = x1;
476 pt[3*i+2].Y = y1;
477 pt[3*i+3].X = points[i+1].X;
478 pt[3*i+3].Y = points[i+1].Y;
479 pt[3*i+4].X = x2;
480 pt[3*i+4].Y = y2;
481 }
482
483 calc_curve_bezier_endp(points[count-1].X, points[count-1].Y,
484 points[count-2].X, points[count-2].Y, tension, &x1, &y1);
485
486 pt[len_pt-2].X = x1;
487 pt[len_pt-2].Y = y1;
488 pt[len_pt-1].X = points[count-1].X;
489 pt[len_pt-1].Y = points[count-1].Y;
490
491 stat = GdipAddPathBeziers(path, pt, len_pt);
492
493 GdipFree(pt);
494
495 return stat;
496 }
497
498 GpStatus WINGDIPAPI GdipAddPathCurve2I(GpPath *path, GDIPCONST GpPoint *points,
499 INT count, REAL tension)
500 {
501 GpPointF *ptf;
502 INT i;
503 GpStatus stat;
504
505 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
506
507 if(!path || !points || count <= 1)
508 return InvalidParameter;
509
510 ptf = GdipAlloc(sizeof(GpPointF)*count);
511 if(!ptf)
512 return OutOfMemory;
513
514 for(i = 0; i < count; i++){
515 ptf[i].X = (REAL)points[i].X;
516 ptf[i].Y = (REAL)points[i].Y;
517 }
518
519 stat = GdipAddPathCurve2(path, ptf, count, tension);
520
521 GdipFree(ptf);
522
523 return stat;
524 }
525
526 GpStatus WINGDIPAPI GdipAddPathCurve3(GpPath *path, GDIPCONST GpPointF *points,
527 INT count, INT offset, INT nseg, REAL tension)
528 {
529 TRACE("(%p, %p, %d, %d, %d, %.2f)\n", path, points, count, offset, nseg, tension);
530
531 if(!path || !points || offset + 1 >= count || count - offset < nseg + 1)
532 return InvalidParameter;
533
534 return GdipAddPathCurve2(path, &points[offset], nseg + 1, tension);
535 }
536
537 GpStatus WINGDIPAPI GdipAddPathCurve3I(GpPath *path, GDIPCONST GpPoint *points,
538 INT count, INT offset, INT nseg, REAL tension)
539 {
540 TRACE("(%p, %p, %d, %d, %d, %.2f)\n", path, points, count, offset, nseg, tension);
541
542 if(!path || !points || offset + 1 >= count || count - offset < nseg + 1)
543 return InvalidParameter;
544
545 return GdipAddPathCurve2I(path, &points[offset], nseg + 1, tension);
546 }
547
548 GpStatus WINGDIPAPI GdipAddPathEllipse(GpPath *path, REAL x, REAL y, REAL width,
549 REAL height)
550 {
551 INT old_count, numpts;
552
553 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
554
555 if(!path)
556 return InvalidParameter;
557
558 if(!lengthen_path(path, MAX_ARC_PTS))
559 return OutOfMemory;
560
561 old_count = path->pathdata.Count;
562 if((numpts = arc2polybezier(&path->pathdata.Points[old_count], x, y, width,
563 height, 0.0, 360.0)) != MAX_ARC_PTS){
564 ERR("expected %d points but got %d\n", MAX_ARC_PTS, numpts);
565 return GenericError;
566 }
567
568 memset(&path->pathdata.Types[old_count + 1], PathPointTypeBezier,
569 MAX_ARC_PTS - 1);
570
571 /* An ellipse is an intrinsic figure (always is its own subpath). */
572 path->pathdata.Types[old_count] = PathPointTypeStart;
573 path->pathdata.Types[old_count + MAX_ARC_PTS - 1] |= PathPointTypeCloseSubpath;
574 path->newfigure = TRUE;
575 path->pathdata.Count += MAX_ARC_PTS;
576
577 return Ok;
578 }
579
580 GpStatus WINGDIPAPI GdipAddPathEllipseI(GpPath *path, INT x, INT y, INT width,
581 INT height)
582 {
583 TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
584
585 return GdipAddPathEllipse(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
586 }
587
588 GpStatus WINGDIPAPI GdipAddPathLine2(GpPath *path, GDIPCONST GpPointF *points,
589 INT count)
590 {
591 INT i, old_count;
592
593 TRACE("(%p, %p, %d)\n", path, points, count);
594
595 if(!path || !points)
596 return InvalidParameter;
597
598 if(!lengthen_path(path, count))
599 return OutOfMemory;
600
601 old_count = path->pathdata.Count;
602
603 for(i = 0; i < count; i++){
604 path->pathdata.Points[old_count + i].X = points[i].X;
605 path->pathdata.Points[old_count + i].Y = points[i].Y;
606 path->pathdata.Types[old_count + i] = PathPointTypeLine;
607 }
608
609 if(path->newfigure){
610 path->pathdata.Types[old_count] = PathPointTypeStart;
611 path->newfigure = FALSE;
612 }
613
614 path->pathdata.Count += count;
615
616 return Ok;
617 }
618
619 GpStatus WINGDIPAPI GdipAddPathLine2I(GpPath *path, GDIPCONST GpPoint *points, INT count)
620 {
621 GpPointF *pointsF;
622 INT i;
623 GpStatus stat;
624
625 TRACE("(%p, %p, %d)\n", path, points, count);
626
627 if(count <= 0)
628 return InvalidParameter;
629
630 pointsF = GdipAlloc(sizeof(GpPointF) * count);
631 if(!pointsF) return OutOfMemory;
632
633 for(i = 0;i < count; i++){
634 pointsF[i].X = (REAL)points[i].X;
635 pointsF[i].Y = (REAL)points[i].Y;
636 }
637
638 stat = GdipAddPathLine2(path, pointsF, count);
639
640 GdipFree(pointsF);
641
642 return stat;
643 }
644
645 GpStatus WINGDIPAPI GdipAddPathLine(GpPath *path, REAL x1, REAL y1, REAL x2, REAL y2)
646 {
647 INT old_count;
648
649 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x1, y1, x2, y2);
650
651 if(!path)
652 return InvalidParameter;
653
654 if(!lengthen_path(path, 2))
655 return OutOfMemory;
656
657 old_count = path->pathdata.Count;
658
659 path->pathdata.Points[old_count].X = x1;
660 path->pathdata.Points[old_count].Y = y1;
661 path->pathdata.Points[old_count + 1].X = x2;
662 path->pathdata.Points[old_count + 1].Y = y2;
663
664 path->pathdata.Types[old_count] =
665 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
666 path->pathdata.Types[old_count + 1] = PathPointTypeLine;
667
668 path->newfigure = FALSE;
669 path->pathdata.Count += 2;
670
671 return Ok;
672 }
673
674 GpStatus WINGDIPAPI GdipAddPathLineI(GpPath *path, INT x1, INT y1, INT x2, INT y2)
675 {
676 TRACE("(%p, %d, %d, %d, %d)\n", path, x1, y1, x2, y2);
677
678 return GdipAddPathLine(path, (REAL)x1, (REAL)y1, (REAL)x2, (REAL)y2);
679 }
680
681 GpStatus WINGDIPAPI GdipAddPathPath(GpPath *path, GDIPCONST GpPath* addingPath,
682 BOOL connect)
683 {
684 INT old_count, count;
685
686 TRACE("(%p, %p, %d)\n", path, addingPath, connect);
687
688 if(!path || !addingPath)
689 return InvalidParameter;
690
691 old_count = path->pathdata.Count;
692 count = addingPath->pathdata.Count;
693
694 if(!lengthen_path(path, count))
695 return OutOfMemory;
696
697 memcpy(&path->pathdata.Points[old_count], addingPath->pathdata.Points,
698 count * sizeof(GpPointF));
699 memcpy(&path->pathdata.Types[old_count], addingPath->pathdata.Types, count);
700
701 if(path->newfigure || !connect)
702 path->pathdata.Types[old_count] = PathPointTypeStart;
703 else
704 path->pathdata.Types[old_count] = PathPointTypeLine;
705
706 path->newfigure = FALSE;
707 path->pathdata.Count += count;
708
709 return Ok;
710 }
711
712 GpStatus WINGDIPAPI GdipAddPathPie(GpPath *path, REAL x, REAL y, REAL width, REAL height,
713 REAL startAngle, REAL sweepAngle)
714 {
715 GpPointF *ptf;
716 GpStatus status;
717 INT i, count;
718
719 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
720 path, x, y, width, height, startAngle, sweepAngle);
721
722 if(!path)
723 return InvalidParameter;
724
725 /* on zero width/height only start point added */
726 if(width <= 1e-7 || height <= 1e-7){
727 if(!lengthen_path(path, 1))
728 return OutOfMemory;
729 path->pathdata.Points[0].X = x + width / 2.0;
730 path->pathdata.Points[0].Y = y + height / 2.0;
731 path->pathdata.Types[0] = PathPointTypeStart | PathPointTypeCloseSubpath;
732 path->pathdata.Count = 1;
733 return InvalidParameter;
734 }
735
736 count = arc2polybezier(NULL, x, y, width, height, startAngle, sweepAngle);
737
738 if(count == 0)
739 return Ok;
740
741 ptf = GdipAlloc(sizeof(GpPointF)*count);
742 if(!ptf)
743 return OutOfMemory;
744
745 arc2polybezier(ptf, x, y, width, height, startAngle, sweepAngle);
746
747 status = GdipAddPathLine(path, x + width/2, y + height/2, ptf[0].X, ptf[0].Y);
748 if(status != Ok){
749 GdipFree(ptf);
750 return status;
751 }
752 /* one spline is already added as a line endpoint */
753 if(!lengthen_path(path, count - 1)){
754 GdipFree(ptf);
755 return OutOfMemory;
756 }
757
758 memcpy(&(path->pathdata.Points[path->pathdata.Count]), &(ptf[1]),sizeof(GpPointF)*(count-1));
759 for(i = 0; i < count-1; i++)
760 path->pathdata.Types[path->pathdata.Count+i] = PathPointTypeBezier;
761
762 path->pathdata.Count += count-1;
763
764 GdipClosePathFigure(path);
765
766 GdipFree(ptf);
767
768 return status;
769 }
770
771 GpStatus WINGDIPAPI GdipAddPathPieI(GpPath *path, INT x, INT y, INT width, INT height,
772 REAL startAngle, REAL sweepAngle)
773 {
774 TRACE("(%p, %d, %d, %d, %d, %.2f, %.2f)\n",
775 path, x, y, width, height, startAngle, sweepAngle);
776
777 return GdipAddPathPie(path, (REAL)x, (REAL)y, (REAL)width, (REAL)height, startAngle, sweepAngle);
778 }
779
780 GpStatus WINGDIPAPI GdipAddPathPolygon(GpPath *path, GDIPCONST GpPointF *points, INT count)
781 {
782 INT old_count;
783
784 TRACE("(%p, %p, %d)\n", path, points, count);
785
786 if(!path || !points || count < 3)
787 return InvalidParameter;
788
789 if(!lengthen_path(path, count))
790 return OutOfMemory;
791
792 old_count = path->pathdata.Count;
793
794 memcpy(&path->pathdata.Points[old_count], points, count*sizeof(GpPointF));
795 memset(&path->pathdata.Types[old_count + 1], PathPointTypeLine, count - 1);
796
797 /* A polygon is an intrinsic figure */
798 path->pathdata.Types[old_count] = PathPointTypeStart;
799 path->pathdata.Types[old_count + count - 1] |= PathPointTypeCloseSubpath;
800 path->newfigure = TRUE;
801 path->pathdata.Count += count;
802
803 return Ok;
804 }
805
806 GpStatus WINGDIPAPI GdipAddPathPolygonI(GpPath *path, GDIPCONST GpPoint *points, INT count)
807 {
808 GpPointF *ptf;
809 GpStatus status;
810 INT i;
811
812 TRACE("(%p, %p, %d)\n", path, points, count);
813
814 if(!points || count < 3)
815 return InvalidParameter;
816
817 ptf = GdipAlloc(sizeof(GpPointF) * count);
818 if(!ptf)
819 return OutOfMemory;
820
821 for(i = 0; i < count; i++){
822 ptf[i].X = (REAL)points[i].X;
823 ptf[i].Y = (REAL)points[i].Y;
824 }
825
826 status = GdipAddPathPolygon(path, ptf, count);
827
828 GdipFree(ptf);
829
830 return status;
831 }
832
833 static float fromfixedpoint(const FIXED v)
834 {
835 float f = ((float)v.fract) / (1<<(sizeof(v.fract)*8));
836 f += v.value;
837 return f;
838 }
839
840 struct format_string_args
841 {
842 GpPath *path;
843 UINT maxY;
844 };
845
846 static GpStatus format_string_callback(HDC dc,
847 GDIPCONST WCHAR *string, INT index, INT length, GDIPCONST GpFont *font,
848 GDIPCONST RectF *rect, GDIPCONST GpStringFormat *format,
849 INT lineno, const RectF *bounds, INT *underlined_indexes,
850 INT underlined_index_count, void *priv)
851 {
852 static const MAT2 identity = { {0,1}, {0,0}, {0,0}, {0,1} };
853 struct format_string_args *args = priv;
854 GpPath *path = args->path;
855 GpStatus status = Ok;
856 float x = bounds->X;
857 float y = bounds->Y;
858 int i;
859
860 if (underlined_index_count)
861 FIXME("hotkey underlines not drawn yet\n");
862
863 for (i = index; i < length; ++i)
864 {
865 GLYPHMETRICS gm;
866 TTPOLYGONHEADER *ph = NULL;
867 char *start;
868 DWORD len, ofs = 0;
869 UINT bb_end;
870 len = GetGlyphOutlineW(dc, string[i], GGO_BEZIER, &gm, 0, NULL, &identity);
871 if (len == GDI_ERROR)
872 {
873 status = GenericError;
874 break;
875 }
876 ph = GdipAlloc(len);
877 start = (char *)ph;
878 if (!ph || !lengthen_path(path, len / sizeof(POINTFX)))
879 {
880 status = OutOfMemory;
881 break;
882 }
883 GetGlyphOutlineW(dc, string[i], GGO_BEZIER, &gm, len, start, &identity);
884 bb_end = gm.gmBlackBoxY + gm.gmptGlyphOrigin.y;
885 if (bb_end + y > args->maxY)
886 args->maxY = bb_end + y;
887
888 ofs = 0;
889 while (ofs < len)
890 {
891 DWORD ofs_start = ofs;
892 ph = (TTPOLYGONHEADER*)&start[ofs];
893 path->pathdata.Types[path->pathdata.Count] = PathPointTypeStart;
894 path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(ph->pfxStart.x);
895 path->pathdata.Points[path->pathdata.Count++].Y = y + bb_end - fromfixedpoint(ph->pfxStart.y);
896 TRACE("Starting at count %i with pos %f, %f)\n", path->pathdata.Count, x, y);
897 ofs += sizeof(*ph);
898 while (ofs - ofs_start < ph->cb)
899 {
900 TTPOLYCURVE *curve = (TTPOLYCURVE*)&start[ofs];
901 int j;
902 ofs += sizeof(TTPOLYCURVE) + (curve->cpfx - 1) * sizeof(POINTFX);
903
904 switch (curve->wType)
905 {
906 case TT_PRIM_LINE:
907 for (j = 0; j < curve->cpfx; ++j)
908 {
909 path->pathdata.Types[path->pathdata.Count] = PathPointTypeLine;
910 path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(curve->apfx[j].x);
911 path->pathdata.Points[path->pathdata.Count++].Y = y + bb_end - fromfixedpoint(curve->apfx[j].y);
912 }
913 break;
914 case TT_PRIM_CSPLINE:
915 for (j = 0; j < curve->cpfx; ++j)
916 {
917 path->pathdata.Types[path->pathdata.Count] = PathPointTypeBezier;
918 path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(curve->apfx[j].x);
919 path->pathdata.Points[path->pathdata.Count++].Y = y + bb_end - fromfixedpoint(curve->apfx[j].y);
920 }
921 break;
922 default:
923 ERR("Unhandled type: %u\n", curve->wType);
924 status = GenericError;
925 }
926 }
927 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
928 }
929 path->newfigure = TRUE;
930 x += gm.gmCellIncX;
931 y += gm.gmCellIncY;
932
933 GdipFree(ph);
934 if (status != Ok)
935 break;
936 }
937
938 return status;
939 }
940
941 GpStatus WINGDIPAPI GdipAddPathString(GpPath* path, GDIPCONST WCHAR* string, INT length, GDIPCONST GpFontFamily* family, INT style, REAL emSize, GDIPCONST RectF* layoutRect, GDIPCONST GpStringFormat* format)
942 {
943 GpFont *font;
944 GpStatus status;
945 LOGFONTW lfw;
946 HANDLE hfont;
947 HDC dc;
948 GpPath *backup;
949 struct format_string_args args;
950 int i;
951
952 FIXME("(%p, %s, %d, %p, %d, %f, %p, %p): stub\n", path, debugstr_w(string), length, family, style, emSize, layoutRect, format);
953 if (!path || !string || !family || !emSize || !layoutRect || !format)
954 return InvalidParameter;
955
956 status = GdipCreateFont(family, emSize, style, UnitPixel, &font);
957 if (status != Ok)
958 return status;
959
960 status = GdipGetLogFontW((GpFont *)font, NULL, &lfw);
961 if (status != Ok) return status;
962 hfont = CreateFontIndirectW(&lfw);
963 if (!hfont)
964 {
965 WARN("Failed to create font\n");
966 return GenericError;
967 }
968
969 if ((status = GdipClonePath(path, &backup)) != Ok)
970 {
971 DeleteObject(hfont);
972 return status;
973 }
974
975 dc = CreateCompatibleDC(0);
976 SelectObject(dc, hfont);
977
978 args.path = path;
979 args.maxY = 0;
980 status = gdip_format_string(dc, string, length, NULL, layoutRect, format, format_string_callback, &args);
981
982 DeleteDC(dc);
983 DeleteObject(hfont);
984
985 if (status != Ok) /* free backup */
986 {
987 GdipFree(path->pathdata.Points);
988 GdipFree(path->pathdata.Types);
989 *path = *backup;
990 GdipFree(backup);
991 return status;
992 }
993 if (format && format->vertalign == StringAlignmentCenter && layoutRect->Y + args.maxY < layoutRect->Height)
994 {
995 float inc = layoutRect->Height - args.maxY - layoutRect->Y;
996 inc /= 2;
997 for (i = backup->pathdata.Count; i < path->pathdata.Count; ++i)
998 path->pathdata.Points[i].Y += inc;
999 } else if (format && format->vertalign == StringAlignmentFar) {
1000 float inc = layoutRect->Height - args.maxY - layoutRect->Y;
1001 for (i = backup->pathdata.Count; i < path->pathdata.Count; ++i)
1002 path->pathdata.Points[i].Y += inc;
1003 }
1004 GdipDeletePath(backup);
1005 return status;
1006 }
1007
1008 GpStatus WINGDIPAPI GdipAddPathStringI(GpPath* path, GDIPCONST WCHAR* string, INT length, GDIPCONST GpFontFamily* family, INT style, REAL emSize, GDIPCONST Rect* layoutRect, GDIPCONST GpStringFormat* format)
1009 {
1010 if (layoutRect)
1011 {
1012 RectF layoutRectF = {
1013 (REAL)layoutRect->X,
1014 (REAL)layoutRect->Y,
1015 (REAL)layoutRect->Width,
1016 (REAL)layoutRect->Height
1017 };
1018 return GdipAddPathString(path, string, length, family, style, emSize, &layoutRectF, format);
1019 }
1020 return InvalidParameter;
1021 }
1022
1023 GpStatus WINGDIPAPI GdipClonePath(GpPath* path, GpPath **clone)
1024 {
1025 TRACE("(%p, %p)\n", path, clone);
1026
1027 if(!path || !clone)
1028 return InvalidParameter;
1029
1030 *clone = GdipAlloc(sizeof(GpPath));
1031 if(!*clone) return OutOfMemory;
1032
1033 **clone = *path;
1034
1035 (*clone)->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
1036 (*clone)->pathdata.Types = GdipAlloc(path->datalen);
1037 if(!(*clone)->pathdata.Points || !(*clone)->pathdata.Types){
1038 GdipFree(*clone);
1039 GdipFree((*clone)->pathdata.Points);
1040 GdipFree((*clone)->pathdata.Types);
1041 return OutOfMemory;
1042 }
1043
1044 memcpy((*clone)->pathdata.Points, path->pathdata.Points,
1045 path->datalen * sizeof(PointF));
1046 memcpy((*clone)->pathdata.Types, path->pathdata.Types, path->datalen);
1047
1048 return Ok;
1049 }
1050
1051 GpStatus WINGDIPAPI GdipClosePathFigure(GpPath* path)
1052 {
1053 TRACE("(%p)\n", path);
1054
1055 if(!path)
1056 return InvalidParameter;
1057
1058 if(path->pathdata.Count > 0){
1059 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
1060 path->newfigure = TRUE;
1061 }
1062
1063 return Ok;
1064 }
1065
1066 GpStatus WINGDIPAPI GdipClosePathFigures(GpPath* path)
1067 {
1068 INT i;
1069
1070 TRACE("(%p)\n", path);
1071
1072 if(!path)
1073 return InvalidParameter;
1074
1075 for(i = 1; i < path->pathdata.Count; i++){
1076 if(path->pathdata.Types[i] == PathPointTypeStart)
1077 path->pathdata.Types[i-1] |= PathPointTypeCloseSubpath;
1078 }
1079
1080 path->newfigure = TRUE;
1081
1082 return Ok;
1083 }
1084
1085 GpStatus WINGDIPAPI GdipCreatePath(GpFillMode fill, GpPath **path)
1086 {
1087 TRACE("(%d, %p)\n", fill, path);
1088
1089 if(!path)
1090 return InvalidParameter;
1091
1092 *path = GdipAlloc(sizeof(GpPath));
1093 if(!*path) return OutOfMemory;
1094
1095 (*path)->fill = fill;
1096 (*path)->newfigure = TRUE;
1097
1098 return Ok;
1099 }
1100
1101 GpStatus WINGDIPAPI GdipCreatePath2(GDIPCONST GpPointF* points,
1102 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
1103 {
1104 TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
1105
1106 if(!path)
1107 return InvalidParameter;
1108
1109 *path = GdipAlloc(sizeof(GpPath));
1110 if(!*path) return OutOfMemory;
1111
1112 (*path)->pathdata.Points = GdipAlloc(count * sizeof(PointF));
1113 (*path)->pathdata.Types = GdipAlloc(count);
1114
1115 if(!(*path)->pathdata.Points || !(*path)->pathdata.Types){
1116 GdipFree((*path)->pathdata.Points);
1117 GdipFree((*path)->pathdata.Types);
1118 GdipFree(*path);
1119 return OutOfMemory;
1120 }
1121
1122 memcpy((*path)->pathdata.Points, points, count * sizeof(PointF));
1123 memcpy((*path)->pathdata.Types, types, count);
1124 (*path)->pathdata.Count = count;
1125 (*path)->datalen = count;
1126
1127 (*path)->fill = fill;
1128 (*path)->newfigure = TRUE;
1129
1130 return Ok;
1131 }
1132
1133 GpStatus WINGDIPAPI GdipCreatePath2I(GDIPCONST GpPoint* points,
1134 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
1135 {
1136 GpPointF *ptF;
1137 GpStatus ret;
1138 INT i;
1139
1140 TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
1141
1142 ptF = GdipAlloc(sizeof(GpPointF)*count);
1143
1144 for(i = 0;i < count; i++){
1145 ptF[i].X = (REAL)points[i].X;
1146 ptF[i].Y = (REAL)points[i].Y;
1147 }
1148
1149 ret = GdipCreatePath2(ptF, types, count, fill, path);
1150
1151 GdipFree(ptF);
1152
1153 return ret;
1154 }
1155
1156 GpStatus WINGDIPAPI GdipDeletePath(GpPath *path)
1157 {
1158 TRACE("(%p)\n", path);
1159
1160 if(!path)
1161 return InvalidParameter;
1162
1163 GdipFree(path->pathdata.Points);
1164 GdipFree(path->pathdata.Types);
1165 GdipFree(path);
1166
1167 return Ok;
1168 }
1169
1170 GpStatus WINGDIPAPI GdipFlattenPath(GpPath *path, GpMatrix* matrix, REAL flatness)
1171 {
1172 path_list_node_t *list, *node;
1173 GpPointF pt;
1174 INT i = 1;
1175 INT startidx = 0;
1176
1177 TRACE("(%p, %p, %.2f)\n", path, matrix, flatness);
1178
1179 if(!path)
1180 return InvalidParameter;
1181
1182 if(matrix){
1183 WARN("transformation not supported yet!\n");
1184 return NotImplemented;
1185 }
1186
1187 if(path->pathdata.Count == 0)
1188 return Ok;
1189
1190 pt = path->pathdata.Points[0];
1191 if(!init_path_list(&list, pt.X, pt.Y))
1192 return OutOfMemory;
1193
1194 node = list;
1195
1196 while(i < path->pathdata.Count){
1197
1198 BYTE type = path->pathdata.Types[i] & PathPointTypePathTypeMask;
1199 path_list_node_t *start;
1200
1201 pt = path->pathdata.Points[i];
1202
1203 /* save last start point index */
1204 if(type == PathPointTypeStart)
1205 startidx = i;
1206
1207 /* always add line points and start points */
1208 if((type == PathPointTypeStart) || (type == PathPointTypeLine)){
1209 if(!add_path_list_node(node, pt.X, pt.Y, path->pathdata.Types[i]))
1210 goto memout;
1211
1212 node = node->next;
1213 ++i;
1214 continue;
1215 }
1216
1217 /* Bezier curve */
1218
1219 /* test for closed figure */
1220 if(path->pathdata.Types[i+1] & PathPointTypeCloseSubpath){
1221 pt = path->pathdata.Points[startidx];
1222 ++i;
1223 }
1224 else
1225 {
1226 i += 2;
1227 pt = path->pathdata.Points[i];
1228 };
1229
1230 start = node;
1231 /* add Bezier end point */
1232 type = (path->pathdata.Types[i] & ~PathPointTypePathTypeMask) | PathPointTypeLine;
1233 if(!add_path_list_node(node, pt.X, pt.Y, type))
1234 goto memout;
1235 node = node->next;
1236
1237 /* flatten curve */
1238 if(!flatten_bezier(start, path->pathdata.Points[i-2].X, path->pathdata.Points[i-2].Y,
1239 path->pathdata.Points[i-1].X, path->pathdata.Points[i-1].Y,
1240 node, flatness))
1241 goto memout;
1242
1243 ++i;
1244 }/* while */
1245
1246 /* store path data back */
1247 i = path_list_count(list);
1248 if(!lengthen_path(path, i))
1249 goto memout;
1250 path->pathdata.Count = i;
1251
1252 node = list;
1253 for(i = 0; i < path->pathdata.Count; i++){
1254 path->pathdata.Points[i] = node->pt;
1255 path->pathdata.Types[i] = node->type;
1256 node = node->next;
1257 }
1258
1259 free_path_list(list);
1260 return Ok;
1261
1262 memout:
1263 free_path_list(list);
1264 return OutOfMemory;
1265 }
1266
1267 GpStatus WINGDIPAPI GdipGetPathData(GpPath *path, GpPathData* pathData)
1268 {
1269 TRACE("(%p, %p)\n", path, pathData);
1270
1271 if(!path || !pathData)
1272 return InvalidParameter;
1273
1274 /* Only copy data. pathData allocation/freeing controlled by wrapper class.
1275 Assumed that pathData is enough wide to get all data - controlled by wrapper too. */
1276 memcpy(pathData->Points, path->pathdata.Points, sizeof(PointF) * pathData->Count);
1277 memcpy(pathData->Types , path->pathdata.Types , pathData->Count);
1278
1279 return Ok;
1280 }
1281
1282 GpStatus WINGDIPAPI GdipGetPathFillMode(GpPath *path, GpFillMode *fillmode)
1283 {
1284 TRACE("(%p, %p)\n", path, fillmode);
1285
1286 if(!path || !fillmode)
1287 return InvalidParameter;
1288
1289 *fillmode = path->fill;
1290
1291 return Ok;
1292 }
1293
1294 GpStatus WINGDIPAPI GdipGetPathLastPoint(GpPath* path, GpPointF* lastPoint)
1295 {
1296 INT count;
1297
1298 TRACE("(%p, %p)\n", path, lastPoint);
1299
1300 if(!path || !lastPoint)
1301 return InvalidParameter;
1302
1303 count = path->pathdata.Count;
1304 if(count > 0)
1305 *lastPoint = path->pathdata.Points[count-1];
1306
1307 return Ok;
1308 }
1309
1310 GpStatus WINGDIPAPI GdipGetPathPoints(GpPath *path, GpPointF* points, INT count)
1311 {
1312 TRACE("(%p, %p, %d)\n", path, points, count);
1313
1314 if(!path)
1315 return InvalidParameter;
1316
1317 if(count < path->pathdata.Count)
1318 return InsufficientBuffer;
1319
1320 memcpy(points, path->pathdata.Points, path->pathdata.Count * sizeof(GpPointF));
1321
1322 return Ok;
1323 }
1324
1325 GpStatus WINGDIPAPI GdipGetPathPointsI(GpPath *path, GpPoint* points, INT count)
1326 {
1327 GpStatus ret;
1328 GpPointF *ptf;
1329 INT i;
1330
1331 TRACE("(%p, %p, %d)\n", path, points, count);
1332
1333 if(count <= 0)
1334 return InvalidParameter;
1335
1336 ptf = GdipAlloc(sizeof(GpPointF)*count);
1337 if(!ptf) return OutOfMemory;
1338
1339 ret = GdipGetPathPoints(path,ptf,count);
1340 if(ret == Ok)
1341 for(i = 0;i < count;i++){
1342 points[i].X = roundr(ptf[i].X);
1343 points[i].Y = roundr(ptf[i].Y);
1344 };
1345 GdipFree(ptf);
1346
1347 return ret;
1348 }
1349
1350 GpStatus WINGDIPAPI GdipGetPathTypes(GpPath *path, BYTE* types, INT count)
1351 {
1352 TRACE("(%p, %p, %d)\n", path, types, count);
1353
1354 if(!path)
1355 return InvalidParameter;
1356
1357 if(count < path->pathdata.Count)
1358 return InsufficientBuffer;
1359
1360 memcpy(types, path->pathdata.Types, path->pathdata.Count);
1361
1362 return Ok;
1363 }
1364
1365 /* Windows expands the bounding box to the maximum possible bounding box
1366 * for a given pen. For example, if a line join can extend past the point
1367 * it's joining by x units, the bounding box is extended by x units in every
1368 * direction (even though this is too conservative for most cases). */
1369 GpStatus WINGDIPAPI GdipGetPathWorldBounds(GpPath* path, GpRectF* bounds,
1370 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1371 {
1372 GpPointF * points, temp_pts[4];
1373 INT count, i;
1374 REAL path_width = 1.0, width, height, temp, low_x, low_y, high_x, high_y;
1375
1376 TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1377
1378 /* Matrix and pen can be null. */
1379 if(!path || !bounds)
1380 return InvalidParameter;
1381
1382 /* If path is empty just return. */
1383 count = path->pathdata.Count;
1384 if(count == 0){
1385 bounds->X = bounds->Y = bounds->Width = bounds->Height = 0.0;
1386 return Ok;
1387 }
1388
1389 points = path->pathdata.Points;
1390
1391 low_x = high_x = points[0].X;
1392 low_y = high_y = points[0].Y;
1393
1394 for(i = 1; i < count; i++){
1395 low_x = min(low_x, points[i].X);
1396 low_y = min(low_y, points[i].Y);
1397 high_x = max(high_x, points[i].X);
1398 high_y = max(high_y, points[i].Y);
1399 }
1400
1401 width = high_x - low_x;
1402 height = high_y - low_y;
1403
1404 /* This looks unusual but it's the only way I can imitate windows. */
1405 if(matrix){
1406 temp_pts[0].X = low_x;
1407 temp_pts[0].Y = low_y;
1408 temp_pts[1].X = low_x;
1409 temp_pts[1].Y = high_y;
1410 temp_pts[2].X = high_x;
1411 temp_pts[2].Y = high_y;
1412 temp_pts[3].X = high_x;
1413 temp_pts[3].Y = low_y;
1414
1415 GdipTransformMatrixPoints((GpMatrix*)matrix, temp_pts, 4);
1416 low_x = temp_pts[0].X;
1417 low_y = temp_pts[0].Y;
1418
1419 for(i = 1; i < 4; i++){
1420 low_x = min(low_x, temp_pts[i].X);
1421 low_y = min(low_y, temp_pts[i].Y);
1422 }
1423
1424 temp = width;
1425 width = height * fabs(matrix->matrix[2]) + width * fabs(matrix->matrix[0]);
1426 height = height * fabs(matrix->matrix[3]) + temp * fabs(matrix->matrix[1]);
1427 }
1428
1429 if(pen){
1430 path_width = pen->width / 2.0;
1431
1432 if(count > 2)
1433 path_width = max(path_width, pen->width * pen->miterlimit / 2.0);
1434 /* FIXME: this should probably also check for the startcap */
1435 if(pen->endcap & LineCapNoAnchor)
1436 path_width = max(path_width, pen->width * 2.2);
1437
1438 low_x -= path_width;
1439 low_y -= path_width;
1440 width += 2.0 * path_width;
1441 height += 2.0 * path_width;
1442 }
1443
1444 bounds->X = low_x;
1445 bounds->Y = low_y;
1446 bounds->Width = width;
1447 bounds->Height = height;
1448
1449 return Ok;
1450 }
1451
1452 GpStatus WINGDIPAPI GdipGetPathWorldBoundsI(GpPath* path, GpRect* bounds,
1453 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1454 {
1455 GpStatus ret;
1456 GpRectF boundsF;
1457
1458 TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1459
1460 ret = GdipGetPathWorldBounds(path,&boundsF,matrix,pen);
1461
1462 if(ret == Ok){
1463 bounds->X = roundr(boundsF.X);
1464 bounds->Y = roundr(boundsF.Y);
1465 bounds->Width = roundr(boundsF.Width);
1466 bounds->Height = roundr(boundsF.Height);
1467 }
1468
1469 return ret;
1470 }
1471
1472 GpStatus WINGDIPAPI GdipGetPointCount(GpPath *path, INT *count)
1473 {
1474 TRACE("(%p, %p)\n", path, count);
1475
1476 if(!path)
1477 return InvalidParameter;
1478
1479 *count = path->pathdata.Count;
1480
1481 return Ok;
1482 }
1483
1484 GpStatus WINGDIPAPI GdipReversePath(GpPath* path)
1485 {
1486 INT i, count;
1487 INT start = 0; /* position in reversed path */
1488 GpPathData revpath;
1489
1490 TRACE("(%p)\n", path);
1491
1492 if(!path)
1493 return InvalidParameter;
1494
1495 count = path->pathdata.Count;
1496
1497 if(count == 0) return Ok;
1498
1499 revpath.Points = GdipAlloc(sizeof(GpPointF)*count);
1500 revpath.Types = GdipAlloc(sizeof(BYTE)*count);
1501 revpath.Count = count;
1502 if(!revpath.Points || !revpath.Types){
1503 GdipFree(revpath.Points);
1504 GdipFree(revpath.Types);
1505 return OutOfMemory;
1506 }
1507
1508 for(i = 0; i < count; i++){
1509
1510 /* find next start point */
1511 if(path->pathdata.Types[count-i-1] == PathPointTypeStart){
1512 INT j;
1513 for(j = start; j <= i; j++){
1514 revpath.Points[j] = path->pathdata.Points[count-j-1];
1515 revpath.Types[j] = path->pathdata.Types[count-j-1];
1516 }
1517 /* mark start point */
1518 revpath.Types[start] = PathPointTypeStart;
1519 /* set 'figure' endpoint type */
1520 if(i-start > 1){
1521 revpath.Types[i] = path->pathdata.Types[count-start-1] & ~PathPointTypePathTypeMask;
1522 revpath.Types[i] |= revpath.Types[i-1];
1523 }
1524 else
1525 revpath.Types[i] = path->pathdata.Types[start];
1526
1527 start = i+1;
1528 }
1529 }
1530
1531 memcpy(path->pathdata.Points, revpath.Points, sizeof(GpPointF)*count);
1532 memcpy(path->pathdata.Types, revpath.Types, sizeof(BYTE)*count);
1533
1534 GdipFree(revpath.Points);
1535 GdipFree(revpath.Types);
1536
1537 return Ok;
1538 }
1539
1540 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPointI(GpPath* path, INT x, INT y,
1541 GpPen *pen, GpGraphics *graphics, BOOL *result)
1542 {
1543 TRACE("(%p, %d, %d, %p, %p, %p)\n", path, x, y, pen, graphics, result);
1544
1545 return GdipIsOutlineVisiblePathPoint(path, x, y, pen, graphics, result);
1546 }
1547
1548 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPoint(GpPath* path, REAL x, REAL y,
1549 GpPen *pen, GpGraphics *graphics, BOOL *result)
1550 {
1551 static int calls;
1552
1553 TRACE("(%p,%0.2f,%0.2f,%p,%p,%p)\n", path, x, y, pen, graphics, result);
1554
1555 if(!path || !pen)
1556 return InvalidParameter;
1557
1558 if(!(calls++))
1559 FIXME("not implemented\n");
1560
1561 return NotImplemented;
1562 }
1563
1564 GpStatus WINGDIPAPI GdipIsVisiblePathPointI(GpPath* path, INT x, INT y, GpGraphics *graphics, BOOL *result)
1565 {
1566 TRACE("(%p, %d, %d, %p, %p)\n", path, x, y, graphics, result);
1567
1568 return GdipIsVisiblePathPoint(path, x, y, graphics, result);
1569 }
1570
1571 /*****************************************************************************
1572 * GdipIsVisiblePathPoint [GDIPLUS.@]
1573 */
1574 GpStatus WINGDIPAPI GdipIsVisiblePathPoint(GpPath* path, REAL x, REAL y, GpGraphics *graphics, BOOL *result)
1575 {
1576 GpRegion *region;
1577 HRGN hrgn;
1578 GpStatus status;
1579
1580 if(!path || !result) return InvalidParameter;
1581
1582 status = GdipCreateRegionPath(path, ®ion);
1583 if(status != Ok)
1584 return status;
1585
1586 status = GdipGetRegionHRgn(region, graphics, &hrgn);
1587 if(status != Ok){
1588 GdipDeleteRegion(region);
1589 return status;
1590 }
1591
1592 *result = PtInRegion(hrgn, roundr(x), roundr(y));
1593
1594 DeleteObject(hrgn);
1595 GdipDeleteRegion(region);
1596
1597 return Ok;
1598 }
1599
1600 GpStatus WINGDIPAPI GdipStartPathFigure(GpPath *path)
1601 {
1602 TRACE("(%p)\n", path);
1603
1604 if(!path)
1605 return InvalidParameter;
1606
1607 path->newfigure = TRUE;
1608
1609 return Ok;
1610 }
1611
1612 GpStatus WINGDIPAPI GdipResetPath(GpPath *path)
1613 {
1614 TRACE("(%p)\n", path);
1615
1616 if(!path)
1617 return InvalidParameter;
1618
1619 path->pathdata.Count = 0;
1620 path->newfigure = TRUE;
1621 path->fill = FillModeAlternate;
1622
1623 return Ok;
1624 }
1625
1626 GpStatus WINGDIPAPI GdipSetPathFillMode(GpPath *path, GpFillMode fill)
1627 {
1628 TRACE("(%p, %d)\n", path, fill);
1629
1630 if(!path)
1631 return InvalidParameter;
1632
1633 path->fill = fill;
1634
1635 return Ok;
1636 }
1637
1638 GpStatus WINGDIPAPI GdipTransformPath(GpPath *path, GpMatrix *matrix)
1639 {
1640 TRACE("(%p, %p)\n", path, matrix);
1641
1642 if(!path)
1643 return InvalidParameter;
1644
1645 if(path->pathdata.Count == 0)
1646 return Ok;
1647
1648 return GdipTransformMatrixPoints(matrix, path->pathdata.Points,
1649 path->pathdata.Count);
1650 }
1651
1652 GpStatus WINGDIPAPI GdipWarpPath(GpPath *path, GpMatrix* matrix,
1653 GDIPCONST GpPointF *points, INT count, REAL x, REAL y, REAL width,
1654 REAL height, WarpMode warpmode, REAL flatness)
1655 {
1656 FIXME("(%p,%p,%p,%i,%0.2f,%0.2f,%0.2f,%0.2f,%i,%0.2f)\n", path, matrix,
1657 points, count, x, y, width, height, warpmode, flatness);
1658
1659 return NotImplemented;
1660 }
1661
1662 static void add_bevel_point(const GpPointF *endpoint, const GpPointF *nextpoint,
1663 GpPen *pen, int right_side, path_list_node_t **last_point)
1664 {
1665 REAL segment_dy = nextpoint->Y-endpoint->Y;
1666 REAL segment_dx = nextpoint->X-endpoint->X;
1667 REAL segment_length = sqrtf(segment_dy*segment_dy + segment_dx*segment_dx);
1668 REAL distance = pen->width/2.0;
1669 REAL bevel_dx, bevel_dy;
1670
1671 if (right_side)
1672 {
1673 bevel_dx = -distance * segment_dy / segment_length;
1674 bevel_dy = distance * segment_dx / segment_length;
1675 }
1676 else
1677 {
1678 bevel_dx = distance * segment_dy / segment_length;
1679 bevel_dy = -distance * segment_dx / segment_length;
1680 }
1681
1682 *last_point = add_path_list_node(*last_point, endpoint->X + bevel_dx,
1683 endpoint->Y + bevel_dy, PathPointTypeLine);
1684 }
1685
1686 static void widen_joint(const GpPointF *p1, const GpPointF *p2, const GpPointF *p3,
1687 GpPen* pen, path_list_node_t **last_point)
1688 {
1689 switch (pen->join)
1690 {
1691 default:
1692 case LineJoinBevel:
1693 add_bevel_point(p2, p1, pen, 1, last_point);
1694 add_bevel_point(p2, p3, pen, 0, last_point);
1695 break;
1696 }
1697 }
1698
1699 static void widen_cap(const GpPointF *endpoint, const GpPointF *nextpoint,
1700 GpPen *pen, GpLineCap cap, GpCustomLineCap *custom, int add_first_points,
1701 int add_last_point, path_list_node_t **last_point)
1702 {
1703 switch (cap)
1704 {
1705 default:
1706 case LineCapFlat:
1707 if (add_first_points)
1708 add_bevel_point(endpoint, nextpoint, pen, 1, last_point);
1709 if (add_last_point)
1710 add_bevel_point(endpoint, nextpoint, pen, 0, last_point);
1711 break;
1712 }
1713 }
1714
1715 static void widen_open_figure(GpPath *path, GpPen *pen, int start, int end,
1716 path_list_node_t **last_point)
1717 {
1718 int i;
1719
1720 if (end <= start)
1721 return;
1722
1723 widen_cap(&path->pathdata.Points[start], &path->pathdata.Points[start+1],
1724 pen, pen->startcap, pen->customstart, FALSE, TRUE, last_point);
1725
1726 (*last_point)->type = PathPointTypeStart;
1727
1728 for (i=start+1; i<end; i++)
1729 widen_joint(&path->pathdata.Points[i-1], &path->pathdata.Points[i],
1730 &path->pathdata.Points[i+1], pen, last_point);
1731
1732 widen_cap(&path->pathdata.Points[end], &path->pathdata.Points[end-1],
1733 pen, pen->endcap, pen->customend, TRUE, TRUE, last_point);
1734
1735 for (i=end-1; i>start; i--)
1736 widen_joint(&path->pathdata.Points[i+1], &path->pathdata.Points[i],
1737 &path->pathdata.Points[i-1], pen, last_point);
1738
1739 widen_cap(&path->pathdata.Points[start], &path->pathdata.Points[start+1],
1740 pen, pen->startcap, pen->customstart, TRUE, FALSE, last_point);
1741
1742 (*last_point)->type |= PathPointTypeCloseSubpath;
1743 }
1744
1745 static void widen_closed_figure(GpPath *path, GpPen *pen, int start, int end,
1746 path_list_node_t **last_point)
1747 {
1748 int i;
1749 path_list_node_t *prev_point;
1750
1751 if (end <= start+1)
1752 return;
1753
1754 /* left outline */
1755 prev_point = *last_point;
1756
1757 widen_joint(&path->pathdata.Points[end], &path->pathdata.Points[start],
1758 &path->pathdata.Points[start+1], pen, last_point);
1759
1760 for (i=start+1; i<end; i++)
1761 widen_joint(&path->pathdata.Points[i-1], &path->pathdata.Points[i],
1762 &path->pathdata.Points[i+1], pen, last_point);
1763
1764 widen_joint(&path->pathdata.Points[end-1], &path->pathdata.Points[end],
1765 &path->pathdata.Points[start], pen, last_point);
1766
1767 prev_point->next->type = PathPointTypeStart;
1768 (*last_point)->type |= PathPointTypeCloseSubpath;
1769
1770 /* right outline */
1771 prev_point = *last_point;
1772
1773 widen_joint(&path->pathdata.Points[start], &path->pathdata.Points[end],
1774 &path->pathdata.Points[end-1], pen, last_point);
1775
1776 for (i=end-1; i>start; i--)
1777 widen_joint(&path->pathdata.Points[i+1], &path->pathdata.Points[i],
1778 &path->pathdata.Points[i-1], pen, last_point);
1779
1780 widen_joint(&path->pathdata.Points[start+1], &path->pathdata.Points[start],
1781 &path->pathdata.Points[end], pen, last_point);
1782
1783 prev_point->next->type = PathPointTypeStart;
1784 (*last_point)->type |= PathPointTypeCloseSubpath;
1785 }
1786
1787 GpStatus WINGDIPAPI GdipWidenPath(GpPath *path, GpPen *pen, GpMatrix *matrix,
1788 REAL flatness)
1789 {
1790 GpPath *flat_path=NULL;
1791 GpStatus status;
1792 path_list_node_t *points=NULL, *last_point=NULL;
1793 int i, subpath_start=0, new_length;
1794 BYTE type;
1795
1796 TRACE("(%p,%p,%p,%0.2f)\n", path, pen, matrix, flatness);
1797
1798 if (!path || !pen)
1799 return InvalidParameter;
1800
1801 if (path->pathdata.Count <= 1)
1802 return OutOfMemory;
1803
1804 status = GdipClonePath(path, &flat_path);
1805
1806 if (status == Ok)
1807 status = GdipFlattenPath(flat_path, matrix, flatness);
1808
1809 if (status == Ok && !init_path_list(&points, 314.0, 22.0))
1810 status = OutOfMemory;
1811
1812 if (status == Ok)
1813 {
1814 last_point = points;
1815
1816 if (pen->endcap != LineCapFlat)
1817 FIXME("unimplemented end cap %x\n", pen->endcap);
1818
1819 if (pen->startcap != LineCapFlat)
1820 FIXME("unimplemented start cap %x\n", pen->startcap);
1821
1822 if (pen->dashcap != DashCapFlat)
1823 FIXME("unimplemented dash cap %d\n", pen->dashcap);
1824
1825 if (pen->join != LineJoinBevel)
1826 FIXME("unimplemented line join %d\n", pen->join);
1827
1828 if (pen->dash != DashStyleSolid)
1829 FIXME("unimplemented dash style %d\n", pen->dash);
1830
1831 if (pen->align != PenAlignmentCenter)
1832 FIXME("unimplemented pen alignment %d\n", pen->align);
1833
1834 for (i=0; i < flat_path->pathdata.Count; i++)
1835 {
1836 type = flat_path->pathdata.Types[i];
1837
1838 if ((type&PathPointTypePathTypeMask) == PathPointTypeStart)
1839 subpath_start = i;
1840
1841 if ((type&PathPointTypeCloseSubpath) == PathPointTypeCloseSubpath)
1842 {
1843 widen_closed_figure(flat_path, pen, subpath_start, i, &last_point);
1844 }
1845 else if (i == flat_path->pathdata.Count-1 ||
1846 (flat_path->pathdata.Types[i+1]&PathPointTypePathTypeMask) == PathPointTypeStart)
1847 {
1848 widen_open_figure(flat_path, pen, subpath_start, i, &last_point);
1849 }
1850 }
1851
1852 new_length = path_list_count(points)-1;
1853
1854 if (!lengthen_path(path, new_length))
1855 status = OutOfMemory;
1856 }
1857
1858 if (status == Ok)
1859 {
1860 path->pathdata.Count = new_length;
1861
1862 last_point = points->next;
1863 for (i = 0; i < new_length; i++)
1864 {
1865 path->pathdata.Points[i] = last_point->pt;
1866 path->pathdata.Types[i] = last_point->type;
1867 last_point = last_point->next;
1868 }
1869
1870 path->fill = FillModeWinding;
1871 }
1872
1873 free_path_list(points);
1874
1875 GdipDeletePath(flat_path);
1876
1877 return status;
1878 }
1879
1880 GpStatus WINGDIPAPI GdipAddPathRectangle(GpPath *path, REAL x, REAL y,
1881 REAL width, REAL height)
1882 {
1883 GpPath *backup;
1884 GpPointF ptf[2];
1885 GpStatus retstat;
1886 BOOL old_new;
1887
1888 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
1889
1890 if(!path)
1891 return InvalidParameter;
1892
1893 /* make a backup copy of path data */
1894 if((retstat = GdipClonePath(path, &backup)) != Ok)
1895 return retstat;
1896
1897 /* rectangle should start as new path */
1898 old_new = path->newfigure;
1899 path->newfigure = TRUE;
1900 if((retstat = GdipAddPathLine(path,x,y,x+width,y)) != Ok){
1901 path->newfigure = old_new;
1902 goto fail;
1903 }
1904
1905 ptf[0].X = x+width;
1906 ptf[0].Y = y+height;
1907 ptf[1].X = x;
1908 ptf[1].Y = y+height;
1909
1910 if((retstat = GdipAddPathLine2(path, ptf, 2)) != Ok) goto fail;
1911 path->pathdata.Types[path->pathdata.Count-1] |= PathPointTypeCloseSubpath;
1912
1913 /* free backup */
1914 GdipDeletePath(backup);
1915 return Ok;
1916
1917 fail:
1918 /* reverting */
1919 GdipFree(path->pathdata.Points);
1920 GdipFree(path->pathdata.Types);
1921 memcpy(path, backup, sizeof(*path));
1922 GdipFree(backup);
1923
1924 return retstat;
1925 }
1926
1927 GpStatus WINGDIPAPI GdipAddPathRectangleI(GpPath *path, INT x, INT y,
1928 INT width, INT height)
1929 {
1930 TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
1931
1932 return GdipAddPathRectangle(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
1933 }
1934
1935 GpStatus WINGDIPAPI GdipAddPathRectangles(GpPath *path, GDIPCONST GpRectF *rects, INT count)
1936 {
1937 GpPath *backup;
1938 GpStatus retstat;
1939 INT i;
1940
1941 TRACE("(%p, %p, %d)\n", path, rects, count);
1942
1943 /* count == 0 - verified condition */
1944 if(!path || !rects || count == 0)
1945 return InvalidParameter;
1946
1947 if(count < 0)
1948 return OutOfMemory;
1949
1950 /* make a backup copy */
1951 if((retstat = GdipClonePath(path, &backup)) != Ok)
1952 return retstat;
1953
1954 for(i = 0; i < count; i++){
1955 if((retstat = GdipAddPathRectangle(path,rects[i].X,rects[i].Y,rects[i].Width,rects[i].Height)) != Ok)
1956 goto fail;
1957 }
1958
1959 /* free backup */
1960 GdipDeletePath(backup);
1961 return Ok;
1962
1963 fail:
1964 /* reverting */
1965 GdipFree(path->pathdata.Points);
1966 GdipFree(path->pathdata.Types);
1967 memcpy(path, backup, sizeof(*path));
1968 GdipFree(backup);
1969
1970 return retstat;
1971 }
1972
1973 GpStatus WINGDIPAPI GdipAddPathRectanglesI(GpPath *path, GDIPCONST GpRect *rects, INT count)
1974 {
1975 GpRectF *rectsF;
1976 GpStatus retstat;
1977 INT i;
1978
1979 TRACE("(%p, %p, %d)\n", path, rects, count);
1980
1981 if(!rects || count == 0)
1982 return InvalidParameter;
1983
1984 if(count < 0)
1985 return OutOfMemory;
1986
1987 rectsF = GdipAlloc(sizeof(GpRectF)*count);
1988
1989 for(i = 0;i < count;i++){
1990 rectsF[i].X = (REAL)rects[i].X;
1991 rectsF[i].Y = (REAL)rects[i].Y;
1992 rectsF[i].Width = (REAL)rects[i].Width;
1993 rectsF[i].Height = (REAL)rects[i].Height;
1994 }
1995
1996 retstat = GdipAddPathRectangles(path, rectsF, count);
1997 GdipFree(rectsF);
1998
1999 return retstat;
2000 }
2001
2002 GpStatus WINGDIPAPI GdipSetPathMarker(GpPath* path)
2003 {
2004 INT count;
2005
2006 TRACE("(%p)\n", path);
2007
2008 if(!path)
2009 return InvalidParameter;
2010
2011 count = path->pathdata.Count;
2012
2013 /* set marker flag */
2014 if(count > 0)
2015 path->pathdata.Types[count-1] |= PathPointTypePathMarker;
2016
2017 return Ok;
2018 }
2019
2020 GpStatus WINGDIPAPI GdipClearPathMarkers(GpPath* path)
2021 {
2022 INT count;
2023 INT i;
2024
2025 TRACE("(%p)\n", path);
2026
2027 if(!path)
2028 return InvalidParameter;
2029
2030 count = path->pathdata.Count;
2031
2032 for(i = 0; i < count - 1; i++){
2033 path->pathdata.Types[i] &= ~PathPointTypePathMarker;
2034 }
2035
2036 return Ok;
2037 }
2038
2039 GpStatus WINGDIPAPI GdipWindingModeOutline(GpPath *path, GpMatrix *matrix, REAL flatness)
2040 {
2041 FIXME("stub: %p, %p, %.2f\n", path, matrix, flatness);
2042 return NotImplemented;
2043 }
2044
This page was automatically generated by the
LXR engine.
Visit the LXR main site for more
information.