1

/*

     2

 *  matiec - a compiler for the programming languages defined in IEC 61131-3

     3

 *

     4

 *  Copyright (C) 2009-2012  Mario de Sousa (msousa@fe.up.pt)

     5

 *  Copyright (C) 2012       Manuele Conti  (conti.ma@alice.it)

     6

 *

     7

 *

     8

 *  This program is free software: you can redistribute it and/or modify

     9

 *  it under the terms of the GNU General Public License as published by

    10

 *  the Free Software Foundation, either version 3 of the License, or

    11

 *  (at your option) any later version.

    12

 *

    13

 *  This program is distributed in the hope that it will be useful,

    14

 *  but WITHOUT ANY WARRANTY; without even the implied warranty of

    15

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    16

 *  GNU General Public License for more details.

    17

 *

    18

 *  You should have received a copy of the GNU General Public License

    19

 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.

    20

 *

    21

 *

    22

 * This code is made available on the understanding that it will not be

    23

 * used in safety-critical situations without a full and competent review.

    24

 */

    25

    26

/*

    27

 * An IEC 61131-3 compiler.

    28

 *

    29

 * Based on the

    30

 * FINAL DRAFT - IEC 61131-3, 2nd Ed. (2001-12-10)

    31

 *

    32

 */

    33

    34

    35

/*

    36

 * Array Range Checking:

    37

 *   - Check whether array subscript values fall within the allowed range.

    38

 *     Note that for the checking of subscript values to work correctly, we need to have constant folding working too:

    39

 *     array_var[8 + 99] can not be checked without constant folding.

    40

 */

    41

    42

    43

#include "array_range_check.hh"

    44

#include <limits>  // required for std::numeric_limits<XXX>

    45

    46

    47

#define FIRST_(symbol1, symbol2) (((symbol1)->first_order < (symbol2)->first_order)   ? (symbol1) : (symbol2))

    48

#define  LAST_(symbol1, symbol2) (((symbol1)->last_order  > (symbol2)->last_order)    ? (symbol1) : (symbol2))

    49

    50

#define STAGE3_ERROR(error_level, symbol1, symbol2, ...) {                                                                  \

    51

  if (current_display_error_level >= error_level) {                                                                         \

    52

    fprintf(stderr, "%s:%d-%d..%d-%d: error: ",                                                                             \

    53

            FIRST_(symbol1,symbol2)->first_file, FIRST_(symbol1,symbol2)->first_line, FIRST_(symbol1,symbol2)->first_column,\

    54

                                                 LAST_(symbol1,symbol2) ->last_line,  LAST_(symbol1,symbol2) ->last_column);\

    55

    fprintf(stderr, __VA_ARGS__);                                                                                           \

    56

    fprintf(stderr, "\n");                                                                                                  \

    57

    error_count++;                                                                                                     \

    58

  }                                                                                                                         \

    59

}

    60

    61

    62

#define STAGE3_WARNING(symbol1, symbol2, ...) {                                                                             \

    63

    fprintf(stderr, "%s:%d-%d..%d-%d: warning: ",                                                                           \

    64

            FIRST_(symbol1,symbol2)->first_file, FIRST_(symbol1,symbol2)->first_line, FIRST_(symbol1,symbol2)->first_column,\

    65

                                                 LAST_(symbol1,symbol2) ->last_line,  LAST_(symbol1,symbol2) ->last_column);\

    66

    fprintf(stderr, __VA_ARGS__);                                                                                           \

    67

    fprintf(stderr, "\n");                                                                                                  \

    68

    warning_found = true;                                                                                                   \

    69

}

    70

    71

#define GET_CVALUE(dtype, symbol)             ((symbol)->const_value._##dtype.value)

    72

#define VALID_CVALUE(dtype, symbol)           (symbol_c::cs_const_value == (symbol)->const_value._##dtype.status)

    73

    74

/*  The cmp_unsigned_signed function compares two numbers u and s.

    75

 *  It returns an integer indicating the relationship between the numbers:

    76

 *  - A zero value indicates that both numbers are equal.

    77

 *  - A value greater than zero indicates that numbers does not match and

    78

 *    first has a greater value.

    79

 *  - A value less than zero indicates that numbers does not match and

    80

 *    first has a lesser value.

    81

 */

    82

