mirror of
https://github.com/DaedalusX64/daedalus.git
synced 2025-04-02 10:21:48 -04:00
519 lines
14 KiB
C++
519 lines
14 KiB
C++
/*
|
|
Copyright (C) 2007 StrmnNrmn
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
*/
|
|
|
|
#include "stdafx.h"
|
|
#include "CombinerExpression.h"
|
|
|
|
#include "Utility/Stream.h"
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
static const char * const gCombinerInputNames[] =
|
|
{
|
|
"Combined", // CI_COMBINED,
|
|
"Texel0", // CI_TEXEL0,
|
|
"Texel1", // CI_TEXEL1,
|
|
"Prim", // CI_PRIMITIVE,
|
|
"Shade", // CI_SHADE,
|
|
"Env", // CI_ENV,
|
|
"CombinedA", // CI_COMBINED_ALPHA,
|
|
"Texel0A", // CI_TEXEL0_ALPHA,
|
|
"Texel1A", // CI_TEXEL1_ALPHA,
|
|
"PrimA", // CI_PRIMITIVE_ALPHA,
|
|
"ShadeA", // CI_SHADE_ALPHA,
|
|
"EnvA", // CI_ENV_ALPHA,
|
|
"LodFrac", // CI_LOD_FRACTION,
|
|
"PrimLodFrac", // CI_PRIM_LOD_FRACTION,
|
|
"K5", // CI_K5,
|
|
"1", // CI_1,
|
|
"0", // CI_0,
|
|
"?", // CI_UNKNOWN,
|
|
};
|
|
|
|
const char * GetCombinerInputName( ECombinerInput input )
|
|
{
|
|
return gCombinerInputNames[ input ];
|
|
}
|
|
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
int CCombinerInput::Compare( const CCombinerOperand & other ) const
|
|
{
|
|
int type_diff( GetType() - other.GetType() );
|
|
if( type_diff != 0 )
|
|
return type_diff;
|
|
|
|
const CCombinerInput & rhs( static_cast< const CCombinerInput & >( other ) );
|
|
|
|
return int( mInput ) - int( rhs.mInput );
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
COutputStream & CCombinerInput::Stream( COutputStream & stream ) const
|
|
{
|
|
return stream << GetCombinerInputName( mInput );
|
|
}
|
|
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
int CCombinerBlend::Compare( const CCombinerOperand & other ) const
|
|
{
|
|
int type_diff( GetType() - other.GetType() );
|
|
if( type_diff != 0 )
|
|
return type_diff;
|
|
|
|
const CCombinerBlend & rhs( static_cast< const CCombinerBlend & >( other ) );
|
|
|
|
int input_diff;
|
|
|
|
input_diff = mInputA->Compare( *rhs.mInputA );
|
|
if( input_diff != 0 )
|
|
return input_diff;
|
|
|
|
input_diff = mInputB->Compare( *rhs.mInputB );
|
|
if( input_diff != 0 )
|
|
return input_diff;
|
|
|
|
input_diff = mInputF->Compare( *rhs.mInputF );
|
|
if( input_diff != 0 )
|
|
return input_diff;
|
|
|
|
// Equal
|
|
return 0;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
COutputStream & CCombinerBlend::Stream( COutputStream & stream ) const
|
|
{
|
|
stream << "blend(";
|
|
mInputA->Stream( stream );
|
|
stream << ",";
|
|
mInputB->Stream( stream );
|
|
stream << ",";
|
|
mInputF->Stream( stream );
|
|
stream << ")";
|
|
return stream;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerSum::CCombinerSum()
|
|
: CCombinerOperand( CT_SUM )
|
|
{
|
|
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerSum::CCombinerSum( CCombinerOperand * operand )
|
|
: CCombinerOperand( CT_SUM )
|
|
{
|
|
if( operand != NULL )
|
|
{
|
|
Add( operand );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerSum::CCombinerSum( const CCombinerSum & rhs )
|
|
: CCombinerOperand( CT_SUM )
|
|
{
|
|
for( u32 i = 0; i < rhs.mOperands.size(); ++i )
|
|
{
|
|
mOperands.push_back( Node( rhs.mOperands[ i ].Operand->Clone(), rhs.mOperands[ i ].Negate ) );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerSum::~CCombinerSum()
|
|
{
|
|
for( u32 i = 0; i < mOperands.size(); ++i )
|
|
{
|
|
delete mOperands[ i ].Operand;
|
|
}
|
|
mOperands.clear();
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
int CCombinerSum::Compare( const CCombinerOperand & other ) const
|
|
{
|
|
int type_diff( GetType() - other.GetType() );
|
|
if( type_diff != 0 )
|
|
return type_diff;
|
|
|
|
const CCombinerSum & rhs( static_cast< const CCombinerSum & >( other ) );
|
|
int size_diff( mOperands.size() - rhs.mOperands.size() );
|
|
if( size_diff != 0 )
|
|
return size_diff;
|
|
|
|
for( u32 i = 0; i < mOperands.size(); ++i )
|
|
{
|
|
// Compare signs first
|
|
if( mOperands[ i ].Negate && !rhs.mOperands[ i ].Negate )
|
|
return -1;
|
|
else if ( !mOperands[ i ].Negate && rhs.mOperands[ i ].Negate )
|
|
return 1;
|
|
|
|
int diff( mOperands[ i ].Operand->Compare( *rhs.mOperands[ i ].Operand ) );
|
|
if( diff != 0 )
|
|
{
|
|
return diff;
|
|
}
|
|
}
|
|
|
|
// Equal
|
|
return 0;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
void CCombinerSum::Add( CCombinerOperand * operand )
|
|
{
|
|
if( operand->IsInput( CI_0 ) )
|
|
{
|
|
// Ignore
|
|
delete operand;
|
|
}
|
|
else if( operand->IsSum() )
|
|
{
|
|
// Recursively add all children
|
|
CCombinerSum * sum( static_cast< CCombinerSum * >( operand ) );
|
|
for( u32 i = 0; i < sum->mOperands.size(); ++i )
|
|
{
|
|
if( sum->mOperands[ i ].Negate )
|
|
{
|
|
Sub( sum->mOperands[ i ].Operand->SimplifyAndReduce() );
|
|
}
|
|
else
|
|
{
|
|
Add( sum->mOperands[ i ].Operand->SimplifyAndReduce() );
|
|
}
|
|
}
|
|
|
|
delete operand;
|
|
}
|
|
else
|
|
{
|
|
mOperands.push_back( Node( operand, false ) );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
void CCombinerSum::Sub( CCombinerOperand * operand )
|
|
{
|
|
if( operand->IsInput( CI_0 ) )
|
|
{
|
|
// Ignore
|
|
delete operand;
|
|
}
|
|
else if( operand->IsSum() )
|
|
{
|
|
// Recursively add all children
|
|
CCombinerSum * sum( static_cast< CCombinerSum * >( operand ) );
|
|
for( u32 i = 0; i < sum->mOperands.size(); ++i )
|
|
{
|
|
if( sum->mOperands[ i ].Negate )
|
|
{
|
|
Add( sum->mOperands[ i ].Operand->SimplifyAndReduce() ); // Note we Add, not Sub
|
|
}
|
|
else
|
|
{
|
|
Sub( sum->mOperands[ i ].Operand->SimplifyAndReduce() ); // Note we Sub, not Add
|
|
}
|
|
}
|
|
|
|
delete operand;
|
|
}
|
|
else
|
|
{
|
|
mOperands.push_back( Node( operand, true ) );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
// Try to reduce this operand to a blend. If it fails, returns NULL
|
|
CCombinerOperand * CCombinerSum::ReduceToBlend() const
|
|
{
|
|
// We're looking for expressions of the form (A + (f * (B - A)))
|
|
if( mOperands.size() == 2 )
|
|
{
|
|
if( !mOperands[ 0 ].Negate &&
|
|
!mOperands[ 1 ].Negate && mOperands[ 1 ].Operand->IsProduct() )
|
|
{
|
|
const CCombinerOperand * input_a( mOperands[ 0 ].Operand );
|
|
const CCombinerProduct * product( static_cast< const CCombinerProduct * >( mOperands[ 1 ].Operand ) );
|
|
|
|
if( product->GetNumOperands() == 2 )
|
|
{
|
|
const CCombinerOperand * factor( product->GetOperand( 0 ) ); // f
|
|
const CCombinerOperand * diff( product->GetOperand( 1 ) ); // B-A
|
|
|
|
if( diff->IsSum() )
|
|
{
|
|
const CCombinerSum * diff_sum( static_cast< const CCombinerSum * >( diff ) );
|
|
|
|
if( diff_sum->mOperands.size() == 2 )
|
|
{
|
|
if( !diff_sum->mOperands[ 0 ].Negate &&
|
|
diff_sum->mOperands[ 1 ].Negate && diff_sum->mOperands[ 1 ].Operand->IsEqual( *input_a ) ) // Make sure this term is the same as the first A we saw
|
|
{
|
|
const CCombinerOperand * input_b( diff_sum->mOperands[ 0 ].Operand );
|
|
|
|
return new CCombinerBlend( input_a->SimplifyAndReduce(), input_b->SimplifyAndReduce(), factor->SimplifyAndReduce() );
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerOperand * CCombinerSum::SimplifyAndReduce() const
|
|
{
|
|
// If we consist of a single element, hoist that up
|
|
if( mOperands.size() == 1 && mOperands[ 0 ].Negate == false ) // XXXX
|
|
{
|
|
return mOperands[ 0 ].Operand->SimplifyAndReduce();
|
|
}
|
|
|
|
CCombinerOperand * blend( ReduceToBlend() );
|
|
if( blend != NULL )
|
|
{
|
|
return blend;
|
|
}
|
|
|
|
CCombinerSum * new_add( new CCombinerSum );
|
|
|
|
for( std::vector< Node >::const_iterator it = mOperands.begin(); it != mOperands.end(); ++it )
|
|
{
|
|
if( it->Negate )
|
|
new_add->Sub( it->Operand->SimplifyAndReduce() );
|
|
else
|
|
new_add->Add( it->Operand->SimplifyAndReduce() );
|
|
}
|
|
|
|
new_add->SortOperands();
|
|
|
|
return new_add;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
COutputStream & CCombinerSum::Stream( COutputStream & stream ) const
|
|
{
|
|
stream << "( ";
|
|
for( u32 i = 0; i < mOperands.size(); ++i )
|
|
{
|
|
if( i != 0 )
|
|
{
|
|
stream << (mOperands[ i ].Negate ? " - " : " + ");
|
|
}
|
|
else
|
|
{
|
|
if( mOperands[ i ].Negate )
|
|
stream << "-";
|
|
}
|
|
mOperands[ i ].Operand->Stream( stream );
|
|
}
|
|
stream << " )";
|
|
return stream;
|
|
}
|
|
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerProduct::CCombinerProduct()
|
|
: CCombinerOperand( CT_PRODUCT )
|
|
{
|
|
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerProduct::CCombinerProduct( CCombinerOperand * operand )
|
|
: CCombinerOperand( CT_PRODUCT )
|
|
{
|
|
if( operand != NULL )
|
|
{
|
|
Mul( operand );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerProduct::CCombinerProduct( const CCombinerProduct & rhs )
|
|
: CCombinerOperand( CT_PRODUCT )
|
|
{
|
|
for( u32 i = 0; i < rhs.mOperands.size(); ++i )
|
|
{
|
|
mOperands.push_back( rhs.mOperands[ i ].Operand->Clone() );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerProduct::~CCombinerProduct()
|
|
{
|
|
Clear();
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
void CCombinerProduct::Clear()
|
|
{
|
|
for( u32 i = 0; i < mOperands.size(); ++i )
|
|
{
|
|
delete mOperands[ i ].Operand;
|
|
}
|
|
mOperands.clear();
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
int CCombinerProduct::Compare( const CCombinerOperand & other ) const
|
|
{
|
|
int type_diff( GetType() - other.GetType() );
|
|
if( type_diff != 0 )
|
|
return type_diff;
|
|
|
|
const CCombinerProduct & rhs( static_cast< const CCombinerProduct & >( other ) );
|
|
int size_diff( mOperands.size() - rhs.mOperands.size() );
|
|
if( size_diff != 0 )
|
|
return size_diff;
|
|
|
|
for( u32 i = 0; i < mOperands.size(); ++i )
|
|
{
|
|
int diff( mOperands[ i ].Operand->Compare( *rhs.mOperands[ i ].Operand ) );
|
|
if( diff != 0 )
|
|
{
|
|
return diff;
|
|
}
|
|
}
|
|
|
|
// Equal
|
|
return 0;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
void CCombinerProduct::Mul( CCombinerOperand * operand )
|
|
{
|
|
if( operand->IsInput( CI_0 ) )
|
|
{
|
|
Clear();
|
|
mOperands.push_back( Node( operand ) );
|
|
}
|
|
else if( operand->IsInput( CI_1 ) )
|
|
{
|
|
// Ignore
|
|
delete operand;
|
|
}
|
|
else if( operand->IsProduct() )
|
|
{
|
|
// Recursively add all children
|
|
CCombinerProduct * product( static_cast< CCombinerProduct * >( operand ) );
|
|
for( u32 i = 0; i < product->mOperands.size(); ++i )
|
|
{
|
|
Mul( product->mOperands[ i ].Operand->SimplifyAndReduce() );
|
|
}
|
|
|
|
delete operand;
|
|
}
|
|
else
|
|
{
|
|
mOperands.push_back( Node( operand ) );
|
|
}
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
CCombinerOperand * CCombinerProduct::SimplifyAndReduce() const
|
|
{
|
|
// If we consist of a single element, hoist that up
|
|
if( mOperands.size() == 1 )
|
|
{
|
|
return mOperands[ 0 ].Operand->SimplifyAndReduce();
|
|
}
|
|
|
|
CCombinerProduct * new_mul( new CCombinerProduct );
|
|
|
|
for( std::vector< Node >::const_iterator it = mOperands.begin(); it != mOperands.end(); ++it )
|
|
{
|
|
new_mul->Mul( it->Operand->SimplifyAndReduce() );
|
|
}
|
|
|
|
new_mul->SortOperands();
|
|
|
|
return new_mul;
|
|
}
|
|
|
|
//*****************************************************************************
|
|
//
|
|
//*****************************************************************************
|
|
COutputStream & CCombinerProduct::Stream( COutputStream & stream ) const
|
|
{
|
|
stream << "( ";
|
|
for( u32 i = 0; i < mOperands.size(); ++i )
|
|
{
|
|
if( i != 0 )
|
|
{
|
|
stream << " * ";
|
|
}
|
|
mOperands[ i ].Operand->Stream( stream );
|
|
}
|
|
stream << " )";
|
|
return stream;
|
|
}
|