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

/* NOTE: The algorithm implemented here assumes that candidate datatype lists have already been filled!

    36

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

    37

 */

    38

    39

    40

/*

    41

 *  Choose, from the list of all the possible datatypes each expression may take, the single datatype that it will in fact take.

    42

 *  The resulting (chosen) datatype, will be stored in the symbol_c.datatype variable, leaving the candidate datatype list untouched!

    43

 * 

    44

 *  For rvalue expressions, this decision will be based on the datatype of the lvalue expression.

    45

 *  For lvalue expressions, the candidate datatype list should have a single entry.

    46

 * 

    47

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

    48

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

    49

 * 

    50

 *  In this class, the datatype of '0' will be set to the same datatype as the 'foo' variable.

    51

 *  If the intersection of the candidate datatype lists of the left and right side expressions is empty, 

    52

 *  then a datatype error has been found, and the datatype is either left at NULL, or set to a pointer of an invalid_type_name_c object!

    53

 */

    54

    55

    56

#include "narrow_candidate_datatypes.hh"

    57

#include "datatype_functions.hh"

    58

#include <typeinfo>

    59

#include <list>

    60

#include <string>

    61

#include <string.h>

    62

#include <strings.h>

    63

    64

    65

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

    66

static int debug = 0;

    67

    68

narrow_candidate_datatypes_c::narrow_candidate_datatypes_c(symbol_c *ignore) {

    69

	prev_il_instructions = NULL;

    70

	search_varfb_instance_type = NULL;

    71

	prev_il_instructions_intersected_datatypes = NULL;

    72

	fake_prev_il_instruction = NULL;

    73

	il_operand = NULL;

    74

}

    75

    76

narrow_candidate_datatypes_c::~narrow_candidate_datatypes_c(void) {

    77

}

    78

    79

    80

/* Only set the symbol's desired datatype to 'datatype' if that datatype is in the candidate_datatype list */

    81

static void set_datatype(symbol_c *datatype, symbol_c *symbol) {

    82

    83

	/* If we are trying to set to the undefined type, and the symbol's datatype has already been set to something else, 

    84

	 * we abort the compoiler as I don't think this should ever occur. 

    85

	 * NOTE: In order to handle JMPs to labels that come before the JMP itself, we run the narrow algorithm twice.

    86

	 *       This means that this situation may legally occur, so we cannot abort the compiler here!

    87

	 */

    88

// 	if ((NULL == datatype) && (NULL != symbol->datatype)) ERROR;

    89

 	if ((NULL == datatype) && (NULL != symbol->datatype)) return;

    90

	if ((NULL == datatype) && (NULL == symbol->datatype)) return;

    91

    92

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

    93

		symbol->datatype = &(search_constant_type_c::invalid_type_name);   

    94

	else {

    95

		if (NULL == symbol->datatype)   

    96

			/* not yet set to anything, so we set it to the requested data type */

    97

			symbol->datatype = datatype; 

    98

		else {

    99

			/* had already been set previously to some data type. Let's check if they are the same! */

   100

			if (!is_type_equal(symbol->datatype, datatype))

   101

				symbol->datatype = &(search_constant_type_c::invalid_type_name);

   102

// 			else 

   103

				/* we leave it unchanged, as it is the same as the requested data type! */

   104

		}

   105

	}

   106

}

   107

   108

   109

   110

/* Only set the symbol's desired datatype to 'datatype' if that datatype is in the candidate_datatype list */

   111

// static void set_datatype_in_prev_il_instructions(symbol_c *datatype, std::vector <symbol_c *> prev_il_instructions) {

   112

static void set_datatype_in_prev_il_instructions(symbol_c *datatype, il_instruction_c *symbol) {

   113

	if (NULL == symbol) ERROR;

   114

	for (unsigned int i = 0; i < symbol->prev_il_instruction.size(); i++)

   115

		set_datatype(datatype, symbol->prev_il_instruction[i]);

   116

}

   117

   118

   119

   120

