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

    45

/*

    46

 *  Fill candidate list of data types for all symbols

    47

 */

    48

    49

#include "fill_candidate_datatypes.hh"

    50

#include "datatype_functions.hh"

    51

#include <typeinfo>

    52

#include <list>

    53

#include <string>

    54

#include <string.h>

    55

#include <strings.h>

    56

    57

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

    58

static int debug = 0;

    59

    60

fill_candidate_datatypes_c::fill_candidate_datatypes_c(symbol_c *ignore) {

    61

}

    62

    63

fill_candidate_datatypes_c::~fill_candidate_datatypes_c(void) {

    64

}

    65

    66

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

    67

	int k;

    68

	/* find a widening table entry compatible */

    69

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

    70

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

    71

                      return widen_table[k].result;

    72

	return NULL;

    73

}

    74

    75

    76

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

    77

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

    78

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

    79

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

    80

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

    81

   */

    82

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

    83

    return false;

    84

    85

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

    86

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

    87

    return false;

    88

    89

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

    90

  symbol->candidate_datatypes.push_back(datatype);

    91

  return true;

    92

}

    93

    94

    95

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

    96

  add_datatype_to_candidate_list(symbol, datatype1);

    97

  add_datatype_to_candidate_list(symbol, datatype2);

    98

  return true;

    99

}

   100

   101

   102

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

   103

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

   104

/*

   105

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

   106

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

   107

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

   108

 */

   109

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

   110

	symbol_c *call_param_value,  *param_datatype;

   111

	identifier_c *param_name;

   112

	function_param_iterator_c       fp_iterator(f_decl);

   113

	function_call_param_iterator_c fcp_iterator(f_call);

   114

	int extensible_parameter_highest_index = -1;

   115

	unsigned int i;

   116

   117

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

   118

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

   119

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

   120

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

   121

		 */

   122

		do {

   123

			param_name = fp_iterator.next();

   124

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

   125

			if(param_name == NULL) return false;

   126

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

   127

   128

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

   129

		/* Get the parameter type */

   130

		param_datatype = base_type(fp_iterator.param_type());

   131

   132

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

   133

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

   134

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

   135

	}

   136

	/* call is compatible! */

   137

	return true;

   138

}

   139

   140

   141

   142

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

   143

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

   144

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

   145

	symbol_c *call_param_value, *call_param_name, *param_datatype;

   146

	symbol_c *verify_duplicate_param;

   147

	identifier_c *param_name;

   148

	function_param_iterator_c       fp_iterator(f_decl);

   149

	function_call_param_iterator_c fcp_iterator(f_call);

   150

	int extensible_parameter_highest_index = -1;

   151

	identifier_c *extensible_parameter_name;

   152

	unsigned int i;

   153

	bool is_first_param = true;

   154

   155

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

   156

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

   157

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

   158

		call_param_value = fcp_iterator.get_current_value();

   159

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

   160

		if (NULL == call_param_value) ERROR;

   161

   162

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

   163

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

   164

   165

		/* Checking if there are duplicated parameter values */

   166

		verify_duplicate_param = fcp_iterator.search_f(call_param_name);

   167

		if(verify_duplicate_param != call_param_value)

   168

			return false;

   169

   170

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

   171

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

   172

   173

		/* Find the corresponding parameter in function declaration */

   174

		param_name = fp_iterator.search(call_param_name);

   175

		if(param_name == NULL) return false;

   176

		/* Get the parameter data type */

   177

		param_datatype = base_type(fp_iterator.param_type());

   178

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

   179

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

   180

   181

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

   182

		if          (function_call_param_iterator_c::assign_in  == call_param_dir) {

   183

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

   184

			    (function_param_iterator_c::direction_inout != param_dir))

   185

				return false;

   186

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

   187

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

   188

				return false;

   189

		} else ERROR;

   190

   191

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

   192

		if (search_in_candidate_datatype_list(param_datatype, call_param_types) < 0)

   193

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

   194

   195

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

   196

		if (is_first_param)

   197

			if (NULL != first_param_datatype)

   198

				*first_param_datatype = param_datatype;

   199

		is_first_param = false;

   200

	}

   201

	/* call is compatible! */

   202

	return true;

   203

}

   204

   205

   206

   207

   208

/* Handle a generic function call!

   209

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

   210

 * has already had all the candidate_datatype lists filled in!

   211

 *

   212

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

   213

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

   214

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

   215

 */

   216

/*

   217

typedef struct {

   218

  symbol_c *function_name,

   219

  symbol_c *nonformal_operand_list,

   220

  symbol_c *   formal_operand_list,

   221

   222

  std::vector <symbol_c *> &candidate_functions,  

   223

  symbol_c &*called_function_declaration,

   224

  int      &extensible_param_count

   225

} generic_function_call_t;

   226

*/

   227

