source: src/InitTweak/FixInit.cc@ 5363fdf

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since 5363fdf was 5363fdf, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Cleanup FixInit code

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