1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/*
* Copyright (c) 2015, The Linux Foundation. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of The Linux Foundation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <math.h>
#include <utils/rect.h>
#include <utils/constants.h>
#define __CLASS__ "RectUtils"
namespace sdm {
bool IsValid(const LayerRect &rect) {
return ((rect.bottom > rect.top) && (rect.right > rect.left));
}
bool IsCongruent(const LayerRect &rect1, const LayerRect &rect2) {
return ((rect1.left == rect2.left) &&
(rect1.top == rect2.top) &&
(rect1.right == rect2.right) &&
(rect1.bottom == rect2.bottom));
}
void Log(DebugTag debug_tag, const char *prefix, const LayerRect &roi) {
DLOGV_IF(debug_tag, "%s: left = %.0f, top = %.0f, right = %.0f, bottom = %.0f",
prefix, roi.left, roi.top, roi.right, roi.bottom);
}
void Normalize(const uint32_t &align_x, const uint32_t &align_y, LayerRect *rect) {
rect->left = ROUND_UP_ALIGN_UP(rect->left, align_x);
rect->right = ROUND_UP_ALIGN_DOWN(rect->right, align_x);
rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y);
rect->bottom = ROUND_UP_ALIGN_DOWN(rect->bottom, align_y);
}
LayerRect Intersection(const LayerRect &rect1, const LayerRect &rect2) {
LayerRect res;
if (!IsValid(rect1) || !IsValid(rect2)) {
return LayerRect();
}
res.left = MAX(rect1.left, rect2.left);
res.top = MAX(rect1.top, rect2.top);
res.right = MIN(rect1.right, rect2.right);
res.bottom = MIN(rect1.bottom, rect2.bottom);
if (!IsValid(res)) {
return LayerRect();
}
return res;
}
LayerRect Reposition(const LayerRect &rect, const int &x_offset, const int &y_offset) {
LayerRect res;
if (!IsValid(rect)) {
return LayerRect();
}
res.left = rect.left + FLOAT(x_offset);
res.top = rect.top + FLOAT(y_offset);
res.right = rect.right + FLOAT(x_offset);
res.bottom = rect.bottom + FLOAT(y_offset);
return res;
}
// Not a geometrical rect deduction. Deducts rect2 from rect1 only if it results a single rect
LayerRect Subtract(const LayerRect &rect1, const LayerRect &rect2) {
LayerRect res;
res = rect1;
if ((rect1.left == rect2.left) && (rect1.right == rect2.right)) {
if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) {
res.top = rect2.bottom;
} else if ((rect1.bottom == rect2.bottom) && (rect2.top >= rect1.top)) {
res.bottom = rect2.top;
}
} else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) {
if ((rect1.left == rect2.left) && (rect2.right <= rect1.right)) {
res.left = rect2.right;
} else if ((rect1.right == rect2.right) && (rect2.left >= rect1.left)) {
res.right = rect2.left;
}
}
return res;
}
LayerRect Union(const LayerRect &rect1, const LayerRect &rect2) {
LayerRect res;
if (!IsValid(rect1) && !IsValid(rect2)) {
return LayerRect();
}
if (!IsValid(rect1)) {
return rect2;
}
if (!IsValid(rect2)) {
return rect1;
}
res.left = MIN(rect1.left, rect2.left);
res.top = MIN(rect1.top, rect2.top);
res.right = MAX(rect1.right, rect2.right);
res.bottom = MAX(rect1.bottom, rect2.bottom);
return res;
}
void SplitLeftRight(const LayerRect &in_rect, uint32_t split_count, uint32_t align_x,
bool flip_horizontal, LayerRect *out_rects) {
LayerRect rect_temp = in_rect;
uint32_t split_width = UINT32(rect_temp.right - rect_temp.left) / split_count;
float aligned_width = FLOAT(CeilToMultipleOf(split_width, align_x));
for (uint32_t count = 0; count < split_count; count++) {
float aligned_right = rect_temp.left + aligned_width;
out_rects[count].left = rect_temp.left;
out_rects[count].right = MIN(rect_temp.right, aligned_right);
out_rects[count].top = rect_temp.top;
out_rects[count].bottom = rect_temp.bottom;
rect_temp.left = out_rects[count].right;
Log(kTagRotator, "SplitLeftRight", out_rects[count]);
}
// If we have a horizontal flip, then we should be splitting the source from right to left
// to ensure that the right split will have an aligned width that matches the alignment on the
// destination.
if (flip_horizontal && split_count > 1) {
out_rects[0].right = out_rects[0].left + (out_rects[1].right - out_rects[1].left);
out_rects[1].left = out_rects[0].right;
Log(kTagRotator, "Adjusted Left", out_rects[0]);
Log(kTagRotator, "Adjusted Right", out_rects[1]);
}
}
void SplitTopBottom(const LayerRect &in_rect, uint32_t split_count, uint32_t align_y,
bool flip_horizontal, LayerRect *out_rects) {
LayerRect rect_temp = in_rect;
uint32_t split_height = UINT32(rect_temp.bottom - rect_temp.top) / split_count;
float aligned_height = FLOAT(CeilToMultipleOf(split_height, align_y));
for (uint32_t count = 0; count < split_count; count++) {
float aligned_bottom = rect_temp.top + aligned_height;
out_rects[count].top = rect_temp.top;
out_rects[count].bottom = MIN(rect_temp.bottom, aligned_bottom);
out_rects[count].left = rect_temp.left;
out_rects[count].right = rect_temp.right;
rect_temp.top = out_rects[count].bottom;
Log(kTagRotator, "SplitTopBottom", out_rects[count]);
}
// If we have a horizontal flip, then we should be splitting the destination from bottom to top
// to ensure that the bottom split's y-offset is aligned correctly after we swap the destinations
// while accounting for the flip.
if (flip_horizontal && split_count > 1) {
out_rects[0].bottom = out_rects[0].top + (out_rects[1].bottom - out_rects[1].top);
out_rects[1].top = out_rects[0].bottom;
Log(kTagRotator, "Adjusted Top", out_rects[0]);
Log(kTagRotator, "Adjusted Bottom", out_rects[1]);
}
}
} // namespace sdm
|
