Changeset 9e23b446
- Timestamp:
- Jul 25, 2022, 2:23:00 PM (16 months ago)
- Branches:
- ADT, ast-experimental, master, pthread-emulation, qualifiedEnum
- Children:
- ffec1bf
- Parents:
- 76a798d
- Location:
- src
- Files:
-
- 1 added
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
src/AST/Pass.hpp
r76a798d r9e23b446 264 264 __pass::result1<ast::Stmt> call_accept_as_compound(const ast::Stmt *); 265 265 266 // requests type environment to be updated (why is it implemented like this?) 267 __pass::result1<ast::Expr> call_accept_top(const ast::Expr *); 268 266 269 template< template <class...> class container_t > 267 270 __pass::resultNstmt<container_t> call_accept( const container_t< ptr<Stmt> > & ); … … 277 280 template<typename node_t, typename parent_t, typename field_t> 278 281 void maybe_accept_as_compound(const node_t * &, field_t parent_t::* field); 282 283 template<typename node_t, typename parent_t, typename field_t> 284 void maybe_accept_top(const node_t * &, field_t parent_t::* field); 279 285 280 286 private: -
src/AST/Pass.impl.hpp
r76a798d r9e23b446 155 155 __pedantic_pass_assert( expr ); 156 156 157 const ast::TypeSubstitution ** typeSubs_ptr = __pass::typeSubs( core, 0 );158 if ( typeSubs_ptr && expr->env ) {159 *typeSubs_ptr = expr->env;160 }161 162 157 auto nval = expr->accept( *this ); 163 158 return { nval != expr, nval }; … … 171 166 const ast::Stmt * nval = stmt->accept( *this ); 172 167 return { nval != stmt, nval }; 168 } 169 170 template< typename core_t > 171 __pass::template result1<ast::Expr> ast::Pass< core_t >::call_accept_top( const ast::Expr * expr ) { 172 __pedantic_pass_assert( __visit_children() ); 173 __pedantic_pass_assert( expr ); 174 175 const ast::TypeSubstitution ** typeSubs_ptr = __pass::typeSubs( core, 0 ); 176 if ( typeSubs_ptr && expr->env ) { 177 *typeSubs_ptr = expr->env; 178 } 179 180 auto nval = expr->accept( *this ); 181 return { nval != expr, nval }; 173 182 } 174 183 … … 410 419 411 420 auto new_val = call_accept( old_val ); 421 422 static_assert( !std::is_same<const ast::Node *, decltype(new_val)>::value /* || std::is_same<int, decltype(old_val)>::value */, "ERROR"); 423 424 if( new_val.differs ) { 425 auto new_parent = __pass::mutate<core_t>(parent); 426 new_val.apply(new_parent, field); 427 parent = new_parent; 428 } 429 } 430 431 template< typename core_t > 432 template<typename node_t, typename super_t, typename field_t> 433 void ast::Pass< core_t >::maybe_accept_top( 434 const node_t * & parent, 435 field_t super_t::*field 436 ) { 437 static_assert( std::is_base_of<super_t, node_t>::value, "Error deducing member object" ); 438 439 if(__pass::skip(parent->*field)) return; 440 const auto & old_val = __pass::get(parent->*field, 0); 441 442 static_assert( !std::is_same<const ast::Node * &, decltype(old_val)>::value, "ERROR"); 443 444 auto new_val = call_accept_top( old_val ); 412 445 413 446 static_assert( !std::is_same<const ast::Node *, decltype(new_val)>::value /* || std::is_same<int, decltype(old_val)>::value */, "ERROR"); … … 755 788 756 789 if ( __visit_children() ) { 757 maybe_accept ( node, &StaticAssertDecl::cond );790 maybe_accept_top( node, &StaticAssertDecl::cond ); 758 791 maybe_accept( node, &StaticAssertDecl::msg ); 759 792 } … … 797 830 798 831 if ( __visit_children() ) { 799 maybe_accept ( node, &ExprStmt::expr );832 maybe_accept_top( node, &ExprStmt::expr ); 800 833 } 801 834 … … 838 871 guard_symtab guard { *this }; 839 872 maybe_accept( node, &IfStmt::inits ); 840 maybe_accept ( node, &IfStmt::cond );873 maybe_accept_top( node, &IfStmt::cond ); 841 874 maybe_accept_as_compound( node, &IfStmt::then ); 842 875 maybe_accept_as_compound( node, &IfStmt::else_ ); … … 856 889 guard_symtab guard { *this }; 857 890 maybe_accept( node, &WhileDoStmt::inits ); 858 maybe_accept ( node, &WhileDoStmt::cond );891 maybe_accept_top( node, &WhileDoStmt::cond ); 859 892 maybe_accept_as_compound( node, &WhileDoStmt::body ); 860 893 } … … 874 907 // xxx - old ast does not create WithStmtsToAdd scope for loop inits. should revisit this later. 875 908 maybe_accept( node, &ForStmt::inits ); 876 maybe_accept ( node, &ForStmt::cond );877 maybe_accept ( node, &ForStmt::inc );909 maybe_accept_top( node, &ForStmt::cond ); 910 maybe_accept_top( node, &ForStmt::inc ); 878 911 maybe_accept_as_compound( node, &ForStmt::body ); 879 912 } … … 889 922 890 923 if ( __visit_children() ) { 891 maybe_accept ( node, &SwitchStmt::cond );924 maybe_accept_top( node, &SwitchStmt::cond ); 892 925 maybe_accept( node, &SwitchStmt::cases ); 893 926 } … … 903 936 904 937 if ( __visit_children() ) { 905 maybe_accept ( node, &CaseClause::cond );938 maybe_accept_top( node, &CaseClause::cond ); 906 939 maybe_accept( node, &CaseClause::stmts ); 907 940 } … … 925 958 926 959 if ( __visit_children() ) { 927 maybe_accept ( node, &ReturnStmt::expr );960 maybe_accept_top( node, &ReturnStmt::expr ); 928 961 } 929 962 … … 970 1003 guard_symtab guard { *this }; 971 1004 maybe_accept( node, &CatchClause::decl ); 972 maybe_accept ( node, &CatchClause::cond );1005 maybe_accept_top( node, &CatchClause::cond ); 973 1006 maybe_accept_as_compound( node, &CatchClause::body ); 974 1007 } … … 2057 2090 2058 2091 if ( __visit_children() ) { 2059 maybe_accept ( node, &SingleInit::value );2092 maybe_accept_top( node, &SingleInit::value ); 2060 2093 } 2061 2094 -
src/AST/SymbolTable.cpp
r76a798d r9e23b446 65 65 66 66 Expr * SymbolTable::IdData::combine( const CodeLocation & loc, ResolvExpr::Cost & cost ) const { 67 Expr * ret = ( baseExpr ) ? 68 (Expr *)new MemberExpr{ loc, id, referenceToRvalueConversion( baseExpr, cost ) } : 69 (Expr *)new VariableExpr{ loc, id }; 67 Expr * ret; 68 if ( baseExpr ) { 69 if (baseExpr->env) { 70 Expr * base = shallowCopy(baseExpr); 71 const TypeSubstitution * subs = baseExpr->env; 72 base->env = nullptr; 73 ret = new MemberExpr{loc, id, referenceToRvalueConversion( base, cost )}; 74 ret->env = subs; 75 } 76 else { 77 ret = new MemberExpr{ loc, id, referenceToRvalueConversion( baseExpr, cost ) }; 78 } 79 } 80 else { 81 ret = new VariableExpr{ loc, id }; 82 } 70 83 if ( deleter ) { ret = new DeletedExpr{ loc, ret, deleter }; } 71 84 return ret; … … 772 785 && ! dynamic_cast<const UnionInstType *>(rty) ) continue; 773 786 ResolvExpr::Cost cost = ResolvExpr::Cost::zero; 787 ast::ptr<ast::TypeSubstitution> tmp = expr->env; 788 expr = mutate_field(expr, &Expr::env, nullptr); 774 789 const Expr * base = ResolvExpr::referenceToRvalueConversion( expr, cost ); 790 base = mutate_field(base, &Expr::env, tmp); 791 775 792 addMembers( 776 793 rty->aggr(), new MemberExpr{ base->location, dwt, base }, handleConflicts ); -
src/AST/TypeSubstitution.cpp
r76a798d r9e23b446 97 97 TypeSubstitution * newEnv; 98 98 EnvTrimmer( const TypeSubstitution * env, TypeSubstitution * newEnv ) : env( env ), newEnv( newEnv ){} 99 void previsit( FunctionType * ftype ) {99 void previsit( const FunctionType * ftype ) { 100 100 // transfer known bindings for seen type variables 101 101 for (auto & formal : ftype->forall) { -
src/GenPoly/Specialize.h
r76a798d r9e23b446 17 17 18 18 #include <list> // for list 19 #include "AST/TranslationUnit.hpp" 19 20 20 21 class Declaration; … … 23 24 /// generates thunks where needed 24 25 void convertSpecializations( std::list< Declaration* >& translationUnit ); 26 27 void convertSpecializations( ast::TranslationUnit & translationUnit ); 25 28 } // namespace GenPoly 26 29 -
src/GenPoly/module.mk
r76a798d r9e23b446 34 34 GenPoly/ScrubTyVars.h \ 35 35 GenPoly/Specialize.cc \ 36 GenPoly/SpecializeNew.cpp \ 36 37 GenPoly/Specialize.h 37 38 -
src/InitTweak/FixInitNew.cpp
r76a798d r9e23b446 73 73 /// wrap function application expressions as ImplicitCopyCtorExpr nodes so that it is easy to identify which 74 74 /// function calls need their parameters to be copy constructed 75 struct InsertImplicitCalls : public ast::With ConstTypeSubstitution, public ast::WithShortCircuiting {75 struct InsertImplicitCalls : public ast::WithShortCircuiting { 76 76 const ast::Expr * postvisit( const ast::ApplicationExpr * appExpr ); 77 77 … … 457 457 // is needed to obtain the type of temporary variables so that copy 458 458 // constructor calls can be resolved. 459 assert( typeSubs );460 459 expr->env = tmp; 461 460 return expr; -
src/ResolvExpr/CandidateFinder.cpp
r76a798d r9e23b446 1265 1265 newExpr, copy( tenv ), ast::OpenVarSet{}, ast::AssertionSet{}, Cost::zero, 1266 1266 cost ); 1267 1268 if (newCand->expr->env) { 1269 newCand->env.add(*newCand->expr->env); 1270 auto mutExpr = newCand->expr.get_and_mutate(); 1271 mutExpr->env = nullptr; 1272 newCand->expr = mutExpr; 1273 } 1274 1267 1275 PRINT( 1268 1276 std::cerr << "decl is "; -
src/ResolvExpr/Resolver.cc
r76a798d r9e23b446 1555 1555 if ( type->dimension ) { 1556 1556 ast::ptr< ast::Type > sizeType = context.global.sizeType; 1557 ast::ptr< ast::Expr > dimension = findSingleExpression( type->dimension, sizeType, context ); 1558 assertf(dimension->env->empty(), "array dimension expr has nonempty env"); 1559 dimension.get_and_mutate()->env = nullptr; 1557 1560 ast::mutate_field( 1558 1561 type, &PtrType::dimension, 1559 findSingleExpression( type->dimension, sizeType, context ));1562 dimension); 1560 1563 } 1561 1564 return type; … … 2008 2011 tmp->accept( *visitor ); 2009 2012 } 2013 else if (expr->env && expr->env->empty()) { 2014 expr = ast::mutate_field(expr.get(), &ast::Expr::env, nullptr); 2015 } 2010 2016 } 2011 2017 } -
src/main.cc
r76a798d r9e23b446 449 449 PASS( "Translate Tries", ControlStruct::translateTries( transUnit ) ); 450 450 PASS( "Gen Waitfor", Concurrency::generateWaitFor( transUnit ) ); 451 PASS( "Convert Specializations", GenPoly::convertSpecializations( transUnit ) ); // needs to happen before tuple types are expanded 452 451 453 452 454 translationUnit = convert( move( transUnit ) ); … … 520 522 PASS( "Translate Tries", ControlStruct::translateTries( translationUnit ) ); 521 523 PASS( "Gen Waitfor", Concurrency::generateWaitFor( translationUnit ) ); 524 PASS( "Convert Specializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded 525 522 526 } 523 527 524 PASS( "Convert Specializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded 528 529 // PASS( "Convert Specializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded 525 530 526 531 PASS( "Expand Tuples", Tuples::expandTuples( translationUnit ) ); // xxx - is this the right place for this?
Note: See TracChangeset
for help on using the changeset viewer.