Changes in src/ResolvExpr/AlternativeFinder.cc [22cad76:e04ef3a]

File:

• src/ResolvExpr/AlternativeFinder.cc (modified) (11 diffs)

src/ResolvExpr/AlternativeFinder.cc

@@ -19 +19 @@
 #include <functional>
 #include <cassert>
-#include <unordered_map>
-#include <utility>
-#include <vector>
 
 #include "AlternativeFinder.h"
@@ -42 +39 @@
 #include "Tuples/NameMatcher.h"
 #include "Common/utility.h"
-#include "InitTweak/InitTweak.h"
 
 extern bool resolvep;
@@ -411 +407 @@
         }
 
-        /// 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 +416 @@
                 }
         }
-        
+
         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 +431 @@
                                         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 +438 @@
                 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 +455 @@
                                 std::cerr << std::endl;
                         )
-                        
                         AssertionSet newHave, newerNeed( newNeed );
                         TypeEnvironment newEnv( newAlt.env );
@@ -487 +477 @@
                                 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 +491 @@
                                 // 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 +513 @@
                 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 ";
@@ -561 +546 @@
 
                 {
-                        std::string fname = InitTweak::getFunctionName( untypedExpr );
-                        if ( fname == "&&" ) {
+                        NameExpr *fname = 0;;
+                        if ( ( fname = dynamic_cast<NameExpr *>( untypedExpr->get_function()))
+                                 && ( fname->get_name() == std::string("&&")) ) {
                                 VoidType v = Type::Qualifiers();                // resolve to type void *
                                 PointerType pt( Type::Qualifiers(), v.clone() );