]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (C) 1989-94 GROUPE BULL | |
3 | * | |
4 | * Permission is hereby granted, free of charge, to any person obtaining a copy | |
5 | * of this software and associated documentation files (the "Software"), to | |
6 | * deal in the Software without restriction, including without limitation the | |
7 | * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or | |
8 | * sell copies of the Software, and to permit persons to whom the Software is | |
9 | * furnished to do so, subject to the following conditions: | |
10 | * | |
11 | * The above copyright notice and this permission notice shall be included in | |
12 | * all copies or substantial portions of the Software. | |
13 | * | |
14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
15 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL | |
17 | * GROUPE BULL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN | |
18 | * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN | |
19 | * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. | |
20 | * | |
21 | * Except as contained in this notice, the name of GROUPE BULL shall not be | |
22 | * used in advertising or otherwise to promote the sale, use or other dealings | |
23 | * in this Software without prior written authorization from GROUPE BULL. | |
24 | */ | |
25 | ||
26 | /*****************************************************************************\ | |
27 | * simx.c: 0.1a * | |
28 | * * | |
29 | * This emulates some Xlib functionality for MSW. It's not a general solution, * | |
30 | * it is close related to XPM-lib. It is only intended to satisfy what is need * | |
31 | * there. Thus allowing to read XPM files under MS windows. * | |
32 | * * | |
33 | * Developed by HeDu 3/94 (hedu@cul-ipn.uni-kiel.de) * | |
34 | \*****************************************************************************/ | |
35 | ||
36 | #include "xpm34.h" | |
37 | ||
38 | #ifdef FOR_MSW | |
39 | ||
40 | #include "xpm34p.h" /* for XpmMalloc */ | |
41 | ||
42 | /* | |
43 | * On DOS size_t is only 2 bytes, thus malloc(size_t s) can only malloc | |
44 | * 64K. BUT an expression data=malloc(width*height) may result in an | |
45 | * overflow. So this function takes a long as input, and returns NULL if the | |
46 | * request is larger than 64K, is size_t is only 2 bytes. | |
47 | * | |
48 | * This requires casts like XpmMalloc( (long)width*(long(height)), else it | |
49 | * might have no effect at all. | |
50 | */ | |
51 | ||
52 | void * | |
53 | boundCheckingMalloc(long s) | |
54 | { | |
55 | if (sizeof(size_t) == sizeof(long)) { /* same size, just do it */ | |
56 | return (malloc((size_t) s)); | |
57 | } else { | |
58 | if (sizeof(size_t) == 2) { | |
59 | if (s > 0xFFFF) | |
60 | return (NULL); /* to large, size_t with 2 bytes | |
61 | * only allows 16 bits */ | |
62 | else | |
63 | return (malloc((size_t) s)); | |
64 | } else { /* it's not a long, not 2 bytes, | |
65 | * what is it ??? */ | |
66 | return (malloc((size_t) s)); | |
67 | } | |
68 | } | |
69 | } | |
70 | void * | |
71 | boundCheckingCalloc(long num, long s) | |
72 | { | |
73 | if (sizeof(size_t) == sizeof(long)) { /* same size, just do it */ | |
74 | return (calloc((size_t) num, (size_t) s)); | |
75 | } else { | |
76 | if (sizeof(size_t) == 2) { | |
77 | if (s > 0xFFFF || num * s > 0xFFFF) | |
78 | return (NULL); /* to large, size_t with 2 bytes | |
79 | * only allows 16 bits */ | |
80 | else | |
81 | return (calloc((size_t) num, (size_t) s)); | |
82 | } else { /* it's not a long, not 2 bytes, | |
83 | * what is it ??? */ | |
84 | return (calloc((size_t) num, (size_t) s)); | |
85 | } | |
86 | } | |
87 | } | |
88 | void * | |
89 | boundCheckingRealloc(void *p, long s) | |
90 | { | |
91 | if (sizeof(size_t) == sizeof(long)) { /* same size, just do it */ | |
92 | return (realloc(p, (size_t) s)); | |
93 | } else { | |
94 | if (sizeof(size_t) == 2) { | |
95 | if (s > 0xFFFF) | |
96 | return (NULL); /* to large, size_t with 2 bytes | |
97 | * only allows 16 bits */ | |
98 | else | |
99 | return (realloc(p, (size_t) s)); | |
100 | } else { /* it's not a long, not 2 bytes, | |
101 | * what is it ??? */ | |
102 | return (realloc(p, (size_t) s)); | |
103 | } | |
104 | } | |
105 | } | |
106 | ||
107 | /* static Visual theVisual = { 0 }; */ | |
108 | Visual * | |
109 | XDefaultVisual(Display *display, Screen *screen) | |
110 | { | |
111 | return (NULL); /* struct could contain info about | |
112 | * MONO, GRAY, COLOR */ | |
113 | } | |
114 | ||
115 | Screen * | |
116 | XDefaultScreen(Display *d) | |
117 | { | |
118 | return (NULL); | |
119 | } | |
120 | ||
121 | /* I get only 1 plane but 8 bits per pixel, | |
122 | so I think BITSPIXEL should be depth */ | |
123 | int | |
124 | XDefaultDepth(Display *display, Screen *screen) | |
125 | { | |
126 | int d, b; | |
127 | ||
128 | b = GetDeviceCaps(*display, BITSPIXEL); | |
129 | d = GetDeviceCaps(*display, PLANES); | |
130 | return (b); | |
131 | } | |
132 | ||
133 | Colormap * | |
134 | XDefaultColormap(Display *display, Screen *screen) | |
135 | { | |
136 | return (NULL); | |
137 | } | |
138 | ||
139 | /* convert hex color names, | |
140 | wrong digits (not a-f,A-F,0-9) are treated as zero */ | |
141 | static int | |
142 | hexCharToInt(char c) | |
143 | { | |
144 | int r; | |
145 | ||
146 | if (c >= '0' && c <= '9') | |
147 | r = c - '0'; | |
148 | else if (c >= 'a' && c <= 'f') | |
149 | r = c - 'a' + 10; | |
150 | else if (c >= 'A' && c <= 'F') | |
151 | r = c - 'A' + 10; | |
152 | else | |
153 | r = 0; | |
154 | ||
155 | return (r); | |
156 | } | |
157 | ||
158 | static int | |
159 | rgbFromHex(char *hex, int *r, int *g, int *b) | |
160 | { | |
161 | int len; | |
162 | ||
163 | if (hex == NULL || hex[0] != '#') | |
164 | return (0); | |
165 | ||
166 | len = strlen(hex); | |
167 | if (len == 3 + 1) { | |
168 | *r = hexCharToInt(hex[1]); | |
169 | *g = hexCharToInt(hex[2]); | |
170 | *b = hexCharToInt(hex[3]); | |
171 | } else if (len == 6 + 1) { | |
172 | *r = hexCharToInt(hex[1]) * 16 + hexCharToInt(hex[2]); | |
173 | *g = hexCharToInt(hex[3]) * 16 + hexCharToInt(hex[4]); | |
174 | *b = hexCharToInt(hex[5]) * 16 + hexCharToInt(hex[6]); | |
175 | } else if (len == 12 + 1) { | |
176 | /* it's like c #32329999CCCC */ | |
177 | /* so for now only take two digits */ | |
178 | *r = hexCharToInt(hex[1]) * 16 + hexCharToInt(hex[2]); | |
179 | *g = hexCharToInt(hex[5]) * 16 + hexCharToInt(hex[6]); | |
180 | *b = hexCharToInt(hex[9]) * 16 + hexCharToInt(hex[10]); | |
181 | } else | |
182 | return (0); | |
183 | ||
184 | return (1); | |
185 | } | |
186 | ||
187 | /* Color related functions */ | |
188 | int | |
189 | XParseColor(Display *d, Colormap *cmap, char *name, XColor *color) | |
190 | { | |
191 | int r, g, b; /* only 8 bit values used */ | |
192 | int okay; | |
193 | ||
194 | /* TODO: use colormap via PALETTE */ | |
195 | /* parse name either in table or #RRGGBB #RGB */ | |
196 | if (name == NULL) | |
197 | return (0); | |
198 | ||
199 | if (name[0] == '#') { /* a hex string */ | |
200 | okay = rgbFromHex(name, &r, &g, &b); | |
201 | } else { | |
202 | okay = xpmGetRGBfromName(name, &r, &g, &b); | |
203 | } | |
204 | ||
205 | if (okay) { | |
206 | color->pixel = RGB(r, g, b); | |
207 | color->red = (BYTE) r; | |
208 | color->green = (BYTE) g; | |
209 | color->blue = (BYTE) b; | |
210 | return (1); | |
211 | } else | |
212 | return (0); /* --> ColorError */ | |
213 | } | |
214 | ||
215 | ||
216 | int | |
217 | XAllocColor(Display *d, Colormap *cmap, XColor *color) | |
218 | { | |
219 | /* colormap not used yet so color->pixel is the real COLORREF (RBG) and not an | |
220 | index in some colormap as in X */ | |
221 | return (1); | |
222 | } | |
223 | void | |
224 | XQueryColors(Display *display, Colormap *colormap, | |
225 | XColor *xcolors, int ncolors) | |
226 | { | |
227 | /* under X this fills the rgb values to given .pixel */ | |
228 | /* since there no colormap use FOR_MSW (not yet!!), rgb is plain encoded */ | |
229 | XColor *xc = xcolors; | |
230 | int i; | |
231 | ||
232 | for (i = 0; i < ncolors; i++, xc++) { | |
233 | xc->red = GetRValue(xc->pixel); | |
234 | xc->green = GetGValue(xc->pixel); | |
235 | xc->blue = GetBValue(xc->pixel); | |
236 | } | |
237 | return; | |
238 | } | |
239 | int | |
240 | XFreeColors(Display *d, Colormap cmap, | |
241 | unsigned long pixels[], int npixels, unsigned long planes) | |
242 | { | |
243 | /* no colormap yet */ | |
244 | return (0); /* correct ??? */ | |
245 | } | |
246 | ||
247 | /* XImage functions */ | |
248 | XImage * | |
249 | XCreateImage(Display *d, Visual *v, | |
250 | int depth, int format, | |
251 | int x, int y, int width, int height, | |
252 | int pad, int foo) | |
253 | { | |
254 | XImage *img = (XImage *) XpmMalloc(sizeof(XImage)); | |
255 | ||
256 | if (img) { | |
257 | /* *img = CreateCompatibleBitmap(*d, width, height); */ | |
258 | img->bitmap = CreateBitmap(width, height, 1 /* plane */ , | |
259 | depth /* bits per pixel */ , NULL); | |
260 | img->width = width; | |
261 | img->height = height; | |
262 | img->depth = depth; | |
263 | } | |
264 | return (img); | |
265 | ||
266 | } | |
267 | ||
268 | void | |
269 | XImageFree(XImage *img) | |
270 | { | |
271 | if (img) { | |
272 | XpmFree(img); | |
273 | } | |
274 | } | |
275 | void | |
276 | XDestroyImage(XImage *img) | |
277 | { | |
278 | if (img) { | |
279 | DeleteObject(img->bitmap); /* check return ??? */ | |
280 | XImageFree(img); | |
281 | } | |
282 | } | |
283 | ||
284 | #endif |