Changes in src/ResolvExpr/Unify.cc [954c954:73f1b1c]

File:

• src/ResolvExpr/Unify.cc (modified) (12 diffs)

src/ResolvExpr/Unify.cc

@@ -395 +395 @@
 
         template< typename Iterator1, typename Iterator2 >
-        bool unifyTypeList( Iterator1 list1Begin, Iterator1 list1End, Iterator2 list2Begin, Iterator2 list2End, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, const SymTab::Indexer &indexer ) {
+        bool unifyDeclList( Iterator1 list1Begin, Iterator1 list1End, Iterator2 list2Begin, Iterator2 list2End, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, const SymTab::Indexer &indexer ) {
                 auto get_type = [](DeclarationWithType * dwt){ return dwt->get_type(); };
                 for ( ; list1Begin != list1End && list2Begin != list2End; ++list1Begin, ++list2Begin ) {
@@ -489 +489 @@
                                         || flatOther->isTtype()
                         ) {
-                                if ( unifyTypeList( flatFunc->parameters.begin(), flatFunc->parameters.end(), flatOther->parameters.begin(), flatOther->parameters.end(), env, needAssertions, haveAssertions, openVars, indexer ) ) {
-                                        if ( unifyTypeList( flatFunc->returnVals.begin(), flatFunc->returnVals.end(), flatOther->returnVals.begin(), flatOther->returnVals.end(), env, needAssertions, haveAssertions, openVars, indexer ) ) {
+                                if ( unifyDeclList( flatFunc->parameters.begin(), flatFunc->parameters.end(), flatOther->parameters.begin(), flatOther->parameters.end(), env, needAssertions, haveAssertions, openVars, indexer ) ) {
+                                        if ( unifyDeclList( flatFunc->returnVals.begin(), flatFunc->returnVals.end(), flatOther->returnVals.begin(), flatOther->returnVals.end(), env, needAssertions, haveAssertions, openVars, indexer ) ) {
 
                                                 // the original types must be used in mark assertions, since pointer comparisons are used
@@ -784 +784 @@
 
                 /// returns flattened version of `src`
-                static std::vector< ast::ptr< ast::Type > > flattenList(
-                        const std::vector< ast::ptr< ast::Type > > & src, ast::TypeEnvironment & env
+                static std::vector< ast::ptr< ast::DeclWithType > > flattenList(
+                        const std::vector< ast::ptr< ast::DeclWithType > > & src, ast::TypeEnvironment & env
                 ) {
-                        std::vector< ast::ptr< ast::Type > > dst;
+                        std::vector< ast::ptr< ast::DeclWithType > > dst;
                         dst.reserve( src.size() );
-                        for ( const auto & d : src ) {
+                        for ( const ast::DeclWithType * d : src ) {
                                 ast::Pass<TtypeExpander_new> expander{ env };
                                 // TtypeExpander pass is impure (may mutate nodes in place)
                                 // need to make nodes shared to prevent accidental mutation
-                                ast::ptr<ast::Type> dc = d->accept(expander);
-                                auto types = flatten( dc );
+                                ast::ptr<ast::DeclWithType> dc = d->accept(expander);
+                                auto types = flatten( dc->get_type() );
                                 for ( ast::ptr< ast::Type > & t : types ) {
                                         // outermost const, volatile, _Atomic qualifiers in parameters should not play
@@ -803 +803 @@
                                         // requirements than a non-mutex function
                                         remove_qualifiers( t, ast::CV::Const | ast::CV::Volatile | ast::CV::Atomic );
-                                        dst.emplace_back( t );
+                                        dst.emplace_back( new ast::ObjectDecl{ dc->location, "", t } );
                                 }
                         }
@@ -811 +811 @@
                 /// Creates a tuple type based on a list of DeclWithType
                 template< typename Iter >
-                static ast::ptr< ast::Type > tupleFromTypes( Iter crnt, Iter end ) {
+                static ast::ptr< ast::Type > tupleFromDecls( Iter crnt, Iter end ) {
                         std::vector< ast::ptr< ast::Type > > types;
                         while ( crnt != end ) {
                                 // it is guaranteed that a ttype variable will be bound to a flat tuple, so ensure
                                 // that this results in a flat tuple
-                                flatten( *crnt, types );
+                                flatten( (*crnt)->get_type(), types );
 
                                 ++crnt;
@@ -825 +825 @@
 
                 template< typename Iter >
-                static bool unifyTypeList(
+                static bool unifyDeclList(
                         Iter crnt1, Iter end1, Iter crnt2, Iter end2, ast::TypeEnvironment & env,
                         ast::AssertionSet & need, ast::AssertionSet & have, const ast::OpenVarSet & open,
@@ -831 +831 @@
                 ) {
                         while ( crnt1 != end1 && crnt2 != end2 ) {
-                                const ast::Type * t1 = *crnt1;
-                                const ast::Type * t2 = *crnt2;
+                                const ast::Type * t1 = (*crnt1)->get_type();
+                                const ast::Type * t2 = (*crnt2)->get_type();
                                 bool isTuple1 = Tuples::isTtype( t1 );
                                 bool isTuple2 = Tuples::isTtype( t2 );
@@ -840 +840 @@
                                         // combine remainder of list2, then unify
                                         return unifyExact(
-                                                t1, tupleFromTypes( crnt2, end2 ), env, need, have, open,
+                                                t1, tupleFromDecls( crnt2, end2 ), env, need, have, open,
                                                 noWiden(), symtab );
                                 } else if ( ! isTuple1 && isTuple2 ) {
                                         // combine remainder of list1, then unify
                                         return unifyExact(
-                                                tupleFromTypes( crnt1, end1 ), t2, env, need, have, open,
+                                                tupleFromDecls( crnt1, end1 ), t2, env, need, have, open,
                                                 noWiden(), symtab );
                                 }
@@ -860 +860 @@
                         if ( crnt1 != end1 ) {
                                 // try unifying empty tuple with ttype
-                                const ast::Type * t1 = *crnt1;
+                                const ast::Type * t1 = (*crnt1)->get_type();
                                 if ( ! Tuples::isTtype( t1 ) ) return false;
                                 return unifyExact(
-                                        t1, tupleFromTypes( crnt2, end2 ), env, need, have, open,
+                                        t1, tupleFromDecls( crnt2, end2 ), env, need, have, open,
                                         noWiden(), symtab );
                         } else if ( crnt2 != end2 ) {
                                 // try unifying empty tuple with ttype
-                                const ast::Type * t2 = *crnt2;
+                                const ast::Type * t2 = (*crnt2)->get_type();
                                 if ( ! Tuples::isTtype( t2 ) ) return false;
                                 return unifyExact(
-                                        tupleFromTypes( crnt1, end1 ), t2, env, need, have, open,
+                                        tupleFromDecls( crnt1, end1 ), t2, env, need, have, open,
                                         noWiden(), symtab );
                         }
@@ -877 +877 @@
                 }
 
-                static bool unifyTypeList(
-                        const std::vector< ast::ptr< ast::Type > > & list1,
-                        const std::vector< ast::ptr< ast::Type > > & list2,
+                static bool unifyDeclList(
+                        const std::vector< ast::ptr< ast::DeclWithType > > & list1,
+                        const std::vector< ast::ptr< ast::DeclWithType > > & list2,
                         ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have,
                         const ast::OpenVarSet & open, const ast::SymbolTable & symtab
                 ) {
-                        return unifyTypeList(
+                        return unifyDeclList(
                                 list1.begin(), list1.end(), list2.begin(), list2.end(), env, need, have, open,
                                 symtab );
@@ -928 +928 @@
                         ) return;
 
-                        if ( ! unifyTypeList( params, params2, tenv, need, have, open, symtab ) ) return;
-                        if ( ! unifyTypeList(
+                        if ( ! unifyDeclList( params, params2, tenv, need, have, open, symtab ) ) return;
+                        if ( ! unifyDeclList(
                                 func->returns, func2->returns, tenv, need, have, open, symtab ) ) return;
 
@@ -1232 +1232 @@
         ast::ptr<ast::Type> extractResultType( const ast::FunctionType * func ) {
                 if ( func->returns.empty() ) return new ast::VoidType{};
-                if ( func->returns.size() == 1 ) return func->returns[0];
+                if ( func->returns.size() == 1 ) return func->returns[0]->get_type();
 
                 std::vector<ast::ptr<ast::Type>> tys;
-                for ( const auto & decl : func->returns ) {
-                        tys.emplace_back( decl );
+                for ( const ast::DeclWithType * decl : func->returns ) {
+                        tys.emplace_back( decl->get_type() );
                 }
                 return new ast::TupleType{ std::move(tys) };