Skip to content

Latest commit

 

History

History
507 lines (454 loc) · 10.9 KB

IMG_xpm.c

File metadata and controls

507 lines (454 loc) · 10.9 KB
 
Nov 29, 2000
Nov 29, 2000
1
/*
Dec 14, 2001
Dec 14, 2001
2
SDL_image: An example image loading library for use with SDL
Feb 4, 2006
Feb 4, 2006
3
Copyright (C) 1997-2006 Sam Lantinga
Nov 29, 2000
Nov 29, 2000
4
5
This library is free software; you can redistribute it and/or
Feb 4, 2006
Feb 4, 2006
6
modify it under the terms of the GNU Lesser General Public
Nov 29, 2000
Nov 29, 2000
7
License as published by the Free Software Foundation; either
Feb 4, 2006
Feb 4, 2006
8
version 2.1 of the License, or (at your option) any later version.
Nov 29, 2000
Nov 29, 2000
9
10
11
12
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Feb 4, 2006
Feb 4, 2006
13
Lesser General Public License for more details.
Nov 29, 2000
Nov 29, 2000
14
Feb 4, 2006
Feb 4, 2006
15
16
17
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Nov 29, 2000
Nov 29, 2000
18
19
Sam Lantinga
Dec 14, 2001
Dec 14, 2001
20
slouken@libsdl.org
Nov 29, 2000
Nov 29, 2000
21
22
*/
Apr 28, 2001
Apr 28, 2001
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/*
* XPM (X PixMap) image loader:
*
* Supports the XPMv3 format, EXCEPT:
* - hotspot coordinates are ignored
* - only colour ('c') colour symbols are used
* - rgb.txt is not used (for portability), so only RGB colours
* are recognized (#rrggbb etc) - only a few basic colour names are
* handled
*
* The result is an 8bpp indexed surface if possible, otherwise 32bpp.
* The colourkey is correctly set if transparency is used.
*
* Besides the standard API, also provides
*
* SDL_Surface *IMG_ReadXPMFromArray(char **xpm)
*
* that reads the image data from an XPM file included in the C source.
*
* TODO: include rgb.txt here. The full table (from solaris 2.6) only
* requires about 13K in binary form.
*/
Nov 29, 2000
Nov 29, 2000
45
Nov 30, 2000
Nov 30, 2000
46
#include <stdlib.h>
Nov 29, 2000
Nov 29, 2000
47
48
49
50
51
52
53
54
55
56
57
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include "SDL_image.h"
#ifdef LOAD_XPM
/* See if an image is contained in a data source */
int IMG_isXPM(SDL_RWops *src)
{
Feb 4, 2006
Feb 4, 2006
58
59
int start;
int is_XPM;
Apr 28, 2001
Apr 28, 2001
60
char magic[9];
Nov 29, 2000
Nov 29, 2000
61
Feb 13, 2007
Feb 13, 2007
62
63
if ( !src )
return 0;
Feb 4, 2006
Feb 4, 2006
64
65
66
67
68
69
70
71
72
start = SDL_RWtell(src);
is_XPM = 0;
if ( SDL_RWread(src, magic, sizeof(magic), 1) ) {
if ( memcmp(magic, "/* XPM */", sizeof(magic)) == 0 ) {
is_XPM = 1;
}
}
SDL_RWseek(src, start, SEEK_SET);
return(is_XPM);
Nov 29, 2000
Nov 29, 2000
73
74
75
}
/* Hash table to look up colors from pixel strings */
Dec 6, 2000
Dec 6, 2000
76
77
78
79
80
81
82
83
#define STARTING_HASH_SIZE 256
struct hash_entry {
char *key;
Uint32 color;
struct hash_entry *next;
};
Nov 29, 2000
Nov 29, 2000
84
struct color_hash {
Dec 6, 2000
Dec 6, 2000
85
86
87
88
89
struct hash_entry **table;
struct hash_entry *entries; /* array of all entries */
struct hash_entry *next_free;
int size;
int maxnum;
Nov 29, 2000
Nov 29, 2000
90
91
};
Dec 6, 2000
Dec 6, 2000
92
static int hash_key(const char *key, int cpp, int size)
Nov 29, 2000
Nov 29, 2000
93
94
95
96
97
{
int hash;
hash = 0;
while ( cpp-- > 0 ) {
Dec 6, 2000
Dec 6, 2000
98
hash = hash * 33 + *key++;
Nov 29, 2000
Nov 29, 2000
99
}
Dec 6, 2000
Dec 6, 2000
100
return hash & (size - 1);
Nov 29, 2000
Nov 29, 2000
101
102
}
Dec 6, 2000
Dec 6, 2000
103
static struct color_hash *create_colorhash(int maxnum)
Nov 29, 2000
Nov 29, 2000
104
{
Dec 6, 2000
Dec 6, 2000
105
int bytes, s;
Nov 29, 2000
Nov 29, 2000
106
107
struct color_hash *hash;
Dec 6, 2000
Dec 6, 2000
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/* we know how many entries we need, so we can allocate
everything here */
hash = malloc(sizeof *hash);
if(!hash)
return NULL;
/* use power-of-2 sized hash table for decoding speed */
for(s = STARTING_HASH_SIZE; s < maxnum; s <<= 1)
;
hash->size = s;
hash->maxnum = maxnum;
bytes = hash->size * sizeof(struct hash_entry **);
hash->entries = NULL; /* in case malloc fails */
hash->table = malloc(bytes);
if(!hash->table)
return NULL;
memset(hash->table, 0, bytes);
hash->entries = malloc(maxnum * sizeof(struct hash_entry));
if(!hash->entries)
return NULL;
hash->next_free = hash->entries;
return hash;
Nov 29, 2000
Nov 29, 2000
130
131
132
}
static int add_colorhash(struct color_hash *hash,
Dec 6, 2000
Dec 6, 2000
133
char *key, int cpp, Uint32 color)
Nov 29, 2000
Nov 29, 2000
134
{
Dec 6, 2000
Dec 6, 2000
135
136
137
138
139
140
141
int index = hash_key(key, cpp, hash->size);
struct hash_entry *e = hash->next_free++;
e->color = color;
e->key = key;
e->next = hash->table[index];
hash->table[index] = e;
return 1;
Nov 29, 2000
Nov 29, 2000
142
143
}
Dec 6, 2000
Dec 6, 2000
144
/* fast lookup that works if cpp == 1 */
Mar 2, 2001
Mar 2, 2001
145
#define QUICK_COLORHASH(hash, key) ((hash)->table[*(Uint8 *)(key)]->color)
Dec 6, 2000
Dec 6, 2000
146
147
static Uint32 get_colorhash(struct color_hash *hash, const char *key, int cpp)
Nov 29, 2000
Nov 29, 2000
148
{
Dec 6, 2000
Dec 6, 2000
149
150
151
152
153
struct hash_entry *entry = hash->table[hash_key(key, cpp, hash->size)];
while(entry) {
if(memcmp(key, entry->key, cpp) == 0)
return entry->color;
entry = entry->next;
Nov 29, 2000
Nov 29, 2000
154
}
Dec 6, 2000
Dec 6, 2000
155
return 0; /* garbage in - garbage out */
Nov 29, 2000
Nov 29, 2000
156
157
158
159
}
static void free_colorhash(struct color_hash *hash)
{
Dec 6, 2000
Dec 6, 2000
160
161
162
163
if(hash && hash->table) {
free(hash->table);
free(hash->entries);
free(hash);
Nov 29, 2000
Nov 29, 2000
164
165
166
}
}
Apr 28, 2001
Apr 28, 2001
167
168
169
170
171
172
173
174
175
176
177
178
179
/* portable case-insensitive string comparison */
static int string_equal(const char *a, const char *b, int n)
{
while(*a && *b && n) {
if(toupper((unsigned char)*a) != toupper((unsigned char)*b))
return 0;
a++;
b++;
n--;
}
return *a == *b;
}
Dec 6, 2000
Dec 6, 2000
180
#define ARRAYSIZE(a) (int)(sizeof(a) / sizeof((a)[0]))
Nov 29, 2000
Nov 29, 2000
181
Dec 6, 2000
Dec 6, 2000
182
183
/*
* convert colour spec to RGB (in 0xrrggbb format).
Apr 28, 2001
Apr 28, 2001
184
* return 1 if successful.
Dec 6, 2000
Dec 6, 2000
185
*/
Apr 28, 2001
Apr 28, 2001
186
static int color_to_rgb(char *spec, int speclen, Uint32 *rgb)
Dec 6, 2000
Dec 6, 2000
187
188
189
190
191
192
193
194
195
196
197
198
199
{
/* poor man's rgb.txt */
static struct { char *name; Uint32 rgb; } known[] = {
{"none", 0xffffffff},
{"black", 0x00000000},
{"white", 0x00ffffff},
{"red", 0x00ff0000},
{"green", 0x0000ff00},
{"blue", 0x000000ff}
};
if(spec[0] == '#') {
char buf[7];
Apr 28, 2001
Apr 28, 2001
200
201
202
203
204
switch(speclen) {
case 4:
buf[0] = buf[1] = spec[1];
buf[2] = buf[3] = spec[2];
buf[4] = buf[5] = spec[3];
Nov 29, 2000
Nov 29, 2000
205
break;
Apr 28, 2001
Apr 28, 2001
206
207
case 7:
memcpy(buf, spec + 1, 6);
Nov 29, 2000
Nov 29, 2000
208
break;
Apr 28, 2001
Apr 28, 2001
209
210
211
212
213
214
215
case 13:
buf[0] = spec[1];
buf[1] = spec[2];
buf[2] = spec[5];
buf[3] = spec[6];
buf[4] = spec[9];
buf[5] = spec[10];
Nov 29, 2000
Nov 29, 2000
216
break;
Dec 6, 2000
Dec 6, 2000
217
218
219
220
221
222
223
}
buf[6] = '\0';
*rgb = strtol(buf, NULL, 16);
return 1;
} else {
int i;
for(i = 0; i < ARRAYSIZE(known); i++)
Apr 28, 2001
Apr 28, 2001
224
if(string_equal(known[i].name, spec, speclen)) {
Dec 6, 2000
Dec 6, 2000
225
226
227
228
*rgb = known[i].rgb;
return 1;
}
return 0;
Nov 29, 2000
Nov 29, 2000
229
230
231
}
}
Apr 28, 2001
Apr 28, 2001
232
233
234
#ifndef MAX
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#endif
Dec 6, 2000
Dec 6, 2000
235
Apr 28, 2001
Apr 28, 2001
236
237
238
239
240
241
242
243
244
static char *linebuf;
static int buflen;
static char *error;
/*
* Read next line from the source.
* If len > 0, it's assumed to be at least len chars (for efficiency).
* Return NULL and set error upon EOF or parse error.
*/
Apr 28, 2001
Apr 28, 2001
245
static char *get_next_line(char ***lines, SDL_RWops *src, int len)
Dec 6, 2000
Dec 6, 2000
246
{
Apr 28, 2001
Apr 28, 2001
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
if(lines) {
return *(*lines)++;
} else {
char c;
int n;
do {
if(SDL_RWread(src, &c, 1, 1) <= 0) {
error = "Premature end of data";
return NULL;
}
} while(c != '"');
if(len) {
len += 4; /* "\",\n\0" */
if(len > buflen){
buflen = len;
linebuf = realloc(linebuf, buflen);
if(!linebuf) {
error = "Out of memory";
return NULL;
}
}
if(SDL_RWread(src, linebuf, len - 1, 1) <= 0) {
error = "Premature end of data";
return NULL;
}
n = len - 2;
} else {
n = 0;
do {
if(n >= buflen - 1) {
if(buflen == 0)
buflen = 16;
buflen *= 2;
linebuf = realloc(linebuf, buflen);
if(!linebuf) {
error = "Out of memory";
return NULL;
}
}
if(SDL_RWread(src, linebuf + n, 1, 1) <= 0) {
error = "Premature end of data";
return NULL;
}
} while(linebuf[n++] != '"');
n--;
}
linebuf[n] = '\0';
return linebuf;
}
Dec 6, 2000
Dec 6, 2000
296
297
}
Apr 28, 2001
Apr 28, 2001
298
299
300
301
302
#define SKIPSPACE(p) \
do { \
while(isspace((unsigned char)*(p))) \
++(p); \
} while(0)
Dec 6, 2000
Dec 6, 2000
303
Apr 28, 2001
Apr 28, 2001
304
305
306
307
308
309
310
311
#define SKIPNONSPACE(p) \
do { \
while(!isspace((unsigned char)*(p)) && *p) \
++(p); \
} while(0)
/* read XPM from either array or RWops */
static SDL_Surface *load_xpm(char **xpm, SDL_RWops *src)
Nov 29, 2000
Nov 29, 2000
312
{
Jul 21, 2007
Jul 21, 2007
313
int start = 0;
Apr 28, 2001
Apr 28, 2001
314
SDL_Surface *image = NULL;
Nov 29, 2000
Nov 29, 2000
315
int index;
Dec 6, 2000
Dec 6, 2000
316
int x, y;
Nov 29, 2000
Nov 29, 2000
317
318
319
int w, h, ncolors, cpp;
int indexed;
Uint8 *dst;
Apr 28, 2001
Apr 28, 2001
320
struct color_hash *colors = NULL;
Dec 6, 2000
Dec 6, 2000
321
SDL_Color *im_colors = NULL;
Apr 28, 2001
Apr 28, 2001
322
323
324
325
326
char *keystrings = NULL, *nextkey;
char *line;
char ***xpmlines = NULL;
int pixels_len;
May 11, 2001
May 11, 2001
327
328
329
330
error = NULL;
linebuf = NULL;
buflen = 0;
Feb 13, 2007
Feb 13, 2007
331
332
if ( src )
start = SDL_RWtell(src);
Feb 4, 2006
Feb 4, 2006
333
Apr 28, 2001
Apr 28, 2001
334
335
336
337
338
339
if(xpm)
xpmlines = &xpm;
line = get_next_line(xpmlines, src, 0);
if(!line)
goto done;
Dec 6, 2000
Dec 6, 2000
340
341
342
343
344
345
346
347
348
/*
* The header string of an XPMv3 image has the format
*
* <width> <height> <ncolors> <cpp> [ <hotspot_x> <hotspot_y> ]
*
* where the hotspot coords are intended for mouse cursors.
* Right now we don't use the hotspots but it should be handled
* one day.
*/
Apr 28, 2001
Apr 28, 2001
349
if(sscanf(line, "%d %d %d %d", &w, &h, &ncolors, &cpp) != 4
Dec 6, 2000
Dec 6, 2000
350
|| w <= 0 || h <= 0 || ncolors <= 0 || cpp <= 0) {
Apr 28, 2001
Apr 28, 2001
351
352
error = "Invalid format description";
goto done;
Dec 6, 2000
Dec 6, 2000
353
}
Nov 29, 2000
Nov 29, 2000
354
Dec 6, 2000
Dec 6, 2000
355
356
keystrings = malloc(ncolors * cpp);
if(!keystrings) {
Apr 28, 2001
Apr 28, 2001
357
358
error = "Out of memory";
goto done;
Dec 6, 2000
Dec 6, 2000
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
}
nextkey = keystrings;
/* Create the new surface */
if(ncolors <= 256) {
indexed = 1;
image = SDL_CreateRGBSurface(SDL_SWSURFACE, w, h, 8,
0, 0, 0, 0);
im_colors = image->format->palette->colors;
image->format->palette->ncolors = ncolors;
} else {
indexed = 0;
image = SDL_CreateRGBSurface(SDL_SWSURFACE, w, h, 32,
0xff0000, 0x00ff00, 0x0000ff, 0);
}
if(!image) {
/* Hmm, some SDL error (out of memory?) */
Apr 28, 2001
Apr 28, 2001
376
goto done;
Dec 6, 2000
Dec 6, 2000
377
}
Nov 29, 2000
Nov 29, 2000
378
379
/* Read the colors */
Dec 6, 2000
Dec 6, 2000
380
colors = create_colorhash(ncolors);
Apr 28, 2001
Apr 28, 2001
381
if (!colors) {
Dec 6, 2000
Dec 6, 2000
382
383
error = "Out of memory";
goto done;
Nov 29, 2000
Nov 29, 2000
384
}
Dec 6, 2000
Dec 6, 2000
385
for(index = 0; index < ncolors; ++index ) {
Apr 28, 2001
Apr 28, 2001
386
387
388
389
char *p;
line = get_next_line(xpmlines, src, 0);
if(!line)
goto done;
Dec 6, 2000
Dec 6, 2000
390
Apr 28, 2001
Apr 28, 2001
391
p = line + cpp + 1;
Dec 6, 2000
Dec 6, 2000
392
393
394
395
396
/* parse a colour definition */
for(;;) {
char nametype;
char *colname;
Apr 28, 2001
Apr 28, 2001
397
398
399
400
401
Uint32 rgb, pixel;
SKIPSPACE(p);
if(!*p) {
error = "colour parse error";
Dec 6, 2000
Dec 6, 2000
402
goto done;
Nov 29, 2000
Nov 29, 2000
403
}
Apr 28, 2001
Apr 28, 2001
404
405
406
407
408
nametype = *p;
SKIPNONSPACE(p);
SKIPSPACE(p);
colname = p;
SKIPNONSPACE(p);
Dec 6, 2000
Dec 6, 2000
409
410
411
if(nametype == 's')
continue; /* skip symbolic colour names */
Apr 28, 2001
Apr 28, 2001
412
if(!color_to_rgb(colname, p - colname, &rgb))
Dec 6, 2000
Dec 6, 2000
413
414
continue;
Apr 28, 2001
Apr 28, 2001
415
memcpy(nextkey, line, cpp);
Dec 6, 2000
Dec 6, 2000
416
417
if(indexed) {
SDL_Color *c = im_colors + index;
May 11, 2006
May 11, 2006
418
419
420
c->r = (Uint8)(rgb >> 16);
c->g = (Uint8)(rgb >> 8);
c->b = (Uint8)(rgb);
Apr 28, 2001
Apr 28, 2001
421
pixel = index;
Dec 6, 2000
Dec 6, 2000
422
} else
Apr 28, 2001
Apr 28, 2001
423
424
pixel = rgb;
add_colorhash(colors, nextkey, cpp, pixel);
Dec 6, 2000
Dec 6, 2000
425
426
nextkey += cpp;
if(rgb == 0xffffffff)
Apr 28, 2001
Apr 28, 2001
427
SDL_SetColorKey(image, SDL_SRCCOLORKEY, pixel);
Dec 6, 2000
Dec 6, 2000
428
break;
Nov 29, 2000
Nov 29, 2000
429
430
431
432
}
}
/* Read the pixels */
Dec 6, 2000
Dec 6, 2000
433
434
pixels_len = w * cpp;
dst = image->pixels;
Apr 28, 2001
Apr 28, 2001
435
436
for(y = 0; y < h; y++) {
line = get_next_line(xpmlines, src, pixels_len);
Dec 6, 2000
Dec 6, 2000
437
438
439
440
if(indexed) {
/* optimization for some common cases */
if(cpp == 1)
for(x = 0; x < w; x++)
May 11, 2006
May 11, 2006
441
dst[x] = (Uint8)QUICK_COLORHASH(colors,
Apr 28, 2001
Apr 28, 2001
442
line + x);
Dec 6, 2000
Dec 6, 2000
443
444
else
for(x = 0; x < w; x++)
May 11, 2006
May 11, 2006
445
dst[x] = (Uint8)get_colorhash(colors,
Apr 28, 2001
Apr 28, 2001
446
line + x * cpp,
Dec 6, 2000
Dec 6, 2000
447
448
449
450
cpp);
} else {
for (x = 0; x < w; x++)
((Uint32*)dst)[x] = get_colorhash(colors,
Apr 28, 2001
Apr 28, 2001
451
line + x * cpp,
Dec 6, 2000
Dec 6, 2000
452
453
454
cpp);
}
dst += image->pitch;
Nov 29, 2000
Nov 29, 2000
455
}
Dec 6, 2000
Dec 6, 2000
456
Nov 29, 2000
Nov 29, 2000
457
done:
Dec 6, 2000
Dec 6, 2000
458
if(error) {
Feb 13, 2007
Feb 13, 2007
459
460
if ( src )
SDL_RWseek(src, start, SEEK_SET);
Feb 4, 2006
Feb 4, 2006
461
462
463
464
if ( image ) {
SDL_FreeSurface(image);
image = NULL;
}
Dec 6, 2000
Dec 6, 2000
465
466
467
IMG_SetError(error);
}
free(keystrings);
Nov 29, 2000
Nov 29, 2000
468
free_colorhash(colors);
Apr 28, 2001
Apr 28, 2001
469
free(linebuf);
Nov 29, 2000
Nov 29, 2000
470
471
472
return(image);
}
Apr 28, 2001
Apr 28, 2001
473
474
475
/* Load a XPM type image from an RWops datasource */
SDL_Surface *IMG_LoadXPM_RW(SDL_RWops *src)
{
Jan 4, 2004
Jan 4, 2004
476
477
478
479
if ( !src ) {
/* The error message has been set in SDL_RWFromFile */
return NULL;
}
Apr 28, 2001
Apr 28, 2001
480
481
482
483
484
485
486
487
488
return load_xpm(NULL, src);
}
SDL_Surface *IMG_ReadXPMFromArray(char **xpm)
{
return load_xpm(xpm, NULL);
}
#else /* not LOAD_XPM */
Nov 29, 2000
Nov 29, 2000
489
490
491
492
493
494
495
/* See if an image is contained in a data source */
int IMG_isXPM(SDL_RWops *src)
{
return(0);
}
Apr 28, 2001
Apr 28, 2001
496
Nov 29, 2000
Nov 29, 2000
497
498
499
500
501
502
/* Load a XPM type image from an SDL datasource */
SDL_Surface *IMG_LoadXPM_RW(SDL_RWops *src)
{
return(NULL);
}
Apr 28, 2001
Apr 28, 2001
503
504
505
506
507
SDL_Surface *IMG_ReadXPMFromArray(char **xpm)
{
return NULL;
}
#endif /* not LOAD_XPM */