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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
|
/*
* tkImgPhInstance.c --
*
* Implements the rendering of images of type "photo" for Tk. Photo
* images are stored in full color (32 bits per pixel including alpha
* channel) and displayed using dithering if necessary.
*
* Copyright (c) 1994 The Australian National University.
* Copyright (c) 1994-1997 Sun Microsystems, Inc.
* Copyright (c) 2002-2008 Donal K. Fellows
* Copyright (c) 2003 ActiveState Corporation.
*
* See the file "license.terms" for information on usage and redistribution of
* this file, and for a DISCLAIMER OF ALL WARRANTIES.
*
* Author: Paul Mackerras (paulus@cs.anu.edu.au),
* Department of Computer Science,
* Australian National University.
*/
#include "tkImgPhoto.h"
/*
* Declaration for internal Xlib function used here:
*/
extern int _XInitImageFuncPtrs(XImage *image);
/*
* Forward declarations
*/
static void BlendComplexAlpha(XImage *bgImg, PhotoInstance *iPtr,
int xOffset, int yOffset, int width, int height);
static int IsValidPalette(PhotoInstance *instancePtr,
const char *palette);
static int CountBits(pixel mask);
static void GetColorTable(PhotoInstance *instancePtr);
static void FreeColorTable(ColorTable *colorPtr, int force);
static void AllocateColors(ColorTable *colorPtr);
static void DisposeColorTable(ClientData clientData);
static int ReclaimColors(ColorTableId *id, int numColors);
/*
* Hash table used to hash from (display, colormap, palette, gamma) to
* ColorTable address.
*/
static Tcl_HashTable imgPhotoColorHash;
static int imgPhotoColorHashInitialized;
#define N_COLOR_HASH (sizeof(ColorTableId) / sizeof(int))
/*
*----------------------------------------------------------------------
*
* TkImgPhotoConfigureInstance --
*
* This function is called to create displaying information for a photo
* image instance based on the configuration information in the master.
* It is invoked both when new instances are created and when the master
* is reconfigured.
*
* Results:
* None.
*
* Side effects:
* Generates errors via Tcl_BackgroundException if there are problems in
* setting up the instance.
*
*----------------------------------------------------------------------
*/
void
TkImgPhotoConfigureInstance(
PhotoInstance *instancePtr) /* Instance to reconfigure. */
{
PhotoMaster *masterPtr = instancePtr->masterPtr;
XImage *imagePtr;
int bitsPerPixel;
ColorTable *colorTablePtr;
XRectangle validBox;
/*
* If the -palette configuration option has been set for the master, use
* the value specified for our palette, but only if it is a valid palette
* for our windows. Use the gamma value specified the master.
*/
if ((masterPtr->palette && masterPtr->palette[0])
&& IsValidPalette(instancePtr, masterPtr->palette)) {
instancePtr->palette = masterPtr->palette;
} else {
instancePtr->palette = instancePtr->defaultPalette;
}
instancePtr->gamma = masterPtr->gamma;
/*
* If we don't currently have a color table, or if the one we have no
* longer applies (e.g. because our palette or gamma has changed), get a
* new one.
*/
colorTablePtr = instancePtr->colorTablePtr;
if ((colorTablePtr == NULL)
|| (instancePtr->colormap != colorTablePtr->id.colormap)
|| (instancePtr->palette != colorTablePtr->id.palette)
|| (instancePtr->gamma != colorTablePtr->id.gamma)) {
/*
* Free up our old color table, and get a new one.
*/
if (colorTablePtr != NULL) {
colorTablePtr->liveRefCount -= 1;
FreeColorTable(colorTablePtr, 0);
}
GetColorTable(instancePtr);
/*
* Create a new XImage structure for sending data to the X server, if
* necessary.
*/
if (instancePtr->colorTablePtr->flags & BLACK_AND_WHITE) {
bitsPerPixel = 1;
} else {
bitsPerPixel = instancePtr->visualInfo.depth;
}
if ((instancePtr->imagePtr == NULL)
|| (instancePtr->imagePtr->bits_per_pixel != bitsPerPixel)) {
if (instancePtr->imagePtr != NULL) {
XDestroyImage(instancePtr->imagePtr);
}
imagePtr = XCreateImage(instancePtr->display,
instancePtr->visualInfo.visual, (unsigned) bitsPerPixel,
(bitsPerPixel > 1? ZPixmap: XYBitmap), 0, NULL,
1, 1, 32, 0);
instancePtr->imagePtr = imagePtr;
/*
* We create images using the local host's endianness, rather than
* the endianness of the server; otherwise we would have to
* byte-swap any 16 or 32 bit values that we store in the image
* if the server's endianness is different from ours.
*/
if (imagePtr != NULL) {
#ifdef WORDS_BIGENDIAN
imagePtr->byte_order = MSBFirst;
#else
imagePtr->byte_order = LSBFirst;
#endif
_XInitImageFuncPtrs(imagePtr);
}
}
}
/*
* If the user has specified a width and/or height for the master which is
* different from our current width/height, set the size to the values
* specified by the user. If we have no pixmap, we do this also, since it
* has the side effect of allocating a pixmap for us.
*/
if ((instancePtr->pixels == None) || (instancePtr->error == NULL)
|| (instancePtr->width != masterPtr->width)
|| (instancePtr->height != masterPtr->height)) {
TkImgPhotoInstanceSetSize(instancePtr);
}
/*
* Redither this instance if necessary.
*/
if ((masterPtr->flags & IMAGE_CHANGED)
|| (instancePtr->colorTablePtr != colorTablePtr)) {
TkClipBox(masterPtr->validRegion, &validBox);
if ((validBox.width > 0) && (validBox.height > 0)) {
TkImgDitherInstance(instancePtr, validBox.x, validBox.y,
validBox.width, validBox.height);
}
}
}
/*
*----------------------------------------------------------------------
*
* TkImgPhotoGet --
*
* This function is called for each use of a photo image in a widget.
*
* Results:
* The return value is a token for the instance, which is passed back to
* us in calls to TkImgPhotoDisplay and ImgPhotoFree.
*
* Side effects:
* A data structure is set up for the instance (or, an existing instance
* is re-used for the new one).
*
*----------------------------------------------------------------------
*/
ClientData
TkImgPhotoGet(
Tk_Window tkwin, /* Window in which the instance will be
* used. */
ClientData masterData) /* Pointer to our master structure for the
* image. */
{
PhotoMaster *masterPtr = masterData;
PhotoInstance *instancePtr;
Colormap colormap;
int mono, nRed, nGreen, nBlue, numVisuals;
XVisualInfo visualInfo, *visInfoPtr;
char buf[TCL_INTEGER_SPACE * 3];
XColor *white, *black;
XGCValues gcValues;
/*
* Table of "best" choices for palette for PseudoColor displays with
* between 3 and 15 bits/pixel.
*/
static const int paletteChoice[13][3] = {
/* #red, #green, #blue */
{2, 2, 2, /* 3 bits, 8 colors */},
{2, 3, 2, /* 4 bits, 12 colors */},
{3, 4, 2, /* 5 bits, 24 colors */},
{4, 5, 3, /* 6 bits, 60 colors */},
{5, 6, 4, /* 7 bits, 120 colors */},
{7, 7, 4, /* 8 bits, 198 colors */},
{8, 10, 6, /* 9 bits, 480 colors */},
{10, 12, 8, /* 10 bits, 960 colors */},
{14, 15, 9, /* 11 bits, 1890 colors */},
{16, 20, 12, /* 12 bits, 3840 colors */},
{20, 24, 16, /* 13 bits, 7680 colors */},
{26, 30, 20, /* 14 bits, 15600 colors */},
{32, 32, 30, /* 15 bits, 30720 colors */}
};
/*
* See if there is already an instance for windows using the same
* colormap. If so then just re-use it.
*/
colormap = Tk_Colormap(tkwin);
for (instancePtr = masterPtr->instancePtr; instancePtr != NULL;
instancePtr = instancePtr->nextPtr) {
if ((colormap == instancePtr->colormap)
&& (Tk_Display(tkwin) == instancePtr->display)) {
/*
* Re-use this instance.
*/
if (instancePtr->refCount == 0) {
/*
* We are resurrecting this instance.
*/
Tcl_CancelIdleCall(TkImgDisposeInstance, instancePtr);
if (instancePtr->colorTablePtr != NULL) {
FreeColorTable(instancePtr->colorTablePtr, 0);
}
GetColorTable(instancePtr);
}
instancePtr->refCount++;
return instancePtr;
}
}
/*
* The image isn't already in use in a window with the same colormap. Make
* a new instance of the image.
*/
instancePtr = ckalloc(sizeof(PhotoInstance));
instancePtr->masterPtr = masterPtr;
instancePtr->display = Tk_Display(tkwin);
instancePtr->colormap = Tk_Colormap(tkwin);
Tk_PreserveColormap(instancePtr->display, instancePtr->colormap);
instancePtr->refCount = 1;
instancePtr->colorTablePtr = NULL;
instancePtr->pixels = None;
instancePtr->error = NULL;
instancePtr->width = 0;
instancePtr->height = 0;
instancePtr->imagePtr = 0;
instancePtr->nextPtr = masterPtr->instancePtr;
masterPtr->instancePtr = instancePtr;
/*
* Obtain information about the visual and decide on the default palette.
*/
visualInfo.screen = Tk_ScreenNumber(tkwin);
visualInfo.visualid = XVisualIDFromVisual(Tk_Visual(tkwin));
visInfoPtr = XGetVisualInfo(Tk_Display(tkwin),
VisualScreenMask | VisualIDMask, &visualInfo, &numVisuals);
if (visInfoPtr == NULL) {
Tcl_Panic("TkImgPhotoGet couldn't find visual for window");
}
nRed = 2;
nGreen = nBlue = 0;
mono = 1;
instancePtr->visualInfo = *visInfoPtr;
switch (visInfoPtr->class) {
case DirectColor:
case TrueColor:
nRed = 1 << CountBits(visInfoPtr->red_mask);
nGreen = 1 << CountBits(visInfoPtr->green_mask);
nBlue = 1 << CountBits(visInfoPtr->blue_mask);
mono = 0;
break;
case PseudoColor:
case StaticColor:
if (visInfoPtr->depth > 15) {
nRed = 32;
nGreen = 32;
nBlue = 32;
mono = 0;
} else if (visInfoPtr->depth >= 3) {
const int *ip = paletteChoice[visInfoPtr->depth - 3];
nRed = ip[0];
nGreen = ip[1];
nBlue = ip[2];
mono = 0;
}
break;
case GrayScale:
case StaticGray:
nRed = 1 << visInfoPtr->depth;
break;
}
XFree((char *) visInfoPtr);
if (mono) {
sprintf(buf, "%d", nRed);
} else {
sprintf(buf, "%d/%d/%d", nRed, nGreen, nBlue);
}
instancePtr->defaultPalette = Tk_GetUid(buf);
/*
* Make a GC with background = black and foreground = white.
*/
white = Tk_GetColor(masterPtr->interp, tkwin, "white");
black = Tk_GetColor(masterPtr->interp, tkwin, "black");
gcValues.foreground = (white != NULL)? white->pixel:
WhitePixelOfScreen(Tk_Screen(tkwin));
gcValues.background = (black != NULL)? black->pixel:
BlackPixelOfScreen(Tk_Screen(tkwin));
Tk_FreeColor(white);
Tk_FreeColor(black);
gcValues.graphics_exposures = False;
instancePtr->gc = Tk_GetGC(tkwin,
GCForeground|GCBackground|GCGraphicsExposures, &gcValues);
/*
* Set configuration options and finish the initialization of the
* instance. This will also dither the image if necessary.
*/
TkImgPhotoConfigureInstance(instancePtr);
/*
* If this is the first instance, must set the size of the image.
*/
if (instancePtr->nextPtr == NULL) {
Tk_ImageChanged(masterPtr->tkMaster, 0, 0, 0, 0,
masterPtr->width, masterPtr->height);
}
return instancePtr;
}
/*
*----------------------------------------------------------------------
*
* BlendComplexAlpha --
*
* This function is called when an image with partially transparent
* pixels must be drawn over another image. It blends the photo data onto
* a local copy of the surface that we are drawing on, *including* the
* pixels drawn by everything that should be drawn underneath the image.
*
* Much of this code has hard-coded values in for speed because this
* routine is performance critical for complex image drawing.
*
* Results:
* None.
*
* Side effects:
* Background image passed in gets drawn over with image data.
*
* Notes:
* This should work on all platforms that set mask and shift data
* properly from the visualInfo. RGB is really only a 24+ bpp version
* whereas RGB15 is the correct version and works for 15bpp+, but it
* slower, so it's only used for 15bpp+.
*
* Note that Win32 pre-defines those operations that we really need.
*
* Note that on MacOS, if the background comes from a Retina display
* then it will be twice as wide and twice as high as the photoimage.
*
*----------------------------------------------------------------------
*/
#ifndef _WIN32
#define GetRValue(rgb) (UCHAR(((rgb) & red_mask) >> red_shift))
#define GetGValue(rgb) (UCHAR(((rgb) & green_mask) >> green_shift))
#define GetBValue(rgb) (UCHAR(((rgb) & blue_mask) >> blue_shift))
#define RGB(r, g, b) ((unsigned)( \
(UCHAR(r) << red_shift) | \
(UCHAR(g) << green_shift) | \
(UCHAR(b) << blue_shift) ))
#ifdef MAC_OSX_TK
#define RGBA(r, g, b, a) ((unsigned)( \
(UCHAR(r) << red_shift) | \
(UCHAR(g) << green_shift) | \
(UCHAR(b) << blue_shift) | \
(UCHAR(a) << alpha_shift) ))
#endif
#define RGB15(r, g, b) ((unsigned)( \
(((r) * red_mask / 255) & red_mask) | \
(((g) * green_mask / 255) & green_mask) | \
(((b) * blue_mask / 255) & blue_mask) ))
#endif /* !_WIN32 */
static void
BlendComplexAlpha(
XImage *bgImg, /* Background image to draw on. */
PhotoInstance *iPtr, /* Image instance to draw. */
int xOffset, int yOffset, /* X & Y offset into image instance to
* draw. */
int width, int height) /* Width & height of image to draw. */
{
int x, y, line;
unsigned long pixel;
unsigned char r, g, b, alpha, unalpha, *masterPtr;
unsigned char *alphaAr = iPtr->masterPtr->pix32;
#if defined(MAC_OSX_TK)
/* Background "pixels" are actually 2^pp x 2^pp blocks of subpixels. Each
* block gets blended with the color of one image pixel. Since we iterate
* over the background subpixels, we reset the width and height to the
* subpixel dimensions of the background image we are using.
*/
int pp = bgImg->pixelpower;
width = width << pp;
height = height << pp;
#endif
/*
* This blending is an integer version of the Source-Over compositing rule
* (see Porter&Duff, "Compositing Digital Images", proceedings of SIGGRAPH
* 1984) that has been hard-coded (for speed) to work with targetting a
* solid surface.
*
* The 'unalpha' field must be 255-alpha; it is separated out to encourage
* more efficient compilation.
*/
#define ALPHA_BLEND(bgPix, imgPix, alpha, unalpha) \
((bgPix * unalpha + imgPix * alpha) / 255)
/*
* We have to get the mask and shift info from the visual on non-Win32 so
* that the macros Get*Value(), RGB() and RGB15() work correctly. This
* might be cached for better performance.
*/
#ifndef _WIN32
unsigned long red_mask, green_mask, blue_mask;
unsigned long red_shift, green_shift, blue_shift;
Visual *visual = iPtr->visualInfo.visual;
red_mask = visual->red_mask;
green_mask = visual->green_mask;
blue_mask = visual->blue_mask;
red_shift = 0;
green_shift = 0;
blue_shift = 0;
while ((0x0001 & (red_mask >> red_shift)) == 0) {
red_shift++;
}
while ((0x0001 & (green_mask >> green_shift)) == 0) {
green_shift++;
}
while ((0x0001 & (blue_mask >> blue_shift)) == 0) {
blue_shift++;
}
#ifdef MAC_OSX_TK
unsigned long alpha_mask = visual->alpha_mask;
unsigned long alpha_shift = 0;
while ((0x0001 & (alpha_mask >> alpha_shift)) == 0) {
alpha_shift++;
}
#endif
#endif /* !_WIN32 */
/*
* Only UNIX requires the special case for <24bpp. It varies with 3 extra
* shifts and uses RGB15. The 24+bpp version could also then be further
* optimized.
*/
#if !(defined(_WIN32) || defined(MAC_OSX_TK))
if (bgImg->depth < 24) {
unsigned char red_mlen, green_mlen, blue_mlen;
red_mlen = 8 - CountBits(red_mask >> red_shift);
green_mlen = 8 - CountBits(green_mask >> green_shift);
blue_mlen = 8 - CountBits(blue_mask >> blue_shift);
for (y = 0; y < height; y++) {
line = (y + yOffset) * iPtr->masterPtr->width;
for (x = 0; x < width; x++) {
masterPtr = alphaAr + ((line + x + xOffset) * 4);
alpha = masterPtr[3];
/*
* Ignore pixels that are fully transparent
*/
if (alpha) {
/*
* We could perhaps be more efficient than XGetPixel for
* 24 and 32 bit displays, but this seems "fast enough".
*/
r = masterPtr[0];
g = masterPtr[1];
b = masterPtr[2];
if (alpha != 255) {
/*
* Only blend pixels that have some transparency
*/
unsigned char ra, ga, ba;
pixel = XGetPixel(bgImg, x, y);
ra = GetRValue(pixel) << red_mlen;
ga = GetGValue(pixel) << green_mlen;
ba = GetBValue(pixel) << blue_mlen;
unalpha = 255 - alpha; /* Calculate once. */
r = ALPHA_BLEND(ra, r, alpha, unalpha);
g = ALPHA_BLEND(ga, g, alpha, unalpha);
b = ALPHA_BLEND(ba, b, alpha, unalpha);
}
XPutPixel(bgImg, x, y, RGB15(r, g, b));
}
}
}
return;
}
#endif /* !_WIN32 && !MAC_OSX_TK */
for (y = 0; y < height; y++) {
# if !defined(MAC_OSX_TK)
line = (y + yOffset) * iPtr->masterPtr->width;
for (x = 0; x < width; x++) {
masterPtr = alphaAr + ((line + x + xOffset) * 4);
#else
/* Repeat each image row and column 2^pp times. */
line = ((y>>pp) + yOffset) * iPtr->masterPtr->width;
for (x = 0; x < width; x++) {
masterPtr = alphaAr + ((line + (x>>pp) + xOffset) * 4);
#endif
alpha = masterPtr[3];
/*
* Ignore pixels that are fully transparent
*/
if (alpha) {
/*
* We could perhaps be more efficient than XGetPixel for 24
* and 32 bit displays, but this seems "fast enough".
*/
r = masterPtr[0];
g = masterPtr[1];
b = masterPtr[2];
if (alpha != 255) {
/*
* Only blend pixels that have some transparency
*/
unsigned char ra, ga, ba;
pixel = XGetPixel(bgImg, x, y);
ra = GetRValue(pixel);
ga = GetGValue(pixel);
ba = GetBValue(pixel);
unalpha = 255 - alpha; /* Calculate once. */
r = ALPHA_BLEND(ra, r, alpha, unalpha);
g = ALPHA_BLEND(ga, g, alpha, unalpha);
b = ALPHA_BLEND(ba, b, alpha, unalpha);
}
#ifndef MAC_OSX_TK
XPutPixel(bgImg, x, y, RGB(r, g, b));
#else
XPutPixel(bgImg, x, y, RGBA(r, g, b, alpha));
#endif
}
}
}
#undef ALPHA_BLEND
}
/*
*----------------------------------------------------------------------
*
* TkImgPhotoDisplay --
*
* This function is invoked to draw a photo image.
*
* Results:
* None.
*
* Side effects:
* A portion of the image gets rendered in a pixmap or window.
*
*----------------------------------------------------------------------
*/
void
TkImgPhotoDisplay(
ClientData clientData, /* Pointer to PhotoInstance structure for
* instance to be displayed. */
Display *display, /* Display on which to draw image. */
Drawable drawable, /* Pixmap or window in which to draw image. */
int imageX, int imageY, /* Upper-left corner of region within image to
* draw. */
int width, int height, /* Dimensions of region within image to
* draw. */
int drawableX,int drawableY)/* Coordinates within drawable that correspond
* to imageX and imageY. */
{
PhotoInstance *instancePtr = clientData;
XVisualInfo visInfo = instancePtr->visualInfo;
/*
* If there's no pixmap, it means that an error occurred while creating
* the image instance so it can't be displayed.
*/
if (instancePtr->pixels == None) {
return;
}
if ((instancePtr->masterPtr->flags & COMPLEX_ALPHA)
&& visInfo.depth >= 15
&& (visInfo.class == DirectColor || visInfo.class == TrueColor)) {
Tk_ErrorHandler handler;
XImage *bgImg = NULL;
/*
* Create an error handler to suppress the case where the input was
* not properly constrained, which can cause an X error. [Bug 979239]
*/
handler = Tk_CreateErrorHandler(display, -1, -1, -1, NULL, NULL);
/*
* Pull the current background from the display to blend with
*/
bgImg = XGetImage(display, drawable, drawableX, drawableY,
(unsigned int)width, (unsigned int)height, AllPlanes, ZPixmap);
if (bgImg == NULL) {
Tk_DeleteErrorHandler(handler);
/* We failed to get the image, so draw without blending alpha.
* It's the best we can do.
*/
goto fallBack;
}
BlendComplexAlpha(bgImg, instancePtr, imageX, imageY, width, height);
/*
* Color info is unimportant as we only do this operation for depth >=
* 15.
*/
TkPutImage(NULL, 0, display, drawable, instancePtr->gc,
bgImg, 0, 0, drawableX, drawableY,
(unsigned int) width, (unsigned int) height);
XDestroyImage(bgImg);
Tk_DeleteErrorHandler(handler);
} else {
/*
* masterPtr->region describes which parts of the image contain valid
* data. We set this region as the clip mask for the gc, setting its
* origin appropriately, and use it when drawing the image.
*/
fallBack:
TkSetRegion(display, instancePtr->gc,
instancePtr->masterPtr->validRegion);
XSetClipOrigin(display, instancePtr->gc, drawableX - imageX,
drawableY - imageY);
XCopyArea(display, instancePtr->pixels, drawable, instancePtr->gc,
imageX, imageY, (unsigned) width, (unsigned) height,
drawableX, drawableY);
XSetClipMask(display, instancePtr->gc, None);
XSetClipOrigin(display, instancePtr->gc, 0, 0);
}
XFlush(display);
}
/*
*----------------------------------------------------------------------
*
* TkImgPhotoFree --
*
* This function is called when a widget ceases to use a particular
* instance of an image. We don't actually get rid of the instance until
* later because we may be about to get this instance again.
*
* Results:
* None.
*
* Side effects:
* Internal data structures get cleaned up, later.
*
*----------------------------------------------------------------------
*/
void
TkImgPhotoFree(
ClientData clientData, /* Pointer to PhotoInstance structure for
* instance to be displayed. */
Display *display) /* Display containing window that used
* image. */
{
PhotoInstance *instancePtr = clientData;
ColorTable *colorPtr;
if (instancePtr->refCount-- > 1) {
return;
}
/*
* There are no more uses of the image within this widget. Decrement the
* count of live uses of its color table, so that its colors can be
* reclaimed if necessary, and set up an idle call to free the instance
* structure.
*/
colorPtr = instancePtr->colorTablePtr;
if (colorPtr != NULL) {
colorPtr->liveRefCount -= 1;
}
Tcl_DoWhenIdle(TkImgDisposeInstance, instancePtr);
}
/*
*----------------------------------------------------------------------
*
* TkImgPhotoInstanceSetSize --
*
* This function reallocates the instance pixmap and dithering error
* array for a photo instance, as necessary, to change the image's size
* to `width' x `height' pixels.
*
* Results:
* None.
*
* Side effects:
* Storage gets reallocated, here and in the X server.
*
*----------------------------------------------------------------------
*/
void
TkImgPhotoInstanceSetSize(
PhotoInstance *instancePtr) /* Instance whose size is to be changed. */
{
PhotoMaster *masterPtr;
schar *newError, *errSrcPtr, *errDestPtr;
int h, offset;
XRectangle validBox;
Pixmap newPixmap;
masterPtr = instancePtr->masterPtr;
TkClipBox(masterPtr->validRegion, &validBox);
if ((instancePtr->width != masterPtr->width)
|| (instancePtr->height != masterPtr->height)
|| (instancePtr->pixels == None)) {
newPixmap = Tk_GetPixmap(instancePtr->display,
RootWindow(instancePtr->display,
instancePtr->visualInfo.screen),
(masterPtr->width > 0) ? masterPtr->width: 1,
(masterPtr->height > 0) ? masterPtr->height: 1,
instancePtr->visualInfo.depth);
if (!newPixmap) {
Tcl_Panic("Fail to create pixmap with Tk_GetPixmap in TkImgPhotoInstanceSetSize");
}
/*
* The following is a gross hack needed to properly support colormaps
* under Windows. Before the pixels can be copied to the pixmap, the
* relevent colormap must be associated with the drawable. Normally we
* can infer this association from the window that was used to create
* the pixmap. However, in this case we're using the root window, so
* we have to be more explicit.
*/
TkSetPixmapColormap(newPixmap, instancePtr->colormap);
if (instancePtr->pixels != None) {
/*
* Copy any common pixels from the old pixmap and free it.
*/
XCopyArea(instancePtr->display, instancePtr->pixels, newPixmap,
instancePtr->gc, validBox.x, validBox.y,
validBox.width, validBox.height, validBox.x, validBox.y);
Tk_FreePixmap(instancePtr->display, instancePtr->pixels);
}
instancePtr->pixels = newPixmap;
}
if ((instancePtr->width != masterPtr->width)
|| (instancePtr->height != masterPtr->height)
|| (instancePtr->error == NULL)) {
if (masterPtr->height > 0 && masterPtr->width > 0) {
/*
* TODO: use attemptckalloc() here once there is a strategy that
* will allow us to recover from failure. Right now, there's no
* such possibility.
*/
newError = ckalloc(masterPtr->height * masterPtr->width
* 3 * sizeof(schar));
/*
* Zero the new array so that we don't get bogus error values
* propagating into areas we dither later.
*/
if ((instancePtr->error != NULL)
&& ((instancePtr->width == masterPtr->width)
|| (validBox.width == masterPtr->width))) {
if (validBox.y > 0) {
memset(newError, 0, (size_t)
validBox.y * masterPtr->width * 3 * sizeof(schar));
}
h = validBox.y + validBox.height;
if (h < masterPtr->height) {
memset(newError + h*masterPtr->width*3, 0,
(size_t) (masterPtr->height - h)
* masterPtr->width * 3 * sizeof(schar));
}
} else {
memset(newError, 0, (size_t)
masterPtr->height * masterPtr->width *3*sizeof(schar));
}
} else {
newError = NULL;
}
if (instancePtr->error != NULL) {
/*
* Copy the common area over to the new array and free the old
* array.
*/
if (masterPtr->width == instancePtr->width) {
offset = validBox.y * masterPtr->width * 3;
memcpy(newError + offset, instancePtr->error + offset,
(size_t) (validBox.height
* masterPtr->width * 3 * sizeof(schar)));
} else if (validBox.width > 0 && validBox.height > 0) {
errDestPtr = newError +
(validBox.y * masterPtr->width + validBox.x) * 3;
errSrcPtr = instancePtr->error +
(validBox.y * instancePtr->width + validBox.x) * 3;
for (h = validBox.height; h > 0; --h) {
memcpy(errDestPtr, errSrcPtr,
validBox.width * 3 * sizeof(schar));
errDestPtr += masterPtr->width * 3;
errSrcPtr += instancePtr->width * 3;
}
}
ckfree(instancePtr->error);
}
instancePtr->error = newError;
}
instancePtr->width = masterPtr->width;
instancePtr->height = masterPtr->height;
}
/*
*----------------------------------------------------------------------
*
* IsValidPalette --
*
* This function is called to check whether a value given for the
* -palette option is valid for a particular instance of a photo image.
*
* Results:
* A boolean value: 1 if the palette is acceptable, 0 otherwise.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
IsValidPalette(
PhotoInstance *instancePtr, /* Instance to which the palette specification
* is to be applied. */
const char *palette) /* Palette specification string. */
{
int nRed, nGreen, nBlue, mono, numColors;
char *endp;
/*
* First parse the specification: it must be of the form %d or %d/%d/%d.
*/
nRed = strtol(palette, &endp, 10);
if ((endp == palette) || ((*endp != 0) && (*endp != '/'))
|| (nRed < 2) || (nRed > 256)) {
return 0;
}
if (*endp == 0) {
mono = 1;
nGreen = nBlue = nRed;
} else {
palette = endp + 1;
nGreen = strtol(palette, &endp, 10);
if ((endp == palette) || (*endp != '/') || (nGreen < 2)
|| (nGreen > 256)) {
return 0;
}
palette = endp + 1;
nBlue = strtol(palette, &endp, 10);
if ((endp == palette) || (*endp != 0) || (nBlue < 2)
|| (nBlue > 256)) {
return 0;
}
mono = 0;
}
switch (instancePtr->visualInfo.class) {
case DirectColor:
case TrueColor:
if ((nRed > (1 << CountBits(instancePtr->visualInfo.red_mask)))
|| (nGreen>(1<<CountBits(instancePtr->visualInfo.green_mask)))
|| (nBlue>(1<<CountBits(instancePtr->visualInfo.blue_mask)))) {
return 0;
}
break;
case PseudoColor:
case StaticColor:
numColors = nRed;
if (!mono) {
numColors *= nGreen * nBlue;
}
if (numColors > (1 << instancePtr->visualInfo.depth)) {
return 0;
}
break;
case GrayScale:
case StaticGray:
if (!mono || (nRed > (1 << instancePtr->visualInfo.depth))) {
return 0;
}
break;
}
return 1;
}
/*
*----------------------------------------------------------------------
*
* CountBits --
*
* This function counts how many bits are set to 1 in `mask'.
*
* Results:
* The integer number of bits.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
static int
CountBits(
pixel mask) /* Value to count the 1 bits in. */
{
int n;
for (n=0 ; mask!=0 ; mask&=mask-1) {
n++;
}
return n;
}
/*
*----------------------------------------------------------------------
*
* GetColorTable --
*
* This function is called to allocate a table of colormap information
* for an instance of a photo image. Only one such table is allocated for
* all photo instances using the same display, colormap, palette and
* gamma values, so that the application need only request a set of
* colors from the X server once for all such photo widgets. This
* function maintains a hash table to find previously-allocated
* ColorTables.
*
* Results:
* None.
*
* Side effects:
* A new ColorTable may be allocated and placed in the hash table, and
* have colors allocated for it.
*
*----------------------------------------------------------------------
*/
static void
GetColorTable(
PhotoInstance *instancePtr) /* Instance needing a color table. */
{
ColorTable *colorPtr;
Tcl_HashEntry *entry;
ColorTableId id;
int isNew;
/*
* Look for an existing ColorTable in the hash table.
*/
memset(&id, 0, sizeof(id));
id.display = instancePtr->display;
id.colormap = instancePtr->colormap;
id.palette = instancePtr->palette;
id.gamma = instancePtr->gamma;
if (!imgPhotoColorHashInitialized) {
Tcl_InitHashTable(&imgPhotoColorHash, N_COLOR_HASH);
imgPhotoColorHashInitialized = 1;
}
entry = Tcl_CreateHashEntry(&imgPhotoColorHash, (char *) &id, &isNew);
if (!isNew) {
/*
* Re-use the existing entry.
*/
colorPtr = Tcl_GetHashValue(entry);
} else {
/*
* No color table currently available; need to make one.
*/
colorPtr = ckalloc(sizeof(ColorTable));
/*
* The following line of code should not normally be needed due to the
* assignment in the following line. However, it compensates for bugs
* in some compilers (HP, for example) where sizeof(ColorTable) is 24
* but the assignment only copies 20 bytes, leaving 4 bytes
* uninitialized; these cause problems when using the id for lookups
* in imgPhotoColorHash, and can result in core dumps.
*/
memset(&colorPtr->id, 0, sizeof(ColorTableId));
colorPtr->id = id;
Tk_PreserveColormap(colorPtr->id.display, colorPtr->id.colormap);
colorPtr->flags = 0;
colorPtr->refCount = 0;
colorPtr->liveRefCount = 0;
colorPtr->numColors = 0;
colorPtr->visualInfo = instancePtr->visualInfo;
colorPtr->pixelMap = NULL;
Tcl_SetHashValue(entry, colorPtr);
}
colorPtr->refCount++;
colorPtr->liveRefCount++;
instancePtr->colorTablePtr = colorPtr;
if (colorPtr->flags & DISPOSE_PENDING) {
Tcl_CancelIdleCall(DisposeColorTable, colorPtr);
colorPtr->flags &= ~DISPOSE_PENDING;
}
/*
* Allocate colors for this color table if necessary.
*/
if ((colorPtr->numColors == 0) && !(colorPtr->flags & BLACK_AND_WHITE)) {
AllocateColors(colorPtr);
}
}
/*
*----------------------------------------------------------------------
*
* FreeColorTable --
*
* This function is called when an instance ceases using a color table.
*
* Results:
* None.
*
* Side effects:
* If no other instances are using this color table, a when-idle handler
* is registered to free up the color table and the colors allocated for
* it.
*
*----------------------------------------------------------------------
*/
static void
FreeColorTable(
ColorTable *colorPtr, /* Pointer to the color table which is no
* longer required by an instance. */
int force) /* Force free to happen immediately. */
{
colorPtr->refCount--;
if (colorPtr->refCount > 0) {
return;
}
if (force) {
if (colorPtr->flags & DISPOSE_PENDING) {
Tcl_CancelIdleCall(DisposeColorTable, colorPtr);
colorPtr->flags &= ~DISPOSE_PENDING;
}
DisposeColorTable(colorPtr);
} else if (!(colorPtr->flags & DISPOSE_PENDING)) {
Tcl_DoWhenIdle(DisposeColorTable, colorPtr);
colorPtr->flags |= DISPOSE_PENDING;
}
}
/*
*----------------------------------------------------------------------
*
* AllocateColors --
*
* This function allocates the colors required by a color table, and sets
* up the fields in the color table data structure which are used in
* dithering.
*
* Results:
* None.
*
* Side effects:
* Colors are allocated from the X server. Fields in the color table data
* structure are updated.
*
*----------------------------------------------------------------------
*/
static void
AllocateColors(
ColorTable *colorPtr) /* Pointer to the color table requiring colors
* to be allocated. */
{
int i, r, g, b, rMult, mono;
int numColors, nRed, nGreen, nBlue;
double fr, fg, fb, igam;
XColor *colors;
unsigned long *pixels;
/*
* 16-bit intensity value for i/n of full intensity.
*/
#define CFRAC(i, n) ((i) * 65535 / (n))
/* As for CFRAC, but apply exponent of g. */
#define CGFRAC(i, n, g) ((int)(65535 * pow((double)(i) / (n), (g))))
/*
* First parse the palette specification to get the required number of
* shades of each primary.
*/
mono = sscanf(colorPtr->id.palette, "%d/%d/%d", &nRed, &nGreen, &nBlue)
<= 1;
igam = 1.0 / colorPtr->id.gamma;
/*
* Each time around this loop, we reduce the number of colors we're trying
* to allocate until we succeed in allocating all of the colors we need.
*/
for (;;) {
/*
* If we are using 1 bit/pixel, we don't need to allocate any colors
* (we just use the foreground and background colors in the GC).
*/
if (mono && (nRed <= 2)) {
colorPtr->flags |= BLACK_AND_WHITE;
return;
}
/*
* Calculate the RGB coordinates of the colors we want to allocate and
* store them in *colors.
*/
if ((colorPtr->visualInfo.class == DirectColor)
|| (colorPtr->visualInfo.class == TrueColor)) {
/*
* Direct/True Color: allocate shades of red, green, blue
* independently.
*/
if (mono) {
numColors = nGreen = nBlue = nRed;
} else {
numColors = MAX(MAX(nRed, nGreen), nBlue);
}
colors = ckalloc(numColors * sizeof(XColor));
for (i = 0; i < numColors; ++i) {
if (igam == 1.0) {
colors[i].red = CFRAC(i, nRed - 1);
colors[i].green = CFRAC(i, nGreen - 1);
colors[i].blue = CFRAC(i, nBlue - 1);
} else {
colors[i].red = CGFRAC(i, nRed - 1, igam);
colors[i].green = CGFRAC(i, nGreen - 1, igam);
colors[i].blue = CGFRAC(i, nBlue - 1, igam);
}
}
} else {
/*
* PseudoColor, StaticColor, GrayScale or StaticGray visual: we
* have to allocate each color in the color cube separately.
*/
numColors = (mono) ? nRed: (nRed * nGreen * nBlue);
colors = ckalloc(numColors * sizeof(XColor));
if (!mono) {
/*
* Color display using a PseudoColor or StaticColor visual.
*/
i = 0;
for (r = 0; r < nRed; ++r) {
for (g = 0; g < nGreen; ++g) {
for (b = 0; b < nBlue; ++b) {
if (igam == 1.0) {
colors[i].red = CFRAC(r, nRed - 1);
colors[i].green = CFRAC(g, nGreen - 1);
colors[i].blue = CFRAC(b, nBlue - 1);
} else {
colors[i].red = CGFRAC(r, nRed - 1, igam);
colors[i].green = CGFRAC(g, nGreen - 1, igam);
colors[i].blue = CGFRAC(b, nBlue - 1, igam);
}
i++;
}
}
}
} else {
/*
* Monochrome display - allocate the shades of gray we want.
*/
for (i = 0; i < numColors; ++i) {
if (igam == 1.0) {
r = CFRAC(i, numColors - 1);
} else {
r = CGFRAC(i, numColors - 1, igam);
}
colors[i].red = colors[i].green = colors[i].blue = r;
}
}
}
/*
* Now try to allocate the colors we've calculated.
*/
pixels = ckalloc(numColors * sizeof(unsigned long));
for (i = 0; i < numColors; ++i) {
if (!XAllocColor(colorPtr->id.display, colorPtr->id.colormap,
&colors[i])) {
/*
* Can't get all the colors we want in the default colormap;
* first try freeing colors from other unused color tables.
*/
if (!ReclaimColors(&colorPtr->id, numColors - i)
|| !XAllocColor(colorPtr->id.display,
colorPtr->id.colormap, &colors[i])) {
/*
* Still can't allocate the color.
*/
break;
}
}
pixels[i] = colors[i].pixel;
}
/*
* If we didn't get all of the colors, reduce the resolution of the
* color cube, free the ones we got, and try again.
*/
if (i >= numColors) {
break;
}
XFreeColors(colorPtr->id.display, colorPtr->id.colormap, pixels, i, 0);
ckfree(colors);
ckfree(pixels);
if (!mono) {
if ((nRed == 2) && (nGreen == 2) && (nBlue == 2)) {
/*
* Fall back to 1-bit monochrome display.
*/
mono = 1;
} else {
/*
* Reduce the number of shades of each primary to about 3/4 of
* the previous value. This should reduce the total number of
* colors required to about half the previous value for
* PseudoColor displays.
*/
nRed = (nRed * 3 + 2) / 4;
nGreen = (nGreen * 3 + 2) / 4;
nBlue = (nBlue * 3 + 2) / 4;
}
} else {
/*
* Reduce the number of shades of gray to about 1/2.
*/
nRed = nRed / 2;
}
}
/*
* We have allocated all of the necessary colors: fill in various fields
* of the ColorTable record.
*/
if (!mono) {
colorPtr->flags |= COLOR_WINDOW;
/*
* The following is a hairy hack. We only want to index into the
* pixelMap on colormap displays. However, if the display is on
* Windows, then we actually want to store the index not the value
* since we will be passing the color table into the TkPutImage call.
*/
#ifndef _WIN32
if ((colorPtr->visualInfo.class != DirectColor)
&& (colorPtr->visualInfo.class != TrueColor)) {
colorPtr->flags |= MAP_COLORS;
}
#endif /* _WIN32 */
}
colorPtr->numColors = numColors;
colorPtr->pixelMap = pixels;
/*
* Set up quantization tables for dithering.
*/
rMult = nGreen * nBlue;
for (i = 0; i < 256; ++i) {
r = (i * (nRed - 1) + 127) / 255;
if (mono) {
fr = (double) colors[r].red / 65535.0;
if (colorPtr->id.gamma != 1.0 ) {
fr = pow(fr, colorPtr->id.gamma);
}
colorPtr->colorQuant[0][i] = (int)(fr * 255.99);
colorPtr->redValues[i] = colors[r].pixel;
} else {
g = (i * (nGreen - 1) + 127) / 255;
b = (i * (nBlue - 1) + 127) / 255;
if ((colorPtr->visualInfo.class == DirectColor)
|| (colorPtr->visualInfo.class == TrueColor)) {
colorPtr->redValues[i] =
colors[r].pixel & colorPtr->visualInfo.red_mask;
colorPtr->greenValues[i] =
colors[g].pixel & colorPtr->visualInfo.green_mask;
colorPtr->blueValues[i] =
colors[b].pixel & colorPtr->visualInfo.blue_mask;
} else {
r *= rMult;
g *= nBlue;
colorPtr->redValues[i] = r;
colorPtr->greenValues[i] = g;
colorPtr->blueValues[i] = b;
}
fr = (double) colors[r].red / 65535.0;
fg = (double) colors[g].green / 65535.0;
fb = (double) colors[b].blue / 65535.0;
if (colorPtr->id.gamma != 1.0) {
fr = pow(fr, colorPtr->id.gamma);
fg = pow(fg, colorPtr->id.gamma);
fb = pow(fb, colorPtr->id.gamma);
}
colorPtr->colorQuant[0][i] = (int)(fr * 255.99);
colorPtr->colorQuant[1][i] = (int)(fg * 255.99);
colorPtr->colorQuant[2][i] = (int)(fb * 255.99);
}
}
ckfree(colors);
}
/*
*----------------------------------------------------------------------
*
* DisposeColorTable --
*
* Release a color table and its associated resources.
*
* Results:
* None.
*
* Side effects:
* The colors in the argument color table are freed, as is the color
* table structure itself. The color table is removed from the hash table
* which is used to locate color tables.
*
*----------------------------------------------------------------------
*/
static void
DisposeColorTable(
ClientData clientData) /* Pointer to the ColorTable whose
* colors are to be released. */
{
ColorTable *colorPtr = clientData;
Tcl_HashEntry *entry;
if (colorPtr->pixelMap != NULL) {
if (colorPtr->numColors > 0) {
XFreeColors(colorPtr->id.display, colorPtr->id.colormap,
colorPtr->pixelMap, colorPtr->numColors, 0);
Tk_FreeColormap(colorPtr->id.display, colorPtr->id.colormap);
}
ckfree(colorPtr->pixelMap);
}
entry = Tcl_FindHashEntry(&imgPhotoColorHash, (char *) &colorPtr->id);
if (entry == NULL) {
Tcl_Panic("DisposeColorTable couldn't find hash entry");
}
Tcl_DeleteHashEntry(entry);
ckfree(colorPtr);
}
/*
*----------------------------------------------------------------------
*
* ReclaimColors --
*
* This function is called to try to free up colors in the colormap used
* by a color table. It looks for other color tables with the same
* colormap and with a zero live reference count, and frees their colors.
* It only does so if there is the possibility of freeing up at least
* `numColors' colors.
*
* Results:
* The return value is TRUE if any colors were freed, FALSE otherwise.
*
* Side effects:
* ColorTables which are not currently in use may lose their color
* allocations.
*
*----------------------------------------------------------------------
*/
static int
ReclaimColors(
ColorTableId *id, /* Pointer to information identifying
* the color table which needs more colors. */
int numColors) /* Number of colors required. */
{
Tcl_HashSearch srch;
Tcl_HashEntry *entry;
ColorTable *colorPtr;
int nAvail = 0;
/*
* First scan through the color hash table to get an upper bound on how
* many colors we might be able to free.
*/
entry = Tcl_FirstHashEntry(&imgPhotoColorHash, &srch);
while (entry != NULL) {
colorPtr = Tcl_GetHashValue(entry);
if ((colorPtr->id.display == id->display)
&& (colorPtr->id.colormap == id->colormap)
&& (colorPtr->liveRefCount == 0 )&& (colorPtr->numColors != 0)
&& ((colorPtr->id.palette != id->palette)
|| (colorPtr->id.gamma != id->gamma))) {
/*
* We could take this guy's colors off him.
*/
nAvail += colorPtr->numColors;
}
entry = Tcl_NextHashEntry(&srch);
}
/*
* nAvail is an (over)estimate of the number of colors we could free.
*/
if (nAvail < numColors) {
return 0;
}
/*
* Scan through a second time freeing colors.
*/
entry = Tcl_FirstHashEntry(&imgPhotoColorHash, &srch);
while ((entry != NULL) && (numColors > 0)) {
colorPtr = Tcl_GetHashValue(entry);
if ((colorPtr->id.display == id->display)
&& (colorPtr->id.colormap == id->colormap)
&& (colorPtr->liveRefCount == 0) && (colorPtr->numColors != 0)
&& ((colorPtr->id.palette != id->palette)
|| (colorPtr->id.gamma != id->gamma))) {
/*
* Free the colors that this ColorTable has.
*/
XFreeColors(colorPtr->id.display, colorPtr->id.colormap,
colorPtr->pixelMap, colorPtr->numColors, 0);
numColors -= colorPtr->numColors;
colorPtr->numColors = 0;
ckfree(colorPtr->pixelMap);
colorPtr->pixelMap = NULL;
}
entry = Tcl_NextHashEntry(&srch);
}
return 1; /* We freed some colors. */
}
/*
*----------------------------------------------------------------------
*
* TkImgDisposeInstance --
*
* This function is called to finally free up an instance of a photo
* image which is no longer required.
*
* Results:
* None.
*
* Side effects:
* The instance data structure and the resources it references are freed.
*
*----------------------------------------------------------------------
*/
void
TkImgDisposeInstance(
ClientData clientData) /* Pointer to the instance whose resources are
* to be released. */
{
PhotoInstance *instancePtr = clientData;
PhotoInstance *prevPtr;
if (instancePtr->pixels != None) {
Tk_FreePixmap(instancePtr->display, instancePtr->pixels);
}
if (instancePtr->gc != None) {
Tk_FreeGC(instancePtr->display, instancePtr->gc);
}
if (instancePtr->imagePtr != NULL) {
XDestroyImage(instancePtr->imagePtr);
}
if (instancePtr->error != NULL) {
ckfree(instancePtr->error);
}
if (instancePtr->colorTablePtr != NULL) {
FreeColorTable(instancePtr->colorTablePtr, 1);
}
if (instancePtr->masterPtr->instancePtr == instancePtr) {
instancePtr->masterPtr->instancePtr = instancePtr->nextPtr;
} else {
for (prevPtr = instancePtr->masterPtr->instancePtr;
prevPtr->nextPtr != instancePtr; prevPtr = prevPtr->nextPtr) {
/* Empty loop body. */
}
prevPtr->nextPtr = instancePtr->nextPtr;
}
Tk_FreeColormap(instancePtr->display, instancePtr->colormap);
ckfree(instancePtr);
}
/*
*----------------------------------------------------------------------
*
* TkImgDitherInstance --
*
* This function is called to update an area of an instance's pixmap by
* dithering the corresponding area of the master.
*
* Results:
* None.
*
* Side effects:
* The instance's pixmap gets updated.
*
*----------------------------------------------------------------------
*/
void
TkImgDitherInstance(
PhotoInstance *instancePtr, /* The instance to be updated. */
int xStart, int yStart, /* Coordinates of the top-left pixel in the
* block to be dithered. */
int width, int height) /* Dimensions of the block to be dithered. */
{
PhotoMaster *masterPtr = instancePtr->masterPtr;
ColorTable *colorPtr = instancePtr->colorTablePtr;
XImage *imagePtr;
int nLines, bigEndian, i, c, x, y, xEnd, doDithering = 1;
int bitsPerPixel, bytesPerLine, lineLength;
unsigned char *srcLinePtr;
schar *errLinePtr;
pixel firstBit, word, mask;
/*
* Turn dithering off in certain cases where it is not needed (TrueColor,
* DirectColor with many colors).
*/
if ((colorPtr->visualInfo.class == DirectColor)
|| (colorPtr->visualInfo.class == TrueColor)) {
int nRed, nGreen, nBlue, result;
result = sscanf(colorPtr->id.palette, "%d/%d/%d", &nRed,
&nGreen, &nBlue);
if ((nRed >= 256)
&& ((result == 1) || ((nGreen >= 256) && (nBlue >= 256)))) {
doDithering = 0;
}
}
/*
* First work out how many lines to do at a time, then how many bytes
* we'll need for pixel storage, and allocate it.
*/
nLines = (MAX_PIXELS + width - 1) / width;
if (nLines < 1) {
nLines = 1;
}
if (nLines > height ) {
nLines = height;
}
imagePtr = instancePtr->imagePtr;
if (imagePtr == NULL) {
return; /* We must be really tight on memory. */
}
bitsPerPixel = imagePtr->bits_per_pixel;
bytesPerLine = ((bitsPerPixel * width + 31) >> 3) & ~3;
imagePtr->width = width;
imagePtr->height = nLines;
imagePtr->bytes_per_line = bytesPerLine;
/*
* TODO: use attemptckalloc() here once we have some strategy for
* recovering from the failure.
*/
imagePtr->data = ckalloc(imagePtr->bytes_per_line * nLines);
bigEndian = imagePtr->bitmap_bit_order == MSBFirst;
firstBit = bigEndian? (1 << (imagePtr->bitmap_unit - 1)): 1;
lineLength = masterPtr->width * 3;
srcLinePtr = masterPtr->pix32 + (yStart * masterPtr->width + xStart) * 4;
errLinePtr = instancePtr->error + yStart * lineLength + xStart * 3;
xEnd = xStart + width;
/*
* Loop over the image, doing at most nLines lines before updating the
* screen image.
*/
for (; height > 0; height -= nLines) {
unsigned char *dstLinePtr = (unsigned char *) imagePtr->data;
int yEnd;
if (nLines > height) {
nLines = height;
}
yEnd = yStart + nLines;
for (y = yStart; y < yEnd; ++y) {
unsigned char *srcPtr = srcLinePtr;
schar *errPtr = errLinePtr;
unsigned char *destBytePtr = dstLinePtr;
pixel *destLongPtr = (pixel *) dstLinePtr;
if (colorPtr->flags & COLOR_WINDOW) {
/*
* Color window. We dither the three components independently,
* using Floyd-Steinberg dithering, which propagates errors
* from the quantization of pixels to the pixels below and to
* the right.
*/
for (x = xStart; x < xEnd; ++x) {
int col[3];
if (doDithering) {
for (i = 0; i < 3; ++i) {
/*
* Compute the error propagated into this pixel
* for this component. If e[x,y] is the array of
* quantization error values, we compute
* 7/16 * e[x-1,y] + 1/16 * e[x-1,y-1]
* + 5/16 * e[x,y-1] + 3/16 * e[x+1,y-1]
* and round it to an integer.
*
* The expression ((c + 2056) >> 4) - 128 computes
* round(c / 16), and works correctly on machines
* without a sign-extending right shift.
*/
c = (x > 0) ? errPtr[-3] * 7: 0;
if (y > 0) {
if (x > 0) {
c += errPtr[-lineLength-3];
}
c += errPtr[-lineLength] * 5;
if ((x + 1) < masterPtr->width) {
c += errPtr[-lineLength+3] * 3;
}
}
/*
* Add the propagated error to the value of this
* component, quantize it, and store the
* quantization error.
*/
c = ((c + 2056) >> 4) - 128 + *srcPtr++;
if (c < 0) {
c = 0;
} else if (c > 255) {
c = 255;
}
col[i] = colorPtr->colorQuant[i][c];
*errPtr++ = c - col[i];
}
} else {
/*
* Output is virtually continuous in this case, so
* don't bother dithering.
*/
col[0] = *srcPtr++;
col[1] = *srcPtr++;
col[2] = *srcPtr++;
}
srcPtr++;
/*
* Translate the quantized component values into an X
* pixel value, and store it in the image.
*/
i = colorPtr->redValues[col[0]]
+ colorPtr->greenValues[col[1]]
+ colorPtr->blueValues[col[2]];
if (colorPtr->flags & MAP_COLORS) {
i = colorPtr->pixelMap[i];
}
switch (bitsPerPixel) {
case NBBY:
*destBytePtr++ = i;
break;
#ifndef _WIN32
/*
* This case is not valid for Windows because the
* image format is different from the pixel format in
* Win32. Eventually we need to fix the image code in
* Tk to use the Windows native image ordering. This
* would speed up the image code for all of the common
* sizes.
*/
case NBBY * sizeof(pixel):
*destLongPtr++ = i;
break;
#endif
default:
XPutPixel(imagePtr, x - xStart, y - yStart,
(unsigned) i);
}
}
} else if (bitsPerPixel > 1) {
/*
* Multibit monochrome window. The operation here is similar
* to the color window case above, except that there is only
* one component. If the master image is in color, use the
* luminance computed as
* 0.344 * red + 0.5 * green + 0.156 * blue.
*/
for (x = xStart; x < xEnd; ++x) {
c = (x > 0) ? errPtr[-1] * 7: 0;
if (y > 0) {
if (x > 0) {
c += errPtr[-lineLength-1];
}
c += errPtr[-lineLength] * 5;
if (x + 1 < masterPtr->width) {
c += errPtr[-lineLength+1] * 3;
}
}
c = ((c + 2056) >> 4) - 128;
if (masterPtr->flags & COLOR_IMAGE) {
c += (unsigned) (srcPtr[0] * 11 + srcPtr[1] * 16
+ srcPtr[2] * 5 + 16) >> 5;
} else {
c += srcPtr[0];
}
srcPtr += 4;
if (c < 0) {
c = 0;
} else if (c > 255) {
c = 255;
}
i = colorPtr->colorQuant[0][c];
*errPtr++ = c - i;
i = colorPtr->redValues[i];
switch (bitsPerPixel) {
case NBBY:
*destBytePtr++ = i;
break;
#ifndef _WIN32
/*
* This case is not valid for Windows because the
* image format is different from the pixel format in
* Win32. Eventually we need to fix the image code in
* Tk to use the Windows native image ordering. This
* would speed up the image code for all of the common
* sizes.
*/
case NBBY * sizeof(pixel):
*destLongPtr++ = i;
break;
#endif
default:
XPutPixel(imagePtr, x - xStart, y - yStart,
(unsigned) i);
}
}
} else {
/*
* 1-bit monochrome window. This is similar to the multibit
* monochrome case above, except that the quantization is
* simpler (we only have black = 0 and white = 255), and we
* produce an XY-Bitmap.
*/
word = 0;
mask = firstBit;
for (x = xStart; x < xEnd; ++x) {
/*
* If we have accumulated a whole word, store it in the
* image and start a new word.
*/
if (mask == 0) {
*destLongPtr++ = word;
mask = firstBit;
word = 0;
}
c = (x > 0) ? errPtr[-1] * 7: 0;
if (y > 0) {
if (x > 0) {
c += errPtr[-lineLength-1];
}
c += errPtr[-lineLength] * 5;
if (x + 1 < masterPtr->width) {
c += errPtr[-lineLength+1] * 3;
}
}
c = ((c + 2056) >> 4) - 128;
if (masterPtr->flags & COLOR_IMAGE) {
c += (unsigned)(srcPtr[0] * 11 + srcPtr[1] * 16
+ srcPtr[2] * 5 + 16) >> 5;
} else {
c += srcPtr[0];
}
srcPtr += 4;
if (c < 0) {
c = 0;
} else if (c > 255) {
c = 255;
}
if (c >= 128) {
word |= mask;
*errPtr++ = c - 255;
} else {
*errPtr++ = c;
}
mask = bigEndian? (mask >> 1): (mask << 1);
}
*destLongPtr = word;
}
srcLinePtr += masterPtr->width * 4;
errLinePtr += lineLength;
dstLinePtr += bytesPerLine;
}
/*
* Update the pixmap for this instance with the block of pixels that
* we have just computed.
*/
TkPutImage(colorPtr->pixelMap, colorPtr->numColors,
instancePtr->display, instancePtr->pixels,
instancePtr->gc, imagePtr, 0, 0, xStart, yStart,
(unsigned) width, (unsigned) nLines);
yStart = yEnd;
}
ckfree(imagePtr->data);
imagePtr->data = NULL;
}
/*
*----------------------------------------------------------------------
*
* TkImgResetDither --
*
* This function is called to eliminate the content of a photo instance's
* dither error buffer. It's called when the overall image is blanked.
*
* Results:
* None.
*
* Side effects:
* The instance's dither buffer gets cleared.
*
*----------------------------------------------------------------------
*/
void
TkImgResetDither(
PhotoInstance *instancePtr)
{
if (instancePtr->error) {
memset(instancePtr->error, 0,
/*(size_t)*/ (instancePtr->masterPtr->width
* instancePtr->masterPtr->height * 3 * sizeof(schar)));
}
}
/*
* Local Variables:
* mode: c
* c-basic-offset: 4
* fill-column: 78
* End:
*/
|