blob: 2e1872e6444746811ff091c604e21e7289aedaab [file] [log] [blame]
reed@google.com8260a892011-06-13 14:02:52 +00001/*
epoger@google.comec3ed6a2011-07-28 14:26:00 +00002 * Copyright 2011 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
reed@google.com8260a892011-06-13 14:02:52 +00006 */
7
reed@google.com8260a892011-06-13 14:02:52 +00008#ifndef SkMatrix44_DEFINED
9#define SkMatrix44_DEFINED
10
11#include "SkMatrix.h"
12#include "SkScalar.h"
13
reed@google.com8260a892011-06-13 14:02:52 +000014#ifdef SK_MSCALAR_IS_DOUBLE
reed@google.com7d683352012-12-03 21:19:52 +000015#ifdef SK_MSCALAR_IS_FLOAT
16 #error "can't define MSCALAR both as DOUBLE and FLOAT"
17#endif
reed@google.com8260a892011-06-13 14:02:52 +000018 typedef double SkMScalar;
reed@google.com7d683352012-12-03 21:19:52 +000019 typedef int64_t SkMIntScalar;
20
reed@google.com8260a892011-06-13 14:02:52 +000021 static inline double SkFloatToMScalar(float x) {
22 return static_cast<double>(x);
23 }
24 static inline float SkMScalarToFloat(double x) {
25 return static_cast<float>(x);
26 }
27 static inline double SkDoubleToMScalar(double x) {
28 return x;
29 }
30 static inline double SkMScalarToDouble(double x) {
31 return x;
32 }
33 static const SkMScalar SK_MScalarPI = 3.141592653589793;
vollick@chromium.org5596a692012-11-13 20:12:00 +000034#elif defined SK_MSCALAR_IS_FLOAT
reed@google.com7d683352012-12-03 21:19:52 +000035#ifdef SK_MSCALAR_IS_DOUBLE
36 #error "can't define MSCALAR both as DOUBLE and FLOAT"
37#endif
reed@google.com8260a892011-06-13 14:02:52 +000038 typedef float SkMScalar;
reed@google.com7d683352012-12-03 21:19:52 +000039 typedef int32_t SkMIntScalar;
skia.committer@gmail.com0264fb42012-12-06 02:01:25 +000040
reed@google.com8260a892011-06-13 14:02:52 +000041 static inline float SkFloatToMScalar(float x) {
42 return x;
43 }
44 static inline float SkMScalarToFloat(float x) {
45 return x;
46 }
47 static inline float SkDoubleToMScalar(double x) {
48 return static_cast<float>(x);
49 }
50 static inline double SkMScalarToDouble(float x) {
51 return static_cast<double>(x);
52 }
53 static const SkMScalar SK_MScalarPI = 3.14159265f;
54#endif
55
reed@google.com20d44672012-11-09 21:28:55 +000056#define SkMScalarToScalar SkMScalarToFloat
57#define SkScalarToMScalar SkFloatToMScalar
bsalomon@google.com72e49b82011-10-27 21:47:03 +000058
reed@google.com8260a892011-06-13 14:02:52 +000059static const SkMScalar SK_MScalar1 = 1;
60
61///////////////////////////////////////////////////////////////////////////////
62
63struct SkVector4 {
64 SkScalar fData[4];
65
66 SkVector4() {
67 this->set(0, 0, 0, 1);
68 }
69 SkVector4(const SkVector4& src) {
70 memcpy(fData, src.fData, sizeof(fData));
71 }
72 SkVector4(SkScalar x, SkScalar y, SkScalar z, SkScalar w = SK_Scalar1) {
73 fData[0] = x;
74 fData[1] = y;
75 fData[2] = z;
76 fData[3] = w;
77 }
78
79 SkVector4& operator=(const SkVector4& src) {
80 memcpy(fData, src.fData, sizeof(fData));
81 return *this;
82 }
83
84 bool operator==(const SkVector4& v) {
85 return fData[0] == v.fData[0] && fData[1] == v.fData[1] &&
86 fData[2] == v.fData[2] && fData[3] == v.fData[3];
87 }
88 bool operator!=(const SkVector4& v) {
89 return !(*this == v);
90 }
91 bool equals(SkScalar x, SkScalar y, SkScalar z, SkScalar w = SK_Scalar1) {
92 return fData[0] == x && fData[1] == y &&
93 fData[2] == z && fData[3] == w;
94 }
95
96 void set(SkScalar x, SkScalar y, SkScalar z, SkScalar w = SK_Scalar1) {
97 fData[0] = x;
98 fData[1] = y;
99 fData[2] = z;
100 fData[3] = w;
101 }
102};
103
reed@google.com65d8bb02011-07-05 19:12:59 +0000104class SK_API SkMatrix44 {
reed@google.com8260a892011-06-13 14:02:52 +0000105public:
reed@google.com7d683352012-12-03 21:19:52 +0000106 SkMatrix44() { this->setIdentity(); }
reed@google.com8260a892011-06-13 14:02:52 +0000107 SkMatrix44(const SkMatrix44&);
108 SkMatrix44(const SkMatrix44& a, const SkMatrix44& b);
109
110 SkMatrix44& operator=(const SkMatrix44& src) {
reed@google.com7d683352012-12-03 21:19:52 +0000111 SkASSERT(sizeof(src) == sizeof(fMat) + sizeof(SkMIntScalar));
reed@google.com8260a892011-06-13 14:02:52 +0000112 memcpy(this, &src, sizeof(*this));
113 return *this;
114 }
115
reed@google.com631940c2012-11-27 13:13:22 +0000116 bool operator==(const SkMatrix44& other) const;
reed@google.com8260a892011-06-13 14:02:52 +0000117 bool operator!=(const SkMatrix44& other) const {
reed@google.com631940c2012-11-27 13:13:22 +0000118 return !(other == *this);
reed@google.com8260a892011-06-13 14:02:52 +0000119 }
120
121 SkMatrix44(const SkMatrix&);
122 SkMatrix44& operator=(const SkMatrix& src);
123 operator SkMatrix() const;
124
reed@google.com7d683352012-12-03 21:19:52 +0000125 /**
126 * Return a reference to a const identity matrix
127 */
128 static const SkMatrix44& I();
129
130 enum TypeMask {
131 kIdentity_Mask = 0,
132 kTranslate_Mask = 0x01, //!< set if the matrix has translation
133 kScale_Mask = 0x02, //!< set if the matrix has any scale != 1
134 kAffine_Mask = 0x04, //!< set if the matrix skews or rotates
135 kPerspective_Mask = 0x08 //!< set if the matrix is in perspective
136 };
skia.committer@gmail.com0264fb42012-12-06 02:01:25 +0000137
reed@google.com7d683352012-12-03 21:19:52 +0000138 /**
139 * Returns a bitfield describing the transformations the matrix may
140 * perform. The bitfield is computed conservatively, so it may include
141 * false positives. For example, when kPerspective_Mask is true, all
142 * other bits may be set to true even in the case of a pure perspective
143 * transform.
144 */
145 inline TypeMask getType() const {
146 if (fTypeMask & kUnknown_Mask) {
147 fTypeMask = this->computeTypeMask();
148 }
149 SkASSERT(!(fTypeMask & kUnknown_Mask));
150 return (TypeMask)fTypeMask;
151 }
152
153 inline bool isIdentity() const {
154 return 0 == this->getType();
155 }
skia.committer@gmail.com0264fb42012-12-06 02:01:25 +0000156
reed@google.com7d683352012-12-03 21:19:52 +0000157 void setIdentity();
158 inline void reset() { this->setIdentity();}
159
160 /**
161 * get a value from the matrix. The row,col parameters work as follows:
162 * (0, 0) scale-x
163 * (0, 3) translate-x
164 * (3, 0) perspective-x
165 */
166 inline SkMScalar get(int row, int col) const {
reed@google.com631940c2012-11-27 13:13:22 +0000167 SkASSERT((unsigned)row <= 3);
168 SkASSERT((unsigned)col <= 3);
169 return fMat[col][row];
170 }
reed@google.com8260a892011-06-13 14:02:52 +0000171
reed@google.com7d683352012-12-03 21:19:52 +0000172 /**
173 * set a value in the matrix. The row,col parameters work as follows:
174 * (0, 0) scale-x
175 * (0, 3) translate-x
176 * (3, 0) perspective-x
177 */
178 inline void set(int row, int col, SkMScalar value) {
reed@google.com631940c2012-11-27 13:13:22 +0000179 SkASSERT((unsigned)row <= 3);
180 SkASSERT((unsigned)col <= 3);
181 fMat[col][row] = value;
reed@google.com7d683352012-12-03 21:19:52 +0000182 this->dirtyTypeMask();
reed@google.com631940c2012-11-27 13:13:22 +0000183 }
skia.committer@gmail.comab38f7a2012-11-28 02:02:11 +0000184
reed@google.com7d683352012-12-03 21:19:52 +0000185 inline double getDouble(int row, int col) const {
vollick@chromium.org9b21c252012-11-14 21:33:55 +0000186 return SkMScalarToDouble(this->get(row, col));
187 }
reed@google.com7d683352012-12-03 21:19:52 +0000188 inline void setDouble(int row, int col, double value) {
vollick@chromium.org9b21c252012-11-14 21:33:55 +0000189 this->set(row, col, SkDoubleToMScalar(value));
190 }
191
vollick@chromium.orgf11cf9f2012-11-19 21:02:06 +0000192 /** These methods allow one to efficiently read matrix entries into an
193 * array. The given array must have room for exactly 16 entries. Whenever
194 * possible, they will try to use memcpy rather than an entry-by-entry
195 * copy.
196 */
reed@google.comda9fac02011-06-13 14:46:52 +0000197 void asColMajorf(float[]) const;
198 void asColMajord(double[]) const;
199 void asRowMajorf(float[]) const;
200 void asRowMajord(double[]) const;
201
vollick@chromium.orgf11cf9f2012-11-19 21:02:06 +0000202 /** These methods allow one to efficiently set all matrix entries from an
203 * array. The given array must have room for exactly 16 entries. Whenever
204 * possible, they will try to use memcpy rather than an entry-by-entry
205 * copy.
206 */
207 void setColMajorf(const float[]);
208 void setColMajord(const double[]);
209 void setRowMajorf(const float[]);
210 void setRowMajord(const double[]);
211
reed@google.com7d683352012-12-03 21:19:52 +0000212#ifdef SK_MSCALAR_IS_FLOAT
213 void setColMajor(const SkMScalar data[]) { this->setColMajorf(data); }
214 void setRowMajor(const SkMScalar data[]) { this->setRowMajorf(data); }
215#else
216 void setColMajor(const SkMScalar data[]) { this->setColMajord(data); }
217 void setRowMajor(const SkMScalar data[]) { this->setRowMajord(data); }
218#endif
reed@google.com8260a892011-06-13 14:02:52 +0000219
220 void set3x3(SkMScalar m00, SkMScalar m01, SkMScalar m02,
221 SkMScalar m10, SkMScalar m11, SkMScalar m12,
222 SkMScalar m20, SkMScalar m21, SkMScalar m22);
223
224 void setTranslate(SkMScalar dx, SkMScalar dy, SkMScalar dz);
225 void preTranslate(SkMScalar dx, SkMScalar dy, SkMScalar dz);
226 void postTranslate(SkMScalar dx, SkMScalar dy, SkMScalar dz);
227
228 void setScale(SkMScalar sx, SkMScalar sy, SkMScalar sz);
229 void preScale(SkMScalar sx, SkMScalar sy, SkMScalar sz);
230 void postScale(SkMScalar sx, SkMScalar sy, SkMScalar sz);
231
reed@google.com7d683352012-12-03 21:19:52 +0000232 inline void setScale(SkMScalar scale) {
reed@google.com8260a892011-06-13 14:02:52 +0000233 this->setScale(scale, scale, scale);
234 }
reed@google.com7d683352012-12-03 21:19:52 +0000235 inline void preScale(SkMScalar scale) {
reed@google.com8260a892011-06-13 14:02:52 +0000236 this->preScale(scale, scale, scale);
237 }
reed@google.com7d683352012-12-03 21:19:52 +0000238 inline void postScale(SkMScalar scale) {
reed@google.com8260a892011-06-13 14:02:52 +0000239 this->postScale(scale, scale, scale);
240 }
241
242 void setRotateDegreesAbout(SkMScalar x, SkMScalar y, SkMScalar z,
243 SkMScalar degrees) {
244 this->setRotateAbout(x, y, z, degrees * SK_MScalarPI / 180);
245 }
246
247 /** Rotate about the vector [x,y,z]. If that vector is not unit-length,
248 it will be automatically resized.
249 */
250 void setRotateAbout(SkMScalar x, SkMScalar y, SkMScalar z,
251 SkMScalar radians);
252 /** Rotate about the vector [x,y,z]. Does not check the length of the
253 vector, assuming it is unit-length.
254 */
255 void setRotateAboutUnit(SkMScalar x, SkMScalar y, SkMScalar z,
256 SkMScalar radians);
257
258 void setConcat(const SkMatrix44& a, const SkMatrix44& b);
reed@google.com7d683352012-12-03 21:19:52 +0000259 inline void preConcat(const SkMatrix44& m) {
reed@google.com8260a892011-06-13 14:02:52 +0000260 this->setConcat(*this, m);
261 }
reed@google.com7d683352012-12-03 21:19:52 +0000262 inline void postConcat(const SkMatrix44& m) {
reed@google.com8260a892011-06-13 14:02:52 +0000263 this->setConcat(m, *this);
264 }
265
266 friend SkMatrix44 operator*(const SkMatrix44& a, const SkMatrix44& b) {
267 return SkMatrix44(a, b);
268 }
269
270 /** If this is invertible, return that in inverse and return true. If it is
271 not invertible, return false and ignore the inverse parameter.
272 */
273 bool invert(SkMatrix44* inverse) const;
274
vollick@chromium.org9b21c252012-11-14 21:33:55 +0000275 /** Transpose this matrix in place. */
276 void transpose();
277
reed@google.com8260a892011-06-13 14:02:52 +0000278 /** Apply the matrix to the src vector, returning the new vector in dst.
279 It is legal for src and dst to point to the same memory.
280 */
reed@google.com1ea95be2012-11-09 21:39:48 +0000281 void mapScalars(const SkScalar src[4], SkScalar dst[4]) const;
reed@google.com7d683352012-12-03 21:19:52 +0000282 inline void mapScalars(SkScalar vec[4]) const {
reed@google.com1ea95be2012-11-09 21:39:48 +0000283 this->mapScalars(vec, vec);
284 }
285
286 // DEPRECATED: call mapScalars()
287 void map(const SkScalar src[4], SkScalar dst[4]) const {
288 this->mapScalars(src, dst);
289 }
290 // DEPRECATED: call mapScalars()
reed@google.com8260a892011-06-13 14:02:52 +0000291 void map(SkScalar vec[4]) const {
reed@google.com1ea95be2012-11-09 21:39:48 +0000292 this->mapScalars(vec, vec);
293 }
294
295#ifdef SK_MSCALAR_IS_DOUBLE
reed@google.comdd311312012-11-12 20:43:59 +0000296 void mapMScalars(const SkMScalar src[4], SkMScalar dst[4]) const;
vollick@chromium.org5596a692012-11-13 20:12:00 +0000297#elif defined SK_MSCALAR_IS_FLOAT
reed@google.com7d683352012-12-03 21:19:52 +0000298 inline void mapMScalars(const SkMScalar src[4], SkMScalar dst[4]) const {
reed@google.com1ea95be2012-11-09 21:39:48 +0000299 this->mapScalars(src, dst);
300 }
301#endif
reed@google.com7d683352012-12-03 21:19:52 +0000302 inline void mapMScalars(SkMScalar vec[4]) const {
reed@google.com1ea95be2012-11-09 21:39:48 +0000303 this->mapMScalars(vec, vec);
reed@google.com8260a892011-06-13 14:02:52 +0000304 }
305
306 friend SkVector4 operator*(const SkMatrix44& m, const SkVector4& src) {
307 SkVector4 dst;
308 m.map(src.fData, dst.fData);
309 return dst;
310 }
311
reed@google.com99b5c7f2012-12-05 22:13:59 +0000312 /**
313 * map an array of [x, y, 0, 1] through the matrix, returning an array
314 * of [x', y', z', w'].
315 *
316 * @param src2 array of [x, y] pairs, with implied z=0 and w=1
317 * @param count number of [x, y] pairs in src2
318 * @param dst4 array of [x', y', z', w'] quads as the output.
319 */
320 void map2(const float src2[], int count, float dst4[]) const;
321 void map2(const double src2[], int count, double dst4[]) const;
322
reed@google.com8260a892011-06-13 14:02:52 +0000323 void dump() const;
324
vollick@chromium.org3959a762012-11-13 15:08:22 +0000325 double determinant() const;
326
reed@google.com8260a892011-06-13 14:02:52 +0000327private:
reed@google.com7d683352012-12-03 21:19:52 +0000328 SkMScalar fMat[4][4];
329 // we use SkMIntScalar instead of just int, as we want to ensure that
330 // we are always packed with no extra bits, allowing us to call memcpy
331 // without fear of copying uninitialized bits.
332 mutable SkMIntScalar fTypeMask;
skia.committer@gmail.com0264fb42012-12-06 02:01:25 +0000333
reed@google.com7d683352012-12-03 21:19:52 +0000334 enum {
335 kUnknown_Mask = 0x80,
jamesr@chromium.orgdeb4c162012-11-29 21:17:16 +0000336
reed@google.com7d683352012-12-03 21:19:52 +0000337 kAllPublic_Masks = 0xF
338 };
339
340 SkMScalar transX() const { return fMat[3][0]; }
341 SkMScalar transY() const { return fMat[3][1]; }
342 SkMScalar transZ() const { return fMat[3][2]; }
343
344 SkMScalar scaleX() const { return fMat[0][0]; }
345 SkMScalar scaleY() const { return fMat[1][1]; }
346 SkMScalar scaleZ() const { return fMat[2][2]; }
skia.committer@gmail.com0264fb42012-12-06 02:01:25 +0000347
reed@google.com7d683352012-12-03 21:19:52 +0000348 SkMScalar perspX() const { return fMat[0][3]; }
349 SkMScalar perspY() const { return fMat[1][3]; }
350 SkMScalar perspZ() const { return fMat[2][3]; }
351
352 int computeTypeMask() const;
353
354 inline void dirtyTypeMask() {
355 fTypeMask = kUnknown_Mask;
356 }
357
358 inline void setTypeMask(int mask) {
359 SkASSERT(0 == (~(kAllPublic_Masks | kUnknown_Mask) & mask));
360 fTypeMask = mask;
361 }
362
363 /**
364 * Does not take the time to 'compute' the typemask. Only returns true if
365 * we already know that this matrix is identity.
366 */
367 inline bool isTriviallyIdentity() const {
368 return 0 == fTypeMask;
369 }
reed@google.com8260a892011-06-13 14:02:52 +0000370};
371
372#endif