ntdll: Fix race in NtRead/WriteFile.
[wine/testsucceed.git] / dlls / gdiplus / gdiplus.c
blob383f53621fba8ca2a201c361aa3d8b0cb27758ec
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 Status WINAPI NotificationHook(ULONG_PTR *token)
40 TRACE("%p\n", token);
41 if(!token)
42 return InvalidParameter;
44 return Ok;
47 static void WINAPI NotificationUnhook(ULONG_PTR token)
49 TRACE("%ld\n", token);
52 /*****************************************************
53 * DllMain
55 BOOL WINAPI DllMain(HINSTANCE hinst, DWORD reason, LPVOID reserved)
57 TRACE("(%p, %d, %p)\n", hinst, reason, reserved);
59 switch(reason)
61 case DLL_PROCESS_ATTACH:
62 DisableThreadLibraryCalls( hinst );
63 break;
65 case DLL_PROCESS_DETACH:
66 free_installed_fonts();
67 break;
69 return TRUE;
72 /*****************************************************
73 * GdiplusStartup [GDIPLUS.@]
75 Status WINAPI GdiplusStartup(ULONG_PTR *token, const struct GdiplusStartupInput *input,
76 struct GdiplusStartupOutput *output)
78 if(!token || !input)
79 return InvalidParameter;
81 TRACE("%p %p %p\n", token, input, output);
82 TRACE("GdiplusStartupInput %d %p %d %d\n", input->GdiplusVersion,
83 input->DebugEventCallback, input->SuppressBackgroundThread,
84 input->SuppressExternalCodecs);
86 if(input->GdiplusVersion < 1 || input->GdiplusVersion > 2)
87 return UnsupportedGdiplusVersion;
89 if(input->SuppressBackgroundThread){
90 if(!output)
91 return InvalidParameter;
93 output->NotificationHook = NotificationHook;
94 output->NotificationUnhook = NotificationUnhook;
97 *token = 0xdeadbeef;
99 /* FIXME: DebugEventCallback ignored */
101 return Ok;
104 GpStatus WINAPI GdiplusNotificationHook(ULONG_PTR *token)
106 FIXME("%p\n", token);
107 return NotificationHook(token);
110 void WINAPI GdiplusNotificationUnhook(ULONG_PTR token)
112 FIXME("%ld\n", token);
113 NotificationUnhook(token);
116 /*****************************************************
117 * GdiplusShutdown [GDIPLUS.@]
119 void WINAPI GdiplusShutdown(ULONG_PTR token)
121 /* FIXME: no object tracking */
124 /*****************************************************
125 * GdipAlloc [GDIPLUS.@]
127 void* WINGDIPAPI GdipAlloc(SIZE_T size)
129 return HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, size);
132 /*****************************************************
133 * GdipFree [GDIPLUS.@]
135 void WINGDIPAPI GdipFree(void* ptr)
137 HeapFree(GetProcessHeap(), 0, ptr);
140 /* Calculates the bezier points needed to fill in the arc portion starting at
141 * angle start and ending at end. These two angles should be no more than 90
142 * degrees from each other. x1, y1, x2, y2 describes the bounding box (upper
143 * left and width and height). Angles must be in radians. write_first indicates
144 * that the first bezier point should be written out (usually this is false).
145 * pt is the array of GpPointFs that gets written to.
147 static void add_arc_part(GpPointF * pt, REAL x1, REAL y1, REAL x2, REAL y2,
148 REAL start, REAL end, BOOL write_first)
150 REAL center_x, center_y, rad_x, rad_y, cos_start, cos_end,
151 sin_start, sin_end, a, half;
152 INT i;
154 rad_x = x2 / 2.0;
155 rad_y = y2 / 2.0;
156 center_x = x1 + rad_x;
157 center_y = y1 + rad_y;
159 cos_start = cos(start);
160 cos_end = cos(end);
161 sin_start = sin(start);
162 sin_end = sin(end);
164 half = (end - start) / 2.0;
165 a = 4.0 / 3.0 * (1 - cos(half)) / sin(half);
167 if(write_first){
168 pt[0].X = cos_start;
169 pt[0].Y = sin_start;
171 pt[1].X = cos_start - a * sin_start;
172 pt[1].Y = sin_start + a * cos_start;
174 pt[3].X = cos_end;
175 pt[3].Y = sin_end;
176 pt[2].X = cos_end + a * sin_end;
177 pt[2].Y = sin_end - a * cos_end;
179 /* expand the points back from the unit circle to the ellipse */
180 for(i = (write_first ? 0 : 1); i < 4; i ++){
181 pt[i].X = pt[i].X * rad_x + center_x;
182 pt[i].Y = pt[i].Y * rad_y + center_y;
186 /* We plot the curve as if it is on a circle then stretch the points. This
187 * adjusts the angles so that when we stretch the points they will end in the
188 * right place. This is only complicated because atan and atan2 do not behave
189 * conveniently. */
190 static void unstretch_angle(REAL * angle, REAL rad_x, REAL rad_y)
192 REAL stretched;
193 INT revs_off;
195 *angle = deg2rad(*angle);
197 if(fabs(cos(*angle)) < 0.00001 || fabs(sin(*angle)) < 0.00001)
198 return;
200 stretched = gdiplus_atan2(sin(*angle) / fabs(rad_y), cos(*angle) / fabs(rad_x));
201 revs_off = roundr(*angle / (2.0 * M_PI)) - roundr(stretched / (2.0 * M_PI));
202 stretched += ((REAL)revs_off) * M_PI * 2.0;
203 *angle = stretched;
206 /* Stores the bezier points that correspond to the arc in points. If points is
207 * null, just return the number of points needed to represent the arc. */
208 INT arc2polybezier(GpPointF * points, REAL x1, REAL y1, REAL x2, REAL y2,
209 REAL startAngle, REAL sweepAngle)
211 INT i;
212 REAL end_angle, start_angle, endAngle;
214 endAngle = startAngle + sweepAngle;
215 unstretch_angle(&startAngle, x2 / 2.0, y2 / 2.0);
216 unstretch_angle(&endAngle, x2 / 2.0, y2 / 2.0);
218 /* start_angle and end_angle are the iterative variables */
219 start_angle = startAngle;
221 for(i = 0; i < MAX_ARC_PTS - 1; i += 3){
222 /* check if we've overshot the end angle */
223 if( sweepAngle > 0.0 )
225 if (start_angle >= endAngle) break;
226 end_angle = min(start_angle + M_PI_2, endAngle);
228 else
230 if (start_angle <= endAngle) break;
231 end_angle = max(start_angle - M_PI_2, endAngle);
234 if (points)
235 add_arc_part(&points[i], x1, y1, x2, y2, start_angle, end_angle, i == 0);
237 start_angle += M_PI_2 * (sweepAngle < 0.0 ? -1.0 : 1.0);
240 if (i == 0) return 0;
241 else return i+1;
244 COLORREF ARGB2COLORREF(ARGB color)
247 Packing of these color structures:
248 COLORREF: 00bbggrr
249 ARGB: aarrggbb
250 FIXME:doesn't handle alpha channel
252 return ((color & 0x0000ff) << 16) +
253 (color & 0x00ff00) +
254 ((color & 0xff0000) >> 16);
257 HBITMAP ARGB2BMP(ARGB color)
259 HDC hdc;
260 BITMAPINFO bi;
261 HBITMAP result;
262 RGBQUAD *bits;
263 int alpha;
265 if ((color & 0xff000000) == 0xff000000) return 0;
267 hdc = CreateCompatibleDC(NULL);
269 bi.bmiHeader.biSize = sizeof(bi.bmiHeader);
270 bi.bmiHeader.biWidth = 1;
271 bi.bmiHeader.biHeight = 1;
272 bi.bmiHeader.biPlanes = 1;
273 bi.bmiHeader.biBitCount = 32;
274 bi.bmiHeader.biCompression = BI_RGB;
275 bi.bmiHeader.biSizeImage = 0;
276 bi.bmiHeader.biXPelsPerMeter = 0;
277 bi.bmiHeader.biYPelsPerMeter = 0;
278 bi.bmiHeader.biClrUsed = 0;
279 bi.bmiHeader.biClrImportant = 0;
281 result = CreateDIBSection(hdc, &bi, DIB_RGB_COLORS, (void*)&bits, NULL, 0);
283 bits[0].rgbReserved = alpha = (color>>24)&0xff;
284 bits[0].rgbRed = ((color>>16)&0xff)*alpha/255;
285 bits[0].rgbGreen = ((color>>8)&0xff)*alpha/255;
286 bits[0].rgbBlue = (color&0xff)*alpha/255;
288 DeleteDC(hdc);
290 return result;
293 /* Like atan2, but puts angle in correct quadrant if dx is 0. */
294 REAL gdiplus_atan2(REAL dy, REAL dx)
296 if((dx == 0.0) && (dy != 0.0))
297 return dy > 0.0 ? M_PI_2 : -M_PI_2;
299 return atan2(dy, dx);
302 GpStatus hresult_to_status(HRESULT res)
304 switch(res){
305 case S_OK:
306 return Ok;
307 case E_OUTOFMEMORY:
308 return OutOfMemory;
309 case E_INVALIDARG:
310 return InvalidParameter;
311 default:
312 return GenericError;
316 /* converts a given unit to its value in pixels */
317 REAL convert_unit(HDC hdc, GpUnit unit)
319 switch(unit)
321 case UnitInch:
322 return (REAL) GetDeviceCaps(hdc, LOGPIXELSX);
323 case UnitPoint:
324 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 72.0;
325 case UnitDocument:
326 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 300.0;
327 case UnitMillimeter:
328 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 25.4;
329 case UnitWorld:
330 ERR("cannot convert UnitWorld\n");
331 return 0.0;
332 case UnitPixel:
333 case UnitDisplay:
334 default:
335 return 1.0;
339 /* Calculates Bezier points from cardinal spline points. */
340 void calc_curve_bezier(CONST GpPointF *pts, REAL tension, REAL *x1,
341 REAL *y1, REAL *x2, REAL *y2)
343 REAL xdiff, ydiff;
345 /* calculate tangent */
346 xdiff = pts[2].X - pts[0].X;
347 ydiff = pts[2].Y - pts[0].Y;
349 /* apply tangent to get control points */
350 *x1 = pts[1].X - tension * xdiff;
351 *y1 = pts[1].Y - tension * ydiff;
352 *x2 = pts[1].X + tension * xdiff;
353 *y2 = pts[1].Y + tension * ydiff;
356 /* Calculates Bezier points from cardinal spline endpoints. */
357 void calc_curve_bezier_endp(REAL xend, REAL yend, REAL xadj, REAL yadj,
358 REAL tension, REAL *x, REAL *y)
360 /* tangent at endpoints is the line from the endpoint to the adjacent point */
361 *x = roundr(tension * (xadj - xend) + xend);
362 *y = roundr(tension * (yadj - yend) + yend);
365 /* make sure path has enough space for len more points */
366 BOOL lengthen_path(GpPath *path, INT len)
368 /* initial allocation */
369 if(path->datalen == 0){
370 path->datalen = len * 2;
372 path->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
373 if(!path->pathdata.Points) return FALSE;
375 path->pathdata.Types = GdipAlloc(path->datalen);
376 if(!path->pathdata.Types){
377 GdipFree(path->pathdata.Points);
378 return FALSE;
381 /* reallocation, double size of arrays */
382 else if(path->datalen - path->pathdata.Count < len){
383 while(path->datalen - path->pathdata.Count < len)
384 path->datalen *= 2;
386 path->pathdata.Points = HeapReAlloc(GetProcessHeap(), 0,
387 path->pathdata.Points, path->datalen * sizeof(PointF));
388 if(!path->pathdata.Points) return FALSE;
390 path->pathdata.Types = HeapReAlloc(GetProcessHeap(), 0,
391 path->pathdata.Types, path->datalen);
392 if(!path->pathdata.Types) return FALSE;
395 return TRUE;
398 void convert_32bppARGB_to_32bppPARGB(UINT width, UINT height,
399 BYTE *dst_bits, INT dst_stride, const BYTE *src_bits, INT src_stride)
401 UINT x, y;
402 for (y=0; y<height; y++)
404 const BYTE *src=src_bits+y*src_stride;
405 BYTE *dst=dst_bits+y*dst_stride;
406 for (x=0; x<width; x++)
408 BYTE alpha=src[3];
409 *dst++ = *src++ * alpha / 255;
410 *dst++ = *src++ * alpha / 255;
411 *dst++ = *src++ * alpha / 255;
412 *dst++ = *src++;
417 /* recursive deletion of GpRegion nodes */
418 void delete_element(region_element* element)
420 switch(element->type)
422 case RegionDataRect:
423 break;
424 case RegionDataPath:
425 GdipDeletePath(element->elementdata.pathdata.path);
426 break;
427 case RegionDataEmptyRect:
428 case RegionDataInfiniteRect:
429 break;
430 default:
431 delete_element(element->elementdata.combine.left);
432 delete_element(element->elementdata.combine.right);
433 GdipFree(element->elementdata.combine.left);
434 GdipFree(element->elementdata.combine.right);
435 break;
439 const char *debugstr_rectf(CONST RectF* rc)
441 if (!rc) return "(null)";
442 return wine_dbg_sprintf("(%0.2f,%0.2f,%0.2f,%0.2f)", rc->X, rc->Y, rc->Width, rc->Height);
445 const char *debugstr_pointf(CONST PointF* pt)
447 if (!pt) return "(null)";
448 return wine_dbg_sprintf("(%0.2f,%0.2f)", pt->X, pt->Y);