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#include "cb_swap_rect.h"
30#include <ui/Region.h>
31/* get union of two rects into 3rd rect */
32void getUnion(hwc_rect_t& rect1,hwc_rect_t& rect2, hwc_rect_t& irect) {
33
34    irect.left   = min(rect1.left, rect2.left);
35    irect.top    = min(rect1.top, rect2.top);
36    irect.right  = max(rect1.right, rect2.right);
37    irect.bottom = max(rect1.bottom, rect2.bottom);
38}
39
40using namespace android;
41using namespace qhwc;
42namespace qdutils {
43
44int CBUtils::getuiClearRegion(hwc_display_contents_1_t* list,
45          hwc_rect_t &clearWormholeRect, LayerProp *layerProp) {
46
47    size_t last = list->numHwLayers - 1;
48    hwc_rect_t fbFrame = list->hwLayers[last].displayFrame;
49    Rect fbFrameRect(fbFrame.left,fbFrame.top,fbFrame.right,fbFrame.bottom);
50    Region wormholeRegion(fbFrameRect);
51
52    if(cb_swap_rect::getInstance().checkSwapRectFeature_on() == true){
53      wormholeRegion.set(0,0);
54      for(size_t i = 0 ; i < last; i++) {
55         if((list->hwLayers[i].blending == HWC_BLENDING_NONE) ||
56           !(layerProp[i].mFlags & HWC_COPYBIT) ||
57           (list->hwLayers[i].flags  & HWC_SKIP_HWC_COMPOSITION))
58              continue ;
59         hwc_rect_t displayFrame = list->hwLayers[i].displayFrame;
60         Rect tmpRect(displayFrame.left,displayFrame.top,
61                      displayFrame.right,displayFrame.bottom);
62         wormholeRegion.set(tmpRect);
63      }
64   }else{
65     for (size_t i = 0 ; i < last; i++) {
66        // need to take care only in per pixel blending.
67        // Restrict calculation only for copybit layers.
68        if((list->hwLayers[i].blending != HWC_BLENDING_NONE) ||
69           !(layerProp[i].mFlags & HWC_COPYBIT))
70            continue ;
71        hwc_rect_t displayFrame = list->hwLayers[i].displayFrame;
72        Rect tmpRect(displayFrame.left,displayFrame.top,displayFrame.right,
73        displayFrame.bottom);
74        Region tmpRegion(tmpRect);
75        wormholeRegion.subtractSelf(wormholeRegion.intersect(tmpRegion));
76     }
77   }
78   if(wormholeRegion.isEmpty()){
79        return 0;
80   }
81   //TO DO :- 1. remove union and call clear for each rect.
82   Region::const_iterator it = wormholeRegion.begin();
83   Region::const_iterator const end = wormholeRegion.end();
84   while (it != end) {
85       const Rect& r = *it++;
86       hwc_rect_t tmpWormRect = {r.left,r.top,r.right,r.bottom};
87       int dst_w =  clearWormholeRect.right -  clearWormholeRect.left;
88       int dst_h =  clearWormholeRect.bottom -  clearWormholeRect.top;
89
90       if (!(dst_w || dst_h))
91             clearWormholeRect = tmpWormRect;
92       else
93             getUnion(clearWormholeRect, tmpWormRect, clearWormholeRect);
94
95   }
96   return 1;
97}
98
99}//namespace qdutils
100