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
|
/* Copyright 1990-93 GROUPE BULL -- See license conditions in file COPYRIGHT */
/*****************************************************************************\
* create.c: *
* *
* XPM library *
* Create an X image and possibly its related shape mask *
* from the given xpmInternAttrib. *
* *
* Developed by Arnaud Le Hors *
\*****************************************************************************/
#include "xpmP.h"
#ifdef VMS
#include "sys$library:ctype.h"
#else
#include <ctype.h>
#endif
LFUNC(xpmVisualType, int, (Visual *visual));
LFUNC(SetCloseColor, int, (Display *display, Colormap colormap,
Visual *visual, XColor *col,
Pixel *image_pixel, Pixel *mask_pixel,
Pixel **pixels, unsigned int *npixels,
XpmAttributes *attributes,
XColor *cols, int ncols));
LFUNC(SetColor, int, (Display *display, Colormap colormap, Visual *visual,
char *colorname, unsigned int color_index,
Pixel *image_pixel, Pixel *mask_pixel,
unsigned int *mask_pixel_index, Pixel **pixels,
unsigned int *npixels, XpmAttributes *attributes,
XColor *cols, int ncols));
LFUNC(CreateXImage, int, (Display *display, Visual *visual,
unsigned int depth, unsigned int width,
unsigned int height, XImage **image_return));
LFUNC(CreateColors, int, (Display *display, XpmAttributes *attributes,
XpmColor *ct, unsigned int ncolors, Pixel *ip,
Pixel *mp, unsigned int *mask_pixel,
Pixel **pixels, unsigned int *npixels));
LFUNC(SetImagePixels, void, (XImage *image, unsigned int width,
unsigned int height, unsigned int *pixelindex,
Pixel *pixels));
LFUNC(SetImagePixels32, void, (XImage *image, unsigned int width,
unsigned int height, unsigned int *pixelindex,
Pixel *pixels));
LFUNC(SetImagePixels16, void, (XImage *image, unsigned int width,
unsigned int height, unsigned int *pixelindex,
Pixel *pixels));
LFUNC(SetImagePixels8, void, (XImage *image, unsigned int width,
unsigned int height, unsigned int *pixelindex,
Pixel *pixels));
LFUNC(SetImagePixels1, void, (XImage *image, unsigned int width,
unsigned int height, unsigned int *pixelindex,
Pixel *pixels));
#ifdef NEED_STRCASECMP
LFUNC(strcasecmp, int, (char *s1, char *s2));
/*
* in case strcasecmp is not provided by the system here is one
* which does the trick
*/
static int
strcasecmp(s1, s2)
register char *s1, *s2;
{
register int c1, c2;
while (*s1 && *s2) {
c1 = isupper(*s1) ? tolower(*s1) : *s1;
c2 = isupper(*s2) ? tolower(*s2) : *s2;
if (c1 != c2)
return (1);
s1++;
s2++;
}
if (*s1 || *s2)
return (1);
return (0);
}
#endif
/*
* return the default color key related to the given visual
*/
static int
xpmVisualType(visual)
Visual *visual;
{
switch (visual->class) {
case StaticGray:
case GrayScale:
switch (visual->map_entries) {
case 2:
return (XPM_MONO);
case 4:
return (XPM_GRAY4);
default:
return (XPM_GRAY);
}
default:
return (XPM_COLOR);
}
}
typedef struct {
int cols_index;
long closeness;
} CloseColor;
static int
closeness_cmp(a, b)
void *a, *b;
{
CloseColor *x = (CloseColor *) a, *y = (CloseColor *) b;
return (x->closeness - y->closeness);
}
/*
* set a close color in case the exact one can't be set
* return 0 if success, 1 otherwise.
*/
static int
SetCloseColor(display, colormap, visual, col,
image_pixel, mask_pixel, pixels, npixels, attributes,
cols, ncols)
Display *display;
Colormap colormap;
Visual *visual;
XColor *col;
Pixel *image_pixel, *mask_pixel;
Pixel **pixels;
unsigned int *npixels;
XpmAttributes *attributes;
XColor *cols;
int ncols;
{
/*
* Allocation failed, so try close colors. To get here the visual must
* be GreyScale, PseudoColor or DirectColor (or perhaps StaticColor?
* What about sharing systems like QDSS?). Beware: we have to treat
* DirectColor differently.
*/
long int red_closeness, green_closeness, blue_closeness;
int n;
if (attributes && (attributes->valuemask & XpmCloseness))
red_closeness = green_closeness = blue_closeness =
attributes->closeness;
else {
red_closeness = attributes->red_closeness;
green_closeness = attributes->green_closeness;
blue_closeness = attributes->blue_closeness;
}
/*
* We sort the colormap by closeness and try to allocate the color
* closest to the target. If the allocation of this close color fails,
* which almost never happens, then one of two scenarios is possible.
* Either the colormap must have changed (since the last close color
* allocation or possibly while we were sorting the colormap), or the
* color is allocated as Read/Write by some other client. (Note: X
* _should_ allow clients to check if a particular color is Read/Write,
* but it doesn't! :-( ). We cannot determine which of these scenarios
* occurred, so we try the next closest color, and so on, until no more
* colors are within closeness of the target. If we knew that the
* colormap had changed, we could skip this sequence.
*
* If _none_ of the colors within closeness of the target can be allocated,
* then we can finally be pretty sure that the colormap has actually
* changed. In this case we try to allocate the original color (again),
* then try the closecolor stuff (again)...
*
* In theory it would be possible for an infinite loop to occur if another
* process kept changing the colormap every time we sorted it, so we set
* a maximum on the number of iterations. After this many tries, we use
* XGrabServer() to ensure that the colormap remains unchanged.
*
* This approach gives particularly bad worst case performance - as many as
* <MaximumIterations> colormap reads and sorts may be needed, and as
* many as <MaximumIterations> * <ColormapSize> attempted allocations
* may fail. On an 8-bit system, this means as many as 3 colormap reads,
* 3 sorts and 768 failed allocations per execution of this code!
* Luckily, my experiments show that in general use in a typical 8-bit
* color environment only about 1 in every 10000 allocations fails to
* succeed in the fastest possible time. So virtually every time what
* actually happens is a single sort followed by a successful allocate.
* The very first allocation also costs a colormap read, but no further
* reads are usually necessary.
*/
#define ITERATIONS 2 /* more than one is almost never
* necessary */
for (n = 0; n <= ITERATIONS; ++n) {
CloseColor *closenesses =
(CloseColor *) XpmCalloc(ncols, sizeof(CloseColor));
int i, c;
for (i = 0; i < ncols; ++i) { /* build & sort closenesses table */
#define COLOR_FACTOR 3
#define BRIGHTNESS_FACTOR 1
closenesses[i].cols_index = i;
closenesses[i].closeness =
COLOR_FACTOR * (abs((long) col->red - (long) cols[i].red)
+ abs((long) col->green - (long) cols[i].green)
+ abs((long) col->blue - (long) cols[i].blue))
+ BRIGHTNESS_FACTOR * abs(((long) col->red +
(long) col->green +
(long) col->blue)
- ((long) cols[i].red +
(long) cols[i].green +
(long) cols[i].blue));
}
qsort(closenesses, ncols, sizeof(CloseColor), closeness_cmp);
i = 0;
c = closenesses[i].cols_index;
while ((long) cols[c].red >= (long) col->red - red_closeness &&
(long) cols[c].red <= (long) col->red + red_closeness &&
(long) cols[c].green >= (long) col->green - green_closeness &&
(long) cols[c].green <= (long) col->green + green_closeness &&
(long) cols[c].blue >= (long) col->blue - blue_closeness &&
(long) cols[c].blue <= (long) col->blue + blue_closeness) {
if (XAllocColor(display, colormap, &cols[c])) {
if (n == ITERATIONS)
XUngrabServer(display);
XpmFree(closenesses);
*image_pixel = cols[c].pixel;
*mask_pixel = 1;
(*pixels)[*npixels] = cols[c].pixel;
(*npixels)++;
return (0);
} else {
++i; if (i == ncols) break;
c = closenesses[i].cols_index;
}
}
/* Couldn't allocate _any_ of the close colors! */
if (n == ITERATIONS)
XUngrabServer(display);
XpmFree(closenesses);
if (i == 0 || i == ncols) /* no color close enough or cannot */
return (1); /* alloc any color (full of r/w's) */
if (XAllocColor(display, colormap, col)) {
*image_pixel = col->pixel;
*mask_pixel = 1;
(*pixels)[*npixels] = col->pixel;
(*npixels)++;
return (0);
} else { /* colormap has probably changed, so
* re-read... */
if (n == ITERATIONS - 1)
XGrabServer(display);
#if 0
if (visual->class == DirectColor) {
/* TODO */
} else
#endif
XQueryColors(display, colormap, cols, ncols);
}
}
return (1);
}
#define USE_CLOSECOLOR attributes && \
(((attributes->valuemask & XpmCloseness) && attributes->closeness != 0) \
|| ((attributes->valuemask & XpmRGBCloseness) && \
attributes->red_closeness != 0 \
&& attributes->green_closeness != 0 \
&& attributes->blue_closeness != 0))
/*
* set the color pixel related to the given colorname,
* return 0 if success, 1 otherwise.
*/
static int
SetColor(display, colormap, visual, colorname, color_index,
image_pixel, mask_pixel, mask_pixel_index,
pixels, npixels, attributes, cols, ncols)
Display *display;
Colormap colormap;
Visual *visual;
char *colorname;
unsigned int color_index;
Pixel *image_pixel, *mask_pixel;
unsigned int *mask_pixel_index;
Pixel **pixels;
unsigned int *npixels;
XpmAttributes *attributes;
XColor *cols;
int ncols;
{
XColor xcolor;
if (strcasecmp(colorname, TRANSPARENT_COLOR)) {
if (!XParseColor(display, colormap, colorname, &xcolor))
return (1);
if (!XAllocColor(display, colormap, &xcolor)) {
if (USE_CLOSECOLOR)
return (SetCloseColor(display, colormap, visual, &xcolor,
image_pixel, mask_pixel, pixels, npixels,
attributes, cols, ncols));
else
return (1);
}
*image_pixel = xcolor.pixel;
*mask_pixel = 1;
(*pixels)[*npixels] = xcolor.pixel;
(*npixels)++;
} else {
*image_pixel = 0;
*mask_pixel = 0;
*mask_pixel_index = color_index;/* store the color table index */
}
return (0);
}
static int
CreateColors(display, attributes, ct, ncolors,
ip, mp, mask_pixel, pixels, npixels)
Display *display;
XpmAttributes *attributes;
XpmColor *ct;
unsigned int ncolors;
Pixel *ip;
Pixel *mp;
unsigned int *mask_pixel; /* mask pixel index */
Pixel **pixels; /* allocated pixels */
unsigned int *npixels; /* number of allocated pixels */
{
/* variables stored in the XpmAttributes structure */
Visual *visual;
Colormap colormap;
XpmColorSymbol *colorsymbols;
unsigned int numsymbols;
char *colorname;
unsigned int a, b, l;
Boolean pixel_defined;
unsigned int key;
XpmColorSymbol *symbol;
xpmColorDefaults defaults;
int ErrorStatus = XpmSuccess;
char *s;
int default_index;
XColor *cols = NULL;
unsigned int ncols = 0;
/*
* retrieve information from the XpmAttributes
*/
if (attributes && attributes->valuemask & XpmColorSymbols) {
colorsymbols = attributes->colorsymbols;
numsymbols = attributes->numsymbols;
} else
numsymbols = 0;
if (attributes && attributes->valuemask & XpmVisual)
visual = attributes->visual;
else
visual = DefaultVisual(display, DefaultScreen(display));
if (attributes && attributes->valuemask & XpmColormap)
colormap = attributes->colormap;
else
colormap = DefaultColormap(display, DefaultScreen(display));
if (attributes && attributes->valuemask & XpmColorKey)
key = attributes->color_key;
else
key = xpmVisualType(visual);
if (USE_CLOSECOLOR) {
/* originally from SetCloseColor */
#if 0
if (visual->class == DirectColor) {
/*
* TODO: Implement close colors for DirectColor visuals. This is
* difficult situation. Chances are that we will never get here,
* because any machine that supports DirectColor will probably
* also support TrueColor (and probably PseudoColor). Also,
* DirectColor colormaps can be very large, so looking for close
* colors may be too slow.
*/
} else {
#endif
int i;
ncols = visual->map_entries;
cols = (XColor *) XpmCalloc(ncols, sizeof(XColor));
for (i = 0; i < ncols; ++i)
cols[i].pixel = i;
XQueryColors(display, colormap, cols, ncols);
#if 0
}
#endif
}
switch (key) {
case XPM_MONO:
default_index = 2;
break;
case XPM_GRAY4:
default_index = 3;
break;
case XPM_GRAY:
default_index = 4;
break;
case XPM_COLOR:
default:
default_index = 5;
break;
}
for (a = 0; a < ncolors; a++, ct++, ip++, mp++) {
colorname = NULL;
pixel_defined = False;
defaults = (xpmColorDefaults) ct;
/*
* look for a defined symbol
*/
if (numsymbols && defaults[1]) {
s = defaults[1];
for (l = 0, symbol = colorsymbols; l < numsymbols; l++, symbol++) {
if (symbol->name && s && !strcmp(symbol->name, s))
/* override name */
break;
if (!symbol->name && symbol->value) { /* override value */
int def_index = default_index;
while (defaults[def_index] == NULL) /* find defined
* colorname */
--def_index;
if (def_index < 2) {/* nothing towards mono, so try
* towards color */
def_index = default_index + 1;
while (def_index <= 5 && defaults[def_index] == NULL)
++def_index;
}
if (def_index >= 2 && defaults[def_index] != NULL &&
!strcasecmp(symbol->value, defaults[def_index]))
break;
}
}
if (l != numsymbols) {
if (symbol->name && symbol->value)
colorname = symbol->value;
else
pixel_defined = True;
}
}
if (!pixel_defined) { /* pixel not given as symbol value */
if (colorname) { /* colorname given as symbol value */
if (!SetColor(display, colormap, visual, colorname, a, ip, mp,
mask_pixel, pixels, npixels, attributes,
cols, ncols))
pixel_defined = True;
else
ErrorStatus = XpmColorError;
}
b = key;
while (!pixel_defined && b > 1) {
if (defaults[b]) {
if (!SetColor(display, colormap, visual, defaults[b],
a, ip, mp, mask_pixel, pixels, npixels,
attributes, cols, ncols)) {
pixel_defined = True;
break;
} else
ErrorStatus = XpmColorError;
}
b--;
}
b = key + 1;
while (!pixel_defined && b < NKEYS + 1) {
if (defaults[b]) {
if (!SetColor(display, colormap, visual, defaults[b],
a, ip, mp, mask_pixel, pixels, npixels,
attributes, cols, ncols)) {
pixel_defined = True;
break;
} else
ErrorStatus = XpmColorError;
}
b++;
}
if (!pixel_defined) {
if (cols)
XpmFree(cols);
return (XpmColorFailed);
}
} else {
*ip = colorsymbols[l].pixel;
if (symbol->value
&& !strcasecmp(symbol->value, TRANSPARENT_COLOR)) {
*mp = 0;
*mask_pixel = 0;
} else
*mp = 1;
}
}
if (cols)
XpmFree(cols);
return (ErrorStatus);
}
/* function call in case of error, frees only locally allocated variables */
#undef RETURN
#define RETURN(status) \
{ \
if (ximage) XDestroyImage(ximage); \
if (shapeimage) XDestroyImage(shapeimage); \
if (ximage_pixels) XpmFree(ximage_pixels); \
if (mask_pixels) XpmFree(mask_pixels); \
if (npixels) XFreeColors(display, colormap, pixels, npixels, 0); \
if (pixels) XpmFree(pixels); \
return (status); \
}
int
XpmCreateImageFromXpmImage(display, image,
image_return, shapeimage_return, attributes)
Display *display;
XpmImage *image;
XImage **image_return;
XImage **shapeimage_return;
XpmAttributes *attributes;
{
/* variables stored in the XpmAttributes structure */
Visual *visual;
Colormap colormap;
unsigned int depth;
/* variables to return */
XImage *ximage = NULL;
XImage *shapeimage = NULL;
unsigned int mask_pixel;
int ErrorStatus;
/* calculation variables */
Pixel *ximage_pixels = NULL;
Pixel *mask_pixels = NULL;
Pixel *pixels = NULL; /* allocated pixels */
unsigned int npixels = 0; /* number of allocated pixels */
/*
* initialize return values
*/
if (image_return)
*image_return = NULL;
if (shapeimage_return)
*shapeimage_return = NULL;
/*
* retrieve information from the XpmAttributes
*/
if (attributes && (attributes->valuemask & XpmVisual))
visual = attributes->visual;
else
visual = DefaultVisual(display, DefaultScreen(display));
if (attributes && (attributes->valuemask & XpmColormap))
colormap = attributes->colormap;
else
colormap = DefaultColormap(display, DefaultScreen(display));
if (attributes && (attributes->valuemask & XpmDepth))
depth = attributes->depth;
else
depth = DefaultDepth(display, DefaultScreen(display));
ErrorStatus = XpmSuccess;
/*
* malloc pixels index tables
*/
ximage_pixels = (Pixel *) XpmMalloc(sizeof(Pixel) * image->ncolors);
if (!ximage_pixels)
return (XpmNoMemory);
mask_pixels = (Pixel *) XpmMalloc(sizeof(Pixel) * image->ncolors);
if (!mask_pixels)
RETURN(ErrorStatus);
mask_pixel = UNDEF_PIXEL;
/* maximum of allocated pixels will be the number of colors */
pixels = (Pixel *) XpmMalloc(sizeof(Pixel) * image->ncolors);
if (!pixels)
RETURN(ErrorStatus);
/*
* get pixel colors, store them in index tables
*/
ErrorStatus = CreateColors(display, attributes, image->colorTable,
image->ncolors, ximage_pixels, mask_pixels,
&mask_pixel, &pixels, &npixels);
if (ErrorStatus != XpmSuccess
&& (ErrorStatus < 0 || (attributes
&& (attributes->valuemask & XpmExactColors)
&& attributes->exactColors)))
RETURN(ErrorStatus);
/*
* create the ximage
*/
if (image_return) {
ErrorStatus = CreateXImage(display, visual, depth,
image->width, image->height, &ximage);
if (ErrorStatus != XpmSuccess)
RETURN(ErrorStatus);
/*
* set the ximage data
*
* In case depth is 1 or bits_per_pixel is 4, 6, 8, 24 or 32 use
* optimized functions, otherwise use slower but sure general one.
*
*/
if (ximage->depth == 1)
SetImagePixels1(ximage, image->width, image->height,
image->data, ximage_pixels);
else if (ximage->bits_per_pixel == 8)
SetImagePixels8(ximage, image->width, image->height,
image->data, ximage_pixels);
else if (ximage->bits_per_pixel == 16)
SetImagePixels16(ximage, image->width, image->height,
image->data, ximage_pixels);
else if (ximage->bits_per_pixel == 32)
SetImagePixels32(ximage, image->width, image->height,
image->data, ximage_pixels);
else
SetImagePixels(ximage, image->width, image->height,
image->data, ximage_pixels);
}
/*
* create the shape mask image
*/
if (mask_pixel != UNDEF_PIXEL && shapeimage_return) {
ErrorStatus = CreateXImage(display, visual, 1, image->width,
image->height, &shapeimage);
if (ErrorStatus != XpmSuccess)
RETURN(ErrorStatus);
SetImagePixels1(shapeimage, image->width, image->height,
image->data, mask_pixels);
}
XpmFree(mask_pixels);
XpmFree(pixels);
/*
* if requested store alloc'ed pixels in the XpmAttributes structure
*/
if (attributes && attributes->valuemask & XpmReturnPixels) {
if (mask_pixel != UNDEF_PIXEL) {
Pixel *pixels, *p1, *p2;
unsigned int a;
attributes->npixels = image->ncolors - 1;
pixels = (Pixel *) XpmMalloc(sizeof(Pixel) * attributes->npixels);
if (pixels) {
p1 = ximage_pixels;
p2 = pixels;
for (a = 0; a < image->ncolors; a++, p1++)
if (a != mask_pixel)
*p2++ = *p1;
attributes->pixels = pixels;
} else {
/* if error just say we can't return requested data */
attributes->valuemask &= ~XpmReturnPixels;
attributes->pixels = NULL;
attributes->npixels = 0;
}
XpmFree(ximage_pixels);
} else {
attributes->pixels = ximage_pixels;
attributes->npixels = image->ncolors;
}
} else
XpmFree(ximage_pixels);
/*
* return created images
*/
if (image_return)
*image_return = ximage;
if (shapeimage_return)
*shapeimage_return = shapeimage;
return (ErrorStatus);
}
/*
* Create an XImage
*/
static int
CreateXImage(display, visual, depth, width, height, image_return)
Display *display;
Visual *visual;
unsigned int depth;
unsigned int width;
unsigned int height;
XImage **image_return;
{
int bitmap_pad;
/* first get bitmap_pad */
if (depth > 16)
bitmap_pad = 32;
else if (depth > 8)
bitmap_pad = 16;
else
bitmap_pad = 8;
/* then create the XImage with data = NULL and bytes_per_line = 0 */
*image_return = XCreateImage(display, visual, depth, ZPixmap, 0, 0,
width, height, bitmap_pad, 0);
if (!*image_return)
return (XpmNoMemory);
/* now that bytes_per_line must have been set properly alloc data */
(*image_return)->data =
(char *) XpmMalloc((*image_return)->bytes_per_line * height);
if (!(*image_return)->data) {
XDestroyImage(*image_return);
*image_return = NULL;
return (XpmNoMemory);
}
return (XpmSuccess);
}
/*
* The functions below are written from X11R5 MIT's code (XImUtil.c)
*
* The idea is to have faster functions than the standard XPutPixel function
* to build the image data. Indeed we can speed up things by suppressing tests
* performed for each pixel. We do the same tests but at the image level.
* We also assume that we use only ZPixmap images with null offsets.
*/
LFUNC(_putbits, void, (register char *src, int dstoffset,
register int numbits, register char *dst));
LFUNC(_XReverse_Bytes, int, (register unsigned char *bpt, register int nb));
static unsigned char Const _reverse_byte[0x100] = {
0x00, 0x80, 0x40, 0xc0, 0x20, 0xa0, 0x60, 0xe0,
0x10, 0x90, 0x50, 0xd0, 0x30, 0xb0, 0x70, 0xf0,
0x08, 0x88, 0x48, 0xc8, 0x28, 0xa8, 0x68, 0xe8,
0x18, 0x98, 0x58, 0xd8, 0x38, 0xb8, 0x78, 0xf8,
0x04, 0x84, 0x44, 0xc4, 0x24, 0xa4, 0x64, 0xe4,
0x14, 0x94, 0x54, 0xd4, 0x34, 0xb4, 0x74, 0xf4,
0x0c, 0x8c, 0x4c, 0xcc, 0x2c, 0xac, 0x6c, 0xec,
0x1c, 0x9c, 0x5c, 0xdc, 0x3c, 0xbc, 0x7c, 0xfc,
0x02, 0x82, 0x42, 0xc2, 0x22, 0xa2, 0x62, 0xe2,
0x12, 0x92, 0x52, 0xd2, 0x32, 0xb2, 0x72, 0xf2,
0x0a, 0x8a, 0x4a, 0xca, 0x2a, 0xaa, 0x6a, 0xea,
0x1a, 0x9a, 0x5a, 0xda, 0x3a, 0xba, 0x7a, 0xfa,
0x06, 0x86, 0x46, 0xc6, 0x26, 0xa6, 0x66, 0xe6,
0x16, 0x96, 0x56, 0xd6, 0x36, 0xb6, 0x76, 0xf6,
0x0e, 0x8e, 0x4e, 0xce, 0x2e, 0xae, 0x6e, 0xee,
0x1e, 0x9e, 0x5e, 0xde, 0x3e, 0xbe, 0x7e, 0xfe,
0x01, 0x81, 0x41, 0xc1, 0x21, 0xa1, 0x61, 0xe1,
0x11, 0x91, 0x51, 0xd1, 0x31, 0xb1, 0x71, 0xf1,
0x09, 0x89, 0x49, 0xc9, 0x29, 0xa9, 0x69, 0xe9,
0x19, 0x99, 0x59, 0xd9, 0x39, 0xb9, 0x79, 0xf9,
0x05, 0x85, 0x45, 0xc5, 0x25, 0xa5, 0x65, 0xe5,
0x15, 0x95, 0x55, 0xd5, 0x35, 0xb5, 0x75, 0xf5,
0x0d, 0x8d, 0x4d, 0xcd, 0x2d, 0xad, 0x6d, 0xed,
0x1d, 0x9d, 0x5d, 0xdd, 0x3d, 0xbd, 0x7d, 0xfd,
0x03, 0x83, 0x43, 0xc3, 0x23, 0xa3, 0x63, 0xe3,
0x13, 0x93, 0x53, 0xd3, 0x33, 0xb3, 0x73, 0xf3,
0x0b, 0x8b, 0x4b, 0xcb, 0x2b, 0xab, 0x6b, 0xeb,
0x1b, 0x9b, 0x5b, 0xdb, 0x3b, 0xbb, 0x7b, 0xfb,
0x07, 0x87, 0x47, 0xc7, 0x27, 0xa7, 0x67, 0xe7,
0x17, 0x97, 0x57, 0xd7, 0x37, 0xb7, 0x77, 0xf7,
0x0f, 0x8f, 0x4f, 0xcf, 0x2f, 0xaf, 0x6f, 0xef,
0x1f, 0x9f, 0x5f, 0xdf, 0x3f, 0xbf, 0x7f, 0xff
};
static int
_XReverse_Bytes(bpt, nb)
register unsigned char *bpt;
register int nb;
{
do {
*bpt = _reverse_byte[*bpt];
bpt++;
} while (--nb > 0);
return 0;
}
void
xpm_xynormalizeimagebits(bp, img)
register unsigned char *bp;
register XImage *img;
{
register unsigned char c;
if (img->byte_order != img->bitmap_bit_order) {
switch (img->bitmap_unit) {
case 16:
c = *bp;
*bp = *(bp + 1);
*(bp + 1) = c;
break;
case 32:
c = *(bp + 3);
*(bp + 3) = *bp;
*bp = c;
c = *(bp + 2);
*(bp + 2) = *(bp + 1);
*(bp + 1) = c;
break;
}
}
if (img->bitmap_bit_order == MSBFirst)
_XReverse_Bytes(bp, img->bitmap_unit >> 3);
}
void
xpm_znormalizeimagebits(bp, img)
register unsigned char *bp;
register XImage *img;
{
register unsigned char c;
switch (img->bits_per_pixel) {
case 2:
_XReverse_Bytes(bp, 1);
break;
case 4:
*bp = ((*bp >> 4) & 0xF) | ((*bp << 4) & ~0xF);
break;
case 16:
c = *bp;
*bp = *(bp + 1);
*(bp + 1) = c;
break;
case 24:
c = *(bp + 2);
*(bp + 2) = *bp;
*bp = c;
break;
case 32:
c = *(bp + 3);
*(bp + 3) = *bp;
*bp = c;
c = *(bp + 2);
*(bp + 2) = *(bp + 1);
*(bp + 1) = c;
break;
}
}
static unsigned char Const _lomask[0x09] = {
0x00, 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff};
static unsigned char Const _himask[0x09] = {
0xff, 0xfe, 0xfc, 0xf8, 0xf0, 0xe0, 0xc0, 0x80, 0x00};
static void
_putbits(src, dstoffset, numbits, dst)
register char *src; /* address of source bit string */
int dstoffset; /* bit offset into destination;
* range is 0-31 */
register int numbits; /* number of bits to copy to
* destination */
register char *dst; /* address of destination bit string */
{
register unsigned char chlo, chhi;
int hibits;
dst = dst + (dstoffset >> 3);
dstoffset = dstoffset & 7;
hibits = 8 - dstoffset;
chlo = *dst & _lomask[dstoffset];
for (;;) {
chhi = (*src << dstoffset) & _himask[dstoffset];
if (numbits <= hibits) {
chhi = chhi & _lomask[dstoffset + numbits];
*dst = (*dst & _himask[dstoffset + numbits]) | chlo | chhi;
break;
}
*dst = chhi | chlo;
dst++;
numbits = numbits - hibits;
chlo = (unsigned char) (*src & _himask[hibits]) >> hibits;
src++;
if (numbits <= dstoffset) {
chlo = chlo & _lomask[numbits];
*dst = (*dst & _himask[numbits]) | chlo;
break;
}
numbits = numbits - dstoffset;
}
}
/*
* Default method to write pixels into a Z image data structure.
* The algorithm used is:
*
* copy the destination bitmap_unit or Zpixel to temp
* normalize temp if needed
* copy the pixel bits into the temp
* renormalize temp if needed
* copy the temp back into the destination image data
*/
static void
SetImagePixels(image, width, height, pixelindex, pixels)
XImage *image;
unsigned int width;
unsigned int height;
unsigned int *pixelindex;
Pixel *pixels;
{
register char *src;
register char *dst;
register unsigned int *iptr;
register int x, y, i;
register char *data;
Pixel pixel, px;
int nbytes, depth, ibu, ibpp;
data = image->data;
iptr = pixelindex;
depth = image->depth;
if (depth == 1) {
ibu = image->bitmap_unit;
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
pixel = pixels[*iptr];
for (i = 0, px = pixel; i < sizeof(unsigned long);
i++, px >>= 8)
((unsigned char *) &pixel)[i] = px;
src = &data[XYINDEX(x, y, image)];
dst = (char *) &px;
px = 0;
nbytes = ibu >> 3;
for (i = nbytes; --i >= 0;)
*dst++ = *src++;
XYNORMALIZE(&px, image);
_putbits((char *) &pixel, (x % ibu), 1, (char *) &px);
XYNORMALIZE(&px, image);
src = (char *) &px;
dst = &data[XYINDEX(x, y, image)];
for (i = nbytes; --i >= 0;)
*dst++ = *src++;
}
} else {
ibpp = image->bits_per_pixel;
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
pixel = pixels[*iptr];
if (depth == 4)
pixel &= 0xf;
for (i = 0, px = pixel; i < sizeof(unsigned long); i++,
px >>= 8)
((unsigned char *) &pixel)[i] = px;
src = &data[ZINDEX(x, y, image)];
dst = (char *) &px;
px = 0;
nbytes = (ibpp + 7) >> 3;
for (i = nbytes; --i >= 0;)
*dst++ = *src++;
ZNORMALIZE(&px, image);
_putbits((char *) &pixel, (x * ibpp) & 7, ibpp, (char *) &px);
ZNORMALIZE(&px, image);
src = (char *) &px;
dst = &data[ZINDEX(x, y, image)];
for (i = nbytes; --i >= 0;)
*dst++ = *src++;
}
}
}
/*
* write pixels into a 32-bits Z image data structure
*/
#ifndef WORD64
/* this item is static but deterministic so let it slide; doesn't
** hurt re-entrancy of this library. Note if it is actually const then would
** be OK under rules of ANSI-C but probably not C++ which may not
** want to allocate space for it.
*/
static unsigned long /*constant */ RTXpm_byteorderpixel = MSBFirst << 24;
#endif
/*
WITHOUT_SPEEDUPS is a flag to be turned on if you wish to use the original
3.2e code - by default you get the speeded-up version.
*/
static void
SetImagePixels32(image, width, height, pixelindex, pixels)
XImage *image;
unsigned int width;
unsigned int height;
unsigned int *pixelindex;
Pixel *pixels;
{
unsigned char *data;
unsigned int *iptr;
int y;
Pixel pixel;
#ifdef WITHOUT_SPEEDUPS
int x;
unsigned char *addr;
data = (unsigned char *) image->data;
iptr = pixelindex;
#ifndef WORD64
if (*((char *) &RTXpm_byteorderpixel) == image->byte_order) {
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
addr = &data[ZINDEX32(x, y, image)];
*((unsigned long *) addr) = pixels[*iptr];
}
} else
#endif
if (image->byte_order == MSBFirst)
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
addr = &data[ZINDEX32(x, y, image)];
pixel = pixels[*iptr];
addr[0] = pixel >> 24;
addr[1] = pixel >> 16;
addr[2] = pixel >> 8;
addr[3] = pixel;
}
else
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
addr = &data[ZINDEX32(x, y, image)];
pixel = pixels[*iptr];
addr[0] = pixel;
addr[1] = pixel >> 8;
addr[2] = pixel >> 16;
addr[3] = pixel >> 24;
}
#else /* WITHOUT_SPEEDUPS */
int bpl = image->bytes_per_line;
unsigned char *data_ptr, *max_data;
data = (unsigned char *) image->data;
iptr = pixelindex;
#ifndef WORD64
if (*((char *) &RTXpm_byteorderpixel) == image->byte_order) {
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + (width<<2);
while (data_ptr < max_data) {
*((unsigned long *)data_ptr) = pixels[*(iptr++)];
data_ptr += (1<<2);
}
data += bpl;
}
} else
#endif
if (image->byte_order == MSBFirst)
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + (width<<2);
while (data_ptr < max_data) {
pixel = pixels[*(iptr++)];
*data_ptr++ = pixel >> 24;
*data_ptr++ = pixel >> 16;
*data_ptr++ = pixel >> 8;
*data_ptr++ = pixel;
}
data += bpl;
}
else
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + (width<<2);
while (data_ptr < max_data) {
pixel = pixels[*(iptr++)];
*data_ptr++ = pixel;
*data_ptr++ = pixel >> 8;
*data_ptr++ = pixel >> 16;
*data_ptr++ = pixel >> 24;
}
data += bpl;
}
#endif /* WITHOUT_SPEEDUPS */
}
/*
* write pixels into a 16-bits Z image data structure
*/
static void
SetImagePixels16(image, width, height, pixelindex, pixels)
XImage *image;
unsigned int width;
unsigned int height;
unsigned int *pixelindex;
Pixel *pixels;
{
unsigned char *data;
unsigned int *iptr;
int y;
#ifdef WITHOUT_SPEEDUPS
int x;
unsigned char *addr;
data = (unsigned char *) image->data;
iptr = pixelindex;
if (image->byte_order == MSBFirst)
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
addr = &data[ZINDEX16(x, y, image)];
addr[0] = pixels[*iptr] >> 8;
addr[1] = pixels[*iptr];
}
else
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
addr = &data[ZINDEX16(x, y, image)];
addr[0] = pixels[*iptr];
addr[1] = pixels[*iptr] >> 8;
}
#else /* WITHOUT_SPEEDUPS */
Pixel pixel;
int bpl=image->bytes_per_line;
unsigned char *data_ptr,*max_data;
data = (unsigned char *) image->data;
iptr = pixelindex;
if (image->byte_order == MSBFirst)
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + (width<<1);
while (data_ptr < max_data) {
pixel = pixels[*(iptr++)];
data_ptr[0] = pixel >> 8;
data_ptr[1] = pixel;
data_ptr+=(1<<1);
}
data += bpl;
}
else
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + (width<<1);
while (data_ptr < max_data) {
pixel = pixels[*(iptr++)];
data_ptr[0] = pixel;
data_ptr[1] = pixel >> 8;
data_ptr+=(1<<1);
}
data += bpl;
}
#endif /* WITHOUT_SPEEDUPS */
}
/*
* write pixels into a 8-bits Z image data structure
*/
static void
SetImagePixels8(image, width, height, pixelindex, pixels)
XImage *image;
unsigned int width;
unsigned int height;
unsigned int *pixelindex;
Pixel *pixels;
{
char *data;
unsigned int *iptr;
int y;
#ifdef WITHOUT_SPEEDUPS
int x;
data = image->data;
iptr = pixelindex;
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++)
data[ZINDEX8(x, y, image)] = pixels[*iptr];
#else /* WITHOUT_SPEEDUPS */
int bpl = image->bytes_per_line;
char *data_ptr,*max_data;
data = image->data;
iptr = pixelindex;
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + width;
while (data_ptr < max_data)
*(data_ptr++) = pixels[*(iptr++)];
data += bpl;
}
#endif /* WITHOUT_SPEEDUPS */
}
/*
* write pixels into a 1-bit depth image data structure and **offset null**
*/
static void
SetImagePixels1(image, width, height, pixelindex, pixels)
XImage *image;
unsigned int width;
unsigned int height;
unsigned int *pixelindex;
Pixel *pixels;
{
if (image->byte_order != image->bitmap_bit_order)
SetImagePixels(image, width, height, pixelindex, pixels);
else {
unsigned int *iptr;
int y;
char *data;
#ifdef WITHOUT_SPEEDUPS
int x;
data = image->data;
iptr = pixelindex;
if (image->bitmap_bit_order == MSBFirst)
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
if (pixels[*iptr] & 1)
data[ZINDEX1(x, y, image)] |= 0x80 >> (x & 7);
else
data[ZINDEX1(x, y, image)] &= ~(0x80 >> (x & 7));
}
else
for (y = 0; y < height; y++)
for (x = 0; x < width; x++, iptr++) {
if (pixels[*iptr] & 1)
data[ZINDEX1(x, y, image)] |= 1 << (x & 7);
else
data[ZINDEX1(x, y, image)] &= ~(1 << (x & 7));
}
#else /* WITHOUT_SPEEDUPS */
char value;
char *data_ptr, *max_data;
int bpl = image->bytes_per_line;
int diff, count;
data = image->data;
iptr = pixelindex;
diff = width & 7;
width >>= 3;
if (image->bitmap_bit_order == MSBFirst)
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + width;
while (data_ptr < max_data) {
value=0;
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
value=(value<<1) | (pixels[*(iptr++)] & 1);
*(data_ptr++) = value;
}
if (diff) {
value = 0;
for (count = 0; count < diff; count++) {
if (pixels[*(iptr++)] & 1)
value |= (0x80>>count);
}
*(data_ptr) = value;
}
data += bpl;
}
else
for (y = 0; y < height; y++) {
data_ptr = data;
max_data = data_ptr + width;
while (data_ptr < max_data) {
value=0;
iptr+=8;
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
value=(value<<1) | (pixels[*(--iptr)] & 1);
iptr+=8;
*(data_ptr++) = value;
}
if (diff) {
value=0;
for (count = 0; count < diff; count++) {
if (pixels[*(iptr++)] & 1)
value |= (1<<count);
}
*(data_ptr) = value;
}
data += bpl;
}
#endif /* WITHOUT_SPEEDUPS */
}
}
int
XpmCreatePixmapFromXpmImage(display, d, image,
pixmap_return, shapemask_return, attributes)
Display *display;
Drawable d;
XpmImage *image;
Pixmap *pixmap_return;
Pixmap *shapemask_return;
XpmAttributes *attributes;
{
XImage *ximage, **ximageptr = NULL;
XImage *shapeimage, **shapeimageptr = NULL;
int ErrorStatus;
XGCValues gcv;
GC gc;
/*
* initialize return values
*/
if (pixmap_return) {
*pixmap_return = 0;
ximageptr = &ximage;
}
if (shapemask_return) {
*shapemask_return = 0;
shapeimageptr = &shapeimage;
}
/*
* create the ximages
*/
ErrorStatus = XpmCreateImageFromXpmImage(display, image,
ximageptr, shapeimageptr,
attributes);
if (ErrorStatus < 0)
return (ErrorStatus);
/*
* create the pixmaps
*/
if (ximageptr && ximage) {
*pixmap_return = XCreatePixmap(display, d, ximage->width,
ximage->height, ximage->depth);
gcv.function = GXcopy;
gc = XCreateGC(display, *pixmap_return, GCFunction, &gcv);
XPutImage(display, *pixmap_return, gc, ximage, 0, 0, 0, 0,
ximage->width, ximage->height);
XDestroyImage(ximage);
XFreeGC(display, gc);
}
if (shapeimageptr && shapeimage) {
*shapemask_return = XCreatePixmap(display, d, shapeimage->width,
shapeimage->height,
shapeimage->depth);
gcv.function = GXcopy;
gc = XCreateGC(display, *shapemask_return, GCFunction, &gcv);
XPutImage(display, *shapemask_return, gc, shapeimage, 0, 0, 0, 0,
shapeimage->width, shapeimage->height);
XDestroyImage(shapeimage);
XFreeGC(display, gc);
}
return (ErrorStatus);
}
|