source: src/InitTweak/FixInit.cc@ 9fe33947

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 9fe33947 was 9fe33947, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Minor code cleanup

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