1

/*

     2

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

     3

 *  Copyright (C) 2003-2011  Mario de Sousa (msousa@fe.up.pt)

     4

 *  Copyright (C) 2007-2011  Laurent Bessard and Edouard Tisserant

     5

 *

     6

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

     7

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

     8

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

     9

 *  (at your option) any later version.

    10

 *

    11

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

    12

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

    13

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    14

 *  GNU General Public License for more details.

    15

 *

    16

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

    17

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

    18

 *

    19

 *

    20

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

    21

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

    22

 */

    23

    24

/*

    25

 * An IEC 61131-3 compiler.

    26

 *

    27

 * Based on the

    28

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

    29

 *

    30

 */

    31

    32

/*

    33

 * Definition of the Abstract Syntax data structure components

    34

 */

    35

    36

#include <stdio.h>

    37

#include <stdlib.h>	/* required for exit() */

    38

#include <string.h>

    39

    40

#include "absyntax.hh"

    41

//#include "../stage1_2/iec.hh" /* required for BOGUS_TOKEN_ID, etc... */

    42

#include "visitor.hh"

    43

#include "../main.hh" // required for ERROR() and ERROR_MSG() macros.

    44

    45

    46

    47

/* The base class of all symbols */

    48

symbol_c::symbol_c(

    49

                   int first_line, int first_column, const char *ffile, long int first_order,

    50

                   int last_line,  int last_column,  const char *lfile, long int last_order ) {

    51

  this->first_file   = ffile,

    52

  this->first_line   = first_line;

    53

  this->first_column = first_column;

    54

  this->first_order  = first_order;

    55

  this->last_file    = lfile,

    56

  this->last_line    = last_line;

    57

  this->last_column  = last_column;

    58

  this->last_order   = last_order;

    60

  this->datatype     = NULL;

    61

  this->scope        = NULL;

    62

  this->const_value._real64.status   = cs_undefined;

    63

  this->const_value._int64.status    = cs_undefined;

    64

  this->const_value._uint64.status   = cs_undefined;

    65

  this->const_value._bool.status     = cs_undefined;

    66

}

    67

    68

    69

    70

token_c::token_c(const char *value, 

    71

                 int fl, int fc, const char *ffile, long int forder,

    72

                 int ll, int lc, const char *lfile, long int lorder)

    73

  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {

    74

  this->value = value;

    75

//  printf("New token: %s\n", value);

    76

}

    77

    78

    79

    80

    81

# define LIST_CAP_INIT 8

    82

# define LIST_CAP_INCR 8

    83

    84

list_c::list_c(

    85

               int fl, int fc, const char *ffile, long int forder,

    86

               int ll, int lc, const char *lfile, long int lorder)

    87

  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder),c(LIST_CAP_INIT) {

    88

  n = 0;

    89

  elements = (symbol_c**)malloc(LIST_CAP_INIT*sizeof(symbol_c*));

    90

  if (NULL == elements) ERROR_MSG("out of memory");

    91

}

    92

    93

    94

list_c::list_c(symbol_c *elem, 

    95

               int fl, int fc, const char *ffile, long int forder,

    96

               int ll, int lc, const char *lfile, long int lorder)

    97

  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder),c(LIST_CAP_INIT) { 

    98

  n = 0;

    99

  elements = (symbol_c**)malloc(LIST_CAP_INIT*sizeof(symbol_c*));

   100

  if (NULL == elements) ERROR_MSG("out of memory");

   101

  add_element(elem); 

   102

}

   103

   104

   105

/* append a new element to the end of the list */

   106