bool narrow_candidate_datatypes_c::is_widening_compatible(const struct widen_entry widen_table[], symbol_c *left_type, symbol_c *right_type, symbol_c *result_type, bool *deprecated_status) {

   121

	/* NOTE: According to our algorithm, left_type and right_type should never by NULL (if they are, we have an internal compiler error!

   122

	 *       However, result_type may be NULL if the code has a data type semantic error!

   123

	 */

   124

	if ((NULL == left_type) || (NULL == right_type) || (NULL == result_type))

   125

		return false;

   126

   127

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

   128

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

   129

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

   130

			&& (typeid(*result_type) == typeid(*widen_table[k].result))) {

   131

			if (NULL != deprecated_status)

   132

				*deprecated_status = (widen_table[k].status == widen_entry::deprecated);

   133

			return true;

   134

		}

   135

	}

   136

	return false;

   137

}

   138

   139

/*

   140

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

   141

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

   142

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

   143

 */

   144

void narrow_candidate_datatypes_c::narrow_nonformal_call(symbol_c *f_call, symbol_c *f_decl, int *ext_parm_count) {

   145

	symbol_c *call_param_value,  *param_type;

   146

	identifier_c *param_name;

   147

	function_param_iterator_c       fp_iterator(f_decl);

   148

	function_call_param_iterator_c fcp_iterator(f_call);

   149

	int extensible_parameter_highest_index = -1;

   150

	unsigned int i;

   151

   152

	if (NULL != ext_parm_count) *ext_parm_count = -1;

   153

   154

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

   155

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

   156

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

   157

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

   158

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

   159

		 */

   160

		do {

   161

			param_name = fp_iterator.next();

   162

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

   163

			/* This error should have been caught in fill_candidate_datatypes_c, but may occur here again when we handle FB invocations! 

   164

			 * In this case, we carry on analysing the code in order to be able to provide relevant error messages

   165

			 * for that code too!

   166

			 */

   167

			if(param_name == NULL) break;

   168

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

   169

   170

		/* Set the desired datatype for this parameter, and call it recursively. */

   171

		/* Note that if the call has more parameters than those declared in the function/FB declaration,

   172

		 * we may be setting this to NULL!

   173

		 */

   174

		symbol_c *desired_datatype = base_type(fp_iterator.param_type());

   175

		if ((NULL != param_name) && (NULL == desired_datatype)) ERROR;

   176

		if ((NULL == param_name) && (NULL != desired_datatype)) ERROR;

   177

   178

		/* NOTE: When we are handling a nonformal function call made from IL, the first parameter is the 'default' or 'current'

   179

		 *       il value. However, a pointer to a copy of the prev_il_instruction is pre-pended into the operand list, so 

   180

		 *       the call 

   181

		 *       call_param_value->accept(*this);

   182

		 *       may actually be calling an object of the base symbol_c .

   183

		 */

   184

		set_datatype(desired_datatype, call_param_value);

   185

		call_param_value->accept(*this);

   186

   187

		if (NULL != param_name) 

   188

			if (extensible_parameter_highest_index < fp_iterator.extensible_param_index())

   189

				extensible_parameter_highest_index = fp_iterator.extensible_param_index();

   190

	}

   191

	/* In the case of a call to an extensible function, we store the highest index 

   192

	 * of the extensible parameters this particular call uses, in the symbol_c object

   193

	 * of the function call itself!

   194

	 * In calls to non-extensible functions, this value will be set to -1.

   195

	 * This information is later used in stage4 to correctly generate the

   196

	 * output code.

   197

	 */

   198

	if ((NULL != ext_parm_count) && (extensible_parameter_highest_index >=0) /* if call to extensible function */)

   199

		*ext_parm_count = 1 + extensible_parameter_highest_index - fp_iterator.first_extensible_param_index();

   200

}

   201

   202

   203

   204

