dlls/gdiplus/matrix.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 "wingdi.h"
  25
  26 #include "objbase.h"
  27
  28 #include "gdiplus.h"
  29 #include "gdiplus_private.h"
  30
  31 /* Multiplies two matrices of the form
  32  *
  33  * idx:0 idx:1     0
  34  * idx:2 idx:3     0
  35  * idx:4 idx:5     1
  36  *
  37  * and puts the output in out.
  38  * */
  39 static void matrix_multiply(GDIPCONST REAL * left, GDIPCONST REAL * right, REAL * out)
  40 {
  41     REAL temp[6];
  42     int i, odd;
  43
  44     for(i = 0; i < 6; i++){
  45         odd = i % 2;
  46         temp[i] = left[i - odd] * right[odd] + left[i - odd + 1] * right[odd + 2] +
  47                   (i >= 4 ? right[odd + 4] : 0.0);
  48     }
  49
  50     memcpy(out, temp, 6 * sizeof(REAL));
  51 }
  52
  53 GpStatus WINGDIPAPI GdipCreateMatrix2(REAL m11, REAL m12, REAL m21, REAL m22,
  54     REAL dx, REAL dy, GpMatrix **matrix)
  55 {
  56     if(!matrix)
  57         return InvalidParameter;
  58
  59     *matrix = GdipAlloc(sizeof(GpMatrix));
  60     if(!*matrix)    return OutOfMemory;
  61
  62     /* first row */
  63     (*matrix)->matrix[0] = m11;
  64     (*matrix)->matrix[1] = m12;
  65     /* second row */
  66     (*matrix)->matrix[2] = m21;
  67     (*matrix)->matrix[3] = m22;
  68     /* third row */
  69     (*matrix)->matrix[4] = dx;
  70     (*matrix)->matrix[5] = dy;
  71
  72     return Ok;
  73 }
  74
  75 GpStatus WINGDIPAPI GdipCreateMatrix3(GDIPCONST GpRectF *rect,
  76     GDIPCONST GpPointF *pt, GpMatrix **matrix)
  77 {
  78     if(!matrix)
  79         return InvalidParameter;
  80
  81     *matrix = GdipAlloc(sizeof(GpMatrix));
  82     if(!*matrix)    return OutOfMemory;
  83
  84     memcpy((*matrix)->matrix, rect, 4 * sizeof(REAL));
  85
  86     (*matrix)->matrix[4] = pt->X;
  87     (*matrix)->matrix[5] = pt->Y;
  88
  89     return Ok;
  90 }
  91
  92 GpStatus WINGDIPAPI GdipCreateMatrix3I(GDIPCONST GpRect *rect, GDIPCONST GpPoint *pt,
  93     GpMatrix **matrix)
  94 {
  95     GpRectF rectF;
  96     GpPointF ptF;
  97
  98     rectF.X = (REAL)rect->X;
  99     rectF.Y = (REAL)rect->Y;
 100     rectF.Width = (REAL)rect->Width;
 101     rectF.Height = (REAL)rect->Height;
 102
 103     ptF.X = (REAL)pt->X;
 104     ptF.Y = (REAL)pt->Y;
 105
 106     return GdipCreateMatrix3(&rectF, &ptF, matrix);
 107 }
 108
 109 GpStatus WINGDIPAPI GdipCloneMatrix(GpMatrix *matrix, GpMatrix **clone)
 110 {
 111     if(!matrix || !clone)
 112         return InvalidParameter;
 113
 114     *clone = GdipAlloc(sizeof(GpMatrix));
 115     if(!*clone)    return OutOfMemory;
 116
 117     **clone = *matrix;
 118
 119     return Ok;
 120 }
 121
 122 GpStatus WINGDIPAPI GdipCreateMatrix(GpMatrix **matrix)
 123 {
 124     if(!matrix)
 125         return InvalidParameter;
 126
 127     *matrix = GdipAlloc(sizeof(GpMatrix));
 128     if(!*matrix)    return OutOfMemory;
 129
 130     (*matrix)->matrix[0] = 1.0;
 131     (*matrix)->matrix[1] = 0.0;
 132     (*matrix)->matrix[2] = 0.0;
 133     (*matrix)->matrix[3] = 1.0;
 134     (*matrix)->matrix[4] = 0.0;
 135     (*matrix)->matrix[5] = 0.0;
 136
 137     return Ok;
 138 }
 139
 140 GpStatus WINGDIPAPI GdipDeleteMatrix(GpMatrix *matrix)
 141 {
 142     if(!matrix)
 143         return InvalidParameter;
 144
 145     GdipFree(matrix);
 146
 147     return Ok;
 148 }
 149
 150 GpStatus WINGDIPAPI GdipGetMatrixElements(GDIPCONST GpMatrix *matrix,
 151     REAL *out)
 152 {
 153     if(!matrix || !out)
 154         return InvalidParameter;
 155
 156     memcpy(out, matrix->matrix, sizeof(matrix->matrix));
 157
 158     return Ok;
 159 }
 160
 161 GpStatus WINGDIPAPI GdipIsMatrixInvertible(GDIPCONST GpMatrix *matrix, BOOL *result)
 162 {
 163     REAL det;
 164
 165     if(!matrix || !result)
 166         return InvalidParameter;
 167
 168     det = matrix->matrix[0]*matrix->matrix[3] - matrix->matrix[1]*matrix->matrix[2];
 169
 170     *result = (fabs(det) >= 1e-5);
 171
 172     return Ok;
 173 }
 174
 175 GpStatus WINGDIPAPI GdipMultiplyMatrix(GpMatrix *matrix, GpMatrix* matrix2,
 176     GpMatrixOrder order)
 177 {
 178     if(!matrix || !matrix2)
 179         return InvalidParameter;
 180
 181     if(order == MatrixOrderAppend)
 182         matrix_multiply(matrix->matrix, matrix2->matrix, matrix->matrix);
 183     else
 184         matrix_multiply(matrix2->matrix, matrix->matrix, matrix->matrix);
 185
 186     return Ok;
 187 }
 188
 189 GpStatus WINGDIPAPI GdipRotateMatrix(GpMatrix *matrix, REAL angle,
 190     GpMatrixOrder order)
 191 {
 192     REAL cos_theta, sin_theta, rotate[6];
 193
 194     if(!matrix)
 195         return InvalidParameter;
 196
 197     angle = deg2rad(angle);
 198     cos_theta = cos(angle);
 199     sin_theta = sin(angle);
 200
 201     rotate[0] = cos_theta;
 202     rotate[1] = sin_theta;
 203     rotate[2] = -sin_theta;
 204     rotate[3] = cos_theta;
 205     rotate[4] = 0.0;
 206     rotate[5] = 0.0;
 207
 208     if(order == MatrixOrderAppend)
 209         matrix_multiply(matrix->matrix, rotate, matrix->matrix);
 210     else
 211         matrix_multiply(rotate, matrix->matrix, matrix->matrix);
 212
 213     return Ok;
 214 }
 215
 216 GpStatus WINGDIPAPI GdipScaleMatrix(GpMatrix *matrix, REAL scaleX, REAL scaleY,
 217     GpMatrixOrder order)
 218 {
 219     REAL scale[6];
 220
 221     if(!matrix)
 222         return InvalidParameter;
 223
 224     scale[0] = scaleX;
 225     scale[1] = 0.0;
 226     scale[2] = 0.0;
 227     scale[3] = scaleY;
 228     scale[4] = 0.0;
 229     scale[5] = 0.0;
 230
 231     if(order == MatrixOrderAppend)
 232         matrix_multiply(matrix->matrix, scale, matrix->matrix);
 233     else
 234         matrix_multiply(scale, matrix->matrix, matrix->matrix);
 235
 236     return Ok;
 237 }
 238
 239 GpStatus WINGDIPAPI GdipSetMatrixElements(GpMatrix *matrix, REAL m11, REAL m12,
 240     REAL m21, REAL m22, REAL dx, REAL dy)
 241 {
 242     if(!matrix)
 243         return InvalidParameter;
 244
 245     matrix->matrix[0] = m11;
 246     matrix->matrix[1] = m12;
 247     matrix->matrix[2] = m21;
 248     matrix->matrix[3] = m22;
 249     matrix->matrix[4] = dx;
 250     matrix->matrix[5] = dy;
 251
 252     return Ok;
 253 }
 254
 255 GpStatus WINGDIPAPI GdipTransformMatrixPoints(GpMatrix *matrix, GpPointF *pts,
 256                                               INT count)
 257 {
 258     REAL x, y;
 259     INT i;
 260
 261     if(!matrix || !pts || count <= 0)
 262         return InvalidParameter;
 263
 264     for(i = 0; i < count; i++)
 265     {
 266         x = pts[i].X;
 267         y = pts[i].Y;
 268
 269         pts[i].X = x * matrix->matrix[0] + y * matrix->matrix[2] + matrix->matrix[4];
 270         pts[i].Y = x * matrix->matrix[1] + y * matrix->matrix[3] + matrix->matrix[5];
 271     }
 272
 273     return Ok;
 274 }
 275
 276 GpStatus WINGDIPAPI GdipTransformMatrixPointsI(GpMatrix *matrix, GpPoint *pts, INT count)
 277 {
 278     GpPointF *ptsF;
 279     GpStatus ret;
 280     INT i;
 281
 282     if(count <= 0)
 283         return InvalidParameter;
 284
 285     ptsF = GdipAlloc(sizeof(GpPointF) * count);
 286     if(!ptsF)
 287         return OutOfMemory;
 288
 289     for(i = 0; i < count; i++){
 290         ptsF[i].X = (REAL)pts[i].X;
 291         ptsF[i].Y = (REAL)pts[i].Y;
 292     }
 293
 294     ret = GdipTransformMatrixPoints(matrix, ptsF, count);
 295
 296     if(ret == Ok)
 297         for(i = 0; i < count; i++){
 298             pts[i].X = roundr(ptsF[i].X);
 299             pts[i].Y = roundr(ptsF[i].Y);
 300         }
 301     GdipFree(ptsF);
 302
 303     return ret;
 304 }
 305
 306 GpStatus WINGDIPAPI GdipTranslateMatrix(GpMatrix *matrix, REAL offsetX,
 307     REAL offsetY, GpMatrixOrder order)
 308 {
 309     REAL translate[6];
 310
 311     if(!matrix)
 312         return InvalidParameter;
 313
 314     translate[0] = 1.0;
 315     translate[1] = 0.0;
 316     translate[2] = 0.0;
 317     translate[3] = 1.0;
 318     translate[4] = offsetX;
 319     translate[5] = offsetY;
 320
 321     if(order == MatrixOrderAppend)
 322         matrix_multiply(matrix->matrix, translate, matrix->matrix);
 323     else
 324         matrix_multiply(translate, matrix->matrix, matrix->matrix);
 325
 326     return Ok;
 327 }
 328
 329 GpStatus WINGDIPAPI GdipVectorTransformMatrixPoints(GpMatrix *matrix, GpPointF *pts, INT count)
 330 {
 331     REAL x, y;
 332     INT i;
 333
 334     if(!matrix || !pts || count <= 0)
 335         return InvalidParameter;
 336
 337     for(i = 0; i < count; i++)
 338     {
 339         x = pts[i].X;
 340         y = pts[i].Y;
 341
 342         pts[i].X = x * matrix->matrix[0] + y * matrix->matrix[2];
 343         pts[i].Y = x * matrix->matrix[1] + y * matrix->matrix[3];
 344     }
 345
 346     return Ok;
 347 }
 348
 349 GpStatus WINGDIPAPI GdipVectorTransformMatrixPointsI(GpMatrix *matrix, GpPoint *pts, INT count)
 350 {
 351     GpPointF *ptsF;
 352     GpStatus ret;
 353     INT i;
 354
 355     if(count <= 0)
 356         return InvalidParameter;
 357
 358     ptsF = GdipAlloc(sizeof(GpPointF) * count);
 359     if(!ptsF)
 360         return OutOfMemory;
 361
 362     for(i = 0; i < count; i++){
 363         ptsF[i].X = (REAL)pts[i].X;
 364         ptsF[i].Y = (REAL)pts[i].Y;
 365     }
 366
 367     ret = GdipVectorTransformMatrixPoints(matrix, ptsF, count);
 368     /* store back */
 369     if(ret == Ok)
 370         for(i = 0; i < count; i++){
 371             pts[i].X = roundr(ptsF[i].X);
 372             pts[i].Y = roundr(ptsF[i].Y);
 373         }
 374     GdipFree(ptsF);
 375
 376     return ret;
 377 }
 378
 379 GpStatus WINGDIPAPI GdipIsMatrixEqual(GDIPCONST GpMatrix *matrix, GDIPCONST GpMatrix *matrix2,
 380     BOOL *result)
 381 {
 382     if(!matrix || !matrix2 || !result)
 383         return InvalidParameter;
 384     /* based on single array member of GpMatrix */
 385     *result = (memcmp(matrix->matrix, matrix2->matrix, sizeof(GpMatrix)) == 0);
 386
 387     return Ok;
 388 }
 389
 390 GpStatus WINGDIPAPI GdipIsMatrixIdentity(GDIPCONST GpMatrix *matrix, BOOL *result)
 391 {
 392     GpMatrix *e;
 393     GpStatus ret;
 394     BOOL isIdentity;
 395
 396     if(!matrix || !result)
 397         return InvalidParameter;
 398
 399     ret = GdipCreateMatrix(&e);
 400     if(ret != Ok) return ret;
 401
 402     ret = GdipIsMatrixEqual(matrix, e, &isIdentity);
 403     if(ret == Ok)
 404         *result = isIdentity;
 405
 406     GdipFree(e);
 407
 408     return ret;
 409 }