blob: 8dfd7dd3bc03c1542be082289b88182e24c86359 [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
38bool IsValidRect(const LayerRect &rect) {
39 return ((rect.bottom > rect.top) && (rect.right > rect.left));
40}
41
42
43LayerRect GetIntersection(const LayerRect &rect1, const LayerRect &rect2) {
44 LayerRect res;
45
46 if (!IsValidRect(rect1) || !IsValidRect(rect2)) {
47 return LayerRect();
48 }
49
50 res.left = MAX(rect1.left, rect2.left);
51 res.top = MAX(rect1.top, rect2.top);
52 res.right = MIN(rect1.right, rect2.right);
53 res.bottom = MIN(rect1.bottom, rect2.bottom);
54
55 if (!IsValidRect(res)) {
56 return LayerRect();
57 }
58
59 return res;
60}
61
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080062void LogRect(DebugTag debug_tag, const char *prefix, const LayerRect &roi) {
63 DLOGV_IF(debug_tag, "%s: left = %.0f, top = %.0f, right = %.0f, bottom = %.0f",
64 prefix, roi.left, roi.top, roi.right, roi.bottom);
65}
66
Ken Zhange2605ea2015-02-02 10:17:45 -050067void NormalizeRect(const uint32_t &align_x, const uint32_t &align_y, LayerRect *rect) {
68 rect->left = ROUND_UP_ALIGN_UP(rect->left, align_x);
69 rect->right = ROUND_UP_ALIGN_DOWN(rect->right, align_x);
70 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y);
71 rect->bottom = ROUND_UP_ALIGN_DOWN(rect->bottom, align_y);
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080072}
73
Manoj Kumar AVMb86bc172015-01-28 21:20:04 -080074} // namespace sde
75