forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tif_luv.c
1749 lines (1607 loc) · 43.6 KB
/
tif_luv.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 1997 Greg Ward Larson
* Copyright (c) 1997 Silicon Graphics, Inc.
*
* Permission to use, copy, modify, distribute, and sell this software and
* its documentation for any purpose is hereby granted without fee, provided
* that (i) the above copyright notices and this permission notice appear in
* all copies of the software and related documentation, and (ii) the names of
* Sam Leffler, Greg Larson and Silicon Graphics may not be used in any
* advertising or publicity relating to the software without the specific,
* prior written permission of Sam Leffler, Greg Larson and Silicon Graphics.
*
* THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND,
* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL SAM LEFFLER, GREG LARSON OR SILICON GRAPHICS BE LIABLE
* FOR ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND,
* OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
* WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF
* LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
* OF THIS SOFTWARE.
*/
#include "tiffiop.h"
#ifdef LOGLUV_SUPPORT
/*
* TIFF Library.
* LogLuv compression support for high dynamic range images.
*
* Contributed by Greg Larson.
*
* LogLuv image support uses the TIFF library to store 16 or 10-bit
* log luminance values with 8 bits each of u and v or a 14-bit index.
*
* The codec can take as input and produce as output 32-bit IEEE float values
* as well as 16-bit integer values. A 16-bit luminance is interpreted
* as a sign bit followed by a 15-bit integer that is converted
* to and from a linear magnitude using the transformation:
*
* L = 2^( (Le+.5)/256 - 64 ) # real from 15-bit
*
* Le = floor( 256*(log2(L) + 64) ) # 15-bit from real
*
* The actual conversion to world luminance units in candelas per sq. meter
* requires an additional multiplier, which is stored in the TIFFTAG_STONITS.
* This value is usually set such that a reasonable exposure comes from
* clamping decoded luminances above 1 to 1 in the displayed image.
*
* The 16-bit values for u and v may be converted to real values by dividing
* each by 32768. (This allows for negative values, which aren't useful as
* far as we know, but are left in case of future improvements in human
* color vision.)
*
* Conversion from (u,v), which is actually the CIE (u',v') system for
* you color scientists, is accomplished by the following transformation:
*
* u = 4*x / (-2*x + 12*y + 3)
* v = 9*y / (-2*x + 12*y + 3)
*
* x = 9*u / (6*u - 16*v + 12)
* y = 4*v / (6*u - 16*v + 12)
*
* This process is greatly simplified by passing 32-bit IEEE floats
* for each of three CIE XYZ coordinates. The codec then takes care
* of conversion to and from LogLuv, though the application is still
* responsible for interpreting the TIFFTAG_STONITS calibration factor.
*
* By definition, a CIE XYZ vector of [1 1 1] corresponds to a neutral white
* point of (x,y)=(1/3,1/3). However, most color systems assume some other
* white point, such as D65, and an absolute color conversion to XYZ then
* to another color space with a different white point may introduce an
* unwanted color cast to the image. It is often desirable, therefore, to
* perform a white point conversion that maps the input white to [1 1 1]
* in XYZ, then record the original white point using the TIFFTAG_WHITEPOINT
* tag value. A decoder that demands absolute color calibration may use
* this white point tag to get back the original colors, but usually it
* will be ignored and the new white point will be used instead that
* matches the output color space.
*
* Pixel information is compressed into one of two basic encodings, depending
* on the setting of the compression tag, which is one of COMPRESSION_SGILOG
* or COMPRESSION_SGILOG24. For COMPRESSION_SGILOG, greyscale data is
* stored as:
*
* 1 15
* |-+---------------|
*
* COMPRESSION_SGILOG color data is stored as:
*
* 1 15 8 8
* |-+---------------|--------+--------|
* S Le ue ve
*
* For the 24-bit COMPRESSION_SGILOG24 color format, the data is stored as:
*
* 10 14
* |----------|--------------|
* Le' Ce
*
* There is no sign bit in the 24-bit case, and the (u,v) chromaticity is
* encoded as an index for optimal color resolution. The 10 log bits are
* defined by the following conversions:
*
* L = 2^((Le'+.5)/64 - 12) # real from 10-bit
*
* Le' = floor( 64*(log2(L) + 12) ) # 10-bit from real
*
* The 10 bits of the smaller format may be converted into the 15 bits of
* the larger format by multiplying by 4 and adding 13314. Obviously,
* a smaller range of magnitudes is covered (about 5 orders of magnitude
* instead of 38), and the lack of a sign bit means that negative luminances
* are not allowed. (Well, they aren't allowed in the real world, either,
* but they are useful for certain types of image processing.)
*
* The desired user format is controlled by the setting the internal
* pseudo tag TIFFTAG_SGILOGDATAFMT to one of:
* SGILOGDATAFMT_FLOAT = IEEE 32-bit float XYZ values
* SGILOGDATAFMT_16BIT = 16-bit integer encodings of logL, u and v
* Raw data i/o is also possible using:
* SGILOGDATAFMT_RAW = 32-bit unsigned integer with encoded pixel
* In addition, the following decoding is provided for ease of display:
* SGILOGDATAFMT_8BIT = 8-bit default RGB gamma-corrected values
*
* For grayscale images, we provide the following data formats:
* SGILOGDATAFMT_FLOAT = IEEE 32-bit float Y values
* SGILOGDATAFMT_16BIT = 16-bit integer w/ encoded luminance
* SGILOGDATAFMT_8BIT = 8-bit gray monitor values
*
* Note that the COMPRESSION_SGILOG applies a simple run-length encoding
* scheme by separating the logL, u and v bytes for each row and applying
* a PackBits type of compression. Since the 24-bit encoding is not
* adaptive, the 32-bit color format takes less space in many cases.
*
* Further control is provided over the conversion from higher-resolution
* formats to final encoded values through the pseudo tag
* TIFFTAG_SGILOGENCODE:
* SGILOGENCODE_NODITHER = do not dither encoded values
* SGILOGENCODE_RANDITHER = apply random dithering during encoding
*
* The default value of this tag is SGILOGENCODE_NODITHER for
* COMPRESSION_SGILOG to maximize run-length encoding and
* SGILOGENCODE_RANDITHER for COMPRESSION_SGILOG24 to turn
* quantization errors into noise.
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/*
* State block for each open TIFF
* file using LogLuv compression/decompression.
*/
typedef struct logLuvState LogLuvState;
struct logLuvState {
int encoder_state; /* 1 if encoder correctly initialized */
int user_datafmt; /* user data format */
int encode_meth; /* encoding method */
int pixel_size; /* bytes per pixel */
uint8_t* tbuf; /* translation buffer */
tmsize_t tbuflen; /* buffer length */
void (*tfunc)(LogLuvState*, uint8_t*, tmsize_t);
TIFFVSetMethod vgetparent; /* super-class method */
TIFFVSetMethod vsetparent; /* super-class method */
};
#define DecoderState(tif) ((LogLuvState*) (tif)->tif_data)
#define EncoderState(tif) ((LogLuvState*) (tif)->tif_data)
#define SGILOGDATAFMT_UNKNOWN -1
#define MINRUN 4 /* minimum run length */
/*
* Decode a string of 16-bit gray pixels.
*/
static int
LogL16Decode(TIFF* tif, uint8_t* op, tmsize_t occ, uint16_t s)
{
static const char module[] = "LogL16Decode";
LogLuvState* sp = DecoderState(tif);
int shft;
tmsize_t i;
tmsize_t npixels;
unsigned char* bp;
int16_t* tp;
int16_t b;
tmsize_t cc;
int rc;
(void)s;
assert(s == 0);
assert(sp != NULL);
npixels = occ / sp->pixel_size;
if (sp->user_datafmt == SGILOGDATAFMT_16BIT)
tp = (int16_t*) op;
else {
if(sp->tbuflen < npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Translation buffer too short");
return (0);
}
tp = (int16_t*) sp->tbuf;
}
_TIFFmemset((void*) tp, 0, npixels*sizeof (tp[0]));
bp = (unsigned char*) tif->tif_rawcp;
cc = tif->tif_rawcc;
/* get each byte string */
for (shft = 8; shft >= 0; shft -=8) {
for (i = 0; i < npixels && cc > 0; ) {
if (*bp >= 128) { /* run */
if( cc < 2 )
break;
rc = *bp++ + (2-128);
b = (int16_t)(*bp++ << shft);
cc -= 2;
while (rc-- && i < npixels)
tp[i++] |= b;
} else { /* non-run */
rc = *bp++; /* nul is noop */
while (--cc && rc-- && i < npixels)
tp[i++] |= (int16_t)*bp++ << shft;
}
}
if (i != npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Not enough data at row %"PRIu32" (short %"TIFF_SSIZE_FORMAT" pixels)",
tif->tif_row,
npixels - i);
tif->tif_rawcp = (uint8_t*) bp;
tif->tif_rawcc = cc;
return (0);
}
}
(*sp->tfunc)(sp, op, npixels);
tif->tif_rawcp = (uint8_t*) bp;
tif->tif_rawcc = cc;
return (1);
}
/*
* Decode a string of 24-bit pixels.
*/
static int
LogLuvDecode24(TIFF* tif, uint8_t* op, tmsize_t occ, uint16_t s)
{
static const char module[] = "LogLuvDecode24";
LogLuvState* sp = DecoderState(tif);
tmsize_t cc;
tmsize_t i;
tmsize_t npixels;
unsigned char* bp;
uint32_t* tp;
(void)s;
assert(s == 0);
assert(sp != NULL);
npixels = occ / sp->pixel_size;
if (sp->user_datafmt == SGILOGDATAFMT_RAW)
tp = (uint32_t *)op;
else {
if(sp->tbuflen < npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Translation buffer too short");
return (0);
}
tp = (uint32_t *) sp->tbuf;
}
/* copy to array of uint32_t */
bp = (unsigned char*) tif->tif_rawcp;
cc = tif->tif_rawcc;
for (i = 0; i < npixels && cc >= 3; i++) {
tp[i] = bp[0] << 16 | bp[1] << 8 | bp[2];
bp += 3;
cc -= 3;
}
tif->tif_rawcp = (uint8_t*) bp;
tif->tif_rawcc = cc;
if (i != npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Not enough data at row %"PRIu32" (short %"TIFF_SSIZE_FORMAT" pixels)",
tif->tif_row,
npixels - i);
return (0);
}
(*sp->tfunc)(sp, op, npixels);
return (1);
}
/*
* Decode a string of 32-bit pixels.
*/
static int
LogLuvDecode32(TIFF* tif, uint8_t* op, tmsize_t occ, uint16_t s)
{
static const char module[] = "LogLuvDecode32";
LogLuvState* sp;
int shft;
tmsize_t i;
tmsize_t npixels;
unsigned char* bp;
uint32_t* tp;
uint32_t b;
tmsize_t cc;
int rc;
(void)s;
assert(s == 0);
sp = DecoderState(tif);
assert(sp != NULL);
npixels = occ / sp->pixel_size;
if (sp->user_datafmt == SGILOGDATAFMT_RAW)
tp = (uint32_t*) op;
else {
if(sp->tbuflen < npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Translation buffer too short");
return (0);
}
tp = (uint32_t*) sp->tbuf;
}
_TIFFmemset((void*) tp, 0, npixels*sizeof (tp[0]));
bp = (unsigned char*) tif->tif_rawcp;
cc = tif->tif_rawcc;
/* get each byte string */
for (shft = 24; shft >= 0; shft -=8) {
for (i = 0; i < npixels && cc > 0; ) {
if (*bp >= 128) { /* run */
if( cc < 2 )
break;
rc = *bp++ + (2-128);
b = (uint32_t)*bp++ << shft;
cc -= 2;
while (rc-- && i < npixels)
tp[i++] |= b;
} else { /* non-run */
rc = *bp++; /* nul is noop */
while (--cc && rc-- && i < npixels)
tp[i++] |= (uint32_t)*bp++ << shft;
}
}
if (i != npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Not enough data at row %"PRIu32" (short %"TIFF_SSIZE_FORMAT" pixels)",
tif->tif_row,
npixels - i);
tif->tif_rawcp = (uint8_t*) bp;
tif->tif_rawcc = cc;
return (0);
}
}
(*sp->tfunc)(sp, op, npixels);
tif->tif_rawcp = (uint8_t*) bp;
tif->tif_rawcc = cc;
return (1);
}
/*
* Decode a strip of pixels. We break it into rows to
* maintain synchrony with the encode algorithm, which
* is row by row.
*/
static int
LogLuvDecodeStrip(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
tmsize_t rowlen = TIFFScanlineSize(tif);
if (rowlen == 0)
return 0;
assert(cc%rowlen == 0);
while (cc && (*tif->tif_decoderow)(tif, bp, rowlen, s)) {
bp += rowlen;
cc -= rowlen;
}
return (cc == 0);
}
/*
* Decode a tile of pixels. We break it into rows to
* maintain synchrony with the encode algorithm, which
* is row by row.
*/
static int
LogLuvDecodeTile(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
tmsize_t rowlen = TIFFTileRowSize(tif);
if (rowlen == 0)
return 0;
assert(cc%rowlen == 0);
while (cc && (*tif->tif_decoderow)(tif, bp, rowlen, s)) {
bp += rowlen;
cc -= rowlen;
}
return (cc == 0);
}
/*
* Encode a row of 16-bit pixels.
*/
static int
LogL16Encode(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
static const char module[] = "LogL16Encode";
LogLuvState* sp = EncoderState(tif);
int shft;
tmsize_t i;
tmsize_t j;
tmsize_t npixels;
uint8_t* op;
int16_t* tp;
int16_t b;
tmsize_t occ;
int rc=0, mask;
tmsize_t beg;
(void)s;
assert(s == 0);
assert(sp != NULL);
npixels = cc / sp->pixel_size;
if (sp->user_datafmt == SGILOGDATAFMT_16BIT)
tp = (int16_t*) bp;
else {
tp = (int16_t*) sp->tbuf;
if(sp->tbuflen < npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Translation buffer too short");
return (0);
}
(*sp->tfunc)(sp, bp, npixels);
}
/* compress each byte string */
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
for (shft = 8; shft >= 0; shft -=8) {
for (i = 0; i < npixels; i += rc) {
if (occ < 4) {
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
if (!TIFFFlushData1(tif))
return (0);
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
}
mask = 0xff << shft; /* find next run */
for (beg = i; beg < npixels; beg += rc) {
b = (int16_t) (tp[beg] & mask);
rc = 1;
while (rc < 127+2 && beg+rc < npixels &&
(tp[beg+rc] & mask) == b)
rc++;
if (rc >= MINRUN)
break; /* long enough */
}
if (beg-i > 1 && beg-i < MINRUN) {
b = (int16_t) (tp[i] & mask);/*check short run */
j = i+1;
while ((tp[j++] & mask) == b)
if (j == beg) {
*op++ = (uint8_t)(128 - 2 + j - i);
*op++ = (uint8_t)(b >> shft);
occ -= 2;
i = beg;
break;
}
}
while (i < beg) { /* write out non-run */
if ((j = beg-i) > 127) j = 127;
if (occ < j+3) {
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
if (!TIFFFlushData1(tif))
return (0);
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
}
*op++ = (uint8_t) j; occ--;
while (j--) {
*op++ = (uint8_t) (tp[i++] >> shft & 0xff);
occ--;
}
}
if (rc >= MINRUN) { /* write out run */
*op++ = (uint8_t) (128 - 2 + rc);
*op++ = (uint8_t) (tp[beg] >> shft & 0xff);
occ -= 2;
} else
rc = 0;
}
}
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
return (1);
}
/*
* Encode a row of 24-bit pixels.
*/
static int
LogLuvEncode24(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
static const char module[] = "LogLuvEncode24";
LogLuvState* sp = EncoderState(tif);
tmsize_t i;
tmsize_t npixels;
tmsize_t occ;
uint8_t* op;
uint32_t* tp;
(void)s;
assert(s == 0);
assert(sp != NULL);
npixels = cc / sp->pixel_size;
if (sp->user_datafmt == SGILOGDATAFMT_RAW)
tp = (uint32_t*) bp;
else {
tp = (uint32_t*) sp->tbuf;
if(sp->tbuflen < npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Translation buffer too short");
return (0);
}
(*sp->tfunc)(sp, bp, npixels);
}
/* write out encoded pixels */
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
for (i = npixels; i--; ) {
if (occ < 3) {
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
if (!TIFFFlushData1(tif))
return (0);
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
}
*op++ = (uint8_t)(*tp >> 16);
*op++ = (uint8_t)(*tp >> 8 & 0xff);
*op++ = (uint8_t)(*tp++ & 0xff);
occ -= 3;
}
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
return (1);
}
/*
* Encode a row of 32-bit pixels.
*/
static int
LogLuvEncode32(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
static const char module[] = "LogLuvEncode32";
LogLuvState* sp = EncoderState(tif);
int shft;
tmsize_t i;
tmsize_t j;
tmsize_t npixels;
uint8_t* op;
uint32_t* tp;
uint32_t b;
tmsize_t occ;
int rc=0, mask;
tmsize_t beg;
(void)s;
assert(s == 0);
assert(sp != NULL);
npixels = cc / sp->pixel_size;
if (sp->user_datafmt == SGILOGDATAFMT_RAW)
tp = (uint32_t*) bp;
else {
tp = (uint32_t*) sp->tbuf;
if(sp->tbuflen < npixels) {
TIFFErrorExt(tif->tif_clientdata, module,
"Translation buffer too short");
return (0);
}
(*sp->tfunc)(sp, bp, npixels);
}
/* compress each byte string */
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
for (shft = 24; shft >= 0; shft -=8) {
for (i = 0; i < npixels; i += rc) {
if (occ < 4) {
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
if (!TIFFFlushData1(tif))
return (0);
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
}
mask = 0xff << shft; /* find next run */
for (beg = i; beg < npixels; beg += rc) {
b = tp[beg] & mask;
rc = 1;
while (rc < 127+2 && beg+rc < npixels &&
(tp[beg+rc] & mask) == b)
rc++;
if (rc >= MINRUN)
break; /* long enough */
}
if (beg-i > 1 && beg-i < MINRUN) {
b = tp[i] & mask; /* check short run */
j = i+1;
while ((tp[j++] & mask) == b)
if (j == beg) {
*op++ = (uint8_t)(128 - 2 + j - i);
*op++ = (uint8_t)(b >> shft);
occ -= 2;
i = beg;
break;
}
}
while (i < beg) { /* write out non-run */
if ((j = beg-i) > 127) j = 127;
if (occ < j+3) {
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
if (!TIFFFlushData1(tif))
return (0);
op = tif->tif_rawcp;
occ = tif->tif_rawdatasize - tif->tif_rawcc;
}
*op++ = (uint8_t) j; occ--;
while (j--) {
*op++ = (uint8_t)(tp[i++] >> shft & 0xff);
occ--;
}
}
if (rc >= MINRUN) { /* write out run */
*op++ = (uint8_t) (128 - 2 + rc);
*op++ = (uint8_t)(tp[beg] >> shft & 0xff);
occ -= 2;
} else
rc = 0;
}
}
tif->tif_rawcp = op;
tif->tif_rawcc = tif->tif_rawdatasize - occ;
return (1);
}
/*
* Encode a strip of pixels. We break it into rows to
* avoid encoding runs across row boundaries.
*/
static int
LogLuvEncodeStrip(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
tmsize_t rowlen = TIFFScanlineSize(tif);
if (rowlen == 0)
return 0;
assert(cc%rowlen == 0);
while (cc && (*tif->tif_encoderow)(tif, bp, rowlen, s) == 1) {
bp += rowlen;
cc -= rowlen;
}
return (cc == 0);
}
/*
* Encode a tile of pixels. We break it into rows to
* avoid encoding runs across row boundaries.
*/
static int
LogLuvEncodeTile(TIFF* tif, uint8_t* bp, tmsize_t cc, uint16_t s)
{
tmsize_t rowlen = TIFFTileRowSize(tif);
if (rowlen == 0)
return 0;
assert(cc%rowlen == 0);
while (cc && (*tif->tif_encoderow)(tif, bp, rowlen, s) == 1) {
bp += rowlen;
cc -= rowlen;
}
return (cc == 0);
}
/*
* Encode/Decode functions for converting to and from user formats.
*/
#include "uvcode.h"
#ifndef UVSCALE
#define U_NEU 0.210526316
#define V_NEU 0.473684211
#define UVSCALE 410.
#endif
#ifndef M_LN2
#define M_LN2 0.69314718055994530942
#endif
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
#undef log2 /* Conflict with C'99 function */
#define log2(x) ((1./M_LN2)*log(x))
#undef exp2 /* Conflict with C'99 function */
#define exp2(x) exp(M_LN2*(x))
static int tiff_itrunc(double x, int m)
{
if( m == SGILOGENCODE_NODITHER )
return (int)x;
/* Silence CoverityScan warning about bad crypto function */
/* coverity[dont_call] */
return (int)(x + rand()*(1./RAND_MAX) - .5);
}
#if !LOGLUV_PUBLIC
static
#endif
double
LogL16toY(int p16) /* compute luminance from 16-bit LogL */
{
int Le = p16 & 0x7fff;
double Y;
if (!Le)
return (0.);
Y = exp(M_LN2/256.*(Le+.5) - M_LN2*64.);
return (!(p16 & 0x8000) ? Y : -Y);
}
#if !LOGLUV_PUBLIC
static
#endif
int
LogL16fromY(double Y, int em) /* get 16-bit LogL from Y */
{
if (Y >= 1.8371976e19)
return (0x7fff);
if (Y <= -1.8371976e19)
return (0xffff);
if (Y > 5.4136769e-20)
return tiff_itrunc(256.*(log2(Y) + 64.), em);
if (Y < -5.4136769e-20)
return (~0x7fff | tiff_itrunc(256.*(log2(-Y) + 64.), em));
return (0);
}
static void
L16toY(LogLuvState* sp, uint8_t* op, tmsize_t n)
{
int16_t* l16 = (int16_t*) sp->tbuf;
float* yp = (float*) op;
while (n-- > 0)
*yp++ = (float)LogL16toY(*l16++);
}
static void
L16toGry(LogLuvState* sp, uint8_t* op, tmsize_t n)
{
int16_t* l16 = (int16_t*) sp->tbuf;
uint8_t* gp = (uint8_t*) op;
while (n-- > 0) {
double Y = LogL16toY(*l16++);
*gp++ = (uint8_t) ((Y <= 0.) ? 0 : (Y >= 1.) ? 255 : (int)(256. * sqrt(Y)));
}
}
static void
L16fromY(LogLuvState* sp, uint8_t* op, tmsize_t n)
{
int16_t* l16 = (int16_t*) sp->tbuf;
float* yp = (float*) op;
while (n-- > 0)
*l16++ = (int16_t) (LogL16fromY(*yp++, sp->encode_meth));
}
#if !LOGLUV_PUBLIC
static
#endif
void
XYZtoRGB24(float xyz[3], uint8_t rgb[3])
{
double r, g, b;
/* assume CCIR-709 primaries */
r = 2.690*xyz[0] + -1.276*xyz[1] + -0.414*xyz[2];
g = -1.022*xyz[0] + 1.978*xyz[1] + 0.044*xyz[2];
b = 0.061*xyz[0] + -0.224*xyz[1] + 1.163*xyz[2];
/* assume 2.0 gamma for speed */
/* could use integer sqrt approx., but this is probably faster */
rgb[0] = (uint8_t)((r <= 0.) ? 0 : (r >= 1.) ? 255 : (int)(256. * sqrt(r)));
rgb[1] = (uint8_t)((g <= 0.) ? 0 : (g >= 1.) ? 255 : (int)(256. * sqrt(g)));
rgb[2] = (uint8_t)((b <= 0.) ? 0 : (b >= 1.) ? 255 : (int)(256. * sqrt(b)));
}
#if !LOGLUV_PUBLIC
static
#endif
double
LogL10toY(int p10) /* compute luminance from 10-bit LogL */
{
if (p10 == 0)
return (0.);
return (exp(M_LN2/64.*(p10+.5) - M_LN2*12.));
}
#if !LOGLUV_PUBLIC
static
#endif
int
LogL10fromY(double Y, int em) /* get 10-bit LogL from Y */
{
if (Y >= 15.742)
return (0x3ff);
else if (Y <= .00024283)
return (0);
else
return tiff_itrunc(64.*(log2(Y) + 12.), em);
}
#define NANGLES 100
#define uv2ang(u, v) ( (NANGLES*.499999999/M_PI) \
* atan2((v)-V_NEU,(u)-U_NEU) + .5*NANGLES )
static int
oog_encode(double u, double v) /* encode out-of-gamut chroma */
{
static int oog_table[NANGLES];
static int initialized = 0;
register int i;
if (!initialized) { /* set up perimeter table */
double eps[NANGLES], ua, va, ang, epsa;
int ui, vi, ustep;
for (i = NANGLES; i--; )
eps[i] = 2.;
for (vi = UV_NVS; vi--; ) {
va = UV_VSTART + (vi+.5)*UV_SQSIZ;
ustep = uv_row[vi].nus-1;
if (vi == UV_NVS-1 || vi == 0 || ustep <= 0)
ustep = 1;
for (ui = uv_row[vi].nus-1; ui >= 0; ui -= ustep) {
ua = uv_row[vi].ustart + (ui+.5)*UV_SQSIZ;
ang = uv2ang(ua, va);
i = (int) ang;
epsa = fabs(ang - (i+.5));
if (epsa < eps[i]) {
oog_table[i] = uv_row[vi].ncum + ui;
eps[i] = epsa;
}
}
}
for (i = NANGLES; i--; ) /* fill any holes */
if (eps[i] > 1.5) {
int i1, i2;
for (i1 = 1; i1 < NANGLES/2; i1++)
if (eps[(i+i1)%NANGLES] < 1.5)
break;
for (i2 = 1; i2 < NANGLES/2; i2++)
if (eps[(i+NANGLES-i2)%NANGLES] < 1.5)
break;
if (i1 < i2)
oog_table[i] =
oog_table[(i+i1)%NANGLES];
else
oog_table[i] =
oog_table[(i+NANGLES-i2)%NANGLES];
}
initialized = 1;
}
i = (int) uv2ang(u, v); /* look up hue angle */
return (oog_table[i]);
}
#undef uv2ang
#undef NANGLES
#if !LOGLUV_PUBLIC
static
#endif
int
uv_encode(double u, double v, int em) /* encode (u',v') coordinates */
{
register int vi, ui;
if (v < UV_VSTART)
return oog_encode(u, v);
vi = tiff_itrunc((v - UV_VSTART)*(1./UV_SQSIZ), em);
if (vi >= UV_NVS)
return oog_encode(u, v);
if (u < uv_row[vi].ustart)
return oog_encode(u, v);
ui = tiff_itrunc((u - uv_row[vi].ustart)*(1./UV_SQSIZ), em);
if (ui >= uv_row[vi].nus)
return oog_encode(u, v);
return (uv_row[vi].ncum + ui);
}
#if !LOGLUV_PUBLIC
static
#endif
int
uv_decode(double *up, double *vp, int c) /* decode (u',v') index */
{
int upper, lower;
register int ui, vi;
if (c < 0 || c >= UV_NDIVS)
return (-1);
lower = 0; /* binary search */
upper = UV_NVS;
while (upper - lower > 1) {
vi = (lower + upper) >> 1;
ui = c - uv_row[vi].ncum;
if (ui > 0)
lower = vi;
else if (ui < 0)
upper = vi;
else {
lower = vi;
break;
}
}
vi = lower;
ui = c - uv_row[vi].ncum;
*up = uv_row[vi].ustart + (ui+.5)*UV_SQSIZ;
*vp = UV_VSTART + (vi+.5)*UV_SQSIZ;
return (0);
}
#if !LOGLUV_PUBLIC
static
#endif
void
LogLuv24toXYZ(uint32_t p, float XYZ[3])
{
int Ce;
double L, u, v, s, x, y;
/* decode luminance */
L = LogL10toY(p>>14 & 0x3ff);
if (L <= 0.) {
XYZ[0] = XYZ[1] = XYZ[2] = 0.;
return;
}
/* decode color */
Ce = p & 0x3fff;
if (uv_decode(&u, &v, Ce) < 0) {
u = U_NEU; v = V_NEU;
}
s = 1./(6.*u - 16.*v + 12.);
x = 9.*u * s;
y = 4.*v * s;
/* convert to XYZ */
XYZ[0] = (float)(x/y * L);
XYZ[1] = (float)L;
XYZ[2] = (float)((1.-x-y)/y * L);
}
#if !LOGLUV_PUBLIC
static
#endif
uint32_t
LogLuv24fromXYZ(float XYZ[3], int em)
{
int Le, Ce;
double u, v, s;
/* encode luminance */
Le = LogL10fromY(XYZ[1], em);
/* encode color */
s = XYZ[0] + 15.*XYZ[1] + 3.*XYZ[2];
if (!Le || s <= 0.) {
u = U_NEU;
v = V_NEU;
} else {