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 (manuele.conti@sirius-es.it)

     6

 *  Copyright (C) 2012       Matteo Facchinetti (matteo.facchinetti@sirius-es.it)

     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

/* TODO - things yet not checked by this data type checker...

    36

 *

    37

 * - check variable declarations

    38

 * - check data type declarations

    39

 * - check inside configurations (variable declarations)

    40

 * - check SFC code

    41

 * - must fix S and R IL functions (includes potientialy fixing stage4 code!) 

    42

 */

    43

    44

    45

/* NOTE: The algorithm implemented here assumes that flow control analysis has already been completed!

    46

 *       BEFORE running this visitor, be sure to CALL the flow_control_analysis_c visitor!

    47

 */

    48

    49

    50

/*

    51

 *  Fill the candidate datatype list for all symbols that may legally 'have' a data type (e.g. variables, literals, function calls, expressions, etc.)

    52

 * 

    53

 *  The candidate datatype list will be filled with a list of all the data types that expression may legally take.

    54

 *  For example, the very simple literal '0' (as in foo := 0), may represent a:

    55

 *    BOOL, BYTE, WORD, DWORD, LWORD, USINT, SINT, UINT, INT, UDINT, DINT, ULINT, LINT (as well as the SAFE versions of these data tyes too!)

    56

 */

    57

    58

#include <../main.hh>         /* required for UINT64_MAX, INT64_MAX, INT64_MIN, ... */

    59

#include "fill_candidate_datatypes.hh"

    60

#include "datatype_functions.hh"

    61

#include <typeinfo>

    62

#include <list>

    63

#include <string>

    64

#include <string.h>

    65

#include <strings.h>

    66

    67

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

    68

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

    69

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

    70

    71

/* set to 1 to see debug info during execution */

    72

static int debug = 0;

    73

    74

fill_candidate_datatypes_c::fill_candidate_datatypes_c(symbol_c *ignore) {

    75

	il_operand = NULL;

    76

	prev_il_instruction = NULL;

    77

	search_varfb_instance_type = NULL;

    78

}

    79

    80

fill_candidate_datatypes_c::~fill_candidate_datatypes_c(void) {

    81

}

    82

    83

symbol_c *fill_candidate_datatypes_c::widening_conversion(symbol_c *left_type, symbol_c *right_type, const struct widen_entry widen_table[]) {

    84

	int k;

    85

	/* find a widening table entry compatible */

    86

	for (k = 0; NULL != widen_table[k].left;  k++)

    87

		if ((typeid(*left_type) == typeid(*widen_table[k].left)) && (typeid(*right_type) == typeid(*widen_table[k].right)))

    88

                      return widen_table[k].result;

    89

	return NULL;

    90

}

    91

    92

    93

/* add a data type to a candidate data type list, while guaranteeing no duplicate entries! */

    94

/* Returns true if it really did add the datatype to the list, or false if it was already present in the list! */

    95

bool fill_candidate_datatypes_c::add_datatype_to_candidate_list(symbol_c *symbol, symbol_c *datatype) {

    96

  /* If it is an invalid data type, do not insert!

    97

   * NOTE: it reduces overall code size to do this test here, instead of doing every time before calling the add_datatype_to_candidate_list() function. 

    98

   */

    99

  if (!is_type_valid(datatype)) /* checks for NULL and invalid_type_name_c */

   100

    return false;

   101

   102

  if (search_in_candidate_datatype_list(datatype, symbol->candidate_datatypes) >= 0) 

   103

    /* already in the list, Just return! */

   104

    return false;

   105

   106

  /* not yet in the candidate data type list, so we insert it now! */

   107

  symbol->candidate_datatypes.push_back(datatype);

   108

  return true;

   109

}

   110

   111

   112

bool fill_candidate_datatypes_c::add_2datatypes_to_candidate_list(symbol_c *symbol, symbol_c *datatype1, symbol_c *datatype2) {

   113

  add_datatype_to_candidate_list(symbol, datatype1);

   114

  add_datatype_to_candidate_list(symbol, datatype2);

   115

  return true;

   116

}

   117

   118

   119

   120

