source: src/InitTweak/FixInitNew.cpp@ b2e0df3

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since b2e0df3 was 7d651a66, checked in by Fangren Yu <f37yu@…>, 5 years ago

fix static init crash

  • Property mode set to 100644
File size: 58.1 KB
Line 
1#include "FixInit.h"
2
3#include <stddef.h> // for NULL
4#include <algorithm> // for set_difference, copy_if
5#include <cassert> // for assert, strict_dynamic_cast
6#include <iostream> // for operator<<, ostream, basic_ost...
7#include <iterator> // for insert_iterator, back_inserter
8#include <list> // for _List_iterator, list, list<>::...
9#include <map> // for _Rb_tree_iterator, _Rb_tree_co...
10#include <memory> // for allocator_traits<>::value_type
11#include <set> // for set, set<>::value_type
12#include <unordered_map> // for unordered_map, unordered_map<>...
13#include <unordered_set> // for unordered_set
14#include <utility> // for pair
15
16#include "CodeGen/GenType.h" // for genPrettyType
17#include "CodeGen/OperatorTable.h"
18#include "Common/PassVisitor.h" // for PassVisitor, WithStmtsToAdd
19#include "Common/SemanticError.h" // for SemanticError
20#include "Common/UniqueName.h" // for UniqueName
21#include "Common/utility.h" // for CodeLocation, ValueGuard, toSt...
22#include "FixGlobalInit.h" // for fixGlobalInit
23#include "GenInit.h" // for genCtorDtor
24#include "GenPoly/GenPoly.h" // for getFunctionType
25#include "InitTweak.h" // for getFunctionName, getCallArg
26#include "ResolvExpr/Resolver.h" // for findVoidExpression
27#include "ResolvExpr/typeops.h" // for typesCompatible
28#include "SymTab/Autogen.h" // for genImplicitCall
29#include "SymTab/Indexer.h" // for Indexer
30#include "SymTab/Mangler.h" // for Mangler
31#include "SynTree/LinkageSpec.h" // for C, Spec, Cforall, isBuiltin
32#include "SynTree/Attribute.h" // for Attribute
33#include "SynTree/Constant.h" // for Constant
34#include "SynTree/Declaration.h" // for ObjectDecl, FunctionDecl, Decl...
35#include "SynTree/Expression.h" // for UniqueExpr, VariableExpr, Unty...
36#include "SynTree/Initializer.h" // for ConstructorInit, SingleInit
37#include "SynTree/Label.h" // for Label, operator<
38#include "SynTree/Mutator.h" // for mutateAll, Mutator, maybeMutate
39#include "SynTree/Statement.h" // for ExprStmt, CompoundStmt, Branch...
40#include "SynTree/Type.h" // for Type, Type::StorageClasses
41#include "SynTree/TypeSubstitution.h" // for TypeSubstitution, operator<<
42#include "SynTree/DeclReplacer.h" // for DeclReplacer
43#include "SynTree/Visitor.h" // for acceptAll, maybeAccept
44#include "Validate/FindSpecialDecls.h" // for dtorStmt, dtorStructDestroy
45
46#include "AST/Expr.hpp"
47#include "AST/Node.hpp"
48#include "AST/Pass.hpp"
49#include "AST/Print.hpp"
50#include "AST/SymbolTable.hpp"
51#include "AST/Type.hpp"
52#include "AST/DeclReplacer.hpp"
53
54extern bool ctordtorp; // print all debug
55extern bool ctorp; // print ctor debug
56extern bool cpctorp; // print copy ctor debug
57extern bool dtorp; // print dtor debug
58#define PRINT( text ) if ( ctordtorp ) { text }
59#define CP_CTOR_PRINT( text ) if ( ctordtorp || cpctorp ) { text }
60#define DTOR_PRINT( text ) if ( ctordtorp || dtorp ) { text }
61
62namespace InitTweak {
63namespace {
64 struct SelfAssignChecker {
65 void previsit( const ast::ApplicationExpr * appExpr );
66 };
67
68 struct StmtExprResult {
69 const ast::StmtExpr * previsit( const ast::StmtExpr * stmtExpr );
70 };
71
72 /// wrap function application expressions as ImplicitCopyCtorExpr nodes so that it is easy to identify which
73 /// function calls need their parameters to be copy constructed
74 struct InsertImplicitCalls : public ast::WithConstTypeSubstitution, public ast::WithShortCircuiting {
75 const ast::Expr * postvisit( const ast::ApplicationExpr * appExpr );
76
77 // only handles each UniqueExpr once
78 // if order of visit does not change, this should be safe
79 void previsit (const ast::UniqueExpr *);
80
81 std::unordered_set<decltype(ast::UniqueExpr::id)> visitedIds;
82 };
83
84 /// generate temporary ObjectDecls for each argument and return value of each ImplicitCopyCtorExpr,
85 /// generate/resolve copy construction expressions for each, and generate/resolve destructors for both
86 /// arguments and return value temporaries
87 struct ResolveCopyCtors final : public ast::WithGuards, public ast::WithStmtsToAdd<>, public ast::WithSymbolTable, public ast::WithShortCircuiting, public ast::WithVisitorRef<ResolveCopyCtors> {
88 const ast::Expr * postvisit( const ast::ImplicitCopyCtorExpr * impCpCtorExpr );
89 const ast::StmtExpr * previsit( const ast::StmtExpr * stmtExpr );
90 const ast::UniqueExpr * previsit( const ast::UniqueExpr * unqExpr );
91
92 /// handles distant mutations of environment manually.
93 /// WithConstTypeSubstitution cannot remember where the environment is from
94
95 /// MUST be called at start of overload previsit
96 void previsit( const ast::Expr * expr);
97 /// MUST be called at return of overload postvisit
98 const ast::Expr * postvisit(const ast::Expr * expr);
99
100 /// create and resolve ctor/dtor expression: fname(var, [cpArg])
101 const ast::Expr * makeCtorDtor( const std::string & fname, const ast::ObjectDecl * var, const ast::Expr * cpArg = nullptr );
102 /// true if type does not need to be copy constructed to ensure correctness
103 bool skipCopyConstruct( const ast::Type * type );
104 ast::ptr< ast::Expr > copyConstructArg( const ast::Expr * arg, const ast::ImplicitCopyCtorExpr * impCpCtorExpr, const ast::Type * formal );
105 ast::Expr * destructRet( const ast::ObjectDecl * ret, const ast::Expr * arg );
106 private:
107 /// hack to implement WithTypeSubstitution while conforming to mutation safety.
108 ast::TypeSubstitution * env;
109 bool envModified;
110 };
111
112 /// collects constructed object decls - used as a base class
113 struct ObjDeclCollector : public ast::WithGuards, public ast::WithShortCircuiting {
114 // use ordered data structure to maintain ordering for set_difference and for consistent error messages
115 typedef std::list< const ast::ObjectDecl * > ObjectSet;
116 void previsit( const ast::CompoundStmt *compoundStmt );
117 void previsit( const ast::DeclStmt *stmt );
118
119 // don't go into other functions
120 void previsit( const ast::FunctionDecl * ) { visit_children = false; }
121
122 protected:
123 ObjectSet curVars;
124 };
125
126 // debug
127 template<typename ObjectSet>
128 struct PrintSet {
129 PrintSet( const ObjectSet & objs ) : objs( objs ) {}
130 const ObjectSet & objs;
131 };
132 template<typename ObjectSet>
133 PrintSet<ObjectSet> printSet( const ObjectSet & objs ) { return PrintSet<ObjectSet>( objs ); }
134 template<typename ObjectSet>
135 std::ostream & operator<<( std::ostream & out, const PrintSet<ObjectSet> & set) {
136 out << "{ ";
137 for ( auto & obj : set.objs ) {
138 out << obj->name << ", " ;
139 } // for
140 out << " }";
141 return out;
142 }
143
144 struct LabelFinder final : public ObjDeclCollector {
145 typedef std::map< std::string, ObjectSet > LabelMap;
146 // map of Label -> live variables at that label
147 LabelMap vars;
148
149 typedef ObjDeclCollector Parent;
150 using Parent::previsit;
151 void previsit( const ast::Stmt * stmt );
152
153 void previsit( const ast::CompoundStmt *compoundStmt );
154 void previsit( const ast::DeclStmt *stmt );
155 };
156
157 /// insert destructor calls at the appropriate places. must happen before CtorInit nodes are removed
158 /// (currently by FixInit)
159 struct InsertDtors final : public ObjDeclCollector, public ast::WithStmtsToAdd<> {
160 typedef std::list< ObjectDecl * > OrderedDecls;
161 typedef std::list< OrderedDecls > OrderedDeclsStack;
162
163 InsertDtors( ast::Pass<LabelFinder> & finder ) : finder( finder ), labelVars( finder.core.vars ) {}
164
165 typedef ObjDeclCollector Parent;
166 using Parent::previsit;
167
168 void previsit( const ast::FunctionDecl * funcDecl );
169
170 void previsit( const ast::BranchStmt * stmt );
171 private:
172 void handleGoto( const ast::BranchStmt * stmt );
173
174 ast::Pass<LabelFinder> & finder;
175 LabelFinder::LabelMap & labelVars;
176 OrderedDeclsStack reverseDeclOrder;
177 };
178
179 /// expand each object declaration to use its constructor after it is declared.
180 struct FixInit : public ast::WithStmtsToAdd<> {
181 static void fixInitializers( ast::TranslationUnit &translationUnit );
182
183 const ast::DeclWithType * postvisit( const ast::ObjectDecl *objDecl );
184
185 std::list< ast::ptr< ast::Decl > > staticDtorDecls;
186 };
187
188 /// generate default/copy ctor and dtor calls for user-defined struct ctor/dtors
189 /// for any member that is missing a corresponding ctor/dtor call.
190 /// error if a member is used before constructed
191 struct GenStructMemberCalls final : public ast::WithGuards, public ast::WithShortCircuiting, public ast::WithSymbolTable, public ast::WithVisitorRef<GenStructMemberCalls> {
192 void previsit( const ast::FunctionDecl * funcDecl );
193 const ast::DeclWithType * postvisit( const ast::FunctionDecl * funcDecl );
194
195 void previsit( const ast::MemberExpr * memberExpr );
196 void previsit( const ast::ApplicationExpr * appExpr );
197
198 /// Note: this post mutate used to be in a separate visitor. If this pass breaks, one place to examine is whether it is
199 /// okay for this part of the recursion to occur alongside the rest.
200 const ast::Expr * postvisit( const ast::UntypedExpr * expr );
201
202 SemanticErrorException errors;
203 private:
204 template< typename... Params >
205 void emit( CodeLocation, const Params &... params );
206
207 ast::FunctionDecl * function = nullptr;
208 std::set< const ast::DeclWithType * > unhandled;
209 std::map< const ast::DeclWithType *, CodeLocation > usedUninit;
210 const ast::ObjectDecl * thisParam = nullptr;
211 bool isCtor = false; // true if current function is a constructor
212 const ast::StructDecl * structDecl = nullptr;
213 };
214
215 /// expands ConstructorExpr nodes into comma expressions, using a temporary for the first argument
216 struct FixCtorExprs final : public ast::WithDeclsToAdd<>, public ast::WithSymbolTable, public ast::WithShortCircuiting {
217 const ast::Expr * postvisit( const ast::ConstructorExpr * ctorExpr );
218 };
219
220 /// add CompoundStmts around top-level expressions so that temporaries are destroyed in the correct places.
221 struct SplitExpressions : public ast::WithShortCircuiting {
222 ast::Stmt * postvisit( const ast::ExprStmt * stmt );
223 void previsit( const ast::TupleAssignExpr * expr );
224 };
225} // namespace
226
227void fix( ast::TranslationUnit & translationUnit, bool inLibrary ) {
228 ast::Pass<SelfAssignChecker>::run( translationUnit );
229
230 // fixes StmtExpr to properly link to their resulting expression
231 ast::Pass<StmtExprResult>::run( translationUnit );
232
233 // fixes ConstructorInit for global variables. should happen before fixInitializers.
234 InitTweak::fixGlobalInit( translationUnit, inLibrary );
235
236 // must happen before ResolveCopyCtors because temporaries have to be inserted into the correct scope
237 ast::Pass<SplitExpressions>::run( translationUnit );
238
239 ast::Pass<InsertImplicitCalls>::run( translationUnit );
240
241 // Needs to happen before ResolveCopyCtors, because argument/return temporaries should not be considered in
242 // error checking branch statements
243 {
244 ast::Pass<LabelFinder> finder;
245 ast::Pass<InsertDtors>::run( translationUnit, finder );
246 }
247
248 ast::Pass<ResolveCopyCtors>::run( translationUnit );
249 FixInit::fixInitializers( translationUnit );
250 ast::Pass<GenStructMemberCalls>::run( translationUnit );
251
252 // Needs to happen after GenStructMemberCalls, since otherwise member constructors exprs
253 // don't have the correct form, and a member can be constructed more than once.
254 ast::Pass<FixCtorExprs>::run( translationUnit );
255}
256
257namespace {
258 /// find and return the destructor used in `input`. If `input` is not a simple destructor call, generate a thunk
259 /// that wraps the destructor, insert it into `stmtsToAdd` and return the new function declaration
260 const ast::DeclWithType * getDtorFunc( const ast::ObjectDecl * objDecl, const ast::Stmt * input, std::list< ast::ptr<ast::Stmt> > & stmtsToAdd ) {
261 const CodeLocation loc = input->location;
262 // unwrap implicit statement wrapper
263 // Statement * dtor = input;
264 assert( input );
265 // std::list< const ast::Expr * > matches;
266 auto matches = collectCtorDtorCalls( input );
267
268 if ( dynamic_cast< const ast::ExprStmt * >( input ) ) {
269 // only one destructor call in the expression
270 if ( matches.size() == 1 ) {
271 auto func = getFunction( matches.front() );
272 assertf( func, "getFunction failed to find function in %s", toString( matches.front() ).c_str() );
273
274 // cleanup argument must be a function, not an object (including function pointer)
275 if ( auto dtorFunc = dynamic_cast< const ast::FunctionDecl * > ( func ) ) {
276 if ( dtorFunc->type->forall.empty() ) {
277 // simple case where the destructor is a monomorphic function call - can simply
278 // use that function as the cleanup function.
279 return func;
280 }
281 }
282 }
283 }
284
285 // otherwise the cleanup is more complicated - need to build a single argument cleanup function that
286 // wraps the more complicated code.
287 static UniqueName dtorNamer( "__cleanup_dtor" );
288 std::string name = dtorNamer.newName();
289 ast::FunctionDecl * dtorFunc = SymTab::genDefaultFunc( loc, name, objDecl->type->stripReferences(), false );
290 stmtsToAdd.push_back( new ast::DeclStmt(loc, dtorFunc ) );
291
292 // the original code contains uses of objDecl - replace them with the newly generated 'this' parameter.
293 const ast::ObjectDecl * thisParam = getParamThis( dtorFunc );
294 const ast::Expr * replacement = new ast::VariableExpr( loc, thisParam );
295
296 auto base = replacement->result->stripReferences();
297 if ( dynamic_cast< const ast::ArrayType * >( base ) || dynamic_cast< const ast::TupleType * > ( base ) ) {
298 // need to cast away reference for array types, since the destructor is generated without the reference type,
299 // and for tuple types since tuple indexing does not work directly on a reference
300 replacement = new ast::CastExpr( replacement, base );
301 }
302 auto dtor = ast::DeclReplacer::replace( input, ast::DeclReplacer::ExprMap{ std::make_pair( objDecl, replacement ) } );
303 auto mutStmts = dtorFunc->stmts.get_and_mutate();
304 mutStmts->push_back(strict_dynamic_cast<const ast::Stmt *>( dtor ));
305 dtorFunc->stmts = mutStmts;
306
307 return dtorFunc;
308 }
309
310 void FixInit::fixInitializers( ast::TranslationUnit & translationUnit ) {
311 ast::Pass<FixInit> fixer;
312
313 // can't use mutateAll, because need to insert declarations at top-level
314 // can't use DeclMutator, because sometimes need to insert IfStmt, etc.
315 SemanticErrorException errors;
316 for ( auto i = translationUnit.decls.begin(); i != translationUnit.decls.end(); ++i ) {
317 try {
318 // maybeAccept( *i, fixer ); translationUnit should never contain null
319 *i = (*i)->accept(fixer);
320 translationUnit.decls.splice( i, fixer.core.staticDtorDecls );
321 } catch( SemanticErrorException &e ) {
322 errors.append( e );
323 } // try
324 } // for
325 if ( ! errors.isEmpty() ) {
326 throw errors;
327 } // if
328 }
329
330 const ast::StmtExpr * StmtExprResult::previsit( const ast::StmtExpr * stmtExpr ) {
331 // we might loose the result expression here so add a pointer to trace back
332 assert( stmtExpr->result );
333 const ast::Type * result = stmtExpr->result;
334 if ( ! result->isVoid() ) {
335 auto mutExpr = mutate(stmtExpr);
336 const ast::CompoundStmt * body = mutExpr->stmts;
337 assert( ! body->kids.empty() );
338 mutExpr->resultExpr = body->kids.back().strict_as<ast::ExprStmt>();
339 return mutExpr;
340 }
341 return stmtExpr;
342 }
343
344 ast::Stmt * SplitExpressions::postvisit( const ast::ExprStmt * stmt ) {
345 // wrap each top-level ExprStmt in a block so that destructors for argument and return temporaries are destroyed
346 // in the correct places
347 ast::CompoundStmt * ret = new ast::CompoundStmt( stmt->location, { stmt } );
348 return ret;
349 }
350
351 void SplitExpressions::previsit( const ast::TupleAssignExpr * ) {
352 // don't do this within TupleAssignExpr, since it is already broken up into multiple expressions
353 visit_children = false;
354 }
355
356 // Relatively simple structural comparison for expressions, needed to determine
357 // if two expressions are "the same" (used to determine if self assignment occurs)
358 struct StructuralChecker {
359 // Strip all casts and then dynamic_cast.
360 template<typename T>
361 static const T * cast( const ast::Expr * expr ) {
362 // this might be too permissive. It's possible that only particular casts are relevant.
363 while ( auto cast = dynamic_cast< const ast::CastExpr * >( expr ) ) {
364 expr = cast->arg;
365 }
366 return dynamic_cast< const T * >( expr );
367 }
368
369 void previsit( const ast::Expr * ) {
370 // anything else does not qualify
371 result = false;
372 }
373
374 // ignore casts
375 void previsit( const ast::CastExpr * ) {}
376
377 void previsit( const ast::MemberExpr * memExpr ) {
378 if ( auto otherMember = cast< ast::MemberExpr >( other ) ) {
379 if ( otherMember->member == memExpr->member ) {
380 other = otherMember->aggregate;
381 return;
382 }
383 }
384 result = false;
385 }
386
387 void previsit( const ast::VariableExpr * varExpr ) {
388 if ( auto otherVar = cast< ast::VariableExpr >( other ) ) {
389 if ( otherVar->var == varExpr->var ) {
390 return;
391 }
392 }
393 result = false;
394 }
395
396 void previsit( const ast::AddressExpr * ) {
397 if ( auto addrExpr = cast< ast::AddressExpr >( other ) ) {
398 other = addrExpr->arg;
399 return;
400 }
401 result = false;
402 }
403
404 const ast::Expr * other;
405 bool result = true;
406 StructuralChecker( const ast::Expr * other ) : other(other) {}
407 };
408
409 bool structurallySimilar( const ast::Expr * e1, const ast::Expr * e2 ) {
410 return ast::Pass<StructuralChecker>::read( e1, e2 );
411 }
412
413 void SelfAssignChecker::previsit( const ast::ApplicationExpr * appExpr ) {
414 auto function = getFunction( appExpr );
415 if ( function->name == "?=?" ) { // doesn't use isAssignment, because ?+=?, etc. should not count as self-assignment
416 if ( appExpr->args.size() == 2 ) {
417 // check for structural similarity (same variable use, ignore casts, etc. - but does not look too deeply, anything looking like a function is off limits)
418 if ( structurallySimilar( appExpr->args.front(), appExpr->args.back() ) ) {
419 SemanticWarning( appExpr->location, Warning::SelfAssignment, toCString( appExpr->args.front() ) );
420 }
421 }
422 }
423 }
424
425 const ast::Expr * InsertImplicitCalls::postvisit( const ast::ApplicationExpr * appExpr ) {
426 if ( auto function = appExpr->func.as<ast::VariableExpr>() ) {
427 if ( function->var->linkage.is_builtin ) {
428 // optimization: don't need to copy construct in order to call intrinsic functions
429 return appExpr;
430 } else if ( auto funcDecl = function->var.as<ast::DeclWithType>() ) {
431 auto ftype = dynamic_cast< const ast::FunctionType * >( GenPoly::getFunctionType( funcDecl->get_type() ) );
432 assertf( ftype, "Function call without function type: %s", toString( funcDecl ).c_str() );
433 if ( CodeGen::isConstructor( funcDecl->name ) && ftype->params.size() == 2 ) {
434 auto t1 = getPointerBase( ftype->params.front() );
435 auto t2 = ftype->params.back();
436 assert( t1 );
437
438 if ( ResolvExpr::typesCompatible( t1, t2 ) ) {
439 // optimization: don't need to copy construct in order to call a copy constructor
440 return appExpr;
441 } // if
442 } else if ( CodeGen::isDestructor( funcDecl->name ) ) {
443 // correctness: never copy construct arguments to a destructor
444 return appExpr;
445 } // if
446 } // if
447 } // if
448 CP_CTOR_PRINT( std::cerr << "InsertImplicitCalls: adding a wrapper " << appExpr << std::endl; )
449
450 // wrap each function call so that it is easy to identify nodes that have to be copy constructed
451 ast::ptr<ast::TypeSubstitution> tmp = appExpr->env;
452 auto mutExpr = mutate(appExpr);
453 mutExpr->env = nullptr;
454
455 auto expr = new ast::ImplicitCopyCtorExpr( appExpr->location, mutExpr );
456 // Move the type substitution to the new top-level, if it is attached to the appExpr.
457 // Ensure it is not deleted with the ImplicitCopyCtorExpr by removing it before deletion.
458 // The substitution is needed to obtain the type of temporary variables so that copy constructor
459 // calls can be resolved.
460 assert( typeSubs );
461 // assert (mutExpr->env);
462 expr->env = tmp;
463 // mutExpr->env = nullptr;
464 //std::swap( expr->env, appExpr->env );
465 return expr;
466 }
467
468 void ResolveCopyCtors::previsit(const ast::Expr * expr) {
469 if (expr->env) {
470 GuardValue(env);
471 GuardValue(envModified);
472 env = expr->env->clone();
473 envModified = false;
474 }
475 }
476
477 const ast::Expr * ResolveCopyCtors::postvisit(const ast::Expr * expr) {
478 if (expr->env) {
479 if (envModified) {
480 auto mutExpr = mutate(expr);
481 mutExpr->env = env;
482 return mutExpr;
483 }
484 else {
485 // env was not mutated, skip and delete the shallow copy
486 delete env;
487 return expr;
488 }
489 }
490 else {
491 return expr;
492 }
493 }
494
495 bool ResolveCopyCtors::skipCopyConstruct( const ast::Type * type ) { return ! isConstructable( type ); }
496
497 const ast::Expr * ResolveCopyCtors::makeCtorDtor( const std::string & fname, const ast::ObjectDecl * var, const ast::Expr * cpArg ) {
498 assert( var );
499 assert (var->isManaged());
500 assert (!cpArg || cpArg->isManaged());
501 // arrays are not copy constructed, so this should always be an ExprStmt
502 ast::ptr< ast::Stmt > stmt = genCtorDtor(var->location, fname, var, cpArg );
503 assertf( stmt, "ResolveCopyCtors: genCtorDtor returned nullptr: %s / %s / %s", fname.c_str(), toString( var ).c_str(), toString( cpArg ).c_str() );
504 auto exprStmt = stmt.strict_as<ast::ImplicitCtorDtorStmt>()->callStmt.strict_as<ast::ExprStmt>();
505 ast::ptr<ast::Expr> untyped = exprStmt->expr; // take ownership of expr
506 // exprStmt->expr = nullptr;
507
508 // resolve copy constructor
509 // should only be one alternative for copy ctor and dtor expressions, since all arguments are fixed
510 // (VariableExpr and already resolved expression)
511 CP_CTOR_PRINT( std::cerr << "ResolvingCtorDtor " << untyped << std::endl; )
512 ast::ptr<ast::Expr> resolved = ResolvExpr::findVoidExpression(untyped, symtab);
513 assert( resolved );
514 if ( resolved->env ) {
515 // Extract useful information and discard new environments. Keeping them causes problems in PolyMutator passes.
516 env->add( *resolved->env );
517 envModified = true;
518 // delete resolved->env;
519 auto mut = mutate(resolved.get());
520 assertf(mut == resolved.get(), "newly resolved expression must be unique");
521 mut->env = nullptr;
522 } // if
523 // delete stmt;
524 if ( auto assign = resolved.as<ast::TupleAssignExpr>() ) {
525 // fix newly generated StmtExpr
526 previsit( assign->stmtExpr );
527 }
528 return resolved.release();
529 }
530
531 ast::ptr<ast::Expr> ResolveCopyCtors::copyConstructArg(
532 const ast::Expr * arg, const ast::ImplicitCopyCtorExpr * impCpCtorExpr, const ast::Type * formal )
533 {
534 static UniqueName tempNamer("_tmp_cp");
535 assert( env );
536 const CodeLocation loc = impCpCtorExpr->location;
537 // CP_CTOR_PRINT( std::cerr << "Type Substitution: " << *env << std::endl; )
538 assert( arg->result );
539 ast::ptr<ast::Type> result = arg->result;
540 if ( skipCopyConstruct( result ) ) return arg; // skip certain non-copyable types
541
542 // type may involve type variables, so apply type substitution to get temporary variable's actual type,
543 // since result type may not be substituted (e.g., if the type does not appear in the parameter list)
544 // Use applyFree so that types bound in function pointers are not substituted, e.g. in forall(dtype T) void (*)(T).
545
546 // xxx - this originally mutates arg->result in place. is it correct?
547 result = env->applyFree( result.get() ).node;
548 auto mutResult = result.get_and_mutate();
549 mutResult->set_const(false);
550
551 auto mutArg = mutate(arg);
552 mutArg->result = mutResult;
553
554 ast::ptr<ast::Expr> guard = mutArg;
555
556 ast::ptr<ast::ObjectDecl> tmp = new ast::ObjectDecl({}, "__tmp", mutResult, nullptr );
557
558 // create and resolve copy constructor
559 CP_CTOR_PRINT( std::cerr << "makeCtorDtor for an argument" << std::endl; )
560 auto cpCtor = makeCtorDtor( "?{}", tmp, mutArg );
561
562 if ( auto appExpr = dynamic_cast< const ast::ApplicationExpr * >( cpCtor ) ) {
563 // if the chosen constructor is intrinsic, the copy is unnecessary, so
564 // don't create the temporary and don't call the copy constructor
565 auto function = appExpr->func.strict_as<ast::VariableExpr>();
566 if ( function->var->linkage == ast::Linkage::Intrinsic ) {
567 // arguments that need to be boxed need a temporary regardless of whether the copy constructor is intrinsic,
568 // so that the object isn't changed inside of the polymorphic function
569 if ( ! GenPoly::needsBoxing( formal, result, impCpCtorExpr->callExpr, env ) ) {
570 // xxx - should arg->result be mutated? see comment above.
571 return guard;
572 }
573 }
574 }
575
576 // set a unique name for the temporary once it's certain the call is necessary
577 auto mut = tmp.get_and_mutate();
578 assertf (mut == tmp, "newly created ObjectDecl must be unique");
579 mut->name = tempNamer.newName();
580
581 // replace argument to function call with temporary
582 stmtsToAddBefore.push_back( new ast::DeclStmt(loc, tmp ) );
583 arg = cpCtor;
584 return destructRet( tmp, arg );
585
586 // impCpCtorExpr->dtors.push_front( makeCtorDtor( "^?{}", tmp ) );
587 }
588
589 ast::Expr * ResolveCopyCtors::destructRet( const ast::ObjectDecl * ret, const ast::Expr * arg ) {
590 // TODO: refactor code for generating cleanup attribute, since it's common and reused in ~3-4 places
591 // check for existing cleanup attribute before adding another(?)
592 // need to add __Destructor for _tmp_cp variables as well
593
594 assertf( ast::dtorStruct && ast::dtorStruct->members.size() == 2, "Destructor generation requires __Destructor definition." );
595 assertf( ast::dtorStructDestroy, "Destructor generation requires __destroy_Destructor." );
596
597 const CodeLocation loc = ret->location;
598
599 // generate a __Destructor for ret that calls the destructor
600 auto res = makeCtorDtor( "^?{}", ret );
601 auto dtor = mutate(res);
602
603 // if the chosen destructor is intrinsic, elide the generated dtor handler
604 if ( arg && isIntrinsicCallExpr( dtor ) ) {
605 return new ast::CommaExpr(loc, arg, new ast::VariableExpr(loc, ret ) );
606 // return;
607 }
608
609 if ( ! dtor->env ) dtor->env = maybeClone( env );
610 auto dtorFunc = getDtorFunc( ret, new ast::ExprStmt(loc, dtor ), stmtsToAddBefore );
611
612 auto dtorStructType = new ast::StructInstType(ast::dtorStruct);
613
614 // what does this do???
615 dtorStructType->params.push_back( new ast::TypeExpr(loc, new ast::VoidType() ) );
616
617 // cast destructor pointer to void (*)(void *), to silence GCC incompatible pointer warnings
618 auto dtorFtype = new ast::FunctionType();
619 dtorFtype->params.push_back( new ast::PointerType(new ast::VoidType( ) ) );
620 auto dtorType = new ast::PointerType( dtorFtype );
621
622 static UniqueName namer( "_ret_dtor" );
623 auto retDtor = new ast::ObjectDecl(loc, namer.newName(), dtorStructType, new ast::ListInit(loc, { new ast::SingleInit(loc, ast::ConstantExpr::null(loc) ), new ast::SingleInit(loc, new ast::CastExpr( new ast::VariableExpr(loc, dtorFunc ), dtorType ) ) } ) );
624 retDtor->attributes.push_back( new ast::Attribute( "cleanup", { new ast::VariableExpr(loc, ast::dtorStructDestroy ) } ) );
625 stmtsToAddBefore.push_back( new ast::DeclStmt(loc, retDtor ) );
626
627 if ( arg ) {
628 auto member = new ast::MemberExpr(loc, ast::dtorStruct->members.front().strict_as<ast::DeclWithType>(), new ast::VariableExpr(loc, retDtor ) );
629 auto object = new ast::CastExpr( new ast::AddressExpr( new ast::VariableExpr(loc, ret ) ), new ast::PointerType(new ast::VoidType() ) );
630 ast::Expr * assign = createBitwiseAssignment( member, object );
631 return new ast::CommaExpr(loc, new ast::CommaExpr(loc, arg, assign ), new ast::VariableExpr(loc, ret ) );
632 }
633 return nullptr;
634 // impCpCtorExpr->get_dtors().push_front( makeCtorDtor( "^?{}", ret ) );
635 }
636
637 const ast::Expr * ResolveCopyCtors::postvisit( const ast::ImplicitCopyCtorExpr *impCpCtorExpr ) {
638 CP_CTOR_PRINT( std::cerr << "ResolveCopyCtors: " << impCpCtorExpr << std::endl; )
639
640 ast::ApplicationExpr * appExpr = mutate(impCpCtorExpr->callExpr.get());
641 const ast::ObjectDecl * returnDecl = nullptr;
642 const CodeLocation loc = appExpr->location;
643
644 // take each argument and attempt to copy construct it.
645 auto ftype = GenPoly::getFunctionType( appExpr->func->result );
646 assert( ftype );
647 auto & params = ftype->params;
648 auto iter = params.begin();
649 for ( auto & arg : appExpr->args ) {
650 const ast::Type * formal = nullptr;
651 if ( iter != params.end() ) { // does not copy construct C-style variadic arguments
652 // DeclarationWithType * param = *iter++;
653 formal = *iter++;
654 }
655
656 arg = copyConstructArg( arg, impCpCtorExpr, formal );
657 } // for
658
659 // each return value from the call needs to be connected with an ObjectDecl at the call site, which is
660 // initialized with the return value and is destructed later
661 // xxx - handle named return values?
662 const ast::Type * result = appExpr->result;
663 if ( ! result->isVoid() ) {
664 static UniqueName retNamer("_tmp_cp_ret");
665 // result = result->clone();
666 auto subResult = env->apply( result ).node;
667 auto ret = new ast::ObjectDecl(loc, retNamer.newName(), subResult, nullptr );
668 auto mutType = mutate(ret->type.get());
669 mutType->set_const( false );
670 ret->type = mutType;
671 returnDecl = ret;
672 stmtsToAddBefore.push_back( new ast::DeclStmt(loc, ret ) );
673 CP_CTOR_PRINT( std::cerr << "makeCtorDtor for a return" << std::endl; )
674 } // for
675 CP_CTOR_PRINT( std::cerr << "after Resolving: " << impCpCtorExpr << std::endl; )
676 // ------------------------------------------------------
677
678 CP_CTOR_PRINT( std::cerr << "Coming out the back..." << impCpCtorExpr << std::endl; )
679
680 // detach fields from wrapper node so that it can be deleted without deleting too much
681
682 // xxx - actual env might be somewhere else, need to keep invariant
683
684 // deletion of wrapper should be handled by pass template now
685
686 // impCpCtorExpr->callExpr = nullptr;
687 assert (appExpr->env == nullptr);
688 appExpr->env = impCpCtorExpr->env;
689 // std::swap( impCpCtorExpr->env, appExpr->env );
690 // assert( impCpCtorExpr->env == nullptr );
691 // delete impCpCtorExpr;
692
693 if ( returnDecl ) {
694 ast::Expr * assign = createBitwiseAssignment( new ast::VariableExpr(loc, returnDecl ), appExpr );
695 if ( ! dynamic_cast< const ast::ReferenceType * >( result ) ) {
696 // destructing reference returns is bad because it can cause multiple destructor calls to the same object - the returned object is not a temporary
697 assign = destructRet( returnDecl, assign );
698 assert(assign);
699 } else {
700 assign = new ast::CommaExpr(loc, assign, new ast::VariableExpr(loc, returnDecl ) );
701 }
702 // move env from appExpr to retExpr
703 // std::swap( assign->env, appExpr->env );
704 assign->env = appExpr->env;
705 // actual env is handled by common routine that replaces WithTypeSubstitution
706 return postvisit((const ast::Expr *)assign);
707 } else {
708 return postvisit((const ast::Expr *)appExpr);
709 } // if
710 }
711
712 const ast::StmtExpr * ResolveCopyCtors::previsit( const ast::StmtExpr * _stmtExpr ) {
713 // function call temporaries should be placed at statement-level, rather than nested inside of a new statement expression,
714 // since temporaries can be shared across sub-expressions, e.g.
715 // [A, A] f(); // decl
716 // g([A] x, [A] y); // decl
717 // g(f()); // call
718 // f is executed once, so the return temporary is shared across the tuple constructors for x and y.
719 // Explicitly mutating children instead of mutating the inner compound statement forces the temporaries to be added
720 // to the outer context, rather than inside of the statement expression.
721
722 // call the common routine that replaces WithTypeSubstitution
723 previsit((const ast::Expr *) _stmtExpr);
724
725 visit_children = false;
726 const CodeLocation loc = _stmtExpr->location;
727
728 assert( env );
729
730 symtab.enterScope();
731 // visit all statements
732 auto stmtExpr = mutate(_stmtExpr);
733 auto mutStmts = mutate(stmtExpr->stmts.get());
734
735 auto & stmts = mutStmts->kids;
736 for ( auto & stmt : stmts ) {
737 stmt = stmt->accept( *visitor );
738 } // for
739 stmtExpr->stmts = mutStmts;
740 symtab.leaveScope();
741
742 assert( stmtExpr->result );
743 // const ast::Type * result = stmtExpr->result;
744 if ( ! stmtExpr->result->isVoid() ) {
745 static UniqueName retNamer("_tmp_stmtexpr_ret");
746
747 // result = result->clone();
748 auto result = env->apply( stmtExpr->result.get() ).node;
749 if ( ! InitTweak::isConstructable( result ) ) {
750 // delete result;
751 return stmtExpr;
752 }
753 auto mutResult = result.get_and_mutate();
754 mutResult->set_const(false);
755
756 // create variable that will hold the result of the stmt expr
757 auto ret = new ast::ObjectDecl(loc, retNamer.newName(), mutResult, nullptr );
758 stmtsToAddBefore.push_back( new ast::DeclStmt(loc, ret ) );
759
760 assertf(
761 stmtExpr->resultExpr,
762 "Statement-Expression should have a resulting expression at %s:%d",
763 stmtExpr->location.filename.c_str(),
764 stmtExpr->location.first_line
765 );
766
767 const ast::ExprStmt * last = stmtExpr->resultExpr;
768 // xxx - if this is non-unique, need to copy while making resultExpr ref
769 assertf(last->unique(), "attempt to modify weakly shared statement");
770 auto mutLast = mutate(last);
771 // above assertion means in-place mutation is OK
772 try {
773 mutLast->expr = makeCtorDtor( "?{}", ret, mutLast->expr );
774 } catch(...) {
775 std::cerr << "*CFA internal error: ";
776 std::cerr << "can't resolve implicit constructor";
777 std::cerr << " at " << stmtExpr->location.filename;
778 std::cerr << ":" << stmtExpr->location.first_line << std::endl;
779
780 abort();
781 }
782
783 // add destructors after current statement
784 stmtsToAddAfter.push_back( new ast::ExprStmt(loc, makeCtorDtor( "^?{}", ret ) ) );
785
786 // must have a non-empty body, otherwise it wouldn't have a result
787 assert( ! stmts.empty() );
788
789 // if there is a return decl, add a use as the last statement; will not have return decl on non-constructable returns
790 stmts.push_back( new ast::ExprStmt(loc, new ast::VariableExpr(loc, ret ) ) );
791 } // if
792
793 assert( stmtExpr->returnDecls.empty() );
794 assert( stmtExpr->dtors.empty() );
795
796 return stmtExpr;
797 }
798
799 // to prevent warnings ('_unq0' may be used uninitialized in this function),
800 // insert an appropriate zero initializer for UniqueExpr temporaries.
801 ast::Init * makeInit( const ast::Type * t ) {
802 if ( auto inst = dynamic_cast< const ast::StructInstType * >( t ) ) {
803 // initizer for empty struct must be empty
804 if ( inst->base->members.empty() ) return new ast::ListInit({}, {});
805 } else if ( auto inst = dynamic_cast< const ast::UnionInstType * >( t ) ) {
806 // initizer for empty union must be empty
807 if ( inst->base->members.empty() ) return new ast::ListInit({}, {});
808 }
809
810 return new ast::ListInit( {}, { new ast::SingleInit( {}, ast::ConstantExpr::from_int({}, 0) ) } );
811 }
812
813 const ast::UniqueExpr * ResolveCopyCtors::previsit( const ast::UniqueExpr * unqExpr ) {
814 visit_children = false;
815 // xxx - hack to prevent double-handling of unique exprs, otherwise too many temporary variables and destructors are generated
816 static std::unordered_map< int, const ast::UniqueExpr * > unqMap;
817 auto mutExpr = mutate(unqExpr);
818 if ( ! unqMap.count( unqExpr->id ) ) {
819 // resolve expr and find its
820
821 auto impCpCtorExpr = mutExpr->expr.as<ast::ImplicitCopyCtorExpr>();
822 // PassVisitor<ResolveCopyCtors> fixer;
823
824 mutExpr->expr = mutExpr->expr->accept( *visitor );
825 // it should never be necessary to wrap a void-returning expression in a UniqueExpr - if this assumption changes, this needs to be rethought
826 assert( unqExpr->result );
827 if ( impCpCtorExpr ) {
828 auto comma = unqExpr->expr.strict_as<ast::CommaExpr>();
829 auto var = comma->arg2.strict_as<ast::VariableExpr>();
830 // note the variable used as the result from the call
831 mutExpr->var = var;
832 } else {
833 // expr isn't a call expr, so create a new temporary variable to use to hold the value of the unique expression
834 mutExpr->object = new ast::ObjectDecl( mutExpr->location, toString("_unq", mutExpr->id), mutExpr->result, makeInit( mutExpr->result ) );
835 mutExpr->var = new ast::VariableExpr( mutExpr->location, mutExpr->object );
836 }
837
838 // stmtsToAddBefore.splice( stmtsToAddBefore.end(), fixer.pass.stmtsToAddBefore );
839 // stmtsToAddAfter.splice( stmtsToAddAfter.end(), fixer.pass.stmtsToAddAfter );
840 unqMap[mutExpr->id] = mutExpr;
841 } else {
842 // take data from other UniqueExpr to ensure consistency
843 // delete unqExpr->get_expr();
844 mutExpr->expr = unqMap[mutExpr->id]->expr;
845 // delete unqExpr->result;
846 mutExpr->result = mutExpr->expr->result;
847 }
848 return mutExpr;
849 }
850
851 const ast::DeclWithType * FixInit::postvisit( const ast::ObjectDecl *_objDecl ) {
852 const CodeLocation loc = _objDecl->location;
853
854 // since this removes the init field from objDecl, it must occur after children are mutated (i.e. postvisit)
855 if ( ast::ptr<ast::ConstructorInit> ctorInit = _objDecl->init.as<ast::ConstructorInit>() ) {
856 auto objDecl = mutate(_objDecl);
857
858 // could this be non-unique?
859 if (objDecl != _objDecl) {
860 std::cerr << "FixInit: non-unique object decl " << objDecl->location << objDecl->name << std::endl;
861 }
862 // a decision should have been made by the resolver, so ctor and init are not both non-NULL
863 assert( ! ctorInit->ctor || ! ctorInit->init );
864 if ( const ast::Stmt * ctor = ctorInit->ctor ) {
865 if ( objDecl->storage.is_static ) {
866 addDataSectionAttribute(objDecl);
867 // originally wanted to take advantage of gcc nested functions, but
868 // we get memory errors with this approach. To remedy this, the static
869 // variable is hoisted when the destructor needs to be called.
870 //
871 // generate:
872 // static T __objName_static_varN;
873 // void __objName_dtor_atexitN() {
874 // __dtor__...;
875 // }
876 // int f(...) {
877 // ...
878 // static bool __objName_uninitialized = true;
879 // if (__objName_uninitialized) {
880 // __ctor(__objName);
881 // __objName_uninitialized = false;
882 // atexit(__objName_dtor_atexitN);
883 // }
884 // ...
885 // }
886
887 static UniqueName dtorCallerNamer( "_dtor_atexit" );
888
889 // static bool __objName_uninitialized = true
890 auto boolType = new ast::BasicType( ast::BasicType::Kind::Bool );
891 auto boolInitExpr = new ast::SingleInit(loc, ast::ConstantExpr::from_int(loc, 1 ) );
892 auto isUninitializedVar = new ast::ObjectDecl(loc, objDecl->mangleName + "_uninitialized", boolType, boolInitExpr, ast::Storage::Static, ast::Linkage::Cforall);
893 isUninitializedVar->fixUniqueId();
894
895 // __objName_uninitialized = false;
896 auto setTrue = new ast::UntypedExpr(loc, new ast::NameExpr(loc, "?=?" ) );
897 setTrue->args.push_back( new ast::VariableExpr(loc, isUninitializedVar ) );
898 setTrue->args.push_back( ast::ConstantExpr::from_int(loc, 0 ) );
899
900 // generate body of if
901 auto initStmts = new ast::CompoundStmt(loc);
902 auto & body = initStmts->kids;
903 body.push_back( ctor );
904 body.push_back( new ast::ExprStmt(loc, setTrue ) );
905
906 // put it all together
907 auto ifStmt = new ast::IfStmt(loc, new ast::VariableExpr(loc, isUninitializedVar ), initStmts, 0 );
908 stmtsToAddAfter.push_back( new ast::DeclStmt(loc, isUninitializedVar ) );
909 stmtsToAddAfter.push_back( ifStmt );
910
911 const ast::Stmt * dtor = ctorInit->dtor;
912
913 // these should be automatically managed once reassigned
914 // objDecl->set_init( nullptr );
915 // ctorInit->set_ctor( nullptr );
916 // ctorInit->set_dtor( nullptr );
917 if ( dtor ) {
918 // if the object has a non-trivial destructor, have to
919 // hoist it and the object into the global space and
920 // call the destructor function with atexit.
921
922 // Statement * dtorStmt = dtor->clone();
923
924 // void __objName_dtor_atexitN(...) {...}
925 ast::FunctionDecl * dtorCaller = new ast::FunctionDecl(loc, objDecl->mangleName + dtorCallerNamer.newName(), {}, {}, {}, new ast::CompoundStmt(loc, {dtor}), ast::Storage::Static, ast::Linkage::C );
926 dtorCaller->fixUniqueId();
927 // dtorCaller->stmts->push_back( dtor );
928
929 // atexit(dtor_atexit);
930 auto callAtexit = new ast::UntypedExpr(loc, new ast::NameExpr(loc, "atexit" ) );
931 callAtexit->args.push_back( new ast::VariableExpr(loc, dtorCaller ) );
932
933 body.push_back( new ast::ExprStmt(loc, callAtexit ) );
934
935 // hoist variable and dtor caller decls to list of decls that will be added into global scope
936 staticDtorDecls.push_back( objDecl );
937 staticDtorDecls.push_back( dtorCaller );
938
939 // need to rename object uniquely since it now appears
940 // at global scope and there could be multiple function-scoped
941 // static variables with the same name in different functions.
942 // Note: it isn't sufficient to modify only the mangleName, because
943 // then subsequent Indexer passes can choke on seeing the object's name
944 // if another object has the same name and type. An unfortunate side-effect
945 // of renaming the object is that subsequent NameExprs may fail to resolve,
946 // but there shouldn't be any remaining past this point.
947 static UniqueName staticNamer( "_static_var" );
948 objDecl->name = objDecl->name + staticNamer.newName();
949 objDecl->mangleName = Mangle::mangle( objDecl );
950 objDecl->init = nullptr;
951
952 // xxx - temporary hack: need to return a declaration, but want to hoist the current object out of this scope
953 // create a new object which is never used
954 static UniqueName dummyNamer( "_dummy" );
955 auto dummy = new ast::ObjectDecl(loc, dummyNamer.newName(), new ast::PointerType(new ast::VoidType()), nullptr, ast::Storage::Static, ast::Linkage::Cforall, 0, { new ast::Attribute("unused") } );
956 // delete ctorInit;
957 return dummy;
958 } else {
959 objDecl->init = nullptr;
960 return objDecl;
961 }
962 } else {
963 auto implicit = strict_dynamic_cast< const ast::ImplicitCtorDtorStmt * > ( ctor );
964 auto ctorStmt = implicit->callStmt.as<ast::ExprStmt>();
965 const ast::ApplicationExpr * ctorCall = nullptr;
966 if ( ctorStmt && (ctorCall = isIntrinsicCallExpr( ctorStmt->expr )) && ctorCall->args.size() == 2 ) {
967 // clean up intrinsic copy constructor calls by making them into SingleInits
968 const ast::Expr * ctorArg = ctorCall->args.back();
969 // ctorCall should be gone afterwards
970 auto mutArg = mutate(ctorArg);
971 mutArg->env = ctorCall->env;
972 // std::swap( ctorArg->env, ctorCall->env );
973 objDecl->init = new ast::SingleInit(loc, mutArg );
974
975 // ctorCall->args.pop_back();
976 } else {
977 stmtsToAddAfter.push_back( ctor );
978 objDecl->init = nullptr;
979 // ctorInit->ctor = nullptr;
980 }
981
982 const ast::Stmt * dtor = ctorInit->dtor;
983 if ( dtor ) {
984 auto implicit = strict_dynamic_cast< const ast::ImplicitCtorDtorStmt * >( dtor );
985 const ast::Stmt * dtorStmt = implicit->callStmt;
986
987 // don't need to call intrinsic dtor, because it does nothing, but
988 // non-intrinsic dtors must be called
989 if ( ! isIntrinsicSingleArgCallStmt( dtorStmt ) ) {
990 // set dtor location to the object's location for error messages
991 auto dtorFunc = getDtorFunc( objDecl, dtorStmt, stmtsToAddBefore );
992 objDecl->attributes.push_back( new ast::Attribute( "cleanup", { new ast::VariableExpr(loc, dtorFunc ) } ) );
993 // ctorInit->dtor = nullptr;
994 } // if
995 }
996 } // if
997 } else if ( const ast::Init * init = ctorInit->init ) {
998 objDecl->init = init;
999 // ctorInit->init = nullptr;
1000 } else {
1001 // no constructor and no initializer, which is okay
1002 objDecl->init = nullptr;
1003 } // if
1004 // delete ctorInit;
1005 return objDecl;
1006 } // if
1007 return _objDecl;
1008 }
1009
1010 void ObjDeclCollector::previsit( const ast::CompoundStmt * ) {
1011 GuardValue( curVars );
1012 }
1013
1014 void ObjDeclCollector::previsit( const ast::DeclStmt * stmt ) {
1015 // keep track of all variables currently in scope
1016 if ( auto objDecl = stmt->decl.as<ast::ObjectDecl>() ) {
1017 curVars.push_back( objDecl );
1018 } // if
1019 }
1020
1021 void LabelFinder::previsit( const ast::Stmt * stmt ) {
1022 // for each label, remember the variables in scope at that label.
1023 for ( auto l : stmt->labels ) {
1024 vars[l] = curVars;
1025 } // for
1026 }
1027
1028 void LabelFinder::previsit( const ast::CompoundStmt * stmt ) {
1029 previsit( (const ast::Stmt *) stmt );
1030 Parent::previsit( stmt );
1031 }
1032
1033 void LabelFinder::previsit( const ast::DeclStmt * stmt ) {
1034 previsit( (const ast::Stmt *)stmt );
1035 Parent::previsit( stmt );
1036 }
1037
1038
1039 void InsertDtors::previsit( const ast::FunctionDecl * funcDecl ) {
1040 // each function needs to have its own set of labels
1041 GuardValue( labelVars );
1042 labelVars.clear();
1043 // LabelFinder does not recurse into FunctionDecl, so need to visit
1044 // its children manually.
1045 if (funcDecl->type) funcDecl->type->accept(finder);
1046 // maybeAccept( funcDecl->type, finder );
1047 if (funcDecl->stmts) funcDecl->stmts->accept(finder) ;
1048
1049 // all labels for this function have been collected, insert destructors as appropriate via implicit recursion.
1050 }
1051
1052 // Handle break/continue/goto in the same manner as C++. Basic idea: any objects that are in scope at the
1053 // BranchStmt but not at the labelled (target) statement must be destructed. If there are any objects in scope
1054 // at the target location but not at the BranchStmt then those objects would be uninitialized so notify the user
1055 // of the error. See C++ Reference 6.6 Jump Statements for details.
1056 void InsertDtors::handleGoto( const ast::BranchStmt * stmt ) {
1057 // can't do anything for computed goto
1058 if ( stmt->computedTarget ) return;
1059
1060 assertf( stmt->target.name != "", "BranchStmt missing a label: %s", toString( stmt ).c_str() );
1061 // S_L = lvars = set of objects in scope at label definition
1062 // S_G = curVars = set of objects in scope at goto statement
1063 ObjectSet & lvars = labelVars[ stmt->target ];
1064
1065 DTOR_PRINT(
1066 std::cerr << "at goto label: " << stmt->target.name << std::endl;
1067 std::cerr << "S_G = " << printSet( curVars ) << std::endl;
1068 std::cerr << "S_L = " << printSet( lvars ) << std::endl;
1069 )
1070
1071
1072 // std::set_difference requires that the inputs be sorted.
1073 lvars.sort();
1074 curVars.sort();
1075
1076 ObjectSet diff;
1077 // S_L-S_G results in set of objects whose construction is skipped - it's an error if this set is non-empty
1078 std::set_difference( lvars.begin(), lvars.end(), curVars.begin(), curVars.end(), std::inserter( diff, diff.begin() ) );
1079 DTOR_PRINT(
1080 std::cerr << "S_L-S_G = " << printSet( diff ) << std::endl;
1081 )
1082 if ( ! diff.empty() ) {
1083 SemanticError( stmt, std::string("jump to label '") + stmt->target.name + "' crosses initialization of " + (*diff.begin())->name + " " );
1084 } // if
1085 }
1086
1087 void InsertDtors::previsit( const ast::BranchStmt * stmt ) {
1088 switch( stmt->kind ) {
1089 case ast::BranchStmt::Continue:
1090 case ast::BranchStmt::Break:
1091 // could optimize the break/continue case, because the S_L-S_G check is unnecessary (this set should
1092 // always be empty), but it serves as a small sanity check.
1093 case ast::BranchStmt::Goto:
1094 handleGoto( stmt );
1095 break;
1096 default:
1097 assert( false );
1098 } // switch
1099 }
1100
1101 bool checkWarnings( const ast::FunctionDecl * funcDecl ) {
1102 // only check for warnings if the current function is a user-defined
1103 // constructor or destructor
1104 if ( ! funcDecl ) return false;
1105 if ( ! funcDecl->stmts ) return false;
1106 return CodeGen::isCtorDtor( funcDecl->name ) && ! funcDecl->linkage.is_overrideable;
1107 }
1108
1109 void GenStructMemberCalls::previsit( const ast::FunctionDecl * funcDecl ) {
1110 GuardValue( function );
1111 GuardValue( unhandled );
1112 GuardValue( usedUninit );
1113 GuardValue( thisParam );
1114 GuardValue( isCtor );
1115 GuardValue( structDecl );
1116 errors = SemanticErrorException(); // clear previous errors
1117
1118 // need to start with fresh sets
1119 unhandled.clear();
1120 usedUninit.clear();
1121
1122 function = mutate(funcDecl);
1123 // could this be non-unique?
1124 if (function != funcDecl) {
1125 std::cerr << "GenStructMemberCalls: non-unique FunctionDecl " << funcDecl->location << funcDecl->name << std::endl;
1126 }
1127
1128 isCtor = CodeGen::isConstructor( function->name );
1129 if ( checkWarnings( function ) ) {
1130 // const ast::FunctionType * type = function->type;
1131 // assert( ! type->params.empty() );
1132 thisParam = function->params.front().strict_as<ast::ObjectDecl>();
1133 auto thisType = getPointerBase( thisParam->get_type() );
1134 auto structType = dynamic_cast< const ast::StructInstType * >( thisType );
1135 if ( structType ) {
1136 structDecl = structType->base;
1137 for ( auto & member : structDecl->members ) {
1138 if ( auto field = member.as<ast::ObjectDecl>() ) {
1139 // record all of the struct type's members that need to be constructed or
1140 // destructed by the end of the function
1141 unhandled.insert( field );
1142 }
1143 }
1144 }
1145 }
1146 }
1147
1148 const ast::DeclWithType * GenStructMemberCalls::postvisit( const ast::FunctionDecl * funcDecl ) {
1149 // remove the unhandled objects from usedUninit, because a call is inserted
1150 // to handle them - only objects that are later constructed are used uninitialized.
1151 std::map< const ast::DeclWithType *, CodeLocation > diff;
1152 // need the comparator since usedUninit and unhandled have different types
1153 struct comp_t {
1154 typedef decltype(usedUninit)::value_type usedUninit_t;
1155 typedef decltype(unhandled)::value_type unhandled_t;
1156 bool operator()(usedUninit_t x, unhandled_t y) { return x.first < y; }
1157 bool operator()(unhandled_t x, usedUninit_t y) { return x < y.first; }
1158 } comp;
1159 std::set_difference( usedUninit.begin(), usedUninit.end(), unhandled.begin(), unhandled.end(), std::inserter( diff, diff.begin() ), comp );
1160 for ( auto p : diff ) {
1161 auto member = p.first;
1162 auto loc = p.second;
1163 // xxx - make error message better by also tracking the location that the object is constructed at?
1164 emit( loc, "in ", function->name, ", field ", member->name, " used before being constructed" );
1165 }
1166
1167 const CodeLocation loc = funcDecl->location;
1168
1169 if ( ! unhandled.empty() ) {
1170 auto mutStmts = function->stmts.get_and_mutate();
1171 // need to explicitly re-add function parameters to the indexer in order to resolve copy constructors
1172 auto guard = makeFuncGuard( [this]() { symtab.enterScope(); }, [this]() { symtab.leaveScope(); } );
1173 symtab.addFunction( function );
1174
1175 // need to iterate through members in reverse in order for
1176 // ctor/dtor statements to come out in the right order
1177 for ( auto & member : reverseIterate( structDecl->members ) ) {
1178 auto field = member.as<ast::ObjectDecl>();
1179 // skip non-DWT members
1180 if ( ! field ) continue;
1181 // skip non-constructable members
1182 if ( ! tryConstruct( field ) ) continue;
1183 // skip handled members
1184 if ( ! unhandled.count( field ) ) continue;
1185
1186 // insert and resolve default/copy constructor call for each field that's unhandled
1187 // std::list< const ast::Stmt * > stmt;
1188 ast::Expr * arg2 = nullptr;
1189 if ( function->name == "?{}" && isCopyFunction( function ) ) {
1190 // if copy ctor, need to pass second-param-of-this-function.field
1191 // std::list< DeclarationWithType * > & params = function->get_functionType()->get_parameters();
1192 assert( function->params.size() == 2 );
1193 arg2 = new ast::MemberExpr(funcDecl->location, field, new ast::VariableExpr(funcDecl->location, function->params.back() ) );
1194 }
1195 InitExpander_new srcParam( arg2 );
1196 // cast away reference type and construct field.
1197 ast::Expr * thisExpr = new ast::CastExpr(funcDecl->location, new ast::VariableExpr(funcDecl->location, thisParam ), thisParam->get_type()->stripReferences());
1198 ast::Expr * memberDest = new ast::MemberExpr(funcDecl->location, field, thisExpr );
1199 ast::ptr<ast::Stmt> callStmt = SymTab::genImplicitCall( srcParam, memberDest, loc, function->name, field, static_cast<SymTab::LoopDirection>(isCtor) );
1200
1201 if ( callStmt ) {
1202 // auto & callStmt = stmt.front();
1203
1204 try {
1205 callStmt = callStmt->accept( *visitor );
1206 if ( isCtor ) {
1207 mutStmts->push_front( callStmt );
1208 } else { // TODO: don't generate destructor function/object for intrinsic calls
1209 // destructor statements should be added at the end
1210 // function->get_statements()->push_back( callStmt );
1211
1212 // Optimization: do not need to call intrinsic destructors on members
1213 if ( isIntrinsicSingleArgCallStmt( callStmt ) ) continue;
1214
1215 // __Destructor _dtor0 = { (void *)&b.a1, (void (*)(void *)_destroy_A };
1216 std::list< ast::ptr<ast::Stmt> > stmtsToAdd;
1217
1218 static UniqueName memberDtorNamer = { "__memberDtor" };
1219 assertf( Validate::dtorStruct, "builtin __Destructor not found." );
1220 assertf( Validate::dtorStructDestroy, "builtin __destroy_Destructor not found." );
1221
1222 ast::Expr * thisExpr = new ast::CastExpr( new ast::AddressExpr( new ast::VariableExpr(loc, thisParam ) ), new ast::PointerType( new ast::VoidType(), ast::CV::Qualifiers() ) );
1223 ast::Expr * dtorExpr = new ast::VariableExpr(loc, getDtorFunc( thisParam, callStmt, stmtsToAdd ) );
1224
1225 // cast destructor pointer to void (*)(void *), to silence GCC incompatible pointer warnings
1226 auto dtorFtype = new ast::FunctionType();
1227 dtorFtype->params.emplace_back( new ast::PointerType( new ast::VoidType() ) );
1228 auto dtorType = new ast::PointerType( dtorFtype );
1229
1230 auto destructor = new ast::ObjectDecl(loc, memberDtorNamer.newName(), new ast::StructInstType( ast::dtorStruct ), new ast::ListInit(loc, { new ast::SingleInit(loc, thisExpr ), new ast::SingleInit(loc, new ast::CastExpr( dtorExpr, dtorType ) ) } ) );
1231 destructor->attributes.push_back( new ast::Attribute( "cleanup", { new ast::VariableExpr({}, ast::dtorStructDestroy ) } ) );
1232 mutStmts->push_front( new ast::DeclStmt(loc, destructor ) );
1233 mutStmts->kids.splice( mutStmts->kids.begin(), stmtsToAdd );
1234 }
1235 } catch ( SemanticErrorException & error ) {
1236 emit( funcDecl->location, "in ", function->name , ", field ", field->name, " not explicitly ", isCtor ? "constructed" : "destructed", " and no ", isCtor ? "default constructor" : "destructor", " found" );
1237 }
1238 }
1239 }
1240 function->stmts = mutStmts;
1241 }
1242 if (! errors.isEmpty()) {
1243 throw errors;
1244 }
1245 // return funcDecl;
1246 return function;
1247 }
1248
1249 /// true if expr is effectively just the 'this' parameter
1250 bool isThisExpression( const ast::Expr * expr, const ast::DeclWithType * thisParam ) {
1251 // TODO: there are more complicated ways to pass 'this' to a constructor, e.g. &*, *&, etc.
1252 if ( auto varExpr = dynamic_cast< const ast::VariableExpr * >( expr ) ) {
1253 return varExpr->var == thisParam;
1254 } else if ( auto castExpr = dynamic_cast< const ast::CastExpr * > ( expr ) ) {
1255 return isThisExpression( castExpr->arg, thisParam );
1256 }
1257 return false;
1258 }
1259
1260 /// returns a MemberExpr if expr is effectively just member access on the 'this' parameter, else nullptr
1261 const ast::MemberExpr * isThisMemberExpr( const ast::Expr * expr, const ast::DeclWithType * thisParam ) {
1262 if ( auto memberExpr = dynamic_cast< const ast::MemberExpr * >( expr ) ) {
1263 if ( isThisExpression( memberExpr->aggregate, thisParam ) ) {
1264 return memberExpr;
1265 }
1266 } else if ( auto castExpr = dynamic_cast< const ast::CastExpr * >( expr ) ) {
1267 return isThisMemberExpr( castExpr->arg, thisParam );
1268 }
1269 return nullptr;
1270 }
1271
1272 void GenStructMemberCalls::previsit( const ast::ApplicationExpr * appExpr ) {
1273 if ( ! checkWarnings( function ) ) {
1274 visit_children = false;
1275 return;
1276 }
1277
1278 std::string fname = getFunctionName( appExpr );
1279 if ( fname == function->name ) {
1280 // call to same kind of function
1281 const ast::Expr * firstParam = appExpr->args.front();
1282
1283 if ( isThisExpression( firstParam, thisParam ) ) {
1284 // if calling another constructor on thisParam, assume that function handles
1285 // all members - if it doesn't a warning will appear in that function.
1286 unhandled.clear();
1287 } else if ( auto memberExpr = isThisMemberExpr( firstParam, thisParam ) ) {
1288 // if first parameter is a member expression on the this parameter,
1289 // then remove the member from unhandled set.
1290 if ( isThisExpression( memberExpr->aggregate, thisParam ) ) {
1291 unhandled.erase( memberExpr->member );
1292 }
1293 }
1294 }
1295 }
1296
1297 void GenStructMemberCalls::previsit( const ast::MemberExpr * memberExpr ) {
1298 if ( ! checkWarnings( function ) || ! isCtor ) {
1299 visit_children = false;
1300 return;
1301 }
1302
1303 if ( isThisExpression( memberExpr->aggregate, thisParam ) ) {
1304 if ( unhandled.count( memberExpr->member ) ) {
1305 // emit a warning because a member was used before it was constructed
1306 usedUninit.insert( { memberExpr->member, memberExpr->location } );
1307 }
1308 }
1309 }
1310
1311 template< typename Visitor, typename... Params >
1312 void error( Visitor & v, CodeLocation loc, const Params &... params ) {
1313 SemanticErrorException err( loc, toString( params... ) );
1314 v.errors.append( err );
1315 }
1316
1317 template< typename... Params >
1318 void GenStructMemberCalls::emit( CodeLocation loc, const Params &... params ) {
1319 // toggle warnings vs. errors here.
1320 // warn( params... );
1321 error( *this, loc, params... );
1322 }
1323
1324 const ast::Expr * GenStructMemberCalls::postvisit( const ast::UntypedExpr * untypedExpr ) {
1325 // Expression * newExpr = untypedExpr;
1326 // xxx - functions returning ast::ptr seems wrong...
1327 auto res = ResolvExpr::findVoidExpression( untypedExpr, symtab );
1328 return res.release();
1329 // return newExpr;
1330 }
1331
1332 void InsertImplicitCalls::previsit(const ast::UniqueExpr * unqExpr) {
1333 if (visitedIds.count(unqExpr->id)) visit_children = false;
1334 else visitedIds.insert(unqExpr->id);
1335 }
1336
1337 const ast::Expr * FixCtorExprs::postvisit( const ast::ConstructorExpr * ctorExpr ) {
1338 const CodeLocation loc = ctorExpr->location;
1339 static UniqueName tempNamer( "_tmp_ctor_expr" );
1340 // xxx - is the size check necessary?
1341 assert( ctorExpr->result && ctorExpr->result->size() == 1 );
1342
1343 // xxx - this can be TupleAssignExpr now. Need to properly handle this case.
1344 // take possession of expr and env
1345 ast::ptr<ast::ApplicationExpr> callExpr = ctorExpr->callExpr.strict_as<ast::ApplicationExpr>();
1346 ast::ptr<ast::TypeSubstitution> env = ctorExpr->env;
1347 // ctorExpr->set_callExpr( nullptr );
1348 // ctorExpr->set_env( nullptr );
1349
1350 // 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.
1351 auto tmp = new ast::ObjectDecl(loc, tempNamer.newName(), callExpr->args.front()->result );
1352 declsToAddBefore.push_back( tmp );
1353 // delete ctorExpr;
1354
1355 // build assignment and replace constructor's first argument with new temporary
1356 auto mutCallExpr = callExpr.get_and_mutate();
1357 const ast::Expr * firstArg = callExpr->args.front();
1358 ast::Expr * assign = new ast::UntypedExpr(loc, new ast::NameExpr(loc, "?=?" ), { new ast::AddressExpr(loc, new ast::VariableExpr(loc, tmp ) ), new ast::AddressExpr( firstArg ) } );
1359 firstArg = new ast::VariableExpr(loc, tmp );
1360 mutCallExpr->args.front() = firstArg;
1361
1362 // resolve assignment and dispose of new env
1363 auto resolved = ResolvExpr::findVoidExpression( assign, symtab );
1364 auto mut = resolved.get_and_mutate();
1365 assertf(resolved.get() == mut, "newly resolved expression must be unique");
1366 mut->env = nullptr;
1367
1368 // for constructor expr:
1369 // T x;
1370 // x{};
1371 // results in:
1372 // T x;
1373 // T & tmp;
1374 // &tmp = &x, ?{}(tmp), tmp
1375 ast::CommaExpr * commaExpr = new ast::CommaExpr(loc, resolved, new ast::CommaExpr(loc, mutCallExpr, new ast::VariableExpr(loc, tmp ) ) );
1376 commaExpr->env = env;
1377 return commaExpr;
1378 }
1379} // namespace
1380} // namespace InitTweak
1381
1382// Local Variables: //
1383// tab-width: 4 //
1384// mode: c++ //
1385// compile-command: "make install" //
1386// End: //
Note: See TracBrowser for help on using the repository browser.