1 /*
2 * Copyright (C) 2007 Google (Evan Stade)
3 *
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.
8 *
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.
13 *
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
17 */
18
19 #include <stdarg.h>
20 #include <math.h>
21
22 #include "windef.h"
23 #include "winbase.h"
24 #include "winerror.h"
25 #include "wine/debug.h"
26 #include "wingdi.h"
27
28 #include "objbase.h"
29
30 #include "winreg.h"
31 #include "shlwapi.h"
32
33 #include "gdiplus.h"
34 #include "gdiplus_private.h"
35
36 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
37
38 static Status WINAPI NotificationHook(ULONG_PTR *token)
39 {
40 TRACE("%p\n", token);
41 if(!token)
42 return InvalidParameter;
43
44 return Ok;
45 }
46
47 static void WINAPI NotificationUnhook(ULONG_PTR token)
48 {
49 TRACE("%ld\n", token);
50 }
51
52 /*****************************************************
53 * DllMain
54 */
55 BOOL WINAPI DllMain(HINSTANCE hinst, DWORD reason, LPVOID reserved)
56 {
57 TRACE("(%p, %d, %p)\n", hinst, reason, reserved);
58
59 switch(reason)
60 {
61 case DLL_WINE_PREATTACH:
62 return FALSE; /* prefer native version */
63
64 case DLL_PROCESS_ATTACH:
65 DisableThreadLibraryCalls( hinst );
66 break;
67
68 case DLL_PROCESS_DETACH:
69 free_installed_fonts();
70 break;
71 }
72 return TRUE;
73 }
74
75 /*****************************************************
76 * GdiplusStartup [GDIPLUS.@]
77 */
78 Status WINAPI GdiplusStartup(ULONG_PTR *token, const struct GdiplusStartupInput *input,
79 struct GdiplusStartupOutput *output)
80 {
81 if(!token || !input)
82 return InvalidParameter;
83
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);
88
89 if(input->GdiplusVersion < 1 || input->GdiplusVersion > 2)
90 return UnsupportedGdiplusVersion;
91
92 if(input->SuppressBackgroundThread){
93 if(!output)
94 return InvalidParameter;
95
96 output->NotificationHook = NotificationHook;
97 output->NotificationUnhook = NotificationUnhook;
98 }
99
100 *token = 0xdeadbeef;
101
102 /* FIXME: DebugEventCallback ignored */
103
104 return Ok;
105 }
106
107 GpStatus WINAPI GdiplusNotificationHook(ULONG_PTR *token)
108 {
109 FIXME("%p\n", token);
110 return NotificationHook(token);
111 }
112
113 void WINAPI GdiplusNotificationUnhook(ULONG_PTR token)
114 {
115 FIXME("%ld\n", token);
116 NotificationUnhook(token);
117 }
118
119 /*****************************************************
120 * GdiplusShutdown [GDIPLUS.@]
121 */
122 void WINAPI GdiplusShutdown(ULONG_PTR token)
123 {
124 /* FIXME: no object tracking */
125 }
126
127 /*****************************************************
128 * GdipAlloc [GDIPLUS.@]
129 */
130 void* WINGDIPAPI GdipAlloc(SIZE_T size)
131 {
132 return HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, size);
133 }
134
135 /*****************************************************
136 * GdipFree [GDIPLUS.@]
137 */
138 void WINGDIPAPI GdipFree(void* ptr)
139 {
140 HeapFree(GetProcessHeap(), 0, ptr);
141 }
142
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.
149 **/
150 static void add_arc_part(GpPointF * pt, REAL x1, REAL y1, REAL x2, REAL y2,
151 REAL start, REAL end, BOOL write_first)
152 {
153 REAL center_x, center_y, rad_x, rad_y, cos_start, cos_end,
154 sin_start, sin_end, a, half;
155 INT i;
156
157 rad_x = x2 / 2.0;
158 rad_y = y2 / 2.0;
159 center_x = x1 + rad_x;
160 center_y = y1 + rad_y;
161
162 cos_start = cos(start);
163 cos_end = cos(end);
164 sin_start = sin(start);
165 sin_end = sin(end);
166
167 half = (end - start) / 2.0;
168 a = 4.0 / 3.0 * (1 - cos(half)) / sin(half);
169
170 if(write_first){
171 pt[0].X = cos_start;
172 pt[0].Y = sin_start;
173 }
174 pt[1].X = cos_start - a * sin_start;
175 pt[1].Y = sin_start + a * cos_start;
176
177 pt[3].X = cos_end;
178 pt[3].Y = sin_end;
179 pt[2].X = cos_end + a * sin_end;
180 pt[2].Y = sin_end - a * cos_end;
181
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;
186 }
187 }
188
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
192 * conveniently. */
193 static void unstretch_angle(REAL * angle, REAL rad_x, REAL rad_y)
194 {
195 REAL stretched;
196 INT revs_off;
197
198 *angle = deg2rad(*angle);
199
200 if(fabs(cos(*angle)) < 0.00001 || fabs(sin(*angle)) < 0.00001)
201 return;
202
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;
206 *angle = stretched;
207 }
208
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)
213 {
214 INT i;
215 REAL end_angle, start_angle, endAngle;
216
217 endAngle = startAngle + sweepAngle;
218 unstretch_angle(&startAngle, x2 / 2.0, y2 / 2.0);
219 unstretch_angle(&endAngle, x2 / 2.0, y2 / 2.0);
220
221 /* start_angle and end_angle are the iterative variables */
222 start_angle = startAngle;
223
224 for(i = 0; i < MAX_ARC_PTS - 1; i += 3){
225 /* check if we've overshot the end angle */
226 if( sweepAngle > 0.0 )
227 {
228 if (start_angle >= endAngle) break;
229 end_angle = min(start_angle + M_PI_2, endAngle);
230 }
231 else
232 {
233 if (start_angle <= endAngle) break;
234 end_angle = max(start_angle - M_PI_2, endAngle);
235 }
236
237 if (points)
238 add_arc_part(&points[i], x1, y1, x2, y2, start_angle, end_angle, i == 0);
239
240 start_angle += M_PI_2 * (sweepAngle < 0.0 ? -1.0 : 1.0);
241 }
242
243 if (i == 0) return 0;
244 else return i+1;
245 }
246
247 COLORREF ARGB2COLORREF(ARGB color)
248 {
249 /*
250 Packing of these color structures:
251 COLORREF: 00bbggrr
252 ARGB: aarrggbb
253 FIXME:doesn't handle alpha channel
254 */
255 return ((color & 0x0000ff) << 16) +
256 (color & 0x00ff00) +
257 ((color & 0xff0000) >> 16);
258 }
259
260 HBITMAP ARGB2BMP(ARGB color)
261 {
262 HDC hdc;
263 BITMAPINFO bi;
264 HBITMAP result;
265 RGBQUAD *bits;
266 int alpha;
267
268 if ((color & 0xff000000) == 0xff000000) return 0;
269
270 hdc = CreateCompatibleDC(NULL);
271
272 bi.bmiHeader.biSize = sizeof(bi.bmiHeader);
273 bi.bmiHeader.biWidth = 1;
274 bi.bmiHeader.biHeight = 1;
275 bi.bmiHeader.biPlanes = 1;
276 bi.bmiHeader.biBitCount = 32;
277 bi.bmiHeader.biCompression = BI_RGB;
278 bi.bmiHeader.biSizeImage = 0;
279 bi.bmiHeader.biXPelsPerMeter = 0;
280 bi.bmiHeader.biYPelsPerMeter = 0;
281 bi.bmiHeader.biClrUsed = 0;
282 bi.bmiHeader.biClrImportant = 0;
283
284 result = CreateDIBSection(hdc, &bi, DIB_RGB_COLORS, (void*)&bits, NULL, 0);
285
286 bits[0].rgbReserved = alpha = (color>>24)&0xff;
287 bits[0].rgbRed = ((color>>16)&0xff)*alpha/255;
288 bits[0].rgbGreen = ((color>>8)&0xff)*alpha/255;
289 bits[0].rgbBlue = (color&0xff)*alpha/255;
290
291 DeleteDC(hdc);
292
293 return result;
294 }
295
296 /* Like atan2, but puts angle in correct quadrant if dx is 0. */
297 REAL gdiplus_atan2(REAL dy, REAL dx)
298 {
299 if((dx == 0.0) && (dy != 0.0))
300 return dy > 0.0 ? M_PI_2 : -M_PI_2;
301
302 return atan2(dy, dx);
303 }
304
305 GpStatus hresult_to_status(HRESULT res)
306 {
307 switch(res){
308 case S_OK:
309 return Ok;
310 case E_OUTOFMEMORY:
311 return OutOfMemory;
312 case E_INVALIDARG:
313 return InvalidParameter;
314 default:
315 return GenericError;
316 }
317 }
318
319 /* converts a given unit to its value in pixels */
320 REAL convert_unit(HDC hdc, GpUnit unit)
321 {
322 switch(unit)
323 {
324 case UnitInch:
325 return (REAL) GetDeviceCaps(hdc, LOGPIXELSX);
326 case UnitPoint:
327 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 72.0;
328 case UnitDocument:
329 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 300.0;
330 case UnitMillimeter:
331 return ((REAL)GetDeviceCaps(hdc, LOGPIXELSX)) / 25.4;
332 case UnitWorld:
333 ERR("cannot convert UnitWorld\n");
334 return 0.0;
335 case UnitPixel:
336 case UnitDisplay:
337 default:
338 return 1.0;
339 }
340 }
341
342 /* Calculates Bezier points from cardinal spline points. */
343 void calc_curve_bezier(CONST GpPointF *pts, REAL tension, REAL *x1,
344 REAL *y1, REAL *x2, REAL *y2)
345 {
346 REAL xdiff, ydiff;
347
348 /* calculate tangent */
349 xdiff = pts[2].X - pts[0].X;
350 ydiff = pts[2].Y - pts[0].Y;
351
352 /* apply tangent to get control points */
353 *x1 = pts[1].X - tension * xdiff;
354 *y1 = pts[1].Y - tension * ydiff;
355 *x2 = pts[1].X + tension * xdiff;
356 *y2 = pts[1].Y + tension * ydiff;
357 }
358
359 /* Calculates Bezier points from cardinal spline endpoints. */
360 void calc_curve_bezier_endp(REAL xend, REAL yend, REAL xadj, REAL yadj,
361 REAL tension, REAL *x, REAL *y)
362 {
363 /* tangent at endpoints is the line from the endpoint to the adjacent point */
364 *x = roundr(tension * (xadj - xend) + xend);
365 *y = roundr(tension * (yadj - yend) + yend);
366 }
367
368 /* make sure path has enough space for len more points */
369 BOOL lengthen_path(GpPath *path, INT len)
370 {
371 /* initial allocation */
372 if(path->datalen == 0){
373 path->datalen = len * 2;
374
375 path->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
376 if(!path->pathdata.Points) return FALSE;
377
378 path->pathdata.Types = GdipAlloc(path->datalen);
379 if(!path->pathdata.Types){
380 GdipFree(path->pathdata.Points);
381 return FALSE;
382 }
383 }
384 /* reallocation, double size of arrays */
385 else if(path->datalen - path->pathdata.Count < len){
386 while(path->datalen - path->pathdata.Count < len)
387 path->datalen *= 2;
388
389 path->pathdata.Points = HeapReAlloc(GetProcessHeap(), 0,
390 path->pathdata.Points, path->datalen * sizeof(PointF));
391 if(!path->pathdata.Points) return FALSE;
392
393 path->pathdata.Types = HeapReAlloc(GetProcessHeap(), 0,
394 path->pathdata.Types, path->datalen);
395 if(!path->pathdata.Types) return FALSE;
396 }
397
398 return TRUE;
399 }
400
401 void convert_32bppARGB_to_32bppPARGB(UINT width, UINT height,
402 BYTE *dst_bits, INT dst_stride, const BYTE *src_bits, INT src_stride)
403 {
404 UINT x, y;
405 for (y=0; y<height; y++)
406 {
407 const BYTE *src=src_bits+y*src_stride;
408 BYTE *dst=dst_bits+y*dst_stride;
409 for (x=0; x<width; x++)
410 {
411 BYTE alpha=src[3];
412 *dst++ = *src++ * alpha / 255;
413 *dst++ = *src++ * alpha / 255;
414 *dst++ = *src++ * alpha / 255;
415 *dst++ = *src++;
416 }
417 }
418 }
419
420 /* recursive deletion of GpRegion nodes */
421 void delete_element(region_element* element)
422 {
423 switch(element->type)
424 {
425 case RegionDataRect:
426 break;
427 case RegionDataPath:
428 GdipDeletePath(element->elementdata.pathdata.path);
429 break;
430 case RegionDataEmptyRect:
431 case RegionDataInfiniteRect:
432 break;
433 default:
434 delete_element(element->elementdata.combine.left);
435 delete_element(element->elementdata.combine.right);
436 GdipFree(element->elementdata.combine.left);
437 GdipFree(element->elementdata.combine.right);
438 break;
439 }
440 }
441
442 const char *debugstr_rectf(CONST RectF* rc)
443 {
444 if (!rc) return "(null)";
445 return wine_dbg_sprintf("(%0.2f,%0.2f,%0.2f,%0.2f)", rc->X, rc->Y, rc->Width, rc->Height);
446 }
447
This page was automatically generated by the
LXR engine.
Visit the LXR main site for more
information.