25918451630

Committed 15 May 2026 12:43PM UTC coverage: 60.929% (+2.1%) from 58.859%

Build # 25918451630

Build Type

push

github

Committed by

turleypol

Commit Message

added dynamic property which returns a pointer of the object instead of
a copy like the current imp.
needed to be able to eg store a vector

Coverage Stats

43 of 61 new or added lines in 2 files covered. (70.49%)

14455 existing lines in 345 files now uncovered.

44695 of 73356 relevant lines covered (60.93%)

449621.59 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

89.54

/pol-core/bscript/compiler/optimizer/BinaryOperatorWithIntegerOptimizer.cpp

#include "BinaryOperatorWithIntegerOptimizer.h"

#include "bscript/compiler/Report.h"
#include "bscript/compiler/ast/BinaryOperator.h"
#include "bscript/compiler/ast/BooleanValue.h"
#include "bscript/compiler/ast/FloatValue.h"
#include "bscript/compiler/ast/IntegerValue.h"
#include "bscript/compiler/ast/StringValue.h"

namespace Pol::Bscript::Compiler
{
BinaryOperatorWithIntegerOptimizer::BinaryOperatorWithIntegerOptimizer( IntegerValue& lhs,
                                                                        BinaryOperator& op,
                                                                        Report& report )
    : lhs( lhs ), op( op ), report( report )
{
}

void BinaryOperatorWithIntegerOptimizer::visit_children( Node& ) {}

void BinaryOperatorWithIntegerOptimizer::visit_integer_value( IntegerValue& rhs )
{
  int value = 0;
  switch ( op.token_id )
  {
  case TOK_ADD:
    value = lhs.value + rhs.value;
    break;
  case TOK_SUBTRACT:
    value = lhs.value - rhs.value;
    break;
  case TOK_MULT:
    value = lhs.value * rhs.value;
    break;
  case TOK_DIV:
    if ( rhs.value == 0 )
    {
      report.error( op, "Program would divide by zero" );
      return;
    }
    value = lhs.value / rhs.value;
    break;
  case TOK_MODULUS:
    if ( rhs.value == 0 )
    {
      report.error( op, "Program would divide by zero" );
      return;
    }
    value = lhs.value % rhs.value;
    break;

  case TOK_EQUAL:
    value = ( lhs.value == rhs.value );
    break;
  case TOK_NEQ:
    value = ( lhs.value != rhs.value );
    break;
  case TOK_LESSTHAN:
    value = ( lhs.value < rhs.value );
    break;
  case TOK_LESSEQ:
    value = ( lhs.value <= rhs.value );
    break;
  case TOK_GRTHAN:
    value = ( lhs.value > rhs.value );
    break;
  case TOK_GREQ:
    value = ( lhs.value >= rhs.value );
    break;

  case TOK_AND:
    value = ( lhs.value && rhs.value );
    break;
  case TOK_OR:
    value = ( lhs.value || rhs.value );
    break;

  case TOK_BSRIGHT:
    value = ( lhs.value >> rhs.value );
    break;
  case TOK_BSLEFT:
    value = ( lhs.value << rhs.value );
    break;
  case TOK_BITAND:
    value = ( lhs.value & rhs.value );
    break;
  case TOK_BITOR:
    value = ( lhs.value | rhs.value );
    break;
  case TOK_BITXOR:
    value = ( lhs.value ^ rhs.value );
    break;

  default:
    return;
  }

  optimized_result = std::make_unique<IntegerValue>( op.source_location, value );
}

void BinaryOperatorWithIntegerOptimizer::visit_float_value( FloatValue& 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 = []( int a, double 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 && rhs.value != 0.0 );
    break;
  case TOK_OR:
    setInt( lhs.value != 0 || rhs.value != 0.0 );
    break;
  default:
    break;
  }
}

void BinaryOperatorWithIntegerOptimizer::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( "{}{}", lhs.value, rhs.value ) );
    break;
  default:
    break;
  }
}

void BinaryOperatorWithIntegerOptimizer::visit_boolean_value( BooleanValue& rhs )
{
  bool bval = false;
  switch ( op.token_id )
  {
  case TOK_EQUAL:
    bval = ( lhs.value != 0 ) == rhs.value;
    break;
  case TOK_NEQ:
    bval = ( lhs.value != 0 ) != rhs.value;
    break;
  case TOK_OR:
    bval = lhs.value || rhs.value;
    break;
  case TOK_AND:
    bval = lhs.value && 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 );
}
}  // namespace Pol::Bscript::Compiler

