source: src/InitTweak/FixInit.cc@ 1cb934d

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

Remove label lists from various Statement constructors

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