/*以下是gif图形显示的源代码*/
/*运行格式 <文件名.exe> <gif图形文件路径及全名>*/
/*相关算法请参考本站的“算法及分析”。本程序没有做动画部分*/
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#include<dos.h>
#include<dir.h>
#include<mem.h>
typedef struct
{
unsigned char Signature[6];
unsigned int ScreenWidth;
unsigned int ScreenHeight;
unsigned char GlobalFlag;
unsigned char BackgroundColor;
unsigned char AspectRatio;
}GIFFILEHEADER;
typedef struct
{
char rgbblue;
char rgbgreen;
char rgbred;
} RGBQUAD;
typedef struct
{
unsigned char ImageLabe1;
unsigned int ImageLeft ;
unsigned int ImageTop ;
unsigned int ImageWidth ;
unsigned int ImageHighe ;
unsigned char LocalFlag ;
}IMGDATAHEADER;
int h,l,ptdataadd;
FILE *fp;
GIFFILEHEADER *fileheader;
setup_graph()
{
union REGS r;
r.h.ah=0;
r.h.al=0x13;
int86(0x10,&r,&r);
}
close_grap()
{
union REGS r;
r.h.ah=0x00;
r.h.al=0x03;
int86(0x10,&r,&r);
}
out_color(int x,int y,int color,int colorpage)
{
char far *as;
as=MK_FP(0xa000,x*320l);
as=as+y;
*as=(color&255);
}
void main(int argc,char *argv[])
{
unsigned char pat[256][3];
union REGS regs;
struct SREGS inreg;
int n,i;
char *chardata;
IMGDATAHEADER *dataheader;
struct RGBQUAD *gifcolor[256];
if(argc!=2)
{
printf("The parameter is error.");
exit(0);
}
fp=fopen(argv[1],"rb");
if(fp==NULL)
{
printf("File cannot be opened\n");
exit(1);
}
else
{
printf("Fill opened for reading\n");
printf("%d\n",*fp);
}
fread(fileheader,sizeof(GIFFILEHEADER),1,fp);
strcpy(chardata,fileheader->Signature);
*(chardata+6)='\0';
if(strcmp(chardata,"GIF87a"))
{
if(strcmp(chardata,"GIF89a"))
{
printf("This is not a gif file.");
exit(0);
}
}
setup_graph();
fseek(fp,13l,SEEK_SET);
for(i=0;i<=255;i++)
{
pat[i][0]=getc(fp)>>2;
pat[i][1]=getc(fp)>>2;
pat[i][2]=getc(fp)>>2;
}
regs.x.ax=0x1012;
regs.x.bx=0;
regs.x.cx=256;
regs.x.dx=FP_OFF(pat);
inreg.es=FP_SEG(pat);
int86x(0x10,®s,®s,&inreg);
if (getc(fp)==0x21){
printf("This file have not extension.");
getch();
exit(0);
}
fseek(fp,792l,SEEK_SET);
unpack(8);
fclose(fp);
close_grap();
clrscr();
getch();
clrscr();
exit(0);
}
int readbit(int n,int bits)
{
unsigned int number;
static unsigned long b=0,a=0;
static int data=0,yubit=0,bitindex=0;
static int cont=0;
static long jishu=0;
for(;yubit<bits;)
{
if(cont==0)
{
fseek(fp,792l+256l*(jishu++),SEEK_SET);
cont=fgetc(fp);
if(cont==0x3b)
{
close_grap();
getch();
exit(0);
}
}
a=0;
if(cont==EOF)
{
printf("\n\n\n\ncont: ");
/*printf("%d",cont);*/
getch();
close_grap();
fclose(fp);
clrscr();
exit (1);
}
a=getc(fp);
if(a==EOF)
{
printf("aaaaaaa");
getch();
exit (0);
}
cont--;
b=b+(a<<yubit);
yubit=yubit+8;
}
number=b&((1<<bits)-1);
b=b>>bits;
yubit=yubit-bits;
return number;
}
int unpack(int size)
{
int i,code,incode,oldcode,clear,eoi,len,next,zz;
int n=1,l1=0,h1=0;
union REGS ra;
unsigned char buff[3841];
struct{
int p;
unsigned char k;
}tree[4096];
int finchar=0;
int max;
clear=1<<size;
eoi=clear+1;
oldcode=-1;
eoi=clear+1;
len=size+1;
max=1<<len;
while((code=incode=readbit(0,len))!=eoi&&code>=0)
{
if(code==clear)
{
oldcode=-1;
next=clear+1;
len=size+1;
max=1<<len;
}
else{
i=0;
if(code>=next)
{
code=oldcode;
buff[i]=finchar;
i++;
}
finchar=code;
while(finchar>eoi)
{
buff[i]=tree[finchar].k;
finchar=tree[finchar].p;
i++;
}
buff[i++]=finchar;
for(zz=i;zz>0;zz--)
{
if(l1==fileheader->ScreenWidth)
{
l1=0;
h1++;
}
if(h1>=200)
{
bioskey(0);
return 0;
}
out_color(h1,l1,buff[zz-1],0);
l1++;
}
tree[next].p=oldcode;
tree[next].k=finchar;
next++;
if(next==max)
{
max<<=1;
len++;
if(len>12)
len=12;
}
oldcode=incode;
}
}
if(code==eoi)
{
if(readbit(1,1)==-2)
code=0;
else
code=-1;
}
return code;
}