1 /* $Id: rle.c,v 1.21 2005-08-02 06:15:08 chris Exp $ */
3 THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
4 SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
5 END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
6 ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
7 IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
8 SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
9 FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
10 CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
11 AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
12 COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
17 * Routines to do run length encoding/decoding
28 static char rcsid[] = "$Id: rle.c,v 1.21 2005-08-02 06:15:08 chris Exp $";
48 #define NOT_RLE_CODE 31
50 #define IS_RLE_CODE(x) (((x) & RLE_CODE) == RLE_CODE)
52 #if !defined(NO_ASM) && defined(__WATCOMC__)
53 #define RLE_DECODE_ASM
55 ubyte *gr_rle_decode_asm( ubyte * src, ubyte * dest );
56 #pragma aux gr_rle_decode_asm parm [esi] [edi] value [edi] modify exact [eax ebx ecx edx esi edi] = \
92 #elif !defined(NO_ASM) && defined(__GNUC__)
93 #define RLE_DECODE_ASM
95 static inline int gr_rle_decode_asm( ubyte * src, ubyte * dest ) {
98 __asm__ __volatile__ (
100 " xorl %%ecx, %%ecx;"
103 " movb %%al,(%%edi);"
106 " movb (%%esi), %%al;"
115 " movb (%%esi), %%al;"
121 " movb %%al, (%%edi);"
125 : "=D" (__ret), "=S" (dummy) : "1" (src), "D" (dest) : "%eax", "%ecx");
129 #elif !defined(NO_ASM) && defined(_MSC_VER)
130 #define RLE_DECODE_ASM
132 __inline int gr_rle_decode_asm( ubyte * src, ubyte * dest )
173 #ifdef RLE_DECODE_ASM
176 void gr_rle_decode( ubyte * src, ubyte * dest, int dest_len )
180 dest_end = (ubyte *)gr_rle_decode_asm( src, dest );
182 Assert(dest_end-src < dest_len);
185 void gr_rle_decode( ubyte * src, ubyte * dest )
187 gr_rle_decode_asm( src, dest );
191 #else // NO_ASM or unknown compiler
193 void gr_rle_decode( ubyte * src, ubyte * dest )
196 ubyte data, count = 0;
200 if ( ! IS_RLE_CODE(data) ) {
203 count = data & NOT_RLE_CODE;
207 for (i = 0; i < count; i++)
215 void rle_stosb (unsigned char *dest, int len, int color);
217 #if !defined(NO_ASM) && defined(__WATCOMC__)
219 #pragma aux rle_stosb = "cld rep stosb" parm [edi] [ecx] [eax] modify exact [edi ecx];
221 #elif !defined(NO_ASM) && defined(__GNUC__)
223 inline void rle_stosb (unsigned char *dest, int len, int color) {
225 __asm__ __volatile__ (
227 : "=D" (dummy[0]), "=c" (dummy[1])
228 : "0" (dest), "1" (len), "a" (color) );
231 #elif !defined(NO_ASM) && defined(_MSC_VER)
233 __inline void rle_stosb (unsigned char *dest, int len, int color)
244 #else // NO_ASM or unknown compiler
246 void rle_stosb (unsigned char *dest, int len, int color)
249 for (i=0; i<len; i++ )
255 // Given pointer to start of one scanline of rle data, uncompress it to
256 // dest, from source pixels x1 to x2.
257 void gr_rle_expand_scanline_masked( ubyte *dest, ubyte *src, int x1, int x2 )
263 if ( x2 < x1 ) return;
268 if ( color == RLE_CODE ) return;
269 if ( IS_RLE_CODE(color) ) {
270 count = color & (~RLE_CODE);
280 // we know have '*count' pixels of 'color'.
282 if ( x1+count > x2 ) {
284 if ( color != TRANSPARENCY_COLOR ) rle_stosb( dest, count, color );
288 if ( color != TRANSPARENCY_COLOR ) rle_stosb( dest, count, color );
294 if ( color == RLE_CODE ) return;
295 if ( IS_RLE_CODE(color) ) {
296 count = color & (~RLE_CODE);
302 // we know have '*count' pixels of 'color'.
303 if ( i+count <= x2 ) {
304 if ( color != TRANSPARENCY_COLOR )rle_stosb( dest, count, color );
309 if ( color != TRANSPARENCY_COLOR )rle_stosb( dest, count, color );
317 void gr_rle_expand_scanline( ubyte *dest, ubyte *src, int x1, int x2 )
323 if ( x2 < x1 ) return;
328 if ( color == RLE_CODE ) return;
329 if ( IS_RLE_CODE(color) ) {
330 count = color & (~RLE_CODE);
340 // we know have '*count' pixels of 'color'.
342 if ( x1+count > x2 ) {
344 rle_stosb( dest, count, color );
348 rle_stosb( dest, count, color );
354 if ( color == RLE_CODE ) return;
355 if ( IS_RLE_CODE(color) ) {
356 count = color & (~RLE_CODE);
362 // we know have '*count' pixels of 'color'.
363 if ( i+count <= x2 ) {
364 rle_stosb( dest, count, color );
369 rle_stosb( dest, count, color );
377 int gr_rle_encode( int org_size, ubyte *src, ubyte *dest )
388 for (i=1; i<org_size; i++ ) {
392 if ( (count==1) && (! IS_RLE_CODE(oc)) ) {
394 Assert( oc != RLE_CODE );
405 if ( count == NOT_RLE_CODE ) {
413 if ( (count==1) && (! IS_RLE_CODE(oc)) ) {
415 Assert( oc != RLE_CODE );
424 return dest-dest_start;
428 int gr_rle_getsize( int org_size, ubyte *src )
438 for (i=1; i<org_size; i++ ) {
442 if ( (count==1) && (! IS_RLE_CODE(oc)) ) {
453 if ( count == NOT_RLE_CODE ) {
460 if ( (count==1) && (! IS_RLE_CODE(oc)) ) {
472 int gr_bitmap_rle_compress( grs_bitmap * bmp )
479 // first must check to see if this is large bitmap.
481 for (y=0; y<bmp->bm_h; y++ ) {
482 d1= gr_rle_getsize( bmp->bm_w, &bmp->bm_data[bmp->bm_w*y] );
489 rle_data=d_malloc( MAX_BMP_SIZE(bmp->bm_w, bmp->bm_h) );
490 if (rle_data==NULL) return 0;
492 doffset = 4 + bmp->bm_h;
494 doffset = 4 + (2 * bmp->bm_h); // each row of rle'd bitmap has short instead of byte offset now
496 for (y=0; y<bmp->bm_h; y++ ) {
497 d1= gr_rle_getsize( bmp->bm_w, &bmp->bm_data[bmp->bm_w*y] );
498 if ( ((doffset+d1) > bmp->bm_w*bmp->bm_h) || (d1 > (large_rle?32767:255) ) ) {
502 d = gr_rle_encode( bmp->bm_w, &bmp->bm_data[bmp->bm_w*y], &rle_data[doffset] );
506 *((short *)&(rle_data[(y*2)+4])) = (short)d;
510 //mprintf( 0, "Bitmap of size %dx%d, (%d bytes) went down to %d bytes\n", bmp->bm_w, bmp->bm_h, bmp->bm_h*bmp->bm_w, doffset );
511 memcpy( rle_data, &doffset, 4 );
512 memcpy( bmp->bm_data, rle_data, doffset );
514 bmp->bm_flags |= BM_FLAG_RLE;
516 bmp->bm_flags |= BM_FLAG_RLE_BIG;
520 #define MAX_CACHE_BITMAPS 32
522 typedef struct rle_cache_element {
523 grs_bitmap * rle_bitmap;
525 grs_bitmap * expanded_bitmap;
529 int rle_cache_initialized = 0;
532 rle_cache_element rle_cache[MAX_CACHE_BITMAPS];
537 void rle_cache_close(void)
539 if (rle_cache_initialized) {
541 rle_cache_initialized = 0;
542 for (i=0; i<MAX_CACHE_BITMAPS; i++ ) {
543 gr_free_bitmap(rle_cache[i].expanded_bitmap);
548 void rle_cache_init()
551 for (i=0; i<MAX_CACHE_BITMAPS; i++ ) {
552 rle_cache[i].rle_bitmap = NULL;
553 rle_cache[i].expanded_bitmap = gr_create_bitmap( 64, 64 );
554 rle_cache[i].last_used = 0;
555 Assert( rle_cache[i].expanded_bitmap != NULL );
557 rle_cache_initialized = 1;
558 atexit( rle_cache_close );
561 void rle_cache_flush()
564 for (i=0; i<MAX_CACHE_BITMAPS; i++ ) {
565 rle_cache[i].rle_bitmap = NULL;
566 rle_cache[i].last_used = 0;
570 void rle_expand_texture_sub( grs_bitmap * bmp, grs_bitmap * rle_temp_bitmap_1 )
572 unsigned char * dbits;
573 unsigned char * sbits;
575 #ifdef RLE_DECODE_ASM
576 unsigned char * dbits1;
579 sbits = &bmp->bm_data[4 + bmp->bm_h];
580 dbits = rle_temp_bitmap_1->bm_data;
582 rle_temp_bitmap_1->bm_flags = bmp->bm_flags & (~BM_FLAG_RLE);
584 for (i=0; i < bmp->bm_h; i++ ) {
585 #ifdef RLE_DECODE_ASM
586 dbits1=(unsigned char *)gr_rle_decode_asm( sbits, dbits );
588 gr_rle_decode( sbits, dbits );
590 sbits += (int)bmp->bm_data[4+i];
592 #ifdef RLE_DECODE_ASM
593 Assert( dbits == dbits1 ); // Get John, bogus rle data!
599 grs_bitmap * rle_expand_texture( grs_bitmap * bmp )
602 int lowest_count, lc;
603 int least_recently_used;
605 if (!rle_cache_initialized) rle_cache_init();
607 Assert( !(bmp->bm_flags & BM_FLAG_PAGED_OUT) );
611 if ( rle_counter < lc ) {
612 for (i=0; i<MAX_CACHE_BITMAPS; i++ ) {
613 rle_cache[i].rle_bitmap = NULL;
614 rle_cache[i].last_used = 0;
618 // if (((rle_counter % 100)==1) && (rle_hits+rle_misses > 0))
619 // mprintf(( 0, "RLE-CACHE %d%%, H:%d, M:%d\n", (rle_misses*100)/(rle_hits+rle_misses), rle_hits, rle_misses ));
621 lowest_count = rle_cache[rle_next].last_used;
622 least_recently_used = rle_next;
624 if ( rle_next >= MAX_CACHE_BITMAPS )
627 for (i=0; i<MAX_CACHE_BITMAPS; i++ ) {
628 if (rle_cache[i].rle_bitmap == bmp) {
630 rle_cache[i].last_used = rle_counter;
631 return rle_cache[i].expanded_bitmap;
633 if ( rle_cache[i].last_used < lowest_count ) {
634 lowest_count = rle_cache[i].last_used;
635 least_recently_used = i;
639 Assert(bmp->bm_w<=64 && bmp->bm_h<=64); //dest buffer is 64x64
641 rle_expand_texture_sub( bmp, rle_cache[least_recently_used].expanded_bitmap );
642 rle_cache[least_recently_used].rle_bitmap = bmp;
643 rle_cache[least_recently_used].last_used = rle_counter;
644 return rle_cache[least_recently_used].expanded_bitmap;
648 void gr_rle_expand_scanline_generic( grs_bitmap * dest, int dx, int dy, ubyte *src, int x1, int x2 )
654 if ( x2 < x1 ) return;
659 if ( color == RLE_CODE ) return;
660 if ( IS_RLE_CODE(color) ) {
661 count = color & NOT_RLE_CODE;
671 // we know have '*count' pixels of 'color'.
673 if ( x1+count > x2 ) {
675 for ( j=0; j<count; j++ )
676 gr_bm_pixel( dest, dx++, dy, color );
680 for ( j=0; j<count; j++ )
681 gr_bm_pixel( dest, dx++, dy, color );
686 if ( color == RLE_CODE ) return;
687 if ( IS_RLE_CODE(color) ) {
688 count = color & NOT_RLE_CODE;
694 // we know have '*count' pixels of 'color'.
695 if ( i+count <= x2 ) {
696 for ( j=0; j<count; j++ )
697 gr_bm_pixel( dest, dx++, dy, color );
701 for ( j=0; j<count; j++ )
702 gr_bm_pixel( dest, dx++, dy, color );
708 void gr_rle_expand_scanline_generic_masked( grs_bitmap * dest, int dx, int dy, ubyte *src, int x1, int x2 )
714 if ( x2 < x1 ) return;
719 if ( color == RLE_CODE ) return;
720 if ( IS_RLE_CODE(color) ) {
721 count = color & NOT_RLE_CODE;
731 // we know have '*count' pixels of 'color'.
733 if ( x1+count > x2 ) {
735 if (color != TRANSPARENCY_COLOR) {
736 for ( j=0; j<count; j++ )
737 gr_bm_pixel( dest, dx++, dy, color );
742 if ( color != TRANSPARENCY_COLOR ) {
743 for ( j=0; j<count; j++ )
744 gr_bm_pixel( dest, dx++, dy, color );
751 if ( color == RLE_CODE ) return;
752 if ( IS_RLE_CODE(color) ) {
753 count = color & NOT_RLE_CODE;
759 // we know have '*count' pixels of 'color'.
760 if ( i+count <= x2 ) {
761 if ( color != TRANSPARENCY_COLOR ) {
762 for ( j=0; j<count; j++ )
763 gr_bm_pixel( dest, dx++, dy, color );
769 if ( color != TRANSPARENCY_COLOR ) {
770 for ( j=0; j<count; j++ )
771 gr_bm_pixel( dest, dx++, dy, color );
781 void gr_rle_expand_scanline_svga_masked( grs_bitmap * dest, int dx, int dy, ubyte *src, int x1, int x2 )
786 ubyte * vram = (ubyte *)0xA0000;
787 int VideoLocation,page,offset;
789 if ( x2 < x1 ) return;
791 VideoLocation = (unsigned int)dest->bm_data + (dest->bm_rowsize * dy) + dx;
792 page = VideoLocation >> 16;
793 offset = VideoLocation & 0xFFFF;
795 gr_vesa_setpage( page );
797 if ( (offset + (x2-x1+1)) < 65536 ) {
798 // We don't cross a svga page, so blit it fast!
799 gr_rle_expand_scanline_masked( &vram[offset], src, x1, x2 );
806 if ( color == RLE_CODE ) return;
807 if ( IS_RLE_CODE(color) ) {
808 count = color & NOT_RLE_CODE;
818 // we know have '*count' pixels of 'color'.
820 if ( x1+count > x2 ) {
822 if (color != TRANSPARENCY_COLOR) {
823 for ( j=0; j<count; j++ ) {
824 vram[offset++] = color;
825 if ( offset >= 65536 ) {
828 gr_vesa_setpage(page);
835 if ( color != TRANSPARENCY_COLOR ) {
836 for ( j=0; j<count; j++ ) {
837 vram[offset++] = color;
838 if ( offset >= 65536 ) {
841 gr_vesa_setpage(page);
846 if ( offset >= 65536 ) {
849 gr_vesa_setpage(page);
856 if ( color == RLE_CODE ) return;
857 if ( IS_RLE_CODE(color) ) {
858 count = color & NOT_RLE_CODE;
864 // we know have '*count' pixels of 'color'.
865 if ( i+count <= x2 ) {
866 if ( color != TRANSPARENCY_COLOR ) {
867 for ( j=0; j<count; j++ ) {
868 vram[offset++] = color;
869 if ( offset >= 65536 ) {
872 gr_vesa_setpage(page);
877 if ( offset >= 65536 ) {
880 gr_vesa_setpage(page);
886 if ( color != TRANSPARENCY_COLOR ) {
887 for ( j=0; j<count; j++ ) {
888 vram[offset++] = color;
889 if ( offset >= 65536 ) {
892 gr_vesa_setpage(page);
897 if ( offset >= 65536 ) {
900 gr_vesa_setpage(page);
911 * swaps entries 0 and 255 in an RLE bitmap without uncompressing it
913 void rle_swap_0_255(grs_bitmap *bmp)
915 int i, j, len, rle_big;
916 unsigned char *ptr, *ptr2, *temp, *start;
917 unsigned short line_size;
919 rle_big = bmp->bm_flags & BM_FLAG_RLE_BIG;
921 temp = d_malloc( MAX_BMP_SIZE(bmp->bm_w, bmp->bm_h) );
923 if (rle_big) { // set ptrs to first lines
924 ptr = bmp->bm_data + 4 + 2 * bmp->bm_h;
925 ptr2 = temp + 4 + 2 * bmp->bm_h;
927 ptr = bmp->bm_data + 4 + bmp->bm_h;
928 ptr2 = temp + 4 + bmp->bm_h;
930 for (i = 0; i < bmp->bm_h; i++) {
933 line_size = INTEL_SHORT(*((unsigned short *)&bmp->bm_data[4 + 2 * i]));
935 line_size = bmp->bm_data[4 + i];
936 for (j = 0; j < line_size; j++) {
937 if ( ! IS_RLE_CODE(ptr[j]) ) {
939 *ptr2++ = RLE_CODE | 1;
945 if ((ptr[j] & NOT_RLE_CODE) == 0)
950 else if (ptr[j] == 255)
956 if (rle_big) // set line size
957 *((unsigned short *)&temp[4 + 2 * i]) = INTEL_SHORT(ptr2 - start);
959 temp[4 + i] = ptr2 - start;
960 ptr += line_size; // go to next line
963 *((int *)temp) = len; // set total size
964 memcpy(bmp->bm_data, temp, len);
969 * remaps all entries using colormap in an RLE bitmap without uncompressing it
971 void rle_remap(grs_bitmap *bmp, ubyte *colormap)
973 int i, j, len, rle_big;
974 unsigned char *ptr, *ptr2, *temp, *start;
975 unsigned short line_size;
977 rle_big = bmp->bm_flags & BM_FLAG_RLE_BIG;
979 temp = d_malloc( MAX_BMP_SIZE(bmp->bm_w, bmp->bm_h) + 30000 );
981 if (rle_big) { // set ptrs to first lines
982 ptr = bmp->bm_data + 4 + 2 * bmp->bm_h;
983 ptr2 = temp + 4 + 2 * bmp->bm_h;
985 ptr = bmp->bm_data + 4 + bmp->bm_h;
986 ptr2 = temp + 4 + bmp->bm_h;
988 for (i = 0; i < bmp->bm_h; i++) {
991 line_size = INTEL_SHORT(*((unsigned short *)&bmp->bm_data[4 + 2 * i]));
993 line_size = bmp->bm_data[4 + i];
994 for (j = 0; j < line_size; j++) {
995 if ( ! IS_RLE_CODE(ptr[j])) {
996 if (IS_RLE_CODE(colormap[ptr[j]]))
997 *ptr2++ = RLE_CODE | 1; // add "escape sequence"
998 *ptr2++ = colormap[ptr[j]]; // translate
1000 *ptr2++ = ptr[j]; // just copy current rle code
1001 if ((ptr[j] & NOT_RLE_CODE) == 0)
1004 *ptr2++ = colormap[ptr[j]]; // translate
1007 if (rle_big) // set line size
1008 *((unsigned short *)&temp[4 + 2 * i]) = INTEL_SHORT(ptr2 - start);
1010 temp[4 + i] = ptr2 - start;
1011 ptr += line_size; // go to next line
1014 *((int *)temp) = len; // set total size
1015 memcpy(bmp->bm_data, temp, len);