source: src/ResolvExpr/AlternativeFinder.h @ a5f0529

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerresolv-newwith_gc
Last change on this file since a5f0529 was a5f0529, checked in by Andrew Beach <ajbeach@…>, 4 years ago

Virtual casts have been added. They still require a lot of hand coded support to work but for simple cases it should be enough.

  • Property mode set to 100644
File size: 6.1 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// AlternativeFinder.h --
8//
9// Author           : Richard C. Bilson
10// Created On       : Sat May 16 23:56:12 2015
11// Last Modified By : Andrew Beach
12// Last Modified On : Wed Jul 26 11:24:00 2017
13// Update Count     : 4
14//
15
16#pragma once
17
18#include <set>
19
20#include "Alternative.h"
21#include "Unify.h"
22#include "SynTree/SynTree.h"
23#include "SymTab/Indexer.h"
24#include "SynTree/TypeSubstitution.h"
25
26namespace ResolvExpr {
27        class AlternativeFinder : public Visitor {
28          public:
29                AlternativeFinder( const SymTab::Indexer &indexer, const TypeEnvironment &env );
30                void find( Expression *expr, bool adjust = false, bool prune = true );
31                /// Calls find with the adjust flag set; adjustment turns array and function types into equivalent pointer types
32                void findWithAdjustment( Expression *expr, bool prune = true );
33                AltList &get_alternatives() { return alternatives; }
34
35                // make this look like an STL container so that we can apply generic algorithms
36                typedef Alternative value_type;
37                typedef AltList::iterator iterator;
38                typedef AltList::const_iterator const_iterator;
39                AltList::iterator begin() { return alternatives.begin(); }
40                AltList::iterator end() { return alternatives.end(); }
41                AltList::const_iterator begin() const { return alternatives.begin(); }
42                AltList::const_iterator end() const { return alternatives.end(); }
43
44                const SymTab::Indexer &get_indexer() const { return indexer; }
45                const TypeEnvironment &get_environ() const { return env; }
46          private:
47                virtual void visit( ApplicationExpr *applicationExpr );
48                virtual void visit( UntypedExpr *untypedExpr );
49                virtual void visit( AddressExpr *addressExpr );
50                virtual void visit( CastExpr *castExpr );
51                virtual void visit( VirtualCastExpr *castExpr );
52                virtual void visit( UntypedMemberExpr *memberExpr );
53                virtual void visit( MemberExpr *memberExpr );
54                virtual void visit( NameExpr *variableExpr );
55                virtual void visit( VariableExpr *variableExpr );
56                virtual void visit( ConstantExpr *constantExpr );
57                virtual void visit( SizeofExpr *sizeofExpr );
58                virtual void visit( AlignofExpr *alignofExpr );
59                virtual void visit( UntypedOffsetofExpr *offsetofExpr );
60                virtual void visit( OffsetofExpr *offsetofExpr );
61                virtual void visit( OffsetPackExpr *offsetPackExpr );
62                virtual void visit( AttrExpr *attrExpr );
63                virtual void visit( LogicalExpr *logicalExpr );
64                virtual void visit( ConditionalExpr *conditionalExpr );
65                virtual void visit( CommaExpr *commaExpr );
66                virtual void visit( ImplicitCopyCtorExpr * impCpCtorExpr );
67                virtual void visit( ConstructorExpr * ctorExpr );
68                virtual void visit( RangeExpr * rangeExpr );
69                virtual void visit( UntypedTupleExpr *tupleExpr );
70                virtual void visit( TupleExpr *tupleExpr );
71                virtual void visit( TupleIndexExpr *tupleExpr );
72                virtual void visit( TupleAssignExpr *tupleExpr );
73                virtual void visit( UniqueExpr *unqExpr );
74                virtual void visit( StmtExpr *stmtExpr );
75                virtual void visit( UntypedInitExpr *initExpr );
76                /// Runs a new alternative finder on each element in [begin, end)
77                /// and writes each alternative finder to out.
78                template< typename InputIterator, typename OutputIterator >
79                void findSubExprs( InputIterator begin, InputIterator end, OutputIterator out );
80
81                /// Adds alternatives for anonymous members
82                void addAnonConversions( const Alternative & alt );
83                /// Adds alternatives for member expressions, given the aggregate, conversion cost for that aggregate, and name of the member
84                template< typename StructOrUnionType > void addAggMembers( StructOrUnionType *aggInst, Expression *expr, const Cost &newCost, const TypeEnvironment & env, Expression * member );
85                /// Adds alternatives for member expressions where the left side has tuple type
86                void addTupleMembers( TupleType * tupleType, Expression *expr, const Cost &newCost, const TypeEnvironment & env, Expression * member );
87                /// Adds alternatives for offsetof expressions, given the base type and name of the member
88                template< typename StructOrUnionType > void addOffsetof( StructOrUnionType *aggInst, const std::string &name );
89                bool instantiateFunction( std::list< DeclarationWithType* >& formals, const AltList &actuals, bool isVarArgs, OpenVarSet& openVars, TypeEnvironment &resultEnv, AssertionSet &resultNeed, AssertionSet &resultHave, AltList & out );
90                template< typename OutputIterator >
91                void makeFunctionAlternatives( const Alternative &func, FunctionType *funcType, const AltList &actualAlt, OutputIterator out );
92                template< typename OutputIterator >
93                void inferParameters( const AssertionSet &need, AssertionSet &have, const Alternative &newAlt, OpenVarSet &openVars, OutputIterator out );
94                void resolveAttr( DeclarationWithType *funcDecl, FunctionType *function, Type *argType, const TypeEnvironment &env );
95
96                const SymTab::Indexer &indexer;
97                AltList alternatives;
98                const TypeEnvironment &env;
99                Type * targetType = nullptr;
100        }; // AlternativeFinder
101
102        Expression *resolveInVoidContext( Expression *expr, const SymTab::Indexer &indexer, TypeEnvironment &env );
103
104        template< typename InputIterator, typename OutputIterator >
105        void findMinCost( InputIterator begin, InputIterator end, OutputIterator out ) {
106                AltList alternatives;
107
108                // select the alternatives that have the minimum parameter cost
109                Cost minCost = Cost::infinity;
110                for ( InputIterator i = begin; i != end; ++i ) {
111                        if ( i->cost < minCost ) {
112                                minCost = i->cost;
113                                i->cost = i->cvtCost;
114                                alternatives.clear();
115                                alternatives.push_back( *i );
116                        } else if ( i->cost == minCost ) {
117                                i->cost = i->cvtCost;
118                                alternatives.push_back( *i );
119                        }
120                }
121                std::copy( alternatives.begin(), alternatives.end(), out );
122        }
123
124        Cost sumCost( const AltList &in );
125
126        template< typename InputIterator >
127        void simpleCombineEnvironments( InputIterator begin, InputIterator end, TypeEnvironment &result ) {
128                while ( begin != end ) {
129                        result.simpleCombine( (*begin++).env );
130                }
131        }
132} // namespace ResolvExpr
133
134// Local Variables: //
135// tab-width: 4 //
136// mode: c++ //
137// compile-command: "make install" //
138// End: //
Note: See TracBrowser for help on using the repository browser.