Changes in / [ac71a86:04cdd9b]
- Location:
- src
- Files:
-
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
src/InitTweak/InitTweak.cc
rac71a86 r04cdd9b 291 291 } 292 292 293 namespace { 294 template <typename Predicate> 295 bool allofCtorDtor( Statement * stmt, const Predicate & pred ) { 296 std::list< Expression * > callExprs; 297 collectCtorDtorCalls( stmt, callExprs ); 298 // if ( callExprs.empty() ) return false; // xxx - do I still need this check? 299 return std::all_of( callExprs.begin(), callExprs.end(), pred); 300 } 301 } 302 293 303 bool isIntrinsicSingleArgCallStmt( Statement * stmt ) { 294 std::list< Expression * > callExprs; 295 collectCtorDtorCalls( stmt, callExprs ); 296 // if ( callExprs.empty() ) return false; // xxx - do I still need this check? 297 return std::all_of( callExprs.begin(), callExprs.end(), []( Expression * callExpr ){ 304 return allofCtorDtor( stmt, []( Expression * callExpr ){ 298 305 if ( ApplicationExpr * appExpr = isIntrinsicCallExpr( callExpr ) ) { 299 306 assert( ! appExpr->get_function()->get_results().empty() ); … … 303 310 } 304 311 return false; 312 }); 313 } 314 315 bool isIntrinsicCallStmt( Statement * stmt ) { 316 return allofCtorDtor( stmt, []( Expression * callExpr ) { 317 return isIntrinsicCallExpr( callExpr ); 305 318 }); 306 319 } -
src/InitTweak/InitTweak.h
rac71a86 r04cdd9b 41 41 /// Intended to be used for default ctor/dtor calls, but might have use elsewhere. 42 42 /// Currently has assertions that make it less than fully general. 43 bool isIntrinsicSingleArgCallStmt( Statement * expr ); 43 bool isIntrinsicSingleArgCallStmt( Statement * stmt ); 44 45 /// True if stmt is a call statement where the function called is intrinsic. 46 bool isIntrinsicCallStmt( Statement * stmt ); 44 47 45 48 /// get all Ctor/Dtor call expressions from a Statement -
src/ResolvExpr/Resolver.cc
rac71a86 r04cdd9b 446 446 } else if ( StructInstType * st = dynamic_cast< StructInstType * >( initContext ) ) { 447 447 resolveAggrInit( st->get_baseStruct(), iter, end ); 448 } else if ( UnionInstType * st = dynamic_cast< UnionInstType * >( initContext ) ) {448 } else if ( UnionInstType * st = dynamic_cast< UnionInstType * >( initContext ) ) { 449 449 resolveAggrInit( st->get_baseUnion(), iter, end ); 450 } else if ( TypeInstType * tt = dynamic_cast< TypeInstType * >( initContext ) ) { 451 Type * base = tt->get_baseType()->get_base(); 452 if ( base ) { 453 // know the implementation type, so try using that as the initContext 454 initContext = base; 455 visit( listInit ); 456 } else { 457 // missing implementation type -- might be an unknown type variable, so try proceeding with the current init context 458 Visitor::visit( listInit ); 459 } 450 460 } else { 461 assert( dynamic_cast< BasicType * >( initContext ) || dynamic_cast< PointerType * >( initContext ) ); 451 462 // basic types are handled here 452 463 Visitor::visit( listInit ); … … 539 550 } 540 551 541 // xxx - todo542 // if ( InitTweak::isIntrinsicCallStmt( ctorInit->get_ctor() ) ) {543 // // can reduce the constructor down to a SingleInit using the544 // // second argument from the ctor call545 // }546 547 552 if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->get_dtor() ) ) { 548 553 delete ctorInit->get_dtor(); 549 554 ctorInit->set_dtor( NULL ); 550 555 } 556 557 // xxx - todo -- what about arrays? 558 // if ( dtor == NULL && InitTweak::isIntrinsicCallStmt( ctorInit->get_ctor() ) ) { 559 // // can reduce the constructor down to a SingleInit using the 560 // // second argument from the ctor call, since 561 // delete ctorInit->get_ctor(); 562 // ctorInit->set_ctor( NULL ); 563 564 // Expression * arg = 565 // ctorInit->set_init( new SingleInit( arg ) ); 566 // } 551 567 } 552 568 } // namespace ResolvExpr -
src/ResolvExpr/TypeEnvironment.cc
rac71a86 r04cdd9b 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // TypeEnvironment.cc -- 7 // TypeEnvironment.cc -- 8 8 // 9 9 // Author : Richard C. Bilson … … 23 23 24 24 namespace ResolvExpr { 25 // adding this comparison operator significantly improves assertion resolution run time for 26 // some cases. The current resolution algorithm's speed partially depends on the order of 27 // assertions. Assertions which have fewer possible matches should appear before 28 // assertions which have more possible matches. This seems to imply that this could 29 // be further improved by providing an indexer as an additional argument and ordering based 30 // on the number of matches of the same kind (object, function) for the names of the 31 // declarations. 32 // 33 // I've seen a TU go from 54 minutes to 1 minute 34 seconds with the addition of this comparator. 34 bool AssertCompare::operator()( DeclarationWithType * d1, DeclarationWithType * d2 ) { 35 // Objects are always less than functions 36 if ( ObjectDecl * objectDecl1 = dynamic_cast< ObjectDecl * >( d1 ) ) { 37 if ( ObjectDecl * objectDecl2 = dynamic_cast< ObjectDecl * >( d2 ) ) { 38 // objects are ordered by name then type pointer, in that order 39 int cmp = objectDecl1->get_name().compare( objectDecl2->get_name() ); 40 return cmp < 0 || 41 ( cmp == 0 && objectDecl1->get_type() < objectDecl2->get_type() ); 42 } else { 43 return true; 44 } 45 } else if ( FunctionDecl * funcDecl1 = dynamic_cast< FunctionDecl * >( d1 ) ) { 46 if ( FunctionDecl * funcDecl2 = dynamic_cast< FunctionDecl * >( d2 ) ) { 47 // functions are ordered by name, # parameters, # returnVals, type pointer in that order 48 FunctionType * ftype1 = funcDecl1->get_functionType(); 49 FunctionType * ftype2 = funcDecl2->get_functionType(); 50 int numThings1 = ftype1->get_parameters().size() + ftype1->get_returnVals().size(); 51 int numThings2 = ftype2->get_parameters().size() + ftype2->get_returnVals().size(); 52 if ( numThings1 < numThings2 ) return true; 53 if ( numThings1 > numThings2 ) return false; 54 55 // if ( ftype1->get_parameters().size() < ftype2->get_parameters().size() ) return true; 56 // else if ( ftype1->get_parameters().size() > ftype2->get_parameters().size() ) return false; 57 // // same number of parameters 58 // if ( ftype1->get_returnVals().size() < ftype2->get_returnVals().size() ) return true; 59 // else if ( ftype1->get_returnVals().size() > ftype2->get_returnVals().size() ) return false; 60 // same number of return vals 61 // int cmp = funcDecl1->get_name().compare( funcDecl2->get_name() ); 62 // if ( cmp < 0 ) return true; 63 // else if ( cmp > 0 ) return false; 64 // // same name 65 return ftype1 < ftype2; 66 } else { 67 return false; 68 } 69 } else { 70 assert( false ); 71 } 72 } 73 25 74 void printAssertionSet( const AssertionSet &assertions, std::ostream &os, int indent ) { 26 75 for ( AssertionSet::const_iterator i = assertions.begin(); i != assertions.end(); ++i ) { -
src/ResolvExpr/TypeEnvironment.h
rac71a86 r04cdd9b 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // TypeEnvironment.h -- 7 // TypeEnvironment.h -- 8 8 // 9 9 // Author : Richard C. Bilson … … 28 28 29 29 namespace ResolvExpr { 30 typedef std::map< DeclarationWithType*, bool > AssertionSet; 30 struct AssertCompare { 31 bool operator()( DeclarationWithType * d1, DeclarationWithType * d2 ); 32 }; 33 typedef std::map< DeclarationWithType*, bool, AssertCompare > AssertionSet; 31 34 typedef std::map< std::string, TypeDecl::Kind > OpenVarSet; 32 35 … … 39 42 bool allowWidening; 40 43 TypeDecl::Kind kind; 41 44 42 45 void initialize( const EqvClass &src, EqvClass &dest ); 43 46 EqvClass(); … … 62 65 void extractOpenVars( OpenVarSet &openVars ) const; 63 66 TypeEnvironment *clone() const { return new TypeEnvironment( *this ); } 64 67 65 68 typedef std::list< EqvClass >::iterator iterator; 66 69 iterator begin() { return env.begin(); } -
src/ResolvExpr/Unify.cc
rac71a86 r04cdd9b 484 484 FunctionType *otherFunction = dynamic_cast< FunctionType* >( type2 ); 485 485 if ( otherFunction && functionType->get_isVarArgs() == otherFunction->get_isVarArgs() ) { 486 487 if ( unifyDeclList( functionType->get_parameters().begin(), functionType->get_parameters().end(), otherFunction->get_parameters().begin(), otherFunction->get_parameters().end(), env, needAssertions, haveAssertions, openVars, indexer ) ) {488 489 if ( unifyDeclList( functionType->get_returnVals().begin(), functionType->get_returnVals().end(), otherFunction->get_returnVals().begin(), otherFunction->get_returnVals().end(), env, needAssertions, haveAssertions, openVars, indexer ) ) { 490 491 markAssertions( haveAssertions, needAssertions, functionType);492 markAssertions( haveAssertions, needAssertions, otherFunction ); 493 494 result = true;486 if ( functionType->get_parameters().size() == otherFunction->get_parameters().size() && functionType->get_returnVals().size() == otherFunction->get_returnVals().size() ) { 487 if ( unifyDeclList( functionType->get_parameters().begin(), functionType->get_parameters().end(), otherFunction->get_parameters().begin(), otherFunction->get_parameters().end(), env, needAssertions, haveAssertions, openVars, indexer ) ) { 488 if ( unifyDeclList( functionType->get_returnVals().begin(), functionType->get_returnVals().end(), otherFunction->get_returnVals().begin(), otherFunction->get_returnVals().end(), env, needAssertions, haveAssertions, openVars, indexer ) ) { 489 490 markAssertions( haveAssertions, needAssertions, functionType ); 491 markAssertions( haveAssertions, needAssertions, otherFunction ); 492 493 result = true; 494 } // if 495 495 } // if 496 496 } // if -
src/SymTab/Autogen.cc
rac71a86 r04cdd9b 68 68 copy->get_args().push_back( new VariableExpr( dstParam ) ); 69 69 copy->get_args().push_back( new AddressExpr( new VariableExpr( srcParam ) ) ); 70 copy->get_args().push_back( new SizeofExpr( unionType) );70 copy->get_args().push_back( new SizeofExpr( srcParam->get_type()->clone() ) ); 71 71 72 72 *out++ = new ExprStmt( noLabels, copy ); … … 420 420 copyCtorDecl->set_statements( assignDecl->get_statements()->clone() ); 421 421 422 // create a constructor which takes the first member type as a parameter. 423 // for example, for Union A { int x; double y; }; generate 424 // void ?{}(A *, int) 425 // This is to mimic C's behaviour which initializes the first member of the union. 426 std::list<Declaration *> memCtors; 427 for ( Declaration * member : aggregateDecl->get_members() ) { 428 if ( DeclarationWithType * field = dynamic_cast< DeclarationWithType * >( member ) ) { 429 ObjectDecl * srcParam = new ObjectDecl( "src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, field->get_type()->clone(), 0 ); 430 431 FunctionType * memCtorType = ctorType->clone(); 432 memCtorType->get_parameters().push_back( srcParam ); 433 FunctionDecl * ctor = new FunctionDecl( "?{}", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::AutoGen, memCtorType, new CompoundStmt( noLabels ), true, false ); 434 ctor->fixUniqueId(); 435 436 makeUnionFieldsAssignment( srcParam, dstParam, cloneWithParams( refType, unionParams ), back_inserter( ctor->get_statements()->get_kids() ) ); 437 memCtors.push_back( ctor ); 438 // only generate a ctor for the first field 439 break; 440 } 441 } 442 422 443 declsToAdd.push_back( assignDecl ); 423 444 declsToAdd.push_back( ctorDecl ); 424 445 declsToAdd.push_back( copyCtorDecl ); 425 446 declsToAdd.push_back( dtorDecl ); 447 declsToAdd.splice( declsToAdd.end(), memCtors ); 426 448 } 427 449 -
src/SymTab/Validate.cc
rac71a86 r04cdd9b 162 162 163 163 typedef std::map< std::string, std::pair< TypedefDecl *, int > > TypedefMap; 164 typedef std::map< std::string, TypeDecl * > TypeDeclMap; 164 165 TypedefMap typedefNames; 166 TypeDeclMap typedeclNames; 165 167 int scopeLevel; 166 168 }; … … 521 523 delete typeInst; 522 524 return ret; 525 } else { 526 TypeDeclMap::const_iterator base = typedeclNames.find( typeInst->get_name() ); 527 assert( base != typedeclNames.end() ); 528 typeInst->set_baseType( base->second->clone() ); 523 529 } // if 524 530 return typeInst; … … 565 571 typedefNames.erase( i ) ; 566 572 } // if 573 574 typedeclNames[ typeDecl->get_name() ] = typeDecl; 567 575 return typeDecl; 568 576 } -
src/tests/.expect/32/extension.txt
rac71a86 r04cdd9b 70 70 static inline void ___destructor__F_P2uU_autogen___1(union U *___dst__P2uU_1){ 71 71 } 72 static inline void ___constructor__F_P2uUi_autogen___1(union U *___dst__P2uU_1, int __src__i_1){ 73 void *_tmp_cp_ret2; 74 ((void)((_tmp_cp_ret2=__builtin_memcpy(((void *)___dst__P2uU_1), ((const void *)(&__src__i_1)), sizeof(int ))) , _tmp_cp_ret2)); 75 ((void)(_tmp_cp_ret2) /* ^?{} */); 76 } 72 77 __extension__ enum E { 73 78 __R__C2eE_1, … … 89 94 __extension__ int __c__i_2; 90 95 ((void)(__extension__ __a__i_2=(__extension__ __b__i_2+__extension__ __c__i_2))); 91 int _tmp_cp_ret 2;92 ((void)((_tmp_cp_ret 2=__extension__ __fred__Fi_i__1(3)) , _tmp_cp_ret2));93 ((void)(_tmp_cp_ret 2) /* ^?{} */);96 int _tmp_cp_ret3; 97 ((void)((_tmp_cp_ret3=__extension__ __fred__Fi_i__1(3)) , _tmp_cp_ret3)); 98 ((void)(_tmp_cp_ret3) /* ^?{} */); 94 99 ((void)__extension__ sizeof(3)); 95 100 ((void)__extension__ (((int )(3!=0)) || ((int )(4!=0)))); -
src/tests/.expect/64/extension.txt
rac71a86 r04cdd9b 70 70 static inline void ___destructor__F_P2uU_autogen___1(union U *___dst__P2uU_1){ 71 71 } 72 static inline void ___constructor__F_P2uUi_autogen___1(union U *___dst__P2uU_1, int __src__i_1){ 73 void *_tmp_cp_ret2; 74 ((void)((_tmp_cp_ret2=__builtin_memcpy(((void *)___dst__P2uU_1), ((const void *)(&__src__i_1)), sizeof(int ))) , _tmp_cp_ret2)); 75 ((void)(_tmp_cp_ret2) /* ^?{} */); 76 } 72 77 __extension__ enum E { 73 78 __R__C2eE_1, … … 89 94 __extension__ int __c__i_2; 90 95 ((void)(__extension__ __a__i_2=(__extension__ __b__i_2+__extension__ __c__i_2))); 91 int _tmp_cp_ret 2;92 ((void)((_tmp_cp_ret 2=__extension__ __fred__Fi_i__1(3)) , _tmp_cp_ret2));93 ((void)(_tmp_cp_ret 2) /* ^?{} */);96 int _tmp_cp_ret3; 97 ((void)((_tmp_cp_ret3=__extension__ __fred__Fi_i__1(3)) , _tmp_cp_ret3)); 98 ((void)(_tmp_cp_ret3) /* ^?{} */); 94 99 ((void)__extension__ sizeof(3)); 95 100 ((void)__extension__ (((int )(3!=0)) || ((int )(4!=0))));
Note:
See TracChangeset
for help on using the changeset viewer.