void narrow_candidate_datatypes_c::narrow_formal_call(symbol_c *f_call, symbol_c *f_decl, int *ext_parm_count) {

   205

	symbol_c *call_param_value, *call_param_name, *param_type;

   206

	symbol_c *verify_duplicate_param;

   207

	identifier_c *param_name;

   208

	function_param_iterator_c       fp_iterator(f_decl);

   209

	function_call_param_iterator_c fcp_iterator(f_call);

   210

	int extensible_parameter_highest_index = -1;

   211

	identifier_c *extensible_parameter_name;

   212

	unsigned int i;

   213

   214

	if (NULL != ext_parm_count) *ext_parm_count = -1;

   215

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

   216

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

   217

   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

		/* Find the corresponding parameter in function declaration */

   224

		param_name = fp_iterator.search(call_param_name);

   225

   226

		/* Set the desired datatype for this parameter, and call it recursively. */

   227

		/* NOTE: When handling a FB call, this narrow_formal_call() may be called to analyse

   228

		 *       an invalid FB call (call with parameters that do not exist on the FB declaration).

   229

		 *       For this reason, the param_name may come out as NULL!

   230

		 */

   231

		symbol_c *desired_datatype = base_type(fp_iterator.param_type());

   232

		if ((NULL != param_name) && (NULL == desired_datatype)) ERROR;

   233

		if ((NULL == param_name) && (NULL != desired_datatype)) ERROR;

   234

   235

		/* set the desired data type for this parameter */

   236

		set_datatype(desired_datatype, call_param_value);

   237

		/* And recursively call that parameter/expression, so it can propagate that info */

   238

		call_param_value->accept(*this);

   239

   240

		/* set the extensible_parameter_highest_index, which will be needed in stage 4 */

   241

		/* This value says how many extensible parameters are being passed to the standard function */

   242

		if (NULL != param_name) 

   243

			if (extensible_parameter_highest_index < fp_iterator.extensible_param_index())

   244

				extensible_parameter_highest_index = fp_iterator.extensible_param_index();

   245

	}

   246

	/* call is compatible! */

   247

   248

	/* In the case of a call to an extensible function, we store the highest index 

   249

	 * of the extensible parameters this particular call uses, in the symbol_c object

   250

	 * of the function call itself!

   251

	 * In calls to non-extensible functions, this value will be set to -1.

   252

	 * This information is later used in stage4 to correctly generate the

   253

	 * output code.

   254

	 */

   255

	if ((NULL != ext_parm_count) && (extensible_parameter_highest_index >=0) /* if call to extensible function */)

   256

		*ext_parm_count = 1 + extensible_parameter_highest_index - fp_iterator.first_extensible_param_index();

   257

}

   258

   259

   260

/*

   261

typedef struct {

   262

  symbol_c *function_name,

   263

  symbol_c *nonformal_operand_list,

   264

  symbol_c *   formal_operand_list,

   265

   266

  std::vector <symbol_c *> &candidate_functions,  

   267

  symbol_c &*called_function_declaration,

   268

  int      &extensible_param_count

   269

} generic_function_call_t;

   270

*/

   271

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

   272

	/* set the called_function_declaration. */

   273

	fcall_data.called_function_declaration = NULL;

   274

   275

	/* set the called_function_declaration taking into account the datatype that we need to return */

   276

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

   277

		if (is_type_equal(fcall->candidate_datatypes[i], fcall->datatype)) {

   278

			fcall_data.called_function_declaration = fcall_data.candidate_functions[i];

   279

			break;

   280

		}

   281

	}

   282

   283

	/* NOTE: If we can't figure out the declaration of the function being called, this is not 

   284

	 *       necessarily an internal compiler error. It could be because the symbol->datatype is NULL

   285

	 *       (because the ST code being analysed has an error _before_ this function invocation).

   286

	 *       However, we don't just give, up, we carry on recursivly analysing the code, so as to be

   287

	 *       able to print out any error messages related to the parameters being passed in this function 

   288

	 *       invocation.

   289

	 */

   290

	/* if (NULL == symbol->called_function_declaration) ERROR; */

   291

	if (fcall->candidate_datatypes.size() == 1) {

   292

		/* If only one function declaration, then we use that (even if symbol->datatypes == NULL)

   293

		 * so we can check for errors in the expressions used to pass parameters in this

   294

		 * function invocation.

   295

		 */

   296

		fcall_data.called_function_declaration = fcall_data.candidate_functions[0];

   297

	}

   298

   299

	/* If an overloaded function is being invoked, and we cannot determine which version to use,

   300

	 * then we can not meaningfully verify the expressions used inside that function invocation.

   301

	 * We simply give up!

   302

	 */

   303

	if (NULL == fcall_data.called_function_declaration)

   304

		return;

   305

   306

	if (NULL != fcall_data.nonformal_operand_list)  narrow_nonformal_call(fcall, fcall_data.called_function_declaration, &(fcall_data.extensible_param_count));

   307

	if (NULL != fcall_data.   formal_operand_list)     narrow_formal_call(fcall, fcall_data.called_function_declaration, &(fcall_data.extensible_param_count));

   308

   309

	return;

   310

}

   311

   312

   313

   314

   315

