/* THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE. COPYRIGHT 1993-1999 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED. */ #include #include #include #include "pa_enabl.h" //$$POLY_ACC #include "mem.h" #include "error.h" #include "gr.h" #include "grdef.h" #if defined(POLY_ACC) #include "poly_acc.h" #endif grs_bitmap *gr_create_bitmap(int w, int h ) { grs_bitmap *new; new = (grs_bitmap *)malloc( sizeof(grs_bitmap) ); new->bm_x = 0; new->bm_y = 0; new->bm_w = w; new->bm_h = h; new->bm_type = 0; new->bm_flags = 0; new->bm_rowsize = w; new->bm_handle = 0; new->bm_data = (unsigned char *)malloc( w*h ); return new; } grs_bitmap *gr_create_bitmap_raw(int w, int h, unsigned char * raw_data ) { grs_bitmap *new; new = (grs_bitmap *)malloc( sizeof(grs_bitmap) ); new->bm_x = 0; new->bm_y = 0; new->bm_w = w; new->bm_h = h; new->bm_flags = 0; new->bm_type = 0; new->bm_rowsize = w; new->bm_data = raw_data; new->bm_handle = 0; return new; } #if defined(POLY_ACC) // // Creates a bitmap of the requested size and type. // w, and h are in pixels. // type is a BM_... and is used to set the rowsize. // if data is NULL, memory is allocated, otherwise data is used for bm_data. // // This function is used only by the polygon accelerator code to handle the mixture of 15bit and // 8bit bitmaps. // grs_bitmap *gr_create_bitmap2(int w, int h, int type, void *data ) { grs_bitmap *new; new = (grs_bitmap *)malloc( sizeof(grs_bitmap) ); new->bm_x = 0; new->bm_y = 0; new->bm_w = w; new->bm_h = h; new->bm_flags = 0; new->bm_type = type; switch(type) { case BM_LINEAR: new->bm_rowsize = w; break; case BM_LINEAR15: new->bm_rowsize = w*PA_BPP; break; default: Int3(); // unsupported type. } if(data) new->bm_data = data; else new->bm_data = malloc(new->bm_rowsize * new->bm_h); new->bm_handle = 0; return new; } #endif void gr_init_bitmap( grs_bitmap *bm, int mode, int x, int y, int w, int h, int bytesperline, unsigned char * data ) { bm->bm_x = x; bm->bm_y = y; bm->bm_w = w; bm->bm_h = h; bm->bm_flags = 0; bm->bm_type = mode; bm->bm_rowsize = bytesperline; bm->bm_data = data; bm->bm_handle = 0; } grs_bitmap *gr_create_sub_bitmap(grs_bitmap *bm, int x, int y, int w, int h ) { grs_bitmap *new; new = (grs_bitmap *)malloc( sizeof(grs_bitmap) ); new->bm_x = x+bm->bm_x; new->bm_y = y+bm->bm_y; new->bm_w = w; new->bm_h = h; new->bm_flags = bm->bm_flags; new->bm_type = bm->bm_type; new->bm_rowsize = bm->bm_rowsize; new->bm_data = bm->bm_data+(unsigned int)((y*bm->bm_rowsize)+x); new->bm_handle = 0; return new; } void gr_free_bitmap(grs_bitmap *bm ) { if (bm->bm_data != NULL) free(bm->bm_data); bm->bm_data = NULL; if (bm != NULL) free(bm); } void gr_free_sub_bitmap(grs_bitmap *bm ) { if (bm != NULL) free(bm); } //NO_INVERSE_TABLE void build_colormap_asm( ubyte * palette, ubyte * cmap, int * count ); //NO_INVERSE_TABLE #pragma aux build_colormap_asm parm [esi] [edi] [edx] modify exact [eax ebx ecx edx esi edi] = \ //NO_INVERSE_TABLE "mov ecx, 256" \ //NO_INVERSE_TABLE "xor eax,eax" \ //NO_INVERSE_TABLE "again2x:" \ //NO_INVERSE_TABLE "mov al,[esi]" \ //NO_INVERSE_TABLE "inc esi" \ //NO_INVERSE_TABLE "shr eax, 1" \ //NO_INVERSE_TABLE "shl eax, 5" \ //NO_INVERSE_TABLE "mov bl,[esi]" \ //NO_INVERSE_TABLE "inc esi" \ //NO_INVERSE_TABLE "shr bl, 1" \ //NO_INVERSE_TABLE "or al, bl" \ //NO_INVERSE_TABLE "shl eax, 5" \ //NO_INVERSE_TABLE "mov bl,[esi]" \ //NO_INVERSE_TABLE "inc esi" \ //NO_INVERSE_TABLE "shr bl, 1" \ //NO_INVERSE_TABLE "or al, bl" \ //NO_INVERSE_TABLE "mov al, gr_inverse_table[eax]" \ //NO_INVERSE_TABLE "mov [edi], al" \ //NO_INVERSE_TABLE "inc edi" \ //NO_INVERSE_TABLE "xor eax,eax" \ //NO_INVERSE_TABLE "mov [edx], eax" \ //NO_INVERSE_TABLE "add edx, 4" \ //NO_INVERSE_TABLE "dec ecx" \ //NO_INVERSE_TABLE "jne again2x" \ void decode_data_asm(ubyte *data, int num_pixels, ubyte * colormap, int * count ); #ifndef MACINTOSH #pragma aux decode_data_asm parm [esi] [ecx] [edi] [ebx] modify exact [esi edi eax ebx ecx] = \ "again_ddn:" \ "xor eax,eax" \ "mov al,[esi]" \ "inc dword ptr [ebx+eax*4]" \ "mov al,[edi+eax]" \ "mov [esi],al" \ "inc esi" \ "dec ecx" \ "jne again_ddn" #else void decode_data_asm(ubyte *data, int num_pixels, ubyte *colormap, int *count) { int i; for (i = 0; i < num_pixels; i++) { count[*data]++; *data = colormap[*data]; data++; } } #endif void build_colormap_good( ubyte * palette, ubyte * colormap, int * freq ) { int i, r, g, b; for (i=0; i<256; i++ ) { r = *palette++; g = *palette++; b = *palette++; *colormap++ = gr_find_closest_color( r, g, b ); *freq++ = 0; } } void gr_remap_bitmap( grs_bitmap * bmp, ubyte * palette, int transparent_color, int super_transparent_color ) { ubyte colormap[256]; int freq[256]; if (bmp->bm_type != BM_LINEAR) return; //can't do it // This should be build_colormap_asm, but we're not using invert table, so... build_colormap_good( palette, colormap, freq ); if ( (super_transparent_color>=0) && (super_transparent_color<=255)) colormap[super_transparent_color] = 254; if ( (transparent_color>=0) && (transparent_color<=255)) colormap[transparent_color] = TRANSPARENCY_COLOR; decode_data_asm(bmp->bm_data, bmp->bm_w * bmp->bm_h, colormap, freq ); if ( (transparent_color>=0) && (transparent_color<=255) && (freq[transparent_color]>0) ) bmp->bm_flags |= BM_FLAG_TRANSPARENT; if ( (super_transparent_color>=0) && (super_transparent_color<=255) && (freq[super_transparent_color]>0) ) bmp->bm_flags |= BM_FLAG_SUPER_TRANSPARENT; } void gr_remap_bitmap_good( grs_bitmap * bmp, ubyte * palette, int transparent_color, int super_transparent_color ) { ubyte colormap[256]; int freq[256]; if (bmp->bm_type != BM_LINEAR) { Int3(); return; //can't do it } build_colormap_good( palette, colormap, freq ); if ( (super_transparent_color>=0) && (super_transparent_color<=255)) colormap[super_transparent_color] = 254; if ( (transparent_color>=0) && (transparent_color<=255)) colormap[transparent_color] = TRANSPARENCY_COLOR; if (bmp->bm_w == bmp->bm_rowsize) decode_data_asm(bmp->bm_data, bmp->bm_w * bmp->bm_h, colormap, freq ); else { int y; ubyte *p = bmp->bm_data; for (y=0;ybm_h;y++,p+=bmp->bm_rowsize) decode_data_asm(p, bmp->bm_w, colormap, freq ); } if ( (transparent_color>=0) && (transparent_color<=255) && (freq[transparent_color]>0) ) bmp->bm_flags |= BM_FLAG_TRANSPARENT; if ( (super_transparent_color>=0) && (super_transparent_color<=255) && (freq[super_transparent_color]>0) ) bmp->bm_flags |= BM_FLAG_SUPER_TRANSPARENT; } void gr_bitmap_check_transparency( grs_bitmap * bmp ) { int x, y; ubyte * data; data = bmp->bm_data; for (y=0; ybm_h; y++ ) { for (x=0; xbm_w; x++ ) { if (*data++ == TRANSPARENCY_COLOR ) { bmp->bm_flags = BM_FLAG_TRANSPARENT; return; } } data += bmp->bm_rowsize - bmp->bm_w; } bmp->bm_flags = 0; }