OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	05/09/2024 07:14:15 AM	rwxr-xr-x
📁 blackfin	-	05/09/2024 07:14:16 AM	rwxr-xr-x
📄 cec-notifier.h	4.18 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 cec-pin.h	3.08 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 cec.h	14.21 KB	06/16/2023 05:32:39 PM	rw-r--r--
📁 davinci	-	05/09/2024 07:14:16 AM	rwxr-xr-x
📁 drv-intf	-	05/09/2024 07:14:16 AM	rwxr-xr-x
📁 i2c	-	05/09/2024 07:14:16 AM	rwxr-xr-x
📄 i2c-addr.h	1.21 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 imx.h	396 bytes	01/28/2018 09:20:33 PM	rw-r--r--
📄 lirc.h	29 bytes	01/28/2018 09:20:33 PM	rw-r--r--
📄 lirc_dev.h	5.03 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 media-device.h	15.76 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 media-devnode.h	5.68 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 media-entity.h	34.19 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 rc-core.h	11.57 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 rc-map.h	13.86 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 rcar-fcp.h	1.31 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 soc_camera.h	12.99 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 tuner-types.h	6.99 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 tuner.h	8.85 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 tveeprom.h	3.29 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-async.h	6.55 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-clk.h	2.09 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-common.h	8.38 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-ctrls.h	38.06 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-dev.h	15.05 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-device.h	11.14 KB	06/16/2023 05:32:39 PM	rw-r--r--
📄 v4l2-dv-timings.h	8.3 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-event.h	7.56 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-fh.h	4.62 KB	06/16/2023 05:32:39 PM	rw-r--r--
📄 v4l2-flash-led-class.h	5.59 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-fwnode.h	13.35 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-image-sizes.h	864 bytes	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-ioctl.h	31.31 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-mc.h	8.02 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-mediabus.h	4.96 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-mem2mem.h	19.72 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-rect.h	5.24 KB	06/16/2023 05:32:39 PM	rw-r--r--
📄 v4l2-subdev.h	37.77 KB	06/16/2023 05:32:39 PM	rw-r--r--
📄 v4l2-tpg-colors.h	1.89 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 v4l2-tpg.h	14.49 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf-core.h	6.99 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf-dma-contig.h	1.04 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf-dma-sg.h	2.94 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf-dvb.h	1.7 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf-vmalloc.h	1.29 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf2-core.h	39.7 KB	06/16/2023 05:32:39 PM	rw-r--r--
📄 videobuf2-dma-contig.h	866 bytes	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf2-dma-sg.h	696 bytes	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf2-dvb.h	1.79 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf2-memops.h	1.09 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf2-v4l2.h	9.76 KB	01/28/2018 09:20:33 PM	rw-r--r--
📄 videobuf2-vmalloc.h	509 bytes	01/28/2018 09:20:33 PM	rw-r--r--
📄 vsp1.h	1.84 KB	01/28/2018 09:20:33 PM	rw-r--r--

Editing: v4l2-rect.h

/*
 * v4l2-rect.h - v4l2_rect helper functions
 *
 * Copyright 2014 Cisco Systems, Inc. and/or its affiliates. All rights reserved.
 *
 * This program is free software; you may redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; version 2 of the License.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#ifndef _V4L2_RECT_H_
#define _V4L2_RECT_H_

#include <linux/videodev2.h>

/**
 * v4l2_rect_set_size_to() - copy the width/height values.
 * @r: rect whose width and height fields will be set
 * @size: rect containing the width and height fields you need.
 */
static inline void v4l2_rect_set_size_to(struct v4l2_rect *r,
					 const struct v4l2_rect *size)
{
	r->width = size->width;
	r->height = size->height;
}

/**
 * v4l2_rect_set_min_size() - width and height of r should be >= min_size.
 * @r: rect whose width and height will be modified
 * @min_size: rect containing the minimal width and height
 */
static inline void v4l2_rect_set_min_size(struct v4l2_rect *r,
					  const struct v4l2_rect *min_size)
{
	if (r->width < min_size->width)
		r->width = min_size->width;
	if (r->height < min_size->height)
		r->height = min_size->height;
}

