2 * Copyright (C) 2007 Google (Evan Stade)
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
25 #include "wine/debug.h"
34 #include "gdiplus_private.h"
36 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
38 static Status WINAPI NotificationHook(ULONG_PTR *token)
42 return InvalidParameter;
47 static void WINAPI NotificationUnhook(ULONG_PTR token)
49 TRACE("%ld\n", token);
52 /*****************************************************
55 BOOL WINAPI DllMain(HINSTANCE hinst, DWORD reason, LPVOID reserved)
57 TRACE("(%p, %d, %p)\n", hinst, reason, reserved);
61 case DLL_WINE_PREATTACH:
62 return FALSE; /* prefer native version */
64 case DLL_PROCESS_ATTACH:
65 DisableThreadLibraryCalls( hinst );
68 case DLL_PROCESS_DETACH:
69 free_installed_fonts();
75 /*****************************************************
76 * GdiplusStartup [GDIPLUS.@]
78 Status WINAPI GdiplusStartup(ULONG_PTR *token, const struct GdiplusStartupInput *input,
79 struct GdiplusStartupOutput *output)
82 return InvalidParameter;
84 TRACE("%p %p %p\n", token, input, output);
85 TRACE("GdiplusStartupInput %d %p %d %d\n", input->GdiplusVersion,
86 input->DebugEventCallback, input->SuppressBackgroundThread,
87 input->SuppressExternalCodecs);
89 if(input->GdiplusVersion != 1)
90 return UnsupportedGdiplusVersion;
92 if(input->SuppressBackgroundThread){
94 return InvalidParameter;
96 output->NotificationHook = NotificationHook;
97 output->NotificationUnhook = NotificationUnhook;
102 /* FIXME: DebugEventCallback ignored */
107 GpStatus WINAPI GdiplusNotificationHook(ULONG_PTR *token)
109 FIXME("%p\n", token);
110 return NotificationHook(token);
113 void WINAPI GdiplusNotificationUnhook(ULONG_PTR token)
115 FIXME("%ld\n", token);
116 NotificationUnhook(token);
119 /*****************************************************
120 * GdiplusShutdown [GDIPLUS.@]
122 void WINAPI GdiplusShutdown(ULONG_PTR token)
124 /* FIXME: no object tracking */
127 /*****************************************************
128 * GdipAlloc [GDIPLUS.@]
130 void* WINGDIPAPI GdipAlloc(SIZE_T size)
132 return HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, size);
135 /*****************************************************
136 * GdipFree [GDIPLUS.@]
138 void WINGDIPAPI GdipFree(void* ptr)
140 HeapFree(GetProcessHeap(), 0, ptr);
143 /* Calculates the bezier points needed to fill in the arc portion starting at
144 * angle start and ending at end. These two angles should be no more than 90
145 * degrees from each other. x1, y1, x2, y2 describes the bounding box (upper
146 * left and width and height). Angles must be in radians. write_first indicates
147 * that the first bezier point should be written out (usually this is false).
148 * pt is the array of GpPointFs that gets written to.
150 static void add_arc_part(GpPointF * pt, REAL x1, REAL y1, REAL x2, REAL y2,
151 REAL start, REAL end, BOOL write_first)
153 REAL center_x, center_y, rad_x, rad_y, cos_start, cos_end,
154 sin_start, sin_end, a, half;
159 center_x = x1 + rad_x;
160 center_y = y1 + rad_y;
162 cos_start = cos(start);
164 sin_start = sin(start);
167 half = (end - start) / 2.0;
168 a = 4.0 / 3.0 * (1 - cos(half)) / sin(half);
174 pt[1].X = cos_start - a * sin_start;
175 pt[1].Y = sin_start + a * cos_start;
179 pt[2].X = cos_end + a * sin_end;
180 pt[2].Y = sin_end - a * cos_end;
182 /* expand the points back from the unit circle to the ellipse */
183 for(i = (write_first ? 0 : 1); i < 4; i ++){
184 pt[i].X = pt[i].X * rad_x + center_x;
185 pt[i].Y = pt[i].Y * rad_y + center_y;
189 /* We plot the curve as if it is on a circle then stretch the points. This
190 * adjusts the angles so that when we stretch the points they will end in the
191 * right place. This is only complicated because atan and atan2 do not behave
193 static void unstretch_angle(REAL * angle, REAL rad_x, REAL rad_y)
198 *angle = deg2rad(*angle);
200 if(fabs(cos(*angle)) < 0.00001 || fabs(sin(*angle)) < 0.00001)
203 stretched = gdiplus_atan2(sin(*angle) / fabs(rad_y), cos(*angle) / fabs(rad_x));
204 revs_off = roundr(*angle / (2.0 * M_PI)) - roundr(stretched / (2.0 * M_PI));
205 stretched += ((REAL)revs_off) * M_PI * 2.0;
209 /* Stores the bezier points that correspond to the arc in points. If points is
210 * null, just return the number of points needed to represent the arc. */
211 INT arc2polybezier(GpPointF * points, REAL x1, REAL y1, REAL x2, REAL y2,
212 REAL startAngle, REAL sweepAngle)
215 REAL end_angle, start_angle, endAngle;
217 endAngle = startAngle + sweepAngle;
218 unstretch_angle(&startAngle, x2 / 2.0, y2 / 2.0);
219 unstretch_angle(&endAngle, x2 / 2.0, y2 / 2.0);
221 count = ceilf(fabs(endAngle - startAngle) / M_PI_2) * 3 + 1;
222 /* don't make more than a full circle */
223 count = min(MAX_ARC_PTS, count);
230 /* start_angle and end_angle are the iterative variables */
231 start_angle = startAngle;
233 for(i = 0; i < count - 1; i += 3){
234 /* check if we've overshot the end angle */
235 if( sweepAngle > 0.0 )
236 end_angle = min(start_angle + M_PI_2, endAngle);
238 end_angle = max(start_angle - M_PI_2, endAngle);
240 add_arc_part(&points[i], x1, y1, x2, y2, start_angle, end_angle, i == 0);
242 start_angle += M_PI_2 * (sweepAngle < 0.0 ? -1.0 : 1.0);
248 COLORREF ARGB2COLORREF(ARGB color)
251 Packing of these color structures:
254 FIXME:doesn't handle alpha channel
256 return ((color & 0x0000ff) << 16) +
258 ((color & 0xff0000) >> 16);
261 HBITMAP ARGB2BMP(ARGB color)
269 if ((color & 0xff000000) == 0xff000000) return 0;
271 hdc = CreateCompatibleDC(NULL);
273 bi.bmiHeader.biSize = sizeof(bi.bmiHeader);
274 bi.bmiHeader.biWidth = 1;
275 bi.bmiHeader.biHeight = 1;
276 bi.bmiHeader.biPlanes = 1;
277 bi.bmiHeader.biBitCount = 32;
278 bi.bmiHeader.biCompression = BI_RGB;
279 bi.bmiHeader.biSizeImage = 0;
280 bi.bmiHeader.biXPelsPerMeter = 0;
281 bi.bmiHeader.biYPelsPerMeter = 0;
282 bi.bmiHeader.biClrUsed = 0;
283 bi.bmiHeader.biClrImportant = 0;
285 result = CreateDIBSection(hdc, &bi, DIB_RGB_COLORS, (void*)&bits, NULL, 0);
287 bits[0].rgbReserved = alpha = (color>>24)&0xff;
288 bits[0].rgbRed = ((color>>16)&0xff)*alpha/255;
289 bits[0].rgbGreen = ((color>>8)&0xff)*alpha/255;
290 bits[0].rgbBlue = (color&0xff)*alpha/255;
297 /* Like atan2, but puts angle in correct quadrant if dx is 0. */
298 REAL gdiplus_atan2(REAL dy, REAL dx)
300 if((dx == 0.0) && (dy != 0.0))
301 return dy > 0.0 ? M_PI_2 : -M_PI_2;
303 return atan2(dy, dx);
306 GpStatus hresult_to_status(HRESULT res)
314 return InvalidParameter;
320 /* converts a given unit to its value in pixels */
321 REAL convert_unit(HDC hdc, GpUnit unit)
326 return (REAL) GetDeviceCaps(hdc, LOGPIXELSX);
328 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 72.0;
330 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 300.0;
332 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 25.4;
334 ERR("cannot convert UnitWorld\n");
343 /* Calculates Bezier points from cardinal spline points. */
344 void calc_curve_bezier(CONST GpPointF *pts, REAL tension, REAL *x1,
345 REAL *y1, REAL *x2, REAL *y2)
349 /* calculate tangent */
350 xdiff = pts[2].X - pts[0].X;
351 ydiff = pts[2].Y - pts[0].Y;
353 /* apply tangent to get control points */
354 *x1 = pts[1].X - tension * xdiff;
355 *y1 = pts[1].Y - tension * ydiff;
356 *x2 = pts[1].X + tension * xdiff;
357 *y2 = pts[1].Y + tension * ydiff;
360 /* Calculates Bezier points from cardinal spline endpoints. */
361 void calc_curve_bezier_endp(REAL xend, REAL yend, REAL xadj, REAL yadj,
362 REAL tension, REAL *x, REAL *y)
364 /* tangent at endpoints is the line from the endpoint to the adjacent point */
365 *x = roundr(tension * (xadj - xend) + xend);
366 *y = roundr(tension * (yadj - yend) + yend);
369 /* make sure path has enough space for len more points */
370 BOOL lengthen_path(GpPath *path, INT len)
372 /* initial allocation */
373 if(path->datalen == 0){
374 path->datalen = len * 2;
376 path->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
377 if(!path->pathdata.Points) return FALSE;
379 path->pathdata.Types = GdipAlloc(path->datalen);
380 if(!path->pathdata.Types){
381 GdipFree(path->pathdata.Points);
385 /* reallocation, double size of arrays */
386 else if(path->datalen - path->pathdata.Count < len){
387 while(path->datalen - path->pathdata.Count < len)
390 path->pathdata.Points = HeapReAlloc(GetProcessHeap(), 0,
391 path->pathdata.Points, path->datalen * sizeof(PointF));
392 if(!path->pathdata.Points) return FALSE;
394 path->pathdata.Types = HeapReAlloc(GetProcessHeap(), 0,
395 path->pathdata.Types, path->datalen);
396 if(!path->pathdata.Types) return FALSE;
402 void convert_32bppARGB_to_32bppPARGB(UINT width, UINT height,
403 BYTE *dst_bits, INT dst_stride, const BYTE *src_bits, INT src_stride)
406 for (y=0; y<height; y++)
408 const BYTE *src=src_bits+y*src_stride;
409 BYTE *dst=dst_bits+y*dst_stride;
410 for (x=0; x<width; x++)
413 *dst++ = *src++ * alpha / 255;
414 *dst++ = *src++ * alpha / 255;
415 *dst++ = *src++ * alpha / 255;
421 /* recursive deletion of GpRegion nodes */
422 inline void delete_element(region_element* element)
424 switch(element->type)
429 GdipDeletePath(element->elementdata.pathdata.path);
431 case RegionDataEmptyRect:
432 case RegionDataInfiniteRect:
435 delete_element(element->elementdata.combine.left);
436 delete_element(element->elementdata.combine.right);
437 GdipFree(element->elementdata.combine.left);
438 GdipFree(element->elementdata.combine.right);
443 const char *debugstr_rectf(CONST RectF* rc)
445 if (!rc) return "(null)";
446 return wine_dbg_sprintf("(%0.2f,%0.2f,%0.2f,%0.2f)", rc->X, rc->Y, rc->Width, rc->Height);