1	#include "BinaryOperatorWithIntegerOptimizer.h"
2
3	#include "bscript/compiler/Report.h"
4	#include "bscript/compiler/ast/BinaryOperator.h"
5	#include "bscript/compiler/ast/BooleanValue.h"
6	#include "bscript/compiler/ast/FloatValue.h"
7	#include "bscript/compiler/ast/IntegerValue.h"
8	#include "bscript/compiler/ast/StringValue.h"
9
10	namespace Pol::Bscript::Compiler
11	{
12	BinaryOperatorWithIntegerOptimizer::BinaryOperatorWithIntegerOptimizer( IntegerValue& lhs,	759✔
13	BinaryOperator& op,
14	Report& report )	759✔
15	: lhs( lhs ), op( op ), report( report )	759✔
16	{
17	}	759✔
18
19	void BinaryOperatorWithIntegerOptimizer::visit_children( Node& ) {}	36✔
20
21	void BinaryOperatorWithIntegerOptimizer::visit_integer_value( IntegerValue& rhs )	591✔
22	{
23	int value = 0;	591✔
24	switch ( op.token_id )	591✔
25	{
26	case TOK_ADD:	345✔
27	value = lhs.value + rhs.value;	345✔
28	break;	345✔
29	case TOK_SUBTRACT:	18✔
30	value = lhs.value - rhs.value;	18✔
31	break;	18✔
32	case TOK_MULT:	25✔
33	value = lhs.value * rhs.value;	25✔
34	break;	25✔
35	case TOK_DIV:	29✔
36	if ( rhs.value == 0 )	29✔
37	{
UNCOV 38	report.error( op, "Program would divide by zero" );	×
UNCOV 39	return;	×
40	}
41	value = lhs.value / rhs.value;	29✔
42	break;	29✔
43	case TOK_MODULUS:	15✔
44	if ( rhs.value == 0 )	15✔
45	{
UNCOV 46	report.error( op, "Program would divide by zero" );	×
UNCOV 47	return;	×
48	}
49	value = lhs.value % rhs.value;	15✔
50	break;	15✔
51
52	case TOK_EQUAL:	15✔
53	value = ( lhs.value == rhs.value );	15✔
54	break;	15✔
55	case TOK_NEQ:	6✔
56	value = ( lhs.value != rhs.value );	6✔
57	break;	6✔
58	case TOK_LESSTHAN:	63✔
59	value = ( lhs.value < rhs.value );	63✔
60	break;	63✔
61	case TOK_LESSEQ:	3✔
62	value = ( lhs.value <= rhs.value );	3✔
63	break;	3✔
64	case TOK_GRTHAN:	12✔
65	value = ( lhs.value > rhs.value );	12✔
66	break;	12✔
67	case TOK_GREQ:	3✔
68	value = ( lhs.value >= rhs.value );	3✔
69	break;	3✔
70
71	case TOK_AND:	3✔
72	value = ( lhs.value && rhs.value );	3✔
73	break;	3✔
74	case TOK_OR:	3✔
75	value = ( lhs.value \|\| rhs.value );	3✔
76	break;	3✔
77
78	case TOK_BSRIGHT:	3✔
79	value = ( lhs.value >> rhs.value );	3✔
80	break;	3✔
81	case TOK_BSLEFT:	3✔
82	value = ( lhs.value << rhs.value );	3✔
83	break;	3✔
84	case TOK_BITAND:	9✔
85	value = ( lhs.value & rhs.value );	9✔
86	break;	9✔
87	case TOK_BITOR:	30✔
88	value = ( lhs.value \| rhs.value );	30✔
89	break;	30✔
90	case TOK_BITXOR:	6✔
91	value = ( lhs.value ^ rhs.value );	6✔
92	break;	6✔
93
UNCOV 94	default:	×
UNCOV 95	return;	×
96	}
97
98	optimized_result = std::make_unique<IntegerValue>( op.source_location, value );	591✔
99	}
100
101	void BinaryOperatorWithIntegerOptimizer::visit_float_value( FloatValue& rhs )	66✔
102	{
103	auto setInt = [&]( int val )	48✔
104	{ optimized_result = std::make_unique<IntegerValue>( op.source_location, val ); };	48✔
105	auto setDouble = [&]( double val )	18✔
106	{ optimized_result = std::make_unique<FloatValue>( op.source_location, val ); };	18✔
107	auto eql = []( int a, double b ) { return fabs( a - b ) < 0.00000001; };	24✔
108	switch ( op.token_id )	66✔
109	{
110	case TOK_ADD:	3✔
111	setDouble( lhs.value + rhs.value );	3✔
112	break;	3✔
113	case TOK_SUBTRACT:	3✔
114	setDouble( lhs.value - rhs.value );	3✔
115	break;	3✔
116	case TOK_MULT:	6✔
117	setDouble( lhs.value * rhs.value );	6✔
118	break;	6✔
119	case TOK_DIV:	3✔
120	if ( rhs.value == 0 )	3✔
121	{
UNCOV 122	report.error( op, "Program would divide by zero" );	×
UNCOV 123	return;	×
124	}
125	setDouble( lhs.value / rhs.value );	3✔
126	break;	3✔
127	case TOK_MODULUS:	3✔
128	if ( rhs.value == 0 )	3✔
129	{
UNCOV 130	report.error( op, "Program would divide by zero" );	×
UNCOV 131	return;	×
132	}
133	setDouble( fmod( lhs.value, rhs.value ) );	3✔
134	break;	3✔
135	case TOK_EQUAL:	6✔
136	setInt( eql( lhs.value, rhs.value ) );	6✔
137	break;	6✔
138	case TOK_NEQ:	6✔
139	setInt( !eql( lhs.value, rhs.value ) );	6✔
140	break;	6✔
141	case TOK_LESSTHAN:	6✔
142	setInt( lhs.value < rhs.value );	6✔
143	break;	6✔
144	case TOK_LESSEQ:	6✔
145	setInt( eql( lhs.value, rhs.value ) \|\| ( lhs.value < rhs.value ) );	6✔
146	break;	6✔
147	case TOK_GRTHAN:	6✔
148	setInt( lhs.value > rhs.value );	6✔
149	break;	6✔
150	case TOK_GREQ:	6✔
151	setInt( eql( lhs.value, rhs.value ) \|\| ( lhs.value > rhs.value ) );	6✔
152	break;	6✔
153	case TOK_AND:	6✔
154	setInt( lhs.value != 0 && rhs.value != 0.0 );	6✔
155	break;	6✔
156	case TOK_OR:	6✔
157	setInt( lhs.value != 0 \|\| rhs.value != 0.0 );	6✔
158	break;	6✔
UNCOV 159	default:	×
UNCOV 160	break;	×
161	}
162	}
163
164	void BinaryOperatorWithIntegerOptimizer::visit_string_value( StringValue& rhs )	9✔
165	{
166	auto setString = [&]( std::string&& val )	9✔
167	{ optimized_result = std::make_unique<StringValue>( op.source_location, val ); };	9✔
168	switch ( op.token_id )	9✔
169	{
170	case TOK_ADD:	9✔
171	setString( fmt::format( "{}{}", lhs.value, rhs.value ) );	18✔
172	break;	9✔
UNCOV 173	default:	×
UNCOV 174	break;	×
175	}
176	}	9✔
177
178	void BinaryOperatorWithIntegerOptimizer::visit_boolean_value( BooleanValue& rhs )	12✔
179	{
180	bool bval = false;	12✔
181	switch ( op.token_id )	12✔
182	{
183	case TOK_EQUAL:	3✔
184	bval = ( lhs.value != 0 ) == rhs.value;	3✔
185	break;	3✔
186	case TOK_NEQ:	3✔
187	bval = ( lhs.value != 0 ) != rhs.value;	3✔
188	break;	3✔
189	case TOK_OR:	3✔
190	bval = lhs.value \|\| rhs.value;	3✔
191	break;	3✔
192	case TOK_AND:	3✔
193	bval = lhs.value && rhs.value;	3✔
194	break;	3✔
UNCOV 195	default:	×
UNCOV 196	return;	×
197	}
198
199	// Boolean logic operators return 1/0 as BLong, ie. `true \|\| false` == `1`
200	optimized_result = std::make_unique<IntegerValue>( op.source_location, bval );	12✔
201	}
202	} // namespace Pol::Bscript::Compiler

polserver / polserver / 25918451630

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous