Changeset 87b5bf0 for src/ControlStruct

Timestamp:

Jun 29, 2016, 2:30:12 PM (9 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

e64365c

Parents:

7305915 (diff), 2fb2ad5 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg2:software/cfa/cfa-cc

Location:

src/ControlStruct

Files:

• LabelFixer.cc (modified) (4 diffs)
• LabelFixer.h (modified) (3 diffs)
• LabelGenerator.cc (modified) (3 diffs)
• MLEMutator.cc (modified) (17 diffs)
• MLEMutator.h (modified) (6 diffs)
• Mutate.cc (modified) (3 diffs)

src/ControlStruct/LabelFixer.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// LabelFixer.cc -- 
+// LabelFixer.cc --
 //
 // Author           : Rodolfo G. Esteves
@@ -86 +86 @@
 
 
-        // sets the definition of the labelTable entry to be the provided 
+        // sets the definition of the labelTable entry to be the provided
         // statement for every label in the list parameter. Happens for every kind of statement
         Label LabelFixer::setLabelsDef( std::list< Label > &llabel, Statement *definition ) {
@@ -95 +95 @@
 
                 for ( std::list< Label >::iterator i = llabel.begin(); i != llabel.end(); i++ ) {
-                        if ( labelTable.find( *i ) == labelTable.end() ) {
+                        Label & l = *i;
+                        l.set_statement( definition ); // attach statement to the label to be used later
+                        if ( labelTable.find( l ) == labelTable.end() ) {
                                 // all labels on this statement need to use the same entry, so this should only be created once
                                 // undefined and unused until now, add an entry
-                                labelTable[ *i ] =  e;
-                        } else if ( labelTable[ *i ]->defined() ) {
+                                labelTable[ l ] =  e;
+                        } else if ( labelTable[ l ]->defined() ) {
                                 // defined twice, error
-                                throw SemanticError( "Duplicate definition of label: " + *i );
+                                throw SemanticError( "Duplicate definition of label: " + l.get_name() );
                         }       else {
                                 // used previously, but undefined until now -> link with this entry
-                                delete labelTable[ *i ];
-                                labelTable[ *i ] = e;
+                                delete labelTable[ l ];
+                                labelTable[ l ] = e;
                         } // if
                 } // for
 
-                // produce one of the labels attached to this statement to be 
+                // produce one of the labels attached to this statement to be
                 // temporarily used as the canonical label
                 return labelTable[ llabel.front() ]->get_label();
         }
 
-        // A label was used, add it ot the table if it isn't already there
+        // A label was used, add it to the table if it isn't already there
         template< typename UsageNode >
         void LabelFixer::setLabelsUsg( Label orgValue, UsageNode *use ) {
@@ -130 +132 @@
                 for ( std::map< Label, Entry * >::iterator i = labelTable.begin(); i != labelTable.end(); ++i ) {
                         if ( ! i->second->defined() ) {
-                                throw SemanticError( "Use of undefined label: " + i->first );
+                                throw SemanticError( "Use of undefined label: " + i->first.get_name() );
                         }
                         (*ret)[ i->first ] = i->second->get_definition();

src/ControlStruct/LabelFixer.h

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// LabelFixer.h -- 
+// LabelFixer.h --
 //
 // Author           : Rodolfo G. Esteves
@@ -20 +20 @@
 #include "SynTree/SynTree.h"
 #include "SynTree/Visitor.h"
+#include "SynTree/Label.h"
 #include "LabelGenerator.h"
-
 #include <map>
 
@@ -74 +74 @@
 
                   private:
-                        Label label;  
+                        Label label;
                         Statement *definition;
                 };
-                  
+
                 std::map < Label, Entry *> labelTable;
                 LabelGenerator *generator;

src/ControlStruct/LabelGenerator.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// LabelGenerator.cc -- 
+// LabelGenerator.cc --
 //
 // Author           : Rodolfo G. Esteves
@@ -18 +18 @@
 
 #include "LabelGenerator.h"
+#include "SynTree/Label.h"
+#include "SynTree/Attribute.h"
 
 namespace ControlStruct {
@@ -33 +35 @@
                 os << "__L" << current++ << "__" << suffix;
                 std::string ret = os.str();
-                return Label( ret );
+                Label l( ret );
+                l.get_attributes().push_back( new Attribute("unused") );
+                return l;
         }
 } // namespace ControlStruct

src/ControlStruct/MLEMutator.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// MLEMutator.cc -- 
+// MLEMutator.cc --
 //
 // Author           : Rodolfo G. Esteves
@@ -14 +14 @@
 //
 
-// NOTE: There are two known subtle differences from the code that uC++ 
+// NOTE: There are two known subtle differences from the code that uC++
 // generates for the same input
 // -CFA puts the break label inside at the end of a switch, uC++ puts it after
@@ -27 +27 @@
 #include "SynTree/Statement.h"
 #include "SynTree/Expression.h"
+#include "SynTree/Attribute.h"
 
 namespace ControlStruct {
@@ -33 +34 @@
                 targetTable = 0;
         }
-
-        // break labels have to come after the statement they break out of, 
+        namespace {
+                Statement * isLoop( Statement * stmt ) { return dynamic_cast< WhileStmt * >( stmt ) ? stmt : dynamic_cast< ForStmt * >( stmt ) ? stmt : 0; }
+        }
+
+        // break labels have to come after the statement they break out of,
         // so mutate a statement, then if they inform us through the breakLabel field
-        // tha they need a place to jump to on a break statement, add the break label 
+        // tha they need a place to jump to on a break statement, add the break label
         // to the body of statements
         void MLEMutator::fixBlock( std::list< Statement * > &kids ) {
@@ -44 +48 @@
                         if ( ! get_breakLabel().empty() ) {
                                 std::list< Statement * >::iterator next = k+1;
-                                if ( next == kids.end() ) {
-                                        std::list<Label> ls; ls.push_back( get_breakLabel() );
-                                        kids.push_back( new NullStmt( ls ) );
-                                } else {
-                                        (*next)->get_labels().push_back( get_breakLabel() );
-                                }
-
+                                std::list<Label> ls; ls.push_back( get_breakLabel() );
+                                kids.insert( next, new NullStmt( ls ) );
                                 set_breakLabel("");
                         } // if
@@ -60 +59 @@
                 if ( labeledBlock ) {
                         Label brkLabel = generator->newLabel("blockBreak");
-                        enclosingBlocks.push_back( Entry( cmpndStmt, brkLabel ) );
+                        enclosingControlStructures.push_back( Entry( cmpndStmt, brkLabel ) );
                 } // if
 
@@ -69 +68 @@
 
                 if ( labeledBlock ) {
-                        assert( ! enclosingBlocks.empty() );
-                        if ( ! enclosingBlocks.back().useBreakExit().empty() ) {
-                                set_breakLabel( enclosingBlocks.back().useBreakExit() );
-                        }
-                        enclosingBlocks.pop_back();
+                        assert( ! enclosingControlStructures.empty() );
+                        if ( ! enclosingControlStructures.back().useBreakExit().empty() ) {
+                                set_breakLabel( enclosingControlStructures.back().useBreakExit() );
+                        }
+                        enclosingControlStructures.pop_back();
                 } // if
 
@@ -81 +80 @@
         template< typename LoopClass >
         Statement *MLEMutator::handleLoopStmt( LoopClass *loopStmt ) {
-                // remember this as the most recent enclosing loop, then mutate 
+                // remember this as the most recent enclosing loop, then mutate
                 // the body of the loop -- this will determine whether brkLabel
                 // and contLabel are used with branch statements
@@ -87 +86 @@
                 Label brkLabel = generator->newLabel("loopBreak");
                 Label contLabel = generator->newLabel("loopContinue");
-                enclosingLoops.push_back( Entry( loopStmt, brkLabel, contLabel ) );
+                enclosingControlStructures.push_back( Entry( loopStmt, brkLabel, contLabel ) );
                 loopStmt->set_body ( loopStmt->get_body()->acceptMutator( *this ) );
 
                 // sanity check that the enclosing loops have been popped correctly
-                Entry &e = enclosingLoops.back();
+                Entry &e = enclosingControlStructures.back();
                 assert ( e == loopStmt );
 
@@ -97 +96 @@
                 // two labels, if they are used.
                 loopStmt->set_body( mutateLoop( loopStmt->get_body(), e ) );
-                enclosingLoops.pop_back();
+                enclosingControlStructures.pop_back();
 
                 return loopStmt;
@@ -111 +110 @@
         template< typename SwitchClass >
         Statement *MLEMutator::handleSwitchStmt( SwitchClass *switchStmt ) {
-                // generate a label for breaking out of a labeled switch 
+                // generate a label for breaking out of a labeled switch
                 Label brkLabel = generator->newLabel("switchBreak");
-                enclosingSwitches.push_back( Entry(switchStmt, brkLabel) );
-                mutateAll( switchStmt->get_branches(), *this ); 
-
-                Entry &e = enclosingSwitches.back();
+                enclosingControlStructures.push_back( Entry(switchStmt, brkLabel) );
+                mutateAll( switchStmt->get_branches(), *this );
+
+                Entry &e = enclosingControlStructures.back();
                 assert ( e == switchStmt );
 
                 // only generate break label if labeled break is used
                 if (e.isBreakUsed()) {
-                        // for the purposes of keeping switch statements uniform (i.e. all statements that are 
-                        // direct children of a switch should be CastStmts), append the exit label + break to the 
+                        // for the purposes of keeping switch statements uniform (i.e. all statements that are
+                        // direct children of a switch should be CastStmts), append the exit label + break to the
                         // last case statement; create a default case if there are no cases
                         std::list< Statement * > &branches = switchStmt->get_branches();
@@ -131 +130 @@
                         if ( CaseStmt * c = dynamic_cast< CaseStmt * >( branches.back() ) ) {
                                 std::list<Label> temp; temp.push_back( brkLabel );
-                                c->get_statements().push_back( new BranchStmt( temp, Label(""), BranchStmt::Break ) );
+                                c->get_statements().push_back( new BranchStmt( temp, Label("brkLabel"), BranchStmt::Break ) );
                         } else assert(0); // as of this point, all branches of a switch are still CaseStmts
                 }
 
-                assert ( enclosingSwitches.back() == switchStmt );
-                enclosingSwitches.pop_back();
+                assert ( enclosingControlStructures.back() == switchStmt );
+                enclosingControlStructures.pop_back();
                 return switchStmt;
         }
@@ -143 +142 @@
                 std::string originalTarget = branchStmt->get_originalTarget();
 
-                if ( branchStmt->get_type() == BranchStmt::Goto )
+                std::list< Entry >::reverse_iterator targetEntry;
+                if ( branchStmt->get_type() == BranchStmt::Goto ) {
                         return branchStmt;
-
-                // test if continue target is a loop
-                if ( branchStmt->get_type() == BranchStmt::Continue) {
-                        if ( enclosingLoops.empty() ) {
-                                throw SemanticError( "'continue' outside a loop" );
-                        } else if ( branchStmt->get_target() != "" && std::find( enclosingLoops.begin(), enclosingLoops.end(), (*targetTable)[branchStmt->get_target()] ) == enclosingLoops.end() ) {
-                                throw SemanticError( "'continue' target label must be an enclosing loop: " + originalTarget );
-                        }
-                }
-
-                if ( branchStmt->get_type() == BranchStmt::Break && (enclosingLoops.empty() && enclosingSwitches.empty() && enclosingBlocks.empty() ) )
-                        throw SemanticError( "'break' outside a loop or switch" );
-
-                if ( branchStmt->get_target() == "" ) return branchStmt;
-
-                if ( targetTable->find( branchStmt->get_target() ) == targetTable->end() )
+                } else if ( branchStmt->get_type() == BranchStmt::Continue) {
+                        // continue target must be a loop
+                        if ( branchStmt->get_target() == "" ) {
+                                targetEntry = std::find_if( enclosingControlStructures.rbegin(), enclosingControlStructures.rend(), [](Entry &e) { return isLoop( e.get_controlStructure() ); } );
+                        } else {
+                                // labelled continue - lookup label in table ot find attached control structure
+                                targetEntry = std::find( enclosingControlStructures.rbegin(), enclosingControlStructures.rend(), (*targetTable)[branchStmt->get_target()] );
+                        }
+                        if ( targetEntry == enclosingControlStructures.rend() || ! isLoop( targetEntry->get_controlStructure() ) ) {
+                                throw SemanticError( "'continue' target must be an enclosing loop: " + originalTarget );
+                        }
+                } else if ( branchStmt->get_type() == BranchStmt::Break ) {
+                        if ( enclosingControlStructures.empty() ) throw SemanticError( "'break' outside a loop, switch, or labelled block" );
+                        targetEntry = enclosingControlStructures.rbegin();
+                } else {
+                        assert( false );
+                }
+
+                if ( branchStmt->get_target() != "" && targetTable->find( branchStmt->get_target() ) == targetTable->end() ) {
                         throw SemanticError("The label defined in the exit loop statement does not exist: " + originalTarget );  // shouldn't happen (since that's already checked)
-
-                std::list< Entry >::iterator check;
-                if ( ( check = std::find( enclosingLoops.begin(), enclosingLoops.end(), (*targetTable)[branchStmt->get_target()] ) ) == enclosingLoops.end() )
-                        // not in loop, checking if in block
-                        if ( (check = std::find( enclosingBlocks.begin(), enclosingBlocks.end(), (*targetTable)[branchStmt->get_target()] )) == enclosingBlocks.end() )
-                                // neither in loop nor in block, checking if in switch/choose
-                                if ( (check = std::find( enclosingSwitches.begin(), enclosingSwitches.end(), (*targetTable)[branchStmt->get_target()] )) == enclosingSwitches.end() )
-                                        throw SemanticError("The target specified in the exit loop statement does not correspond to an enclosing control structure: " + originalTarget );
-
-                // what about exiting innermost block or switch???
-                if ( enclosingLoops.back() == (*check) )
-                        return branchStmt;                              // exit the innermost loop (labels unnecessary)
+                }
 
                 // branch error checks, get the appropriate label name and create a goto
@@ -179 +171 @@
                 switch ( branchStmt->get_type() ) {
                   case BranchStmt::Break:
-                                assert( check->useBreakExit() != "");
-                                exitLabel = check->useBreakExit();
+                                assert( targetEntry->useBreakExit() != "");
+                                exitLabel = targetEntry->useBreakExit();
                                 break;
                   case BranchStmt::Continue:
-                                assert( check->useContExit() != "");
-                                exitLabel = check->useContExit();
+                                assert( targetEntry->useContExit() != "");
+                                exitLabel = targetEntry->useContExit();
                                 break;
                   default:
@@ -190 +182 @@
                 } // switch
 
-                return new BranchStmt( std::list<Label>(), exitLabel, BranchStmt::Goto );
+                if ( branchStmt->get_target() == "" && branchStmt->get_type() != BranchStmt::Continue ) {
+                        // unlabelled break/continue - can keep branch as break/continue for extra semantic information, but add
+                        // exitLabel as its destination so that label passes can easily determine where the break/continue goes to
+                        branchStmt->set_target( exitLabel );
+                        return branchStmt;
+                } else {
+                        // labelled break/continue - can't easily emulate this with break and continue, so transform into a goto
+                        delete branchStmt;
+                        return new BranchStmt( std::list<Label>(), exitLabel, BranchStmt::Goto );
+                }
         }
 
@@ -206 +207 @@
                         // continue label goes in the body as the last statement
                         std::list< Label > labels; labels.push_back( e.useContExit() );
-                        newBody->get_kids().push_back( new NullStmt( labels ) );                        
+                        newBody->get_kids().push_back( new NullStmt( labels ) );
                 }
 
                 if ( e.isBreakUsed() ) {
-                        // break label goes after the loop -- it'll get set by the 
+                        // break label goes after the loop -- it'll get set by the
                         // outer mutator if we do this
-                        set_breakLabel( e.useBreakExit() );                     
+                        set_breakLabel( e.useBreakExit() );
                 }
 
@@ -231 +232 @@
 
         Statement *MLEMutator::mutate( ChooseStmt *switchStmt ) {
-                return handleSwitchStmt( switchStmt );          
+                return handleSwitchStmt( switchStmt );
         }
 

src/ControlStruct/MLEMutator.h

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// MLEMutator.h -- 
+// MLEMutator.h --
 //
 // Author           : Rodolfo G. Esteves
@@ -23 +23 @@
 #include "SynTree/SynTree.h"
 #include "SynTree/Mutator.h"
+#include "SynTree/Label.h"
 
 #include "LabelGenerator.h"
@@ -38 +39 @@
                 Statement *mutate( BranchStmt *branchStmt ) throw ( SemanticError );
 
-                Statement *mutate( CaseStmt *caseStmt ); 
+                Statement *mutate( CaseStmt *caseStmt );
                 Statement *mutate( SwitchStmt *switchStmt );
                 Statement *mutate( ChooseStmt *switchStmt );
@@ -55 +56 @@
                         bool operator!=( const Statement *stmt ) { return ( loop != stmt ); }
 
-                        bool operator==( const Entry &other ) { return ( loop == other.get_loop() ); }
+                        bool operator==( const Entry &other ) { return ( loop == other.get_controlStructure() ); }
 
-                        Statement *get_loop() const { return loop; }
+                        Statement *get_controlStructure() const { return loop; }
 
                         Label useContExit() { contUsed = true; return contExit; }
@@ -72 +73 @@
 
                 std::map< Label, Statement * > *targetTable;
-                std::list< Entry > enclosingBlocks, enclosingLoops, enclosingSwitches;
+                std::list< Entry > enclosingControlStructures;
                 Label breakLabel;
                 LabelGenerator *generator;
@@ -79 +80 @@
                 Statement *handleLoopStmt( LoopClass *loopStmt );
 
-                template< typename SwitchClass > 
+                template< typename SwitchClass >
                 Statement *handleSwitchStmt( SwitchClass *switchStmt );
 

src/ControlStruct/Mutate.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// Mutate.cc -- 
+// Mutate.cc --
 //
 // Author           : Rodolfo G. Esteves
@@ -39 +39 @@
                 ForExprMutator formut;
 
+                // transform choose statements into switch statements
+                ChooseMutator chmut;
+
                 // normalizes label definitions and generates multi-level
                 // exit labels
                 LabelFixer lfix;
-
-                // transform choose statements into switch statements
-                ChooseMutator chmut;
 
                 // expand case ranges and turn fallthru into a null statement
@@ -53 +53 @@
 
                 mutateAll( translationUnit, formut );
+                mutateAll( translationUnit, chmut );
                 acceptAll( translationUnit, lfix );
-                mutateAll( translationUnit, chmut );
                 mutateAll( translationUnit, ranges );
                 //mutateAll( translationUnit, exc );