mfplat: Read queue subscriber within the critical section.
[wine/zf.git] / dlls / gdiplus / gdiplus.c
blob7c4c68f162f54b93c90e87afc44bf525d95b05d2
1 /*
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
19 #include <stdarg.h>
20 #include <math.h>
22 #include "windef.h"
23 #include "winbase.h"
24 #include "winerror.h"
25 #include "wine/debug.h"
26 #include "wingdi.h"
28 #include "objbase.h"
30 #include "winreg.h"
31 #include "shlwapi.h"
33 #include "gdiplus.h"
34 #include "gdiplus_private.h"
36 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
38 static const REAL mm_per_inch = 25.4;
39 static const REAL point_per_inch = 72.0;
41 static Status WINAPI NotificationHook(ULONG_PTR *token)
43 TRACE("%p\n", token);
44 if(!token)
45 return InvalidParameter;
47 return Ok;
50 static void WINAPI NotificationUnhook(ULONG_PTR token)
52 TRACE("%ld\n", token);
55 /*****************************************************
56 * DllMain
58 BOOL WINAPI DllMain(HINSTANCE hinst, DWORD reason, LPVOID reserved)
60 TRACE("(%p, %d, %p)\n", hinst, reason, reserved);
62 switch(reason)
64 case DLL_PROCESS_ATTACH:
65 DisableThreadLibraryCalls( hinst );
66 init_generic_string_formats();
67 break;
69 case DLL_PROCESS_DETACH:
70 if (reserved) break;
71 free_installed_fonts();
72 free_generic_string_formats();
73 break;
75 return TRUE;
78 /*****************************************************
79 * GdiplusStartup [GDIPLUS.@]
81 Status WINAPI GdiplusStartup(ULONG_PTR *token, const struct GdiplusStartupInput *input,
82 struct GdiplusStartupOutput *output)
84 if(!token || !input)
85 return InvalidParameter;
87 TRACE("%p %p %p\n", token, input, output);
88 TRACE("GdiplusStartupInput %d %p %d %d\n", input->GdiplusVersion,
89 input->DebugEventCallback, input->SuppressBackgroundThread,
90 input->SuppressExternalCodecs);
92 if(input->GdiplusVersion < 1 || input->GdiplusVersion > 2)
93 return UnsupportedGdiplusVersion;
95 if(input->SuppressBackgroundThread){
96 if(!output)
97 return InvalidParameter;
99 output->NotificationHook = NotificationHook;
100 output->NotificationUnhook = NotificationUnhook;
103 *token = 0xdeadbeef;
105 /* FIXME: DebugEventCallback ignored */
107 return Ok;
110 GpStatus WINAPI GdiplusNotificationHook(ULONG_PTR *token)
112 FIXME("%p\n", token);
113 return NotificationHook(token);
116 void WINAPI GdiplusNotificationUnhook(ULONG_PTR token)
118 FIXME("%ld\n", token);
119 NotificationUnhook(token);
122 /*****************************************************
123 * GdiplusShutdown [GDIPLUS.@]
125 ULONG WINAPI GdiplusShutdown_wrapper(ULONG_PTR token)
127 /* Notice the slightly different prototype from the official
128 * signature which forces us to use the _wrapper suffix.
131 /* FIXME: no object tracking */
133 /* "bricksntiles" expects a return value of 0, which native
134 * coincidentally gives.
136 return 0;
139 /*****************************************************
140 * GdipAlloc [GDIPLUS.@]
142 void* WINGDIPAPI GdipAlloc(SIZE_T size)
144 return HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, size);
147 /*****************************************************
148 * GdipFree [GDIPLUS.@]
150 void WINGDIPAPI GdipFree(void* ptr)
152 HeapFree(GetProcessHeap(), 0, ptr);
155 /* Calculates the bezier points needed to fill in the arc portion starting at
156 * angle start and ending at end. These two angles should be no more than 90
157 * degrees from each other. x1, y1, x2, y2 describes the bounding box (upper
158 * left and width and height). Angles must be in radians. write_first indicates
159 * that the first bezier point should be written out (usually this is false).
160 * pt is the array of GpPointFs that gets written to.
162 static void add_arc_part(GpPointF * pt, REAL x1, REAL y1, REAL x2, REAL y2,
163 REAL start, REAL end, BOOL write_first)
165 REAL center_x, center_y, rad_x, rad_y, cos_start, cos_end,
166 sin_start, sin_end, a, half;
167 INT i;
169 rad_x = x2 / 2.0;
170 rad_y = y2 / 2.0;
171 center_x = x1 + rad_x;
172 center_y = y1 + rad_y;
174 cos_start = cos(start);
175 cos_end = cos(end);
176 sin_start = sin(start);
177 sin_end = sin(end);
179 half = (end - start) / 2.0;
180 a = 4.0 / 3.0 * (1 - cos(half)) / sin(half);
182 if(write_first){
183 pt[0].X = cos_start;
184 pt[0].Y = sin_start;
186 pt[1].X = cos_start - a * sin_start;
187 pt[1].Y = sin_start + a * cos_start;
189 pt[3].X = cos_end;
190 pt[3].Y = sin_end;
191 pt[2].X = cos_end + a * sin_end;
192 pt[2].Y = sin_end - a * cos_end;
194 /* expand the points back from the unit circle to the ellipse */
195 for(i = (write_first ? 0 : 1); i < 4; i ++){
196 pt[i].X = pt[i].X * rad_x + center_x;
197 pt[i].Y = pt[i].Y * rad_y + center_y;
201 /* We plot the curve as if it is on a circle then stretch the points. This
202 * adjusts the angles so that when we stretch the points they will end in the
203 * right place. This is only complicated because atan and atan2 do not behave
204 * conveniently. */
205 static REAL unstretch_angle(REAL angle, REAL dia_x, REAL dia_y)
207 REAL stretched;
208 INT revs_off;
210 if(fabs(cos(angle)) < 0.00001 || fabs(sin(angle)) < 0.00001)
211 return angle;
213 stretched = gdiplus_atan2(sin(angle) / fabs(dia_y), cos(angle) / fabs(dia_x));
214 revs_off = gdip_round(angle / (2.0 * M_PI)) - gdip_round(stretched / (2.0 * M_PI));
215 stretched += ((REAL)revs_off) * M_PI * 2.0;
216 return stretched;
219 /* Stores the bezier points that correspond to the arc in points. If points is
220 * null, just return the number of points needed to represent the arc. */
221 INT arc2polybezier(GpPointF * points, REAL left, REAL top, REAL width, REAL height,
222 REAL start_angle, REAL sweep_angle)
224 INT i;
225 REAL partial_end_angle, end_angle;
227 end_angle = deg2rad(start_angle + sweep_angle);
228 start_angle = deg2rad(start_angle);
230 if (width != height)
232 start_angle = unstretch_angle(start_angle, width, height);
233 end_angle = unstretch_angle(end_angle, width, height);
236 for(i = 0; i < MAX_ARC_PTS - 1; i += 3){
237 /* check if we've overshot the end angle */
238 if( sweep_angle > 0.0 )
240 if (start_angle >= end_angle) break;
241 partial_end_angle = min(start_angle + M_PI_2, end_angle);
243 else
245 if (start_angle <= end_angle) break;
246 partial_end_angle = max(start_angle - M_PI_2, end_angle);
249 if (points)
250 add_arc_part(&points[i], left, top, width, height, start_angle, partial_end_angle, i == 0);
252 start_angle = partial_end_angle;
255 if (i == 0) return 0;
256 else return i+1;
259 COLORREF ARGB2COLORREF(ARGB color)
262 Packing of these color structures:
263 COLORREF: 00bbggrr
264 ARGB: aarrggbb
265 FIXME:doesn't handle alpha channel
267 return ((color & 0x0000ff) << 16) +
268 (color & 0x00ff00) +
269 ((color & 0xff0000) >> 16);
272 HBITMAP ARGB2BMP(ARGB color)
274 BITMAPINFO bi;
275 HBITMAP result;
276 RGBQUAD *bits;
277 int alpha;
279 if ((color & 0xff000000) == 0xff000000) return 0;
281 bi.bmiHeader.biSize = sizeof(bi.bmiHeader);
282 bi.bmiHeader.biWidth = 1;
283 bi.bmiHeader.biHeight = 1;
284 bi.bmiHeader.biPlanes = 1;
285 bi.bmiHeader.biBitCount = 32;
286 bi.bmiHeader.biCompression = BI_RGB;
287 bi.bmiHeader.biSizeImage = 0;
288 bi.bmiHeader.biXPelsPerMeter = 0;
289 bi.bmiHeader.biYPelsPerMeter = 0;
290 bi.bmiHeader.biClrUsed = 0;
291 bi.bmiHeader.biClrImportant = 0;
293 result = CreateDIBSection(0, &bi, DIB_RGB_COLORS, (void*)&bits, NULL, 0);
295 bits[0].rgbReserved = alpha = (color>>24)&0xff;
296 bits[0].rgbRed = ((color>>16)&0xff)*alpha/255;
297 bits[0].rgbGreen = ((color>>8)&0xff)*alpha/255;
298 bits[0].rgbBlue = (color&0xff)*alpha/255;
300 return result;
303 /* Like atan2, but puts angle in correct quadrant if dx is 0. */
304 REAL gdiplus_atan2(REAL dy, REAL dx)
306 if((dx == 0.0) && (dy != 0.0))
307 return dy > 0.0 ? M_PI_2 : -M_PI_2;
309 return atan2(dy, dx);
312 GpStatus hresult_to_status(HRESULT res)
314 switch(res){
315 case S_OK:
316 return Ok;
317 case E_OUTOFMEMORY:
318 return OutOfMemory;
319 case E_INVALIDARG:
320 return InvalidParameter;
321 default:
322 return GenericError;
326 /* converts a given unit to its value in pixels */
327 REAL units_to_pixels(REAL units, GpUnit unit, REAL dpi, BOOL printer_display)
329 switch (unit)
331 case UnitPixel:
332 case UnitWorld:
333 return units;
334 case UnitDisplay:
335 if (printer_display)
336 return units * dpi / 100.0;
337 else
338 return units;
339 case UnitPoint:
340 return units * dpi / point_per_inch;
341 case UnitInch:
342 return units * dpi;
343 case UnitDocument:
344 return units * dpi / 300.0; /* Per MSDN */
345 case UnitMillimeter:
346 return units * dpi / mm_per_inch;
347 default:
348 FIXME("Unhandled unit type: %d\n", unit);
349 return 0;
353 /* converts value in pixels to a given unit */
354 REAL pixels_to_units(REAL pixels, GpUnit unit, REAL dpi, BOOL printer_display)
356 switch (unit)
358 case UnitPixel:
359 case UnitWorld:
360 return pixels;
361 case UnitDisplay:
362 if (printer_display)
363 return pixels * 100.0 / dpi;
364 else
365 return pixels;
366 case UnitPoint:
367 return pixels * point_per_inch / dpi;
368 case UnitInch:
369 return pixels / dpi;
370 case UnitDocument:
371 return pixels * 300.0 / dpi;
372 case UnitMillimeter:
373 return pixels * mm_per_inch / dpi;
374 default:
375 FIXME("Unhandled unit type: %d\n", unit);
376 return 0;
380 REAL units_scale(GpUnit from, GpUnit to, REAL dpi, BOOL printer_display)
382 REAL pixels = units_to_pixels(1.0, from, dpi, printer_display);
383 return pixels_to_units(pixels, to, dpi, printer_display);
386 /* Calculates Bezier points from cardinal spline points. */
387 void calc_curve_bezier(const GpPointF *pts, REAL tension, REAL *x1,
388 REAL *y1, REAL *x2, REAL *y2)
390 REAL xdiff, ydiff;
392 /* calculate tangent */
393 xdiff = pts[2].X - pts[0].X;
394 ydiff = pts[2].Y - pts[0].Y;
396 /* apply tangent to get control points */
397 *x1 = pts[1].X - tension * xdiff;
398 *y1 = pts[1].Y - tension * ydiff;
399 *x2 = pts[1].X + tension * xdiff;
400 *y2 = pts[1].Y + tension * ydiff;
403 /* Calculates Bezier points from cardinal spline endpoints. */
404 void calc_curve_bezier_endp(REAL xend, REAL yend, REAL xadj, REAL yadj,
405 REAL tension, REAL *x, REAL *y)
407 /* tangent at endpoints is the line from the endpoint to the adjacent point */
408 *x = gdip_round(tension * (xadj - xend) + xend);
409 *y = gdip_round(tension * (yadj - yend) + yend);
412 /* make sure path has enough space for len more points */
413 BOOL lengthen_path(GpPath *path, INT len)
415 /* initial allocation */
416 if(path->datalen == 0){
417 path->datalen = len * 2;
419 path->pathdata.Points = heap_alloc_zero(path->datalen * sizeof(PointF));
420 if(!path->pathdata.Points) return FALSE;
422 path->pathdata.Types = heap_alloc_zero(path->datalen);
423 if(!path->pathdata.Types){
424 heap_free(path->pathdata.Points);
425 return FALSE;
428 /* reallocation, double size of arrays */
429 else if(path->datalen - path->pathdata.Count < len){
430 while(path->datalen - path->pathdata.Count < len)
431 path->datalen *= 2;
433 path->pathdata.Points = heap_realloc(path->pathdata.Points, path->datalen * sizeof(PointF));
434 if(!path->pathdata.Points) return FALSE;
436 path->pathdata.Types = heap_realloc(path->pathdata.Types, path->datalen);
437 if(!path->pathdata.Types) return FALSE;
440 return TRUE;
443 void convert_32bppARGB_to_32bppPARGB(UINT width, UINT height,
444 BYTE *dst_bits, INT dst_stride, const BYTE *src_bits, INT src_stride)
446 INT x, y;
447 for (y=0; y<height; y++)
449 const BYTE *src=src_bits+y*src_stride;
450 BYTE *dst=dst_bits+y*dst_stride;
451 for (x=0; x<width; x++)
453 BYTE alpha=src[3];
454 *dst++ = (*src++ * alpha + 127) / 255;
455 *dst++ = (*src++ * alpha + 127) / 255;
456 *dst++ = (*src++ * alpha + 127) / 255;
457 *dst++ = *src++;
462 /* recursive deletion of GpRegion nodes */
463 void delete_element(region_element* element)
465 switch(element->type)
467 case RegionDataRect:
468 break;
469 case RegionDataPath:
470 GdipDeletePath(element->elementdata.path);
471 break;
472 case RegionDataEmptyRect:
473 case RegionDataInfiniteRect:
474 break;
475 default:
476 delete_element(element->elementdata.combine.left);
477 delete_element(element->elementdata.combine.right);
478 heap_free(element->elementdata.combine.left);
479 heap_free(element->elementdata.combine.right);
480 break;
484 const char *debugstr_rectf(const RectF* rc)
486 if (!rc) return "(null)";
487 return wine_dbg_sprintf("(%0.2f,%0.2f,%0.2f,%0.2f)", rc->X, rc->Y, rc->Width, rc->Height);
490 const char *debugstr_pointf(const PointF* pt)
492 if (!pt) return "(null)";
493 return wine_dbg_sprintf("(%0.2f,%0.2f)", pt->X, pt->Y);