Changes in src/ResolvExpr/AlternativeFinder.cc [8c84ebd:8e9cbb2]

File:

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

src/ResolvExpr/AlternativeFinder.cc

@@ -5 +5 @@
 // file "LICENCE" distributed with Cforall.
 //
-// AlternativeFinder.cc -- 
+// AlternativeFinder.cc --
 //
 // Author           : Richard C. Bilson
 // Created On       : Sat May 16 23:52:08 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Jul  3 17:58:39 2015
-// Update Count     : 22
+// Last Modified On : Mon Jul  4 17:02:51 2016
+// Update Count     : 29
 //
 
@@ -19 +19 @@
 #include <functional>
 #include <cassert>
+#include <unordered_map>
+#include <utility>
+#include <vector>
 
 #include "AlternativeFinder.h"
@@ -38 +41 @@
 #include "Tuples/TupleAssignment.h"
 #include "Tuples/NameMatcher.h"
-#include "utility.h"
+#include "Common/utility.h"
+#include "InitTweak/InitTweak.h"
 
 extern bool resolvep;
-#define PRINT( text ) if ( resolvep ) { text } 
+#define PRINT( text ) if ( resolvep ) { text }
 //#define DEBUG_COST
 
@@ -107 +111 @@
                                         if ( candidate->cost < mapPlace->second.candidate->cost ) {
                                                 PRINT(
-                                                        std::cout << "cost " << candidate->cost << " beats " << mapPlace->second.candidate->cost << std::endl;
+                                                        std::cerr << "cost " << candidate->cost << " beats " << mapPlace->second.candidate->cost << std::endl;
                                                 )
                                                 selected[ mangleName ] = current;
                                         } else if ( candidate->cost == mapPlace->second.candidate->cost ) {
                                                 PRINT(
-                                                        std::cout << "marking ambiguous" << std::endl;
+                                                        std::cerr << "marking ambiguous" << std::endl;
                                                 )
                                                 mapPlace->second.isAmbiguous = true;
@@ -122 +126 @@
 
                         PRINT(
-                                std::cout << "there are " << selected.size() << " alternatives before elimination" << std::endl;
+                                std::cerr << "there are " << selected.size() << " alternatives before elimination" << std::endl;
                         )
 
@@ -182 +186 @@
                         begin++;
                         PRINT(
-                                std::cout << "findSubExprs" << std::endl;
-                                printAlts( finder.alternatives, std::cout );
+                                std::cerr << "findSubExprs" << std::endl;
+                                printAlts( finder.alternatives, std::cerr );
                         )
                         *out++ = finder;
@@ -204 +208 @@
                 }
                 PRINT(
-                        std::cout << "alternatives before prune:" << std::endl;
-                        printAlts( alternatives, std::cout );
+                        std::cerr << "alternatives before prune:" << std::endl;
+                        printAlts( alternatives, std::cerr );
                 )
                 AltList::iterator oldBegin = alternatives.begin();
@@ -221 +225 @@
                 alternatives.erase( oldBegin, alternatives.end() );
                 PRINT(
-                        std::cout << "there are " << alternatives.size() << " alternatives after elimination" << std::endl;
+                        std::cerr << "there are " << alternatives.size() << " alternatives after elimination" << std::endl;
                 )
+
+                // Central location to handle gcc extension keyword for all expression types.
+                for ( Alternative &iter: alternatives ) {
+                        iter.expr->set_extension( expr->get_extension() );
+                } // for
         }
 
@@ -261 +270 @@
                 for ( std::list< Expression* >::iterator actualExpr = actuals.begin(); actualExpr != actuals.end(); ++actualExpr ) {
                         PRINT(
-                                std::cout << "actual expression:" << std::endl;
-                                (*actualExpr)->print( std::cout, 8 );
-                                std::cout << "--- results are" << std::endl;
-                                printAll( (*actualExpr)->get_results(), std::cout, 8 );
+                                std::cerr << "actual expression:" << std::endl;
+                                (*actualExpr)->print( std::cerr, 8 );
+                                std::cerr << "--- results are" << std::endl;
+                                printAll( (*actualExpr)->get_results(), std::cerr, 8 );
                         )
                         std::list< DeclarationWithType* >::iterator startFormal = formal;
@@ -278 +287 @@
                                 }
                                 PRINT(
-                                        std::cout << std::endl << "converting ";
-                                        (*actual)->print( std::cout, 8 );
-                                        std::cout << std::endl << " to ";
-                                        (*formal)->get_type()->print( std::cout, 8 );
+                                        std::cerr << std::endl << "converting ";
+                                        (*actual)->print( std::cerr, 8 );
+                                        std::cerr << std::endl << " to ";
+                                        (*formal)->get_type()->print( std::cerr, 8 );
                                 )
                                 Cost newCost = conversionCost( *actual, (*formal)->get_type(), indexer, alt.env );
                                 PRINT(
-                                        std::cout << std::endl << "cost is" << newCost << std::endl;
+                                        std::cerr << std::endl << "cost is" << newCost << std::endl;
                                 )
 
