mirror of
https://github.com/game-stop/veejay.git
synced 2025-12-17 13:20:01 +01:00
242 lines
5.2 KiB
C
242 lines
5.2 KiB
C
/*
|
|
* Linux VeeJay
|
|
*
|
|
* Copyright(C)2004 Niels Elburg <nwelburg@gmail.com>
|
|
*
|
|
* 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 <veejaycore/vjmem.h>
|
|
#include "fisheye.h"
|
|
|
|
vj_effect *fisheye_init(int w, int h)
|
|
{
|
|
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->limits[0][0] = -1000;
|
|
ve->limits[1][0] = 1000;
|
|
ve->limits[0][1] = 0;
|
|
ve->limits[1][1] = 1;
|
|
ve->defaults[0] = 1;
|
|
ve->defaults[1] = 0;
|
|
ve->description = "Fish Eye";
|
|
ve->sub_format = 1;
|
|
ve->extra_frame = 0;
|
|
ve->has_user = 0;
|
|
ve->param_description = vje_build_param_list( ve->num_params, "Curve", "Mask to Alpha" );
|
|
ve->alpha = FLAG_ALPHA_OUT | FLAG_ALPHA_OPTIONAL | FLAG_ALPHA_SRC_A;
|
|
return ve;
|
|
}
|
|
|
|
typedef struct {
|
|
int _v;
|
|
double *polar_map;
|
|
double *fish_angle;
|
|
int *cached_coords;
|
|
uint8_t *buf[3];
|
|
} fisheye_t;
|
|
|
|
void *fisheye_malloc(int w, int h)
|
|
{
|
|
int x,y;
|
|
int h2=h/2;
|
|
int w2=w/2;
|
|
int p =0;
|
|
|
|
fisheye_t *f = (fisheye_t*) vj_calloc(sizeof(fisheye_t));
|
|
if(!f) {
|
|
return NULL;
|
|
}
|
|
|
|
f->buf[0] = (uint8_t*) vj_malloc(sizeof(uint8_t) * RUP8(w * h * 3 ) );
|
|
if(!f->buf[0]) {
|
|
fisheye_free(f);
|
|
return NULL;
|
|
}
|
|
|
|
f->buf[1] = f->buf[0] + (w*h);
|
|
f->buf[2] = f->buf[1] + (w*h);
|
|
|
|
f->polar_map = (double*) vj_calloc(sizeof(double) * RUP8(w* h) );
|
|
if(!f->polar_map) {
|
|
fisheye_free(f);
|
|
return NULL;
|
|
}
|
|
|
|
f->fish_angle = (double*) vj_calloc(sizeof(double) * RUP8(w* h) );
|
|
if(!f->fish_angle) {
|
|
fisheye_free(f);
|
|
return NULL;
|
|
}
|
|
|
|
f->cached_coords = (int*) vj_calloc(sizeof(int) * RUP8( w * h));
|
|
if(!f->cached_coords) {
|
|
fisheye_free(f);
|
|
return NULL;
|
|
}
|
|
|
|
for(y=(-1 *h2); y < (h-h2); y++)
|
|
{
|
|
for(x= (-1 * w2); x < (w-w2); x++)
|
|
{
|
|
double res;
|
|
fast_sqrt( res,(double) (y*y+x*x));
|
|
p = (h2+y)*w+(w2+x);
|
|
f->polar_map[p] = res;
|
|
f->fish_angle[p] = atan2( (float) y, x);
|
|
}
|
|
}
|
|
|
|
return (void*) f;
|
|
}
|
|
|
|
void fisheye_free(void *ptr)
|
|
{
|
|
fisheye_t *f = (fisheye_t*) ptr;
|
|
if(f->buf[0]) {
|
|
free(f->buf[0]);
|
|
}
|
|
if(f->polar_map) free(f->polar_map);
|
|
if(f->fish_angle) free(f->fish_angle);
|
|
if(f->cached_coords) free(f->cached_coords);
|
|
|
|
free(f);
|
|
}
|
|
|
|
static double __fisheye(double r,double v, double e)
|
|
{
|
|
return (exp( r / v )-1) / e;
|
|
}
|
|
|
|
static double __fisheye_i(double r, double v, double e)
|
|
{
|
|
return v * log(1 + e * r);
|
|
}
|
|
|
|
void fisheye_apply(void *ptr, VJFrame *frame, int *args) {
|
|
int v = args[0];
|
|
int alpha = args[1];
|
|
|
|
fisheye_t *f = (fisheye_t*) ptr;
|
|
|
|
int i;
|
|
double (*pf)(double a, double b, double c);
|
|
const unsigned int width = frame->width;
|
|
const unsigned int height = frame->height;
|
|
const int len = frame->len;
|
|
uint8_t *Y = frame->data[0];
|
|
uint8_t *Cb = frame->data[1];
|
|
uint8_t *Cr = frame->data[2];
|
|
|
|
double *polar_map = f->polar_map;
|
|
double *fish_angle = f->fish_angle;
|
|
int *cached_coords = f->cached_coords;
|
|
uint8_t **buf = f->buf;
|
|
|
|
if( v==0) v =1;
|
|
|
|
if( v < 0 ) {
|
|
pf = &__fisheye_i;
|
|
v = v * -1;
|
|
}
|
|
else {
|
|
pf = &__fisheye;
|
|
}
|
|
|
|
if( v != f->_v )
|
|
{
|
|
const double curve = 0.001 * v;
|
|
const unsigned int R = height/2;
|
|
const double coeef = R / log(curve * R + 1);
|
|
/* pre calculate */
|
|
int px,py;
|
|
double r,a,co,si;
|
|
const int w2 = width/2;
|
|
const int h2 = height/2;
|
|
|
|
for(i=0; i < len; i++)
|
|
{
|
|
r = polar_map[i];
|
|
a = fish_angle[i];
|
|
if(r <= R)
|
|
{
|
|
r = pf( r, coeef, curve );
|
|
sin_cos( si,co, a);
|
|
px =(int) ( r * co);
|
|
py =(int) ( r * si);
|
|
|
|
px += w2;
|
|
py += h2;
|
|
|
|
if(px < 0) px =0;
|
|
if(px > width) px = width;
|
|
if(py < 0) py = 0;
|
|
if(py >= (height-1)) py = height-1;
|
|
|
|
cached_coords[i] = (py * width)+px;
|
|
}
|
|
else
|
|
{
|
|
cached_coords[i] = -1;
|
|
|
|
}
|
|
}
|
|
f->_v = v;
|
|
}
|
|
|
|
veejay_memcpy(buf[0], Y,(len));
|
|
veejay_memcpy(buf[1], Cb,(len));
|
|
veejay_memcpy(buf[2], Cr,(len));
|
|
|
|
if( alpha == 0 ) {
|
|
for(i=0; i < len; i++)
|
|
{
|
|
if(cached_coords[i] == -1)
|
|
{
|
|
Y[i] = pixel_Y_lo_;
|
|
Cb[i] = 128;
|
|
Cr[i] = 128;
|
|
}
|
|
else
|
|
{
|
|
Y[i] = buf[0][ cached_coords[i] ];
|
|
Cb[i] = buf[1][ cached_coords[i] ];
|
|
Cr[i] = buf[2][ cached_coords[i] ];
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
uint8_t *A = frame->data[3];
|
|
for(i=0; i < len; i++)
|
|
{
|
|
if(cached_coords[i] == -1)
|
|
{
|
|
A[i] = 0;
|
|
}
|
|
else
|
|
{
|
|
A[i] = buf[0][ cached_coords[i] ];
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|