2 * Copyright (C) 2010 The Android Open Source Project
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
8 * http://www.apache.org/licenses/LICENSE-2.0
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.
21 #include <utils/Log.h>
30 namespace uirenderer {
32 #define RECT_STRING "%5.2f %5.2f %5.2f %5.2f"
33 #define RECT_ARGS(r) \
34 (r).left, (r).top, (r).right, (r).bottom
35 #define SK_RECT_ARGS(r) \
36 (r).left(), (r).top(), (r).right(), (r).bottom()
38 ///////////////////////////////////////////////////////////////////////////////
40 ///////////////////////////////////////////////////////////////////////////////
50 typedef float value_type;
52 // we don't provide copy-ctor and operator= on purpose
53 // because we want the compiler generated versions
62 inline Rect(float left, float top, float right, float bottom):
69 inline Rect(float width, float height):
76 inline Rect(const SkRect& rect):
80 bottom(rect.fBottom) {
83 friend int operator==(const Rect& a, const Rect& b) {
84 return !memcmp(&a, &b, sizeof(a));
87 friend int operator!=(const Rect& a, const Rect& b) {
88 return memcmp(&a, &b, sizeof(a));
92 left = top = right = bottom = 0.0f;
95 inline bool isEmpty() const {
96 // this is written in such way this it'll handle NANs to return
98 return !((left < right) && (top < bottom));
101 inline void setEmpty() {
102 left = top = right = bottom = 0.0f;
105 inline void set(float left, float top, float right, float bottom) {
109 this->bottom = bottom;
112 inline void set(const Rect& r) {
113 set(r.left, r.top, r.right, r.bottom);
116 inline void set(const SkIRect& r) {
117 set(r.left(), r.top(), r.right(), r.bottom());
120 inline float getWidth() const {
124 inline float getHeight() const {
128 bool intersects(float l, float t, float r, float b) const {
129 float tempLeft = std::max(left, l);
130 float tempTop = std::max(top, t);
131 float tempRight = std::min(right, r);
132 float tempBottom = std::min(bottom, b);
134 return ((tempLeft < tempRight) && (tempTop < tempBottom)); // !isEmpty
137 bool intersects(const Rect& r) const {
138 return intersects(r.left, r.top, r.right, r.bottom);
142 * This method is named 'doIntersect' instead of 'intersect' so as not to be confused with
143 * SkRect::intersect / android.graphics.Rect#intersect behavior, which do not modify the object
144 * if the intersection of the rects would be empty.
146 void doIntersect(float l, float t, float r, float b) {
147 left = std::max(left, l);
148 top = std::max(top, t);
149 right = std::min(right, r);
150 bottom = std::min(bottom, b);
153 void doIntersect(const Rect& r) {
154 doIntersect(r.left, r.top, r.right, r.bottom);
157 inline bool contains(float l, float t, float r, float b) const {
158 return l >= left && t >= top && r <= right && b <= bottom;
161 inline bool contains(const Rect& r) const {
162 return contains(r.left, r.top, r.right, r.bottom);
165 bool unionWith(const Rect& r) {
166 if (r.left < r.right && r.top < r.bottom) {
167 if (left < right && top < bottom) {
168 if (left > r.left) left = r.left;
169 if (top > r.top) top = r.top;
170 if (right < r.right) right = r.right;
171 if (bottom < r.bottom) bottom = r.bottom;
184 void translate(float dx, float dy) {
191 void inset(float delta) {
195 void outset(float delta) {
202 void outset(float xdelta, float ydelta) {
210 * Similar to snapToPixelBoundaries, but estimates bounds conservatively to handle GL rounding
213 * This function should be used whenever estimating the damage rect of geometry already mapped
216 void snapGeometryToPixelBoundaries(bool snapOut) {
218 /* For AA geometry with a ramp perimeter, don't snap by rounding - AA geometry will have
219 * a 0.5 pixel perimeter not accounted for in its bounds. Instead, snap by
220 * conservatively rounding out the bounds with floor/ceil.
222 * In order to avoid changing integer bounds with floor/ceil due to rounding errors
223 * inset the bounds first by the fudge factor. Very small fraction-of-a-pixel errors
224 * from this inset will only incur similarly small errors in output, due to transparency
225 * in extreme outside of the geometry.
227 left = floorf(left + Vertex::GeometryFudgeFactor());
228 top = floorf(top + Vertex::GeometryFudgeFactor());
229 right = ceilf(right - Vertex::GeometryFudgeFactor());
230 bottom = ceilf(bottom - Vertex::GeometryFudgeFactor());
232 /* For other geometry, we do the regular rounding in order to snap, but also outset the
233 * bounds by a fudge factor. This ensures that ambiguous geometry (e.g. a non-AA Rect
234 * with top left at (0.5, 0.5)) will err on the side of a larger damage rect.
236 left = floorf(left + 0.5f - Vertex::GeometryFudgeFactor());
237 top = floorf(top + 0.5f - Vertex::GeometryFudgeFactor());
238 right = floorf(right + 0.5f + Vertex::GeometryFudgeFactor());
239 bottom = floorf(bottom + 0.5f + Vertex::GeometryFudgeFactor());
243 void snapToPixelBoundaries() {
244 left = floorf(left + 0.5f);
245 top = floorf(top + 0.5f);
246 right = floorf(right + 0.5f);
247 bottom = floorf(bottom + 0.5f);
253 right = ceilf(right);
254 bottom = ceilf(bottom);
258 * Similar to unionWith, except this makes the assumption that both rects are non-empty
259 * to avoid both emptiness checks.
261 void expandToCover(const Rect& other) {
262 left = std::min(left, other.left);
263 top = std::min(top, other.top);
264 right = std::max(right, other.right);
265 bottom = std::max(bottom, other.bottom);
268 void expandToCover(float x, float y) {
269 left = std::min(left, x);
270 top = std::min(top, y);
271 right = std::max(right, x);
272 bottom = std::max(bottom, y);
275 SkRect toSkRect() const {
276 return SkRect::MakeLTRB(left, top, right, bottom);
279 SkIRect toSkIRect() const {
280 return SkIRect::MakeLTRB(left, top, right, bottom);
283 void dump(const char* label = nullptr) const {
284 ALOGD("%s[l=%.2f t=%.2f r=%.2f b=%.2f]", label ? label : "Rect", left, top, right, bottom);
287 friend std::ostream& operator<<(std::ostream& os, const Rect& rect) {
288 if (rect.isEmpty()) {
289 // Print empty, but continue, since empty rects may still have useful coordinate info
293 if (rect.left == 0 && rect.top == 0) {
294 return os << "[" << rect.right << " x " << rect.bottom << "]";
297 return os << "[" << rect.left
300 << " " << rect.bottom << "]";
304 }; // namespace uirenderer
305 }; // namespace android