static inline int cmp_unsigned_signed(const uint64_t u, const int64_t s) {

    83

  const uint64_t INT64_MAX_uvar = INT64_MAX;

    84

  if (u <= INT64_MAX_uvar)

    85

    return ((int64_t)u - s);

    86

  return -1;

    87

}

    88

    89

array_range_check_c::array_range_check_c(symbol_c *ignore) {

    90

	error_count = 0;

    91

	current_display_error_level = 0;

    92

}

    93

    94

    95

    96

array_range_check_c::~array_range_check_c(void) {

    97

}

    98

    99

   100

   101

int array_range_check_c::get_error_count() {

   102

	return error_count;

   103

}

   104

   105

   106

   107

void array_range_check_c::check_dimension_count(array_variable_c *symbol) {

   108

	int dimension_count;

   109

	symbol_c *var_decl;

   110

   111

	var_decl = search_varfb_instance_type->get_basetype_decl(symbol->subscripted_variable);

   112

	array_dimension_iterator_c array_dimension_iterator(var_decl);

   113

	for (dimension_count = 0; NULL != array_dimension_iterator.next(); dimension_count++);

   114

	if (dimension_count != ((list_c *)symbol->subscript_list)->n)

   115

		STAGE3_ERROR(0, symbol, symbol, "Number of subscripts/indexes does not match the number of subscripts/indexes in the array's declaration (array has %d indexes)", dimension_count);

   116

}

   117

   118

   119

   120

void array_range_check_c::check_bounds(array_variable_c *symbol) {

   121

  list_c *l; /* the subscript_list */

   122

  symbol_c *var_decl;

   123

   124

  l = (list_c *)symbol->subscript_list;

   125

  var_decl = search_varfb_instance_type->get_basetype_decl(symbol->subscripted_variable);

   126

  array_dimension_iterator_c array_dimension_iterator(var_decl);

   127

  for (int i =  0; i < l->n; i++) {

   128

    subrange_c *dimension = array_dimension_iterator.next();

   129

    /* mismatch between number of indexes/subscripts. This error will be caught in check_dimension_count() so we ignore it. */

   130

    if (NULL == dimension) 

   131

      return;

   132

   133

    /* Check lower limit */

   134

    if ( VALID_CVALUE( int64, l->elements[i]) && VALID_CVALUE( int64, dimension->lower_limit))

   135

      if ( GET_CVALUE( int64, l->elements[i]) < GET_CVALUE( int64, dimension->lower_limit) )

   136

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be >= %"PRId64").", GET_CVALUE( int64, dimension->lower_limit)); continue;}

   137

   138

    if ( VALID_CVALUE( int64, l->elements[i]) && VALID_CVALUE(uint64, dimension->lower_limit))

   139

      if ( cmp_unsigned_signed( GET_CVALUE(uint64, dimension->lower_limit), GET_CVALUE( int64, l->elements[i])) > 0 )

   140

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be >= %"PRIu64").", GET_CVALUE(uint64, dimension->lower_limit)); continue;}

   141

   142

    if ( VALID_CVALUE(uint64, l->elements[i]) && VALID_CVALUE(uint64, dimension->lower_limit))

   143

      if ( GET_CVALUE(uint64, l->elements[i])   <  GET_CVALUE(uint64, dimension->lower_limit))

   144

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be >= %"PRIu64").", GET_CVALUE(uint64, dimension->lower_limit)); continue;}

   145

   146

    if ( VALID_CVALUE(uint64, l->elements[i]) && VALID_CVALUE( int64, dimension->lower_limit))

   147

      if ( cmp_unsigned_signed(GET_CVALUE(uint64, l->elements[i]), GET_CVALUE( int64, dimension->lower_limit)) < 0 )

   148

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be >= %"PRId64").", GET_CVALUE( int64, dimension->lower_limit)); continue;}

   149

   150

    /* Repeat the same check, now for upper limit */

   151

    if ( VALID_CVALUE( int64, l->elements[i]) && VALID_CVALUE( int64, dimension->upper_limit))

   152

      if ( GET_CVALUE( int64, l->elements[i])   >  GET_CVALUE( int64, dimension->upper_limit))

   153

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be <= %"PRId64").", GET_CVALUE( int64, dimension->upper_limit)); continue;}

   154

   155

    if ( VALID_CVALUE( int64, l->elements[i]) && VALID_CVALUE(uint64, dimension->upper_limit))

   156

      if ( cmp_unsigned_signed( GET_CVALUE(uint64, dimension->upper_limit), GET_CVALUE( int64, l->elements[i])) < 0 )

   157

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be <= %"PRIu64").", GET_CVALUE(uint64, dimension->upper_limit)); continue;}

   158

   159

    if ( VALID_CVALUE(uint64, l->elements[i]) && VALID_CVALUE(uint64, dimension->upper_limit))

   160

      if ( GET_CVALUE(uint64, l->elements[i])   >  GET_CVALUE(uint64, dimension->upper_limit))

   161

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be <= %"PRIu64").", GET_CVALUE(uint64, dimension->upper_limit)); continue;}

   162

   163

    if ( VALID_CVALUE(uint64, l->elements[i]) && VALID_CVALUE( int64, dimension->upper_limit))

   164

      if ( cmp_unsigned_signed(GET_CVALUE(uint64, l->elements[i]), GET_CVALUE( int64, dimension->upper_limit)) > 0 )

   165

      {STAGE3_ERROR(0, symbol, symbol, "Array access out of bounds (should be <= %"PRId64").", GET_CVALUE( int64, dimension->upper_limit)); continue;}

   166

   167

  }

   168

}

   169

   170

   171

   172

   173

   174

   175

   176

   177

   178