/**
 * v4l2_rect_set_max_size() - width and height of r should be <= max_size
 * @r: rect whose width and height will be modified
 * @max_size: rect containing the maximum width and height
 */
static inline void v4l2_rect_set_max_size(struct v4l2_rect *r,
					  const struct v4l2_rect *max_size)
{
	if (r->width > max_size->width)
		r->width = max_size->width;
	if (r->height > max_size->height)
		r->height = max_size->height;
}

/**
 * v4l2_rect_map_inside()- r should be inside boundary.
 * @r: rect that will be modified
 * @boundary: rect containing the boundary for @r
 */
static inline void v4l2_rect_map_inside(struct v4l2_rect *r,
					const struct v4l2_rect *boundary)
{
	v4l2_rect_set_max_size(r, boundary);
	if (r->left < boundary->left)
		r->left = boundary->left;
	if (r->top < boundary->top)
		r->top = boundary->top;
	if (r->left + r->width > boundary->left + boundary->width)
		r->left = boundary->left + boundary->width - r->width;
	if (r->top + r->height > boundary->top + boundary->height)
		r->top = boundary->top + boundary->height - r->height;
}

/**
 * v4l2_rect_same_size() - return true if r1 has the same size as r2
 * @r1: rectangle.
 * @r2: rectangle.
 *
 * Return true if both rectangles have the same size.
 */
static inline bool v4l2_rect_same_size(const struct v4l2_rect *r1,
				       const struct v4l2_rect *r2)
{
	return r1->width == r2->width && r1->height == r2->height;
}

/**
 * v4l2_rect_intersect() - calculate the intersection of two rects.
 * @r: intersection of @r1 and @r2.
 * @r1: rectangle.
 * @r2: rectangle.
 */
static inline void v4l2_rect_intersect(struct v4l2_rect *r,
				       const struct v4l2_rect *r1,
				       const struct v4l2_rect *r2)
{
	int right, bottom;

r->top = max(r1->top, r2->top);
	r->left = max(r1->left, r2->left);
	bottom = min(r1->top + r1->height, r2->top + r2->height);
	right = min(r1->left + r1->width, r2->left + r2->width);
	r->height = max(0, bottom - r->top);
	r->width = max(0, right - r->left);
}

/**
 * v4l2_rect_scale() - scale rect r by to/from
 * @r: rect to be scaled.
 * @from: from rectangle.
 * @to: to rectangle.
 *
 * This scales rectangle @r horizontally by @to->width / @from->width and
 * vertically by @to->height / @from->height.
 *
 * Typically @r is a rectangle inside @from and you want the rectangle as
 * it would appear after scaling @from to @to. So the resulting @r will
 * be the scaled rectangle inside @to.
 */
static inline void v4l2_rect_scale(struct v4l2_rect *r,
				   const struct v4l2_rect *from,
				   const struct v4l2_rect *to)
{
	if (from->width == 0 || from->height == 0) {
		r->left = r->top = r->width = r->height = 0;
		return;
	}
	r->left = (((r->left - from->left) * to->width) / from->width) & ~1;
	r->width = ((r->width * to->width) / from->width) & ~1;
	r->top = ((r->top - from->top) * to->height) / from->height;
	r->height = (r->height * to->height) / from->height;
}

/**
 * v4l2_rect_overlap() - do r1 and r2 overlap?
 * @r1: rectangle.
 * @r2: rectangle.
 *
 * Returns true if @r1 and @r2 overlap.
 */
static inline bool v4l2_rect_overlap(const struct v4l2_rect *r1,
				     const struct v4l2_rect *r2)
{
	/*
	 * IF the left side of r1 is to the right of the right side of r2 OR
	 *    the left side of r2 is to the right of the right side of r1 THEN
	 * they do not overlap.
	 */
	if (r1->left >= r2->left + r2->width ||
	    r2->left >= r1->left + r1->width)
		return false;
	/*
	 * IF the top side of r1 is below the bottom of r2 OR
	 *    the top side of r2 is below the bottom of r1 THEN
	 * they do not overlap.
	 */
	if (r1->top >= r2->top + r2->height ||
	    r2->top >= r1->top + r1->height)
		return false;
	return true;
}

#endif