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;

    59

  this->datatype     = NULL;

    60

  this->scope        = NULL;

    61

  this->const_value._real64.status   = cs_undefined;

    62

  this->const_value._int64.status    = cs_undefined;

    63

  this->const_value._uint64.status   = cs_undefined;

    64

  this->const_value._bool.status     = cs_undefined;

    65

}

    66

    67

    68

    69

token_c::token_c(const char *value, 

    70

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

    71

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

    72

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

    73

  this->value = value;

    74

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

    75

}

    76

    77

    78

    79

    80

# define LIST_CAP_INIT 8

    81

# define LIST_CAP_INCR 8

    82

    83

list_c::list_c(

    84

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

    85

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

    86

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

    87

  n = 0;

    88

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

    89

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

    90

}

    91

    92

    93

list_c::list_c(symbol_c *elem, 

    94

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

    95

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

    96

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

    97

  n = 0;

    98

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

    99

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

   100

  add_element(elem); 

   101

}

   102

   103

   104

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

   105

void list_c::add_element(symbol_c *elem) {

   106

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

   107

  if (c <= n)

   108

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

   109

      ERROR_MSG("out of memory");

   110

  elements[n++] = elem;

   111

   112

  if (NULL == elem) return;

   113

   114

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

   115

  if (NULL == first_file) {

   116

    first_file = elem->first_file;

   117

    first_line = elem->first_line;

   118

    first_column = elem->first_column;

   119

  }

   120

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

   121

    first_column = elem->first_column;

   122

  }

   123

  if (first_line > elem->first_line) {

   124

    first_line = elem->first_line;

   125

    first_column = elem->first_column;

   126

  }

   127

  if (NULL == last_file) {

   128

    last_file = elem->last_file;

   129

    last_line = elem->last_line;

   130

    last_column = elem->last_column;

   131

  }

   132

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

   133

      (last_column < elem->last_column)) {

   134

    last_column = elem->last_column;

   135

  }

   136

  if (last_line < elem->last_line) {

   137

    last_line = elem->last_line;

   138

    last_column = elem->last_column;

   139

  }

   140

}

   141

   142

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

   143

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

   144

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

   145

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

   146

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

   147

   148

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

   149

  /* will also increment n by 1 ! */

   150

  add_element(elem);

   151

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

   152

  if(pos < (n-1)){ 

   153

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

   154

    elements[pos] = elem;

   155

  }

   156

}

   157

   158

   159

/* remove element at position pos. */

   160

void list_c::remove_element(int pos) {

   161

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

   162

   163

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

   164

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

   165

  /* corrent the new size */

   166

  n--;

   167

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

   168

}

   169

   170

#define SYM_LIST(class_name_c, ...)								\

   171

class_name_c::class_name_c(									\

   172

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

   173

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

   174

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

   175

class_name_c::class_name_c(symbol_c *elem, 							\

   176

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

   177

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

   178

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

   179

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

   180

   181

#define SYM_TOKEN(class_name_c, ...)								\

   182

class_name_c::class_name_c(const char *value, 							\

   183

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

   184

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

   185

			:token_c(value, 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_REF0(class_name_c, ...)								\

   189

class_name_c::class_name_c(									\

   190

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

   191

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

   192

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

   193

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

   194

   195

   196

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

   197

class_name_c::class_name_c(symbol_c *ref1,							\

   198

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

   199

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

   200

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

   201

  this->ref1 = ref1;										\

   202

}												\

   203

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

   204

   205

   206

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

   207

class_name_c::class_name_c(symbol_c *ref1,							\

   208

			   symbol_c *ref2,							\

   209

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

   210

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

   211

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

   212

  this->ref1 = ref1;										\

   213

  this->ref2 = ref2;										\

   214

}												\

   215

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

   216

   217

   218

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

   219

class_name_c::class_name_c(symbol_c *ref1,							\

   220

			   symbol_c *ref2,							\

   221

			   symbol_c *ref3,							\

   222

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

   223

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

   224

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

   225

  this->ref1 = ref1;										\

   226

  this->ref2 = ref2;										\

   227

  this->ref3 = ref3;										\

   228

}												\

   229

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

   230

   231

   232

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

   233

class_name_c::class_name_c(symbol_c *ref1,							\

   234

			   symbol_c *ref2,							\

   235

			   symbol_c *ref3,							\

   236

			   symbol_c *ref4,							\

   237

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

   238

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

   239

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

   240

  this->ref1 = ref1;										\

   241

  this->ref2 = ref2;										\

   242

  this->ref3 = ref3;										\

   243

  this->ref4 = ref4;										\

   244

}												\

   245

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

   246

   247

   248

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

   249

class_name_c::class_name_c(symbol_c *ref1,							\

   250

			   symbol_c *ref2,							\

   251

			   symbol_c *ref3,							\

   252

			   symbol_c *ref4,							\

   253

			   symbol_c *ref5,							\

   254

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

   255

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

   256

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

   257

  this->ref1 = ref1;										\

   258

  this->ref2 = ref2;										\

   259

  this->ref3 = ref3;										\

   260

  this->ref4 = ref4;										\

   261

  this->ref5 = ref5;										\

   262

}												\

   263

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

   264

   265

   266

   267

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

   268

class_name_c::class_name_c(symbol_c *ref1,							\

   269

			   symbol_c *ref2,							\

   270

			   symbol_c *ref3,							\

   271

			   symbol_c *ref4,							\

   272

			   symbol_c *ref5,							\

   273

			   symbol_c *ref6,							\

   274

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

   275

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

   276

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

   277

  this->ref1 = ref1;										\

   278

  this->ref2 = ref2;										\

   279

  this->ref3 = ref3;										\

   280

  this->ref4 = ref4;										\

   281

  this->ref5 = ref5;										\

   282

  this->ref6 = ref6;										\

   283

}												\

   284

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

   285

   286

   287

   288

#include "absyntax.def"

   289

   290

   291

   292

   293

#undef SYM_LIST

   294

#undef SYM_TOKEN

   295

#undef SYM_TOKEN

   296

#undef SYM_REF0

   297

#undef SYM_REF1

   298

#undef SYM_REF2

   299

#undef SYM_REF3

   300

#undef SYM_REF4

   301

#undef SYM_REF5

   302

#undef SYM_REF6

   303

   304

   305

   306

   307