11 |
|
* |
12 |
|
*/ |
13 |
|
|
14 |
+ |
#define _USE_MATH_DEFINES |
15 |
|
#include "rtio.h" |
16 |
|
#include <stdlib.h> |
17 |
|
#include <math.h> |
87 |
|
return (a <= 1e-6) & (a >= -1e-6); |
88 |
|
} |
89 |
|
|
89 |
– |
/* Returns the name of the given tag */ |
90 |
– |
#ifdef ezxml_name |
91 |
– |
#undef ezxml_name |
92 |
– |
static char * |
93 |
– |
ezxml_name(ezxml_t xml) |
94 |
– |
{ |
95 |
– |
if (xml == NULL) |
96 |
– |
return NULL; |
97 |
– |
return xml->name; |
98 |
– |
} |
99 |
– |
#endif |
100 |
– |
|
90 |
|
/* Returns the given tag's character content or empty string if none */ |
91 |
|
#ifdef ezxml_txt |
92 |
|
#undef ezxml_txt |
178 |
|
{ |
179 |
|
ANGLE_BASIS *ab = (ANGLE_BASIS *)p; |
180 |
|
int li, ndx; |
181 |
< |
double pol, azi, d; |
181 |
> |
double pol, azi; |
182 |
|
|
183 |
|
if (v == NULL) |
184 |
|
return -1; |
407 |
|
int i; |
408 |
|
/* allocate BSDF component */ |
409 |
|
sdata = ezxml_txt(ezxml_child(wdb, "WavelengthDataDirection")); |
410 |
+ |
if (!sdata) |
411 |
+ |
return RC_FAIL; |
412 |
|
/* |
413 |
|
* Remember that front and back are reversed from WINDOW 6 orientations |
414 |
|
* Favor their "Front" (incoming light) since that's more often valid |
498 |
|
df->comp[0].dist = dp; |
499 |
|
df->comp[0].func = &SDhandleMtx; |
500 |
|
/* read BSDF data */ |
501 |
< |
sdata = ezxml_txt(ezxml_child(wdb,"ScatteringData")); |
501 |
> |
sdata = ezxml_txt(ezxml_child(wdb, "ScatteringData")); |
502 |
|
if (!sdata || !*sdata) { |
503 |
|
sprintf(SDerrorDetail, "Missing BSDF ScatteringData in '%s'", |
504 |
|
sd->name); |
512 |
|
sd->name); |
513 |
|
return RC_FORMERR; |
514 |
|
} |
515 |
< |
while (*sdnext && isspace(*sdnext)) |
515 |
> |
while (isspace(*sdnext)) |
516 |
|
sdnext++; |
517 |
|
if (*sdnext == ',') sdnext++; |
518 |
|
if (rowinc) { |
519 |
|
int r = i/dp->nout; |
520 |
< |
int c = i - c*dp->nout; |
520 |
> |
int c = i - r*dp->nout; |
521 |
|
mBSDF_value(dp,r,c) = atof(sdata); |
522 |
|
} else |
523 |
|
dp->bsdf[i] = atof(sdata); |
537 |
|
for (i = n; --i; ) |
538 |
|
if (sm->bsdf[i] < minv) |
539 |
|
minv = sm->bsdf[i]; |
540 |
+ |
|
541 |
+ |
if (minv <= FTINY) |
542 |
+ |
return .0; |
543 |
+ |
|
544 |
|
for (i = n; i--; ) |
545 |
|
sm->bsdf[i] -= minv; |
546 |
|
|
566 |
|
c_cmix(&dv->spec, dv->cieY, &dv->spec, ymin, &df->comp[n].cspec[0]); |
567 |
|
dv->cieY += ymin; |
568 |
|
} |
569 |
< |
df->maxHemi -= dv->cieY; /* adjust minimum hemispherical */ |
569 |
> |
df->maxHemi -= dv->cieY; /* adjust maximum hemispherical */ |
570 |
|
/* make sure everything is set */ |
571 |
|
c_ccvt(&dv->spec, C_CSXY+C_CSSPEC); |
572 |
|
} |
575 |
|
SDError |
576 |
|
SDloadMtx(SDData *sd, ezxml_t wtl) |
577 |
|
{ |
578 |
< |
ezxml_t wld, wdb; |
579 |
< |
int rowIn; |
580 |
< |
struct BSDF_data *dp; |
581 |
< |
char *txt; |
582 |
< |
int rval; |
588 |
< |
|
578 |
> |
ezxml_t wld, wdb; |
579 |
> |
int rowIn; |
580 |
> |
char *txt; |
581 |
> |
int rval; |
582 |
> |
/* basic checks and data ordering */ |
583 |
|
txt = ezxml_txt(ezxml_child(ezxml_child(wtl, |
584 |
|
"DataDefinition"), "IncidentDataStructure")); |
585 |
|
if (txt == NULL || !*txt) { |
598 |
|
sd->name); |
599 |
|
return SDEsupport; |
600 |
|
} |
601 |
< |
/* get angle basis */ |
602 |
< |
rval = load_angle_basis(ezxml_child(ezxml_child(wtl, |
603 |
< |
"DataDefinition"), "AngleBasis")); |
604 |
< |
if (rval < 0) |
605 |
< |
return convert_errcode(rval); |
606 |
< |
/* load BSDF components */ |
601 |
> |
/* get angle bases */ |
602 |
> |
for (wld = ezxml_child(ezxml_child(wtl, "DataDefinition"), "AngleBasis"); |
603 |
> |
wld != NULL; wld = wld->next) { |
604 |
> |
rval = load_angle_basis(wld); |
605 |
> |
if (rval < 0) |
606 |
> |
return convert_errcode(rval); |
607 |
> |
} |
608 |
> |
/* load BSDF components */ |
609 |
|
for (wld = ezxml_child(wtl, "WavelengthData"); |
610 |
|
wld != NULL; wld = wld->next) { |
611 |
|
if (strcasecmp(ezxml_txt(ezxml_child(wld,"Wavelength")), |
616 |
|
if ((rval = load_bsdf_data(sd, wdb, rowIn)) < 0) |
617 |
|
return convert_errcode(rval); |
618 |
|
} |
619 |
< |
/* separate diffuse components */ |
619 |
> |
/* separate diffuse components */ |
620 |
|
extract_diffuse(&sd->rLambFront, sd->rf); |
621 |
|
extract_diffuse(&sd->rLambBack, sd->rb); |
622 |
|
extract_diffuse(&sd->tLamb, sd->tf); |
623 |
< |
/* return success */ |
623 |
> |
/* return success */ |
624 |
|
return SDEnone; |
625 |
|
} |
626 |
|
|
678 |
|
psa[0] = out_psa; |
679 |
|
break; |
680 |
|
case SDqueryMin+SDqueryMax: |
681 |
< |
if (inc_psa > psa[0]) |
681 |
> |
if (inc_psa > psa[1]) |
682 |
|
psa[1] = inc_psa; |
683 |
< |
if (out_psa > psa[0]) |
683 |
> |
if (out_psa > psa[1]) |
684 |
|
psa[1] = out_psa; |
685 |
|
/* fall through */ |
690 |
– |
case SDqueryMin: |
686 |
|
case SDqueryVal: |
687 |
|
if (qflags == SDqueryVal) |
688 |
|
psa[0] = M_PI; |
689 |
+ |
/* fall through */ |
690 |
+ |
case SDqueryMin: |
691 |
|
if ((inc_psa > 0) & (inc_psa < psa[0])) |
692 |
|
psa[0] = inc_psa; |
693 |
|
if ((out_psa > 0) & (out_psa < psa[0])) |
758 |
|
reverse = 1; |
759 |
|
} |
760 |
|
cdlast = NULL; /* check for it in cache list */ |
761 |
< |
for (cd = (SDMatCDst *)sdc->cdList; |
762 |
< |
cd != NULL; cd = (SDMatCDst *)cd->next) { |
761 |
> |
for (cd = (SDMatCDst *)sdc->cdList; cd != NULL; |
762 |
> |
cdlast = cd, cd = cd->next) |
763 |
|
if (cd->indx == myCD.indx && (cd->calen == myCD.calen) & |
764 |
|
(cd->ob_priv == myCD.ob_priv) & |
765 |
|
(cd->ob_vec == myCD.ob_vec)) |
766 |
|
break; |
770 |
– |
cdlast = cd; |
771 |
– |
} |
767 |
|
if (cd == NULL) { /* need to allocate new entry */ |
768 |
|
cd = (SDMatCDst *)malloc(sizeof(SDMatCDst) + |
769 |
< |
myCD.calen*sizeof(myCD.carr[0])); |
769 |
> |
sizeof(myCD.carr[0])*myCD.calen); |
770 |
|
if (cd == NULL) |
771 |
|
return NULL; |
772 |
|
*cd = myCD; /* compute cumulative distribution */ |
778 |
|
} |
779 |
|
if (cdlast != NULL) { /* move entry to head of cache list */ |
780 |
|
cdlast->next = cd->next; |
781 |
< |
cd->next = sdc->cdList; |
781 |
> |
cd->next = (SDMatCDst *)sdc->cdList; |
782 |
|
sdc->cdList = (SDCDst *)cd; |
783 |
|
} |
784 |
|
return (SDCDst *)cd; /* ready to go */ |
798 |
|
/* binary search to find index */ |
799 |
|
ilower = 0; iupper = mcd->calen; |
800 |
|
while ((i = (iupper + ilower) >> 1) != ilower) |
801 |
< |
if ((long)target >= (long)mcd->carr[i]) |
801 |
> |
if (target >= mcd->carr[i]) |
802 |
|
ilower = i; |
803 |
|
else |
804 |
|
iupper = i; |