/* # (C) 2008-2009 Elmar Kleijn # (C) 2008-2009 Sjoerd Piepenbrink # (C) 2008-2009 Hans de Goede # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU Lesser General Public License as published by # the Free Software Foundation; either version 2.1 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include #include #include #include #include #include "libv4lprocessing.h" #include "libv4lprocessing-priv.h" #include "../libv4lconvert-priv.h" /* for PIX_FMT defines */ static struct v4lprocessing_filter *filters[] = { &whitebalance_filter, &autogain_filter, &gamma_filter, }; struct v4lprocessing_data *v4lprocessing_create(int fd, struct v4lcontrol_data* control) { struct v4lprocessing_data *data = calloc(1, sizeof(struct v4lprocessing_data)); if (!data) return NULL; data->fd = fd; data->control = control; return data; } void v4lprocessing_destroy(struct v4lprocessing_data *data) { free(data); } int v4lprocessing_pre_processing(struct v4lprocessing_data *data) { int i; data->do_process = 0; for (i = 0; i < ARRAY_SIZE(filters); i++) { if (filters[i]->active(data)) data->do_process = 1; } return data->do_process; } static void v4lprocessing_update_lookup_tables(struct v4lprocessing_data *data, unsigned char *buf, const struct v4l2_format *fmt) { int i; for (i = 0; i < 256; i++) { data->comp1[i] = i; data->green[i] = i; data->comp2[i] = i; } data->lookup_table_active = 0; for (i = 0; i < ARRAY_SIZE(filters); i++) { if (filters[i]->active(data)) { if (filters[i]->calculate_lookup_tables(data, buf, fmt)) data->lookup_table_active = 1; } } } static void v4lprocessing_do_processing(struct v4lprocessing_data *data, unsigned char *buf, const struct v4l2_format *fmt) { int x, y; switch (fmt->fmt.pix.pixelformat) { case V4L2_PIX_FMT_SGBRG8: case V4L2_PIX_FMT_SGRBG8: /* Bayer patterns starting with green */ for (y = 0; y < fmt->fmt.pix.height / 2; y++) { for (x = 0; x < fmt->fmt.pix.width / 2; x++) { *buf = data->green[*buf]; buf++; *buf = data->comp1[*buf]; buf++; } buf += fmt->fmt.pix.bytesperline - fmt->fmt.pix.width; for (x = 0; x < fmt->fmt.pix.width / 2; x++) { *buf = data->comp2[*buf]; buf++; *buf = data->green[*buf]; buf++; } buf += fmt->fmt.pix.bytesperline - fmt->fmt.pix.width; } break; case V4L2_PIX_FMT_SBGGR8: case V4L2_PIX_FMT_SRGGB8: /* Bayer patterns *NOT* starting with green */ for (y = 0; y < fmt->fmt.pix.height / 2; y++) { for (x = 0; x < fmt->fmt.pix.width / 2; x++) { *buf = data->comp1[*buf]; buf++; *buf = data->green[*buf]; buf++; } buf += fmt->fmt.pix.bytesperline - fmt->fmt.pix.width; for (x = 0; x < fmt->fmt.pix.width / 2; x++) { *buf = data->green[*buf]; buf++; *buf = data->comp2[*buf]; buf++; } buf += fmt->fmt.pix.bytesperline - fmt->fmt.pix.width; } break; case V4L2_PIX_FMT_RGB24: case V4L2_PIX_FMT_BGR24: for (y = 0; y < fmt->fmt.pix.height; y++) { for (x = 0; x < fmt->fmt.pix.width; x++) { *buf = data->comp1[*buf]; buf++; *buf = data->green[*buf]; buf++; *buf = data->comp2[*buf]; buf++; } buf += fmt->fmt.pix.bytesperline - 3 * fmt->fmt.pix.width; } break; } } void v4lprocessing_processing(struct v4lprocessing_data *data, unsigned char *buf, const struct v4l2_format *fmt) { if (!data->do_process) return; /* Do we support the current pixformat? */ switch (fmt->fmt.pix.pixelformat) { case V4L2_PIX_FMT_SGBRG8: case V4L2_PIX_FMT_SGRBG8: case V4L2_PIX_FMT_SBGGR8: case V4L2_PIX_FMT_SRGGB8: case V4L2_PIX_FMT_RGB24: case V4L2_PIX_FMT_BGR24: break; default: return; /* Non supported pix format */ } if (v4lcontrol_controls_changed(data->control) || data->lookup_table_update_counter == V4L2PROCESSING_UPDATE_RATE) { v4lprocessing_update_lookup_tables(data, buf, fmt); data->lookup_table_update_counter = 0; } else data->lookup_table_update_counter++; if (data->lookup_table_active) v4lprocessing_do_processing(data, buf, fmt); data->do_process = 0; }