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) 2007-2011  Laurent Bessard and Edouard Tisserant

     6

 *  Copyright (C) 2012       Manuele Conti (manuele.conti@sirius-es.it)

     7

 *  Copyright (C) 2012       Matteo Facchinetti (matteo.facchinetti@sirius-es.it)

     8

 *

     9

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

    10

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

    11

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

    12

 *  (at your option) any later version.

    13

 *

    14

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

    15

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

    16

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    17

 *  GNU General Public License for more details.

    18

 *

    19

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

    20

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

    21

 *

    22

 *

    23

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

    24

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

    25

 */

    26

    27

/*

    28

 * An IEC 61131-3 compiler.

    29

 *

    30

 * Based on the

    31

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

    32

 *

    33

 */

    34

    35

#include "stage3.hh"

    36

    37

#include "flow_control_analysis.hh"

    38

#include "fill_candidate_datatypes.hh"

    39

#include "narrow_candidate_datatypes.hh"

    40

#include "forced_narrow_candidate_datatypes.hh"

    41

#include "print_datatypes_error.hh"

    42

#include "lvalue_check.hh"

    43

#include "array_range_check.hh"

    44

#include "constant_folding.hh"

    45

#include "declaration_check.hh"

    46

#include "enum_declaration_check.hh"

    47

    48

    49

static int enum_declaration_check(symbol_c *tree_root){

    50

    enum_declaration_check_c enum_declaration_check(NULL);

    51

    tree_root->accept(enum_declaration_check);

    52

    return enum_declaration_check.get_error_count();

    53

}

    54

    55

    56

static int declaration_safety(symbol_c *tree_root){

    57

    declaration_check_c declaration_check(tree_root);

    58

    tree_root->accept(declaration_check);

    59

    return declaration_check.get_error_count();

    60

}

    61

    62

static int flow_control_analysis(symbol_c *tree_root){

    63

    flow_control_analysis_c flow_control_analysis(tree_root);

    64

    tree_root->accept(flow_control_analysis);

    65

    return 0;

    66

}

    67

    68

    69

/* Constant folding assumes that flow control analysis has been completed!

    70

 * so be sure to call flow_control_analysis() before calling this function!

    71

 */

    72

static int constant_folding(symbol_c *tree_root){

    73

    constant_folding_c constant_folding(tree_root);

    74

    tree_root->accept(constant_folding);

    75

    return constant_folding.get_error_count();

    76

}

    77

    78

    79

/* Type safety analysis assumes that 

    80

 *    - flow control analysis 

    81

 *    - constant folding (constant check)

    82

 * has already been completed, so be sure to call those semantic checkers

    83

 * before calling this function

    84

 */

    85

static int type_safety(symbol_c *tree_root){

    86

	fill_candidate_datatypes_c fill_candidate_datatypes(tree_root);

    87

	tree_root->accept(fill_candidate_datatypes);

    88

	narrow_candidate_datatypes_c narrow_candidate_datatypes(tree_root);

    89

	tree_root->accept(narrow_candidate_datatypes);

    90

	print_datatypes_error_c print_datatypes_error(tree_root);

    91

	tree_root->accept(print_datatypes_error);

    92

	forced_narrow_candidate_datatypes_c forced_narrow_candidate_datatypes(tree_root);

    93

	tree_root->accept(forced_narrow_candidate_datatypes);

    94

	return print_datatypes_error.get_error_count();

    95

}

    96

    97

    98

/* Left value checking assumes that data type analysis has already been completed,

    99

 * so be sure to call type_safety() before calling this function

   100

 */

   101

static int lvalue_check(symbol_c *tree_root){

   102

	lvalue_check_c lvalue_check(tree_root);

   103

	tree_root->accept(lvalue_check);

   104

	return lvalue_check.get_error_count();

   105

}

   106

   107

/* Array range check assumes that constant folding has been completed!

   108

 * so be sure to call constant_folding() before calling this function!

   109

 */

   110

static int array_range_check(symbol_c *tree_root){

   111

	array_range_check_c array_range_check(tree_root);

   112

	tree_root->accept(array_range_check);

   113

	return array_range_check.get_error_count();

   114

}

   115

   116

   117

int stage3(symbol_c *tree_root){

   118

	int error_count = 0;

   119

	error_count += enum_declaration_check(tree_root);

   120

	error_count += declaration_safety(tree_root);

   121

	error_count += flow_control_analysis(tree_root);

   122

	error_count += constant_folding(tree_root);

   123

	error_count += type_safety(tree_root);

   124

	error_count += lvalue_check(tree_root);

   125

	error_count += array_range_check(tree_root);

   126

   127

	if (error_count > 0) {

   128

		fprintf(stderr, "%d error(s) found. Bailing out!\n", error_count); 

   129

		return -1;

   130

	}

   131

	return 0;

   132

}