2026-07-25 23:01:18 +02:00
|
|
|
#include "bscript/compiler/optimizer/BinaryOperatorWithFloatOptimizer.h"
|
2020-09-02 00:27:09 -07:00
|
|
|
|
2026-07-08 19:58:41 +02:00
|
|
|
#include "bscript/bdouble.h"
|
2025-07-10 22:32:29 +02:00
|
|
|
#include "bscript/bobject.h"
|
2021-02-25 16:53:22 +01:00
|
|
|
#include "bscript/compiler/Report.h"
|
|
|
|
|
#include "bscript/compiler/ast/BinaryOperator.h"
|
2025-07-10 22:32:29 +02:00
|
|
|
#include "bscript/compiler/ast/BooleanValue.h"
|
2021-02-25 16:53:22 +01:00
|
|
|
#include "bscript/compiler/ast/FloatValue.h"
|
2025-07-10 22:32:29 +02:00
|
|
|
#include "bscript/compiler/ast/IntegerValue.h"
|
|
|
|
|
#include "bscript/compiler/ast/StringValue.h"
|
2020-09-02 00:27:09 -07:00
|
|
|
|
|
|
|
|
namespace Pol::Bscript::Compiler
|
|
|
|
|
{
|
|
|
|
|
BinaryOperatorWithFloatOptimizer::BinaryOperatorWithFloatOptimizer( FloatValue& lhs,
|
|
|
|
|
BinaryOperator& op,
|
|
|
|
|
Report& report )
|
|
|
|
|
: lhs( lhs ), op( op ), report( report )
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BinaryOperatorWithFloatOptimizer::visit_children( Node& ) {}
|
|
|
|
|
|
|
|
|
|
void BinaryOperatorWithFloatOptimizer::visit_float_value( FloatValue& rhs )
|
|
|
|
|
{
|
2025-07-10 22:32:29 +02:00
|
|
|
auto setInt = [&]( int val )
|
|
|
|
|
{ optimized_result = std::make_unique<IntegerValue>( op.source_location, val ); };
|
|
|
|
|
auto setDouble = [&]( double val )
|
|
|
|
|
{ optimized_result = std::make_unique<FloatValue>( op.source_location, val ); };
|
|
|
|
|
auto eql = []( double a, double b ) { return fabs( a - b ) < 0.00000001; };
|
|
|
|
|
|
2020-09-02 00:27:09 -07:00
|
|
|
switch ( op.token_id )
|
|
|
|
|
{
|
|
|
|
|
case TOK_ADD:
|
2025-07-10 22:32:29 +02:00
|
|
|
setDouble( lhs.value + rhs.value );
|
2020-09-02 00:27:09 -07:00
|
|
|
break;
|
|
|
|
|
case TOK_SUBTRACT:
|
2025-07-10 22:32:29 +02:00
|
|
|
setDouble( lhs.value - rhs.value );
|
2020-09-02 00:27:09 -07:00
|
|
|
break;
|
|
|
|
|
case TOK_MULT:
|
2025-07-10 22:32:29 +02:00
|
|
|
setDouble( lhs.value * rhs.value );
|
2020-09-02 00:27:09 -07:00
|
|
|
break;
|
|
|
|
|
case TOK_DIV:
|
|
|
|
|
if ( rhs.value == 0.0 )
|
2020-09-05 01:19:12 -07:00
|
|
|
{
|
2024-01-12 06:51:44 +01:00
|
|
|
report.error( op, "Expression would divide by zero." );
|
2020-09-05 01:19:12 -07:00
|
|
|
return;
|
|
|
|
|
}
|
2025-07-10 22:32:29 +02:00
|
|
|
setDouble( lhs.value / rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_MODULUS:
|
|
|
|
|
if ( rhs.value == 0 )
|
|
|
|
|
{
|
|
|
|
|
report.error( op, "Program would divide by zero" );
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
setDouble( fmod( lhs.value, rhs.value ) );
|
2020-09-02 00:27:09 -07:00
|
|
|
break;
|
|
|
|
|
|
2025-07-10 22:32:29 +02:00
|
|
|
case TOK_EQUAL:
|
|
|
|
|
setInt( eql( lhs.value, rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_NEQ:
|
|
|
|
|
setInt( !eql( lhs.value, rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_LESSTHAN:
|
|
|
|
|
setInt( lhs.value < rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_LESSEQ:
|
|
|
|
|
setInt( eql( lhs.value, rhs.value ) || ( lhs.value < rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_GRTHAN:
|
|
|
|
|
setInt( lhs.value > rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_GREQ:
|
|
|
|
|
setInt( eql( lhs.value, rhs.value ) || ( lhs.value > rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_AND:
|
|
|
|
|
setInt( lhs.value != 0.0 && rhs.value != 0.0 );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_OR:
|
|
|
|
|
setInt( lhs.value != 0.0 || rhs.value != 0.0 );
|
|
|
|
|
break;
|
2020-09-02 00:27:09 -07:00
|
|
|
default:
|
|
|
|
|
return;
|
|
|
|
|
}
|
2025-07-10 22:32:29 +02:00
|
|
|
}
|
2020-09-02 00:27:09 -07:00
|
|
|
|
2025-07-10 22:32:29 +02:00
|
|
|
void BinaryOperatorWithFloatOptimizer::visit_integer_value( IntegerValue& rhs )
|
|
|
|
|
{
|
|
|
|
|
auto setInt = [&]( int val )
|
|
|
|
|
{ optimized_result = std::make_unique<IntegerValue>( op.source_location, val ); };
|
|
|
|
|
auto setDouble = [&]( double val )
|
|
|
|
|
{ optimized_result = std::make_unique<FloatValue>( op.source_location, val ); };
|
|
|
|
|
auto eql = []( double a, int b ) { return fabs( a - b ) < 0.00000001; };
|
|
|
|
|
switch ( op.token_id )
|
|
|
|
|
{
|
|
|
|
|
case TOK_ADD:
|
|
|
|
|
setDouble( lhs.value + rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_SUBTRACT:
|
|
|
|
|
setDouble( lhs.value - rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_MULT:
|
|
|
|
|
setDouble( lhs.value * rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_DIV:
|
|
|
|
|
if ( rhs.value == 0 )
|
|
|
|
|
{
|
|
|
|
|
report.error( op, "Program would divide by zero" );
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
setDouble( lhs.value / rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_MODULUS:
|
|
|
|
|
if ( rhs.value == 0 )
|
|
|
|
|
{
|
|
|
|
|
report.error( op, "Program would divide by zero" );
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
setDouble( fmod( lhs.value, rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_EQUAL:
|
|
|
|
|
setInt( eql( lhs.value, rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_NEQ:
|
|
|
|
|
setInt( !eql( lhs.value, rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_LESSTHAN:
|
|
|
|
|
setInt( lhs.value < rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_LESSEQ:
|
|
|
|
|
setInt( eql( lhs.value, rhs.value ) || ( lhs.value < rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_GRTHAN:
|
|
|
|
|
setInt( lhs.value > rhs.value );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_GREQ:
|
|
|
|
|
setInt( eql( lhs.value, rhs.value ) || ( lhs.value > rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_AND:
|
|
|
|
|
setInt( lhs.value != 0.0 && rhs.value != 0 );
|
|
|
|
|
break;
|
|
|
|
|
case TOK_OR:
|
|
|
|
|
setInt( lhs.value != 0.0 || rhs.value != 0 );
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BinaryOperatorWithFloatOptimizer::visit_string_value( StringValue& rhs )
|
|
|
|
|
{
|
|
|
|
|
auto setString = [&]( std::string&& val )
|
|
|
|
|
{ optimized_result = std::make_unique<StringValue>( op.source_location, val ); };
|
|
|
|
|
switch ( op.token_id )
|
|
|
|
|
{
|
|
|
|
|
case TOK_ADD:
|
|
|
|
|
setString( fmt::format( "{}{}", Bscript::Double::double_to_string( lhs.value ), rhs.value ) );
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
2020-09-02 00:27:09 -07:00
|
|
|
}
|
|
|
|
|
|
2025-07-10 22:32:29 +02:00
|
|
|
void BinaryOperatorWithFloatOptimizer::visit_boolean_value( BooleanValue& rhs )
|
|
|
|
|
{
|
|
|
|
|
bool bval = false;
|
|
|
|
|
switch ( op.token_id )
|
|
|
|
|
{
|
|
|
|
|
case TOK_EQUAL:
|
|
|
|
|
bval = ( lhs.value != 0.0 ) == rhs.value;
|
|
|
|
|
break;
|
|
|
|
|
case TOK_NEQ:
|
|
|
|
|
bval = ( lhs.value != 0.0 ) != rhs.value;
|
|
|
|
|
break;
|
|
|
|
|
case TOK_OR:
|
|
|
|
|
bval = ( lhs.value != 0.0 ) || rhs.value;
|
|
|
|
|
break;
|
|
|
|
|
case TOK_AND:
|
|
|
|
|
bval = ( lhs.value != 0.0 ) && rhs.value;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Boolean logic operators return 1/0 as BLong, ie. `true || false` == `1`
|
|
|
|
|
optimized_result = std::make_unique<IntegerValue>( op.source_location, bval );
|
|
|
|
|
}
|
2020-09-02 00:27:09 -07:00
|
|
|
} // namespace Pol::Bscript::Compiler
|