64 	if (r->top < boundary->top)  in v4l2_rect_map_inside()
65 		r->top = boundary->top;  in v4l2_rect_map_inside()
68 	if (r->top + r->height > boundary->top + boundary->height)  in v4l2_rect_map_inside()
69 		r->top = boundary->top + boundary->height - r->height;  in v4l2_rect_map_inside()
95 	return r1->top == r2->top && r1->left == r2->left;  in v4l2_rect_same_position()
123 	r->top = max(r1->top, r2->top);  in v4l2_rect_intersect()
125 	bottom = min(r1->top + r1->height, r2->top + r2->height);  in v4l2_rect_intersect()
127 	r->height = max(0, bottom - r->top);  in v4l2_rect_intersect()
149 		r->left = r->top = r->width = r->height = 0;  in v4l2_rect_scale()
154 	r->top = ((r->top - from->top) * to->height) / from->height;  in v4l2_rect_scale()
177 	 * IF the top side of r1 is below the bottom of r2 OR  in v4l2_rect_overlap()
178 	 *    the top side of r2 is below the bottom of r1 THEN  in v4l2_rect_overlap()
181 	if (r1->top >= r2->top + r2->height ||  in v4l2_rect_overlap()
182 	    r2->top >= r1->top + r1->height)  in v4l2_rect_overlap()
197 	if (r1->left < r2->left || r1->top < r2->top)  in v4l2_rect_enclosed()
201 	if (r1->top + r1->height > r2->top + r2->height)  in v4l2_rect_enclosed()