/* * Linux VeeJay * * Copyright(C)2002 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 #include #include "transline.h" vj_effect *transline_init(int width, int height) { vj_effect *ve = (vj_effect *) vj_calloc(sizeof(vj_effect)); ve->num_params = 2; 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->defaults[0] = 1; ve->defaults[1] = 1; ve->limits[0][0] = 0; ve->limits[1][0] = (width > height ? width : height); ve->limits[0][1] = 0; ve->limits[1][1] = 1; ve->sub_format = 1; ve->description = "Transition Wipe Cross"; ve->extra_frame = 1; ve->has_user = 0; ve->param_description = vje_build_param_list(ve->num_params, "Speed", "Bounce"); return ve; } typedef struct { float wipePositionX; float wipePositionY; int directionX; int directionY; } wipe_t; void *transline_malloc(int w, int h) { wipe_t *wipe = (wipe_t*) vj_calloc(sizeof(wipe_t)); wipe->directionX = 1; wipe->directionY = 1; return wipe; } void transline_free(void *ptr) { free(ptr); } void transline_apply( void *ptr, VJFrame *frame, VJFrame *frame2, int *args ) { wipe_t *wipe = (wipe_t *)ptr; int width = frame->width; int height = frame->height; int speed = args[0]; int bounce = args[1]; int centerX = width / 2; int centerY = height / 2; double scale = 1.0 * wipe->wipePositionX / width; const int crossWidth = width * scale; const int crossHeight = height * scale; wipe->wipePositionX += speed * wipe->directionX; // Check if the wipe reaches the edge or goes negative if (wipe->wipePositionX >= width || wipe->wipePositionX <= 0) { if (bounce) { wipe->directionX *= -1; } wipe->wipePositionX = (wipe->directionX > 0) ? 0 : centerX; } for (int i = 0; i < height; ++i) { for (int j = 0; j < width; ++j) { int index = i * width + j; // Check if the pixel is inside the cross shape if ((j >= centerX - crossWidth / 2 && j <= centerX + crossWidth / 2) || (i >= centerY - crossHeight / 2 && i <= centerY + crossHeight / 2)) { // Copy the pixel from the second frame frame->data[0][index] = frame2->data[0][index]; frame->data[1][index] = frame2->data[1][index]; frame->data[2][index] = frame2->data[2][index]; } } } }