Changeset 9a8930f for src/ControlStruct/LabelFixer.cc
- Timestamp:
- Jun 4, 2015, 2:07:40 PM (9 years ago)
- 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, string, with_gc
- Children:
- 0423f25, eb3261f
- Parents:
- a61fea9a (diff), 1136d96 (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. - File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/ControlStruct/LabelFixer.cc
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed May 27 16:16:14201513 // Update Count : 412 // Last Modified On : Tue Jun 02 15:30:32 2015 13 // Update Count : 93 14 14 // 15 15 … … 23 23 #include "utility.h" 24 24 25 #include <iostream> 26 25 27 namespace ControlStruct { 26 LabelFixer::Entry::Entry( Statement *to, Statement *from ) : definition ( to ) {28 LabelFixer::Entry::Entry( Statement *to, BranchStmt *from ) : definition ( to ) { 27 29 if ( from != 0 ) 28 30 usage.push_back( from ); … … 31 33 bool LabelFixer::Entry::insideLoop() { 32 34 return ( dynamic_cast< ForStmt * > ( definition ) || 33 35 dynamic_cast< WhileStmt * > ( definition ) ); 34 36 } 35 37 … … 46 48 } 47 49 50 // prune to at most one label definition for each statement 48 51 void LabelFixer::visit( Statement *stmt ) { 49 52 std::list< Label > &labels = stmt->get_labels(); 50 53 51 54 if ( ! labels.empty() ) { 55 // only remember one label for each statement 52 56 Label current = setLabelsDef( labels, stmt ); 53 57 labels.clear(); … … 57 61 58 62 void LabelFixer::visit( BranchStmt *branchStmt ) { 59 visit ( ( Statement * )branchStmt ); // the labels this statement might have63 visit ( ( Statement * )branchStmt ); 60 64 61 Label target; 62 if ( (target = branchStmt->get_target()) != "" ) { 65 // for labeled branches, add an entry to the label table 66 Label target = branchStmt->get_target(); 67 if ( target != "" ) { 63 68 setLabelsUsg( target, branchStmt ); 64 } //else /* computed goto or normal exit-loop statements */69 } 65 70 } 66 71 72 // sets the definition of the labelTable entry to be the provided 73 // statement for every label in the list parameter. Happens for every kind of statement 67 74 Label LabelFixer::setLabelsDef( std::list< Label > &llabel, Statement *definition ) { 68 75 assert( definition != 0 ); 69 Entry *entry = new Entry( definition ); 70 bool used = false; 76 assert( llabel.size() > 0 ); 71 77 72 for ( std::list< Label >::iterator i = llabel.begin(); i != llabel.end(); i++ ) 73 if ( labelTable.find( *i ) == labelTable.end() ) 74 { used = true; labelTable[ *i ] = entry; } // undefined and unused 75 else 76 if ( labelTable[ *i ]->defined() ) 77 throw SemanticError( "Duplicate definition of label: " + *i ); 78 else 79 labelTable[ *i ]->set_definition( definition ); 78 Entry * e = new Entry( definition ); 80 79 81 if ( ! used ) delete entry; 80 for ( std::list< Label >::iterator i = llabel.begin(); i != llabel.end(); i++ ) { 81 if ( labelTable.find( *i ) == labelTable.end() ) { 82 // all labels on this statement need to use the same entry, so this should only be created once 83 // undefined and unused until now, add an entry 84 labelTable[ *i ] = e; 85 } else if ( labelTable[ *i ]->defined() ) { 86 // defined twice, error 87 throw SemanticError( "Duplicate definition of label: " + *i ); 88 } else { 89 // used previously, but undefined until now -> link with this entry 90 Entry * oldEntry = labelTable[ *i ]; 91 e->add_uses( oldEntry->get_uses() ); 92 labelTable[ *i ] = e; 93 } // if 94 } // for 82 95 83 return labelTable[ llabel.front() ]->get_label(); // this *must* exist 96 // produce one of the labels attached to this statement to be 97 // temporarily used as the canonical label 98 return labelTable[ llabel.front() ]->get_label(); 84 99 } 85 100 86 Label LabelFixer::setLabelsUsg( Label orgValue, Statement *use ) { 101 // Remember all uses of a label. 102 void LabelFixer::setLabelsUsg( Label orgValue, BranchStmt *use ) { 87 103 assert( use != 0 ); 88 104 89 if ( labelTable.find( orgValue ) != labelTable.end() ) 90 labelTable[ orgValue ]->add_use( use ); // the label has been defined or used before 91 else 105 if ( labelTable.find( orgValue ) != labelTable.end() ) { 106 // the label has been defined or used before 107 labelTable[ orgValue ]->add_use( use ); 108 } else { 92 109 labelTable[ orgValue ] = new Entry( 0, use ); 93 94 return labelTable[ orgValue ]->get_label(); 110 } 95 111 } 96 112 113 // Ultimately builds a table that maps a label to its defining statement. 114 // In the process, 97 115 std::map<Label, Statement * > *LabelFixer::resolveJumps() throw ( SemanticError ) { 98 116 std::map< Statement *, Entry * > def_us; 99 117 100 for ( std::map< Label, Entry *>::iterator i = labelTable.begin(); i != labelTable.end(); i++ ) { 118 // combine the entries for all labels that target the same location 119 for ( std::map< Label, Entry *>::iterator i = labelTable.begin(); i != labelTable.end(); ++i ) { 101 120 Entry *e = i->second; 102 121 103 122 if ( def_us.find ( e->get_definition() ) == def_us.end() ) { 104 123 def_us[ e->get_definition() ] = e; 105 } else { 106 if ( e->used() ) 107 def_us[ e->get_definition() ]->add_uses( e->get_uses() ); 124 } else if ( e->used() ) { 125 def_us[ e->get_definition() ]->add_uses( e->get_uses() ); 108 126 } 109 127 } 110 128 111 // get rid of labelTable112 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); i++) {129 // create a unique label for each target location. 130 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); ++i ) { 113 131 Statement *to = (*i).first; 114 std::list< Statement *> &from = (*i).second->get_uses(); 115 Label finalLabel = generator->newLabel(); 116 (*i).second->set_label( finalLabel ); 132 Entry * entry = (*i).second; 133 std::list< BranchStmt *> &from = entry->get_uses(); 117 134 135 // no label definition found 118 136 if ( to == 0 ) { 119 BranchStmt *first_use = dynamic_cast<BranchStmt *>(from.back()); 120 Label undef(""); 121 if ( first_use != 0 ) 122 undef = first_use->get_target(); 137 Label undef = from.back()->get_target(); 123 138 throw SemanticError ( "'" + undef + "' label not defined"); 124 139 } 140 141 // generate a new label, and attach it to its defining statement 142 // as the only label on that statement 143 Label finalLabel = generator->newLabel(); 144 entry->set_label( finalLabel ); 125 145 126 146 to->get_labels().clear(); 127 147 to->get_labels().push_back( finalLabel ); 128 148 129 for ( std::list< Statement *>::iterator j = from.begin(); j != from.end(); j++ ) { 130 BranchStmt *jumpTo = dynamic_cast< BranchStmt * > ( *j ); 131 assert( jumpTo != 0 ); 132 jumpTo->set_target( finalLabel ); 149 // redirect each of the source branch statements to the new target label 150 for ( std::list< BranchStmt *>::iterator j = from.begin(); j != from.end(); ++j ) { 151 BranchStmt *jump = *j; 152 assert( jump != 0 ); 153 jump->set_target( finalLabel ); 133 154 } // for 134 155 } // for 135 156 136 // reverse table157 // create a table where each label maps to its defining statement 137 158 std::map< Label, Statement * > *ret = new std::map< Label, Statement * >(); 138 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); i++ )159 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); ++i ) { 139 160 (*ret)[ (*i).second->get_label() ] = (*i).first; 161 } 140 162 141 163 return ret;
Note: See TracChangeset
for help on using the changeset viewer.