| [71f4e4f] | 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 | // | 
|---|
| [9fe33947] | 7 | // FixInit.cc -- | 
|---|
| [71f4e4f] | 8 | // | 
|---|
|  | 9 | // Author           : Rob Schluntz | 
|---|
|  | 10 | // Created On       : Wed Jan 13 16:29:30 2016 | 
|---|
| [adcc065] | 11 | // Last Modified By : Peter A. Buhr | 
|---|
| [d56e5bc] | 12 | // Last Modified On : Wed Jun 21 17:35:05 2017 | 
|---|
|  | 13 | // Update Count     : 74 | 
|---|
| [71f4e4f] | 14 | // | 
|---|
| [be9288a] | 15 | #include "FixInit.h" | 
|---|
| [71f4e4f] | 16 |  | 
|---|
| [d180746] | 17 | #include <stddef.h>                    // for NULL | 
|---|
|  | 18 | #include <algorithm>                   // for set_difference, copy_if | 
|---|
| [e3e16bc] | 19 | #include <cassert>                     // for assert, strict_dynamic_cast | 
|---|
| [d180746] | 20 | #include <iostream>                    // for operator<<, ostream, basic_ost... | 
|---|
|  | 21 | #include <iterator>                    // for insert_iterator, back_inserter | 
|---|
|  | 22 | #include <list>                        // for _List_iterator, list, list<>::... | 
|---|
|  | 23 | #include <map>                         // for _Rb_tree_iterator, _Rb_tree_co... | 
|---|
|  | 24 | #include <memory>                      // for allocator_traits<>::value_type | 
|---|
|  | 25 | #include <set>                         // for set, set<>::value_type | 
|---|
|  | 26 | #include <unordered_map>               // for unordered_map, unordered_map<>... | 
|---|
|  | 27 | #include <unordered_set>               // for unordered_set | 
|---|
|  | 28 | #include <utility>                     // for pair | 
|---|
| [134322e] | 29 |  | 
|---|
| [d180746] | 30 | #include "CodeGen/GenType.h"           // for genPrettyType | 
|---|
| [bff227f] | 31 | #include "CodeGen/OperatorTable.h" | 
|---|
| [d180746] | 32 | #include "Common/PassVisitor.h"        // for PassVisitor, WithStmtsToAdd | 
|---|
|  | 33 | #include "Common/SemanticError.h"      // for SemanticError | 
|---|
|  | 34 | #include "Common/UniqueName.h"         // for UniqueName | 
|---|
|  | 35 | #include "Common/utility.h"            // for CodeLocation, ValueGuard, toSt... | 
|---|
|  | 36 | #include "FixGlobalInit.h"             // for fixGlobalInit | 
|---|
|  | 37 | #include "GenInit.h"                   // for genCtorDtor | 
|---|
|  | 38 | #include "GenPoly/GenPoly.h"           // for getFunctionType | 
|---|
|  | 39 | #include "InitTweak.h"                 // for getFunctionName, getCallArg | 
|---|
|  | 40 | #include "Parser/LinkageSpec.h"        // for C, Spec, Cforall, isBuiltin | 
|---|
|  | 41 | #include "ResolvExpr/Resolver.h"       // for findVoidExpression | 
|---|
|  | 42 | #include "ResolvExpr/typeops.h"        // for typesCompatible | 
|---|
|  | 43 | #include "SymTab/Autogen.h"            // for genImplicitCall | 
|---|
|  | 44 | #include "SymTab/Indexer.h"            // for Indexer | 
|---|
|  | 45 | #include "SymTab/Mangler.h"            // for Mangler | 
|---|
|  | 46 | #include "SynTree/Attribute.h"         // for Attribute | 
|---|
|  | 47 | #include "SynTree/Constant.h"          // for Constant | 
|---|
|  | 48 | #include "SynTree/Declaration.h"       // for ObjectDecl, FunctionDecl, Decl... | 
|---|
|  | 49 | #include "SynTree/Expression.h"        // for UniqueExpr, VariableExpr, Unty... | 
|---|
|  | 50 | #include "SynTree/Initializer.h"       // for ConstructorInit, SingleInit | 
|---|
| [ba3706f] | 51 | #include "SynTree/Label.h"             // for Label, operator< | 
|---|
| [d180746] | 52 | #include "SynTree/Mutator.h"           // for mutateAll, Mutator, maybeMutate | 
|---|
|  | 53 | #include "SynTree/Statement.h"         // for ExprStmt, CompoundStmt, Branch... | 
|---|
|  | 54 | #include "SynTree/Type.h"              // for Type, Type::StorageClasses | 
|---|
|  | 55 | #include "SynTree/TypeSubstitution.h"  // for TypeSubstitution, operator<< | 
|---|
|  | 56 | #include "SynTree/Visitor.h"           // for acceptAll, maybeAccept | 
|---|
| [71f4e4f] | 57 |  | 
|---|
| [f0121d7] | 58 | bool ctordtorp = false; // print all debug | 
|---|
|  | 59 | bool ctorp = false; // print ctor debug | 
|---|
|  | 60 | bool cpctorp = false; // print copy ctor debug | 
|---|
|  | 61 | bool dtorp = false; // print dtor debug | 
|---|
| [845cedc] | 62 | #define PRINT( text ) if ( ctordtorp ) { text } | 
|---|
| [c2931ea] | 63 | #define CP_CTOR_PRINT( text ) if ( ctordtorp || cpctorp ) { text } | 
|---|
|  | 64 | #define DTOR_PRINT( text ) if ( ctordtorp || dtorp ) { text } | 
|---|
| [845cedc] | 65 |  | 
|---|
| [71f4e4f] | 66 | namespace InitTweak { | 
|---|
|  | 67 | namespace { | 
|---|
| [597db97f] | 68 | typedef std::unordered_map< int, int > UnqCount; | 
|---|
| [31f379c] | 69 |  | 
|---|
| [c0714bf] | 70 | struct InsertImplicitCalls : public WithTypeSubstitution { | 
|---|
| [adcc065] | 71 | /// wrap function application expressions as ImplicitCopyCtorExpr nodes so that it is easy to identify which | 
|---|
|  | 72 | /// function calls need their parameters to be copy constructed | 
|---|
| [c0714bf] | 73 | static void insert( std::list< Declaration * > & translationUnit ); | 
|---|
| [134322e] | 74 |  | 
|---|
|  | 75 | Expression * postmutate( ApplicationExpr * appExpr ); | 
|---|
| [c2931ea] | 76 | }; | 
|---|
|  | 77 |  | 
|---|
| [c0714bf] | 78 | struct ResolveCopyCtors final : public WithIndexer, public WithShortCircuiting, public WithTypeSubstitution { | 
|---|
| [adcc065] | 79 | /// generate temporary ObjectDecls for each argument and return value of each ImplicitCopyCtorExpr, | 
|---|
|  | 80 | /// generate/resolve copy construction expressions for each, and generate/resolve destructors for both | 
|---|
|  | 81 | /// arguments and return value temporaries | 
|---|
| [c0714bf] | 82 | static void resolveImplicitCalls( std::list< Declaration * > & translationUnit, UnqCount & unqCount ); | 
|---|
| [c2931ea] | 83 |  | 
|---|
| [c0714bf] | 84 | ResolveCopyCtors( UnqCount & unqCount ) : unqCount( unqCount ) {} | 
|---|
| [31f379c] | 85 |  | 
|---|
| [c0714bf] | 86 | void postvisit( ImplicitCopyCtorExpr * impCpCtorExpr ); | 
|---|
|  | 87 | void postvisit( StmtExpr * stmtExpr ); | 
|---|
|  | 88 | void previsit( UniqueExpr * unqExpr ); | 
|---|
|  | 89 | void postvisit( UniqueExpr * unqExpr ); | 
|---|
| [c2931ea] | 90 |  | 
|---|
|  | 91 | /// create and resolve ctor/dtor expression: fname(var, [cpArg]) | 
|---|
| [65660bd] | 92 | Expression * makeCtorDtor( const std::string & fname, ObjectDecl * var, Expression * cpArg = NULL ); | 
|---|
| [c2931ea] | 93 | /// true if type does not need to be copy constructed to ensure correctness | 
|---|
| [1132b62] | 94 | bool skipCopyConstruct( Type * type ); | 
|---|
| [ae1b9ea] | 95 | void copyConstructArg( Expression *& arg, ImplicitCopyCtorExpr * impCpCtorExpr, Type * formal ); | 
|---|
| [092528b] | 96 | void destructRet( ObjectDecl * ret, ImplicitCopyCtorExpr * impCpCtorExpr ); | 
|---|
| [31f379c] | 97 |  | 
|---|
| [597db97f] | 98 | UnqCount & unqCount; // count the number of times each unique expr ID appears | 
|---|
| [c0714bf] | 99 | std::unordered_set< int > vars; | 
|---|
| [c2931ea] | 100 | }; | 
|---|
|  | 101 |  | 
|---|
|  | 102 | /// collects constructed object decls - used as a base class | 
|---|
| [698ec72] | 103 | struct ObjDeclCollector : public WithGuards, public WithShortCircuiting { | 
|---|
| [62423350] | 104 | // use ordered data structure to maintain ordering for set_difference and for consistent error messages | 
|---|
|  | 105 | typedef std::list< ObjectDecl * > ObjectSet; | 
|---|
| [698ec72] | 106 | void previsit( CompoundStmt *compoundStmt ); | 
|---|
|  | 107 | void previsit( DeclStmt *stmt ); | 
|---|
| [52c14b3] | 108 |  | 
|---|
|  | 109 | // don't go into other functions | 
|---|
| [698ec72] | 110 | void previsit( FunctionDecl * ) { visit_children = false; } | 
|---|
| [52c14b3] | 111 |  | 
|---|
| [c2931ea] | 112 | protected: | 
|---|
|  | 113 | ObjectSet curVars; | 
|---|
|  | 114 | }; | 
|---|
|  | 115 |  | 
|---|
| [6cf27a07] | 116 | // debug | 
|---|
| [62423350] | 117 | template<typename ObjectSet> | 
|---|
|  | 118 | struct PrintSet { | 
|---|
|  | 119 | PrintSet( const ObjectSet & objs ) : objs( objs ) {} | 
|---|
| [c2931ea] | 120 | const ObjectSet & objs; | 
|---|
|  | 121 | }; | 
|---|
| [62423350] | 122 | template<typename ObjectSet> | 
|---|
|  | 123 | PrintSet<ObjectSet> printSet( const ObjectSet & objs ) { return PrintSet<ObjectSet>( objs ); } | 
|---|
|  | 124 | template<typename ObjectSet> | 
|---|
|  | 125 | std::ostream & operator<<( std::ostream & out, const PrintSet<ObjectSet> & set) { | 
|---|
| [c2931ea] | 126 | out << "{ "; | 
|---|
|  | 127 | for ( ObjectDecl * obj : set.objs ) { | 
|---|
|  | 128 | out << obj->get_name() << ", " ; | 
|---|
| [adcc065] | 129 | } // for | 
|---|
| [c2931ea] | 130 | out << " }"; | 
|---|
|  | 131 | return out; | 
|---|
|  | 132 | } | 
|---|
|  | 133 |  | 
|---|
| [698ec72] | 134 | struct LabelFinder final : public ObjDeclCollector { | 
|---|
| [c2931ea] | 135 | typedef std::map< Label, ObjectSet > LabelMap; | 
|---|
|  | 136 | // map of Label -> live variables at that label | 
|---|
|  | 137 | LabelMap vars; | 
|---|
|  | 138 |  | 
|---|
| [698ec72] | 139 | typedef ObjDeclCollector Parent; | 
|---|
|  | 140 | using Parent::previsit; | 
|---|
|  | 141 | void previsit( Statement * stmt ); | 
|---|
|  | 142 |  | 
|---|
|  | 143 | void previsit( CompoundStmt *compoundStmt ); | 
|---|
|  | 144 | void previsit( DeclStmt *stmt ); | 
|---|
| [c2931ea] | 145 | }; | 
|---|
|  | 146 |  | 
|---|
| [698ec72] | 147 | struct InsertDtors final : public ObjDeclCollector, public WithStmtsToAdd { | 
|---|
| [adcc065] | 148 | /// insert destructor calls at the appropriate places.  must happen before CtorInit nodes are removed | 
|---|
|  | 149 | /// (currently by FixInit) | 
|---|
| [c2931ea] | 150 | static void insert( std::list< Declaration * > & translationUnit ); | 
|---|
|  | 151 |  | 
|---|
|  | 152 | typedef std::list< ObjectDecl * > OrderedDecls; | 
|---|
|  | 153 | typedef std::list< OrderedDecls > OrderedDeclsStack; | 
|---|
|  | 154 |  | 
|---|
| [698ec72] | 155 | InsertDtors( PassVisitor<LabelFinder> & finder ) : finder( finder ), labelVars( finder.pass.vars ) {} | 
|---|
| [c2931ea] | 156 |  | 
|---|
| [698ec72] | 157 | typedef ObjDeclCollector Parent; | 
|---|
|  | 158 | using Parent::previsit; | 
|---|
| [62e5546] | 159 |  | 
|---|
| [698ec72] | 160 | void previsit( ObjectDecl * objDecl ); | 
|---|
|  | 161 | void previsit( FunctionDecl * funcDecl ); | 
|---|
| [c2931ea] | 162 |  | 
|---|
| [698ec72] | 163 | void previsit( CompoundStmt * compoundStmt ); | 
|---|
|  | 164 | void postvisit( CompoundStmt * compoundStmt ); | 
|---|
|  | 165 | void previsit( ReturnStmt * returnStmt ); | 
|---|
|  | 166 | void previsit( BranchStmt * stmt ); | 
|---|
| [c2931ea] | 167 | private: | 
|---|
|  | 168 | void handleGoto( BranchStmt * stmt ); | 
|---|
|  | 169 |  | 
|---|
| [698ec72] | 170 | PassVisitor<LabelFinder> & finder; | 
|---|
| [c2931ea] | 171 | LabelFinder::LabelMap & labelVars; | 
|---|
|  | 172 | OrderedDeclsStack reverseDeclOrder; | 
|---|
|  | 173 | }; | 
|---|
|  | 174 |  | 
|---|
| [0508ab3] | 175 | class FixInit : public WithStmtsToAdd { | 
|---|
| [c2931ea] | 176 | public: | 
|---|
|  | 177 | /// expand each object declaration to use its constructor after it is declared. | 
|---|
|  | 178 | static void fixInitializers( std::list< Declaration * > &translationUnit ); | 
|---|
|  | 179 |  | 
|---|
| [aff3af4] | 180 | DeclarationWithType * postmutate( ObjectDecl *objDecl ); | 
|---|
| [72e9222] | 181 |  | 
|---|
|  | 182 | std::list< Declaration * > staticDtorDecls; | 
|---|
| [c2931ea] | 183 | }; | 
|---|
|  | 184 |  | 
|---|
| [dc2334c] | 185 | class FixCopyCtors final : public WithStmtsToAdd, public WithShortCircuiting, public WithVisitorRef<FixCopyCtors> { | 
|---|
| [c2931ea] | 186 | public: | 
|---|
| [597db97f] | 187 | FixCopyCtors( UnqCount & unqCount ) : unqCount( unqCount ){} | 
|---|
| [adcc065] | 188 | /// expand ImplicitCopyCtorExpr nodes into the temporary declarations, copy constructors, call expression, | 
|---|
|  | 189 | /// and destructors | 
|---|
| [597db97f] | 190 | static void fixCopyCtors( std::list< Declaration * > &translationUnit, UnqCount & unqCount ); | 
|---|
| [c2931ea] | 191 |  | 
|---|
| [dc2334c] | 192 | Expression * postmutate( ImplicitCopyCtorExpr * impCpCtorExpr ); | 
|---|
|  | 193 | void premutate( StmtExpr * stmtExpr ); | 
|---|
|  | 194 | void premutate( UniqueExpr * unqExpr ); | 
|---|
| [597db97f] | 195 |  | 
|---|
|  | 196 | UnqCount & unqCount; | 
|---|
| [c2931ea] | 197 | }; | 
|---|
| [79970ed] | 198 |  | 
|---|
| [b3fc977] | 199 | struct GenStructMemberCalls final : public WithGuards, public WithShortCircuiting, public WithIndexer, public WithVisitorRef<GenStructMemberCalls> { | 
|---|
| [c8dfcd3] | 200 | /// generate default/copy ctor and dtor calls for user-defined struct ctor/dtors | 
|---|
|  | 201 | /// for any member that is missing a corresponding ctor/dtor call. | 
|---|
|  | 202 | /// error if a member is used before constructed | 
|---|
|  | 203 | static void generate( std::list< Declaration * > & translationUnit ); | 
|---|
| [79970ed] | 204 |  | 
|---|
| [b3fc977] | 205 | void premutate( FunctionDecl * funcDecl ); | 
|---|
|  | 206 | DeclarationWithType * postmutate( FunctionDecl * funcDecl ); | 
|---|
|  | 207 |  | 
|---|
|  | 208 | void premutate( MemberExpr * memberExpr ); | 
|---|
|  | 209 | void premutate( ApplicationExpr * appExpr ); | 
|---|
| [79970ed] | 210 |  | 
|---|
| [b3fc977] | 211 | /// Note: this post mutate used to be in a separate visitor. If this pass breaks, one place to examine is whether it is | 
|---|
|  | 212 | /// okay for this part of the recursion to occur alongside the rest. | 
|---|
|  | 213 | Expression * postmutate( UntypedExpr * expr ); | 
|---|
| [79970ed] | 214 |  | 
|---|
| [3906301] | 215 | SemanticError errors; | 
|---|
| [79970ed] | 216 | private: | 
|---|
| [3906301] | 217 | template< typename... Params > | 
|---|
| [64ac636] | 218 | void emit( CodeLocation, const Params &... params ); | 
|---|
| [79970ed] | 219 |  | 
|---|
| [5363fdf] | 220 | FunctionDecl * function = nullptr; | 
|---|
| [64ac636] | 221 | std::set< DeclarationWithType * > unhandled; | 
|---|
|  | 222 | std::map< DeclarationWithType *, CodeLocation > usedUninit; | 
|---|
| [5363fdf] | 223 | ObjectDecl * thisParam = nullptr; | 
|---|
| [c8dfcd3] | 224 | bool isCtor = false; // true if current function is a constructor | 
|---|
| [5363fdf] | 225 | StructDecl * structDecl = nullptr; | 
|---|
| [c8dfcd3] | 226 | }; | 
|---|
|  | 227 |  | 
|---|
| [696bf6e] | 228 | struct FixCtorExprs final : public WithDeclsToAdd, public WithIndexer { | 
|---|
| [b6fe7e6] | 229 | /// expands ConstructorExpr nodes into comma expressions, using a temporary for the first argument | 
|---|
|  | 230 | static void fix( std::list< Declaration * > & translationUnit ); | 
|---|
|  | 231 |  | 
|---|
| [696bf6e] | 232 | Expression * postmutate( ConstructorExpr * ctorExpr ); | 
|---|
| [b6fe7e6] | 233 | }; | 
|---|
| [c2931ea] | 234 | } // namespace | 
|---|
| [db4ecc5] | 235 |  | 
|---|
| [6cf27a07] | 236 | void fix( std::list< Declaration * > & translationUnit, const std::string & filename, bool inLibrary ) { | 
|---|
|  | 237 | // fixes ConstructorInit for global variables. should happen before fixInitializers. | 
|---|
|  | 238 | InitTweak::fixGlobalInit( translationUnit, filename, inLibrary ); | 
|---|
|  | 239 |  | 
|---|
| [597db97f] | 240 | UnqCount unqCount; | 
|---|
| [b6fe7e6] | 241 |  | 
|---|
| [c0714bf] | 242 | InsertImplicitCalls::insert( translationUnit ); | 
|---|
|  | 243 | ResolveCopyCtors::resolveImplicitCalls( translationUnit, unqCount ); | 
|---|
| [c2931ea] | 244 | InsertDtors::insert( translationUnit ); | 
|---|
| [71f4e4f] | 245 | FixInit::fixInitializers( translationUnit ); | 
|---|
| [c2931ea] | 246 |  | 
|---|
| [db4ecc5] | 247 | // FixCopyCtors must happen after FixInit, so that destructors are placed correctly | 
|---|
| [597db97f] | 248 | FixCopyCtors::fixCopyCtors( translationUnit, unqCount ); | 
|---|
| [79970ed] | 249 |  | 
|---|
| [c8dfcd3] | 250 | GenStructMemberCalls::generate( translationUnit ); | 
|---|
| [ae1b9ea] | 251 |  | 
|---|
| [b6fe7e6] | 252 | // xxx - ctor expansion currently has to be after FixCopyCtors, because there is currently a | 
|---|
|  | 253 | // hack in the way untyped assignments are generated, where the first argument cannot have | 
|---|
|  | 254 | // its address taken because of the way codegeneration handles UntypedExpr vs. ApplicationExpr. | 
|---|
|  | 255 | // Thus such assignment exprs must never pushed through expression resolution (and thus should | 
|---|
|  | 256 | // not go through the FixCopyCtors pass), otherwise they will fail -- guaranteed. | 
|---|
|  | 257 | // Also needs to happen after GenStructMemberCalls, since otherwise member constructors exprs | 
|---|
|  | 258 | // don't look right, and a member can be constructed more than once. | 
|---|
|  | 259 | FixCtorExprs::fix( translationUnit ); | 
|---|
| [db4ecc5] | 260 | } | 
|---|
|  | 261 |  | 
|---|
| [c2931ea] | 262 | namespace { | 
|---|
| [c0714bf] | 263 | void InsertImplicitCalls::insert( std::list< Declaration * > & translationUnit ) { | 
|---|
|  | 264 | PassVisitor<InsertImplicitCalls> inserter; | 
|---|
| [c2931ea] | 265 | mutateAll( translationUnit, inserter ); | 
|---|
|  | 266 | } | 
|---|
| [db4ecc5] | 267 |  | 
|---|
| [c0714bf] | 268 | void ResolveCopyCtors::resolveImplicitCalls( std::list< Declaration * > & translationUnit, UnqCount & unqCount ) { | 
|---|
|  | 269 | PassVisitor<ResolveCopyCtors> resolver( unqCount ); | 
|---|
| [c2931ea] | 270 | acceptAll( translationUnit, resolver ); | 
|---|
|  | 271 | } | 
|---|
| [71f4e4f] | 272 |  | 
|---|
| [c2931ea] | 273 | void FixInit::fixInitializers( std::list< Declaration * > & translationUnit ) { | 
|---|
| [aff3af4] | 274 | PassVisitor<FixInit> fixer; | 
|---|
| [72e9222] | 275 |  | 
|---|
|  | 276 | // can't use mutateAll, because need to insert declarations at top-level | 
|---|
|  | 277 | // can't use DeclMutator, because sometimes need to insert IfStmt, etc. | 
|---|
|  | 278 | SemanticError errors; | 
|---|
|  | 279 | for ( std::list< Declaration * >::iterator i = translationUnit.begin(); i != translationUnit.end(); ++i ) { | 
|---|
|  | 280 | try { | 
|---|
| [3c398b6] | 281 | maybeMutate( *i, fixer ); | 
|---|
| [aff3af4] | 282 | translationUnit.splice( i, fixer.pass.staticDtorDecls ); | 
|---|
| [72e9222] | 283 | } catch( SemanticError &e ) { | 
|---|
| [138e29e] | 284 | e.set_location( (*i)->location ); | 
|---|
| [72e9222] | 285 | errors.append( e ); | 
|---|
|  | 286 | } // try | 
|---|
|  | 287 | } // for | 
|---|
|  | 288 | if ( ! errors.isEmpty() ) { | 
|---|
|  | 289 | throw errors; | 
|---|
|  | 290 | } // if | 
|---|
| [c2931ea] | 291 | } | 
|---|
| [71f4e4f] | 292 |  | 
|---|
| [c2931ea] | 293 | void InsertDtors::insert( std::list< Declaration * > & translationUnit ) { | 
|---|
| [698ec72] | 294 | PassVisitor<LabelFinder> finder; | 
|---|
|  | 295 | PassVisitor<InsertDtors> inserter( finder ); | 
|---|
| [c2931ea] | 296 | acceptAll( translationUnit, inserter ); | 
|---|
|  | 297 | } | 
|---|
|  | 298 |  | 
|---|
| [597db97f] | 299 | void FixCopyCtors::fixCopyCtors( std::list< Declaration * > & translationUnit, UnqCount & unqCount ) { | 
|---|
| [dc2334c] | 300 | PassVisitor<FixCopyCtors> fixer( unqCount ); | 
|---|
| [c2931ea] | 301 | mutateAll( translationUnit, fixer ); | 
|---|
|  | 302 | } | 
|---|
| [db4ecc5] | 303 |  | 
|---|
| [c8dfcd3] | 304 | void GenStructMemberCalls::generate( std::list< Declaration * > & translationUnit ) { | 
|---|
| [9a707e4e] | 305 | PassVisitor<GenStructMemberCalls> warner; | 
|---|
| [b3fc977] | 306 | mutateAll( translationUnit, warner ); | 
|---|
| [79970ed] | 307 | } | 
|---|
|  | 308 |  | 
|---|
| [b6fe7e6] | 309 | void FixCtorExprs::fix( std::list< Declaration * > & translationUnit ) { | 
|---|
| [696bf6e] | 310 | PassVisitor<FixCtorExprs> fixer; | 
|---|
|  | 311 | mutateAll( translationUnit, fixer ); | 
|---|
| [b6fe7e6] | 312 | } | 
|---|
|  | 313 |  | 
|---|
| [134322e] | 314 | Expression * InsertImplicitCalls::postmutate( ApplicationExpr * appExpr ) { | 
|---|
| [c2931ea] | 315 | if ( VariableExpr * function = dynamic_cast< VariableExpr * > ( appExpr->get_function() ) ) { | 
|---|
| [be151bf] | 316 | if ( function->var->linkage.is_builtin ) { | 
|---|
| [c2931ea] | 317 | // optimization: don't need to copy construct in order to call intrinsic functions | 
|---|
|  | 318 | return appExpr; | 
|---|
|  | 319 | } else if ( DeclarationWithType * funcDecl = dynamic_cast< DeclarationWithType * > ( function->get_var() ) ) { | 
|---|
|  | 320 | FunctionType * ftype = dynamic_cast< FunctionType * >( GenPoly::getFunctionType( funcDecl->get_type() ) ); | 
|---|
| [05807e9] | 321 | assertf( ftype, "Function call without function type: %s", toString( funcDecl ).c_str() ); | 
|---|
| [be151bf] | 322 | if ( CodeGen::isConstructor( funcDecl->get_name() ) && ftype->parameters.size() == 2 ) { | 
|---|
|  | 323 | Type * t1 = getPointerBase( ftype->parameters.front()->get_type() ); | 
|---|
|  | 324 | Type * t2 = ftype->parameters.back()->get_type(); | 
|---|
| [0a81c3f] | 325 | assert( t1 ); | 
|---|
| [c2931ea] | 326 |  | 
|---|
| [0a81c3f] | 327 | if ( ResolvExpr::typesCompatible( t1, t2, SymTab::Indexer() ) ) { | 
|---|
| [a28bc02] | 328 | // optimization: don't need to copy construct in order to call a copy constructor | 
|---|
| [c2931ea] | 329 | return appExpr; | 
|---|
| [adcc065] | 330 | } // if | 
|---|
| [bff227f] | 331 | } else if ( CodeGen::isDestructor( funcDecl->get_name() ) ) { | 
|---|
| [c2931ea] | 332 | // correctness: never copy construct arguments to a destructor | 
|---|
| [845cedc] | 333 | return appExpr; | 
|---|
| [adcc065] | 334 | } // if | 
|---|
|  | 335 | } // if | 
|---|
|  | 336 | } // if | 
|---|
| [c2931ea] | 337 | CP_CTOR_PRINT( std::cerr << "InsertImplicitCalls: adding a wrapper " << appExpr << std::endl; ) | 
|---|
|  | 338 |  | 
|---|
|  | 339 | // wrap each function call so that it is easy to identify nodes that have to be copy constructed | 
|---|
|  | 340 | ImplicitCopyCtorExpr * expr = new ImplicitCopyCtorExpr( appExpr ); | 
|---|
| [c0714bf] | 341 | // Move the type substitution to the new top-level, if it is attached to the appExpr. | 
|---|
| [c2931ea] | 342 | // Ensure it is not deleted with the ImplicitCopyCtorExpr by removing it before deletion. | 
|---|
|  | 343 | // The substitution is needed to obtain the type of temporary variables so that copy constructor | 
|---|
| [c0714bf] | 344 | // calls can be resolved. | 
|---|
| [c2931ea] | 345 | assert( env ); | 
|---|
| [c0714bf] | 346 | std::swap( expr->env, appExpr->env ); | 
|---|
| [c2931ea] | 347 | return expr; | 
|---|
| [db4ecc5] | 348 | } | 
|---|
|  | 349 |  | 
|---|
| [29bc63e] | 350 | bool ResolveCopyCtors::skipCopyConstruct( Type * type ) { return ! isConstructable( type ); } | 
|---|
| [c2931ea] | 351 |  | 
|---|
| [65660bd] | 352 | Expression * ResolveCopyCtors::makeCtorDtor( const std::string & fname, ObjectDecl * var, Expression * cpArg ) { | 
|---|
| [c2931ea] | 353 | assert( var ); | 
|---|
| [092528b] | 354 | // arrays are not copy constructed, so this should always be an ExprStmt | 
|---|
|  | 355 | ImplicitCtorDtorStmt * stmt = genCtorDtor( fname, var, cpArg ); | 
|---|
| [9fe33947] | 356 | assertf( stmt, "ResolveCopyCtors: genCtorDtor returned nullptr: %s / %s / %s", fname.c_str(), toString( var ).c_str(), toString( cpArg ).c_str() ); | 
|---|
|  | 357 | ExprStmt * exprStmt = strict_dynamic_cast< ExprStmt * >( stmt->callStmt ); | 
|---|
| [08da53d] | 358 | Expression * resolved = exprStmt->expr; | 
|---|
|  | 359 | exprStmt->expr = nullptr; // take ownership of expr | 
|---|
| [c2931ea] | 360 |  | 
|---|
|  | 361 | // resolve copy constructor | 
|---|
| [adcc065] | 362 | // should only be one alternative for copy ctor and dtor expressions, since all arguments are fixed | 
|---|
|  | 363 | // (VariableExpr and already resolved expression) | 
|---|
| [08da53d] | 364 | CP_CTOR_PRINT( std::cerr << "ResolvingCtorDtor " << resolved << std::endl; ) | 
|---|
|  | 365 | ResolvExpr::findVoidExpression( resolved, indexer ); | 
|---|
| [65660bd] | 366 | assert( resolved ); | 
|---|
| [c2931ea] | 367 | if ( resolved->get_env() ) { | 
|---|
| [31f379c] | 368 | // Extract useful information and discard new environments. Keeping them causes problems in PolyMutator passes. | 
|---|
| [c2931ea] | 369 | env->add( *resolved->get_env() ); | 
|---|
| [31f379c] | 370 | delete resolved->get_env(); | 
|---|
|  | 371 | resolved->set_env( nullptr ); | 
|---|
| [adcc065] | 372 | } // if | 
|---|
| [092528b] | 373 | delete stmt; | 
|---|
| [7641b6c] | 374 | if ( TupleAssignExpr * assign = dynamic_cast< TupleAssignExpr * >( resolved ) ) { | 
|---|
|  | 375 | // fix newly generated StmtExpr | 
|---|
|  | 376 | postvisit( assign->stmtExpr ); | 
|---|
|  | 377 | } | 
|---|
| [c2931ea] | 378 | return resolved; | 
|---|
| [540de412] | 379 | } | 
|---|
| [db4ecc5] | 380 |  | 
|---|
| [ae1b9ea] | 381 | void ResolveCopyCtors::copyConstructArg( Expression *& arg, ImplicitCopyCtorExpr * impCpCtorExpr, Type * formal ) { | 
|---|
| [c2931ea] | 382 | static UniqueName tempNamer("_tmp_cp"); | 
|---|
| [31f379c] | 383 | assert( env ); | 
|---|
|  | 384 | CP_CTOR_PRINT( std::cerr << "Type Substitution: " << *env << std::endl; ) | 
|---|
| [d29fa5f] | 385 | assert( arg->result ); | 
|---|
| [ae1b9ea] | 386 | Type * result = arg->result; | 
|---|
| [1132b62] | 387 | if ( skipCopyConstruct( result ) ) return; // skip certain non-copyable types | 
|---|
|  | 388 |  | 
|---|
| [f5c3b6c] | 389 | // type may involve type variables, so apply type substitution to get temporary variable's actual type, | 
|---|
|  | 390 | // since result type may not be substituted (e.g., if the type does not appear in the parameter list) | 
|---|
| [ae1b9ea] | 391 | // Use applyFree so that types bound in function pointers are not substituted, e.g. in forall(dtype T) void (*)(T). | 
|---|
|  | 392 | env->applyFree( result ); | 
|---|
| [3aeaecd] | 393 | ObjectDecl * tmp = ObjectDecl::newObject( "__tmp", result, nullptr ); | 
|---|
| [615a096] | 394 | tmp->get_type()->set_const( false ); | 
|---|
| [1132b62] | 395 |  | 
|---|
|  | 396 | // create and resolve copy constructor | 
|---|
|  | 397 | CP_CTOR_PRINT( std::cerr << "makeCtorDtor for an argument" << std::endl; ) | 
|---|
| [65660bd] | 398 | Expression * cpCtor = makeCtorDtor( "?{}", tmp, arg ); | 
|---|
|  | 399 |  | 
|---|
|  | 400 | if ( ApplicationExpr * appExpr = dynamic_cast< ApplicationExpr * >( cpCtor ) ) { | 
|---|
|  | 401 | // if the chosen constructor is intrinsic, the copy is unnecessary, so | 
|---|
|  | 402 | // don't create the temporary and don't call the copy constructor | 
|---|
| [ae1b9ea] | 403 | VariableExpr * function = strict_dynamic_cast< VariableExpr * >( appExpr->function ); | 
|---|
|  | 404 | if ( function->var->linkage == LinkageSpec::Intrinsic ) { | 
|---|
|  | 405 | // arguments that need to be boxed need a temporary regardless of whether the copy constructor is intrinsic, | 
|---|
|  | 406 | // so that the object isn't changed inside of the polymorphic function | 
|---|
|  | 407 | if ( ! GenPoly::needsBoxing( formal, result, impCpCtorExpr->callExpr, env ) ) return; | 
|---|
|  | 408 | } | 
|---|
| [65660bd] | 409 | } | 
|---|
|  | 410 |  | 
|---|
| [3aeaecd] | 411 | // set a unique name for the temporary once it's certain the call is necessary | 
|---|
|  | 412 | tmp->name = tempNamer.newName(); | 
|---|
|  | 413 |  | 
|---|
| [65660bd] | 414 | // replace argument to function call with temporary | 
|---|
|  | 415 | arg = new CommaExpr( cpCtor, new VariableExpr( tmp ) ); | 
|---|
| [ae1b9ea] | 416 | impCpCtorExpr->tempDecls.push_back( tmp ); | 
|---|
|  | 417 | impCpCtorExpr->dtors.push_front( makeCtorDtor( "^?{}", tmp ) ); | 
|---|
| [1132b62] | 418 | } | 
|---|
| [c2931ea] | 419 |  | 
|---|
| [092528b] | 420 | void ResolveCopyCtors::destructRet( ObjectDecl * ret, ImplicitCopyCtorExpr * impCpCtorExpr ) { | 
|---|
|  | 421 | impCpCtorExpr->get_dtors().push_front( makeCtorDtor( "^?{}", ret ) ); | 
|---|
| [1132b62] | 422 | } | 
|---|
|  | 423 |  | 
|---|
| [c0714bf] | 424 | void ResolveCopyCtors::postvisit( ImplicitCopyCtorExpr *impCpCtorExpr ) { | 
|---|
| [c2931ea] | 425 | CP_CTOR_PRINT( std::cerr << "ResolveCopyCtors: " << impCpCtorExpr << std::endl; ) | 
|---|
|  | 426 |  | 
|---|
| [ae1b9ea] | 427 | ApplicationExpr * appExpr = impCpCtorExpr->callExpr; | 
|---|
| [c2931ea] | 428 |  | 
|---|
|  | 429 | // take each argument and attempt to copy construct it. | 
|---|
| [ae1b9ea] | 430 | FunctionType * ftype = GenPoly::getFunctionType( appExpr->function->result ); | 
|---|
|  | 431 | assert( ftype ); | 
|---|
|  | 432 | auto & params = ftype->parameters; | 
|---|
|  | 433 | auto iter = params.begin(); | 
|---|
|  | 434 | for ( Expression * & arg : appExpr->args ) { | 
|---|
|  | 435 | Type * formal = nullptr; | 
|---|
|  | 436 | if ( iter != params.end() ) { | 
|---|
|  | 437 | DeclarationWithType * param = *iter++; | 
|---|
|  | 438 | formal = param->get_type(); | 
|---|
|  | 439 | } | 
|---|
|  | 440 |  | 
|---|
|  | 441 | copyConstructArg( arg, impCpCtorExpr, formal ); | 
|---|
| [adcc065] | 442 | } // for | 
|---|
| [db4ecc5] | 443 |  | 
|---|
| [adcc065] | 444 | // each return value from the call needs to be connected with an ObjectDecl at the call site, which is | 
|---|
|  | 445 | // initialized with the return value and is destructed later | 
|---|
| [31f379c] | 446 | // xxx - handle named return values? | 
|---|
| [ae1b9ea] | 447 | Type * result = appExpr->result; | 
|---|
| [906e24d] | 448 | if ( ! result->isVoid() ) { | 
|---|
| [1132b62] | 449 | static UniqueName retNamer("_tmp_cp_ret"); | 
|---|
| [c2931ea] | 450 | result = result->clone(); | 
|---|
| [31f379c] | 451 | env->apply( result ); | 
|---|
| [3aeaecd] | 452 | ObjectDecl * ret = ObjectDecl::newObject( retNamer.newName(), result, nullptr ); | 
|---|
| [ae1b9ea] | 453 | ret->type->set_const( false ); | 
|---|
|  | 454 | impCpCtorExpr->returnDecls.push_back( ret ); | 
|---|
| [c2931ea] | 455 | CP_CTOR_PRINT( std::cerr << "makeCtorDtor for a return" << std::endl; ) | 
|---|
| [0a81c3f] | 456 | if ( ! dynamic_cast< ReferenceType * >( result ) ) { | 
|---|
| [3aeaecd] | 457 | // destructing reference returns is bad because it can cause multiple destructor calls to the same object - the returned object is not a temporary | 
|---|
| [092528b] | 458 | destructRet( ret, impCpCtorExpr ); | 
|---|
| [dc86541] | 459 | } | 
|---|
| [adcc065] | 460 | } // for | 
|---|
| [c2931ea] | 461 | CP_CTOR_PRINT( std::cerr << "after Resolving: " << impCpCtorExpr << std::endl; ) | 
|---|
| [db4ecc5] | 462 | } | 
|---|
|  | 463 |  | 
|---|
| [c0714bf] | 464 | void ResolveCopyCtors::postvisit( StmtExpr * stmtExpr ) { | 
|---|
|  | 465 | assert( env ); | 
|---|
| [31f379c] | 466 | assert( stmtExpr->get_result() ); | 
|---|
|  | 467 | Type * result = stmtExpr->get_result(); | 
|---|
|  | 468 | if ( ! result->isVoid() ) { | 
|---|
|  | 469 | static UniqueName retNamer("_tmp_stmtexpr_ret"); | 
|---|
|  | 470 |  | 
|---|
|  | 471 | result = result->clone(); | 
|---|
|  | 472 | env->apply( result ); | 
|---|
| [6dfa2e1] | 473 | if ( ! InitTweak::isConstructable( result ) ) { | 
|---|
|  | 474 | delete result; | 
|---|
|  | 475 | return; | 
|---|
|  | 476 | } | 
|---|
|  | 477 |  | 
|---|
|  | 478 | // create variable that will hold the result of the stmt expr | 
|---|
| [3aeaecd] | 479 | ObjectDecl * ret = ObjectDecl::newObject( retNamer.newName(), result, nullptr ); | 
|---|
| [7641b6c] | 480 | ret->type->set_const( false ); | 
|---|
|  | 481 | stmtExpr->returnDecls.push_front( ret ); | 
|---|
| [31f379c] | 482 |  | 
|---|
|  | 483 | // must have a non-empty body, otherwise it wouldn't have a result | 
|---|
| [7641b6c] | 484 | CompoundStmt * body = stmtExpr->statements; | 
|---|
| [31f379c] | 485 | assert( ! body->get_kids().empty() ); | 
|---|
|  | 486 | // must be an ExprStmt, otherwise it wouldn't have a result | 
|---|
| [e3e16bc] | 487 | ExprStmt * last = strict_dynamic_cast< ExprStmt * >( body->get_kids().back() ); | 
|---|
| [7641b6c] | 488 | last->expr = makeCtorDtor( "?{}", ret, last->get_expr() ); | 
|---|
| [31f379c] | 489 |  | 
|---|
| [7641b6c] | 490 | stmtExpr->dtors.push_front( makeCtorDtor( "^?{}", ret ) ); | 
|---|
| [31f379c] | 491 | } // if | 
|---|
|  | 492 | } | 
|---|
|  | 493 |  | 
|---|
| [c0714bf] | 494 | void ResolveCopyCtors::previsit( UniqueExpr * unqExpr ) { | 
|---|
| [597db97f] | 495 | unqCount[ unqExpr->get_id() ]++;  // count the number of unique expressions for each ID | 
|---|
| [c0714bf] | 496 | if ( vars.count( unqExpr->get_id() ) ) { | 
|---|
|  | 497 | // xxx - hack to prevent double-handling of unique exprs, otherwise too many temporary variables and destructors are generated | 
|---|
|  | 498 | visit_children = false; | 
|---|
|  | 499 | } | 
|---|
|  | 500 | } | 
|---|
|  | 501 |  | 
|---|
| [ddae809] | 502 | // to prevent warnings (‘_unq0’ may be used uninitialized in this function), | 
|---|
|  | 503 | // insert an appropriate zero initializer for UniqueExpr temporaries. | 
|---|
|  | 504 | Initializer * makeInit( Type * t ) { | 
|---|
|  | 505 | if ( StructInstType * inst = dynamic_cast< StructInstType * >( t ) ) { | 
|---|
|  | 506 | // initizer for empty struct must be empty | 
|---|
|  | 507 | if ( inst->baseStruct->members.empty() ) return new ListInit({}); | 
|---|
|  | 508 | } else if ( UnionInstType * inst = dynamic_cast< UnionInstType * >( t ) ) { | 
|---|
|  | 509 | // initizer for empty union must be empty | 
|---|
|  | 510 | if ( inst->baseUnion->members.empty() ) return new ListInit({}); | 
|---|
|  | 511 | } | 
|---|
|  | 512 |  | 
|---|
|  | 513 | return new ListInit( { new SingleInit( new ConstantExpr( Constant::from_int( 0 ) ) ) } ); | 
|---|
|  | 514 | } | 
|---|
|  | 515 |  | 
|---|
| [c0714bf] | 516 | void ResolveCopyCtors::postvisit( UniqueExpr * unqExpr ) { | 
|---|
| [141b786] | 517 | if ( vars.count( unqExpr->get_id() ) ) { | 
|---|
|  | 518 | // xxx - hack to prevent double-handling of unique exprs, otherwise too many temporary variables and destructors are generated | 
|---|
|  | 519 | return; | 
|---|
|  | 520 | } | 
|---|
|  | 521 |  | 
|---|
|  | 522 | // it should never be necessary to wrap a void-returning expression in a UniqueExpr - if this assumption changes, this needs to be rethought | 
|---|
|  | 523 | assert( unqExpr->get_result() ); | 
|---|
|  | 524 | if ( ImplicitCopyCtorExpr * impCpCtorExpr = dynamic_cast<ImplicitCopyCtorExpr*>( unqExpr->get_expr() ) ) { | 
|---|
|  | 525 | // note the variable used as the result from the call | 
|---|
|  | 526 | assert( impCpCtorExpr->get_result() && impCpCtorExpr->get_returnDecls().size() == 1 ); | 
|---|
|  | 527 | unqExpr->set_var( new VariableExpr( impCpCtorExpr->get_returnDecls().front() ) ); | 
|---|
|  | 528 | } else { | 
|---|
|  | 529 | // expr isn't a call expr, so create a new temporary variable to use to hold the value of the unique expression | 
|---|
| [ddae809] | 530 | unqExpr->set_object( ObjectDecl::newObject( toString("_unq", unqExpr->get_id()), unqExpr->get_result()->clone(), makeInit( unqExpr->get_result() ) ) ); | 
|---|
| [141b786] | 531 | unqExpr->set_var( new VariableExpr( unqExpr->get_object() ) ); | 
|---|
|  | 532 | } | 
|---|
|  | 533 | vars.insert( unqExpr->get_id() ); | 
|---|
|  | 534 | } | 
|---|
|  | 535 |  | 
|---|
| [dc2334c] | 536 | Expression * FixCopyCtors::postmutate( ImplicitCopyCtorExpr * impCpCtorExpr ) { | 
|---|
| [c2931ea] | 537 | CP_CTOR_PRINT( std::cerr << "FixCopyCtors: " << impCpCtorExpr << std::endl; ) | 
|---|
|  | 538 |  | 
|---|
|  | 539 | std::list< ObjectDecl * > & tempDecls = impCpCtorExpr->get_tempDecls(); | 
|---|
|  | 540 | std::list< ObjectDecl * > & returnDecls = impCpCtorExpr->get_returnDecls(); | 
|---|
|  | 541 | std::list< Expression * > & dtors = impCpCtorExpr->get_dtors(); | 
|---|
| [845cedc] | 542 |  | 
|---|
| [c2931ea] | 543 | // add all temporary declarations and their constructors | 
|---|
|  | 544 | for ( ObjectDecl * obj : tempDecls ) { | 
|---|
| [ba3706f] | 545 | stmtsToAddBefore.push_back( new DeclStmt( obj ) ); | 
|---|
| [adcc065] | 546 | } // for | 
|---|
| [c2931ea] | 547 | for ( ObjectDecl * obj : returnDecls ) { | 
|---|
| [ba3706f] | 548 | stmtsToAddBefore.push_back( new DeclStmt( obj ) ); | 
|---|
| [adcc065] | 549 | } // for | 
|---|
| [db4ecc5] | 550 |  | 
|---|
| [c2931ea] | 551 | // add destructors after current statement | 
|---|
|  | 552 | for ( Expression * dtor : dtors ) { | 
|---|
| [ba3706f] | 553 | stmtsToAddAfter.push_back( new ExprStmt( dtor ) ); | 
|---|
| [adcc065] | 554 | } // for | 
|---|
| [db4ecc5] | 555 |  | 
|---|
| [c0714bf] | 556 | ObjectDecl * returnDecl = returnDecls.empty() ? nullptr : returnDecls.front(); | 
|---|
| [c2931ea] | 557 | Expression * callExpr = impCpCtorExpr->get_callExpr(); | 
|---|
|  | 558 |  | 
|---|
|  | 559 | CP_CTOR_PRINT( std::cerr << "Coming out the back..." << impCpCtorExpr << std::endl; ) | 
|---|
|  | 560 |  | 
|---|
|  | 561 | // detach fields from wrapper node so that it can be deleted without deleting too much | 
|---|
|  | 562 | dtors.clear(); | 
|---|
|  | 563 | tempDecls.clear(); | 
|---|
|  | 564 | returnDecls.clear(); | 
|---|
| [c0714bf] | 565 | impCpCtorExpr->set_callExpr( nullptr ); | 
|---|
|  | 566 | std::swap( impCpCtorExpr->env, callExpr->env ); | 
|---|
|  | 567 | assert( impCpCtorExpr->env == nullptr ); | 
|---|
| [c2931ea] | 568 | delete impCpCtorExpr; | 
|---|
|  | 569 |  | 
|---|
|  | 570 | if ( returnDecl ) { | 
|---|
| [f5c3b6c] | 571 | ApplicationExpr * assign = createBitwiseAssignment( new VariableExpr( returnDecl ), callExpr ); | 
|---|
| [c2931ea] | 572 | Expression * retExpr = new CommaExpr( assign, new VariableExpr( returnDecl ) ); | 
|---|
| [31f379c] | 573 | // move env from callExpr to retExpr | 
|---|
| [50377a4] | 574 | std::swap( retExpr->env, callExpr->env ); | 
|---|
| [c2931ea] | 575 | return retExpr; | 
|---|
|  | 576 | } else { | 
|---|
|  | 577 | return callExpr; | 
|---|
| [adcc065] | 578 | } // if | 
|---|
| [4ffdd63] | 579 | } | 
|---|
| [c2931ea] | 580 |  | 
|---|
| [dc2334c] | 581 | void FixCopyCtors::premutate( StmtExpr * stmtExpr ) { | 
|---|
| [65aca88] | 582 | // function call temporaries should be placed at statement-level, rather than nested inside of a new statement expression, | 
|---|
|  | 583 | // since temporaries can be shared across sub-expressions, e.g. | 
|---|
|  | 584 | //   [A, A] f(); | 
|---|
|  | 585 | //   g([A] x, [A] y); | 
|---|
| [dc2334c] | 586 | //   g(f()); | 
|---|
| [65aca88] | 587 | // f is executed once, so the return temporary is shared across the tuple constructors for x and y. | 
|---|
| [dc2334c] | 588 | // Explicitly mutating children instead of mutating the inner compound statment forces the temporaries to be added | 
|---|
|  | 589 | // to the outer context, rather than inside of the statement expression. | 
|---|
|  | 590 | visit_children = false; | 
|---|
| [9fe33947] | 591 | std::list< Statement * > & stmts = stmtExpr->statements->get_kids(); | 
|---|
| [65aca88] | 592 | for ( Statement *& stmt : stmts ) { | 
|---|
| [dc2334c] | 593 | stmt = stmt->acceptMutator( *visitor ); | 
|---|
| [65aca88] | 594 | } // for | 
|---|
| [9fe33947] | 595 | assert( stmtExpr->result ); | 
|---|
|  | 596 | Type * result = stmtExpr->result; | 
|---|
| [31f379c] | 597 | if ( ! result->isVoid() ) { | 
|---|
| [9fe33947] | 598 | for ( ObjectDecl * obj : stmtExpr->returnDecls ) { | 
|---|
| [ba3706f] | 599 | stmtsToAddBefore.push_back( new DeclStmt( obj ) ); | 
|---|
| [31f379c] | 600 | } // for | 
|---|
|  | 601 | // add destructors after current statement | 
|---|
| [9fe33947] | 602 | for ( Expression * dtor : stmtExpr->dtors ) { | 
|---|
| [ba3706f] | 603 | stmtsToAddAfter.push_back( new ExprStmt( dtor ) ); | 
|---|
| [31f379c] | 604 | } // for | 
|---|
|  | 605 | // must have a non-empty body, otherwise it wouldn't have a result | 
|---|
| [dc2334c] | 606 | assert( ! stmts.empty() ); | 
|---|
| [6dfa2e1] | 607 | assertf( ! stmtExpr->returnDecls.empty() || stmtExpr->dtors.empty(), "StmtExpr returns non-void, but no return decls: %s", toString( stmtExpr ).c_str() ); | 
|---|
|  | 608 | // if there is a return decl, add a use as the last statement; will not have return decl on non-constructable returns | 
|---|
|  | 609 | if ( ! stmtExpr->returnDecls.empty() ) { | 
|---|
|  | 610 | stmts.push_back( new ExprStmt( new VariableExpr( stmtExpr->returnDecls.front() ) ) ); | 
|---|
|  | 611 | } | 
|---|
| [9fe33947] | 612 | stmtExpr->returnDecls.clear(); | 
|---|
|  | 613 | stmtExpr->dtors.clear(); | 
|---|
| [31f379c] | 614 | } | 
|---|
| [9fe33947] | 615 | assert( stmtExpr->returnDecls.empty() ); | 
|---|
|  | 616 | assert( stmtExpr->dtors.empty() ); | 
|---|
| [31f379c] | 617 | } | 
|---|
|  | 618 |  | 
|---|
| [dc2334c] | 619 | void FixCopyCtors::premutate( UniqueExpr * unqExpr ) { | 
|---|
|  | 620 | visit_children = false; | 
|---|
| [597db97f] | 621 | unqCount[ unqExpr->get_id() ]--; | 
|---|
|  | 622 | static std::unordered_map< int, std::list< Statement * > > dtors; | 
|---|
| [141b786] | 623 | static std::unordered_map< int, UniqueExpr * > unqMap; | 
|---|
|  | 624 | // has to be done to clean up ImplicitCopyCtorExpr nodes, even when this node was skipped in previous passes | 
|---|
|  | 625 | if ( unqMap.count( unqExpr->get_id() ) ) { | 
|---|
|  | 626 | // take data from other UniqueExpr to ensure consistency | 
|---|
|  | 627 | delete unqExpr->get_expr(); | 
|---|
|  | 628 | unqExpr->set_expr( unqMap[unqExpr->get_id()]->get_expr()->clone() ); | 
|---|
|  | 629 | delete unqExpr->get_result(); | 
|---|
|  | 630 | unqExpr->set_result( maybeClone( unqExpr->get_expr()->get_result() ) ); | 
|---|
| [597db97f] | 631 | if ( unqCount[ unqExpr->get_id() ] == 0 ) {  // insert destructor after the last use of the unique expression | 
|---|
| [edbdbe6] | 632 | stmtsToAddAfter.splice( stmtsToAddAfter.end(), dtors[ unqExpr->get_id() ] ); | 
|---|
| [597db97f] | 633 | } | 
|---|
| [dc2334c] | 634 | return; | 
|---|
| [141b786] | 635 | } | 
|---|
| [dc2334c] | 636 | PassVisitor<FixCopyCtors> fixer( unqCount ); | 
|---|
| [597db97f] | 637 | unqExpr->set_expr( unqExpr->get_expr()->acceptMutator( fixer ) ); // stmtexprs contained should not be separately fixed, so this must occur after the lookup | 
|---|
| [dc2334c] | 638 | stmtsToAddBefore.splice( stmtsToAddBefore.end(), fixer.pass.stmtsToAddBefore ); | 
|---|
| [141b786] | 639 | unqMap[unqExpr->get_id()] = unqExpr; | 
|---|
| [edbdbe6] | 640 | if ( unqCount[ unqExpr->get_id() ] == 0 ) {  // insert destructor after the last use of the unique expression | 
|---|
|  | 641 | stmtsToAddAfter.splice( stmtsToAddAfter.end(), dtors[ unqExpr->get_id() ] ); | 
|---|
|  | 642 | } else { // remember dtors for last instance of unique expr | 
|---|
| [dc2334c] | 643 | dtors[ unqExpr->get_id() ] = fixer.pass.stmtsToAddAfter; | 
|---|
| [141b786] | 644 | } | 
|---|
| [dc2334c] | 645 | return; | 
|---|
| [141b786] | 646 | } | 
|---|
|  | 647 |  | 
|---|
| [5363fdf] | 648 | DeclarationWithType * FixInit::postmutate( ObjectDecl *objDecl ) { | 
|---|
| [aff3af4] | 649 | // since this removes the init field from objDecl, it must occur after children are mutated (i.e. postmutate) | 
|---|
| [c2931ea] | 650 | if ( ConstructorInit * ctorInit = dynamic_cast< ConstructorInit * >( objDecl->get_init() ) ) { | 
|---|
|  | 651 | // a decision should have been made by the resolver, so ctor and init are not both non-NULL | 
|---|
|  | 652 | assert( ! ctorInit->get_ctor() || ! ctorInit->get_init() ); | 
|---|
|  | 653 | if ( Statement * ctor = ctorInit->get_ctor() ) { | 
|---|
| [08d5507b] | 654 | if ( objDecl->get_storageClasses().is_static ) { | 
|---|
| [72e9222] | 655 | // originally wanted to take advantage of gcc nested functions, but | 
|---|
| [f9cebb5] | 656 | // we get memory errors with this approach. To remedy this, the static | 
|---|
|  | 657 | // variable is hoisted when the destructor needs to be called. | 
|---|
| [72e9222] | 658 | // | 
|---|
| [c2931ea] | 659 | // generate: | 
|---|
| [f9cebb5] | 660 | // static T __objName_static_varN; | 
|---|
| [72e9222] | 661 | // void __objName_dtor_atexitN() { | 
|---|
| [f9cebb5] | 662 | //   __dtor__...; | 
|---|
| [72e9222] | 663 | // } | 
|---|
|  | 664 | // int f(...) { | 
|---|
|  | 665 | //   ... | 
|---|
|  | 666 | //   static bool __objName_uninitialized = true; | 
|---|
|  | 667 | //   if (__objName_uninitialized) { | 
|---|
|  | 668 | //     __ctor(__objName); | 
|---|
|  | 669 | //     __objName_uninitialized = false; | 
|---|
| [f9cebb5] | 670 | //     atexit(__objName_dtor_atexitN); | 
|---|
| [c2931ea] | 671 | //   } | 
|---|
| [72e9222] | 672 | //   ... | 
|---|
| [c2931ea] | 673 | // } | 
|---|
|  | 674 |  | 
|---|
| [72e9222] | 675 | static UniqueName dtorCallerNamer( "_dtor_atexit" ); | 
|---|
|  | 676 |  | 
|---|
|  | 677 | // static bool __objName_uninitialized = true | 
|---|
| [c2931ea] | 678 | BasicType * boolType = new BasicType( Type::Qualifiers(), BasicType::Bool ); | 
|---|
| [579263a] | 679 | SingleInit * boolInitExpr = new SingleInit( new ConstantExpr( Constant::from_int( 1 ) ) ); | 
|---|
| [68fe077a] | 680 | ObjectDecl * isUninitializedVar = new ObjectDecl( objDecl->get_mangleName() + "_uninitialized", Type::StorageClasses( Type::Static ), LinkageSpec::Cforall, 0, boolType, boolInitExpr ); | 
|---|
| [c2931ea] | 681 | isUninitializedVar->fixUniqueId(); | 
|---|
|  | 682 |  | 
|---|
|  | 683 | // __objName_uninitialized = false; | 
|---|
|  | 684 | UntypedExpr * setTrue = new UntypedExpr( new NameExpr( "?=?" ) ); | 
|---|
|  | 685 | setTrue->get_args().push_back( new VariableExpr( isUninitializedVar ) ); | 
|---|
| [d56e5bc] | 686 | setTrue->get_args().push_back( new ConstantExpr( Constant::from_int( 0 ) ) ); | 
|---|
| [c2931ea] | 687 |  | 
|---|
|  | 688 | // generate body of if | 
|---|
| [ba3706f] | 689 | CompoundStmt * initStmts = new CompoundStmt(); | 
|---|
| [c2931ea] | 690 | std::list< Statement * > & body = initStmts->get_kids(); | 
|---|
|  | 691 | body.push_back( ctor ); | 
|---|
| [ba3706f] | 692 | body.push_back( new ExprStmt( setTrue ) ); | 
|---|
| [c2931ea] | 693 |  | 
|---|
|  | 694 | // put it all together | 
|---|
| [ba3706f] | 695 | IfStmt * ifStmt = new IfStmt( new VariableExpr( isUninitializedVar ), initStmts, 0 ); | 
|---|
|  | 696 | stmtsToAddAfter.push_back( new DeclStmt( isUninitializedVar ) ); | 
|---|
| [c2931ea] | 697 | stmtsToAddAfter.push_back( ifStmt ); | 
|---|
| [72e9222] | 698 |  | 
|---|
| [a4dd728] | 699 | Statement * dtor = ctorInit->get_dtor(); | 
|---|
| [62423350] | 700 | objDecl->set_init( nullptr ); | 
|---|
|  | 701 | ctorInit->set_ctor( nullptr ); | 
|---|
| [a4dd728] | 702 | ctorInit->set_dtor( nullptr ); | 
|---|
|  | 703 | if ( dtor ) { | 
|---|
| [f9cebb5] | 704 | // if the object has a non-trivial destructor, have to | 
|---|
|  | 705 | // hoist it and the object into the global space and | 
|---|
|  | 706 | // call the destructor function with atexit. | 
|---|
|  | 707 |  | 
|---|
| [a4dd728] | 708 | Statement * dtorStmt = dtor->clone(); | 
|---|
| [f9cebb5] | 709 |  | 
|---|
|  | 710 | // void __objName_dtor_atexitN(...) {...} | 
|---|
| [ba3706f] | 711 | FunctionDecl * dtorCaller = new FunctionDecl( objDecl->get_mangleName() + dtorCallerNamer.newName(), Type::StorageClasses( Type::Static ), LinkageSpec::C, new FunctionType( Type::Qualifiers(), false ), new CompoundStmt() ); | 
|---|
| [f9cebb5] | 712 | dtorCaller->fixUniqueId(); | 
|---|
| [c8dfcd3] | 713 | dtorCaller->get_statements()->push_back( dtorStmt ); | 
|---|
| [f9cebb5] | 714 |  | 
|---|
|  | 715 | // atexit(dtor_atexit); | 
|---|
|  | 716 | UntypedExpr * callAtexit = new UntypedExpr( new NameExpr( "atexit" ) ); | 
|---|
|  | 717 | callAtexit->get_args().push_back( new VariableExpr( dtorCaller ) ); | 
|---|
|  | 718 |  | 
|---|
| [ba3706f] | 719 | body.push_back( new ExprStmt( callAtexit ) ); | 
|---|
| [f9cebb5] | 720 |  | 
|---|
|  | 721 | // hoist variable and dtor caller decls to list of decls that will be added into global scope | 
|---|
|  | 722 | staticDtorDecls.push_back( objDecl ); | 
|---|
|  | 723 | staticDtorDecls.push_back( dtorCaller ); | 
|---|
|  | 724 |  | 
|---|
|  | 725 | // need to rename object uniquely since it now appears | 
|---|
|  | 726 | // at global scope and there could be multiple function-scoped | 
|---|
|  | 727 | // static variables with the same name in different functions. | 
|---|
| [c8dfcd3] | 728 | // Note: it isn't sufficient to modify only the mangleName, because | 
|---|
|  | 729 | // then subsequent Indexer passes can choke on seeing the object's name | 
|---|
|  | 730 | // if another object has the same name and type. An unfortunate side-effect | 
|---|
|  | 731 | // of renaming the object is that subsequent NameExprs may fail to resolve, | 
|---|
|  | 732 | // but there shouldn't be any remaining past this point. | 
|---|
| [f9cebb5] | 733 | static UniqueName staticNamer( "_static_var" ); | 
|---|
| [c8dfcd3] | 734 | objDecl->set_name( objDecl->get_name() + staticNamer.newName() ); | 
|---|
|  | 735 | objDecl->set_mangleName( SymTab::Mangler::mangle( objDecl ) ); | 
|---|
| [f9cebb5] | 736 |  | 
|---|
|  | 737 | // xxx - temporary hack: need to return a declaration, but want to hoist the current object out of this scope | 
|---|
|  | 738 | // create a new object which is never used | 
|---|
|  | 739 | static UniqueName dummyNamer( "_dummy" ); | 
|---|
| [68fe077a] | 740 | ObjectDecl * dummy = new ObjectDecl( dummyNamer.newName(), Type::StorageClasses( Type::Static ), LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), new VoidType( Type::Qualifiers() ) ), 0, std::list< Attribute * >{ new Attribute("unused") } ); | 
|---|
| [a4dd728] | 741 | delete ctorInit; | 
|---|
| [f9cebb5] | 742 | return dummy; | 
|---|
|  | 743 | } | 
|---|
| [c2931ea] | 744 | } else { | 
|---|
| [e3e16bc] | 745 | ImplicitCtorDtorStmt * implicit = strict_dynamic_cast< ImplicitCtorDtorStmt * > ( ctor ); | 
|---|
| [5363fdf] | 746 | ExprStmt * ctorStmt = dynamic_cast< ExprStmt * >( implicit->callStmt ); | 
|---|
| [233e4d9] | 747 | ApplicationExpr * ctorCall = nullptr; | 
|---|
| [5363fdf] | 748 | if ( ctorStmt && (ctorCall = isIntrinsicCallExpr( ctorStmt->expr )) && ctorCall->get_args().size() == 2 ) { | 
|---|
| [233e4d9] | 749 | // clean up intrinsic copy constructor calls by making them into SingleInits | 
|---|
| [e41306d] | 750 | Expression * ctorArg = ctorCall->args.back(); | 
|---|
|  | 751 | std::swap( ctorArg->env, ctorCall->env ); | 
|---|
|  | 752 | objDecl->init = new SingleInit( ctorArg ); | 
|---|
|  | 753 |  | 
|---|
| [5363fdf] | 754 | ctorCall->args.pop_back(); | 
|---|
| [233e4d9] | 755 | } else { | 
|---|
|  | 756 | stmtsToAddAfter.push_back( ctor ); | 
|---|
| [5363fdf] | 757 | objDecl->init = nullptr; | 
|---|
|  | 758 | ctorInit->ctor = nullptr; | 
|---|
| [233e4d9] | 759 | } | 
|---|
| [adcc065] | 760 | } // if | 
|---|
| [5363fdf] | 761 | } else if ( Initializer * init = ctorInit->init ) { | 
|---|
|  | 762 | objDecl->init = init; | 
|---|
|  | 763 | ctorInit->init = nullptr; | 
|---|
| [c2931ea] | 764 | } else { | 
|---|
|  | 765 | // no constructor and no initializer, which is okay | 
|---|
| [5363fdf] | 766 | objDecl->init = nullptr; | 
|---|
| [adcc065] | 767 | } // if | 
|---|
| [c2931ea] | 768 | delete ctorInit; | 
|---|
| [adcc065] | 769 | } // if | 
|---|
| [c2931ea] | 770 | return objDecl; | 
|---|
| [db4ecc5] | 771 | } | 
|---|
|  | 772 |  | 
|---|
| [698ec72] | 773 | void ObjDeclCollector::previsit( CompoundStmt * ) { | 
|---|
|  | 774 | GuardValue( curVars ); | 
|---|
| [db4ecc5] | 775 | } | 
|---|
|  | 776 |  | 
|---|
| [698ec72] | 777 | void ObjDeclCollector::previsit( DeclStmt * stmt ) { | 
|---|
| [4b2589a] | 778 | // keep track of all variables currently in scope | 
|---|
| [c2931ea] | 779 | if ( ObjectDecl * objDecl = dynamic_cast< ObjectDecl * > ( stmt->get_decl() ) ) { | 
|---|
| [62423350] | 780 | curVars.push_back( objDecl ); | 
|---|
| [adcc065] | 781 | } // if | 
|---|
| [db4ecc5] | 782 | } | 
|---|
|  | 783 |  | 
|---|
| [698ec72] | 784 | void LabelFinder::previsit( Statement * stmt ) { | 
|---|
| [4b2589a] | 785 | // for each label, remember the variables in scope at that label. | 
|---|
| [c2931ea] | 786 | for ( Label l : stmt->get_labels() ) { | 
|---|
|  | 787 | vars[l] = curVars; | 
|---|
| [adcc065] | 788 | } // for | 
|---|
| [71f4e4f] | 789 | } | 
|---|
| [f1e012b] | 790 |  | 
|---|
| [698ec72] | 791 | void LabelFinder::previsit( CompoundStmt * stmt ) { | 
|---|
|  | 792 | previsit( (Statement *)stmt ); | 
|---|
|  | 793 | Parent::previsit( stmt ); | 
|---|
|  | 794 | } | 
|---|
|  | 795 |  | 
|---|
|  | 796 | void LabelFinder::previsit( DeclStmt * stmt ) { | 
|---|
|  | 797 | previsit( (Statement *)stmt ); | 
|---|
|  | 798 | Parent::previsit( stmt ); | 
|---|
|  | 799 | } | 
|---|
|  | 800 |  | 
|---|
|  | 801 |  | 
|---|
| [ec79847] | 802 | template<typename Iterator, typename OutputIterator> | 
|---|
|  | 803 | void insertDtors( Iterator begin, Iterator end, OutputIterator out ) { | 
|---|
|  | 804 | for ( Iterator it = begin ; it != end ; ++it ) { | 
|---|
| [adcc065] | 805 | // extract destructor statement from the object decl and insert it into the output. Note that this is | 
|---|
|  | 806 | // only called on lists of non-static objects with implicit non-intrinsic dtors, so if the user manually | 
|---|
|  | 807 | // calls an intrinsic dtor then the call must (and will) still be generated since the argument may | 
|---|
|  | 808 | // contain side effects. | 
|---|
| [c2931ea] | 809 | ObjectDecl * objDecl = *it; | 
|---|
|  | 810 | ConstructorInit * ctorInit = dynamic_cast< ConstructorInit * >( objDecl->get_init() ); | 
|---|
|  | 811 | assert( ctorInit && ctorInit->get_dtor() ); | 
|---|
|  | 812 | *out++ = ctorInit->get_dtor()->clone(); | 
|---|
| [adcc065] | 813 | } // for | 
|---|
| [f1e012b] | 814 | } | 
|---|
| [39786813] | 815 |  | 
|---|
| [698ec72] | 816 | void InsertDtors::previsit( ObjectDecl * objDecl ) { | 
|---|
| [c2931ea] | 817 | // remember non-static destructed objects so that their destructors can be inserted later | 
|---|
| [08d5507b] | 818 | if ( ! objDecl->get_storageClasses().is_static ) { | 
|---|
| [c2931ea] | 819 | if ( ConstructorInit * ctorInit = dynamic_cast< ConstructorInit * >( objDecl->get_init() ) ) { | 
|---|
|  | 820 | // a decision should have been made by the resolver, so ctor and init are not both non-NULL | 
|---|
|  | 821 | assert( ! ctorInit->get_ctor() || ! ctorInit->get_init() ); | 
|---|
|  | 822 | Statement * dtor = ctorInit->get_dtor(); | 
|---|
| [e4d6335] | 823 | // don't need to call intrinsic dtor, because it does nothing, but | 
|---|
|  | 824 | // non-intrinsic dtors must be called | 
|---|
| [f9cebb5] | 825 | if ( dtor && ! isIntrinsicSingleArgCallStmt( dtor ) ) { | 
|---|
| [e4d6335] | 826 | // set dtor location to the object's location for error messages | 
|---|
|  | 827 | ctorInit->dtor->location = objDecl->location; | 
|---|
| [c2931ea] | 828 | reverseDeclOrder.front().push_front( objDecl ); | 
|---|
| [adcc065] | 829 | } // if | 
|---|
|  | 830 | } // if | 
|---|
|  | 831 | } // if | 
|---|
| [52c14b3] | 832 | } | 
|---|
|  | 833 |  | 
|---|
| [698ec72] | 834 | void InsertDtors::previsit( FunctionDecl * funcDecl ) { | 
|---|
| [52c14b3] | 835 | // each function needs to have its own set of labels | 
|---|
| [698ec72] | 836 | GuardValue( labelVars ); | 
|---|
| [52c14b3] | 837 | labelVars.clear(); | 
|---|
| [680620d] | 838 | // LabelFinder does not recurse into FunctionDecl, so need to visit | 
|---|
|  | 839 | // its children manually. | 
|---|
| [698ec72] | 840 | maybeAccept( funcDecl->type, finder ); | 
|---|
|  | 841 | maybeAccept( funcDecl->statements, finder ); | 
|---|
| [52c14b3] | 842 |  | 
|---|
| [698ec72] | 843 | // all labels for this function have been collected, insert destructors as appropriate via implicit recursion. | 
|---|
| [52c14b3] | 844 | } | 
|---|
|  | 845 |  | 
|---|
| [698ec72] | 846 | void InsertDtors::previsit( CompoundStmt * compoundStmt ) { | 
|---|
| [adcc065] | 847 | // visit statements - this will also populate reverseDeclOrder list.  don't want to dump all destructors | 
|---|
|  | 848 | // when block is left, just the destructors associated with variables defined in this block, so push a new | 
|---|
|  | 849 | // list to the top of the stack so that we can differentiate scopes | 
|---|
| [c2931ea] | 850 | reverseDeclOrder.push_front( OrderedDecls() ); | 
|---|
| [698ec72] | 851 | Parent::previsit( compoundStmt ); | 
|---|
|  | 852 | } | 
|---|
| [39786813] | 853 |  | 
|---|
| [698ec72] | 854 | void InsertDtors::postvisit( CompoundStmt * compoundStmt ) { | 
|---|
| [0661678] | 855 | // add destructors for the current scope that we're exiting, unless the last statement is a return, which | 
|---|
|  | 856 | // causes unreachable code warnings | 
|---|
| [c2931ea] | 857 | std::list< Statement * > & statements = compoundStmt->get_kids(); | 
|---|
| [0661678] | 858 | if ( ! statements.empty() && ! dynamic_cast< ReturnStmt * >( statements.back() ) ) { | 
|---|
|  | 859 | insertDtors( reverseDeclOrder.front().begin(), reverseDeclOrder.front().end(), back_inserter( statements ) ); | 
|---|
|  | 860 | } | 
|---|
| [c2931ea] | 861 | reverseDeclOrder.pop_front(); | 
|---|
| [39786813] | 862 | } | 
|---|
|  | 863 |  | 
|---|
| [698ec72] | 864 | void InsertDtors::previsit( ReturnStmt * ) { | 
|---|
| [4b2589a] | 865 | // return exits all scopes, so dump destructors for all scopes | 
|---|
| [c2931ea] | 866 | for ( OrderedDecls & od : reverseDeclOrder ) { | 
|---|
| [698ec72] | 867 | insertDtors( od.begin(), od.end(), back_inserter( stmtsToAddBefore ) ); | 
|---|
| [adcc065] | 868 | } // for | 
|---|
| [39786813] | 869 | } | 
|---|
| [f1e012b] | 870 |  | 
|---|
| [adcc065] | 871 | // Handle break/continue/goto in the same manner as C++.  Basic idea: any objects that are in scope at the | 
|---|
|  | 872 | // BranchStmt but not at the labelled (target) statement must be destructed.  If there are any objects in scope | 
|---|
|  | 873 | // at the target location but not at the BranchStmt then those objects would be uninitialized so notify the user | 
|---|
|  | 874 | // of the error.  See C++ Reference 6.6 Jump Statements for details. | 
|---|
| [c2931ea] | 875 | void InsertDtors::handleGoto( BranchStmt * stmt ) { | 
|---|
| [5809461] | 876 | // can't do anything for computed goto | 
|---|
|  | 877 | if ( stmt->computedTarget ) return; | 
|---|
|  | 878 |  | 
|---|
|  | 879 | assertf( stmt->get_target() != "", "BranchStmt missing a label: %s", toString( stmt ).c_str() ); | 
|---|
| [c2931ea] | 880 | // S_L = lvars = set of objects in scope at label definition | 
|---|
|  | 881 | // S_G = curVars = set of objects in scope at goto statement | 
|---|
|  | 882 | ObjectSet & lvars = labelVars[ stmt->get_target() ]; | 
|---|
|  | 883 |  | 
|---|
|  | 884 | DTOR_PRINT( | 
|---|
|  | 885 | std::cerr << "at goto label: " << stmt->get_target().get_name() << std::endl; | 
|---|
|  | 886 | std::cerr << "S_G = " << printSet( curVars ) << std::endl; | 
|---|
|  | 887 | std::cerr << "S_L = " << printSet( lvars ) << std::endl; | 
|---|
|  | 888 | ) | 
|---|
|  | 889 |  | 
|---|
|  | 890 | ObjectSet diff; | 
|---|
|  | 891 | // S_L-S_G results in set of objects whose construction is skipped - it's an error if this set is non-empty | 
|---|
|  | 892 | std::set_difference( lvars.begin(), lvars.end(), curVars.begin(), curVars.end(), std::inserter( diff, diff.begin() ) ); | 
|---|
|  | 893 | DTOR_PRINT( | 
|---|
|  | 894 | std::cerr << "S_L-S_G = " << printSet( diff ) << std::endl; | 
|---|
|  | 895 | ) | 
|---|
|  | 896 | if ( ! diff.empty() ) { | 
|---|
|  | 897 | throw SemanticError( std::string("jump to label '") + stmt->get_target().get_name() + "' crosses initialization of " + (*diff.begin())->get_name() + " ", stmt ); | 
|---|
| [adcc065] | 898 | } // if | 
|---|
| [c2931ea] | 899 | // S_G-S_L results in set of objects that must be destructed | 
|---|
|  | 900 | diff.clear(); | 
|---|
|  | 901 | std::set_difference( curVars.begin(), curVars.end(), lvars.begin(), lvars.end(), std::inserter( diff, diff.end() ) ); | 
|---|
|  | 902 | DTOR_PRINT( | 
|---|
|  | 903 | std::cerr << "S_G-S_L = " << printSet( diff ) << std::endl; | 
|---|
|  | 904 | ) | 
|---|
|  | 905 | if ( ! diff.empty() ) { | 
|---|
| [62423350] | 906 | // create an auxilliary set for fast lookup -- can't make diff a set, because diff ordering should be consistent for error messages. | 
|---|
|  | 907 | std::unordered_set<ObjectDecl *> needsDestructor( diff.begin(), diff.end() ); | 
|---|
|  | 908 |  | 
|---|
| [c2931ea] | 909 | // go through decl ordered list of objectdecl. for each element that occurs in diff, output destructor | 
|---|
|  | 910 | OrderedDecls ordered; | 
|---|
|  | 911 | for ( OrderedDecls & rdo : reverseDeclOrder ) { | 
|---|
|  | 912 | // add elements from reverseDeclOrder into ordered if they occur in diff - it is key that this happens in reverse declaration order. | 
|---|
| [62423350] | 913 | copy_if( rdo.begin(), rdo.end(), back_inserter( ordered ), [&]( ObjectDecl * objDecl ) { return needsDestructor.count( objDecl ); } ); | 
|---|
| [adcc065] | 914 | } // for | 
|---|
| [698ec72] | 915 | insertDtors( ordered.begin(), ordered.end(), back_inserter( stmtsToAddBefore ) ); | 
|---|
| [adcc065] | 916 | } // if | 
|---|
| [c2931ea] | 917 | } | 
|---|
| [39786813] | 918 |  | 
|---|
| [698ec72] | 919 | void InsertDtors::previsit( BranchStmt * stmt ) { | 
|---|
| [c2931ea] | 920 | switch( stmt->get_type() ) { | 
|---|
| [adcc065] | 921 | case BranchStmt::Continue: | 
|---|
|  | 922 | case BranchStmt::Break: | 
|---|
|  | 923 | // could optimize the break/continue case, because the S_L-S_G check is unnecessary (this set should | 
|---|
|  | 924 | // always be empty), but it serves as a small sanity check. | 
|---|
|  | 925 | case BranchStmt::Goto: | 
|---|
|  | 926 | handleGoto( stmt ); | 
|---|
|  | 927 | break; | 
|---|
|  | 928 | default: | 
|---|
|  | 929 | assert( false ); | 
|---|
|  | 930 | } // switch | 
|---|
| [c2931ea] | 931 | } | 
|---|
| [79970ed] | 932 |  | 
|---|
|  | 933 | bool checkWarnings( FunctionDecl * funcDecl ) { | 
|---|
|  | 934 | // only check for warnings if the current function is a user-defined | 
|---|
|  | 935 | // constructor or destructor | 
|---|
|  | 936 | if ( ! funcDecl ) return false; | 
|---|
|  | 937 | if ( ! funcDecl->get_statements() ) return false; | 
|---|
| [bff227f] | 938 | return CodeGen::isCtorDtor( funcDecl->get_name() ) && ! LinkageSpec::isOverridable( funcDecl->get_linkage() ); | 
|---|
| [79970ed] | 939 | } | 
|---|
|  | 940 |  | 
|---|
| [b3fc977] | 941 | void GenStructMemberCalls::premutate( FunctionDecl * funcDecl ) { | 
|---|
| [5363fdf] | 942 | GuardValue( function ); | 
|---|
| [9a707e4e] | 943 | GuardValue( unhandled ); | 
|---|
|  | 944 | GuardValue( usedUninit ); | 
|---|
|  | 945 | GuardValue( thisParam ); | 
|---|
|  | 946 | GuardValue( isCtor ); | 
|---|
|  | 947 | GuardValue( structDecl ); | 
|---|
| [64ac636] | 948 | errors = SemanticError();  // clear previous errors | 
|---|
| [c8dfcd3] | 949 |  | 
|---|
|  | 950 | // need to start with fresh sets | 
|---|
|  | 951 | unhandled.clear(); | 
|---|
|  | 952 | usedUninit.clear(); | 
|---|
| [79970ed] | 953 |  | 
|---|
|  | 954 | function = funcDecl; | 
|---|
| [bff227f] | 955 | isCtor = CodeGen::isConstructor( function->get_name() ); | 
|---|
| [c8dfcd3] | 956 | if ( checkWarnings( function ) ) { | 
|---|
|  | 957 | FunctionType * type = function->get_functionType(); | 
|---|
| [79970ed] | 958 | assert( ! type->get_parameters().empty() ); | 
|---|
| [e3e16bc] | 959 | thisParam = strict_dynamic_cast< ObjectDecl * >( type->get_parameters().front() ); | 
|---|
| [0a81c3f] | 960 | Type * thisType = getPointerBase( thisParam->get_type() ); | 
|---|
|  | 961 | StructInstType * structType = dynamic_cast< StructInstType * >( thisType ); | 
|---|
| [79970ed] | 962 | if ( structType ) { | 
|---|
| [44f6341] | 963 | structDecl = structType->get_baseStruct(); | 
|---|
| [79970ed] | 964 | for ( Declaration * member : structDecl->get_members() ) { | 
|---|
|  | 965 | if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( member ) ) { | 
|---|
|  | 966 | // record all of the struct type's members that need to be constructed or | 
|---|
|  | 967 | // destructed by the end of the function | 
|---|
|  | 968 | unhandled.insert( field ); | 
|---|
|  | 969 | } | 
|---|
|  | 970 | } | 
|---|
|  | 971 | } | 
|---|
|  | 972 | } | 
|---|
| [9a707e4e] | 973 | } | 
|---|
|  | 974 |  | 
|---|
| [b3fc977] | 975 | DeclarationWithType * GenStructMemberCalls::postmutate( FunctionDecl * funcDecl ) { | 
|---|
| [c8dfcd3] | 976 | // remove the unhandled objects from usedUninit, because a call is inserted | 
|---|
|  | 977 | // to handle them - only objects that are later constructed are used uninitialized. | 
|---|
| [64ac636] | 978 | std::map< DeclarationWithType *, CodeLocation > diff; | 
|---|
|  | 979 | // need the comparator since usedUninit and unhandled have different types | 
|---|
|  | 980 | struct comp_t { | 
|---|
|  | 981 | typedef decltype(usedUninit)::value_type usedUninit_t; | 
|---|
|  | 982 | typedef decltype(unhandled)::value_type unhandled_t; | 
|---|
|  | 983 | bool operator()(usedUninit_t x, unhandled_t y) { return x.first < y; } | 
|---|
|  | 984 | bool operator()(unhandled_t x, usedUninit_t y) { return x < y.first; } | 
|---|
|  | 985 | } comp; | 
|---|
|  | 986 | std::set_difference( usedUninit.begin(), usedUninit.end(), unhandled.begin(), unhandled.end(), std::inserter( diff, diff.begin() ), comp ); | 
|---|
|  | 987 | for ( auto p : diff ) { | 
|---|
|  | 988 | DeclarationWithType * member = p.first; | 
|---|
|  | 989 | CodeLocation loc = p.second; | 
|---|
|  | 990 | // xxx - make error message better by also tracking the location that the object is constructed at? | 
|---|
|  | 991 | emit( loc, "in ", CodeGen::genPrettyType( function->get_functionType(), function->get_name() ), ", field ", member->get_name(), " used before being constructed" ); | 
|---|
| [79970ed] | 992 | } | 
|---|
|  | 993 |  | 
|---|
| [c8dfcd3] | 994 | if ( ! unhandled.empty() ) { | 
|---|
| [4618319] | 995 | // need to explicitly re-add function parameters to the indexer in order to resolve copy constructors | 
|---|
| [9a707e4e] | 996 | auto guard = makeFuncGuard( [this]() { indexer.enterScope(); }, [this]() { indexer.leaveScope(); } ); | 
|---|
| [5fe35d6] | 997 | indexer.addFunctionType( function->type ); | 
|---|
| [44f6341] | 998 |  | 
|---|
|  | 999 | // need to iterate through members in reverse in order for | 
|---|
|  | 1000 | // ctor/dtor statements to come out in the right order | 
|---|
| [1ba88a0] | 1001 | for ( Declaration * member : reverseIterate( structDecl->get_members() ) ) { | 
|---|
| [44f6341] | 1002 | DeclarationWithType * field = dynamic_cast< DeclarationWithType * >( member ); | 
|---|
|  | 1003 | // skip non-DWT members | 
|---|
|  | 1004 | if ( ! field ) continue; | 
|---|
| [05807e9] | 1005 | // skip non-constructable members | 
|---|
|  | 1006 | if ( ! tryConstruct( field ) ) continue; | 
|---|
| [44f6341] | 1007 | // skip handled members | 
|---|
|  | 1008 | if ( ! unhandled.count( field ) ) continue; | 
|---|
|  | 1009 |  | 
|---|
|  | 1010 | // insert and resolve default/copy constructor call for each field that's unhandled | 
|---|
| [c8dfcd3] | 1011 | std::list< Statement * > stmt; | 
|---|
| [5fe35d6] | 1012 | Expression * arg2 = nullptr; | 
|---|
| [4d4882a] | 1013 | if ( isCopyConstructor( function ) ) { | 
|---|
| [44f6341] | 1014 | // if copy ctor, need to pass second-param-of-this-function.field | 
|---|
| [4d4882a] | 1015 | std::list< DeclarationWithType * > & params = function->get_functionType()->get_parameters(); | 
|---|
|  | 1016 | assert( params.size() == 2 ); | 
|---|
| [44f6341] | 1017 | arg2 = new MemberExpr( field, new VariableExpr( params.back() ) ); | 
|---|
| [4d4882a] | 1018 | } | 
|---|
|  | 1019 | InitExpander srcParam( arg2 ); | 
|---|
| [4618319] | 1020 | // cast away reference type and construct field. | 
|---|
|  | 1021 | Expression * thisExpr = new CastExpr( new VariableExpr( thisParam ), thisParam->get_type()->stripReferences()->clone() ); | 
|---|
|  | 1022 | Expression * memberDest = new MemberExpr( field, thisExpr ); | 
|---|
|  | 1023 | SymTab::genImplicitCall( srcParam, memberDest, function->get_name(), back_inserter( stmt ), field, isCtor ); | 
|---|
| [c8dfcd3] | 1024 |  | 
|---|
|  | 1025 | assert( stmt.size() <= 1 ); | 
|---|
|  | 1026 | if ( stmt.size() == 1 ) { | 
|---|
|  | 1027 | Statement * callStmt = stmt.front(); | 
|---|
|  | 1028 |  | 
|---|
|  | 1029 | try { | 
|---|
| [b3fc977] | 1030 | callStmt->acceptMutator( *visitor ); | 
|---|
| [c8dfcd3] | 1031 | if ( isCtor ) { | 
|---|
|  | 1032 | function->get_statements()->push_front( callStmt ); | 
|---|
|  | 1033 | } else { | 
|---|
|  | 1034 | // destructor statements should be added at the end | 
|---|
|  | 1035 | function->get_statements()->push_back( callStmt ); | 
|---|
|  | 1036 | } | 
|---|
|  | 1037 | } catch ( SemanticError & error ) { | 
|---|
| [64ac636] | 1038 | emit( funcDecl->location, "in ", CodeGen::genPrettyType( function->get_functionType(), function->get_name() ), ", field ", field->get_name(), " not explicitly ", isCtor ? "constructed" : "destructed",  " and no ", isCtor ? "default constructor" : "destructor", " found" ); | 
|---|
| [c8dfcd3] | 1039 | } | 
|---|
|  | 1040 | } | 
|---|
|  | 1041 | } | 
|---|
|  | 1042 | } | 
|---|
| [64ac636] | 1043 | if (! errors.isEmpty()) { | 
|---|
|  | 1044 | throw errors; | 
|---|
|  | 1045 | } | 
|---|
| [b3fc977] | 1046 | return funcDecl; | 
|---|
| [79970ed] | 1047 | } | 
|---|
|  | 1048 |  | 
|---|
| [4618319] | 1049 | /// true if expr is effectively just the 'this' parameter | 
|---|
|  | 1050 | bool isThisExpression( Expression * expr, DeclarationWithType * thisParam ) { | 
|---|
|  | 1051 | // TODO: there are more complicated ways to pass 'this' to a constructor, e.g. &*, *&, etc. | 
|---|
|  | 1052 | if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) { | 
|---|
|  | 1053 | return varExpr->get_var() == thisParam; | 
|---|
|  | 1054 | } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * > ( expr ) ) { | 
|---|
|  | 1055 | return isThisExpression( castExpr->get_arg(), thisParam ); | 
|---|
|  | 1056 | } | 
|---|
|  | 1057 | return false; | 
|---|
|  | 1058 | } | 
|---|
|  | 1059 |  | 
|---|
|  | 1060 | /// returns a MemberExpr if expr is effectively just member access on the 'this' parameter, else nullptr | 
|---|
|  | 1061 | MemberExpr * isThisMemberExpr( Expression * expr, DeclarationWithType * thisParam ) { | 
|---|
|  | 1062 | if ( MemberExpr * memberExpr = dynamic_cast< MemberExpr * >( expr ) ) { | 
|---|
|  | 1063 | if ( isThisExpression( memberExpr->get_aggregate(), thisParam ) ) { | 
|---|
|  | 1064 | return memberExpr; | 
|---|
|  | 1065 | } | 
|---|
|  | 1066 | } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) { | 
|---|
|  | 1067 | return isThisMemberExpr( castExpr->get_arg(), thisParam ); | 
|---|
|  | 1068 | } | 
|---|
|  | 1069 | return nullptr; | 
|---|
|  | 1070 | } | 
|---|
|  | 1071 |  | 
|---|
| [b3fc977] | 1072 | void GenStructMemberCalls::premutate( ApplicationExpr * appExpr ) { | 
|---|
| [9a707e4e] | 1073 | if ( ! checkWarnings( function ) ) { | 
|---|
|  | 1074 | visit_children = false; | 
|---|
|  | 1075 | return; | 
|---|
|  | 1076 | } | 
|---|
| [79970ed] | 1077 |  | 
|---|
|  | 1078 | std::string fname = getFunctionName( appExpr ); | 
|---|
|  | 1079 | if ( fname == function->get_name() ) { | 
|---|
|  | 1080 | // call to same kind of function | 
|---|
|  | 1081 | Expression * firstParam = appExpr->get_args().front(); | 
|---|
|  | 1082 |  | 
|---|
| [4618319] | 1083 | if ( isThisExpression( firstParam, thisParam ) ) { | 
|---|
| [79970ed] | 1084 | // if calling another constructor on thisParam, assume that function handles | 
|---|
|  | 1085 | // all members - if it doesn't a warning will appear in that function. | 
|---|
| [4618319] | 1086 | unhandled.clear(); | 
|---|
|  | 1087 | } else if ( MemberExpr * memberExpr = isThisMemberExpr( firstParam, thisParam ) ) { | 
|---|
|  | 1088 | // if first parameter is a member expression on the this parameter, | 
|---|
|  | 1089 | // then remove the member from unhandled set. | 
|---|
|  | 1090 | if ( isThisExpression( memberExpr->get_aggregate(), thisParam ) ) { | 
|---|
|  | 1091 | unhandled.erase( memberExpr->get_member() ); | 
|---|
| [79970ed] | 1092 | } | 
|---|
|  | 1093 | } | 
|---|
|  | 1094 | } | 
|---|
|  | 1095 | } | 
|---|
|  | 1096 |  | 
|---|
| [b3fc977] | 1097 | void GenStructMemberCalls::premutate( MemberExpr * memberExpr ) { | 
|---|
| [9a707e4e] | 1098 | if ( ! checkWarnings( function ) || ! isCtor ) { | 
|---|
|  | 1099 | visit_children = false; | 
|---|
|  | 1100 | return; | 
|---|
|  | 1101 | } | 
|---|
| [79970ed] | 1102 |  | 
|---|
| [4618319] | 1103 | if ( isThisExpression( memberExpr->get_aggregate(), thisParam ) ) { | 
|---|
|  | 1104 | if ( unhandled.count( memberExpr->get_member() ) ) { | 
|---|
|  | 1105 | // emit a warning because a member was used before it was constructed | 
|---|
|  | 1106 | usedUninit.insert( { memberExpr->get_member(), memberExpr->location } ); | 
|---|
| [79970ed] | 1107 | } | 
|---|
|  | 1108 | } | 
|---|
|  | 1109 | } | 
|---|
| [3906301] | 1110 |  | 
|---|
|  | 1111 | template< typename Visitor, typename... Params > | 
|---|
| [64ac636] | 1112 | void error( Visitor & v, CodeLocation loc, const Params &... params ) { | 
|---|
|  | 1113 | SemanticError err( toString( params... ) ); | 
|---|
|  | 1114 | err.set_location( loc ); | 
|---|
|  | 1115 | v.errors.append( err ); | 
|---|
| [3906301] | 1116 | } | 
|---|
|  | 1117 |  | 
|---|
|  | 1118 | template< typename... Params > | 
|---|
| [64ac636] | 1119 | void GenStructMemberCalls::emit( CodeLocation loc, const Params &... params ) { | 
|---|
| [3906301] | 1120 | // toggle warnings vs. errors here. | 
|---|
|  | 1121 | // warn( params... ); | 
|---|
| [64ac636] | 1122 | error( *this, loc, params... ); | 
|---|
| [3906301] | 1123 | } | 
|---|
| [c8dfcd3] | 1124 |  | 
|---|
| [b3fc977] | 1125 | Expression * GenStructMemberCalls::postmutate( UntypedExpr * untypedExpr ) { | 
|---|
| [08da53d] | 1126 | Expression * newExpr = untypedExpr; | 
|---|
|  | 1127 | ResolvExpr::findVoidExpression( newExpr, indexer ); | 
|---|
|  | 1128 | return newExpr; | 
|---|
| [c8dfcd3] | 1129 | } | 
|---|
| [b6fe7e6] | 1130 |  | 
|---|
| [696bf6e] | 1131 | Expression * FixCtorExprs::postmutate( ConstructorExpr * ctorExpr ) { | 
|---|
| [b6fe7e6] | 1132 | static UniqueName tempNamer( "_tmp_ctor_expr" ); | 
|---|
| [f0121d7] | 1133 | // xxx - is the size check necessary? | 
|---|
| [d29fa5f] | 1134 | assert( ctorExpr->result && ctorExpr->get_result()->size() == 1 ); | 
|---|
| [b7b8674] | 1135 |  | 
|---|
| [627f585] | 1136 | // xxx - this can be TupleAssignExpr now. Need to properly handle this case. | 
|---|
| [e3e16bc] | 1137 | ApplicationExpr * callExpr = strict_dynamic_cast< ApplicationExpr * > ( ctorExpr->get_callExpr() ); | 
|---|
| [b6fe7e6] | 1138 | TypeSubstitution * env = ctorExpr->get_env(); | 
|---|
|  | 1139 | ctorExpr->set_callExpr( nullptr ); | 
|---|
|  | 1140 | ctorExpr->set_env( nullptr ); | 
|---|
| [f5c3b6c] | 1141 |  | 
|---|
|  | 1142 | // xxx - ideally we would reuse the temporary generated from the copy constructor passes from within firstArg if it exists and not generate a temporary if it's unnecessary. | 
|---|
|  | 1143 | ObjectDecl * tmp = ObjectDecl::newObject( tempNamer.newName(), callExpr->args.front()->result->clone(), nullptr ); | 
|---|
|  | 1144 | declsToAddBefore.push_back( tmp ); | 
|---|
| [8a6cf7e] | 1145 | delete ctorExpr; | 
|---|
| [b6fe7e6] | 1146 |  | 
|---|
| [696bf6e] | 1147 | // build assignment and replace constructor's first argument with new temporary | 
|---|
| [b6fe7e6] | 1148 | Expression *& firstArg = callExpr->get_args().front(); | 
|---|
| [696bf6e] | 1149 | Expression * assign = new UntypedExpr( new NameExpr( "?=?" ), { new AddressExpr( new VariableExpr( tmp ) ), new AddressExpr( firstArg ) } ); | 
|---|
| [8a6cf7e] | 1150 | firstArg = new VariableExpr( tmp ); | 
|---|
|  | 1151 |  | 
|---|
| [696bf6e] | 1152 | // resolve assignment and dispose of new env | 
|---|
| [08da53d] | 1153 | ResolvExpr::findVoidExpression( assign, indexer ); | 
|---|
|  | 1154 | delete assign->env; | 
|---|
|  | 1155 | assign->env = nullptr; | 
|---|
| [696bf6e] | 1156 |  | 
|---|
| [8a6cf7e] | 1157 | // for constructor expr: | 
|---|
|  | 1158 | //   T x; | 
|---|
|  | 1159 | //   x{}; | 
|---|
|  | 1160 | // results in: | 
|---|
|  | 1161 | //   T x; | 
|---|
|  | 1162 | //   T & tmp; | 
|---|
|  | 1163 | //   &tmp = &x, ?{}(tmp), tmp | 
|---|
| [08da53d] | 1164 | CommaExpr * commaExpr = new CommaExpr( assign, new CommaExpr( callExpr, new VariableExpr( tmp ) ) ); | 
|---|
| [b6fe7e6] | 1165 | commaExpr->set_env( env ); | 
|---|
|  | 1166 | return commaExpr; | 
|---|
|  | 1167 | } | 
|---|
| [c2931ea] | 1168 | } // namespace | 
|---|
| [71f4e4f] | 1169 | } // namespace InitTweak | 
|---|
|  | 1170 |  | 
|---|
|  | 1171 | // Local Variables: // | 
|---|
|  | 1172 | // tab-width: 4 // | 
|---|
|  | 1173 | // mode: c++ // | 
|---|
|  | 1174 | // compile-command: "make install" // | 
|---|
|  | 1175 | // End: // | 
|---|