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
|
//
// The loading routine for gif images was extracted from the gif-loader
// of the xv-package. It was enclosed into a C++-class and enhanced for some
// features to query possible extension data, which can be used to store
// the additional setup informations and copyright notes.
//
// Here is the original note, that once was contained in the loader
//
/*
* xvgif.c - GIF loading code for 'xv'. Based strongly on...
*
* gif2ras.c - Converts from a Compuserve GIF (tm) image to a Sun Raster image.
*
* Copyright (c) 1988, 1989 by Patrick J. Naughton
*
* Author: Patrick J. Naughton
* naughton@wind.sun.com
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appear in all copies and that
* both that copyright notice and this permission notice appear in
* supporting documentation.
*
* This file is provided AS IS with no warranties of any kind. The author
* shall have no liability with respect to the infringement of copyrights,
* trade secrets or any patents by this file or any part thereof. In no
* event will the author be liable for any lost revenue or profits or
* other special, indirect and consequential damages.
*
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "gif_image.H"
#define False 0
#define True 1
#define DEBUG 0
#define quiet 1
#define minpix 10
#define fastinfo_flag 0
void Extension::AddData( char *ndata, int nlen ) {
char *hdata=new char[len+nlen];
memcpy(hdata,data,len);
memcpy(hdata+len,ndata,nlen);
delete data;
len+=nlen;
data=hdata;
}
GifImage::GifImage(const char *filename, int autocrop )
: lockcount(0) {
first=0;
LoadGIF( filename );
name = strrchr(filename,'/');
if (name) name=strdup(name+1);
else name=strdup(filename);
if (autocrop&&!fastinfo_flag) CropImage();
}
GifImage::GifImage() {
first=0;
name=strdup("dummy");
lockcount=0;
ColorMapSize=128;
for (int i=0;i<128;i++) {
Red[i] = 255 * ((i>>5)&0x03) / 3;
Green[i] = 255 * ((i>>2)&0x07) / 7;
Blue[i] = 255 * (i&0x03) / 3;
}
width =1;
height=1;
data =(byte*)malloc(1);
}
GifImage::~GifImage() {
if (lockcount) {
fprintf( stderr, "ERROR: GifImage::~GifImage: image still locked\n" );
}
if (first) delete first;
free(name);
CloseGif();
}
const char *GifImage::GetExtensionData( unsigned char code ) {
Extension *current;
for (current=first;current;current=current->next) {
if (current->code==code) return current->data;
}
return 0;
}
int GifImage::GetColor(int id, unsigned short *red, unsigned short *green, unsigned short *blue) {
*red =Red[id] | Red[id]<<8;
*green=Green[id] | Green[id]<<8;
*blue =Blue[id] | Blue[id]<<8;
return 0;
}
void GifImage::Recolor( class GifImage *gif_p ) {
int mapper[256];
int i,j;
for (i=0;i<ColorMapSize;i++) {
int min_j = 0;
int min_d = 0x7fffffff;
for (j=0;j<gif_p->ColorMapSize;j++) {
int dr = (gif_p->Red[j] -Red[i]);
int dg = (gif_p->Green[j]-Green[i]);
int db = (gif_p->Blue[j] -Blue[i]);
int d = dr*dr + dg*dg + db*db;
if (d<min_d) {
min_d = d;
min_j = j;
}
}
mapper[i]=min_j;
}
for (i=0;i<width*height;i++) {
data[i] = mapper[data[i]];
}
for (j=0;j<gif_p->ColorMapSize;j++) {
Red[j] = gif_p->Red[j];
Green[j] = gif_p->Green[j];
Blue[j] = gif_p->Blue[j];
}
ColorMapSize = gif_p->ColorMapSize;
}
void GifImage::Rotate90() {
byte *ndata;
int help;
if (!(ndata = (byte *)malloc(width*height))) {
fprintf(stderr,"not enough memory to flip image");
exit(-1);
}
for (int y=0;y<height;y++) {
for (int x=0;x<width;x++) {
ndata[(height-y-1)+x*height] = data[x+y*width];
}
}
help=width; width=height; height=help;
free(data);
data=ndata;
}
void GifImage::AddAt( int x21, int y21, class GifImage *gif_p ) {
int x22=x21+gif_p->Width();
int y22=y21+gif_p->Height();
int nwidth,nheight;
byte *ndata=0;
if (x21>=0) {
if (x22>Width()) nwidth=x22;
else nwidth=Width();
}
else {
if (x22>Width()) nwidth=gif_p->Width();
else nwidth=(-x21)+Width();
}
if (y21>=0) {
if (y22>Height()) nheight=y22;
else nheight=Height();
}
else {
if (y22>Height()) nheight=gif_p->Height();
else nheight=(-y21)+Height();
}
if (nwidth>Width()||nheight>Height()) {
if (!(ndata = (byte *)malloc(nwidth*nheight))) {
fprintf(stderr,"not enough memory for image");
exit(-1);
}
/* move first image */
memset( ndata, 0, nwidth*nheight );
int offx = (x21<0)?-x21:0;
int offy = (y21<0)?-y21:0;
for (int y=0;y<Height();y++) {
memcpy( ndata+offx+(offy+y)*nwidth, data+y*Width(), Width() );
}
}
else ndata=data;
#if (0)
printf( "Colors1: %d\n", ColorMapSize );
printf( "Colors2: %d\n", gif_p->ColorMapSize );
for (int i=0;i<gif_p->ColorMapSize;i++) {
printf( "%3d: %02x %02x %02x %02x %02x %02x\n", i,
Red[i], Green[i], Blue[i],
gif_p->Red[i], gif_p->Green[i], gif_p->Blue[i] );
}
#endif
int offx = (x21>=0)?x21:0;
int offy = (y21>=0)?y21:0;
for (int y=0;y<gif_p->Height();y++) {
memcpy( ndata+offx+(offy+y)*nwidth, gif_p->data+y*gif_p->Width(), gif_p->Width() );
}
if (ndata!=data) {
free(data);
data = ndata;
height = nheight;
width = nwidth;
}
}
void GifImage::AddLock(class GifXImage * /*locker*/ ) {
lockcount++;
}
void GifImage::RemoveLock(class GifXImage * /*locker*/ ) {
if (!--lockcount) {
delete this;
}
}
void GifImage::GetSize( int *w, int *h ) {
*w = Width();
*h = Height();
}
long GifImage::GetAverageColor() {
long erg;
int i;
erg=0;
for (i=Width()*Height();i>0;i--) {
erg+=10*Red[*data];
erg+=5*Green[*data];
erg+=Blue[*data];
data++;
}
return erg;
}
#define IMAGESEP 0x2c
#define EXTENSION 0x21
#define INTERLACEMASK 0x40
#define COLORMAPMASK 0x80
#define ADDTOPIXEL(a) if (Quick) data[Offset++]=a; else AddToPixel(a)
#define ALLOCATED 3
static int BitOffset, /* Bit Offset of next code */
XC, YC, /* Output X and Y coords of current pixel */
Offset, /* Offset in output array */
Pass, /* Used by output routine if interlaced pic */
BytesPerScanline, /* bytes per scanline in output raster */
NumUsed, /* Number of colors really used */
CodeSize, /* Code size, read from GIF header */
ReadMask; /* Code AND mask for current code size */
static boolean Interlace;
static byte *Raster; /* The raster data stream, unblocked */
/* The GIF headers found in the file */
static byte gifheader[13];
static byte imageheader[9];
static byte colormap[3*256];
/* The hash table used by the decompressor */
static int Prefix[4096];
static int Suffix[4096];
/* An output array used by the decompressor */
static byte OutCode[1025];
/* The color map, read from the GIF header */
static byte used[256];
static char id[] = "GIF";
/*****************************/
int GifImage::LoadGIF(const char *fname)
/*****************************/
{
register byte ch;
FILE *fp;
BitOffset = 0, /* Bit Offset of next code */
XC = 0, YC = 0, /* Output X and Y coords of current pixel */
Offset = 0, /* Offset in output array */
Pass = 0; /* Used by output routine if interlaced pic */
ColorMapSize = 0;
data = NULL;
fp = fopen(fname,"rb");
if (!fp) {
fprintf(stderr,"'%s': File not found\n", fname);
exit(0);
}
if ( (fread(gifheader, sizeof(gifheader), 1, fp)!=1)
|| ( (strncmp((char*)gifheader, id, 3)!=0)
&& (strncmp((char*)gifheader, "FIG", 3)!=0) ) )
{ fprintf(stderr,"'%s' not a GIF file\n", fname );
exit(1);
}
if (strncmp((char*)gifheader+3, "87a", 3) && strncmp((char*)gifheader+3,"89a",3))
fprintf(stderr,"Warning: %s contains unknown version %c%c%c",fname,
gifheader[3],gifheader[4],gifheader[5]);
HasColormap = ((gifheader[10] & COLORMAPMASK) ? True : False);
ColorMapSize = 1 << (gifheader[10]&7)+1;
Background = gifheader[11]; /* background color... not used. */
/* Read in global colormap. */
if (HasColormap) ReadColormap(fp);
/* Check for image extension */
while ((ch=getc(fp)) == EXTENSION)
{
char buffer[256];
first=new Extension(getc(fp),first);
while ((ch=getc(fp))>0) {
fread(buffer,ch,1,fp);
first->AddData(buffer,ch);
}
}
if (ch != IMAGESEP) {
fprintf(stderr,"'%s': corrupt GIF file (no image separator) '%x'\n", fname, ch);
return 1;
}
fread(imageheader,sizeof(imageheader),1,fp);
width = imageheader[4] + 0x100 * imageheader[5];
height = imageheader[6] + 0x100 * imageheader[7];
if (!quiet || fastinfo_flag) {
printf("%s: %d x %d x %d\n", fname, Width(), Height(), ColorMapSize);
fclose(fp);
return 1;
}
Interlace = ((imageheader[8] & INTERLACEMASK) ? True : False);
if (imageheader[8] & COLORMAPMASK)
{
HasColormap = True;
ColorMapSize = 1 << (imageheader[8]&7)+1;
ReadColormap(fp);
}
CodeSize = getc(fp);
ReadImageData(fp);
fclose(fp);
DecodeImage();
return 0;
}
int GifImage::ReadImageData(FILE *fp)
{
/* Read the raster data. Here we just transpose it from the GIF array
* to the Raster array, turning it from a series of blocks into one long
* data stream, which makes life much easier for ReadCode().
*/
long filesize, filepos;
int ch;
byte *ptr1;
/* find the size of the file */
filepos = ftell(fp);
fseek(fp, 0L, 2);
filesize = ftell(fp)-filepos;
fseek(fp, filepos, 0);
if (!(Raster = (byte *) malloc((unsigned)filesize))) {
fprintf(stderr,"Not enough memory to store gif data");
exit(-1);
}
ptr1 = Raster;
while ((ch = getc(fp))>0)
{
if (fread(ptr1, 1, ch, fp)<(unsigned)ch)
fprintf(stderr,"corrupt GIF file (unblock)\n");
ptr1 += ch;
}
return 0;
}
int GifImage::CropImage(int x1,int y1, int x2, int y2) {
int w = x2-x1;
int h = y2-y1;
if (x1<0 || x2>width || w<0 || y1<0 || y2>height || h<0) {
fprintf(stderr,"unable to crop (%d,%d)-(%d,%d)\n", x1,y1,x2,y2);
fprintf(stderr,"image size: %dx%d\n", width, height );
exit(-1);
}
for (int i=0;i<h;i++) {
memmove(data+i*w,data+(i+y1)*Width()+x1,w);
}
width = w;
height = h;
return 0;
}
int GifImage::CropImage() {
int i,j;
int b;
int x1,x2,y1,y2;
byte *ptr;
long d;
b=*data;
d=0x7fffffff;
for (i=0;i<256;i++) {
if (Red[i]+Green[i]+Blue[i]<d) {
b=i;
d=Red[i]+Green[i]+Blue[i];
}
}
x1=-1; x2=Width();
y1=-1; y2=Height();
for (i=0; i<Height(); i++) {
int flag[256];
int count=0;
ptr = data + (i*Width());
for (j=0;j<256;j++) flag[j]=0;
for (j=0; j<Width(); j++,ptr++) {
if (!flag[*ptr]) {
flag[*ptr]++;
if (++count>=minpix) break;
}
}
if (count>=minpix) break;
y1=i;
}
for (i=Height()-1;i>=0; i--) {
int flag[256];
int count=0;
ptr = data + (i*Width());
for (j=0;j<256;j++) flag[j]=0;
for (j=0; j<Width(); j++,ptr++) {
if (!flag[*ptr]) {
flag[*ptr]++;
if (++count>=minpix) break;
}
}
if (count>=minpix) break;
y2=i;
}
for (i=0; i<Width(); i++) {
int flag[256];
int count=0;
ptr = data + i;
for (j=0;j<256;j++) flag[j]=0;
for (j=0; j<Height(); j++,ptr+=Width()) {
if (!flag[*ptr]) {
flag[*ptr]++;
if (++count>=minpix) break;
}
}
if (count>=minpix) break;
x1=i;
}
for (i=Width()-1;i>=0;i--) {
int flag[256];
int count=0;
ptr = data + i;
for (j=0;j<256;j++) flag[j]=0;
for (j=0; j<Height(); j++,ptr+=Width()) {
if (!flag[*ptr]) {
flag[*ptr]++;
if (++count>=minpix) break;
}
}
if (count>=minpix) break;
x2=i;
}
x1++; x2--; y1++; y2--;
if (x2<=x1||y2<=y1) return 1;
CropImage(x1,y1,x2,y2);
return 0;
}
int GifImage::DecodeImage()
{
/* Start reading the raster data. First we get the intial code size
* and compute decompressor constant values, based on this code size.
*/
int Quick, /* True, when not interlaced and local Cmap */
InitCodeSize, /* Starting code size, used during Clear */
InCode, /* Value returned by ReadCode */
MaxCode, /* limiting value for current code size */
ClearCode, /* GIF clear code */
EOFCode, /* GIF end-of-information code */
CurCode, OldCode = 0, /* Decompressor variables */
FreeCode, /* Decompressor, next free slot in hashtable */
OutCount = 0, /* Decompressor output 'stack count' */
FinChar = 0, /* Decompressor variable */
BitMask; /* AND mask for data size */
BitMask = ColorMapSize - 1;
ClearCode = (1 << CodeSize);
EOFCode = ClearCode + 1;
FreeCode = ClearCode + 2;
/* The GIF spec has it that the code size is the code size used to
* compute the above values is the code size given in the file, but the
* code size used in compression/decompression is the code size given in
* the file plus one. (thus the ++).
*/
CodeSize++;
InitCodeSize = CodeSize;
MaxCode = (1 << CodeSize);
ReadMask = MaxCode - 1;
/* Allocate the X Image */
if (!(data = (byte *) malloc(Width()*Height()))) {
fprintf(stderr,"not enough memory for image");
exit(-1);
}
#if (0)
if (!(theImage = XCreateImage(theDisp, theVisual, 8, ZPixmap, 0, (char*)Image,
Width(), Height(), 8, Width()))) {
fprintf(stderr,"unable to create XImage");
return -1;
}
#endif
BytesPerScanline = Width();
/* Decompress the file, continuing until you see the GIF EOF code.
* One obvious enhancement is to add checking for corrupt files here.
*/
Quick = !Interlace;
Offset = 0;
if (DEBUG) fprintf(stderr,"Decoding...\n");
InCode = ReadCode();
while (InCode != EOFCode) {
/* Clear code sets everything back to its initial value, then reads the
* immediately subsequent code as uncompressed data.
*/
if (InCode == ClearCode) {
CodeSize = InitCodeSize;
MaxCode = (1 << CodeSize);
ReadMask = MaxCode - 1;
FreeCode = ClearCode + 2;
CurCode = OldCode = InCode = ReadCode();
FinChar = CurCode & BitMask;
ADDTOPIXEL(FinChar);
}
else {
/* If not a clear code, then must be data: save same as CurCode */
CurCode = InCode;
/* If greater or equal to FreeCode, not in the hash table yet;
* repeat the last character decoded
*/
if (CurCode >= FreeCode) {
CurCode = OldCode;
OutCode[OutCount++] = FinChar;
}
/* Unless this code is raw data, pursue the chain pointed to by CurCode
* through the hash table to its end; each code in the chain puts its
* associated output code on the output queue.
*/
while (CurCode > BitMask) {
if (OutCount >= 1024) {
fprintf(stderr,"\nCorrupt GIF file (OutCount)!\n");
exit(1);
}
OutCode[OutCount++] = Suffix[CurCode];
CurCode = Prefix[CurCode];
}
/* The last code in the chain is treated as raw data. */
/* OutCode[OutCount++] = FinChar = CurCode &BitMask*/;
FinChar = CurCode & BitMask;
ADDTOPIXEL(FinChar);
/* Now we put the data out to the Output routine.
* It's been stacked LIFO, so deal with it that way... */
while (OutCount>0)
ADDTOPIXEL(OutCode[--OutCount]);
/* Build the hash table on-the-fly. No table is stored in the file. */
Prefix[FreeCode] = OldCode;
Suffix[FreeCode] = FinChar;
OldCode = InCode;
/* Point to the next slot in the table. If we exceed the current
* MaxCode value, increment the code size unless it's already 12. If it
* is, do nothing: the next code decompressed better be CLEAR
*/
FreeCode++;
if (FreeCode >= MaxCode) {
if (CodeSize < 12) {
CodeSize++;
MaxCode *= 2;
ReadMask = (1 << CodeSize) - 1;
}
}
}
InCode = ReadCode();
}
free(Raster);
return 0;
}
/* Fetch the next code from the raster data stream. The codes can be
* any length from 3 to 12 bits, packed into 8-bit bytes, so we have to
* maintain our location in the Raster array as a BIT Offset. We compute
* the byte Offset into the raster array by dividing this by 8, pick up
* three bytes, compute the bit Offset into our 24-bit chunk, shift to
* bring the desired code to the bottom, then mask it off and return it.
*/
int GifImage::ReadCode()
{
int RawCode, ByteOffset, BitShift;
ByteOffset = BitOffset / 8;
BitShift = BitOffset % 8;
BitOffset += CodeSize;
if (BitShift+CodeSize<8)
return (Raster[ByteOffset]>>BitShift) & ReadMask;
else
{
RawCode = Raster[ByteOffset] + (0x100 * Raster[ByteOffset + 1]);
if (BitShift+CodeSize >= 16)
RawCode += (0x10000 * Raster[ByteOffset + 2]);
return((RawCode>>BitShift) & ReadMask);
}
}
void GifImage::AddToPixel(byte Index)
{
if (YC<Height()) /* Might be of importance when reading interlaced gifs */
data[YC*BytesPerScanline+XC] = Index;
if (!used[Index]) { used[Index]=True; NumUsed++; }
if (++XC == Width())
{
XC = 0;
if (Interlace)
{
switch (Pass)
{
case 0: YC += 8; if (YC >= Height()) { Pass++; YC = 4; } break;
case 1: YC += 8; if (YC >= Height()) { Pass++; YC = 2; } break;
case 2: YC += 4; if (YC >= Height()) { Pass++; YC = 1; } break;
case 3: YC += 2; break;
default: break;
}
}
else
YC++;
}
}
void GifImage::ReadColormap(FILE *fp)
{
byte *ptr=colormap;
int i;
if (DEBUG) fprintf(stderr,"Reading Color map...\n");
fread(colormap, ColorMapSize, 3, fp);
for (i = 0; i < ColorMapSize; i++) {
Red[i] = (*ptr++);
Green[i] = (*ptr++);
Blue[i] = (*ptr++);
used[i] = 0;
}
NumUsed=0;
}
void GifImage::CloseGif()
{
#if (0)
if (LocalCmap)
{
XFreeColormap(theDisp, LocalCmap);
LocalCmap=0;
}
else
{
int i,j;
unsigned long pixels[256];
for (j=i=0;i<ColorMapSize;i++)
if (used[i]==ALLOCATED)
pixels[j++]=cols[i];
XFreeColors(theDisp, theCmap, pixels, j, 0L);
}
#endif
if (data)
{
free(data);
data=NULL;
}
}
|