void fill_candidate_datatypes_c::remove_incompatible_datatypes(symbol_c *symbol) {

   121

  #ifdef __REMOVE__

   122

    #error __REMOVE__ macro already exists. Choose another name!

   123

  #endif

   124

  #define __REMOVE__(datatype)\

   125

      remove_from_candidate_datatype_list(&search_constant_type_c::datatype,       symbol->candidate_datatypes);\

   126

      remove_from_candidate_datatype_list(&search_constant_type_c::safe##datatype, symbol->candidate_datatypes);

   127

   128

  {/* Remove unsigned data types */

   129

    uint64_t value = 0;

   130

    if (VALID_CVALUE( uint64, symbol)) value = GET_CVALUE(uint64, symbol);

   131

    if (IS_OVERFLOW ( uint64, symbol)) value = (uint64_t)UINT32_MAX + (uint64_t)1;

   132

   133

    if (value > 1          )          {__REMOVE__(bool_type_name);}

   134

    if (value > UINT8_MAX  )          {__REMOVE__(usint_type_name);  __REMOVE__( byte_type_name);}

   135

    if (value > UINT16_MAX )          {__REMOVE__( uint_type_name);  __REMOVE__( word_type_name);}

   136

    if (value > UINT32_MAX )          {__REMOVE__(udint_type_name);  __REMOVE__(dword_type_name);}

   137

    if (IS_OVERFLOW( uint64, symbol)) {__REMOVE__(ulint_type_name);  __REMOVE__(lword_type_name);}

   138

  }

   139

   140

  {/* Remove signed data types */

   141

    int64_t value = 0;

   142

    if (VALID_CVALUE(  int64, symbol)) value = GET_CVALUE(int64, symbol);

   143

    if (IS_OVERFLOW (  int64, symbol)) value = (int64_t)INT32_MAX + (int64_t)1;

   144

   145

    if ((value <  INT8_MIN) || (value >  INT8_MAX)) {__REMOVE__(sint_type_name);}

   146

    if ((value < INT16_MIN) || (value > INT16_MAX)) {__REMOVE__( int_type_name);}

   147

    if ((value < INT32_MIN) || (value > INT32_MAX)) {__REMOVE__(dint_type_name);}

   148

    if (IS_OVERFLOW( int64, symbol))                {__REMOVE__(lint_type_name);}

   149

  }

   150

   151

  {/* Remove floating point data types */

   152

    real64_t value = 0;

   153

    if (VALID_CVALUE( real64, symbol)) value = GET_CVALUE(real64, symbol);

   154

    if (IS_OVERFLOW ( real64, symbol)) value = (real64_t)REAL32_MAX + (real64_t)1;

   155

    if (value >  REAL32_MAX )         {__REMOVE__( real_type_name);}

   156

    if (value < -REAL32_MAX )         {__REMOVE__( real_type_name);}

   157

    if (IS_OVERFLOW( real64, symbol)) {__REMOVE__(lreal_type_name);}

   158

  }

   159

  #undef __REMOVE__

   160

}

   161

   162

   163

/* returns true if compatible function/FB invocation, otherwise returns false */

   164

/* Assumes that the candidate_datatype lists of all the parameters being passed haved already been filled in */

   165

/*

   166

 * All parameters being passed to the called function MUST be in the parameter list to which f_call points to!

   167

 * This means that, for non formal function calls in IL, de current (default value) must be artificially added to the

   168

 * beginning of the parameter list BEFORE calling handle_function_call().

   169

 */

   170

bool fill_candidate_datatypes_c::match_nonformal_call(symbol_c *f_call, symbol_c *f_decl) {

   171

	symbol_c *call_param_value,  *param_datatype;

   172

	identifier_c *param_name;

   173

	function_param_iterator_c       fp_iterator(f_decl);

   174

	function_call_param_iterator_c fcp_iterator(f_call);

   175

	int extensible_parameter_highest_index = -1;

   176

	unsigned int i;

   177

   178

	/* Iterating through the non-formal parameters of the function call */

   179

	while((call_param_value = fcp_iterator.next_nf()) != NULL) {

   180

		/* Iterate to the next parameter of the function being called.

   181

		 * Get the name of that parameter, and ignore if EN or ENO.

   182

		 */

   183

		do {

   184

			param_name = fp_iterator.next();

   185

			/* If there is no other parameter declared, then we are passing too many parameters... */

   186

			if(param_name == NULL) return false;

   187

		} while ((strcmp(param_name->value, "EN") == 0) || (strcmp(param_name->value, "ENO") == 0));

   188

   189

		/* TODO: verify if it is lvalue when INOUT or OUTPUT parameters! */

   190

		/* Get the parameter type */

   191

		param_datatype = base_type(fp_iterator.param_type());

   192

   193

		/* check whether one of the candidate_data_types of the value being passed is the same as the param_type */

   194

		if (search_in_candidate_datatype_list(param_datatype, call_param_value->candidate_datatypes) < 0)

   195

			return false; /* return false if param_type not in the list! */

   196

	}

   197

	/* call is compatible! */

   198

	return true;

   199

}

   200

   201

   202

   203

/* returns true if compatible function/FB invocation, otherwise returns false */

   204

/* Assumes that the candidate_datatype lists of all the parameters being passed haved already been filled in */

   205

bool fill_candidate_datatypes_c::match_formal_call(symbol_c *f_call, symbol_c *f_decl, symbol_c **first_param_datatype) {

   206

	symbol_c *call_param_value, *call_param_name, *param_datatype;

   207

	symbol_c *verify_duplicate_param;

   208

	identifier_c *param_name;

   209

	function_param_iterator_c       fp_iterator(f_decl);

   210

	function_call_param_iterator_c fcp_iterator(f_call);

   211

	int extensible_parameter_highest_index = -1;

   212

	identifier_c *extensible_parameter_name;

   213

	unsigned int i;

   214

	bool is_first_param = true;

   215

   216

	/* Iterating through the formal parameters of the function call */

   217

	while((call_param_name = fcp_iterator.next_f()) != NULL) {

   218

		/* Obtaining the value being passed in the function call */

   219

		call_param_value = fcp_iterator.get_current_value();

   220

		/* the following should never occur. If it does, then we have a bug in our code... */

   221

		if (NULL == call_param_value) ERROR;

   222

   223

		/* Obtaining the assignment direction:  := (assign_in) or => (assign_out) */

   224

		function_call_param_iterator_c::assign_direction_t call_param_dir = fcp_iterator.get_assign_direction();

   225

   226

		/* Checking if there are duplicated parameter values */

   227

		verify_duplicate_param = fcp_iterator.search_f(call_param_name);

   228

		if(verify_duplicate_param != call_param_value)

   229

			return false;

   230

   231

		/* Obtaining the type of the value being passed in the function call */

   232

		std::vector <symbol_c *>&call_param_types = call_param_value->candidate_datatypes;

   233

   234

		/* Find the corresponding parameter in function declaration */

   235

		param_name = fp_iterator.search(call_param_name);

   236

		if(param_name == NULL) return false;

   237

		/* Get the parameter data type */

   238

		param_datatype = base_type(fp_iterator.param_type());

   239

		/* Get the parameter direction: IN, OUT, IN_OUT */

   240

		function_param_iterator_c::param_direction_t param_dir = fp_iterator.param_direction();

   241

   242

		/* check whether direction (IN, OUT, IN_OUT) and assignment types (:= , =>) are compatible !!! */

   243

		if          (function_call_param_iterator_c::assign_in  == call_param_dir) {

   244

			if ((function_param_iterator_c::direction_in    != param_dir) &&

   245

			    (function_param_iterator_c::direction_inout != param_dir))

   246

				return false;

   247

		} else if   (function_call_param_iterator_c::assign_out == call_param_dir) {

   248

			if ((function_param_iterator_c::direction_out   != param_dir))

   249

				return false;

   250

		} else ERROR;

   251

   252

		/* check whether one of the candidate_data_types of the value being passed is the same as the param_type */

   253

		if (search_in_candidate_datatype_list(param_datatype, call_param_types) < 0)

   254

			return false; /* return false if param_type not in the list! */

   255

   256

		/* If this is the first parameter, then copy the datatype to *first_param_datatype */

   257

		if (is_first_param)

   258

			if (NULL != first_param_datatype)

   259

				*first_param_datatype = param_datatype;

   260

		is_first_param = false;

   261

	}

   262

	/* call is compatible! */

   263

	return true;

   264

}

   265

   266

   267

   268

   269

/* Handle a generic function call!

   270

 * Assumes that the parameter_list containing the values being passed in this function invocation

   271

 * has already had all the candidate_datatype lists filled in!

   272

 *

   273

 * All parameters being passed to the called function MUST be in the parameter list to which f_call points to!

   274

 * This means that, for non formal function calls in IL, de current (default value) must be artificially added to the

   275

 * beginning of the parameter list BEFORE calling handle_function_call().

   276

 */

   277

/*

   278

typedef struct {

   279

  symbol_c *function_name,

   280

  symbol_c *nonformal_operand_list,

   281

  symbol_c *   formal_operand_list,

   282

   283

  std::vector <symbol_c *> &candidate_functions,  

   284

  symbol_c &*called_function_declaration,

   285

  int      &extensible_param_count

   286

} generic_function_call_t;

   287

*/

   288

/*

   289

void narrow_candidate_datatypes_c::narrow_function_invocation(symbol_c *fcall, generic_function_call_t fcall_data) {

   290

void *fill_candidate_datatypes_c::handle_function_call(symbol_c *f_call, symbol_c *function_name, invocation_type_t invocation_type,

   291

                                                       std::vector <symbol_c *> *candidate_datatypes,

   292

                                                       std::vector <symbol_c *> *candidate_functions) {

   293

  */

   294

void fill_candidate_datatypes_c::handle_function_call(symbol_c *fcall, generic_function_call_t fcall_data) {

   295

	function_declaration_c *f_decl;

   296

	list_c *parameter_list;

   297

	list_c *parameter_candidate_datatypes;

   298

	symbol_c *returned_parameter_type;

   299

   300

	if (debug) std::cout << "function()\n";

   301

   302

	function_symtable_t::iterator lower = function_symtable.lower_bound(fcall_data.function_name);

   303

	function_symtable_t::iterator upper = function_symtable.upper_bound(fcall_data.function_name);

   304

	/* If the name of the function being called is not found in the function symbol table, then this is an invalid call */

   305

	/* Since the lexical parser already checks for this, then if this occurs then we have an internal compiler error. */

   306

	if (lower == function_symtable.end()) ERROR;

   307

   308

	/* Look for all compatible function declarations, and add their return datatypes 

   309

	 * to the candidate_datatype list of this function invocation. 

   310

	 *

   311

	 * If only one function exists, we add its return datatype to the candidate_datatype list,

   312

	 * even if the parameters passed to it are invalid.

   313

	 * This guarantees that the remainder of the expression in which the function call is inserted

   314

	 * is treated as if the function call returns correctly, and therefore does not generate

   315

	 * spurious error messages.

   316

	 * Even if the parameters to the function call are invalid, doing this is still safe, as the 

   317

	 * expressions inside the function call will themselves have erros and will  guarantee that 

   318

	 * compilation is aborted in stage3 (in print_datatypes_error_c).

   319

	 */

   320

	if (function_symtable.multiplicity(fcall_data.function_name) == 1) {

   321

		f_decl = function_symtable.get_value(lower);

   322

		returned_parameter_type = base_type(f_decl->type_name);

   323

		if (add_datatype_to_candidate_list(fcall, returned_parameter_type))

   324

			/* we only add it to the function declaration list if this entry was not already present in the candidate datatype list! */

   325

			fcall_data.candidate_functions.push_back(f_decl);

   326

   327

	}

   328

	for(; lower != upper; lower++) {

   329

		bool compatible = false;

   330

   331

		f_decl = function_symtable.get_value(lower);

   332

		/* Check if function declaration in symbol_table is compatible with parameters */

   333

		if (NULL != fcall_data.nonformal_operand_list) compatible=match_nonformal_call(fcall, f_decl);

   334

		if (NULL != fcall_data.   formal_operand_list) compatible=   match_formal_call(fcall, f_decl);

   335

		if (compatible) {

   336

			/* Add the data type returned by the called functions. 

   337

			 * However, only do this if this data type is not already present in the candidate_datatypes list_c

   338

			 */

   339

			returned_parameter_type = base_type(f_decl->type_name);		

   340

			if (add_datatype_to_candidate_list(fcall, returned_parameter_type))

   341

				/* we only add it to the function declaration list if this entry was not already present in the candidate datatype list! */

   342

				fcall_data.candidate_functions.push_back(f_decl);

   343

		}

   344

	}

   345

	if (debug) std::cout << "end_function() [" << fcall->candidate_datatypes.size() << "] result.\n";

   346

	return;

   347

}

   348

   349

   350

/* handle implicit FB call in IL.

   351

 * e.g.  CLK ton_var

   352

 *        CU counter_var

   353

 */

   354

void *fill_candidate_datatypes_c::handle_implicit_il_fb_call(symbol_c *il_instruction, const char *param_name, symbol_c *&called_fb_declaration) {

   355

	symbol_c *fb_type_id = search_varfb_instance_type->get_basetype_id(il_operand);

   356

  	/* Although a call to a non-declared FB is a semantic error, this is currently caught by stage 2! */

   357

	if (NULL == fb_type_id) ERROR;

   358

   359

	function_block_declaration_c *fb_decl = function_block_type_symtable.find_value(fb_type_id);

   360

	if (function_block_type_symtable.end_value() == fb_decl)

   361

		/* The il_operand is not the name of a FB instance. Most probably it is the name of a variable of some other type.

   362

		 * this is a semantic error.

   363

		 */

   364

		fb_decl = NULL;

   365

   366

	/* The narrow_candidate_datatypes_c does not rely on this called_fb_declaration pointer being == NULL to conclude that

   367

	 * we have a datatype incompatibility error, so we set it to fb_decl to allow the print_datatype_error_c to print out

   368

	 * more informative error messages!

   369

	 */

   370

	called_fb_declaration = fb_decl;

   371

   372

	/* This implicit FB call does not change the value stored in the current/default IL variable */

   373

	/* It does, however, require that the datatype be compatible with the input parameter of the FB being called. 

   374

	 * If we were to follow the filling & narrowing algorithm correctly (implemented in fill_candidate_datatypes_c

   375

	 * & narrow_candidate_datatypes_c respectively), we should be restricting the candidate_datatpes to the datatypes

   376

	 * that are compatible to the FB call. 

   377

	 * However, doing the above will often result in some very confusing error messages for the user, especially in the case

   378

	 * in which the FB call is wrong, so the resulting cadidate datatypes is an empty list. In this case, the user would see

   379

	 * many error messages related to the IL instructions that follow the FB call, even though those IL instructions may be perfectly

   380

	 * correct.

   381

	 * For now, we will simply let the narrow_candidate_datatypes_c verify if the datatypes are compatible (something that should be done

   382

	 * here).

   383

	 */

   384

	if (NULL != prev_il_instruction)

   385

		il_instruction->candidate_datatypes = prev_il_instruction->candidate_datatypes; 

   386

   387

	if (debug) std::cout << "handle_implicit_il_fb_call() [" << prev_il_instruction->candidate_datatypes.size() << "] ==> " << il_instruction->candidate_datatypes.size() << " result.\n";

   388

	return NULL;

   389

}

   390

   391

   392

   393

   394

/* handle a binary IL operator, like ADD, SUB, etc... */

   395

void *fill_candidate_datatypes_c::handle_binary_operator(const struct widen_entry widen_table[], symbol_c *symbol, symbol_c *l_expr, symbol_c *r_expr) {

   396

	if (NULL == l_expr) /* if no prev_il_instruction */

   397

		return NULL; 

   398

   399

	for(unsigned int i = 0; i < l_expr->candidate_datatypes.size(); i++)

   400

		for(unsigned int j = 0; j < r_expr->candidate_datatypes.size(); j++)

   401

			/* NOTE: add_datatype_to_candidate_list() will only really add the datatype if it is != NULL !!! */

   402

			add_datatype_to_candidate_list(symbol, widening_conversion(l_expr->candidate_datatypes[i], r_expr->candidate_datatypes[j], widen_table));

   403

	remove_incompatible_datatypes(symbol);

   404

	if (debug) std::cout <<  "[" << l_expr->candidate_datatypes.size() << "," << r_expr->candidate_datatypes.size() << "] ==> "  << symbol->candidate_datatypes.size() << " result.\n";

   405

	return NULL;

   406

}

   407

   408

   409

   410

/* handle a binary ST expression, like '+', '-', etc... */

   411

void *fill_candidate_datatypes_c::handle_binary_expression(const struct widen_entry widen_table[], symbol_c *symbol, symbol_c *l_expr, symbol_c *r_expr) {

   412

	l_expr->accept(*this);

   413

	r_expr->accept(*this);

   414

	return handle_binary_operator(widen_table, symbol, l_expr, r_expr);

   415

}

   416

   417

   418

   419

/* handle the two equality comparison operations, i.e. = (euqal) and != (not equal) */

   420

/* This function is special, as it will also allow enumeration data types to be compared, with the result being a BOOL data type!

   421

 * This possibility os not expressed in the 'widening' tables, so we need to hard code it here

   422

 */

   423

void *fill_candidate_datatypes_c::handle_equality_comparison(const struct widen_entry widen_table[], symbol_c *symbol, symbol_c *l_expr, symbol_c *r_expr) {

   424

	search_base_type_c search_base_type;

   425

	handle_binary_expression(widen_table, symbol, l_expr, r_expr);

   426

	for(unsigned int i = 0; i < l_expr->candidate_datatypes.size(); i++)

   427

		for(unsigned int j = 0; j < r_expr->candidate_datatypes.size(); j++) {

   428

			if ((l_expr->candidate_datatypes[i] == r_expr->candidate_datatypes[j]) && search_base_type.type_is_enumerated(l_expr->candidate_datatypes[i]))

   429

				add_datatype_to_candidate_list(symbol, &search_constant_type_c::bool_type_name);

   430

		}

   431

	return NULL;

   432

}

   433

   434

   435

   436

/* a helper function... */

   437

symbol_c *fill_candidate_datatypes_c::base_type(symbol_c *symbol) {

   438

	/* NOTE: symbol == NULL is valid. It will occur when, for e.g., an undefined/undeclared symbolic_variable is used

   439

	 *       in the code.

   440

	 */

   441

	if (symbol == NULL) return NULL;

   442

	return (symbol_c *)symbol->accept(search_base_type);

   443

}

   444

   445

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

   446

/* B 1.2 - Constants */

   447

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

   448

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

   449

/* B 1.2.1 - Numeric Literals */

   450

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

   451

#define sizeoftype(symbol) get_sizeof_datatype_c::getsize(symbol)

   452

   453

void *fill_candidate_datatypes_c::handle_any_integer(symbol_c *symbol) {

   454

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::bool_type_name,  &search_constant_type_c::safebool_type_name);

   455

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::byte_type_name,  &search_constant_type_c::safebyte_type_name);

   456

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::word_type_name,  &search_constant_type_c::safeword_type_name);

   457

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::dword_type_name, &search_constant_type_c::safedword_type_name);

   458

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::lword_type_name, &search_constant_type_c::safelword_type_name);

   459

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::sint_type_name,  &search_constant_type_c::safesint_type_name);

   460

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::int_type_name,   &search_constant_type_c::safeint_type_name);

   461

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::dint_type_name,  &search_constant_type_c::safedint_type_name);

   462

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::lint_type_name,  &search_constant_type_c::safelint_type_name);

   463

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::usint_type_name, &search_constant_type_c::safeusint_type_name);

   464

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::uint_type_name,  &search_constant_type_c::safeuint_type_name);

   465

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::udint_type_name, &search_constant_type_c::safeudint_type_name);

   466

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::ulint_type_name, &search_constant_type_c::safeulint_type_name);

   467

	remove_incompatible_datatypes(symbol);

   468

	if (debug) std::cout << "ANY_INT [" << symbol->candidate_datatypes.size()<< "]" << std::endl;

   469

	return NULL;

   470

}

   471

   472

   473

   474

