/* * Linux VeeJay * * Copyright(C)2004 Niels Elburg * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * 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 General Public License for more details. * * You should have received a copy of the GNU 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 "common.h" #include #include "chromium.h" vj_effect *chromium_init(int w, int h) { vj_effect *ve = (vj_effect *) vj_calloc(sizeof(vj_effect)); ve->num_params = 1; ve->defaults = (int *) vj_calloc(sizeof(int) * ve->num_params); /* default values */ ve->limits[0] = (int *) vj_calloc(sizeof(int) * ve->num_params); /* min */ ve->limits[1] = (int *) vj_calloc(sizeof(int) * ve->num_params); /* max */ ve->limits[0][0] = 0; ve->limits[1][0] = 9; ve->defaults[0] = 0; ve->description = "Chromium"; ve->parallel = 1; ve->sub_format = -1; ve->extra_frame = 0; ve->has_user = 0; ve->param_description = vje_build_param_list( ve->num_params, "Mode" ); ve->hints = vje_init_value_hint_list( ve->num_params ); vje_build_value_hint_list( ve->hints, ve->limits[1][0], 0, "Chroma Blue", "Chroma Red", "Chroma Red and Blue", "Chroma Swap", "Chroma Yellow", "Chroma Orange", "Chroma Rose", "Chroma Green", "Chroma Purple", "Chroma Yellow swap White" ); return ve; } void chromium_apply(void *ptr, VJFrame *frame, int *args ) { int m = args[0]; const int len = (frame->ssm ? frame->len : frame->uv_len); uint8_t *Cb = frame->data[1]; uint8_t *Cr = frame->data[2]; unsigned int i; double tmp; switch(m){ case 0: for( i = 0; i < len ; i++) { Cb[i] = 0xff - Cb[i]; } break; case 1: for( i = 0; i < len ; i++) { Cr[i] = 0xff - Cr[i]; } break; case 2: for( i = 0; i < len; i++) { Cb[i] = 0xff - Cb[i]; Cr[i] = 0xff - Cr[i]; } break; case 3: // swap cb/cr for (i = 0; i < len ; i++) { tmp = Cb[i]; Cb[i] = Cr[i]; Cr[i] = tmp; } break; case 4: for (i = 0; i < len ; i++) { Cb[i] = 0xff - Cr[i]; } break; case 5: for (i = 0; i < len ; i++) { Cr[i] = 0xff - Cb[i]; } break; case 6: for (i = 0; i < len ; i++) { tmp = Cr[i]; Cr[i] = 0xff - Cb[i]; Cb[i] = 0xff - tmp; } break; case 7: for (i = 0; i < len ; i++) { tmp = Cr[i]; Cr[i] = Cb[i]; Cb[i] = 0xff - tmp; } break; case 8: for (i = 0; i < len ; i++) { tmp = Cr[i]; Cr[i] = 0xff - Cb[i]; Cb[i] = tmp; } break; case 9: // yellow on white for( i = 0; i < len ; i++) { Cb[i] = 0xaa - Cb[i]; } break; } }