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

    50

/*

    56

 */

    57

    58

#include "fill_candidate_datatypes.hh"

    59

#include "datatype_functions.hh"

    60

#include <typeinfo>

    61

#include <list>

    62

#include <string>

    63

#include <string.h>

    64

#include <strings.h>

    65

    66

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

    67

static int debug = 0;

    68

    69

fill_candidate_datatypes_c::fill_candidate_datatypes_c(symbol_c *ignore) {

    70

}

    71

    72

fill_candidate_datatypes_c::~fill_candidate_datatypes_c(void) {

    73

}

    74

    75

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

    76

	int k;

    77

	/* find a widening table entry compatible */

    78

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

    79

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

    80

                      return widen_table[k].result;

    81

	return NULL;

    82

}

    83

    84

    85

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

    86

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

    87

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

    88

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

    89

   * 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. 

    90

   */

    91

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

    92

    return false;

    93

    94

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

    95

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

    96

    return false;

    97

    98

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

    99

  symbol->candidate_datatypes.push_back(datatype);

   100

  return true;

   101

}

   102

   103

   104

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

   105

  add_datatype_to_candidate_list(symbol, datatype1);

   106

  add_datatype_to_candidate_list(symbol, datatype2);

   107

  return true;

   108

}

   109

   110

   111

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

   112

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

   113

/*

   114

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

   115

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

   116

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

   117

 */

   118

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

   119

	symbol_c *call_param_value,  *param_datatype;

   120

	identifier_c *param_name;

   121

	function_param_iterator_c       fp_iterator(f_decl);

   122

	function_call_param_iterator_c fcp_iterator(f_call);

   123

	int extensible_parameter_highest_index = -1;

   124

	unsigned int i;

   125

   126

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

   127

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

   128

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

   129

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

   130

		 */

   131

		do {

   132

			param_name = fp_iterator.next();

   133

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

   134

			if(param_name == NULL) return false;

   135

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

   136

   137

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

   138

		/* Get the parameter type */

   139

		param_datatype = base_type(fp_iterator.param_type());

   140

   141

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

   142

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

   143

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

   144

	}

   145

	/* call is compatible! */

   146

	return true;

   147

}

   148

   149

   150

   151

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

   152

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

   153

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

   154

	symbol_c *call_param_value, *call_param_name, *param_datatype;

   155

	symbol_c *verify_duplicate_param;

   156

	identifier_c *param_name;

   157

	function_param_iterator_c       fp_iterator(f_decl);

   158

	function_call_param_iterator_c fcp_iterator(f_call);

   159

	int extensible_parameter_highest_index = -1;

   160

	identifier_c *extensible_parameter_name;

   161

	unsigned int i;

   162

	bool is_first_param = true;

   163

   164

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

   165

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

   166

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

   167

		call_param_value = fcp_iterator.get_current_value();

   168

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

   169

		if (NULL == call_param_value) ERROR;

   170

   171

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

   172

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

   173

   174

		/* Checking if there are duplicated parameter values */

   175

		verify_duplicate_param = fcp_iterator.search_f(call_param_name);

   176

		if(verify_duplicate_param != call_param_value)

   177

			return false;

   178

   179

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

   180

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

   181

   182

		/* Find the corresponding parameter in function declaration */

   183

		param_name = fp_iterator.search(call_param_name);

   184

		if(param_name == NULL) return false;

   185

		/* Get the parameter data type */

   186

		param_datatype = base_type(fp_iterator.param_type());

   187

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

   188

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

   189

   190

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

   191

		if          (function_call_param_iterator_c::assign_in  == call_param_dir) {

   192

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

   193

			    (function_param_iterator_c::direction_inout != param_dir))

   194

				return false;

   195

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

   196

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

   197

				return false;

   198

		} else ERROR;

   199

   200

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

   201

		if (search_in_candidate_datatype_list(param_datatype, call_param_types) < 0)

   202

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

   203

   204

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

   205

		if (is_first_param)

   206

			if (NULL != first_param_datatype)

   207

				*first_param_datatype = param_datatype;

   208

		is_first_param = false;

   209

	}

   210

	/* call is compatible! */

   211

	return true;

   212

}

   213

   214

   215

   216

   217

/* Handle a generic function call!

   218

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

   219

 * has already had all the candidate_datatype lists filled in!

   220

 *

   221

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

   222

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

   223

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

   224

 */

   225