@@ -323 +332 @@
                 for ( InferredParams::const_iterator assert = appExpr->get_inferParams().begin(); assert != appExpr->get_inferParams().end(); ++assert ) {
                         PRINT(
-                                std::cout << std::endl << "converting ";
-                                assert->second.actualType->print( std::cout, 8 );
-                                std::cout << std::endl << " to ";
-                                assert->second.formalType->print( std::cout, 8 );
+                                std::cerr << std::endl << "converting ";
+                                assert->second.actualType->print( std::cerr, 8 );
+                                std::cerr << std::endl << " to ";
+                                assert->second.formalType->print( std::cerr, 8 );
                                 )
                                 Cost newCost = conversionCost( assert->second.actualType, assert->second.formalType, indexer, alt.env );
                         PRINT(
-                                std::cout << std::endl << "cost of conversion is " << newCost << std::endl;
+                                std::cerr << std::endl << "cost of conversion is " << newCost << std::endl;
                                 )
                                 if ( newCost == Cost::infinity ) {
@@ -407 +416 @@
         }
 
-        static const int recursionLimit = 10;
+        // /// 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*/ 4;  ///< Limit to depth of recursion satisfaction
+        //static const unsigned recursionParentLimit = 1;  ///< Limit to the number of times an assertion can recursively use itself
 
         void addToIndexer( AssertionSet &assertSet, SymTab::Indexer &indexer ) {
@@ -416 +429 @@
                 }
         }
-
+        
         template< typename ForwardIterator, typename OutputIterator >
