source: src/ResolvExpr/TypeEnvironment.h @ 00ac42e

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerwith_gc
Last change on this file since 00ac42e was 00ac42e, checked in by Aaron Moss <a3moss@…>, 4 years ago

stop eagerly copying EqvClass? on lookup

  • Property mode set to 100644
File size: 5.8 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// TypeEnvironment.h --
8//
9// Author           : Richard C. Bilson
10// Created On       : Sun May 17 12:24:58 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Sat Jul 22 09:35:45 2017
13// Update Count     : 3
14//
15
16#pragma once
17
18#include <iostream>                    // for ostream
19#include <list>                        // for list, list<>::iterator, list<>...
20#include <map>                         // for map, map<>::value_compare
21#include <set>                         // for set
22#include <string>                      // for string
23
24#include "SynTree/Declaration.h"       // for TypeDecl::Data, DeclarationWit...
25#include "SynTree/SynTree.h"           // for UniqueId
26#include "SynTree/Type.h"              // for Type, Type::ForallList
27#include "SynTree/TypeSubstitution.h"  // for TypeSubstitution
28
29namespace ResolvExpr {
30        // adding this comparison operator significantly improves assertion resolution run time for
31        // some cases. The current resolution algorithm's speed partially depends on the order of
32        // assertions. Assertions which have fewer possible matches should appear before
33        // assertions which have more possible matches. This seems to imply that this could
34        // be further improved by providing an indexer as an additional argument and ordering based
35        // on the number of matches of the same kind (object, function) for the names of the
36        // declarations.
37        //
38        // I've seen a TU go from 54 minutes to 1 minute 34 seconds with the addition of this comparator.
39        //
40        // Note: since this compares pointers for position, minor changes in the source file that affect
41        // memory layout can alter compilation time in unpredictable ways. For example, the placement
42        // of a line directive can reorder type pointers with respect to each other so that assertions
43        // are seen in different orders, causing a potentially different number of unification calls when
44        // resolving assertions. I've seen a TU go from 36 seconds to 27 seconds by reordering line directives
45        // alone, so it would be nice to fix this comparison so that assertions compare more consistently.
46        // I've tried to modify this to compare on mangle name instead of type as the second comparator, but
47        // this causes some assertions to never be recorded. More investigation is needed.
48        struct AssertCompare {
49                bool operator()( DeclarationWithType * d1, DeclarationWithType * d2 ) const {
50                        int cmp = d1->get_name().compare( d2->get_name() );
51                        return cmp < 0 ||
52                                ( cmp == 0 && d1->get_type() < d2->get_type() );
53                }
54        };
55        struct AssertionSetValue {
56                bool isUsed;
57                // chain of Unique IDs of the assertion declarations. The first ID in the chain is the ID of an assertion on the current type,
58                // with each successive ID being the ID of an assertion pulled in by the previous ID. The last ID in the chain is
59                // the ID of the assertion that pulled in the current assertion.
60                std::list< UniqueId > idChain;
61        };
62        typedef std::map< DeclarationWithType*, AssertionSetValue, AssertCompare > AssertionSet;
63        typedef std::map< std::string, TypeDecl::Data > OpenVarSet;
64
65        void printAssertionSet( const AssertionSet &, std::ostream &, int indent = 0 );
66        void printOpenVarSet( const OpenVarSet &, std::ostream &, int indent = 0 );
67
68        struct EqvClass {
69                std::set< std::string > vars;
70                Type *type;
71                bool allowWidening;
72                TypeDecl::Data data;
73
74                void initialize( const EqvClass &src, EqvClass &dest );
75                void initialize( const EqvClass &src, EqvClass &dest, const Type *ty );
76                EqvClass();
77                EqvClass( const EqvClass &other );
78                EqvClass( const EqvClass &other, const Type *ty );
79                EqvClass &operator=( const EqvClass &other );
80                ~EqvClass();
81                void print( std::ostream &os, Indenter indent = {} ) const;
82        };
83
84        class TypeEnvironment {
85          public:
86                const EqvClass* lookup( const std::string &var ) const;
87                void add( const EqvClass &eqvClass );
88                void add( EqvClass &&eqvClass  );
89                void add( const Type::ForallList &tyDecls );
90                void add( const TypeSubstitution & sub );
91                template< typename SynTreeClass > int apply( SynTreeClass *&type ) const;
92                template< typename SynTreeClass > int applyFree( SynTreeClass *&type ) const;
93                void makeSubstitution( TypeSubstitution &result ) const;
94                bool isEmpty() const { return env.empty(); }
95                void print( std::ostream &os, Indenter indent = {} ) const;
96                void combine( const TypeEnvironment &second, Type *(*combineFunc)( Type*, Type* ) );
97                void simpleCombine( const TypeEnvironment &second );
98                void extractOpenVars( OpenVarSet &openVars ) const;
99                TypeEnvironment *clone() const { return new TypeEnvironment( *this ); }
100
101                /// Iteratively adds the environment of a new actual (with allowWidening = false),
102                /// and extracts open variables.
103                void addActual( const TypeEnvironment& actualEnv, OpenVarSet& openVars );
104
105                typedef std::list< EqvClass >::iterator iterator;
106                iterator begin() { return env.begin(); }
107                iterator end() { return env.end(); }
108                typedef std::list< EqvClass >::const_iterator const_iterator;
109                const_iterator begin() const { return env.begin(); }
110                const_iterator end() const { return env.end(); }
111          private:
112                std::list< EqvClass > env;
113                std::list< EqvClass >::iterator internal_lookup( const std::string &var );
114        };
115
116        template< typename SynTreeClass >
117        int TypeEnvironment::apply( SynTreeClass *&type ) const {
118                TypeSubstitution sub;
119                makeSubstitution( sub );
120                return sub.apply( type );
121        }
122
123        template< typename SynTreeClass >
124        int TypeEnvironment::applyFree( SynTreeClass *&type ) const {
125                TypeSubstitution sub;
126                makeSubstitution( sub );
127                return sub.applyFree( type );
128        }
129
130        std::ostream & operator<<( std::ostream & out, const TypeEnvironment & env );
131} // namespace ResolvExpr
132
133// Local Variables: //
134// tab-width: 4 //
135// mode: c++ //
136// compile-command: "make install" //
137// End: //
Note: See TracBrowser for help on using the repository browser.