39   return ((rect.bottom > rect.top) && (rect.right > rect.left));  in IsValid()
44           (rect1.top == rect2.top) &&  in IsCongruent()
51            prefix, roi.left, roi.top, roi.right, roi.bottom);  in Log()
57     rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y);  in Normalize()
69   res.top = MAX(rect1.top, rect2.top);  in Intersection()
88   res.top = rect.top + FLOAT(y_offset);  in Reposition()
102     if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) {  in Subtract()
103       res.top = rect2.bottom;  in Subtract()
104     } else if ((rect1.bottom == rect2.bottom) && (rect2.top >= rect1.top)) {  in Subtract()
105       res.bottom = rect2.top;  in Subtract()
107   } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) {  in Subtract()
134   res.top = MIN(rect1.top, rect2.top);  in Union()
152     out_rects[count].top = rect_temp.top;  in SplitLeftRight()
175   uint32_t split_height = UINT32(rect_temp.bottom - rect_temp.top) / split_count;  in SplitTopBottom()
179     float aligned_bottom = rect_temp.top + aligned_height;  in SplitTopBottom()
180     out_rects[count].top = rect_temp.top;  in SplitTopBottom()
185     rect_temp.top = out_rects[count].bottom;  in SplitTopBottom()
194     out_rects[0].bottom = out_rects[0].top + (out_rects[1].bottom - out_rects[1].top);  in SplitTopBottom()
195     out_rects[1].top = out_rects[0].bottom;  in SplitTopBottom()