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