/*
This file is part of "Filter Foundry", a filter plugin for Adobe Photoshop
Copyright (C) 2003-2009 Toby Thain, toby@telegraphics.com.au
Copyright (C) 2018-2021 Daniel Marschall, ViaThinkSoft
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
*/
#ifdef MAC_ENV
#include <fp.h>
#endif
#include <math.h>
#include <stdlib.h>
#ifndef PARSERTEST
#include "ff.h"
#endif
#include "funcs.h"
#include "y.tab.h"
#include "node.h" // for symbol "var[]"
#define RINT //no rounding for now
//#if TARGET_API_MAC_CARBON
// this is another incompatibility between Classic stdclib and OS X stdclib
// ***FIXME: need to access real OS X includes for Carbon build
//#undef RAND_MAX
//#define RAND_MAX 0x7fffffff
//#endif
extern value_type slider[],cell[],var[],map[][0x100];
extern unsigned char *image_ptr;
double costab[COSTABSIZE];
double tantab[TANTABSIZE];
void init_trigtab(){
int i;
for(i=0;i<COSTABSIZE;++i){
costab
[i
] = cos(FFANGLE
(i
));
}
for(i=0;i<TANTABSIZE;++i){
if (i>=TANTABSIZE/2) {
/* the last '-1' in the expression '512-i-1' is for FilterFactory compatibility, and to avoid the undefined pi/2 area */
tantab[i] = -tantab[TANTABSIZE-i-1];
} else {
tantab
[i
] = tan(FFANGLE
(i
));
}
}
}
/* Channel z for the input pixel at coordinates x,y.
* Coordinates are relative to the input image data (pb->inData) */
static value_type rawsrc(value_type x,value_type y,value_type z){
if (HAS_BIG_DOC(gpb)) {
if (x < BIGDOC_IN_RECT(gpb).left)
x = BIGDOC_IN_RECT(gpb).left;
else if (x >= BIGDOC_IN_RECT(gpb).right)
x = BIGDOC_IN_RECT(gpb).right - 1;
if (y < BIGDOC_IN_RECT(gpb).top)
y = BIGDOC_IN_RECT(gpb).top;
else if (y >= BIGDOC_IN_RECT(gpb).bottom)
y = BIGDOC_IN_RECT(gpb).bottom - 1;
return ((unsigned char*)gpb->inData)[(long)gpb->inRowBytes * (y - BIGDOC_IN_RECT(gpb).top)
+ (long)nplanes * (x - BIGDOC_IN_RECT(gpb).left) + z];
} else {
if (x < IN_RECT(gpb).left)
x = IN_RECT(gpb).left;
else if (x >= IN_RECT(gpb).right)
x = IN_RECT(gpb).right - 1;
if (y < IN_RECT(gpb).top)
y = IN_RECT(gpb).top;
else if (y >= IN_RECT(gpb).bottom)
y = IN_RECT(gpb).bottom - 1;
return ((unsigned char*)gpb->inData)[(long)gpb->inRowBytes * (y - IN_RECT(gpb).top)
+ (long)nplanes * (x - IN_RECT(gpb).left) + z];
}
}
/* src(x,y,z) Channel z for the pixel at coordinates x,y.
* Coordinates are relative to filtered area (selection). */
value_type ff_src(value_type x,value_type y,value_type z){
#ifdef PARSERTEST
return 0;
#else
if(x < 0)
x = 0;
else if(x >= var['X'])
x = var['X']-1;
if(y < 0)
y = 0;
else if(y >= var['Y'])
y = var['Y']-1;
return z >= 0 && z < var['Z'] ?
image_ptr[(long)gpb->inRowBytes*y + (long)nplanes*x + z] : 0;
#endif
}
/* rad(d,m,z) Channel z in the source image, which is m units away,
at an angle of d, from the center of the image */
value_type ff_rad(value_type d,value_type m,value_type z){
return ff_src(ff_r2x(d,m) + var['X']/2, ff_r2y(d,m) + var['Y']/2, z);
}
/* ctl(i) Value of slider i, where i is an integer between 0 and 7, inclusive */
value_type ff_ctl(value_type i){
return i>=0 && i<=7 ? slider[i] : 0;
}
/* val(i,a,b) Value of slider i, mapped onto the range a to b */
value_type ff_val(value_type i,value_type a,value_type b){
return ((long)ff_ctl(i)*(b-a))/255 + a;
}
/* map(i,n) Item n from mapping table i, where i is an integer between
0 and 3, inclusive, and n is and integer between 0 and 255,
inclusive */
value_type ff_map(value_type i,value_type n){
/*
if( i>=0 && i<=3 && n>=0 && n<=255 ){
int H = slider[i*2],L = slider[i*2+1];
return n<=L || H==L ? 0 : ( n>=H ? 255 : ((n-L)*255L)/(H-L) );
}else
return 0;
*/
// this code is from GIMP User Filter
value_type x = ff_ctl(i*2),
y = ff_ctl(i*2+1);
return abs(((long)n
*(y
-x
) / 255)+x
);
}
/* min(a,b) Lesser of a and b */
value_type ff_min(value_type a,value_type b){
return a < b ? a : b;
}
/* max(a,b) Greater of a and b */
value_type ff_max(value_type a,value_type b){
return a > b ? a : b;
}
/* abs(a) Absolute value of a */
value_type ff_abs(value_type a){
}
/* add(a,b,c) Sum of a and b, or c, whichever is lesser */
value_type ff_add(value_type a,value_type b,value_type c){
return ff_min(a+b,c);
}
/* sub(a,b,c) Difference of a and b, or c, whichever is greater */
value_type ff_sub(value_type a,value_type b,value_type c){
return ff_max(ff_dif(a,b),c);
}
/* dif(a,b) Absolute value of the difference of a and b */
value_type ff_dif(value_type a,value_type b){
}
/* rnd(a,b) Random number between a and b, inclusive */
value_type ff_rnd(value_type a,value_type b){
return (int)((abs(a
-b
)+1)*(rand()/(RAND_MAX
+1.
))) + ff_min
(a
,b
);
// return ((unsigned)rand() % (ff_dif(a,b)+1)) + ff_min(a,b);
}
/* mix(a,b,n,d) Mixture of a and b by fraction n/d, a*n/d+b*(d-n)/d */
value_type ff_mix(value_type a,value_type b,value_type n,value_type d){
return d ? ((long)a*n)/d + ((long)b*(d-n))/d : 0;
}
/* scl(a,il,ih,ol,oh) Scale a from input range (il to ih)
to output range (ol to oh) */
value_type ff_scl(value_type a,value_type il,value_type ih,
value_type ol,value_type oh){
return ih==il ? 0 : ol + ((long)(oh-ol)*(a-il))/(ih-il);
}
static uint32_t isqrt(uint32_t x) {
// based on https://gist.github.com/orlp/3481770
static uint32_t lkpSquares[65535];
static int lkpInitialized = 0;
const uint32_t *p;
int i;
while (lkpInitialized == 1) { /* If other thread is currently creating the lookup table, then wait */ }
if (!lkpInitialized) {
lkpInitialized = 1;
for (i = 0; i < 65535; ++i) {
lkpSquares[i] = i * i;
}
lkpInitialized = 2;
}
p = lkpSquares;
if (p[32768] <= x) p += 32768;
if (p[16384] <= x) p += 16384;
if (p[8192] <= x) p += 8192;
if (p[4096] <= x) p += 4096;
if (p[2048] <= x) p += 2048;
if (p[1024] <= x) p += 1024;
if (p[512] <= x) p += 512;
if (p[256] <= x) p += 256;
if (p[128] <= x) p += 128;
if (p[64] <= x) p += 64;
if (p[32] <= x) p += 32;
if (p[16] <= x) p += 16;
if (p[8] <= x) p += 8;
if (p[4] <= x) p += 4;
if (p[2] <= x) p += 2;
if (p[1] <= x) p += 1;
return (uint32_t)(p - lkpSquares);
}
/* sqr(x) Square root of x */
value_type ff_sqr(value_type x){
return x < 0 ? 0 : isqrt(x);
}
/* sin(x) Sine function of x, where x is an integer between 0 and
1024, inclusive, and the value returned is an integer
between -512 and 512, inclusive (Windows) or -1024 and
1024, inclusive (Mac OS) */
value_type ff_sin(value_type x){
//return RINT(TRIGAMP*sin(FFANGLE(x)));
return ff_cos(x-256);
}
/* cos(x) Cosine function of x, where x is an integer between 0 and
1024, inclusive, and the value returned is an integer
between -512 and 512, inclusive (Windows) or -1024 and
1024, inclusive (Mac OS) */
value_type ff_cos(value_type x){
//return RINT(TRIGAMP*cos(FFANGLE(x)));
return (value_type
)RINT
(TRIGAMP
*costab
[abs(x
) % COSTABSIZE
]);
}
/* tan(x) Tangent function of x, where x is an integer
between -256 and 256, inclusive. Althought the Filter Factory manual
stated that the return value is bounded to -512 and 512, inclusive (Windows) or
-1024 and 1024, inclusive (Mac OS), the output is actually NOT bounded! */
value_type ff_tan(value_type x){
// Following filter shows that the Filter Factory manual differs from the implementation.
// R = cos(x) > 1024 || cos(x) < -1024 || cos(-x) > 1024 || cos(-x) < -1024 ? 255 : 0
// G = tan(x) > 1024 || tan(x) < -1024 || tan(-x) > 1024 || tan(-x) < -1024 ? 255 : 0
// B = sin(x) > 1024 || sin(x) < -1024 || sin(-x) > 1024 || sin(-x) < -1024 ? 255 : 0
// It outputs green stripes, showing that the output of tan() is not bounded.
// So, we do it the same way to stay compatible.
if (x < 0) x--; /* required for Filter Factory compatibility */
while (x < 0) x += TANTABSIZE;
return (value_type)RINT(2*TRIGAMP*tantab[x % TANTABSIZE]); // We need the x2 multiplicator for some reason
}
/* r2x(d,m) x displacement of the pixel m units away, at an angle of d,
from an arbitrary center */
value_type ff_r2x(value_type d,value_type m){
return (value_type
)RINT
(m
*costab
[abs(d
) % COSTABSIZE
]);
}
/* r2y(d,m) y displacement of the pixel m units away, at an angle of d,
from an arbitrary center */
value_type ff_r2y(value_type d,value_type m){
return (value_type
)RINT
(m
*costab
[abs(d
-256) % COSTABSIZE
]);
}
/* Attention! This is NOT a function. It is internally used to calculate the variable "d". */
value_type ff_c2d_negated(value_type x, value_type y) {
// NOTE: FilterFactory uses c2d(x,y):=atan2(y,x), but d:=atan2(-y,-x)
// Due to compatibility reasons, we implement it the same way!
// Sign of y difference is negated, as we are dealing with top-down coordinates angle is "observed"
return (value_type
)RINT
(TO_FFANGLE
(atan2(-y
,-x
)));
}
/* c2d(x,y) Angle displacement of the pixel at coordinates x,y */
value_type ff_c2d(value_type x,value_type y){
// Behavior of FilterFoundry <1.7:
//return ff_c2d_negated(x,y);
// Behavior in FilterFoundry 1.7+: Matches FilterFactory
return (value_type
)RINT
(TO_FFANGLE
(atan2(y
,x
)));
}
/* c2m(x,y) Magnitude displacement of the pixel at coordinates x,y */
value_type ff_c2m(value_type x,value_type y){
return isqrt((long)x*x + (long)y*y);
}
/* get(i) Returns the current cell value at i */
value_type ff_get(value_type i){
// Filter Factory:
//return i>=0 && i<NUM_CELLS ? cell[i] : i;
// Filter Foundry:
return i>=0 && i<NUM_CELLS ? cell[i] : 0;
}
/* put(v,i) Puts the new value v into cell i */
value_type ff_put(value_type v,value_type i){
if(i>=0 && i<NUM_CELLS)
cell[i] = v;
return v;
}
/* Convolve. Applies a convolution matrix and divides with d. */
value_type ff_cnv(value_type m11,value_type m12,value_type m13,
value_type m21,value_type m22,value_type m23,
value_type m31,value_type m32,value_type m33,
value_type d)
{
#ifdef PARSERTEST
return 0;
#else
long total;
int x, y, z;
// shift x,y from selection-relative to image relative
if (HAS_BIG_DOC(gpb)) {
x = var['x'] + BIGDOC_FILTER_RECT(gpb).left;
y = var['y'] + BIGDOC_FILTER_RECT(gpb).top;
} else {
x = var['x'] + FILTER_RECT(gpb).left;
y = var['y'] + FILTER_RECT(gpb).top;
}
z = var['z'];
if(z >= 0 && z < var['Z'])
total = m11*rawsrc(x-1,y-1,z) + m12*rawsrc(x,y-1,z) + m13*rawsrc(x+1,y-1,z)
+ m21*rawsrc(x-1,y, z) + m22*rawsrc(x,y, z) + m23*rawsrc(x+1,y, z)
+ m31*rawsrc(x-1,y+1,z) + m32*rawsrc(x,y+1,z) + m33*rawsrc(x+1,y+1,z);
else
total = 0;
return d ? total/d : 0;
#endif
}
/* rst(i) sets a random seed and returns 0. (undocumented Filter Factory function).
Added by DM, 18 Dec 2018 */
value_type ff_rst(value_type seed){
return 0;
}
value_type zero_val = 0;
value_type one_val = 1;
value_type max_channel_val = 255;
/* predefined symbols */
struct sym_rec predefs[]={
/* functions */
{0,TOK_FN3,"src", (pfunc_type)ff_src, 0},
{0,TOK_FN3,"rad", (pfunc_type)ff_rad, 0},
{0,TOK_FN1,"ctl", (pfunc_type)ff_ctl, 0},
{0,TOK_FN3,"val", (pfunc_type)ff_val, 0},
{0,TOK_FN2,"map", (pfunc_type)ff_map, 0},
{0,TOK_FN2,"min", (pfunc_type)ff_min, 0},
{0,TOK_FN2,"max", (pfunc_type)ff_max, 0},
{0,TOK_FN1,"abs", (pfunc_type)ff_abs, 0},
{0,TOK_FN3,"add", (pfunc_type)ff_add, 0},
{0,TOK_FN3,"sub", (pfunc_type)ff_sub, 0},
{0,TOK_FN2,"dif", (pfunc_type)ff_dif, 0},
{0,TOK_FN2,"rnd", (pfunc_type)ff_rnd, 0},
{0,TOK_FN4,"mix", (pfunc_type)ff_mix, 0},
{0,TOK_FN5,"scl", (pfunc_type)ff_scl, 0},
{0,TOK_FN1,"sqr", (pfunc_type)ff_sqr, 0},
{0,TOK_FN1,"sqrt", (pfunc_type)ff_sqr, 0}, // sqrt() is synonym to sqr() in Premiere
{0,TOK_FN1,"sin", (pfunc_type)ff_sin, 0},
{0,TOK_FN1,"cos", (pfunc_type)ff_cos, 0},
{0,TOK_FN1,"tan", (pfunc_type)ff_tan, 0},
{0,TOK_FN2,"r2x", (pfunc_type)ff_r2x, 0},
{0,TOK_FN2,"r2y", (pfunc_type)ff_r2y, 0},
{0,TOK_FN2,"c2d", (pfunc_type)ff_c2d, 0},
{0,TOK_FN2,"c2m", (pfunc_type)ff_c2m, 0},
{0,TOK_FN1,"get", (pfunc_type)ff_get, 0},
{0,TOK_FN2,"put", (pfunc_type)ff_put, 0},
{0,TOK_FN10,"cnv",(pfunc_type)ff_cnv, 0},
{0,TOK_FN1,"rst", (pfunc_type)ff_rst, 0}, // undocumented FilterFactory function
/* predefined variables (names with more than 1 character); most of them are undocumented in FilterFactory */
/* the predefined variables with 1 character are defined in lexer.l and process.c */
/* in this table, you must not add TOK_VAR with only 1 character (since this case is not defined in parser.y) */
{0,TOK_VAR,"rmax",0, &max_channel_val}, // alias of 'R' (defined in lexer.l, line 129)
{0,TOK_VAR,"gmax",0, &max_channel_val}, // alias of 'G' (defined in lexer.l, line 129)
{0,TOK_VAR,"bmax",0, &max_channel_val}, // alias of 'B' (defined in lexer.l, line 129)
{0,TOK_VAR,"amax",0, &max_channel_val}, // alias of 'A' (defined in lexer.l, line 129)
{0,TOK_VAR,"cmax",0, &max_channel_val}, // alias of 'C' (defined in lexer.l, line 129)
{0,TOK_VAR,"imax",0, &max_channel_val}, // alias of 'I' (defined in lexer.l, line 129)
{0,TOK_VAR,"umax",0, &max_channel_val}, // alias of 'U' (defined in lexer.l, line 129)
{0,TOK_VAR,"vmax",0, &max_channel_val}, // alias of 'V' (defined in lexer.l, line 129)
{0,TOK_VAR,"dmax",0, &var['D']},
{0,TOK_VAR,"mmax",0, &var['M']},
{0,TOK_VAR,"pmax",0, &var['Z']},
{0,TOK_VAR,"xmax",0, &var['X']},
{0,TOK_VAR,"ymax",0, &var['Y']},
{0,TOK_VAR,"zmax",0, &var['Z']},
{0,TOK_VAR,"rmin",0, &zero_val},
{0,TOK_VAR,"gmin",0, &zero_val},
{0,TOK_VAR,"bmin",0, &zero_val},
{0,TOK_VAR,"amin",0, &zero_val},
{0,TOK_VAR,"cmin",0, &zero_val},
{0,TOK_VAR,"imin",0, &zero_val},
{0,TOK_VAR,"umin",0, &zero_val},
{0,TOK_VAR,"vmin",0, &zero_val},
{0,TOK_VAR,"dmin",0, &zero_val},
{0,TOK_VAR,"mmin",0, &zero_val},
{0,TOK_VAR,"pmin",0, &zero_val},
{0,TOK_VAR,"xmin",0, &zero_val},
{0,TOK_VAR,"ymin",0, &zero_val},
{0,TOK_VAR,"zmin",0, &zero_val},
/* Undocumented synonyms of FilterFactory for compatibility with Premiere */
{0,TOK_FN10,"cnv0",(pfunc_type)ff_cnv, 0},
{0,TOK_FN3,"src0", (pfunc_type)ff_src, 0},
{0,TOK_FN3,"rad0", (pfunc_type)ff_rad, 0},
{0,TOK_FN10,"cnv1",(pfunc_type)ff_cnv, 0},
{0,TOK_FN3,"src1", (pfunc_type)ff_src, 0},
{0,TOK_FN3,"rad1", (pfunc_type)ff_rad, 0},
{0,TOK_VAR,"r0",0, &var['r']},
{0,TOK_VAR,"g0",0, &var['g']},
{0,TOK_VAR,"b0",0, &var['b']},
{0,TOK_VAR,"a0",0, &var['a']},
{0,TOK_VAR,"c0",0, &var['c']},
{0,TOK_VAR,"i0",0, &var['i']},
{0,TOK_VAR,"u0",0, &var['u']},
{0,TOK_VAR,"v0",0, &var['v']},
{0,TOK_VAR,"d0",0, &var['d']},
{0,TOK_VAR,"m0",0, &var['m']},
{0,TOK_VAR,"r1",0, &var['r']},
{0,TOK_VAR,"g1",0, &var['g']},
{0,TOK_VAR,"b1",0, &var['b']},
{0,TOK_VAR,"a1",0, &var['a']},
{0,TOK_VAR,"c1",0, &var['c']},
{0,TOK_VAR,"i1",0, &var['i']},
{0,TOK_VAR,"u1",0, &var['u']},
{0,TOK_VAR,"v1",0, &var['v']},
{0,TOK_VAR,"d1",0, &var['d']},
{0,TOK_VAR,"m1",0, &var['m']},
{0,TOK_VAR,"tmin",0, &zero_val},
{0,TOK_VAR,"tmax",0, &one_val},
{0,TOK_VAR,"total",0, &one_val},
{0,0,0,0,0}
};