278 lines
6.6 KiB
C++
278 lines
6.6 KiB
C++
/*
|
|
* Portions of this file are copyright Rebirth contributors and licensed as
|
|
* described in COPYING.txt.
|
|
* Portions of this file are copyright Parallax Software and licensed
|
|
* according to the Parallax license below.
|
|
* See COPYING.txt for license details.
|
|
|
|
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-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
|
|
*/
|
|
|
|
/*
|
|
*
|
|
* Graphical routines for manipulating grs_bitmaps.
|
|
*
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include "u_mem.h"
|
|
#include "gr.h"
|
|
#include "grdef.h"
|
|
#include "dxxerror.h"
|
|
#ifdef OGL
|
|
#include "ogl_init.h"
|
|
#endif
|
|
#include "bitmap.h"
|
|
|
|
void gr_set_bitmap_data (grs_bitmap *bm, unsigned char *data)
|
|
{
|
|
#ifdef OGL
|
|
ogl_freebmtexture(bm);
|
|
#endif
|
|
bm->bm_data = data;
|
|
}
|
|
|
|
grs_bitmap *gr_create_bitmap(int w, int h )
|
|
{
|
|
unsigned char *d;
|
|
MALLOC(d, unsigned char, MAX_BMP_SIZE(w, h));
|
|
return gr_create_bitmap_raw (w, h, d);
|
|
}
|
|
|
|
grs_bitmap *gr_create_bitmap_raw(int w, int h, unsigned char * raw_data )
|
|
{
|
|
grs_bitmap *n;
|
|
|
|
MALLOC(n, grs_bitmap, 1);
|
|
gr_init_bitmap (n, 0, 0, 0, w, h, w, raw_data);
|
|
|
|
return n;
|
|
}
|
|
|
|
|
|
void gr_init_bitmap( grs_bitmap *bm, int mode, int x, int y, int w, int h, int bytesperline, unsigned char * data ) // TODO: virtualize
|
|
{
|
|
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 = NULL;
|
|
#ifdef OGL
|
|
bm->bm_parent=NULL;bm->gltexture=NULL;
|
|
#endif
|
|
gr_set_bitmap_data (bm, data);
|
|
}
|
|
|
|
void gr_init_bitmap_alloc( grs_bitmap *bm, int mode, int x, int y, int w, int h, int bytesperline)
|
|
{
|
|
gr_init_bitmap(bm, mode, x, y, w, h, bytesperline, 0);
|
|
unsigned char *d;
|
|
MALLOC(d, unsigned char, MAX_BMP_SIZE(w, h));
|
|
gr_set_bitmap_data(bm, d);
|
|
}
|
|
|
|
void gr_init_bitmap_data (grs_bitmap *bm) // TODO: virtulize
|
|
{
|
|
bm->bm_data = NULL;
|
|
bm->bm_parent=NULL;
|
|
#ifdef OGL
|
|
bm->gltexture=NULL;
|
|
#endif
|
|
}
|
|
|
|
grs_bitmap *gr_create_sub_bitmap(grs_bitmap *bm, int x, int y, int w, int h )
|
|
{
|
|
grs_bitmap *n;
|
|
|
|
MALLOC(n, grs_bitmap, 1);
|
|
gr_init_sub_bitmap (n, bm, x, y, w, h);
|
|
|
|
return n;
|
|
}
|
|
|
|
void gr_free_bitmap(grs_bitmap *bm )
|
|
{
|
|
gr_free_bitmap_data (bm);
|
|
if (bm!=NULL)
|
|
d_free(bm);
|
|
}
|
|
|
|
void gr_free_sub_bitmap(grs_bitmap *bm )
|
|
{
|
|
if (bm!=NULL)
|
|
{
|
|
d_free(bm);
|
|
}
|
|
}
|
|
|
|
|
|
void gr_free_bitmap_data (grs_bitmap *bm) // TODO: virtulize
|
|
{
|
|
#ifdef OGL
|
|
ogl_freebmtexture(bm);
|
|
#endif
|
|
if (bm->bm_data != NULL)
|
|
d_free (bm->bm_data);
|
|
bm->bm_data = NULL;
|
|
}
|
|
|
|
void gr_init_sub_bitmap (grs_bitmap *bm, grs_bitmap *bmParent, int x, int y, int w, int h ) // TODO: virtualize
|
|
{
|
|
bm->bm_x = x + bmParent->bm_x;
|
|
bm->bm_y = y + bmParent->bm_y;
|
|
bm->bm_w = w;
|
|
bm->bm_h = h;
|
|
bm->bm_flags = bmParent->bm_flags;
|
|
bm->bm_type = bmParent->bm_type;
|
|
bm->bm_rowsize = bmParent->bm_rowsize;
|
|
|
|
#ifdef OGL
|
|
bm->gltexture=bmParent->gltexture;
|
|
#endif
|
|
bm->bm_parent=bmParent;
|
|
bm->bm_data = bmParent->bm_data+(unsigned int)((y*bmParent->bm_rowsize)+x);
|
|
}
|
|
|
|
void decode_data(ubyte *data, int num_pixels, ubyte *colormap, int *count)
|
|
{
|
|
int i;
|
|
ubyte mapped;
|
|
|
|
for (i = 0; i < num_pixels; i++) {
|
|
count[*data]++;
|
|
mapped = *data;
|
|
*data = colormap[mapped];
|
|
data++;
|
|
}
|
|
}
|
|
|
|
void gr_set_bitmap_flags (grs_bitmap *pbm, int flags)
|
|
{
|
|
pbm->bm_flags = flags;
|
|
}
|
|
|
|
void gr_set_transparent (grs_bitmap *pbm, int bTransparent)
|
|
{
|
|
if (bTransparent)
|
|
{
|
|
gr_set_bitmap_flags (pbm, pbm->bm_flags | BM_FLAG_TRANSPARENT);
|
|
}
|
|
else
|
|
{
|
|
gr_set_bitmap_flags (pbm, pbm->bm_flags & ~BM_FLAG_TRANSPARENT);
|
|
}
|
|
}
|
|
|
|
void gr_set_super_transparent (grs_bitmap *pbm, int bTransparent)
|
|
{
|
|
if (bTransparent)
|
|
{
|
|
gr_set_bitmap_flags (pbm, pbm->bm_flags & ~BM_FLAG_SUPER_TRANSPARENT);
|
|
}
|
|
else
|
|
{
|
|
gr_set_bitmap_flags (pbm, pbm->bm_flags | BM_FLAG_SUPER_TRANSPARENT);
|
|
}
|
|
}
|
|
|
|
void build_colormap_good( palette_array_t &palette, ubyte * colormap, int * freq )
|
|
{
|
|
int i, r, g, b;
|
|
|
|
for (i=0; i < 256; i++ ) {
|
|
r = palette[i].r;
|
|
g = palette[i].g;
|
|
b = palette[i].b;
|
|
*colormap++ = gr_find_closest_color( r, g, b );
|
|
*freq++ = 0;
|
|
}
|
|
}
|
|
|
|
void gr_remap_bitmap( grs_bitmap * bmp, palette_array_t &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(bmp->bm_data, bmp->bm_w * bmp->bm_h, colormap, freq );
|
|
|
|
if ( (transparent_color>=0) && (transparent_color<=255) && (freq[transparent_color]>0) )
|
|
gr_set_transparent (bmp, 1);
|
|
|
|
if ( (super_transparent_color>=0) && (super_transparent_color<=255) && (freq[super_transparent_color]>0) )
|
|
gr_set_super_transparent (bmp, 0);
|
|
}
|
|
|
|
void gr_remap_bitmap_good( grs_bitmap * bmp, palette_array_t &palette, int transparent_color, int super_transparent_color )
|
|
{
|
|
ubyte colormap[256];
|
|
int freq[256];
|
|
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(bmp->bm_data, bmp->bm_w * bmp->bm_h, colormap, freq );
|
|
else {
|
|
int y;
|
|
ubyte *p = bmp->bm_data;
|
|
for (y=0;y<bmp->bm_h;y++,p+=bmp->bm_rowsize)
|
|
decode_data(p, bmp->bm_w, colormap, freq );
|
|
}
|
|
|
|
if ( (transparent_color>=0) && (transparent_color<=255) && (freq[transparent_color]>0) )
|
|
gr_set_transparent (bmp, 1);
|
|
|
|
if ( (super_transparent_color>=0) && (super_transparent_color<=255) && (freq[super_transparent_color]>0) )
|
|
gr_set_super_transparent (bmp, 1);
|
|
}
|
|
|
|
void gr_bitmap_check_transparency( grs_bitmap * bmp )
|
|
{
|
|
int x, y;
|
|
ubyte * data;
|
|
|
|
data = bmp->bm_data;
|
|
|
|
for (y=0; y<bmp->bm_h; y++ ) {
|
|
for (x=0; x<bmp->bm_w; x++ ) {
|
|
if (*data++ == TRANSPARENCY_COLOR ) {
|
|
gr_set_transparent (bmp, 1);
|
|
return;
|
|
}
|
|
}
|
|
data += bmp->bm_rowsize - bmp->bm_w;
|
|
}
|
|
|
|
bmp->bm_flags = 0;
|
|
}
|