void list_c::add_element(symbol_c *elem) {

   107

  // printf("list_c::add_element()\n");

   108

  if (c <= n)

   109

    if (!(elements=(symbol_c**)realloc(elements,(c+=LIST_CAP_INCR)*sizeof(symbol_c *))))

   110

      ERROR_MSG("out of memory");

   111

  elements[n++] = elem;

   112

   113

  if (NULL == elem) return;

   120

   121

  /* adjust the location parameters, taking into account the new element. */

   122

  if (NULL == first_file) {

   123

    first_file = elem->first_file;

   124

    first_line = elem->first_line;

   125

    first_column = elem->first_column;

   126

  }

   127

  if ((first_line == elem->first_line) && (first_column > elem->first_column)) {

   128

    first_column = elem->first_column;

   129

  }

   130

  if (first_line > elem->first_line) {

   131

    first_line = elem->first_line;

   132

    first_column = elem->first_column;

   133

  }

   134

  if (NULL == last_file) {

   135

    last_file = elem->last_file;

   136

    last_line = elem->last_line;

   137

    last_column = elem->last_column;

   138

  }

   139

  if ((last_line == elem->last_line) &&

   140

      (last_column < elem->last_column)) {

   141

    last_column = elem->last_column;

   142

  }

   143

  if (last_line < elem->last_line) {

   144

    last_line = elem->last_line;

   145

    last_column = elem->last_column;

   146

  }

   147

}

   148

   149

/* insert a new element before position pos. */

   150

/* To insert into the begining of list, call with pos=0  */

   151

/* To insert into the end of list, call with pos=list->n */

   152

void list_c::insert_element(symbol_c *elem, int pos) {

   153

  if((pos<0) || (n<pos)) ERROR;

   154

   155

  /* add new element to end of list. Basically alocate required memory... */

   156

  /* will also increment n by 1 ! */

   157

  add_element(elem);

   158

  /* if not inserting into end position, shift all elements up one position, to open up a slot in pos for new element */

   159

  if(pos < (n-1)){ 

   160

    for(int i=n-2 ; i>=pos ; --i) elements[i+1] = elements[i];

   161

    elements[pos] = elem;

   162

  }

   163

}

   164

   165

   166

/* remove element at position pos. */

   167

void list_c::remove_element(int pos) {

   168

  if((pos<0) || (n<=pos)) ERROR;

   169

   170

  /* Shift all elements down one position, starting at the entry to delete. */

   171

  for (int i = pos; i < n-1; i++) elements[i] = elements[i+1];

   172

  /* corrent the new size */

   173

  n--;

   174

  /* elements = (symbol_c **)realloc(elements, n * sizeof(symbol_c *)); */

   175

}

   176

   177

#define SYM_LIST(class_name_c, ...)								\

   178

class_name_c::class_name_c(									\

   179

                           int fl, int fc, const char *ffile, long int forder,			\

   180

                           int ll, int lc, const char *lfile, long int lorder)			\

   181

                        :list_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {}		\

   182

class_name_c::class_name_c(symbol_c *elem, 							\

   183

                           int fl, int fc, const char *ffile, long int forder,			\

   184

                           int ll, int lc, const char *lfile, long int lorder)			\

   185

			:list_c(elem, fl, fc, ffile, forder, ll, lc, lfile, lorder) {}		\

   186

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   187

   188

#define SYM_TOKEN(class_name_c, ...)								\

   189

class_name_c::class_name_c(const char *value, 							\

   190

                           int fl, int fc, const char *ffile, long int forder,			\

   191

                           int ll, int lc, const char *lfile, long int lorder)			\

   192

			:token_c(value, fl, fc, ffile, forder, ll, lc, lfile, lorder) {}	\

   193

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   194

   195

#define SYM_REF0(class_name_c, ...)								\

   196

class_name_c::class_name_c(									\

   197

                           int fl, int fc, const char *ffile, long int forder,			\

   198

                           int ll, int lc, const char *lfile, long int lorder)			\

   199

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {}		\

   200

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   201

   202

   203

#define SYM_REF1(class_name_c, ref1, ...)							\

   204

class_name_c::class_name_c(symbol_c *ref1,							\

   205

                           int fl, int fc, const char *ffile, long int forder,			\

   206

                           int ll, int lc, const char *lfile, long int lorder)			\

   207

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   208

  this->ref1 = ref1;										\

   210

}												\

   211

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   212

   213

   214