/*************************/

   179

/* B.1 - Common elements */

   180

/*************************/

   181

/**********************/

   182

/* B.1.3 - Data types */

   183

/**********************/

   184

/********************************/

   185

/* B 1.3.3 - Derived data types */

   186

/********************************/

   187

   188

/*  signed_integer DOTDOT signed_integer */

   189

/* dimension will be filled in during stage 3 (array_range_check_c) with the number of elements in this subrange */

   190

// SYM_REF2(subrange_c, lower_limit, upper_limit, unsigned long long int dimension)

   191

void *array_range_check_c::visit(subrange_c *symbol) {

   192

	unsigned long long int dimension = 0; // we use unsigned long long instead of uint64_t since it might just happen to be larger than uint64_t in the platform used for compiling this code!!

   193

   194

	/* Determine the size of the array... */

   195

	if        (VALID_CVALUE( int64, symbol->upper_limit) && VALID_CVALUE( int64, symbol->lower_limit)) {  

   196

		// do the sums in such a way that no overflow is possible... even during intermediate steps used by compiler!

   197

		// remember that the result (dimension) is unsigned, while the operands are signed!!

   198

		// dimension = GET_CVALUE( int64, symbol->upper_limit) - VALID_CVALUE( int64, symbol->lower_limit);

   199

		if (GET_CVALUE( int64, symbol->lower_limit) >= 0) {

   200

			dimension = GET_CVALUE( int64, symbol->upper_limit) - GET_CVALUE( int64, symbol->lower_limit);

   201

		} else {

   202

			dimension  = -GET_CVALUE( int64, symbol->lower_limit);

   203

			dimension +=  GET_CVALUE( int64, symbol->upper_limit);     

   204

		}

   205

	} else if (VALID_CVALUE(uint64, symbol->upper_limit) && VALID_CVALUE(uint64, symbol->lower_limit)) {

   206

		dimension = GET_CVALUE(uint64, symbol->upper_limit) - GET_CVALUE(uint64, symbol->lower_limit); 

   207

	} else if (VALID_CVALUE(uint64, symbol->upper_limit) && VALID_CVALUE( int64, symbol->lower_limit)) {

   208

		if (GET_CVALUE( int64, symbol->lower_limit) >= 0) {

   209

			dimension = GET_CVALUE(uint64, symbol->upper_limit) - GET_CVALUE( int64, symbol->lower_limit);

   210

		} else {

   211

			unsigned long long int lower_ull;

   212

			lower_ull  = -GET_CVALUE( int64, symbol->lower_limit);

   213

			dimension  =  GET_CVALUE(uint64, symbol->upper_limit) + lower_ull;     

   214

			if (dimension < lower_ull)

   215

				STAGE3_ERROR(0, symbol, symbol, "Number of elements in array subrange exceeds maximum number of elements (%llu).", std::numeric_limits< unsigned long long int >::max());

   216

		}

   217

	} else ERROR;

   218

   219

	/* correct value for dimension is actually ---> dimension = upper_limit - lower_limit + 1

   220

	 * Up to now, we have only determined dimension = upper_limit - lower_limit

   221

	 * We must first check whether this last increment will cause an overflow!

   222

	 */

   223

	if (dimension == std::numeric_limits< unsigned long long int >::max())

   224

		STAGE3_ERROR(0, symbol, symbol, "Number of elements in array subrange exceeds maximum number of elements (%llu).", std::numeric_limits< unsigned long long int >::max());

   225

   226

	/* correct value for dimension is actually ---> dimension = upper_limit - lower_limit + 1 */

   227

	dimension++; 

   228

   229

	symbol->dimension = dimension;

   230

	return NULL;

   231

}

   232

   233

   234

   235

   236

   237

