1 /*
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 
17 #include "DamageAccumulator.h"
18 
19 #include <log/log.h>
20 
21 #include "RenderNode.h"
22 #include "utils/MathUtils.h"
23 
24 namespace android {
25 namespace uirenderer {
26 
27 enum TransformType {
28     TransformInvalid = 0,
29     TransformRenderNode,
30     TransformMatrix4,
31     TransformNone,
32 };
33 
34 struct DirtyStack {
35     TransformType type;
36     union {
37         const RenderNode* renderNode;
38         const Matrix4* matrix4;
39     };
40     // 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 
DamageAccumulator()47 DamageAccumulator::DamageAccumulator() {
48     mHead = mAllocator.create_trivial<DirtyStack>();
49     memset(mHead, 0, sizeof(DirtyStack));
50     // Create a root that we will not pop off
51     mHead->prev = mHead;
52     mHead->type = TransformNone;
53 }
54 
computeTransformImpl(const DirtyStack * currentFrame,Matrix4 * outMatrix)55 static void computeTransformImpl(const DirtyStack* currentFrame, Matrix4* outMatrix) {
56     if (currentFrame->prev != currentFrame) {
57         computeTransformImpl(currentFrame->prev, outMatrix);
58     }
59     switch (currentFrame->type) {
60         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);
72     }
73 }
74 
computeCurrentTransform(Matrix4 * outMatrix) const75 void DamageAccumulator::computeCurrentTransform(Matrix4* outMatrix) const {
76     outMatrix->loadIdentity();
77     computeTransformImpl(mHead, outMatrix);
78 }
79 
pushCommon()80 void DamageAccumulator::pushCommon() {
81     if (!mHead->next) {
82         DirtyStack* nextFrame = mAllocator.create_trivial<DirtyStack>();
83         nextFrame->next = nullptr;
84         nextFrame->prev = mHead;
85         mHead->next = nextFrame;
86     }
87     mHead = mHead->next;
88     mHead->pendingDirty.setEmpty();
89 }
90 
pushTransform(const RenderNode * transform)91 void DamageAccumulator::pushTransform(const RenderNode* transform) {
92     pushCommon();
93     mHead->type = TransformRenderNode;
94     mHead->renderNode = transform;
95 }
96 
pushTransform(const Matrix4 * transform)97 void DamageAccumulator::pushTransform(const Matrix4* transform) {
98     pushCommon();
99     mHead->type = TransformMatrix4;
100     mHead->matrix4 = transform;
101 }
102 
popTransform()103 void DamageAccumulator::popTransform() {
104     LOG_ALWAYS_FATAL_IF(mHead->prev == mHead, "Cannot pop the root frame!");
105     DirtyStack* dirtyFrame = mHead;
106     mHead = mHead->prev;
107     switch (dirtyFrame->type) {
108         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);
119     }
120 }
121 
mapRect(const Matrix4 * matrix,const SkRect & in,SkRect * out)122 static inline void mapRect(const Matrix4* matrix, const SkRect& in, SkRect* out) {
123     if (in.isEmpty()) return;
124     Rect temp(in);
125     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     }
133     out->join({RECT_ARGS(temp)});
134 }
135 
applyMatrix4Transform(DirtyStack * frame)136 void DamageAccumulator::applyMatrix4Transform(DirtyStack* frame) {
137     mapRect(frame->matrix4, frame->pendingDirty, &mHead->pendingDirty);
138 }
139 
applyMatrix(const SkMatrix * transform,SkRect * rect)140 static inline void applyMatrix(const SkMatrix* transform, SkRect* rect) {
141     if (transform && !transform->isIdentity()) {
142         if (CC_LIKELY(!transform->hasPerspective())) {
143             transform->mapRect(rect);
144         } 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
148             rect->setLTRB(DIRTY_MIN, DIRTY_MIN, DIRTY_MAX, DIRTY_MAX);
149         }
150     }
151 }
152 
mapRect(const RenderProperties & props,const SkRect & in,SkRect * out)153 static 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     }
162     temp.offset(props.getLeft(), props.getTop());
163     out->join(temp);
164 }
165 
findParentRenderNode(DirtyStack * frame)166 static DirtyStack* findParentRenderNode(DirtyStack* frame) {
167     while (frame->prev != frame) {
168         frame = frame->prev;
169         if (frame->type == TransformRenderNode) {
170             return frame;
171         }
172     }
173     return nullptr;
174 }
175 
findProjectionReceiver(DirtyStack * frame)176 static DirtyStack* findProjectionReceiver(DirtyStack* frame) {
177     if (frame) {
178         while (frame->prev != frame) {
179             frame = frame->prev;
180             if (frame->type == TransformRenderNode && frame->renderNode->hasProjectionReceiver()) {
181                 return frame;
182             }
183         }
184     }
185     return nullptr;
186 }
187 
applyTransforms(DirtyStack * frame,DirtyStack * end)188 static 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 
applyRenderNodeTransform(DirtyStack * frame)200 void DamageAccumulator::applyRenderNodeTransform(DirtyStack* frame) {
201     if (frame->pendingDirty.isEmpty()) {
202         return;
203     }
204 
205     const RenderProperties& props = frame->renderNode->properties();
206     if (props.getAlpha() <= 0) {
207         return;
208     }
209 
210     // Perform clipping
211     if (props.getClipDamageToBounds() && !frame->pendingDirty.isEmpty()) {
212         if (!frame->pendingDirty.intersect(SkRect::MakeIWH(props.getWidth(), props.getHeight()))) {
213             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);
229         }
230 
231         frame->pendingDirty.setEmpty();
232     }
233 }
234 
dirty(float left,float top,float right,float bottom)235 void DamageAccumulator::dirty(float left, float top, float right, float bottom) {
236     mHead->pendingDirty.join({left, top, right, bottom});
237 }
238 
peekAtDirty(SkRect * dest) const239 void DamageAccumulator::peekAtDirty(SkRect* dest) const {
240     *dest = mHead->pendingDirty;
241 }
242 
finish(SkRect * totalDirty)243 void DamageAccumulator::finish(SkRect* totalDirty) {
244     LOG_ALWAYS_FATAL_IF(mHead->prev != mHead, "Cannot finish, mismatched push/pop calls! %p vs. %p",
245                         mHead->prev, mHead);
246     // Root node never has a transform, so this is the fully mapped dirty rect
247     *totalDirty = mHead->pendingDirty;
248     totalDirty->roundOut(totalDirty);
249     mHead->pendingDirty.setEmpty();
250 }
251 
252 } /* namespace uirenderer */
253 } /* namespace android */
254