/*

   228

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

   229

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

   230

                                                       std::vector <symbol_c *> *candidate_datatypes,

   231

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

   232

  */

   233

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

   234

	function_declaration_c *f_decl;

   235

	list_c *parameter_list;

   236

	list_c *parameter_candidate_datatypes;

   237

	symbol_c *returned_parameter_type;

   238

   239

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

   240

   241

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

   242

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

   243

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

   244

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

   245

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

   246

   247

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

   248

	 * to the candidate_datatype list of this function invocation. 

   249

	 *

   250

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

   251

	 * even if the parameters passed to it are invalid.

   252

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

   253

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

   254

	 * spurious error messages.

   255

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

   256

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

   257

	 * compilation is aborted in stage3 (in print_datatypes_error_c).

   258

	 */

   259

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

   260

		f_decl = function_symtable.get_value(lower);

   261

		returned_parameter_type = base_type(f_decl->type_name);

   262

		if (add_datatype_to_candidate_list(fcall, returned_parameter_type))

   263

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

   264

			fcall_data.candidate_functions.push_back(f_decl);

   265

   266

	}

   267

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

   268

		bool compatible = false;

   269

   270

		f_decl = function_symtable.get_value(lower);

   271

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

   272

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

   273

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

   274

		if (compatible) {

   275

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

   276

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

   277

			 */

   278

			returned_parameter_type = base_type(f_decl->type_name);		

   279

			if (add_datatype_to_candidate_list(fcall, returned_parameter_type))

   280

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

   281

				fcall_data.candidate_functions.push_back(f_decl);

   282

		}

   283

	}

   284

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

   285

	return;

   286

}

   287

   288

   289

/* handle implicit FB call in IL.

   290

 * e.g.  CLK ton_var

   291

 *        CU counter_var

   292

 */

   293

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

   294

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

   295

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

   296

	if (NULL == fb_type_id) ERROR;

   297

   298

	function_block_declaration_c *fb_decl = function_block_type_symtable.find_value(fb_type_id);

   299

	if (function_block_type_symtable.end_value() == fb_decl)

   300

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

   301

		 * this is a semantic error.

   302

		 */

   303

		fb_decl = NULL;

   304

   305

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

   306

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

   307

	 * more informative error messages!

   308

	 */

   309

	called_fb_declaration = fb_decl;

   310

   311

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

   312

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

   313

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

   314

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

   315

	 * that are compatible to the FB call. 

   316

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

   317

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

   318

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

   319

	 * correct.

   320

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

   321

	 * here).

   322

	 */

   323

	if (NULL != prev_il_instruction)

   324

		il_instruction->candidate_datatypes = prev_il_instruction->candidate_datatypes; 

   325

   326

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

   327

	return NULL;

   328

}

   329

   330

   331

   332

   333

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

   334

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

   335

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

   336

		return NULL; 

   337

   338

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

   339

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

   340

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

   341

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

   342

   343

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

   344

	return NULL;

   345

}

   346

   347

   348

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

   349

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

   350

	l_expr->accept(*this);

   351

	r_expr->accept(*this);

   352

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

   353

}

   354

   355

   356

   357

   358

/* a helper function... */

   359

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

   360

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

   361

	 *       in the code.

   362

	 */

   363

	if (symbol == NULL) return NULL;

   364

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

   365

}

   366

   367

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

   368

/* B 1.2 - Constants */

   369

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

   370

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

   371

/* B 1.2.1 - Numeric Literals */

   372

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

   373

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

   374

   375

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

   376

	int calc_size = sizeoftype(symbol);

   377

   378

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

   379

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

   380

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

   381

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

   382

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

   383

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

   384

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

   385

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

   386

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

   387

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

   388

   389

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

   390

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

   391

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

   392

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

   393

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

   394

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

   395

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

   396

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

   397

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

   398

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

   399

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

   400

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

   401

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

   402

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

   403

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

   404

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

   405

   406

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

   407

	return NULL;

   408

}

   409

   410

   411

   412

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

   413

	int calc_size = sizeoftype(symbol);

   414

   415

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

   416

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

   417

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

   418

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

   419

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

   420

	return NULL;

   421

}

   422

   423

   424

   425

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

   426

	symbol_value->accept(*this);

   427

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

   428

		add_datatype_to_candidate_list(symbol, symbol_type);

   429

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

   430

	return NULL;

   431

}

   432

   433

   434

   435

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

   436

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

   437

   438

   439

   440

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

   441

	int calc_size = sizeoftype(symbol);

   442

   443

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

   444

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

   445

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

   446

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

   447

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

   448

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

   449

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

   450

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

   451

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

   452

	return NULL;

   453

}

   454

   455

   456

   457

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

   458

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

   459

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

   460

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

   461

   462

   463

   464

// SYM_REF2(integer_literal_c, type, value)

   465

/*

   466

 * integer_literal:

   467

 *   integer_type_name '#' signed_integer

   468

 * | integer_type_name '#' binary_integer

   469

 * | integer_type_name '#' octal_integer

   470

 * | integer_type_name '#' hex_integer

   471

 */

   472

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

   473

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

   474

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

   475

   476

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

   477

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

   478

   479

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

   480

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

   481

	return NULL;

   482

}

   483

   484

   485

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

   486

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

   487

	return NULL;

   488

}

   489

   490

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

   491

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

   492

	return NULL;

   493

}

   494

   495

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

   496

/* B.1.2.2   Character Strings */

   497

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

   498

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