blob: b39f4f20dc0dd16dc7e061b12c3454f7ba066254 [file] [log] [blame]
John Recke4267ea2014-06-03 15:53:15 -07001/*
2 * Copyright (C) 2014 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
John Recke4267ea2014-06-03 15:53:15 -070017#include "DamageAccumulator.h"
18
Mark Salyzyn52eb4e02016-09-28 16:15:30 -070019#include <log/log.h>
John Recke4267ea2014-06-03 15:53:15 -070020
21#include "RenderNode.h"
22#include "utils/MathUtils.h"
23
24namespace android {
25namespace uirenderer {
26
John Recka447d292014-06-11 18:39:44 -070027enum TransformType {
John Reck2dc223d2014-06-17 10:46:09 -070028 TransformInvalid = 0,
John Recka447d292014-06-11 18:39:44 -070029 TransformRenderNode,
30 TransformMatrix4,
John Reck25fbb3f2014-06-12 13:46:45 -070031 TransformNone,
John Recka447d292014-06-11 18:39:44 -070032};
33
John Recke4267ea2014-06-03 15:53:15 -070034struct DirtyStack {
John Recka447d292014-06-11 18:39:44 -070035 TransformType type;
36 union {
37 const RenderNode* renderNode;
38 const Matrix4* matrix4;
39 };
John Recke4267ea2014-06-03 15:53:15 -070040 // When this frame is pop'd, this rect is mapped through the above transform
41 // and applied to the previous (aka parent) frame
42 SkRect pendingDirty;
43 DirtyStack* prev;
44 DirtyStack* next;
45};
46
47DamageAccumulator::DamageAccumulator() {
John Reck7df9ff22016-02-10 16:08:08 -080048 mHead = mAllocator.create_trivial<DirtyStack>();
John Recke4267ea2014-06-03 15:53:15 -070049 memset(mHead, 0, sizeof(DirtyStack));
50 // Create a root that we will not pop off
51 mHead->prev = mHead;
John Reck2dc223d2014-06-17 10:46:09 -070052 mHead->type = TransformNone;
John Recke4267ea2014-06-03 15:53:15 -070053}
54
Chris Craik69e5adf2014-08-14 13:34:01 -070055static void computeTransformImpl(const DirtyStack* currentFrame, Matrix4* outMatrix) {
56 if (currentFrame->prev != currentFrame) {
57 computeTransformImpl(currentFrame->prev, outMatrix);
58 }
59 switch (currentFrame->type) {
John Reck1bcacfd2017-11-03 10:12:19 -070060 case TransformRenderNode:
61 currentFrame->renderNode->applyViewPropertyTransforms(*outMatrix);
62 break;
63 case TransformMatrix4:
64 outMatrix->multiply(*currentFrame->matrix4);
65 break;
66 case TransformNone:
67 // nothing to be done
68 break;
69 default:
70 LOG_ALWAYS_FATAL("Tried to compute transform with an invalid type: %d",
71 currentFrame->type);
Chris Craik69e5adf2014-08-14 13:34:01 -070072 }
73}
74
75void DamageAccumulator::computeCurrentTransform(Matrix4* outMatrix) const {
76 outMatrix->loadIdentity();
77 computeTransformImpl(mHead, outMatrix);
78}
79
John Recka447d292014-06-11 18:39:44 -070080void DamageAccumulator::pushCommon() {
John Recke4267ea2014-06-03 15:53:15 -070081 if (!mHead->next) {
John Reck7df9ff22016-02-10 16:08:08 -080082 DirtyStack* nextFrame = mAllocator.create_trivial<DirtyStack>();
Chris Craikd41c4d82015-01-05 15:51:13 -080083 nextFrame->next = nullptr;
John Recke4267ea2014-06-03 15:53:15 -070084 nextFrame->prev = mHead;
85 mHead->next = nextFrame;
86 }
87 mHead = mHead->next;
John Recke4267ea2014-06-03 15:53:15 -070088 mHead->pendingDirty.setEmpty();
89}
90
John Recka447d292014-06-11 18:39:44 -070091void DamageAccumulator::pushTransform(const RenderNode* transform) {
92 pushCommon();
93 mHead->type = TransformRenderNode;
94 mHead->renderNode = transform;
95}
96
97void DamageAccumulator::pushTransform(const Matrix4* transform) {
98 pushCommon();
99 mHead->type = TransformMatrix4;
100 mHead->matrix4 = transform;
101}
102
103void DamageAccumulator::popTransform() {
John Recke4267ea2014-06-03 15:53:15 -0700104 LOG_ALWAYS_FATAL_IF(mHead->prev == mHead, "Cannot pop the root frame!");
105 DirtyStack* dirtyFrame = mHead;
106 mHead = mHead->prev;
John Reck25fbb3f2014-06-12 13:46:45 -0700107 switch (dirtyFrame->type) {
John Reck1bcacfd2017-11-03 10:12:19 -0700108 case TransformRenderNode:
109 applyRenderNodeTransform(dirtyFrame);
110 break;
111 case TransformMatrix4:
112 applyMatrix4Transform(dirtyFrame);
113 break;
114 case TransformNone:
115 mHead->pendingDirty.join(dirtyFrame->pendingDirty);
116 break;
117 default:
118 LOG_ALWAYS_FATAL("Tried to pop an invalid type: %d", dirtyFrame->type);
John Recka447d292014-06-11 18:39:44 -0700119 }
120}
121
122static inline void mapRect(const Matrix4* matrix, const SkRect& in, SkRect* out) {
123 if (in.isEmpty()) return;
124 Rect temp(in);
John Reckc1288232015-08-12 13:39:11 -0700125 if (CC_LIKELY(!matrix->isPerspective())) {
126 matrix->mapRect(temp);
127 } else {
128 // Don't attempt to calculate damage for a perspective transform
129 // as the numbers this works with can break the perspective
130 // calculations. Just give up and expand to DIRTY_MIN/DIRTY_MAX
131 temp.set(DIRTY_MIN, DIRTY_MIN, DIRTY_MAX, DIRTY_MAX);
132 }
Mike Reed39adc882019-08-22 11:53:05 -0400133 out->join({RECT_ARGS(temp)});
John Recka447d292014-06-11 18:39:44 -0700134}
135
136void DamageAccumulator::applyMatrix4Transform(DirtyStack* frame) {
137 mapRect(frame->matrix4, frame->pendingDirty, &mHead->pendingDirty);
138}
139
John Recke2750522019-06-26 13:46:09 -0700140static inline void applyMatrix(const SkMatrix* transform, SkRect* rect) {
John Recka447d292014-06-11 18:39:44 -0700141 if (transform && !transform->isIdentity()) {
John Reckc1288232015-08-12 13:39:11 -0700142 if (CC_LIKELY(!transform->hasPerspective())) {
John Recke2750522019-06-26 13:46:09 -0700143 transform->mapRect(rect);
John Reckc1288232015-08-12 13:39:11 -0700144 } else {
145 // Don't attempt to calculate damage for a perspective transform
146 // as the numbers this works with can break the perspective
147 // calculations. Just give up and expand to DIRTY_MIN/DIRTY_MAX
Mike Reed39adc882019-08-22 11:53:05 -0400148 rect->setLTRB(DIRTY_MIN, DIRTY_MIN, DIRTY_MAX, DIRTY_MAX);
John Reckc1288232015-08-12 13:39:11 -0700149 }
John Recka447d292014-06-11 18:39:44 -0700150 }
John Recke2750522019-06-26 13:46:09 -0700151}
152
153static inline void mapRect(const RenderProperties& props, const SkRect& in, SkRect* out) {
154 if (in.isEmpty()) return;
155 SkRect temp(in);
156 applyMatrix(props.getTransformMatrix(), &temp);
157 if (props.getStaticMatrix()) {
158 applyMatrix(props.getStaticMatrix(), &temp);
159 } else if (props.getAnimationMatrix()) {
160 applyMatrix(props.getAnimationMatrix(), &temp);
161 }
John Recka447d292014-06-11 18:39:44 -0700162 temp.offset(props.getLeft(), props.getTop());
163 out->join(temp);
164}
165
166static DirtyStack* findParentRenderNode(DirtyStack* frame) {
167 while (frame->prev != frame) {
168 frame = frame->prev;
169 if (frame->type == TransformRenderNode) {
170 return frame;
John Recke4267ea2014-06-03 15:53:15 -0700171 }
John Recka447d292014-06-11 18:39:44 -0700172 }
Chris Craikd41c4d82015-01-05 15:51:13 -0800173 return nullptr;
John Recka447d292014-06-11 18:39:44 -0700174}
175
176static DirtyStack* findProjectionReceiver(DirtyStack* frame) {
177 if (frame) {
178 while (frame->prev != frame) {
179 frame = frame->prev;
John Reck1bcacfd2017-11-03 10:12:19 -0700180 if (frame->type == TransformRenderNode && frame->renderNode->hasProjectionReceiver()) {
John Recka447d292014-06-11 18:39:44 -0700181 return frame;
John Recke4267ea2014-06-03 15:53:15 -0700182 }
John Recke4267ea2014-06-03 15:53:15 -0700183 }
John Recka447d292014-06-11 18:39:44 -0700184 }
Chris Craikd41c4d82015-01-05 15:51:13 -0800185 return nullptr;
John Recka447d292014-06-11 18:39:44 -0700186}
187
188static void applyTransforms(DirtyStack* frame, DirtyStack* end) {
189 SkRect* rect = &frame->pendingDirty;
190 while (frame != end) {
191 if (frame->type == TransformRenderNode) {
192 mapRect(frame->renderNode->properties(), *rect, rect);
193 } else {
194 mapRect(frame->matrix4, *rect, rect);
195 }
196 frame = frame->prev;
197 }
198}
199
200void DamageAccumulator::applyRenderNodeTransform(DirtyStack* frame) {
201 if (frame->pendingDirty.isEmpty()) {
202 return;
203 }
204
205 const RenderProperties& props = frame->renderNode->properties();
John Reckce9f3082014-06-17 16:18:09 -0700206 if (props.getAlpha() <= 0) {
207 return;
208 }
John Recka447d292014-06-11 18:39:44 -0700209
210 // Perform clipping
John Reck293e8682014-06-17 10:34:02 -0700211 if (props.getClipDamageToBounds() && !frame->pendingDirty.isEmpty()) {
Mike Reed39adc882019-08-22 11:53:05 -0400212 if (!frame->pendingDirty.intersect(SkRect::MakeIWH(props.getWidth(), props.getHeight()))) {
John Recka447d292014-06-11 18:39:44 -0700213 frame->pendingDirty.setEmpty();
214 }
215 }
216
217 // apply all transforms
218 mapRect(props, frame->pendingDirty, &mHead->pendingDirty);
219
220 // project backwards if necessary
221 if (props.getProjectBackwards() && !frame->pendingDirty.isEmpty()) {
222 // First, find our parent RenderNode:
223 DirtyStack* parentNode = findParentRenderNode(frame);
224 // Find our parent's projection receiver, which is what we project onto
225 DirtyStack* projectionReceiver = findProjectionReceiver(parentNode);
226 if (projectionReceiver) {
227 applyTransforms(frame, projectionReceiver);
228 projectionReceiver->pendingDirty.join(frame->pendingDirty);
John Recka447d292014-06-11 18:39:44 -0700229 }
230
231 frame->pendingDirty.setEmpty();
John Recke4267ea2014-06-03 15:53:15 -0700232 }
233}
234
235void DamageAccumulator::dirty(float left, float top, float right, float bottom) {
Mike Reed39adc882019-08-22 11:53:05 -0400236 mHead->pendingDirty.join({left, top, right, bottom});
John Recke4267ea2014-06-03 15:53:15 -0700237}
238
Chris Craikc71bfca2014-08-21 10:18:58 -0700239void DamageAccumulator::peekAtDirty(SkRect* dest) const {
John Reck25fbb3f2014-06-12 13:46:45 -0700240 *dest = mHead->pendingDirty;
241}
242
John Recke4267ea2014-06-03 15:53:15 -0700243void DamageAccumulator::finish(SkRect* totalDirty) {
John Reck1bcacfd2017-11-03 10:12:19 -0700244 LOG_ALWAYS_FATAL_IF(mHead->prev != mHead, "Cannot finish, mismatched push/pop calls! %p vs. %p",
245 mHead->prev, mHead);
John Recke4267ea2014-06-03 15:53:15 -0700246 // Root node never has a transform, so this is the fully mapped dirty rect
247 *totalDirty = mHead->pendingDirty;
Mike Reed71487eb2014-11-19 16:13:20 -0500248 totalDirty->roundOut(totalDirty);
John Recke4267ea2014-06-03 15:53:15 -0700249 mHead->pendingDirty.setEmpty();
250}
251
252} /* namespace uirenderer */
253} /* namespace android */