| radhakrishna | 2f00c8f | 2013-10-21 16:49:21 +0530 | [diff] [blame^] | 1 | /* Copyright (c) 2013, The Linux Foundation. All rights reserved. |
| 2 | * Redistribution and use in source and binary forms, with or without |
| 3 | * * modification, are permitted provided that the following conditions are |
| 4 | * met: |
| 5 | * * Redistributions of source code must retain the above copyrigh |
| 6 | * notice, this list of conditions and the following disclaimer |
| 7 | * * Redistributions in binary form must reproduce the above |
| 8 | * copyright notice, this list of conditions and the following |
| 9 | * disclaimer in the documentation and/or other materials provided |
| 10 | * with the distribution. |
| 11 | * * Neither the name of The Linux Foundation nor the names of its |
| 12 | * contributors may be used to endorse or promote products derived |
| 13 | * from this software without specific prior written permission. |
| 14 | * |
| 15 | * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED |
| 16 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 17 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT |
| 18 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS |
| 19 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 20 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 21 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 22 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 23 | * * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
| 24 | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
| 25 | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #include "cb_utils.h" |
| 29 | |
| 30 | /* get union of two rects into 3rd rect */ |
| 31 | void getUnion(hwc_rect_t& rect1,hwc_rect_t& rect2, hwc_rect_t& irect) { |
| 32 | irect.left = min(rect1.left, rect2.left); |
| 33 | irect.top = min(rect1.top, rect2.top); |
| 34 | irect.right = max(rect1.right, rect2.right); |
| 35 | irect.bottom = max(rect1.bottom, rect2.bottom); |
| 36 | } |
| 37 | |
| 38 | using namespace android; |
| 39 | using namespace qhwc; |
| 40 | namespace qdutils { |
| 41 | |
| 42 | int CBUtils::getuiClearRegion(hwc_display_contents_1_t* list, |
| 43 | hwc_rect_t &clearWormholeRect, LayerProp *layerProp) { |
| 44 | |
| 45 | uint32_t last = list->numHwLayers - 1; |
| 46 | hwc_rect_t fbFrame = list->hwLayers[last].displayFrame; |
| 47 | |
| 48 | Rect fbFrameRect(fbFrame.left,fbFrame.top,fbFrame.right,fbFrame.bottom); |
| 49 | Region wormholeRegion(fbFrameRect); |
| 50 | |
| 51 | for (uint32_t i = 0 ; i < last; i++) { |
| 52 | // need to take care only in per pixel blending. |
| 53 | // Restrict calculation only for copybit layers. |
| 54 | if((list->hwLayers[i].blending != HWC_BLENDING_NONE) || |
| 55 | !(layerProp[i].mFlags & HWC_COPYBIT)) |
| 56 | continue ; |
| 57 | hwc_rect_t displayFrame = list->hwLayers[i].displayFrame; |
| 58 | Rect tmpRect(displayFrame.left,displayFrame.top,displayFrame.right, |
| 59 | displayFrame.bottom); |
| 60 | Region tmpRegion(tmpRect); |
| 61 | wormholeRegion.subtractSelf(wormholeRegion.intersect(tmpRegion)); |
| 62 | } |
| 63 | if (wormholeRegion.isEmpty()) { |
| 64 | return 0; |
| 65 | } |
| 66 | //TO DO :- 1. remove union and call clear for each rect. |
| 67 | // :- 2. support swap ract feature. |
| 68 | Region::const_iterator it = wormholeRegion.begin(); |
| 69 | Region::const_iterator const end = wormholeRegion.end(); |
| 70 | while (it != end) { |
| 71 | const Rect& r = *it++; |
| 72 | hwc_rect_t tmpWormRect = {r.left,r.top,r.right,r.bottom}; |
| 73 | getUnion(clearWormholeRect, tmpWormRect, clearWormholeRect); |
| 74 | |
| 75 | } |
| 76 | return 1; |
| 77 | } |
| 78 | |
| 79 | }//namespace qdutils |