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
|
/*
Functions to allocate and deallocate structures and structure data
By Jim Frost 1989.09.29, Bryan Henderson 2006.03.25.
See COPYRIGHT file for copyright information.
*/
#include <assert.h>
#include "pm_c_util.h"
#include "mallocvar.h"
#include "nstring.h"
#include "pam.h"
#include "image.h"
/* this table is useful for quick conversions between depth and ncolors */
static unsigned long const DepthToColorsTable[] = {
/* 0 */ 1,
/* 1 */ 2,
/* 2 */ 4,
/* 3 */ 8,
/* 4 */ 16,
/* 5 */ 32,
/* 6 */ 64,
/* 7 */ 128,
/* 8 */ 256,
/* 9 */ 512,
/* 10 */ 1024,
/* 11 */ 2048,
/* 12 */ 4096,
/* 13 */ 8192,
/* 14 */ 16384,
/* 15 */ 32768,
/* 16 */ 65536,
/* 17 */ 131072,
/* 18 */ 262144,
/* 19 */ 524288,
/* 20 */ 1048576,
/* 21 */ 2097152,
/* 22 */ 4194304,
/* 23 */ 8388608,
/* 24 */ 16777216,
/* 25 */ 33554432,
/* 26 */ 67108864,
/* 27 */ 134217728,
/* 28 */ 268435456,
/* 29 */ 536870912,
/* 30 */ 1073741824,
/* 31 */ 2147483648u,
/* 32 */ 2147483648u /* bigger than unsigned int; this is good enough */
};
unsigned int
depthToColors(unsigned int const depth) {
return DepthToColorsTable[MIN(depth,32)];
}
unsigned long
colorsToDepth(unsigned long const ncolors) {
unsigned long a;
for (a = 0; (a < 32) && (DepthToColorsTable[a] < ncolors); ++a)
/* EMPTY */
;
return a ;
}
void
assertGoodImage(Image * const imageP) {
assert(imageP != NULL);
switch (imageP->type) {
case IBITMAP:
case IRGB:
case ITRUE:
break;
default:
assert(FALSE); /* can't be */
}
}
static void
newRGBMapData(RGBMap * const rgbP,
unsigned int const size) {
rgbP->used = 0;
rgbP->size = size;
rgbP->compressed = FALSE;
MALLOCARRAY(rgbP->red, size);
MALLOCARRAY(rgbP->grn, size);
MALLOCARRAY(rgbP->blu, size);
if (rgbP->red == NULL || rgbP->grn == NULL || rgbP->blu == NULL)
pm_error("Out of memory allocating %u pixels", size);
}
static void
freeRGBMapData(RGBMap * const rgbP) {
free(rgbP->red);
free(rgbP->grn);
free(rgbP->blu);
}
Image *
newBitImage(unsigned int const width,
unsigned int const height) {
unsigned int const linelen = (width + 7) / 8;
Image * imageP;
MALLOCVAR_NOFAIL(imageP);
imageP->type = IBITMAP;
newRGBMapData(&imageP->rgb, 2);
imageP->rgb.red[0] = imageP->rgb.grn[0] = imageP->rgb.blu[0] = 65535;
imageP->rgb.red[1] = imageP->rgb.grn[1] = imageP->rgb.blu[1] = 0;
imageP->rgb.used = 2;
imageP->width = width;
imageP->height = height;
imageP->depth = 1;
if (UINT_MAX / linelen < height)
pm_error("Image dimensions too big to compute: %u x %u",
linelen, height);
MALLOCARRAY(imageP->data, linelen * height);
if (imageP->data == NULL)
pm_error("Out of memory allocating array of %u x %u", linelen, height);
return imageP;
}
Image *
newRGBImage(unsigned int const width,
unsigned int const height,
unsigned int const depth) {
unsigned int const pixlen = depth > 0 ? (depth + 7) / 8 : 1;
/* Special case for "zero" depth image, which is sometimes
interpreted as "one color"
*/
unsigned int const numcolors = depthToColors(depth);
Image * imageP;
MALLOCVAR_NOFAIL(imageP);
imageP->type = IRGB;
newRGBMapData(&imageP->rgb, numcolors);
imageP->width = width;
imageP->height = height;
imageP->depth = depth;
imageP->pixlen = pixlen;
if (UINT_MAX / width / height < pixlen)
pm_error("Image dimensions %u x %u x %u are too big to compute.",
width, height, pixlen);
MALLOCARRAY(imageP->data, width * height * pixlen);
if (imageP->data == NULL)
pm_error("Unable to allocate %u x %u x %u raster array",
width, height, pixlen);
return imageP;
}
Image *
newTrueImage(unsigned int const width,
unsigned int const height) {
unsigned int const pixlen = 3;
Image * imageP;
MALLOCVAR_NOFAIL(imageP);
imageP->type = ITRUE;
imageP->rgb.used = 0;
imageP->rgb.size = 0;
imageP->width = width;
imageP->height = height;
imageP->depth = 24;
imageP->pixlen = 3;
if (UINT_MAX / width / height < pixlen)
pm_error("Image dimensions %u x %u x %u are too big to compute.",
width, height, pixlen);
MALLOCARRAY(imageP->data, width * height * pixlen);
if (imageP->data == NULL)
pm_error("Unable to allocate %u x %u x %u raster array",
width, height, pixlen);
return imageP;
}
static void
freeImageData(Image * const imageP) {
if (!TRUEP(imageP))
freeRGBMapData(&imageP->rgb);
free(imageP->data);
}
void
freeImage(Image * const imageP) {
assertGoodImage(imageP);
freeImageData(imageP);
imageP->type = IBAD;
free(imageP);
}
|
