blob: 630cebb993866f29456e9b6fa3869814fe248f15 [file] [log] [blame]
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -08001/*
2* Copyright (c) 2015, The Linux Foundation. All rights reserved.
3*
4* Redistribution and use in source and binary forms, with or without
5* modification, are permitted provided that the following conditions are
6* met:
7* * Redistributions of source code must retain the above copyright
8* notice, this list of conditions and the following disclaimer.
9* * Redistributions in binary form must reproduce the above
10* copyright notice, this list of conditions and the following
11* disclaimer in the documentation and/or other materials provided
12* with the distribution.
13* * Neither the name of The Linux Foundation nor the names of its
14* contributors may be used to endorse or promote products derived
15* from this software without specific prior written permission.
16*
17* THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
18* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
19* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
20* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
21* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
24* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
26* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
27* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*/
29
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080030#include <math.h>
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080031#include <utils/rect.h>
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080032#include <utils/constants.h>
33
34#define __CLASS__ "RectUtils"
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080035
36namespace sde {
37
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070038bool IsValid(const LayerRect &rect) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080039 return ((rect.bottom > rect.top) && (rect.right > rect.left));
40}
41
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070042bool IsCongruent(const LayerRect &rect1, const LayerRect &rect2) {
43 return ((rect1.left == rect2.left) &&
44 (rect1.top == rect2.top) &&
45 (rect1.right == rect2.right) &&
46 (rect1.bottom == rect2.bottom));
47}
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080048
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070049void Log(DebugTag debug_tag, const char *prefix, const LayerRect &roi) {
50 DLOGV_IF(debug_tag, "%s: left = %.0f, top = %.0f, right = %.0f, bottom = %.0f",
51 prefix, roi.left, roi.top, roi.right, roi.bottom);
52}
53
54void Normalize(const uint32_t &align_x, const uint32_t &align_y, LayerRect *rect) {
55 rect->left = ROUND_UP_ALIGN_UP(rect->left, align_x);
56 rect->right = ROUND_UP_ALIGN_DOWN(rect->right, align_x);
57 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y);
58 rect->bottom = ROUND_UP_ALIGN_DOWN(rect->bottom, align_y);
59}
60
61LayerRect Intersection(const LayerRect &rect1, const LayerRect &rect2) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080062 LayerRect res;
63
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070064 if (!IsValid(rect1) || !IsValid(rect2)) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080065 return LayerRect();
66 }
67
68 res.left = MAX(rect1.left, rect2.left);
69 res.top = MAX(rect1.top, rect2.top);
70 res.right = MIN(rect1.right, rect2.right);
71 res.bottom = MIN(rect1.bottom, rect2.bottom);
72
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070073 if (!IsValid(res)) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080074 return LayerRect();
75 }
76
77 return res;
78}
79
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070080LayerRect Reposition(const LayerRect &rect, const int &x_offset, const int &y_offset) {
81 LayerRect res;
82
83 if (!IsValid(rect)) {
84 return LayerRect();
85 }
86
87 res.left = rect.left + FLOAT(x_offset);
88 res.top = rect.top + FLOAT(y_offset);
89 res.right = rect.right + FLOAT(x_offset);
90 res.bottom = rect.bottom + FLOAT(y_offset);
91
92 return res;
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080093}
94
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070095// Not a geometrical rect deduction. Deducts rect2 from rect1 only if it results a single rect
96LayerRect Subtract(const LayerRect &rect1, const LayerRect &rect2) {
97 LayerRect res;
98
99 res = rect1;
100
101 if ((rect1.left == rect2.left) && (rect1.right == rect2.right)) {
102 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) {
103 res.top = rect2.bottom;
104 } else if ((rect1.bottom == rect2.bottom) && (rect2.top >= rect1.top)) {
105 res.bottom = rect2.top;
106 }
107 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) {
108 if ((rect1.left == rect2.left) && (rect2.right <= rect1.right)) {
109 res.left = rect2.right;
110 } else if ((rect1.right == rect2.right) && (rect2.left >= rect1.left)) {
111 res.right = rect2.left;
112 }
113 }
114
115 return res;
116}
117
118LayerRect Union(const LayerRect &rect1, const LayerRect &rect2) {
119 LayerRect res;
120
121 if (!IsValid(rect1) && !IsValid(rect2)) {
122 return LayerRect();
123 }
124
Manoj Kumar AVM2405ce52015-04-02 23:13:19 -0700125 if (!IsValid(rect1)) {
Manoj Kumar AVM351c9282015-03-18 16:34:38 -0700126 return rect2;
127 }
128
Manoj Kumar AVM2405ce52015-04-02 23:13:19 -0700129 if (!IsValid(rect2)) {
Manoj Kumar AVM351c9282015-03-18 16:34:38 -0700130 return rect1;
131 }
132
133 res.left = MIN(rect1.left, rect2.left);
134 res.top = MIN(rect1.top, rect2.top);
135 res.right = MAX(rect1.right, rect2.right);
136 res.bottom = MAX(rect1.bottom, rect2.bottom);
137
138 return res;
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -0800139}
140
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -0800141} // namespace sde
142