comctl32/treeview: Correctly draw cut items.
[wine/multimedia.git] / dlls / gdiplus / matrix.c
blob1035cc2daed64a2cef01f3c19e2dbb205f799a85
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 "wingdi.h"
26 #include "objbase.h"
28 #include "gdiplus.h"
29 #include "gdiplus_private.h"
30 #include "wine/debug.h"
32 WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
34 /* Multiplies two matrices of the form
36 * idx:0 idx:1 0
37 * idx:2 idx:3 0
38 * idx:4 idx:5 1
40 * and puts the output in out.
41 * */
42 static void matrix_multiply(GDIPCONST REAL * left, GDIPCONST REAL * right, REAL * out)
44 REAL temp[6];
45 int i, odd;
47 for(i = 0; i < 6; i++){
48 odd = i % 2;
49 temp[i] = left[i - odd] * right[odd] + left[i - odd + 1] * right[odd + 2] +
50 (i >= 4 ? right[odd + 4] : 0.0);
53 memcpy(out, temp, 6 * sizeof(REAL));
56 static REAL matrix_det(GDIPCONST GpMatrix *matrix)
58 return matrix->matrix[0]*matrix->matrix[3] - matrix->matrix[1]*matrix->matrix[2];
61 GpStatus WINGDIPAPI GdipCreateMatrix2(REAL m11, REAL m12, REAL m21, REAL m22,
62 REAL dx, REAL dy, GpMatrix **matrix)
64 TRACE("(%.2f, %.2f, %.2f, %.2f, %.2f, %.2f, %p)\n", m11, m12, m21, m22, dx, dy, matrix);
66 if(!matrix)
67 return InvalidParameter;
69 *matrix = GdipAlloc(sizeof(GpMatrix));
70 if(!*matrix) return OutOfMemory;
72 /* first row */
73 (*matrix)->matrix[0] = m11;
74 (*matrix)->matrix[1] = m12;
75 /* second row */
76 (*matrix)->matrix[2] = m21;
77 (*matrix)->matrix[3] = m22;
78 /* third row */
79 (*matrix)->matrix[4] = dx;
80 (*matrix)->matrix[5] = dy;
82 return Ok;
85 GpStatus WINGDIPAPI GdipCreateMatrix3(GDIPCONST GpRectF *rect,
86 GDIPCONST GpPointF *pt, GpMatrix **matrix)
88 REAL m11, m12, m21, m22, dx, dy;
89 TRACE("(%p, %p, %p)\n", rect, pt, matrix);
91 if(!matrix || !pt)
92 return InvalidParameter;
94 m11 = (pt[1].X - pt[0].X) / rect->Width;
95 m21 = (pt[2].X - pt[0].X) / rect->Height;
96 dx = pt[0].X - m11 * rect->X - m21 * rect->Y;
97 m12 = (pt[1].Y - pt[0].Y) / rect->Width;
98 m22 = (pt[2].Y - pt[0].Y) / rect->Height;
99 dy = pt[0].Y - m12 * rect->X - m22 * rect->Y;
101 return GdipCreateMatrix2(m11, m12, m21, m22, dx, dy, matrix);
104 GpStatus WINGDIPAPI GdipCreateMatrix3I(GDIPCONST GpRect *rect, GDIPCONST GpPoint *pt,
105 GpMatrix **matrix)
107 GpRectF rectF;
108 GpPointF ptF;
110 TRACE("(%p, %p, %p)\n", rect, pt, matrix);
112 rectF.X = (REAL)rect->X;
113 rectF.Y = (REAL)rect->Y;
114 rectF.Width = (REAL)rect->Width;
115 rectF.Height = (REAL)rect->Height;
117 ptF.X = (REAL)pt->X;
118 ptF.Y = (REAL)pt->Y;
120 return GdipCreateMatrix3(&rectF, &ptF, matrix);
123 GpStatus WINGDIPAPI GdipCloneMatrix(GpMatrix *matrix, GpMatrix **clone)
125 TRACE("(%p, %p)\n", matrix, clone);
127 if(!matrix || !clone)
128 return InvalidParameter;
130 *clone = GdipAlloc(sizeof(GpMatrix));
131 if(!*clone) return OutOfMemory;
133 **clone = *matrix;
135 return Ok;
138 GpStatus WINGDIPAPI GdipCreateMatrix(GpMatrix **matrix)
140 TRACE("(%p)\n", matrix);
142 if(!matrix)
143 return InvalidParameter;
145 *matrix = GdipAlloc(sizeof(GpMatrix));
146 if(!*matrix) return OutOfMemory;
148 (*matrix)->matrix[0] = 1.0;
149 (*matrix)->matrix[1] = 0.0;
150 (*matrix)->matrix[2] = 0.0;
151 (*matrix)->matrix[3] = 1.0;
152 (*matrix)->matrix[4] = 0.0;
153 (*matrix)->matrix[5] = 0.0;
155 return Ok;
158 GpStatus WINGDIPAPI GdipDeleteMatrix(GpMatrix *matrix)
160 TRACE("(%p)\n", matrix);
162 if(!matrix)
163 return InvalidParameter;
165 GdipFree(matrix);
167 return Ok;
170 GpStatus WINGDIPAPI GdipGetMatrixElements(GDIPCONST GpMatrix *matrix,
171 REAL *out)
173 TRACE("(%p, %p)\n", matrix, out);
175 if(!matrix || !out)
176 return InvalidParameter;
178 memcpy(out, matrix->matrix, sizeof(matrix->matrix));
180 return Ok;
183 GpStatus WINGDIPAPI GdipInvertMatrix(GpMatrix *matrix)
185 GpMatrix copy;
186 REAL det;
187 BOOL invertible;
189 TRACE("(%p)\n", matrix);
191 if(!matrix)
192 return InvalidParameter;
194 GdipIsMatrixInvertible(matrix, &invertible);
195 if(!invertible)
196 return InvalidParameter;
198 det = matrix_det(matrix);
200 copy = *matrix;
201 /* store result */
202 matrix->matrix[0] = copy.matrix[3] / det;
203 matrix->matrix[1] = -copy.matrix[1] / det;
204 matrix->matrix[2] = -copy.matrix[2] / det;
205 matrix->matrix[3] = copy.matrix[0] / det;
206 matrix->matrix[4] = (copy.matrix[2]*copy.matrix[5]-copy.matrix[3]*copy.matrix[4]) / det;
207 matrix->matrix[5] = -(copy.matrix[0]*copy.matrix[5]-copy.matrix[1]*copy.matrix[4]) / det;
209 return Ok;
212 GpStatus WINGDIPAPI GdipIsMatrixInvertible(GDIPCONST GpMatrix *matrix, BOOL *result)
214 TRACE("(%p, %p)\n", matrix, result);
216 if(!matrix || !result)
217 return InvalidParameter;
219 *result = (fabs(matrix_det(matrix)) >= 1e-5);
221 return Ok;
224 GpStatus WINGDIPAPI GdipMultiplyMatrix(GpMatrix *matrix, GDIPCONST GpMatrix* matrix2,
225 GpMatrixOrder order)
227 TRACE("(%p, %p, %d)\n", matrix, matrix2, order);
229 if(!matrix || !matrix2)
230 return InvalidParameter;
232 if(order == MatrixOrderAppend)
233 matrix_multiply(matrix->matrix, matrix2->matrix, matrix->matrix);
234 else if (order == MatrixOrderPrepend)
235 matrix_multiply(matrix2->matrix, matrix->matrix, matrix->matrix);
236 else
237 return InvalidParameter;
239 return Ok;
242 GpStatus WINGDIPAPI GdipRotateMatrix(GpMatrix *matrix, REAL angle,
243 GpMatrixOrder order)
245 REAL cos_theta, sin_theta, rotate[6];
247 TRACE("(%p, %.2f, %d)\n", matrix, angle, order);
249 if(!matrix)
250 return InvalidParameter;
252 angle = deg2rad(angle);
253 cos_theta = cos(angle);
254 sin_theta = sin(angle);
256 rotate[0] = cos_theta;
257 rotate[1] = sin_theta;
258 rotate[2] = -sin_theta;
259 rotate[3] = cos_theta;
260 rotate[4] = 0.0;
261 rotate[5] = 0.0;
263 if(order == MatrixOrderAppend)
264 matrix_multiply(matrix->matrix, rotate, matrix->matrix);
265 else if (order == MatrixOrderPrepend)
266 matrix_multiply(rotate, matrix->matrix, matrix->matrix);
267 else
268 return InvalidParameter;
270 return Ok;
273 GpStatus WINGDIPAPI GdipScaleMatrix(GpMatrix *matrix, REAL scaleX, REAL scaleY,
274 GpMatrixOrder order)
276 REAL scale[6];
278 TRACE("(%p, %.2f, %.2f, %d)\n", matrix, scaleX, scaleY, order);
280 if(!matrix)
281 return InvalidParameter;
283 scale[0] = scaleX;
284 scale[1] = 0.0;
285 scale[2] = 0.0;
286 scale[3] = scaleY;
287 scale[4] = 0.0;
288 scale[5] = 0.0;
290 if(order == MatrixOrderAppend)
291 matrix_multiply(matrix->matrix, scale, matrix->matrix);
292 else if (order == MatrixOrderPrepend)
293 matrix_multiply(scale, matrix->matrix, matrix->matrix);
294 else
295 return InvalidParameter;
297 return Ok;
300 GpStatus WINGDIPAPI GdipSetMatrixElements(GpMatrix *matrix, REAL m11, REAL m12,
301 REAL m21, REAL m22, REAL dx, REAL dy)
303 TRACE("(%p, %.2f, %.2f, %.2f, %.2f, %.2f, %.2f)\n", matrix, m11, m12,
304 m21, m22, dx, dy);
306 if(!matrix)
307 return InvalidParameter;
309 matrix->matrix[0] = m11;
310 matrix->matrix[1] = m12;
311 matrix->matrix[2] = m21;
312 matrix->matrix[3] = m22;
313 matrix->matrix[4] = dx;
314 matrix->matrix[5] = dy;
316 return Ok;
319 GpStatus WINGDIPAPI GdipShearMatrix(GpMatrix *matrix, REAL shearX, REAL shearY,
320 GpMatrixOrder order)
322 REAL shear[6];
324 TRACE("(%p, %.2f, %.2f, %d)\n", matrix, shearX, shearY, order);
326 if(!matrix)
327 return InvalidParameter;
329 /* prepare transformation matrix */
330 shear[0] = 1.0;
331 shear[1] = shearY;
332 shear[2] = shearX;
333 shear[3] = 1.0;
334 shear[4] = 0.0;
335 shear[5] = 0.0;
337 if(order == MatrixOrderAppend)
338 matrix_multiply(matrix->matrix, shear, matrix->matrix);
339 else if (order == MatrixOrderPrepend)
340 matrix_multiply(shear, matrix->matrix, matrix->matrix);
341 else
342 return InvalidParameter;
344 return Ok;
347 GpStatus WINGDIPAPI GdipTransformMatrixPoints(GpMatrix *matrix, GpPointF *pts,
348 INT count)
350 REAL x, y;
351 INT i;
353 TRACE("(%p, %p, %d)\n", matrix, pts, count);
355 if(!matrix || !pts || count <= 0)
356 return InvalidParameter;
358 for(i = 0; i < count; i++)
360 x = pts[i].X;
361 y = pts[i].Y;
363 pts[i].X = x * matrix->matrix[0] + y * matrix->matrix[2] + matrix->matrix[4];
364 pts[i].Y = x * matrix->matrix[1] + y * matrix->matrix[3] + matrix->matrix[5];
367 return Ok;
370 GpStatus WINGDIPAPI GdipTransformMatrixPointsI(GpMatrix *matrix, GpPoint *pts, INT count)
372 GpPointF *ptsF;
373 GpStatus ret;
374 INT i;
376 TRACE("(%p, %p, %d)\n", matrix, pts, count);
378 if(count <= 0)
379 return InvalidParameter;
381 ptsF = GdipAlloc(sizeof(GpPointF) * count);
382 if(!ptsF)
383 return OutOfMemory;
385 for(i = 0; i < count; i++){
386 ptsF[i].X = (REAL)pts[i].X;
387 ptsF[i].Y = (REAL)pts[i].Y;
390 ret = GdipTransformMatrixPoints(matrix, ptsF, count);
392 if(ret == Ok)
393 for(i = 0; i < count; i++){
394 pts[i].X = roundr(ptsF[i].X);
395 pts[i].Y = roundr(ptsF[i].Y);
397 GdipFree(ptsF);
399 return ret;
402 GpStatus WINGDIPAPI GdipTranslateMatrix(GpMatrix *matrix, REAL offsetX,
403 REAL offsetY, GpMatrixOrder order)
405 REAL translate[6];
407 TRACE("(%p, %.2f, %.2f, %d)\n", matrix, offsetX, offsetY, order);
409 if(!matrix)
410 return InvalidParameter;
412 translate[0] = 1.0;
413 translate[1] = 0.0;
414 translate[2] = 0.0;
415 translate[3] = 1.0;
416 translate[4] = offsetX;
417 translate[5] = offsetY;
419 if(order == MatrixOrderAppend)
420 matrix_multiply(matrix->matrix, translate, matrix->matrix);
421 else if (order == MatrixOrderPrepend)
422 matrix_multiply(translate, matrix->matrix, matrix->matrix);
423 else
424 return InvalidParameter;
426 return Ok;
429 GpStatus WINGDIPAPI GdipVectorTransformMatrixPoints(GpMatrix *matrix, GpPointF *pts, INT count)
431 REAL x, y;
432 INT i;
434 TRACE("(%p, %p, %d)\n", matrix, pts, count);
436 if(!matrix || !pts || count <= 0)
437 return InvalidParameter;
439 for(i = 0; i < count; i++)
441 x = pts[i].X;
442 y = pts[i].Y;
444 pts[i].X = x * matrix->matrix[0] + y * matrix->matrix[2];
445 pts[i].Y = x * matrix->matrix[1] + y * matrix->matrix[3];
448 return Ok;
451 GpStatus WINGDIPAPI GdipVectorTransformMatrixPointsI(GpMatrix *matrix, GpPoint *pts, INT count)
453 GpPointF *ptsF;
454 GpStatus ret;
455 INT i;
457 TRACE("(%p, %p, %d)\n", matrix, pts, count);
459 if(count <= 0)
460 return InvalidParameter;
462 ptsF = GdipAlloc(sizeof(GpPointF) * count);
463 if(!ptsF)
464 return OutOfMemory;
466 for(i = 0; i < count; i++){
467 ptsF[i].X = (REAL)pts[i].X;
468 ptsF[i].Y = (REAL)pts[i].Y;
471 ret = GdipVectorTransformMatrixPoints(matrix, ptsF, count);
472 /* store back */
473 if(ret == Ok)
474 for(i = 0; i < count; i++){
475 pts[i].X = roundr(ptsF[i].X);
476 pts[i].Y = roundr(ptsF[i].Y);
478 GdipFree(ptsF);
480 return ret;
483 GpStatus WINGDIPAPI GdipIsMatrixEqual(GDIPCONST GpMatrix *matrix, GDIPCONST GpMatrix *matrix2,
484 BOOL *result)
486 TRACE("(%p, %p, %p)\n", matrix, matrix2, result);
488 if(!matrix || !matrix2 || !result)
489 return InvalidParameter;
490 /* based on single array member of GpMatrix */
491 *result = (memcmp(matrix->matrix, matrix2->matrix, sizeof(GpMatrix)) == 0);
493 return Ok;
496 GpStatus WINGDIPAPI GdipIsMatrixIdentity(GDIPCONST GpMatrix *matrix, BOOL *result)
498 GpMatrix *e;
499 GpStatus ret;
500 BOOL isIdentity;
502 TRACE("(%p, %p)\n", matrix, result);
504 if(!matrix || !result)
505 return InvalidParameter;
507 ret = GdipCreateMatrix(&e);
508 if(ret != Ok) return ret;
510 ret = GdipIsMatrixEqual(matrix, e, &isIdentity);
511 if(ret == Ok)
512 *result = isIdentity;
514 GdipFree(e);
516 return ret;