Changes in / [f04a8b81:1ced874]
- Location:
- src
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
src/ResolvExpr/AlternativeFinder.cc
rf04a8b81 r1ced874 268 268 std::list< DeclarationWithType* >::iterator formal = formals.begin(); 269 269 std::list< Expression* >& actuals = appExpr->get_args(); 270 270 271 for ( std::list< Expression* >::iterator actualExpr = actuals.begin(); actualExpr != actuals.end(); ++actualExpr ) { 271 272 PRINT( … … 277 278 std::list< DeclarationWithType* >::iterator startFormal = formal; 278 279 Cost actualCost; 279 for ( std::list< Type* >::iterator actual = (*actualExpr)->get_results().begin(); actual != (*actualExpr)->get_results().end(); ++actual ) { 280 for ( std::list< Type* >::iterator actualType = (*actualExpr)->get_results().begin(); actualType != (*actualExpr)->get_results().end(); ++actualType ) { 281 // xxx - need tuple handling code here 280 282 if ( formal == formals.end() ) { 281 283 if ( function->get_isVarArgs() ) { … … 288 290 PRINT( 289 291 std::cerr << std::endl << "converting "; 290 (*actual )->print( std::cerr, 8 );292 (*actualType)->print( std::cerr, 8 ); 291 293 std::cerr << std::endl << " to "; 292 294 (*formal)->get_type()->print( std::cerr, 8 ); 293 295 ) 294 Cost newCost = conversionCost( *actual , (*formal)->get_type(), indexer, alt.env );296 Cost newCost = conversionCost( *actualType, (*formal)->get_type(), indexer, alt.env ); 295 297 PRINT( 296 298 std::cerr << std::endl << "cost is" << newCost << std::endl; … … 303 305 actualCost += newCost; 304 306 305 convCost += Cost( 0, polyCost( (*formal)->get_type(), alt.env, indexer ) + polyCost( *actual , alt.env, indexer ), 0 );307 convCost += Cost( 0, polyCost( (*formal)->get_type(), alt.env, indexer ) + polyCost( *actualType, alt.env, indexer ), 0 ); 306 308 307 309 formal++; … … 363 365 } 364 366 367 template< typename OutputIterator > 368 void flatten( Type * type, OutputIterator out ) { 369 if ( TupleType * tupleType = dynamic_cast< TupleType * >( type ) ) { 370 for ( Type * t : *tupleType ) { 371 flatten( t, out ); 372 } 373 } else { 374 *out++ = type; 375 } 376 } 377 365 378 bool AlternativeFinder::instantiateFunction( std::list< DeclarationWithType* >& formals, /*const*/ AltList &actuals, bool isVarArgs, OpenVarSet& openVars, TypeEnvironment &resultEnv, AssertionSet &resultNeed, AssertionSet &resultHave ) { 366 379 simpleCombineEnvironments( actuals.begin(), actuals.end(), resultEnv ); … … 380 393 */ 381 394 std::list< DeclarationWithType* >::iterator formal = formals.begin(); 395 396 std::list< Type * > formalTypes; 397 std::list< Type * >::iterator formalType = formalTypes.end(); 398 382 399 for ( AltList::const_iterator actualExpr = actuals.begin(); actualExpr != actuals.end(); ++actualExpr ) { 383 for ( std::list< Type* >::iterator actual = actualExpr->expr->get_results().begin(); actual != actualExpr->expr->get_results().end(); ++actual ) { 384 if ( formal == formals.end() ) { 385 return isVarArgs; 400 std::list< Type* > & actualTypes = actualExpr->expr->get_results(); 401 for ( std::list< Type* >::iterator actualType = actualTypes.begin(); actualType != actualTypes.end(); ++actualType ) { 402 if ( formalType == formalTypes.end() ) { 403 // the type of the formal parameter may be a tuple type. To make this easier to work with, 404 // flatten the tuple type and traverse the resulting list of types, incrementing the formal 405 // iterator once its types have been extracted. Once a particular formal parameter's type has 406 // been exhausted load the next formal parameter's type. 407 if ( formal == formals.end() ) { 408 return isVarArgs; 409 } 410 formalTypes.clear(); 411 flatten( (*formal)->get_type(), back_inserter( formalTypes ) ); 412 formalType = formalTypes.begin(); 413 ++formal; 386 414 } 387 415 PRINT( … … 389 417 (*formal)->get_type()->print( std::cerr ); 390 418 std::cerr << std::endl << "actual type is "; 391 (*actual )->print( std::cerr );419 (*actualType)->print( std::cerr ); 392 420 std::cerr << std::endl; 393 421 ) 394 if ( ! unify( (*formal)->get_type(), *actual, resultEnv, resultNeed, resultHave, openVars, indexer ) ) {422 if ( ! unify( *formalType, *actualType, resultEnv, resultNeed, resultHave, openVars, indexer ) ) { 395 423 return false; 396 424 } 397 formal++; 398 } 399 } 425 ++formalType; 426 } 427 } 428 429 // xxx - a tuple type was not completely matched 430 // partially handle the tuple with default arguments?? 431 if ( formalType != formalTypes.end() ) return false; 432 400 433 // Handling of default values 401 434 while ( formal != formals.end() ) { -
src/ResolvExpr/AlternativeFinder.h
rf04a8b81 r1ced874 67 67 virtual void visit( ImplicitCopyCtorExpr * impCpCtorExpr ); 68 68 public: // xxx - temporary hack - should make Tuples::TupleAssignment a friend 69 /// Runs a new alternative finder on each element in [begin, end) 70 /// and writes each alternative finder to out. 69 71 template< typename InputIterator, typename OutputIterator > 70 72 void findSubExprs( InputIterator begin, InputIterator end, OutputIterator out ); -
src/SynTree/Type.h
rf04a8b81 r1ced874 352 352 virtual ~TupleType(); 353 353 354 typedef std::list<Type*> value_type; 355 typedef value_type::iterator iterator; 356 354 357 std::list<Type*>& get_types() { return types; } 358 359 iterator begin() { return types.begin(); } 360 iterator end() { return types.end(); } 355 361 356 362 virtual TupleType *clone() const { return new TupleType( *this ); }
Note:
See TracChangeset
for help on using the changeset viewer.