Changeset f45772e
- Timestamp:
- Oct 8, 2023, 9:14:31 AM (12 months ago)
- Branches:
- master
- Children:
- 92211d9
- Parents:
- 2261bcc (diff), 9689e54 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - Files:
-
- 2 added
- 23 edited
Legend:
- Unmodified
- Added
- Removed
-
Jenkins/FullBuild
r2261bcc rf45772e 25 25 gcc_08_x64_new: { trigger_build( 'gcc-8', 'x64', false ) }, 26 26 gcc_07_x64_new: { trigger_build( 'gcc-7', 'x64', false ) }, 27 // gcc_06_x64_new: { trigger_build( 'gcc-6', 'x64', false ) }, 27 gcc_11_arm64_new: { trigger_build( 'gcc-11', 'arm64', false ) }, 28 gcc_10_arm64_new: { trigger_build( 'gcc-10', 'arm64', false ) }, 29 gcc_09_arm64_new: { trigger_build( 'gcc-9', 'arm64', false ) }, 30 // gcc_06_arm64_new: { trigger_build( 'gcc-6', 'arm64', false ) }, 28 31 clang_x64_new: { trigger_build( 'clang', 'x64', true ) }, 29 32 ) -
Jenkins/TestRegen
r2261bcc rf45772e 24 24 stage('Building x64') { 25 25 regen_tests('x86_64') 26 } 27 28 stage('Building arm64') { 29 regen_tests('arm64') 26 30 } 27 31 -
libcfa/src/collections/string_res.cfa
r2261bcc rf45772e 218 218 // Read in chunks. Often, one chunk is enough. Keep the string that accumulates chunks last in the heap, 219 219 // so available room is rest of heap. When a chunk fills the heap, force growth then take the next chunk. 220 for (;;) { 220 for (bool cont = true; cont; ) { 221 cont = false; 222 221 223 // Append dummy content to temp, forcing expansion when applicable (occurs always on subsequent loops) 222 224 // length 2 ensures room for at least one real char, plus scanf/pipe-cstr's null terminator … … 228 230 temp.Handle.ulink->EndVbyte -= 2; 229 231 230 // rest of heap , less 1 byte for null terminator,is available to read into231 int lenReadable = (char*)temp.Handle.ulink->ExtVbyte - temp.Handle.ulink->EndVbyte - 1;232 assert (lenReadable >= 1);232 // rest of heap is available to read into 233 int lenReadable = (char*)temp.Handle.ulink->ExtVbyte - temp.Handle.ulink->EndVbyte; 234 assert (lenReadable >= 2); 233 235 234 236 // get bytes 235 in | wdi( lenReadable + 1, lenReadable, temp.Handle.ulink->EndVbyte ); 237 try { 238 in | wdi( lenReadable, temp.Handle.ulink->EndVbyte ); 239 } catch (cstring_length*) { 240 cont = true; 241 } 236 242 int lenWasRead = strlen(temp.Handle.ulink->EndVbyte); 237 243 … … 239 245 temp.Handle.lnth += lenWasRead; 240 246 temp.Handle.ulink->EndVbyte += lenWasRead; 241 242 if (lenWasRead < lenReadable) break;243 247 } 244 248 -
libcfa/src/iostream.cfa
r2261bcc rf45772e 22 22 #include <float.h> // DBL_DIG, LDBL_DIG 23 23 #include <complex.h> // creal, cimag 24 #include <ctype.h> // isspace 24 25 //#include <stdio.h> 25 26 … … 29 30 extern char *strcpy (char *__restrict __dest, const char *__restrict __src) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2))); 30 31 extern void *memcpy (void *__restrict __dest, const void *__restrict __src, size_t __n) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2))); 32 extern char *strchr(const char *str, int ch); 31 33 } // extern "C" 32 34 … … 960 962 istype & ?|?( istype & is, _Istream_Cskip f ) { 961 963 // printf( "skip %s %d\n", f.scanset, f.wd ); 962 if ( f.scanset ) fmt( is, f.scanset, "" ); // no input arguments 964 if ( f.scanset ) { 965 int nscanset = strlen(f.scanset); 966 char fmtstr[ sizeof("%*[]") + nscanset ]; 967 int pos = 0; 968 fmtstr[pos] = '%'; pos += 1; 969 fmtstr[pos] = '*'; pos += 1; 970 fmtstr[pos] = '['; pos += 1; 971 strcpy( &fmtstr[pos], f.scanset ); pos += nscanset; 972 fmtstr[pos] = ']'; pos += 1; 973 fmtstr[pos] = '\0'; 974 fmt( is, fmtstr, (void*)0 ); // last arg is dummy: suppress gcc warning 975 } 963 976 else for ( f.wd ) fmt( is, "%*c" ); 964 977 return is; … … 980 993 // wd is buffer bytes available (for input chars + null terminator) 981 994 // rwd is count of input chars 982 int rwd = f.flags.rwd ? f.wd : (f.wd - 1); 995 int rwd; 996 if (f.flags.rwd) { 997 verify (f.wd >= 0); 998 rwd = f.wd; 999 } else { 1000 verify (f.wd >= 1); 1001 rwd = f.wd - 1; 1002 } // if 983 1003 start += sprintf( &fmtstr[start], "%d", rwd ); 984 1004 } … … 1000 1020 1001 1021 int check = f.wd - 2; 1002 if ( ! f.flags.rwd ) f.s[check] = '\0'; // insert sentinel 1022 if (! f.flags.ignore ) { 1023 f.s[0] = '\0'; 1024 if ( ! f.flags.rwd ) f.s[check] = '\0'; // insert sentinel 1025 } 1003 1026 len = fmt( is, fmtstr, f.s ); 1004 1027 //fprintf( stderr, "KK %s %zd %d %c %s\n", fmtstr, len, check, f.s[check], f.s ); 1005 1028 1006 if ( ! f.flags.rwd && f.s[check] != '\0' ) // sentinel overwritten ? 1007 throw (cstring_length){ &cstring_length_vt }; 1029 if ( ! f.flags.ignore && ! f.flags.rwd && f.s[check] != '\0' ) { // sentinel overwritten ? 1030 // buffer filled, but would we have kept going? 1031 if ( ! eof( is ) ) { 1032 char peek; 1033 fmt( is, "%c", &peek ); 1034 ungetc( is, peek ); 1035 bool hasMore; 1036 if (f.flags.delimiter) { // getline 1037 hasMore = (peek != f.delimiter[0]); 1038 } else if (f.scanset) { // incl/excl 1039 bool peekMatch = strchr(f.scanset, peek) != 0p; 1040 hasMore = f.flags.inex ? (!peekMatch) : (peekMatch); 1041 } else { // %s 1042 hasMore = !isspace(peek); 1043 } 1044 if (hasMore) throw (cstring_length){ &cstring_length_vt }; 1045 } // if 1046 } // if 1008 1047 1009 1048 if ( f.flags.delimiter ) { // getline ? -
src/CodeGen/LinkOnce.cc
r2261bcc rf45772e 10 10 // Created On : Thur May 13 10:10:00 2021 11 11 // Last Modified By : Andrew Beach 12 // Last Modified On : Thur May 13 14:39:00 202113 // Update Count : 012 // Last Modified On : Wed Oct 4 10:52:00 2023 13 // Update Count : 1 14 14 // 15 15 … … 18 18 #include <algorithm> 19 19 20 #include "AST/Attribute.hpp" 21 #include "AST/Decl.hpp" 22 #include "AST/Expr.hpp" 23 #include "AST/Pass.hpp" 20 24 #include "Common/PassVisitor.h" // for PassVisitor, WithShortCircuiting 21 25 22 26 namespace CodeGen { 23 27 24 static bool is_cfa_linkonce( Attribute const * attr ) { 28 namespace { 29 30 bool is_cfa_linkonce_old( Attribute const * attr ) { 25 31 return std::string("cfa_linkonce") == attr->name; 26 32 } 27 33 28 static bool is_section_attribute( Attribute const * attr ) {34 bool is_section_attribute_old( Attribute const * attr ) { 29 35 return std::string("section") == attr->name; 30 36 } … … 39 45 std::list< Attribute * > & attributes = decl->attributes; 40 46 // See if we can find the element: 41 auto found = std::find_if(attributes.begin(), attributes.end(), is_cfa_linkonce );47 auto found = std::find_if(attributes.begin(), attributes.end(), is_cfa_linkonce_old ); 42 48 if ( attributes.end() != found ) { 43 49 // Remove any other sections: 44 attributes.remove_if( is_section_attribute );50 attributes.remove_if( is_section_attribute_old ); 45 51 // Iterator to the cfa_linkonce attribute should still be valid. 46 52 Attribute * attribute = *found; … … 63 69 }; 64 70 71 bool is_cfa_linkonce( ast::Attribute const * attr ) { 72 return "cfa_linkonce" == attr->name; 73 } 74 75 bool is_section_attribute( ast::Attribute const * attr ) { 76 return "section" == attr->name; 77 } 78 79 struct LinkOnceCore : public ast::WithShortCircuiting { 80 void previsit( ast::Decl const * ) { 81 visit_children = false; 82 } 83 84 ast::DeclWithType const * postvisit( ast::DeclWithType const * decl ) { 85 // Check to see if we have to mutate, because should be uncommon. 86 { 87 auto & attributes = decl->attributes; 88 auto found = std::find_if( attributes.begin(), attributes.end(), 89 is_cfa_linkonce ); 90 if ( attributes.end() == found ) return decl; 91 } 92 auto mutDecl = mutate( decl ); 93 auto & attributes = mutDecl->attributes; 94 95 // Remove all conflicting section attributes. 96 erase_if( attributes, is_section_attribute ); 97 98 // Get the attribute, and overwrite it as a section attribute. 99 auto found = std::find_if( attributes.begin(), attributes.end(), 100 is_cfa_linkonce ); 101 assert( attributes.end() != found ); 102 ast::Attribute * attribute = found->get_and_mutate(); 103 assert( attribute->params.empty() ); 104 assert( !decl->mangleName.empty() ); 105 106 attribute->name = "section"; 107 attribute->params.push_back( 108 ast::ConstantExpr::from_string( mutDecl->location, 109 ".gnu.linkonce." + decl->mangleName 110 ) 111 ); 112 113 // Unconditionnaly add "visibility(default)" to anything with 114 // .gnu.linkonce visibility is a mess otherwise. 115 attributes.push_back( new ast::Attribute( "visibility", { 116 ast::ConstantExpr::from_string( mutDecl->location, "default" ) 117 } ) ); 118 return mutDecl; 119 } 120 }; 121 122 } // namespace 123 65 124 void translateLinkOnce( std::list< Declaration *> & translationUnit ) { 66 125 PassVisitor<LinkOnceVisitorCore> translator; … … 68 127 } 69 128 129 void translateLinkOnce( ast::TranslationUnit & translationUnit ) { 130 ast::Pass<LinkOnceCore>::run( translationUnit ); 70 131 } 132 133 } // namespace CodeGen -
src/CodeGen/LinkOnce.h
r2261bcc rf45772e 10 10 // Created On : Thur May 13 10:06:00 2021 11 11 // Last Modified By : Andrew Beach 12 // Last Modified On : Thur May 13 14:38:00 202113 // Update Count : 012 // Last Modified On : Wed Oct 4 10:52:00 2023 13 // Update Count : 1 14 14 // 15 15 … … 23 23 24 24 class Declaration; 25 namespace ast { 26 class TranslationUnit; 27 } 25 28 26 29 namespace CodeGen { 27 30 28 31 void translateLinkOnce( std::list< Declaration *> & translationUnit ); 32 void translateLinkOnce( ast::TranslationUnit & translationUnit ); 29 33 /* Convert the cfa_linkonce attribute on top level declaration into 30 34 * a special section declaration (.gnu.linkonce) so that it may be defined -
src/GenPoly/BoxNew.cpp
r2261bcc rf45772e 77 77 }; 78 78 79 // Formally takeOtypeOnly80 79 /// Get all sized type declarations; those that affect a layout function. 81 80 ast::vector<ast::TypeDecl> takeSizedParams( … … 510 509 ast::FunctionType const * function, 511 510 TypeVarMap const & typeVars ) { 512 // TODO513 // NOTE: This function previously used isPolyObj, which failed to produce514 // the correct thing in some situations. It's not clear to [Rob Schluntz]515 // why this wasn't working.516 517 511 // If the return type or a parameter type involved polymorphic types, 518 512 // then the adapter will need to take those polymorphic types as pointers. … … 587 581 ast::FunctionType const * type = decl->type; 588 582 if ( isDynRet( type ) && decl->linkage != ast::Linkage::C ) { 589 //retval = type->returns.front();590 583 retval = decl->returns.front(); 591 584 … … 748 741 ast::Expr const * CallAdapter::postvisit( ast::UntypedExpr const * expr ) { 749 742 if ( isPolyDeref( expr, scopeTypeVars, typeSubs ) ) { 750 // TODO Pretty sure this is just a memory management change.751 // Also, I don't understand what this is doing.752 //ast::Expr const * ret = expr->args.front();753 //expr->args.clear();754 //return ret;755 743 return expr->args.front(); 756 744 } … … 1063 1051 ast::ptr<ast::Type> newType = ast::deepCopy( param ); 1064 1052 if ( typeSubs ) typeSubs->apply( newType ); 1065 // TODO: Is this right? (Why wouldn't it be?)1066 // I think this is to make sure we can write to the temporary.1067 //newType.get_and_mutate()->qt = ast::CV::Qualifiers();1068 //reset_qualifiers( newType );1069 1053 ast::ObjectDecl * newObj = makeTemporary( location, newType ); 1070 1054 auto assign = ast::UntypedExpr::createCall( location, "?=?", { … … 1245 1229 } 1246 1230 return new ast::ObjectDecl( location, pNamer.newName(), param ); 1247 } ), // params1231 } ), 1248 1232 map_range<ast::vector<ast::DeclWithType>>( adapterType->returns, 1249 1233 [&rNamer, &location]( ast::ptr<ast::Type> const & retval ) { 1250 1234 return new ast::ObjectDecl( location, rNamer.newName(), retval ); 1251 } ), // returns1235 } ), 1252 1236 nullptr, // stmts 1253 ast::Storage::Classes(), // storage 1254 ast::Linkage::C // linkage 1255 // attrs 1256 // fs 1257 // isVarArgs 1237 {}, // storage 1238 ast::Linkage::C 1258 1239 ); 1259 1240 … … 1314 1295 // Returns a polymorphic type. 1315 1296 } else if ( isDynType( adaptee->returns.front(), typeVars ) ) { 1316 if ( "" == (*paramDecl)->name ) {1317 // TODO: Is it easier to make sure it has a name in the first1318 // place? - I believe this is done, however, I could remove the1319 // condition and just rename for clarity.1320 assertf( false, "Wasn't expecting to get here." );1321 auto mutParam = paramDecl->get_and_mutate();1322 mutParam->name = "_ret";1323 mutParam->linkage = ast::Linkage::C;1324 }1325 1297 ast::UntypedExpr * assign = new ast::UntypedExpr( location, 1326 1298 new ast::NameExpr( location, "?=?" ) ); … … 1546 1518 1547 1519 // -------------------------------------------------------------------------- 1548 /// Creates the adapter functions. TODO1520 /// Modifies declarations to accept implicit parameters. 1549 1521 /// * Move polymorphic returns in function types to pointer-type parameters. 1550 1522 /// * Adds type size and assertion parameters to parameter lists. 1551 struct DeclAdapter final : 1552 public BoxPass, 1553 public ast::WithGuards { 1554 void handleAggrDecl(); 1555 1556 void previsit( ast::StructDecl const * decl ); 1557 void previsit( ast::UnionDecl const * decl ); 1558 void previsit( ast::TraitDecl const * decl ); 1559 void previsit( ast::TypeDecl const * decl ); 1560 void previsit( ast::PointerType const * type ); 1561 void previsit( ast::FunctionType const * type ); 1523 struct DeclAdapter final { 1562 1524 ast::FunctionDecl const * previsit( ast::FunctionDecl const * decl ); 1563 ast::DeclWithType const * postvisit( ast::FunctionDecl const * decl ); 1564 void previsit( ast::CompoundStmt const * stmt ); 1525 ast::FunctionDecl const * postvisit( ast::FunctionDecl const * decl ); 1565 1526 private: 1566 ast::FunctionDecl * addAdapters( ast::FunctionDecl * decl ); 1567 1568 std::map<UniqueId, std::string> adapterName; 1527 void addAdapters( ast::FunctionDecl * decl, TypeVarMap & localTypeVars ); 1569 1528 }; 1570 1529 1571 // at must point within [dst.begin(), dst.end()]. 1572 template< typename T > 1573 void spliceAt( std::vector< T > & dst, typename std::vector< T >::iterator at, 1574 std::vector< T > & src ) { 1575 std::vector< T > tmp; 1576 tmp.reserve( dst.size() + src.size() ); 1577 typename std::vector< T >::iterator it = dst.begin(); 1578 while ( it != at ) { 1579 assert( it != dst.end() ); 1580 tmp.emplace_back( std::move( *it ) ); 1581 ++it; 1582 } 1583 for ( T & x : src ) { tmp.emplace_back( std::move( x ) ); } 1584 while ( it != dst.end() ) { 1585 tmp.emplace_back( std::move( *it ) ); 1586 ++it; 1587 } 1588 1589 dst.clear(); 1590 src.clear(); 1591 tmp.swap( dst ); 1592 } 1593 1594 void DeclAdapter::previsit( ast::StructDecl const * ) { 1595 // Prevent type vars from leaking into the containing scope. 1596 GuardScope( scopeTypeVars ); 1597 } 1598 1599 void DeclAdapter::previsit( ast::UnionDecl const * ) { 1600 // Prevent type vars from leaking into the containing scope. 1601 GuardScope( scopeTypeVars ); 1602 } 1603 1604 void DeclAdapter::previsit( ast::TraitDecl const * ) { 1605 // Prevent type vars from leaking into the containing scope. 1606 GuardScope( scopeTypeVars ); 1607 } 1608 1609 void DeclAdapter::previsit( ast::TypeDecl const * decl ) { 1610 addToTypeVarMap( decl, scopeTypeVars ); 1611 } 1612 1613 void DeclAdapter::previsit( ast::PointerType const * type ) { 1614 GuardScope( scopeTypeVars ); 1615 makeTypeVarMap( type, scopeTypeVars ); 1616 } 1617 1618 // TODO: I think this code is redundent. 1619 void DeclAdapter::previsit( ast::FunctionType const * type ) { 1620 GuardScope( scopeTypeVars ); 1621 makeTypeVarMap( type, scopeTypeVars ); 1530 // size/align/offset parameters may not be used, so add the unused attribute. 1531 ast::ObjectDecl * makeObj( 1532 CodeLocation const & location, std::string const & name ) { 1533 return new ast::ObjectDecl( location, name, 1534 makeSizeAlignType(), 1535 nullptr, ast::Storage::Classes(), ast::Linkage::C, nullptr, 1536 { new ast::Attribute( "unused" ) } ); 1537 } 1538 1539 ast::ObjectDecl * makePtr( 1540 CodeLocation const & location, std::string const & name ) { 1541 return new ast::ObjectDecl( location, name, 1542 new ast::PointerType( makeSizeAlignType() ), 1543 nullptr, ast::Storage::Classes(), ast::Linkage::C, nullptr ); 1622 1544 } 1623 1545 1624 1546 ast::FunctionDecl const * DeclAdapter::previsit( ast::FunctionDecl const * decl ) { 1625 GuardScope( scopeTypeVars );1626 makeTypeVarMap( decl, scopeTypeVars );1547 TypeVarMap localTypeVars = { ast::TypeData() }; 1548 makeTypeVarMap( decl, localTypeVars ); 1627 1549 1628 1550 auto mutDecl = mutate( decl ); … … 1639 1561 1640 1562 // Add size/align and assertions for type parameters to parameter list. 1641 std::vector<ast::ptr<ast::DeclWithType>>::iterator last = mutDecl->params.begin(); 1642 std::vector<ast::ptr<ast::DeclWithType>> inferredParams; 1643 // size/align/offset parameters may not be used in body, pass along with unused attribute. 1644 // TODO: These should be created with proper location and name. 1645 // TODO: makeSizeAlign[Out]Type are the same as these types, but they may 1646 // be logically different. 1647 ast::ObjectDecl newObj( mutDecl->location, "", 1648 new ast::BasicType( ast::BasicType::LongUnsignedInt ), 1649 nullptr, ast::Storage::Classes(), ast::Linkage::C, nullptr, 1650 { new ast::Attribute( "unused" ) } ); 1651 ast::ObjectDecl newPtr( mutDecl->location, "", 1652 new ast::PointerType( new ast::BasicType( ast::BasicType::LongUnsignedInt ) ), 1653 nullptr, ast::Storage::Classes(), ast::Linkage::C, nullptr ); 1563 ast::vector<ast::DeclWithType> inferredParams; 1564 ast::vector<ast::DeclWithType> layoutParams; 1654 1565 for ( ast::ptr<ast::TypeDecl> & typeParam : mutDecl->type_params ) { 1655 1566 auto mutParam = mutate( typeParam.get() ); 1656 1567 // Add all size and alignment parameters to parameter list. 1657 1568 if ( mutParam->isComplete() ) { 1658 //ast::TypeInstType paramType( typeParam->name, typeParam );1659 1569 ast::TypeInstType paramType( mutParam ); 1660 1570 std::string paramName = Mangle::mangleType( ¶mType ); 1661 1571 1662 ast::ObjectDecl * sizeParam = ast::deepCopy( &newObj ); 1663 sizeParam->location = typeParam->location; 1664 sizeParam->name = sizeofName( paramName ); 1665 last = mutDecl->params.insert( last, sizeParam ); 1666 ++last; 1667 1668 ast::ObjectDecl * alignParam = ast::deepCopy( &newObj ); 1669 alignParam->location = typeParam->location; 1670 alignParam->name = alignofName( paramName ); 1671 last = mutDecl->params.insert( last, alignParam ); 1672 ++last; 1572 auto sizeParam = makeObj( typeParam->location, sizeofName( paramName ) ); 1573 layoutParams.emplace_back( sizeParam ); 1574 1575 auto alignParam = makeObj( typeParam->location, alignofName( paramName ) ); 1576 layoutParams.emplace_back( alignParam ); 1673 1577 } 1674 1578 // TODO: These should possibly all be gone. … … 1696 1600 // Add size/align for generic parameter types to parameter list. 1697 1601 std::set<std::string> seenTypes; 1698 std::vector<ast::ptr<ast::DeclWithType>> otypeParams;1602 ast::vector<ast::DeclWithType> otypeParams; 1699 1603 for ( ast::ptr<ast::DeclWithType> & funcParam : mutDecl->params ) { 1700 ast::Type const * polyType = isPolyType( funcParam->get_type(), scopeTypeVars );1604 ast::Type const * polyType = isPolyType( funcParam->get_type(), localTypeVars ); 1701 1605 if ( !polyType || dynamic_cast<ast::TypeInstType const *>( polyType ) ) { 1702 1606 continue; … … 1704 1608 std::string typeName = Mangle::mangleType( polyType ); 1705 1609 if ( seenTypes.count( typeName ) ) continue; 1706 1707 ast::ObjectDecl * sizeParam = ast::deepCopy( &newObj ); 1708 sizeParam->location = funcParam->location; 1709 sizeParam->name = sizeofName( typeName ); 1610 seenTypes.insert( typeName ); 1611 1612 auto sizeParam = makeObj( funcParam->location, sizeofName( typeName ) ); 1710 1613 otypeParams.emplace_back( sizeParam ); 1711 1614 1712 ast::ObjectDecl * alignParam = ast::deepCopy( &newObj ); 1713 alignParam->location = funcParam->location; 1714 alignParam->name = alignofName( typeName ); 1615 auto alignParam = makeObj( funcParam->location, alignofName( typeName ) ); 1715 1616 otypeParams.emplace_back( alignParam ); 1716 1617 1618 // Zero-length arrays are illegal in C, so empty structs have no 1619 // offset array. 1717 1620 if ( auto * polyStruct = 1718 dynamic_cast<ast::StructInstType const *>( polyType ) ) { 1719 // Zero-length arrays are illegal in C, so empty structs have no 1720 // offset array. 1721 if ( !polyStruct->base->members.empty() ) { 1722 ast::ObjectDecl * offsetParam = ast::deepCopy( &newPtr ); 1723 offsetParam->location = funcParam->location; 1724 offsetParam->name = offsetofName( typeName ); 1725 otypeParams.emplace_back( offsetParam ); 1726 } 1727 } 1728 seenTypes.insert( typeName ); 1729 } 1730 1731 // TODO: A unified way of putting these together might be nice. 1732 // Put the list together: adapters (in helper) otype parameters, 1733 // inferred params., layout params. (done) and finally explicit params. 1734 spliceBegin( inferredParams, otypeParams ); 1735 spliceAt( mutDecl->params, last, inferredParams ); 1736 mutDecl = addAdapters( mutDecl ); 1621 dynamic_cast<ast::StructInstType const *>( polyType ) ; 1622 polyStruct && !polyStruct->base->members.empty() ) { 1623 auto offsetParam = makePtr( funcParam->location, offsetofName( typeName ) ); 1624 otypeParams.emplace_back( offsetParam ); 1625 } 1626 } 1627 1628 // Prepend each argument group. From last group to first. addAdapters 1629 // does do the same, it just does it itself and see all other parameters. 1630 spliceBegin( mutDecl->params, inferredParams ); 1631 spliceBegin( mutDecl->params, otypeParams ); 1632 spliceBegin( mutDecl->params, layoutParams ); 1633 addAdapters( mutDecl, localTypeVars ); 1737 1634 1738 1635 return mutDecl; 1739 1636 } 1740 1637 1741 ast:: DeclWithTypeconst * DeclAdapter::postvisit(1638 ast::FunctionDecl const * DeclAdapter::postvisit( 1742 1639 ast::FunctionDecl const * decl ) { 1743 1640 ast::FunctionDecl * mutDecl = mutate( decl ); … … 1773 1670 } 1774 1671 1775 void DeclAdapter::previsit( ast::CompoundStmt const * ) { 1776 GuardScope( scopeTypeVars ); 1777 // TODO: It is entirely possible the scope doesn't need to spread 1778 // across multiple functions. Otherwise, find a better clear. 1779 std::set<TypeVarMap::key_type> keys; 1780 for ( auto pair : const_cast<TypeVarMap const &>( scopeTypeVars ) ) { 1781 keys.insert( pair.first ); 1782 } 1783 for ( auto key : keys ) { 1784 scopeTypeVars.erase( key ); 1785 } 1786 } 1787 1788 // It actually does mutate in-place, but does the return for consistency. 1789 ast::FunctionDecl * DeclAdapter::addAdapters( ast::FunctionDecl * mutDecl ) { 1790 std::vector<ast::ptr<ast::FunctionType>> functions; 1672 void DeclAdapter::addAdapters( 1673 ast::FunctionDecl * mutDecl, TypeVarMap & localTypeVars ) { 1674 ast::vector<ast::FunctionType> functions; 1791 1675 for ( ast::ptr<ast::DeclWithType> & arg : mutDecl->params ) { 1792 1676 ast::Type const * type = arg->get_type(); 1793 type = findAndReplaceFunction( type, functions, scopeTypeVars, needsAdapter );1677 type = findAndReplaceFunction( type, functions, localTypeVars, needsAdapter ); 1794 1678 arg.get_and_mutate()->set_type( type ); 1795 1679 } 1796 1680 std::set<std::string> adaptersDone; 1797 1681 for ( ast::ptr<ast::FunctionType> const & func : functions ) { 1798 std::string mangleName = mangleAdapterName( func, scopeTypeVars );1682 std::string mangleName = mangleAdapterName( func, localTypeVars ); 1799 1683 if ( adaptersDone.find( mangleName ) != adaptersDone.end() ) { 1800 1684 continue; … … 1804 1688 mutDecl->params.insert( mutDecl->params.begin(), new ast::ObjectDecl( 1805 1689 mutDecl->location, adapterName, 1806 new ast::PointerType( makeAdapterType( func, scopeTypeVars ) ),1690 new ast::PointerType( makeAdapterType( func, localTypeVars ) ), 1807 1691 nullptr, {}, {}, nullptr, 1808 1692 { new ast::Attribute( "unused" ) } ) ); 1809 1693 adaptersDone.insert( adaptersDone.begin(), mangleName ); 1810 1694 } 1811 return mutDecl;1812 1695 } 1813 1696 … … 1926 1809 /// Namer for VLA (variable length array) buffers. 1927 1810 UniqueName bufNamer; 1928 /// AddressExpr argument is MemberExpr? (TODO: What?)1929 ast:: Expr const * addrMember = nullptr;1811 /// If the argument of an AddressExpr is MemberExpr, it is stored here. 1812 ast::MemberExpr const * addrMember = nullptr; 1930 1813 /// Used to avoid recursing too deep in type declarations. 1931 1814 bool expect_func_type = false; … … 1959 1842 beginTypeScope( decl->type ); 1960 1843 1961 // - Tried inserting this code. 1962 // Make sure that any type information passed into the function is 1963 // accounted for. 1964 // TODO: For some reason going through decl->params/->get_type() does 1965 // not work. Possibly something is not getting updated. 1844 // TODO: Going though dec->params does not work for some reason. 1966 1845 for ( ast::ptr<ast::Type> const & funcParam : decl->type->params ) { 1967 1846 // Condition here duplicates that in `DeclAdapter::previsit( FunctionDecl const * )` … … 2019 1898 ast::StructDecl const * PolyGenericCalculator::previsit( 2020 1899 ast::StructDecl const * decl ) { 2021 //return strict_dynamic_cast<ast::StructDecl *>( mutateMembers( decl ) );2022 1900 auto mutDecl = mutate( decl ); 2023 1901 mutateMembers( mutDecl ); … … 2027 1905 ast::UnionDecl const * PolyGenericCalculator::previsit( 2028 1906 ast::UnionDecl const * decl ) { 2029 //return strict_dynamic_cast<ast::UnionDecl *>( mutateMembers( decl ) );2030 1907 auto mutDecl = mutate( decl ); 2031 1908 mutateMembers( mutDecl ); … … 2088 1965 auto mutDecl = mutate( decl ); 2089 1966 2090 //mutDecl->attributes.remove_if( matchAndMove ); 2091 // TODO: This common helper might work, but does not officially support 2092 // side effects. 1967 // Forally, side effects are not safe in this function. But it works. 2093 1968 erase_if( mutDecl->attributes, matchAndMove ); 2094 1969 … … 2198 2073 // the substitution manually. For some reason this is not currently the 2199 2074 // case. This requires more investigation. 2200 ast:: Type const *memberType = deepCopy( expr->member->get_type() );2075 ast::ptr<ast::Type> memberType = deepCopy( expr->member->get_type() ); 2201 2076 ast::TypeSubstitution sub = genericSubstitution( objectType ); 2202 auto result =sub.apply( memberType );2203 memberType = result.node.get(); // .release(); 2077 sub.apply( memberType ); 2078 2204 2079 // Not all members of a polymorphic type are themselves of a polymorphic 2205 2080 // type; in this cas the member expression should be wrapped and … … 2217 2092 2218 2093 void PolyGenericCalculator::previsit( ast::AddressExpr const * expr ) { 2219 // Is the argument a MemberExpr before mutating?2220 2094 GuardValue( addrMember ) = expr->arg.as<ast::MemberExpr>(); 2221 2095 } … … 2233 2107 // MemberExpr was converted to pointer + offset; and it is not valid C to 2234 2108 // take the address of an addition, so stript the address-of. 2235 // TODO: should expr->arg->result be changed to expr->result? 2236 ast::Expr * ret = mutate( expr->arg.get() ); 2237 ret->env = expr->env; 2238 return ret; 2109 // It also preserves the env value. 2110 return ast::mutate_field( expr->arg.get(), &ast::Expr::env, expr->env ); 2239 2111 } 2240 2112 … … 2572 2444 public BoxPass, 2573 2445 public ast::WithGuards { 2574 template<typename decl_t> 2575 decl_t const * handleDecl( decl_t const * decl, ast::Type const * type ); 2446 void guardTypeVarMap( ast::Type const * type ) { 2447 GuardScope( scopeTypeVars ); 2448 makeTypeVarMap( type, scopeTypeVars ); 2449 } 2576 2450 2577 2451 ast::ObjectDecl const * previsit( ast::ObjectDecl const * decl ); … … 2585 2459 }; 2586 2460 2587 template<typename decl_t> 2588 decl_t const * Eraser::handleDecl( 2589 decl_t const * decl, ast::Type const * type ) { 2590 GuardScope( scopeTypeVars ); 2591 makeTypeVarMap( type, scopeTypeVars ); 2461 ast::ObjectDecl const * Eraser::previsit( ast::ObjectDecl const * decl ) { 2462 guardTypeVarMap( decl->type ); 2592 2463 return scrubAllTypeVars( decl ); 2593 2464 } 2594 2465 2595 ast::ObjectDecl const * Eraser::previsit( ast::ObjectDecl const * decl ) {2596 return handleDecl( decl, decl->type );2597 }2598 2599 2466 ast::FunctionDecl const * Eraser::previsit( ast::FunctionDecl const * decl ) { 2600 return handleDecl( decl, decl->type ); 2467 guardTypeVarMap( decl->type ); 2468 return scrubAllTypeVars( decl ); 2601 2469 } 2602 2470 2603 2471 ast::TypedefDecl const * Eraser::previsit( ast::TypedefDecl const * decl ) { 2604 return handleDecl( decl, decl->base ); 2472 guardTypeVarMap( decl->base ); 2473 return scrubAllTypeVars( decl ); 2605 2474 } 2606 2475 … … 2608 2477 template<typename node_t> 2609 2478 node_t const * stripGenericMembers( node_t const * decl ) { 2610 if ( !decl->params.empty() ) { 2611 auto mutDecl = ast::mutate( decl ); 2612 mutDecl->members.clear(); 2613 return mutDecl; 2614 } 2615 return decl; 2479 if ( decl->params.empty() ) return decl; 2480 auto mutDecl = ast::mutate( decl ); 2481 mutDecl->members.clear(); 2482 return mutDecl; 2616 2483 } 2617 2484 … … 2629 2496 2630 2497 void Eraser::previsit( ast::PointerType const * type ) { 2631 GuardScope( scopeTypeVars ); 2632 makeTypeVarMap( type, scopeTypeVars ); 2498 guardTypeVarMap( type ); 2633 2499 } 2634 2500 2635 2501 void Eraser::previsit( ast::FunctionType const * type ) { 2636 GuardScope( scopeTypeVars ); 2637 makeTypeVarMap( type, scopeTypeVars ); 2502 guardTypeVarMap( type ); 2638 2503 } 2639 2504 -
src/GenPoly/InstantiateGeneric.h
r2261bcc rf45772e 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // InstantiateGeneric.h -- 7 // InstantiateGeneric.h -- Create concrete instances of generic types. 8 8 // 9 9 // Author : Aaron B. Moss … … 24 24 25 25 namespace GenPoly { 26 /// Replaces all generic types that have static layout with concrete 27 /// instantiations. Types with concrete values for otype parameters will be 28 /// template-expanded, while dtype and ftype parameters will be replaced by 29 /// the appropriate void type. 26 30 27 void instantiateGeneric( std::list< Declaration* > &translationUnit ); 31 28 void instantiateGeneric( ast::TranslationUnit & translationUnit ); 29 /// Replaces all generic types that have static layout with concrete 30 /// instantiations. Sized types are replaced with the concrete argument types 31 /// while unsized types are erased to a void type. 32 /// This pass can cause designators to ignore the pretty print option. 33 32 34 } // namespace GenPoly 33 35 -
src/GenPoly/InstantiateGenericNew.cpp
r2261bcc rf45772e 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // InstantiateGenericNew.cpp -- 7 // InstantiateGenericNew.cpp -- Create concrete instances of generic types. 8 8 // 9 9 // Author : Andrew Beach -
src/Validate/NoIdSymbolTable.hpp
r2261bcc rf45772e 20 20 namespace Validate { 21 21 22 // A SymbolTable that only has the operations used in the Translate Dimension 23 // pass. More importantly, it doesn't have some methods that should no be 22 // A SymbolTable that only tracks names relevant to Validate passes. 23 // It tracks type names but not identifier names. 24 // Some of the canonicalization that occurs before the resolver 25 // affects how identifier name errors get reported to the user. 26 // The Validate phase needs to chase type names, 27 // but it is too early to try tracking identifier names. 28 // Identifier skipping is acheived by omitting methods that should not be 24 29 // called by the Pass template (lookupId and addId). 25 30 class NoIdSymbolTable { 26 31 ast::SymbolTable base; 27 32 public: 33 // All names that are tracked (now) are eligible for collision validation (now). 34 // (Names that are only tracked later get their collision validation then.) 35 NoIdSymbolTable() : base(ast::SymbolTable::ValidateOnAdd) {} 36 28 37 # define FORWARD_X( func, types_and_names, just_names ) \ 29 38 inline auto func types_and_names -> decltype( base.func just_names ) { \ -
src/main.cc
r2261bcc rf45772e 421 421 DUMP( bboxp, std::move( transUnit ) ); 422 422 PASS( "Box", GenPoly::box, transUnit ); 423 PASS( "Link-Once", CodeGen::translateLinkOnce, transUnit ); 423 424 424 425 translationUnit = convert( std::move( transUnit ) ); 425 426 PASS( "Link-Once", CodeGen::translateLinkOnce, translationUnit );427 426 428 427 // Code has been lowered to C, now we can start generation. -
tests/collections/.expect/string-istream-manip.txt
r2261bcc rf45772e 1 preS1 0123456 2 preS1 x 3 preS2 01234567 4 preS2 x 5 preS3 012345678 6 preS3 x 7 preS4 0123456789 8 preS4 x 9 preSMN1 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 10 preSMN1 x 11 preSMN2 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 12 preSMN2 x 13 preSMN3 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 14 preSMN3 x 15 preSMN4 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 16 preSMN4 x 17 preRMN1 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 18 preRMN1 x 19 preRMN2 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 20 preRMN2 x 21 preRMN3 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 22 preRMN3 x 23 preRMN4 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 24 preRMN4 x 25 preSMI1 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 26 preSMI1 "x" 27 preSMI2 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 28 preSMI2 "x" 29 preSMI3 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 30 preSMI3 "x" 31 preSMI4 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 32 preSMI4 "x" 33 preSME1 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 34 preSME1 "x" 35 preSME2 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 36 preSME2 "x" 37 preSME3 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 38 preSME3 "x" 39 preSME4 "...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... " 40 preSME4 "x" 41 preSMG1 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 42 preSMG1 x 43 preSMG2 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 44 preSMG2 x 45 preSMG3 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 46 preSMG3 x 47 preSMG4 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 48 preSMG4 x 49 preSMD1 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 50 preSMD1 x 51 preSMD2 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 52 preSMD2 x 53 preSMD3 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 54 preSMD3 x 55 preSMD4 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 56 preSMD4 x 1 57 1 yyyyyyyyyyyyyyyyyyyy 2 58 2 abcxxx … … 12 68 12 wwwwwwww 13 69 13 wwwwwwww 70 14 cccc 71 15 14 72 1 yyyyyyyyyyyyyyyyyyyy 15 73 2 abcxxx … … 25 83 12 wwwwwwww 26 84 13 wwwwwwww 85 14 cccc 86 15 -
tests/collections/.in/string-istream-manip.txt
r2261bcc rf45772e 1 0123456 x 2 01234567 x 3 012345678 x 4 0123456789 x 5 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 x 6 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 x 7 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 x 8 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 x 9 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 x 10 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 x 11 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 x 12 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 x 13 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 14 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 15 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 16 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 17 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 18 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 19 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 20 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:... -x- 21 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456 22 x 23 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567 24 x 25 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678 26 x 27 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789 28 x 29 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456@x@ 30 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...01234567@x@ 31 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...012345678@x@ 32 ...:...:...:...|...:...:...:...|...:...:...:...|...:...:...:...#...:...:...:...|...:...:...:...|...:...:...:...|...:...0123456789@x@ 1 33 abc 2 abc34 cccccb 3 35 xx 4 36 abcxxx 5 37 abcyyy 6 38 aaaaaaaaxxxxxxxxaabbccbbdddwwwbbbbbbbbwwwwwwwwaaaaaaaawwwwwwww 39 uuuuuccccuuuuu 7 40 abc 8 abc41 cccccb 9 42 xx 10 43 abcxxx 11 44 abcyyy 12 45 aaaaaaaaxxxxxxxxaabbccbbdddwwwbbbbbbbbwwwwwwwwaaaaaaaawwwwwwww 46 uuuuuccccuuuuu -
tests/collections/string-istream-manip.cfa
r2261bcc rf45772e 3 3 #include <collections/string.hfa> 4 4 #include <collections/string_res.hfa> 5 #include <stdio.h> 6 7 // No-op manipulators. 8 // Temporary hack while there are two code paths in the string implementation. 9 // (One for reading plain strings, the other for reading via a manipulator.) 10 // The test cases that use plainjane(-) are exercising the via-manipulator code path, 11 // just with trivial manipulation. 12 static _Istream_Sstr plainjane( string & s ) { return (_Istream_Sstr)@{ s, {{0p}, -1, {.flags.rwd : false}} }; } 13 static _Istream_Rstr plainjane( string_res & s ) { return (_Istream_Rstr)@{ &s, {{0p}, -1, {.flags.rwd : false}} }; } 14 15 static void forceStringHeapFreeSpaceTo(int desiredSize) { 16 for (1_000_000) { 17 string x = "a"; 18 (void)x; 19 if (desiredSize == DEBUG_string_bytes_avail_until_gc(DEBUG_string_heap())) return; 20 } 21 sout | "Unable to force size" | desiredSize | "in 1,000,000 tries"; 22 } 5 23 6 24 int main() { 25 // These "pre" cases deal with issues analogous to the "pre" cases of io/manipulatorsInput. 26 // The acceptance criterion is simpler but driving the cases is harder. 27 // The tests just read strings and echo what they read; acceptance of simple echoing assures 28 // no spurious splitting merging. 29 // The lengths of the strings are chosen to match white-box knowledge of when the string layer 30 // has tor drive the cstring layer through a second iteration: 31 // - for no-manip, lengths are near the room at end of string heap 32 // (chosen target size of 9 showed the original bug on preS2, aligned with the other cases) 33 // - for manip, lengths are near the auxiliary buffer size of 128 34 // Only first case repeats for string_res; rest run only from the passthru string layer. 35 // Similarly, the manipulator breadth isn't checked at the cstring layer either. 36 { 37 // S: string, no manipulator 38 void echoTillX(const char * casename) { 39 string s; 40 do { 41 forceStringHeapFreeSpaceTo(9); 42 sin | s; 43 sout | casename | s; 44 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 45 } 46 echoTillX("preS1"); 47 echoTillX("preS2"); 48 echoTillX("preS3"); 49 echoTillX("preS4"); 50 } 51 { 52 // SMN: string, manipulator for no-op 53 void echoTillX(const char * casename) { 54 string s; 55 do { 56 sin | plainjane( s ); 57 sout | casename | s; 58 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 59 } 60 echoTillX("preSMN1"); 61 echoTillX("preSMN2"); 62 echoTillX("preSMN3"); 63 echoTillX("preSMN4"); 64 } 65 { 66 // RMN: string_res, manipulator for no-op 67 void echoTillX(const char * casename) { 68 string_res s; 69 do { 70 sin | plainjane( s ); 71 sout | casename | s; 72 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 73 } 74 echoTillX("preRMN1"); 75 echoTillX("preRMN2"); 76 echoTillX("preRMN3"); 77 echoTillX("preRMN4"); 78 } 79 { 80 // SMI: string, manipulator `incl` 81 void echoTillX(const char * casename) { 82 string s; 83 do { 84 sin | skip("-\n"); 85 sin | incl( ".:|# x", s ); 86 sout | casename | " \"" | s | "\""; 87 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 88 } 89 echoTillX("preSMI1"); 90 echoTillX("preSMI2"); 91 echoTillX("preSMI3"); 92 echoTillX("preSMI4"); 93 } 94 { 95 // SME: string, manipulator `excl` 96 void echoTillX(const char * casename) { 97 string s; 98 do { 99 sin | skip("-\n"); 100 sin | excl( "-\n", s ); 101 sout | casename | " \"" | s | "\""; 102 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 103 } 104 echoTillX("preSME1"); 105 echoTillX("preSME2"); 106 echoTillX("preSME3"); 107 echoTillX("preSME4"); 108 } 109 sin | skip("-\n"); 110 { 111 // SMG: string, manipulator `getline` 112 void echoTillX(const char * casename) { 113 string s; 114 do { 115 sin | getline( s ); 116 sout | casename | s; 117 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 118 } 119 echoTillX("preSMG1"); 120 echoTillX("preSMG2"); 121 echoTillX("preSMG3"); 122 echoTillX("preSMG4"); 123 } 124 { 125 // SMD: string, manipulator (`getline` with custom) delimiter 126 void echoTillX(const char * casename) { 127 string s; 128 do { 129 sin | getline( s, '@' ); 130 sout | casename | s; 131 } while ( size(s) > 0 && s[size(s)-1] != 'x' ); 132 sin | skip(" \n"); 133 } 134 echoTillX("preSMD1"); 135 echoTillX("preSMD2"); 136 echoTillX("preSMD3"); 137 echoTillX("preSMD4"); 138 } 139 7 140 /* Keep harmonized with io/manipulatorsInput */ 8 141 { … … 23 156 sin | ignore( incl( "abc", wdi( 8, s ) ) ); sout | "12" | s; 24 157 sin | ignore( excl( "abc", wdi( 8, s ) ) ); sout | "13" | s; 25 } 158 159 s = "q"; 160 sin | incl( "abc", s ); sout | "14" | s; 161 s = "q"; 162 sin | excl( "u", s ); sout | "15" | s; 163 sin | skip( "u" ); 164 sin | "\n"; 165 } 166 // Full repeat on string_res layer assures the full manipulator vocabulary is supported there. 26 167 { 27 168 string_res s = "yyyyyyyyyyyyyyyyyyyy"; … … 41 182 sin | ignore( incl( "abc", wdi( 8, s ) ) ); sout | "12" | s; 42 183 sin | ignore( excl( "abc", wdi( 8, s ) ) ); sout | "13" | s; 184 185 s = "q"; 186 sin | incl( "abc", s ); sout | "14" | s; 187 s = "q"; 188 sin | excl( "u", s ); sout | "15" | s; 189 sin | skip( "u" ); 190 sin | "\n"; 43 191 } 44 192 } -
tests/errors/.expect/scope.txt
r2261bcc rf45772e 1 errors/scope.cfa: 2:1 error: duplicate object definition for thisIsAnError: signed int2 errors/scope.cfa: 20:1 error: duplicate function definition for butThisIsAnError: function1 errors/scope.cfa:13:1 error: duplicate object definition for thisIsAnError: signed int 2 errors/scope.cfa:30:1 error: duplicate function definition for butThisIsAnError: function 3 3 ... with parameters 4 4 double -
tests/errors/scope.cfa
r2261bcc rf45772e 1 int thisIsAnError; 2 int thisIsAnError; 1 // Keep harmonized with errors/scope. 3 2 4 int thisIsNotAnError; 5 float thisIsNotAnError; 3 #ifdef OMIT_DRIVING_REJECTIONS 4 // For manual sanity checking: 5 // Leave out the offensive declarations and verify that what's left is accepted. 6 #define EXPREJ(...) 7 #else 8 #define EXPREJ(...) __VA_ARGS__ 9 #endif 6 10 7 int thisIsAlsoNotAnError() {8 int thisIsNotAnError;9 }10 11 11 int thisIsAlsoNotAnError( double x ) { 12 } 12 int thisIsAnError; 13 EXPREJ( int thisIsAnError; ) 13 14 14 double thisIsStillNotAnError( double );15 double thisIsStillNotAnError( double );15 int thisIsNotAnError; 16 float thisIsNotAnError; 16 17 17 double butThisIsAnError( double ) { 18 } 18 int thisIsAlsoNotAnError() { 19 int thisIsNotAnError; 20 } 19 21 20 double butThisIsAnError( double ) { 21 } 22 int thisIsAlsoNotAnError( double x ) { 23 } 24 25 double thisIsStillNotAnError( double ); 26 double thisIsStillNotAnError( double ); 27 28 double butThisIsAnError( double ) { 29 } 30 EXPREJ( 31 double butThisIsAnError( double ) { 32 } 33 ) 22 34 23 35 // Local Variables: // -
tests/io/.expect/manipulatorsInput.arm64.txt
r2261bcc rf45772e 1 1 pre1 "123456", canary ok 2 pre2a "1234567", exception occurred, canary ok 3 pre2b "89", canary ok 2 pre2 "1234567", canary ok 3 pre3a "1234567", exception occurred, canary ok 4 pre3b "8", canary ok 5 pre4a "1234567", exception occurred, canary ok 6 pre4b "89", canary ok 4 7 1 yyyyyyyyyyyyyyyyyyyy 5 8 2 abcxxx … … 15 18 12 wwwwwwww 16 19 13 wwwwwwww 20 14 rc=1, cccc 21 15 rc=0, q 17 22 1 yyyyyyyyyyyyyyyyyyyy 18 23 2 abcxxx … … 28 33 12 wwwwwwww 29 34 13 wwwwwwww 35 14 cccc 36 15 30 37 a 31 38 a -
tests/io/.expect/manipulatorsInput.x64.txt
r2261bcc rf45772e 1 1 pre1 "123456", canary ok 2 pre2a "1234567", exception occurred, canary ok 3 pre2b "89", canary ok 2 pre2 "1234567", canary ok 3 pre3a "1234567", exception occurred, canary ok 4 pre3b "8", canary ok 5 pre4a "1234567", exception occurred, canary ok 6 pre4b "89", canary ok 4 7 1 yyyyyyyyyyyyyyyyyyyy 5 8 2 abcxxx … … 15 18 12 wwwwwwww 16 19 13 wwwwwwww 20 14 rc=1, cccc 21 15 rc=0, q 17 22 1 yyyyyyyyyyyyyyyyyyyy 18 23 2 abcxxx … … 28 33 12 wwwwwwww 29 34 13 wwwwwwww 35 14 cccc 36 15 30 37 a 31 38 a -
tests/io/.expect/manipulatorsInput.x86.txt
r2261bcc rf45772e 1 1 pre1 "123456", canary ok 2 pre2a "1234567", exception occurred, canary ok 3 pre2b "89", canary ok 2 pre2 "1234567", canary ok 3 pre3a "1234567", exception occurred, canary ok 4 pre3b "8", canary ok 5 pre4a "1234567", exception occurred, canary ok 6 pre4b "89", canary ok 4 7 1 yyyyyyyyyyyyyyyyyyyy 5 8 2 abcxxx … … 15 18 12 wwwwwwww 16 19 13 wwwwwwww 20 14 rc=1, cccc 21 15 rc=0, q 17 22 1 yyyyyyyyyyyyyyyyyyyy 18 23 2 abcxxx … … 28 33 12 wwwwwwww 29 34 13 wwwwwwww 35 14 cccc 36 15 30 37 a 31 38 a -
tests/io/.in/manipulatorsInput.txt
r2261bcc rf45772e 1 1 123456 2 1234567 3 12345678 2 4 123456789 3 5 abc 4 abc6 cccccb 5 7 xx 6 8 abcxxx 7 9 abcyyy 8 10 aaaaaaaaxxxxxxxxaabbccbbdddwwwbbbbbbbbwwwwwwwwaaaaaaaawwwwwwww 11 uuuuuccccuuuuu 9 12 abc 10 abc13 cccccb 11 14 xx 12 15 abcxxx 13 16 abcyyy 14 17 aaaaaaaaxxxxxxxxaabbccbbdddwwwbbbbbbbbwwwwwwwwaaaaaaaawwwwwwww 18 uuuuuccccuuuuu 15 19 ab 16 20 0xff 017 15-15 -
tests/io/manipulatorsInput.cfa
r2261bcc rf45772e 45 45 } 46 46 47 rep("pre1"); 48 rep("pre2a"); 49 rep("pre2b"); 47 rep("pre1"); // 123456 | 123456 48 rep("pre2"); // 1234567 | 1234567 49 rep("pre3a"); // 12345678 | 1234567 50 rep("pre3b"); // | 8 51 rep("pre4a"); // 123456789 | 1234567 52 rep("pre4b"); // | 89 53 50 54 scanf("\n"); // next test does not start with %s so does not tolerate leading whitespace 51 55 } 52 56 { 53 57 char s[] = "yyyyyyyyyyyyyyyyyyyy"; 54 const char sk [] = "abc";55 scanf( "abc " ); scanf( sk ); for ( 5 ) scanf( "%*c" );printf( "1 %s\n", s );58 const char sk_fmt[] = "%*[abc]"; 59 scanf( "abc " ); scanf( sk_fmt ); for ( 5 ) scanf( "%*c" ); printf( "1 %s\n", s ); 56 60 scanf( "%s", s ); printf( "2 %s\n", s ); 57 61 scanf( "%*s" ); printf( "3 %s\n", s ); … … 67 71 scanf( "%*8[abc]" ); printf( "12 %s\n", s ); 68 72 scanf( "%*8[^abc]" ); printf( "13 %s\n", s ); 73 74 int rc; 75 s[0] = 'q'; s[1] = '\0'; rc = 99; 76 rc = scanf( "%[abc]", s ); printf( "14 rc=%d, %s\n", rc, s ); 77 s[0] = 'q'; s[1] = '\0'; rc = 99; 78 rc = scanf( "%[^u]", s ); printf( "15 rc=%d, %s\n", rc, s ); 79 scanf( "%*[u]" ); 80 scanf("\n"); 69 81 } 70 82 { … … 85 97 sin | ignore( incl( "abc", wdi( sizeof(s), 8, s ) ) ); sout | "12" | s; 86 98 sin | ignore( excl( "abc", wdi( sizeof(s), 8, s ) ) ); sout | "13" | s; 99 100 s[0] = 'q'; s[1] = '\0'; 101 sin | incl( "abc", wdi( sizeof(s), s ) ); sout | "14" | s; 102 s[0] = 'q'; s[1] = '\0'; 103 sin | excl( "u", wdi( sizeof(s), s ) ); sout | "15" | s; 104 sin | skip( "u" ); 105 sin | "\n"; 87 106 } 88 107 /* Keep harmonized with collections/string-istream-manip */ -
tests/test.py
r2261bcc rf45772e 116 116 parser.add_argument('--no-invariant', help='Tell the compiler not to check invariants.', action='store_false', dest='invariant') 117 117 parser.add_argument('--invariant', help='Tell the compiler to check invariants.', action='store_const', const=True) 118 parser.add_argument('--timeout', help='Maximum duration in seconds after a single test is considered to have timed out', type=int, default= 180)118 parser.add_argument('--timeout', help='Maximum duration in seconds after a single test is considered to have timed out', type=int, default=240) 119 119 parser.add_argument('--global-timeout', help='Maximum cumulative duration in seconds after the ALL tests are considered to have timed out', type=int, default=7200) 120 120 parser.add_argument('--timeout-with-gdb', help='Instead of killing the command when it times out, orphan it and print process id to allow gdb to attach', type=yes_no, default="no") -
tools/build/cfa.m4
r2261bcc rf45772e 67 67 "x86_64" ) cannon_arch_name="x64";; 68 68 "aarch64" ) cannon_arch_name="arm64";; 69 "arm 4") cannon_arch_name="arm64";;69 "arm64" ) cannon_arch_name="arm64";; 70 70 "ARM64" ) cannon_arch_name="arm64";; 71 71 "x86" ) cannon_arch_name="x86";;
Note: See TracChangeset
for help on using the changeset viewer.