-        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 ) {
+        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 ) {
                 if ( begin == end ) {
                         if ( newNeed.empty() ) {
@@ -431 +445 @@
                                         printAssertionSet( newNeed, std::cerr, 8 );
                                 )
-                                inferRecursive( newNeed.begin(), newNeed.end(), newAlt, openVars, decls, newerNeed, level+1, indexer, out );
+                                inferRecursive( newNeed.begin(), newNeed.end(), newAlt, openVars, decls, newerNeed, /*needParents,*/ level+1, indexer, out );
                                 return;
                         }
@@ -438 +452 @@
                 ForwardIterator cur = begin++;
                 if ( ! cur->second ) {
-                        inferRecursive( begin, end, newAlt, openVars, decls, newNeed, level, indexer, out );
+                        inferRecursive( begin, end, newAlt, openVars, decls, newNeed, /*needParents,*/ level, indexer, out );
                 }
                 DeclarationWithType *curDecl = cur->first;
@@ -448 +462 @@
                 std::list< DeclarationWithType* > candidates;
                 decls.lookupId( curDecl->get_name(), candidates );
-///   if ( candidates.empty() ) { std::cout << "no candidates!" << std::endl; }
+///   if ( candidates.empty() ) { std::cerr << "no candidates!" << std::endl; }
                 for ( std::list< DeclarationWithType* >::const_iterator candidate = candidates.begin(); candidate != candidates.end(); ++candidate ) {
                         PRINT(
-                                std::cout << "inferRecursive: candidate is ";
-                                (*candidate)->print( std::cout );
-                                std::cout << std::endl;
+                                std::cerr << "inferRecursive: candidate is ";
+                                (*candidate)->print( std::cerr );
+                                std::cerr << std::endl;
                         )
+                        
                         AssertionSet newHave, newerNeed( newNeed );
                         TypeEnvironment newEnv( newAlt.env );
@@ -477 +492 @@
                                 newerAlt.env = newEnv;
                                 assert( (*candidate)->get_uniqueId() );
-                                Expression *varExpr = new VariableExpr( static_cast< DeclarationWithType* >( Declaration::declFromId( (*candidate)->get_uniqueId() ) ) );
+                                DeclarationWithType *candDecl = static_cast< DeclarationWithType* >( Declaration::declFromId( (*candidate)->get_uniqueId() ) );
+                                //AssertionParentSet newNeedParents( needParents );
+                                // skip repeatingly-self-recursive assertion satisfaction
+                                // DOESN'T WORK: grandchild nodes conflict with their cousins
+                                //if ( newNeedParents[ curDecl->get_uniqueId() ][ candDecl->get_uniqueId() ]++ > recursionParentLimit ) continue;
+                                Expression *varExpr = new VariableExpr( candDecl );
                                 deleteAll( varExpr->get_results() );
                                 varExpr->get_results().clear();
                                 varExpr->get_results().push_front( adjType->clone() );
                                 PRINT(
-                                        std::cout << "satisfying assertion " << curDecl->get_uniqueId() << " ";
-                                        curDecl->print( std::cout );
-                                        std::cout << " with declaration " << (*candidate)->get_uniqueId() << " ";
-                                        (*candidate)->print( std::cout );
-                                        std::cout << std::endl;
+                                        std::cerr << "satisfying assertion " << curDecl->get_uniqueId() << " ";
+                                        curDecl->print( std::cerr );
+                                        std::cerr << " with declaration " << (*candidate)->get_uniqueId() << " ";
+                                        (*candidate)->print( std::cerr );
+                                        std::cerr << std::endl;
                                 )
                                 ApplicationExpr *appExpr = static_cast< ApplicationExpr* >( newerAlt.expr );
                                 // 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, level, indexer, out );
+                                inferRecursive( begin, end, newerAlt, newOpenVars, newDecls, newerNeed, /*newNeedParents,*/ level, indexer, out );
                         } else {
                                 delete adjType;
@@ -501 +521 @@
         void AlternativeFinder::inferParameters( const AssertionSet &need, AssertionSet &have, const Alternative &newAlt, OpenVarSet &openVars, OutputIterator out ) {
 //      PRINT(
-//          std::cout << "inferParameters: assertions needed are" << std::endl;
-//          printAll( need, std::cout, 8 );
+//          std::cerr << "inferParameters: assertions needed are" << std::endl;
+//          printAll( need, std::cerr, 8 );
 //          )
                 SymTab::Indexer decls( indexer );
                 PRINT(
-                        std::cout << "============= original indexer" << std::endl;
-                        indexer.print( std::cout );
-                        std::cout << "============= new indexer" << std::endl;
-                        decls.print( std::cout );
+                        std::cerr << "============= original indexer" << std::endl;
+                        indexer.print( std::cerr );
+                        std::cerr << "============= new indexer" << std::endl;
+                        decls.print( std::cerr );
                 )
                 addToIndexer( have, decls );
                 AssertionSet newNeed;
-                inferRecursive( need.begin(), need.end(), newAlt, openVars, decls, newNeed, 0, indexer, out );
+                //AssertionParentSet needParents;
+                inferRecursive( need.begin(), need.end(), newAlt, openVars, decls, newNeed, /*needParents,*/ 0, indexer, out );
 //      PRINT(
-//          std::cout << "declaration 14 is ";
+//          std::cerr << "declaration 14 is ";
 //          Declaration::declFromId
 //          *out++ = newAlt;
@@ -532 +553 @@
                         makeExprList( actualAlt, appExpr->get_args() );
                         PRINT(
-                                std::cout << "need assertions:" << std::endl;
-                                printAssertionSet( resultNeed, std::cout, 8 );
+                                std::cerr << "need assertions:" << std::endl;
+                                printAssertionSet( resultNeed, std::cerr, 8 );
                         )
                         inferParameters( resultNeed, resultHave, newAlt, openVars, out );
@@ -543 +564 @@
                 AlternativeFinder funcOpFinder( indexer, env );
 
-                AlternativeFinder funcFinder( indexer, env ); {
-                        NameExpr *fname = 0;;
-                        if ( ( fname = dynamic_cast<NameExpr *>( untypedExpr->get_function()))
-                                 && ( fname->get_name() == std::string("&&")) ) {
+                AlternativeFinder funcFinder( indexer, env );
+
+                {
+                        std::string fname = InitTweak::getFunctionName( untypedExpr );
+                        if ( fname == "&&" ) {
                                 VoidType v = Type::Qualifiers();                // resolve to type void *
                                 PointerType pt( Type::Qualifiers(), v.clone() );
@@ -570 +592 @@
 
                 AltList candidates;
+                SemanticError errors;
 
                 for ( AltList::const_iterator func = funcFinder.alternatives.begin(); func != funcFinder.alternatives.end(); ++func ) {
-                        PRINT(
-                                std::cout << "working on alternative: " << std::endl;
-                                func->print( std::cout, 8 );
-                        )
-                        // check if the type is pointer to function
-                        PointerType *pointer;
-                        if ( func->expr->get_results().size() == 1 && ( pointer = dynamic_cast< PointerType* >( func->expr->get_results().front() ) ) ) {
-                                if ( FunctionType *function = dynamic_cast< FunctionType* >( pointer->get_base() ) ) {
-                                        for ( std::list< AltList >::iterator actualAlt = possibilities.begin(); actualAlt != possibilities.end(); ++actualAlt ) {
-                                                // XXX
-                                                //Designators::check_alternative( function, *actualAlt );
-                                                makeFunctionAlternatives( *func, function, *actualAlt, std::back_inserter( candidates ) );
-                                        }
-                                } else if ( TypeInstType *typeInst = dynamic_cast< TypeInstType* >( pointer->get_base() ) ) {
-                                        EqvClass eqvClass;
-                                        if ( func->env.lookup( typeInst->get_name(), eqvClass ) && eqvClass.type ) {
-                                                if ( FunctionType *function = dynamic_cast< FunctionType* >( eqvClass.type ) ) {
-                                                        for ( std::list< AltList >::iterator actualAlt = possibilities.begin(); actualAlt != possibilities.end(); ++actualAlt ) {
-                                                                makeFunctionAlternatives( *func, function, *actualAlt, std::back_inserter( candidates ) );
-                                                        } // for
+                        try {
+                                PRINT(
+                                        std::cerr << "working on alternative: " << std::endl;
+                                        func->print( std::cerr, 8 );
+                                )
+                                // check if the type is pointer to function
+                                PointerType *pointer;
+                                if ( func->expr->get_results().size() == 1 && ( pointer = dynamic_cast< PointerType* >( func->expr->get_results().front() ) ) ) {
+                                        if ( FunctionType *function = dynamic_cast< FunctionType* >( pointer->get_base() ) ) {
+                                                for ( std::list< AltList >::iterator actualAlt = possibilities.begin(); actualAlt != possibilities.end(); ++actualAlt ) {
+                                                        // XXX
+                                                        //Designators::check_alternative( function, *actualAlt );
+                                                        makeFunctionAlternatives( *func, function, *actualAlt, std::back_inserter( candidates ) );
+                                                }
+                                        } else if ( TypeInstType *typeInst = dynamic_cast< TypeInstType* >( pointer->get_base() ) ) {
+                                                EqvClass eqvClass;
+                                                if ( func->env.lookup( typeInst->get_name(), eqvClass ) && eqvClass.type ) {
+                                                        if ( FunctionType *function = dynamic_cast< FunctionType* >( eqvClass.type ) ) {
+                                                                for ( std::list< AltList >::iterator actualAlt = possibilities.begin(); actualAlt != possibilities.end(); ++actualAlt ) {
+                                                                        makeFunctionAlternatives( *func, function, *actualAlt, std::back_inserter( candidates ) );
+                                                                } // for
+                                                        } // if
                                                 } // if
                                         } // if
+                                } else {
+                                        // seek a function operator that's compatible
+                                        if ( ! doneInit ) {
+                                                doneInit = true;
+                                                NameExpr *opExpr = new NameExpr( "?()" );
+                                                try {
+                                                        funcOpFinder.findWithAdjustment( opExpr );
+                                                } catch( SemanticError &e ) {
+                                                        // it's ok if there aren't any defined function ops
+                                                }
+                                                PRINT(
+                                                        std::cerr << "known function ops:" << std::endl;
+                                                        printAlts( funcOpFinder.alternatives, std::cerr, 8 );
+                                                )
+                                        }
+
+                                        for ( AltList::const_iterator funcOp = funcOpFinder.alternatives.begin(); funcOp != funcOpFinder.alternatives.end(); ++funcOp ) {
+                                                // check if the type is pointer to function
+                                                PointerType *pointer;
+                                                if ( funcOp->expr->get_results().size() == 1
+                                                        && ( pointer = dynamic_cast< PointerType* >( funcOp->expr->get_results().front() ) ) ) {
+                                                        if ( FunctionType *function = dynamic_cast< FunctionType* >( pointer->get_base() ) ) {
+                                                                for ( std::list< AltList >::iterator actualAlt = possibilities.begin(); actualAlt != possibilities.end(); ++actualAlt ) {
+                                                                        AltList currentAlt;
+                                                                        currentAlt.push_back( *func );
+                                                                        currentAlt.insert( currentAlt.end(), actualAlt->begin(), actualAlt->end() );
+                                                                        makeFunctionAlternatives( *funcOp, function, currentAlt, std::back_inserter( candidates ) );
+                                                                } // for
+                                                        } // if
+                                                } // if
+                                        } // for
                                 } // if
-                        } else {
-                                // seek a function operator that's compatible
-                                if ( ! doneInit ) {
-                                        doneInit = true;
-                                        NameExpr *opExpr = new NameExpr( "?()" );
-                                        try {
-                                                funcOpFinder.findWithAdjustment( opExpr );
-                                        } catch( SemanticError &e ) {
-                                                // it's ok if there aren't any defined function ops
-                                        }
-                                        PRINT(
-                                                std::cout << "known function ops:" << std::endl;
-                                                printAlts( funcOpFinder.alternatives, std::cout, 8 );
-                                        )
-                                }
-
-                                for ( AltList::const_iterator funcOp = funcOpFinder.alternatives.begin(); funcOp != funcOpFinder.alternatives.end(); ++funcOp ) {
-                                        // check if the type is pointer to function
-                                        PointerType *pointer;
-                                        if ( funcOp->expr->get_results().size() == 1
-                                                 && ( pointer = dynamic_cast< PointerType* >( funcOp->expr->get_results().front() ) ) ) {
-                                                if ( FunctionType *function = dynamic_cast< FunctionType* >( pointer->get_base() ) ) {
-                                                        for ( std::list< AltList >::iterator actualAlt = possibilities.begin(); actualAlt != possibilities.end(); ++actualAlt ) {
-                                                                AltList currentAlt;
-                                                                currentAlt.push_back( *func );
-                                                                currentAlt.insert( currentAlt.end(), actualAlt->begin(), actualAlt->end() );
-                                                                makeFunctionAlternatives( *funcOp, function, currentAlt, std::back_inserter( candidates ) );
-                                                        } // for
-                                                } // if
-                                        } // if
-                                } // for
-                        } // if
-                } // for
+                        } catch ( SemanticError &e ) {
+                                errors.append( e );
+                        }
+                } // for
+
+                // Implement SFINAE; resolution errors are only errors if there aren't any non-erroneous resolutions
+                if ( candidates.empty() && ! errors.isEmpty() ) { throw errors; }
 
                 for ( AltList::iterator withFunc = candidates.begin(); withFunc != candidates.end(); ++withFunc ) {
@@ -639 +669 @@
                                 FunctionType *function = dynamic_cast< FunctionType* >( pointer->get_base() );
                                 assert( function );
-                                std::cout << "Case +++++++++++++" << std::endl;
-                                std::cout << "formals are:" << std::endl;
-                                printAll( function->get_parameters(), std::cout, 8 );
-                                std::cout << "actuals are:" << std::endl;
-                                printAll( appExpr->get_args(), std::cout, 8 );
-                                std::cout << "bindings are:" << std::endl;
-                                withFunc->env.print( std::cout, 8 );
-                                std::cout << "cost of conversion is:" << cvtCost << std::endl;
+                                std::cerr << "Case +++++++++++++" << std::endl;
+                                std::cerr << "formals are:" << std::endl;
+                                printAll( function->get_parameters(), std::cerr, 8 );
+                                std::cerr << "actuals are:" << std::endl;
+                                printAll( appExpr->get_args(), std::cerr, 8 );
+                                std::cerr << "bindings are:" << std::endl;
+                                withFunc->env.print( std::cerr, 8 );
+                                std::cerr << "cost of conversion is:" << cvtCost << std::endl;
                         )
                         if ( cvtCost != Cost::infinity ) {
@@ -698 +728 @@
                         std::list< Type* >::iterator candidate_end = (*i).expr->get_results().begin();
                         std::advance( candidate_end, castExpr->get_results().size() );
+                        // unification run for side-effects
+                        unifyList( castExpr->get_results().begin(), castExpr->get_results().end(),
+                                           (*i).expr->get_results().begin(), candidate_end,
+                                   i->env, needAssertions, haveAssertions, openVars, indexer );
                         Cost thisCost = castCostList( (*i).expr->get_results().begin(), candidate_end,
-                                                                                  castExpr->get_results().begin(), castExpr->get_results().end(), indexer, i->env );
+                                                                                  castExpr->get_results().begin(), castExpr->get_results().end(),
+                                                                                  indexer, i->env );
                         if ( thisCost != Cost::infinity ) {
                                 // count one safe conversion for each value that is thrown away
@@ -787 +822 @@
         }
 
+        void AlternativeFinder::visit( AlignofExpr *alignofExpr ) {
+                if ( alignofExpr->get_isType() ) {
+                        alternatives.push_back( Alternative( alignofExpr->clone(), env, Cost::zero ) );
+                } else {
+                        // find all alternatives for the argument to sizeof
+                        AlternativeFinder finder( indexer, env );
+                        finder.find( alignofExpr->get_expr() );
+                        // find the lowest cost alternative among the alternatives, otherwise ambiguous
+                        AltList winners;
+                        findMinCost( finder.alternatives.begin(), finder.alternatives.end(), back_inserter( winners ) );
+                        if ( winners.size() != 1 ) {
+                                throw SemanticError( "Ambiguous expression in alignof operand: ", alignofExpr->get_expr() );
+                        } // if
+                        // return the lowest cost alternative for the argument
+                        Alternative &choice = winners.front();
+                        alternatives.push_back( Alternative( new AlignofExpr( choice.expr->clone() ), choice.env, Cost::zero ) );
+                } // if
+        }
+
+        template< typename StructOrUnionType >
+        void AlternativeFinder::addOffsetof( StructOrUnionType *aggInst, const std::string &name ) {
+                std::list< Declaration* > members;
+                aggInst->lookup( name, members );
+                for ( std::list< Declaration* >::const_iterator i = members.begin(); i != members.end(); ++i ) {
+                        if ( DeclarationWithType *dwt = dynamic_cast< DeclarationWithType* >( *i ) ) {
+                                alternatives.push_back( Alternative( new OffsetofExpr( aggInst->clone(), dwt->clone() ), env, Cost::zero ) );
+                                renameTypes( alternatives.back().expr );
+                        } else {
+                                assert( false );
+                        }
+                }
+        }
+
+        void AlternativeFinder::visit( UntypedOffsetofExpr *offsetofExpr ) {
+                AlternativeFinder funcFinder( indexer, env );
+                if ( StructInstType *structInst = dynamic_cast< StructInstType* >( offsetofExpr->get_type() ) ) {
+                        addOffsetof( structInst, offsetofExpr->get_member() );
+                } else if ( UnionInstType *unionInst = dynamic_cast< UnionInstType* >( offsetofExpr->get_type() ) ) {
+                        addOffsetof( unionInst, offsetofExpr->get_member() );
+                }
+        }
+
+        void AlternativeFinder::visit( OffsetofExpr *offsetofExpr ) {
+                alternatives.push_back( Alternative( offsetofExpr->clone(), env, Cost::zero ) );
+        }
+
+        void AlternativeFinder::visit( OffsetPackExpr *offsetPackExpr ) {
+                alternatives.push_back( Alternative( offsetPackExpr->clone(), env, Cost::zero ) );
+        }
+
         void AlternativeFinder::resolveAttr( DeclarationWithType *funcDecl, FunctionType *function, Type *argType, const TypeEnvironment &env ) {
                 // assume no polymorphism
@@ -792 +877 @@
                 assert( function->get_parameters().size() == 1 );
                 PRINT(
-                        std::cout << "resolvAttr: funcDecl is ";
-                        funcDecl->print( std::cout );
-                        std::cout << " argType is ";
-                        argType->print( std::cout );
-                        std::cout << std::endl;
+                        std::cerr << "resolvAttr: funcDecl is ";
+                        funcDecl->print( std::cerr );
+                        std::cerr << " argType is ";
+                        argType->print( std::cerr );
+                        std::cerr << std::endl;
                 )
                 if ( typesCompatibleIgnoreQualifiers( argType, function->get_parameters().front()->get_type(), indexer, env ) ) {
@@ -917 +1002 @@
                 } // for
         }
+
+        void AlternativeFinder::visit( ImplicitCopyCtorExpr * impCpCtorExpr ) {
+                alternatives.push_back( Alternative( impCpCtorExpr->clone(), env, Cost::zero ) );
+        }
 } // namespace ResolvExpr