/*

   226

typedef struct {

   227

  symbol_c *function_name,

   228

  symbol_c *nonformal_operand_list,

   229

  symbol_c *   formal_operand_list,

   230

   231

  std::vector <symbol_c *> &candidate_functions,  

   232

  symbol_c &*called_function_declaration,

   233

  int      &extensible_param_count

   234

} generic_function_call_t;

   235

*/

   236

/*

   237

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

   238

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

   239

                                                       std::vector <symbol_c *> *candidate_datatypes,

   240

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

   241

  */

   242

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

   243

	function_declaration_c *f_decl;

   244

	list_c *parameter_list;

   245

	list_c *parameter_candidate_datatypes;

   246

	symbol_c *returned_parameter_type;

   247

   248

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

   249

   250

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

   251

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

   252

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

   253

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

   254

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

   255

   256

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

   257

	 * to the candidate_datatype list of this function invocation. 

   258

	 *

   259

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

   260

	 * even if the parameters passed to it are invalid.

   261

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

   262

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

   263

	 * spurious error messages.

   264

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

   265

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

   266

	 * compilation is aborted in stage3 (in print_datatypes_error_c).

   267

	 */

   268

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

   269

		f_decl = function_symtable.get_value(lower);

   270

		returned_parameter_type = base_type(f_decl->type_name);

   271

		if (add_datatype_to_candidate_list(fcall, returned_parameter_type))

   272

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

   273

			fcall_data.candidate_functions.push_back(f_decl);

   274

   275

	}

   276

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

   277

		bool compatible = false;

   278

   279

		f_decl = function_symtable.get_value(lower);

   280

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

   281

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

   282

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

   283

		if (compatible) {

   284

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

   285

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

   286

			 */

   287

			returned_parameter_type = base_type(f_decl->type_name);		

   288

			if (add_datatype_to_candidate_list(fcall, returned_parameter_type))

   289

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

   290

				fcall_data.candidate_functions.push_back(f_decl);

   291

		}

   292

	}

   293

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

   294

	return;

   295

}

   296

   297

   298

/* handle implicit FB call in IL.

   299

 * e.g.  CLK ton_var

   300

 *        CU counter_var

   301

 */

   302

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

   303

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

   304

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

   305

	if (NULL == fb_type_id) ERROR;

   306

   307

	function_block_declaration_c *fb_decl = function_block_type_symtable.find_value(fb_type_id);

   308

	if (function_block_type_symtable.end_value() == fb_decl)

   309

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

   310

		 * this is a semantic error.

   311

		 */

   312

		fb_decl = NULL;

   313

   314

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

   315

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

   316

	 * more informative error messages!

   317

	 */

   318

	called_fb_declaration = fb_decl;

   319

   320

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

   321

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

   322

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

   323

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

   324

	 * that are compatible to the FB call. 

   325

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

   326

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

   327

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

   328

	 * correct.

   329

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

   330

	 * here).

   331

	 */

   332

	if (NULL != prev_il_instruction)

   333

		il_instruction->candidate_datatypes = prev_il_instruction->candidate_datatypes; 

   334

   335

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

   336

	return NULL;

   337

}

   338

   339

   340

   341

   342

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

   343

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) {

   344

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

   345

		return NULL; 

   346

   347

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

   348

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

   349

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

   350

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

   351

   352

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

   353

	return NULL;

   354

}

   355

   356

   357

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

   358

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) {

   359

	l_expr->accept(*this);

   360

	r_expr->accept(*this);

   361

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

   362

}

   363

   364

   365

   366

   367

/* a helper function... */

   368

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

   369

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

   370

	 *       in the code.

   371

	 */

   372

	if (symbol == NULL) return NULL;

   373

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

   374

}

   375

   376

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

   377

/* B 1.2 - Constants */

   378

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

   379

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

   380

