source: src/ResolvExpr/AlternativeFinder.h @ 848ce71

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerresolv-newwith_gc
Last change on this file since 848ce71 was 848ce71, checked in by Rob Schluntz <rschlunt@…>, 6 years ago

resolve untyped member exprs for tuples

  • Property mode set to 100644
File size: 5.7 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 : Rob Schluntz
12// Last Modified On : Tue Apr 19 11:44:53 2016
13// Update Count     : 2
14//
15
16#ifndef ALTERNATIVEFINDER_H
17#define ALTERNATIVEFINDER_H
18
19#include <set>
20
21#include "Alternative.h"
22#include "Unify.h"
23#include "SynTree/SynTree.h"
24#include "SymTab/Indexer.h"
25#include "SynTree/TypeSubstitution.h"
26
27namespace ResolvExpr {
28        class AlternativeFinder : public Visitor {
29          public:
30                AlternativeFinder( const SymTab::Indexer &indexer, const TypeEnvironment &env );
31                void find( Expression *expr, bool adjust = false, bool prune = true );
32                /// Calls find with the adjust flag set; adjustment turns array and function types into equivalent pointer types
33                void findWithAdjustment( Expression *expr, bool prune = true );
34                AltList &get_alternatives() { return alternatives; }
35
36                // make this look like an STL container so that we can apply generic algorithms
37                typedef Alternative value_type;
38                typedef AltList::iterator iterator;
39                typedef AltList::const_iterator const_iterator;
40                AltList::iterator begin() { return alternatives.begin(); }
41                AltList::iterator end() { return alternatives.end(); }
42                AltList::const_iterator begin() const { return alternatives.begin(); }
43                AltList::const_iterator end() const { return alternatives.end(); }
44
45                const SymTab::Indexer &get_indexer() const { return indexer; }
46                const TypeEnvironment &get_environ() const { return env; }
47          private:
48                virtual void visit( ApplicationExpr *applicationExpr );
49                virtual void visit( UntypedExpr *untypedExpr );
50                virtual void visit( AddressExpr *addressExpr );
51                virtual void visit( CastExpr *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( TupleExpr *tupleExpr );
67                virtual void visit( ImplicitCopyCtorExpr * impCpCtorExpr );
68                virtual void visit( ConstructorExpr * ctorExpr );
69                virtual void visit( TupleIndexExpr *tupleExpr );
70                virtual void visit( TupleAssignExpr *tupleExpr );
71                /// Runs a new alternative finder on each element in [begin, end)
72                /// and writes each alternative finder to out.
73                template< typename InputIterator, typename OutputIterator >
74                void findSubExprs( InputIterator begin, InputIterator end, OutputIterator out );
75
76                /// Adds alternatives for member expressions, given the aggregate, conversion cost for that aggregate, and name of the member
77                template< typename StructOrUnionType > void addAggMembers( StructOrUnionType *aggInst, Expression *expr, const Cost &newCost, const TypeEnvironment & env, Expression * member );
78                /// Adds alternatives for member expressions where the left side has tuple type
79                void addTupleMembers( TupleType * tupleType, Expression *expr, const Cost &newCost, const TypeEnvironment & env, Expression * member );
80                /// Adds alternatives for offsetof expressions, given the base type and name of the member
81                template< typename StructOrUnionType > void addOffsetof( StructOrUnionType *aggInst, const std::string &name );
82                bool instantiateFunction( std::list< DeclarationWithType* >& formals, const AltList &actuals, bool isVarArgs, OpenVarSet& openVars, TypeEnvironment &resultEnv, AssertionSet &resultNeed, AssertionSet &resultHave, AltList & out );
83                template< typename OutputIterator >
84                void makeFunctionAlternatives( const Alternative &func, FunctionType *funcType, const AltList &actualAlt, OutputIterator out );
85                template< typename OutputIterator >
86                void inferParameters( const AssertionSet &need, AssertionSet &have, const Alternative &newAlt, OpenVarSet &openVars, OutputIterator out );
87                void resolveAttr( DeclarationWithType *funcDecl, FunctionType *function, Type *argType, const TypeEnvironment &env );
88
89                const SymTab::Indexer &indexer;
90                AltList alternatives;
91                const TypeEnvironment &env;
92        }; // AlternativeFinder
93
94        Expression *resolveInVoidContext( Expression *expr, const SymTab::Indexer &indexer, TypeEnvironment &env );
95
96        template< typename InputIterator, typename OutputIterator >
97        void findMinCost( InputIterator begin, InputIterator end, OutputIterator out ) {
98                AltList alternatives;
99
100                // select the alternatives that have the minimum parameter cost
101                Cost minCost = Cost::infinity;
102                for ( InputIterator i = begin; i != end; ++i ) {
103                        if ( i->cost < minCost ) {
104                                minCost = i->cost;
105                                i->cost = i->cvtCost;
106                                alternatives.clear();
107                                alternatives.push_back( *i );
108                        } else if ( i->cost == minCost ) {
109                                i->cost = i->cvtCost;
110                                alternatives.push_back( *i );
111                        }
112                }
113                std::copy( alternatives.begin(), alternatives.end(), out );
114        }
115
116        Cost sumCost( const AltList &in );
117
118        template< typename InputIterator >
119        void simpleCombineEnvironments( InputIterator begin, InputIterator end, TypeEnvironment &result ) {
120                while ( begin != end ) {
121                        result.simpleCombine( (*begin++).env );
122                }
123        }
124} // namespace ResolvExpr
125
126#endif // ALTERNATIVEFINDER_H
127
128// Local Variables: //
129// tab-width: 4 //
130// mode: c++ //
131// compile-command: "make install" //
132// End: //
Note: See TracBrowser for help on using the repository browser.