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