| 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 | //
|
|---|
| 7 | // XXX.cc --
|
|---|
| 8 | //
|
|---|
| 9 | // Author : Richard C. Bilson
|
|---|
| 10 | // Created On : Mon May 18 07:44:20 2015
|
|---|
| 11 | // Last Modified By : Rob Schluntz
|
|---|
| 12 | // Last Modified On : Mon May 02 15:19:17 2016
|
|---|
| 13 | // Update Count : 3
|
|---|
| 14 | //
|
|---|
| 15 |
|
|---|
| 16 | #include "Statement.h"
|
|---|
| 17 | #include "Common/utility.h"
|
|---|
| 18 | #include <algorithm>
|
|---|
| 19 | #include <functional>
|
|---|
| 20 | #include "Expression.h"
|
|---|
| 21 | #include "Declaration.h"
|
|---|
| 22 | #include "SynTree/VarExprReplacer.h"
|
|---|
| 23 |
|
|---|
| 24 | using std::string;
|
|---|
| 25 | using std::endl;
|
|---|
| 26 |
|
|---|
| 27 | CompoundStmt::CompoundStmt( std::list<Label> labels ) : Statement( labels ) {
|
|---|
| 28 | }
|
|---|
| 29 |
|
|---|
| 30 | CompoundStmt::CompoundStmt( const CompoundStmt &other ) : Statement( other ) {
|
|---|
| 31 | cloneAll( other.kids, kids );
|
|---|
| 32 |
|
|---|
| 33 | // when cloning a compound statement, we may end up cloning declarations which
|
|---|
| 34 | // are referred to by VariableExprs throughout the block. Cloning a VariableExpr
|
|---|
| 35 | // does a shallow copy, so the VariableExpr will end up pointing to the original
|
|---|
| 36 | // declaration. If the original declaration is deleted, e.g. because the original
|
|---|
| 37 | // CompoundStmt is deleted, then we have a dangling pointer. To avoid this case,
|
|---|
| 38 | // find all DeclarationWithType nodes (since a VariableExpr must point to a
|
|---|
| 39 | // DeclarationWithType) in the original CompoundStmt and map them to the cloned
|
|---|
| 40 | // node in the new CompoundStmt ('this'), then replace the Declarations referred to
|
|---|
| 41 | // by each VariableExpr according to the constructed map. Note that only the declarations
|
|---|
| 42 | // in the current level are collected into the map, because child CompoundStmts will
|
|---|
| 43 | // recursively execute this routine. There may be more efficient ways of doing
|
|---|
| 44 | // this.
|
|---|
| 45 | VarExprReplacer::DeclMap declMap;
|
|---|
| 46 | std::list< Statement * >::const_iterator origit = other.kids.begin();
|
|---|
| 47 | for ( Statement * s : kids ) {
|
|---|
| 48 | assert( origit != other.kids.end() );
|
|---|
| 49 | Statement * origStmt = *origit++;
|
|---|
| 50 | if ( DeclStmt * declStmt = dynamic_cast< DeclStmt * >( s ) ) {
|
|---|
| 51 | DeclStmt * origDeclStmt = safe_dynamic_cast< DeclStmt * >( origStmt );
|
|---|
| 52 | if ( DeclarationWithType * dwt = dynamic_cast< DeclarationWithType * > ( declStmt->get_decl() ) ) {
|
|---|
| 53 | DeclarationWithType * origdwt = safe_dynamic_cast< DeclarationWithType * > ( origDeclStmt->get_decl() );
|
|---|
| 54 | assert( dwt->get_name() == origdwt->get_name() );
|
|---|
| 55 | declMap[ origdwt ] = dwt;
|
|---|
| 56 | } else assert( ! dynamic_cast< DeclarationWithType * > ( origDeclStmt->get_decl() ) );
|
|---|
| 57 | } else assert( ! dynamic_cast< DeclStmt * > ( s ) );
|
|---|
| 58 | }
|
|---|
| 59 | if ( ! declMap.empty() ) {
|
|---|
| 60 | VarExprReplacer replacer( declMap );
|
|---|
| 61 | accept( replacer );
|
|---|
| 62 | }
|
|---|
| 63 | }
|
|---|
| 64 |
|
|---|
| 65 | CompoundStmt::~CompoundStmt() {
|
|---|
| 66 | deleteAll( kids );
|
|---|
| 67 | }
|
|---|
| 68 |
|
|---|
| 69 | void CompoundStmt::print( std::ostream &os, int indent ) const {
|
|---|
| 70 | os << "CompoundStmt" << endl ;
|
|---|
| 71 | printAll( kids, os, indent + 2 );
|
|---|
| 72 | }
|
|---|
| 73 |
|
|---|
| 74 | // Local Variables: //
|
|---|
| 75 | // tab-width: 4 //
|
|---|
| 76 | // mode: c++ //
|
|---|
| 77 | // compile-command: "make install" //
|
|---|
| 78 | // End: //
|
|---|