OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2014 Google Inc. | 2 * Copyright 2014 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #include "SkPatch.h" | 8 #include "SkPatch.h" |
9 | 9 |
10 #include "SkGeometry.h" | 10 #include "SkGeometry.h" |
(...skipping 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
113 fCornerColors[2] = SkPreMultiplyColor(colors[2]); | 113 fCornerColors[2] = SkPreMultiplyColor(colors[2]); |
114 fCornerColors[3] = SkPreMultiplyColor(colors[3]); | 114 fCornerColors[3] = SkPreMultiplyColor(colors[3]); |
115 } | 115 } |
116 | 116 |
117 uint8_t bilinear(SkScalar tx, SkScalar ty, SkScalar c00, SkScalar c10, SkScalar
c01, SkScalar c11) { | 117 uint8_t bilinear(SkScalar tx, SkScalar ty, SkScalar c00, SkScalar c10, SkScalar
c01, SkScalar c11) { |
118 SkScalar a = c00 * (1.f - tx) + c10 * tx; | 118 SkScalar a = c00 * (1.f - tx) + c10 * tx; |
119 SkScalar b = c01 * (1.f - tx) + c11 * tx; | 119 SkScalar b = c01 * (1.f - tx) + c11 * tx; |
120 return uint8_t(a * (1.f - ty) + b * ty); | 120 return uint8_t(a * (1.f - ty) + b * ty); |
121 } | 121 } |
122 | 122 |
123 bool SkPatch::getVertexData(SkPatch::VertexData* data, int divisions) { | 123 bool SkPatch::getVertexData(SkPatch::VertexData* data, int lodX, int lodY) const
{ |
124 | 124 |
125 if (divisions < 1) { | 125 if (lodX < 1 || lodY < 1) { |
126 return false; | 126 return false; |
127 } | 127 } |
128 | 128 |
129 int divX = divisions, divY = divisions; | 129 data->fVertexCount = (lodX + 1) * (lodY + 1); |
130 | 130 data->fIndexCount = lodX * lodY * 6; |
131 data->fVertexCount = (divX + 1) * (divY + 1); | |
132 data->fIndexCount = divX * divY * 6; | |
133 | 131 |
134 data->fPoints = SkNEW_ARRAY(SkPoint, data->fVertexCount); | 132 data->fPoints = SkNEW_ARRAY(SkPoint, data->fVertexCount); |
135 data->fColors = SkNEW_ARRAY(uint32_t, data->fVertexCount); | 133 data->fColors = SkNEW_ARRAY(uint32_t, data->fVertexCount); |
136 data->fTexCoords = SkNEW_ARRAY(SkPoint, data->fVertexCount); | 134 data->fTexCoords = SkNEW_ARRAY(SkPoint, data->fVertexCount); |
137 data->fIndices = SkNEW_ARRAY(uint16_t, data->fIndexCount); | 135 data->fIndices = SkNEW_ARRAY(uint16_t, data->fIndexCount); |
138 | 136 |
139 FwDCubicEvaluator fBottom(fCtrlPoints[kBottomP0_CubicCtrlPts], | 137 FwDCubicEvaluator fBottom(fCtrlPoints[kBottomP0_CubicCtrlPts], |
140 fCtrlPoints[kBottomP1_CubicCtrlPts], | 138 fCtrlPoints[kBottomP1_CubicCtrlPts], |
141 fCtrlPoints[kBottomP2_CubicCtrlPts], | 139 fCtrlPoints[kBottomP2_CubicCtrlPts], |
142 fCtrlPoints[kBottomP3_CubicCtrlPts]), | 140 fCtrlPoints[kBottomP3_CubicCtrlPts]), |
143 fTop(fCtrlPoints[kTopP0_CubicCtrlPts], | 141 fTop(fCtrlPoints[kTopP0_CubicCtrlPts], |
144 fCtrlPoints[kTopP1_CubicCtrlPts], | 142 fCtrlPoints[kTopP1_CubicCtrlPts], |
145 fCtrlPoints[kTopP2_CubicCtrlPts], | 143 fCtrlPoints[kTopP2_CubicCtrlPts], |
146 fCtrlPoints[kTopP2_CubicCtrlPts]), | 144 fCtrlPoints[kTopP2_CubicCtrlPts]), |
147 fLeft(fCtrlPoints[kLeftP0_CubicCtrlPts], | 145 fLeft(fCtrlPoints[kLeftP0_CubicCtrlPts], |
148 fCtrlPoints[kLeftP1_CubicCtrlPts], | 146 fCtrlPoints[kLeftP1_CubicCtrlPts], |
149 fCtrlPoints[kLeftP2_CubicCtrlPts], | 147 fCtrlPoints[kLeftP2_CubicCtrlPts], |
150 fCtrlPoints[kLeftP3_CubicCtrlPts]), | 148 fCtrlPoints[kLeftP3_CubicCtrlPts]), |
151 fRight(fCtrlPoints[kRightP0_CubicCtrlPts], | 149 fRight(fCtrlPoints[kRightP0_CubicCtrlPts], |
152 fCtrlPoints[kRightP1_CubicCtrlPts], | 150 fCtrlPoints[kRightP1_CubicCtrlPts], |
153 fCtrlPoints[kRightP2_CubicCtrlPts], | 151 fCtrlPoints[kRightP2_CubicCtrlPts], |
154 fCtrlPoints[kRightP3_CubicCtrlPts]); | 152 fCtrlPoints[kRightP3_CubicCtrlPts]); |
155 | 153 |
156 fBottom.restart(divX); | 154 fBottom.restart(lodX); |
157 fTop.restart(divX); | 155 fTop.restart(lodX); |
158 | 156 |
159 SkScalar u = 0.0f; | 157 SkScalar u = 0.0f; |
160 int stride = divY + 1; | 158 int stride = lodY + 1; |
161 for (int x = 0; x <= divX; x++) { | 159 for (int x = 0; x <= lodX; x++) { |
162 SkPoint bottom = fBottom.next(), top = fTop.next(); | 160 SkPoint bottom = fBottom.next(), top = fTop.next(); |
163 fLeft.restart(divY); | 161 fLeft.restart(lodY); |
164 fRight.restart(divY); | 162 fRight.restart(lodY); |
165 SkScalar v = 0.f; | 163 SkScalar v = 0.f; |
166 for (int y = 0; y <= divY; y++) { | 164 for (int y = 0; y <= lodY; y++) { |
167 int dataIndex = x * (divX + 1) + y; | 165 int dataIndex = x * (lodY + 1) + y; |
168 | 166 |
169 SkPoint left = fLeft.next(), right = fRight.next(); | 167 SkPoint left = fLeft.next(), right = fRight.next(); |
170 | 168 |
171 SkPoint s0 = SkPoint::Make((1.0f - v) * top.x() + v * bottom.x(), | 169 SkPoint s0 = SkPoint::Make((1.0f - v) * top.x() + v * bottom.x(), |
172 (1.0f - v) * top.y() + v * bottom.y()); | 170 (1.0f - v) * top.y() + v * bottom.y()); |
173 SkPoint s1 = SkPoint::Make((1.0f - u) * left.x() + u * right.x(), | 171 SkPoint s1 = SkPoint::Make((1.0f - u) * left.x() + u * right.x(), |
174 (1.0f - u) * left.y() + u * right.y()); | 172 (1.0f - u) * left.y() + u * right.y()); |
175 SkPoint s2 = SkPoint::Make( | 173 SkPoint s2 = SkPoint::Make( |
176 (1.0f - v) * ((1.0f - u) * fTop.getCtrlPo
ints()[0].x() | 174 (1.0f - v) * ((1.0f - u) * fTop.getCtrlPo
ints()[0].x() |
177 + u * fTop.getCtrlPoints()[3].x()) | 175 + u * fTop.getCtrlPoints()[3].x()) |
(...skipping 22 matching lines...) Expand all Loading... |
200 SkScalar(SkColorGetG(fCornerColors[3]))); | 198 SkScalar(SkColorGetG(fCornerColors[3]))); |
201 uint8_t b = bilinear(u, v, | 199 uint8_t b = bilinear(u, v, |
202 SkScalar(SkColorGetB(fCornerColors[0])), | 200 SkScalar(SkColorGetB(fCornerColors[0])), |
203 SkScalar(SkColorGetB(fCornerColors[1])), | 201 SkScalar(SkColorGetB(fCornerColors[1])), |
204 SkScalar(SkColorGetB(fCornerColors[2])), | 202 SkScalar(SkColorGetB(fCornerColors[2])), |
205 SkScalar(SkColorGetB(fCornerColors[3]))); | 203 SkScalar(SkColorGetB(fCornerColors[3]))); |
206 data->fColors[dataIndex] = SkPackARGB32(a,r,g,b); | 204 data->fColors[dataIndex] = SkPackARGB32(a,r,g,b); |
207 | 205 |
208 data->fTexCoords[dataIndex] = SkPoint::Make(u, v); | 206 data->fTexCoords[dataIndex] = SkPoint::Make(u, v); |
209 | 207 |
210 if(x < divX && y < divY) { | 208 if(x < lodX && y < lodY) { |
211 int i = 6 * (x * divY + y); | 209 int i = 6 * (x * lodY + y); |
212 data->fIndices[i] = x * stride + y; | 210 data->fIndices[i] = x * stride + y; |
213 data->fIndices[i + 1] = x * stride + 1 + y; | 211 data->fIndices[i + 1] = x * stride + 1 + y; |
214 data->fIndices[i + 2] = (x + 1) * stride + 1 + y; | 212 data->fIndices[i + 2] = (x + 1) * stride + 1 + y; |
215 data->fIndices[i + 3] = data->fIndices[i]; | 213 data->fIndices[i + 3] = data->fIndices[i]; |
216 data->fIndices[i + 4] = data->fIndices[i + 2]; | 214 data->fIndices[i + 4] = data->fIndices[i + 2]; |
217 data->fIndices[i + 5] = (x + 1) * stride + y; | 215 data->fIndices[i + 5] = (x + 1) * stride + y; |
218 } | 216 } |
219 v += 1.f / divY; | 217 v += 1.f / lodY; |
220 } | 218 } |
221 u += 1.f / divX; | 219 u += 1.f / lodX; |
222 } | 220 } |
223 return true; | 221 return true; |
224 } | 222 } |
OLD | NEW |