| 1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
| 1 |
> |
/* Copyright (c) 1992 Regents of the University of California */ |
| 2 |
|
|
| 3 |
|
#ifndef lint |
| 4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
| 14 |
|
|
| 15 |
|
#include "otypes.h" |
| 16 |
|
|
| 17 |
+ |
#include "func.h" |
| 18 |
|
|
| 18 |
– |
typedef struct { |
| 19 |
– |
double xfm[4][4]; /* transform matrix */ |
| 20 |
– |
double sca; /* scalefactor */ |
| 21 |
– |
} XF; |
| 19 |
|
|
| 20 |
< |
static OBJREC *fobj; /* current function object */ |
| 21 |
< |
static RAY *fray; /* current function ray */ |
| 22 |
< |
static XF fxf; /* current transformation */ |
| 20 |
> |
#define INITFILE "rayinit.cal" |
| 21 |
> |
#define CALSUF ".cal" |
| 22 |
> |
#define LCALSUF 4 |
| 23 |
> |
char REFVNAME[] = "`FILE_REFCNT"; |
| 24 |
|
|
| 25 |
+ |
XF unitxf = { /* identity transform */ |
| 26 |
+ |
{{1.0, 0.0, 0.0, 0.0}, |
| 27 |
+ |
{0.0, 1.0, 0.0, 0.0}, |
| 28 |
+ |
{0.0, 0.0, 1.0, 0.0}, |
| 29 |
+ |
{0.0, 0.0, 0.0, 1.0}}, |
| 30 |
+ |
1.0 |
| 31 |
+ |
}; |
| 32 |
|
|
| 33 |
< |
setmap(m, r, xfm, sca) /* set channels for function call */ |
| 33 |
> |
XF funcxf; /* current transformation */ |
| 34 |
> |
static OBJREC *fobj = NULL; /* current function object */ |
| 35 |
> |
static RAY *fray = NULL; /* current function ray */ |
| 36 |
> |
|
| 37 |
> |
static double l_erf(), l_erfc(), l_arg(); |
| 38 |
> |
|
| 39 |
> |
|
| 40 |
> |
MFUNC * |
| 41 |
> |
getfunc(m, ff, ef, dofwd) /* get function for this modifier */ |
| 42 |
|
OBJREC *m; |
| 43 |
< |
register RAY *r; |
| 44 |
< |
double xfm[4][4]; |
| 45 |
< |
double sca; |
| 43 |
> |
int ff; |
| 44 |
> |
unsigned ef; |
| 45 |
> |
int dofwd; |
| 46 |
|
{ |
| 47 |
< |
extern double l_noise3(), l_noise3a(), l_noise3b(), l_noise3c(); |
| 48 |
< |
extern double l_hermite(), l_fnoise3(), l_arg(); |
| 49 |
< |
extern long eclock; |
| 50 |
< |
static char *initfile = "rayinit.cal"; |
| 51 |
< |
|
| 52 |
< |
if (initfile != NULL) { |
| 47 |
> |
extern EPNODE *curfunc; |
| 48 |
> |
static char initfile[] = INITFILE; |
| 49 |
> |
char sbuf[MAXSTR]; |
| 50 |
> |
register char **arg; |
| 51 |
> |
register MFUNC *f; |
| 52 |
> |
int ne, na; |
| 53 |
> |
register int i; |
| 54 |
> |
/* check to see if done already */ |
| 55 |
> |
if ((f = (MFUNC *)m->os) != NULL) |
| 56 |
> |
return(f); |
| 57 |
> |
fobj = NULL; fray = NULL; |
| 58 |
> |
if (initfile[0]) { /* initialize on first call */ |
| 59 |
> |
setcontext(""); |
| 60 |
> |
scompile("Dx=$1;Dy=$2;Dz=$3;", NULL, 0); |
| 61 |
> |
scompile("Nx=$4;Ny=$5;Nz=$6;", NULL, 0); |
| 62 |
> |
scompile("Px=$7;Py=$8;Pz=$9;", NULL, 0); |
| 63 |
> |
scompile("T=$10;Ts=$25;Rdot=$11;", NULL, 0); |
| 64 |
> |
scompile("S=$12;Tx=$13;Ty=$14;Tz=$15;", NULL, 0); |
| 65 |
> |
scompile("Ix=$16;Iy=$17;Iz=$18;", NULL, 0); |
| 66 |
> |
scompile("Jx=$19;Jy=$20;Jz=$21;", NULL, 0); |
| 67 |
> |
scompile("Kx=$22;Ky=$23;Kz=$24;", NULL, 0); |
| 68 |
> |
funset("arg", 1, '=', l_arg); |
| 69 |
> |
funset("erf", 1, ':', l_erf); |
| 70 |
> |
funset("erfc", 1, ':', l_erfc); |
| 71 |
> |
setnoisefuncs(); |
| 72 |
> |
setprismfuncs(); |
| 73 |
|
loadfunc(initfile); |
| 74 |
< |
scompile(NULL, "Dx=$1;Dy=$2;Dz=$3;"); |
| 42 |
< |
scompile(NULL, "Nx=$4;Ny=$5;Nz=$6;"); |
| 43 |
< |
scompile(NULL, "Px=$7;Py=$8;Pz=$9;"); |
| 44 |
< |
scompile(NULL, "T=$10;Rdot=$11;"); |
| 45 |
< |
funset("arg", 1, l_arg); |
| 46 |
< |
funset("noise3", 3, l_noise3); |
| 47 |
< |
funset("noise3a", 3, l_noise3a); |
| 48 |
< |
funset("noise3b", 3, l_noise3b); |
| 49 |
< |
funset("noise3c", 3, l_noise3c); |
| 50 |
< |
funset("hermite", 5, l_hermite); |
| 51 |
< |
funset("fnoise3", 3, l_fnoise3); |
| 52 |
< |
initfile = NULL; |
| 74 |
> |
initfile[0] = '\0'; |
| 75 |
|
} |
| 76 |
< |
fobj = m; |
| 77 |
< |
fray = r; |
| 78 |
< |
fxf.sca = r->ros * sca; |
| 79 |
< |
multmat4(fxf.xfm, r->rox, xfm); |
| 80 |
< |
eclock++; /* notify expression evaluator */ |
| 76 |
> |
if ((na = m->oargs.nsargs) <= ff) |
| 77 |
> |
goto toofew; |
| 78 |
> |
arg = m->oargs.sarg; |
| 79 |
> |
if ((f = (MFUNC *)calloc(1, sizeof(MFUNC))) == NULL) |
| 80 |
> |
goto memerr; |
| 81 |
> |
i = strlen(arg[ff]); /* set up context */ |
| 82 |
> |
if (i == 1 && arg[ff][0] == '.') |
| 83 |
> |
setcontext(f->ctx = ""); /* "." means no file */ |
| 84 |
> |
else { |
| 85 |
> |
strcpy(sbuf,arg[ff]); /* file name is context */ |
| 86 |
> |
if (i > LCALSUF && !strcmp(sbuf+i-LCALSUF, CALSUF)) |
| 87 |
> |
sbuf[i-LCALSUF] = '\0'; /* remove suffix */ |
| 88 |
> |
setcontext(f->ctx = savestr(sbuf)); |
| 89 |
> |
if (!vardefined(REFVNAME)) { /* file loaded? */ |
| 90 |
> |
loadfunc(arg[ff]); |
| 91 |
> |
varset(REFVNAME, '=', 1.0); |
| 92 |
> |
} else /* reference_count++ */ |
| 93 |
> |
varset(REFVNAME, '=', varvalue(REFVNAME)+1.0); |
| 94 |
> |
} |
| 95 |
> |
curfunc = NULL; /* parse expressions */ |
| 96 |
> |
sprintf(sbuf, "%s \"%s\"", ofun[m->otype].funame, m->oname); |
| 97 |
> |
for (i=0, ne=0; ef && i < na; i++, ef>>=1) |
| 98 |
> |
if (ef & 1) { /* flagged as an expression? */ |
| 99 |
> |
if (ne >= MAXEXPR) |
| 100 |
> |
objerror(m, INTERNAL, "too many expressions"); |
| 101 |
> |
initstr(arg[i], sbuf, 0); |
| 102 |
> |
f->ep[ne++] = getE1(); |
| 103 |
> |
if (nextc != EOF) |
| 104 |
> |
syntax("unexpected character"); |
| 105 |
> |
} |
| 106 |
> |
if (ef) |
| 107 |
> |
goto toofew; |
| 108 |
> |
if (i <= ff) /* find transform args */ |
| 109 |
> |
i = ff+1; |
| 110 |
> |
while (i < na && arg[i][0] != '-') |
| 111 |
> |
i++; |
| 112 |
> |
if (i == na) /* no transform */ |
| 113 |
> |
f->f = f->b = &unitxf; |
| 114 |
> |
else { /* get transform */ |
| 115 |
> |
if ((f->b = (XF *)malloc(sizeof(XF))) == NULL) |
| 116 |
> |
goto memerr; |
| 117 |
> |
if (invxf(f->b, na-i, arg+i) != na-i) |
| 118 |
> |
objerror(m, USER, "bad transform"); |
| 119 |
> |
if (f->b->sca < 0.0) |
| 120 |
> |
f->b->sca = -f->b->sca; |
| 121 |
> |
if (dofwd) { /* do both transforms */ |
| 122 |
> |
if ((f->f = (XF *)malloc(sizeof(XF))) == NULL) |
| 123 |
> |
goto memerr; |
| 124 |
> |
xf(f->f, na-i, arg+i); |
| 125 |
> |
if (f->f->sca < 0.0) |
| 126 |
> |
f->f->sca = -f->f->sca; |
| 127 |
> |
} |
| 128 |
> |
} |
| 129 |
> |
m->os = (char *)f; |
| 130 |
> |
return(f); |
| 131 |
> |
toofew: |
| 132 |
> |
objerror(m, USER, "too few string arguments"); |
| 133 |
> |
memerr: |
| 134 |
> |
error(SYSTEM, "out of memory in getfunc"); |
| 135 |
|
} |
| 136 |
|
|
| 137 |
|
|
| 138 |
< |
setfunc(m, r) /* simplified interface to setmap */ |
| 139 |
< |
register OBJREC *m; |
| 64 |
< |
RAY *r; |
| 138 |
> |
freefunc(m) /* free memory associated with modifier */ |
| 139 |
> |
OBJREC *m; |
| 140 |
|
{ |
| 141 |
< |
register XF *mxf; |
| 141 |
> |
register MFUNC *f; |
| 142 |
> |
register int i; |
| 143 |
|
|
| 144 |
< |
if ((mxf = (XF *)m->os) == NULL) { |
| 145 |
< |
register int n = m->oargs.nsargs; |
| 146 |
< |
register char **sa = m->oargs.sarg; |
| 147 |
< |
|
| 148 |
< |
while (n > 0 && **sa != '-') { |
| 149 |
< |
n--; |
| 150 |
< |
sa++; |
| 151 |
< |
} |
| 152 |
< |
mxf = (XF *)malloc(sizeof(XF)); |
| 153 |
< |
if (mxf == NULL) |
| 154 |
< |
goto memerr; |
| 155 |
< |
mxf->sca = 1.0; |
| 80 |
< |
setident4(mxf->xfm); |
| 81 |
< |
if (invxf(mxf->xfm, &mxf->sca, n, sa) != n) |
| 82 |
< |
objerror(m, USER, "bad transform"); |
| 83 |
< |
if (mxf->sca < 0.0) |
| 84 |
< |
mxf->sca = -mxf->sca; |
| 85 |
< |
m->os = (char *)mxf; |
| 144 |
> |
if ((f = (MFUNC *)m->os) == NULL) |
| 145 |
> |
return; |
| 146 |
> |
for (i = 0; f->ep[i] != NULL; i++) |
| 147 |
> |
epfree(f->ep[i]); |
| 148 |
> |
if (f->ctx[0]) { /* done with definitions */ |
| 149 |
> |
setcontext(f->ctx); |
| 150 |
> |
i = varvalue(REFVNAME)-.5; /* reference_count-- */ |
| 151 |
> |
if (i > 0) |
| 152 |
> |
varset(REFVNAME, '=', (double)i); |
| 153 |
> |
else |
| 154 |
> |
dcleanup(2); /* remove definitions */ |
| 155 |
> |
freestr(f->ctx); |
| 156 |
|
} |
| 157 |
< |
setmap(m, r, mxf->xfm, mxf->sca); |
| 158 |
< |
return; |
| 159 |
< |
memerr: |
| 160 |
< |
error(SYSTEM, "out of memory in setfunc"); |
| 161 |
< |
#undef mxf |
| 157 |
> |
if (f->b != &unitxf) |
| 158 |
> |
free((char *)f->b); |
| 159 |
> |
if (f->f != NULL && f->f != &unitxf) |
| 160 |
> |
free((char *)f->f); |
| 161 |
> |
free((char *)f); |
| 162 |
> |
m->os = NULL; |
| 163 |
|
} |
| 164 |
|
|
| 165 |
|
|
| 166 |
+ |
setfunc(m, r) /* set channels for function call */ |
| 167 |
+ |
OBJREC *m; |
| 168 |
+ |
register RAY *r; |
| 169 |
+ |
{ |
| 170 |
+ |
static unsigned long lastrno = ~0; |
| 171 |
+ |
register MFUNC *f; |
| 172 |
+ |
/* get function */ |
| 173 |
+ |
if ((f = (MFUNC *)m->os) == NULL) |
| 174 |
+ |
error(m, CONSISTENCY, "setfunc called before getfunc"); |
| 175 |
+ |
/* set evaluator context */ |
| 176 |
+ |
setcontext(f->ctx); |
| 177 |
+ |
/* check to see if matrix set */ |
| 178 |
+ |
if (m == fobj && r->rno == lastrno) |
| 179 |
+ |
return(0); |
| 180 |
+ |
fobj = m; |
| 181 |
+ |
fray = r; |
| 182 |
+ |
if (r->rox != NULL) |
| 183 |
+ |
if (f->b != &unitxf) { |
| 184 |
+ |
funcxf.sca = r->rox->b.sca * f->b->sca; |
| 185 |
+ |
multmat4(funcxf.xfm, r->rox->b.xfm, f->b->xfm); |
| 186 |
+ |
} else |
| 187 |
+ |
copystruct(&funcxf, &r->rox->b); |
| 188 |
+ |
else |
| 189 |
+ |
copystruct(&funcxf, f->b); |
| 190 |
+ |
lastrno = r->rno; |
| 191 |
+ |
eclock++; /* notify expression evaluator */ |
| 192 |
+ |
return(1); |
| 193 |
+ |
} |
| 194 |
+ |
|
| 195 |
+ |
|
| 196 |
|
loadfunc(fname) /* load definition file */ |
| 197 |
|
char *fname; |
| 198 |
|
{ |
| 199 |
|
extern char *libpath; /* library search path */ |
| 200 |
|
char *ffname; |
| 201 |
|
|
| 202 |
< |
if ((ffname = getpath(fname, libpath)) == NULL) { |
| 202 |
> |
if ((ffname = getpath(fname, libpath, R_OK)) == NULL) { |
| 203 |
|
sprintf(errmsg, "cannot find function file \"%s\"", fname); |
| 204 |
|
error(USER, errmsg); |
| 205 |
|
} |
| 207 |
|
} |
| 208 |
|
|
| 209 |
|
|
| 210 |
< |
double |
| 210 |
> |
static double |
| 211 |
|
l_arg() /* return nth real argument */ |
| 212 |
|
{ |
| 213 |
|
extern double argument(); |
| 214 |
|
register int n; |
| 215 |
|
|
| 216 |
+ |
if (fobj == NULL) |
| 217 |
+ |
syntax("arg(n) used in constant expression"); |
| 218 |
+ |
|
| 219 |
|
n = argument(1) + .5; /* round to integer */ |
| 220 |
|
|
| 221 |
|
if (n < 1) |
| 229 |
|
} |
| 230 |
|
|
| 231 |
|
|
| 232 |
+ |
static double |
| 233 |
+ |
l_erf() /* error function */ |
| 234 |
+ |
{ |
| 235 |
+ |
extern double erf(); |
| 236 |
+ |
|
| 237 |
+ |
return(erf(argument(1))); |
| 238 |
+ |
} |
| 239 |
+ |
|
| 240 |
+ |
|
| 241 |
+ |
static double |
| 242 |
+ |
l_erfc() /* cumulative error function */ |
| 243 |
+ |
{ |
| 244 |
+ |
extern double erfc(); |
| 245 |
+ |
|
| 246 |
+ |
return(erfc(argument(1))); |
| 247 |
+ |
} |
| 248 |
+ |
|
| 249 |
+ |
|
| 250 |
|
double |
| 251 |
|
chanvalue(n) /* return channel n to calcomp */ |
| 252 |
|
register int n; |
| 253 |
|
{ |
| 254 |
< |
double res; |
| 254 |
> |
double sum; |
| 255 |
|
register RAY *r; |
| 256 |
|
|
| 257 |
< |
n--; /* for convenience */ |
| 257 |
> |
if (fray == NULL) |
| 258 |
> |
syntax("ray parameter used in constant expression"); |
| 259 |
|
|
| 260 |
< |
if (n < 0 || n > 10) |
| 261 |
< |
error(USER, "illegal channel number"); |
| 260 |
> |
if (--n < 0) |
| 261 |
> |
goto badchan; |
| 262 |
|
|
| 263 |
< |
if (n == 9) { /* distance */ |
| 263 |
> |
if (n < 3) /* ray direction */ |
| 264 |
|
|
| 265 |
< |
res = fray->rot; |
| 266 |
< |
for (r = fray->parent; r != NULL; r = r->parent) |
| 267 |
< |
res += r->rot; |
| 268 |
< |
res *= fxf.sca; |
| 265 |
> |
return( ( fray->rdir[0]*funcxf.xfm[0][n] + |
| 266 |
> |
fray->rdir[1]*funcxf.xfm[1][n] + |
| 267 |
> |
fray->rdir[2]*funcxf.xfm[2][n] ) |
| 268 |
> |
/ funcxf.sca ); |
| 269 |
|
|
| 270 |
< |
} else if (n == 10) { /* dot product */ |
| 270 |
> |
if (n < 6) /* surface normal */ |
| 271 |
|
|
| 272 |
< |
res = fray->rod; |
| 272 |
> |
return( ( fray->ron[0]*funcxf.xfm[0][n-3] + |
| 273 |
> |
fray->ron[1]*funcxf.xfm[1][n-3] + |
| 274 |
> |
fray->ron[2]*funcxf.xfm[2][n-3] ) |
| 275 |
> |
/ funcxf.sca ); |
| 276 |
|
|
| 277 |
< |
} else if (n < 3) { /* ray direction */ |
| 278 |
< |
res = ( fray->rdir[0]*fxf.xfm[0][n] + |
| 279 |
< |
fray->rdir[1]*fxf.xfm[1][n] + |
| 280 |
< |
fray->rdir[2]*fxf.xfm[2][n] ) |
| 281 |
< |
/ fxf.sca ; |
| 282 |
< |
} else if (n < 6) { /* surface normal */ |
| 283 |
< |
res = ( fray->ron[0]*fxf.xfm[0][n-3] + |
| 284 |
< |
fray->ron[1]*fxf.xfm[1][n-3] + |
| 285 |
< |
fray->ron[2]*fxf.xfm[2][n-3] ) |
| 286 |
< |
/ fxf.sca ; |
| 287 |
< |
} else { /* intersection */ |
| 288 |
< |
res = fray->rop[0]*fxf.xfm[0][n-6] + |
| 289 |
< |
fray->rop[1]*fxf.xfm[1][n-6] + |
| 164 |
< |
fray->rop[2]*fxf.xfm[2][n-6] + |
| 165 |
< |
fxf.xfm[3][n-6] ; |
| 277 |
> |
if (n < 9) /* intersection */ |
| 278 |
> |
|
| 279 |
> |
return( fray->rop[0]*funcxf.xfm[0][n-6] + |
| 280 |
> |
fray->rop[1]*funcxf.xfm[1][n-6] + |
| 281 |
> |
fray->rop[2]*funcxf.xfm[2][n-6] + |
| 282 |
> |
funcxf.xfm[3][n-6] ); |
| 283 |
> |
|
| 284 |
> |
if (n == 9) { /* total distance */ |
| 285 |
> |
sum = fray->rot; |
| 286 |
> |
for (r = fray->parent; r != NULL; r = r->parent) |
| 287 |
> |
sum += r->rot; |
| 288 |
> |
return(sum * funcxf.sca); |
| 289 |
> |
|
| 290 |
|
} |
| 291 |
|
|
| 292 |
< |
return(res); |
| 292 |
> |
if (n == 10) /* dot product (range [-1,1]) */ |
| 293 |
> |
return( fray->rod <= -1.0 ? -1.0 : |
| 294 |
> |
fray->rod >= 1.0 ? 1.0 : |
| 295 |
> |
fray->rod ); |
| 296 |
> |
|
| 297 |
> |
if (n == 11) /* scale */ |
| 298 |
> |
return(funcxf.sca); |
| 299 |
> |
|
| 300 |
> |
if (n < 15) /* origin */ |
| 301 |
> |
return(funcxf.xfm[3][n-12]); |
| 302 |
> |
|
| 303 |
> |
if (n < 18) /* i unit vector */ |
| 304 |
> |
return(funcxf.xfm[0][n-15] / funcxf.sca); |
| 305 |
> |
|
| 306 |
> |
if (n < 21) /* j unit vector */ |
| 307 |
> |
return(funcxf.xfm[1][n-15] / funcxf.sca); |
| 308 |
> |
|
| 309 |
> |
if (n < 24) /* k unit vector */ |
| 310 |
> |
return(funcxf.xfm[2][n-21] / funcxf.sca); |
| 311 |
> |
|
| 312 |
> |
if (n == 24) { /* single ray (shadow) distance */ |
| 313 |
> |
sum = fray->rot; |
| 314 |
> |
for (r = fray->parent; r != NULL && r->crtype&SHADOW; |
| 315 |
> |
r = r->parent) |
| 316 |
> |
sum += r->rot; |
| 317 |
> |
return(sum * funcxf.sca); |
| 318 |
> |
} |
| 319 |
> |
badchan: |
| 320 |
> |
error(USER, "illegal channel number"); |
| 321 |
|
} |
