14 |
|
#include <stdio.h> |
15 |
|
#include <stdlib.h> |
16 |
|
#include <math.h> |
17 |
+ |
#include <string.h> |
18 |
|
#include "tmprivat.h" |
19 |
|
#include "tmerrmsg.h" |
20 |
|
|
67 |
|
tmnew->mongam = gamval; |
68 |
|
/* set color divisors */ |
69 |
|
for (i = 0; i < 3; i++) |
70 |
< |
tmnew->cdiv[i] = 256.*pow(tmnew->clf[i], 1./tmnew->mongam); |
70 |
> |
tmnew->cdiv[i] = TM_BRES*pow(tmnew->clf[i], 1./tmnew->mongam); |
71 |
|
|
72 |
|
/* set input transform */ |
73 |
|
tmnew->inppri = tmnew->monpri; |
143 |
|
tms->cmat[i][j] *= tms->inpsf; |
144 |
|
/* set color divisors */ |
145 |
|
for (i = 0; i < 3; i++) |
146 |
< |
tms->cdiv[i] = 256.*pow(tms->clf[i] < .001 ? .001 : |
146 |
> |
tms->cdiv[i] = TM_BRES*pow(tms->clf[i] < .001 ? .001 : |
147 |
|
tms->clf[i], 1./tms->mongam); |
148 |
|
/* notify packages */ |
149 |
|
for (i = tmNumPkgs; i--; ) |
375 |
|
horig = HISTI(tms->hbrmin); |
376 |
|
hlen = HISTI(tms->hbrmax) + 1 - horig; |
377 |
|
if (hlen > oldlen) { /* (re)allocate histogram */ |
378 |
< |
int *newhist = (int *)calloc(hlen, sizeof(int)); |
378 |
> |
HIST_TYP *newhist = (HIST_TYP *)calloc(hlen, sizeof(HIST_TYP)); |
379 |
|
if (newhist == NULL) |
380 |
|
returnErr(TM_E_NOMEM); |
381 |
|
if (oldlen) { /* copy and free old */ |
382 |
< |
for (i = oldlen, j = i+oldorig-horig; i; ) |
383 |
< |
newhist[--j] = tms->histo[--i]; |
382 |
> |
memcpy((MEM_PTR)(newhist+(oldorig-horig)), |
383 |
> |
(MEM_PTR)tms->histo, oldlen*sizeof(HIST_TYP)); |
384 |
|
free((MEM_PTR)tms->histo); |
385 |
|
} |
386 |
|
tms->histo = newhist; |
436 |
|
gamval = tms->mongam; |
437 |
|
d = log(expmult/tms->inpsf); |
438 |
|
for (i = tms->mbrmax-tms->mbrmin+1; i--; ) { |
439 |
< |
double val = 256. * exp( |
439 |
> |
double val = TM_BRES * exp( |
440 |
|
( d + (tms->mbrmin+i)*(1./TM_BRTSCALE) ) |
441 |
|
/ gamval); |
442 |
< |
tms->lumap[i] = val >= (double)0xffff ? 0xffff : (int)val; |
442 |
> |
tms->lumap[i] = val; |
443 |
> |
if (sizeof(TMAP_TYP) == 2 && val >= 0xffff) |
444 |
> |
tms->lumap[i] = 0xffff; |
445 |
|
} |
446 |
|
returnOK; |
447 |
|
} |
456 |
|
) |
457 |
|
{ |
458 |
|
static const char funcName[] = "tmComputeMapping"; |
459 |
< |
int *histo; |
459 |
> |
HIST_TYP *histo; |
460 |
|
float *cumf; |
461 |
< |
int brt0, histlen, threshold, ceiling, trimmings; |
461 |
> |
int brt0, histlen; |
462 |
> |
HIST_TYP threshold, ceiling, trimmings, histot; |
463 |
|
double logLddyn, Ldmin, Ldavg, Lwavg, Tr, Lw, Ld; |
460 |
– |
int32 histot; |
464 |
|
double sum; |
465 |
|
double d; |
466 |
|
int i, j; |
494 |
|
tms->hbrmax - tms->hbrmin < TM_BRTSCALE*logLddyn) |
495 |
|
goto linearmap; |
496 |
|
/* clamp histogram */ |
497 |
< |
histo = (int *)malloc(histlen*sizeof(int)); |
497 |
> |
histo = (HIST_TYP *)malloc(histlen*sizeof(HIST_TYP)); |
498 |
|
cumf = (float *)malloc((histlen+2)*sizeof(float)); |
499 |
|
if ((histo == NULL) | (cumf == NULL)) |
500 |
|
returnErr(TM_E_NOMEM); |
501 |
|
cumf[histlen+1] = 1.; /* guard for assignment code */ |
502 |
< |
for (i = histlen; i--; ) /* make malleable copy */ |
503 |
< |
histo[i] = tms->histo[i]; |
502 |
> |
/* make malleable copy */ |
503 |
> |
memcpy((MEM_PTR)histo, (MEM_PTR)tms->histo, histlen*sizeof(HIST_TYP)); |
504 |
|
do { /* iterate to solution */ |
505 |
|
sum = 0; /* cumulative probability */ |
506 |
|
for (i = 0; i < histlen; i++) { |
541 |
|
d -= (double)j; |
542 |
|
Ld = Ldmin*exp(logLddyn*((1.-d)*cumf[j]+d*cumf[j+1])); |
543 |
|
d = (Ld - Ldmin)/(Ldmax - Ldmin); |
544 |
< |
tms->lumap[i] = 256.*pow(d, 1./gamval); |
544 |
> |
tms->lumap[i] = TM_BRES*pow(d, 1./gamval); |
545 |
|
} |
546 |
|
free((MEM_PTR)histo); /* clean up and return */ |
547 |
|
free((MEM_PTR)cumf); |
565 |
|
) |
566 |
|
{ |
567 |
|
static const char funcName[] = "tmMapPixels"; |
568 |
< |
int32 li, pv; |
568 |
> |
TMbright lv; |
569 |
> |
TMAP_TYP li; |
570 |
> |
int pv; |
571 |
|
|
572 |
|
if (tms == NULL || tms->lumap == NULL) |
573 |
|
returnErr(TM_E_TMINVAL); |
574 |
|
if ((ps == NULL) | (ls == NULL) | (len < 0)) |
575 |
|
returnErr(TM_E_ILLEGAL); |
576 |
|
while (len--) { |
577 |
< |
if ((li = *ls++) < tms->mbrmin) { |
577 |
> |
if ((lv = *ls++) < tms->mbrmin) { |
578 |
|
li = 0; |
579 |
|
} else { |
580 |
< |
if (li > tms->mbrmax) |
581 |
< |
li = tms->mbrmax; |
582 |
< |
li = tms->lumap[li - tms->mbrmin]; |
580 |
> |
if (lv > tms->mbrmax) |
581 |
> |
lv = tms->mbrmax; |
582 |
> |
li = tms->lumap[lv - tms->mbrmin]; |
583 |
|
} |
584 |
< |
if (cs == TM_NOCHROM) |
585 |
< |
*ps++ = li>255 ? 255 : li; |
586 |
< |
else { |
584 |
> |
if (cs == TM_NOCHROM) { |
585 |
> |
#if !(TM_BRES & 0xff) |
586 |
> |
*ps++ = li>=TM_BRES ? 255 : li/(TM_BRES>>8); |
587 |
> |
#else |
588 |
> |
*ps++ = li>=TM_BRES ? 255 : (li<<8)/TM_BRES; |
589 |
> |
#endif |
590 |
> |
} else { |
591 |
|
pv = *cs++ * li / tms->cdiv[RED]; |
592 |
|
*ps++ = pv>255 ? 255 : pv; |
593 |
|
pv = *cs++ * li / tms->cdiv[GRN]; |
601 |
|
|
602 |
|
|
603 |
|
TMstruct * |
604 |
< |
tmDup( /* duplicate top tone mapping */ |
604 |
> |
tmDup( /* duplicate tone mapping */ |
605 |
|
TMstruct *tms |
606 |
|
) |
607 |
|
{ |
617 |
|
*tmnew = *tms; /* copy everything */ |
618 |
|
if (tmnew->histo != NULL) { /* duplicate histogram */ |
619 |
|
len = HISTI(tmnew->hbrmax) + 1 - HISTI(tmnew->hbrmin); |
620 |
< |
tmnew->histo = (int *)malloc(len*sizeof(int)); |
620 |
> |
tmnew->histo = (HIST_TYP *)malloc(len*sizeof(HIST_TYP)); |
621 |
|
if (tmnew->histo != NULL) |
622 |
< |
for (i = len; i--; ) |
623 |
< |
tmnew->histo[i] = tms->histo[i]; |
622 |
> |
memcpy((MEM_PTR)tmnew->histo, (MEM_PTR)tms->histo, |
623 |
> |
len*sizeof(HIST_TYP)); |
624 |
|
} |
625 |
|
if (tmnew->lumap != NULL) { /* duplicate luminance mapping */ |
626 |
|
len = tmnew->mbrmax-tmnew->mbrmin+1; |
627 |
< |
tmnew->lumap = (unsigned short *)malloc( |
619 |
< |
len*sizeof(unsigned short) ); |
627 |
> |
tmnew->lumap = (TMAP_TYP *)malloc(len*sizeof(TMAP_TYP)); |
628 |
|
if (tmnew->lumap != NULL) |
629 |
< |
for (i = len; i--; ) |
630 |
< |
tmnew->lumap[i] = tms->lumap[i]; |
629 |
> |
memcpy((MEM_PTR)tmnew->lumap, (MEM_PTR)tms->lumap, |
630 |
> |
len*sizeof(TMAP_TYP)); |
631 |
|
} |
632 |
|
/* clear package data */ |
633 |
|
for (i = tmNumPkgs; i--; ) |
691 |
|
if (tms->mbrmin > tms->mbrmax) |
692 |
|
return 0; |
693 |
|
if (tms->lumap == NULL) |
694 |
< |
tms->lumap = (unsigned short *)malloc(sizeof(unsigned short)* |
694 |
> |
tms->lumap = (TMAP_TYP *)malloc(sizeof(TMAP_TYP)* |
695 |
|
(tms->mbrmax-tms->mbrmin+1)); |
696 |
|
return(tms->lumap != NULL); |
697 |
|
} |