/* integer '(' [array_initial_element] ')' */

   238

/* array_initial_element may be NULL ! */

   239

// SYM_REF2(array_initial_elements_c, integer, array_initial_element)

   240

void *array_range_check_c::visit(array_initial_elements_c *symbol) {

   241

	if (VALID_CVALUE( int64, symbol->integer) && (GET_CVALUE( int64, symbol->integer) < 0)) 

   242

		ERROR; /* the IEC 61131-3 syntax guarantees that this value will never be negative! */

   243

   244

	/* TODO: check that the total number of 'initial values' does not exceed the size of the array! */

   245

   246

	return NULL;

   247

}

   248

   249

   250

   251

   252

   253

   254

   255

   256

   257

/*********************/

   258

/* B 1.4 - Variables */

   259

/*********************/

   260

/*************************************/

   261

/* B 1.4.2 - Multi-element variables */

   262

/*************************************/

   263

void *array_range_check_c::visit(array_variable_c *symbol) {

   264

	check_dimension_count(symbol);

   265

	check_bounds(symbol);

   266

	return NULL;

   267

}

   268

   269

   270

/**************************************/

   271

/* B 1.5 - Program organisation units */

   272

/**************************************/

   273

/***********************/

   274

/* B 1.5.1 - Functions */

   275

/***********************/

   276

// SYM_REF4(function_declaration_c, derived_function_name, type_name, var_declarations_list, function_body)

   277

void *array_range_check_c::visit(function_declaration_c *symbol) {

   278

	symbol->var_declarations_list->accept(*this); // required for visiting subrange_c

   279

	search_varfb_instance_type = new search_varfb_instance_type_c(symbol);

   280

	// search_var_instance_decl = new search_var_instance_decl_c(symbol);

   281

	symbol->function_body->accept(*this);

   282

	delete search_varfb_instance_type;

   283

	// delete search_var_instance_decl;

   284

	search_varfb_instance_type = NULL;

   285

	// search_var_instance_decl = NULL;

   286

	return NULL;

   287

}

   288

   289

/*****************************/

   290

/* B 1.5.2 - Function blocks */

   291

/*****************************/

   292

// SYM_REF3(function_block_declaration_c, fblock_name, var_declarations, fblock_body)

   293

void *array_range_check_c::visit(function_block_declaration_c *symbol) {

   294

	symbol->var_declarations->accept(*this); // required for visiting subrange_c

   295

	search_varfb_instance_type = new search_varfb_instance_type_c(symbol);

   296

	// search_var_instance_decl = new search_var_instance_decl_c(symbol);

   297

	symbol->fblock_body->accept(*this);

   298

	delete search_varfb_instance_type;

   299

	// delete search_var_instance_decl;

   300

	search_varfb_instance_type = NULL;

   301

	// search_var_instance_decl = NULL;

   302

	return NULL;

   303

}

   304

   305

/**********************/

   306

/* B 1.5.3 - Programs */

   307

/**********************/

   308

// SYM_REF3(program_declaration_c, program_type_name, var_declarations, function_block_body)

   309

void *array_range_check_c::visit(program_declaration_c *symbol) {

   310

	symbol->var_declarations->accept(*this); // required for visiting subrange_c

   311

	search_varfb_instance_type = new search_varfb_instance_type_c(symbol);

   312

	// search_var_instance_decl = new search_var_instance_decl_c(symbol);

   313

	symbol->function_block_body->accept(*this);

   314

	delete search_varfb_instance_type;

   315

	// delete search_var_instance_decl;

   316

	search_varfb_instance_type = NULL;

   317

	// search_var_instance_decl = NULL;

   318

	return NULL;

   319

}

   320

   321

   322