blob: c227cb30b3f40ede4c972f88ab3831af64e62900 [file] [log] [blame]
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -08001/*
Pullakavi Srinivas1494a932016-12-30 12:51:06 +05302* Copyright (c) 2015-2017, The Linux Foundation. All rights reserved.
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -08003*
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>
Dileep Marchya7290bd22016-06-09 11:37:20 +053033#include <algorithm>
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080034
35#define __CLASS__ "RectUtils"
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080036
Dileep Marchya73d002e2015-05-08 18:58:33 -070037namespace sdm {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080038
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070039bool IsValid(const LayerRect &rect) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080040 return ((rect.bottom > rect.top) && (rect.right > rect.left));
41}
42
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070043bool IsCongruent(const LayerRect &rect1, const LayerRect &rect2) {
44 return ((rect1.left == rect2.left) &&
45 (rect1.top == rect2.top) &&
46 (rect1.right == rect2.right) &&
47 (rect1.bottom == rect2.bottom));
48}
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080049
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070050void Log(DebugTag debug_tag, const char *prefix, const LayerRect &roi) {
51 DLOGV_IF(debug_tag, "%s: left = %.0f, top = %.0f, right = %.0f, bottom = %.0f",
52 prefix, roi.left, roi.top, roi.right, roi.bottom);
53}
54
55void Normalize(const uint32_t &align_x, const uint32_t &align_y, LayerRect *rect) {
56 rect->left = ROUND_UP_ALIGN_UP(rect->left, align_x);
57 rect->right = ROUND_UP_ALIGN_DOWN(rect->right, align_x);
58 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y);
59 rect->bottom = ROUND_UP_ALIGN_DOWN(rect->bottom, align_y);
60}
61
62LayerRect Intersection(const LayerRect &rect1, const LayerRect &rect2) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080063 LayerRect res;
64
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070065 if (!IsValid(rect1) || !IsValid(rect2)) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080066 return LayerRect();
67 }
68
Dileep Marchya7290bd22016-06-09 11:37:20 +053069 res.left = std::max(rect1.left, rect2.left);
70 res.top = std::max(rect1.top, rect2.top);
71 res.right = std::min(rect1.right, rect2.right);
72 res.bottom = std::min(rect1.bottom, rect2.bottom);
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080073
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070074 if (!IsValid(res)) {
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080075 return LayerRect();
76 }
77
78 return res;
79}
80
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070081LayerRect Reposition(const LayerRect &rect, const int &x_offset, const int &y_offset) {
82 LayerRect res;
83
84 if (!IsValid(rect)) {
85 return LayerRect();
86 }
87
88 res.left = rect.left + FLOAT(x_offset);
89 res.top = rect.top + FLOAT(y_offset);
90 res.right = rect.right + FLOAT(x_offset);
91 res.bottom = rect.bottom + FLOAT(y_offset);
92
93 return res;
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080094}
95
Manoj Kumar AVM351c9282015-03-18 16:34:38 -070096// Not a geometrical rect deduction. Deducts rect2 from rect1 only if it results a single rect
97LayerRect Subtract(const LayerRect &rect1, const LayerRect &rect2) {
98 LayerRect res;
99
100 res = rect1;
101
102 if ((rect1.left == rect2.left) && (rect1.right == rect2.right)) {
103 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) {
104 res.top = rect2.bottom;
105 } else if ((rect1.bottom == rect2.bottom) && (rect2.top >= rect1.top)) {
106 res.bottom = rect2.top;
107 }
108 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) {
109 if ((rect1.left == rect2.left) && (rect2.right <= rect1.right)) {
110 res.left = rect2.right;
111 } else if ((rect1.right == rect2.right) && (rect2.left >= rect1.left)) {
112 res.right = rect2.left;
113 }
114 }
115
116 return res;
117}
118
119LayerRect Union(const LayerRect &rect1, const LayerRect &rect2) {
120 LayerRect res;
121
122 if (!IsValid(rect1) && !IsValid(rect2)) {
123 return LayerRect();
124 }
125
Manoj Kumar AVM2405ce52015-04-02 23:13:19 -0700126 if (!IsValid(rect1)) {
Manoj Kumar AVM351c9282015-03-18 16:34:38 -0700127 return rect2;
128 }
129
Manoj Kumar AVM2405ce52015-04-02 23:13:19 -0700130 if (!IsValid(rect2)) {
Manoj Kumar AVM351c9282015-03-18 16:34:38 -0700131 return rect1;
132 }
133
Dileep Marchya7290bd22016-06-09 11:37:20 +0530134 res.left = std::min(rect1.left, rect2.left);
135 res.top = std::min(rect1.top, rect2.top);
136 res.right = std::max(rect1.right, rect2.right);
137 res.bottom = std::max(rect1.bottom, rect2.bottom);
Manoj Kumar AVM351c9282015-03-18 16:34:38 -0700138
139 return res;
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -0800140}
141
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700142void SplitLeftRight(const LayerRect &in_rect, uint32_t split_count, uint32_t align_x,
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700143 bool flip_horizontal, LayerRect *out_rects) {
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700144 LayerRect rect_temp = in_rect;
145
146 uint32_t split_width = UINT32(rect_temp.right - rect_temp.left) / split_count;
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700147 float aligned_width = FLOAT(CeilToMultipleOf(split_width, align_x));
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700148
149 for (uint32_t count = 0; count < split_count; count++) {
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700150 float aligned_right = rect_temp.left + aligned_width;
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700151 out_rects[count].left = rect_temp.left;
Dileep Marchya7290bd22016-06-09 11:37:20 +0530152 out_rects[count].right = std::min(rect_temp.right, aligned_right);
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700153 out_rects[count].top = rect_temp.top;
154 out_rects[count].bottom = rect_temp.bottom;
155
156 rect_temp.left = out_rects[count].right;
157
158 Log(kTagRotator, "SplitLeftRight", out_rects[count]);
159 }
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700160
161 // If we have a horizontal flip, then we should be splitting the source from right to left
162 // to ensure that the right split will have an aligned width that matches the alignment on the
163 // destination.
164 if (flip_horizontal && split_count > 1) {
165 out_rects[0].right = out_rects[0].left + (out_rects[1].right - out_rects[1].left);
166 out_rects[1].left = out_rects[0].right;
167 Log(kTagRotator, "Adjusted Left", out_rects[0]);
168 Log(kTagRotator, "Adjusted Right", out_rects[1]);
169 }
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700170}
171
172void SplitTopBottom(const LayerRect &in_rect, uint32_t split_count, uint32_t align_y,
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700173 bool flip_horizontal, LayerRect *out_rects) {
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700174 LayerRect rect_temp = in_rect;
175
176 uint32_t split_height = UINT32(rect_temp.bottom - rect_temp.top) / split_count;
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700177 float aligned_height = FLOAT(CeilToMultipleOf(split_height, align_y));
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700178
179 for (uint32_t count = 0; count < split_count; count++) {
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700180 float aligned_bottom = rect_temp.top + aligned_height;
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700181 out_rects[count].top = rect_temp.top;
Dileep Marchya7290bd22016-06-09 11:37:20 +0530182 out_rects[count].bottom = std::min(rect_temp.bottom, aligned_bottom);
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700183 out_rects[count].left = rect_temp.left;
184 out_rects[count].right = rect_temp.right;
185
186 rect_temp.top = out_rects[count].bottom;
187
188 Log(kTagRotator, "SplitTopBottom", out_rects[count]);
189 }
Tatenda Chipeperekwaa8668642015-07-23 15:36:24 -0700190
191 // If we have a horizontal flip, then we should be splitting the destination from bottom to top
192 // to ensure that the bottom split's y-offset is aligned correctly after we swap the destinations
193 // while accounting for the flip.
194 if (flip_horizontal && split_count > 1) {
195 out_rects[0].bottom = out_rects[0].top + (out_rects[1].bottom - out_rects[1].top);
196 out_rects[1].top = out_rects[0].bottom;
197 Log(kTagRotator, "Adjusted Top", out_rects[0]);
198 Log(kTagRotator, "Adjusted Bottom", out_rects[1]);
199 }
Ramkumar Radhakrishnan34508112015-05-28 19:02:05 -0700200}
201
Ramkumar Radhakrishnanb27735f2016-08-26 22:37:23 -0700202void MapRect(const LayerRect &src_domain, const LayerRect &dst_domain, const LayerRect &in_rect,
203 LayerRect *out_rect) {
Ramkumar Radhakrishnan68840472016-05-09 13:01:25 -0700204 if (!IsValid(src_domain) || !IsValid(dst_domain) || !IsValid(in_rect)) {
205 return;
206 }
207
Prabhanjan Kandula6064cad2016-11-02 16:55:19 -0700208 int x_offset = INT(src_domain.left);
209 int y_offset = INT(src_domain.top);
210
211 LayerRect modified_in_rect = Reposition(in_rect, -x_offset, -y_offset);
Ramkumar Radhakrishnan68840472016-05-09 13:01:25 -0700212 float src_domain_width = src_domain.right - src_domain.left;
213 float src_domain_height = src_domain.bottom - src_domain.top;
214 float dst_domain_width = dst_domain.right - dst_domain.left;
215 float dst_domain_height = dst_domain.bottom - dst_domain.top;
216
217 float width_ratio = dst_domain_width / src_domain_width;
218 float height_ratio = dst_domain_height / src_domain_height;
219
Prabhanjan Kandula6064cad2016-11-02 16:55:19 -0700220 out_rect->left = dst_domain.left + (width_ratio * modified_in_rect.left);
221 out_rect->top = dst_domain.top + (height_ratio * modified_in_rect.top);
222 out_rect->right = dst_domain.left + (width_ratio * modified_in_rect.right);
223 out_rect->bottom = dst_domain.top + (height_ratio * modified_in_rect.bottom);
Ramkumar Radhakrishnan68840472016-05-09 13:01:25 -0700224}
225
Pullakavi Srinivas5de9c632017-01-30 20:30:39 +0530226void TransformHV(const LayerRect &src_domain, const LayerRect &in_rect,
227 const LayerTransform &transform, LayerRect *out_rect) {
Pullakavi Srinivas1494a932016-12-30 12:51:06 +0530228 if (!IsValid(src_domain) || !IsValid(in_rect)) {
229 return;
230 }
231
232 float in_width = in_rect.right - in_rect.left;
233 float in_height = in_rect.bottom - in_rect.top;
Pullakavi Srinivas5de9c632017-01-30 20:30:39 +0530234 float x_offset = in_rect.left - src_domain.left;
235 float y_offset = in_rect.top - src_domain.top;
236 *out_rect = in_rect;
Pullakavi Srinivas1494a932016-12-30 12:51:06 +0530237
Pullakavi Srinivas5de9c632017-01-30 20:30:39 +0530238 if (transform.flip_horizontal) {
239 out_rect->right = src_domain.right - x_offset;
240 out_rect->left = out_rect->right - in_width;
241 }
242
243 if (transform.flip_vertical) {
244 out_rect->bottom = src_domain.bottom - y_offset;
245 out_rect->top = out_rect->bottom - in_height;
246 }
Pullakavi Srinivas1494a932016-12-30 12:51:06 +0530247}
248
Ramkumar Radhakrishnan68840472016-05-09 13:01:25 -0700249RectOrientation GetOrientation(const LayerRect &in_rect) {
250 if (!IsValid(in_rect)) {
251 return kOrientationUnknown;
252 }
253
254 float input_width = in_rect.right - in_rect.left;
255 float input_height = in_rect.bottom - in_rect.top;
256
257 if (input_width < input_height) {
258 return kOrientationPortrait;
259 }
260
261 return kOrientationLandscape;
262}
263
Rohit Kulkarni8622e362017-01-30 18:14:10 -0800264DisplayError GetCropAndDestination(const LayerRect &crop, const LayerRect &dst,
265 const bool rotated90, float *crop_width,
266 float *crop_height, float *dst_width,
267 float *dst_height) {
268 if (!IsValid(crop)) {
269 Log(kTagResources, "Invalid crop rect", crop);
270 return kErrorNotSupported;
271 }
272
273 if (!IsValid(dst)) {
274 Log(kTagResources, "Invalid dst rect", dst);
275 return kErrorNotSupported;
276 }
277
278 *crop_width = crop.right - crop.left;
279 *crop_height = crop.bottom - crop.top;
280 if (rotated90) {
281 std::swap(*crop_width, *crop_height);
282 }
283
284 *dst_width = dst.right - dst.left;
285 *dst_height = dst.bottom - dst.top;
286
287 return kErrorNone;
288}
289
290DisplayError GetScaleFactor(const LayerRect &crop, const LayerRect &dst,
291 bool rotated90, float *scale_x, float *scale_y) {
292 float crop_width = 1.0f, crop_height = 1.0f, dst_width = 1.0f, dst_height = 1.0f;
293
294 DisplayError error = GetCropAndDestination(crop, dst, rotated90, &crop_width, &crop_height,
295 &dst_width, &dst_height);
296 if (error != kErrorNone) {
297 return error;
298 }
299
300 *scale_x = crop_width / dst_width;
301 *scale_y = crop_height / dst_height;
302
303 return kErrorNone;
304}
305
Dileep Marchya73d002e2015-05-08 18:58:33 -0700306} // namespace sdm
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -0800307