/* narrow implicit FB call in IL.

   316

 * e.g.  CLK ton_var

   317

 *        CU counter_var

   318

 *

   319

 * The algorithm will be to build a fake il_fb_call_c equivalent to the implicit IL FB call, and let 

   320

 * the visit(il_fb_call_c *) method handle it!

   321

 */

   322

void *narrow_candidate_datatypes_c::narrow_implicit_il_fb_call(symbol_c *il_instruction, const char *param_name, symbol_c *&called_fb_declaration) {

   323

   324

	/* set the datatype of the il_operand, this is, the FB being called! */

   325

	if (NULL != il_operand) {

   326

		/* only set it if it is in the candidate datatypes list! */  

   327

		set_datatype(called_fb_declaration, il_operand);

   328

		il_operand->accept(*this);

   329

	}

   330

	symbol_c *fb_decl = il_operand->datatype;

   331

   332

	if (0 == fake_prev_il_instruction->prev_il_instruction.size()) {

   333

		/* This IL implicit FB call (e.g. CLK ton_var) is not preceded by another IL instruction

   334

		 * (or list of instructions) that will set the IL current/default value.

   335

		 * We cannot proceed verifying type compatibility of something that does not exist.

   336

		 */

   337

		return NULL;

   338

	}

   339

   340

	if (NULL == fb_decl) {

   341

		/* the il_operand is a not FB instance */

   342

		/* so we simply pass on the required datatype to the prev_il_instructions */

   343

		/* The invalid FB invocation will be caught in the print_datatypes_error_c by analysing NULL value in il_operand->datatype! */

   344

		set_datatype_in_prev_il_instructions(il_instruction->datatype, fake_prev_il_instruction);

   345

		return NULL;

   346

	}

   347

   348

   349

	/* The value being passed to the 'param_name' parameter is actually the prev_il_instruction.

   350

	 * However, we do not place that object directly in the fake il_param_list_c that we will be

   351

	 * creating, since the visit(il_fb_call_c *) method will recursively call every object in that list.

   352

	 * The il_prev_intruction object will be visited once we have handled this implici IL FB call

   353

	 * (called from the instruction_list_c for() loop that works backwards). We DO NOT want to visit it twice.

   354

	 * (Anyway, if we let the visit(il_fb_call_c *) recursively visit the current prev_il_instruction, this pointer

   355

	 * would be changed to the IL instruction coming before the current prev_il_instruction! => things would get all messed up!)

   356

	 * The easiest way to work around this is to simply use a new object, and copy the relevant details to that object!

   357

	 */

   358

	symbol_c param_value = *fake_prev_il_instruction; /* copy the candidate_datatypes list ! */

   359

   360

	identifier_c variable_name(param_name);

   361

	// SYM_REF1(il_assign_operator_c, variable_name)

   362

	il_assign_operator_c il_assign_operator(&variable_name);  

   363

	// SYM_REF3(il_param_assignment_c, il_assign_operator, il_operand, simple_instr_list)

   364

	il_param_assignment_c il_param_assignment(&il_assign_operator, &param_value/*il_operand*/, NULL);

   365

	il_param_list_c il_param_list;

   366

	il_param_list.add_element(&il_param_assignment);

   367

	// SYM_REF4(il_fb_call_c, il_call_operator, fb_name, il_operand_list, il_param_list, symbol_c *called_fb_declaration)

   368

	CAL_operator_c CAL_operator;

   369

	il_fb_call_c il_fb_call(&CAL_operator, il_operand, NULL, &il_param_list);

   370

   371

	/* A FB call does not return any datatype, but the IL instructions that come after this

   372

	 * FB call may require a specific datatype in the il current/default variable, 

   373

	 * so we must pass this information up to the IL instruction before the FB call, since it will

   374

	 * be that IL instruction that will be required to produce the desired dtataype.

   375

	 *

   376

	 * The above will be done by the visit(il_fb_call_c *) method, so we must make sure to

   377

	 * correctly set up the il_fb_call.datatype variable!

   378

	 */

   379

	il_fb_call.called_fb_declaration = called_fb_declaration;

   380

	il_fb_call.accept(*this);

   381

   382

	/* set the required datatype of the previous IL instruction! */

   383

	/* NOTE:

   384

	 * When handling these implicit IL calls, the parameter_value being passed to the FB parameter

   385

	 * is actually the prev_il_instruction.

   386

	 * 

   387

	 * However, since the FB call does not change the value in the current/default IL variable, this value

   388

	 * must also be used ny the IL instruction coming after this FB call.

   389

	 *

   390

	 * This means that we have two consumers/users for the same value. 

   391

	 * We must therefore check whether the datatype required by the IL instructions following this FB call 

   392

	 * is the same as that required for the first parameter. If not, then we have a semantic error,

   393

	 * and we set it to invalid_type_name.

   394

	 *

   395

	 * However, we only do that if:

   396

	 *  - The IL instruction that comes after this IL FB call actually asked this FB call for a specific 

   397

	 *     datatype in the current/default vairable, once this IL FB call returns.

   398

	 *     However, sometimes, (for e.g., this FB call is the last in the IL list) the subsequent FB to not aks this

   399

	 *     FB call for any datatype. In that case, then the datatype required to pass to the first parameter of the

   400

	 *     FB call must be left unchanged!

   401

	 */

   402

	if ((NULL == il_instruction->datatype) || (is_type_equal(param_value.datatype, il_instruction->datatype))) {

   403

		set_datatype_in_prev_il_instructions(param_value.datatype, fake_prev_il_instruction);

   404

	} else {

   405

		set_datatype_in_prev_il_instructions(&search_constant_type_c::invalid_type_name, fake_prev_il_instruction);

   406

	}

   407

	return NULL;

   408

}

   409

   410

   411

