source: src/ResolvExpr/CandidateFinder.cpp@ b9e2b87

ADT ast-experimental pthread-emulation qualifiedEnum
Last change on this file since b9e2b87 was b9f8274, checked in by Andrew Beach <ajbeach@…>, 3 years ago

Removed the validate sub-pass interface. This also showed an extra include in CandidateFinder, also removed.
  • Property mode set to 100644
File size: 68.3 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// CandidateFinder.cpp --
8//
9// Author : Aaron B. Moss
10// Created On : Wed Jun 5 14:30:00 2019
11// Last Modified By : Andrew Beach
12// Last Modified On : Wed Mar 16 11:58:00 2022
13// Update Count : 3
14//
15
16#include "CandidateFinder.hpp"
17
18#include <deque>
19#include <iterator> // for back_inserter
20#include <sstream>
21#include <string>
22#include <unordered_map>
23#include <vector>
24
25#include "Candidate.hpp"
26#include "CompilationState.h"
27#include "Cost.h"
28#include "ExplodedArg.hpp"
29#include "RenameVars.h" // for renameTyVars
30#include "Resolver.h"
31#include "ResolveTypeof.h"
32#include "SatisfyAssertions.hpp"
33#include "typeops.h" // for adjustExprType, conversionCost, polyCost, specCost
34#include "Unify.h"
35#include "AST/Expr.hpp"
36#include "AST/Node.hpp"
37#include "AST/Pass.hpp"
38#include "AST/Print.hpp"
39#include "AST/SymbolTable.hpp"
40#include "AST/Type.hpp"
41#include "Common/utility.h" // for move, copy
42#include "SymTab/Mangler.h"
43#include "Tuples/Tuples.h" // for handleTupleAssignment
44#include "InitTweak/InitTweak.h" // for getPointerBase
45
46#include "Common/Stats/Counter.h"
47
48#define PRINT( text ) if ( resolvep ) { text }
49
50namespace ResolvExpr {
51
52const ast::Expr * referenceToRvalueConversion( const ast::Expr * expr, Cost & cost ) {
53 if ( expr->result.as< ast::ReferenceType >() ) {
54 // cast away reference from expr
55 cost.incReference();
56 return new ast::CastExpr{ expr, expr->result->stripReferences() };
57 }
58
59 return expr;
60}
61
62/// Unique identifier for matching expression resolutions to their requesting expression
63UniqueId globalResnSlot = 0;
64
65Cost computeConversionCost(
66 const ast::Type * argType, const ast::Type * paramType, bool argIsLvalue,
67 const ast::SymbolTable & symtab, const ast::TypeEnvironment & env
68) {
69 PRINT(
70 std::cerr << std::endl << "converting ";
71 ast::print( std::cerr, argType, 2 );
72 std::cerr << std::endl << " to ";
73 ast::print( std::cerr, paramType, 2 );
74 std::cerr << std::endl << "environment is: ";
75 ast::print( std::cerr, env, 2 );
76 std::cerr << std::endl;
77 )
78 Cost convCost = conversionCost( argType, paramType, argIsLvalue, symtab, env );
79 PRINT(
80 std::cerr << std::endl << "cost is " << convCost << std::endl;
81 )
82 if ( convCost == Cost::infinity ) return convCost;
83 convCost.incPoly( polyCost( paramType, symtab, env ) + polyCost( argType, symtab, env ) );
84 PRINT(
85 std::cerr << "cost with polycost is " << convCost << std::endl;
86 )
87 return convCost;
88}
89
90namespace {
91 /// First index is which argument, second is which alternative, third is which exploded element
92 using ExplodedArgs_new = std::deque< std::vector< ExplodedArg > >;
93
94 /// Returns a list of alternatives with the minimum cost in the given list
95 CandidateList findMinCost( const CandidateList & candidates ) {
96 CandidateList out;
97 Cost minCost = Cost::infinity;
98 for ( const CandidateRef & r : candidates ) {
99 if ( r->cost < minCost ) {
100 minCost = r->cost;
101 out.clear();
102 out.emplace_back( r );
103 } else if ( r->cost == minCost ) {
104 out.emplace_back( r );
105 }
106 }
107 return out;
108 }
109
110 /// Computes conversion cost for a given expression to a given type
111 const ast::Expr * computeExpressionConversionCost(
112 const ast::Expr * arg, const ast::Type * paramType, const ast::SymbolTable & symtab, const ast::TypeEnvironment & env, Cost & outCost
113 ) {
114 Cost convCost = computeConversionCost(
115 arg->result, paramType, arg->get_lvalue(), symtab, env );
116 outCost += convCost;
117
118 // If there is a non-zero conversion cost, ignoring poly cost, then the expression requires
119 // conversion. Ignore poly cost for now, since this requires resolution of the cast to
120 // infer parameters and this does not currently work for the reason stated below
121 Cost tmpCost = convCost;
122 tmpCost.incPoly( -tmpCost.get_polyCost() );
123 if ( tmpCost != Cost::zero ) {
124 ast::ptr< ast::Type > newType = paramType;
125 env.apply( newType );
126 return new ast::CastExpr{ arg, newType };
127
128 // xxx - *should* be able to resolve this cast, but at the moment pointers are not
129 // castable to zero_t, but are implicitly convertible. This is clearly inconsistent,
130 // once this is fixed it should be possible to resolve the cast.
131 // xxx - this isn't working, it appears because type1 (parameter) is seen as widenable,
132 // but it shouldn't be because this makes the conversion from DT* to DT* since
133 // commontype(zero_t, DT*) is DT*, rather than nothing
134
135 // CandidateFinder finder{ symtab, env };
136 // finder.find( arg, ResolvMode::withAdjustment() );
137 // assertf( finder.candidates.size() > 0,
138 // "Somehow castable expression failed to find alternatives." );
139 // assertf( finder.candidates.size() == 1,
140 // "Somehow got multiple alternatives for known cast expression." );
141 // return finder.candidates.front()->expr;
142 }
143
144 return arg;
145 }
146
147 /// Computes conversion cost for a given candidate
148 Cost computeApplicationConversionCost(
149 CandidateRef cand, const ast::SymbolTable & symtab
150 ) {
151 auto appExpr = cand->expr.strict_as< ast::ApplicationExpr >();
152 auto pointer = appExpr->func->result.strict_as< ast::PointerType >();
153 auto function = pointer->base.strict_as< ast::FunctionType >();
154
155 Cost convCost = Cost::zero;
156 const auto & params = function->params;
157 auto param = params.begin();
158 auto & args = appExpr->args;
159
160 for ( unsigned i = 0; i < args.size(); ++i ) {
161 const ast::Type * argType = args[i]->result;
162 PRINT(
163 std::cerr << "arg expression:" << std::endl;
164 ast::print( std::cerr, args[i], 2 );
165 std::cerr << "--- results are" << std::endl;
166 ast::print( std::cerr, argType, 2 );
167 )
168
169 if ( param == params.end() ) {
170 if ( function->isVarArgs ) {
171 convCost.incUnsafe();
172 PRINT( std::cerr << "end of params with varargs function: inc unsafe: "
173 << convCost << std::endl; ; )
174 // convert reference-typed expressions into value-typed expressions
175 cand->expr = ast::mutate_field_index(
176 appExpr, &ast::ApplicationExpr::args, i,
177 referenceToRvalueConversion( args[i], convCost ) );
178 continue;
179 } else return Cost::infinity;
180 }
181
182 if ( auto def = args[i].as< ast::DefaultArgExpr >() ) {
183 // Default arguments should be free - don't include conversion cost.
184 // Unwrap them here because they are not relevant to the rest of the system
185 cand->expr = ast::mutate_field_index(
186 appExpr, &ast::ApplicationExpr::args, i, def->expr );
187 ++param;
188 continue;
189 }
190
191 // mark conversion cost and also specialization cost of param type
192 // const ast::Type * paramType = (*param)->get_type();
193 cand->expr = ast::mutate_field_index(
194 appExpr, &ast::ApplicationExpr::args, i,
195 computeExpressionConversionCost(
196 args[i], *param, symtab, cand->env, convCost ) );
197 convCost.decSpec( specCost( *param ) );
198 ++param; // can't be in for-loop update because of the continue
199 }
200
201 if ( param != params.end() ) return Cost::infinity;
202
203 // specialization cost of return types can't be accounted for directly, it disables
204 // otherwise-identical calls, like this example based on auto-newline in the I/O lib:
205 //
206 // forall(otype OS) {
207 // void ?|?(OS&, int); // with newline
208 // OS& ?|?(OS&, int); // no newline, always chosen due to more specialization
209 // }
210
211 // mark type variable and specialization cost of forall clause
212 convCost.incVar( function->forall.size() );
213 convCost.decSpec( function->assertions.size() );
214
215 return convCost;
216 }
217
218 void makeUnifiableVars(
219 const ast::FunctionType * type, ast::OpenVarSet & unifiableVars,
220 ast::AssertionSet & need
221 ) {
222 for ( auto & tyvar : type->forall ) {
223 unifiableVars[ *tyvar ] = ast::TypeDecl::Data{ tyvar->base };
224 }
225 for ( auto & assn : type->assertions ) {
226 need[ assn ].isUsed = true;
227 }
228 }
229
230 /// Gets a default value from an initializer, nullptr if not present
231 const ast::ConstantExpr * getDefaultValue( const ast::Init * init ) {
232 if ( auto si = dynamic_cast< const ast::SingleInit * >( init ) ) {
233 if ( auto ce = si->value.as< ast::CastExpr >() ) {
234 return ce->arg.as< ast::ConstantExpr >();
235 } else {
236 return si->value.as< ast::ConstantExpr >();
237 }
238 }
239 return nullptr;
240 }
241
242 /// State to iteratively build a match of parameter expressions to arguments
243 struct ArgPack {
244 std::size_t parent; ///< Index of parent pack
245 ast::ptr< ast::Expr > expr; ///< The argument stored here
246 Cost cost; ///< The cost of this argument
247 ast::TypeEnvironment env; ///< Environment for this pack
248 ast::AssertionSet need; ///< Assertions outstanding for this pack
249 ast::AssertionSet have; ///< Assertions found for this pack
250 ast::OpenVarSet open; ///< Open variables for this pack
251 unsigned nextArg; ///< Index of next argument in arguments list
252 unsigned tupleStart; ///< Number of tuples that start at this index
253 unsigned nextExpl; ///< Index of next exploded element
254 unsigned explAlt; ///< Index of alternative for nextExpl > 0
255
256 ArgPack()
257 : parent( 0 ), expr(), cost( Cost::zero ), env(), need(), have(), open(), nextArg( 0 ),
258 tupleStart( 0 ), nextExpl( 0 ), explAlt( 0 ) {}
259
260 ArgPack(
261 const ast::TypeEnvironment & env, const ast::AssertionSet & need,
262 const ast::AssertionSet & have, const ast::OpenVarSet & open )
263 : parent( 0 ), expr(), cost( Cost::zero ), env( env ), need( need ), have( have ),
264 open( open ), nextArg( 0 ), tupleStart( 0 ), nextExpl( 0 ), explAlt( 0 ) {}
265
266 ArgPack(
267 std::size_t parent, const ast::Expr * expr, ast::TypeEnvironment && env,
268 ast::AssertionSet && need, ast::AssertionSet && have, ast::OpenVarSet && open,
269 unsigned nextArg, unsigned tupleStart = 0, Cost cost = Cost::zero,
270 unsigned nextExpl = 0, unsigned explAlt = 0 )
271 : parent(parent), expr( expr ), cost( cost ), env( move( env ) ), need( move( need ) ),
272 have( move( have ) ), open( move( open ) ), nextArg( nextArg ), tupleStart( tupleStart ),
273 nextExpl( nextExpl ), explAlt( explAlt ) {}
274
275 ArgPack(
276 const ArgPack & o, ast::TypeEnvironment && env, ast::AssertionSet && need,
277 ast::AssertionSet && have, ast::OpenVarSet && open, unsigned nextArg, Cost added )
278 : parent( o.parent ), expr( o.expr ), cost( o.cost + added ), env( move( env ) ),
279 need( move( need ) ), have( move( have ) ), open( move( open ) ), nextArg( nextArg ),
280 tupleStart( o.tupleStart ), nextExpl( 0 ), explAlt( 0 ) {}
281
282 /// true if this pack is in the middle of an exploded argument
283 bool hasExpl() const { return nextExpl > 0; }
284
285 /// Gets the list of exploded candidates for this pack
286 const ExplodedArg & getExpl( const ExplodedArgs_new & args ) const {
287 return args[ nextArg-1 ][ explAlt ];
288 }
289
290 /// Ends a tuple expression, consolidating the appropriate args
291 void endTuple( const std::vector< ArgPack > & packs ) {
292 // add all expressions in tuple to list, summing cost
293 std::deque< const ast::Expr * > exprs;
294 const ArgPack * pack = this;
295 if ( expr ) { exprs.emplace_front( expr ); }
296 while ( pack->tupleStart == 0 ) {
297 pack = &packs[pack->parent];
298 exprs.emplace_front( pack->expr );
299 cost += pack->cost;
300 }
301 // reset pack to appropriate tuple
302 std::vector< ast::ptr< ast::Expr > > exprv( exprs.begin(), exprs.end() );
303 expr = new ast::TupleExpr{ expr->location, move( exprv ) };
304 tupleStart = pack->tupleStart - 1;
305 parent = pack->parent;
306 }
307 };
308
309 /// Instantiates an argument to match a parameter, returns false if no matching results left
310 bool instantiateArgument(
311 const ast::Type * paramType, const ast::Init * init, const ExplodedArgs_new & args,
312 std::vector< ArgPack > & results, std::size_t & genStart, const ast::SymbolTable & symtab,
313 unsigned nTuples = 0
314 ) {
315 if ( auto tupleType = dynamic_cast< const ast::TupleType * >( paramType ) ) {
316 // paramType is a TupleType -- group args into a TupleExpr
317 ++nTuples;
318 for ( const ast::Type * type : *tupleType ) {
319 // xxx - dropping initializer changes behaviour from previous, but seems correct
320 // ^^^ need to handle the case where a tuple has a default argument
321 if ( ! instantiateArgument(
322 type, nullptr, args, results, genStart, symtab, nTuples ) ) return false;
323 nTuples = 0;
324 }
325 // re-constitute tuples for final generation
326 for ( auto i = genStart; i < results.size(); ++i ) {
327 results[i].endTuple( results );
328 }
329 return true;
330 } else if ( const ast::TypeInstType * ttype = Tuples::isTtype( paramType ) ) {
331 // paramType is a ttype, consumes all remaining arguments
332
333 // completed tuples; will be spliced to end of results to finish
334 std::vector< ArgPack > finalResults{};
335
336 // iterate until all results completed
337 std::size_t genEnd;
338 ++nTuples;
339 do {
340 genEnd = results.size();
341
342 // add another argument to results
343 for ( std::size_t i = genStart; i < genEnd; ++i ) {
344 unsigned nextArg = results[i].nextArg;
345
346 // use next element of exploded tuple if present
347 if ( results[i].hasExpl() ) {
348 const ExplodedArg & expl = results[i].getExpl( args );
349
350 unsigned nextExpl = results[i].nextExpl + 1;
351 if ( nextExpl == expl.exprs.size() ) { nextExpl = 0; }
352
353 results.emplace_back(
354 i, expl.exprs[ results[i].nextExpl ], copy( results[i].env ),
355 copy( results[i].need ), copy( results[i].have ),
356 copy( results[i].open ), nextArg, nTuples, Cost::zero, nextExpl,
357 results[i].explAlt );
358
359 continue;
360 }
361
362 // finish result when out of arguments
363 if ( nextArg >= args.size() ) {
364 ArgPack newResult{
365 results[i].env, results[i].need, results[i].have, results[i].open };
366 newResult.nextArg = nextArg;
367 const ast::Type * argType = nullptr;
368
369 if ( nTuples > 0 || ! results[i].expr ) {
370 // first iteration or no expression to clone,
371 // push empty tuple expression
372 newResult.parent = i;
373 newResult.expr = new ast::TupleExpr{ CodeLocation{}, {} };
374 argType = newResult.expr->result;
375 } else {
376 // clone result to collect tuple
377 newResult.parent = results[i].parent;
378 newResult.cost = results[i].cost;
379 newResult.tupleStart = results[i].tupleStart;
380 newResult.expr = results[i].expr;
381 argType = newResult.expr->result;
382
383 if ( results[i].tupleStart > 0 && Tuples::isTtype( argType ) ) {
384 // the case where a ttype value is passed directly is special,
385 // e.g. for argument forwarding purposes
386 // xxx - what if passing multiple arguments, last of which is
387 // ttype?
388 // xxx - what would happen if unify was changed so that unifying
389 // tuple
390 // types flattened both before unifying lists? then pass in
391 // TupleType (ttype) below.
392 --newResult.tupleStart;
393 } else {
394 // collapse leftover arguments into tuple
395 newResult.endTuple( results );
396 argType = newResult.expr->result;
397 }
398 }
399
400 // check unification for ttype before adding to final
401 if (
402 unify(
403 ttype, argType, newResult.env, newResult.need, newResult.have,
404 newResult.open, symtab )
405 ) {
406 finalResults.emplace_back( move( newResult ) );
407 }
408
409 continue;
410 }
411
412 // add each possible next argument
413 for ( std::size_t j = 0; j < args[nextArg].size(); ++j ) {
414 const ExplodedArg & expl = args[nextArg][j];
415
416 // fresh copies of parent parameters for this iteration
417 ast::TypeEnvironment env = results[i].env;
418 ast::OpenVarSet open = results[i].open;
419
420 env.addActual( expl.env, open );
421
422 // skip empty tuple arguments by (nearly) cloning parent into next gen
423 if ( expl.exprs.empty() ) {
424 results.emplace_back(
425 results[i], move( env ), copy( results[i].need ),
426 copy( results[i].have ), move( open ), nextArg + 1, expl.cost );
427
428 continue;
429 }
430
431 // add new result
432 results.emplace_back(
433 i, expl.exprs.front(), move( env ), copy( results[i].need ),
434 copy( results[i].have ), move( open ), nextArg + 1, nTuples,
435 expl.cost, expl.exprs.size() == 1 ? 0 : 1, j );
436 }
437 }
438
439 // reset for next round
440 genStart = genEnd;
441 nTuples = 0;
442 } while ( genEnd != results.size() );
443
444 // splice final results onto results
445 for ( std::size_t i = 0; i < finalResults.size(); ++i ) {
446 results.emplace_back( move( finalResults[i] ) );
447 }
448 return ! finalResults.empty();
449 }
450
451 // iterate each current subresult
452 std::size_t genEnd = results.size();
453 for ( std::size_t i = genStart; i < genEnd; ++i ) {
454 unsigned nextArg = results[i].nextArg;
455
456 // use remainder of exploded tuple if present
457 if ( results[i].hasExpl() ) {
458 const ExplodedArg & expl = results[i].getExpl( args );
459 const ast::Expr * expr = expl.exprs[ results[i].nextExpl ];
460
461 ast::TypeEnvironment env = results[i].env;
462 ast::AssertionSet need = results[i].need, have = results[i].have;
463 ast::OpenVarSet open = results[i].open;
464
465 const ast::Type * argType = expr->result;
466
467 PRINT(
468 std::cerr << "param type is ";
469 ast::print( std::cerr, paramType );
470 std::cerr << std::endl << "arg type is ";
471 ast::print( std::cerr, argType );
472 std::cerr << std::endl;
473 )
474
475 if ( unify( paramType, argType, env, need, have, open, symtab ) ) {
476 unsigned nextExpl = results[i].nextExpl + 1;
477 if ( nextExpl == expl.exprs.size() ) { nextExpl = 0; }
478
479 results.emplace_back(
480 i, expr, move( env ), move( need ), move( have ), move( open ), nextArg,
481 nTuples, Cost::zero, nextExpl, results[i].explAlt );
482 }
483
484 continue;
485 }
486
487 // use default initializers if out of arguments
488 if ( nextArg >= args.size() ) {
489 if ( const ast::ConstantExpr * cnst = getDefaultValue( init ) ) {
490 ast::TypeEnvironment env = results[i].env;
491 ast::AssertionSet need = results[i].need, have = results[i].have;
492 ast::OpenVarSet open = results[i].open;
493
494 if ( unify( paramType, cnst->result, env, need, have, open, symtab ) ) {
495 results.emplace_back(
496 i, new ast::DefaultArgExpr{ cnst->location, cnst }, move( env ),
497 move( need ), move( have ), move( open ), nextArg, nTuples );
498 }
499 }
500
501 continue;
502 }
503
504 // Check each possible next argument
505 for ( std::size_t j = 0; j < args[nextArg].size(); ++j ) {
506 const ExplodedArg & expl = args[nextArg][j];
507
508 // fresh copies of parent parameters for this iteration
509 ast::TypeEnvironment env = results[i].env;
510 ast::AssertionSet need = results[i].need, have = results[i].have;
511 ast::OpenVarSet open = results[i].open;
512
513 env.addActual( expl.env, open );
514
515 // skip empty tuple arguments by (nearly) cloning parent into next gen
516 if ( expl.exprs.empty() ) {
517 results.emplace_back(
518 results[i], move( env ), move( need ), move( have ), move( open ),
519 nextArg + 1, expl.cost );
520
521 continue;
522 }
523
524 // consider only first exploded arg
525 const ast::Expr * expr = expl.exprs.front();
526 const ast::Type * argType = expr->result;
527
528 PRINT(
529 std::cerr << "param type is ";
530 ast::print( std::cerr, paramType );
531 std::cerr << std::endl << "arg type is ";
532 ast::print( std::cerr, argType );
533 std::cerr << std::endl;
534 )
535
536 // attempt to unify types
537 if ( unify( paramType, argType, env, need, have, open, symtab ) ) {
538 // add new result
539 results.emplace_back(
540 i, expr, move( env ), move( need ), move( have ), move( open ),
541 nextArg + 1, nTuples, expl.cost, expl.exprs.size() == 1 ? 0 : 1, j );
542 }
543 }
544 }
545
546 // reset for next parameter
547 genStart = genEnd;
548
549 return genEnd != results.size(); // were any new results added?
550 }
551
552 /// Generate a cast expression from `arg` to `toType`
553 const ast::Expr * restructureCast(
554 ast::ptr< ast::Expr > & arg, const ast::Type * toType, ast::GeneratedFlag isGenerated = ast::GeneratedCast
555 ) {
556 if (
557 arg->result->size() > 1
558 && ! toType->isVoid()
559 && ! dynamic_cast< const ast::ReferenceType * >( toType )
560 ) {
561 // Argument is a tuple and the target type is neither void nor a reference. Cast each
562 // member of the tuple to its corresponding target type, producing the tuple of those
563 // cast expressions. If there are more components of the tuple than components in the
564 // target type, then excess components do not come out in the result expression (but
565 // UniqueExpr ensures that the side effects will still be produced)
566 if ( Tuples::maybeImpureIgnoreUnique( arg ) ) {
567 // expressions which may contain side effects require a single unique instance of
568 // the expression
569 arg = new ast::UniqueExpr{ arg->location, arg };
570 }
571 std::vector< ast::ptr< ast::Expr > > components;
572 for ( unsigned i = 0; i < toType->size(); ++i ) {
573 // cast each component
574 ast::ptr< ast::Expr > idx = new ast::TupleIndexExpr{ arg->location, arg, i };
575 components.emplace_back(
576 restructureCast( idx, toType->getComponent( i ), isGenerated ) );
577 }
578 return new ast::TupleExpr{ arg->location, move( components ) };
579 } else {
580 // handle normally
581 return new ast::CastExpr{ arg->location, arg, toType, isGenerated };
582 }
583 }
584
585 /// Gets the name from an untyped member expression (must be NameExpr)
586 const std::string & getMemberName( const ast::UntypedMemberExpr * memberExpr ) {
587 if ( memberExpr->member.as< ast::ConstantExpr >() ) {
588 SemanticError( memberExpr, "Indexed access to struct fields unsupported: " );
589 }
590
591 return memberExpr->member.strict_as< ast::NameExpr >()->name;
592 }
593
594 /// Actually visits expressions to find their candidate interpretations
595 class Finder final : public ast::WithShortCircuiting {
596 const ResolveContext & context;
597 const ast::SymbolTable & symtab;
598 public:
599 // static size_t traceId;
600 CandidateFinder & selfFinder;
601 CandidateList & candidates;
602 const ast::TypeEnvironment & tenv;
603 ast::ptr< ast::Type > & targetType;
604
605 enum Errors {
606 NotFound,
607 NoMatch,
608 ArgsToFew,
609 ArgsToMany,
610 RetsToFew,
611 RetsToMany,
612 NoReason
613 };
614
615 struct {
616 Errors code = NotFound;
617 } reason;
618
619 Finder( CandidateFinder & f )
620 : context( f.context ), symtab( context.symtab ), selfFinder( f ),
621 candidates( f.candidates ), tenv( f.env ), targetType( f.targetType ) {}
622
623 void previsit( const ast::Node * ) { visit_children = false; }
624
625 /// Convenience to add candidate to list
626 template<typename... Args>
627 void addCandidate( Args &&... args ) {
628 candidates.emplace_back( new Candidate{ std::forward<Args>( args )... } );
629 reason.code = NoReason;
630 }
631
632 void postvisit( const ast::ApplicationExpr * applicationExpr ) {
633 addCandidate( applicationExpr, tenv );
634 }
635
636 /// Set up candidate assertions for inference
637 void inferParameters( CandidateRef & newCand, CandidateList & out ) {
638 // Set need bindings for any unbound assertions
639 UniqueId crntResnSlot = 0; // matching ID for this expression's assertions
640 for ( auto & assn : newCand->need ) {
641 // skip already-matched assertions
642 if ( assn.second.resnSlot != 0 ) continue;
643 // assign slot for expression if needed
644 if ( crntResnSlot == 0 ) { crntResnSlot = ++globalResnSlot; }
645 // fix slot to assertion
646 assn.second.resnSlot = crntResnSlot;
647 }
648 // pair slot to expression
649 if ( crntResnSlot != 0 ) {
650 newCand->expr.get_and_mutate()->inferred.resnSlots().emplace_back( crntResnSlot );
651 }
652
653 // add to output list; assertion satisfaction will occur later
654 out.emplace_back( newCand );
655 }
656
657 /// Completes a function candidate with arguments located
658 void validateFunctionCandidate(
659 const CandidateRef & func, ArgPack & result, const std::vector< ArgPack > & results,
660 CandidateList & out
661 ) {
662 ast::ApplicationExpr * appExpr =
663 new ast::ApplicationExpr{ func->expr->location, func->expr };
664 // sum cost and accumulate arguments
665 std::deque< const ast::Expr * > args;
666 Cost cost = func->cost;
667 const ArgPack * pack = &result;
668 while ( pack->expr ) {
669 args.emplace_front( pack->expr );
670 cost += pack->cost;
671 pack = &results[pack->parent];
672 }
673 std::vector< ast::ptr< ast::Expr > > vargs( args.begin(), args.end() );
674 appExpr->args = move( vargs );
675 // build and validate new candidate
676 auto newCand =
677 std::make_shared<Candidate>( appExpr, result.env, result.open, result.need, cost );
678 PRINT(
679 std::cerr << "instantiate function success: " << appExpr << std::endl;
680 std::cerr << "need assertions:" << std::endl;
681 ast::print( std::cerr, result.need, 2 );
682 )
683 inferParameters( newCand, out );
684 }
685
686 /// Builds a list of candidates for a function, storing them in out
687 void makeFunctionCandidates(
688 const CandidateRef & func, const ast::FunctionType * funcType,
689 const ExplodedArgs_new & args, CandidateList & out
690 ) {
691 ast::OpenVarSet funcOpen;
692 ast::AssertionSet funcNeed, funcHave;
693 ast::TypeEnvironment funcEnv{ func->env };
694 makeUnifiableVars( funcType, funcOpen, funcNeed );
695 // add all type variables as open variables now so that those not used in the
696 // parameter list are still considered open
697 funcEnv.add( funcType->forall );
698
699 if ( targetType && ! targetType->isVoid() && ! funcType->returns.empty() ) {
700 // attempt to narrow based on expected target type
701 const ast::Type * returnType = funcType->returns.front();
702 if ( ! unify(
703 returnType, targetType, funcEnv, funcNeed, funcHave, funcOpen, symtab )
704 ) {
705 // unification failed, do not pursue this candidate
706 return;
707 }
708 }
709
710 // iteratively build matches, one parameter at a time
711 std::vector< ArgPack > results;
712 results.emplace_back( funcEnv, funcNeed, funcHave, funcOpen );
713 std::size_t genStart = 0;
714
715 // xxx - how to handle default arg after change to ftype representation?
716 if (const ast::VariableExpr * varExpr = func->expr.as<ast::VariableExpr>()) {
717 if (const ast::FunctionDecl * funcDecl = varExpr->var.as<ast::FunctionDecl>()) {
718 // function may have default args only if directly calling by name
719 // must use types on candidate however, due to RenameVars substitution
720 auto nParams = funcType->params.size();
721
722 for (size_t i=0; i<nParams; ++i) {
723 auto obj = funcDecl->params[i].strict_as<ast::ObjectDecl>();
724 if (!instantiateArgument(
725 funcType->params[i], obj->init, args, results, genStart, symtab)) return;
726 }
727 goto endMatch;
728 }
729 }
730 for ( const auto & param : funcType->params ) {
731 // Try adding the arguments corresponding to the current parameter to the existing
732 // matches
733 // no default args for indirect calls
734 if ( ! instantiateArgument(
735 param, nullptr, args, results, genStart, symtab ) ) return;
736 }
737
738 endMatch:
739 if ( funcType->isVarArgs ) {
740 // append any unused arguments to vararg pack
741 std::size_t genEnd;
742 do {
743 genEnd = results.size();
744
745 // iterate results
746 for ( std::size_t i = genStart; i < genEnd; ++i ) {
747 unsigned nextArg = results[i].nextArg;
748
749 // use remainder of exploded tuple if present
750 if ( results[i].hasExpl() ) {
751 const ExplodedArg & expl = results[i].getExpl( args );
752
753 unsigned nextExpl = results[i].nextExpl + 1;
754 if ( nextExpl == expl.exprs.size() ) { nextExpl = 0; }
755
756 results.emplace_back(
757 i, expl.exprs[ results[i].nextExpl ], copy( results[i].env ),
758 copy( results[i].need ), copy( results[i].have ),
759 copy( results[i].open ), nextArg, 0, Cost::zero, nextExpl,
760 results[i].explAlt );
761
762 continue;
763 }
764
765 // finish result when out of arguments
766 if ( nextArg >= args.size() ) {
767 validateFunctionCandidate( func, results[i], results, out );
768
769 continue;
770 }
771
772 // add each possible next argument
773 for ( std::size_t j = 0; j < args[nextArg].size(); ++j ) {
774 const ExplodedArg & expl = args[nextArg][j];
775
776 // fresh copies of parent parameters for this iteration
777 ast::TypeEnvironment env = results[i].env;
778 ast::OpenVarSet open = results[i].open;
779
780 env.addActual( expl.env, open );
781
782 // skip empty tuple arguments by (nearly) cloning parent into next gen
783 if ( expl.exprs.empty() ) {
784 results.emplace_back(
785 results[i], move( env ), copy( results[i].need ),
786 copy( results[i].have ), move( open ), nextArg + 1,
787 expl.cost );
788
789 continue;
790 }
791
792 // add new result
793 results.emplace_back(
794 i, expl.exprs.front(), move( env ), copy( results[i].need ),
795 copy( results[i].have ), move( open ), nextArg + 1, 0, expl.cost,
796 expl.exprs.size() == 1 ? 0 : 1, j );
797 }
798 }
799
800 genStart = genEnd;
801 } while( genEnd != results.size() );
802 } else {
803 // filter out the results that don't use all the arguments
804 for ( std::size_t i = genStart; i < results.size(); ++i ) {
805 ArgPack & result = results[i];
806 if ( ! result.hasExpl() && result.nextArg >= args.size() ) {
807 validateFunctionCandidate( func, result, results, out );
808 }
809 }
810 }
811 }
812
813 /// Adds implicit struct-conversions to the alternative list
814 void addAnonConversions( const CandidateRef & cand ) {
815 // adds anonymous member interpretations whenever an aggregate value type is seen.
816 // it's okay for the aggregate expression to have reference type -- cast it to the
817 // base type to treat the aggregate as the referenced value
818 ast::ptr< ast::Expr > aggrExpr( cand->expr );
819 ast::ptr< ast::Type > & aggrType = aggrExpr.get_and_mutate()->result;
820 cand->env.apply( aggrType );
821
822 if ( aggrType.as< ast::ReferenceType >() ) {
823 aggrExpr = new ast::CastExpr{ aggrExpr, aggrType->stripReferences() };
824 }
825
826 if ( auto structInst = aggrExpr->result.as< ast::StructInstType >() ) {
827 addAggMembers( structInst, aggrExpr, *cand, Cost::safe, "" );
828 } else if ( auto unionInst = aggrExpr->result.as< ast::UnionInstType >() ) {
829 addAggMembers( unionInst, aggrExpr, *cand, Cost::safe, "" );
830 }
831 }
832
833 /// Adds aggregate member interpretations
834 void addAggMembers(
835 const ast::BaseInstType * aggrInst, const ast::Expr * expr,
836 const Candidate & cand, const Cost & addedCost, const std::string & name
837 ) {
838 for ( const ast::Decl * decl : aggrInst->lookup( name ) ) {
839 auto dwt = strict_dynamic_cast< const ast::DeclWithType * >( decl );
840 CandidateRef newCand = std::make_shared<Candidate>(
841 cand, new ast::MemberExpr{ expr->location, dwt, expr }, addedCost );
842 // add anonymous member interpretations whenever an aggregate value type is seen
843 // as a member expression
844 addAnonConversions( newCand );
845 candidates.emplace_back( move( newCand ) );
846 }
847 }
848
849 /// Adds tuple member interpretations
850 void addTupleMembers(
851 const ast::TupleType * tupleType, const ast::Expr * expr, const Candidate & cand,
852 const Cost & addedCost, const ast::Expr * member
853 ) {
854 if ( auto constantExpr = dynamic_cast< const ast::ConstantExpr * >( member ) ) {
855 // get the value of the constant expression as an int, must be between 0 and the
856 // length of the tuple to have meaning
857 long long val = constantExpr->intValue();
858 if ( val >= 0 && (unsigned long long)val < tupleType->size() ) {
859 addCandidate(
860 cand, new ast::TupleIndexExpr{ expr->location, expr, (unsigned)val },
861 addedCost );
862 }
863 }
864 }
865
866 void postvisit( const ast::UntypedExpr * untypedExpr ) {
867 std::vector< CandidateFinder > argCandidates =
868 selfFinder.findSubExprs( untypedExpr->args );
869
870 // take care of possible tuple assignments
871 // if not tuple assignment, handled as normal function call
872 Tuples::handleTupleAssignment( selfFinder, untypedExpr, argCandidates );
873
874 CandidateFinder funcFinder( context, tenv );
875 if (auto nameExpr = untypedExpr->func.as<ast::NameExpr>()) {
876 auto kind = ast::SymbolTable::getSpecialFunctionKind(nameExpr->name);
877 if (kind != ast::SymbolTable::SpecialFunctionKind::NUMBER_OF_KINDS) {
878 assertf(!argCandidates.empty(), "special function call without argument");
879 for (auto & firstArgCand: argCandidates[0]) {
880 ast::ptr<ast::Type> argType = firstArgCand->expr->result;
881 firstArgCand->env.apply(argType);
882 // strip references
883 // xxx - is this correct?
884 while (argType.as<ast::ReferenceType>()) argType = argType.as<ast::ReferenceType>()->base;
885
886 // convert 1-tuple to plain type
887 if (auto tuple = argType.as<ast::TupleType>()) {
888 if (tuple->size() == 1) {
889 argType = tuple->types[0];
890 }
891 }
892
893 // if argType is an unbound type parameter, all special functions need to be searched.
894 if (isUnboundType(argType)) {
895 funcFinder.otypeKeys.clear();
896 break;
897 }
898
899 if (argType.as<ast::PointerType>()) funcFinder.otypeKeys.insert(Mangle::Encoding::pointer);
900 else if (const ast::EnumInstType * enumInst = argType.as<ast::EnumInstType>()) {
901 const ast::EnumDecl * enumDecl = enumInst->base;
902 if ( const ast::Type* enumType = enumDecl->base ) {
903 // instance of enum (T) is a instance of type (T)
904 funcFinder.otypeKeys.insert(Mangle::mangle(enumType, Mangle::NoGenericParams | Mangle::Type));
905 } else {
906 // instance of an untyped enum is techically int
907 funcFinder.otypeKeys.insert(Mangle::mangle(enumDecl, Mangle::NoGenericParams | Mangle::Type));
908 }
909 }
910 else funcFinder.otypeKeys.insert(Mangle::mangle(argType, Mangle::NoGenericParams | Mangle::Type));
911 }
912 }
913 }
914 // if candidates are already produced, do not fail
915 // xxx - is it possible that handleTupleAssignment and main finder both produce candidates?
916 // this means there exists ctor/assign functions with a tuple as first parameter.
917 ResolvMode mode = {
918 true, // adjust
919 !untypedExpr->func.as<ast::NameExpr>(), // prune if not calling by name
920 selfFinder.candidates.empty() // failfast if other options are not found
921 };
922 funcFinder.find( untypedExpr->func, mode );
923 // short-circuit if no candidates
924 // if ( funcFinder.candidates.empty() ) return;
925
926 reason.code = NoMatch;
927
928 // find function operators
929 ast::ptr< ast::Expr > opExpr = new ast::NameExpr{ untypedExpr->location, "?()" }; // ??? why not ?{}
930 CandidateFinder opFinder( context, tenv );
931 // okay if there aren't any function operations
932 opFinder.find( opExpr, ResolvMode::withoutFailFast() );
933 PRINT(
934 std::cerr << "known function ops:" << std::endl;
935 print( std::cerr, opFinder.candidates, 1 );
936 )
937
938 // pre-explode arguments
939 ExplodedArgs_new argExpansions;
940 for ( const CandidateFinder & args : argCandidates ) {
941 argExpansions.emplace_back();
942 auto & argE = argExpansions.back();
943 for ( const CandidateRef & arg : args ) { argE.emplace_back( *arg, symtab ); }
944 }
945
946 // Find function matches
947 CandidateList found;
948 SemanticErrorException errors;
949 for ( CandidateRef & func : funcFinder ) {
950 try {
951 PRINT(
952 std::cerr << "working on alternative:" << std::endl;
953 print( std::cerr, *func, 2 );
954 )
955
956 // check if the type is a pointer to function
957 const ast::Type * funcResult = func->expr->result->stripReferences();
958 if ( auto pointer = dynamic_cast< const ast::PointerType * >( funcResult ) ) {
959 if ( auto function = pointer->base.as< ast::FunctionType >() ) {
960 CandidateRef newFunc{ new Candidate{ *func } };
961 newFunc->expr =
962 referenceToRvalueConversion( newFunc->expr, newFunc->cost );
963 makeFunctionCandidates( newFunc, function, argExpansions, found );
964 }
965 } else if (
966 auto inst = dynamic_cast< const ast::TypeInstType * >( funcResult )
967 ) {
968 if ( const ast::EqvClass * clz = func->env.lookup( *inst ) ) {
969 if ( auto function = clz->bound.as< ast::FunctionType >() ) {
970 CandidateRef newFunc{ new Candidate{ *func } };
971 newFunc->expr =
972 referenceToRvalueConversion( newFunc->expr, newFunc->cost );
973 makeFunctionCandidates( newFunc, function, argExpansions, found );
974 }
975 }
976 }
977 } catch ( SemanticErrorException & e ) { errors.append( e ); }
978 }
979
980 // Find matches on function operators `?()`
981 if ( ! opFinder.candidates.empty() ) {
982 // add exploded function alternatives to front of argument list
983 std::vector< ExplodedArg > funcE;
984 funcE.reserve( funcFinder.candidates.size() );
985 for ( const CandidateRef & func : funcFinder ) {
986 funcE.emplace_back( *func, symtab );
987 }
988 argExpansions.emplace_front( move( funcE ) );
989
990 for ( const CandidateRef & op : opFinder ) {
991 try {
992 // check if type is pointer-to-function
993 const ast::Type * opResult = op->expr->result->stripReferences();
994 if ( auto pointer = dynamic_cast< const ast::PointerType * >( opResult ) ) {
995 if ( auto function = pointer->base.as< ast::FunctionType >() ) {
996 CandidateRef newOp{ new Candidate{ *op} };
997 newOp->expr =
998 referenceToRvalueConversion( newOp->expr, newOp->cost );
999 makeFunctionCandidates( newOp, function, argExpansions, found );
1000 }
1001 }
1002 } catch ( SemanticErrorException & e ) { errors.append( e ); }
1003 }
1004 }
1005
1006 // Implement SFINAE; resolution errors are only errors if there aren't any non-error
1007 // candidates
1008 if ( found.empty() && ! errors.isEmpty() ) { throw errors; }
1009
1010 // Compute conversion costs
1011 for ( CandidateRef & withFunc : found ) {
1012 Cost cvtCost = computeApplicationConversionCost( withFunc, symtab );
1013
1014 PRINT(
1015 auto appExpr = withFunc->expr.strict_as< ast::ApplicationExpr >();
1016 auto pointer = appExpr->func->result.strict_as< ast::PointerType >();
1017 auto function = pointer->base.strict_as< ast::FunctionType >();
1018
1019 std::cerr << "Case +++++++++++++ " << appExpr->func << std::endl;
1020 std::cerr << "parameters are:" << std::endl;
1021 ast::printAll( std::cerr, function->params, 2 );
1022 std::cerr << "arguments are:" << std::endl;
1023 ast::printAll( std::cerr, appExpr->args, 2 );
1024 std::cerr << "bindings are:" << std::endl;
1025 ast::print( std::cerr, withFunc->env, 2 );
1026 std::cerr << "cost is: " << withFunc->cost << std::endl;
1027 std::cerr << "cost of conversion is:" << cvtCost << std::endl;
1028 )
1029
1030 if ( cvtCost != Cost::infinity ) {
1031 withFunc->cvtCost = cvtCost;
1032 candidates.emplace_back( move( withFunc ) );
1033 }
1034 }
1035 found = move( candidates );
1036
1037 // use a new list so that candidates are not examined by addAnonConversions twice
1038 CandidateList winners = findMinCost( found );
1039 promoteCvtCost( winners );
1040
1041 // function may return a struct/union value, in which case we need to add candidates
1042 // for implicit conversions to each of the anonymous members, which must happen after
1043 // `findMinCost`, since anon conversions are never the cheapest
1044 for ( const CandidateRef & c : winners ) {
1045 addAnonConversions( c );
1046 }
1047 spliceBegin( candidates, winners );
1048
1049 if ( candidates.empty() && targetType && ! targetType->isVoid() ) {
1050 // If resolution is unsuccessful with a target type, try again without, since it
1051 // will sometimes succeed when it wouldn't with a target type binding.
1052 // For example:
1053 // forall( otype T ) T & ?[]( T *, ptrdiff_t );
1054 // const char * x = "hello world";
1055 // unsigned char ch = x[0];
1056 // Fails with simple return type binding (xxx -- check this!) as follows:
1057 // * T is bound to unsigned char
1058 // * (x: const char *) is unified with unsigned char *, which fails
1059 // xxx -- fix this better
1060 targetType = nullptr;
1061 postvisit( untypedExpr );
1062 }
1063 }
1064
1065 /// true if expression is an lvalue
1066 static bool isLvalue( const ast::Expr * x ) {
1067 return x->result && ( x->get_lvalue() || x->result.as< ast::ReferenceType >() );
1068 }
1069
1070 void postvisit( const ast::AddressExpr * addressExpr ) {
1071 CandidateFinder finder( context, tenv );
1072 finder.find( addressExpr->arg );
1073
1074 if( finder.candidates.empty() ) return;
1075
1076 reason.code = NoMatch;
1077
1078 for ( CandidateRef & r : finder.candidates ) {
1079 if ( ! isLvalue( r->expr ) ) continue;
1080 addCandidate( *r, new ast::AddressExpr{ addressExpr->location, r->expr } );
1081 }
1082 }
1083
1084 void postvisit( const ast::LabelAddressExpr * labelExpr ) {
1085 addCandidate( labelExpr, tenv );
1086 }
1087
1088 void postvisit( const ast::CastExpr * castExpr ) {
1089 ast::ptr< ast::Type > toType = castExpr->result;
1090 assert( toType );
1091 toType = resolveTypeof( toType, context );
1092 toType = adjustExprType( toType, tenv, symtab );
1093
1094 CandidateFinder finder( context, tenv, toType );
1095 finder.find( castExpr->arg, ResolvMode::withAdjustment() );
1096
1097 if( !finder.candidates.empty() ) reason.code = NoMatch;
1098
1099 CandidateList matches;
1100 for ( CandidateRef & cand : finder.candidates ) {
1101 ast::AssertionSet need( cand->need.begin(), cand->need.end() ), have;
1102 ast::OpenVarSet open( cand->open );
1103
1104 cand->env.extractOpenVars( open );
1105
1106 // It is possible that a cast can throw away some values in a multiply-valued
1107 // expression, e.g. cast-to-void, one value to zero. Figure out the prefix of the
1108 // subexpression results that are cast directly. The candidate is invalid if it
1109 // has fewer results than there are types to cast to.
1110 int discardedValues = cand->expr->result->size() - toType->size();
1111 if ( discardedValues < 0 ) continue;
1112
1113 // unification run for side-effects
1114 unify( toType, cand->expr->result, cand->env, need, have, open, symtab );
1115 Cost thisCost =
1116 (castExpr->isGenerated == ast::GeneratedFlag::GeneratedCast)
1117 ? conversionCost( cand->expr->result, toType, cand->expr->get_lvalue(), symtab, cand->env )
1118 : castCost( cand->expr->result, toType, cand->expr->get_lvalue(), symtab, cand->env );
1119
1120 PRINT(
1121 std::cerr << "working on cast with result: " << toType << std::endl;
1122 std::cerr << "and expr type: " << cand->expr->result << std::endl;
1123 std::cerr << "env: " << cand->env << std::endl;
1124 )
1125 if ( thisCost != Cost::infinity ) {
1126 PRINT(
1127 std::cerr << "has finite cost." << std::endl;
1128 )
1129 // count one safe conversion for each value that is thrown away
1130 thisCost.incSafe( discardedValues );
1131 CandidateRef newCand = std::make_shared<Candidate>(
1132 restructureCast( cand->expr, toType, castExpr->isGenerated ),
1133 copy( cand->env ), move( open ), move( need ), cand->cost,
1134 cand->cost + thisCost );
1135 inferParameters( newCand, matches );
1136 }
1137 }
1138
1139 // select first on argument cost, then conversion cost
1140 CandidateList minArgCost = findMinCost( matches );
1141 promoteCvtCost( minArgCost );
1142 candidates = findMinCost( minArgCost );
1143 }
1144
1145 void postvisit( const ast::VirtualCastExpr * castExpr ) {
1146 assertf( castExpr->result, "Implicit virtual cast targets not yet supported." );
1147 CandidateFinder finder( context, tenv );
1148 // don't prune here, all alternatives guaranteed to have same type
1149 finder.find( castExpr->arg, ResolvMode::withoutPrune() );
1150 for ( CandidateRef & r : finder.candidates ) {
1151 addCandidate(
1152 *r,
1153 new ast::VirtualCastExpr{ castExpr->location, r->expr, castExpr->result } );
1154 }
1155 }
1156
1157 void postvisit( const ast::KeywordCastExpr * castExpr ) {
1158 const auto & loc = castExpr->location;
1159 assertf( castExpr->result, "Cast target should have been set in Validate." );
1160 auto ref = castExpr->result.strict_as<ast::ReferenceType>();
1161 auto inst = ref->base.strict_as<ast::StructInstType>();
1162 auto target = inst->base.get();
1163
1164 CandidateFinder finder( context, tenv );
1165
1166 auto pick_alternatives = [target, this](CandidateList & found, bool expect_ref) {
1167 for(auto & cand : found) {
1168 const ast::Type * expr = cand->expr->result.get();
1169 if(expect_ref) {
1170 auto res = dynamic_cast<const ast::ReferenceType*>(expr);
1171 if(!res) { continue; }
1172 expr = res->base.get();
1173 }
1174
1175 if(auto insttype = dynamic_cast<const ast::TypeInstType*>(expr)) {
1176 auto td = cand->env.lookup(*insttype);
1177 if(!td) { continue; }
1178 expr = td->bound.get();
1179 }
1180
1181 if(auto base = dynamic_cast<const ast::StructInstType*>(expr)) {
1182 if(base->base == target) {
1183 candidates.push_back( std::move(cand) );
1184 reason.code = NoReason;
1185 }
1186 }
1187 }
1188 };
1189
1190 try {
1191 // Attempt 1 : turn (thread&)X into (thread$&)X.__thrd
1192 // Clone is purely for memory management
1193 std::unique_ptr<const ast::Expr> tech1 { new ast::UntypedMemberExpr(loc, new ast::NameExpr(loc, castExpr->concrete_target.field), castExpr->arg) };
1194
1195 // don't prune here, since it's guaranteed all alternatives will have the same type
1196 finder.find( tech1.get(), ResolvMode::withoutPrune() );
1197 pick_alternatives(finder.candidates, false);
1198
1199 return;
1200 } catch(SemanticErrorException & ) {}
1201
1202 // Fallback : turn (thread&)X into (thread$&)get_thread(X)
1203 std::unique_ptr<const ast::Expr> fallback { ast::UntypedExpr::createDeref(loc, new ast::UntypedExpr(loc, new ast::NameExpr(loc, castExpr->concrete_target.getter), { castExpr->arg })) };
1204 // don't prune here, since it's guaranteed all alternatives will have the same type
1205 finder.find( fallback.get(), ResolvMode::withoutPrune() );
1206
1207 pick_alternatives(finder.candidates, true);
1208
1209 // Whatever happens here, we have no more fallbacks
1210 }
1211
1212 void postvisit( const ast::UntypedMemberExpr * memberExpr ) {
1213 CandidateFinder aggFinder( context, tenv );
1214 aggFinder.find( memberExpr->aggregate, ResolvMode::withAdjustment() );
1215 for ( CandidateRef & agg : aggFinder.candidates ) {
1216 // it's okay for the aggregate expression to have reference type -- cast it to the
1217 // base type to treat the aggregate as the referenced value
1218 Cost addedCost = Cost::zero;
1219 agg->expr = referenceToRvalueConversion( agg->expr, addedCost );
1220
1221 // find member of the given type
1222 if ( auto structInst = agg->expr->result.as< ast::StructInstType >() ) {
1223 addAggMembers(
1224 structInst, agg->expr, *agg, addedCost, getMemberName( memberExpr ) );
1225 } else if ( auto unionInst = agg->expr->result.as< ast::UnionInstType >() ) {
1226 addAggMembers(
1227 unionInst, agg->expr, *agg, addedCost, getMemberName( memberExpr ) );
1228 } else if ( auto tupleType = agg->expr->result.as< ast::TupleType >() ) {
1229 addTupleMembers( tupleType, agg->expr, *agg, addedCost, memberExpr->member );
1230 }
1231 }
1232 }
1233
1234 void postvisit( const ast::MemberExpr * memberExpr ) {
1235 addCandidate( memberExpr, tenv );
1236 }
1237
1238 void postvisit( const ast::NameExpr * nameExpr ) {
1239 std::vector< ast::SymbolTable::IdData > declList;
1240 if (!selfFinder.otypeKeys.empty()) {
1241 auto kind = ast::SymbolTable::getSpecialFunctionKind(nameExpr->name);
1242 assertf(kind != ast::SymbolTable::SpecialFunctionKind::NUMBER_OF_KINDS, "special lookup with non-special target: %s", nameExpr->name.c_str());
1243
1244 for (auto & otypeKey: selfFinder.otypeKeys) {
1245 auto result = symtab.specialLookupId(kind, otypeKey);
1246 declList.insert(declList.end(), std::make_move_iterator(result.begin()), std::make_move_iterator(result.end()));
1247 }
1248 }
1249 else {
1250 declList = symtab.lookupId( nameExpr->name );
1251 }
1252 PRINT( std::cerr << "nameExpr is " << nameExpr->name << std::endl; )
1253
1254 if( declList.empty() ) return;
1255
1256 reason.code = NoMatch;
1257
1258 for ( auto & data : declList ) {
1259 Cost cost = Cost::zero;
1260 ast::Expr * newExpr = data.combine( nameExpr->location, cost );
1261
1262 CandidateRef newCand = std::make_shared<Candidate>(
1263 newExpr, copy( tenv ), ast::OpenVarSet{}, ast::AssertionSet{}, Cost::zero,
1264 cost );
1265 PRINT(
1266 std::cerr << "decl is ";
1267 ast::print( std::cerr, data.id );
1268 std::cerr << std::endl;
1269 std::cerr << "newExpr is ";
1270 ast::print( std::cerr, newExpr );
1271 std::cerr << std::endl;
1272 )
1273 newCand->expr = ast::mutate_field(
1274 newCand->expr.get(), &ast::Expr::result,
1275 renameTyVars( newCand->expr->result ) );
1276 // add anonymous member interpretations whenever an aggregate value type is seen
1277 // as a name expression
1278 addAnonConversions( newCand );
1279 candidates.emplace_back( move( newCand ) );
1280 }
1281 }
1282
1283 void postvisit( const ast::VariableExpr * variableExpr ) {
1284 // not sufficient to just pass `variableExpr` here, type might have changed since
1285 // creation
1286 addCandidate(
1287 new ast::VariableExpr{ variableExpr->location, variableExpr->var }, tenv );
1288 }
1289
1290 void postvisit( const ast::ConstantExpr * constantExpr ) {
1291 addCandidate( constantExpr, tenv );
1292 }
1293
1294 void postvisit( const ast::SizeofExpr * sizeofExpr ) {
1295 if ( sizeofExpr->type ) {
1296 addCandidate(
1297 new ast::SizeofExpr{
1298 sizeofExpr->location, resolveTypeof( sizeofExpr->type, context ) },
1299 tenv );
1300 } else {
1301 // find all candidates for the argument to sizeof
1302 CandidateFinder finder( context, tenv );
1303 finder.find( sizeofExpr->expr );
1304 // find the lowest-cost candidate, otherwise ambiguous
1305 CandidateList winners = findMinCost( finder.candidates );
1306 if ( winners.size() != 1 ) {
1307 SemanticError(
1308 sizeofExpr->expr.get(), "Ambiguous expression in sizeof operand: " );
1309 }
1310 // return the lowest-cost candidate
1311 CandidateRef & choice = winners.front();
1312 choice->expr = referenceToRvalueConversion( choice->expr, choice->cost );
1313 choice->cost = Cost::zero;
1314 addCandidate( *choice, new ast::SizeofExpr{ sizeofExpr->location, choice->expr } );
1315 }
1316 }
1317
1318 void postvisit( const ast::AlignofExpr * alignofExpr ) {
1319 if ( alignofExpr->type ) {
1320 addCandidate(
1321 new ast::AlignofExpr{
1322 alignofExpr->location, resolveTypeof( alignofExpr->type, context ) },
1323 tenv );
1324 } else {
1325 // find all candidates for the argument to alignof
1326 CandidateFinder finder( context, tenv );
1327 finder.find( alignofExpr->expr );
1328 // find the lowest-cost candidate, otherwise ambiguous
1329 CandidateList winners = findMinCost( finder.candidates );
1330 if ( winners.size() != 1 ) {
1331 SemanticError(
1332 alignofExpr->expr.get(), "Ambiguous expression in alignof operand: " );
1333 }
1334 // return the lowest-cost candidate
1335 CandidateRef & choice = winners.front();
1336 choice->expr = referenceToRvalueConversion( choice->expr, choice->cost );
1337 choice->cost = Cost::zero;
1338 addCandidate(
1339 *choice, new ast::AlignofExpr{ alignofExpr->location, choice->expr } );
1340 }
1341 }
1342
1343 void postvisit( const ast::UntypedOffsetofExpr * offsetofExpr ) {
1344 const ast::BaseInstType * aggInst;
1345 if (( aggInst = offsetofExpr->type.as< ast::StructInstType >() )) ;
1346 else if (( aggInst = offsetofExpr->type.as< ast::UnionInstType >() )) ;
1347 else return;
1348
1349 for ( const ast::Decl * member : aggInst->lookup( offsetofExpr->member ) ) {
1350 auto dwt = strict_dynamic_cast< const ast::DeclWithType * >( member );
1351 addCandidate(
1352 new ast::OffsetofExpr{ offsetofExpr->location, aggInst, dwt }, tenv );
1353 }
1354 }
1355
1356 void postvisit( const ast::OffsetofExpr * offsetofExpr ) {
1357 addCandidate( offsetofExpr, tenv );
1358 }
1359
1360 void postvisit( const ast::OffsetPackExpr * offsetPackExpr ) {
1361 addCandidate( offsetPackExpr, tenv );
1362 }
1363
1364 void postvisit( const ast::LogicalExpr * logicalExpr ) {
1365 CandidateFinder finder1( context, tenv );
1366 finder1.find( logicalExpr->arg1, ResolvMode::withAdjustment() );
1367 if ( finder1.candidates.empty() ) return;
1368
1369 CandidateFinder finder2( context, tenv );
1370 finder2.find( logicalExpr->arg2, ResolvMode::withAdjustment() );
1371 if ( finder2.candidates.empty() ) return;
1372
1373 reason.code = NoMatch;
1374
1375 for ( const CandidateRef & r1 : finder1.candidates ) {
1376 for ( const CandidateRef & r2 : finder2.candidates ) {
1377 ast::TypeEnvironment env{ r1->env };
1378 env.simpleCombine( r2->env );
1379 ast::OpenVarSet open{ r1->open };
1380 mergeOpenVars( open, r2->open );
1381 ast::AssertionSet need;
1382 mergeAssertionSet( need, r1->need );
1383 mergeAssertionSet( need, r2->need );
1384
1385 addCandidate(
1386 new ast::LogicalExpr{
1387 logicalExpr->location, r1->expr, r2->expr, logicalExpr->isAnd },
1388 move( env ), move( open ), move( need ), r1->cost + r2->cost );
1389 }
1390 }
1391 }
1392
1393 void postvisit( const ast::ConditionalExpr * conditionalExpr ) {
1394 // candidates for condition
1395 CandidateFinder finder1( context, tenv );
1396 finder1.find( conditionalExpr->arg1, ResolvMode::withAdjustment() );
1397 if ( finder1.candidates.empty() ) return;
1398
1399 // candidates for true result
1400 CandidateFinder finder2( context, tenv );
1401 finder2.find( conditionalExpr->arg2, ResolvMode::withAdjustment() );
1402 if ( finder2.candidates.empty() ) return;
1403
1404 // candidates for false result
1405 CandidateFinder finder3( context, tenv );
1406 finder3.find( conditionalExpr->arg3, ResolvMode::withAdjustment() );
1407 if ( finder3.candidates.empty() ) return;
1408
1409 reason.code = NoMatch;
1410
1411 for ( const CandidateRef & r1 : finder1.candidates ) {
1412 for ( const CandidateRef & r2 : finder2.candidates ) {
1413 for ( const CandidateRef & r3 : finder3.candidates ) {
1414 ast::TypeEnvironment env{ r1->env };
1415 env.simpleCombine( r2->env );
1416 env.simpleCombine( r3->env );
1417 ast::OpenVarSet open{ r1->open };
1418 mergeOpenVars( open, r2->open );
1419 mergeOpenVars( open, r3->open );
1420 ast::AssertionSet need;
1421 mergeAssertionSet( need, r1->need );
1422 mergeAssertionSet( need, r2->need );
1423 mergeAssertionSet( need, r3->need );
1424 ast::AssertionSet have;
1425
1426 // unify true and false results, then infer parameters to produce new
1427 // candidates
1428 ast::ptr< ast::Type > common;
1429 if (
1430 unify(
1431 r2->expr->result, r3->expr->result, env, need, have, open, symtab,
1432 common )
1433 ) {
1434 // generate typed expression
1435 ast::ConditionalExpr * newExpr = new ast::ConditionalExpr{
1436 conditionalExpr->location, r1->expr, r2->expr, r3->expr };
1437 newExpr->result = common ? common : r2->expr->result;
1438 // convert both options to result type
1439 Cost cost = r1->cost + r2->cost + r3->cost;
1440 newExpr->arg2 = computeExpressionConversionCost(
1441 newExpr->arg2, newExpr->result, symtab, env, cost );
1442 newExpr->arg3 = computeExpressionConversionCost(
1443 newExpr->arg3, newExpr->result, symtab, env, cost );
1444 // output candidate
1445 CandidateRef newCand = std::make_shared<Candidate>(
1446 newExpr, move( env ), move( open ), move( need ), cost );
1447 inferParameters( newCand, candidates );
1448 }
1449 }
1450 }
1451 }
1452 }
1453
1454 void postvisit( const ast::CommaExpr * commaExpr ) {
1455 ast::TypeEnvironment env{ tenv };
1456 ast::ptr< ast::Expr > arg1 = resolveInVoidContext( commaExpr->arg1, context, env );
1457
1458 CandidateFinder finder2( context, env );
1459 finder2.find( commaExpr->arg2, ResolvMode::withAdjustment() );
1460
1461 for ( const CandidateRef & r2 : finder2.candidates ) {
1462 addCandidate( *r2, new ast::CommaExpr{ commaExpr->location, arg1, r2->expr } );
1463 }
1464 }
1465
1466 void postvisit( const ast::ImplicitCopyCtorExpr * ctorExpr ) {
1467 addCandidate( ctorExpr, tenv );
1468 }
1469
1470 void postvisit( const ast::ConstructorExpr * ctorExpr ) {
1471 CandidateFinder finder( context, tenv );
1472 finder.find( ctorExpr->callExpr, ResolvMode::withoutPrune() );
1473 for ( CandidateRef & r : finder.candidates ) {
1474 addCandidate( *r, new ast::ConstructorExpr{ ctorExpr->location, r->expr } );
1475 }
1476 }
1477
1478 void postvisit( const ast::RangeExpr * rangeExpr ) {
1479 // resolve low and high, accept candidates where low and high types unify
1480 CandidateFinder finder1( context, tenv );
1481 finder1.find( rangeExpr->low, ResolvMode::withAdjustment() );
1482 if ( finder1.candidates.empty() ) return;
1483
1484 CandidateFinder finder2( context, tenv );
1485 finder2.find( rangeExpr->high, ResolvMode::withAdjustment() );
1486 if ( finder2.candidates.empty() ) return;
1487
1488 reason.code = NoMatch;
1489
1490 for ( const CandidateRef & r1 : finder1.candidates ) {
1491 for ( const CandidateRef & r2 : finder2.candidates ) {
1492 ast::TypeEnvironment env{ r1->env };
1493 env.simpleCombine( r2->env );
1494 ast::OpenVarSet open{ r1->open };
1495 mergeOpenVars( open, r2->open );
1496 ast::AssertionSet need;
1497 mergeAssertionSet( need, r1->need );
1498 mergeAssertionSet( need, r2->need );
1499 ast::AssertionSet have;
1500
1501 ast::ptr< ast::Type > common;
1502 if (
1503 unify(
1504 r1->expr->result, r2->expr->result, env, need, have, open, symtab,
1505 common )
1506 ) {
1507 // generate new expression
1508 ast::RangeExpr * newExpr =
1509 new ast::RangeExpr{ rangeExpr->location, r1->expr, r2->expr };
1510 newExpr->result = common ? common : r1->expr->result;
1511 // add candidate
1512 CandidateRef newCand = std::make_shared<Candidate>(
1513 newExpr, move( env ), move( open ), move( need ),
1514 r1->cost + r2->cost );
1515 inferParameters( newCand, candidates );
1516 }
1517 }
1518 }
1519 }
1520
1521 void postvisit( const ast::UntypedTupleExpr * tupleExpr ) {
1522 std::vector< CandidateFinder > subCandidates =
1523 selfFinder.findSubExprs( tupleExpr->exprs );
1524 std::vector< CandidateList > possibilities;
1525 combos( subCandidates.begin(), subCandidates.end(), back_inserter( possibilities ) );
1526
1527 for ( const CandidateList & subs : possibilities ) {
1528 std::vector< ast::ptr< ast::Expr > > exprs;
1529 exprs.reserve( subs.size() );
1530 for ( const CandidateRef & sub : subs ) { exprs.emplace_back( sub->expr ); }
1531
1532 ast::TypeEnvironment env;
1533 ast::OpenVarSet open;
1534 ast::AssertionSet need;
1535 for ( const CandidateRef & sub : subs ) {
1536 env.simpleCombine( sub->env );
1537 mergeOpenVars( open, sub->open );
1538 mergeAssertionSet( need, sub->need );
1539 }
1540
1541 addCandidate(
1542 new ast::TupleExpr{ tupleExpr->location, move( exprs ) },
1543 move( env ), move( open ), move( need ), sumCost( subs ) );
1544 }
1545 }
1546
1547 void postvisit( const ast::TupleExpr * tupleExpr ) {
1548 addCandidate( tupleExpr, tenv );
1549 }
1550
1551 void postvisit( const ast::TupleIndexExpr * tupleExpr ) {
1552 addCandidate( tupleExpr, tenv );
1553 }
1554
1555 void postvisit( const ast::TupleAssignExpr * tupleExpr ) {
1556 addCandidate( tupleExpr, tenv );
1557 }
1558
1559 void postvisit( const ast::UniqueExpr * unqExpr ) {
1560 CandidateFinder finder( context, tenv );
1561 finder.find( unqExpr->expr, ResolvMode::withAdjustment() );
1562 for ( CandidateRef & r : finder.candidates ) {
1563 // ensure that the the id is passed on so that the expressions are "linked"
1564 addCandidate( *r, new ast::UniqueExpr{ unqExpr->location, r->expr, unqExpr->id } );
1565 }
1566 }
1567
1568 void postvisit( const ast::StmtExpr * stmtExpr ) {
1569 addCandidate( resolveStmtExpr( stmtExpr, context ), tenv );
1570 }
1571
1572 void postvisit( const ast::UntypedInitExpr * initExpr ) {
1573 // handle each option like a cast
1574 CandidateList matches;
1575 PRINT(
1576 std::cerr << "untyped init expr: " << initExpr << std::endl;
1577 )
1578 // O(n^2) checks of d-types with e-types
1579 for ( const ast::InitAlternative & initAlt : initExpr->initAlts ) {
1580 // calculate target type
1581 const ast::Type * toType = resolveTypeof( initAlt.type, context );
1582 toType = adjustExprType( toType, tenv, symtab );
1583 // The call to find must occur inside this loop, otherwise polymorphic return
1584 // types are not bound to the initialization type, since return type variables are
1585 // only open for the duration of resolving the UntypedExpr.
1586 CandidateFinder finder( context, tenv, toType );
1587 finder.find( initExpr->expr, ResolvMode::withAdjustment() );
1588 for ( CandidateRef & cand : finder.candidates ) {
1589 if(reason.code == NotFound) reason.code = NoMatch;
1590
1591 ast::TypeEnvironment env{ cand->env };
1592 ast::AssertionSet need( cand->need.begin(), cand->need.end() ), have;
1593 ast::OpenVarSet open{ cand->open };
1594
1595 PRINT(
1596 std::cerr << " @ " << toType << " " << initAlt.designation << std::endl;
1597 )
1598
1599 // It is possible that a cast can throw away some values in a multiply-valued
1600 // expression, e.g. cast-to-void, one value to zero. Figure out the prefix of
1601 // the subexpression results that are cast directly. The candidate is invalid
1602 // if it has fewer results than there are types to cast to.
1603 int discardedValues = cand->expr->result->size() - toType->size();
1604 if ( discardedValues < 0 ) continue;
1605
1606 // unification run for side-effects
1607 bool canUnify = unify( toType, cand->expr->result, env, need, have, open, symtab );
1608 (void) canUnify;
1609 Cost thisCost = computeConversionCost( cand->expr->result, toType, cand->expr->get_lvalue(),
1610 symtab, env );
1611 PRINT(
1612 Cost legacyCost = castCost( cand->expr->result, toType, cand->expr->get_lvalue(),
1613 symtab, env );
1614 std::cerr << "Considering initialization:";
1615 std::cerr << std::endl << " FROM: " << cand->expr->result << std::endl;
1616 std::cerr << std::endl << " TO: " << toType << std::endl;
1617 std::cerr << std::endl << " Unification " << (canUnify ? "succeeded" : "failed");
1618 std::cerr << std::endl << " Legacy cost " << legacyCost;
1619 std::cerr << std::endl << " New cost " << thisCost;
1620 std::cerr << std::endl;
1621 )
1622 if ( thisCost != Cost::infinity ) {
1623 // count one safe conversion for each value that is thrown away
1624 thisCost.incSafe( discardedValues );
1625 CandidateRef newCand = std::make_shared<Candidate>(
1626 new ast::InitExpr{
1627 initExpr->location, restructureCast( cand->expr, toType ),
1628 initAlt.designation },
1629 move(env), move( open ), move( need ), cand->cost, thisCost );
1630 inferParameters( newCand, matches );
1631 }
1632 }
1633
1634 }
1635
1636 // select first on argument cost, then conversion cost
1637 CandidateList minArgCost = findMinCost( matches );
1638 promoteCvtCost( minArgCost );
1639 candidates = findMinCost( minArgCost );
1640 }
1641
1642 void postvisit( const ast::InitExpr * ) {
1643 assertf( false, "CandidateFinder should never see a resolved InitExpr." );
1644 }
1645
1646 void postvisit( const ast::DeletedExpr * ) {
1647 assertf( false, "CandidateFinder should never see a DeletedExpr." );
1648 }
1649
1650 void postvisit( const ast::GenericExpr * ) {
1651 assertf( false, "_Generic is not yet supported." );
1652 }
1653 };
1654
1655 // size_t Finder::traceId = Stats::Heap::new_stacktrace_id("Finder");
1656 /// Prunes a list of candidates down to those that have the minimum conversion cost for a given
1657 /// return type. Skips ambiguous candidates.
1658
1659} // anonymous namespace
1660
1661bool CandidateFinder::pruneCandidates( CandidateList & candidates, CandidateList & out, std::vector<std::string> & errors ) {
1662 struct PruneStruct {
1663 CandidateRef candidate;
1664 bool ambiguous;
1665
1666 PruneStruct() = default;
1667 PruneStruct( const CandidateRef & c ) : candidate( c ), ambiguous( false ) {}
1668 };
1669
1670 // find lowest-cost candidate for each type
1671 std::unordered_map< std::string, PruneStruct > selected;
1672 // attempt to skip satisfyAssertions on more expensive alternatives if better options have been found
1673 std::sort(candidates.begin(), candidates.end(), [](const CandidateRef & x, const CandidateRef & y){return x->cost < y->cost;});
1674 for ( CandidateRef & candidate : candidates ) {
1675 std::string mangleName;
1676 {
1677 ast::ptr< ast::Type > newType = candidate->expr->result;
1678 assertf(candidate->expr->result, "Result of expression %p for candidate is null", candidate->expr.get());
1679 candidate->env.apply( newType );
1680 mangleName = Mangle::mangle( newType );
1681 }
1682
1683 auto found = selected.find( mangleName );
1684 if (found != selected.end() && found->second.candidate->cost < candidate->cost) {
1685 PRINT(
1686 std::cerr << "cost " << candidate->cost << " loses to "
1687 << found->second.candidate->cost << std::endl;
1688 )
1689 continue;
1690 }
1691
1692 // xxx - when do satisfyAssertions produce more than 1 result?
1693 // this should only happen when initial result type contains
1694 // unbound type parameters, then it should never be pruned by
1695 // the previous step, since renameTyVars guarantees the mangled name
1696 // is unique.
1697 CandidateList satisfied;
1698 bool needRecomputeKey = false;
1699 if (candidate->need.empty()) {
1700 satisfied.emplace_back(candidate);
1701 }
1702 else {
1703 satisfyAssertions(candidate, context.symtab, satisfied, errors);
1704 needRecomputeKey = true;
1705 }
1706
1707 for (auto & newCand : satisfied) {
1708 // recomputes type key, if satisfyAssertions changed it
1709 if (needRecomputeKey)
1710 {
1711 ast::ptr< ast::Type > newType = newCand->expr->result;
1712 assertf(newCand->expr->result, "Result of expression %p for candidate is null", newCand->expr.get());
1713 newCand->env.apply( newType );
1714 mangleName = Mangle::mangle( newType );
1715 }
1716 auto found = selected.find( mangleName );
1717 if ( found != selected.end() ) {
1718 if ( newCand->cost < found->second.candidate->cost ) {
1719 PRINT(
1720 std::cerr << "cost " << newCand->cost << " beats "
1721 << found->second.candidate->cost << std::endl;
1722 )
1723
1724 found->second = PruneStruct{ newCand };
1725 } else if ( newCand->cost == found->second.candidate->cost ) {
1726 // if one of the candidates contains a deleted identifier, can pick the other,
1727 // since deleted expressions should not be ambiguous if there is another option
1728 // that is at least as good
1729 if ( findDeletedExpr( newCand->expr ) ) {
1730 // do nothing
1731 PRINT( std::cerr << "candidate is deleted" << std::endl; )
1732 } else if ( findDeletedExpr( found->second.candidate->expr ) ) {
1733 PRINT( std::cerr << "current is deleted" << std::endl; )
1734 found->second = PruneStruct{ newCand };
1735 } else {
1736 PRINT( std::cerr << "marking ambiguous" << std::endl; )
1737 found->second.ambiguous = true;
1738 }
1739 } else {
1740 // xxx - can satisfyAssertions increase the cost?
1741 PRINT(
1742 std::cerr << "cost " << newCand->cost << " loses to "
1743 << found->second.candidate->cost << std::endl;
1744 )
1745 }
1746 } else {
1747 selected.emplace_hint( found, mangleName, newCand );
1748 }
1749 }
1750 }
1751
1752 // report unambiguous min-cost candidates
1753 // CandidateList out;
1754 for ( auto & target : selected ) {
1755 if ( target.second.ambiguous ) continue;
1756
1757 CandidateRef cand = target.second.candidate;
1758
1759 ast::ptr< ast::Type > newResult = cand->expr->result;
1760 cand->env.applyFree( newResult );
1761 cand->expr = ast::mutate_field(
1762 cand->expr.get(), &ast::Expr::result, move( newResult ) );
1763
1764 out.emplace_back( cand );
1765 }
1766 // if everything is lost in satisfyAssertions, report the error
1767 return !selected.empty();
1768}
1769
1770void CandidateFinder::find( const ast::Expr * expr, ResolvMode mode ) {
1771 // Find alternatives for expression
1772 ast::Pass<Finder> finder{ *this };
1773 expr->accept( finder );
1774
1775 if ( mode.failFast && candidates.empty() ) {
1776 switch(finder.core.reason.code) {
1777 case Finder::NotFound:
1778 { SemanticError( expr, "No alternatives for expression " ); break; }
1779 case Finder::NoMatch:
1780 { SemanticError( expr, "Invalid application of existing declaration(s) in expression " ); break; }
1781 case Finder::ArgsToFew:
1782 case Finder::ArgsToMany:
1783 case Finder::RetsToFew:
1784 case Finder::RetsToMany:
1785 case Finder::NoReason:
1786 default:
1787 { SemanticError( expr->location, "No reasonable alternatives for expression : reasons unkown" ); }
1788 }
1789 }
1790
1791 /*
1792 if ( mode.satisfyAssns || mode.prune ) {
1793 // trim candidates to just those where the assertions are satisfiable
1794 // - necessary pre-requisite to pruning
1795 CandidateList satisfied;
1796 std::vector< std::string > errors;
1797 for ( CandidateRef & candidate : candidates ) {
1798 satisfyAssertions( candidate, localSyms, satisfied, errors );
1799 }
1800
1801 // fail early if none such
1802 if ( mode.failFast && satisfied.empty() ) {
1803 std::ostringstream stream;
1804 stream << "No alternatives with satisfiable assertions for " << expr << "\n";
1805 for ( const auto& err : errors ) {
1806 stream << err;
1807 }
1808 SemanticError( expr->location, stream.str() );
1809 }
1810
1811 // reset candidates
1812 candidates = move( satisfied );
1813 }
1814 */
1815
1816 if ( mode.prune ) {
1817 // trim candidates to single best one
1818 PRINT(
1819 std::cerr << "alternatives before prune:" << std::endl;
1820 print( std::cerr, candidates );
1821 )
1822
1823 CandidateList pruned;
1824 std::vector<std::string> errors;
1825 bool found = pruneCandidates( candidates, pruned, errors );
1826
1827 if ( mode.failFast && pruned.empty() ) {
1828 std::ostringstream stream;
1829 if (found) {
1830 CandidateList winners = findMinCost( candidates );
1831 stream << "Cannot choose between " << winners.size() << " alternatives for "
1832 "expression\n";
1833 ast::print( stream, expr );
1834 stream << " Alternatives are:\n";
1835 print( stream, winners, 1 );
1836 SemanticError( expr->location, stream.str() );
1837 }
1838 else {
1839 stream << "No alternatives with satisfiable assertions for " << expr << "\n";
1840 for ( const auto& err : errors ) {
1841 stream << err;
1842 }
1843 SemanticError( expr->location, stream.str() );
1844 }
1845 }
1846
1847 auto oldsize = candidates.size();
1848 candidates = move( pruned );
1849
1850 PRINT(
1851 std::cerr << "there are " << oldsize << " alternatives before elimination" << std::endl;
1852 )
1853 PRINT(
1854 std::cerr << "there are " << candidates.size() << " alternatives after elimination"
1855 << std::endl;
1856 )
1857 }
1858
1859 // adjust types after pruning so that types substituted by pruneAlternatives are correctly
1860 // adjusted
1861 if ( mode.adjust ) {
1862 for ( CandidateRef & r : candidates ) {
1863 r->expr = ast::mutate_field(
1864 r->expr.get(), &ast::Expr::result,
1865 adjustExprType( r->expr->result, r->env, context.symtab ) );
1866 }
1867 }
1868
1869 // Central location to handle gcc extension keyword, etc. for all expressions
1870 for ( CandidateRef & r : candidates ) {
1871 if ( r->expr->extension != expr->extension ) {
1872 r->expr.get_and_mutate()->extension = expr->extension;
1873 }
1874 }
1875}
1876
1877std::vector< CandidateFinder > CandidateFinder::findSubExprs(
1878 const std::vector< ast::ptr< ast::Expr > > & xs
1879) {
1880 std::vector< CandidateFinder > out;
1881
1882 for ( const auto & x : xs ) {
1883 out.emplace_back( context, env );
1884 out.back().find( x, ResolvMode::withAdjustment() );
1885
1886 PRINT(
1887 std::cerr << "findSubExprs" << std::endl;
1888 print( std::cerr, out.back().candidates );
1889 )
1890 }
1891
1892 return out;
1893}
1894
1895} // namespace ResolvExpr
1896
1897// Local Variables: //
1898// tab-width: 4 //
1899// mode: c++ //
1900// compile-command: "make install" //
1901// End: //
Note: See TracBrowser for help on using the repository browser.