kDxt1GCN flag

This commit is contained in:
Jack Andersen 2015-07-19 10:47:24 -10:00
parent 21d3742aa5
commit ac84440bec
8 changed files with 201 additions and 173 deletions

View File

@ -27,6 +27,7 @@
#include "clusterfit.h" #include "clusterfit.h"
#include "colourset.h" #include "colourset.h"
#include "colourblock.h" #include "colourblock.h"
#include "colourblockGCN.h"
#include <cfloat> #include <cfloat>
namespace squish { namespace squish {
@ -237,7 +238,10 @@ void ClusterFit::Compress3( void* block )
m_colours->RemapIndices( unordered, bestindices ); m_colours->RemapIndices( unordered, bestindices );
// save the block // save the block
WriteColourBlock3( beststart.GetVec3(), bestend.GetVec3(), bestindices, block ); if ( ( m_flags & kDxt1GCN ) != 0 )
WriteColourBlock3GCN( beststart.GetVec3(), bestend.GetVec3(), bestindices, block );
else
WriteColourBlock3( beststart.GetVec3(), bestend.GetVec3(), bestindices, block );
// save the error // save the error
m_besterror = besterror; m_besterror = besterror;
@ -382,7 +386,10 @@ void ClusterFit::Compress4( void* block )
m_colours->RemapIndices( unordered, bestindices ); m_colours->RemapIndices( unordered, bestindices );
// save the block // save the block
WriteColourBlock4( beststart.GetVec3(), bestend.GetVec3(), bestindices, block ); if ( ( m_flags & kDxt1GCN ) != 0 )
WriteColourBlock4GCN( beststart.GetVec3(), bestend.GetVec3(), bestindices, block );
else
WriteColourBlock4( beststart.GetVec3(), bestend.GetVec3(), bestindices, block );
// save the error // save the error
m_besterror = besterror; m_besterror = besterror;

View File

@ -1,28 +1,28 @@
/* ----------------------------------------------------------------------------- /* -----------------------------------------------------------------------------
Fork of colourblock.cpp from libSquish.. modified to encode/decode DXT1 Fork of colourblock.cpp from libSquish.. modified to encode/decode DXT1
packed for the Nintendo GameCube's GX hardware. packed for the Nintendo GameCube's GX hardware.
Copyright (c) 2006 Simon Brown si@sjbrown.co.uk Copyright (c) 2006 Simon Brown si@sjbrown.co.uk
Permission is hereby granted, free of charge, to any person obtaining Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including "Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish, without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to permit persons to whom the Software is furnished to do so, subject to
the following conditions: the following conditions:
The above copyright notice and this permission notice shall be included The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software. in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-------------------------------------------------------------------------- */ -------------------------------------------------------------------------- */
@ -32,188 +32,188 @@ namespace squish {
static int FloatToInt( float a, int limit ) static int FloatToInt( float a, int limit )
{ {
// use ANSI round-to-zero behaviour to get round-to-nearest // use ANSI round-to-zero behaviour to get round-to-nearest
int i = ( int )( a + 0.5f ); int i = ( int )( a + 0.5f );
// clamp to the limit // clamp to the limit
if( i < 0 ) if( i < 0 )
i = 0; i = 0;
else if( i > limit ) else if( i > limit )
i = limit; i = limit;
// done // done
return i; return i;
} }
static int FloatTo565( Vec3::Arg colour ) static int FloatTo565( Vec3::Arg colour )
{ {
// get the components in the correct range // get the components in the correct range
int r = FloatToInt( 31.0f*colour.X(), 31 ); int r = FloatToInt( 31.0f*colour.X(), 31 );
int g = FloatToInt( 63.0f*colour.Y(), 63 ); int g = FloatToInt( 63.0f*colour.Y(), 63 );
int b = FloatToInt( 31.0f*colour.Z(), 31 ); int b = FloatToInt( 31.0f*colour.Z(), 31 );
// pack into a single value // pack into a single value
return ( r << 11 ) | ( g << 5 ) | b; return ( r << 11 ) | ( g << 5 ) | b;
} }
static void WriteColourBlock( int a, int b, u8* indices, void* block ) static void WriteColourBlock( int a, int b, u8* indices, void* block )
{ {
// get the block as bytes // get the block as bytes
u8* bytes = ( u8* )block; u8* bytes = ( u8* )block;
// write the endpoints - GCN 16-bit words byte-swapped // write the endpoints - GCN: 16-bit words byte-swapped
bytes[1] = ( u8 )( a & 0xff ); bytes[1] = ( u8 )( a & 0xff );
bytes[0] = ( u8 )( a >> 8 ); bytes[0] = ( u8 )( a >> 8 );
bytes[3] = ( u8 )( b & 0xff ); bytes[3] = ( u8 )( b & 0xff );
bytes[2] = ( u8 )( b >> 8 ); bytes[2] = ( u8 )( b >> 8 );
// write the indices // write the indices
for( int i = 0; i < 4; ++i ) for( int i = 0; i < 4; ++i )
{ {
u8 const* ind = indices + 4*i; u8 const* ind = indices + 4*i;
// GCN: indices reversed // GCN: indices reversed
bytes[4 + i] = ind[3] | ( ind[2] << 2 ) | ( ind[1] << 4 ) | ( ind[0] << 6 ); bytes[4 + i] = ind[3] | ( ind[2] << 2 ) | ( ind[1] << 4 ) | ( ind[0] << 6 );
} }
} }
void WriteColourBlock3GCN( Vec3::Arg start, Vec3::Arg end, u8 const* indices, void* block ) void WriteColourBlock3GCN( Vec3::Arg start, Vec3::Arg end, u8 const* indices, void* block )
{ {
// get the packed values // get the packed values
int a = FloatTo565( start ); int a = FloatTo565( start );
int b = FloatTo565( end ); int b = FloatTo565( end );
// remap the indices // remap the indices
u8 remapped[16]; u8 remapped[16];
if( a <= b ) if( a <= b )
{ {
// use the indices directly // use the indices directly
for( int i = 0; i < 16; ++i ) for( int i = 0; i < 16; ++i )
remapped[i] = indices[i]; remapped[i] = indices[i];
} }
else else
{ {
// swap a and b // swap a and b
std::swap( a, b ); std::swap( a, b );
for( int i = 0; i < 16; ++i ) for( int i = 0; i < 16; ++i )
{ {
if( indices[i] == 0 ) if( indices[i] == 0 )
remapped[i] = 1; remapped[i] = 1;
else if( indices[i] == 1 ) else if( indices[i] == 1 )
remapped[i] = 0; remapped[i] = 0;
else else
remapped[i] = indices[i]; remapped[i] = indices[i];
} }
} }
// write the block // write the block
WriteColourBlock( a, b, remapped, block ); WriteColourBlock( a, b, remapped, block );
} }
void WriteColourBlock4GCN( Vec3::Arg start, Vec3::Arg end, u8 const* indices, void* block ) void WriteColourBlock4GCN( Vec3::Arg start, Vec3::Arg end, u8 const* indices, void* block )
{ {
// get the packed values // get the packed values
int a = FloatTo565( start ); int a = FloatTo565( start );
int b = FloatTo565( end ); int b = FloatTo565( end );
// remap the indices // remap the indices
u8 remapped[16]; u8 remapped[16];
if( a < b ) if( a < b )
{ {
// swap a and b // swap a and b
std::swap( a, b ); std::swap( a, b );
for( int i = 0; i < 16; ++i ) for( int i = 0; i < 16; ++i )
remapped[i] = ( indices[i] ^ 0x1 ) & 0x3; remapped[i] = ( indices[i] ^ 0x1 ) & 0x3;
} }
else if( a == b ) else if( a == b )
{ {
// use index 0 // use index 0
for( int i = 0; i < 16; ++i ) for( int i = 0; i < 16; ++i )
remapped[i] = 0; remapped[i] = 0;
} }
else else
{ {
// use the indices directly // use the indices directly
for( int i = 0; i < 16; ++i ) for( int i = 0; i < 16; ++i )
remapped[i] = indices[i]; remapped[i] = indices[i];
} }
// write the block // write the block
WriteColourBlock( a, b, remapped, block ); WriteColourBlock( a, b, remapped, block );
} }
static int Unpack565( u8 const* packed, u8* colour ) static int Unpack565( u8 const* packed, u8* colour )
{ {
// build the packed value - GCN: indices reversed // build the packed value - GCN: indices reversed
int value = ( int )packed[1] | ( ( int )packed[0] << 8 ); int value = ( int )packed[1] | ( ( int )packed[0] << 8 );
// get the components in the stored range // get the components in the stored range
u8 red = ( u8 )( ( value >> 11 ) & 0x1f ); u8 red = ( u8 )( ( value >> 11 ) & 0x1f );
u8 green = ( u8 )( ( value >> 5 ) & 0x3f ); u8 green = ( u8 )( ( value >> 5 ) & 0x3f );
u8 blue = ( u8 )( value & 0x1f ); u8 blue = ( u8 )( value & 0x1f );
// scale up to 8 bits // scale up to 8 bits
colour[0] = ( red << 3 ) | ( red >> 2 ); colour[0] = ( red << 3 ) | ( red >> 2 );
colour[1] = ( green << 2 ) | ( green >> 4 ); colour[1] = ( green << 2 ) | ( green >> 4 );
colour[2] = ( blue << 3 ) | ( blue >> 2 ); colour[2] = ( blue << 3 ) | ( blue >> 2 );
colour[3] = 255; colour[3] = 255;
// return the value // return the value
return value; return value;
} }
void DecompressColourGCN( u8* rgba, void const* block ) void DecompressColourGCN( u8* rgba, void const* block )
{ {
// get the block bytes // get the block bytes
u8 const* bytes = reinterpret_cast< u8 const* >( block ); u8 const* bytes = reinterpret_cast< u8 const* >( block );
// unpack the endpoints // unpack the endpoints
u8 codes[16]; u8 codes[16];
int a = Unpack565( bytes, codes ); int a = Unpack565( bytes, codes );
int b = Unpack565( bytes + 2, codes + 4 ); int b = Unpack565( bytes + 2, codes + 4 );
// generate the midpoints // generate the midpoints
for( int i = 0; i < 3; ++i ) for( int i = 0; i < 3; ++i )
{ {
int c = codes[i]; int c = codes[i];
int d = codes[4 + i]; int d = codes[4 + i];
if( a <= b ) if( a <= b )
{ {
codes[8 + i] = ( u8 )( ( c + d )/2 ); codes[8 + i] = ( u8 )( ( c + d )/2 );
codes[12 + i] = 0; codes[12 + i] = 0;
} }
else else
{ {
codes[8 + i] = ( u8 )( ( 2*c + d )/3 ); codes[8 + i] = ( u8 )( ( 2*c + d )/3 );
codes[12 + i] = ( u8 )( ( c + 2*d )/3 ); codes[12 + i] = ( u8 )( ( c + 2*d )/3 );
} }
} }
// fill in alpha for the intermediate values // fill in alpha for the intermediate values
codes[8 + 3] = 255; codes[8 + 3] = 255;
codes[12 + 3] = ( a <= b ) ? 0 : 255; codes[12 + 3] = ( a <= b ) ? 0 : 255;
// unpack the indices // unpack the indices
u8 indices[16]; u8 indices[16];
for( int i = 0; i < 4; ++i ) for( int i = 0; i < 4; ++i )
{ {
u8* ind = indices + 4*i; u8* ind = indices + 4*i;
u8 packed = bytes[4 + i]; u8 packed = bytes[4 + i];
// GCN: indices reversed // GCN: indices reversed
ind[3] = packed & 0x3; ind[3] = packed & 0x3;
ind[2] = ( packed >> 2 ) & 0x3; ind[2] = ( packed >> 2 ) & 0x3;
ind[1] = ( packed >> 4 ) & 0x3; ind[1] = ( packed >> 4 ) & 0x3;
ind[0] = ( packed >> 6 ) & 0x3; ind[0] = ( packed >> 6 ) & 0x3;
} }
// store out the colours // store out the colours
for( int i = 0; i < 16; ++i ) for( int i = 0; i < 16; ++i )
{ {
u8 offset = 4*indices[i]; u8 offset = 4*indices[i];
for( int j = 0; j < 4; ++j ) for( int j = 0; j < 4; ++j )
rgba[4*i + j] = codes[offset + j]; rgba[4*i + j] = codes[offset + j];
} }
} }
} // namespace squish } // namespace squish

View File

@ -40,7 +40,7 @@ ColourFit::~ColourFit()
void ColourFit::Compress( void* block ) void ColourFit::Compress( void* block )
{ {
bool isDxt1 = ( ( m_flags & kDxt1 ) != 0 ); bool isDxt1 = ( ( m_flags & ( kDxt1 | kDxt1GCN ) ) != 0 );
if( isDxt1 ) if( isDxt1 )
{ {
Compress3( block ); Compress3( block );

View File

@ -32,7 +32,7 @@ ColourSet::ColourSet( u8 const* rgba, int mask, int flags )
m_transparent( false ) m_transparent( false )
{ {
// check the compression mode for dxt1 // check the compression mode for dxt1
bool isDxt1 = ( ( flags & kDxt1 ) != 0 ); bool isDxt1 = ( ( flags & ( kDxt1 | kDxt1GCN ) ) != 0 );
bool weightByAlpha = ( ( flags & kWeightColourByAlpha ) != 0 ); bool weightByAlpha = ( ( flags & kWeightColourByAlpha ) != 0 );
// create the minimal set // create the minimal set

View File

@ -26,6 +26,7 @@
#include "rangefit.h" #include "rangefit.h"
#include "colourset.h" #include "colourset.h"
#include "colourblock.h" #include "colourblock.h"
#include "colourblockGCN.h"
#include <cfloat> #include <cfloat>
namespace squish { namespace squish {
@ -138,8 +139,11 @@ void RangeFit::Compress3( void* block )
m_colours->RemapIndices( closest, indices ); m_colours->RemapIndices( closest, indices );
// save the block // save the block
WriteColourBlock3( m_start, m_end, indices, block ); if ( ( m_flags & kDxt1GCN ) != 0 )
WriteColourBlock3GCN( m_start, m_end, indices, block );
else
WriteColourBlock3( m_start, m_end, indices, block );
// save the error // save the error
m_besterror = error; m_besterror = error;
} }
@ -191,7 +195,10 @@ void RangeFit::Compress4( void* block )
m_colours->RemapIndices( closest, indices ); m_colours->RemapIndices( closest, indices );
// save the block // save the block
WriteColourBlock4( m_start, m_end, indices, block ); if ( ( m_flags & kDxt1GCN ) != 0 )
WriteColourBlock4GCN( m_start, m_end, indices, block );
else
WriteColourBlock4( m_start, m_end, indices, block );
// save the error // save the error
m_besterror = error; m_besterror = error;

View File

@ -26,6 +26,7 @@
#include "singlecolourfit.h" #include "singlecolourfit.h"
#include "colourset.h" #include "colourset.h"
#include "colourblock.h" #include "colourblock.h"
#include "colourblockGCN.h"
namespace squish { namespace squish {
@ -92,7 +93,10 @@ void SingleColourFit::Compress3( void* block )
m_colours->RemapIndices( &m_index, indices ); m_colours->RemapIndices( &m_index, indices );
// save the block // save the block
WriteColourBlock3( m_start, m_end, indices, block ); if ( ( m_flags & kDxt1GCN ) != 0 )
WriteColourBlock3GCN( m_start, m_end, indices, block );
else
WriteColourBlock3( m_start, m_end, indices, block );
// save the error // save the error
m_besterror = m_error; m_besterror = m_error;
@ -120,7 +124,10 @@ void SingleColourFit::Compress4( void* block )
m_colours->RemapIndices( &m_index, indices ); m_colours->RemapIndices( &m_index, indices );
// save the block // save the block
WriteColourBlock4( m_start, m_end, indices, block ); if ( ( m_flags & kDxt1GCN ) != 0 )
WriteColourBlock4GCN( m_start, m_end, indices, block );
else
WriteColourBlock4( m_start, m_end, indices, block );
// save the error // save the error
m_besterror = m_error; m_besterror = m_error;

View File

@ -29,6 +29,7 @@
#include "rangefit.h" #include "rangefit.h"
#include "clusterfit.h" #include "clusterfit.h"
#include "colourblock.h" #include "colourblock.h"
#include "colourblockGCN.h"
#include "alpha.h" #include "alpha.h"
#include "singlecolourfit.h" #include "singlecolourfit.h"
@ -37,12 +38,12 @@ namespace squish {
static int FixFlags( int flags ) static int FixFlags( int flags )
{ {
// grab the flag bits // grab the flag bits
int method = flags & ( kDxt1 | kDxt3 | kDxt5 ); int method = flags & ( kDxt1 | kDxt3 | kDxt5 | kDxt1GCN );
int fit = flags & ( kColourIterativeClusterFit | kColourClusterFit | kColourRangeFit ); int fit = flags & ( kColourIterativeClusterFit | kColourClusterFit | kColourRangeFit );
int extra = flags & kWeightColourByAlpha; int extra = flags & kWeightColourByAlpha;
// set defaults // set defaults
if( method != kDxt3 && method != kDxt5 ) if( method != kDxt3 && method != kDxt5 && method != kDxt1GCN )
method = kDxt1; method = kDxt1;
if( fit != kColourRangeFit && fit != kColourIterativeClusterFit ) if( fit != kColourRangeFit && fit != kColourIterativeClusterFit )
fit = kColourClusterFit; fit = kColourClusterFit;
@ -104,7 +105,10 @@ void Decompress( u8* rgba, void const* block, int flags )
colourBlock = reinterpret_cast< u8 const* >( block ) + 8; colourBlock = reinterpret_cast< u8 const* >( block ) + 8;
// decompress colour // decompress colour
DecompressColour( rgba, colourBlock, ( flags & kDxt1 ) != 0 ); if ( ( flags & kDxt1GCN ) != 0 )
DecompressColourGCN( rgba, colourBlock );
else
DecompressColour( rgba, colourBlock, ( flags & kDxt1 ) != 0 );
// decompress alpha separately if necessary // decompress alpha separately if necessary
if( ( flags & kDxt3 ) != 0 ) if( ( flags & kDxt3 ) != 0 )
@ -120,7 +124,7 @@ int GetStorageRequirements( int width, int height, int flags )
// compute the storage requirements // compute the storage requirements
int blockcount = ( ( width + 3 )/4 ) * ( ( height + 3 )/4 ); int blockcount = ( ( width + 3 )/4 ) * ( ( height + 3 )/4 );
int blocksize = ( ( flags & kDxt1 ) != 0 ) ? 8 : 16; int blocksize = ( ( flags & ( kDxt1 | kDxt1GCN ) ) != 0 ) ? 8 : 16;
return blockcount*blocksize; return blockcount*blocksize;
} }
@ -131,7 +135,7 @@ void CompressImage( u8 const* rgba, int width, int height, void* blocks, int fla
// initialise the block output // initialise the block output
u8* targetBlock = reinterpret_cast< u8* >( blocks ); u8* targetBlock = reinterpret_cast< u8* >( blocks );
int bytesPerBlock = ( ( flags & kDxt1 ) != 0 ) ? 8 : 16; int bytesPerBlock = ( ( flags & ( kDxt1 | kDxt1GCN ) ) != 0 ) ? 8 : 16;
// loop over blocks // loop over blocks
for( int y = 0; y < height; y += 4 ) for( int y = 0; y < height; y += 4 )
@ -185,7 +189,7 @@ void DecompressImage( u8* rgba, int width, int height, void const* blocks, int f
// initialise the block input // initialise the block input
u8 const* sourceBlock = reinterpret_cast< u8 const* >( blocks ); u8 const* sourceBlock = reinterpret_cast< u8 const* >( blocks );
int bytesPerBlock = ( ( flags & kDxt1 ) != 0 ) ? 8 : 16; int bytesPerBlock = ( ( flags & ( kDxt1 | kDxt1GCN ) ) != 0 ) ? 8 : 16;
// loop over blocks // loop over blocks
for( int y = 0; y < height; y += 4 ) for( int y = 0; y < height; y += 4 )

View File

@ -46,6 +46,9 @@ enum
//! Use DXT5 compression. //! Use DXT5 compression.
kDxt5 = ( 1 << 2 ), kDxt5 = ( 1 << 2 ),
//! Use DXT1 compression with GCN byte-ordering
kDxt1GCN = ( 1 << 9 ),
//! Use a very slow but very high quality colour compressor. //! Use a very slow but very high quality colour compressor.
kColourIterativeClusterFit = ( 1 << 8 ), kColourIterativeClusterFit = ( 1 << 8 ),