source: src/ControlStruct/LabelFixer.cc@ 7b91c0e

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 7b91c0e was 9d6317f, checked in by Andrew Beach <ajbeach@…>, 6 years ago

Added checks for returning from a finally clause. And breaking from a nested function.

  • Property mode set to 100644
File size: 4.8 KB
RevLine 
[51587aa]1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
[0f8e4ac]7// LabelFixer.cc --
[51587aa]8//
[843054c2]9// Author : Rodolfo G. Esteves
[51587aa]10// Created On : Mon May 18 07:44:20 2015
[5cdeecd]11// Last Modified By : Andrew Beach
12// Last Modified On : Tue Jan 21 10:32:00 2020
13// Update Count : 160
[51587aa]14//
[a08ba92]15
[d180746]16#include <cassert> // for assert
17#include <list> // for list, _List_iterator, list...
18#include <string> // for operator+, string, operator==
19#include <utility> // for pair
[51b73452]20
[d180746]21#include "ControlStruct/LabelGenerator.h" // for LabelGenerator
[51b73452]22#include "LabelFixer.h"
[5cdeecd]23#include "MLEMutator.h" // for MultiLevelExitMutator
[d180746]24#include "SynTree/Declaration.h" // for FunctionDecl
25#include "SynTree/Expression.h" // for NameExpr, Expression, Unty...
26#include "SynTree/Statement.h" // for Statement, BranchStmt, Com...
[46cbfe1]27
[51b73452]28namespace ControlStruct {
[a08ba92]29 bool LabelFixer::Entry::insideLoop() {
30 return ( dynamic_cast< ForStmt * > ( definition ) ||
[46cbfe1]31 dynamic_cast< WhileStmt * > ( definition ) );
[a08ba92]32 }
[d9a0e76]33
[35a2d47]34 LabelFixer::LabelFixer( LabelGenerator * gen ) : generator ( gen ) {
[a08ba92]35 if ( generator == 0 )
36 generator = LabelGenerator::getGenerator();
37 }
[51b73452]38
[1fbeebd]39 void LabelFixer::previsit( FunctionDecl * ) {
[0a0a65b]40 // need to go into a nested function in a fresh state
[1fbeebd]41 GuardValue( labelTable );
[0a0a65b]42 labelTable.clear();
[1fbeebd]43 }
[0a0a65b]44
[1fbeebd]45 void LabelFixer::postvisit( FunctionDecl * functionDecl ) {
[5cdeecd]46 PassVisitor<MultiLevelExitMutator> mlem( resolveJumps(), generator );
[9d6317f]47 // We start in the body so we can stop when we hit another FunctionDecl.
48 maybeMutate( functionDecl->statements, mlem );
[a08ba92]49 }
[51b73452]50
[46cbfe1]51 // prune to at most one label definition for each statement
[35a2d47]52 void LabelFixer::previsit( Statement * stmt ) {
[a08ba92]53 std::list< Label > &labels = stmt->get_labels();
[51b73452]54
[a08ba92]55 if ( ! labels.empty() ) {
[46cbfe1]56 // only remember one label for each statement
[a08ba92]57 Label current = setLabelsDef( labels, stmt );
58 } // if
59 }
[d9a0e76]60
[35a2d47]61 void LabelFixer::previsit( BranchStmt * branchStmt ) {
[1fbeebd]62 previsit( ( Statement *)branchStmt );
[d9a0e76]63
[46cbfe1]64 // for labeled branches, add an entry to the label table
65 Label target = branchStmt->get_target();
66 if ( target != "" ) {
[a08ba92]67 setLabelsUsg( target, branchStmt );
[46cbfe1]68 }
[d9a0e76]69 }
70
[1fbeebd]71 void LabelFixer::previsit( LabelAddressExpr * addrExpr ) {
72 Label & target = addrExpr->arg;
73 assert( target != "" );
74 setLabelsUsg( target, addrExpr );
[1869adf]75 }
76
77
[6b6a3b8]78 // Sets the definition of the labelTable entry to be the provided statement for every label in
79 // the list parameter. Happens for every kind of statement.
[35a2d47]80 Label LabelFixer::setLabelsDef( std::list< Label > & llabel, Statement * definition ) {
[a08ba92]81 assert( definition != 0 );
[46cbfe1]82 assert( llabel.size() > 0 );
83
84 for ( std::list< Label >::iterator i = llabel.begin(); i != llabel.end(); i++ ) {
[23b6f4d7]85 Label & l = *i;
86 l.set_statement( definition ); // attach statement to the label to be used later
87 if ( labelTable.find( l ) == labelTable.end() ) {
[6b6a3b8]88 // All labels on this statement need to use the same entry,
89 // so this should only be created once.
[46cbfe1]90 // undefined and unused until now, add an entry
[6b6a3b8]91 labelTable[ l ] = new Entry( definition );
[23b6f4d7]92 } else if ( labelTable[ l ]->defined() ) {
[46cbfe1]93 // defined twice, error
[6b6a3b8]94 SemanticError( l.get_statement()->location,
95 "Duplicate definition of label: " + l.get_name() );
96 } else {
[954463b8]97 // used previously, but undefined until now -> link with this entry
[6b6a3b8]98 // Question: Is changing objects important?
[23b6f4d7]99 delete labelTable[ l ];
[6b6a3b8]100 labelTable[ l ] = new Entry( definition );
[46cbfe1]101 } // if
102 } // for
[a08ba92]103
[6b6a3b8]104 // Produce one of the labels attached to this statement to be temporarily used as the
105 // canonical label.
[46cbfe1]106 return labelTable[ llabel.front() ]->get_label();
[a08ba92]107 }
108
[23b6f4d7]109 // A label was used, add it to the table if it isn't already there
[1869adf]110 template< typename UsageNode >
111 void LabelFixer::setLabelsUsg( Label orgValue, UsageNode *use ) {
[a08ba92]112 assert( use != 0 );
113
[e766208]114 // add label with an unknown origin
115 if ( labelTable.find( orgValue ) == labelTable.end() ) {
116 labelTable[ orgValue ] = new Entry( 0 );
[46cbfe1]117 }
[a08ba92]118 }
119
[e766208]120 // Builds a table that maps a label to its defining statement.
[35a2d47]121 std::map<Label, Statement * > * LabelFixer::resolveJumps() throw ( SemanticErrorException ) {
[a08ba92]122 std::map< Label, Statement * > *ret = new std::map< Label, Statement * >();
[e766208]123 for ( std::map< Label, Entry * >::iterator i = labelTable.begin(); i != labelTable.end(); ++i ) {
124 if ( ! i->second->defined() ) {
[a16764a6]125 SemanticError( i->first.get_statement()->location, "Use of undefined label: " + i->first.get_name() );
[e766208]126 }
127 (*ret)[ i->first ] = i->second->get_definition();
[46cbfe1]128 }
[a08ba92]129
130 return ret;
131 }
[51b73452]132} // namespace ControlStruct
[a08ba92]133
[51587aa]134// Local Variables: //
135// tab-width: 4 //
136// mode: c++ //
137// compile-command: "make install" //
138// End: //
Note: See TracBrowser for help on using the repository browser.