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 LPtoDP(dc->hSelf, &pt, 1);
1357 PATH_AddEntry(pPath, &pt, PT_MOVETO);
1358
1359 curve = (TTPOLYCURVE *)(header + 1);
1360
1361 while ((char *)curve < (char *)header + header->cb)
1362 {
1363 /*TRACE("curve->wType %d\n", curve->wType);*/
1364
1365 switch(curve->wType)
1366 {
1367 case TT_PRIM_LINE:
1368 {
1369 WORD i;
1370
1371 for (i = 0; i < curve->cpfx; i++)
1372 {
1373 pt.x = x + int_from_fixed(curve->apfx[i].x);
1374 pt.y = y - int_from_fixed(curve->apfx[i].y);
1375 LPtoDP(dc->hSelf, &pt, 1);
1376 PATH_AddEntry(pPath, &pt, PT_LINETO);
1377 }
1378 break;
1379 }
1380
1381 case TT_PRIM_QSPLINE:
1382 case TT_PRIM_CSPLINE:
1383 {
1384 WORD i;
1385 POINTFX ptfx;
1386 POINT *pts = HeapAlloc(GetProcessHeap(), 0, (curve->cpfx + 1) * sizeof(POINT));
1387
1388 if (!pts) return FALSE;
1389
1390 ptfx = *(POINTFX *)((char *)curve - sizeof(POINTFX));
1391
1392 pts[0].x = x + int_from_fixed(ptfx.x);
1393 pts[0].y = y - int_from_fixed(ptfx.y);
1394 LPtoDP(dc->hSelf, &pts[0], 1);
1395
1396 for(i = 0; i < curve->cpfx; i++)
1397 {
1398 pts[i + 1].x = x + int_from_fixed(curve->apfx[i].x);
1399 pts[i + 1].y = y - int_from_fixed(curve->apfx[i].y);
1400 LPtoDP(dc->hSelf, &pts[i + 1], 1);
1401 }
1402
1403 PATH_BezierTo(pPath, pts, curve->cpfx + 1);
1404
1405 HeapFree(GetProcessHeap(), 0, pts);
1406 break;
1407 }
1408
1409 default:
1410 FIXME("Unknown curve type %04x\n", curve->wType);
1411 return FALSE;
1412 }
1413
1414 curve = (TTPOLYCURVE *)&curve->apfx[curve->cpfx];
1415 }
1416
1417 header = (TTPOLYGONHEADER *)((char *)header + header->cb);
1418 }
1419
1420 return CloseFigure(dc->hSelf);
1421 }
1422
1423 /**********************************************************************
1424 * PATH_ExtTextOut
1425 */
1426 BOOL PATH_ExtTextOut(DC *dc, INT x, INT y, UINT flags, const RECT *lprc,
1427 LPCWSTR str, UINT count, const INT *dx)
1428 {
1429 unsigned int idx;
1430 double cosEsc, sinEsc;
1431 LOGFONTW lf;
1432 POINT org;
1433 HDC hdc = dc->hSelf;
1434 INT offset = 0, xoff = 0, yoff = 0;
1435
1436 TRACE("%p, %d, %d, %08x, %s, %s, %d, %p)\n", hdc, x, y, flags,
1437 wine_dbgstr_rect(lprc), debugstr_wn(str, count), count, dx);
1438
1439 if (!count) return TRUE;
1440
1441 GetObjectW(GetCurrentObject(hdc, OBJ_FONT), sizeof(lf), &lf);
1442
1443 if (lf.lfEscapement != 0)
1444 {
1445 cosEsc = cos(lf.lfEscapement * M_PI / 1800);
1446 sinEsc = sin(lf.lfEscapement * M_PI / 1800);
1447 } else
1448 {
1449 cosEsc = 1;
1450 sinEsc = 0;
1451 }
1452
1453 GetDCOrgEx(hdc, &org);
1454
1455 for (idx = 0; idx < count; idx++)
1456 {
1457 GLYPHMETRICS gm;
1458 DWORD dwSize;
1459 void *outline;
1460
1461 dwSize = GetGlyphOutlineW(hdc, str[idx], GGO_GLYPH_INDEX | GGO_NATIVE, &gm, 0, NULL, NULL);
1462 if (!dwSize) return FALSE;
1463
1464 outline = HeapAlloc(GetProcessHeap(), 0, dwSize);
1465 if (!outline) return FALSE;
1466
1467 GetGlyphOutlineW(hdc, str[idx], GGO_GLYPH_INDEX | GGO_NATIVE, &gm, dwSize, outline, NULL);
1468
1469 PATH_add_outline(dc, org.x + x + xoff, org.x + y + yoff, outline, dwSize);
1470
1471 HeapFree(GetProcessHeap(), 0, outline);
1472
1473 if (dx)
1474 {
1475 offset += dx[idx];
1476 xoff = offset * cosEsc;
1477 yoff = offset * -sinEsc;
1478 }
1479 else
1480 {
1481 xoff += gm.gmCellIncX;
1482 yoff += gm.gmCellIncY;
1483 }
1484 }
1485 return TRUE;
1486 }
1487
1488 /* PATH_EmptyPath
1489 *
1490 * Removes all entries from the path and sets the path state to PATH_Null.
1491 */
1492 static void PATH_EmptyPath(GdiPath *pPath)
1493 {
1494 assert(pPath!=NULL);
1495
1496 pPath->state=PATH_Null;
1497 pPath->numEntriesUsed=0;
1498 }
1499
1500 /* PATH_AddEntry
1501 *
1502 * Adds an entry to the path. For "flags", pass either PT_MOVETO, PT_LINETO
1503 * or PT_BEZIERTO, optionally ORed with PT_CLOSEFIGURE. Returns TRUE if
1504 * successful, FALSE otherwise (e.g. if not enough memory was available).
1505 */
1506 static BOOL PATH_AddEntry(GdiPath *pPath, const POINT *pPoint, BYTE flags)
1507 {
1508 assert(pPath!=NULL);
1509
1510 /* FIXME: If newStroke is true, perhaps we want to check that we're
1511 * getting a PT_MOVETO
1512 */
1513 TRACE("(%d,%d) - %d\n", pPoint->x, pPoint->y, flags);
1514
1515 /* Check that path is open */
1516 if(pPath->state!=PATH_Open)
1517 return FALSE;
1518
1519 /* Reserve enough memory for an extra path entry */
1520 if(!PATH_ReserveEntries(pPath, pPath->numEntriesUsed+1))
1521 return FALSE;
1522
1523 /* Store information in path entry */
1524 pPath->pPoints[pPath->numEntriesUsed]=*pPoint;
1525 pPath->pFlags[pPath->numEntriesUsed]=flags;
1526
1527 /* If this is PT_CLOSEFIGURE, we have to start a new stroke next time */
1528 if((flags & PT_CLOSEFIGURE) == PT_CLOSEFIGURE)
1529 pPath->newStroke=TRUE;
1530
1531 /* Increment entry count */
1532 pPath->numEntriesUsed++;
1533
1534 return TRUE;
1535 }
1536
1537 /* PATH_ReserveEntries
1538 *
1539 * Ensures that at least "numEntries" entries (for points and flags) have
1540 * been allocated; allocates larger arrays and copies the existing entries
1541 * to those arrays, if necessary. Returns TRUE if successful, else FALSE.
1542 */
1543 static BOOL PATH_ReserveEntries(GdiPath *pPath, INT numEntries)
1544 {
1545 INT numEntriesToAllocate;
1546 POINT *pPointsNew;
1547 BYTE *pFlagsNew;
1548
1549 assert(pPath!=NULL);
1550 assert(numEntries>=0);
1551
1552 /* Do we have to allocate more memory? */
1553 if(numEntries > pPath->numEntriesAllocated)
1554 {
1555 /* Find number of entries to allocate. We let the size of the array
1556 * grow exponentially, since that will guarantee linear time
1557 * complexity. */
1558 if(pPath->numEntriesAllocated)
1559 {
1560 numEntriesToAllocate=pPath->numEntriesAllocated;
1561 while(numEntriesToAllocate<numEntries)
1562 numEntriesToAllocate=numEntriesToAllocate*GROW_FACTOR_NUMER/
1563 GROW_FACTOR_DENOM;
1564 }
1565 else
1566 numEntriesToAllocate=numEntries;
1567
1568 /* Allocate new arrays */
1569 pPointsNew=HeapAlloc( GetProcessHeap(), 0, numEntriesToAllocate * sizeof(POINT) );
1570 if(!pPointsNew)
1571 return FALSE;
1572 pFlagsNew=HeapAlloc( GetProcessHeap(), 0, numEntriesToAllocate * sizeof(BYTE) );
1573 if(!pFlagsNew)
1574 {
1575 HeapFree( GetProcessHeap(), 0, pPointsNew );
1576 return FALSE;
1577 }
1578
1579 /* Copy old arrays to new arrays and discard old arrays */
1580 if(pPath->pPoints)
1581 {
1582 assert(pPath->pFlags);
1583
1584 memcpy(pPointsNew, pPath->pPoints,
1585 sizeof(POINT)*pPath->numEntriesUsed);
1586 memcpy(pFlagsNew, pPath->pFlags,
1587 sizeof(BYTE)*pPath->numEntriesUsed);
1588
1589 HeapFree( GetProcessHeap(), 0, pPath->pPoints );
1590 HeapFree( GetProcessHeap(), 0, pPath->pFlags );
1591 }
1592 pPath->pPoints=pPointsNew;
1593 pPath->pFlags=pFlagsNew;
1594 pPath->numEntriesAllocated=numEntriesToAllocate;
1595 }
1596
1597 return TRUE;
1598 }
1599
1600 /* PATH_DoArcPart
1601 *
1602 * Creates a Bezier spline that corresponds to part of an arc and appends the
1603 * corresponding points to the path. The start and end angles are passed in
1604 * "angleStart" and "angleEnd"; these angles should span a quarter circle
1605 * at most. If "startEntryType" is non-zero, an entry of that type for the first
1606 * control point is added to the path; otherwise, it is assumed that the current
1607 * position is equal to the first control point.
1608 */
1609 static BOOL PATH_DoArcPart(GdiPath *pPath, FLOAT_POINT corners[],
1610 double angleStart, double angleEnd, BYTE startEntryType)
1611 {
1612 double halfAngle, a;
1613 double xNorm[4], yNorm[4];
1614 POINT point;
1615 int i;
1616
1617 assert(fabs(angleEnd-angleStart)<=M_PI_2);
1618
1619 /* FIXME: Is there an easier way of computing this? */
1620
1621 /* Compute control points */
1622 halfAngle=(angleEnd-angleStart)/2.0;
1623 if(fabs(halfAngle)>1e-8)
1624 {
1625 a=4.0/3.0*(1-cos(halfAngle))/sin(halfAngle);
1626 xNorm[0]=cos(angleStart);
1627 yNorm[0]=sin(angleStart);
1628 xNorm[1]=xNorm[0] - a*yNorm[0];
1629 yNorm[1]=yNorm[0] + a*xNorm[0];
1630 xNorm[3]=cos(angleEnd);
1631 yNorm[3]=sin(angleEnd);
1632 xNorm[2]=xNorm[3] + a*yNorm[3];
1633 yNorm[2]=yNorm[3] - a*xNorm[3];
1634 }
1635 else
1636 for(i=0; i<4; i++)
1637 {
1638 xNorm[i]=cos(angleStart);
1639 yNorm[i]=sin(angleStart);
1640 }
1641
1642 /* Add starting point to path if desired */
1643 if(startEntryType)
1644 {
1645 PATH_ScaleNormalizedPoint(corners, xNorm[0], yNorm[0], &point);
1646 if(!PATH_AddEntry(pPath, &point, startEntryType))
1647 return FALSE;
1648 }
1649
1650 /* Add remaining control points */
1651 for(i=1; i<4; i++)
1652 {
1653 PATH_ScaleNormalizedPoint(corners, xNorm[i], yNorm[i], &point);
1654 if(!PATH_AddEntry(pPath, &point, PT_BEZIERTO))
1655 return FALSE;
1656 }
1657
1658 return TRUE;
1659 }
1660
1661 /* PATH_ScaleNormalizedPoint
1662 *
1663 * Scales a normalized point (x, y) with respect to the box whose corners are
1664 * passed in "corners". The point is stored in "*pPoint". The normalized
1665 * coordinates (-1.0, -1.0) correspond to corners[0], the coordinates
1666 * (1.0, 1.0) correspond to corners[1].
1667 */
1668 static void PATH_ScaleNormalizedPoint(FLOAT_POINT corners[], double x,
1669 double y, POINT *pPoint)
1670 {
1671 pPoint->x=GDI_ROUND( (double)corners[0].x +
1672 (double)(corners[1].x-corners[0].x)*0.5*(x+1.0) );
1673 pPoint->y=GDI_ROUND( (double)corners[0].y +
1674 (double)(corners[1].y-corners[0].y)*0.5*(y+1.0) );
1675 }
1676
1677 /* PATH_NormalizePoint
1678 *
1679 * Normalizes a point with respect to the box whose corners are passed in
1680 * "corners". The normalized coordinates are stored in "*pX" and "*pY".
1681 */
1682 static void PATH_NormalizePoint(FLOAT_POINT corners[],
1683 const FLOAT_POINT *pPoint,
1684 double *pX, double *pY)
1685 {
1686 *pX=(double)(pPoint->x-corners[0].x)/(double)(corners[1].x-corners[0].x) *
1687 2.0 - 1.0;
1688 *pY=(double)(pPoint->y-corners[0].y)/(double)(corners[1].y-corners[0].y) *
1689 2.0 - 1.0;
1690 }
1691
1692
1693 /*******************************************************************
1694 * FlattenPath [GDI32.@]
1695 *
1696 *
1697 */
1698 BOOL WINAPI FlattenPath(HDC hdc)
1699 {
1700 BOOL ret = FALSE;
1701 DC *dc = get_dc_ptr( hdc );
1702
1703 if(!dc) return FALSE;
1704
1705 if(dc->funcs->pFlattenPath) ret = dc->funcs->pFlattenPath(dc->physDev);
1706 else
1707 {
1708 GdiPath *pPath = &dc->path;
1709 if(pPath->state != PATH_Closed)
1710 ret = PATH_FlattenPath(pPath);
1711 }
1712 release_dc_ptr( dc );
1713 return ret;
1714 }
1715
1716
1717 static BOOL PATH_StrokePath(DC *dc, GdiPath *pPath)
1718 {
1719 INT i, nLinePts, nAlloc;
1720 POINT *pLinePts;
1721 POINT ptViewportOrg, ptWindowOrg;
1722 SIZE szViewportExt, szWindowExt;
1723 DWORD mapMode, graphicsMode;
1724 XFORM xform;
1725 BOOL ret = TRUE;
1726
1727 if(dc->funcs->pStrokePath)
1728 return dc->funcs->pStrokePath(dc->physDev);
1729
1730 if(pPath->state != PATH_Closed)
1731 return FALSE;
1732
1733 /* Save the mapping mode info */
1734 mapMode=GetMapMode(dc->hSelf);
1735 GetViewportExtEx(dc->hSelf, &szViewportExt);
1736 GetViewportOrgEx(dc->hSelf, &ptViewportOrg);
1737 GetWindowExtEx(dc->hSelf, &szWindowExt);
1738 GetWindowOrgEx(dc->hSelf, &ptWindowOrg);
1739 GetWorldTransform(dc->hSelf, &xform);
1740
1741 /* Set MM_TEXT */
1742 SetMapMode(dc->hSelf, MM_TEXT);
1743 SetViewportOrgEx(dc->hSelf, 0, 0, NULL);
1744 SetWindowOrgEx(dc->hSelf, 0, 0, NULL);
1745 graphicsMode=GetGraphicsMode(dc->hSelf);
1746 SetGraphicsMode(dc->hSelf, GM_ADVANCED);
1747 ModifyWorldTransform(dc->hSelf, &xform, MWT_IDENTITY);
1748 SetGraphicsMode(dc->hSelf, graphicsMode);
1749
1750 /* Allocate enough memory for the worst case without beziers (one PT_MOVETO
1751 * and the rest PT_LINETO with PT_CLOSEFIGURE at the end) plus some buffer
1752 * space in case we get one to keep the number of reallocations small. */
1753 nAlloc = pPath->numEntriesUsed + 1 + 300;
1754 pLinePts = HeapAlloc(GetProcessHeap(), 0, nAlloc * sizeof(POINT));
1755 nLinePts = 0;
1756
1757 for(i = 0; i < pPath->numEntriesUsed; i++) {
1758 if((i == 0 || (pPath->pFlags[i-1] & PT_CLOSEFIGURE)) &&
1759 (pPath->pFlags[i] != PT_MOVETO)) {
1760 ERR("Expected PT_MOVETO %s, got path flag %d\n",
1761 i == 0 ? "as first point" : "after PT_CLOSEFIGURE",
1762 (INT)pPath->pFlags[i]);
1763 ret = FALSE;
1764 goto end;
1765 }
1766 switch(pPath->pFlags[i]) {
1767 case PT_MOVETO:
1768 TRACE("Got PT_MOVETO (%d, %d)\n",
1769 pPath->pPoints[i].x, pPath->pPoints[i].y);
1770 if(nLinePts >= 2)
1771 Polyline(dc->hSelf, pLinePts, nLinePts);
1772 nLinePts = 0;
1773 pLinePts[nLinePts++] = pPath->pPoints[i];
1774 break;
1775 case PT_LINETO:
1776 case (PT_LINETO | PT_CLOSEFIGURE):
1777 TRACE("Got PT_LINETO (%d, %d)\n",
1778 pPath->pPoints[i].x, pPath->pPoints[i].y);
1779 pLinePts[nLinePts++] = pPath->pPoints[i];
1780 break;
1781 case PT_BEZIERTO:
1782 TRACE("Got PT_BEZIERTO\n");
1783 if(pPath->pFlags[i+1] != PT_BEZIERTO ||
1784 (pPath->pFlags[i+2] & ~PT_CLOSEFIGURE) != PT_BEZIERTO) {
1785 ERR("Path didn't contain 3 successive PT_BEZIERTOs\n");
1786 ret = FALSE;
1787 goto end;
1788 } else {
1789 INT nBzrPts, nMinAlloc;
1790 POINT *pBzrPts = GDI_Bezier(&pPath->pPoints[i-1], 4, &nBzrPts);
1791 /* Make sure we have allocated enough memory for the lines of
1792 * this bezier and the rest of the path, assuming we won't get
1793 * another one (since we won't reallocate again then). */
1794 nMinAlloc = nLinePts + (pPath->numEntriesUsed - i) + nBzrPts;
1795 if(nAlloc < nMinAlloc)
1796 {
1797 nAlloc = nMinAlloc * 2;
1798 pLinePts = HeapReAlloc(GetProcessHeap(), 0, pLinePts,
1799 nAlloc * sizeof(POINT));
1800 }
1801 memcpy(&pLinePts[nLinePts], &pBzrPts[1],
1802 (nBzrPts - 1) * sizeof(POINT));
1803 nLinePts += nBzrPts - 1;
1804 HeapFree(GetProcessHeap(), 0, pBzrPts);
1805 i += 2;
1806 }
1807 break;
1808 default:
1809 ERR("Got path flag %d\n", (INT)pPath->pFlags[i]);
1810 ret = FALSE;
1811 goto end;
1812 }
1813 if(pPath->pFlags[i] & PT_CLOSEFIGURE)
1814 pLinePts[nLinePts++] = pLinePts[0];
1815 }
1816 if(nLinePts >= 2)
1817 Polyline(dc->hSelf, pLinePts, nLinePts);
1818
1819 end:
1820 HeapFree(GetProcessHeap(), 0, pLinePts);
1821
1822 /* Restore the old mapping mode */
1823 SetMapMode(dc->hSelf, mapMode);
1824 SetWindowExtEx(dc->hSelf, szWindowExt.cx, szWindowExt.cy, NULL);
1825 SetWindowOrgEx(dc->hSelf, ptWindowOrg.x, ptWindowOrg.y, NULL);
1826 SetViewportExtEx(dc->hSelf, szViewportExt.cx, szViewportExt.cy, NULL);
1827 SetViewportOrgEx(dc->hSelf, ptViewportOrg.x, ptViewportOrg.y, NULL);
1828
1829 /* Go to GM_ADVANCED temporarily to restore the world transform */
1830 graphicsMode=GetGraphicsMode(dc->hSelf);
1831 SetGraphicsMode(dc->hSelf, GM_ADVANCED);
1832 SetWorldTransform(dc->hSelf, &xform);
1833 SetGraphicsMode(dc->hSelf, graphicsMode);
1834
1835 /* If we've moved the current point then get its new position
1836 which will be in device (MM_TEXT) co-ords, convert it to
1837 logical co-ords and re-set it. This basically updates
1838 dc->CurPosX|Y so that their values are in the correct mapping
1839 mode.
1840 */
1841 if(i > 0) {
1842 POINT pt;
1843 GetCurrentPositionEx(dc->hSelf, &pt);
1844 DPtoLP(dc->hSelf, &pt, 1);
1845 MoveToEx(dc->hSelf, pt.x, pt.y, NULL);
1846 }
1847
1848 return ret;
1849 }
1850
1851 #define round(x) ((int)((x)>0?(x)+0.5:(x)-0.5))
1852
1853 static BOOL PATH_WidenPath(DC *dc)
1854 {
1855 INT i, j, numStrokes, penWidth, penWidthIn, penWidthOut, size, penStyle;
1856 BOOL ret = FALSE;
1857 GdiPath *pPath, *pNewPath, **pStrokes, *pUpPath, *pDownPath;
1858 EXTLOGPEN *elp;
1859 DWORD obj_type, joint, endcap, penType;
1860
1861 pPath = &dc->path;
1862
1863 if(pPath->state == PATH_Open) {
1864 SetLastError(ERROR_CAN_NOT_COMPLETE);
1865 return FALSE;
1866 }
1867
1868 PATH_FlattenPath(pPath);
1869
1870 size = GetObjectW( dc->hPen, 0, NULL );
1871 if (!size) {
1872 SetLastError(ERROR_CAN_NOT_COMPLETE);
1873 return FALSE;
1874 }
1875
1876 elp = HeapAlloc( GetProcessHeap(), 0, size );
1877 GetObjectW( dc->hPen, size, elp );
1878
1879 obj_type = GetObjectType(dc->hPen);
1880 if(obj_type == OBJ_PEN) {
1881 penStyle = ((LOGPEN*)elp)->lopnStyle;
1882 }
1883 else if(obj_type == OBJ_EXTPEN) {
1884 penStyle = elp->elpPenStyle;
1885 }
1886 else {
1887 SetLastError(ERROR_CAN_NOT_COMPLETE);
1888 HeapFree( GetProcessHeap(), 0, elp );
1889 return FALSE;
1890 }
1891
1892 penWidth = elp->elpWidth;
1893 HeapFree( GetProcessHeap(), 0, elp );
1894
1895 endcap = (PS_ENDCAP_MASK & penStyle);
1896 joint = (PS_JOIN_MASK & penStyle);
1897 penType = (PS_TYPE_MASK & penStyle);
1898
1899 /* The function cannot apply to cosmetic pens */
1900 if(obj_type == OBJ_EXTPEN && penType == PS_COSMETIC) {
1901 SetLastError(ERROR_CAN_NOT_COMPLETE);
1902 return FALSE;
1903 }
1904
1905 penWidthIn = penWidth / 2;
1906 penWidthOut = penWidth / 2;
1907 if(penWidthIn + penWidthOut < penWidth)
1908 penWidthOut++;
1909
1910 numStrokes = 0;
1911
1912 pStrokes = HeapAlloc(GetProcessHeap(), 0, numStrokes * sizeof(GdiPath*));
1913 pStrokes[0] = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1914 PATH_InitGdiPath(pStrokes[0]);
1915 pStrokes[0]->pFlags = HeapAlloc(GetProcessHeap(), 0, pPath->numEntriesUsed * sizeof(INT));
1916 pStrokes[0]->pPoints = HeapAlloc(GetProcessHeap(), 0, pPath->numEntriesUsed * sizeof(POINT));
1917 pStrokes[0]->numEntriesUsed = 0;
1918
1919 for(i = 0, j = 0; i < pPath->numEntriesUsed; i++, j++) {
1920 POINT point;
1921 if((i == 0 || (pPath->pFlags[i-1] & PT_CLOSEFIGURE)) &&
1922 (pPath->pFlags[i] != PT_MOVETO)) {
1923 ERR("Expected PT_MOVETO %s, got path flag %c\n",
1924 i == 0 ? "as first point" : "after PT_CLOSEFIGURE",
1925 pPath->pFlags[i]);
1926 return FALSE;
1927 }
1928 switch(pPath->pFlags[i]) {
1929 case PT_MOVETO:
1930 if(numStrokes > 0) {
1931 pStrokes[numStrokes - 1]->state = PATH_Closed;
1932 }
1933 numStrokes++;
1934 j = 0;
1935 pStrokes = HeapReAlloc(GetProcessHeap(), 0, pStrokes, numStrokes * sizeof(GdiPath*));
1936 pStrokes[numStrokes - 1] = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1937 PATH_InitGdiPath(pStrokes[numStrokes - 1]);
1938 pStrokes[numStrokes - 1]->state = PATH_Open;
1939 case PT_LINETO:
1940 case (PT_LINETO | PT_CLOSEFIGURE):
1941 point.x = pPath->pPoints[i].x;
1942 point.y = pPath->pPoints[i].y;
1943 PATH_AddEntry(pStrokes[numStrokes - 1], &point, pPath->pFlags[i]);
1944 break;
1945 case PT_BEZIERTO:
1946 /* should never happen because of the FlattenPath call */
1947 ERR("Should never happen\n");
1948 break;
1949 default:
1950 ERR("Got path flag %c\n", pPath->pFlags[i]);
1951 return FALSE;
1952 }
1953 }
1954
1955 pNewPath = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1956 PATH_InitGdiPath(pNewPath);
1957 pNewPath->state = PATH_Open;
1958
1959 for(i = 0; i < numStrokes; i++) {
1960 pUpPath = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1961 PATH_InitGdiPath(pUpPath);
1962 pUpPath->state = PATH_Open;
1963 pDownPath = HeapAlloc(GetProcessHeap(), 0, sizeof(GdiPath));
1964 PATH_InitGdiPath(pDownPath);
1965 pDownPath->state = PATH_Open;
1966
1967 for(j = 0; j < pStrokes[i]->numEntriesUsed; j++) {
1968 /* Beginning or end of the path if not closed */
1969 if((!(pStrokes[i]->pFlags[pStrokes[i]->numEntriesUsed - 1] & PT_CLOSEFIGURE)) && (j == 0 || j == pStrokes[i]->numEntriesUsed - 1) ) {
1970 /* Compute segment angle */
1971 double xo, yo, xa, ya, theta;
1972 POINT pt;
1973 FLOAT_POINT corners[2];
1974 if(j == 0) {
1975 xo = pStrokes[i]->pPoints[j].x;
1976 yo = pStrokes[i]->pPoints[j].y;
1977 xa = pStrokes[i]->pPoints[1].x;
1978 ya = pStrokes[i]->pPoints[1].y;
1979 }
1980 else {
1981 xa = pStrokes[i]->pPoints[j - 1].x;
1982 ya = pStrokes[i]->pPoints[j - 1].y;
1983 xo = pStrokes[i]->pPoints[j].x;
1984 yo = pStrokes[i]->pPoints[j].y;
1985 }
1986 theta = atan2( ya - yo, xa - xo );
1987 switch(endcap) {
1988 case PS_ENDCAP_SQUARE :
1989 pt.x = xo + round(sqrt(2) * penWidthOut * cos(M_PI_4 + theta));
1990 pt.y = yo + round(sqrt(2) * penWidthOut * sin(M_PI_4 + theta));
1991 PATH_AddEntry(pUpPath, &pt, (j == 0 ? PT_MOVETO : PT_LINETO) );
1992 pt.x = xo + round(sqrt(2) * penWidthIn * cos(- M_PI_4 + theta));
1993 pt.y = yo + round(sqrt(2) * penWidthIn * sin(- M_PI_4 + theta));
1994 PATH_AddEntry(pUpPath, &pt, PT_LINETO);
1995 break;
1996 case PS_ENDCAP_FLAT :
1997 pt.x = xo + round( penWidthOut * cos(theta + M_PI_2) );
1998 pt.y = yo + round( penWidthOut * sin(theta + M_PI_2) );
1999 PATH_AddEntry(pUpPath, &pt, (j == 0 ? PT_MOVETO : PT_LINETO));
2000 pt.x = xo - round( penWidthIn * cos(theta + M_PI_2) );
2001 pt.y = yo - round( penWidthIn * sin(theta + M_PI_2) );
2002 PATH_AddEntry(pUpPath, &pt, PT_LINETO);
2003 break;
2004 case PS_ENDCAP_ROUND :
2005 default :
2006 corners[0].x = xo - penWidthIn;
2007 corners[0].y = yo - penWidthIn;
2008 corners[1].x = xo + penWidthOut;
2009 corners[1].y = yo + penWidthOut;
2010 PATH_DoArcPart(pUpPath ,corners, theta + M_PI_2 , theta + 3 * M_PI_4, (j == 0 ? PT_MOVETO : FALSE));
2011 PATH_DoArcPart(pUpPath ,corners, theta + 3 * M_PI_4 , theta + M_PI, FALSE);
2012 PATH_DoArcPart(pUpPath ,corners, theta + M_PI, theta + 5 * M_PI_4, FALSE);
2013 PATH_DoArcPart(pUpPath ,corners, theta + 5 * M_PI_4 , theta + 3 * M_PI_2, FALSE);
2014 break;
2015 }
2016 }
2017 /* Corpse of the path */
2018 else {
2019 /* Compute angle */
2020 INT previous, next;
2021 double xa, ya, xb, yb, xo, yo;
2022 double alpha, theta, miterWidth;
2023 DWORD _joint = joint;
2024 POINT pt;
2025 GdiPath *pInsidePath, *pOutsidePath;
2026 if(j > 0 && j < pStrokes[i]->numEntriesUsed - 1) {
2027 previous = j - 1;
2028 next = j + 1;
2029 }
2030 else if (j == 0) {
2031 previous = pStrokes[i]->numEntriesUsed - 1;
2032 next = j + 1;
2033 }
2034 else {
2035 previous = j - 1;
2036 next = 0;
2037 }
2038 xo = pStrokes[i]->pPoints[j].x;
2039 yo = pStrokes[i]->pPoints[j].y;
2040 xa = pStrokes[i]->pPoints[previous].x;
2041 ya = pStrokes[i]->pPoints[previous].y;
2042 xb = pStrokes[i]->pPoints[next].x;
2043 yb = pStrokes[i]->pPoints[next].y;
2044 theta = atan2( yo - ya, xo - xa );
2045 alpha = atan2( yb - yo, xb - xo ) - theta;
2046 if (alpha > 0) alpha -= M_PI;
2047 else alpha += M_PI;
2048 if(_joint == PS_JOIN_MITER && dc->miterLimit < fabs(1 / sin(alpha/2))) {
2049 _joint = PS_JOIN_BEVEL;
2050 }
2051 if(alpha > 0) {
2052 pInsidePath = pUpPath;
2053 pOutsidePath = pDownPath;
2054 }
2055 else if(alpha < 0) {
2056 pInsidePath = pDownPath;
2057 pOutsidePath = pUpPath;
2058 }
2059 else {
2060 continue;
2061 }
2062 /* Inside angle points */
2063 if(alpha > 0) {
2064 pt.x = xo - round( penWidthIn * cos(theta + M_PI_2) );
2065 pt.y = yo - round( penWidthIn * sin(theta + M_PI_2) );
2066 }
2067 else {
2068 pt.x = xo + round( penWidthIn * cos(theta + M_PI_2) );
2069 pt.y = yo + round( penWidthIn * sin(theta + M_PI_2) );
2070 }
2071 PATH_AddEntry(pInsidePath, &pt, PT_LINETO);
2072 if(alpha > 0) {
2073 pt.x = xo + round( penWidthIn * cos(M_PI_2 + alpha + theta) );
2074 pt.y = yo + round( penWidthIn * sin(M_PI_2 + alpha + theta) );
2075 }
2076 else {
2077 pt.x = xo - round( penWidthIn * cos(M_PI_2 + alpha + theta) );
2078 pt.y = yo - round( penWidthIn * sin(M_PI_2 + alpha + theta) );
2079 }
2080 PATH_AddEntry(pInsidePath, &pt, PT_LINETO);
2081 /* Outside angle point */
2082 switch(_joint) {
2083 case PS_JOIN_MITER :
2084 miterWidth = fabs(penWidthOut / cos(M_PI_2 - fabs(alpha) / 2));
2085 pt.x = xo + round( miterWidth * cos(theta + alpha / 2) );
2086 pt.y = yo + round( miterWidth * sin(theta + alpha / 2) );
2087 PATH_AddEntry(pOutsidePath, &pt, PT_LINETO);
2088 break;
2089 case PS_JOIN_BEVEL :
2090 if(alpha > 0) {
2091 pt.x = xo + round( penWidthOut * cos(theta + M_PI_2) );
2092 pt.y = yo + round( penWidthOut * sin(theta + M_PI_2) );
2093 }
2094 else {
2095 pt.x = xo - round( penWidthOut * cos(theta + M_PI_2) );
2096 pt.y = yo - round( penWidthOut * sin(theta + M_PI_2) );
2097 }
2098 PATH_AddEntry(pOutsidePath, &pt, PT_LINETO);
2099 if(alpha > 0) {
2100 pt.x = xo - round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2101 pt.y = yo - round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2102 }
2103 else {
2104 pt.x = xo + round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2105 pt.y = yo + round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2106 }
2107 PATH_AddEntry(pOutsidePath, &pt, PT_LINETO);
2108 break;
2109 case PS_JOIN_ROUND :
2110 default :
2111 if(alpha > 0) {
2112 pt.x = xo + round( penWidthOut * cos(theta + M_PI_2) );
2113 pt.y = yo + round( penWidthOut * sin(theta + M_PI_2) );
2114 }
2115 else {
2116 pt.x = xo - round( penWidthOut * cos(theta + M_PI_2) );
2117 pt.y = yo - round( penWidthOut * sin(theta + M_PI_2) );
2118 }
2119 PATH_AddEntry(pOutsidePath, &pt, PT_BEZIERTO);
2120 pt.x = xo + round( penWidthOut * cos(theta + alpha / 2) );
2121 pt.y = yo + round( penWidthOut * sin(theta + alpha / 2) );
2122 PATH_AddEntry(pOutsidePath, &pt, PT_BEZIERTO);
2123 if(alpha > 0) {
2124 pt.x = xo - round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2125 pt.y = yo - round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2126 }
2127 else {
2128 pt.x = xo + round( penWidthOut * cos(M_PI_2 + alpha + theta) );
2129 pt.y = yo + round( penWidthOut * sin(M_PI_2 + alpha + theta) );
2130 }
2131 PATH_AddEntry(pOutsidePath, &pt, PT_BEZIERTO);
2132 break;
2133 }
2134 }
2135 }
2136 for(j = 0; j < pUpPath->numEntriesUsed; j++) {
2137 POINT pt;
2138 pt.x = pUpPath->pPoints[j].x;
2139 pt.y = pUpPath->pPoints[j].y;
2140 PATH_AddEntry(pNewPath, &pt, (j == 0 ? PT_MOVETO : PT_LINETO));
2141 }
2142 for(j = 0; j < pDownPath->numEntriesUsed; j++) {
2143 POINT pt;
2144 pt.x = pDownPath->pPoints[pDownPath->numEntriesUsed - j - 1].x;
2145 pt.y = pDownPath->pPoints[pDownPath->numEntriesUsed - j - 1].y;
2146 PATH_AddEntry(pNewPath, &pt, ( (j == 0 && (pStrokes[i]->pFlags[pStrokes[i]->numEntriesUsed - 1] & PT_CLOSEFIGURE)) ? PT_MOVETO : PT_LINETO));
2147 }
2148
2149 PATH_DestroyGdiPath(pStrokes[i]);
2150 HeapFree(GetProcessHeap(), 0, pStrokes[i]);
2151 PATH_DestroyGdiPath(pUpPath);
2152 HeapFree(GetProcessHeap(), 0, pUpPath);
2153 PATH_DestroyGdiPath(pDownPath);
2154 HeapFree(GetProcessHeap(), 0, pDownPath);
2155 }
2156 HeapFree(GetProcessHeap(), 0, pStrokes);
2157
2158 pNewPath->state = PATH_Closed;
2159 if (!(ret = PATH_AssignGdiPath(pPath, pNewPath)))
2160 ERR("Assign path failed\n");
2161 PATH_DestroyGdiPath(pNewPath);
2162 HeapFree(GetProcessHeap(), 0, pNewPath);
2163 return ret;
2164 }
2165
2166
2167 /*******************************************************************
2168 * StrokeAndFillPath [GDI32.@]
2169 *
2170 *
2171 */
2172 BOOL WINAPI StrokeAndFillPath(HDC hdc)
2173 {
2174 DC *dc = get_dc_ptr( hdc );
2175 BOOL bRet = FALSE;
2176
2177 if(!dc) return FALSE;
2178
2179 if(dc->funcs->pStrokeAndFillPath)
2180 bRet = dc->funcs->pStrokeAndFillPath(dc->physDev);
2181 else
2182 {
2183 bRet = PATH_FillPath(dc, &dc->path);
2184 if(bRet) bRet = PATH_StrokePath(dc, &dc->path);
2185 if(bRet) PATH_EmptyPath(&dc->path);
2186 }
2187 release_dc_ptr( dc );
2188 return bRet;
2189 }
2190
2191
2192 /*******************************************************************
2193 * StrokePath [GDI32.@]
2194 *
2195 *
2196 */
2197 BOOL WINAPI StrokePath(HDC hdc)
2198 {
2199 DC *dc = get_dc_ptr( hdc );
2200 GdiPath *pPath;
2201 BOOL bRet = FALSE;
2202
2203 TRACE("(%p)\n", hdc);
2204 if(!dc) return FALSE;
2205
2206 if(dc->funcs->pStrokePath)
2207 bRet = dc->funcs->pStrokePath(dc->physDev);
2208 else
2209 {
2210 pPath = &dc->path;
2211 bRet = PATH_StrokePath(dc, pPath);
2212 PATH_EmptyPath(pPath);
2213 }
2214 release_dc_ptr( dc );
2215 return bRet;
2216 }
2217
2218
2219 /*******************************************************************
2220 * WidenPath [GDI32.@]
2221 *
2222 *
2223 */
2224 BOOL WINAPI WidenPath(HDC hdc)
2225 {
2226 DC *dc = get_dc_ptr( hdc );
2227 BOOL ret = FALSE;
2228
2229 if(!dc) return FALSE;
2230
2231 if(dc->funcs->pWidenPath)
2232 ret = dc->funcs->pWidenPath(dc->physDev);
2233 else
2234 ret = PATH_WidenPath(dc);
2235 release_dc_ptr( dc );
2236 return ret;
2237 }
2238
This page was automatically generated by the
LXR engine.
Visit the LXR main site for more
information.