mirror of
https://github.com/game-stop/veejay.git
synced 2025-12-18 22:00:00 +01:00
116 lines
2.9 KiB
C
116 lines
2.9 KiB
C
/*
|
|
* Linux VeeJay
|
|
*
|
|
* Copyright(C)2002 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 "dither.h"
|
|
|
|
vj_effect *dither_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->defaults[0] = 2;
|
|
ve->defaults[1] = 0;
|
|
|
|
ve->limits[0][0] = 2;
|
|
ve->limits[1][0] = w-1;
|
|
ve->limits[0][1] = 0;
|
|
ve->limits[1][1] = 1;
|
|
|
|
ve->description = "Matrix Dithering";
|
|
ve->sub_format = -1;
|
|
ve->extra_frame = 0;
|
|
ve->has_user = 0;
|
|
|
|
ve->param_description = vje_build_param_list( ve->num_params, "Value", "Mode" );
|
|
|
|
ve->hints = vje_init_value_hint_list( ve->num_params );
|
|
|
|
vje_build_value_hint_list( ve->hints, ve->limits[1][1], 1, "Static", "Random" );
|
|
|
|
return ve;
|
|
}
|
|
|
|
int **dith = NULL;
|
|
int dither_malloc(int w, int h)
|
|
{
|
|
unsigned int i;
|
|
dith = (int**) vj_calloc(sizeof(int*) * w);
|
|
if(!dith)
|
|
return 0;
|
|
for( i = 0; i < w; i ++ ) {
|
|
dith[i] = (int*) vj_calloc(sizeof(int) * w);
|
|
if(!dith[i]) {
|
|
int j;
|
|
for( j = 0; j < i; j ++ )
|
|
if( dith[i] ) free(dith[i]);
|
|
free(dith);
|
|
dith = NULL;
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
void dither_free()
|
|
{
|
|
if(dith) {
|
|
free(dith);
|
|
dith = NULL;
|
|
}
|
|
}
|
|
|
|
static int last_size = 0;
|
|
void dither_apply(VJFrame *frame, int size, int random_on)
|
|
{
|
|
int w_, h_;
|
|
int i, j, d, v, l, m;
|
|
uint8_t *Y = frame->data[0];
|
|
const unsigned int width = frame->width;
|
|
const unsigned int height = frame->height;
|
|
|
|
if( last_size != size || random_on )
|
|
{
|
|
for (l = 0; l < size; l++)
|
|
{
|
|
for (m = 0; m < size; m++)
|
|
{
|
|
dith[l][m] = (int) ((double) (size) * rand() / (RAND_MAX + 1.0));
|
|
}
|
|
}
|
|
last_size = size;
|
|
}
|
|
|
|
for (h_ = 0; h_ < height; h_++)
|
|
{
|
|
j = h_ % size;
|
|
for (w_ = 0; w_ < width; w_++)
|
|
{
|
|
i = w_ % size;
|
|
d = dith[i][j] << 4;
|
|
v = ((long) Y[((h_ * width) + w_)] + d);
|
|
Y[(h_ * width) + w_] = (uint8_t) ((v >> 7) << 7);
|
|
}
|
|
}
|
|
}
|