[51587aa] | 1 | // |
---|
| 2 | // Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo |
---|
| 3 | // |
---|
| 4 | // The contents of this file are covered under the licence agreement in the |
---|
| 5 | // file "LICENCE" distributed with Cforall. |
---|
| 6 | // |
---|
[a0fdbd5] | 7 | // GenInit.cc -- |
---|
[51587aa] | 8 | // |
---|
[cf16f94] | 9 | // Author : Rob Schluntz |
---|
[51587aa] | 10 | // Created On : Mon May 18 07:44:20 2015 |
---|
[3a5131ed] | 11 | // Last Modified By : Peter A. Buhr |
---|
[07de76b] | 12 | // Last Modified On : Fri Dec 13 23:15:10 2019 |
---|
| 13 | // Update Count : 184 |
---|
[51587aa] | 14 | // |
---|
[8ca3a72] | 15 | #include "GenInit.h" |
---|
| 16 | |
---|
[2bfc6b2] | 17 | #include <stddef.h> // for NULL |
---|
| 18 | #include <algorithm> // for any_of |
---|
| 19 | #include <cassert> // for assert, strict_dynamic_cast, assertf |
---|
[b8524ca] | 20 | #include <deque> |
---|
[2bfc6b2] | 21 | #include <iterator> // for back_inserter, inserter, back_inse... |
---|
| 22 | #include <list> // for _List_iterator, list |
---|
[8ca3a72] | 23 | |
---|
[b8524ca] | 24 | #include "AST/Decl.hpp" |
---|
| 25 | #include "AST/Init.hpp" |
---|
| 26 | #include "AST/Node.hpp" |
---|
| 27 | #include "AST/Stmt.hpp" |
---|
[16ba4a6f] | 28 | #include "CompilationState.h" |
---|
[8135d4c] | 29 | #include "CodeGen/OperatorTable.h" |
---|
[2bfc6b2] | 30 | #include "Common/PassVisitor.h" // for PassVisitor, WithGuards, WithShort... |
---|
| 31 | #include "Common/SemanticError.h" // for SemanticError |
---|
| 32 | #include "Common/UniqueName.h" // for UniqueName |
---|
| 33 | #include "Common/utility.h" // for ValueGuard, maybeClone |
---|
| 34 | #include "GenPoly/GenPoly.h" // for getFunctionType, isPolyType |
---|
| 35 | #include "GenPoly/ScopedSet.h" // for ScopedSet, ScopedSet<>::const_iter... |
---|
| 36 | #include "InitTweak.h" // for isConstExpr, InitExpander, checkIn... |
---|
[fdd0509] | 37 | #include "ResolvExpr/Resolver.h" |
---|
[2bfc6b2] | 38 | #include "SymTab/Autogen.h" // for genImplicitCall |
---|
| 39 | #include "SymTab/Mangler.h" // for Mangler |
---|
[07de76b] | 40 | #include "SynTree/LinkageSpec.h" // for isOverridable, C |
---|
[2bfc6b2] | 41 | #include "SynTree/Declaration.h" // for ObjectDecl, DeclarationWithType |
---|
| 42 | #include "SynTree/Expression.h" // for VariableExpr, UntypedExpr, Address... |
---|
| 43 | #include "SynTree/Initializer.h" // for ConstructorInit, SingleInit, Initi... |
---|
| 44 | #include "SynTree/Label.h" // for Label |
---|
| 45 | #include "SynTree/Mutator.h" // for mutateAll |
---|
| 46 | #include "SynTree/Statement.h" // for CompoundStmt, ImplicitCtorDtorStmt |
---|
| 47 | #include "SynTree/Type.h" // for Type, ArrayType, Type::Qualifiers |
---|
| 48 | #include "SynTree/Visitor.h" // for acceptAll, maybeAccept |
---|
| 49 | #include "Tuples/Tuples.h" // for maybeImpure |
---|
| 50 | #include "Validate/FindSpecialDecls.h" // for SizeType |
---|
[42e2ad7] | 51 | |
---|
| 52 | namespace InitTweak { |
---|
[a08ba92] | 53 | namespace { |
---|
| 54 | const std::list<Label> noLabels; |
---|
[5b40f30] | 55 | const std::list<Expression *> noDesignators; |
---|
[a08ba92] | 56 | } |
---|
[1e9d87b] | 57 | |
---|
[d24d4e1] | 58 | struct ReturnFixer : public WithStmtsToAdd, public WithGuards { |
---|
[a0fdbd5] | 59 | /// consistently allocates a temporary variable for the return value |
---|
| 60 | /// of a function so that anything which the resolver decides can be constructed |
---|
[02c7d04] | 61 | /// into the return type of a function can be returned. |
---|
[a0fdbd5] | 62 | static void makeReturnTemp( std::list< Declaration * > &translationUnit ); |
---|
[02c7d04] | 63 | |
---|
[7b6ca2e] | 64 | void premutate( FunctionDecl *functionDecl ); |
---|
| 65 | void premutate( ReturnStmt * returnStmt ); |
---|
[1e9d87b] | 66 | |
---|
| 67 | protected: |
---|
[c6976ba] | 68 | FunctionType * ftype = nullptr; |
---|
[cf16f94] | 69 | std::string funcName; |
---|
| 70 | }; |
---|
[42e2ad7] | 71 | |
---|
[22bc276] | 72 | struct CtorDtor : public WithGuards, public WithShortCircuiting, public WithVisitorRef<CtorDtor> { |
---|
[02c7d04] | 73 | /// create constructor and destructor statements for object declarations. |
---|
[5f98ce5] | 74 | /// the actual call statements will be added in after the resolver has run |
---|
| 75 | /// so that the initializer expression is only removed if a constructor is found |
---|
| 76 | /// and the same destructor call is inserted in all of the appropriate locations. |
---|
[02c7d04] | 77 | static void generateCtorDtor( std::list< Declaration * > &translationUnit ); |
---|
[974906e2] | 78 | |
---|
[d24d4e1] | 79 | void previsit( ObjectDecl * ); |
---|
| 80 | void previsit( FunctionDecl *functionDecl ); |
---|
| 81 | |
---|
[5f98ce5] | 82 | // should not traverse into any of these declarations to find objects |
---|
| 83 | // that need to be constructed or destructed |
---|
[d24d4e1] | 84 | void previsit( StructDecl *aggregateDecl ); |
---|
[aec3e6b] | 85 | void previsit( AggregateDecl * ) { visit_children = false; } |
---|
| 86 | void previsit( NamedTypeDecl * ) { visit_children = false; } |
---|
[22bc276] | 87 | void previsit( FunctionType * ) { visit_children = false; } |
---|
[db4ecc5] | 88 | |
---|
[d24d4e1] | 89 | void previsit( CompoundStmt * compoundStmt ); |
---|
[1ba88a0] | 90 | |
---|
| 91 | private: |
---|
| 92 | // set of mangled type names for which a constructor or destructor exists in the current scope. |
---|
| 93 | // these types require a ConstructorInit node to be generated, anything else is a POD type and thus |
---|
| 94 | // should not have a ConstructorInit generated. |
---|
| 95 | |
---|
[bfd4974] | 96 | ManagedTypes managedTypes; |
---|
[1ba88a0] | 97 | bool inFunction = false; |
---|
[974906e2] | 98 | }; |
---|
| 99 | |
---|
[fdd0509] | 100 | struct HoistArrayDimension final : public WithDeclsToAdd, public WithShortCircuiting, public WithGuards, public WithIndexer { |
---|
[5f98ce5] | 101 | /// hoist dimension from array types in object declaration so that it uses a single |
---|
| 102 | /// const variable of type size_t, so that side effecting array dimensions are only |
---|
| 103 | /// computed once. |
---|
| 104 | static void hoistArrayDimension( std::list< Declaration * > & translationUnit ); |
---|
| 105 | |
---|
[22bc276] | 106 | void premutate( ObjectDecl * objectDecl ); |
---|
| 107 | DeclarationWithType * postmutate( ObjectDecl * objectDecl ); |
---|
| 108 | void premutate( FunctionDecl *functionDecl ); |
---|
[5f98ce5] | 109 | // should not traverse into any of these declarations to find objects |
---|
| 110 | // that need to be constructed or destructed |
---|
[22bc276] | 111 | void premutate( AggregateDecl * ) { visit_children = false; } |
---|
| 112 | void premutate( NamedTypeDecl * ) { visit_children = false; } |
---|
| 113 | void premutate( FunctionType * ) { visit_children = false; } |
---|
[5f98ce5] | 114 | |
---|
[fdd0509] | 115 | // need this so that enumerators are added to the indexer, due to premutate(AggregateDecl *) |
---|
| 116 | void premutate( EnumDecl * ) {} |
---|
| 117 | |
---|
[5f98ce5] | 118 | void hoist( Type * type ); |
---|
| 119 | |
---|
[68fe077a] | 120 | Type::StorageClasses storageClasses; |
---|
[40e636a] | 121 | bool inFunction = false; |
---|
[5f98ce5] | 122 | }; |
---|
| 123 | |
---|
[a0fdbd5] | 124 | void genInit( std::list< Declaration * > & translationUnit ) { |
---|
[5f98ce5] | 125 | HoistArrayDimension::hoistArrayDimension( translationUnit ); |
---|
[16ba4a6f] | 126 | fixReturnStatements( translationUnit ); |
---|
| 127 | |
---|
| 128 | if (!useNewAST) { |
---|
| 129 | CtorDtor::generateCtorDtor( translationUnit ); |
---|
| 130 | } |
---|
[02c7d04] | 131 | } |
---|
| 132 | |
---|
[8b11840] | 133 | void fixReturnStatements( std::list< Declaration * > & translationUnit ) { |
---|
[7b6ca2e] | 134 | PassVisitor<ReturnFixer> fixer; |
---|
[a0fdbd5] | 135 | mutateAll( translationUnit, fixer ); |
---|
[a08ba92] | 136 | } |
---|
[42e2ad7] | 137 | |
---|
[7b6ca2e] | 138 | void ReturnFixer::premutate( ReturnStmt *returnStmt ) { |
---|
[65660bd] | 139 | std::list< DeclarationWithType * > & returnVals = ftype->get_returnVals(); |
---|
[cf16f94] | 140 | assert( returnVals.size() == 0 || returnVals.size() == 1 ); |
---|
[c6976ba] | 141 | // hands off if the function returns a reference - we don't want to allocate a temporary if a variable's address |
---|
[cf16f94] | 142 | // is being returned |
---|
[bd7e609] | 143 | if ( returnStmt->expr && returnVals.size() == 1 && isConstructable( returnVals.front()->get_type() ) ) { |
---|
[cce9429] | 144 | // explicitly construct the return value using the return expression and the retVal object |
---|
[18ca28e] | 145 | assertf( returnVals.front()->name != "", "Function %s has unnamed return value\n", funcName.c_str() ); |
---|
[c6976ba] | 146 | |
---|
[bd7e609] | 147 | ObjectDecl * retVal = strict_dynamic_cast< ObjectDecl * >( returnVals.front() ); |
---|
| 148 | if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( returnStmt->expr ) ) { |
---|
| 149 | // return statement has already been mutated - don't need to do it again |
---|
| 150 | if ( varExpr->var == retVal ) return; |
---|
| 151 | } |
---|
[9fe33947] | 152 | Statement * stmt = genCtorDtor( "?{}", retVal, returnStmt->expr ); |
---|
| 153 | assertf( stmt, "ReturnFixer: genCtorDtor returned nullptr: %s / %s", toString( retVal ).c_str(), toString( returnStmt->expr ).c_str() ); |
---|
| 154 | stmtsToAddBefore.push_back( stmt ); |
---|
[cf16f94] | 155 | |
---|
[cce9429] | 156 | // return the retVal object |
---|
[18ca28e] | 157 | returnStmt->expr = new VariableExpr( returnVals.front() ); |
---|
[cf16f94] | 158 | } // if |
---|
| 159 | } |
---|
| 160 | |
---|
[7b6ca2e] | 161 | void ReturnFixer::premutate( FunctionDecl *functionDecl ) { |
---|
[4eb31f2b] | 162 | GuardValue( ftype ); |
---|
| 163 | GuardValue( funcName ); |
---|
[1e9d87b] | 164 | |
---|
[22bc276] | 165 | ftype = functionDecl->type; |
---|
| 166 | funcName = functionDecl->name; |
---|
[cf16f94] | 167 | } |
---|
[974906e2] | 168 | |
---|
[4d2434a] | 169 | // precompute array dimension expression, because constructor generation may duplicate it, |
---|
| 170 | // which would be incorrect if it is a side-effecting computation. |
---|
[5f98ce5] | 171 | void HoistArrayDimension::hoistArrayDimension( std::list< Declaration * > & translationUnit ) { |
---|
[22bc276] | 172 | PassVisitor<HoistArrayDimension> hoister; |
---|
| 173 | mutateAll( translationUnit, hoister ); |
---|
[5f98ce5] | 174 | } |
---|
| 175 | |
---|
[22bc276] | 176 | void HoistArrayDimension::premutate( ObjectDecl * objectDecl ) { |
---|
| 177 | GuardValue( storageClasses ); |
---|
[a7c90d4] | 178 | storageClasses = objectDecl->get_storageClasses(); |
---|
[22bc276] | 179 | } |
---|
| 180 | |
---|
| 181 | DeclarationWithType * HoistArrayDimension::postmutate( ObjectDecl * objectDecl ) { |
---|
[5f98ce5] | 182 | hoist( objectDecl->get_type() ); |
---|
[22bc276] | 183 | return objectDecl; |
---|
[5f98ce5] | 184 | } |
---|
| 185 | |
---|
| 186 | void HoistArrayDimension::hoist( Type * type ) { |
---|
[40e636a] | 187 | // if in function, generate const size_t var |
---|
[5f98ce5] | 188 | static UniqueName dimensionName( "_array_dim" ); |
---|
[40e636a] | 189 | |
---|
[a7c90d4] | 190 | // C doesn't allow variable sized arrays at global scope or for static variables, so don't hoist dimension. |
---|
[f9cebb5] | 191 | if ( ! inFunction ) return; |
---|
[08d5507b] | 192 | if ( storageClasses.is_static ) return; |
---|
[f9cebb5] | 193 | |
---|
| 194 | if ( ArrayType * arrayType = dynamic_cast< ArrayType * >( type ) ) { |
---|
[5f98ce5] | 195 | if ( ! arrayType->get_dimension() ) return; // xxx - recursive call to hoist? |
---|
| 196 | |
---|
[fdd0509] | 197 | // need to resolve array dimensions in order to accurately determine if constexpr |
---|
[16ba4a6f] | 198 | if (!useNewAST) { |
---|
| 199 | ResolvExpr::findSingleExpression( arrayType->dimension, Validate::SizeType->clone(), indexer ); |
---|
| 200 | // array is variable-length when the dimension is not constexpr |
---|
| 201 | arrayType->isVarLen = ! isConstExpr( arrayType->dimension ); |
---|
| 202 | } |
---|
[300d75b] | 203 | // don't need to hoist dimension if it's definitely pure - only need to if there's potential for side effects. |
---|
[5465377c] | 204 | // xxx - hoisting has no side effects anyways, so don't skip since we delay resolve |
---|
| 205 | // still try to detect constant expressions |
---|
| 206 | if ( ! Tuples::maybeImpure( arrayType->dimension ) ) return; |
---|
[5f98ce5] | 207 | |
---|
[2bfc6b2] | 208 | ObjectDecl * arrayDimension = new ObjectDecl( dimensionName.newName(), storageClasses, LinkageSpec::C, 0, Validate::SizeType->clone(), new SingleInit( arrayType->get_dimension() ) ); |
---|
[615a096] | 209 | arrayDimension->get_type()->set_const( true ); |
---|
[5f98ce5] | 210 | |
---|
| 211 | arrayType->set_dimension( new VariableExpr( arrayDimension ) ); |
---|
[22bc276] | 212 | declsToAddBefore.push_back( arrayDimension ); |
---|
[5f98ce5] | 213 | |
---|
| 214 | hoist( arrayType->get_base() ); |
---|
| 215 | return; |
---|
| 216 | } |
---|
| 217 | } |
---|
[974906e2] | 218 | |
---|
[22bc276] | 219 | void HoistArrayDimension::premutate( FunctionDecl * ) { |
---|
| 220 | GuardValue( inFunction ); |
---|
[fdd0509] | 221 | inFunction = true; |
---|
[40e636a] | 222 | } |
---|
| 223 | |
---|
[02c7d04] | 224 | void CtorDtor::generateCtorDtor( std::list< Declaration * > & translationUnit ) { |
---|
[d24d4e1] | 225 | PassVisitor<CtorDtor> ctordtor; |
---|
| 226 | acceptAll( translationUnit, ctordtor ); |
---|
[974906e2] | 227 | } |
---|
| 228 | |
---|
[bfd4974] | 229 | bool ManagedTypes::isManaged( Type * type ) const { |
---|
[22bc276] | 230 | // references are never constructed |
---|
[c6976ba] | 231 | if ( dynamic_cast< ReferenceType * >( type ) ) return false; |
---|
[0b465a5] | 232 | // need to clear and reset qualifiers when determining if a type is managed |
---|
| 233 | ValueGuard< Type::Qualifiers > qualifiers( type->get_qualifiers() ); |
---|
| 234 | type->get_qualifiers() = Type::Qualifiers(); |
---|
[ac9ca96] | 235 | if ( TupleType * tupleType = dynamic_cast< TupleType * > ( type ) ) { |
---|
| 236 | // tuple is also managed if any of its components are managed |
---|
[22bc276] | 237 | if ( std::any_of( tupleType->types.begin(), tupleType->types.end(), [&](Type * type) { return isManaged( type ); }) ) { |
---|
[ac9ca96] | 238 | return true; |
---|
| 239 | } |
---|
| 240 | } |
---|
[30b65d8] | 241 | // a type is managed if it appears in the map of known managed types, or if it contains any polymorphism (is a type variable or generic type containing a type variable) |
---|
[e35f30a] | 242 | return managedTypes.find( SymTab::Mangler::mangleConcrete( type ) ) != managedTypes.end() || GenPoly::isPolyType( type ); |
---|
[65660bd] | 243 | } |
---|
| 244 | |
---|
[bfd4974] | 245 | bool ManagedTypes::isManaged( ObjectDecl * objDecl ) const { |
---|
[1ba88a0] | 246 | Type * type = objDecl->get_type(); |
---|
| 247 | while ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) { |
---|
[be9aa0f] | 248 | // must always construct VLAs with an initializer, since this is an error in C |
---|
| 249 | if ( at->isVarLen && objDecl->init ) return true; |
---|
[1ba88a0] | 250 | type = at->get_base(); |
---|
| 251 | } |
---|
[65660bd] | 252 | return isManaged( type ); |
---|
[1ba88a0] | 253 | } |
---|
| 254 | |
---|
[16ba4a6f] | 255 | // why is this not just on FunctionDecl? |
---|
[bfd4974] | 256 | void ManagedTypes::handleDWT( DeclarationWithType * dwt ) { |
---|
[1ba88a0] | 257 | // if this function is a user-defined constructor or destructor, mark down the type as "managed" |
---|
[bff227f] | 258 | if ( ! LinkageSpec::isOverridable( dwt->get_linkage() ) && CodeGen::isCtorDtor( dwt->get_name() ) ) { |
---|
[1ba88a0] | 259 | std::list< DeclarationWithType * > & params = GenPoly::getFunctionType( dwt->get_type() )->get_parameters(); |
---|
| 260 | assert( ! params.empty() ); |
---|
[ce8c12f] | 261 | Type * type = InitTweak::getPointerBase( params.front()->get_type() ); |
---|
| 262 | assert( type ); |
---|
[e35f30a] | 263 | managedTypes.insert( SymTab::Mangler::mangleConcrete( type ) ); |
---|
[1ba88a0] | 264 | } |
---|
| 265 | } |
---|
| 266 | |
---|
[bfd4974] | 267 | void ManagedTypes::handleStruct( StructDecl * aggregateDecl ) { |
---|
| 268 | // don't construct members, but need to take note if there is a managed member, |
---|
| 269 | // because that means that this type is also managed |
---|
| 270 | for ( Declaration * member : aggregateDecl->get_members() ) { |
---|
| 271 | if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( member ) ) { |
---|
| 272 | if ( isManaged( field ) ) { |
---|
[e35f30a] | 273 | // generic parameters should not play a role in determining whether a generic type is constructed - construct all generic types, so that |
---|
| 274 | // polymorphic constructors make generic types managed types |
---|
[bfd4974] | 275 | StructInstType inst( Type::Qualifiers(), aggregateDecl ); |
---|
[e35f30a] | 276 | managedTypes.insert( SymTab::Mangler::mangleConcrete( &inst ) ); |
---|
[bfd4974] | 277 | break; |
---|
| 278 | } |
---|
| 279 | } |
---|
| 280 | } |
---|
| 281 | } |
---|
| 282 | |
---|
| 283 | void ManagedTypes::beginScope() { managedTypes.beginScope(); } |
---|
| 284 | void ManagedTypes::endScope() { managedTypes.endScope(); } |
---|
| 285 | |
---|
[16ba4a6f] | 286 | bool ManagedTypes_new::isManaged( const ast::Type * type ) const { |
---|
| 287 | // references are never constructed |
---|
| 288 | if ( dynamic_cast< const ast::ReferenceType * >( type ) ) return false; |
---|
| 289 | if ( auto tupleType = dynamic_cast< const ast::TupleType * > ( type ) ) { |
---|
| 290 | // tuple is also managed if any of its components are managed |
---|
| 291 | for (auto & component : tupleType->types) { |
---|
| 292 | if (isManaged(component)) return true; |
---|
| 293 | } |
---|
| 294 | } |
---|
| 295 | // need to clear and reset qualifiers when determining if a type is managed |
---|
| 296 | // ValueGuard< Type::Qualifiers > qualifiers( type->get_qualifiers() ); |
---|
| 297 | auto tmp = shallowCopy(type); |
---|
| 298 | tmp->qualifiers = {}; |
---|
| 299 | // delete tmp at return |
---|
| 300 | ast::ptr<ast::Type> guard = tmp; |
---|
| 301 | // a type is managed if it appears in the map of known managed types, or if it contains any polymorphism (is a type variable or generic type containing a type variable) |
---|
| 302 | return managedTypes.find( Mangle::mangle( tmp, {Mangle::NoOverrideable | Mangle::NoGenericParams | Mangle::Type} ) ) != managedTypes.end() || GenPoly::isPolyType( tmp ); |
---|
| 303 | } |
---|
| 304 | |
---|
| 305 | bool ManagedTypes_new::isManaged( const ast::ObjectDecl * objDecl ) const { |
---|
| 306 | const ast::Type * type = objDecl->type; |
---|
| 307 | while ( auto at = dynamic_cast< const ast::ArrayType * >( type ) ) { |
---|
| 308 | // must always construct VLAs with an initializer, since this is an error in C |
---|
| 309 | if ( at->isVarLen && objDecl->init ) return true; |
---|
| 310 | type = at->base; |
---|
| 311 | } |
---|
| 312 | return isManaged( type ); |
---|
| 313 | } |
---|
| 314 | |
---|
| 315 | void ManagedTypes_new::handleDWT( const ast::DeclWithType * dwt ) { |
---|
| 316 | // if this function is a user-defined constructor or destructor, mark down the type as "managed" |
---|
| 317 | if ( ! dwt->linkage.is_overrideable && CodeGen::isCtorDtor( dwt->name ) ) { |
---|
| 318 | auto & params = GenPoly::getFunctionType( dwt->get_type())->params; |
---|
| 319 | assert( ! params.empty() ); |
---|
| 320 | // Type * type = InitTweak::getPointerBase( params.front() ); |
---|
| 321 | // assert( type ); |
---|
| 322 | managedTypes.insert( Mangle::mangle( params.front(), {Mangle::NoOverrideable | Mangle::NoGenericParams | Mangle::Type} ) ); |
---|
| 323 | } |
---|
| 324 | } |
---|
| 325 | |
---|
| 326 | void ManagedTypes_new::handleStruct( const ast::StructDecl * aggregateDecl ) { |
---|
| 327 | // don't construct members, but need to take note if there is a managed member, |
---|
| 328 | // because that means that this type is also managed |
---|
| 329 | for ( auto & member : aggregateDecl->members ) { |
---|
| 330 | if ( auto field = member.as<ast::ObjectDecl>() ) { |
---|
| 331 | if ( isManaged( field ) ) { |
---|
| 332 | // generic parameters should not play a role in determining whether a generic type is constructed - construct all generic types, so that |
---|
| 333 | // polymorphic constructors make generic types managed types |
---|
| 334 | ast::StructInstType inst( aggregateDecl ); |
---|
| 335 | managedTypes.insert( Mangle::mangle( &inst, {Mangle::NoOverrideable | Mangle::NoGenericParams | Mangle::Type} ) ); |
---|
| 336 | break; |
---|
| 337 | } |
---|
| 338 | } |
---|
| 339 | } |
---|
| 340 | } |
---|
| 341 | |
---|
| 342 | void ManagedTypes_new::beginScope() { managedTypes.beginScope(); } |
---|
| 343 | void ManagedTypes_new::endScope() { managedTypes.endScope(); } |
---|
| 344 | |
---|
[092528b] | 345 | ImplicitCtorDtorStmt * genCtorDtor( const std::string & fname, ObjectDecl * objDecl, Expression * arg ) { |
---|
| 346 | // call into genImplicitCall from Autogen.h to generate calls to ctor/dtor |
---|
| 347 | assertf( objDecl, "genCtorDtor passed null objDecl" ); |
---|
| 348 | std::list< Statement * > stmts; |
---|
[b8524ca] | 349 | InitExpander_old srcParam( maybeClone( arg ) ); |
---|
[092528b] | 350 | SymTab::genImplicitCall( srcParam, new VariableExpr( objDecl ), fname, back_inserter( stmts ), objDecl ); |
---|
| 351 | assert( stmts.size() <= 1 ); |
---|
[e3e16bc] | 352 | return stmts.size() == 1 ? strict_dynamic_cast< ImplicitCtorDtorStmt * >( stmts.front() ) : nullptr; |
---|
[490fb92e] | 353 | |
---|
| 354 | } |
---|
| 355 | |
---|
| 356 | ast::ptr<ast::Stmt> genCtorDtor (const CodeLocation & loc, const std::string & fname, const ast::ObjectDecl * objDecl, const ast::Expr * arg) { |
---|
| 357 | assertf(objDecl, "genCtorDtor passed null objDecl"); |
---|
| 358 | InitExpander_new srcParam(arg); |
---|
| 359 | return SymTab::genImplicitCall(srcParam, new ast::VariableExpr(loc, objDecl), loc, fname, objDecl); |
---|
[092528b] | 360 | } |
---|
| 361 | |
---|
[f0121d7] | 362 | ConstructorInit * genCtorInit( ObjectDecl * objDecl ) { |
---|
| 363 | // call into genImplicitCall from Autogen.h to generate calls to ctor/dtor |
---|
| 364 | // for each constructable object |
---|
| 365 | std::list< Statement * > ctor; |
---|
| 366 | std::list< Statement * > dtor; |
---|
| 367 | |
---|
[b8524ca] | 368 | InitExpander_old srcParam( objDecl->get_init() ); |
---|
| 369 | InitExpander_old nullParam( (Initializer *)NULL ); |
---|
[f0121d7] | 370 | SymTab::genImplicitCall( srcParam, new VariableExpr( objDecl ), "?{}", back_inserter( ctor ), objDecl ); |
---|
| 371 | SymTab::genImplicitCall( nullParam, new VariableExpr( objDecl ), "^?{}", front_inserter( dtor ), objDecl, false ); |
---|
| 372 | |
---|
| 373 | // Currently genImplicitCall produces a single Statement - a CompoundStmt |
---|
| 374 | // which wraps everything that needs to happen. As such, it's technically |
---|
| 375 | // possible to use a Statement ** in the above calls, but this is inherently |
---|
| 376 | // unsafe, so instead we take the slightly less efficient route, but will be |
---|
| 377 | // immediately informed if somehow the above assumption is broken. In this case, |
---|
| 378 | // we could always wrap the list of statements at this point with a CompoundStmt, |
---|
| 379 | // but it seems reasonable at the moment for this to be done by genImplicitCall |
---|
| 380 | // itself. It is possible that genImplicitCall produces no statements (e.g. if |
---|
| 381 | // an array type does not have a dimension). In this case, it's fine to ignore |
---|
| 382 | // the object for the purposes of construction. |
---|
| 383 | assert( ctor.size() == dtor.size() && ctor.size() <= 1 ); |
---|
| 384 | if ( ctor.size() == 1 ) { |
---|
| 385 | // need to remember init expression, in case no ctors exist |
---|
| 386 | // if ctor does exist, want to use ctor expression instead of init |
---|
| 387 | // push this decision to the resolver |
---|
| 388 | assert( dynamic_cast< ImplicitCtorDtorStmt * > ( ctor.front() ) && dynamic_cast< ImplicitCtorDtorStmt * > ( dtor.front() ) ); |
---|
| 389 | return new ConstructorInit( ctor.front(), dtor.front(), objDecl->get_init() ); |
---|
| 390 | } |
---|
| 391 | return nullptr; |
---|
| 392 | } |
---|
| 393 | |
---|
[d24d4e1] | 394 | void CtorDtor::previsit( ObjectDecl * objDecl ) { |
---|
[bfd4974] | 395 | managedTypes.handleDWT( objDecl ); |
---|
[1ba88a0] | 396 | // hands off if @=, extern, builtin, etc. |
---|
[a4dd728] | 397 | // even if unmanaged, try to construct global or static if initializer is not constexpr, since this is not legal C |
---|
[bfd4974] | 398 | if ( tryConstruct( objDecl ) && ( managedTypes.isManaged( objDecl ) || ((! inFunction || objDecl->get_storageClasses().is_static ) && ! isConstExpr( objDecl->get_init() ) ) ) ) { |
---|
[1ba88a0] | 399 | // constructed objects cannot be designated |
---|
[a16764a6] | 400 | if ( isDesignated( objDecl->get_init() ) ) SemanticError( objDecl, "Cannot include designations in the initializer for a managed Object. If this is really what you want, then initialize with @=.\n" ); |
---|
[dcd73d1] | 401 | // constructed objects should not have initializers nested too deeply |
---|
[a16764a6] | 402 | if ( ! checkInitDepth( objDecl ) ) SemanticError( objDecl, "Managed object's initializer is too deep " ); |
---|
[1ba88a0] | 403 | |
---|
[f0121d7] | 404 | objDecl->set_init( genCtorInit( objDecl ) ); |
---|
[974906e2] | 405 | } |
---|
| 406 | } |
---|
| 407 | |
---|
[d24d4e1] | 408 | void CtorDtor::previsit( FunctionDecl *functionDecl ) { |
---|
[22bc276] | 409 | visit_children = false; // do not try and construct parameters or forall parameters |
---|
[d24d4e1] | 410 | GuardValue( inFunction ); |
---|
[1ba88a0] | 411 | inFunction = true; |
---|
| 412 | |
---|
[bfd4974] | 413 | managedTypes.handleDWT( functionDecl ); |
---|
[1ba88a0] | 414 | |
---|
[d24d4e1] | 415 | GuardScope( managedTypes ); |
---|
[1ba88a0] | 416 | // go through assertions and recursively add seen ctor/dtors |
---|
[8c49c0e] | 417 | for ( auto & tyDecl : functionDecl->get_functionType()->get_forall() ) { |
---|
[1ba88a0] | 418 | for ( DeclarationWithType *& assertion : tyDecl->get_assertions() ) { |
---|
[bfd4974] | 419 | managedTypes.handleDWT( assertion ); |
---|
[1ba88a0] | 420 | } |
---|
| 421 | } |
---|
| 422 | |
---|
[22bc276] | 423 | maybeAccept( functionDecl->get_statements(), *visitor ); |
---|
[02c7d04] | 424 | } |
---|
[1ba88a0] | 425 | |
---|
[d24d4e1] | 426 | void CtorDtor::previsit( StructDecl *aggregateDecl ) { |
---|
| 427 | visit_children = false; // do not try to construct and destruct aggregate members |
---|
| 428 | |
---|
[bfd4974] | 429 | managedTypes.handleStruct( aggregateDecl ); |
---|
[1ba88a0] | 430 | } |
---|
| 431 | |
---|
[22bc276] | 432 | void CtorDtor::previsit( CompoundStmt * ) { |
---|
[d24d4e1] | 433 | GuardScope( managedTypes ); |
---|
[1ba88a0] | 434 | } |
---|
[234b1cb] | 435 | |
---|
[b8524ca] | 436 | ast::ConstructorInit * genCtorInit( const CodeLocation & loc, const ast::ObjectDecl * objDecl ) { |
---|
| 437 | // call into genImplicitCall from Autogen.h to generate calls to ctor/dtor for each |
---|
| 438 | // constructable object |
---|
| 439 | InitExpander_new srcParam{ objDecl->init }, nullParam{ (const ast::Init *)nullptr }; |
---|
[16ba4a6f] | 440 | ast::ptr< ast::Expr > dstParam = new ast::VariableExpr(loc, objDecl); |
---|
[b8524ca] | 441 | |
---|
| 442 | ast::ptr< ast::Stmt > ctor = SymTab::genImplicitCall( |
---|
[16ba4a6f] | 443 | srcParam, dstParam, loc, "?{}", objDecl ); |
---|
[b8524ca] | 444 | ast::ptr< ast::Stmt > dtor = SymTab::genImplicitCall( |
---|
[16ba4a6f] | 445 | nullParam, dstParam, loc, "^?{}", objDecl, |
---|
[b8524ca] | 446 | SymTab::LoopBackward ); |
---|
| 447 | |
---|
| 448 | // check that either both ctor and dtor are present, or neither |
---|
| 449 | assert( (bool)ctor == (bool)dtor ); |
---|
| 450 | |
---|
| 451 | if ( ctor ) { |
---|
| 452 | // need to remember init expression, in case no ctors exist. If ctor does exist, want to |
---|
| 453 | // use ctor expression instead of init. |
---|
| 454 | ctor.strict_as< ast::ImplicitCtorDtorStmt >(); |
---|
| 455 | dtor.strict_as< ast::ImplicitCtorDtorStmt >(); |
---|
| 456 | |
---|
| 457 | return new ast::ConstructorInit{ loc, ctor, dtor, objDecl->init }; |
---|
| 458 | } |
---|
| 459 | |
---|
[234b1cb] | 460 | return nullptr; |
---|
| 461 | } |
---|
| 462 | |
---|
[42e2ad7] | 463 | } // namespace InitTweak |
---|
| 464 | |
---|
[51587aa] | 465 | // Local Variables: // |
---|
| 466 | // tab-width: 4 // |
---|
| 467 | // mode: c++ // |
---|
| 468 | // compile-command: "make install" // |
---|
| 469 | // End: // |
---|