Changes in / [66999e7:472ca32]

Location:

src/ResolvExpr

Files:

• AlternativeFinder.cc (modified) (9 diffs)
• RenameVars.cc (modified) (4 diffs)
• typeops.h (modified) (1 diff)

src/ResolvExpr/AlternativeFinder.cc

@@ -19 +19 @@
 #include <functional>
 #include <cassert>
-#include <unordered_map>
-#include <utility>
-#include <vector>
 
 #include "AlternativeFinder.h"
@@ -411 +408 @@
         }
 
-        /// Map of declaration uniqueIds (intended to be the assertions in an AssertionSet) to their parents and the number of times they've been included
-        typedef std::unordered_map< UniqueId, std::unordered_map< UniqueId, unsigned > > AssertionParentSet;
-        
-        static const int recursionLimit = 10;  ///< Limit to depth of recursion satisfaction
-        static const unsigned recursionParentLimit = 1;  ///< Limit to the number of times an assertion can recursively use itself
+        static const int recursionLimit = 10;
 
         void addToIndexer( AssertionSet &assertSet, SymTab::Indexer &indexer ) {
@@ -424 +417 @@
                 }
         }
-        
+
         template< typename ForwardIterator, typename OutputIterator >
-        void inferRecursive( ForwardIterator begin, ForwardIterator end, const Alternative &newAlt, OpenVarSet &openVars, const SymTab::Indexer &decls, const AssertionSet &newNeed, const AssertionParentSet &needParents, 
-                                                 int level, const SymTab::Indexer &indexer, OutputIterator out ) {
+        void inferRecursive( ForwardIterator begin, ForwardIterator end, const Alternative &newAlt, OpenVarSet &openVars, const SymTab::Indexer &decls, const AssertionSet &newNeed, int level, const SymTab::Indexer &indexer, OutputIterator out ) {
                 if ( begin == end ) {
                         if ( newNeed.empty() ) {
@@ -440 +432 @@
                                         printAssertionSet( newNeed, std::cerr, 8 );
                                 )
-                                inferRecursive( newNeed.begin(), newNeed.end(), newAlt, openVars, decls, newerNeed, needParents, level+1, indexer, out );
+                                inferRecursive( newNeed.begin(), newNeed.end(), newAlt, openVars, decls, newerNeed, level+1, indexer, out );
                                 return;
                         }
@@ -447 +439 @@
                 ForwardIterator cur = begin++;
                 if ( ! cur->second ) {
-                        inferRecursive( begin, end, newAlt, openVars, decls, newNeed, needParents, level, indexer, out );
+                        inferRecursive( begin, end, newAlt, openVars, decls, newNeed, level, indexer, out );
                 }
                 DeclarationWithType *curDecl = cur->first;
@@ -464 +456 @@
                                 std::cerr << std::endl;
                         )
-                        
                         AssertionSet newHave, newerNeed( newNeed );
                         TypeEnvironment newEnv( newAlt.env );
@@ -487 +478 @@
                                 newerAlt.env = newEnv;
                                 assert( (*candidate)->get_uniqueId() );
-                                DeclarationWithType *candDecl = static_cast< DeclarationWithType* >( Declaration::declFromId( (*candidate)->get_uniqueId() ) );
-                                AssertionParentSet newNeedParents( needParents );
-                                // skip repeatingly-self-recursive assertion satisfaction
-                                if ( newNeedParents[ curDecl->get_uniqueId() ][ candDecl->get_uniqueId() ]++ > recursionParentLimit ) continue;
-                                Expression *varExpr = new VariableExpr( candDecl );
+                                Expression *varExpr = new VariableExpr( static_cast< DeclarationWithType* >( Declaration::declFromId( (*candidate)->get_uniqueId() ) ) );
                                 deleteAll( varExpr->get_results() );
                                 varExpr->get_results().clear();
@@ -505 +492 @@
                                 // XXX: this is a memory leak, but adjType can't be deleted because it might contain assertions
                                 appExpr->get_inferParams()[ curDecl->get_uniqueId() ] = ParamEntry( (*candidate)->get_uniqueId(), adjType->clone(), curDecl->get_type()->clone(), varExpr );
-                                inferRecursive( begin, end, newerAlt, newOpenVars, newDecls, newerNeed, newNeedParents, level, indexer, out );
+                                inferRecursive( begin, end, newerAlt, newOpenVars, newDecls, newerNeed, level, indexer, out );
                         } else {
                                 delete adjType;
@@ -527 +514 @@
                 addToIndexer( have, decls );
                 AssertionSet newNeed;
-                AssertionParentSet needParents;
-                inferRecursive( need.begin(), need.end(), newAlt, openVars, decls, newNeed, needParents, 0, indexer, out );
+                inferRecursive( need.begin(), need.end(), newAlt, openVars, decls, newNeed, 0, indexer, out );
 //      PRINT(
 //          std::cerr << "declaration 14 is ";

src/ResolvExpr/RenameVars.cc

@@ -45 +45 @@
         void RenameVars::visit( PointerType *pointerType ) {
                 typeBefore( pointerType );
+///   std::cout << "do pointer" << std::endl;
                 maybeAccept( pointerType->get_base(), *this );
+///   std::cout << "done pointer" << std::endl;
                 typeAfter( pointerType );
         }
@@ -58 +60 @@
         void RenameVars::visit( FunctionType *functionType ) {
                 typeBefore( functionType );
+///   std::cout << "return vals" << std::endl;
                 acceptAll( functionType->get_returnVals(), *this );
+///   std::cout << functionType->get_parameters().size() << " parameters" << std::endl;
                 acceptAll( functionType->get_parameters(), *this );
+///   std::cout << "done function" << std::endl;
                 typeAfter( functionType );
         }
@@ -90 +95 @@
         void RenameVars::visit( TypeInstType *instType ) {
                 typeBefore( instType );
+///   std::cout << "instance of type " << instType->get_name() << std::endl;
                 std::map< std::string, std::string >::const_iterator i = mapStack.front().find( instType->get_name() );
                 if ( i != mapStack.front().end() ) {
+///     std::cout << "found name " << i->second << std::endl;
                         instType->set_name( i->second );
                 } else {
+///     std::cout << "no name found" << std::endl;
                 } // if
                 acceptAll( instType->get_parameters(), *this );
@@ -112 +120 @@
         void RenameVars::typeBefore( Type *type ) {
                 if ( ! type->get_forall().empty() ) {
+///     std::cout << "type with forall: ";
+///     type->print( std::cout );
+///     std::cout << std::endl;
                         // copies current name mapping into new mapping
                         mapStack.push_front( mapStack.front() );

src/ResolvExpr/typeops.h

@@ -54 +54 @@
   
         // in AdjustExprType.cc
-        /// Replaces array types with the equivalent pointer, and function types with a pointer-to-function
         void adjustExprType( Type *&type, const TypeEnvironment &env, const SymTab::Indexer &indexer );