source: src/ResolvExpr/Resolver.cc@ 77bc259

Last change on this file since 77bc259 was 14755e5, checked in by Andrew Beach <ajbeach@…>, 20 months ago

Updated indentation in Resolver. Removed trailing whitespace.
  • Property mode set to 100644
File size: 43.5 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// Resolver.cc --
8//
9// Author : Aaron B. Moss
10// Created On : Sun May 17 12:17:01 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Thu Dec 14 18:44:43 2023
13// Update Count : 251
14//
15
16#include <cassert> // for strict_dynamic_cast, assert
17#include <memory> // for allocator, allocator_traits<...
18#include <tuple> // for get
19#include <vector> // for vector
20
21#include "Candidate.hpp"
22#include "CandidateFinder.hpp"
23#include "CurrentObject.h" // for CurrentObject
24#include "RenameVars.h" // for RenameVars, global_renamer
25#include "Resolver.h"
26#include "ResolveTypeof.h"
27#include "ResolveMode.hpp" // for ResolveMode
28#include "typeops.h" // for extractResultType
29#include "Unify.h" // for unify
30#include "CompilationState.h"
31#include "AST/Decl.hpp"
32#include "AST/Init.hpp"
33#include "AST/Pass.hpp"
34#include "AST/Print.hpp"
35#include "AST/SymbolTable.hpp"
36#include "AST/Type.hpp"
37#include "Common/Eval.h" // for eval
38#include "Common/Iterate.hpp" // for group_iterate
39#include "Common/SemanticError.h" // for SemanticError
40#include "Common/Stats/ResolveTime.h" // for ResolveTime::start(), ResolveTime::stop()
41#include "Common/ToString.hpp" // for toCString
42#include "Common/UniqueName.h" // for UniqueName
43#include "InitTweak/GenInit.h"
44#include "InitTweak/InitTweak.h" // for isIntrinsicSingleArgCallStmt
45#include "SymTab/Mangler.h" // for Mangler
46#include "Tuples/Tuples.h"
47#include "Validate/FindSpecialDecls.h" // for SizeType
48
49using namespace std;
50
51namespace ResolvExpr {
52
53namespace {
54 /// Finds deleted expressions in an expression tree
55 struct DeleteFinder final : public ast::WithShortCircuiting, public ast::WithVisitorRef<DeleteFinder> {
56 const ast::DeletedExpr * result = nullptr;
57
58 void previsit( const ast::DeletedExpr * expr ) {
59 if ( result ) { visit_children = false; }
60 else { result = expr; }
61 }
62
63 void previsit( const ast::Expr * expr ) {
64 if ( result ) { visit_children = false; }
65 if (expr->inferred.hasParams()) {
66 for (auto & imp : expr->inferred.inferParams() ) {
67 imp.second.expr->accept(*visitor);
68 }
69 }
70 }
71 };
72
73 struct ResolveDesignators final : public ast::WithShortCircuiting {
74 ResolveContext& context;
75 bool result = false;
76
77 ResolveDesignators( ResolveContext& _context ): context(_context) {};
78
79 void previsit( const ast::Node * ) {
80 // short circuit if we already know there are designations
81 if ( result ) visit_children = false;
82 }
83
84 void previsit( const ast::Designation * des ) {
85 if ( result ) visit_children = false;
86 else if ( ! des->designators.empty() ) {
87 if ( (des->designators.size() == 1) ) {
88 const ast::Expr * designator = des->designators.at(0);
89 if ( const ast::NameExpr * designatorName = dynamic_cast<const ast::NameExpr *>(designator) ) {
90 auto candidates = context.symtab.lookupId(designatorName->name);
91 for ( auto candidate : candidates ) {
92 if ( dynamic_cast<const ast::EnumInstType *>(candidate.id->get_type()) ) {
93 result = true;
94 break;
95 }
96 }
97 }
98 }
99 visit_children = false;
100 }
101 }
102 };
103} // anonymous namespace
104
105/// Check if this expression is or includes a deleted expression
106const ast::DeletedExpr * findDeletedExpr( const ast::Expr * expr ) {
107 return ast::Pass<DeleteFinder>::read( expr );
108}
109
110namespace {
111 /// always-accept candidate filter
112 bool anyCandidate( const Candidate & ) { return true; }
113
114 /// Calls the CandidateFinder and finds the single best candidate
115 CandidateRef findUnfinishedKindExpression(
116 const ast::Expr * untyped, const ResolveContext & context, const std::string & kind,
117 std::function<bool(const Candidate &)> pred = anyCandidate, ResolveMode mode = {}
118 ) {
119 if ( ! untyped ) return nullptr;
120
121 // xxx - this isn't thread-safe, but should work until we parallelize the resolver
122 static unsigned recursion_level = 0;
123
124 ++recursion_level;
125 ast::TypeEnvironment env;
126 CandidateFinder finder( context, env );
127 finder.allowVoid = true;
128 finder.find( untyped, recursion_level == 1 ? mode.atTopLevel() : mode );
129 --recursion_level;
130
131 // produce a filtered list of candidates
132 CandidateList candidates;
133 for ( auto & cand : finder.candidates ) {
134 if ( pred( *cand ) ) { candidates.emplace_back( cand ); }
135 }
136
137 // produce invalid error if no candidates
138 if ( candidates.empty() ) {
139 SemanticError( untyped,
140 toString( "No reasonable alternatives for ", kind, (kind != "" ? " " : ""),
141 "expression: ") );
142 }
143
144 // search for cheapest candidate
145 CandidateList winners;
146 bool seen_undeleted = false;
147 for ( CandidateRef & cand : candidates ) {
148 int c = winners.empty() ? -1 : cand->cost.compare( winners.front()->cost );
149
150 if ( c > 0 ) continue; // skip more expensive than winner
151
152 if ( c < 0 ) {
153 // reset on new cheapest
154 seen_undeleted = ! findDeletedExpr( cand->expr );
155 winners.clear();
156 } else /* if ( c == 0 ) */ {
157 if ( findDeletedExpr( cand->expr ) ) {
158 // skip deleted expression if already seen one equivalent-cost not
159 if ( seen_undeleted ) continue;
160 } else if ( ! seen_undeleted ) {
161 // replace list of equivalent-cost deleted expressions with one non-deleted
162 winners.clear();
163 seen_undeleted = true;
164 }
165 }
166
167 winners.emplace_back( std::move( cand ) );
168 }
169
170 // promote candidate.cvtCost to .cost
171 // promoteCvtCost( winners );
172
173 // produce ambiguous errors, if applicable
174 if ( winners.size() != 1 ) {
175 std::ostringstream stream;
176 stream << "Cannot choose between " << winners.size() << " alternatives for "
177 << kind << (kind != "" ? " " : "") << "expression\n";
178 ast::print( stream, untyped );
179 stream << " Alternatives are:\n";
180 print( stream, winners, 1 );
181 SemanticError( untyped->location, stream.str() );
182 }
183
184 // single selected choice
185 CandidateRef & choice = winners.front();
186
187 // fail on only expression deleted
188 if ( ! seen_undeleted ) {
189 SemanticError( untyped->location, choice->expr.get(), "Unique best alternative "
190 "includes deleted identifier in " );
191 }
192
193 return std::move( choice );
194 }
195
196 /// Strips extraneous casts out of an expression
197 struct StripCasts final {
198 const ast::Expr * postvisit( const ast::CastExpr * castExpr ) {
199 if (
200 castExpr->isGenerated == ast::GeneratedCast
201 && typesCompatible( castExpr->arg->result, castExpr->result )
202 ) {
203 // generated cast is the same type as its argument, remove it after keeping env
204 return ast::mutate_field(
205 castExpr->arg.get(), &ast::Expr::env, castExpr->env );
206 }
207 return castExpr;
208 }
209
210 static void strip( ast::ptr< ast::Expr > & expr ) {
211 ast::Pass< StripCasts > stripper;
212 expr = expr->accept( stripper );
213 }
214 };
215
216 /// Swaps argument into expression pointer, saving original environment
217 void swap_and_save_env( ast::ptr< ast::Expr > & expr, const ast::Expr * newExpr ) {
218 ast::ptr< ast::TypeSubstitution > env = expr->env;
219 expr.set_and_mutate( newExpr )->env = env;
220 }
221
222 /// Removes cast to type of argument (unlike StripCasts, also handles non-generated casts)
223 void removeExtraneousCast( ast::ptr<ast::Expr> & expr ) {
224 if ( const ast::CastExpr * castExpr = expr.as< ast::CastExpr >() ) {
225 if ( typesCompatible( castExpr->arg->result, castExpr->result ) ) {
226 // cast is to the same type as its argument, remove it
227 swap_and_save_env( expr, castExpr->arg );
228 }
229 }
230 }
231
232} // anonymous namespace
233
234/// Establish post-resolver invariants for expressions
235void finishExpr(
236 ast::ptr< ast::Expr > & expr, const ast::TypeEnvironment & env,
237 const ast::TypeSubstitution * oldenv = nullptr
238) {
239 // set up new type substitution for expression
240 ast::ptr< ast::TypeSubstitution > newenv =
241 oldenv ? oldenv : new ast::TypeSubstitution{};
242 env.writeToSubstitution( *newenv.get_and_mutate() );
243 expr.get_and_mutate()->env = std::move( newenv );
244 // remove unncecessary casts
245 StripCasts::strip( expr );
246}
247
248ast::ptr< ast::Expr > resolveInVoidContext(
249 const ast::Expr * expr, const ResolveContext & context,
250 ast::TypeEnvironment & env
251) {
252 assertf( expr, "expected a non-null expression" );
253
254 // set up and resolve expression cast to void
255 ast::ptr< ast::CastExpr > untyped = new ast::CastExpr{ expr };
256 CandidateRef choice = findUnfinishedKindExpression(
257 untyped, context, "", anyCandidate, ResolveMode::withAdjustment() );
258
259 // a cast expression has either 0 or 1 interpretations (by language rules);
260 // if 0, an exception has already been thrown, and this code will not run
261 const ast::CastExpr * castExpr = choice->expr.strict_as< ast::CastExpr >();
262 env = std::move( choice->env );
263
264 return castExpr->arg;
265}
266
267/// Resolve `untyped` to the expression whose candidate is the best match for a `void`
268/// context.
269ast::ptr< ast::Expr > findVoidExpression(
270 const ast::Expr * untyped, const ResolveContext & context
271) {
272 ast::TypeEnvironment env;
273 ast::ptr< ast::Expr > newExpr = resolveInVoidContext( untyped, context, env );
274 finishExpr( newExpr, env, untyped->env );
275 return newExpr;
276}
277
278namespace {
279 /// resolve `untyped` to the expression whose candidate satisfies `pred` with the
280 /// lowest cost, returning the resolved version
281 ast::ptr< ast::Expr > findKindExpression(
282 const ast::Expr * untyped, const ResolveContext & context,
283 std::function<bool(const Candidate &)> pred = anyCandidate,
284 const std::string & kind = "", ResolveMode mode = {}
285 ) {
286 if ( ! untyped ) return {};
287 CandidateRef choice =
288 findUnfinishedKindExpression( untyped, context, kind, pred, mode );
289 ResolvExpr::finishExpr( choice->expr, choice->env, untyped->env );
290 return std::move( choice->expr );
291 }
292
293 /// Resolve `untyped` to the single expression whose candidate is the best match
294 ast::ptr< ast::Expr > findSingleExpression(
295 const ast::Expr * untyped, const ResolveContext & context
296 ) {
297 Stats::ResolveTime::start( untyped );
298 auto res = findKindExpression( untyped, context );
299 Stats::ResolveTime::stop();
300 return res;
301 }
302} // anonymous namespace
303
304ast::ptr< ast::Expr > findSingleExpression(
305 const ast::Expr * untyped, const ast::Type * type,
306 const ResolveContext & context
307) {
308 assert( untyped && type );
309 ast::ptr< ast::Expr > castExpr = new ast::CastExpr{ untyped, type };
310 ast::ptr< ast::Expr > newExpr = findSingleExpression( castExpr, context );
311 removeExtraneousCast( newExpr );
312 return newExpr;
313}
314
315namespace {
316 bool structOrUnion( const Candidate & i ) {
317 const ast::Type * t = i.expr->result->stripReferences();
318 return dynamic_cast< const ast::StructInstType * >( t ) || dynamic_cast< const ast::UnionInstType * >( t );
319 }
320 /// Predicate for "Candidate has integral type"
321 bool hasIntegralType( const Candidate & i ) {
322 const ast::Type * type = i.expr->result;
323
324 if ( auto bt = dynamic_cast< const ast::BasicType * >( type ) ) {
325 return bt->isInteger();
326 } else if (
327 dynamic_cast< const ast::EnumInstType * >( type )
328 || dynamic_cast< const ast::ZeroType * >( type )
329 || dynamic_cast< const ast::OneType * >( type )
330 ) {
331 return true;
332 } else return false;
333 }
334
335 /// Resolve `untyped` as an integral expression, returning the resolved version
336 ast::ptr< ast::Expr > findIntegralExpression(
337 const ast::Expr * untyped, const ResolveContext & context
338 ) {
339 return findKindExpression( untyped, context, hasIntegralType, "condition" );
340 }
341
342 /// check if a type is a character type
343 bool isCharType( const ast::Type * t ) {
344 if ( auto bt = dynamic_cast< const ast::BasicType * >( t ) ) {
345 return bt->kind == ast::BasicType::Char
346 || bt->kind == ast::BasicType::SignedChar
347 || bt->kind == ast::BasicType::UnsignedChar;
348 }
349 return false;
350 }
351
352 /// Advance a type itertor to the next mutex parameter
353 template<typename Iter>
354 inline bool nextMutex( Iter & it, const Iter & end ) {
355 while ( it != end && ! (*it)->is_mutex() ) { ++it; }
356 return it != end;
357 }
358}
359
360class Resolver final
361: public ast::WithSymbolTable, public ast::WithGuards,
362 public ast::WithVisitorRef<Resolver>, public ast::WithShortCircuiting,
363 public ast::WithStmtsToAdd<> {
364
365 ast::ptr< ast::Type > functionReturn = nullptr;
366 ast::CurrentObject currentObject;
367 // for work previously in GenInit
368 static InitTweak::ManagedTypes managedTypes;
369 ResolveContext context;
370
371 bool inEnumDecl = false;
372
373public:
374 static size_t traceId;
375 Resolver( const ast::TranslationGlobal & global ) :
376 ast::WithSymbolTable(ast::SymbolTable::ErrorDetection::ValidateOnAdd),
377 context{ symtab, global } {}
378 Resolver( const ResolveContext & context ) :
379 ast::WithSymbolTable{ context.symtab },
380 context{ symtab, context.global } {}
381
382 const ast::FunctionDecl * previsit( const ast::FunctionDecl * );
383 const ast::FunctionDecl * postvisit( const ast::FunctionDecl * );
384 const ast::ObjectDecl * previsit( const ast::ObjectDecl * );
385 void previsit( const ast::AggregateDecl * );
386 void previsit( const ast::StructDecl * );
387 void previsit( const ast::EnumDecl * );
388 const ast::StaticAssertDecl * previsit( const ast::StaticAssertDecl * );
389
390 const ast::ArrayType * previsit( const ast::ArrayType * );
391 const ast::PointerType * previsit( const ast::PointerType * );
392
393 const ast::ExprStmt * previsit( const ast::ExprStmt * );
394 const ast::AsmExpr * previsit( const ast::AsmExpr * );
395 const ast::AsmStmt * previsit( const ast::AsmStmt * );
396 const ast::IfStmt * previsit( const ast::IfStmt * );
397 const ast::WhileDoStmt * previsit( const ast::WhileDoStmt * );
398 const ast::ForStmt * previsit( const ast::ForStmt * );
399 const ast::SwitchStmt * previsit( const ast::SwitchStmt * );
400 const ast::CaseClause * previsit( const ast::CaseClause * );
401 const ast::BranchStmt * previsit( const ast::BranchStmt * );
402 const ast::ReturnStmt * previsit( const ast::ReturnStmt * );
403 const ast::ThrowStmt * previsit( const ast::ThrowStmt * );
404 const ast::CatchClause * previsit( const ast::CatchClause * );
405 const ast::CatchClause * postvisit( const ast::CatchClause * );
406 const ast::WaitForStmt * previsit( const ast::WaitForStmt * );
407 const ast::WithStmt * previsit( const ast::WithStmt * );
408
409 const ast::SingleInit * previsit( const ast::SingleInit * );
410 const ast::ListInit * previsit( const ast::ListInit * );
411 const ast::ConstructorInit * previsit( const ast::ConstructorInit * );
412
413 void resolveWithExprs(std::vector<ast::ptr<ast::Expr>> & exprs, std::list<ast::ptr<ast::Stmt>> & stmtsToAdd);
414
415 void beginScope() { managedTypes.beginScope(); }
416 void endScope() { managedTypes.endScope(); }
417 bool on_error(ast::ptr<ast::Decl> & decl);
418};
419// size_t Resolver::traceId = Stats::Heap::new_stacktrace_id("Resolver");
420
421InitTweak::ManagedTypes Resolver::managedTypes;
422
423void resolve( ast::TranslationUnit& translationUnit ) {
424 ast::Pass< Resolver >::run( translationUnit, translationUnit.global );
425}
426
427ast::ptr< ast::Init > resolveCtorInit(
428 const ast::ConstructorInit * ctorInit, const ResolveContext & context
429) {
430 assert( ctorInit );
431 ast::Pass< Resolver > resolver( context );
432 return ctorInit->accept( resolver );
433}
434
435const ast::Expr * resolveStmtExpr(
436 const ast::StmtExpr * stmtExpr, const ResolveContext & context
437) {
438 assert( stmtExpr );
439 ast::Pass< Resolver > resolver( context );
440 auto ret = mutate(stmtExpr->accept(resolver));
441 strict_dynamic_cast< ast::StmtExpr * >( ret )->computeResult();
442 return ret;
443}
444
445namespace {
446 const ast::Attribute * handleAttribute(const CodeLocation & loc, const ast::Attribute * attr, const ResolveContext & context) {
447 std::string name = attr->normalizedName();
448 if (name == "constructor" || name == "destructor") {
449 if (attr->params.size() == 1) {
450 auto arg = attr->params.front();
451 auto resolved = ResolvExpr::findSingleExpression( arg, new ast::BasicType( ast::BasicType::LongLongSignedInt ), context );
452 auto result = eval(arg);
453
454 auto mutAttr = mutate(attr);
455 mutAttr->params.front() = resolved;
456 if (! result.hasKnownValue) {
457 SemanticWarning(loc, Warning::GccAttributes,
458 toCString( name, " priorities must be integers from 0 to 65535 inclusive: ", arg ) );
459 }
460 else {
461 auto priority = result.knownValue;
462 if (priority < 101) {
463 SemanticWarning(loc, Warning::GccAttributes,
464 toCString( name, " priorities from 0 to 100 are reserved for the implementation" ) );
465 } else if (priority < 201 && ! buildingLibrary()) {
466 SemanticWarning(loc, Warning::GccAttributes,
467 toCString( name, " priorities from 101 to 200 are reserved for the implementation" ) );
468 }
469 }
470 return mutAttr;
471 } else if (attr->params.size() > 1) {
472 SemanticWarning(loc, Warning::GccAttributes, toCString( "too many arguments to ", name, " attribute" ) );
473 } else {
474 SemanticWarning(loc, Warning::GccAttributes, toCString( "too few arguments to ", name, " attribute" ) );
475 }
476 }
477 return attr;
478 }
479}
480
481const ast::FunctionDecl * Resolver::previsit( const ast::FunctionDecl * functionDecl ) {
482 GuardValue( functionReturn );
483
484 assert (functionDecl->unique());
485 if (!functionDecl->has_body() && !functionDecl->withExprs.empty()) {
486 SemanticError(functionDecl->location, functionDecl, "Function without body has with declarations");
487 }
488
489 if (!functionDecl->isTypeFixed) {
490 auto mutDecl = mutate(functionDecl);
491 auto mutType = mutDecl->type.get_and_mutate();
492
493 for (auto & attr: mutDecl->attributes) {
494 attr = handleAttribute(mutDecl->location, attr, context );
495 }
496
497 // handle assertions
498
499 symtab.enterScope();
500 mutType->forall.clear();
501 mutType->assertions.clear();
502 for (auto & typeParam : mutDecl->type_params) {
503 symtab.addType(typeParam);
504 mutType->forall.emplace_back(new ast::TypeInstType(typeParam));
505 }
506 for (auto & asst : mutDecl->assertions) {
507 asst = fixObjectType(asst.strict_as<ast::ObjectDecl>(), context);
508 symtab.addId(asst);
509 mutType->assertions.emplace_back(new ast::VariableExpr(functionDecl->location, asst));
510 }
511
512 // temporarily adds params to symbol table.
513 // actual scoping rules for params and withexprs differ - see Pass::visit(FunctionDecl)
514
515 std::vector<ast::ptr<ast::Type>> paramTypes;
516 std::vector<ast::ptr<ast::Type>> returnTypes;
517
518 for (auto & param : mutDecl->params) {
519 param = fixObjectType(param.strict_as<ast::ObjectDecl>(), context);
520 symtab.addId(param);
521 paramTypes.emplace_back(param->get_type());
522 }
523 for (auto & ret : mutDecl->returns) {
524 ret = fixObjectType(ret.strict_as<ast::ObjectDecl>(), context);
525 returnTypes.emplace_back(ret->get_type());
526 }
527 // since function type in decl is just a view of param types, need to update that as well
528 mutType->params = std::move(paramTypes);
529 mutType->returns = std::move(returnTypes);
530
531 auto renamedType = strict_dynamic_cast<const ast::FunctionType *>(renameTyVars(mutType, RenameMode::GEN_EXPR_ID));
532
533 std::list<ast::ptr<ast::Stmt>> newStmts;
534 resolveWithExprs (mutDecl->withExprs, newStmts);
535
536 if (mutDecl->stmts) {
537 auto mutStmt = mutDecl->stmts.get_and_mutate();
538 mutStmt->kids.splice(mutStmt->kids.begin(), std::move(newStmts));
539 mutDecl->stmts = mutStmt;
540 }
541
542 symtab.leaveScope();
543
544 mutDecl->type = renamedType;
545 mutDecl->mangleName = Mangle::mangle(mutDecl);
546 mutDecl->isTypeFixed = true;
547 functionDecl = mutDecl;
548 }
549 managedTypes.handleDWT(functionDecl);
550
551 functionReturn = extractResultType( functionDecl->type );
552 return functionDecl;
553}
554
555const ast::FunctionDecl * Resolver::postvisit( const ast::FunctionDecl * functionDecl ) {
556 // default value expressions have an environment which shouldn't be there and trips up
557 // later passes.
558 assert( functionDecl->unique() );
559 ast::FunctionType * mutType = mutate( functionDecl->type.get() );
560
561 for ( unsigned i = 0 ; i < mutType->params.size() ; ++i ) {
562 if ( const ast::ObjectDecl * obj = mutType->params[i].as< ast::ObjectDecl >() ) {
563 if ( const ast::SingleInit * init = obj->init.as< ast::SingleInit >() ) {
564 if ( init->value->env == nullptr ) continue;
565 // clone initializer minus the initializer environment
566 auto mutParam = mutate( mutType->params[i].strict_as< ast::ObjectDecl >() );
567 auto mutInit = mutate( mutParam->init.strict_as< ast::SingleInit >() );
568 auto mutValue = mutate( mutInit->value.get() );
569
570 mutValue->env = nullptr;
571 mutInit->value = mutValue;
572 mutParam->init = mutInit;
573 mutType->params[i] = mutParam;
574
575 assert( ! mutType->params[i].strict_as< ast::ObjectDecl >()->init.strict_as< ast::SingleInit >()->value->env);
576 }
577 }
578 }
579 mutate_field(functionDecl, &ast::FunctionDecl::type, mutType);
580 return functionDecl;
581}
582
583const ast::ObjectDecl * Resolver::previsit( const ast::ObjectDecl * objectDecl ) {
584 // To handle initialization of routine pointers [e.g. int (*fp)(int) = foo()],
585 // class-variable `initContext` is changed multiple times because the LHS is analyzed
586 // twice. The second analysis changes `initContext` because a function type can contain
587 // object declarations in the return and parameter types. Therefore each value of
588 // `initContext` is retained so the type on the first analysis is preserved and used for
589 // selecting the RHS.
590 GuardValue( currentObject );
591
592 if ( inEnumDecl && dynamic_cast< const ast::EnumInstType * >( objectDecl->get_type() ) ) {
593 // enumerator initializers should not use the enum type to initialize, since the
594 // enum type is still incomplete at this point. Use `int` instead.
595
596 if ( auto enumBase = dynamic_cast< const ast::EnumInstType * >
597 ( objectDecl->get_type() )->base->base ) {
598 objectDecl = fixObjectType( objectDecl, context );
599 currentObject = ast::CurrentObject{
600 objectDecl->location,
601 enumBase
602 };
603 } else {
604 objectDecl = fixObjectType( objectDecl, context );
605 currentObject = ast::CurrentObject{
606 objectDecl->location, new ast::BasicType{ ast::BasicType::SignedInt } };
607 }
608 } else {
609 if ( !objectDecl->isTypeFixed ) {
610 auto newDecl = fixObjectType(objectDecl, context);
611 auto mutDecl = mutate(newDecl);
612
613 // generate CtorInit wrapper when necessary.
614 // in certain cases, fixObjectType is called before reaching
615 // this object in visitor pass, thus disabling CtorInit codegen.
616 // this happens on aggregate members and function parameters.
617 if ( InitTweak::tryConstruct( mutDecl ) && ( managedTypes.isManaged( mutDecl ) || ((! isInFunction() || mutDecl->storage.is_static ) && ! InitTweak::isConstExpr( mutDecl->init ) ) ) ) {
618 // constructed objects cannot be designated
619 if ( InitTweak::isDesignated( mutDecl->init ) ) {
620 ast::Pass<ResolveDesignators> res( context );
621 maybe_accept( mutDecl->init.get(), res );
622 if ( !res.core.result ) {
623 SemanticError( mutDecl, "Cannot include designations in the initializer for a managed Object.\n"
624 "If this is really what you want, initialize with @=." );
625 }
626 }
627 // constructed objects should not have initializers nested too deeply
628 if ( ! InitTweak::checkInitDepth( mutDecl ) ) SemanticError( mutDecl, "Managed object's initializer is too deep " );
629
630 mutDecl->init = InitTweak::genCtorInit( mutDecl->location, mutDecl );
631 }
632
633 objectDecl = mutDecl;
634 }
635 currentObject = ast::CurrentObject{ objectDecl->location, objectDecl->get_type() };
636 }
637
638 return objectDecl;
639}
640
641void Resolver::previsit( const ast::AggregateDecl * _aggDecl ) {
642 auto aggDecl = mutate(_aggDecl);
643 assertf(aggDecl == _aggDecl, "type declarations must be unique");
644
645 for (auto & member: aggDecl->members) {
646 // nested type decls are hoisted already. no need to do anything
647 if (auto obj = member.as<ast::ObjectDecl>()) {
648 member = fixObjectType(obj, context);
649 }
650 }
651}
652
653void Resolver::previsit( const ast::StructDecl * structDecl ) {
654 previsit(static_cast<const ast::AggregateDecl *>(structDecl));
655 managedTypes.handleStruct(structDecl);
656}
657
658void Resolver::previsit( const ast::EnumDecl * ) {
659 // in case we decide to allow nested enums
660 GuardValue( inEnumDecl );
661 inEnumDecl = true;
662 // don't need to fix types for enum fields
663}
664
665const ast::StaticAssertDecl * Resolver::previsit(
666 const ast::StaticAssertDecl * assertDecl
667) {
668 return ast::mutate_field(
669 assertDecl, &ast::StaticAssertDecl::cond,
670 findIntegralExpression( assertDecl->cond, context ) );
671}
672
673template< typename PtrType >
674const PtrType * handlePtrType( const PtrType * type, const ResolveContext & context ) {
675 if ( type->dimension ) {
676 const ast::Type * sizeType = context.global.sizeType.get();
677 ast::ptr< ast::Expr > dimension = findSingleExpression( type->dimension, sizeType, context );
678 assertf(dimension->env->empty(), "array dimension expr has nonempty env");
679 dimension.get_and_mutate()->env = nullptr;
680 ast::mutate_field( type, &PtrType::dimension, dimension );
681 }
682 return type;
683}
684
685const ast::ArrayType * Resolver::previsit( const ast::ArrayType * at ) {
686 return handlePtrType( at, context );
687}
688
689const ast::PointerType * Resolver::previsit( const ast::PointerType * pt ) {
690 return handlePtrType( pt, context );
691}
692
693const ast::ExprStmt * Resolver::previsit( const ast::ExprStmt * exprStmt ) {
694 visit_children = false;
695 assertf( exprStmt->expr, "ExprStmt has null expression in resolver" );
696
697 return ast::mutate_field(
698 exprStmt, &ast::ExprStmt::expr, findVoidExpression( exprStmt->expr, context ) );
699}
700
701const ast::AsmExpr * Resolver::previsit( const ast::AsmExpr * asmExpr ) {
702 visit_children = false;
703
704 asmExpr = ast::mutate_field(
705 asmExpr, &ast::AsmExpr::operand, findVoidExpression( asmExpr->operand, context ) );
706
707 return asmExpr;
708}
709
710const ast::AsmStmt * Resolver::previsit( const ast::AsmStmt * asmStmt ) {
711 visitor->maybe_accept( asmStmt, &ast::AsmStmt::input );
712 visitor->maybe_accept( asmStmt, &ast::AsmStmt::output );
713 visit_children = false;
714 return asmStmt;
715}
716
717const ast::IfStmt * Resolver::previsit( const ast::IfStmt * ifStmt ) {
718 return ast::mutate_field(
719 ifStmt, &ast::IfStmt::cond, findIntegralExpression( ifStmt->cond, context ) );
720}
721
722const ast::WhileDoStmt * Resolver::previsit( const ast::WhileDoStmt * whileDoStmt ) {
723 return ast::mutate_field(
724 whileDoStmt, &ast::WhileDoStmt::cond, findIntegralExpression( whileDoStmt->cond, context ) );
725}
726
727const ast::ForStmt * Resolver::previsit( const ast::ForStmt * forStmt ) {
728 if ( forStmt->cond ) {
729 forStmt = ast::mutate_field(
730 forStmt, &ast::ForStmt::cond, findIntegralExpression( forStmt->cond, context ) );
731 }
732
733 if ( forStmt->inc ) {
734 forStmt = ast::mutate_field(
735 forStmt, &ast::ForStmt::inc, findVoidExpression( forStmt->inc, context ) );
736 }
737
738 return forStmt;
739}
740
741const ast::SwitchStmt * Resolver::previsit( const ast::SwitchStmt * switchStmt ) {
742 GuardValue( currentObject );
743 switchStmt = ast::mutate_field(
744 switchStmt, &ast::SwitchStmt::cond,
745 findIntegralExpression( switchStmt->cond, context ) );
746 currentObject = ast::CurrentObject{ switchStmt->location, switchStmt->cond->result };
747 return switchStmt;
748}
749
750const ast::CaseClause * Resolver::previsit( const ast::CaseClause * caseStmt ) {
751 if ( caseStmt->cond ) {
752 std::deque< ast::InitAlternative > initAlts = currentObject.getOptions();
753 assertf( initAlts.size() == 1, "SwitchStmt did not correctly resolve an integral "
754 "expression." );
755
756 ast::ptr< ast::Expr > untyped =
757 new ast::CastExpr{ caseStmt->location, caseStmt->cond, initAlts.front().type };
758 ast::ptr< ast::Expr > newExpr = findSingleExpression( untyped, context );
759
760 // case condition cannot have a cast in C, so it must be removed here, regardless of
761 // whether it would perform a conversion.
762 if ( const ast::CastExpr * castExpr = newExpr.as< ast::CastExpr >() ) {
763 swap_and_save_env( newExpr, castExpr->arg );
764 }
765
766 caseStmt = ast::mutate_field( caseStmt, &ast::CaseClause::cond, newExpr );
767 }
768 return caseStmt;
769}
770
771const ast::BranchStmt * Resolver::previsit( const ast::BranchStmt * branchStmt ) {
772 visit_children = false;
773 // must resolve the argument of a computed goto
774 if ( branchStmt->kind == ast::BranchStmt::Goto && branchStmt->computedTarget ) {
775 // computed goto argument is void*
776 ast::ptr< ast::Type > target = new ast::PointerType{ new ast::VoidType{} };
777 branchStmt = ast::mutate_field(
778 branchStmt, &ast::BranchStmt::computedTarget,
779 findSingleExpression( branchStmt->computedTarget, target, context ) );
780 }
781 return branchStmt;
782}
783
784const ast::ReturnStmt * Resolver::previsit( const ast::ReturnStmt * returnStmt ) {
785 visit_children = false;
786 if ( returnStmt->expr ) {
787 returnStmt = ast::mutate_field(
788 returnStmt, &ast::ReturnStmt::expr,
789 findSingleExpression( returnStmt->expr, functionReturn, context ) );
790 }
791 return returnStmt;
792}
793
794const ast::ThrowStmt * Resolver::previsit( const ast::ThrowStmt * throwStmt ) {
795 visit_children = false;
796 if ( throwStmt->expr ) {
797 const ast::StructDecl * exceptionDecl =
798 symtab.lookupStruct( "__cfaehm_base_exception_t" );
799 assert( exceptionDecl );
800 ast::ptr< ast::Type > exceptType =
801 new ast::PointerType{ new ast::StructInstType{ exceptionDecl } };
802 throwStmt = ast::mutate_field(
803 throwStmt, &ast::ThrowStmt::expr,
804 findSingleExpression( throwStmt->expr, exceptType, context ) );
805 }
806 return throwStmt;
807}
808
809const ast::CatchClause * Resolver::previsit( const ast::CatchClause * catchClause ) {
810 // Until we are very sure this invarent (ifs that move between passes have then)
811 // holds, check it. This allows a check for when to decode the mangling.
812 if ( auto ifStmt = catchClause->body.as<ast::IfStmt>() ) {
813 assert( ifStmt->then );
814 }
815 // Encode the catchStmt so the condition can see the declaration.
816 if ( catchClause->cond ) {
817 ast::CatchClause * clause = mutate( catchClause );
818 clause->body = new ast::IfStmt( clause->location, clause->cond, nullptr, clause->body );
819 clause->cond = nullptr;
820 return clause;
821 }
822 return catchClause;
823}
824
825const ast::CatchClause * Resolver::postvisit( const ast::CatchClause * catchClause ) {
826 // Decode the catchStmt so everything is stored properly.
827 const ast::IfStmt * ifStmt = catchClause->body.as<ast::IfStmt>();
828 if ( nullptr != ifStmt && nullptr == ifStmt->then ) {
829 assert( ifStmt->cond );
830 assert( ifStmt->else_ );
831 ast::CatchClause * clause = ast::mutate( catchClause );
832 clause->cond = ifStmt->cond;
833 clause->body = ifStmt->else_;
834 // ifStmt should be implicately deleted here.
835 return clause;
836 }
837 return catchClause;
838}
839
840const ast::WaitForStmt * Resolver::previsit( const ast::WaitForStmt * stmt ) {
841 visit_children = false;
842
843 // Resolve all clauses first
844 for ( unsigned i = 0; i < stmt->clauses.size(); ++i ) {
845 const ast::WaitForClause & clause = *stmt->clauses[i];
846
847 ast::TypeEnvironment env;
848 CandidateFinder funcFinder( context, env );
849
850 // Find all candidates for a function in canonical form
851 funcFinder.find( clause.target, ResolveMode::withAdjustment() );
852
853 if ( funcFinder.candidates.empty() ) {
854 stringstream ss;
855 ss << "Use of undeclared indentifier '";
856 ss << clause.target.strict_as< ast::NameExpr >()->name;
857 ss << "' in call to waitfor";
858 SemanticError( stmt->location, ss.str() );
859 }
860
861 if ( clause.target_args.empty() ) {
862 SemanticError( stmt->location,
863 "Waitfor clause must have at least one mutex parameter");
864 }
865
866 // Find all alternatives for all arguments in canonical form
867 std::vector< CandidateFinder > argFinders =
868 funcFinder.findSubExprs( clause.target_args );
869
870 // List all combinations of arguments
871 std::vector< CandidateList > possibilities;
872 combos( argFinders.begin(), argFinders.end(), back_inserter( possibilities ) );
873
874 // For every possible function:
875 // * try matching the arguments to the parameters, not the other way around because
876 // more arguments than parameters
877 CandidateList funcCandidates;
878 std::vector< CandidateList > argsCandidates;
879 SemanticErrorException errors;
880 for ( CandidateRef & func : funcFinder.candidates ) {
881 try {
882 auto pointerType = dynamic_cast< const ast::PointerType * >(
883 func->expr->result->stripReferences() );
884 if ( ! pointerType ) {
885 SemanticError( stmt->location, func->expr->result.get(),
886 "candidate not viable: not a pointer type\n" );
887 }
888
889 auto funcType = pointerType->base.as< ast::FunctionType >();
890 if ( ! funcType ) {
891 SemanticError( stmt->location, func->expr->result.get(),
892 "candidate not viable: not a function type\n" );
893 }
894
895 {
896 auto param = funcType->params.begin();
897 auto paramEnd = funcType->params.end();
898
899 if( ! nextMutex( param, paramEnd ) ) {
900 SemanticError( stmt->location, funcType,
901 "candidate function not viable: no mutex parameters\n");
902 }
903 }
904
905 CandidateRef func2{ new Candidate{ *func } };
906 // strip reference from function
907 func2->expr = referenceToRvalueConversion( func->expr, func2->cost );
908
909 // Each argument must be matched with a parameter of the current candidate
910 for ( auto & argsList : possibilities ) {
911 try {
912 // Declare data structures needed for resolution
913 ast::OpenVarSet open;
914 ast::AssertionSet need, have;
915 ast::TypeEnvironment resultEnv{ func->env };
916 // Add all type variables as open so that those not used in the
917 // parameter list are still considered open
918 resultEnv.add( funcType->forall );
919
920 // load type variables from arguments into one shared space
921 for ( auto & arg : argsList ) {
922 resultEnv.simpleCombine( arg->env );
923 }
924
925 // Make sure we don't widen any existing bindings
926 resultEnv.forbidWidening();
927
928 // Find any unbound type variables
929 resultEnv.extractOpenVars( open );
930
931 auto param = funcType->params.begin();
932 auto paramEnd = funcType->params.end();
933
934 unsigned n_mutex_param = 0;
935
936 // For every argument of its set, check if it matches one of the
937 // parameters. The order is important
938 for ( auto & arg : argsList ) {
939 // Ignore non-mutex arguments
940 if ( ! nextMutex( param, paramEnd ) ) {
941 // We ran out of parameters but still have arguments.
942 // This function doesn't match
943 SemanticError( stmt->location, funcType,
944 toString("candidate function not viable: too many mutex "
945 "arguments, expected ", n_mutex_param, "\n" ) );
946 }
947
948 ++n_mutex_param;
949
950 // Check if the argument matches the parameter type in the current scope.
951 // ast::ptr< ast::Type > paramType = (*param)->get_type();
952
953 if (
954 ! unify(
955 arg->expr->result, *param, resultEnv, need, have, open )
956 ) {
957 // Type doesn't match
958 stringstream ss;
959 ss << "candidate function not viable: no known conversion "
960 "from '";
961 ast::print( ss, *param );
962 ss << "' to '";
963 ast::print( ss, arg->expr->result );
964 ss << "' with env '";
965 ast::print( ss, resultEnv );
966 ss << "'\n";
967 SemanticError( stmt->location, funcType, ss.str() );
968 }
969
970 ++param;
971 }
972
973 // All arguments match!
974
975 // Check if parameters are missing
976 if ( nextMutex( param, paramEnd ) ) {
977 do {
978 ++n_mutex_param;
979 ++param;
980 } while ( nextMutex( param, paramEnd ) );
981
982 // We ran out of arguments but still have parameters left; this
983 // function doesn't match
984 SemanticError( stmt->location, funcType,
985 toString( "candidate function not viable: too few mutex "
986 "arguments, expected ", n_mutex_param, "\n" ) );
987 }
988
989 // All parameters match!
990
991 // Finish the expressions to tie in proper environments
992 finishExpr( func2->expr, resultEnv );
993 for ( CandidateRef & arg : argsList ) {
994 finishExpr( arg->expr, resultEnv );
995 }
996
997 // This is a match, store it and save it for later
998 funcCandidates.emplace_back( std::move( func2 ) );
999 argsCandidates.emplace_back( std::move( argsList ) );
1000
1001 } catch ( SemanticErrorException & e ) {
1002 errors.append( e );
1003 }
1004 }
1005 } catch ( SemanticErrorException & e ) {
1006 errors.append( e );
1007 }
1008 }
1009
1010 // Make sure correct number of arguments
1011 if( funcCandidates.empty() ) {
1012 SemanticErrorException top( stmt->location,
1013 "No alternatives for function in call to waitfor" );
1014 top.append( errors );
1015 throw top;
1016 }
1017
1018 if( argsCandidates.empty() ) {
1019 SemanticErrorException top( stmt->location,
1020 "No alternatives for arguments in call to waitfor" );
1021 top.append( errors );
1022 throw top;
1023 }
1024
1025 if( funcCandidates.size() > 1 ) {
1026 SemanticErrorException top( stmt->location,
1027 "Ambiguous function in call to waitfor" );
1028 top.append( errors );
1029 throw top;
1030 }
1031 if( argsCandidates.size() > 1 ) {
1032 SemanticErrorException top( stmt->location,
1033 "Ambiguous arguments in call to waitfor" );
1034 top.append( errors );
1035 throw top;
1036 }
1037 // TODO: need to use findDeletedExpr to ensure no deleted identifiers are used.
1038
1039 // build new clause
1040 auto clause2 = new ast::WaitForClause( clause.location );
1041
1042 clause2->target = funcCandidates.front()->expr;
1043
1044 clause2->target_args.reserve( clause.target_args.size() );
1045 const ast::StructDecl * decl_monitor = symtab.lookupStruct( "monitor$" );
1046 for ( auto arg : argsCandidates.front() ) {
1047 const auto & loc = stmt->location;
1048
1049 ast::Expr * init = new ast::CastExpr( loc,
1050 new ast::UntypedExpr( loc,
1051 new ast::NameExpr( loc, "get_monitor" ),
1052 { arg->expr }
1053 ),
1054 new ast::PointerType(
1055 new ast::StructInstType(
1056 decl_monitor
1057 )
1058 )
1059 );
1060
1061 clause2->target_args.emplace_back( findSingleExpression( init, context ) );
1062 }
1063
1064 // Resolve the conditions as if it were an IfStmt, statements normally
1065 clause2->when_cond = findSingleExpression( clause.when_cond, context );
1066 clause2->stmt = clause.stmt->accept( *visitor );
1067
1068 // set results into stmt
1069 auto n = mutate( stmt );
1070 n->clauses[i] = clause2;
1071 stmt = n;
1072 }
1073
1074 if ( stmt->timeout_stmt ) {
1075 // resolve the timeout as a size_t, the conditions like IfStmt, and stmts normally
1076 ast::ptr< ast::Type > target =
1077 new ast::BasicType{ ast::BasicType::LongLongUnsignedInt };
1078 auto timeout_time = findSingleExpression( stmt->timeout_time, target, context );
1079 auto timeout_cond = findSingleExpression( stmt->timeout_cond, context );
1080 auto timeout_stmt = stmt->timeout_stmt->accept( *visitor );
1081
1082 // set results into stmt
1083 auto n = mutate( stmt );
1084 n->timeout_time = std::move( timeout_time );
1085 n->timeout_cond = std::move( timeout_cond );
1086 n->timeout_stmt = std::move( timeout_stmt );
1087 stmt = n;
1088 }
1089
1090 if ( stmt->else_stmt ) {
1091 // resolve the condition like IfStmt, stmts normally
1092 auto else_cond = findSingleExpression( stmt->else_cond, context );
1093 auto else_stmt = stmt->else_stmt->accept( *visitor );
1094
1095 // set results into stmt
1096 auto n = mutate( stmt );
1097 n->else_cond = std::move( else_cond );
1098 n->else_stmt = std::move( else_stmt );
1099 stmt = n;
1100 }
1101
1102 return stmt;
1103}
1104
1105const ast::WithStmt * Resolver::previsit( const ast::WithStmt * withStmt ) {
1106 auto mutStmt = mutate(withStmt);
1107 resolveWithExprs(mutStmt->exprs, stmtsToAddBefore);
1108 return mutStmt;
1109}
1110
1111void Resolver::resolveWithExprs(std::vector<ast::ptr<ast::Expr>> & exprs, std::list<ast::ptr<ast::Stmt>> & stmtsToAdd) {
1112 for (auto & expr : exprs) {
1113 // only struct- and union-typed expressions are viable candidates
1114 expr = findKindExpression( expr, context, structOrUnion, "with expression" );
1115
1116 // if with expression might be impure, create a temporary so that it is evaluated once
1117 if ( Tuples::maybeImpure( expr ) ) {
1118 static UniqueName tmpNamer( "_with_tmp_" );
1119 const CodeLocation loc = expr->location;
1120 auto tmp = new ast::ObjectDecl(loc, tmpNamer.newName(), expr->result, new ast::SingleInit(loc, expr ) );
1121 expr = new ast::VariableExpr( loc, tmp );
1122 stmtsToAdd.push_back( new ast::DeclStmt(loc, tmp ) );
1123 if ( InitTweak::isConstructable( tmp->type ) ) {
1124 // generate ctor/dtor and resolve them
1125 tmp->init = InitTweak::genCtorInit( loc, tmp );
1126 }
1127 // since tmp is freshly created, this should modify tmp in-place
1128 tmp->accept( *visitor );
1129 } else if (expr->env && expr->env->empty()) {
1130 expr = ast::mutate_field(expr.get(), &ast::Expr::env, nullptr);
1131 }
1132 }
1133}
1134
1135const ast::SingleInit * Resolver::previsit( const ast::SingleInit * singleInit ) {
1136 visit_children = false;
1137 // resolve initialization using the possibilities as determined by the `currentObject`
1138 // cursor.
1139 ast::ptr< ast::Expr > untyped = new ast::UntypedInitExpr{
1140 singleInit->location, singleInit->value, currentObject.getOptions() };
1141 ast::ptr<ast::Expr> newExpr = findSingleExpression( untyped, context );
1142 const ast::InitExpr * initExpr = newExpr.strict_as< ast::InitExpr >();
1143
1144 // move cursor to the object that is actually initialized
1145 currentObject.setNext( initExpr->designation );
1146
1147 // discard InitExpr wrapper and retain relevant pieces.
1148 // `initExpr` may have inferred params in the case where the expression specialized a
1149 // function pointer, and newExpr may already have inferParams of its own, so a simple
1150 // swap is not sufficient
1151 ast::Expr::InferUnion inferred = initExpr->inferred;
1152 swap_and_save_env( newExpr, initExpr->expr );
1153 newExpr.get_and_mutate()->inferred.splice( std::move(inferred) );
1154
1155 // get the actual object's type (may not exactly match what comes back from the resolver
1156 // due to conversions)
1157 const ast::Type * initContext = currentObject.getCurrentType();
1158
1159 removeExtraneousCast( newExpr );
1160
1161 // check if actual object's type is char[]
1162 if ( auto at = dynamic_cast< const ast::ArrayType * >( initContext ) ) {
1163 if ( isCharType( at->base ) ) {
1164 // check if the resolved type is char*
1165 if ( auto pt = newExpr->result.as< ast::PointerType >() ) {
1166 if ( isCharType( pt->base ) ) {
1167 // strip cast if we're initializing a char[] with a char*
1168 // e.g. char x[] = "hello"
1169 if ( auto ce = newExpr.as< ast::CastExpr >() ) {
1170 swap_and_save_env( newExpr, ce->arg );
1171 }
1172 }
1173 }
1174 }
1175 }
1176
1177 // move cursor to next object in preparation for next initializer
1178 currentObject.increment();
1179
1180 // set initializer expression to resolved expression
1181 return ast::mutate_field( singleInit, &ast::SingleInit::value, std::move(newExpr) );
1182}
1183
1184const ast::ListInit * Resolver::previsit( const ast::ListInit * listInit ) {
1185 // move cursor into brace-enclosed initializer-list
1186 currentObject.enterListInit( listInit->location );
1187
1188 assert( listInit->designations.size() == listInit->initializers.size() );
1189 for ( unsigned i = 0; i < listInit->designations.size(); ++i ) {
1190 // iterate designations and initializers in pairs, moving the cursor to the current
1191 // designated object and resolving the initializer against that object
1192 listInit = ast::mutate_field_index(
1193 listInit, &ast::ListInit::designations, i,
1194 currentObject.findNext( listInit->designations[i] ) );
1195 listInit = ast::mutate_field_index(
1196 listInit, &ast::ListInit::initializers, i,
1197 listInit->initializers[i]->accept( *visitor ) );
1198 }
1199
1200 // move cursor out of brace-enclosed initializer-list
1201 currentObject.exitListInit();
1202
1203 visit_children = false;
1204 return listInit;
1205}
1206
1207const ast::ConstructorInit * Resolver::previsit( const ast::ConstructorInit * ctorInit ) {
1208 visitor->maybe_accept( ctorInit, &ast::ConstructorInit::ctor );
1209 visitor->maybe_accept( ctorInit, &ast::ConstructorInit::dtor );
1210
1211 // found a constructor - can get rid of C-style initializer
1212 // xxx - Rob suggests this field is dead code
1213 ctorInit = ast::mutate_field( ctorInit, &ast::ConstructorInit::init, nullptr );
1214
1215 // intrinsic single-parameter constructors and destructors do nothing. Since this was
1216 // implicitly generated, there's no way for it to have side effects, so get rid of it to
1217 // clean up generated code
1218 if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->ctor ) ) {
1219 ctorInit = ast::mutate_field( ctorInit, &ast::ConstructorInit::ctor, nullptr );
1220 }
1221 if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->dtor ) ) {
1222 ctorInit = ast::mutate_field( ctorInit, &ast::ConstructorInit::dtor, nullptr );
1223 }
1224
1225 return ctorInit;
1226}
1227
1228// suppress error on autogen functions and mark invalid autogen as deleted.
1229bool Resolver::on_error(ast::ptr<ast::Decl> & decl) {
1230 if (auto functionDecl = decl.as<ast::FunctionDecl>()) {
1231 // xxx - can intrinsic gen ever fail?
1232 if (functionDecl->linkage == ast::Linkage::AutoGen) {
1233 auto mutDecl = mutate(functionDecl);
1234 mutDecl->isDeleted = true;
1235 mutDecl->stmts = nullptr;
1236 decl = mutDecl;
1237 return false;
1238 }
1239 }
1240 return true;
1241}
1242
1243} // namespace ResolvExpr
1244
1245// Local Variables: //
1246// tab-width: 4 //
1247// mode: c++ //
1248// compile-command: "make install" //
1249// End: //
Note: See TracBrowser for help on using the repository browser.