source: src/InitTweak/FixInit.cc@ 65660bd

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

replace multiple-returning functions with tuple-returning functions, implement tuple ctor/dtor, allow N-arg tuple assignment
  • Property mode set to 100644
File size: 42.2 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 : Tue Jul 12 17:41:15 2016
13// Update Count : 34
14//
15
16#include <stack>
17#include <list>
18#include <iterator>
19#include <algorithm>
20#include "InitTweak.h"
21#include "FixInit.h"
22#include "FixGlobalInit.h"
23#include "ResolvExpr/Resolver.h"
24#include "ResolvExpr/typeops.h"
25#include "SynTree/Declaration.h"
26#include "SynTree/Type.h"
27#include "SynTree/Expression.h"
28#include "SynTree/Attribute.h"
29#include "SynTree/Statement.h"
30#include "SynTree/Initializer.h"
31#include "SynTree/Mutator.h"
32#include "SymTab/Indexer.h"
33#include "SymTab/Autogen.h"
34#include "GenPoly/PolyMutator.h"
35#include "GenPoly/DeclMutator.h"
36#include "SynTree/AddStmtVisitor.h"
37#include "CodeGen/GenType.h" // for warnings
38
39bool ctordtorp = false;
40bool ctorp = false;
41bool cpctorp = false;
42bool dtorp = false;
43#define PRINT( text ) if ( ctordtorp ) { text }
44#define CP_CTOR_PRINT( text ) if ( ctordtorp || cpctorp ) { text }
45#define DTOR_PRINT( text ) if ( ctordtorp || dtorp ) { text }
46
47namespace InitTweak {
48 namespace {
49 const std::list<Label> noLabels;
50 const std::list<Expression*> noDesignators;
51
52 class InsertImplicitCalls : public GenPoly::PolyMutator {
53 public:
54 /// wrap function application expressions as ImplicitCopyCtorExpr nodes so that it is easy to identify which
55 /// function calls need their parameters to be copy constructed
56 static void insert( std::list< Declaration * > & translationUnit );
57
58 virtual Expression * mutate( ApplicationExpr * appExpr );
59 };
60
61 class ResolveCopyCtors : public SymTab::Indexer {
62 public:
63 /// generate temporary ObjectDecls for each argument and return value of each ImplicitCopyCtorExpr,
64 /// generate/resolve copy construction expressions for each, and generate/resolve destructors for both
65 /// arguments and return value temporaries
66 static void resolveImplicitCalls( std::list< Declaration * > & translationUnit );
67
68 virtual void visit( ImplicitCopyCtorExpr * impCpCtorExpr );
69
70 /// create and resolve ctor/dtor expression: fname(var, [cpArg])
71 Expression * makeCtorDtor( const std::string & fname, ObjectDecl * var, Expression * cpArg = NULL );
72 Expression * makeCtorDtor( const std::string & fname, Expression * thisArg, Expression * cpArg = NULL );
73 /// true if type does not need to be copy constructed to ensure correctness
74 bool skipCopyConstruct( Type * type );
75 void copyConstructArg( Expression *& arg, ImplicitCopyCtorExpr * impCpCtorExpr );
76 void destructRet( Expression * ret, ImplicitCopyCtorExpr * impCpCtorExpr );
77 private:
78 TypeSubstitution * env;
79 };
80
81 /// collects constructed object decls - used as a base class
82 class ObjDeclCollector : public AddStmtVisitor {
83 public:
84 typedef AddStmtVisitor Parent;
85 using Parent::visit;
86 typedef std::set< ObjectDecl * > ObjectSet;
87 virtual void visit( CompoundStmt *compoundStmt );
88 virtual void visit( DeclStmt *stmt );
89 protected:
90 ObjectSet curVars;
91 };
92
93 // debug
94 struct printSet {
95 typedef ObjDeclCollector::ObjectSet ObjectSet;
96 printSet( const ObjectSet & objs ) : objs( objs ) {}
97 const ObjectSet & objs;
98 };
99 std::ostream & operator<<( std::ostream & out, const printSet & set) {
100 out << "{ ";
101 for ( ObjectDecl * obj : set.objs ) {
102 out << obj->get_name() << ", " ;
103 } // for
104 out << " }";
105 return out;
106 }
107
108 class LabelFinder : public ObjDeclCollector {
109 public:
110 typedef ObjDeclCollector Parent;
111 typedef std::map< Label, ObjectSet > LabelMap;
112 // map of Label -> live variables at that label
113 LabelMap vars;
114
115 void handleStmt( Statement * stmt );
116
117 // xxx - This needs to be done better.
118 // allow some generalization among different kinds of nodes with with similar parentage (e.g. all
119 // expressions, all statements, etc.) important to have this to provide a single entry point so that as new
120 // subclasses are added, there is only one place that the code has to be updated, rather than ensure that
121 // every specialized class knows about every new kind of statement that might be added.
122 virtual void visit( CompoundStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
123 virtual void visit( ExprStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
124 virtual void visit( AsmStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
125 virtual void visit( IfStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
126 virtual void visit( WhileStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
127 virtual void visit( ForStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
128 virtual void visit( SwitchStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
129 virtual void visit( CaseStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
130 virtual void visit( BranchStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
131 virtual void visit( ReturnStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
132 virtual void visit( TryStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
133 virtual void visit( CatchStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
134 virtual void visit( FinallyStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
135 virtual void visit( NullStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
136 virtual void visit( DeclStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
137 virtual void visit( ImplicitCtorDtorStmt *stmt ) { handleStmt( stmt ); return Parent::visit( stmt ); }
138 };
139
140 class InsertDtors : public ObjDeclCollector {
141 public:
142 /// insert destructor calls at the appropriate places. must happen before CtorInit nodes are removed
143 /// (currently by FixInit)
144 static void insert( std::list< Declaration * > & translationUnit );
145
146 typedef ObjDeclCollector Parent;
147 typedef std::list< ObjectDecl * > OrderedDecls;
148 typedef std::list< OrderedDecls > OrderedDeclsStack;
149
150 InsertDtors( LabelFinder & finder ) : labelVars( finder.vars ) {}
151
152 virtual void visit( ObjectDecl * objDecl );
153
154 virtual void visit( CompoundStmt * compoundStmt );
155 virtual void visit( ReturnStmt * returnStmt );
156 virtual void visit( BranchStmt * stmt );
157 private:
158 void handleGoto( BranchStmt * stmt );
159
160 LabelFinder::LabelMap & labelVars;
161 OrderedDeclsStack reverseDeclOrder;
162 };
163
164 class FixInit : public GenPoly::PolyMutator {
165 public:
166 /// expand each object declaration to use its constructor after it is declared.
167 static void fixInitializers( std::list< Declaration * > &translationUnit );
168
169 virtual DeclarationWithType * mutate( ObjectDecl *objDecl );
170
171 std::list< Declaration * > staticDtorDecls;
172 };
173
174 class FixCopyCtors : public GenPoly::PolyMutator {
175 public:
176 /// expand ImplicitCopyCtorExpr nodes into the temporary declarations, copy constructors, call expression,
177 /// and destructors
178 static void fixCopyCtors( std::list< Declaration * > &translationUnit );
179
180 virtual Expression * mutate( ImplicitCopyCtorExpr * impCpCtorExpr );
181 };
182
183 class GenStructMemberCalls : public SymTab::Indexer {
184 public:
185 typedef Indexer Parent;
186 /// generate default/copy ctor and dtor calls for user-defined struct ctor/dtors
187 /// for any member that is missing a corresponding ctor/dtor call.
188 /// error if a member is used before constructed
189 static void generate( std::list< Declaration * > & translationUnit );
190
191 virtual void visit( FunctionDecl * funcDecl );
192
193 virtual void visit( MemberExpr * memberExpr );
194 virtual void visit( ApplicationExpr * appExpr );
195
196 SemanticError errors;
197 private:
198 void handleFirstParam( Expression * firstParam );
199 template< typename... Params >
200 void emit( const Params &... params );
201
202 FunctionDecl * function = 0;
203 std::set< DeclarationWithType * > unhandled, usedUninit;
204 ObjectDecl * thisParam = 0;
205 bool isCtor = false; // true if current function is a constructor
206 StructDecl * structDecl = 0;
207 };
208
209 // very simple resolver-like mutator class - used to
210 // resolve UntypedExprs that are found within newly
211 // generated constructor/destructor calls
212 class MutatingResolver : public Mutator {
213 public:
214 MutatingResolver( SymTab::Indexer & indexer ) : indexer( indexer ) {}
215
216 virtual DeclarationWithType* mutate( ObjectDecl *objectDecl );
217
218 virtual Expression* mutate( UntypedExpr *untypedExpr );
219 private:
220 SymTab::Indexer & indexer;
221 };
222
223 class FixCtorExprs : public GenPoly::DeclMutator {
224 public:
225 /// expands ConstructorExpr nodes into comma expressions, using a temporary for the first argument
226 static void fix( std::list< Declaration * > & translationUnit );
227
228 virtual Expression * mutate( ConstructorExpr * ctorExpr );
229 };
230 } // namespace
231
232 void fix( std::list< Declaration * > & translationUnit, const std::string & filename, bool inLibrary ) {
233 // fixes ConstructorInit for global variables. should happen before fixInitializers.
234 InitTweak::fixGlobalInit( translationUnit, filename, inLibrary );
235
236
237 InsertImplicitCalls::insert( translationUnit );
238 ResolveCopyCtors::resolveImplicitCalls( translationUnit );
239 InsertDtors::insert( translationUnit );
240 FixInit::fixInitializers( translationUnit );
241
242 // FixCopyCtors must happen after FixInit, so that destructors are placed correctly
243 FixCopyCtors::fixCopyCtors( translationUnit );
244
245 GenStructMemberCalls::generate( translationUnit );
246 // xxx - ctor expansion currently has to be after FixCopyCtors, because there is currently a
247 // hack in the way untyped assignments are generated, where the first argument cannot have
248 // its address taken because of the way codegeneration handles UntypedExpr vs. ApplicationExpr.
249 // Thus such assignment exprs must never pushed through expression resolution (and thus should
250 // not go through the FixCopyCtors pass), otherwise they will fail -- guaranteed.
251 // Also needs to happen after GenStructMemberCalls, since otherwise member constructors exprs
252 // don't look right, and a member can be constructed more than once.
253 FixCtorExprs::fix( translationUnit );
254 }
255
256 namespace {
257 void InsertImplicitCalls::insert( std::list< Declaration * > & translationUnit ) {
258 InsertImplicitCalls inserter;
259 mutateAll( translationUnit, inserter );
260 }
261
262 void ResolveCopyCtors::resolveImplicitCalls( std::list< Declaration * > & translationUnit ) {
263 ResolveCopyCtors resolver;
264 acceptAll( translationUnit, resolver );
265 }
266
267 void FixInit::fixInitializers( std::list< Declaration * > & translationUnit ) {
268 FixInit fixer;
269
270 // can't use mutateAll, because need to insert declarations at top-level
271 // can't use DeclMutator, because sometimes need to insert IfStmt, etc.
272 SemanticError errors;
273 for ( std::list< Declaration * >::iterator i = translationUnit.begin(); i != translationUnit.end(); ++i ) {
274 try {
275 *i = maybeMutate( *i, fixer );
276 translationUnit.splice( i, fixer.staticDtorDecls );
277 } catch( SemanticError &e ) {
278 errors.append( e );
279 } // try
280 } // for
281 if ( ! errors.isEmpty() ) {
282 throw errors;
283 } // if
284 }
285
286 void InsertDtors::insert( std::list< Declaration * > & translationUnit ) {
287 LabelFinder finder;
288 InsertDtors inserter( finder );
289 acceptAll( translationUnit, finder );
290 acceptAll( translationUnit, inserter );
291 }
292
293 void FixCopyCtors::fixCopyCtors( std::list< Declaration * > & translationUnit ) {
294 FixCopyCtors fixer;
295 mutateAll( translationUnit, fixer );
296 }
297
298 void GenStructMemberCalls::generate( std::list< Declaration * > & translationUnit ) {
299 GenStructMemberCalls warner;
300 acceptAll( translationUnit, warner );
301
302 // visitor doesn't throw so that it can collect all errors
303 if ( ! warner.errors.isEmpty() ) {
304 throw warner.errors;
305 }
306 }
307
308 void FixCtorExprs::fix( std::list< Declaration * > & translationUnit ) {
309 FixCtorExprs fixer;
310 fixer.mutateDeclarationList( translationUnit );
311 }
312
313 Expression * InsertImplicitCalls::mutate( ApplicationExpr * appExpr ) {
314 appExpr = dynamic_cast< ApplicationExpr * >( Mutator::mutate( appExpr ) );
315 assert( appExpr );
316
317 if ( VariableExpr * function = dynamic_cast< VariableExpr * > ( appExpr->get_function() ) ) {
318 if ( function->get_var()->get_linkage() == LinkageSpec::Intrinsic ) {
319 // optimization: don't need to copy construct in order to call intrinsic functions
320 return appExpr;
321 } else if ( DeclarationWithType * funcDecl = dynamic_cast< DeclarationWithType * > ( function->get_var() ) ) {
322 FunctionType * ftype = dynamic_cast< FunctionType * >( GenPoly::getFunctionType( funcDecl->get_type() ) );
323 assert( ftype );
324 if ( (isConstructor( funcDecl->get_name() ) || funcDecl->get_name() == "?=?") && ftype->get_parameters().size() == 2 ) {
325 Type * t1 = ftype->get_parameters().front()->get_type();
326 Type * t2 = ftype->get_parameters().back()->get_type();
327 PointerType * ptrType = dynamic_cast< PointerType * > ( t1 );
328 assert( ptrType );
329
330 if ( ResolvExpr::typesCompatible( ptrType->get_base(), t2, SymTab::Indexer() ) ) {
331 // optimization: don't need to copy construct in order to call a copy constructor or
332 // assignment operator
333 return appExpr;
334 } // if
335 } else if ( isDestructor( funcDecl->get_name() ) ) {
336 // correctness: never copy construct arguments to a destructor
337 return appExpr;
338 } // if
339 } // if
340 } // if
341 CP_CTOR_PRINT( std::cerr << "InsertImplicitCalls: adding a wrapper " << appExpr << std::endl; )
342
343 // wrap each function call so that it is easy to identify nodes that have to be copy constructed
344 ImplicitCopyCtorExpr * expr = new ImplicitCopyCtorExpr( appExpr );
345 // save the type substitution onto the new node so that it is easy to find.
346 // Ensure it is not deleted with the ImplicitCopyCtorExpr by removing it before deletion.
347 // The substitution is needed to obtain the type of temporary variables so that copy constructor
348 // calls can be resolved. Normally this is what PolyMutator is for, but the pass that resolves
349 // copy constructor calls must be an Indexer. We could alternatively make a PolyIndexer which
350 // saves the environment, or compute the types of temporaries here, but it's much simpler to
351 // save the environment here, and more cohesive to compute temporary variables and resolve copy
352 // constructor calls together.
353 assert( env );
354 expr->set_env( env );
355 return expr;
356 }
357
358 bool ResolveCopyCtors::skipCopyConstruct( Type * type ) {
359 return dynamic_cast< VarArgsType * >( type ) || GenPoly::getFunctionType( type );
360 }
361
362 Expression * ResolveCopyCtors::makeCtorDtor( const std::string & fname, ObjectDecl * var, Expression * cpArg ) {
363 assert( var );
364 return makeCtorDtor( fname, new AddressExpr( new VariableExpr( var ) ), cpArg );
365 }
366
367 Expression * ResolveCopyCtors::makeCtorDtor( const std::string & fname, Expression * thisArg, Expression * cpArg ) {
368 assert( thisArg );
369 UntypedExpr * untyped = new UntypedExpr( new NameExpr( fname ) );
370 untyped->get_args().push_back( thisArg );
371 if (cpArg) untyped->get_args().push_back( cpArg->clone() );
372
373 // resolve copy constructor
374 // should only be one alternative for copy ctor and dtor expressions, since all arguments are fixed
375 // (VariableExpr and already resolved expression)
376 CP_CTOR_PRINT( std::cerr << "ResolvingCtorDtor " << untyped << std::endl; )
377 Expression * resolved = ResolvExpr::findVoidExpression( untyped, *this );
378 assert( resolved );
379 if ( resolved->get_env() ) {
380 env->add( *resolved->get_env() );
381 } // if
382
383 delete untyped;
384 return resolved;
385 }
386
387 void ResolveCopyCtors::copyConstructArg( Expression *& arg, ImplicitCopyCtorExpr * impCpCtorExpr ) {
388 static UniqueName tempNamer("_tmp_cp");
389 CP_CTOR_PRINT( std::cerr << "Type Substitution: " << *impCpCtorExpr->get_env() << std::endl; )
390 assert( arg->has_result() );
391 Type * result = arg->get_result();
392 if ( skipCopyConstruct( result ) ) return; // skip certain non-copyable types
393
394 // type may involve type variables, so apply type substitution to get temporary variable's actual type
395 result = result->clone();
396 impCpCtorExpr->get_env()->apply( result );
397 ObjectDecl * tmp = new ObjectDecl( tempNamer.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, 0, result, 0 );
398 tmp->get_type()->set_isConst( false );
399
400 // create and resolve copy constructor
401 CP_CTOR_PRINT( std::cerr << "makeCtorDtor for an argument" << std::endl; )
402 Expression * cpCtor = makeCtorDtor( "?{}", tmp, arg );
403
404 if ( ApplicationExpr * appExpr = dynamic_cast< ApplicationExpr * >( cpCtor ) ) {
405 // if the chosen constructor is intrinsic, the copy is unnecessary, so
406 // don't create the temporary and don't call the copy constructor
407 VariableExpr * function = dynamic_cast< VariableExpr * >( appExpr->get_function() );
408 assert( function );
409 if ( function->get_var()->get_linkage() == LinkageSpec::Intrinsic ) return;
410 }
411
412 // replace argument to function call with temporary
413 arg = new CommaExpr( cpCtor, new VariableExpr( tmp ) );
414 impCpCtorExpr->get_tempDecls().push_back( tmp );
415 impCpCtorExpr->get_dtors().push_front( makeCtorDtor( "^?{}", tmp ) );
416 }
417
418 void ResolveCopyCtors::destructRet( Expression * ret, ImplicitCopyCtorExpr * impCpCtorExpr ) {
419 impCpCtorExpr->get_dtors().push_front( makeCtorDtor( "^?{}", new AddressExpr( ret ) ) );
420 }
421
422 void ResolveCopyCtors::visit( ImplicitCopyCtorExpr *impCpCtorExpr ) {
423 CP_CTOR_PRINT( std::cerr << "ResolveCopyCtors: " << impCpCtorExpr << std::endl; )
424 Visitor::visit( impCpCtorExpr );
425 env = impCpCtorExpr->get_env(); // xxx - maybe we really should just have a PolyIndexer...
426
427 ApplicationExpr * appExpr = impCpCtorExpr->get_callExpr();
428
429 // take each argument and attempt to copy construct it.
430 for ( Expression * & arg : appExpr->get_args() ) {
431 copyConstructArg( arg, impCpCtorExpr );
432 } // for
433
434 // each return value from the call needs to be connected with an ObjectDecl at the call site, which is
435 // initialized with the return value and is destructed later
436 // xxx - handle multiple return values
437 ApplicationExpr * callExpr = impCpCtorExpr->get_callExpr();
438 // xxx - is this right? callExpr may not have the right environment, because it was attached at a higher
439 // level. Trying to pass that environment along.
440 callExpr->set_env( impCpCtorExpr->get_env()->clone() );
441 Type * result = appExpr->get_result();
442 if ( ! result->isVoid() ) {
443 static UniqueName retNamer("_tmp_cp_ret");
444 result = result->clone();
445 impCpCtorExpr->get_env()->apply( result );
446 ObjectDecl * ret = new ObjectDecl( retNamer.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, 0, result, 0 );
447 ret->get_type()->set_isConst( false );
448 impCpCtorExpr->get_returnDecls().push_back( ret );
449 CP_CTOR_PRINT( std::cerr << "makeCtorDtor for a return" << std::endl; )
450 destructRet( new VariableExpr( ret ) , impCpCtorExpr );
451 } // for
452 CP_CTOR_PRINT( std::cerr << "after Resolving: " << impCpCtorExpr << std::endl; )
453 }
454
455
456 Expression * FixCopyCtors::mutate( ImplicitCopyCtorExpr * impCpCtorExpr ) {
457 CP_CTOR_PRINT( std::cerr << "FixCopyCtors: " << impCpCtorExpr << std::endl; )
458
459 impCpCtorExpr = dynamic_cast< ImplicitCopyCtorExpr * >( Mutator::mutate( impCpCtorExpr ) );
460 assert( impCpCtorExpr );
461
462 std::list< ObjectDecl * > & tempDecls = impCpCtorExpr->get_tempDecls();
463 std::list< ObjectDecl * > & returnDecls = impCpCtorExpr->get_returnDecls();
464 std::list< Expression * > & dtors = impCpCtorExpr->get_dtors();
465
466 // add all temporary declarations and their constructors
467 for ( ObjectDecl * obj : tempDecls ) {
468 stmtsToAdd.push_back( new DeclStmt( noLabels, obj ) );
469 } // for
470 for ( ObjectDecl * obj : returnDecls ) {
471 stmtsToAdd.push_back( new DeclStmt( noLabels, obj ) );
472 } // for
473
474 // add destructors after current statement
475 for ( Expression * dtor : dtors ) {
476 stmtsToAddAfter.push_back( new ExprStmt( noLabels, dtor ) );
477 } // for
478
479 // xxx - update to work with multiple return values
480 ObjectDecl * returnDecl = returnDecls.empty() ? NULL : returnDecls.front();
481 Expression * callExpr = impCpCtorExpr->get_callExpr();
482
483 CP_CTOR_PRINT( std::cerr << "Coming out the back..." << impCpCtorExpr << std::endl; )
484
485 // detach fields from wrapper node so that it can be deleted without deleting too much
486 dtors.clear();
487 tempDecls.clear();
488 returnDecls.clear();
489 impCpCtorExpr->set_callExpr( NULL );
490 impCpCtorExpr->set_env( NULL );
491 delete impCpCtorExpr;
492
493 if ( returnDecl ) {
494 UntypedExpr * assign = new UntypedExpr( new NameExpr( "?=?" ) );
495 assign->get_args().push_back( new VariableExpr( returnDecl ) );
496 assign->get_args().push_back( callExpr );
497 // know the result type of the assignment is the type of the LHS (minus the pointer), so
498 // add that onto the assignment expression so that later steps have the necessary information
499 assign->set_result( returnDecl->get_type()->clone() );
500
501 Expression * retExpr = new CommaExpr( assign, new VariableExpr( returnDecl ) );
502 if ( callExpr->get_result()->get_isLvalue() ) {
503 // lvalue returning functions are funny. Lvalue.cc inserts a *? in front of any lvalue returning
504 // non-intrinsic function. Add an AddressExpr to the call to negate the derefence and change the
505 // type of the return temporary from T to T* to properly capture the return value. Then dereference
506 // the result of the comma expression, since the lvalue returning call was originally wrapped with
507 // an AddressExpr. Effectively, this turns
508 // lvalue T f();
509 // &*f()
510 // into
511 // T * tmp_cp_retN;
512 // tmp_cp_ret_N = &*(tmp_cp_ret_N = &*f(), tmp_cp_ret);
513 // which work out in terms of types, but is pretty messy. It would be nice to find a better way.
514 assign->get_args().back() = new AddressExpr( assign->get_args().back() );
515
516 Type * resultType = returnDecl->get_type()->clone();
517 returnDecl->set_type( new PointerType( Type::Qualifiers(), returnDecl->get_type() ) );
518 UntypedExpr * deref = new UntypedExpr( new NameExpr( "*?" ) );
519 deref->get_args().push_back( retExpr );
520 deref->set_result( resultType );
521 retExpr = deref;
522 } // if
523 retExpr->set_env( env->clone() );
524 return retExpr;
525 } else {
526 return callExpr;
527 } // if
528 }
529
530 DeclarationWithType *FixInit::mutate( ObjectDecl *objDecl ) {
531 // first recursively handle pieces of ObjectDecl so that they aren't missed by other visitors when the init
532 // is removed from the ObjectDecl
533 objDecl = dynamic_cast< ObjectDecl * >( Mutator::mutate( objDecl ) );
534
535 if ( ConstructorInit * ctorInit = dynamic_cast< ConstructorInit * >( objDecl->get_init() ) ) {
536 // a decision should have been made by the resolver, so ctor and init are not both non-NULL
537 assert( ! ctorInit->get_ctor() || ! ctorInit->get_init() );
538 if ( Statement * ctor = ctorInit->get_ctor() ) {
539 if ( objDecl->get_storageClass() == DeclarationNode::Static ) {
540 // originally wanted to take advantage of gcc nested functions, but
541 // we get memory errors with this approach. To remedy this, the static
542 // variable is hoisted when the destructor needs to be called.
543 //
544 // generate:
545 // static T __objName_static_varN;
546 // void __objName_dtor_atexitN() {
547 // __dtor__...;
548 // }
549 // int f(...) {
550 // ...
551 // static bool __objName_uninitialized = true;
552 // if (__objName_uninitialized) {
553 // __ctor(__objName);
554 // __objName_uninitialized = false;
555 // atexit(__objName_dtor_atexitN);
556 // }
557 // ...
558 // }
559
560 static UniqueName dtorCallerNamer( "_dtor_atexit" );
561
562 // static bool __objName_uninitialized = true
563 BasicType * boolType = new BasicType( Type::Qualifiers(), BasicType::Bool );
564 SingleInit * boolInitExpr = new SingleInit( new ConstantExpr( Constant( boolType->clone(), "1" ) ), noDesignators );
565 ObjectDecl * isUninitializedVar = new ObjectDecl( objDecl->get_mangleName() + "_uninitialized", DeclarationNode::Static, LinkageSpec::Cforall, 0, boolType, boolInitExpr );
566 isUninitializedVar->fixUniqueId();
567
568 // __objName_uninitialized = false;
569 UntypedExpr * setTrue = new UntypedExpr( new NameExpr( "?=?" ) );
570 setTrue->get_args().push_back( new VariableExpr( isUninitializedVar ) );
571 setTrue->get_args().push_back( new ConstantExpr( Constant( boolType->clone(), "0" ) ) );
572
573 // generate body of if
574 CompoundStmt * initStmts = new CompoundStmt( noLabels );
575 std::list< Statement * > & body = initStmts->get_kids();
576 body.push_back( ctor );
577 body.push_back( new ExprStmt( noLabels, setTrue ) );
578
579 // put it all together
580 IfStmt * ifStmt = new IfStmt( noLabels, new VariableExpr( isUninitializedVar ), initStmts, 0 );
581 stmtsToAddAfter.push_back( new DeclStmt( noLabels, isUninitializedVar ) );
582 stmtsToAddAfter.push_back( ifStmt );
583
584 if ( ctorInit->get_dtor() ) {
585 // if the object has a non-trivial destructor, have to
586 // hoist it and the object into the global space and
587 // call the destructor function with atexit.
588
589 Statement * dtorStmt = ctorInit->get_dtor()->clone();
590
591 // void __objName_dtor_atexitN(...) {...}
592 FunctionDecl * dtorCaller = new FunctionDecl( objDecl->get_mangleName() + dtorCallerNamer.newName(), DeclarationNode::Static, LinkageSpec::C, new FunctionType( Type::Qualifiers(), false ), new CompoundStmt( noLabels ), false, false );
593 dtorCaller->fixUniqueId();
594 dtorCaller->get_statements()->push_back( dtorStmt );
595
596 // atexit(dtor_atexit);
597 UntypedExpr * callAtexit = new UntypedExpr( new NameExpr( "atexit" ) );
598 callAtexit->get_args().push_back( new VariableExpr( dtorCaller ) );
599
600 body.push_back( new ExprStmt( noLabels, callAtexit ) );
601
602 // hoist variable and dtor caller decls to list of decls that will be added into global scope
603 staticDtorDecls.push_back( objDecl );
604 staticDtorDecls.push_back( dtorCaller );
605
606 // need to rename object uniquely since it now appears
607 // at global scope and there could be multiple function-scoped
608 // static variables with the same name in different functions.
609 // Note: it isn't sufficient to modify only the mangleName, because
610 // then subsequent Indexer passes can choke on seeing the object's name
611 // if another object has the same name and type. An unfortunate side-effect
612 // of renaming the object is that subsequent NameExprs may fail to resolve,
613 // but there shouldn't be any remaining past this point.
614 static UniqueName staticNamer( "_static_var" );
615 objDecl->set_name( objDecl->get_name() + staticNamer.newName() );
616 objDecl->set_mangleName( SymTab::Mangler::mangle( objDecl ) );
617
618 objDecl->set_init( NULL );
619 ctorInit->set_ctor( NULL );
620 delete ctorInit;
621
622 // xxx - temporary hack: need to return a declaration, but want to hoist the current object out of this scope
623 // create a new object which is never used
624 static UniqueName dummyNamer( "_dummy" );
625 ObjectDecl * dummy = new ObjectDecl( dummyNamer.newName(), DeclarationNode::Static, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), new VoidType( Type::Qualifiers() ) ), 0, std::list< Attribute * >{ new Attribute("unused") } );
626 return dummy;
627 }
628 } else {
629 stmtsToAddAfter.push_back( ctor );
630 } // if
631 objDecl->set_init( NULL );
632 ctorInit->set_ctor( NULL );
633 } else if ( Initializer * init = ctorInit->get_init() ) {
634 objDecl->set_init( init );
635 ctorInit->set_init( NULL );
636 } else {
637 // no constructor and no initializer, which is okay
638 objDecl->set_init( NULL );
639 } // if
640 delete ctorInit;
641 } // if
642 return objDecl;
643 }
644
645 void ObjDeclCollector::visit( CompoundStmt *compoundStmt ) {
646 std::set< ObjectDecl * > prevVars = curVars;
647 Parent::visit( compoundStmt );
648 curVars = prevVars;
649 }
650
651 void ObjDeclCollector::visit( DeclStmt *stmt ) {
652 // keep track of all variables currently in scope
653 if ( ObjectDecl * objDecl = dynamic_cast< ObjectDecl * > ( stmt->get_decl() ) ) {
654 curVars.insert( objDecl );
655 } // if
656 Parent::visit( stmt );
657 }
658
659 void LabelFinder::handleStmt( Statement * stmt ) {
660 // for each label, remember the variables in scope at that label.
661 for ( Label l : stmt->get_labels() ) {
662 vars[l] = curVars;
663 } // for
664 }
665
666 template<typename Iterator, typename OutputIterator>
667 void insertDtors( Iterator begin, Iterator end, OutputIterator out ) {
668 for ( Iterator it = begin ; it != end ; ++it ) {
669 // extract destructor statement from the object decl and insert it into the output. Note that this is
670 // only called on lists of non-static objects with implicit non-intrinsic dtors, so if the user manually
671 // calls an intrinsic dtor then the call must (and will) still be generated since the argument may
672 // contain side effects.
673 ObjectDecl * objDecl = *it;
674 ConstructorInit * ctorInit = dynamic_cast< ConstructorInit * >( objDecl->get_init() );
675 assert( ctorInit && ctorInit->get_dtor() );
676 *out++ = ctorInit->get_dtor()->clone();
677 } // for
678 }
679
680 void InsertDtors::visit( ObjectDecl * objDecl ) {
681 // remember non-static destructed objects so that their destructors can be inserted later
682 if ( objDecl->get_storageClass() != DeclarationNode::Static ) {
683 if ( ConstructorInit * ctorInit = dynamic_cast< ConstructorInit * >( objDecl->get_init() ) ) {
684 // a decision should have been made by the resolver, so ctor and init are not both non-NULL
685 assert( ! ctorInit->get_ctor() || ! ctorInit->get_init() );
686 Statement * dtor = ctorInit->get_dtor();
687 if ( dtor && ! isIntrinsicSingleArgCallStmt( dtor ) ) {
688 // don't need to call intrinsic dtor, because it does nothing, but
689 // non-intrinsic dtors must be called
690 reverseDeclOrder.front().push_front( objDecl );
691 } // if
692 } // if
693 } // if
694 Parent::visit( objDecl );
695 }
696
697 void InsertDtors::visit( CompoundStmt * compoundStmt ) {
698 // visit statements - this will also populate reverseDeclOrder list. don't want to dump all destructors
699 // when block is left, just the destructors associated with variables defined in this block, so push a new
700 // list to the top of the stack so that we can differentiate scopes
701 reverseDeclOrder.push_front( OrderedDecls() );
702 Parent::visit( compoundStmt );
703
704 // add destructors for the current scope that we're exiting
705 std::list< Statement * > & statements = compoundStmt->get_kids();
706 insertDtors( reverseDeclOrder.front().begin(), reverseDeclOrder.front().end(), back_inserter( statements ) );
707 reverseDeclOrder.pop_front();
708 }
709
710 void InsertDtors::visit( ReturnStmt * returnStmt ) {
711 // return exits all scopes, so dump destructors for all scopes
712 for ( OrderedDecls & od : reverseDeclOrder ) {
713 insertDtors( od.begin(), od.end(), back_inserter( stmtsToAdd ) );
714 } // for
715 }
716
717 // Handle break/continue/goto in the same manner as C++. Basic idea: any objects that are in scope at the
718 // BranchStmt but not at the labelled (target) statement must be destructed. If there are any objects in scope
719 // at the target location but not at the BranchStmt then those objects would be uninitialized so notify the user
720 // of the error. See C++ Reference 6.6 Jump Statements for details.
721 void InsertDtors::handleGoto( BranchStmt * stmt ) {
722 assert( stmt->get_target() != "" && "BranchStmt missing a label" );
723 // S_L = lvars = set of objects in scope at label definition
724 // S_G = curVars = set of objects in scope at goto statement
725 ObjectSet & lvars = labelVars[ stmt->get_target() ];
726
727 DTOR_PRINT(
728 std::cerr << "at goto label: " << stmt->get_target().get_name() << std::endl;
729 std::cerr << "S_G = " << printSet( curVars ) << std::endl;
730 std::cerr << "S_L = " << printSet( lvars ) << std::endl;
731 )
732
733 ObjectSet diff;
734 // S_L-S_G results in set of objects whose construction is skipped - it's an error if this set is non-empty
735 std::set_difference( lvars.begin(), lvars.end(), curVars.begin(), curVars.end(), std::inserter( diff, diff.begin() ) );
736 DTOR_PRINT(
737 std::cerr << "S_L-S_G = " << printSet( diff ) << std::endl;
738 )
739 if ( ! diff.empty() ) {
740 throw SemanticError( std::string("jump to label '") + stmt->get_target().get_name() + "' crosses initialization of " + (*diff.begin())->get_name() + " ", stmt );
741 } // if
742 // S_G-S_L results in set of objects that must be destructed
743 diff.clear();
744 std::set_difference( curVars.begin(), curVars.end(), lvars.begin(), lvars.end(), std::inserter( diff, diff.end() ) );
745 DTOR_PRINT(
746 std::cerr << "S_G-S_L = " << printSet( diff ) << std::endl;
747 )
748 if ( ! diff.empty() ) {
749 // go through decl ordered list of objectdecl. for each element that occurs in diff, output destructor
750 OrderedDecls ordered;
751 for ( OrderedDecls & rdo : reverseDeclOrder ) {
752 // add elements from reverseDeclOrder into ordered if they occur in diff - it is key that this happens in reverse declaration order.
753 copy_if( rdo.begin(), rdo.end(), back_inserter( ordered ), [&]( ObjectDecl * objDecl ) { return diff.count( objDecl ); } );
754 } // for
755 insertDtors( ordered.begin(), ordered.end(), back_inserter( stmtsToAdd ) );
756 } // if
757 }
758
759 void InsertDtors::visit( BranchStmt * stmt ) {
760 switch( stmt->get_type() ) {
761 case BranchStmt::Continue:
762 case BranchStmt::Break:
763 // could optimize the break/continue case, because the S_L-S_G check is unnecessary (this set should
764 // always be empty), but it serves as a small sanity check.
765 case BranchStmt::Goto:
766 handleGoto( stmt );
767 break;
768 default:
769 assert( false );
770 } // switch
771 }
772
773 bool checkWarnings( FunctionDecl * funcDecl ) {
774 // only check for warnings if the current function is a user-defined
775 // constructor or destructor
776 if ( ! funcDecl ) return false;
777 if ( ! funcDecl->get_statements() ) return false;
778 return isCtorDtor( funcDecl->get_name() ) && ! LinkageSpec::isOverridable( funcDecl->get_linkage() );
779 }
780
781 void GenStructMemberCalls::visit( FunctionDecl * funcDecl ) {
782 ValueGuard< FunctionDecl * > oldFunction( funcDecl );
783 ValueGuard< std::set< DeclarationWithType * > > oldUnhandled( unhandled );
784 ValueGuard< std::set< DeclarationWithType * > > oldUsedUninit( usedUninit );
785 ValueGuard< ObjectDecl * > oldThisParam( thisParam );
786 ValueGuard< bool > oldIsCtor( isCtor );
787 ValueGuard< StructDecl * > oldStructDecl( structDecl );
788
789 // need to start with fresh sets
790 unhandled.clear();
791 usedUninit.clear();
792
793 function = funcDecl;
794 isCtor = isConstructor( function->get_name() );
795 if ( checkWarnings( function ) ) {
796 FunctionType * type = function->get_functionType();
797 assert( ! type->get_parameters().empty() );
798 thisParam = safe_dynamic_cast< ObjectDecl * >( type->get_parameters().front() );
799 PointerType * ptrType = safe_dynamic_cast< PointerType * > ( thisParam->get_type() );
800 StructInstType * structType = dynamic_cast< StructInstType * >( ptrType->get_base() );
801 if ( structType ) {
802 structDecl = structType->get_baseStruct();
803 for ( Declaration * member : structDecl->get_members() ) {
804 if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( member ) ) {
805 // record all of the struct type's members that need to be constructed or
806 // destructed by the end of the function
807 unhandled.insert( field );
808 }
809 }
810 }
811 }
812 Parent::visit( function );
813
814 // remove the unhandled objects from usedUninit, because a call is inserted
815 // to handle them - only objects that are later constructed are used uninitialized.
816 std::set< DeclarationWithType * > diff;
817 std::set_difference( usedUninit.begin(), usedUninit.end(), unhandled.begin(), unhandled.end(), std::inserter( diff, diff.begin() ) );
818 for ( DeclarationWithType * member : diff ) {
819 emit( "in ", CodeGen::genType( function->get_functionType(), function->get_name(), false ), ", field ", member->get_name(), " used before being constructed" );
820 }
821
822 if ( ! unhandled.empty() ) {
823 // need to explicitly re-add function parameters in order to resolve copy constructors
824 enterScope();
825 maybeAccept( function->get_functionType(), *this );
826
827 // need to iterate through members in reverse in order for
828 // ctor/dtor statements to come out in the right order
829 for ( Declaration * member : reverseIterate( structDecl->get_members() ) ) {
830 DeclarationWithType * field = dynamic_cast< DeclarationWithType * >( member );
831 // skip non-DWT members
832 if ( ! field ) continue;
833 // skip handled members
834 if ( ! unhandled.count( field ) ) continue;
835
836 // insert and resolve default/copy constructor call for each field that's unhandled
837 std::list< Statement * > stmt;
838 UntypedExpr * deref = new UntypedExpr( new NameExpr( "*?" ) );
839 deref->get_args().push_back( new VariableExpr( thisParam ) );
840
841 Expression * arg2 = 0;
842 if ( isCopyConstructor( function ) ) {
843 // if copy ctor, need to pass second-param-of-this-function.field
844 std::list< DeclarationWithType * > & params = function->get_functionType()->get_parameters();
845 assert( params.size() == 2 );
846 arg2 = new MemberExpr( field, new VariableExpr( params.back() ) );
847 }
848 InitExpander srcParam( arg2 );
849 SymTab::genImplicitCall( srcParam, new MemberExpr( field, deref ), function->get_name(), back_inserter( stmt ), field, isCtor );
850
851 assert( stmt.size() <= 1 );
852 if ( stmt.size() == 1 ) {
853 Statement * callStmt = stmt.front();
854
855 MutatingResolver resolver( *this );
856 try {
857 callStmt->acceptMutator( resolver );
858 if ( isCtor ) {
859 function->get_statements()->push_front( callStmt );
860 } else {
861 // destructor statements should be added at the end
862 function->get_statements()->push_back( callStmt );
863 }
864 } catch ( SemanticError & error ) {
865 emit( "in ", CodeGen::genType( function->get_functionType(), function->get_name(), false ), ", field ", field->get_name(), " not explicitly ", isCtor ? "constructed" : "destructed", " and no ", isCtor ? "default constructor" : "destructor", " found" );
866 }
867 }
868 }
869 leaveScope();
870 }
871 }
872
873 void GenStructMemberCalls::visit( ApplicationExpr * appExpr ) {
874 if ( ! checkWarnings( function ) ) return;
875
876 std::string fname = getFunctionName( appExpr );
877 if ( fname == function->get_name() ) {
878 // call to same kind of function
879 Expression * firstParam = appExpr->get_args().front();
880
881 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( firstParam ) ) {
882 // if calling another constructor on thisParam, assume that function handles
883 // all members - if it doesn't a warning will appear in that function.
884 if ( varExpr->get_var() == thisParam ) {
885 unhandled.clear();
886 }
887 } else {
888 // if first parameter is a member expression then
889 // remove the member from unhandled set.
890 handleFirstParam( firstParam );
891 }
892 }
893
894 Parent::visit( appExpr );
895 }
896
897 void GenStructMemberCalls::handleFirstParam( Expression * firstParam ) {
898 using namespace std;
899 if ( AddressExpr * addrExpr = dynamic_cast< AddressExpr * >( firstParam ) ) {
900 if ( MemberExpr * memberExpr = dynamic_cast< MemberExpr * >( addrExpr->get_arg() ) ) {
901 if ( ApplicationExpr * deref = dynamic_cast< ApplicationExpr * >( memberExpr->get_aggregate() ) ) {
902 if ( getFunctionName( deref ) == "*?" && deref->get_args().size() == 1 ) {
903 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( deref->get_args().front() ) ) {
904 if ( varExpr->get_var() == thisParam ) {
905 unhandled.erase( memberExpr->get_member() );
906 }
907 }
908 }
909 }
910 }
911 }
912 }
913
914 void GenStructMemberCalls::visit( MemberExpr * memberExpr ) {
915 if ( ! checkWarnings( function ) ) return;
916 if ( ! isCtor ) return;
917
918 if ( ApplicationExpr * deref = dynamic_cast< ApplicationExpr * >( memberExpr->get_aggregate() ) ) {
919 if ( getFunctionName( deref ) == "*?" && deref->get_args().size() == 1 ) {
920 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( deref->get_args().front() ) ) {
921 if ( varExpr->get_var() == thisParam ) {
922 if ( unhandled.count( memberExpr->get_member() ) ) {
923 // emit a warning because a member was used before it was constructed
924 usedUninit.insert( memberExpr->get_member() );
925 }
926 }
927 }
928 }
929 }
930 Parent::visit( memberExpr );
931 }
932
933 template< typename Visitor, typename... Params >
934 void error( Visitor & v, const Params &... params ) {
935 v.errors.append( toString( params... ) );
936 }
937
938 template< typename... Params >
939 void GenStructMemberCalls::emit( const Params &... params ) {
940 // toggle warnings vs. errors here.
941 // warn( params... );
942 error( *this, params... );
943 }
944
945 DeclarationWithType * MutatingResolver::mutate( ObjectDecl *objectDecl ) {
946 // add object to the indexer assumes that there will be no name collisions
947 // in generated code. If this changes, add mutate methods for entities with
948 // scope and call {enter,leave}Scope explicitly.
949 objectDecl->accept( indexer );
950 return objectDecl;
951 }
952
953 Expression* MutatingResolver::mutate( UntypedExpr *untypedExpr ) {
954 return safe_dynamic_cast< ApplicationExpr * >( ResolvExpr::findVoidExpression( untypedExpr, indexer ) );
955 }
956
957 Expression * FixCtorExprs::mutate( ConstructorExpr * ctorExpr ) {
958 static UniqueName tempNamer( "_tmp_ctor_expr" );
959 assert( ctorExpr->has_result() && ctorExpr->get_result()->size() == 1 );
960 ObjectDecl * tmp = new ObjectDecl( tempNamer.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, nullptr, ctorExpr->get_result()->clone(), nullptr );
961 addDeclaration( tmp );
962
963 ApplicationExpr * callExpr = safe_dynamic_cast< ApplicationExpr * > ( ctorExpr->get_callExpr() );
964 TypeSubstitution * env = ctorExpr->get_env();
965 ctorExpr->set_callExpr( nullptr );
966 ctorExpr->set_env( nullptr );
967
968 Expression *& firstArg = callExpr->get_args().front();
969 UntypedExpr * assign = new UntypedExpr( new NameExpr( "?=?" ) );
970 assign->get_args().push_back( new VariableExpr( tmp ) );
971 assign->get_args().push_back( firstArg );
972 assign->set_result( ctorExpr->get_result()->clone() );
973 firstArg = assign;
974
975 CommaExpr * commaExpr = new CommaExpr( callExpr, new VariableExpr( tmp ) );
976 commaExpr->set_env( env );
977 delete ctorExpr;
978 return commaExpr;
979 }
980 } // namespace
981} // namespace InitTweak
982
983// Local Variables: //
984// tab-width: 4 //
985// mode: c++ //
986// compile-command: "make install" //
987// End: //
Note: See TracBrowser for help on using the repository browser.