dlls/gdiplus/gdiplus.c

   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_PROCESS_ATTACH:
  62         DisableThreadLibraryCalls( hinst );
  63         break;
  64
  65     case DLL_PROCESS_DETACH:
  66         free_installed_fonts();
  67         break;
  68     }
  69     return TRUE;
  70 }
  71
  72 /*****************************************************
  73  *      GdiplusStartup [GDIPLUS.@]
  74  */
  75 Status WINAPI GdiplusStartup(ULONG_PTR *token, const struct GdiplusStartupInput *input,
  76                              struct GdiplusStartupOutput *output)
  77 {
  78     if(!token || !input)
  79         return InvalidParameter;
  80
  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);
  85
  86     if(input->GdiplusVersion < 1 || input->GdiplusVersion > 2)
  87         return UnsupportedGdiplusVersion;
  88
  89     if(input->SuppressBackgroundThread){
  90         if(!output)
  91             return InvalidParameter;
  92
  93         output->NotificationHook = NotificationHook;
  94         output->NotificationUnhook = NotificationUnhook;
  95     }
  96
  97     *token = 0xdeadbeef;
  98
  99     /* FIXME: DebugEventCallback ignored */
 100
 101     return Ok;
 102 }
 103
 104 GpStatus WINAPI GdiplusNotificationHook(ULONG_PTR *token)
 105 {
 106     FIXME("%p\n", token);
 107     return NotificationHook(token);
 108 }
 109
 110 void WINAPI GdiplusNotificationUnhook(ULONG_PTR token)
 111 {
 112     FIXME("%ld\n", token);
 113     NotificationUnhook(token);
 114 }
 115
 116 /*****************************************************
 117  *      GdiplusShutdown [GDIPLUS.@]
 118  */
 119 ULONG WINAPI GdiplusShutdown_wrapper(ULONG_PTR token)
 120 {
 121     /* Notice the slightly different prototype from the official
 122      * signature which forces us to use the _wrapper suffix.
 123      */
 124
 125     /* FIXME: no object tracking */
 126
 127     /* "bricksntiles" expects a return value of 0, which native
 128      * coincidentally gives.
 129      */
 130     return 0;
 131 }
 132
 133 /*****************************************************
 134  *      GdipAlloc [GDIPLUS.@]
 135  */
 136 void* WINGDIPAPI GdipAlloc(SIZE_T size)
 137 {
 138     return HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, size);
 139 }
 140
 141 /*****************************************************
 142  *      GdipFree [GDIPLUS.@]
 143  */
 144 void WINGDIPAPI GdipFree(void* ptr)
 145 {
 146     HeapFree(GetProcessHeap(), 0, ptr);
 147 }
 148
 149 /* Calculates the bezier points needed to fill in the arc portion starting at
 150  * angle start and ending at end.  These two angles should be no more than 90
 151  * degrees from each other.  x1, y1, x2, y2 describes the bounding box (upper
 152  * left and width and height).  Angles must be in radians. write_first indicates
 153  * that the first bezier point should be written out (usually this is false).
 154  * pt is the array of GpPointFs that gets written to.
 155  **/
 156 static void add_arc_part(GpPointF * pt, REAL x1, REAL y1, REAL x2, REAL y2,
 157     REAL start, REAL end, BOOL write_first)
 158 {
 159     REAL center_x, center_y, rad_x, rad_y, cos_start, cos_end,
 160         sin_start, sin_end, a, half;
 161     INT i;
 162
 163     rad_x = x2 / 2.0;
 164     rad_y = y2 / 2.0;
 165     center_x = x1 + rad_x;
 166     center_y = y1 + rad_y;
 167
 168     cos_start = cos(start);
 169     cos_end = cos(end);
 170     sin_start = sin(start);
 171     sin_end = sin(end);
 172
 173     half = (end - start) / 2.0;
 174     a = 4.0 / 3.0 * (1 - cos(half)) / sin(half);
 175
 176     if(write_first){
 177         pt[0].X = cos_start;
 178         pt[0].Y = sin_start;
 179     }
 180     pt[1].X = cos_start - a * sin_start;
 181     pt[1].Y = sin_start + a * cos_start;
 182
 183     pt[3].X = cos_end;
 184     pt[3].Y = sin_end;
 185     pt[2].X = cos_end + a * sin_end;
 186     pt[2].Y = sin_end - a * cos_end;
 187
 188     /* expand the points back from the unit circle to the ellipse */
 189     for(i = (write_first ? 0 : 1); i < 4; i ++){
 190         pt[i].X = pt[i].X * rad_x + center_x;
 191         pt[i].Y = pt[i].Y * rad_y + center_y;
 192     }
 193 }
 194
 195 /* We plot the curve as if it is on a circle then stretch the points.  This
 196  * adjusts the angles so that when we stretch the points they will end in the
 197  * right place. This is only complicated because atan and atan2 do not behave
 198  * conveniently. */
 199 static void unstretch_angle(REAL * angle, REAL rad_x, REAL rad_y)
 200 {
 201     REAL stretched;
 202     INT revs_off;
 203
 204     *angle = deg2rad(*angle);
 205
 206     if(fabs(cos(*angle)) < 0.00001 || fabs(sin(*angle)) < 0.00001)
 207         return;
 208
 209     stretched = gdiplus_atan2(sin(*angle) / fabs(rad_y), cos(*angle) / fabs(rad_x));
 210     revs_off = roundr(*angle / (2.0 * M_PI)) - roundr(stretched / (2.0 * M_PI));
 211     stretched += ((REAL)revs_off) * M_PI * 2.0;
 212     *angle = stretched;
 213 }
 214
 215 /* Stores the bezier points that correspond to the arc in points.  If points is
 216  * null, just return the number of points needed to represent the arc. */
 217 INT arc2polybezier(GpPointF * points, REAL x1, REAL y1, REAL x2, REAL y2,
 218     REAL startAngle, REAL sweepAngle)
 219 {
 220     INT i;
 221     REAL end_angle, start_angle, endAngle;
 222
 223     endAngle = startAngle + sweepAngle;
 224     unstretch_angle(&startAngle, x2 / 2.0, y2 / 2.0);
 225     unstretch_angle(&endAngle, x2 / 2.0, y2 / 2.0);
 226
 227     /* start_angle and end_angle are the iterative variables */
 228     start_angle = startAngle;
 229
 230     for(i = 0; i < MAX_ARC_PTS - 1; i += 3){
 231         /* check if we've overshot the end angle */
 232         if( sweepAngle > 0.0 )
 233         {
 234             if (start_angle >= endAngle) break;
 235             end_angle = min(start_angle + M_PI_2, endAngle);
 236         }
 237         else
 238         {
 239             if (start_angle <= endAngle) break;
 240             end_angle = max(start_angle - M_PI_2, endAngle);
 241         }
 242
 243         if (points)
 244             add_arc_part(&points[i], x1, y1, x2, y2, start_angle, end_angle, i == 0);
 245
 246         start_angle += M_PI_2 * (sweepAngle < 0.0 ? -1.0 : 1.0);
 247     }
 248
 249     if (i == 0) return 0;
 250     else return i+1;
 251 }
 252
 253 COLORREF ARGB2COLORREF(ARGB color)
 254 {
 255     /*
 256     Packing of these color structures:
 257     COLORREF:   00bbggrr
 258     ARGB:       aarrggbb
 259     FIXME:doesn't handle alpha channel
 260     */
 261     return ((color & 0x0000ff) << 16) +
 262            (color & 0x00ff00) +
 263            ((color & 0xff0000) >> 16);
 264 }
 265
 266 HBITMAP ARGB2BMP(ARGB color)
 267 {
 268     BITMAPINFO bi;
 269     HBITMAP result;
 270     RGBQUAD *bits;
 271     int alpha;
 272
 273     if ((color & 0xff000000) == 0xff000000) return 0;
 274
 275     bi.bmiHeader.biSize = sizeof(bi.bmiHeader);
 276     bi.bmiHeader.biWidth = 1;
 277     bi.bmiHeader.biHeight = 1;
 278     bi.bmiHeader.biPlanes = 1;
 279     bi.bmiHeader.biBitCount = 32;
 280     bi.bmiHeader.biCompression = BI_RGB;
 281     bi.bmiHeader.biSizeImage = 0;
 282     bi.bmiHeader.biXPelsPerMeter = 0;
 283     bi.bmiHeader.biYPelsPerMeter = 0;
 284     bi.bmiHeader.biClrUsed = 0;
 285     bi.bmiHeader.biClrImportant = 0;
 286
 287     result = CreateDIBSection(0, &bi, DIB_RGB_COLORS, (void*)&bits, NULL, 0);
 288
 289     bits[0].rgbReserved = alpha = (color>>24)&0xff;
 290     bits[0].rgbRed = ((color>>16)&0xff)*alpha/255;
 291     bits[0].rgbGreen = ((color>>8)&0xff)*alpha/255;
 292     bits[0].rgbBlue = (color&0xff)*alpha/255;
 293
 294     return result;
 295 }
 296
 297 /* Like atan2, but puts angle in correct quadrant if dx is 0. */
 298 REAL gdiplus_atan2(REAL dy, REAL dx)
 299 {
 300     if((dx == 0.0) && (dy != 0.0))
 301         return dy > 0.0 ? M_PI_2 : -M_PI_2;
 302
 303     return atan2(dy, dx);
 304 }
 305
 306 GpStatus hresult_to_status(HRESULT res)
 307 {
 308     switch(res){
 309         case S_OK:
 310             return Ok;
 311         case E_OUTOFMEMORY:
 312             return OutOfMemory;
 313         case E_INVALIDARG:
 314             return InvalidParameter;
 315         default:
 316             return GenericError;
 317     }
 318 }
 319
 320 /* converts a given unit to its value in inches */
 321 REAL convert_unit(REAL logpixels, GpUnit unit)
 322 {
 323     switch(unit)
 324     {
 325         case UnitInch:
 326             return logpixels;
 327         case UnitPoint:
 328             return logpixels / 72.0;
 329         case UnitDocument:
 330             return logpixels / 300.0;
 331         case UnitMillimeter:
 332             return logpixels / 25.4;
 333         case UnitWorld:
 334             ERR("cannot convert UnitWorld\n");
 335             return 0.0;
 336         case UnitPixel:
 337         case UnitDisplay:
 338         default:
 339             return 1.0;
 340     }
 341 }
 342
 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)
 346 {
 347     REAL xdiff, ydiff;
 348
 349     /* calculate tangent */
 350     xdiff = pts[2].X - pts[0].X;
 351     ydiff = pts[2].Y - pts[0].Y;
 352
 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;
 358 }
 359
 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)
 363 {
 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);
 367 }
 368
 369 /* make sure path has enough space for len more points */
 370 BOOL lengthen_path(GpPath *path, INT len)
 371 {
 372     /* initial allocation */
 373     if(path->datalen == 0){
 374         path->datalen = len * 2;
 375
 376         path->pathdata.Points = GdipAlloc(path->datalen * sizeof(PointF));
 377         if(!path->pathdata.Points)   return FALSE;
 378
 379         path->pathdata.Types = GdipAlloc(path->datalen);
 380         if(!path->pathdata.Types){
 381             GdipFree(path->pathdata.Points);
 382             return FALSE;
 383         }
 384     }
 385     /* reallocation, double size of arrays */
 386     else if(path->datalen - path->pathdata.Count < len){
 387         while(path->datalen - path->pathdata.Count < len)
 388             path->datalen *= 2;
 389
 390         path->pathdata.Points = HeapReAlloc(GetProcessHeap(), 0,
 391             path->pathdata.Points, path->datalen * sizeof(PointF));
 392         if(!path->pathdata.Points)  return FALSE;
 393
 394         path->pathdata.Types = HeapReAlloc(GetProcessHeap(), 0,
 395             path->pathdata.Types, path->datalen);
 396         if(!path->pathdata.Types)   return FALSE;
 397     }
 398
 399     return TRUE;
 400 }
 401
 402 void convert_32bppARGB_to_32bppPARGB(UINT width, UINT height,
 403     BYTE *dst_bits, INT dst_stride, const BYTE *src_bits, INT src_stride)
 404 {
 405     INT x, y;
 406     for (y=0; y<height; y++)
 407     {
 408         const BYTE *src=src_bits+y*src_stride;
 409         BYTE *dst=dst_bits+y*dst_stride;
 410         for (x=0; x<width; x++)
 411         {
 412             BYTE alpha=src[3];
 413             *dst++ = *src++ * alpha / 255;
 414             *dst++ = *src++ * alpha / 255;
 415             *dst++ = *src++ * alpha / 255;
 416             *dst++ = *src++;
 417         }
 418     }
 419 }
 420
 421 /* recursive deletion of GpRegion nodes */
 422 void delete_element(region_element* element)
 423 {
 424     switch(element->type)
 425     {
 426         case RegionDataRect:
 427             break;
 428         case RegionDataPath:
 429             GdipDeletePath(element->elementdata.pathdata.path);
 430             break;
 431         case RegionDataEmptyRect:
 432         case RegionDataInfiniteRect:
 433             break;
 434         default:
 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);
 439             break;
 440     }
 441 }
 442
 443 const char *debugstr_rectf(CONST RectF* rc)
 444 {
 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);
 447 }
 448
 449 const char *debugstr_pointf(CONST PointF* pt)
 450 {
 451     if (!pt) return "(null)";
 452     return wine_dbg_sprintf("(%0.2f,%0.2f)", pt->X, pt->Y);
 453 }