dlls/gdiplus/graphicspath.c

   1 /*
   2  * Copyright (C) 2007 Google (Evan Stade)
   3  *
   4  * This library is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU Lesser General Public
   6  * License as published by the Free Software Foundation; either
   7  * version 2.1 of the License, or (at your option) any later version.
   8  *
   9  * This library is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * Lesser General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU Lesser General Public
  15  * License along with this library; if not, write to the Free Software
  16  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
  17  *
  18  */
  19
  20 #include <stdarg.h>
  21 #include <math.h>
  22
  23 #include "windef.h"
  24 #include "winbase.h"
  25 #include "winuser.h"
  26 #include "wingdi.h"
  27
  28 #include "objbase.h"
  29
  30 #include "gdiplus.h"
  31 #include "gdiplus_private.h"
  32 #include "wine/debug.h"
  33
  34 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
  35
  36 typedef struct path_list_node_t path_list_node_t;
  37 struct path_list_node_t {
  38     GpPointF pt;
  39     BYTE type; /* PathPointTypeStart or PathPointTypeLine */
  40     path_list_node_t *next;
  41 };
  42
  43 /* init list */
  44 static BOOL init_path_list(path_list_node_t **node, REAL x, REAL y)
  45 {
  46     *node = GdipAlloc(sizeof(path_list_node_t));
  47     if(!*node)
  48         return FALSE;
  49
  50     (*node)->pt.X = x;
  51     (*node)->pt.Y = y;
  52     (*node)->type = PathPointTypeStart;
  53     (*node)->next = NULL;
  54
  55     return TRUE;
  56 }
  57
  58 /* free all nodes including argument */
  59 static void free_path_list(path_list_node_t *node)
  60 {
  61     path_list_node_t *n = node;
  62
  63     while(n){
  64         n = n->next;
  65         GdipFree(node);
  66         node = n;
  67     }
  68 }
  69
  70 /* Add a node after 'node' */
  71 /*
  72  * Returns
  73  *  pointer on success
  74  *  NULL    on allocation problems
  75  */
  76 static path_list_node_t* add_path_list_node(path_list_node_t *node, REAL x, REAL y, BOOL type)
  77 {
  78     path_list_node_t *new;
  79
  80     new = GdipAlloc(sizeof(path_list_node_t));
  81     if(!new)
  82         return NULL;
  83
  84     new->pt.X  = x;
  85     new->pt.Y  = y;
  86     new->type  = type;
  87     new->next  = node->next;
  88     node->next = new;
  89
  90     return new;
  91 }
  92
  93 /* returns element count */
  94 static INT path_list_count(path_list_node_t *node)
  95 {
  96     INT count = 1;
  97
  98     while((node = node->next))
  99         ++count;
 100
 101     return count;
 102 }
 103
 104 /* GdipFlattenPath helper */
 105 /*
 106  * Used to recursively flatten single Bezier curve
 107  * Parameters:
 108  *  - start   : pointer to start point node;
 109  *  - (x2, y2): first control point;
 110  *  - (x3, y3): second control point;
 111  *  - end     : pointer to end point node
 112  *  - flatness: admissible error of linear approximation.
 113  *
 114  * Return value:
 115  *  TRUE : success
 116  *  FALSE: out of memory
 117  *
 118  * TODO: used quality criteria should be revised to match native as
 119  *       closer as possible.
 120  */
 121 static BOOL flatten_bezier(path_list_node_t *start, REAL x2, REAL y2, REAL x3, REAL y3,
 122                            path_list_node_t *end, REAL flatness)
 123 {
 124     /* this 5 middle points with start/end define to half-curves */
 125     GpPointF mp[5];
 126     GpPointF pt, pt_st;
 127     path_list_node_t *node;
 128
 129     /* calculate bezier curve middle points == new control points */
 130     mp[0].X = (start->pt.X + x2) / 2.0;
 131     mp[0].Y = (start->pt.Y + y2) / 2.0;
 132     /* middle point between control points */
 133     pt.X = (x2 + x3) / 2.0;
 134     pt.Y = (y2 + y3) / 2.0;
 135     mp[1].X = (mp[0].X + pt.X) / 2.0;
 136     mp[1].Y = (mp[0].Y + pt.Y) / 2.0;
 137     mp[4].X = (end->pt.X + x3) / 2.0;
 138     mp[4].Y = (end->pt.Y + y3) / 2.0;
 139     mp[3].X = (mp[4].X + pt.X) / 2.0;
 140     mp[3].Y = (mp[4].Y + pt.Y) / 2.0;
 141
 142     mp[2].X = (mp[1].X + mp[3].X) / 2.0;
 143     mp[2].Y = (mp[1].Y + mp[3].Y) / 2.0;
 144
 145     pt = end->pt;
 146     pt_st = start->pt;
 147     /* check flatness as a half of distance between middle point and a linearized path */
 148     if(fabs(((pt.Y - pt_st.Y)*mp[2].X + (pt_st.X - pt.X)*mp[2].Y +
 149         (pt_st.Y*pt.X - pt_st.X*pt.Y))) <=
 150         (0.5 * flatness*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 halves */
 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     float maxY;
 844     float scale;
 845     float ascent;
 846 };
 847
 848 static GpStatus format_string_callback(HDC dc,
 849     GDIPCONST WCHAR *string, INT index, INT length, GDIPCONST GpFont *font,
 850     GDIPCONST RectF *rect, GDIPCONST GpStringFormat *format,
 851     INT lineno, const RectF *bounds, INT *underlined_indexes,
 852     INT underlined_index_count, void *priv)
 853 {
 854     static const MAT2 identity = { {0,1}, {0,0}, {0,0}, {0,1} };
 855     struct format_string_args *args = priv;
 856     GpPath *path = args->path;
 857     GpStatus status = Ok;
 858     float x = rect->X + (bounds->X - rect->X) * args->scale;
 859     float y = rect->Y + (bounds->Y - rect->Y) * args->scale;
 860     int i;
 861
 862     if (underlined_index_count)
 863         FIXME("hotkey underlines not drawn yet\n");
 864
 865     if (y + bounds->Height * args->scale > args->maxY)
 866         args->maxY = y + bounds->Height * args->scale;
 867
 868     for (i = index; i < length; ++i)
 869     {
 870         GLYPHMETRICS gm;
 871         TTPOLYGONHEADER *ph = NULL;
 872         char *start;
 873         DWORD len, ofs = 0;
 874         len = GetGlyphOutlineW(dc, string[i], GGO_BEZIER, &gm, 0, NULL, &identity);
 875         if (len == GDI_ERROR)
 876         {
 877             status = GenericError;
 878             break;
 879         }
 880         ph = GdipAlloc(len);
 881         start = (char *)ph;
 882         if (!ph || !lengthen_path(path, len / sizeof(POINTFX)))
 883         {
 884             status = OutOfMemory;
 885             break;
 886         }
 887         GetGlyphOutlineW(dc, string[i], GGO_BEZIER, &gm, len, start, &identity);
 888
 889         ofs = 0;
 890         while (ofs < len)
 891         {
 892             DWORD ofs_start = ofs;
 893             ph = (TTPOLYGONHEADER*)&start[ofs];
 894             path->pathdata.Types[path->pathdata.Count] = PathPointTypeStart;
 895             path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(ph->pfxStart.x) * args->scale;
 896             path->pathdata.Points[path->pathdata.Count++].Y = y + args->ascent - fromfixedpoint(ph->pfxStart.y) * args->scale;
 897             TRACE("Starting at count %i with pos %f, %f)\n", path->pathdata.Count, x, y);
 898             ofs += sizeof(*ph);
 899             while (ofs - ofs_start < ph->cb)
 900             {
 901                 TTPOLYCURVE *curve = (TTPOLYCURVE*)&start[ofs];
 902                 int j;
 903                 ofs += sizeof(TTPOLYCURVE) + (curve->cpfx - 1) * sizeof(POINTFX);
 904
 905                 switch (curve->wType)
 906                 {
 907                 case TT_PRIM_LINE:
 908                     for (j = 0; j < curve->cpfx; ++j)
 909                     {
 910                         path->pathdata.Types[path->pathdata.Count] = PathPointTypeLine;
 911                         path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(curve->apfx[j].x) * args->scale;
 912                         path->pathdata.Points[path->pathdata.Count++].Y = y + args->ascent - fromfixedpoint(curve->apfx[j].y) * args->scale;
 913                     }
 914                     break;
 915                 case TT_PRIM_CSPLINE:
 916                     for (j = 0; j < curve->cpfx; ++j)
 917                     {
 918                         path->pathdata.Types[path->pathdata.Count] = PathPointTypeBezier;
 919                         path->pathdata.Points[path->pathdata.Count].X = x + fromfixedpoint(curve->apfx[j].x) * args->scale;
 920                         path->pathdata.Points[path->pathdata.Count++].Y = y + args->ascent - fromfixedpoint(curve->apfx[j].y) * args->scale;
 921                     }
 922                     break;
 923                 default:
 924                     ERR("Unhandled type: %u\n", curve->wType);
 925                     status = GenericError;
 926                 }
 927             }
 928             path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
 929         }
 930         path->newfigure = TRUE;
 931         x += gm.gmCellIncX * args->scale;
 932         y += gm.gmCellIncY * args->scale;
 933
 934         GdipFree(ph);
 935         if (status != Ok)
 936             break;
 937     }
 938
 939     return status;
 940 }
 941
 942 GpStatus WINGDIPAPI GdipAddPathString(GpPath* path, GDIPCONST WCHAR* string, INT length, GDIPCONST GpFontFamily* family, INT style, REAL emSize, GDIPCONST RectF* layoutRect, GDIPCONST GpStringFormat* format)
 943 {
 944     GpFont *font;
 945     GpStatus status;
 946     LOGFONTW lfw;
 947     HANDLE hfont;
 948     HDC dc;
 949     GpPath *backup;
 950     struct format_string_args args;
 951     int i;
 952     UINT16 native_height;
 953     RectF scaled_layout_rect;
 954     TEXTMETRICW textmetric;
 955
 956     FIXME("(%p, %s, %d, %p, %d, %f, %p, %p): stub\n", path, debugstr_w(string), length, family, style, emSize, layoutRect, format);
 957     if (!path || !string || !family || !emSize || !layoutRect || !format)
 958         return InvalidParameter;
 959
 960     status = GdipGetEmHeight(family, style, &native_height);
 961     if (status != Ok)
 962         return status;
 963
 964     scaled_layout_rect.X = layoutRect->X;
 965     scaled_layout_rect.Y = layoutRect->Y;
 966     scaled_layout_rect.Width = layoutRect->Width * native_height / emSize;
 967     scaled_layout_rect.Height = layoutRect->Height * native_height / emSize;
 968
 969     status = GdipCreateFont(family, native_height, style, UnitPixel, &font);
 970     if (status != Ok)
 971         return status;
 972
 973     get_log_fontW(font, NULL, &lfw);
 974     hfont = CreateFontIndirectW(&lfw);
 975     if (!hfont)
 976     {
 977         WARN("Failed to create font\n");
 978         return GenericError;
 979     }
 980
 981     if ((status = GdipClonePath(path, &backup)) != Ok)
 982     {
 983         DeleteObject(hfont);
 984         return status;
 985     }
 986
 987     dc = CreateCompatibleDC(0);
 988     SelectObject(dc, hfont);
 989
 990     GetTextMetricsW(dc, &textmetric);
 991
 992     args.path = path;
 993     args.maxY = 0;
 994     args.scale = emSize / native_height;
 995     args.ascent = textmetric.tmAscent * args.scale;
 996     status = gdip_format_string(dc, string, length, NULL, &scaled_layout_rect, format, format_string_callback, &args);
 997
 998     DeleteDC(dc);
 999     DeleteObject(hfont);
1000
1001     if (status != Ok) /* free backup */
1002     {
1003         GdipFree(path->pathdata.Points);
1004         GdipFree(path->pathdata.Types);
1005         *path = *backup;
1006         GdipFree(backup);
1007         return status;
1008     }
1009     if (format && format->vertalign == StringAlignmentCenter && layoutRect->Y + args.maxY < layoutRect->Height)
1010     {
1011         float inc = layoutRect->Height + layoutRect->Y - args.maxY;
1012         inc /= 2;
1013         for (i = backup->pathdata.Count; i < path->pathdata.Count; ++i)
1014             path->pathdata.Points[i].Y += inc;
1015     } else if (format && format->vertalign == StringAlignmentFar) {
1016         float inc = layoutRect->Height + layoutRect->Y - args.maxY;
1017         for (i = backup->pathdata.Count; i < path->pathdata.Count; ++i)
1018             path->pathdata.Points[i].Y += inc;
1019     }
1020     GdipDeletePath(backup);
1021     return status;
1022 }
1023
1024 GpStatus WINGDIPAPI GdipAddPathStringI(GpPath* path, GDIPCONST WCHAR* string, INT length, GDIPCONST GpFontFamily* family, INT style, REAL emSize, GDIPCONST Rect* layoutRect, GDIPCONST GpStringFormat* format)
1025 {
1026     if (layoutRect)
1027     {
1028         RectF layoutRectF = {
1029             (REAL)layoutRect->X,
1030             (REAL)layoutRect->Y,
1031             (REAL)layoutRect->Width,
1032             (REAL)layoutRect->Height
1033         };
1034         return GdipAddPathString(path, string, length, family, style, emSize, &layoutRectF, format);
1035     }
1036     return InvalidParameter;
1037 }
1038
1039 GpStatus WINGDIPAPI GdipClonePath(GpPath* path, GpPath **clone)
1040 {
1041     TRACE("(%p, %p)\n", path, clone);
1042
1043     if(!path || !clone)
1044         return InvalidParameter;
1045
1046     *clone = GdipAlloc(sizeof(GpPath));
1047     if(!*clone) return OutOfMemory;
1048
1049     **clone = *path;
1050
1051     (*clone)->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
1052     (*clone)->pathdata.Types = GdipAlloc(path->datalen);
1053     if(!(*clone)->pathdata.Points || !(*clone)->pathdata.Types){
1054         GdipFree(*clone);
1055         GdipFree((*clone)->pathdata.Points);
1056         GdipFree((*clone)->pathdata.Types);
1057         return OutOfMemory;
1058     }
1059
1060     memcpy((*clone)->pathdata.Points, path->pathdata.Points,
1061            path->datalen * sizeof(PointF));
1062     memcpy((*clone)->pathdata.Types, path->pathdata.Types, path->datalen);
1063
1064     return Ok;
1065 }
1066
1067 GpStatus WINGDIPAPI GdipClosePathFigure(GpPath* path)
1068 {
1069     TRACE("(%p)\n", path);
1070
1071     if(!path)
1072         return InvalidParameter;
1073
1074     if(path->pathdata.Count > 0){
1075         path->pathdata.Types[path->pathdata.Count - 1] |= PathPointTypeCloseSubpath;
1076         path->newfigure = TRUE;
1077     }
1078
1079     return Ok;
1080 }
1081
1082 GpStatus WINGDIPAPI GdipClosePathFigures(GpPath* path)
1083 {
1084     INT i;
1085
1086     TRACE("(%p)\n", path);
1087
1088     if(!path)
1089         return InvalidParameter;
1090
1091     for(i = 1; i < path->pathdata.Count; i++){
1092         if(path->pathdata.Types[i] == PathPointTypeStart)
1093             path->pathdata.Types[i-1] |= PathPointTypeCloseSubpath;
1094     }
1095
1096     path->newfigure = TRUE;
1097
1098     return Ok;
1099 }
1100
1101 GpStatus WINGDIPAPI GdipCreatePath(GpFillMode fill, GpPath **path)
1102 {
1103     TRACE("(%d, %p)\n", fill, path);
1104
1105     if(!path)
1106         return InvalidParameter;
1107
1108     *path = GdipAlloc(sizeof(GpPath));
1109     if(!*path)  return OutOfMemory;
1110
1111     (*path)->fill = fill;
1112     (*path)->newfigure = TRUE;
1113
1114     return Ok;
1115 }
1116
1117 GpStatus WINGDIPAPI GdipCreatePath2(GDIPCONST GpPointF* points,
1118     GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
1119 {
1120     TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
1121
1122     if(!path)
1123         return InvalidParameter;
1124
1125     *path = GdipAlloc(sizeof(GpPath));
1126     if(!*path)  return OutOfMemory;
1127
1128     (*path)->pathdata.Points = GdipAlloc(count * sizeof(PointF));
1129     (*path)->pathdata.Types = GdipAlloc(count);
1130
1131     if(!(*path)->pathdata.Points || !(*path)->pathdata.Types){
1132         GdipFree((*path)->pathdata.Points);
1133         GdipFree((*path)->pathdata.Types);
1134         GdipFree(*path);
1135         return OutOfMemory;
1136     }
1137
1138     memcpy((*path)->pathdata.Points, points, count * sizeof(PointF));
1139     memcpy((*path)->pathdata.Types, types, count);
1140     (*path)->pathdata.Count = count;
1141     (*path)->datalen = count;
1142
1143     (*path)->fill = fill;
1144     (*path)->newfigure = TRUE;
1145
1146     return Ok;
1147 }
1148
1149 GpStatus WINGDIPAPI GdipCreatePath2I(GDIPCONST GpPoint* points,
1150     GDIPCONST BYTE* types, INT count, GpFillMode fill, GpPath **path)
1151 {
1152     GpPointF *ptF;
1153     GpStatus ret;
1154     INT i;
1155
1156     TRACE("(%p, %p, %d, %d, %p)\n", points, types, count, fill, path);
1157
1158     ptF = GdipAlloc(sizeof(GpPointF)*count);
1159
1160     for(i = 0;i < count; i++){
1161         ptF[i].X = (REAL)points[i].X;
1162         ptF[i].Y = (REAL)points[i].Y;
1163     }
1164
1165     ret = GdipCreatePath2(ptF, types, count, fill, path);
1166
1167     GdipFree(ptF);
1168
1169     return ret;
1170 }
1171
1172 GpStatus WINGDIPAPI GdipDeletePath(GpPath *path)
1173 {
1174     TRACE("(%p)\n", path);
1175
1176     if(!path)
1177         return InvalidParameter;
1178
1179     GdipFree(path->pathdata.Points);
1180     GdipFree(path->pathdata.Types);
1181     GdipFree(path);
1182
1183     return Ok;
1184 }
1185
1186 GpStatus WINGDIPAPI GdipFlattenPath(GpPath *path, GpMatrix* matrix, REAL flatness)
1187 {
1188     path_list_node_t *list, *node;
1189     GpPointF pt;
1190     INT i = 1;
1191     INT startidx = 0;
1192
1193     TRACE("(%p, %p, %.2f)\n", path, matrix, flatness);
1194
1195     if(!path)
1196         return InvalidParameter;
1197
1198     if(matrix){
1199         WARN("transformation not supported yet!\n");
1200         return NotImplemented;
1201     }
1202
1203     if(path->pathdata.Count == 0)
1204         return Ok;
1205
1206     pt = path->pathdata.Points[0];
1207     if(!init_path_list(&list, pt.X, pt.Y))
1208         return OutOfMemory;
1209
1210     node = list;
1211
1212     while(i < path->pathdata.Count){
1213
1214         BYTE type = path->pathdata.Types[i] & PathPointTypePathTypeMask;
1215         path_list_node_t *start;
1216
1217         pt = path->pathdata.Points[i];
1218
1219         /* save last start point index */
1220         if(type == PathPointTypeStart)
1221             startidx = i;
1222
1223         /* always add line points and start points */
1224         if((type == PathPointTypeStart) || (type == PathPointTypeLine)){
1225             if(!add_path_list_node(node, pt.X, pt.Y, path->pathdata.Types[i]))
1226                 goto memout;
1227
1228             node = node->next;
1229             ++i;
1230             continue;
1231         }
1232
1233         /* Bezier curve */
1234
1235         /* test for closed figure */
1236         if(path->pathdata.Types[i+1] & PathPointTypeCloseSubpath){
1237             pt = path->pathdata.Points[startidx];
1238             ++i;
1239         }
1240         else
1241         {
1242             i += 2;
1243             pt = path->pathdata.Points[i];
1244         };
1245
1246         start = node;
1247         /* add Bezier end point */
1248         type = (path->pathdata.Types[i] & ~PathPointTypePathTypeMask) | PathPointTypeLine;
1249         if(!add_path_list_node(node, pt.X, pt.Y, type))
1250             goto memout;
1251         node = node->next;
1252
1253         /* flatten curve */
1254         if(!flatten_bezier(start, path->pathdata.Points[i-2].X, path->pathdata.Points[i-2].Y,
1255                                   path->pathdata.Points[i-1].X, path->pathdata.Points[i-1].Y,
1256                            node, flatness))
1257             goto memout;
1258
1259         ++i;
1260     }/* while */
1261
1262     /* store path data back */
1263     i = path_list_count(list);
1264     if(!lengthen_path(path, i))
1265         goto memout;
1266     path->pathdata.Count = i;
1267
1268     node = list;
1269     for(i = 0; i < path->pathdata.Count; i++){
1270         path->pathdata.Points[i] = node->pt;
1271         path->pathdata.Types[i]  = node->type;
1272         node = node->next;
1273     }
1274
1275     free_path_list(list);
1276     return Ok;
1277
1278 memout:
1279     free_path_list(list);
1280     return OutOfMemory;
1281 }
1282
1283 GpStatus WINGDIPAPI GdipGetPathData(GpPath *path, GpPathData* pathData)
1284 {
1285     TRACE("(%p, %p)\n", path, pathData);
1286
1287     if(!path || !pathData)
1288         return InvalidParameter;
1289
1290     /* Only copy data. pathData allocation/freeing controlled by wrapper class.
1291        Assumed that pathData is enough wide to get all data - controlled by wrapper too. */
1292     memcpy(pathData->Points, path->pathdata.Points, sizeof(PointF) * pathData->Count);
1293     memcpy(pathData->Types , path->pathdata.Types , pathData->Count);
1294
1295     return Ok;
1296 }
1297
1298 GpStatus WINGDIPAPI GdipGetPathFillMode(GpPath *path, GpFillMode *fillmode)
1299 {
1300     TRACE("(%p, %p)\n", path, fillmode);
1301
1302     if(!path || !fillmode)
1303         return InvalidParameter;
1304
1305     *fillmode = path->fill;
1306
1307     return Ok;
1308 }
1309
1310 GpStatus WINGDIPAPI GdipGetPathLastPoint(GpPath* path, GpPointF* lastPoint)
1311 {
1312     INT count;
1313
1314     TRACE("(%p, %p)\n", path, lastPoint);
1315
1316     if(!path || !lastPoint)
1317         return InvalidParameter;
1318
1319     count = path->pathdata.Count;
1320     if(count > 0)
1321         *lastPoint = path->pathdata.Points[count-1];
1322
1323     return Ok;
1324 }
1325
1326 GpStatus WINGDIPAPI GdipGetPathPoints(GpPath *path, GpPointF* points, INT count)
1327 {
1328     TRACE("(%p, %p, %d)\n", path, points, count);
1329
1330     if(!path)
1331         return InvalidParameter;
1332
1333     if(count < path->pathdata.Count)
1334         return InsufficientBuffer;
1335
1336     memcpy(points, path->pathdata.Points, path->pathdata.Count * sizeof(GpPointF));
1337
1338     return Ok;
1339 }
1340
1341 GpStatus WINGDIPAPI GdipGetPathPointsI(GpPath *path, GpPoint* points, INT count)
1342 {
1343     GpStatus ret;
1344     GpPointF *ptf;
1345     INT i;
1346
1347     TRACE("(%p, %p, %d)\n", path, points, count);
1348
1349     if(count <= 0)
1350         return InvalidParameter;
1351
1352     ptf = GdipAlloc(sizeof(GpPointF)*count);
1353     if(!ptf)    return OutOfMemory;
1354
1355     ret = GdipGetPathPoints(path,ptf,count);
1356     if(ret == Ok)
1357         for(i = 0;i < count;i++){
1358             points[i].X = roundr(ptf[i].X);
1359             points[i].Y = roundr(ptf[i].Y);
1360         };
1361     GdipFree(ptf);
1362
1363     return ret;
1364 }
1365
1366 GpStatus WINGDIPAPI GdipGetPathTypes(GpPath *path, BYTE* types, INT count)
1367 {
1368     TRACE("(%p, %p, %d)\n", path, types, count);
1369
1370     if(!path)
1371         return InvalidParameter;
1372
1373     if(count < path->pathdata.Count)
1374         return InsufficientBuffer;
1375
1376     memcpy(types, path->pathdata.Types, path->pathdata.Count);
1377
1378     return Ok;
1379 }
1380
1381 /* Windows expands the bounding box to the maximum possible bounding box
1382  * for a given pen.  For example, if a line join can extend past the point
1383  * it's joining by x units, the bounding box is extended by x units in every
1384  * direction (even though this is too conservative for most cases). */
1385 GpStatus WINGDIPAPI GdipGetPathWorldBounds(GpPath* path, GpRectF* bounds,
1386     GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1387 {
1388     GpPointF * points, temp_pts[4];
1389     INT count, i;
1390     REAL path_width = 1.0, width, height, temp, low_x, low_y, high_x, high_y;
1391
1392     TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1393
1394     /* Matrix and pen can be null. */
1395     if(!path || !bounds)
1396         return InvalidParameter;
1397
1398     /* If path is empty just return. */
1399     count = path->pathdata.Count;
1400     if(count == 0){
1401         bounds->X = bounds->Y = bounds->Width = bounds->Height = 0.0;
1402         return Ok;
1403     }
1404
1405     points = path->pathdata.Points;
1406
1407     low_x = high_x = points[0].X;
1408     low_y = high_y = points[0].Y;
1409
1410     for(i = 1; i < count; i++){
1411         low_x = min(low_x, points[i].X);
1412         low_y = min(low_y, points[i].Y);
1413         high_x = max(high_x, points[i].X);
1414         high_y = max(high_y, points[i].Y);
1415     }
1416
1417     width = high_x - low_x;
1418     height = high_y - low_y;
1419
1420     /* This looks unusual but it's the only way I can imitate windows. */
1421     if(matrix){
1422         temp_pts[0].X = low_x;
1423         temp_pts[0].Y = low_y;
1424         temp_pts[1].X = low_x;
1425         temp_pts[1].Y = high_y;
1426         temp_pts[2].X = high_x;
1427         temp_pts[2].Y = high_y;
1428         temp_pts[3].X = high_x;
1429         temp_pts[3].Y = low_y;
1430
1431         GdipTransformMatrixPoints((GpMatrix*)matrix, temp_pts, 4);
1432         low_x = temp_pts[0].X;
1433         low_y = temp_pts[0].Y;
1434
1435         for(i = 1; i < 4; i++){
1436             low_x = min(low_x, temp_pts[i].X);
1437             low_y = min(low_y, temp_pts[i].Y);
1438         }
1439
1440         temp = width;
1441         width = height * fabs(matrix->matrix[2]) + width * fabs(matrix->matrix[0]);
1442         height = height * fabs(matrix->matrix[3]) + temp * fabs(matrix->matrix[1]);
1443     }
1444
1445     if(pen){
1446         path_width = pen->width / 2.0;
1447
1448         if(count > 2)
1449             path_width = max(path_width,  pen->width * pen->miterlimit / 2.0);
1450         /* FIXME: this should probably also check for the startcap */
1451         if(pen->endcap & LineCapNoAnchor)
1452             path_width = max(path_width,  pen->width * 2.2);
1453
1454         low_x -= path_width;
1455         low_y -= path_width;
1456         width += 2.0 * path_width;
1457         height += 2.0 * path_width;
1458     }
1459
1460     bounds->X = low_x;
1461     bounds->Y = low_y;
1462     bounds->Width = width;
1463     bounds->Height = height;
1464
1465     return Ok;
1466 }
1467
1468 GpStatus WINGDIPAPI GdipGetPathWorldBoundsI(GpPath* path, GpRect* bounds,
1469     GDIPCONST GpMatrix *matrix, GDIPCONST GpPen *pen)
1470 {
1471     GpStatus ret;
1472     GpRectF boundsF;
1473
1474     TRACE("(%p, %p, %p, %p)\n", path, bounds, matrix, pen);
1475
1476     ret = GdipGetPathWorldBounds(path,&boundsF,matrix,pen);
1477
1478     if(ret == Ok){
1479         bounds->X      = roundr(boundsF.X);
1480         bounds->Y      = roundr(boundsF.Y);
1481         bounds->Width  = roundr(boundsF.Width);
1482         bounds->Height = roundr(boundsF.Height);
1483     }
1484
1485     return ret;
1486 }
1487
1488 GpStatus WINGDIPAPI GdipGetPointCount(GpPath *path, INT *count)
1489 {
1490     TRACE("(%p, %p)\n", path, count);
1491
1492     if(!path)
1493         return InvalidParameter;
1494
1495     *count = path->pathdata.Count;
1496
1497     return Ok;
1498 }
1499
1500 GpStatus WINGDIPAPI GdipReversePath(GpPath* path)
1501 {
1502     INT i, count;
1503     INT start = 0; /* position in reversed path */
1504     GpPathData revpath;
1505
1506     TRACE("(%p)\n", path);
1507
1508     if(!path)
1509         return InvalidParameter;
1510
1511     count = path->pathdata.Count;
1512
1513     if(count == 0) return Ok;
1514
1515     revpath.Points = GdipAlloc(sizeof(GpPointF)*count);
1516     revpath.Types  = GdipAlloc(sizeof(BYTE)*count);
1517     revpath.Count  = count;
1518     if(!revpath.Points || !revpath.Types){
1519         GdipFree(revpath.Points);
1520         GdipFree(revpath.Types);
1521         return OutOfMemory;
1522     }
1523
1524     for(i = 0; i < count; i++){
1525
1526         /* find next start point */
1527         if(path->pathdata.Types[count-i-1] == PathPointTypeStart){
1528             INT j;
1529             for(j = start; j <= i; j++){
1530                 revpath.Points[j] = path->pathdata.Points[count-j-1];
1531                 revpath.Types[j] = path->pathdata.Types[count-j-1];
1532             }
1533             /* mark start point */
1534             revpath.Types[start] = PathPointTypeStart;
1535             /* set 'figure' endpoint type */
1536             if(i-start > 1){
1537                 revpath.Types[i] = path->pathdata.Types[count-start-1] & ~PathPointTypePathTypeMask;
1538                 revpath.Types[i] |= revpath.Types[i-1];
1539             }
1540             else
1541                 revpath.Types[i] = path->pathdata.Types[start];
1542
1543             start = i+1;
1544         }
1545     }
1546
1547     memcpy(path->pathdata.Points, revpath.Points, sizeof(GpPointF)*count);
1548     memcpy(path->pathdata.Types,  revpath.Types,  sizeof(BYTE)*count);
1549
1550     GdipFree(revpath.Points);
1551     GdipFree(revpath.Types);
1552
1553     return Ok;
1554 }
1555
1556 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPointI(GpPath* path, INT x, INT y,
1557     GpPen *pen, GpGraphics *graphics, BOOL *result)
1558 {
1559     TRACE("(%p, %d, %d, %p, %p, %p)\n", path, x, y, pen, graphics, result);
1560
1561     return GdipIsOutlineVisiblePathPoint(path, x, y, pen, graphics, result);
1562 }
1563
1564 GpStatus WINGDIPAPI GdipIsOutlineVisiblePathPoint(GpPath* path, REAL x, REAL y,
1565     GpPen *pen, GpGraphics *graphics, BOOL *result)
1566 {
1567     static int calls;
1568
1569     TRACE("(%p,%0.2f,%0.2f,%p,%p,%p)\n", path, x, y, pen, graphics, result);
1570
1571     if(!path || !pen)
1572         return InvalidParameter;
1573
1574     if(!(calls++))
1575         FIXME("not implemented\n");
1576
1577     return NotImplemented;
1578 }
1579
1580 GpStatus WINGDIPAPI GdipIsVisiblePathPointI(GpPath* path, INT x, INT y, GpGraphics *graphics, BOOL *result)
1581 {
1582     TRACE("(%p, %d, %d, %p, %p)\n", path, x, y, graphics, result);
1583
1584     return GdipIsVisiblePathPoint(path, x, y, graphics, result);
1585 }
1586
1587 /*****************************************************************************
1588  * GdipIsVisiblePathPoint [GDIPLUS.@]
1589  */
1590 GpStatus WINGDIPAPI GdipIsVisiblePathPoint(GpPath* path, REAL x, REAL y, GpGraphics *graphics, BOOL *result)
1591 {
1592     GpRegion *region;
1593     HRGN hrgn;
1594     GpStatus status;
1595
1596     if(!path || !result) return InvalidParameter;
1597
1598     status = GdipCreateRegionPath(path, &region);
1599     if(status != Ok)
1600         return status;
1601
1602     status = GdipGetRegionHRgn(region, graphics, &hrgn);
1603     if(status != Ok){
1604         GdipDeleteRegion(region);
1605         return status;
1606     }
1607
1608     *result = PtInRegion(hrgn, roundr(x), roundr(y));
1609
1610     DeleteObject(hrgn);
1611     GdipDeleteRegion(region);
1612
1613     return Ok;
1614 }
1615
1616 GpStatus WINGDIPAPI GdipStartPathFigure(GpPath *path)
1617 {
1618     TRACE("(%p)\n", path);
1619
1620     if(!path)
1621         return InvalidParameter;
1622
1623     path->newfigure = TRUE;
1624
1625     return Ok;
1626 }
1627
1628 GpStatus WINGDIPAPI GdipResetPath(GpPath *path)
1629 {
1630     TRACE("(%p)\n", path);
1631
1632     if(!path)
1633         return InvalidParameter;
1634
1635     path->pathdata.Count = 0;
1636     path->newfigure = TRUE;
1637     path->fill = FillModeAlternate;
1638
1639     return Ok;
1640 }
1641
1642 GpStatus WINGDIPAPI GdipSetPathFillMode(GpPath *path, GpFillMode fill)
1643 {
1644     TRACE("(%p, %d)\n", path, fill);
1645
1646     if(!path)
1647         return InvalidParameter;
1648
1649     path->fill = fill;
1650
1651     return Ok;
1652 }
1653
1654 GpStatus WINGDIPAPI GdipTransformPath(GpPath *path, GpMatrix *matrix)
1655 {
1656     TRACE("(%p, %p)\n", path, matrix);
1657
1658     if(!path)
1659         return InvalidParameter;
1660
1661     if(path->pathdata.Count == 0)
1662         return Ok;
1663
1664     return GdipTransformMatrixPoints(matrix, path->pathdata.Points,
1665                                      path->pathdata.Count);
1666 }
1667
1668 GpStatus WINGDIPAPI GdipWarpPath(GpPath *path, GpMatrix* matrix,
1669     GDIPCONST GpPointF *points, INT count, REAL x, REAL y, REAL width,
1670     REAL height, WarpMode warpmode, REAL flatness)
1671 {
1672     FIXME("(%p,%p,%p,%i,%0.2f,%0.2f,%0.2f,%0.2f,%i,%0.2f)\n", path, matrix,
1673         points, count, x, y, width, height, warpmode, flatness);
1674
1675     return NotImplemented;
1676 }
1677
1678 static void add_bevel_point(const GpPointF *endpoint, const GpPointF *nextpoint,
1679     GpPen *pen, int right_side, path_list_node_t **last_point)
1680 {
1681     REAL segment_dy = nextpoint->Y-endpoint->Y;
1682     REAL segment_dx = nextpoint->X-endpoint->X;
1683     REAL segment_length = sqrtf(segment_dy*segment_dy + segment_dx*segment_dx);
1684     REAL distance = pen->width/2.0;
1685     REAL bevel_dx, bevel_dy;
1686
1687     if (right_side)
1688     {
1689         bevel_dx = -distance * segment_dy / segment_length;
1690         bevel_dy = distance * segment_dx / segment_length;
1691     }
1692     else
1693     {
1694         bevel_dx = distance * segment_dy / segment_length;
1695         bevel_dy = -distance * segment_dx / segment_length;
1696     }
1697
1698     *last_point = add_path_list_node(*last_point, endpoint->X + bevel_dx,
1699         endpoint->Y + bevel_dy, PathPointTypeLine);
1700 }
1701
1702 static void widen_joint(const GpPointF *p1, const GpPointF *p2, const GpPointF *p3,
1703     GpPen* pen, path_list_node_t **last_point)
1704 {
1705     switch (pen->join)
1706     {
1707     default:
1708     case LineJoinBevel:
1709         add_bevel_point(p2, p1, pen, 1, last_point);
1710         add_bevel_point(p2, p3, pen, 0, last_point);
1711         break;
1712     }
1713 }
1714
1715 static void widen_cap(const GpPointF *endpoint, const GpPointF *nextpoint,
1716     GpPen *pen, GpLineCap cap, GpCustomLineCap *custom, int add_first_points,
1717     int add_last_point, path_list_node_t **last_point)
1718 {
1719     switch (cap)
1720     {
1721     default:
1722     case LineCapFlat:
1723         if (add_first_points)
1724             add_bevel_point(endpoint, nextpoint, pen, 1, last_point);
1725         if (add_last_point)
1726             add_bevel_point(endpoint, nextpoint, pen, 0, last_point);
1727         break;
1728     }
1729 }
1730
1731 static void widen_open_figure(GpPath *path, GpPen *pen, int start, int end,
1732     path_list_node_t **last_point)
1733 {
1734     int i;
1735
1736     if (end <= start)
1737         return;
1738
1739     widen_cap(&path->pathdata.Points[start], &path->pathdata.Points[start+1],
1740         pen, pen->startcap, pen->customstart, FALSE, TRUE, last_point);
1741
1742     (*last_point)->type = PathPointTypeStart;
1743
1744     for (i=start+1; i<end; i++)
1745         widen_joint(&path->pathdata.Points[i-1], &path->pathdata.Points[i],
1746             &path->pathdata.Points[i+1], pen, last_point);
1747
1748     widen_cap(&path->pathdata.Points[end], &path->pathdata.Points[end-1],
1749         pen, pen->endcap, pen->customend, TRUE, TRUE, last_point);
1750
1751     for (i=end-1; i>start; i--)
1752         widen_joint(&path->pathdata.Points[i+1], &path->pathdata.Points[i],
1753             &path->pathdata.Points[i-1], pen, last_point);
1754
1755     widen_cap(&path->pathdata.Points[start], &path->pathdata.Points[start+1],
1756         pen, pen->startcap, pen->customstart, TRUE, FALSE, last_point);
1757
1758     (*last_point)->type |= PathPointTypeCloseSubpath;
1759 }
1760
1761 static void widen_closed_figure(GpPath *path, GpPen *pen, int start, int end,
1762     path_list_node_t **last_point)
1763 {
1764     int i;
1765     path_list_node_t *prev_point;
1766
1767     if (end <= start+1)
1768         return;
1769
1770     /* left outline */
1771     prev_point = *last_point;
1772
1773     widen_joint(&path->pathdata.Points[end], &path->pathdata.Points[start],
1774         &path->pathdata.Points[start+1], pen, last_point);
1775
1776     for (i=start+1; i<end; 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[end-1], &path->pathdata.Points[end],
1781         &path->pathdata.Points[start], pen, last_point);
1782
1783     prev_point->next->type = PathPointTypeStart;
1784     (*last_point)->type |= PathPointTypeCloseSubpath;
1785
1786     /* right outline */
1787     prev_point = *last_point;
1788
1789     widen_joint(&path->pathdata.Points[start], &path->pathdata.Points[end],
1790         &path->pathdata.Points[end-1], pen, last_point);
1791
1792     for (i=end-1; i>start; i--)
1793         widen_joint(&path->pathdata.Points[i+1], &path->pathdata.Points[i],
1794             &path->pathdata.Points[i-1], pen, last_point);
1795
1796     widen_joint(&path->pathdata.Points[start+1], &path->pathdata.Points[start],
1797         &path->pathdata.Points[end], pen, last_point);
1798
1799     prev_point->next->type = PathPointTypeStart;
1800     (*last_point)->type |= PathPointTypeCloseSubpath;
1801 }
1802
1803 GpStatus WINGDIPAPI GdipWidenPath(GpPath *path, GpPen *pen, GpMatrix *matrix,
1804     REAL flatness)
1805 {
1806     GpPath *flat_path=NULL;
1807     GpStatus status;
1808     path_list_node_t *points=NULL, *last_point=NULL;
1809     int i, subpath_start=0, new_length;
1810     BYTE type;
1811
1812     TRACE("(%p,%p,%p,%0.2f)\n", path, pen, matrix, flatness);
1813
1814     if (!path || !pen)
1815         return InvalidParameter;
1816
1817     if (path->pathdata.Count <= 1)
1818         return OutOfMemory;
1819
1820     status = GdipClonePath(path, &flat_path);
1821
1822     if (status == Ok)
1823         status = GdipFlattenPath(flat_path, matrix, flatness);
1824
1825     if (status == Ok && !init_path_list(&points, 314.0, 22.0))
1826         status = OutOfMemory;
1827
1828     if (status == Ok)
1829     {
1830         last_point = points;
1831
1832         if (pen->endcap != LineCapFlat)
1833             FIXME("unimplemented end cap %x\n", pen->endcap);
1834
1835         if (pen->startcap != LineCapFlat)
1836             FIXME("unimplemented start cap %x\n", pen->startcap);
1837
1838         if (pen->dashcap != DashCapFlat)
1839             FIXME("unimplemented dash cap %d\n", pen->dashcap);
1840
1841         if (pen->join != LineJoinBevel)
1842             FIXME("unimplemented line join %d\n", pen->join);
1843
1844         if (pen->dash != DashStyleSolid)
1845             FIXME("unimplemented dash style %d\n", pen->dash);
1846
1847         if (pen->align != PenAlignmentCenter)
1848             FIXME("unimplemented pen alignment %d\n", pen->align);
1849
1850         for (i=0; i < flat_path->pathdata.Count; i++)
1851         {
1852             type = flat_path->pathdata.Types[i];
1853
1854             if ((type&PathPointTypePathTypeMask) == PathPointTypeStart)
1855                 subpath_start = i;
1856
1857             if ((type&PathPointTypeCloseSubpath) == PathPointTypeCloseSubpath)
1858             {
1859                 widen_closed_figure(flat_path, pen, subpath_start, i, &last_point);
1860             }
1861             else if (i == flat_path->pathdata.Count-1 ||
1862                 (flat_path->pathdata.Types[i+1]&PathPointTypePathTypeMask) == PathPointTypeStart)
1863             {
1864                 widen_open_figure(flat_path, pen, subpath_start, i, &last_point);
1865             }
1866         }
1867
1868         new_length = path_list_count(points)-1;
1869
1870         if (!lengthen_path(path, new_length))
1871             status = OutOfMemory;
1872     }
1873
1874     if (status == Ok)
1875     {
1876         path->pathdata.Count = new_length;
1877
1878         last_point = points->next;
1879         for (i = 0; i < new_length; i++)
1880         {
1881             path->pathdata.Points[i] = last_point->pt;
1882             path->pathdata.Types[i] = last_point->type;
1883             last_point = last_point->next;
1884         }
1885
1886         path->fill = FillModeWinding;
1887     }
1888
1889     free_path_list(points);
1890
1891     GdipDeletePath(flat_path);
1892
1893     return status;
1894 }
1895
1896 GpStatus WINGDIPAPI GdipAddPathRectangle(GpPath *path, REAL x, REAL y,
1897     REAL width, REAL height)
1898 {
1899     GpPath *backup;
1900     GpPointF ptf[2];
1901     GpStatus retstat;
1902     BOOL old_new;
1903
1904     TRACE("(%p, %.2f, %.2f, %.2f, %.2f)\n", path, x, y, width, height);
1905
1906     if(!path)
1907         return InvalidParameter;
1908
1909     /* make a backup copy of path data */
1910     if((retstat = GdipClonePath(path, &backup)) != Ok)
1911         return retstat;
1912
1913     /* rectangle should start as new path */
1914     old_new = path->newfigure;
1915     path->newfigure = TRUE;
1916     if((retstat = GdipAddPathLine(path,x,y,x+width,y)) != Ok){
1917         path->newfigure = old_new;
1918         goto fail;
1919     }
1920
1921     ptf[0].X = x+width;
1922     ptf[0].Y = y+height;
1923     ptf[1].X = x;
1924     ptf[1].Y = y+height;
1925
1926     if((retstat = GdipAddPathLine2(path, ptf, 2)) != Ok)  goto fail;
1927     path->pathdata.Types[path->pathdata.Count-1] |= PathPointTypeCloseSubpath;
1928
1929     /* free backup */
1930     GdipDeletePath(backup);
1931     return Ok;
1932
1933 fail:
1934     /* reverting */
1935     GdipFree(path->pathdata.Points);
1936     GdipFree(path->pathdata.Types);
1937     memcpy(path, backup, sizeof(*path));
1938     GdipFree(backup);
1939
1940     return retstat;
1941 }
1942
1943 GpStatus WINGDIPAPI GdipAddPathRectangleI(GpPath *path, INT x, INT y,
1944     INT width, INT height)
1945 {
1946     TRACE("(%p, %d, %d, %d, %d)\n", path, x, y, width, height);
1947
1948     return GdipAddPathRectangle(path,(REAL)x,(REAL)y,(REAL)width,(REAL)height);
1949 }
1950
1951 GpStatus WINGDIPAPI GdipAddPathRectangles(GpPath *path, GDIPCONST GpRectF *rects, INT count)
1952 {
1953     GpPath *backup;
1954     GpStatus retstat;
1955     INT i;
1956
1957     TRACE("(%p, %p, %d)\n", path, rects, count);
1958
1959     /* count == 0 - verified condition  */
1960     if(!path || !rects || count == 0)
1961         return InvalidParameter;
1962
1963     if(count < 0)
1964         return OutOfMemory;
1965
1966     /* make a backup copy */
1967     if((retstat = GdipClonePath(path, &backup)) != Ok)
1968         return retstat;
1969
1970     for(i = 0; i < count; i++){
1971         if((retstat = GdipAddPathRectangle(path,rects[i].X,rects[i].Y,rects[i].Width,rects[i].Height)) != Ok)
1972             goto fail;
1973     }
1974
1975     /* free backup */
1976     GdipDeletePath(backup);
1977     return Ok;
1978
1979 fail:
1980     /* reverting */
1981     GdipFree(path->pathdata.Points);
1982     GdipFree(path->pathdata.Types);
1983     memcpy(path, backup, sizeof(*path));
1984     GdipFree(backup);
1985
1986     return retstat;
1987 }
1988
1989 GpStatus WINGDIPAPI GdipAddPathRectanglesI(GpPath *path, GDIPCONST GpRect *rects, INT count)
1990 {
1991     GpRectF *rectsF;
1992     GpStatus retstat;
1993     INT i;
1994
1995     TRACE("(%p, %p, %d)\n", path, rects, count);
1996
1997     if(!rects || count == 0)
1998         return InvalidParameter;
1999
2000     if(count < 0)
2001         return OutOfMemory;
2002
2003     rectsF = GdipAlloc(sizeof(GpRectF)*count);
2004
2005     for(i = 0;i < count;i++){
2006         rectsF[i].X      = (REAL)rects[i].X;
2007         rectsF[i].Y      = (REAL)rects[i].Y;
2008         rectsF[i].Width  = (REAL)rects[i].Width;
2009         rectsF[i].Height = (REAL)rects[i].Height;
2010     }
2011
2012     retstat = GdipAddPathRectangles(path, rectsF, count);
2013     GdipFree(rectsF);
2014
2015     return retstat;
2016 }
2017
2018 GpStatus WINGDIPAPI GdipSetPathMarker(GpPath* path)
2019 {
2020     INT count;
2021
2022     TRACE("(%p)\n", path);
2023
2024     if(!path)
2025         return InvalidParameter;
2026
2027     count = path->pathdata.Count;
2028
2029     /* set marker flag */
2030     if(count > 0)
2031         path->pathdata.Types[count-1] |= PathPointTypePathMarker;
2032
2033     return Ok;
2034 }
2035
2036 GpStatus WINGDIPAPI GdipClearPathMarkers(GpPath* path)
2037 {
2038     INT count;
2039     INT i;
2040
2041     TRACE("(%p)\n", path);
2042
2043     if(!path)
2044         return InvalidParameter;
2045
2046     count = path->pathdata.Count;
2047
2048     for(i = 0; i < count - 1; i++){
2049         path->pathdata.Types[i] &= ~PathPointTypePathMarker;
2050     }
2051
2052     return Ok;
2053 }
2054
2055 GpStatus WINGDIPAPI GdipWindingModeOutline(GpPath *path, GpMatrix *matrix, REAL flatness)
2056 {
2057    FIXME("stub: %p, %p, %.2f\n", path, matrix, flatness);
2058    return NotImplemented;
2059 }