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 GdipClonePath(GpPath* path, GpPath **clone)
352 return InvalidParameter;
354 *clone = GdipAlloc(sizeof(GpPath));
355 if(!*clone) return OutOfMemory;
359 (*clone)->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
360 (*clone)->pathdata.Types = GdipAlloc(path->datalen);
361 if(!(*clone)->pathdata.Points || !(*clone)->pathdata.Types){
363 GdipFree((*clone)->pathdata.Points);
364 GdipFree((*clone)->pathdata.Types);
368 memcpy((*clone)->pathdata.Points, path->pathdata.Points,
369 path->datalen * sizeof(PointF));
370 memcpy((*clone)->pathdata.Types, path->pathdata.Types, path->datalen);
375 GpStatus WINGDIPAPI GdipClosePathFigure(GpPath* path)
378 return InvalidParameter;
380 if(path->pathdata.Count > 0){
381 path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
382 path->newfigure = TRUE;
388 GpStatus WINGDIPAPI GdipClosePathFigures(GpPath* path)
393 return InvalidParameter;
395 for(i = 1; i < path->pathdata.Count; i++){
396 if(path->pathdata.Types[i] == PathPointTypeStart)
397 path->pathdata.Types[i-1] |= PathPointTypeCloseSubpath;
400 path->newfigure = TRUE;
405 GpStatus WINGDIPAPI GdipCreatePath(GpFillMode fill, GpPath **path)
408 return InvalidParameter;
410 *path = GdipAlloc(sizeof(GpPath));
411 if(!*path) return OutOfMemory;
413 (*path)->fill = fill;
414 (*path)->newfigure = TRUE;
419 GpStatus WINGDIPAPI GdipCreatePath2(GDIPCONST GpPointF* points,
420 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
423 return InvalidParameter;
425 *path = GdipAlloc(sizeof(GpPath));
426 if(!*path) return OutOfMemory;
428 (*path)->pathdata.Points = GdipAlloc(count * sizeof(PointF));
429 (*path)->pathdata.Types = GdipAlloc(count);
431 if(!(*path)->pathdata.Points || !(*path)->pathdata.Types){
432 GdipFree((*path)->pathdata.Points);
433 GdipFree((*path)->pathdata.Types);
438 memcpy((*path)->pathdata.Points, points, count * sizeof(PointF));
439 memcpy((*path)->pathdata.Types, types, count);
440 (*path)->pathdata.Count = count;
441 (*path)->datalen = count;
443 (*path)->fill = fill;
444 (*path)->newfigure = TRUE;
449 GpStatus WINGDIPAPI GdipCreatePath2I(GDIPCONST GpPoint* points,
450 GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
456 ptF = GdipAlloc(sizeof(GpPointF)*count);
458 for(i = 0;i < count; i++){
459 ptF[i].X = (REAL)points[i].X;
460 ptF[i].Y = (REAL)points[i].Y;
463 ret = GdipCreatePath2(ptF, types, count, fill, path);
470 GpStatus WINGDIPAPI GdipDeletePath(GpPath *path)
473 return InvalidParameter;
475 GdipFree(path->pathdata.Points);
476 GdipFree(path->pathdata.Types);
482 GpStatus WINGDIPAPI GdipGetPathFillMode(GpPath *path, GpFillMode *fillmode)
484 if(!path || !fillmode)
485 return InvalidParameter;
487 *fillmode = path->fill;
492 GpStatus WINGDIPAPI GdipGetPathPoints(GpPath *path, GpPointF* points, INT count)
495 return InvalidParameter;
497 if(count < path->pathdata.Count)
498 return InsufficientBuffer;
500 memcpy(points, path->pathdata.Points, path->pathdata.Count * sizeof(GpPointF));
505 GpStatus WINGDIPAPI GdipGetPathPointsI(GpPath *path, GpPoint* points, INT count)
512 return InvalidParameter;
514 ptf = GdipAlloc(sizeof(GpPointF)*count);
515 if(!ptf) return OutOfMemory;
517 ret = GdipGetPathPoints(path,ptf,count);
519 for(i = 0;i < count;i++){
520 points[i].X = roundr(ptf[i].X);
521 points[i].Y = roundr(ptf[i].Y);
528 GpStatus WINGDIPAPI GdipGetPathTypes(GpPath *path, BYTE* types, INT count)
531 return InvalidParameter;
533 if(count < path->pathdata.Count)
534 return InsufficientBuffer;
536 memcpy(types, path->pathdata.Types, path->pathdata.Count);
541 /* Windows expands the bounding box to the maximum possible bounding box
542 * for a given pen. For example, if a line join can extend past the point
543 * it's joining by x units, the bounding box is extended by x units in every
544 * direction (even though this is too conservative for most cases). */
545 GpStatus WINGDIPAPI GdipGetPathWorldBounds(GpPath* path, GpRectF* bounds,
546 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
548 GpPointF * points, temp_pts[4];
550 REAL path_width = 1.0, width, height, temp, low_x, low_y, high_x, high_y;
552 /* Matrix and pen can be null. */
554 return InvalidParameter;
556 /* If path is empty just return. */
557 count = path->pathdata.Count;
559 bounds->X = bounds->Y = bounds->Width = bounds->Height = 0.0;
563 points = path->pathdata.Points;
565 low_x = high_x = points[0].X;
566 low_y = high_y = points[0].Y;
568 for(i = 1; i < count; i++){
569 low_x = min(low_x, points[i].X);
570 low_y = min(low_y, points[i].Y);
571 high_x = max(high_x, points[i].X);
572 high_y = max(high_y, points[i].Y);
575 width = high_x - low_x;
576 height = high_y - low_y;
578 /* This looks unusual but it's the only way I can imitate windows. */
580 temp_pts[0].X = low_x;
581 temp_pts[0].Y = low_y;
582 temp_pts[1].X = low_x;
583 temp_pts[1].Y = high_y;
584 temp_pts[2].X = high_x;
585 temp_pts[2].Y = high_y;
586 temp_pts[3].X = high_x;
587 temp_pts[3].Y = low_y;
589 GdipTransformMatrixPoints((GpMatrix*)matrix, temp_pts, 4);
590 low_x = temp_pts[0].X;
591 low_y = temp_pts[0].Y;
593 for(i = 1; i < 4; i++){
594 low_x = min(low_x, temp_pts[i].X);
595 low_y = min(low_y, temp_pts[i].Y);
599 width = height * fabs(matrix->matrix[2]) + width * fabs(matrix->matrix[0]);
600 height = height * fabs(matrix->matrix[3]) + temp * fabs(matrix->matrix[1]);
604 path_width = pen->width / 2.0;
607 path_width = max(path_width, pen->width * pen->miterlimit / 2.0);
608 /* FIXME: this should probably also check for the startcap */
609 if(pen->endcap & LineCapNoAnchor)
610 path_width = max(path_width, pen->width * 2.2);
614 width += 2.0 * path_width;
615 height += 2.0 * path_width;
620 bounds->Width = width;
621 bounds->Height = height;
626 GpStatus WINGDIPAPI GdipGetPathWorldBoundsI(GpPath* path, GpRect* bounds,
627 GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
632 ret = GdipGetPathWorldBounds(path,&boundsF,matrix,pen);
635 bounds->X = roundr(boundsF.X);
636 bounds->Y = roundr(boundsF.Y);
637 bounds->Width = roundr(boundsF.Width);
638 bounds->Height = roundr(boundsF.Height);
644 GpStatus WINGDIPAPI GdipGetPointCount(GpPath *path, INT *count)
647 return InvalidParameter;
649 *count = path->pathdata.Count;
654 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPointI(GpPath* path, INT x, INT y,
655 GpPen *pen, GpGraphics *graphics, BOOL *result)
660 return InvalidParameter;
663 FIXME("not implemented\n");
665 return NotImplemented;
668 GpStatus WINGDIPAPI GdipStartPathFigure(GpPath *path)
671 return InvalidParameter;
673 path->newfigure = TRUE;
678 GpStatus WINGDIPAPI GdipResetPath(GpPath *path)
681 return InvalidParameter;
683 path->pathdata.Count = 0;
684 path->newfigure = TRUE;
685 path->fill = FillModeAlternate;
690 GpStatus WINGDIPAPI GdipSetPathFillMode(GpPath *path, GpFillMode fill)
693 return InvalidParameter;
700 GpStatus WINGDIPAPI GdipTransformPath(GpPath *path, GpMatrix *matrix)
703 return InvalidParameter;
705 if(path->pathdata.Count == 0)
708 return GdipTransformMatrixPoints(matrix, path->pathdata.Points,
709 path->pathdata.Count);