void *fill_candidate_datatypes_c::handle_any_real(symbol_c *symbol) {

   475

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::real_type_name,  &search_constant_type_c::safereal_type_name);

   476

	add_2datatypes_to_candidate_list(symbol, &search_constant_type_c::lreal_type_name, &search_constant_type_c::safelreal_type_name);

   477

	remove_incompatible_datatypes(symbol);

   478

	if (debug) std::cout << "ANY_REAL [" << symbol->candidate_datatypes.size() << "]" << std::endl;

   479

	return NULL;

   480

}

   481

   482

   483

   484

void *fill_candidate_datatypes_c::handle_any_literal(symbol_c *symbol, symbol_c *symbol_value, symbol_c *symbol_type) {

   485

	symbol_value->accept(*this);

   486

	if (search_in_candidate_datatype_list(symbol_type, symbol_value->candidate_datatypes) >= 0)

   487

		add_datatype_to_candidate_list(symbol, symbol_type);

   488

	remove_incompatible_datatypes(symbol);

   489

	if (debug) std::cout << "ANY_LITERAL [" << symbol->candidate_datatypes.size() << "]\n";

   490

	return NULL;

   491

}

   492

   493

   494

   495

void *fill_candidate_datatypes_c::visit(    real_c *symbol) {return handle_any_real(symbol);}

   496

void *fill_candidate_datatypes_c::visit(neg_real_c *symbol) {return handle_any_real(symbol);}