/* a helper function... */

   412

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

   413

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

   414

	 *       in the code.

   415

	 */

   416

	if (symbol == NULL) return NULL;

   417

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

   418

}

   419

   420

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

   421

/* B 1.2 - Constants */

   422

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

   423

   424

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

   425

/* B 1.3 - Data types */

   426

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

   427

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

   428

/* B 1.3.3 - Derived data types */

   429

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

   430

/* simple_specification ASSIGN constant */

   431

// SYM_REF2(simple_spec_init_c, simple_specification, constant)

   432

void *narrow_candidate_datatypes_c::visit(simple_spec_init_c *symbol) {

   433

	if (symbol->candidate_datatypes.size() == 1)

   434

	  symbol->datatype = symbol->candidate_datatypes[0];

   435

   436

	if (symbol->simple_specification->candidate_datatypes.size() == 1)

   437

	  symbol->simple_specification->datatype = symbol->simple_specification->candidate_datatypes[0];

   438

   439

	if (NULL != symbol->constant) {

   440

		set_datatype(symbol->datatype, symbol->constant);

   441

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

   442

	}

   443

	return NULL;

   444

}

   445

   446

   447

   448

/*  signed_integer DOTDOT signed_integer */

   449

// SYM_REF2(subrange_c, lower_limit, upper_limit)

   450

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

   451

	symbol->lower_limit->datatype = symbol->datatype;

   452

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

   453

	symbol->upper_limit->datatype = symbol->datatype;

   454

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

   455

	return NULL;

   456

}

   457

   458

   459

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

   460

/* B 1.4 - Variables */

   461

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

   462

   463

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

   464

/* B 1.4.1 - Directly Represented Variables */

   465

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

   466

   467

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

   468

/* B 1.4.2 - Multi-element variables */

   469

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

   470

/*  subscripted_variable '[' subscript_list ']' */

   471

// SYM_REF2(array_variable_c, subscripted_variable, subscript_list)

   472

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

   473

	/* we need to check the data types of the expressions used for the subscripts... */

   474

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

   475

	return NULL;

   476

}

   477

   478

   479

/* subscript_list ',' subscript */

   480

// SYM_LIST(subscript_list_c)

   481

void *narrow_candidate_datatypes_c::visit(subscript_list_c *symbol) {

   482

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

   483

		for (unsigned int k = 0; k < symbol->elements[i]->candidate_datatypes.size(); k++) {

   485

				symbol->elements[i]->datatype = symbol->elements[i]->candidate_datatypes[k];

   486

		}

   487

		symbol->elements[i]->accept(*this);

   488

	}

   489

	return NULL;  

   490

}

   491

   492

   493

   494

   495

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

   496

/* B 1.4.3 - Declaration & Initialisation */

   497

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

   498

   499

void *narrow_candidate_datatypes_c::visit(var1_list_c *symbol) {

   500

#if 0   /* We don't really need to set the datatype of each variable. We just check the declaration itself! */

   501

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