2 * Copyright (C) 2007 Google (Evan Stade)
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.
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.
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
31 #include "gdiplus_private.h"
32 #include "wine/debug.h"
34 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
36 typedef struct path_list_node_t path_list_node_t;
37 struct path_list_node_t {
39 BYTE type; /* PathPointTypeStart or PathPointTypeLine */
40 path_list_node_t *next;
44 static BOOL init_path_list(path_list_node_t **node, REAL x, REAL y)
46 *node = GdipAlloc(sizeof(path_list_node_t));
52 (*node)->type = PathPointTypeStart;
58 /* free all nodes including argument */
59 static void free_path_list(path_list_node_t *node)
61 path_list_node_t *n = node;
70 /* Add a node after 'node' */
74 * NULL on allocation problems
76 static path_list_node_t* add_path_list_node(path_list_node_t *node, REAL x, REAL y, BOOL type)
78 path_list_node_t *new;
80 new = GdipAlloc(sizeof(path_list_node_t));
87 new->next = node->next;
93 /* returns element count */
94 static INT path_list_count(path_list_node_t *node)
98 while((node = node->next))
104 /* GdipFlattenPath helper */
106 * Used to recursively flatten single Bezier curve
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.
116 * FALSE: out of memory
118 * TODO: used quality criteria should be revised to match native as
119 * closer as possible.
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)
124 /* this 5 middle points with start/end define to half-curves */
127 path_list_node_t *node;
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;
142 mp[2].X = (mp[1].X + mp[3].X) / 2.0;
143 mp[2].Y = (mp[1].Y + mp[3].Y) / 2.0;
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))))){
154 /* add a middle point */
155 if(!(node = add_path_list_node(start, mp[2].X, mp[2].Y, PathPointTypeLine)))
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);
165 GpStatus WINGDIPAPI GdipAddPathArc(GpPath *path, REAL x1, REAL y1, REAL x2,
166 REAL y2, REAL startAngle, REAL sweepAngle)
168 INT count, old_count, i;
170 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
171 path, x1, y1, x2, y2, startAngle, sweepAngle);
174 return InvalidParameter;
176 count = arc2polybezier(NULL, x1, y1, x2, y2, startAngle, sweepAngle);
180 if(!lengthen_path(path, count))
183 old_count = path->pathdata.Count;
184 arc2polybezier(&path->pathdata.Points[old_count], x1, y1, x2, y2,
185 startAngle, sweepAngle);
187 for(i = 0; i < count; i++){
188 path->pathdata.Types[old_count + i] = PathPointTypeBezier;
191 path->pathdata.Types[old_count] =
192 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
193 path->newfigure = FALSE;
194 path->pathdata.Count += count;
199 GpStatus WINGDIPAPI GdipAddPathArcI(GpPath *path, INT x1, INT y1, INT x2,
200 INT y2, REAL startAngle, REAL sweepAngle)
202 TRACE("(%p, %d, %d, %d, %d, %.2f, %.2f)\n",
203 path, x1, y1, x2, y2, startAngle, sweepAngle);
205 return GdipAddPathArc(path,(REAL)x1,(REAL)y1,(REAL)x2,(REAL)y2,startAngle,sweepAngle);
208 GpStatus WINGDIPAPI GdipAddPathBezier(GpPath *path, REAL x1, REAL y1, REAL x2,
209 REAL y2, REAL x3, REAL y3, REAL x4, REAL y4)
213 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
214 path, x1, y1, x2, y2, x3, y3, x4, y4);
217 return InvalidParameter;
219 if(!lengthen_path(path, 4))
222 old_count = path->pathdata.Count;
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;
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;
239 path->newfigure = FALSE;
240 path->pathdata.Count += 4;
245 GpStatus WINGDIPAPI GdipAddPathBezierI(GpPath *path, INT x1, INT y1, INT x2,
246 INT y2, INT x3, INT y3, INT x4, INT y4)
248 TRACE("(%p, %d, %d, %d, %d, %d, %d, %d, %d)\n",
249 path, x1, y1, x2, y2, x3, y3, x4, y4);
251 return GdipAddPathBezier(path,(REAL)x1,(REAL)y1,(REAL)x2,(REAL)y2,(REAL)x3,(REAL)y3,
255 GpStatus WINGDIPAPI GdipAddPathBeziers(GpPath *path, GDIPCONST GpPointF *points,
260 TRACE("(%p, %p, %d)\n", path, points, count);
262 if(!path || !points || ((count - 1) % 3))
263 return InvalidParameter;
265 if(!lengthen_path(path, count))
268 old_count = path->pathdata.Count;
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;
276 path->pathdata.Types[old_count] =
277 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
278 path->newfigure = FALSE;
279 path->pathdata.Count += count;
284 GpStatus WINGDIPAPI GdipAddPathBeziersI(GpPath *path, GDIPCONST GpPoint *points,
291 TRACE("(%p, %p, %d)\n", path, points, count);
293 if(!points || ((count - 1) % 3))
294 return InvalidParameter;
296 ptsF = GdipAlloc(sizeof(GpPointF) * count);
300 for(i = 0; i < count; i++){
301 ptsF[i].X = (REAL)points[i].X;
302 ptsF[i].Y = (REAL)points[i].Y;
305 ret = GdipAddPathBeziers(path, ptsF, count);
311 GpStatus WINGDIPAPI GdipAddPathClosedCurve(GpPath *path, GDIPCONST GpPointF *points,
314 TRACE("(%p, %p, %d)\n", path, points, count);
316 return GdipAddPathClosedCurve2(path, points, count, 1.0);
319 GpStatus WINGDIPAPI GdipAddPathClosedCurveI(GpPath *path, GDIPCONST GpPoint *points,
322 TRACE("(%p, %p, %d)\n", path, points, count);
324 return GdipAddPathClosedCurve2I(path, points, count, 1.0);
327 GpStatus WINGDIPAPI GdipAddPathClosedCurve2(GpPath *path, GDIPCONST GpPointF *points,
328 INT count, REAL tension)
330 INT i, len_pt = (count + 1)*3-2;
336 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
338 if(!path || !points || count <= 1)
339 return InvalidParameter;
341 pt = GdipAlloc(len_pt * sizeof(GpPointF));
342 pts = GdipAlloc((count + 1)*sizeof(GpPointF));
349 /* copy source points to extend with the last one */
350 memcpy(pts, points, sizeof(GpPointF)*count);
353 tension = tension * TENSION_CONST;
355 for(i = 0; i < count-1; i++){
356 calc_curve_bezier(&(pts[i]), tension, &x1, &y1, &x2, &y2);
360 pt[3*i+3].X = pts[i+1].X;
361 pt[3*i+3].Y = pts[i+1].Y;
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 */
372 calc_curve_bezier(pts, tension, &x1, &y1, &x2, &y2);
380 pt[len_pt-1].X = pt[0].X;
381 pt[len_pt-1].Y = pt[0].Y;
383 stat = GdipAddPathBeziers(path, pt, len_pt);
387 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
388 path->newfigure = TRUE;
397 GpStatus WINGDIPAPI GdipAddPathClosedCurve2I(GpPath *path, GDIPCONST GpPoint *points,
398 INT count, REAL tension)
404 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
406 if(!path || !points || count <= 1)
407 return InvalidParameter;
409 ptf = GdipAlloc(sizeof(GpPointF)*count);
413 for(i = 0; i < count; i++){
414 ptf[i].X = (REAL)points[i].X;
415 ptf[i].Y = (REAL)points[i].Y;
418 stat = GdipAddPathClosedCurve2(path, ptf, count, tension);
425 GpStatus WINGDIPAPI GdipAddPathCurve(GpPath *path, GDIPCONST GpPointF *points, INT count)
427 TRACE("(%p, %p, %d)\n", path, points, count);
429 if(!path || !points || count <= 1)
430 return InvalidParameter;
432 return GdipAddPathCurve2(path, points, count, 1.0);
435 GpStatus WINGDIPAPI GdipAddPathCurveI(GpPath *path, GDIPCONST GpPoint *points, INT count)
437 TRACE("(%p, %p, %d)\n", path, points, count);
439 if(!path || !points || count <= 1)
440 return InvalidParameter;
442 return GdipAddPathCurve2I(path, points, count, 1.0);
445 GpStatus WINGDIPAPI GdipAddPathCurve2(GpPath *path, GDIPCONST GpPointF *points, INT count,
448 INT i, len_pt = count*3-2;
453 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
455 if(!path || !points || count <= 1)
456 return InvalidParameter;
458 pt = GdipAlloc(len_pt * sizeof(GpPointF));
462 tension = tension * TENSION_CONST;
464 calc_curve_bezier_endp(points[0].X, points[0].Y, points[1].X, points[1].Y,
467 pt[0].X = points[0].X;
468 pt[0].Y = points[0].Y;
472 for(i = 0; i < count-2; i++){
473 calc_curve_bezier(&(points[i]), tension, &x1, &y1, &x2, &y2);
477 pt[3*i+3].X = points[i+1].X;
478 pt[3*i+3].Y = points[i+1].Y;
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);
488 pt[len_pt-1].X = points[count-1].X;
489 pt[len_pt-1].Y = points[count-1].Y;
491 stat = GdipAddPathBeziers(path, pt, len_pt);
498 GpStatus WINGDIPAPI GdipAddPathCurve2I(GpPath *path, GDIPCONST GpPoint *points,
499 INT count, REAL tension)
505 TRACE("(%p, %p, %d, %.2f)\n", path, points, count, tension);
507 if(!path || !points || count <= 1)
508 return InvalidParameter;
510 ptf = GdipAlloc(sizeof(GpPointF)*count);
514 for(i = 0; i < count; i++){
515 ptf[i].X = (REAL)points[i].X;
516 ptf[i].Y = (REAL)points[i].Y;
519 stat = GdipAddPathCurve2(path, ptf, count, tension);
526 GpStatus WINGDIPAPI GdipAddPathCurve3(GpPath *path, GDIPCONST GpPointF *points,
527 INT count, INT offset, INT nseg, REAL tension)
529 TRACE("(%p, %p, %d, %d, %d, %.2f)\n", path, points, count, offset, nseg, tension);
531 if(!path || !points || offset + 1 >= count || count - offset < nseg + 1)
532 return InvalidParameter;
534 return GdipAddPathCurve2(path, &points[offset], nseg + 1, tension);
537 GpStatus WINGDIPAPI GdipAddPathCurve3I(GpPath *path, GDIPCONST GpPoint *points,
538 INT count, INT offset, INT nseg, REAL tension)
540 TRACE("(%p, %p, %d, %d, %d, %.2f)\n", path, points, count, offset, nseg, tension);
542 if(!path || !points || offset + 1 >= count || count - offset < nseg + 1)
543 return InvalidParameter;
545 return GdipAddPathCurve2I(path, &points[offset], nseg + 1, tension);
548 GpStatus WINGDIPAPI GdipAddPathEllipse(GpPath *path, REAL x, REAL y, REAL width,
551 INT old_count, numpts;
553 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
556 return InvalidParameter;
558 if(!lengthen_path(path, MAX_ARC_PTS))
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);
568 memset(&path->pathdata.Types[old_count + 1], PathPointTypeBezier,
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;
580 GpStatus WINGDIPAPI GdipAddPathEllipseI(GpPath *path, INT x, INT y, INT width,
583 TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
585 return GdipAddPathEllipse(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
588 GpStatus WINGDIPAPI GdipAddPathLine2(GpPath *path, GDIPCONST GpPointF *points,
593 TRACE("(%p, %p, %d)\n", path, points, count);
596 return InvalidParameter;
598 if(!lengthen_path(path, count))
601 old_count = path->pathdata.Count;
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;
610 path->pathdata.Types[old_count] = PathPointTypeStart;
611 path->newfigure = FALSE;
614 path->pathdata.Count += count;
619 GpStatus WINGDIPAPI GdipAddPathLine2I(GpPath *path, GDIPCONST GpPoint *points, INT count)
625 TRACE("(%p, %p, %d)\n", path, points, count);
628 return InvalidParameter;
630 pointsF = GdipAlloc(sizeof(GpPointF) * count);
631 if(!pointsF) return OutOfMemory;
633 for(i = 0;i < count; i++){
634 pointsF[i].X = (REAL)points[i].X;
635 pointsF[i].Y = (REAL)points[i].Y;
638 stat = GdipAddPathLine2(path, pointsF, count);
645 GpStatus WINGDIPAPI GdipAddPathLine(GpPath *path, REAL x1, REAL y1, REAL x2, REAL y2)
649 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x1, y1, x2, y2);
652 return InvalidParameter;
654 if(!lengthen_path(path, 2))
657 old_count = path->pathdata.Count;
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;
664 path->pathdata.Types[old_count] =
665 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
666 path->pathdata.Types[old_count + 1] = PathPointTypeLine;
668 path->newfigure = FALSE;
669 path->pathdata.Count += 2;
674 GpStatus WINGDIPAPI GdipAddPathLineI(GpPath *path, INT x1, INT y1, INT x2, INT y2)
676 TRACE("(%p, %d, %d, %d, %d)\n", path, x1, y1, x2, y2);
678 return GdipAddPathLine(path, (REAL)x1, (REAL)y1, (REAL)x2, (REAL)y2);
681 GpStatus WINGDIPAPI GdipAddPathPath(GpPath *path, GDIPCONST GpPath* addingPath,
684 INT old_count, count;
686 TRACE("(%p, %p, %d)\n", path, addingPath, connect);
688 if(!path || !addingPath)
689 return InvalidParameter;
691 old_count = path->pathdata.Count;
692 count = addingPath->pathdata.Count;
694 if(!lengthen_path(path, count))
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);
701 if(path->newfigure || !connect)
702 path->pathdata.Types[old_count] = PathPointTypeStart;
704 path->pathdata.Types[old_count] = PathPointTypeLine;
706 path->newfigure = FALSE;
707 path->pathdata.Count += count;
712 GpStatus WINGDIPAPI GdipAddPathPie(GpPath *path, REAL x, REAL y, REAL width, REAL height,
713 REAL startAngle, REAL sweepAngle)
719 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n",
720 path, x, y, width, height, startAngle, sweepAngle);
723 return InvalidParameter;
725 /* on zero width/height only start point added */
726 if(width <= 1e-7 || height <= 1e-7){
727 if(!lengthen_path(path, 1))
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;
736 count = arc2polybezier(NULL, x, y, width, height, startAngle, sweepAngle);
741 ptf = GdipAlloc(sizeof(GpPointF)*count);
745 arc2polybezier(ptf, x, y, width, height, startAngle, sweepAngle);
747 status = GdipAddPathLine(path, x + width/2, y + height/2, ptf[0].X, ptf[0].Y);
752 /* one spline is already added as a line endpoint */
753 if(!lengthen_path(path, count - 1)){
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;
762 path->pathdata.Count += count-1;
764 GdipClosePathFigure(path);
771 GpStatus WINGDIPAPI GdipAddPathPieI(GpPath *path, INT x, INT y, INT width, INT height,
772 REAL startAngle, REAL sweepAngle)
774 TRACE("(%p, %d, %d, %d, %d, %.2f, %.2f)\n",
775 path, x, y, width, height, startAngle, sweepAngle);
777 return GdipAddPathPie(path, (REAL)x, (REAL)y, (REAL)width, (REAL)height, startAngle, sweepAngle);
780 GpStatus WINGDIPAPI GdipAddPathPolygon(GpPath *path, GDIPCONST GpPointF *points, INT count)
784 TRACE("(%p, %p, %d)\n", path, points, count);
786 if(!path || !points || count < 3)
787 return InvalidParameter;
789 if(!lengthen_path(path, count))
792 old_count = path->pathdata.Count;
794 memcpy(&path->pathdata.Points[old_count], points, count*sizeof(GpPointF));
795 memset(&path->pathdata.Types[old_count + 1], PathPointTypeLine, count - 1);
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;
806 GpStatus WINGDIPAPI GdipAddPathPolygonI(GpPath *path, GDIPCONST GpPoint *points, INT count)
812 TRACE("(%p, %p, %d)\n", path, points, count);
814 if(!points || count < 3)
815 return InvalidParameter;
817 ptf = GdipAlloc(sizeof(GpPointF) * count);
821 for(i = 0; i < count; i++){
822 ptf[i].X = (REAL)points[i].X;
823 ptf[i].Y = (REAL)points[i].Y;
826 status = GdipAddPathPolygon(path, ptf, count);
833 static float fromfixedpoint(const FIXED v)
835 float f = ((float)v.fract) / (1<<(sizeof(v.fract)*8));
840 struct format_string_args
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, void *priv)
851 static const MAT2 identity = { {0,1}, {0,0}, {0,0}, {0,1} };
852 struct format_string_args *args = priv;
853 GpPath *path = args->path;
854 GpStatus status = Ok;
859 for (i = index; i < length; ++i)
862 TTPOLYGONHEADER *ph = NULL;
866 len = GetGlyphOutlineW(dc, string[i], GGO_BEZIER, &gm, 0, NULL, &identity);
867 if (len == GDI_ERROR)
869 status = GenericError;
874 if (!ph || !lengthen_path(path, len / sizeof(POINTFX)))
876 status = OutOfMemory;
879 GetGlyphOutlineW(dc, string[i], GGO_BEZIER, &gm, len, start, &identity);
880 bb_end = gm.gmBlackBoxY + gm.gmptGlyphOrigin.y;
881 if (bb_end + y > args->maxY)
882 args->maxY = bb_end + y;
887 DWORD ofs_start = ofs;
888 ph = (TTPOLYGONHEADER*)&start[ofs];
889 path->pathdata.Types[path->pathdata.Count] = PathPointTypeStart;
890 path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(ph->pfxStart.x);
891 path->pathdata.Points[path->pathdata.Count++].Y = y + bb_end - fromfixedpoint(ph->pfxStart.y);
892 TRACE("Starting at count %i with pos %f, %f)\n", path->pathdata.Count, x, y);
894 while (ofs - ofs_start < ph->cb)
896 TTPOLYCURVE *curve = (TTPOLYCURVE*)&start[ofs];
898 ofs += sizeof(TTPOLYCURVE) + (curve->cpfx - 1) * sizeof(POINTFX);
900 switch (curve->wType)
903 for (j = 0; j < curve->cpfx; ++j)
905 path->pathdata.Types[path->pathdata.Count] = PathPointTypeLine;
906 path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(curve->apfx[j].x);
907 path->pathdata.Points[path->pathdata.Count++].Y = y + bb_end - fromfixedpoint(curve->apfx[j].y);
910 case TT_PRIM_CSPLINE:
911 for (j = 0; j < curve->cpfx; ++j)
913 path->pathdata.Types[path->pathdata.Count] = PathPointTypeBezier;
914 path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(curve->apfx[j].x);
915 path->pathdata.Points[path->pathdata.Count++].Y = y + bb_end - fromfixedpoint(curve->apfx[j].y);
919 ERR("Unhandled type: %u\n", curve->wType);
920 status = GenericError;
923 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
925 path->newfigure = TRUE;
937 GpStatus WINGDIPAPI GdipAddPathString(GpPath* path, GDIPCONST WCHAR* string, INT length, GDIPCONST GpFontFamily* family, INT style, REAL emSize, GDIPCONST RectF* layoutRect, GDIPCONST GpStringFormat* format)
944 struct format_string_args args;
947 FIXME("(%p, %s, %d, %p, %d, %f, %p, %p): stub\n", path, debugstr_w(string), length, family, style, emSize, layoutRect, format);
948 if (!path || !string || !family || !emSize || !layoutRect || !format)
949 return InvalidParameter;
951 status = GdipCreateFont(family, emSize, style, UnitPixel, &font);
955 hfont = CreateFontIndirectW(&font->lfw);
958 WARN("Failed to create font\n");
962 if ((status = GdipClonePath(path, &backup)) != Ok)
968 dc = CreateCompatibleDC(0);
969 SelectObject(dc, hfont);
973 status = gdip_format_string(dc, string, length, NULL, layoutRect, format, format_string_callback, &args);
978 if (status != Ok) /* free backup */
980 GdipFree(path->pathdata.Points);
981 GdipFree(path->pathdata.Types);
986 if (format && format->vertalign == StringAlignmentCenter && layoutRect->Y + args.maxY < layoutRect->Height)
988 float inc = layoutRect->Height - args.maxY - layoutRect->Y;
990 for (i = backup->pathdata.Count; i < path->pathdata.Count; ++i)
991 path->pathdata.Points[i].Y += inc;
992 } else if (format && format->vertalign == StringAlignmentFar) {
993 float inc = layoutRect->Height - args.maxY - layoutRect->Y;
994 for (i = backup->pathdata.Count; i < path->pathdata.Count; ++i)
995 path->pathdata.Points[i].Y += inc;
997 GdipDeletePath(backup);
1001 GpStatus WINGDIPAPI GdipAddPathStringI(GpPath* path, GDIPCONST WCHAR* string, INT length, GDIPCONST GpFontFamily* family, INT style, REAL emSize, GDIPCONST Rect* layoutRect, GDIPCONST GpStringFormat* format)
1005 RectF layoutRectF = {
1006 (REAL)layoutRect->X,
1007 (REAL)layoutRect->Y,
1008 (REAL)layoutRect->Width,
1009 (REAL)layoutRect->Height
1011 return GdipAddPathString(path, string, length, family, style, emSize, &layoutRectF, format);
1013 return InvalidParameter;
1016 GpStatus WINGDIPAPI GdipClonePath(GpPath* path, GpPath **clone)
1018 TRACE("(%p, %p)\n", path, clone);
1021 return InvalidParameter;
1023 *clone = GdipAlloc(sizeof(GpPath));
1024 if(!*clone) return OutOfMemory;
1028 (*clone)->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
1029 (*clone)->pathdata.Types = GdipAlloc(path->datalen);
1030 if(!(*clone)->pathdata.Points || !(*clone)->pathdata.Types){
1032 GdipFree((*clone)->pathdata.Points);
1033 GdipFree((*clone)->pathdata.Types);
1037 memcpy((*clone)->pathdata.Points, path->pathdata.Points,
1038 path->datalen * sizeof(PointF));
1039 memcpy((*clone)->pathdata.Types, path->pathdata.Types, path->datalen);
1044 GpStatus WINGDIPAPI GdipClosePathFigure(GpPath* path)
1046 TRACE("(%p)\n", path);
1049 return InvalidParameter;
1051 if(path->pathdata.Count > 0){
1052 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
1053 path->newfigure = TRUE;
1059 GpStatus WINGDIPAPI GdipClosePathFigures(GpPath* path)
1063 TRACE("(%p)\n", path);
1066 return InvalidParameter;
1068 for(i = 1; i < path->pathdata.Count; i++){
1069 if(path->pathdata.Types[i] == PathPointTypeStart)
1070 path->pathdata.Types[i-1] |= PathPointTypeCloseSubpath;
1073 path->newfigure = TRUE;
1078 GpStatus WINGDIPAPI GdipCreatePath(GpFillMode fill, GpPath **path)
1080 TRACE("(%d, %p)\n", fill, path);
1083 return InvalidParameter;
1085 *path = GdipAlloc(sizeof(GpPath));
1086 if(!*path) return OutOfMemory;
1088 (*path)->fill = fill;
1089 (*path)->newfigure = TRUE;
1094 GpStatus WINGDIPAPI GdipCreatePath2(GDIPCONST GpPointF* points,
1095 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
1097 TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
1100 return InvalidParameter;
1102 *path = GdipAlloc(sizeof(GpPath));
1103 if(!*path) return OutOfMemory;
1105 (*path)->pathdata.Points = GdipAlloc(count * sizeof(PointF));
1106 (*path)->pathdata.Types = GdipAlloc(count);
1108 if(!(*path)->pathdata.Points || !(*path)->pathdata.Types){
1109 GdipFree((*path)->pathdata.Points);
1110 GdipFree((*path)->pathdata.Types);
1115 memcpy((*path)->pathdata.Points, points, count * sizeof(PointF));
1116 memcpy((*path)->pathdata.Types, types, count);
1117 (*path)->pathdata.Count = count;
1118 (*path)->datalen = count;
1120 (*path)->fill = fill;
1121 (*path)->newfigure = TRUE;
1126 GpStatus WINGDIPAPI GdipCreatePath2I(GDIPCONST GpPoint* points,
1127 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
1133 TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
1135 ptF = GdipAlloc(sizeof(GpPointF)*count);
1137 for(i = 0;i < count; i++){
1138 ptF[i].X = (REAL)points[i].X;
1139 ptF[i].Y = (REAL)points[i].Y;
1142 ret = GdipCreatePath2(ptF, types, count, fill, path);
1149 GpStatus WINGDIPAPI GdipDeletePath(GpPath *path)
1151 TRACE("(%p)\n", path);
1154 return InvalidParameter;
1156 GdipFree(path->pathdata.Points);
1157 GdipFree(path->pathdata.Types);
1163 GpStatus WINGDIPAPI GdipFlattenPath(GpPath *path, GpMatrix* matrix, REAL flatness)
1165 path_list_node_t *list, *node;
1170 TRACE("(%p, %p, %.2f)\n", path, matrix, flatness);
1173 return InvalidParameter;
1176 WARN("transformation not supported yet!\n");
1177 return NotImplemented;
1180 if(path->pathdata.Count == 0)
1183 pt = path->pathdata.Points[0];
1184 if(!init_path_list(&list, pt.X, pt.Y))
1189 while(i < path->pathdata.Count){
1191 BYTE type = path->pathdata.Types[i] & PathPointTypePathTypeMask;
1192 path_list_node_t *start;
1194 pt = path->pathdata.Points[i];
1196 /* save last start point index */
1197 if(type == PathPointTypeStart)
1200 /* always add line points and start points */
1201 if((type == PathPointTypeStart) || (type == PathPointTypeLine)){
1202 if(!add_path_list_node(node, pt.X, pt.Y, path->pathdata.Types[i]))
1212 /* test for closed figure */
1213 if(path->pathdata.Types[i+1] & PathPointTypeCloseSubpath){
1214 pt = path->pathdata.Points[startidx];
1220 pt = path->pathdata.Points[i];
1224 /* add Bezier end point */
1225 type = (path->pathdata.Types[i] & ~PathPointTypePathTypeMask) | PathPointTypeLine;
1226 if(!add_path_list_node(node, pt.X, pt.Y, type))
1231 if(!flatten_bezier(start, path->pathdata.Points[i-2].X, path->pathdata.Points[i-2].Y,
1232 path->pathdata.Points[i-1].X, path->pathdata.Points[i-1].Y,
1239 /* store path data back */
1240 i = path_list_count(list);
1241 if(!lengthen_path(path, i))
1243 path->pathdata.Count = i;
1246 for(i = 0; i < path->pathdata.Count; i++){
1247 path->pathdata.Points[i] = node->pt;
1248 path->pathdata.Types[i] = node->type;
1252 free_path_list(list);
1256 free_path_list(list);
1260 GpStatus WINGDIPAPI GdipGetPathData(GpPath *path, GpPathData* pathData)
1262 TRACE("(%p, %p)\n", path, pathData);
1264 if(!path || !pathData)
1265 return InvalidParameter;
1267 /* Only copy data. pathData allocation/freeing controlled by wrapper class.
1268 Assumed that pathData is enough wide to get all data - controlled by wrapper too. */
1269 memcpy(pathData->Points, path->pathdata.Points, sizeof(PointF) * pathData->Count);
1270 memcpy(pathData->Types , path->pathdata.Types , pathData->Count);
1275 GpStatus WINGDIPAPI GdipGetPathFillMode(GpPath *path, GpFillMode *fillmode)
1277 TRACE("(%p, %p)\n", path, fillmode);
1279 if(!path || !fillmode)
1280 return InvalidParameter;
1282 *fillmode = path->fill;
1287 GpStatus WINGDIPAPI GdipGetPathLastPoint(GpPath* path, GpPointF* lastPoint)
1291 TRACE("(%p, %p)\n", path, lastPoint);
1293 if(!path || !lastPoint)
1294 return InvalidParameter;
1296 count = path->pathdata.Count;
1298 *lastPoint = path->pathdata.Points[count-1];
1303 GpStatus WINGDIPAPI GdipGetPathPoints(GpPath *path, GpPointF* points, INT count)
1305 TRACE("(%p, %p, %d)\n", path, points, count);
1308 return InvalidParameter;
1310 if(count < path->pathdata.Count)
1311 return InsufficientBuffer;
1313 memcpy(points, path->pathdata.Points, path->pathdata.Count * sizeof(GpPointF));
1318 GpStatus WINGDIPAPI GdipGetPathPointsI(GpPath *path, GpPoint* points, INT count)
1324 TRACE("(%p, %p, %d)\n", path, points, count);
1327 return InvalidParameter;
1329 ptf = GdipAlloc(sizeof(GpPointF)*count);
1330 if(!ptf) return OutOfMemory;
1332 ret = GdipGetPathPoints(path,ptf,count);
1334 for(i = 0;i < count;i++){
1335 points[i].X = roundr(ptf[i].X);
1336 points[i].Y = roundr(ptf[i].Y);
1343 GpStatus WINGDIPAPI GdipGetPathTypes(GpPath *path, BYTE* types, INT count)
1345 TRACE("(%p, %p, %d)\n", path, types, count);
1348 return InvalidParameter;
1350 if(count < path->pathdata.Count)
1351 return InsufficientBuffer;
1353 memcpy(types, path->pathdata.Types, path->pathdata.Count);
1358 /* Windows expands the bounding box to the maximum possible bounding box
1359 * for a given pen. For example, if a line join can extend past the point
1360 * it's joining by x units, the bounding box is extended by x units in every
1361 * direction (even though this is too conservative for most cases). */
1362 GpStatus WINGDIPAPI GdipGetPathWorldBounds(GpPath* path, GpRectF* bounds,
1363 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1365 GpPointF * points, temp_pts[4];
1367 REAL path_width = 1.0, width, height, temp, low_x, low_y, high_x, high_y;
1369 TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1371 /* Matrix and pen can be null. */
1372 if(!path || !bounds)
1373 return InvalidParameter;
1375 /* If path is empty just return. */
1376 count = path->pathdata.Count;
1378 bounds->X = bounds->Y = bounds->Width = bounds->Height = 0.0;
1382 points = path->pathdata.Points;
1384 low_x = high_x = points[0].X;
1385 low_y = high_y = points[0].Y;
1387 for(i = 1; i < count; i++){
1388 low_x = min(low_x, points[i].X);
1389 low_y = min(low_y, points[i].Y);
1390 high_x = max(high_x, points[i].X);
1391 high_y = max(high_y, points[i].Y);
1394 width = high_x - low_x;
1395 height = high_y - low_y;
1397 /* This looks unusual but it's the only way I can imitate windows. */
1399 temp_pts[0].X = low_x;
1400 temp_pts[0].Y = low_y;
1401 temp_pts[1].X = low_x;
1402 temp_pts[1].Y = high_y;
1403 temp_pts[2].X = high_x;
1404 temp_pts[2].Y = high_y;
1405 temp_pts[3].X = high_x;
1406 temp_pts[3].Y = low_y;
1408 GdipTransformMatrixPoints((GpMatrix*)matrix, temp_pts, 4);
1409 low_x = temp_pts[0].X;
1410 low_y = temp_pts[0].Y;
1412 for(i = 1; i < 4; i++){
1413 low_x = min(low_x, temp_pts[i].X);
1414 low_y = min(low_y, temp_pts[i].Y);
1418 width = height * fabs(matrix->matrix[2]) + width * fabs(matrix->matrix[0]);
1419 height = height * fabs(matrix->matrix[3]) + temp * fabs(matrix->matrix[1]);
1423 path_width = pen->width / 2.0;
1426 path_width = max(path_width, pen->width * pen->miterlimit / 2.0);
1427 /* FIXME: this should probably also check for the startcap */
1428 if(pen->endcap & LineCapNoAnchor)
1429 path_width = max(path_width, pen->width * 2.2);
1431 low_x -= path_width;
1432 low_y -= path_width;
1433 width += 2.0 * path_width;
1434 height += 2.0 * path_width;
1439 bounds->Width = width;
1440 bounds->Height = height;
1445 GpStatus WINGDIPAPI GdipGetPathWorldBoundsI(GpPath* path, GpRect* bounds,
1446 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1451 TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1453 ret = GdipGetPathWorldBounds(path,&boundsF,matrix,pen);
1456 bounds->X = roundr(boundsF.X);
1457 bounds->Y = roundr(boundsF.Y);
1458 bounds->Width = roundr(boundsF.Width);
1459 bounds->Height = roundr(boundsF.Height);
1465 GpStatus WINGDIPAPI GdipGetPointCount(GpPath *path, INT *count)
1467 TRACE("(%p, %p)\n", path, count);
1470 return InvalidParameter;
1472 *count = path->pathdata.Count;
1477 GpStatus WINGDIPAPI GdipReversePath(GpPath* path)
1480 INT start = 0; /* position in reversed path */
1483 TRACE("(%p)\n", path);
1486 return InvalidParameter;
1488 count = path->pathdata.Count;
1490 if(count == 0) return Ok;
1492 revpath.Points = GdipAlloc(sizeof(GpPointF)*count);
1493 revpath.Types = GdipAlloc(sizeof(BYTE)*count);
1494 revpath.Count = count;
1495 if(!revpath.Points || !revpath.Types){
1496 GdipFree(revpath.Points);
1497 GdipFree(revpath.Types);
1501 for(i = 0; i < count; i++){
1503 /* find next start point */
1504 if(path->pathdata.Types[count-i-1] == PathPointTypeStart){
1506 for(j = start; j <= i; j++){
1507 revpath.Points[j] = path->pathdata.Points[count-j-1];
1508 revpath.Types[j] = path->pathdata.Types[count-j-1];
1510 /* mark start point */
1511 revpath.Types[start] = PathPointTypeStart;
1512 /* set 'figure' endpoint type */
1514 revpath.Types[i] = path->pathdata.Types[count-start-1] & ~PathPointTypePathTypeMask;
1515 revpath.Types[i] |= revpath.Types[i-1];
1518 revpath.Types[i] = path->pathdata.Types[start];
1524 memcpy(path->pathdata.Points, revpath.Points, sizeof(GpPointF)*count);
1525 memcpy(path->pathdata.Types, revpath.Types, sizeof(BYTE)*count);
1527 GdipFree(revpath.Points);
1528 GdipFree(revpath.Types);
1533 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPointI(GpPath* path, INT x, INT y,
1534 GpPen *pen, GpGraphics *graphics, BOOL *result)
1536 TRACE("(%p, %d, %d, %p, %p, %p)\n", path, x, y, pen, graphics, result);
1538 return GdipIsOutlineVisiblePathPoint(path, x, y, pen, graphics, result);
1541 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPoint(GpPath* path, REAL x, REAL y,
1542 GpPen *pen, GpGraphics *graphics, BOOL *result)
1546 TRACE("(%p,%0.2f,%0.2f,%p,%p,%p)\n", path, x, y, pen, graphics, result);
1549 return InvalidParameter;
1552 FIXME("not implemented\n");
1554 return NotImplemented;
1557 GpStatus WINGDIPAPI GdipIsVisiblePathPointI(GpPath* path, INT x, INT y, GpGraphics *graphics, BOOL *result)
1559 TRACE("(%p, %d, %d, %p, %p)\n", path, x, y, graphics, result);
1561 return GdipIsVisiblePathPoint(path, x, y, graphics, result);
1564 /*****************************************************************************
1565 * GdipIsVisiblePathPoint [GDIPLUS.@]
1567 GpStatus WINGDIPAPI GdipIsVisiblePathPoint(GpPath* path, REAL x, REAL y, GpGraphics *graphics, BOOL *result)
1573 if(!path || !result) return InvalidParameter;
1575 status = GdipCreateRegionPath(path, ®ion);
1579 status = GdipGetRegionHRgn(region, graphics, &hrgn);
1581 GdipDeleteRegion(region);
1585 *result = PtInRegion(hrgn, roundr(x), roundr(y));
1588 GdipDeleteRegion(region);
1593 GpStatus WINGDIPAPI GdipStartPathFigure(GpPath *path)
1595 TRACE("(%p)\n", path);
1598 return InvalidParameter;
1600 path->newfigure = TRUE;
1605 GpStatus WINGDIPAPI GdipResetPath(GpPath *path)
1607 TRACE("(%p)\n", path);
1610 return InvalidParameter;
1612 path->pathdata.Count = 0;
1613 path->newfigure = TRUE;
1614 path->fill = FillModeAlternate;
1619 GpStatus WINGDIPAPI GdipSetPathFillMode(GpPath *path, GpFillMode fill)
1621 TRACE("(%p, %d)\n", path, fill);
1624 return InvalidParameter;
1631 GpStatus WINGDIPAPI GdipTransformPath(GpPath *path, GpMatrix *matrix)
1633 TRACE("(%p, %p)\n", path, matrix);
1636 return InvalidParameter;
1638 if(path->pathdata.Count == 0)
1641 return GdipTransformMatrixPoints(matrix, path->pathdata.Points,
1642 path->pathdata.Count);
1645 GpStatus WINGDIPAPI GdipWarpPath(GpPath *path, GpMatrix* matrix,
1646 GDIPCONST GpPointF *points, INT count, REAL x, REAL y, REAL width,
1647 REAL height, WarpMode warpmode, REAL flatness)
1649 FIXME("(%p,%p,%p,%i,%0.2f,%0.2f,%0.2f,%0.2f,%i,%0.2f)\n", path, matrix,
1650 points, count, x, y, width, height, warpmode, flatness);
1652 return NotImplemented;
1655 GpStatus WINGDIPAPI GdipWidenPath(GpPath *path, GpPen *pen, GpMatrix *matrix,
1658 FIXME("(%p,%p,%p,%0.2f)\n", path, pen, matrix, flatness);
1660 return NotImplemented;
1663 GpStatus WINGDIPAPI GdipAddPathRectangle(GpPath *path, REAL x, REAL y,
1664 REAL width, REAL height)
1671 TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
1674 return InvalidParameter;
1676 /* make a backup copy of path data */
1677 if((retstat = GdipClonePath(path, &backup)) != Ok)
1680 /* rectangle should start as new path */
1681 old_new = path->newfigure;
1682 path->newfigure = TRUE;
1683 if((retstat = GdipAddPathLine(path,x,y,x+width,y)) != Ok){
1684 path->newfigure = old_new;
1689 ptf[0].Y = y+height;
1691 ptf[1].Y = y+height;
1693 if((retstat = GdipAddPathLine2(path, ptf, 2)) != Ok) goto fail;
1694 path->pathdata.Types[path->pathdata.Count-1] |= PathPointTypeCloseSubpath;
1697 GdipDeletePath(backup);
1702 GdipFree(path->pathdata.Points);
1703 GdipFree(path->pathdata.Types);
1704 memcpy(path, backup, sizeof(*path));
1710 GpStatus WINGDIPAPI GdipAddPathRectangleI(GpPath *path, INT x, INT y,
1711 INT width, INT height)
1713 TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
1715 return GdipAddPathRectangle(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
1718 GpStatus WINGDIPAPI GdipAddPathRectangles(GpPath *path, GDIPCONST GpRectF *rects, INT count)
1724 TRACE("(%p, %p, %d)\n", path, rects, count);
1726 /* count == 0 - verified condition */
1727 if(!path || !rects || count == 0)
1728 return InvalidParameter;
1733 /* make a backup copy */
1734 if((retstat = GdipClonePath(path, &backup)) != Ok)
1737 for(i = 0; i < count; i++){
1738 if((retstat = GdipAddPathRectangle(path,rects[i].X,rects[i].Y,rects[i].Width,rects[i].Height)) != Ok)
1743 GdipDeletePath(backup);
1748 GdipFree(path->pathdata.Points);
1749 GdipFree(path->pathdata.Types);
1750 memcpy(path, backup, sizeof(*path));
1756 GpStatus WINGDIPAPI GdipAddPathRectanglesI(GpPath *path, GDIPCONST GpRect *rects, INT count)
1762 TRACE("(%p, %p, %d)\n", path, rects, count);
1764 if(!rects || count == 0)
1765 return InvalidParameter;
1770 rectsF = GdipAlloc(sizeof(GpRectF)*count);
1772 for(i = 0;i < count;i++){
1773 rectsF[i].X = (REAL)rects[i].X;
1774 rectsF[i].Y = (REAL)rects[i].Y;
1775 rectsF[i].Width = (REAL)rects[i].Width;
1776 rectsF[i].Height = (REAL)rects[i].Height;
1779 retstat = GdipAddPathRectangles(path, rectsF, count);
1785 GpStatus WINGDIPAPI GdipSetPathMarker(GpPath* path)
1789 TRACE("(%p)\n", path);
1792 return InvalidParameter;
1794 count = path->pathdata.Count;
1796 /* set marker flag */
1798 path->pathdata.Types[count-1] |= PathPointTypePathMarker;
1803 GpStatus WINGDIPAPI GdipClearPathMarkers(GpPath* path)
1808 TRACE("(%p)\n", path);
1811 return InvalidParameter;
1813 count = path->pathdata.Count;
1815 for(i = 0; i < count - 1; i++){
1816 path->pathdata.Types[i] &= ~PathPointTypePathMarker;
1822 GpStatus WINGDIPAPI GdipWindingModeOutline(GpPath *path, GpMatrix *matrix, REAL flatness)
1824 FIXME("stub: %p, %p, %.2f\n", path, matrix, flatness);
1825 return NotImplemented;