source: src/ResolvExpr/AlternativeFinder.h @ 4e66a18

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

Add maybeFind to AlternativeFinder? to prevent excess exceptions when finding function operators

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