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 /* make sure path has enough space for len more points */
37 static BOOL lengthen_path(GpPath *path, INT len)
39 /* initial allocation */
40 if(path->datalen == 0){
41 path->datalen = len * 2;
43 path->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
44 if(!path->pathdata.Points) return FALSE;
46 path->pathdata.Types = GdipAlloc(path->datalen);
47 if(!path->pathdata.Types){
48 GdipFree(path->pathdata.Points);
52 /* reallocation, double size of arrays */
53 else if(path->datalen - path->pathdata.Count < len){
54 while(path->datalen - path->pathdata.Count < len)
57 path->pathdata.Points = HeapReAlloc(GetProcessHeap(), 0,
58 path->pathdata.Points, path->datalen * sizeof(PointF));
59 if(!path->pathdata.Points) return FALSE;
61 path->pathdata.Types = HeapReAlloc(GetProcessHeap(), 0,
62 path->pathdata.Types, path->datalen);
63 if(!path->pathdata.Types) return FALSE;
69 GpStatus WINGDIPAPI GdipAddPathArc(GpPath *path, REAL x1, REAL y1, REAL x2,
70 REAL y2, REAL startAngle, REAL sweepAngle)
72 INT count, old_count, i;
75 return InvalidParameter;
77 count = arc2polybezier(NULL, x1, y1, x2, y2, startAngle, sweepAngle);
81 if(!lengthen_path(path, count))
84 old_count = path->pathdata.Count;
85 arc2polybezier(&path->pathdata.Points[old_count], x1, y1, x2, y2,
86 startAngle, sweepAngle);
88 for(i = 0; i < count; i++){
89 path->pathdata.Types[old_count + i] = PathPointTypeBezier;
92 path->pathdata.Types[old_count] =
93 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
94 path->newfigure = FALSE;
95 path->pathdata.Count += count;
100 GpStatus WINGDIPAPI GdipAddPathArcI(GpPath *path, INT x1, INT y1, INT x2,
101 INT y2, REAL startAngle, REAL sweepAngle)
103 return GdipAddPathArc(path,(REAL)x1,(REAL)y1,(REAL)x2,(REAL)y2,startAngle,sweepAngle);
106 GpStatus WINGDIPAPI GdipAddPathBezier(GpPath *path, REAL x1, REAL y1, REAL x2,
107 REAL y2, REAL x3, REAL y3, REAL x4, REAL y4)
112 return InvalidParameter;
114 if(!lengthen_path(path, 4))
117 old_count = path->pathdata.Count;
119 path->pathdata.Points[old_count].X = x1;
120 path->pathdata.Points[old_count].Y = y1;
121 path->pathdata.Points[old_count + 1].X = x2;
122 path->pathdata.Points[old_count + 1].Y = y2;
123 path->pathdata.Points[old_count + 2].X = x3;
124 path->pathdata.Points[old_count + 2].Y = y3;
125 path->pathdata.Points[old_count + 3].X = x4;
126 path->pathdata.Points[old_count + 3].Y = y4;
128 path->pathdata.Types[old_count] =
129 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
130 path->pathdata.Types[old_count + 1] = PathPointTypeBezier;
131 path->pathdata.Types[old_count + 2] = PathPointTypeBezier;
132 path->pathdata.Types[old_count + 3] = PathPointTypeBezier;
134 path->newfigure = FALSE;
135 path->pathdata.Count += 4;
140 GpStatus WINGDIPAPI GdipAddPathBezierI(GpPath *path, INT x1, INT y1, INT x2,
141 INT y2, INT x3, INT y3, INT x4, INT y4)
143 return GdipAddPathBezier(path,(REAL)x1,(REAL)y1,(REAL)x2,(REAL)y2,(REAL)x3,(REAL)y3,
147 GpStatus WINGDIPAPI GdipAddPathBeziers(GpPath *path, GDIPCONST GpPointF *points,
152 if(!path || !points || ((count - 1) % 3))
153 return InvalidParameter;
155 if(!lengthen_path(path, count))
158 old_count = path->pathdata.Count;
160 for(i = 0; i < count; i++){
161 path->pathdata.Points[old_count + i].X = points[i].X;
162 path->pathdata.Points[old_count + i].Y = points[i].Y;
163 path->pathdata.Types[old_count + i] = PathPointTypeBezier;
166 path->pathdata.Types[old_count] =
167 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
168 path->newfigure = FALSE;
169 path->pathdata.Count += count;
174 GpStatus WINGDIPAPI GdipAddPathBeziersI(GpPath *path, GDIPCONST GpPoint *points,
181 if(!points || ((count - 1) % 3))
182 return InvalidParameter;
184 ptsF = GdipAlloc(sizeof(GpPointF) * count);
188 for(i = 0; i < count; i++){
189 ptsF[i].X = (REAL)points[i].X;
190 ptsF[i].Y = (REAL)points[i].Y;
193 ret = GdipAddPathBeziers(path, ptsF, count);
199 GpStatus WINGDIPAPI GdipAddPathEllipse(GpPath *path, REAL x, REAL y, REAL width,
202 INT old_count, numpts;
205 return InvalidParameter;
207 if(!lengthen_path(path, MAX_ARC_PTS))
210 old_count = path->pathdata.Count;
211 if((numpts = arc2polybezier(&path->pathdata.Points[old_count], x, y, width,
212 height, 0.0, 360.0)) != MAX_ARC_PTS){
213 ERR("expected %d points but got %d\n", MAX_ARC_PTS, numpts);
217 memset(&path->pathdata.Types[old_count + 1], PathPointTypeBezier,
220 /* An ellipse is an intrinsic figure (always is its own subpath). */
221 path->pathdata.Types[old_count] = PathPointTypeStart;
222 path->pathdata.Types[old_count + MAX_ARC_PTS - 1] |= PathPointTypeCloseSubpath;
223 path->newfigure = TRUE;
224 path->pathdata.Count += MAX_ARC_PTS;
229 GpStatus WINGDIPAPI GdipAddPathEllipseI(GpPath *path, INT x, INT y, INT width,
232 return GdipAddPathEllipse(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
235 GpStatus WINGDIPAPI GdipAddPathLine2(GpPath *path, GDIPCONST GpPointF *points,
241 return InvalidParameter;
243 if(!lengthen_path(path, count))
246 old_count = path->pathdata.Count;
248 for(i = 0; i < count; i++){
249 path->pathdata.Points[old_count + i].X = points[i].X;
250 path->pathdata.Points[old_count + i].Y = points[i].Y;
251 path->pathdata.Types[old_count + i] = PathPointTypeLine;
255 path->pathdata.Types[old_count] = PathPointTypeStart;
256 path->newfigure = FALSE;
259 path->pathdata.Count += count;
264 GpStatus WINGDIPAPI GdipAddPathLine2I(GpPath *path, GDIPCONST GpPoint *points, INT count)
271 return InvalidParameter;
273 pointsF = GdipAlloc(sizeof(GpPointF) * count);
274 if(!pointsF) return OutOfMemory;
276 for(i = 0;i < count; i++){
277 pointsF[i].X = (REAL)points[i].X;
278 pointsF[i].Y = (REAL)points[i].Y;
281 stat = GdipAddPathLine2(path, pointsF, count);
288 GpStatus WINGDIPAPI GdipAddPathLine(GpPath *path, REAL x1, REAL y1, REAL x2, REAL y2)
293 return InvalidParameter;
295 if(!lengthen_path(path, 2))
298 old_count = path->pathdata.Count;
300 path->pathdata.Points[old_count].X = x1;
301 path->pathdata.Points[old_count].Y = y1;
302 path->pathdata.Points[old_count + 1].X = x2;
303 path->pathdata.Points[old_count + 1].Y = y2;
305 path->pathdata.Types[old_count] =
306 (path->newfigure ? PathPointTypeStart : PathPointTypeLine);
307 path->pathdata.Types[old_count + 1] = PathPointTypeLine;
309 path->newfigure = FALSE;
310 path->pathdata.Count += 2;
315 GpStatus WINGDIPAPI GdipAddPathLineI(GpPath *path, INT x1, INT y1, INT x2, INT y2)
317 return GdipAddPathLine(path, (REAL)x1, (REAL)y1, (REAL)x2, (REAL)y2);
320 GpStatus WINGDIPAPI GdipAddPathPath(GpPath *path, GDIPCONST GpPath* addingPath,
323 INT old_count, count;
325 if(!path || !addingPath)
326 return InvalidParameter;
328 old_count = path->pathdata.Count;
329 count = addingPath->pathdata.Count;
331 if(!lengthen_path(path, count))
334 memcpy(&path->pathdata.Points[old_count], addingPath->pathdata.Points,
335 count * sizeof(GpPointF));
336 memcpy(&path->pathdata.Types[old_count], addingPath->pathdata.Types, count);
338 if(path->newfigure || !connect)
339 path->pathdata.Types[old_count] = PathPointTypeStart;
341 path->pathdata.Types[old_count] = PathPointTypeLine;
343 path->newfigure = FALSE;
344 path->pathdata.Count += count;
349 GpStatus WINGDIPAPI GdipAddPathPolygon(GpPath *path, GDIPCONST GpPointF *points, INT count)
353 if(!path || !points || count < 3)
354 return InvalidParameter;
356 if(!lengthen_path(path, count))
359 old_count = path->pathdata.Count;
361 memcpy(&path->pathdata.Points[old_count], points, count*sizeof(GpPointF));
362 memset(&path->pathdata.Types[old_count + 1], PathPointTypeLine, count - 1);
364 /* A polygon is an intrinsic figure */
365 path->pathdata.Types[old_count] = PathPointTypeStart;
366 path->pathdata.Types[old_count + count - 1] |= PathPointTypeCloseSubpath;
367 path->newfigure = TRUE;
368 path->pathdata.Count += count;
373 GpStatus WINGDIPAPI GdipAddPathPolygonI(GpPath *path, GDIPCONST GpPoint *points, INT count)
379 if(!points || count < 3)
380 return InvalidParameter;
382 ptf = GdipAlloc(sizeof(GpPointF) * count);
386 for(i = 0; i < count; i++){
387 ptf[i].X = (REAL)points[i].X;
388 ptf[i].Y = (REAL)points[i].Y;
391 status = GdipAddPathPolygon(path, ptf, count);
398 GpStatus WINGDIPAPI GdipClonePath(GpPath* path, GpPath **clone)
401 return InvalidParameter;
403 *clone = GdipAlloc(sizeof(GpPath));
404 if(!*clone) return OutOfMemory;
408 (*clone)->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
409 (*clone)->pathdata.Types = GdipAlloc(path->datalen);
410 if(!(*clone)->pathdata.Points || !(*clone)->pathdata.Types){
412 GdipFree((*clone)->pathdata.Points);
413 GdipFree((*clone)->pathdata.Types);
417 memcpy((*clone)->pathdata.Points, path->pathdata.Points,
418 path->datalen * sizeof(PointF));
419 memcpy((*clone)->pathdata.Types, path->pathdata.Types, path->datalen);
424 GpStatus WINGDIPAPI GdipClosePathFigure(GpPath* path)
427 return InvalidParameter;
429 if(path->pathdata.Count > 0){
430 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
431 path->newfigure = TRUE;
437 GpStatus WINGDIPAPI GdipClosePathFigures(GpPath* path)
442 return InvalidParameter;
444 for(i = 1; i < path->pathdata.Count; i++){
445 if(path->pathdata.Types[i] == PathPointTypeStart)
446 path->pathdata.Types[i-1] |= PathPointTypeCloseSubpath;
449 path->newfigure = TRUE;
454 GpStatus WINGDIPAPI GdipCreatePath(GpFillMode fill, GpPath **path)
457 return InvalidParameter;
459 *path = GdipAlloc(sizeof(GpPath));
460 if(!*path) return OutOfMemory;
462 (*path)->fill = fill;
463 (*path)->newfigure = TRUE;
468 GpStatus WINGDIPAPI GdipCreatePath2(GDIPCONST GpPointF* points,
469 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
472 return InvalidParameter;
474 *path = GdipAlloc(sizeof(GpPath));
475 if(!*path) return OutOfMemory;
477 (*path)->pathdata.Points = GdipAlloc(count * sizeof(PointF));
478 (*path)->pathdata.Types = GdipAlloc(count);
480 if(!(*path)->pathdata.Points || !(*path)->pathdata.Types){
481 GdipFree((*path)->pathdata.Points);
482 GdipFree((*path)->pathdata.Types);
487 memcpy((*path)->pathdata.Points, points, count * sizeof(PointF));
488 memcpy((*path)->pathdata.Types, types, count);
489 (*path)->pathdata.Count = count;
490 (*path)->datalen = count;
492 (*path)->fill = fill;
493 (*path)->newfigure = TRUE;
498 GpStatus WINGDIPAPI GdipCreatePath2I(GDIPCONST GpPoint* points,
499 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
505 ptF = GdipAlloc(sizeof(GpPointF)*count);
507 for(i = 0;i < count; i++){
508 ptF[i].X = (REAL)points[i].X;
509 ptF[i].Y = (REAL)points[i].Y;
512 ret = GdipCreatePath2(ptF, types, count, fill, path);
519 GpStatus WINGDIPAPI GdipDeletePath(GpPath *path)
522 return InvalidParameter;
524 GdipFree(path->pathdata.Points);
525 GdipFree(path->pathdata.Types);
531 GpStatus WINGDIPAPI GdipGetPathData(GpPath *path, GpPathData* pathData)
533 if(!path || !pathData)
534 return InvalidParameter;
536 /* Only copy data. pathData allocation/freeing controlled by wrapper class.
537 Assumed that pathData is enough wide to get all data - controlled by wrapper too. */
538 memcpy(pathData->Points, path->pathdata.Points, sizeof(PointF) * pathData->Count);
539 memcpy(pathData->Types , path->pathdata.Types , pathData->Count);
544 GpStatus WINGDIPAPI GdipGetPathFillMode(GpPath *path, GpFillMode *fillmode)
546 if(!path || !fillmode)
547 return InvalidParameter;
549 *fillmode = path->fill;
554 GpStatus WINGDIPAPI GdipGetPathLastPoint(GpPath* path, GpPointF* lastPoint)
558 if(!path || !lastPoint)
559 return InvalidParameter;
561 count = path->pathdata.Count;
563 *lastPoint = path->pathdata.Points[count-1];
568 GpStatus WINGDIPAPI GdipGetPathPoints(GpPath *path, GpPointF* points, INT count)
571 return InvalidParameter;
573 if(count < path->pathdata.Count)
574 return InsufficientBuffer;
576 memcpy(points, path->pathdata.Points, path->pathdata.Count * sizeof(GpPointF));
581 GpStatus WINGDIPAPI GdipGetPathPointsI(GpPath *path, GpPoint* points, INT count)
588 return InvalidParameter;
590 ptf = GdipAlloc(sizeof(GpPointF)*count);
591 if(!ptf) return OutOfMemory;
593 ret = GdipGetPathPoints(path,ptf,count);
595 for(i = 0;i < count;i++){
596 points[i].X = roundr(ptf[i].X);
597 points[i].Y = roundr(ptf[i].Y);
604 GpStatus WINGDIPAPI GdipGetPathTypes(GpPath *path, BYTE* types, INT count)
607 return InvalidParameter;
609 if(count < path->pathdata.Count)
610 return InsufficientBuffer;
612 memcpy(types, path->pathdata.Types, path->pathdata.Count);
617 /* Windows expands the bounding box to the maximum possible bounding box
618 * for a given pen. For example, if a line join can extend past the point
619 * it's joining by x units, the bounding box is extended by x units in every
620 * direction (even though this is too conservative for most cases). */
621 GpStatus WINGDIPAPI GdipGetPathWorldBounds(GpPath* path, GpRectF* bounds,
622 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
624 GpPointF * points, temp_pts[4];
626 REAL path_width = 1.0, width, height, temp, low_x, low_y, high_x, high_y;
628 /* Matrix and pen can be null. */
630 return InvalidParameter;
632 /* If path is empty just return. */
633 count = path->pathdata.Count;
635 bounds->X = bounds->Y = bounds->Width = bounds->Height = 0.0;
639 points = path->pathdata.Points;
641 low_x = high_x = points[0].X;
642 low_y = high_y = points[0].Y;
644 for(i = 1; i < count; i++){
645 low_x = min(low_x, points[i].X);
646 low_y = min(low_y, points[i].Y);
647 high_x = max(high_x, points[i].X);
648 high_y = max(high_y, points[i].Y);
651 width = high_x - low_x;
652 height = high_y - low_y;
654 /* This looks unusual but it's the only way I can imitate windows. */
656 temp_pts[0].X = low_x;
657 temp_pts[0].Y = low_y;
658 temp_pts[1].X = low_x;
659 temp_pts[1].Y = high_y;
660 temp_pts[2].X = high_x;
661 temp_pts[2].Y = high_y;
662 temp_pts[3].X = high_x;
663 temp_pts[3].Y = low_y;
665 GdipTransformMatrixPoints((GpMatrix*)matrix, temp_pts, 4);
666 low_x = temp_pts[0].X;
667 low_y = temp_pts[0].Y;
669 for(i = 1; i < 4; i++){
670 low_x = min(low_x, temp_pts[i].X);
671 low_y = min(low_y, temp_pts[i].Y);
675 width = height * fabs(matrix->matrix[2]) + width * fabs(matrix->matrix[0]);
676 height = height * fabs(matrix->matrix[3]) + temp * fabs(matrix->matrix[1]);
680 path_width = pen->width / 2.0;
683 path_width = max(path_width, pen->width * pen->miterlimit / 2.0);
684 /* FIXME: this should probably also check for the startcap */
685 if(pen->endcap & LineCapNoAnchor)
686 path_width = max(path_width, pen->width * 2.2);
690 width += 2.0 * path_width;
691 height += 2.0 * path_width;
696 bounds->Width = width;
697 bounds->Height = height;
702 GpStatus WINGDIPAPI GdipGetPathWorldBoundsI(GpPath* path, GpRect* bounds,
703 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
708 ret = GdipGetPathWorldBounds(path,&boundsF,matrix,pen);
711 bounds->X = roundr(boundsF.X);
712 bounds->Y = roundr(boundsF.Y);
713 bounds->Width = roundr(boundsF.Width);
714 bounds->Height = roundr(boundsF.Height);
720 GpStatus WINGDIPAPI GdipGetPointCount(GpPath *path, INT *count)
723 return InvalidParameter;
725 *count = path->pathdata.Count;
730 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPointI(GpPath* path, INT x, INT y,
731 GpPen *pen, GpGraphics *graphics, BOOL *result)
733 return GdipIsOutlineVisiblePathPoint(path, x, y, pen, graphics, result);
736 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPoint(GpPath* path, REAL x, REAL y,
737 GpPen *pen, GpGraphics *graphics, BOOL *result)
742 return InvalidParameter;
745 FIXME("not implemented\n");
747 return NotImplemented;
750 GpStatus WINGDIPAPI GdipIsVisiblePathPointI(GpPath* path, INT x, INT y, GpGraphics *graphics, BOOL *result)
752 return GdipIsVisiblePathPoint(path, x, y, graphics, result);
755 GpStatus WINGDIPAPI GdipIsVisiblePathPoint(GpPath* path, REAL x, REAL y, GpGraphics *graphics, BOOL *result)
759 if(!path) return InvalidParameter;
762 FIXME("not implemented\n");
764 return NotImplemented;
767 GpStatus WINGDIPAPI GdipStartPathFigure(GpPath *path)
770 return InvalidParameter;
772 path->newfigure = TRUE;
777 GpStatus WINGDIPAPI GdipResetPath(GpPath *path)
780 return InvalidParameter;
782 path->pathdata.Count = 0;
783 path->newfigure = TRUE;
784 path->fill = FillModeAlternate;
789 GpStatus WINGDIPAPI GdipSetPathFillMode(GpPath *path, GpFillMode fill)
792 return InvalidParameter;
799 GpStatus WINGDIPAPI GdipTransformPath(GpPath *path, GpMatrix *matrix)
802 return InvalidParameter;
804 if(path->pathdata.Count == 0)
807 return GdipTransformMatrixPoints(matrix, path->pathdata.Points,
808 path->pathdata.Count);
811 GpStatus WINGDIPAPI GdipAddPathRectangle(GpPath *path, REAL x, REAL y,
812 REAL width, REAL height)
819 if(!path || width < 0.0 || height < 0.0)
820 return InvalidParameter;
822 /* make a backup copy of path data */
823 if((retstat = GdipClonePath(path, &backup)) != Ok)
826 /* rectangle should start as new path */
827 old_new = path->newfigure;
828 path->newfigure = TRUE;
829 if((retstat = GdipAddPathLine(path,x,y,x+width,y)) != Ok){
830 path->newfigure = old_new;
839 if((retstat = GdipAddPathLine2(path, ptf, 2)) != Ok) goto fail;
840 path->pathdata.Types[path->pathdata.Count-1] |= PathPointTypeCloseSubpath;
843 GdipDeletePath(backup);
848 GdipDeletePath(path);
849 GdipClonePath(backup, &path);
850 GdipDeletePath(backup);
855 GpStatus WINGDIPAPI GdipAddPathRectangleI(GpPath *path, INT x, INT y,
856 INT width, INT height)
858 return GdipAddPathRectangle(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
861 GpStatus WINGDIPAPI GdipAddPathRectangles(GpPath *path, GDIPCONST GpRectF *rects, INT count)
867 /* count == 0 - verified condition */
868 if(!path || !rects || count == 0)
869 return InvalidParameter;
874 /* make a backup copy */
875 if((retstat = GdipClonePath(path, &backup)) != Ok)
878 for(i = 0; i < count; i++){
879 if((retstat = GdipAddPathRectangle(path,rects[i].X,rects[i].Y,rects[i].Width,rects[i].Height)) != Ok)
884 GdipDeletePath(backup);
889 GdipDeletePath(path);
890 GdipClonePath(backup, &path);
891 GdipDeletePath(backup);
896 GpStatus WINGDIPAPI GdipAddPathRectanglesI(GpPath *path, GDIPCONST GpRect *rects, INT count)
902 if(!rects || count == 0)
903 return InvalidParameter;
908 rectsF = GdipAlloc(sizeof(GpRectF)*count);
910 for(i = 0;i < count;i++){
911 rectsF[i].X = (REAL)rects[i].X;
912 rectsF[i].Y = (REAL)rects[i].Y;
913 rectsF[i].Width = (REAL)rects[i].Width;
914 rectsF[i].Height = (REAL)rects[i].Height;
917 retstat = GdipAddPathRectangles(path, rectsF, count);
923 GpStatus WINGDIPAPI GdipSetPathMarker(GpPath* path)
928 return InvalidParameter;
930 count = path->pathdata.Count;
932 /* set marker flag */
934 path->pathdata.Types[count-1] |= PathPointTypePathMarker;
939 GpStatus WINGDIPAPI GdipClearPathMarkers(GpPath* path)
945 return InvalidParameter;
947 count = path->pathdata.Count;
949 for(i = 0; i < count - 1; i++){
950 path->pathdata.Types[i] &= ~PathPointTypePathMarker;