| 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 | |
|---|
| 27 | namespace 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 ); |
|---|
| 32 | /// Calls find with the adjust flag set; adjustment turns array and function types into equivalent pointer types |
|---|
| 33 | void findWithAdjustment( Expression *expr ); |
|---|
| 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 | public: // xxx - temporary hack - should make Tuples::TupleAssignment a friend |
|---|
| 69 | /// Runs a new alternative finder on each element in [begin, end) |
|---|
| 70 | /// and writes each alternative finder to out. |
|---|
| 71 | template< typename InputIterator, typename OutputIterator > |
|---|
| 72 | void findSubExprs( InputIterator begin, InputIterator end, OutputIterator out ); |
|---|
| 73 | |
|---|
| 74 | private: |
|---|
| 75 | /// Adds alternatives for member expressions, given the aggregate, conversion cost for that aggregate, and name of the member |
|---|
| 76 | template< typename StructOrUnionType > void addAggMembers( StructOrUnionType *aggInst, Expression *expr, const Cost &newCost, Expression * member ); |
|---|
| 77 | /// Adds alternatives for offsetof expressions, given the base type and name of the member |
|---|
| 78 | template< typename StructOrUnionType > void addOffsetof( StructOrUnionType *aggInst, const std::string &name ); |
|---|
| 79 | bool instantiateFunction( std::list< DeclarationWithType* >& formals, /*const*/ AltList &actuals, bool isVarArgs, OpenVarSet& openVars, TypeEnvironment &resultEnv, AssertionSet &resultNeed, AssertionSet &resultHave ); |
|---|
| 80 | template< typename OutputIterator > |
|---|
| 81 | void makeFunctionAlternatives( const Alternative &func, FunctionType *funcType, AltList &actualAlt, OutputIterator out ); |
|---|
| 82 | template< typename OutputIterator > |
|---|
| 83 | void inferParameters( const AssertionSet &need, AssertionSet &have, const Alternative &newAlt, OpenVarSet &openVars, OutputIterator out ); |
|---|
| 84 | void resolveAttr( DeclarationWithType *funcDecl, FunctionType *function, Type *argType, const TypeEnvironment &env ); |
|---|
| 85 | |
|---|
| 86 | const SymTab::Indexer &indexer; |
|---|
| 87 | AltList alternatives; |
|---|
| 88 | const TypeEnvironment &env; |
|---|
| 89 | }; // AlternativeFinder |
|---|
| 90 | |
|---|
| 91 | Expression *resolveInVoidContext( Expression *expr, const SymTab::Indexer &indexer, TypeEnvironment &env ); |
|---|
| 92 | } // namespace ResolvExpr |
|---|
| 93 | |
|---|
| 94 | #endif // ALTERNATIVEFINDER_H |
|---|
| 95 | |
|---|
| 96 | // Local Variables: // |
|---|
| 97 | // tab-width: 4 // |
|---|
| 98 | // mode: c++ // |
|---|
| 99 | // compile-command: "make install" // |
|---|
| 100 | // End: // |
|---|
