Changeset e64365c for src/CodeGen/CodeGenerator.cc

Timestamp:

Jun 29, 2016, 4:47:57 PM (8 years ago)

Author:

Aaron Moss <a3moss@…>

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:

a1d7679

Parents:

89b686a (diff), 87b5bf0 (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 plg.uwaterloo.ca:software/cfa/cfa-cc

File:

• src/CodeGen/CodeGenerator.cc (modified) (3 diffs)

src/CodeGen/CodeGenerator.cc

@@ -48 +48 @@
         }
 
-        ostream & CodeGenerator::Indenter::operator()( ostream & output ) {
+        ostream & CodeGenerator::Indenter::operator()( ostream & output ) const {
           return output << string( cg.cur_indent, ' ' );
         }
 
-        ostream & operator<<( ostream & output, CodeGenerator::Indenter &indent ) {
+        ostream & operator<<( ostream & output, const CodeGenerator::Indenter &indent ) {
                 return indent( output );
         }
 
-        CodeGenerator::CodeGenerator( std::ostream &os ) : indent( *this), cur_indent( 0 ), insideFunction( false ), output( os ) { }
+        CodeGenerator::LabelPrinter & CodeGenerator::LabelPrinter::operator()( std::list< Label > & l ) {
+                labels = &l;
+                return *this;
+        }
+
+        ostream & operator<<( ostream & output, CodeGenerator::LabelPrinter &printLabels ) {
+                std::list< Label > & labs = *printLabels.labels;
+                // l.unique(); // assumes a sorted list. Why not use set? Does order matter?
+                for ( Label & l : labs ) {
+                        output << l.get_name() + ": ";
+                        printLabels.cg.genAttributes( l.get_attributes() );
+                }
+                return output;
+        }
+
+        CodeGenerator::CodeGenerator( std::ostream &os ) : indent( *this), cur_indent( 0 ), insideFunction( false ), output( os ), printLabels( *this ) { }
 
         CodeGenerator::CodeGenerator( std::ostream &os, std::string init, int indentation, bool infunp )
-                        : indent( *this), cur_indent( indentation ), insideFunction( infunp ), output( os ) {
+                        : indent( *this), cur_indent( indentation ), insideFunction( infunp ), output( os ), printLabels( *this ) {
                 //output << std::string( init );
         }
 
         CodeGenerator::CodeGenerator( std::ostream &os, char *init, int indentation, bool infunp )
-                        : indent( *this ), cur_indent( indentation ), insideFunction( infunp ), output( os ) {
+                        : indent( *this ), cur_indent( indentation ), insideFunction( infunp ), output( os ), printLabels( *this ) {
                 //output << std::string( init );
         }
@@ -735 +750 @@
         void CodeGenerator::visit( ReturnStmt *returnStmt ) {
                 output << "return ";
-
-                // xxx -- check for null expression;
-                if ( returnStmt->get_expr() ) {
-                        returnStmt->get_expr()->accept( *this );
-                } // if
+                maybeAccept( returnStmt->get_expr(), *this );
                 output << ";";
         }
@@ -799 +810 @@
                         output << ";";
                 } // if
-        }
-
-        std::string CodeGenerator::printLabels( std::list< Label > &l ) {
-                std::string str( "" );
-                l.unique(); // assumes a sorted list. Why not use set?
-
-                for ( std::list< Label >::iterator i = l.begin(); i != l.end(); i++ )
-                        str += *i + ": ";
-
-                return str;
         }