#define SYM_REF2(class_name_c, ref1, ref2, ...)							\

   215

class_name_c::class_name_c(symbol_c *ref1,							\

   216

			   symbol_c *ref2,							\

   217

                           int fl, int fc, const char *ffile, long int forder,			\

   218

                           int ll, int lc, const char *lfile, long int lorder)			\

   219

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   220

  this->ref1 = ref1;										\

   221

  this->ref2 = ref2;										\

   224

}												\

   225

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   226

   227

   228

#define SYM_REF3(class_name_c, ref1, ref2, ref3, ...)						\

   229

class_name_c::class_name_c(symbol_c *ref1,							\

   230

			   symbol_c *ref2,							\

   231

			   symbol_c *ref3,							\

   232

                           int fl, int fc, const char *ffile, long int forder,			\

   233

                           int ll, int lc, const char *lfile, long int lorder)			\

   234

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   235

  this->ref1 = ref1;										\

   236

  this->ref2 = ref2;										\

   237

  this->ref3 = ref3;										\

   241

}												\

   242

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   243

   244

   245

#define SYM_REF4(class_name_c, ref1, ref2, ref3, ref4, ...)					\

   246

class_name_c::class_name_c(symbol_c *ref1,							\

   247

			   symbol_c *ref2,							\

   248

			   symbol_c *ref3,							\

   249

			   symbol_c *ref4,							\

   250

                           int fl, int fc, const char *ffile, long int forder,			\

   251

                           int ll, int lc, const char *lfile, long int lorder)			\

   252

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   253

  this->ref1 = ref1;										\

   254

  this->ref2 = ref2;										\

   255

  this->ref3 = ref3;										\

   256

  this->ref4 = ref4;										\

   261

}												\

   262

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   263

   264

   265

#define SYM_REF5(class_name_c, ref1, ref2, ref3, ref4, ref5, ...)				\

   266

class_name_c::class_name_c(symbol_c *ref1,							\

   267

			   symbol_c *ref2,							\

   268

			   symbol_c *ref3,							\

   269

			   symbol_c *ref4,							\

   270

			   symbol_c *ref5,							\

   271

                           int fl, int fc, const char *ffile, long int forder,			\

   272

                           int ll, int lc, const char *lfile, long int lorder)			\

   273

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   274

  this->ref1 = ref1;										\

   275

  this->ref2 = ref2;										\

   276

  this->ref3 = ref3;										\

   277

  this->ref4 = ref4;										\

   278

  this->ref5 = ref5;										\

   284

}												\

   285

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   286

   287

   288

   289

#define SYM_REF6(class_name_c, ref1, ref2, ref3, ref4, ref5, ref6, ...)				\

   290

class_name_c::class_name_c(symbol_c *ref1,							\

   291

			   symbol_c *ref2,							\

   292

			   symbol_c *ref3,							\

   293

			   symbol_c *ref4,							\

   294

			   symbol_c *ref5,							\

   295

			   symbol_c *ref6,							\

   296

                           int fl, int fc, const char *ffile, long int forder,			\

   297

                           int ll, int lc, const char *lfile, long int lorder)			\

   298

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   299

  this->ref1 = ref1;										\

   300

  this->ref2 = ref2;										\

   301

  this->ref3 = ref3;										\

   302

  this->ref4 = ref4;										\

   303

  this->ref5 = ref5;										\

   304

  this->ref6 = ref6;										\

   311

}												\

   312

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   313

   314

   315

   316

#include "absyntax.def"

   317

   318

   319

   320

   321

#undef SYM_LIST

   322

#undef SYM_TOKEN

   323

#undef SYM_TOKEN

   324

#undef SYM_REF0

   325

#undef SYM_REF1

   326

#undef SYM_REF2

   327

#undef SYM_REF3

   328

#undef SYM_REF4

   329

#undef SYM_REF5

   330

#undef SYM_REF6

   331

   332

   333

   334

   335