-
Notifications
You must be signed in to change notification settings - Fork 1
/
readbmp.c
1196 lines (1081 loc) · 30.1 KB
/
readbmp.c
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
/*
* Reprinted Dr. Dobb's Journal, (C) 1995.
*
* This file contains mid-level functions for reading bitmap structures and
* high-level functions that read bitmap files.
*/
/*****************************************************************************
*
* Mid-level functions.
*
* These functions read in the various structures defined in bmptypes.h. Each
* function assumes that the file pointer is positioned at the start of the
* given structure. Upon completion, each function will leave the file
* pointer positioned on the byte immediately following the structure. Return
* values will be 0 for success and non-zero for failure. In all cases, a
* return value of non-zero means that the file position has been left in an
* indeterminate state and further reading should not be attempted.
*/
/*
* Read a BITMAPFILEHEADER structure.
*/
int readBitmapFileHeader(FILE *fp, BITMAPFILEHEADER *bfh)
{
int rc;
rc = readUINT16little(fp, &(bfh->type));
if (rc != 0)
return rc;
rc = readUINT32little(fp, &(bfh->size));
if (rc != 0)
return rc;
rc = readINT16little(fp, &(bfh->xHotspot));
if (rc != 0)
return rc;
rc = readINT16little(fp, &(bfh->yHotspot));
if (rc != 0)
return rc;
rc = readUINT32little(fp, &(bfh->offsetToBits));
return rc;
}
/*
* Read a BITMAPARRAYHEADER
*/
int readBitmapArrayHeader(FILE *fp, BITMAPARRAYHEADER *bah)
{
int rc;
rc = readUINT16little(fp, &(bah->type));
if (rc != 0)
return rc;
rc = readUINT32little(fp, &(bah->size));
if (rc != 0)
return rc;
rc = readUINT32little(fp, &(bah->next));
if (rc != 0)
return rc;
rc = readUINT16little(fp, &(bah->screenWidth));
if (rc != 0)
return rc;
rc = readUINT16little(fp, &(bah->screenHeight));
return rc;
}
/*
* Read the BITMAPHEADER structure. This one requires a bit of sanity
* checking. The length of the structure on the disk is specified in the
* first field. We must stop reading after that many bytes, and if that value
* is longer than sizeof(BITMAPHEADER), we must skip over any leftover bytes.
* Finally, if size is 12, then width an height are really 16-bit values, and
* we have to read them differently so they'll be properly stored in the
* 32-bit fields BITMAPHEADER uses.
*/
int readBitmapHeader(FILE *fp, BITMAPHEADER *bh)
{
int rc, oldFormat, bytesRead;
UINT16 tempVal;
/*
* Clear the structure. Default values for all fields are zeros. This
* will prevent garbage from being returned if the structure is truncated
* on disk.
*/
memset(bh, 0, sizeof(BITMAPHEADER));
/*
* Read the size of the structure. From here on in, we'll have to be sure
* we don't read more bytes than this value.
*/
rc = readUINT32little(fp, &(bh->size));
if (rc != 0)
return rc;
bytesRead = 4;
/*
* If the size is 12 bytes or less, than this is an "old format"
* structure. So the width and height fields will have to be read
* differently.
*/
if (bh->size <= 12)
oldFormat = 1;
else
oldFormat = 0;
/*
* Width and height are read differently for old and new format files. In
* the old format, they're 16-bit values. In the new format, they're
* 32-bits long.
*/
if (oldFormat)
{
rc = (int) readINT16little(fp, &tempVal);
if (rc != 0)
return rc;
bh->width = tempVal;
bytesRead += 2;
}
else
{
rc = readINT32little(fp, &(bh->width));
if (rc != 0)
return rc;
bytesRead += 4;
}
if (bytesRead >= bh->size)
return 0;
if (oldFormat)
{
rc = (int) readINT16little(fp, &tempVal);
if (rc != 0)
return rc;
bh->height = tempVal;
bytesRead += 2;
}
else
{
rc = readINT32little(fp, &(bh->height));
if (rc != 0)
return rc;
bytesRead += 4;
}
if (bytesRead >= bh->size)
return 0;
/*
* From this point on, old and new formats are identical to each other,
* and we can proceed as if there was no difference. For each field, we
* read it in and increment the count of bytes read. If at any time we
* have read the amount we got earlier (in the size field), then stop and
* leave the rest of the fields as zeros.
*/
rc = readUINT16little(fp, &(bh->numBitPlanes));
if (rc != 0)
return rc;
bytesRead += 2;
if (bytesRead >= bh->size)
return 0;
rc = readUINT16little(fp, &(bh->numBitsPerPlane));
if (rc != 0)
return rc;
bytesRead += 2;
if (bytesRead >= bh->size)
return 0;
/*
* Old format stop here. But we don't have to check, because in that
* format, 12 bytes have been read and the function will have exited
* without any extra checking.
*/
rc = readUINT32little(fp, &(bh->compressionScheme));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->sizeOfImageData));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->xResolution));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->yResolution));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->numColorsUsed));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->numImportantColors));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT16little(fp, &(bh->resolutionUnits));
if (rc != 0)
return rc;
bytesRead += 2;
if (bytesRead >= bh->size)
return 0;
rc = readUINT16little(fp, &(bh->padding));
if (rc != 0)
return rc;
bytesRead += 2;
if (bytesRead >= bh->size)
return 0;
rc = readUINT16little(fp, &(bh->origin));
if (rc != 0)
return rc;
bytesRead += 2;
if (bytesRead >= bh->size)
return 0;
rc = readUINT16little(fp, &(bh->halftoning));
if (rc != 0)
return rc;
bytesRead += 2;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->halftoningParam1));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->halftoningParam2));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->colorEncoding));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
rc = readUINT32little(fp, &(bh->identifier));
if (rc != 0)
return rc;
bytesRead += 4;
if (bytesRead >= bh->size)
return 0;
/*
* If there are more bytes in the file than this, then the file is using a
* future format that doesn't exist yet. Skip over the bytes. Assuming
* this future format somewhat resembles what we know now, ignoring the
* fields will be safe. We _MUST_ skip them, though, since the color
* table begins on the byte after this structure, and we have to position
* the file pointer there.
*/
return fseek(fp, (bh->size - bytesRead), SEEK_CUR);
}
/*
* readRgb reads in a single RGB structure from the disk. The numBytes field
* indicates how many bytes the field occupies on the disk. It assumes that
* each component is one byte on disk and the rest is padding. This will
* compensate for the old/new differences in color tables. (Old format
* bitmaps use 3 bytes per entry, while new format bitmaps use 4.) Note how
* it will never read more than the number of bytes requested.
*/
int readRgb(FILE *fp, RGB *rgb, int numBytes)
{
int rc;
if (numBytes == 0)
return 0;
rc = readUINT8little(fp, &(rgb->blue));
if (rc != 0)
return rc;
if (numBytes == 1)
return 0;
rc = readUINT8little(fp, &(rgb->green));
if (rc != 0)
return rc;
if (numBytes == 2)
return 0;
rc = readUINT8little(fp, &(rgb->red));
if (rc != 0)
return rc;
if (numBytes == 3)
return 0;
/* Skip over extra bytes if more than three were requested */
return fseek(fp, (numBytes - 3), SEEK_CUR);
}
/*
* A color table is a block of RGB structures, all the same size. Read it by
* calling readRgb repeatedly.
*/
int readColorTable(FILE *fp, RGB *rgb, int numEntries, int numBytesPerEntry)
{
int i, rc;
for (i=0; i<numEntries; i++)
{
rc = readRgb(fp, &(rgb[i]), numBytesPerEntry);
if (rc != 0)
return rc;
}
return 0;
}
/*
* ReadBitsUncompressed. Reads pixel values into an array of RGB
* values. It assmes that there is no compression. Note that there we're
* only handling bit depths of 1, 4, 8, 16, and 24. Note that OS/2 bitmaps
* can (in theory) have any number of bits per pixel, so you might find a
* strange bitmap file that this can't handle, but the chances of finding such
* a file this are nearly zero.
*
* Each row of pixels is always padded to a 4-byte boundary.
*/
int readBitsUncompressed(FILE *fp, RGB *image, int width, int height,
int depth, RGB *colorTable)
{
UINT8 temp;
int rc, padBytes, i;
long row, column, pixel, value;
switch (depth) {
case 1:
/*
* For 1 bit per pixel, each byte is 8 pixels. Each one is an index
* into the color table (1 or 0). Most significant byte first. All
* is padded to 32-bit boundaries as well.
*/
pixel = 0;
if (((width % 32) == 0) || ((width % 32) > 24))
padBytes = 0;
else if ((width % 32) <= 8)
padBytes = 3;
else if ((width % 32) <= 16)
padBytes = 2;
else
padBytes = 1;
for (row = height; row > 0; row--)
{
for (column = width; column > 0; column -= 8)
{
rc = (int) readINT8little(fp, &temp);
if (rc != 0)
return rc;
for (i=0; i < ((column < 8) ? column : 8); i++)
{
/*
* For each byte read, bit-decompose it. Note that the
* last byte on a row could have less than 8 bits used.
* Most significant bits come first.
*/
value = ((temp & (1 << (7-i))) == 0) ? 0 : 1;
image[pixel].red = colorTable[value].red;
image[pixel].green = colorTable[value].green;
image[pixel].blue = colorTable[value].blue;
pixel++;
}
}
if (padBytes != 0)
{
rc = fseek(fp, padBytes, SEEK_CUR);
if (rc != 0)
return rc;
}
}
break;
case 4:
/*
* For 4 bits per pixel, each byte is two pixels. The upper half go to
* the first pixel, and the lower half to the second.
*/
pixel = 0;
if (((width % 8) == 0) || ((width % 8) > 6))
padBytes = 0;
else if ((width % 8) <= 2)
padBytes = 3;
else if ((width % 8) <= 4)
padBytes = 2;
else
padBytes = 1;
for (row = height; row > 0; row--)
{
for (column = width; column > 0; column -= 2)
{
/*
* Each byte here is two pixels. Note that the last byte on a
* row may only contain one pixel.
*/
rc = readUINT8little(fp, &temp);
if (rc != 0)
return rc;
/*
* First pixel is the upper 4 bits
*/
value = temp >> 4;
image[pixel].red = colorTable[value].red;
image[pixel].green = colorTable[value].green;
image[pixel].blue = colorTable[value].blue;
pixel++;
/*
* Second pixel is lower 4 bits. If this is the last byte in
* the row, and there are an odd number of pixels per row, then
* this is not valid data.
*/
if (column == 1)
{
value = temp & 0x0f;
image[pixel].red = colorTable[value].red;
image[pixel].green = colorTable[value].green;
image[pixel].blue = colorTable[value].blue;
pixel++;
}
}
if (padBytes != 0)
{
rc = fseek(fp, padBytes, SEEK_CUR);
if (rc != 0)
return rc;
}
}
break;
case 8:
/*
* For 8 bits per pixel, each byte is one pixel.
*/
pixel = 0;
padBytes = ((width % 4) == 0) ? 0 : (4 - (width % 4));
for (row=height; row > 0; row--)
{
for (column=width; column > 0; column--)
{
rc = readUINT8little(fp, &temp);
if (rc != 0)
return rc;
image[pixel].red = colorTable[temp].red;
image[pixel].green = colorTable[temp].green;
image[pixel].blue = colorTable[temp].blue;
pixel++;
}
if (padBytes != 0)
{
rc = fseek(fp, padBytes, SEEK_CUR);
if (rc != 0)
return rc;
}
}
break;
case 16:
/*
* For 16 bits per pixel, you must read two bytes per pixel. But
* there's a catch. The data is big endian! This is because all pixel
* data (for all formats, actually) is stored as a packed array,
* stored in pixel order.
*/
pixel = 0;
padBytes = ((width % 2) == 0) ? 0 : 2;
for (row=height; row > 0; row--)
{
for (column=width; column > 0; column--)
{
/*
* Read a 16-bit integer as big endian. Do this by reading
* two bytes and mathematically combine them. After that,
* proceed as usual.
*/
rc = readUINT8little(fp, &temp);
if (rc != 0)
return rc;
value = ((long)temp) << 8;
rc = readUINT8little(fp, &temp);
if (rc != 0)
return rc;
value |= temp;
image[pixel].red = colorTable[value].red;
image[pixel].green = colorTable[value].green;
image[pixel].blue = colorTable[value].blue;
pixel++;
}
if (padBytes != 0)
{
rc = fseek(fp, padBytes, SEEK_CUR);
if (rc != 0)
return rc;
}
}
break;
case 24:
/*
* For 24 bits per pixel, it's an RGB structure. Note that the color
* table is ignore for bit depths greater than 24 bits.
*/
pixel = 0;
padBytes = width % 4;
for (row=height; row > 0; row--)
{
for (column=width; column > 0; column--)
{
rc = readRgb(fp, image+pixel, 3);
pixel++;
}
if (padBytes != 0)
{
rc = fseek(fp, padBytes, SEEK_CUR);
if (rc != 0)
return rc;
}
}
break;
}
return 0;
}
/*
* ReadMaskBitsUncompressed. Reads a monochrome mask into an array of
* characters. It assmes that there is no compression. This is very similar
* (internally) to the readBitsUncompressed function. Note that if the data
* read isn't really one-bit-deep data, you'll probably get garbage back.
*/
int readMaskBitsUncompressed(FILE *fp, char *image, int width, int height)
{
UINT8 temp;
int rc, padBytes, i;
long row, column, pixel;
char value;
/*
* see the one-bit-depth part of readBitsUncompressed for comments
*/
pixel = 0;
if (((width % 32) == 0) || ((width % 32) > 24))
padBytes = 0;
else if ((width % 32) <= 8)
padBytes = 3;
else if ((width % 32) <= 16)
padBytes = 2;
else
padBytes = 1;
for (row = height; row > 0; row--)
{
for (column = width; column > 0; column -= 8)
{
rc = (int) readINT8little(fp, &temp);
if (rc != 0)
return rc;
for (i=0; i < ((column < 8) ? column : 8); i++)
{
value = ((temp & (1 << (7-i))) == 0) ? 0 : 1;
image[pixel] = value;
pixel++;
}
}
if (padBytes != 0)
{
rc = fseek(fp, padBytes, SEEK_CUR);
if (rc != 0)
return rc;
}
}
return 0;
}
/*
* reflectYRGB takes an array of RGB vales and the dimensions they represent
* and flips it vertically. This will convert a bottom-left origin array to a
* top-left origin array.
*/
void reflectYRGB(RGB *image, int width, int height)
{
int row, col;
RGB temp;
for (row = 0; row < (height / 2); row++)
{
for (col = 0; col < width; col++)
{
/* Swap pixels at (x,y) with (x,height-y) */
memcpy(&temp, image+(row * width + col), sizeof(RGB));
memcpy(image+(row * width + col),
image+((height - row - 1) * width + col), sizeof(RGB));
memcpy(image+((height - row - 1) * width + col), &temp,
sizeof(RGB));
}
}
}
/*
* reflectYchar takes an array of char values and the dimensions they
* represent and flips it vertically. This will convert a bottom-left origin
* array to a top-left origin array.
*/
void reflectYchar(char *image, int width, int height)
{
int row, col;
char temp;
for (row = 0; row < (height / 2); row++)
{
for (col = 0; col < width; col++)
{
/* Swap values at (x,y) with (x,height-y) */
temp = image[row * width + col];
image[row * width + col]=image[(height - row - 1) * width + col];
image[(height - row - 1) * width + col] = temp;
}
}
}
/*****************************************************************************
*
* High-level functions
*
* These functions read in specific types of bitmap files. Each assumes that
* the file pointer is positioned at the appropriate place in a bitmap file.
* (At the start of a BITMAPFILEHEADER for all functions except
* readMultipleImages, which assumes the file pointer to be positioned on the
* start of a BITMAPARRAYHEADER. These functions will leave the file pointer
* on the byte after the image's color table.
*
* The coordinate speaces in the returned arrays will have an upper-left
* origin. As before, a non-zero return value indicates that something went
* wrong.
*
* Note that the BMP and mono-ICO functions will not return 1000 if the image
* is of type color-icon. This is because a color icon consists of a bitmap
* and a monochrome icon.
*
* return values:
* 0 - success
* 1000 - incorrect file type for the routine called
* 1001 - image data out of range or damaged file
* 1002 - good data, but the routine called can't handle it (yet)
* 1003 - out of memory allocating color table
* 1004 - out of memory allocating image
* 1005 - out of memory allocating image arrays
* 1006 - Illegal image type in a multi-image array
*
* other - I/O error of some kind
*/
/*
* readSingleImageBMP will read a single BMP image and generate an array of RGB
* triples that contain the RGB values for every pixel. It will also return
* the dimensions of the image.
*/
int readSingleImageBMP(FILE *fp, RGB **argb, UINT32 *width, UINT32 *height)
{
BITMAPFILEHEADER bfh;
BITMAPHEADER bh;
RGB *colorTable, *image;
int rc, depth, inverted;
long numColors, numPixels, endPos;
/*
* First, get the file header and sanity check it. The type field must be
* TYPE_BMP or we're aborting.
*/
rc = readBitmapFileHeader(fp, &bfh);
if (rc != 0)
return rc;
if ((bfh.type != TYPE_BMP) &&
(bfh.type != TYPE_ICO_COLOR) &&
(bfh.type != TYPE_PTR_COLOR))
return 1000;
/*
* Immediately following a file header is always the bitmap header. Read
* it. Sanity check any values we might need. Specifically, less than
* 32-bit depth, known compression scheme, known origin, and known color
* encoding, and valid height/width. Note that negative height is OK,
* that indicates an upper-left origin for a Windows bitmap.
*/
rc = readBitmapHeader(fp, &bh);
if (rc != 0)
return rc;
depth = bh.numBitPlanes * bh.numBitsPerPlane;
if ((depth > 32) ||
(bh.compressionScheme > COMPRESSION_LAST) ||
(bh.origin > ORIGIN_LAST) ||
(bh.colorEncoding > COLOR_ENCODING_LAST) ||
(bh.width < 1) ||
(bh.height == 0))
return 1001;
/*
* If the height is negative, then this is a Windows bitmap whose origin
* is the upper-left corner and not the lower-left. The inverted flag
* indicates a lower-left origin. Our code will be outputting an
* upper-left origin pixel array.
*/
if (bh.height < 0)
{
inverted = 0;
bh.height = -bh.height;
}
else
inverted = 1;
/*
* Now, sanity check a few fields that are valid, but I don't have code to
* deal with them yet. This includes: more than one bit plane, any
* compression scheme, and bit depths that are not 1, 4, 8, 16, or 24.
*/
if ((bh.numBitPlanes > 1) ||
((bh.numBitsPerPlane != 1) &&
(bh.numBitsPerPlane != 4) &&
(bh.numBitsPerPlane != 8) &&
(bh.numBitsPerPlane != 16) &&
(bh.numBitsPerPlane != 24)) ||
(bh.compressionScheme != COMPRESSION_NONE))
return 1002;
/*
* Allocate and read the color table. The file pointer has been
* positioned in the right place by the readBitmapHeader function. Note
* that images with 24-bits or more color depth have no color table. They
* are already RGB. When reading the color table, be sure to check for
* old/new format bitmaps.
*/
if (depth < 24)
{
numColors = 1 << depth;
colorTable = (RGB *)calloc(numColors, sizeof(RGB));
if (colorTable == NULL)
return 1003;
if (bh.size <= 12)
rc = readColorTable(fp, colorTable, numColors, 3);
else
rc = readColorTable(fp, colorTable, numColors, 4);
if (rc != 0)
{
free(colorTable);
return rc;
}
}
/*
* We're at the end of the color table. Preserve this position. We'll
* need to leave the file pointer there before returning from this
* function.
*/
endPos = ftell(fp);
/*
* Allocate the array of pixels and fill it in.
*/
numPixels = bh.width * bh.height;
image = (RGB *)calloc(numPixels, sizeof(RGB));
if (image == NULL)
{
free (colorTable);
return 1004;
}
/*
* Seek to the bits
*/
rc = fseek(fp, bfh.offsetToBits, SEEK_SET);
if (rc != 0)
{
free (colorTable);
free (image);
return rc;
}
/*
* Read the bits. If code for decompressing bits should be written,
* insert the call here.
*/
switch (bh.compressionScheme) {
case COMPRESSION_NONE:
rc = readBitsUncompressed(fp, image, bh.width, bh.height, depth,
colorTable);
break;
}
if (rc != 0)
{
free(image);
return rc;
}
/*
* If the origin is lower-left, flip the image upside down
*/
if (inverted)
reflectYRGB(image, bh.width, bh.height);
/*
* Return the output values. Set the file pointer to the byte after the
* color table.
*/
*argb = image;
*width = bh.width;
*height = bh.height;
fseek(fp, endPos, SEEK_SET);
/*
* Clean up and return. Note that we don't return the color table. This
* is because we're returning an array of RGB values for the image - such
* a table would be redundant.
*/
/*if (colorTable != NULL)
free(colorTable);
printf("Freed the color table\n");*/
return 0;
}
/*
* Read in a monochrome OS/2 icon/pointer. return two arrays of bytes
* (interpreted as booleans) for the XOR and AND masks.
*/
int readSingleImageICOPTR(FILE *fp, char **xorMask, char **andMask,
UINT32 *width, UINT32 *height)
{
BITMAPFILEHEADER bfh;
BITMAPHEADER bh;
char *mask1, *mask2;
int rc;
long numPixels, endPos;
/*
* Read and sanity check the header. Monochrom OS/2 icons are TYPE_ICO.
* Monochrome pointers are TYPE_PTR. Color ICO and PTR is also allowed,
* because monochrome masks are part of those images.
*/
rc = readBitmapFileHeader(fp, &bfh);
if (rc != 0)
return rc;
if ((bfh.type != TYPE_ICO) &&
(bfh.type != TYPE_PTR) &&
(bfh.type != TYPE_ICO_COLOR) &&
(bfh.type != TYPE_PTR_COLOR))
return 1000;
/*
* Now read the bitmap data and sanity check it. Since this is a
* monochrome icon, bit depth must be 1. Additionally, a known
* compression scheme, known origin, known color encoding, and valid
* height/width. Height can't be less than 0, as it can with color
* images, since this code is only used on for OS/2-type images.
*/
rc = readBitmapHeader(fp, &bh);
if (rc != 0)
return rc;
if ((bh.numBitPlanes != 1) ||
(bh.numBitsPerPlane != 1) ||
(bh.compressionScheme > COMPRESSION_LAST) ||
(bh.origin > ORIGIN_LAST) ||
(bh.colorEncoding > COLOR_ENCODING_LAST) ||
(bh.width < 1) ||
(bh.height < 1))
return 1001;
/*
* Sanity check some valid fields that I can't deal with yet.
*/
if (bh.compressionScheme != COMPRESSION_NONE)
return 1002;
/*
* Skip over the color table, since this is a monochrome mask. Note that
* the size is already known - 2 entries - which is 6 or 8 bytes.
* this isn't, and we don't.
*/
if (bh.size <= 12)
rc = fseek(fp, 6, SEEK_CUR);
else
rc = fseek(fp, 8, SEEK_CUR);
if (rc != 0)
{
return rc;
}
/*
* Save this file position. we'll have to seek back to it after reading
* in the image data.
*/
endPos = ftell(fp);
/*
* The image is actually two images. The top half is an AND mask and the
* bottom half is an XOR mask. Allocate the images.
*/
numPixels = bh.width * bh.height / 2;
mask1 = (char *)malloc(numPixels);
if (mask1 == NULL)
return 1004;
mask2 = (char *)malloc(numPixels);
if (mask2 == NULL)
{
free(mask1);
return 1004;
}
/*
* Seek to the bit data
*/
rc = fseek(fp, bfh.offsetToBits, SEEK_SET);
if (rc != 0)
{
free (mask1);
free (mask2);
return rc;
}
/*
* Read in the bits. Note: since these are really two images, two calls
* to readMaskBitsUncompressed are made, and the height used is 1/2 the
* height mentioned in the header.
*/
switch (bh.compressionScheme) {
case COMPRESSION_NONE:
rc = readMaskBitsUncompressed(fp, mask1, bh.width, bh.height/2);
if (rc == 0)
rc = readMaskBitsUncompressed(fp, mask2, bh.width, bh.height/2);
break;
}
if (rc != 0)
{
free (mask1);
free (mask2);
return rc;
}
/*
* A mask will never have an upper-left origin, since Windows will never
* produce one in a bitmap file.
*/
reflectYchar(mask1, bh.width, bh.height / 2);
reflectYchar(mask2, bh.width, bh.height / 2);
/*
* Return everything we've read.
*/
*xorMask = mask1;
*andMask = mask2;
*width = bh.width;
*height = bh.height / 2;
fseek(fp, endPos, SEEK_SET);
return 0;