/* B 1.2.1 - Numeric Literals */

   381

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

   382

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

   383

   384

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

   385

	int calc_size = sizeoftype(symbol);

   386

   387

	if (calc_size <= sizeoftype(&search_constant_type_c::bool_type_name))

   388

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

   389

	if (calc_size <= sizeoftype(&search_constant_type_c::byte_type_name))

   390

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

   391

	if (calc_size <= sizeoftype(&search_constant_type_c::word_type_name))

   392

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

   393

	if (calc_size <= sizeoftype(&search_constant_type_c::dword_type_name))

   394

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

   395

	if (calc_size <= sizeoftype(&search_constant_type_c::lword_type_name))

   396

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

   397

   398

	if (calc_size < sizeoftype(&search_constant_type_c::sint_type_name))

   399

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

   400

	if (calc_size < sizeoftype(&search_constant_type_c::int_type_name))

   401

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

   402

	if (calc_size < sizeoftype(&search_constant_type_c::dint_type_name))

   403

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

   404

	if (calc_size < sizeoftype(&search_constant_type_c::lint_type_name))

   405

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

   406

	if (calc_size <= sizeoftype(&search_constant_type_c::usint_type_name))

   407

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

   408

	if (calc_size <= sizeoftype(&search_constant_type_c::uint_type_name))

   409

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

   410

	if (calc_size <= sizeoftype(&search_constant_type_c::udint_type_name))

   411

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

   412

	if (calc_size <= sizeoftype(&search_constant_type_c::ulint_type_name))

   413

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

   414

   415

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

   416

	return NULL;

   417

}

   418

   419

   420

   421

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

   422

	int calc_size = sizeoftype(symbol);

   423

   424

	if (calc_size <= sizeoftype(&search_constant_type_c::real_type_name))

   425

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

   426

	if (calc_size <= sizeoftype(&search_constant_type_c::lreal_type_name))

   427

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

   428

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

   429

	return NULL;

   430

}

   431

   432

   433

   434

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

   435

	symbol_value->accept(*this);

   436

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

   437

		add_datatype_to_candidate_list(symbol, symbol_type);

   438

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

   439

	return NULL;

   440

}

   441

   442

   443

   444

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

   445

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

   446

   447

   448

   449

void *fill_candidate_datatypes_c::visit(neg_integer_c *symbol) {

   450

	int calc_size = sizeoftype(symbol);

   451

   452

	if (calc_size <= sizeoftype(&search_constant_type_c::int_type_name))

   453

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

   454

	if (calc_size <= sizeoftype(&search_constant_type_c::sint_type_name))

   455

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

   456

	if (calc_size <= sizeoftype(&search_constant_type_c::dint_type_name))

   457

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

   458

	if (calc_size <= sizeoftype(&search_constant_type_c::lint_type_name))

   459

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

   460

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

   461

	return NULL;

   462

}

   463

   464

   465

   466

void *fill_candidate_datatypes_c::visit(integer_c        *symbol) {return handle_any_integer(symbol);}

   467

void *fill_candidate_datatypes_c::visit(binary_integer_c *symbol) {return handle_any_integer(symbol);}

   468

void *fill_candidate_datatypes_c::visit(octal_integer_c  *symbol) {return handle_any_integer(symbol);}

   469

void *fill_candidate_datatypes_c::visit(hex_integer_c    *symbol) {return handle_any_integer(symbol);}

   470

   471

   472

   473

// SYM_REF2(integer_literal_c, type, value)

   474

/*

   475

 * integer_literal:

   476

 *   integer_type_name '#' signed_integer

   477

 * | integer_type_name '#' binary_integer

   478

 * | integer_type_name '#' octal_integer

   479

 * | integer_type_name '#' hex_integer

   480

 */

   481

void *fill_candidate_datatypes_c::visit(   integer_literal_c *symbol) {return handle_any_literal(symbol, symbol->value, symbol->type);}

   482

void *fill_candidate_datatypes_c::visit(      real_literal_c *symbol) {return handle_any_literal(symbol, symbol->value, symbol->type);}

   483

void *fill_candidate_datatypes_c::visit(bit_string_literal_c *symbol) {return handle_any_literal(symbol, symbol->value, symbol->type);}

   484

   485

void *fill_candidate_datatypes_c::visit(   boolean_literal_c *symbol) {

   486

	if (NULL != symbol->type) return handle_any_literal(symbol, symbol->value, symbol->type);

   487

   488

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

   489

	symbol->candidate_datatypes = symbol->value->candidate_datatypes;

   490

	return NULL;

   491

}

   492

   493

   494

void *fill_candidate_datatypes_c::visit(boolean_true_c *symbol) {

   495

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

   496

	return NULL;

   497

}