62 	if (r->left < boundary->left)  in v4l2_rect_map_inside()
63 		r->left = boundary->left;  in v4l2_rect_map_inside()
66 	if (r->left + r->width > boundary->left + boundary->width)  in v4l2_rect_map_inside()
67 		r->left = boundary->left + boundary->width - r->width;  in v4l2_rect_map_inside()
95 	return r1->top == r2->top && r1->left == r2->left;  in v4l2_rect_same_position()
124 	r->left = max(r1->left, r2->left);  in v4l2_rect_intersect()
126 	right = min(r1->left + r1->width, r2->left + r2->width);  in v4l2_rect_intersect()
128 	r->width = max(0, right - r->left);  in v4l2_rect_intersect()
149 		r->left = r->top = r->width = r->height = 0;  in v4l2_rect_scale()
152 	r->left = (((r->left - from->left) * to->width) / from->width) & ~1;  in v4l2_rect_scale()
169 	 * IF the left side of r1 is to the right of the right side of r2 OR  in v4l2_rect_overlap()
170 	 *    the left side of r2 is to the right of the right side of r1 THEN  in v4l2_rect_overlap()
173 	if (r1->left >= r2->left + r2->width ||  in v4l2_rect_overlap()
174 	    r2->left >= r1->left + r1->width)  in v4l2_rect_overlap()
197 	if (r1->left < r2->left || r1->top < r2->top)  in v4l2_rect_enclosed()
199 	if (r1->left + r1->width > r2->left + r2->width)  in v4l2_rect_enclosed()