1103 bool isSameRect(const hwc_rect& rect1, const hwc_rect& rect2)  in isSameRect()  argument
1105    return ((rect1.left == rect2.left) && (rect1.top == rect2.top) &&  in isSameRect()
1106            (rect1.right == rect2.right) && (rect1.bottom == rect2.bottom));  in isSameRect()
1130 hwc_rect_t getIntersection(const hwc_rect_t& rect1, const hwc_rect_t& rect2)  in getIntersection()  argument
1134    if(!isValidRect(rect1) || !isValidRect(rect2)){  in getIntersection()
1139    res.left = max(rect1.left, rect2.left);  in getIntersection()
1140    res.top = max(rect1.top, rect2.top);  in getIntersection()
1141    res.right = min(rect1.right, rect2.right);  in getIntersection()
1142    res.bottom = min(rect1.bottom, rect2.bottom);  in getIntersection()
1151 hwc_rect_t getUnion(const hwc_rect &rect1, const hwc_rect &rect2)  in getUnion()  argument
1155    if(!isValidRect(rect1)){  in getUnion()
1160       return rect1;  in getUnion()
1163    res.left = min(rect1.left, rect2.left);  in getUnion()
1164    res.top = min(rect1.top, rect2.top);  in getUnion()
1165    res.right =  max(rect1.right, rect2.right);  in getUnion()
1166    res.bottom =  max(rect1.bottom, rect2.bottom);  in getUnion()
1173 hwc_rect_t deductRect(const hwc_rect_t& rect1, const hwc_rect_t& rect2) {  in deductRect()  argument
1175    hwc_rect_t res = rect1;  in deductRect()
1177    if((rect1.left == rect2.left) && (rect1.right == rect2.right)) {  in deductRect()
1178       if((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom))  in deductRect()
1180       else if((rect1.bottom == rect2.bottom)&& (rect2.top >= rect1.top))  in deductRect()
1183    else if((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) {  in deductRect()
1184       if((rect1.left == rect2.left) && (rect2.right <= rect1.right))  in deductRect()
1186       else if((rect1.right == rect2.right)&& (rect2.left >= rect1.left))  in deductRect()