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.hpp -- |
---|
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 : Tue Oct 1 9:51:00 2019 |
---|
13 | // Update Count : 2 |
---|
14 | // |
---|
15 | |
---|
16 | #pragma once |
---|
17 | |
---|
18 | #include "Candidate.hpp" |
---|
19 | #include "ResolvMode.h" |
---|
20 | #include "AST/Fwd.hpp" |
---|
21 | #include "AST/Node.hpp" |
---|
22 | #include "AST/SymbolTable.hpp" |
---|
23 | #include "AST/TypeEnvironment.hpp" |
---|
24 | |
---|
25 | namespace ResolvExpr { |
---|
26 | |
---|
27 | /// Data to perform expression resolution |
---|
28 | struct CandidateFinder { |
---|
29 | CandidateList candidates; ///< List of candidate resolutions |
---|
30 | const ast::SymbolTable & localSyms; ///< Symbol table to lookup candidates |
---|
31 | const ast::TypeEnvironment & env; ///< Substitutions performed in this resolution |
---|
32 | ast::ptr< ast::Type > targetType; ///< Target type for resolution |
---|
33 | std::set< std::string > otypeKeys; /// different type may map to same key |
---|
34 | |
---|
35 | CandidateFinder( |
---|
36 | const ast::SymbolTable & syms, const ast::TypeEnvironment & env, |
---|
37 | const ast::Type * tt = nullptr ) |
---|
38 | : candidates(), localSyms( syms ), env( env ), targetType( tt ) {} |
---|
39 | |
---|
40 | /// Fill candidates with feasible resolutions for `expr` |
---|
41 | void find( const ast::Expr * expr, ResolvMode mode = {} ); |
---|
42 | |
---|
43 | /// Runs new candidate finder on each element in xs, returning the list of finders |
---|
44 | std::vector< CandidateFinder > findSubExprs( const std::vector< ast::ptr< ast::Expr > > & xs ); |
---|
45 | |
---|
46 | using value_type = CandidateList::value_type; |
---|
47 | using iterator = CandidateList::iterator; |
---|
48 | using const_iterator = CandidateList::const_iterator; |
---|
49 | |
---|
50 | iterator begin() { return candidates.begin(); } |
---|
51 | const_iterator begin() const { return candidates.begin(); } |
---|
52 | |
---|
53 | iterator end() { return candidates.end(); } |
---|
54 | const_iterator end() const { return candidates.end(); } |
---|
55 | }; |
---|
56 | |
---|
57 | /// Computes conversion cost between two types |
---|
58 | Cost computeConversionCost( |
---|
59 | const ast::Type * argType, const ast::Type * paramType, bool argIsLvalue, |
---|
60 | const ast::SymbolTable & symtab, const ast::TypeEnvironment & env ); |
---|
61 | |
---|
62 | } // namespace ResolvExpr |
---|
63 | |
---|
64 | // Local Variables: // |
---|
65 | // tab-width: 4 // |
---|
66 | // mode: c++ // |
---|
67 | // compile-command: "make install" // |
---|
68 | // End: // |
---|