1 /*
2 * Graphics paths (BeginPath, EndPath etc.)
3 *
4 * Copyright 1997, 1998 Martin Boehme
5 * 1999 Huw D M Davies
6 * Copyright 2005 Dmitry Timoshkov
7 *
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with this library; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
21 */
22
23 #include "config.h"
24 #include "wine/port.h"
25
26 #include <assert.h>
27 #include <math.h>
28 #include <stdarg.h>
29 #include <string.h>
30 #include <stdlib.h>
31 #if defined(HAVE_FLOAT_H)
32 #include <float.h>
33 #endif
34
35 #include "windef.h"
36 #include "winbase.h"
37 #include "wingdi.h"
38 #include "winerror.h"
39
40 #include "gdi_private.h"
41 #include "wine/debug.h"
42
43 WINE_DEFAULT_DEBUG_CHANNEL(gdi);
44
45 /* Notes on the implementation
46 *
47 * The implementation is based on dynamically resizable arrays of points and
48 * flags. I dithered for a bit before deciding on this implementation, and
49 * I had even done a bit of work on a linked list version before switching
50 * to arrays. It's a bit of a tradeoff. When you use linked lists, the
51 * implementation of FlattenPath is easier, because you can rip the
52 * PT_BEZIERTO entries out of the middle of the list and link the
53 * corresponding PT_LINETO entries in. However, when you use arrays,
54 * PathToRegion becomes easier, since you can essentially just pass your array
55 * of points to CreatePolyPolygonRgn. Also, if I'd used linked lists, I would
56 * have had the extra effort of creating a chunk-based allocation scheme
57 * in order to use memory effectively. That's why I finally decided to use
58 * arrays. Note by the way that the array based implementation has the same
59 * linear time complexity that linked lists would have since the arrays grow
60 * exponentially.
61 *
62 * The points are stored in the path in device coordinates. This is
63 * consistent with the way Windows does things (for instance, see the Win32
64 * SDK documentation for GetPath).
65 *
66 * The word "stroke" appears in several places (e.g. in the flag
67 * GdiPath.newStroke). A stroke consists of a PT_MOVETO followed by one or
68 * more PT_LINETOs or PT_BEZIERTOs, up to, but not including, the next
69 * PT_MOVETO. Note that this is not the same as the definition of a figure;
70 * a figure can contain several strokes.
71 *
72 * I modified the drawing functions (MoveTo, LineTo etc.) to test whether
73 * the path is open and to call the corresponding function in path.c if this
74 * is the case. A more elegant approach would be to modify the function
75 * pointers in the DC_FUNCTIONS structure; however, this would be a lot more
76 * complex. Also, the performance degradation caused by my approach in the
77 * case where no path is open is so small that it cannot be measured.
78 *
79 * Martin Boehme
80 */
81
82 /* FIXME: A lot of stuff isn't implemented yet. There is much more to come. */
83
84 #define NUM_ENTRIES_INITIAL 16 /* Initial size of points / flags arrays */
85 #define GROW_FACTOR_NUMER 2 /* Numerator of grow factor for the array */
86 #define GROW_FACTOR_DENOM 1 /* Denominator of grow factor */
87
88 /* A floating point version of the POINT structure */
89 typedef struct tagFLOAT_POINT
90 {
91 double x, y;
92 } FLOAT_POINT;
93
94
95 static BOOL PATH_AddEntry(GdiPath *pPath, const POINT *pPoint, BYTE flags);
96 static BOOL PATH_PathToRegion(GdiPath *pPath, INT nPolyFillMode,
97 HRGN *pHrgn);
98 static void PATH_EmptyPath(GdiPath *pPath);
99 static BOOL PATH_ReserveEntries(GdiPath *pPath, INT numEntries);
100 static BOOL PATH_DoArcPart(GdiPath *pPath, FLOAT_POINT corners[],
101 double angleStart, double angleEnd, BYTE startEntryType);
102 static void PATH_ScaleNormalizedPoint(FLOAT_POINT corners[], double x,
103 double y, POINT *pPoint);
104 static void PATH_NormalizePoint(FLOAT_POINT corners[], const FLOAT_POINT
105 *pPoint, double *pX, double *pY);
106 static BOOL PATH_CheckCorners(DC *dc, POINT corners[], INT x1, INT y1, INT x2, INT y2);
107
108 /* Performs a world-to-viewport transformation on the specified point (which
109 * is in floating point format).
110 */
111 static inline void INTERNAL_LPTODP_FLOAT(DC *dc, FLOAT_POINT *point)
112 {
113 double x, y;
114
115 /* Perform the transformation */
116 x = point->x;
117 y = point->y;
118 point->x = x * dc->xformWorld2Vport.eM11 +
119 y * dc->xformWorld2Vport.eM21 +
120 dc->xformWorld2Vport.eDx;
121 point->y = x * dc->xformWorld2Vport.eM12 +
122 y * dc->xformWorld2Vport.eM22 +
123 dc->xformWorld2Vport.eDy;
124 }
125
126
127 /***********************************************************************
128 * BeginPath (GDI32.@)
129 */
130 BOOL WINAPI BeginPath(HDC hdc)
131 {
132 BOOL ret = TRUE;
133 DC *dc = get_dc_ptr( hdc );
134
135 if(!dc) return FALSE;
136
137 if(dc->funcs->pBeginPath)
138 ret = dc->funcs->pBeginPath(dc->physDev);
139 else
140 {
141 /* If path is already open, do nothing */
142 if(dc->path.state != PATH_Open)
143 {
144 /* Make sure that path is empty */
145 PATH_EmptyPath(&dc->path);
146
147 /* Initialize variables for new path */
148 dc->path.newStroke=TRUE;
149 dc->path.state=PATH_Open;
150 }
151 }
152 release_dc_ptr( dc );
153 return ret;
154 }
155
156
157 /***********************************************************************
158 * EndPath (GDI32.@)
159 */
160 BOOL WINAPI EndPath(HDC hdc)
161 {
162 BOOL ret = TRUE;
163 DC *dc = get_dc_ptr( hdc );
164
165 if(!dc) return FALSE;
166
167 if(dc->funcs->pEndPath)
168 ret = dc->funcs->pEndPath(dc->physDev);
169 else
170 {
171 /* Check that path is currently being constructed */
172 if(dc->path.state!=PATH_Open)
173 {
174 SetLastError(ERROR_CAN_NOT_COMPLETE);
175 ret = FALSE;
176 }
177 /* Set flag to indicate that path is finished */
178 else dc->path.state=PATH_Closed;
179 }
180 release_dc_ptr( dc );
181 return ret;
182 }
183
184
185 /******************************************************************************
186 * AbortPath [GDI32.@]
187 * Closes and discards paths from device context
188 *
189 * NOTES
190 * Check that SetLastError is being called correctly
191 *
192 * PARAMS
193 * hdc [I] Handle to device context
194 *
195 * RETURNS
196 * Success: TRUE
197 * Failure: FALSE
198 */
199 BOOL WINAPI AbortPath( HDC hdc )
200 {
201 BOOL ret = TRUE;
202 DC *dc = get_dc_ptr( hdc );
203
204 if(!dc) return FALSE;
205
206 if(dc->funcs->pAbortPath)
207 ret = dc->funcs->pAbortPath(dc->physDev);
208 else /* Remove all entries from the path */
209 PATH_EmptyPath( &dc->path );
210 release_dc_ptr( dc );
211 return ret;
212 }
213
214
215 /***********************************************************************
216 * CloseFigure (GDI32.@)
217 *
218 * FIXME: Check that SetLastError is being called correctly
219 */
220 BOOL WINAPI CloseFigure(HDC hdc)
221 {
222 BOOL ret = TRUE;
223 DC *dc = get_dc_ptr( hdc );
224
225 if(!dc) return FALSE;
226
227 if(dc->funcs->pCloseFigure)
228 ret = dc->funcs->pCloseFigure(dc->physDev);
229 else
230 {
231 /* Check that path is open */
232 if(dc->path.state!=PATH_Open)
233 {
234 SetLastError(ERROR_CAN_NOT_COMPLETE);
235 ret = FALSE;
236 }
237 else
238 {
239 /* Set PT_CLOSEFIGURE on the last entry and start a new stroke */
240 /* It is not necessary to draw a line, PT_CLOSEFIGURE is a virtual closing line itself */
241 if(dc->path.numEntriesUsed)
242 {
243 dc->path.pFlags[dc->path.numEntriesUsed-1]|=PT_CLOSEFIGURE;
244 dc->path.newStroke=TRUE;
245 }
246 }
247 }
248 release_dc_ptr( dc );
249 return ret;
250 }
251
252
253 /***********************************************************************
254 * GetPath (GDI32.@)
255 */
256 INT WINAPI GetPath(HDC hdc, LPPOINT pPoints, LPBYTE pTypes,
257 INT nSize)
258 {
259 INT ret = -1;
260 GdiPath *pPath;
261 DC *dc = get_dc_ptr( hdc );
262
263 if(!dc) return -1;
264
265 pPath = &dc->path;
266
267 /* Check that path is closed */
268 if(pPath->state!=PATH_Closed)
269 {
270 SetLastError(ERROR_CAN_NOT_COMPLETE);
271 goto done;
272 }
273
274 if(nSize==0)
275 ret = pPath->numEntriesUsed;
276 else if(nSize<pPath->numEntriesUsed)
277 {
278 SetLastError(ERROR_INVALID_PARAMETER);
279 goto done;
280 }
281 else
282 {
283 memcpy(pPoints, pPath->pPoints, sizeof(POINT)*pPath->numEntriesUsed);
284 memcpy(pTypes, pPath->pFlags, sizeof(BYTE)*pPath->numEntriesUsed);
285
286 /* Convert the points to logical coordinates */
287 if(!DPtoLP(hdc, pPoints, pPath->numEntriesUsed))
288 {
289 /* FIXME: Is this the correct value? */
290 SetLastError(ERROR_CAN_NOT_COMPLETE);
291 goto done;
292 }
293 else ret = pPath->numEntriesUsed;
294 }
295 done:
296 release_dc_ptr( dc );
297 return ret;
298 }
299
300
301 /***********************************************************************
302 * PathToRegion (GDI32.@)
303 *
304 * FIXME
305 * Check that SetLastError is being called correctly
306 *
307 * The documentation does not state this explicitly, but a test under Windows
308 * shows that the region which is returned should be in device coordinates.
309 */
310 HRGN WINAPI PathToRegion(HDC hdc)
311 {
312 GdiPath *pPath;
313 HRGN hrgnRval = 0;
314 DC *dc = get_dc_ptr( hdc );
315
316 /* Get pointer to path */
317 if(!dc) return 0;
318
319 pPath = &dc->path;
320
321 /* Check that path is closed */
322 if(pPath->state!=PATH_Closed) SetLastError(ERROR_CAN_NOT_COMPLETE);
323 else
324 {
325 /* FIXME: Should we empty the path even if conversion failed? */
326 if(PATH_PathToRegion(pPath, GetPolyFillMode(hdc), &hrgnRval))
327 PATH_EmptyPath(pPath);
328 else
329 hrgnRval=0;
330 }
331 release_dc_ptr( dc );
332 return hrgnRval;
333 }
334
335 static BOOL PATH_FillPath(DC *dc, GdiPath *pPath)
336 {
337 INT mapMode, graphicsMode;
338 SIZE ptViewportExt, ptWindowExt;
339 POINT ptViewportOrg, ptWindowOrg;
340 XFORM xform;
341 HRGN hrgn;
342
343 if(dc->funcs->pFillPath)
344 return dc->funcs->pFillPath(dc->physDev);
345
346 /* Check that path is closed */
347 if(pPath->state!=PATH_Closed)
348 {
349 SetLastError(ERROR_CAN_NOT_COMPLETE);
350 return FALSE;
351 }
352
353 /* Construct a region from the path and fill it */
354 if(PATH_PathToRegion(pPath, dc->polyFillMode, &hrgn))
355 {
356 /* Since PaintRgn interprets the region as being in logical coordinates
357 * but the points we store for the path are already in device
358 * coordinates, we have to set the mapping mode to MM_TEXT temporarily.
359 * Using SaveDC to save information about the mapping mode / world
360 * transform would be easier but would require more overhead, especially
361 * now that SaveDC saves the current path.
362 */
363
364 /* Save the information about the old mapping mode */
365 mapMode=GetMapMode(dc->hSelf);
366 GetViewportExtEx(dc->hSelf, &ptViewportExt);
367 GetViewportOrgEx(dc->hSelf, &ptViewportOrg);
368 GetWindowExtEx(dc->hSelf, &ptWindowExt);
369 GetWindowOrgEx(dc->hSelf, &ptWindowOrg);
370
371 /* Save world transform
372 * NB: The Windows documentation on world transforms would lead one to
373 * believe that this has to be done only in GM_ADVANCED; however, my
374 * tests show that resetting the graphics mode to GM_COMPATIBLE does
375 * not reset the world transform.
376 */
377 GetWorldTransform(dc->hSelf, &xform);
378
379 /* Set MM_TEXT */
380 SetMapMode(dc->hSelf, MM_TEXT);
381 SetViewportOrgEx(dc->hSelf, 0, 0, NULL);
382 SetWindowOrgEx(dc->hSelf, 0, 0, NULL);
383 graphicsMode=GetGraphicsMode(dc->hSelf);
384 SetGraphicsMode(dc->hSelf, GM_ADVANCED);
385 ModifyWorldTransform(dc->hSelf, &xform, MWT_IDENTITY);
386 SetGraphicsMode(dc->hSelf, graphicsMode);
387
388 /* Paint the region */
389 PaintRgn(dc->hSelf, hrgn);
390 DeleteObject(hrgn);
391 /* Restore the old mapping mode */
392 SetMapMode(dc->hSelf, mapMode);
393 SetViewportExtEx(dc->hSelf, ptViewportExt.cx, ptViewportExt.cy, NULL);
394 SetViewportOrgEx(dc->hSelf, ptViewportOrg.x, ptViewportOrg.y, NULL);
395 SetWindowExtEx(dc->hSelf, ptWindowExt.cx, ptWindowExt.cy, NULL);
396 SetWindowOrgEx(dc->hSelf, ptWindowOrg.x, ptWindowOrg.y, NULL);
397
398 /* Go to GM_ADVANCED temporarily to restore the world transform */
399 graphicsMode=GetGraphicsMode(dc->hSelf);
400 SetGraphicsMode(dc->hSelf, GM_ADVANCED);
401 SetWorldTransform(dc->hSelf, &xform);
402 SetGraphicsMode(dc->hSelf, graphicsMode);
403 return TRUE;
404 }
405 return FALSE;
406 }
407
408
409 /***********************************************************************
410 * FillPath (GDI32.@)
411 *
412 * FIXME
413 * Check that SetLastError is being called correctly
414 */
415 BOOL WINAPI FillPath(HDC hdc)
416 {
417 DC *dc = get_dc_ptr( hdc );
418 BOOL bRet = FALSE;
419
420 if(!dc) return FALSE;
421
422 if(dc->funcs->pFillPath)
423 bRet = dc->funcs->pFillPath(dc->physDev);
424 else
425 {
426 bRet = PATH_FillPath(dc, &dc->path);
427 if(bRet)
428 {
429 /* FIXME: Should the path be emptied even if conversion
430 failed? */
431 PATH_EmptyPath(&dc->path);
432 }
433 }
434 release_dc_ptr( dc );
435 return bRet;
436 }
437
438
439 /***********************************************************************
440 * SelectClipPath (GDI32.@)
441 * FIXME
442 * Check that SetLastError is being called correctly
443 */
444 BOOL WINAPI SelectClipPath(HDC hdc, INT iMode)
445 {
446 GdiPath *pPath;
447 HRGN hrgnPath;
448 BOOL success = FALSE;
449 DC *dc = get_dc_ptr( hdc );
450
451 if(!dc) return FALSE;
452
453 if(dc->funcs->pSelectClipPath)
454 success = dc->funcs->pSelectClipPath(dc->physDev, iMode);
455 else
456 {
457 pPath = &dc->path;
458
459 /* Check that path is closed */
460 if(pPath->state!=PATH_Closed)
461 SetLastError(ERROR_CAN_NOT_COMPLETE);
462 /* Construct a region from the path */
463 else if(PATH_PathToRegion(pPath, GetPolyFillMode(hdc), &hrgnPath))
464 {
465 success = ExtSelectClipRgn( hdc, hrgnPath, iMode ) != ERROR;
466 DeleteObject(hrgnPath);
467
468 /* Empty the path */
469 if(success)
470 PATH_EmptyPath(pPath);
471 /* FIXME: Should this function delete the path even if it failed? */
472 }
473 }
474 release_dc_ptr( dc );
475 return success;
476 }
477
478
479 /***********************************************************************
480 * Exported functions
481 */
482
483 /* PATH_InitGdiPath
484 *
485 * Initializes the GdiPath structure.
486 */
487 void PATH_InitGdiPath(GdiPath *pPath)
488 {
489 assert(pPath!=NULL);
490
491 pPath->state=PATH_Null;
492 pPath->pPoints=NULL;
493 pPath->pFlags=NULL;
494 pPath->numEntriesUsed=0;
495 pPath->numEntriesAllocated=0;
496 }
497
498 /* PATH_DestroyGdiPath
499 *
500 * Destroys a GdiPath structure (frees the memory in the arrays).
501 */
502 void PATH_DestroyGdiPath(GdiPath *pPath)
503 {
504 assert(pPath!=NULL);
505
506 HeapFree( GetProcessHeap(), 0, pPath->pPoints );
507 HeapFree( GetProcessHeap(), 0, pPath->pFlags );
508 }
509
510 /* PATH_AssignGdiPath
511 *
512 * Copies the GdiPath structure "pPathSrc" to "pPathDest". A deep copy is
513 * performed, i.e. the contents of the pPoints and pFlags arrays are copied,
514 * not just the pointers. Since this means that the arrays in pPathDest may
515 * need to be resized, pPathDest should have been initialized using
516 * PATH_InitGdiPath (in C++, this function would be an assignment operator,
517 * not a copy constructor).
518 * Returns TRUE if successful, else FALSE.
519 */
520 BOOL PATH_AssignGdiPath(GdiPath *pPathDest, const GdiPath *pPathSrc)
521 {
522 assert(pPathDest!=NULL && pPathSrc!=NULL);
523
524 /* Make sure destination arrays are big enough */
525 if(!PATH_ReserveEntries(pPathDest, pPathSrc->numEntriesUsed))
526 return FALSE;
527
528 /* Perform the copy operation */
529 memcpy(pPathDest->pPoints, pPathSrc->pPoints,
530 sizeof(POINT)*pPathSrc->numEntriesUsed);
531 memcpy(pPathDest->pFlags, pPathSrc->pFlags,
532 sizeof(BYTE)*pPathSrc->numEntriesUsed);
533
534 pPathDest->state=pPathSrc->state;
535 pPathDest->numEntriesUsed=pPathSrc->numEntriesUsed;
536 pPathDest->newStroke=pPathSrc->newStroke;
537
538 return TRUE;
539 }
540
541 /* PATH_MoveTo
542 *
543 * Should be called when a MoveTo is performed on a DC that has an
544 * open path. This starts a new stroke. Returns TRUE if successful, else
545 * FALSE.
546 */
547 BOOL PATH_MoveTo(DC *dc)
548 {
549 GdiPath *pPath = &dc->path;
550
551 /* Check that path is open */
552 if(pPath->state!=PATH_Open)
553 /* FIXME: Do we have to call SetLastError? */
554 return FALSE;
555
556 /* Start a new stroke */
557 pPath->newStroke=TRUE;
558
559 return TRUE;
560 }
561
562 /* PATH_LineTo
563 *
564 * Should be called when a LineTo is performed on a DC that has an
565 * open path. This adds a PT_LINETO entry to the path (and possibly
566 * a PT_MOVETO entry, if this is the first LineTo in a stroke).
567 * Returns TRUE if successful, else FALSE.
568 */
569 BOOL PATH_LineTo(DC *dc, INT x, INT y)
570 {
571 GdiPath *pPath = &dc->path;
572 POINT point, pointCurPos;
573
574 /* Check that path is open */
575 if(pPath->state!=PATH_Open)
576 return FALSE;
577
578 /* Convert point to device coordinates */
579 point.x=x;
580 point.y=y;
581 if(!LPtoDP(dc->hSelf, &point, 1))
582 return FALSE;
583
584 /* Add a PT_MOVETO if necessary */
585 if(pPath->newStroke)
586 {
587 pPath->newStroke=FALSE;
588 pointCurPos.x = dc->CursPosX;
589 pointCurPos.y = dc->CursPosY;
590 if(!LPtoDP(dc->hSelf, &pointCurPos, 1))
591 return FALSE;
592 if(!PATH_AddEntry(pPath, &pointCurPos, PT_MOVETO))
593 return FALSE;
594 }
595
596 /* Add a PT_LINETO entry */
597 return PATH_AddEntry(pPath, &point, PT_LINETO);
598 }
599
600 /* PATH_RoundRect
601 *
602 * Should be called when a call to RoundRect is performed on a DC that has
603 * an open path. Returns TRUE if successful, else FALSE.
604 *
605 * FIXME: it adds the same entries to the path as windows does, but there
606 * is an error in the bezier drawing code so that there are small pixel-size
607 * gaps when the resulting path is drawn by StrokePath()
608 */
609 BOOL PATH_RoundRect(DC *dc, INT x1, INT y1, INT x2, INT y2, INT ell_width, INT ell_height)
610 {
611 GdiPath *pPath = &dc->path;
612 POINT corners[2], pointTemp;
613 FLOAT_POINT ellCorners[2];
614
615 /* Check that path is open */
616 if(pPath->state!=PATH_Open)
617 return FALSE;
618
619 if(!PATH_CheckCorners(dc,corners,x1,y1,x2,y2))
620 return FALSE;
621
622 /* Add points to the roundrect path */
623 ellCorners[0].x = corners[1].x-ell_width;
624 ellCorners[0].y = corners[0].y;
625 ellCorners[1].x = corners[1].x;
626 ellCorners[1].y = corners[0].y+ell_height;
627 if(!PATH_DoArcPart(pPath, ellCorners, 0, -M_PI_2, PT_MOVETO))
628 return FALSE;
629 pointTemp.x = corners[0].x+ell_width/2;
630 pointTemp.y = corners[0].y;
631 if(!PATH_AddEntry(pPath, &pointTemp, PT_LINETO))
632 return FALSE;
633 ellCorners[0].x = corners[0].x;
634 ellCorners[1].x = corners[0].x+ell_width;
635 if(!PATH_DoArcPart(pPath, ellCorners, -M_PI_2, -M_PI, FALSE))
636 return FALSE;
637 pointTemp.x = corners[0].x;
638 pointTemp.y = corners[1].y-ell_height/2;
639 if(!PATH_AddEntry(pPath, &pointTemp, PT_LINETO))
640 return FALSE;
641 ellCorners[0].y = corners[1].y-ell_height;
642 ellCorners[1].y = corners[1].y;
643 if(!PATH_DoArcPart(pPath, ellCorners, M_PI, M_PI_2, FALSE))
644 return FALSE;
645 pointTemp.x = corners[1].x-ell_width/2;
646 pointTemp.y = corners[1].y;
647 if(!PATH_AddEntry(pPath, &pointTemp, PT_LINETO))
648 return FALSE;
649 ellCorners[0].x = corners[1].x-ell_width;
650 ellCorners[1].x = corners[1].x;
651 if(!PATH_DoArcPart(pPath, ellCorners, M_PI_2, 0, FALSE))
652 return FALSE;
653
654 /* Close the roundrect figure */
655 if(!CloseFigure(dc->hSelf))
656 return FALSE;
657
658 return TRUE;
659 }
660
661 /* PATH_Rectangle
662 *
663 * Should be called when a call to Rectangle is performed on a DC that has
664 * an open path. Returns TRUE if successful, else FALSE.
665 */
666 BOOL PATH_Rectangle(DC *dc, INT x1, INT y1, INT x2, INT y2)
667 {
668 GdiPath *pPath = &dc->path;
669 POINT corners[2], pointTemp;
670
671 /* Check that path is open */
672 if(pPath->state!=PATH_Open)
673 return FALSE;
674
675 if(!PATH_CheckCorners(dc,corners,x1,y1,x2,y2))
676 return FALSE;
677
678 /* Close any previous figure */
679 if(!CloseFigure(dc->hSelf))
680 {
681 /* The CloseFigure call shouldn't have failed */
682 assert(FALSE);
683 return FALSE;
684 }
685
686 /* Add four points to the path */
687 pointTemp.x=corners[1].x;
688 pointTemp.y=corners[0].y;
689 if(!PATH_AddEntry(pPath, &pointTemp, PT_MOVETO))
690 return FALSE;
691 if(!PATH_AddEntry(pPath, corners, PT_LINETO))
692 return FALSE;
693 pointTemp.x=corners[0].x;
694 pointTemp.y=corners[1].y;
695 if(!PATH_AddEntry(pPath, &pointTemp, PT_LINETO))
696 return FALSE;
697 if(!PATH_AddEntry(pPath, corners+1, PT_LINETO))
698 return FALSE;
699
700 /* Close the rectangle figure */
701 if(!CloseFigure(dc->hSelf))
702 {
703 /* The CloseFigure call shouldn't have failed */
704 assert(FALSE);
705 return FALSE;
706 }
707
708 return TRUE;
709 }
710
711 /* PATH_Ellipse
712 *
713 * Should be called when a call to Ellipse is performed on a DC that has
714 * an open path. This adds four Bezier splines representing the ellipse
715 * to the path. Returns TRUE if successful, else FALSE.
716 */
717 BOOL PATH_Ellipse(DC *dc, INT x1, INT y1, INT x2, INT y2)
718 {
719 return( PATH_Arc(dc, x1, y1, x2, y2, x1, (y1+y2)/2, x1, (y1+y2)/2,0) &&
720 CloseFigure(dc->hSelf) );
721 }
722
723 /* PATH_Arc
724 *
725 * Should be called when a call to Arc is performed on a DC that has
726 * an open path. This adds up to five Bezier splines representing the arc
727 * to the path. When 'lines' is 1, we add 1 extra line to get a chord,
728 * when 'lines' is 2, we add 2 extra lines to get a pie, and when 'lines' is
729 * -1 we add 1 extra line from the current DC position to the starting position
730 * of the arc before drawing the arc itself (arcto). Returns TRUE if successful,
731 * else FALSE.
732 */
733 BOOL PATH_Arc(DC *dc, INT x1, INT y1, INT x2, INT y2,
734 INT xStart, INT yStart, INT xEnd, INT yEnd, INT lines)
735 {
736 GdiPath *pPath = &dc->path;
737 double angleStart, angleEnd, angleStartQuadrant, angleEndQuadrant=0.0;
738 /* Initialize angleEndQuadrant to silence gcc's warning */
739 double x, y;
740 FLOAT_POINT corners[2], pointStart, pointEnd;
741 POINT centre, pointCurPos;
742 BOOL start, end;
743 INT temp;
744
745 /* FIXME: This function should check for all possible error returns */
746 /* FIXME: Do we have to respect newStroke? */
747
748 /* Check that path is open */
749 if(pPath->state!=PATH_Open)
750 return FALSE;
751
752 /* Check for zero height / width */
753 /* FIXME: Only in GM_COMPATIBLE? */
754 if(x1==x2 || y1==y2)
755 return TRUE;
756
757 /* Convert points to device coordinates */
758 corners[0].x = x1;
759 corners[0].y = y1;
760 corners[1].x = x2;
761 corners[1].y = y2;
762 pointStart.x = xStart;
763 pointStart.y = yStart;
764 pointEnd.x = xEnd;
765 pointEnd.y = yEnd;
766 INTERNAL_LPTODP_FLOAT(dc, corners);
767 INTERNAL_LPTODP_FLOAT(dc, corners+1);
768 INTERNAL_LPTODP_FLOAT(dc, &pointStart);
769 INTERNAL_LPTODP_FLOAT(dc, &pointEnd);
770
771 /* Make sure first corner is top left and second corner is bottom right */
772 if(corners[0].x>corners[1].x)
773 {
774 temp=corners[0].x;
775 corners[0].x=corners[1].x;
776 corners[1].x=temp;
777 }
778 if(corners[0].y>corners[1].y)
779 {
780 temp=corners[0].y;
781 corners[0].y=corners[1].y;
782 corners[1].y=temp;
783 }
784
785 /* Compute start and end angle */
786 PATH_NormalizePoint(corners, &pointStart, &x, &y);
787 angleStart=atan2(y, x);
788 PATH_NormalizePoint(corners, &pointEnd, &x, &y);
789 angleEnd=atan2(y, x);
790
791 /* Make sure the end angle is "on the right side" of the start angle */
792 if(dc->ArcDirection==AD_CLOCKWISE)
793 {
794 if(angleEnd<=angleStart)
795 {
796 angleEnd+=2*M_PI;
797 assert(angleEnd>=angleStart);
798 }
799 }
800 else
801 {
802 if(angleEnd>=angleStart)
803 {
804 angleEnd-=2*M_PI;
805 assert(angleEnd<=angleStart);
806 }
807 }
808
809 /* In GM_COMPATIBLE, don't include bottom and right edges */
810 if(dc->GraphicsMode==GM_COMPATIBLE)
811 {
812 corners[1].x--;
813 corners[1].y--;
814 }
815
816 /* arcto: Add a PT_MOVETO only if this is the first entry in a stroke */
817 if(lines==-1 && pPath->newStroke)
818 {
819 pPath->newStroke=FALSE;
820 pointCurPos.x = dc->CursPosX;
821 pointCurPos.y = dc->CursPosY;
822 if(!LPtoDP(dc->hSelf, &pointCurPos, 1))
823 return FALSE;
824 if(!PATH_AddEntry(pPath, &pointCurPos, PT_MOVETO))
825 return FALSE;
826 }
827
828 /* Add the arc to the path with one Bezier spline per quadrant that the
829 * arc spans */
830 start=TRUE;
831 end=FALSE;
832 do
833 {
834 /* Determine the start and end angles for this quadrant */
835 if(start)
836 {
837 angleStartQuadrant=angleStart;
838 if(dc->ArcDirection==AD_CLOCKWISE)
839 angleEndQuadrant=(floor(angleStart/M_PI_2)+1.0)*M_PI_2;
840 else
841 angleEndQuadrant=(ceil(angleStart/M_PI_2)-1.0)*M_PI_2;
842 }
843 else
844 {
845 angleStartQuadrant=angleEndQuadrant;
846 if(dc->ArcDirection==AD_CLOCKWISE)
847 angleEndQuadrant+=M_PI_2;
848 else
849 angleEndQuadrant-=M_PI_2;
850 }
851
852 /* Have we reached the last part of the arc? */
853 if((dc->ArcDirection==AD_CLOCKWISE &&
854 angleEnd<angleEndQuadrant) ||
855 (dc->ArcDirection==AD_COUNTERCLOCKWISE &&
856 angleEnd>angleEndQuadrant))
857 {
858 /* Adjust the end angle for this quadrant */
859 angleEndQuadrant=angleEnd;
860 end=TRUE;
861 }
862
863 /* Add the Bezier spline to the path */
864 PATH_DoArcPart(pPath, corners, angleStartQuadrant, angleEndQuadrant,
865 start ? (lines==-1 ? PT_LINETO : PT_MOVETO) : FALSE);
866 start=FALSE;
867 } while(!end);
868
869 /* chord: close figure. pie: add line and close figure */
870 if(lines==1)
871 {
872 if(!CloseFigure(dc->hSelf))
873 return FALSE;
874 }
875 else if(lines==2)
876 {
877 centre.x = (corners[0].x+corners[1].x)/2;
878 centre.y = (corners[0].y+corners[1].y)/2;
879 if(!PATH_AddEntry(pPath, ¢re, PT_LINETO | PT_CLOSEFIGURE))
880 return FALSE;
881 }
882
883 return TRUE;
884 }
885
886 BOOL PATH_PolyBezierTo(DC *dc, const POINT *pts, DWORD cbPoints)
887 {
888 GdiPath *pPath = &dc->path;
889 POINT pt;
890 UINT i;
891
892 /* Check that path is open */
893 if(pPath->state!=PATH_Open)
894 return FALSE;
895
896 /* Add a PT_MOVETO if necessary */
897 if(pPath->newStroke)
898 {
899 pPath->newStroke=FALSE;
900 pt.x = dc->CursPosX;
901 pt.y = dc->CursPosY;
902 if(!LPtoDP(dc->hSelf, &pt, 1))
903 return FALSE;
904 if(!PATH_AddEntry(pPath, &pt, PT_MOVETO))
905 return FALSE;
906 }
907
908 for(i = 0; i < cbPoints; i++) {
909 pt = pts[i];
910 if(!LPtoDP(dc->hSelf, &pt, 1))
911 return FALSE;
912 PATH_AddEntry(pPath, &pt, PT_BEZIERTO);
913 }
914 return TRUE;
915 }
916
917 BOOL PATH_PolyBezier(DC *dc, const POINT *pts, DWORD cbPoints)
918 {
919 GdiPath *pPath = &dc->path;
920 POINT pt;
921 UINT i;
922
923 /* Check that path is open */
924 if(pPath->state!=PATH_Open)
925 return FALSE;
926
927 for(i = 0; i < cbPoints; i++) {
928 pt = pts[i];
929 if(!LPtoDP(dc->hSelf, &pt, 1))
930 return FALSE;
931 PATH_AddEntry(pPath, &pt, (i == 0) ? PT_MOVETO : PT_BEZIERTO);
932 }
933 return TRUE;
934 }
935
936 /* PATH_PolyDraw
937 *
938 * Should be called when a call to PolyDraw is performed on a DC that has
939 * an open path. Returns TRUE if successful, else FALSE.
940 */
941 BOOL PATH_PolyDraw(DC *dc, const POINT *pts, const BYTE *types,
942 DWORD cbPoints)
943 {
944 GdiPath *pPath = &dc->path;
945 POINT lastmove, orig_pos;
946 INT i;
947
948 lastmove.x = orig_pos.x = dc->CursPosX;
949 lastmove.y = orig_pos.y = dc->CursPosY;
950
951 for(i = pPath->numEntriesUsed - 1; i >= 0; i--){
952 if(pPath->pFlags[i] == PT_MOVETO){
953 lastmove.x = pPath->pPoints[i].x;
954 lastmove.y = pPath->pPoints[i].y;
955 if(!DPtoLP(dc->hSelf, &lastmove, 1))
956 return FALSE;
957 break;
958 }
959 }
960
961 for(i = 0; i < cbPoints; i++){
962 if(types[i] == PT_MOVETO){
963 pPath->newStroke = TRUE;
964 lastmove.x = pts[i].x;
965 lastmove.y = pts[i].y;
966 }
967 else if((types[i] & ~PT_CLOSEFIGURE) == PT_LINETO){
968 PATH_LineTo(dc, pts[i].x, pts[i].y);
969 }
970 else if(types[i] == PT_BEZIERTO){
971 if(!((i + 2 < cbPoints) && (types[i + 1] == PT_BEZIERTO)
972 && ((types[i + 2] & ~PT_CLOSEFIGURE) == PT_BEZIERTO)))
973 goto err;
974 PATH_PolyBezierTo(dc, &(pts[i]), 3);
975 i += 2;
976 }
977 else
978 goto err;
979
980 dc->CursPosX = pts[i].x;
981 dc->CursPosY = pts[i].y;
982
983 if(types[i] & PT_CLOSEFIGURE){
984 pPath->pFlags[pPath->numEntriesUsed-1] |= PT_CLOSEFIGURE;
985 pPath->newStroke = TRUE;
986 dc->CursPosX = lastmove.x;
987 dc->CursPosY = lastmove.y;
988 }
989 }
990
991 return TRUE;
992
993 err:
994 if((dc->CursPosX != orig_pos.x) || (dc->CursPosY != orig_pos.y)){
995 pPath->newStroke = TRUE;
996 dc->CursPosX = orig_pos.x;
997 dc->CursPosY = orig_pos.y;
998 }
999
1000 return FALSE;
1001 }
1002
1003 BOOL PATH_Polyline(DC *dc, const POINT *pts, DWORD cbPoints)
1004 {
1005 GdiPath *pPath = &dc->path;
1006 POINT pt;
1007 UINT i;
1008
1009 /* Check that path is open */
1010 if(pPath->state!=PATH_Open)
1011 return FALSE;
1012
1013 for(i = 0; i < cbPoints; i++) {
1014 pt = pts[i];
1015 if(!LPtoDP(dc->hSelf, &pt, 1))
1016 return FALSE;
1017 PATH_AddEntry(pPath, &pt, (i == 0) ? PT_MOVETO : PT_LINETO);
1018 }
1019 return TRUE;
1020 }
1021
1022 BOOL PATH_PolylineTo(DC *dc, const POINT *pts, DWORD cbPoints)
1023 {
1024 GdiPath *pPath = &dc->path;
1025 POINT pt;
1026 UINT i;
1027
1028 /* Check that path is open */
1029 if(pPath->state!=PATH_Open)
1030 return FALSE;
1031
1032 /* Add a PT_MOVETO if necessary */
1033 if(pPath->newStroke)
1034 {
1035 pPath->newStroke=FALSE;
1036 pt.x = dc->CursPosX;
1037 pt.y = dc->CursPosY;
1038 if(!LPtoDP(dc->hSelf, &pt, 1))
1039 return FALSE;
1040 if(!PATH_AddEntry(pPath, &pt, PT_MOVETO))
1041 return FALSE;
1042 }
1043
1044 for(i = 0; i < cbPoints; i++) {
1045 pt = pts[i];
1046 if(!LPtoDP(dc->hSelf, &pt, 1))
1047 return FALSE;
1048 PATH_AddEntry(pPath, &pt, PT_LINETO);
1049 }
1050
1051 return TRUE;
1052 }
1053
1054
1055 BOOL PATH_Polygon(DC *dc, const POINT *pts, DWORD cbPoints)
1056 {
1057 GdiPath *pPath = &dc->path;
1058 POINT pt;
1059 UINT i;
1060
1061 /* Check that path is open */
1062 if(pPath->state!=PATH_Open)
1063 return FALSE;
1064
1065 for(i = 0; i < cbPoints; i++) {
1066 pt = pts[i];
1067 if(!LPtoDP(dc->hSelf, &pt, 1))
1068 return FALSE;
1069 PATH_AddEntry(pPath, &pt, (i == 0) ? PT_MOVETO :
1070 ((i == cbPoints-1) ? PT_LINETO | PT_CLOSEFIGURE :
1071 PT_LINETO));
1072 }
1073 return TRUE;
1074 }
1075
1076 BOOL PATH_PolyPolygon( DC *dc, const POINT* pts, const INT* counts,
1077 UINT polygons )
1078 {
1079 GdiPath *pPath = &dc->path;
1080 POINT pt, startpt;
1081 UINT poly, i;
1082 INT point;
1083
1084 /* Check that path is open */
1085 if(pPath->state!=PATH_Open)
1086 return FALSE;
1087
1088 for(i = 0, poly = 0; poly < polygons; poly++) {
1089 for(point = 0; point < counts[poly]; point++, i++) {
1090 pt = pts[i];
1091 if(!LPtoDP(dc->hSelf, &pt, 1))
1092 return FALSE;
1093 if(point == 0) startpt = pt;
1094 PATH_AddEntry(pPath, &pt, (point == 0) ? PT_MOVETO : PT_LINETO);
1095 }
1096 /* win98 adds an extra line to close the figure for some reason */
1097 PATH_AddEntry(pPath, &startpt, PT_LINETO | PT_CLOSEFIGURE);
1098 }
1099 return TRUE;
1100 }
1101
1102 BOOL PATH_PolyPolyline( DC *dc, const POINT* pts, const DWORD* counts,
1103 DWORD polylines )
1104 {
1105 GdiPath *pPath = &dc->path;
1106 POINT pt;
1107 UINT poly, point, i;
1108
1109 /* Check that path is open */
1110 if(pPath->state!=PATH_Open)
1111 return FALSE;
1112
1113 for(i = 0, poly = 0; poly < polylines; poly++) {
1114 for(point = 0; point < counts[poly]; point++, i++) {
1115 pt = pts[i];
1116 if(!LPtoDP(dc->hSelf, &pt, 1))
1117 return FALSE;
1118 PATH_AddEntry(pPath, &pt, (point == 0) ? PT_MOVETO : PT_LINETO);
1119 }
1120 }
1121 return TRUE;
1122 }
1123
1124 /***********************************************************************
1125 * Internal functions
1126 */
1127
1128 /* PATH_CheckCorners
1129 *
1130 * Helper function for PATH_RoundRect() and PATH_Rectangle()
1131 */
1132 static BOOL PATH_CheckCorners(DC *dc, POINT corners[], INT x1, INT y1, INT x2, INT y2)
1133 {
1134 INT temp;
1135
1136 /* Convert points to device coordinates */
1137 corners[0].x=x1;
1138 corners[0].y=y1;
1139 corners[1].x=x2;
1140 corners[1].y=y2;
1141 if(!LPtoDP(dc->hSelf, corners, 2))
1142 return FALSE;
1143
1144 /* Make sure first corner is top left and second corner is bottom right */
1145 if(corners[0].x>corners[1].x)
1146 {
1147 temp=corners[0].x;
1148 corners[0].x=corners[1].x;
1149 corners[1].x=temp;
1150 }
1151 if(corners[0].y>corners[1].y)
1152 {
1153 temp=corners[0].y;
1154 corners[0].y=corners[1].y;
1155 corners[1].y=temp;
1156 }
1157
1158 /* In GM_COMPATIBLE, don't include bottom and right edges */
1159 if(dc->GraphicsMode==GM_COMPATIBLE)
1160 {
1161 corners[1].x--;
1162 corners[1].y--;
1163 }
1164
1165 return TRUE;
1166 }
1167
1168 /* PATH_AddFlatBezier
1169 */
1170 static BOOL PATH_AddFlatBezier(GdiPath *pPath, POINT *pt, BOOL closed)
1171 {
1172 POINT *pts;
1173 INT no, i;
1174
1175 pts = GDI_Bezier( pt, 4, &no );
1176 if(!pts) return FALSE;
1177
1178 for(i = 1; i < no; i++)
1179 PATH_AddEntry(pPath, &pts[i],
1180 (i == no-1 && closed) ? PT_LINETO | PT_CLOSEFIGURE : PT_LINETO);
1181 HeapFree( GetProcessHeap(), 0, pts );
1182 return TRUE;
1183 }
1184
1185 /* PATH_FlattenPath
1186 *
1187 * Replaces Beziers with line segments
1188 *
1189 */
1190 static BOOL PATH_FlattenPath(GdiPath *pPath)
1191 {
1192 GdiPath newPath;
1193 INT srcpt;
1194
1195 memset(&newPath, 0, sizeof(newPath));
1196 newPath.state = PATH_Open;
1197 for(srcpt = 0; srcpt < pPath->numEntriesUsed; srcpt++) {
1198 switch(pPath->pFlags[srcpt] & ~PT_CLOSEFIGURE) {
1199 case PT_MOVETO:
1200 case PT_LINETO:
1201 PATH_AddEntry(&newPath, &pPath->pPoints[srcpt],
1202 pPath->pFlags[srcpt]);
1203 break;
1204 case PT_BEZIERTO:
1205 PATH_AddFlatBezier(&newPath, &pPath->pPoints[srcpt-1],
1206 pPath->pFlags[srcpt+2] & PT_CLOSEFIGURE);
1207 srcpt += 2;
1208 break;
1209 }
1210 }
1211 newPath.state = PATH_Closed;
1212 PATH_AssignGdiPath(pPath, &newPath);
1213 PATH_DestroyGdiPath(&newPath);
1214 return TRUE;
1215 }
1216
1217 /* PATH_PathToRegion
1218 *
1219 * Creates a region from the specified path using the specified polygon
1220 * filling mode. The path is left unchanged. A handle to the region that
1221 * was created is stored in *pHrgn. If successful, TRUE is returned; if an
1222 * error occurs, SetLastError is called with the appropriate value and
1223 * FALSE is returned.
1224 */
1225 static BOOL PATH_PathToRegion(GdiPath *pPath, INT nPolyFillMode,
1226 HRGN *pHrgn)
1227 {
1228 int numStrokes, iStroke, i;
1229 INT *pNumPointsInStroke;
1230 HRGN hrgn;
1231
1232 assert(pPath!=NULL);
1233 assert(pHrgn!=NULL);
1234
1235 PATH_FlattenPath(pPath);
1236
1237 /* FIXME: What happens when number of points is zero? */
1238
1239 /* First pass: Find out how many strokes there are in the path */
1240 /* FIXME: We could eliminate this with some bookkeeping in GdiPath */
1241 numStrokes=0;
1242 for(i=0; i<pPath->numEntriesUsed; i++)
1243 if((pPath->pFlags[i] & ~PT_CLOSEFIGURE) == PT_MOVETO)
1244 numStrokes++;
1245
1246 /* Allocate memory for number-of-points-in-stroke array */
1247 pNumPointsInStroke=HeapAlloc( GetProcessHeap(), 0, sizeof(int) * numStrokes );
1248 if(!pNumPointsInStroke)
1249 {
1250 SetLastError(ERROR_NOT_ENOUGH_MEMORY);
1251 return FALSE;
1252 }
1253
1254 /* Second pass: remember number of points in each polygon */
1255 iStroke=-1; /* Will get incremented to 0 at beginning of first stroke */
1256 for(i=0; i<pPath->numEntriesUsed; i++)
1257 {
1258 /* Is this the beginning of a new stroke? */
1259 if((pPath->pFlags[i] & ~PT_CLOSEFIGURE) == PT_MOVETO)
1260 {
1261 iStroke++;
1262 pNumPointsInStroke[iStroke]=0;
1263 }
1264
1265 pNumPointsInStroke[iStroke]++;
1266 }
1267
1268 /* Create a region from the strokes */
1269 hrgn=CreatePolyPolygonRgn(pPath->pPoints, pNumPointsInStroke,
1270 numStrokes, nPolyFillMode);
1271
1272 /* Free memory for number-of-points-in-stroke array */
1273 HeapFree( GetProcessHeap(), 0, pNumPointsInStroke );
1274
1275 if(hrgn==NULL)
1276 {
1277 SetLastError(ERROR_NOT_ENOUGH_MEMORY);
1278 return FALSE;
1279 }
1280
1281 /* Success! */
1282 *pHrgn=hrgn;
1283 return TRUE;
1284 }
1285
1286 static inline INT int_from_fixed(FIXED f)
1287 {
1288 return (f.fract >= 0x8000) ? (f.value + 1) : f.value;
1289 }
1290
1291 /**********************************************************************
1292 * PATH_BezierTo
1293 *
1294 * internally used by PATH_add_outline
1295 */
1296 static void PATH_BezierTo(GdiPath *pPath, POINT *lppt, INT n)
1297 {
1298 if (n < 2) return;
1299
1300 if (n == 2)
1301 {
1302 PATH_AddEntry(pPath, &lppt[1], PT_LINETO);
1303 }
1304 else if (n == 3)
1305 {
1306 PATH_AddEntry(pPath, &lppt[0], PT_BEZIERTO);
1307 PATH_AddEntry(pPath, &lppt[1], PT_BEZIERTO);
1308 PATH_AddEntry(pPath, &lppt[2], PT_BEZIERTO);
1309 }
1310 else
1311 {
1312 POINT pt[3];
1313 INT i = 0;
1314
1315 pt[2] = lppt[0];
1316 n--;
1317
1318 while (n > 2)
1319 {
1320 pt[0] = pt[2];
1321 pt[1] = lppt[i+1];
1322 pt[2].x = (lppt[i+2].x + lppt[i+1].x) / 2;
1323 pt[2].y = (lppt[i+2].y + lppt[i+1].y) / 2;
1324 PATH_BezierTo(pPath, pt, 3);
1325 n--;
1326 i++;
1327 }
1328
1329 pt[0] = pt[2];
1330 pt[1] = lppt[i+1];
1331 pt[2] = lppt[i+2];
1332 PATH_BezierTo(pPath, pt, 3);
1333 }
1334 }
1335
1336 static BOOL PATH_add_outline(DC *dc, INT x, INT y, TTPOLYGONHEADER *header, DWORD size)
1337 {
1338 GdiPath *pPath = &dc->path;
1339 TTPOLYGONHEADER *start;
1340 POINT pt;
1341
1342 start = header;
1343
1344 while ((char *)header < (char *)start + size)
1345 {
1346 TTPOLYCURVE *curve;
1347
1348 if (header->dwType != TT_POLYGON_TYPE)
1349 {
1350 FIXME("Unknown header type %d\n", header->dwType);
1351 return FALSE;
1352 }
1353
1354 pt.x = x + int_from_fixed(header->pfxStart.x);
1355 pt.y = y - int_from_fixed(header->pfxStart.y);
1356 PATH_AddEntry(pPath, &pt, PT_MOVETO);
1357
1358 curve = (TTPOLYCURVE *)(header + 1);
1359
1360 while ((char *)curve < (char *)header + header->cb)
1361 {
1362 /*TRACE("curve->wType %d\n", curve->wType);*/
1363
1364 switch(curve->wType)
1365 {
1366 case TT_PRIM_LINE:
1367 {
1368 WORD i;
1369
1370 for (i = 0; i < curve->cpfx; i++)
1371 {
1372 pt.x = x + int_from_fixed(curve->apfx[i].x);
1373 pt.y = y - int_from_fixed(curve->apfx[i].y);
1374 PATH_AddEntry(pPath, &pt, PT_LINETO);
1375 }
1376 break;
1377 }
1378
1379 case TT_PRIM_QSPLINE:
1380 case TT_PRIM_CSPLINE:
1381 {
1382 WORD i;
1383 POINTFX ptfx;
1384 POINT *pts = HeapAlloc(GetProcessHeap(), 0, (curve->cpfx + 1) * sizeof(POINT));
1385
1386 if (!pts) return FALSE;
1387
1388 ptfx = *(POINTFX *)((char *)curve - sizeof(POINTFX));
1389
1390 pts[0].x = x + int_from_fixed(ptfx.x);
1391 pts[0].y = y - int_from_fixed(ptfx.y);
1392
1393 for(i = 0; i < curve->cpfx; i++)
1394 {
1395 pts[i + 1].x = x + int_from_fixed(curve->apfx[i].x);
1396 pts[i + 1].y = y - int_from_fixed(curve->apfx[i].y);
1397 }
1398
1399 PATH_BezierTo(pPath, pts, curve->cpfx + 1);
1400
1401 HeapFree(GetProcessHeap(), 0, pts);
1402 break;
1403 }
1404
1405 default:
1406 FIXME("Unknown curve type %04x\n", curve->wType);
1407 return FALSE;
1408 }
1409
1410 curve = (TTPOLYCURVE *)&curve->apfx[curve->cpfx];
1411 }
1412
1413 header = (TTPOLYGONHEADER *)((char *)header + header->cb);
1414 }
1415
1416 return CloseFigure(dc->hSelf);
1417 }
1418
1419 /**********************************************************************
1420 * PATH_ExtTextOut
1421 */
1422 BOOL PATH_ExtTextOut(DC *dc, INT x, INT y, UINT flags, const RECT *lprc,
1423 LPCWSTR str, UINT count, const INT *dx)
1424 {
1425 unsigned int idx;
1426 double cosEsc, sinEsc;
1427 LOGFONTW lf;
1428 HDC hdc = dc->hSelf;
1429 INT offset = 0, xoff = 0, yoff = 0;
1430
1431 TRACE("%p, %d, %d, %08x, %s, %s, %d, %p)\n", hdc, x, y, flags,
1432 wine_dbgstr_rect(lprc), debugstr_wn(str, count), count, dx);
1433
1434 if (!count) return TRUE;
1435
1436 GetObjectW(GetCurrentObject(hdc, OBJ_FONT), sizeof(lf), &lf);
1437
1438 if (lf.lfEscapement != 0)
1439 {
1440 cosEsc = cos(lf.lfEscapement * M_PI / 1800);
1441 sinEsc = sin(lf.lfEscapement * M_PI / 1800);
1442 } else
1443 {
1444 cosEsc = 1;
1445 sinEsc = 0;
1446 }
1447
1448 for (idx = 0; idx < count; idx++)
1449 {
1450 static const MAT2 identity = { {0,1},{0,0},{0,0},{0,1} };
1451 GLYPHMETRICS gm;
1452 DWORD dwSize;
1453 void *outline;
1454
1455 dwSize = GetGlyphOutlineW(hdc, str[idx], GGO_GLYPH_INDEX | GGO_NATIVE, &gm, 0, NULL, &identity);
1456 if (dwSize == GDI_ERROR) return FALSE;
1457
1458 /* add outline only if char is printable */
1459 if(dwSize)
1460 {
1461 outline = HeapAlloc(GetProcessHeap(), 0, dwSize);
1462 if (!outline) return FALSE;
1463
1464 GetGlyphOutlineW(hdc, str[idx], GGO_GLYPH_INDEX | GGO_NATIVE, &gm, dwSize, outline, &identity);
1465
1466 PATH_add_outline(dc, x + xoff, y + yoff, outline, dwSize);
1467
1468 HeapFree(GetProcessHeap(), 0, outline);
1469 }
1470
1471 if (dx)
1472 {
1473 offset += dx[idx];
1474 xoff = offset * cosEsc;
1475 yoff = offset * -sinEsc;
1476 }
1477 else
1478 {
1479 xoff += gm.gmCellIncX;
1480 yoff += gm.gmCellIncY;
1481 }
1482 }
1483 return TRUE;
1484 }
1485
1486 /* PATH_EmptyPath
1487 *
1488 * Removes all entries from the path and sets the path state to PATH_Null.
1489 */
1490 static void PATH_EmptyPath(GdiPath *pPath)
1491 {
1492 assert(pPath!=NULL);
1493
1494 pPath->state=PATH_Null;
1495 pPath->numEntriesUsed=0;
1496 }
1497
1498 /* PATH_AddEntry
1499 *
1500 * Adds an entry to the path. For "flags", pass either PT_MOVETO, PT_LINETO
1501 * or PT_BEZIERTO, optionally ORed with PT_CLOSEFIGURE. Returns TRUE if
1502 * successful, FALSE otherwise (e.g. if not enough memory was available).
1503 */
1504 static BOOL PATH_AddEntry(GdiPath *pPath, const POINT *pPoint, BYTE flags)
1505 {
1506 assert(pPath!=NULL);
1507
1508 /* FIXME: If newStroke is true, perhaps we want to check that we're
1509 * getting a PT_MOVETO
1510 */
1511 TRACE("(%d,%d) - %d\n", pPoint->x, pPoint->y, flags);
1512
1513 /* Check that path is open */
1514 if(pPath->state!=PATH_Open)
1515 return FALSE;
1516
1517 /* Reserve enough memory for an extra path entry */
1518 if(!PATH_ReserveEntries(pPath, pPath->numEntriesUsed+1))
1519 return FALSE;
1520
1521 /* Store information in path entry */
1522 pPath->pPoints[pPath->numEntriesUsed]=*pPoint;
1523 pPath->pFlags[pPath->numEntriesUsed]=flags;
1524
1525 /* If this is PT_CLOSEFIGURE, we have to start a new stroke next time */
1526 if((flags & PT_CLOSEFIGURE) == PT_CLOSEFIGURE)
1527 pPath->newStroke=TRUE;
1528
1529 /* Increment entry count */
1530 pPath->numEntriesUsed++;
1531
1532 return TRUE;
1533 }
1534
1535 /* PATH_ReserveEntries
1536 *
1537 * Ensures that at least "numEntries" entries (for points and flags) have
1538 * been allocated; allocates larger arrays and copies the existing entries
1539 * to those arrays, if necessary. Returns TRUE if successful, else FALSE.
1540 */
1541 static BOOL PATH_ReserveEntries(GdiPath *pPath, INT numEntries)
1542 {
1543 INT numEntriesToAllocate;
1544 POINT *pPointsNew;
1545 BYTE *pFlagsNew;
1546
1547 assert(pPath!=NULL);
1548 assert(numEntries>=0);
1549
1550 /* Do we have to allocate more memory? */
1551 if(numEntries > pPath->numEntriesAllocated)
1552 {
1553 /* Find number of entries to allocate. We let the size of the array
1554 * grow exponentially, since that will guarantee linear time
1555 * complexity. */
1556 if(pPath->numEntriesAllocated)
1557 {
1558 numEntriesToAllocate=pPath->numEntriesAllocated;
1559 while(numEntriesToAllocate<numEntries)
1560 numEntriesToAllocate=numEntriesToAllocate*GROW_FACTOR_NUMER/
1561 GROW_FACTOR_DENOM;
1562 }
1563 else
1564 numEntriesToAllocate=numEntries;
1565
1566 /* Allocate new arrays */
1567 pPointsNew=HeapAlloc( GetProcessHeap(), 0, numEntriesToAllocate * sizeof(POINT) );
1568 if(!pPointsNew)
1569 return FALSE;
1570 pFlagsNew=HeapAlloc( GetProcessHeap(), 0, numEntriesToAllocate * sizeof(BYTE) );
1571 if(!pFlagsNew)
1572 {
1573 HeapFree( GetProcessHeap(), 0, pPointsNew );
1574 return FALSE;
1575 }
1576
1577 /* Copy old arrays to new arrays and discard old arrays */
1578 if(pPath->pPoints)
1579 {
1580 assert(pPath->pFlags);
1581
1582 memcpy(pPointsNew, pPath->pPoints,
1583 sizeof(POINT)*pPath->numEntriesUsed);
1584 memcpy(pFlagsNew, pPath->pFlags,
1585 sizeof(BYTE)*pPath->numEntriesUsed);
1586
1587 HeapFree( GetProcessHeap(), 0, pPath->pPoints );
1588 HeapFree( GetProcessHeap(), 0, pPath->pFlags );
1589 }
1590 pPath->pPoints=pPointsNew;
1591 pPath->pFlags=pFlagsNew;
1592 pPath->numEntriesAllocated=numEntriesToAllocate;
1593 }
1594
1595 return TRUE;
1596 }
1597
1598 /* PATH_DoArcPart
1599 *
1600 * Creates a Bezier spline that corresponds to part of an arc and appends the
1601 * corresponding points to the path. The start and end angles are passed in
1602 * "angleStart" and "angleEnd"; these angles should span a quarter circle
1603 * at most. If "startEntryType" is non-zero, an entry of that type for the first
1604 * control point is added to the path; otherwise, it is assumed that the current
1605 * position is equal to the first control point.
1606 */
1607 static BOOL PATH_DoArcPart(GdiPath *pPath, FLOAT_POINT corners[],
1608 double angleStart, double angleEnd, BYTE startEntryType)
1609 {
1610 double halfAngle, a;
1611 double xNorm[4], yNorm[4];
1612 POINT point;
1613 int i;
1614
1615 assert(fabs(angleEnd-angleStart)<=M_PI_2);
1616
1617 /* FIXME: Is there an easier way of computing this? */
1618
1619 /* Compute control points */
1620 halfAngle=(angleEnd-angleStart)/2.0;
1621 if(fabs(halfAngle)>1e-8)
1622 {
1623 a=4.0/3.0*(1-cos(halfAngle))/sin(halfAngle);
1624 xNorm[0]=cos(angleStart);
1625 yNorm[0]=sin(angleStart);
1626 xNorm[1]=xNorm[0] - a*yNorm[0];
1627 yNorm[1]=yNorm[0] + a*xNorm[0];
1628 xNorm[3]=cos(angleEnd);
1629 yNorm[3]=sin(angleEnd);
1630 xNorm[2]=xNorm[3] + a*yNorm[3];
1631 yNorm[2]=yNorm[3] - a*xNorm[3];
1632 }
1633 else
1634 for(i=0; i<4; i++)
1635 {
1636 xNorm[i]=cos(angleStart);
1637 yNorm[i]=sin(angleStart);
1638 }
1639
1640 /* Add starting point to path if desired */
1641 if(startEntryType)
1642 {
1643 PATH_ScaleNormalizedPoint(corners, xNorm[0], yNorm[0], &point);
1644 if(!PATH_AddEntry(pPath, &point, startEntryType))
1645 return FALSE;
1646 }
1647
1648 /* Add remaining control points */
1649 for(i=1; i<4; i++)
1650 {
1651 PATH_ScaleNormalizedPoint(corners, xNorm[i], yNorm[i], &point);
1652 if(!PATH_AddEntry(pPath, &point, PT_BEZIERTO))
1653 return FALSE;
1654 }
1655
1656 return TRUE;
1657 }
1658
1659 /* PATH_ScaleNormalizedPoint
1660 *
1661 * Scales a normalized point (x, y) with respect to the box whose corners are
1662 * passed in "corners". The point is stored in "*pPoint". The normalized
1663 * coordinates (-1.0, -1.0) correspond to corners[0], the coordinates
1664 * (1.0, 1.0) correspond to corners[1].
1665 */
1666 static void PATH_ScaleNormalizedPoint(FLOAT_POINT corners[], double x,
1667 double y, POINT *pPoint)
1668 {
1669 pPoint->x=GDI_ROUND( (double)corners[0].x +
1670 (double)(corners[1].x-corners[0].x)*0.5*(x+1.0) );
1671 pPoint->y=GDI_ROUND( (double)corners[0].y +
1672 (double)(corners[1].y-corners[0].y)*0.5*(y+1.0) );
1673 }
1674
1675 /* PATH_NormalizePoint
1676 *
1677 * Normalizes a point with respect to the box whose corners are passed in
1678 * "corners". The normalized coordinates are stored in "*pX" and "*pY".
1679 */
1680 static void PATH_NormalizePoint(FLOAT_POINT corners[],
1681 const FLOAT_POINT *pPoint,
1682 double *pX, double *pY)
1683 {
1684 *pX=(double)(pPoint->x-corners[0].x)/(double)(corners[1].x-corners[0].x) *
1685 2.0 - 1.0;
1686 *pY=(double)(pPoint->y-corners[0].y)/(double)(corners[1].y-corners[0].y) *
1687 2.0 - 1.0;
1688 }
1689
1690
1691 /*******************************************************************
1692 * FlattenPath [GDI32.@]
1693 *
1694 *
1695 */
1696 BOOL WINAPI FlattenPath(HDC hdc)
1697 {
1698 BOOL ret = FALSE;
1699 DC *dc = get_dc_ptr( hdc );
1700
1701 if(!dc) return FALSE;
1702
1703 if(dc->funcs->pFlattenPath) ret = dc->funcs->pFlattenPath(dc->physDev);
1704 else
1705 {
1706 GdiPath *pPath = &dc->path;
1707 if(pPath->state != PATH_Closed)
1708 ret = PATH_FlattenPath(pPath);
1709 }
1710 release_dc_ptr( dc );
1711 return ret;
1712 }
1713
1714
1715 static BOOL PATH_StrokePath(DC *dc, GdiPath *pPath)
1716 {
1717 INT i, nLinePts, nAlloc;
1718 POINT *pLinePts;
1719 POINT ptViewportOrg, ptWindowOrg;
1720 SIZE szViewportExt, szWindowExt;
1721 DWORD mapMode, graphicsMode;
1722 XFORM xform;
1723 BOOL ret = TRUE;
1724
1725 if(dc->funcs->pStrokePath)
1726 return dc->funcs->pStrokePath(dc->physDev);
1727
1728 if(pPath->state != PATH_Closed)
1729 return FALSE;
1730
1731 /* Save the mapping mode info */
1732 mapMode=GetMapMode(dc->hSelf);
1733 GetViewportExtEx(dc->hSelf, &szViewportExt);
1734 GetViewportOrgEx(dc->hSelf, &ptViewportOrg);
1735 GetWindowExtEx(dc->hSelf, &szWindowExt);
1736 GetWindowOrgEx(dc->hSelf, &ptWindowOrg);
1737 GetWorldTransform(dc->hSelf, &xform);
1738
1739 /* Set MM_TEXT */
1740 SetMapMode(dc->hSelf, MM_TEXT);
1741 SetViewportOrgEx(dc->hSelf, 0, 0, NULL);
1742 SetWindowOrgEx(dc->hSelf, 0, 0, NULL);
1743 graphicsMode=GetGraphicsMode(dc->hSelf);
1744 SetGraphicsMode(dc->hSelf, GM_ADVANCED);
1745 ModifyWorldTransform(dc->hSelf, &xform, MWT_IDENTITY);
1746 SetGraphicsMode(dc->hSelf, graphicsMode);
1747
1748 /* Allocate enough memory for the worst case without beziers (one PT_MOVETO
1749 * and the rest PT_LINETO with PT_CLOSEFIGURE at the end) plus some buffer
1750 * space in case we get one to keep the number of reallocations small. */
1751 nAlloc = pPath->numEntriesUsed + 1 + 300;
1752 pLinePts = HeapAlloc(GetProcessHeap(), 0, nAlloc * sizeof(POINT));
1753 nLinePts = 0;
1754
1755 for(i = 0; i < pPath->numEntriesUsed; i++) {
1756 if((i == 0 || (pPath->pFlags[i-1] & PT_CLOSEFIGURE)) &&
1757 (pPath->pFlags[i] != PT_MOVETO)) {
1758 ERR("Expected PT_MOVETO %s, got path flag %d\n",
1759 i == 0 ? "as first point" : "after PT_CLOSEFIGURE",
1760 (INT)pPath->pFlags[i]);
1761 ret = FALSE;
1762 goto end;
1763 }
1764 switch(pPath->pFlags[i]) {
1765 case PT_MOVETO:
1766 TRACE("Got PT_MOVETO (%d, %d)\n",
1767 pPath->pPoints[i].x, pPath->pPoints[i].y);
1768 if(nLinePts >= 2)
1769 Polyline(dc->hSelf, pLinePts, nLinePts);
1770 nLinePts = 0;
1771 pLinePts[nLinePts++] = pPath->pPoints[i];
1772 break;
1773 case PT_LINETO:
1774 case (PT_LINETO | PT_CLOSEFIGURE):
1775 TRACE("Got PT_LINETO (%d, %d)\n",
1776 pPath->pPoints[i].x, pPath->pPoints[i].y);
1777 pLinePts[nLinePts++] = pPath->pPoints[i];
1778 break;
1779 case PT_BEZIERTO:
1780 TRACE("Got PT_BEZIERTO\n");
1781 if(pPath->pFlags[i+1] != PT_BEZIERTO ||
1782 (pPath->pFlags[i+2] & ~PT_CLOSEFIGURE) != PT_BEZIERTO) {
1783 ERR("Path didn't contain 3 successive PT_BEZIERTOs\n");
1784 ret = FALSE;
1785 goto end;
1786 } else {
1787 INT nBzrPts, nMinAlloc;
1788 POINT *pBzrPts = GDI_Bezier(&pPath->pPoints[i-1], 4, &nBzrPts);
1789 /* Make sure we have allocated enough memory for the lines of
1790 * this bezier and the rest of the path, assuming we won't get
1791 * another one (since we won't reallocate again then). */
1792 nMinAlloc = nLinePts + (pPath->numEntriesUsed - i) + nBzrPts;
1793 if(nAlloc < nMinAlloc)
1794 {
1795 nAlloc = nMinAlloc * 2;
1796 pLinePts = HeapReAlloc(GetProcessHeap(), 0, pLinePts,
1797 nAlloc * sizeof(POINT));
1798 }
1799 memcpy(&pLinePts[nLinePts], &pBzrPts[1],
1800 (nBzrPts - 1) * sizeof(POINT));
1801 nLinePts += nBzrPts - 1;
1802 HeapFree(GetProcessHeap(), 0, pBzrPts);
1803 i += 2;
1804 }
1805 break;
1806 default:
1807 ERR("Got path flag %d\n", (INT)pPath->pFlags[i]);
1808 ret = FALSE;
1809 goto end;
1810 }
1811 if(pPath->pFlags[i] & PT_CLOSEFIGURE)
1812 pLinePts[nLinePts++] = pLinePts[0];
1813 }
1814 if(nLinePts >= 2)
1815 Polyline(dc->hSelf, pLinePts, nLinePts);
1816
1817 end:
1818 HeapFree(GetProcessHeap(), 0, pLinePts);
1819
1820 /* Restore the old mapping mode */
1821 SetMapMode(dc->hSelf, mapMode);
1822 SetWindowExtEx(dc->hSelf, szWindowExt.cx, szWindowExt.cy, NULL);
1823 SetWindowOrgEx(dc->hSelf, ptWindowOrg.x, ptWindowOrg.y, NULL);
1824 SetViewportExtEx(dc->hSelf, szViewportExt.cx, szViewportExt.cy, NULL);
1825 SetViewportOrgEx(dc->hSelf, ptViewportOrg.x, ptViewportOrg.y, NULL);
1826
1827 /* Go to GM_ADVANCED temporarily to restore the world transform */
1828 graphicsMode=GetGraphicsMode(dc->hSelf);
1829 SetGraphicsMode(dc->hSelf, GM_ADVANCED);
1830 SetWorldTransform(dc->hSelf, &xform);
1831 SetGraphicsMode(dc->hSelf, graphicsMode);
1832
1833 /* If we've moved the current point then get its new position
1834 which will be in device (MM_TEXT) co-ords, convert it to
1835 logical co-ords and re-set it. This basically updates
1836 dc->CurPosX|Y so that their values are in the correct mapping
1837 mode.
1838 */
1839 if(i > 0) {
1840 POINT pt;
1841 GetCurrentPositionEx(dc->hSelf, &pt);
1842 DPtoLP(dc->hSelf, &pt, 1);
1843 MoveToEx(dc->hSelf, pt.x, pt.y, NULL);
1844 }
1845
1846 return ret;
1847 }
1848
1849 #define round(x) ((int)((x)>0?(x)+0.5:(x)-0.5))
1850
1851 static BOOL PATH_WidenPath(DC *dc)
1852 {
1853 INT i, j, numStrokes, penWidth, penWidthIn, penWidthOut, size, penStyle;
1854 BOOL ret = FALSE;
1855 GdiPath *pPath, *pNewPath, **pStrokes, *pUpPath, *pDownPath;
1856 EXTLOGPEN *elp;
1857 DWORD obj_type, joint, endcap, penType;
1858
1859 pPath = &dc->path;
1860
1861 if(pPath->state == PATH_Open) {
1862 SetLastError(ERROR_CAN_NOT_COMPLETE);
1863 return FALSE;
1864 }
1865
1866 PATH_FlattenPath(pPath);
1867
1868 size = GetObjectW( dc->hPen, 0, NULL );
1869 if (!size) {
1870 SetLastError(ERROR_CAN_NOT_COMPLETE);
1871 return FALSE;
1872 }
1873
1874 elp = HeapAlloc( GetProcessHeap(), 0, size );
1875 GetObjectW( dc->hPen, size, elp );
1876
1877 obj_type = GetObjectType(dc->hPen);
1878 if(obj_type == OBJ_PEN) {
1879 penStyle = ((LOGPEN*)elp)->lopnStyle;
1880 }
1881 else if(obj_type == OBJ_EXTPEN) {
1882 penStyle = elp->elpPenStyle;
1883 }
1884 else {
1885 SetLastError(ERROR_CAN_NOT_COMPLETE);
1886 HeapFree( GetProcessHeap(), 0, elp );
1887 return FALSE;
1888 }
1889
1890 penWidth = elp->elpWidth;
1891 HeapFree( GetProcessHeap(), 0, elp );
1892
1893 endcap = (PS_ENDCAP_MASK & penStyle);
1894 joint = (PS_JOIN_MASK & penStyle);
1895 penType = (PS_TYPE_MASK & penStyle);
1896
1897 /* The function cannot apply to cosmetic pens */
1898 if(obj_type == OBJ_EXTPEN && penType == PS_COSMETIC) {
1899 SetLastError(ERROR_CAN_NOT_COMPLETE);
1900 return FALSE;
1901 }
1902
1903 penWidthIn = penWidth / 2;
1904 penWidthOut = penWidth / 2;
1905 if(penWidthIn + penWidthOut < penWidth)
1906 penWidthOut++;
1907
1908 numStrokes = 0;
1909
1910 pStrokes = HeapAlloc(GetProcessHeap(), 0, numStrokes * sizeof(GdiPath*));
1911 pStrokes[0] = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1912 PATH_InitGdiPath(pStrokes[0]);
1913 pStrokes[0]->pFlags = HeapAlloc(GetProcessHeap(), 0, pPath->numEntriesUsed * sizeof(INT));
1914 pStrokes[0]->pPoints = HeapAlloc(GetProcessHeap(), 0, pPath->numEntriesUsed * sizeof(POINT));
1915 pStrokes[0]->numEntriesUsed = 0;
1916
1917 for(i = 0, j = 0; i < pPath->numEntriesUsed; i++, j++) {
1918 POINT point;
1919 if((i == 0 || (pPath->pFlags[i-1] & PT_CLOSEFIGURE)) &&
1920 (pPath->pFlags[i] != PT_MOVETO)) {
1921 ERR("Expected PT_MOVETO %s, got path flag %c\n",
1922 i == 0 ? "as first point" : "after PT_CLOSEFIGURE",
1923 pPath->pFlags[i]);
1924 return FALSE;
1925 }
1926 switch(pPath->pFlags[i]) {
1927 case PT_MOVETO:
1928 if(numStrokes > 0) {
1929 pStrokes[numStrokes - 1]->state = PATH_Closed;
1930 }
1931 numStrokes++;
1932 j = 0;
1933 pStrokes = HeapReAlloc(GetProcessHeap(), 0, pStrokes, numStrokes * sizeof(GdiPath*));
1934 pStrokes[numStrokes - 1] = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1935 PATH_InitGdiPath(pStrokes[numStrokes - 1]);
1936 pStrokes[numStrokes - 1]->state = PATH_Open;
1937 case PT_LINETO:
1938 case (PT_LINETO | PT_CLOSEFIGURE):
1939 point.x = pPath->pPoints[i].x;
1940 point.y = pPath->pPoints[i].y;
1941 PATH_AddEntry(pStrokes[numStrokes - 1], &point, pPath->pFlags[i]);
1942 break;
1943 case PT_BEZIERTO:
1944 /* should never happen because of the FlattenPath call */
1945 ERR("Should never happen\n");
1946 break;
1947 default:
1948 ERR("Got path flag %c\n", pPath->pFlags[i]);
1949 return FALSE;
1950 }
1951 }
1952
1953 pNewPath = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1954 PATH_InitGdiPath(pNewPath);
1955 pNewPath->state = PATH_Open;
1956
1957 for(i = 0; i < numStrokes; i++) {
1958 pUpPath = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1959 PATH_InitGdiPath(pUpPath);
1960 pUpPath->state = PATH_Open;
1961 pDownPath = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1962 PATH_InitGdiPath(pDownPath);
1963 pDownPath->state = PATH_Open;
1964
1965 for(j = 0; j < pStrokes[i]->numEntriesUsed; j++) {
1966 /* Beginning or end of the path if not closed */
1967 if((!(pStrokes[i]->pFlags[pStrokes[i]->numEntriesUsed - 1] & PT_CLOSEFIGURE)) && (j == 0 || j == pStrokes[i]->numEntriesUsed - 1) ) {
1968 /* Compute segment angle */
1969 double xo, yo, xa, ya, theta;
1970 POINT pt;
1971 FLOAT_POINT corners[2];
1972 if(j == 0) {
1973 xo = pStrokes[i]->pPoints[j].x;
1974 yo = pStrokes[i]->pPoints[j].y;
1975 xa = pStrokes[i]->pPoints[1].x;
1976 ya = pStrokes[i]->pPoints[1].y;
1977 }
1978 else {
1979 xa = pStrokes[i]->pPoints[j - 1].x;
1980 ya = pStrokes[i]->pPoints[j - 1].y;
1981 xo = pStrokes[i]->pPoints[j].x;
1982 yo = pStrokes[i]->pPoints[j].y;
1983 }
1984 theta = atan2( ya - yo, xa - xo );
1985 switch(endcap) {
1986 case PS_ENDCAP_SQUARE :
1987 pt.x = xo + round(sqrt(2) * penWidthOut * cos(M_PI_4 + theta));
1988 pt.y = yo + round(sqrt(2) * penWidthOut * sin(M_PI_4 + theta));
1989 PATH_AddEntry(pUpPath, &pt, (j == 0 ? PT_MOVETO : PT_LINETO) );
1990 pt.x = xo + round(sqrt(2) * penWidthIn * cos(- M_PI_4 + theta));
1991 pt.y = yo + round(sqrt(2) * penWidthIn * sin(- M_PI_4 + theta));
1992 PATH_AddEntry(pUpPath, &pt, PT_LINETO);
1993 break;
1994 case PS_ENDCAP_FLAT :
1995 pt.x = xo + round( penWidthOut * cos(theta + M_PI_2) );
1996 pt.y = yo + round( penWidthOut * sin(theta + M_PI_2) );
1997 PATH_AddEntry(pUpPath, &pt, (j == 0 ? PT_MOVETO : PT_LINETO));
1998 pt.x = xo - round( penWidthIn * cos(theta + M_PI_2) );
1999 pt.y = yo - round( penWidthIn * sin(theta + M_PI_2) );
2000 PATH_AddEntry(pUpPath, &pt, PT_LINETO);
2001 break;
2002 case PS_ENDCAP_ROUND :
2003 default :
2004 corners[0].x = xo - penWidthIn;
2005 corners[0].y = yo - penWidthIn;
2006 corners[1].x = xo + penWidthOut;
2007 corners[1].y = yo + penWidthOut;
2008 PATH_DoArcPart(pUpPath ,corners, theta + M_PI_2 , theta + 3 * M_PI_4, (j == 0 ? PT_MOVETO : FALSE));
2009 PATH_DoArcPart(pUpPath ,corners, theta + 3 * M_PI_4 , theta + M_PI, FALSE);
2010 PATH_DoArcPart(pUpPath ,corners, theta + M_PI, theta + 5 * M_PI_4, FALSE);
2011 PATH_DoArcPart(pUpPath ,corners, theta + 5 * M_PI_4 , theta + 3 * M_PI_2, FALSE);
2012 break;
2013 }
2014 }
2015 /* Corpse of the path */
2016 else {
2017 /* Compute angle */
2018 INT previous, next;
2019 double xa, ya, xb, yb, xo, yo;
2020 double alpha, theta, miterWidth;
2021 DWORD _joint = joint;
2022 POINT pt;
2023 GdiPath *pInsidePath, *pOutsidePath;
2024 if(j > 0 && j < pStrokes[i]->numEntriesUsed - 1) {
2025 previous = j - 1;
2026 next = j + 1;
2027 }
2028 else if (j == 0) {
2029 previous = pStrokes[i]->numEntriesUsed - 1;
2030 next = j + 1;
2031 }
2032 else {
2033 previous = j - 1;
2034 next = 0;
2035 }
2036 xo = pStrokes[i]->pPoints[j].x;
2037 yo = pStrokes[i]->pPoints[j].y;
2038 xa = pStrokes[i]->pPoints[previous].x;
2039 ya = pStrokes[i]->pPoints[previous].y;
2040 xb = pStrokes[i]->pPoints[next].x;
2041 yb = pStrokes[i]->pPoints[next].y;
2042 theta = atan2( yo - ya, xo - xa );
2043 alpha = atan2( yb - yo, xb - xo ) - theta;
2044 if (alpha > 0) alpha -= M_PI;
2045 else alpha += M_PI;
2046 if(_joint == PS_JOIN_MITER && dc->miterLimit < fabs(1 / sin(alpha/2))) {
2047 _joint = PS_JOIN_BEVEL;
2048 }
2049 if(alpha > 0) {
2050 pInsidePath = pUpPath;
2051 pOutsidePath = pDownPath;
2052 }
2053 else if(alpha < 0) {
2054 pInsidePath = pDownPath;
2055 pOutsidePath = pUpPath;
2056 }
2057 else {
2058 continue;
2059 }
2060 /* Inside angle points */
2061 if(alpha > 0) {
2062 pt.x = xo - round( penWidthIn * cos(theta + M_PI_2) );
2063 pt.y = yo - round( penWidthIn * sin(theta + M_PI_2) );
2064 }
2065 else {
2066 pt.x = xo + round( penWidthIn * cos(theta + M_PI_2) );
2067 pt.y = yo + round( penWidthIn * sin(theta + M_PI_2) );
2068 }
2069 PATH_AddEntry(pInsidePath, &pt, PT_LINETO);
2070 if(alpha > 0) {
2071 pt.x = xo + round( penWidthIn * cos(M_PI_2 + alpha + theta) );
2072 pt.y = yo + round( penWidthIn * sin(M_PI_2 + alpha + theta) );
2073 }
2074 else {
2075 pt.x = xo - round( penWidthIn * cos(M_PI_2 + alpha + theta) );
2076 pt.y = yo - round( penWidthIn * sin(M_PI_2 + alpha + theta) );
2077 }
2078 PATH_AddEntry(pInsidePath, &pt, PT_LINETO);
2079 /* Outside angle point */
2080 switch(_joint) {
2081 case PS_JOIN_MITER :
2082 miterWidth = fabs(penWidthOut / cos(M_PI_2 - fabs(alpha) / 2));
2083 pt.x = xo + round( miterWidth * cos(theta + alpha / 2) );
2084 pt.y = yo + round( miterWidth * sin(theta + alpha / 2) );
2085 PATH_AddEntry(pOutsidePath, &pt, PT_LINETO);
2086 break;
2087 case PS_JOIN_BEVEL :
2088 if(alpha > 0) {
2089 pt.x = xo + round( penWidthOut * cos(theta + M_PI_2) );
2090 pt.y = yo + round( penWidthOut * sin(theta + M_PI_2) );
2091 }
2092 else {
2093 pt.x = xo - round( penWidthOut * cos(theta + M_PI_2) );
2094 pt.y = yo - round( penWidthOut * sin(theta + M_PI_2) );
2095 }
2096 PATH_AddEntry(pOutsidePath, &pt, PT_LINETO);
2097 if(alpha > 0) {
2098 pt.x = xo - round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2099 pt.y = yo - round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2100 }
2101 else {
2102 pt.x = xo + round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2103 pt.y = yo + round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2104 }
2105 PATH_AddEntry(pOutsidePath, &pt, PT_LINETO);
2106 break;
2107 case PS_JOIN_ROUND :
2108 default :
2109 if(alpha > 0) {
2110 pt.x = xo + round( penWidthOut * cos(theta + M_PI_2) );
2111 pt.y = yo + round( penWidthOut * sin(theta + M_PI_2) );
2112 }
2113 else {
2114 pt.x = xo - round( penWidthOut * cos(theta + M_PI_2) );
2115 pt.y = yo - round( penWidthOut * sin(theta + M_PI_2) );
2116 }
2117 PATH_AddEntry(pOutsidePath, &pt, PT_BEZIERTO);
2118 pt.x = xo + round( penWidthOut * cos(theta + alpha / 2) );
2119 pt.y = yo + round( penWidthOut * sin(theta + alpha / 2) );
2120 PATH_AddEntry(pOutsidePath, &pt, PT_BEZIERTO);
2121 if(alpha > 0) {
2122 pt.x = xo - round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2123 pt.y = yo - round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2124 }
2125 else {
2126 pt.x = xo + round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2127 pt.y = yo + round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2128 }
2129 PATH_AddEntry(pOutsidePath, &pt, PT_BEZIERTO);
2130 break;
2131 }
2132 }
2133 }
2134 for(j = 0; j < pUpPath->numEntriesUsed; j++) {
2135 POINT pt;
2136 pt.x = pUpPath->pPoints[j].x;
2137 pt.y = pUpPath->pPoints[j].y;
2138 PATH_AddEntry(pNewPath, &pt, (j == 0 ? PT_MOVETO : PT_LINETO));
2139 }
2140 for(j = 0; j < pDownPath->numEntriesUsed; j++) {
2141 POINT pt;
2142 pt.x = pDownPath->pPoints[pDownPath->numEntriesUsed - j - 1].x;
2143 pt.y = pDownPath->pPoints[pDownPath->numEntriesUsed - j - 1].y;
2144 PATH_AddEntry(pNewPath, &pt, ( (j == 0 && (pStrokes[i]->pFlags[pStrokes[i]->numEntriesUsed - 1] & PT_CLOSEFIGURE)) ? PT_MOVETO : PT_LINETO));
2145 }
2146
2147 PATH_DestroyGdiPath(pStrokes[i]);
2148 HeapFree(GetProcessHeap(), 0, pStrokes[i]);
2149 PATH_DestroyGdiPath(pUpPath);
2150 HeapFree(GetProcessHeap(), 0, pUpPath);
2151 PATH_DestroyGdiPath(pDownPath);
2152 HeapFree(GetProcessHeap(), 0, pDownPath);
2153 }
2154 HeapFree(GetProcessHeap(), 0, pStrokes);
2155
2156 pNewPath->state = PATH_Closed;
2157 if (!(ret = PATH_AssignGdiPath(pPath, pNewPath)))
2158 ERR("Assign path failed\n");
2159 PATH_DestroyGdiPath(pNewPath);
2160 HeapFree(GetProcessHeap(), 0, pNewPath);
2161 return ret;
2162 }
2163
2164
2165 /*******************************************************************
2166 * StrokeAndFillPath [GDI32.@]
2167 *
2168 *
2169 */
2170 BOOL WINAPI StrokeAndFillPath(HDC hdc)
2171 {
2172 DC *dc = get_dc_ptr( hdc );
2173 BOOL bRet = FALSE;
2174
2175 if(!dc) return FALSE;
2176
2177 if(dc->funcs->pStrokeAndFillPath)
2178 bRet = dc->funcs->pStrokeAndFillPath(dc->physDev);
2179 else
2180 {
2181 bRet = PATH_FillPath(dc, &dc->path);
2182 if(bRet) bRet = PATH_StrokePath(dc, &dc->path);
2183 if(bRet) PATH_EmptyPath(&dc->path);
2184 }
2185 release_dc_ptr( dc );
2186 return bRet;
2187 }
2188
2189
2190 /*******************************************************************
2191 * StrokePath [GDI32.@]
2192 *
2193 *
2194 */
2195 BOOL WINAPI StrokePath(HDC hdc)
2196 {
2197 DC *dc = get_dc_ptr( hdc );
2198 GdiPath *pPath;
2199 BOOL bRet = FALSE;
2200
2201 TRACE("(%p)\n", hdc);
2202 if(!dc) return FALSE;
2203
2204 if(dc->funcs->pStrokePath)
2205 bRet = dc->funcs->pStrokePath(dc->physDev);
2206 else
2207 {
2208 pPath = &dc->path;
2209 bRet = PATH_StrokePath(dc, pPath);
2210 PATH_EmptyPath(pPath);
2211 }
2212 release_dc_ptr( dc );
2213 return bRet;
2214 }
2215
2216
2217 /*******************************************************************
2218 * WidenPath [GDI32.@]
2219 *
2220 *
2221 */
2222 BOOL WINAPI WidenPath(HDC hdc)
2223 {
2224 DC *dc = get_dc_ptr( hdc );
2225 BOOL ret = FALSE;
2226
2227 if(!dc) return FALSE;
2228
2229 if(dc->funcs->pWidenPath)
2230 ret = dc->funcs->pWidenPath(dc->physDev);
2231 else
2232 ret = PATH_WidenPath(dc);
2233 release_dc_ptr( dc );
2234 return ret;
2235 }
2236
This page was automatically generated by the
LXR engine.
Visit the LXR main site for more
information.