1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
/*
* Copyright 2016 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#pragma once
#include "include/core/SkMatrix.h"
#include "include/private/SkNx.h"
#include "src/core/SkPointPriv.h"
namespace pk {
class SkMatrixPriv {
public:
enum {
// writeTo/readFromMemory will never return a value larger than this
kMaxFlattenSize = 9 * sizeof(SkScalar) + sizeof(uint32_t),
};
static size_t WriteToMemory(const SkMatrix& matrix, void* buffer) {
return matrix.writeToMemory(buffer);
}
static size_t ReadFromMemory(SkMatrix* matrix, const void* buffer, size_t length) {
return matrix->readFromMemory(buffer, length);
}
typedef SkMatrix::MapXYProc MapXYProc;
typedef SkMatrix::MapPtsProc MapPtsProc;
static MapPtsProc GetMapPtsProc(const SkMatrix& matrix) {
return SkMatrix::GetMapPtsProc(matrix.getType());
}
static MapXYProc GetMapXYProc(const SkMatrix& matrix) {
return SkMatrix::GetMapXYProc(matrix.getType());
}
/**
* Attempt to map the rect through the inverse of the matrix. If it is not invertible,
* then this returns false and dst is unchanged.
*/
static bool PK_WARN_UNUSED_RESULT InverseMapRect(const SkMatrix& mx,
SkRect* dst, const SkRect& src) {
if (mx.getType() <= SkMatrix::kTranslate_Mask) {
SkScalar tx = mx.getTranslateX();
SkScalar ty = mx.getTranslateY();
Sk4f trans(tx, ty, tx, ty);
(Sk4f::Load(&src.fLeft) - trans).store(&dst->fLeft);
return true;
}
// Insert other special-cases here (e.g. scale+translate)
// general case
SkMatrix inverse;
if (mx.invert(&inverse)) {
inverse.mapRect(dst, src);
return true;
}
return false;
}
/** Maps count pts, skipping stride bytes to advance from one SkPoint to the next.
Points are mapped by multiplying each SkPoint by SkMatrix. Given:
| A B C | | x |
Matrix = | D E F |, pt = | y |
| G H I | | 1 |
each resulting pts SkPoint is computed as:
|A B C| |x| Ax+By+C Dx+Ey+F
Matrix * pt = |D E F| |y| = |Ax+By+C Dx+Ey+F Gx+Hy+I| = ------- , -------
|G H I| |1| Gx+Hy+I Gx+Hy+I
@param mx matrix used to map the points
@param pts storage for mapped points
@param stride size of record starting with SkPoint, in bytes
@param count number of points to transform
*/
static void MapPointsWithStride(const SkMatrix& mx, SkPoint pts[], size_t stride, int count) {
SkMatrix::TypeMask tm = mx.getType();
if (SkMatrix::kIdentity_Mask == tm) {
return;
}
if (SkMatrix::kTranslate_Mask == tm) {
const SkScalar tx = mx.getTranslateX();
const SkScalar ty = mx.getTranslateY();
Sk2s trans(tx, ty);
for (int i = 0; i < count; ++i) {
(Sk2s::Load(&pts->fX) + trans).store(&pts->fX);
pts = (SkPoint*)((intptr_t)pts + stride);
}
return;
}
// Insert other special-cases here (e.g. scale+translate)
// general case
SkMatrix::MapXYProc proc = mx.getMapXYProc();
for (int i = 0; i < count; ++i) {
proc(mx, pts->fX, pts->fY, pts);
pts = (SkPoint*)((intptr_t)pts + stride);
}
}
/** Maps src SkPoint array of length count to dst SkPoint array, skipping stride bytes
to advance from one SkPoint to the next.
Points are mapped by multiplying each SkPoint by SkMatrix. Given:
| A B C | | x |
Matrix = | D E F |, src = | y |
| G H I | | 1 |
each resulting dst SkPoint is computed as:
|A B C| |x| Ax+By+C Dx+Ey+F
Matrix * pt = |D E F| |y| = |Ax+By+C Dx+Ey+F Gx+Hy+I| = ------- , -------
|G H I| |1| Gx+Hy+I Gx+Hy+I
@param mx matrix used to map the points
@param dst storage for mapped points
@param src points to transform
@param stride size of record starting with SkPoint, in bytes
@param count number of points to transform
*/
static void MapPointsWithStride(const SkMatrix& mx, SkPoint dst[], size_t dstStride,
const SkPoint src[], size_t srcStride, int count) {
for (int i = 0; i < count; ++i) {
mx.mapPoints(dst, src, 1);
src = (SkPoint*)((intptr_t)src + srcStride);
dst = (SkPoint*)((intptr_t)dst + dstStride);
}
}
static void MapHomogeneousPointsWithStride(const SkMatrix& mx, SkPoint3 dst[], size_t dstStride,
const SkPoint3 src[], size_t srcStride, int count);
static bool PostIDiv(SkMatrix* matrix, int divx, int divy) {
return matrix->postIDiv(divx, divy);
}
static bool CheapEqual(const SkMatrix& a, const SkMatrix& b) {
return &a == &b || 0 == memcmp(a.fMat, b.fMat, sizeof(a.fMat));
}
// Returns the differential area scale factor for a local point 'p' that will be transformed
// by 'm' (which may have perspective). If 'm' does not have perspective, this scale factor is
// constant regardless of 'p'; when it does have perspective, it is specific to that point.
//
// This can be crudely thought of as "device pixel area" / "local pixel area" at 'p'.
//
// Returns positive infinity if the transformed homogeneous point has w <= 0.
static SkScalar DifferentialAreaScale(const SkMatrix& m, const SkPoint& p);
};
} // namespace pk