Files
veejay/veejay-current/veejay-server/libvje/effects/bloom.c
veejay f334e9bb6b WIP
2023-09-08 01:20:29 +02:00

179 lines
4.5 KiB
C

/*
* Linux VeeJay
*
* Copyright(C)2002-2019 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 "bloom.h"
#ifdef STRICT_CHECKING
#include <assert.h>
#endif
vj_effect *bloom_init(int width,int height)
{
vj_effect *ve = (vj_effect *) vj_calloc(sizeof(vj_effect));
ve->num_params = 4;
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] = (width/2)-1;
ve->limits[0][1] = 0;
ve->limits[1][1] = (width/2)-1;
ve->limits[0][2] = 0;
ve->limits[1][2] = (width/2)-1;
ve->limits[0][3] = 0;
ve->limits[1][3] = 255;
ve->defaults[0] = 16;
ve->defaults[1] = 22;
ve->defaults[2] = 41;
ve->defaults[3] = 180;
ve->description = "Bloom (Glow)";
ve->sub_format = -1;
ve->param_description = vje_build_param_list( ve->num_params, "Blur Radius 1", "Blur Radius 2","Blur Radius 3", "Luminance Threshold" );
return ve;
}
typedef struct {
uint8_t *bloom_buf;
} bloom_t;
void *bloom_malloc(int width, int height)
{
bloom_t *b = (bloom_t*) vj_calloc(sizeof(bloom_t));
if(!b) {
return NULL;
}
b->bloom_buf = (uint8_t*) vj_calloc(sizeof(uint8_t) * RUP8(width * height * 8));
if(!b->bloom_buf) {
free(b);
return NULL;
}
return (void*) b;
}
void bloom_free(void *ptr) {
bloom_t *b = (bloom_t*) ptr;
free(b->bloom_buf);
free(b);
}
static void rhblur_apply( uint8_t *dst , uint8_t *src, int w, int h, int r)
{
int y;
for(y = 0; y < h ; y ++ )
{
veejay_blur( dst + y * w, src + y *w , w, r,1, 1);
}
}
static void rvblur_apply( uint8_t *dst, uint8_t *src, int w, int h, int r)
{
int x;
for(x=0; x < w; x++)
{
veejay_blur( dst + x, src + x , h, r, w, w );
}
}
void bloom_apply(void *ptr, VJFrame *frame, int *args) {
int a0 = args[0];
int b0 = args[1];
int c0 = args[2];
int threshold = args[3];
bloom_t *b = (bloom_t*) ptr;
const unsigned int len = frame->len;
int width = frame->width;
int height = frame->height;
uint8_t *L = frame->data[0];
uint8_t *B = b->bloom_buf;
uint8_t *B1h = B + RUP8(len);
uint8_t *B1v = B1h + RUP8(len);
uint8_t *B2h = B1v + RUP8(len);
uint8_t *B2v = B2h + RUP8(len);
uint8_t *B3h = B2v + RUP8(len);
uint8_t *B3v = B3h + RUP8(len);
for( int i = 0; i < len; i ++ ) {
if( L[i] > threshold )
B[i] = L[i];
else
B[i] = 0;
}
// just view threshold mask
if( a0 == 0 && b0 == 0 && c0 == 0 ) {
veejay_memcpy( frame->data[0], B, len );
veejay_memset( frame->data[1], 128, frame->uv_len );
veejay_memset( frame->data[2], 128, frame->uv_len );
return;
}
#pragma omp parallel
{
#pragma omp single
{
#pragma omp task
{
if( a0 > 0 ) {
rhblur_apply( B1h, B, width, height, a0 );
rvblur_apply( B1v, B1h, width, height, a0 );
}
}
#pragma omp task
{
if( b0 > 0 ) {
rhblur_apply( B2h, B, width, height, b0 );
rvblur_apply( B2v, B2h, width, height, b0 );
}
}
#pragma omp task
{
if( c0 > 0 ) {
rhblur_apply( B3h, B, width, height, c0 );
rvblur_apply( B3v, B3h, width, height, c0 );
}
}
#pragma omp taskwait
}
} // end parallel region
for( int i = 0; i < len; i ++ ) {
uint16_t v = B1v[i] + B2v[i] + B3v[i] + L[i];
if( v > 0xff )
v = 0xff; // white
L[i] = (uint8_t) v;
}
}