[b87a5ed] | 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 | // |
---|
[974906e2] | 7 | // DeclarationNode.cc -- |
---|
[b87a5ed] | 8 | // |
---|
| 9 | // Author : Rodolfo G. Esteves |
---|
| 10 | // Created On : Sat May 16 12:34:05 2015 |
---|
[b38f6da] | 11 | // Last Modified By : Peter A. Buhr |
---|
| 12 | // Last Modified On : Sat Jun 17 14:41:48 2023 |
---|
| 13 | // Update Count : 1405 |
---|
[b87a5ed] | 14 | // |
---|
| 15 | |
---|
[c468150] | 16 | #include "DeclarationNode.h" |
---|
| 17 | |
---|
[e3e16bc] | 18 | #include <cassert> // for assert, assertf, strict_dynamic_cast |
---|
[d180746] | 19 | #include <iterator> // for back_insert_iterator |
---|
| 20 | #include <list> // for list |
---|
| 21 | #include <memory> // for unique_ptr |
---|
| 22 | #include <ostream> // for operator<<, ostream, basic_ostream |
---|
| 23 | #include <string> // for string, operator+, allocator, char... |
---|
[51b7345] | 24 | |
---|
[bb7422a] | 25 | #include "AST/Attribute.hpp" // for Attribute |
---|
| 26 | #include "AST/Copy.hpp" // for shallowCopy |
---|
| 27 | #include "AST/Decl.hpp" // for Decl |
---|
| 28 | #include "AST/Expr.hpp" // for Expr |
---|
| 29 | #include "AST/Print.hpp" // for print |
---|
| 30 | #include "AST/Stmt.hpp" // for AsmStmt, DirectiveStmt |
---|
| 31 | #include "AST/StorageClasses.hpp" // for Storage::Class |
---|
| 32 | #include "AST/Type.hpp" // for Type |
---|
| 33 | #include "Common/CodeLocation.h" // for CodeLocation |
---|
| 34 | #include "Common/Iterate.hpp" // for reverseIterate |
---|
[d180746] | 35 | #include "Common/SemanticError.h" // for SemanticError |
---|
| 36 | #include "Common/UniqueName.h" // for UniqueName |
---|
[bb7422a] | 37 | #include "Common/utility.h" // for maybeClone |
---|
[c468150] | 38 | #include "Parser/ExpressionNode.h" // for ExpressionNode |
---|
| 39 | #include "Parser/InitializerNode.h"// for InitializerNode |
---|
| 40 | #include "Parser/StatementNode.h" // for StatementNode |
---|
[d180746] | 41 | #include "TypeData.h" // for TypeData, TypeData::Aggregate_t |
---|
[2f0a0678] | 42 | #include "TypedefTable.h" // for TypedefTable |
---|
[bdd516a] | 43 | |
---|
[d180746] | 44 | class Initializer; |
---|
[51b7345] | 45 | |
---|
[de62360d] | 46 | extern TypedefTable typedefTable; |
---|
| 47 | |
---|
[51b7345] | 48 | using namespace std; |
---|
| 49 | |
---|
[201aeb9] | 50 | // These must harmonize with the corresponding DeclarationNode enumerations. |
---|
[702e826] | 51 | const char * DeclarationNode::basicTypeNames[] = { |
---|
| 52 | "void", "_Bool", "char", "int", "int128", |
---|
| 53 | "float", "double", "long double", "float80", "float128", |
---|
| 54 | "_float16", "_float32", "_float32x", "_float64", "_float64x", "_float128", "_float128x", "NoBasicTypeNames" |
---|
| 55 | }; |
---|
| 56 | const char * DeclarationNode::complexTypeNames[] = { |
---|
| 57 | "_Complex", "NoComplexTypeNames", "_Imaginary" |
---|
| 58 | }; // Imaginary unsupported => parse, but make invisible and print error message |
---|
| 59 | const char * DeclarationNode::signednessNames[] = { |
---|
| 60 | "signed", "unsigned", "NoSignednessNames" |
---|
| 61 | }; |
---|
| 62 | const char * DeclarationNode::lengthNames[] = { |
---|
| 63 | "short", "long", "long long", "NoLengthNames" |
---|
| 64 | }; |
---|
| 65 | const char * DeclarationNode::builtinTypeNames[] = { |
---|
| 66 | "__builtin_va_list", "__auto_type", "zero_t", "one_t", "NoBuiltinTypeNames" |
---|
| 67 | }; |
---|
[51b7345] | 68 | |
---|
| 69 | UniqueName DeclarationNode::anonymous( "__anonymous" ); |
---|
| 70 | |
---|
[bb7422a] | 71 | extern ast::Linkage::Spec linkage; // defined in parser.yy |
---|
[51b7345] | 72 | |
---|
[7d05e7e] | 73 | DeclarationNode::DeclarationNode() : |
---|
[e07caa2] | 74 | linkage( ::linkage ) { |
---|
[2298f728] | 75 | |
---|
[faddbd8] | 76 | // variable.name = nullptr; |
---|
[bb7422a] | 77 | variable.tyClass = ast::TypeDecl::NUMBER_OF_KINDS; |
---|
[28307be] | 78 | variable.assertions = nullptr; |
---|
[67cf18c] | 79 | variable.initializer = nullptr; |
---|
[7d05e7e] | 80 | |
---|
[f6e3e34] | 81 | assert.condition = nullptr; |
---|
| 82 | assert.message = nullptr; |
---|
[28307be] | 83 | } |
---|
| 84 | |
---|
| 85 | DeclarationNode::~DeclarationNode() { |
---|
[faddbd8] | 86 | // delete variable.name; |
---|
[2298f728] | 87 | delete variable.assertions; |
---|
[67cf18c] | 88 | delete variable.initializer; |
---|
[2298f728] | 89 | |
---|
[702e826] | 90 | // delete type; |
---|
[28307be] | 91 | delete bitfieldWidth; |
---|
[e994912] | 92 | |
---|
| 93 | delete asmStmt; |
---|
[58dd019] | 94 | // asmName, no delete, passed to next stage |
---|
[28307be] | 95 | delete initializer; |
---|
[f6e3e34] | 96 | |
---|
| 97 | delete assert.condition; |
---|
| 98 | delete assert.message; |
---|
[28307be] | 99 | } |
---|
| 100 | |
---|
[ba7aa2d] | 101 | DeclarationNode * DeclarationNode::clone() const { |
---|
| 102 | DeclarationNode * newnode = new DeclarationNode; |
---|
[c0aa336] | 103 | newnode->set_next( maybeClone( get_next() ) ); |
---|
[2298f728] | 104 | newnode->name = name ? new string( *name ) : nullptr; |
---|
[c0aa336] | 105 | |
---|
[2e5fa345] | 106 | newnode->builtin = NoBuiltinType; |
---|
[c0aa336] | 107 | newnode->type = maybeClone( type ); |
---|
[679e644] | 108 | newnode->inLine = inLine; |
---|
[a7c90d4] | 109 | newnode->storageClasses = storageClasses; |
---|
| 110 | newnode->funcSpecs = funcSpecs; |
---|
[08d5507b] | 111 | newnode->bitfieldWidth = maybeClone( bitfieldWidth ); |
---|
[c0aa336] | 112 | newnode->enumeratorValue.reset( maybeClone( enumeratorValue.get() ) ); |
---|
[b87a5ed] | 113 | newnode->hasEllipsis = hasEllipsis; |
---|
| 114 | newnode->linkage = linkage; |
---|
[bb7422a] | 115 | newnode->asmName = maybeCopy( asmName ); |
---|
| 116 | newnode->attributes = attributes; |
---|
[c0aa336] | 117 | newnode->initializer = maybeClone( initializer ); |
---|
| 118 | newnode->extension = extension; |
---|
[e994912] | 119 | newnode->asmStmt = maybeClone( asmStmt ); |
---|
[c0aa336] | 120 | newnode->error = error; |
---|
[3848e0e] | 121 | |
---|
[faddbd8] | 122 | // newnode->variable.name = variable.name ? new string( *variable.name ) : nullptr; |
---|
[28307be] | 123 | newnode->variable.tyClass = variable.tyClass; |
---|
[fb114fa1] | 124 | newnode->variable.assertions = maybeClone( variable.assertions ); |
---|
[67cf18c] | 125 | newnode->variable.initializer = maybeClone( variable.initializer ); |
---|
[3848e0e] | 126 | |
---|
[f6e3e34] | 127 | newnode->assert.condition = maybeClone( assert.condition ); |
---|
[bb7422a] | 128 | newnode->assert.message = maybeCopy( assert.message ); |
---|
[28307be] | 129 | return newnode; |
---|
| 130 | } // DeclarationNode::clone |
---|
[3848e0e] | 131 | |
---|
[f2f512ba] | 132 | void DeclarationNode::print( std::ostream & os, int indent ) const { |
---|
[59db689] | 133 | os << string( indent, ' ' ); |
---|
[2298f728] | 134 | if ( name ) { |
---|
| 135 | os << *name << ": "; |
---|
[68cd1ce] | 136 | } // if |
---|
[51b7345] | 137 | |
---|
[bb7422a] | 138 | if ( linkage != ast::Linkage::Cforall ) { |
---|
| 139 | os << ast::Linkage::name( linkage ) << " "; |
---|
[68cd1ce] | 140 | } // if |
---|
[3848e0e] | 141 | |
---|
[bb7422a] | 142 | ast::print( os, storageClasses ); |
---|
| 143 | ast::print( os, funcSpecs ); |
---|
[dd020c0] | 144 | |
---|
[b87a5ed] | 145 | if ( type ) { |
---|
| 146 | type->print( os, indent ); |
---|
| 147 | } else { |
---|
| 148 | os << "untyped entity "; |
---|
[68cd1ce] | 149 | } // if |
---|
[3848e0e] | 150 | |
---|
[b87a5ed] | 151 | if ( bitfieldWidth ) { |
---|
[59db689] | 152 | os << endl << string( indent + 2, ' ' ) << "with bitfield width "; |
---|
[b87a5ed] | 153 | bitfieldWidth->printOneLine( os ); |
---|
[68cd1ce] | 154 | } // if |
---|
[3848e0e] | 155 | |
---|
[2298f728] | 156 | if ( initializer ) { |
---|
[59db689] | 157 | os << endl << string( indent + 2, ' ' ) << "with initializer "; |
---|
[b87a5ed] | 158 | initializer->printOneLine( os ); |
---|
[974906e2] | 159 | os << " maybe constructed? " << initializer->get_maybeConstructed(); |
---|
[68cd1ce] | 160 | } // if |
---|
[3848e0e] | 161 | |
---|
[692c1cc] | 162 | if ( ! attributes.empty() ) { |
---|
| 163 | os << string( indent + 2, ' ' ) << "with attributes " << endl; |
---|
[bb7422a] | 164 | for ( ast::ptr<ast::Attribute> const & attr : reverseIterate( attributes ) ) { |
---|
[692c1cc] | 165 | os << string( indent + 4, ' ' ) << attr->name.c_str() << endl; |
---|
| 166 | } // for |
---|
| 167 | } // if |
---|
[66406f3] | 168 | |
---|
[b87a5ed] | 169 | os << endl; |
---|
[51b7345] | 170 | } |
---|
| 171 | |
---|
[f2f512ba] | 172 | void DeclarationNode::printList( std::ostream & os, int indent ) const { |
---|
[b87a5ed] | 173 | ParseNode::printList( os, indent ); |
---|
| 174 | if ( hasEllipsis ) { |
---|
| 175 | os << string( indent, ' ' ) << "and a variable number of other arguments" << endl; |
---|
[68cd1ce] | 176 | } // if |
---|
[51b7345] | 177 | } |
---|
| 178 | |
---|
[bb7422a] | 179 | DeclarationNode * DeclarationNode::newStorageClass( ast::Storage::Classes sc ) { |
---|
[ba7aa2d] | 180 | DeclarationNode * newnode = new DeclarationNode; |
---|
[08d5507b] | 181 | newnode->storageClasses = sc; |
---|
[b87a5ed] | 182 | return newnode; |
---|
[dd020c0] | 183 | } // DeclarationNode::newStorageClass |
---|
[3848e0e] | 184 | |
---|
[bb7422a] | 185 | DeclarationNode * DeclarationNode::newFuncSpecifier( ast::Function::Specs fs ) { |
---|
[ba7aa2d] | 186 | DeclarationNode * newnode = new DeclarationNode; |
---|
[08d5507b] | 187 | newnode->funcSpecs = fs; |
---|
[c1c1112] | 188 | return newnode; |
---|
[dd020c0] | 189 | } // DeclarationNode::newFuncSpecifier |
---|
[c1c1112] | 190 | |
---|
[bb7422a] | 191 | DeclarationNode * DeclarationNode::newTypeQualifier( ast::CV::Qualifiers tq ) { |
---|
[ba7aa2d] | 192 | DeclarationNode * newnode = new DeclarationNode; |
---|
[dd020c0] | 193 | newnode->type = new TypeData(); |
---|
[738e304] | 194 | newnode->type->qualifiers = tq; |
---|
[b87a5ed] | 195 | return newnode; |
---|
[dd020c0] | 196 | } // DeclarationNode::newQualifier |
---|
[3848e0e] | 197 | |
---|
[c1c1112] | 198 | DeclarationNode * DeclarationNode::newBasicType( BasicType bt ) { |
---|
[ba7aa2d] | 199 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 200 | newnode->type = new TypeData( TypeData::Basic ); |
---|
[5b639ee] | 201 | newnode->type->basictype = bt; |
---|
[b87a5ed] | 202 | return newnode; |
---|
[984dce6] | 203 | } // DeclarationNode::newBasicType |
---|
[3848e0e] | 204 | |
---|
[5b639ee] | 205 | DeclarationNode * DeclarationNode::newComplexType( ComplexType ct ) { |
---|
[ba7aa2d] | 206 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 207 | newnode->type = new TypeData( TypeData::Basic ); |
---|
[5b639ee] | 208 | newnode->type->complextype = ct; |
---|
[b87a5ed] | 209 | return newnode; |
---|
[5b639ee] | 210 | } // DeclarationNode::newComplexType |
---|
| 211 | |
---|
| 212 | DeclarationNode * DeclarationNode::newSignedNess( Signedness sn ) { |
---|
[ba7aa2d] | 213 | DeclarationNode * newnode = new DeclarationNode; |
---|
[5b639ee] | 214 | newnode->type = new TypeData( TypeData::Basic ); |
---|
| 215 | newnode->type->signedness = sn; |
---|
| 216 | return newnode; |
---|
| 217 | } // DeclarationNode::newSignedNess |
---|
| 218 | |
---|
| 219 | DeclarationNode * DeclarationNode::newLength( Length lnth ) { |
---|
[ba7aa2d] | 220 | DeclarationNode * newnode = new DeclarationNode; |
---|
[5b639ee] | 221 | newnode->type = new TypeData( TypeData::Basic ); |
---|
| 222 | newnode->type->length = lnth; |
---|
| 223 | return newnode; |
---|
| 224 | } // DeclarationNode::newLength |
---|
[3848e0e] | 225 | |
---|
[dd020c0] | 226 | DeclarationNode * DeclarationNode::newForall( DeclarationNode * forall ) { |
---|
| 227 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 228 | newnode->type = new TypeData( TypeData::Unknown ); |
---|
| 229 | newnode->type->forall = forall; |
---|
| 230 | return newnode; |
---|
| 231 | } // DeclarationNode::newForall |
---|
| 232 | |
---|
[47498bd] | 233 | DeclarationNode * DeclarationNode::newFromGlobalScope() { |
---|
| 234 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 235 | newnode->type = new TypeData( TypeData::GlobalScope ); |
---|
| 236 | return newnode; |
---|
| 237 | } |
---|
| 238 | |
---|
[c5d7701] | 239 | DeclarationNode * DeclarationNode::newQualifiedType( DeclarationNode * parent, DeclarationNode * child) { |
---|
[c194661] | 240 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 241 | newnode->type = new TypeData( TypeData::Qualified ); |
---|
| 242 | newnode->type->qualified.parent = parent->type; |
---|
| 243 | newnode->type->qualified.child = child->type; |
---|
| 244 | parent->type = nullptr; |
---|
| 245 | child->type = nullptr; |
---|
| 246 | delete parent; |
---|
| 247 | delete child; |
---|
| 248 | return newnode; |
---|
[c5d7701] | 249 | } |
---|
| 250 | |
---|
[bb7422a] | 251 | DeclarationNode * DeclarationNode::newAggregate( ast::AggregateDecl::Aggregate kind, const string * name, ExpressionNode * actuals, DeclarationNode * fields, bool body ) { |
---|
[ba7aa2d] | 252 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 253 | newnode->type = new TypeData( TypeData::Aggregate ); |
---|
[8f6f47d7] | 254 | newnode->type->aggregate.kind = kind; |
---|
[692c1cc] | 255 | newnode->type->aggregate.anon = name == nullptr; |
---|
| 256 | newnode->type->aggregate.name = newnode->type->aggregate.anon ? new string( DeclarationNode::anonymous.newName() ) : name; |
---|
[8f6f47d7] | 257 | newnode->type->aggregate.actuals = actuals; |
---|
| 258 | newnode->type->aggregate.fields = fields; |
---|
| 259 | newnode->type->aggregate.body = body; |
---|
[6ea87486] | 260 | newnode->type->aggregate.tagged = false; |
---|
| 261 | newnode->type->aggregate.parent = nullptr; |
---|
[b87a5ed] | 262 | return newnode; |
---|
[984dce6] | 263 | } // DeclarationNode::newAggregate |
---|
[3848e0e] | 264 | |
---|
[e4d7c1c] | 265 | DeclarationNode * DeclarationNode::newEnum( const string * name, DeclarationNode * constants, bool body, bool typed, DeclarationNode * base, EnumHiding hiding ) { |
---|
[ba7aa2d] | 266 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 267 | newnode->type = new TypeData( TypeData::Enum ); |
---|
[692c1cc] | 268 | newnode->type->enumeration.anon = name == nullptr; |
---|
| 269 | newnode->type->enumeration.name = newnode->type->enumeration.anon ? new string( DeclarationNode::anonymous.newName() ) : name; |
---|
[8f6f47d7] | 270 | newnode->type->enumeration.constants = constants; |
---|
[ca1a547] | 271 | newnode->type->enumeration.body = body; |
---|
[b0d9ff7] | 272 | newnode->type->enumeration.typed = typed; |
---|
[e4d7c1c] | 273 | newnode->type->enumeration.hiding = hiding; |
---|
[78e2fca] | 274 | if ( base && base->type ) { |
---|
[ed9a1ae] | 275 | newnode->type->base = base->type; |
---|
[9e7236f4] | 276 | } // if |
---|
| 277 | |
---|
[b87a5ed] | 278 | return newnode; |
---|
[984dce6] | 279 | } // DeclarationNode::newEnum |
---|
[3848e0e] | 280 | |
---|
[a46b69c] | 281 | DeclarationNode * DeclarationNode::newName( const string * name ) { |
---|
[ba7aa2d] | 282 | DeclarationNode * newnode = new DeclarationNode; |
---|
[a46b69c] | 283 | assert( ! newnode->name ); |
---|
[2298f728] | 284 | newnode->name = name; |
---|
[a46b69c] | 285 | return newnode; |
---|
| 286 | } // DeclarationNode::newName |
---|
| 287 | |
---|
[374cb117] | 288 | DeclarationNode * DeclarationNode::newEnumConstant( const string * name, ExpressionNode * constant ) { |
---|
[a46b69c] | 289 | DeclarationNode * newnode = newName( name ); |
---|
[4f147cc] | 290 | newnode->enumeratorValue.reset( constant ); |
---|
[b87a5ed] | 291 | return newnode; |
---|
[984dce6] | 292 | } // DeclarationNode::newEnumConstant |
---|
[3848e0e] | 293 | |
---|
[374cb117] | 294 | DeclarationNode * DeclarationNode::newEnumValueGeneric( const string * name, InitializerNode * init ) { |
---|
[b0d9ff7] | 295 | if ( init ) { |
---|
| 296 | if ( init->get_expression() ) { |
---|
[374cb117] | 297 | return newEnumConstant( name, init->get_expression() ); |
---|
[b0d9ff7] | 298 | } else { |
---|
[374cb117] | 299 | DeclarationNode * newnode = newName( name ); |
---|
| 300 | newnode->initializer = init; |
---|
| 301 | return newnode; |
---|
| 302 | } // if |
---|
| 303 | } else { |
---|
[b0d9ff7] | 304 | return newName( name ); |
---|
[374cb117] | 305 | } // if |
---|
[9e7236f4] | 306 | } // DeclarationNode::newEnumValueGeneric |
---|
[374cb117] | 307 | |
---|
[1e30df7] | 308 | DeclarationNode * DeclarationNode::newEnumInLine( const string name ) { |
---|
| 309 | DeclarationNode * newnode = newName( new std::string(name) ); |
---|
| 310 | newnode->enumInLine = true; |
---|
| 311 | return newnode; |
---|
| 312 | } |
---|
| 313 | |
---|
[a46b69c] | 314 | DeclarationNode * DeclarationNode::newFromTypedef( const string * name ) { |
---|
[ba7aa2d] | 315 | DeclarationNode * newnode = new DeclarationNode; |
---|
[a46b69c] | 316 | newnode->type = new TypeData( TypeData::SymbolicInst ); |
---|
| 317 | newnode->type->symbolic.name = name; |
---|
| 318 | newnode->type->symbolic.isTypedef = true; |
---|
| 319 | newnode->type->symbolic.params = nullptr; |
---|
[b87a5ed] | 320 | return newnode; |
---|
[a46b69c] | 321 | } // DeclarationNode::newFromTypedef |
---|
[3848e0e] | 322 | |
---|
[25bca42] | 323 | DeclarationNode * DeclarationNode::newFromTypeGen( const string * name, ExpressionNode * params ) { |
---|
[ba7aa2d] | 324 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 325 | newnode->type = new TypeData( TypeData::SymbolicInst ); |
---|
[fb114fa1] | 326 | newnode->type->symbolic.name = name; |
---|
[8f6f47d7] | 327 | newnode->type->symbolic.isTypedef = false; |
---|
| 328 | newnode->type->symbolic.actuals = params; |
---|
[b87a5ed] | 329 | return newnode; |
---|
[984dce6] | 330 | } // DeclarationNode::newFromTypeGen |
---|
[3848e0e] | 331 | |
---|
[bb7422a] | 332 | DeclarationNode * DeclarationNode::newTypeParam( ast::TypeDecl::Kind tc, const string * name ) { |
---|
[a46b69c] | 333 | DeclarationNode * newnode = newName( name ); |
---|
[2298f728] | 334 | newnode->type = nullptr; |
---|
[28307be] | 335 | newnode->variable.tyClass = tc; |
---|
[faddbd8] | 336 | newnode->variable.assertions = nullptr; |
---|
[b87a5ed] | 337 | return newnode; |
---|
[984dce6] | 338 | } // DeclarationNode::newTypeParam |
---|
[3848e0e] | 339 | |
---|
[fb114fa1] | 340 | DeclarationNode * DeclarationNode::newTrait( const string * name, DeclarationNode * params, DeclarationNode * asserts ) { |
---|
[ba7aa2d] | 341 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 342 | newnode->type = new TypeData( TypeData::Aggregate ); |
---|
[2298f728] | 343 | newnode->type->aggregate.name = name; |
---|
[bb7422a] | 344 | newnode->type->aggregate.kind = ast::AggregateDecl::Trait; |
---|
[8f6f47d7] | 345 | newnode->type->aggregate.params = params; |
---|
| 346 | newnode->type->aggregate.fields = asserts; |
---|
[b87a5ed] | 347 | return newnode; |
---|
[984dce6] | 348 | } // DeclarationNode::newTrait |
---|
[3848e0e] | 349 | |
---|
[fb114fa1] | 350 | DeclarationNode * DeclarationNode::newTraitUse( const string * name, ExpressionNode * params ) { |
---|
[ba7aa2d] | 351 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 352 | newnode->type = new TypeData( TypeData::AggregateInst ); |
---|
[8f6f47d7] | 353 | newnode->type->aggInst.aggregate = new TypeData( TypeData::Aggregate ); |
---|
[bb7422a] | 354 | newnode->type->aggInst.aggregate->aggregate.kind = ast::AggregateDecl::Trait; |
---|
[2298f728] | 355 | newnode->type->aggInst.aggregate->aggregate.name = name; |
---|
[8f6f47d7] | 356 | newnode->type->aggInst.params = params; |
---|
[b87a5ed] | 357 | return newnode; |
---|
[984dce6] | 358 | } // DeclarationNode::newTraitUse |
---|
[3848e0e] | 359 | |
---|
[25bca42] | 360 | DeclarationNode * DeclarationNode::newTypeDecl( const string * name, DeclarationNode * typeParams ) { |
---|
[a46b69c] | 361 | DeclarationNode * newnode = newName( name ); |
---|
[b87a5ed] | 362 | newnode->type = new TypeData( TypeData::Symbolic ); |
---|
[8f6f47d7] | 363 | newnode->type->symbolic.isTypedef = false; |
---|
| 364 | newnode->type->symbolic.params = typeParams; |
---|
[b87a5ed] | 365 | return newnode; |
---|
[984dce6] | 366 | } // DeclarationNode::newTypeDecl |
---|
[3848e0e] | 367 | |
---|
[ce8c12f] | 368 | DeclarationNode * DeclarationNode::newPointer( DeclarationNode * qualifiers, OperKinds kind ) { |
---|
[ba7aa2d] | 369 | DeclarationNode * newnode = new DeclarationNode; |
---|
[ce8c12f] | 370 | newnode->type = new TypeData( kind == OperKinds::PointTo ? TypeData::Pointer : TypeData::Reference ); |
---|
[71d0eab] | 371 | if ( kind == OperKinds::And ) { |
---|
| 372 | // T && is parsed as 'And' operator rather than two references => add a second reference type |
---|
| 373 | TypeData * td = new TypeData( TypeData::Reference ); |
---|
| 374 | td->base = newnode->type; |
---|
| 375 | newnode->type = td; |
---|
| 376 | } |
---|
[c3396e0] | 377 | if ( qualifiers ) { |
---|
| 378 | return newnode->addQualifiers( qualifiers ); |
---|
| 379 | } else { |
---|
| 380 | return newnode; |
---|
| 381 | } // if |
---|
[984dce6] | 382 | } // DeclarationNode::newPointer |
---|
[3848e0e] | 383 | |
---|
[ba7aa2d] | 384 | DeclarationNode * DeclarationNode::newArray( ExpressionNode * size, DeclarationNode * qualifiers, bool isStatic ) { |
---|
| 385 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 386 | newnode->type = new TypeData( TypeData::Array ); |
---|
[8f6f47d7] | 387 | newnode->type->array.dimension = size; |
---|
| 388 | newnode->type->array.isStatic = isStatic; |
---|
[bb7422a] | 389 | if ( newnode->type->array.dimension == nullptr || newnode->type->array.dimension->isExpressionType<ast::ConstantExpr *>() ) { |
---|
[8f6f47d7] | 390 | newnode->type->array.isVarLen = false; |
---|
[71bd8c6] | 391 | } else { |
---|
[8f6f47d7] | 392 | newnode->type->array.isVarLen = true; |
---|
[71bd8c6] | 393 | } // if |
---|
[b87a5ed] | 394 | return newnode->addQualifiers( qualifiers ); |
---|
[984dce6] | 395 | } // DeclarationNode::newArray |
---|
[3848e0e] | 396 | |
---|
[ba7aa2d] | 397 | DeclarationNode * DeclarationNode::newVarArray( DeclarationNode * qualifiers ) { |
---|
| 398 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 399 | newnode->type = new TypeData( TypeData::Array ); |
---|
[2298f728] | 400 | newnode->type->array.dimension = nullptr; |
---|
[8f6f47d7] | 401 | newnode->type->array.isStatic = false; |
---|
| 402 | newnode->type->array.isVarLen = true; |
---|
[b87a5ed] | 403 | return newnode->addQualifiers( qualifiers ); |
---|
[3848e0e] | 404 | } |
---|
| 405 | |
---|
[ba7aa2d] | 406 | DeclarationNode * DeclarationNode::newBitfield( ExpressionNode * size ) { |
---|
| 407 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 408 | newnode->bitfieldWidth = size; |
---|
| 409 | return newnode; |
---|
[3848e0e] | 410 | } |
---|
| 411 | |
---|
[ba7aa2d] | 412 | DeclarationNode * DeclarationNode::newTuple( DeclarationNode * members ) { |
---|
| 413 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 414 | newnode->type = new TypeData( TypeData::Tuple ); |
---|
[8f6f47d7] | 415 | newnode->type->tuple = members; |
---|
[b87a5ed] | 416 | return newnode; |
---|
[3848e0e] | 417 | } |
---|
| 418 | |
---|
[f855545] | 419 | DeclarationNode * DeclarationNode::newTypeof( ExpressionNode * expr, bool basetypeof ) { |
---|
[ba7aa2d] | 420 | DeclarationNode * newnode = new DeclarationNode; |
---|
[f855545] | 421 | newnode->type = new TypeData( basetypeof ? TypeData::Basetypeof : TypeData::Typeof ); |
---|
[8f6f47d7] | 422 | newnode->type->typeexpr = expr; |
---|
[b87a5ed] | 423 | return newnode; |
---|
[3848e0e] | 424 | } |
---|
| 425 | |
---|
[93bbbc4] | 426 | DeclarationNode * DeclarationNode::newVtableType( DeclarationNode * decl ) { |
---|
| 427 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 428 | newnode->type = new TypeData( TypeData::Vtable ); |
---|
| 429 | newnode->setBase( decl->type ); |
---|
| 430 | return newnode; |
---|
| 431 | } |
---|
| 432 | |
---|
[8f6f47d7] | 433 | DeclarationNode * DeclarationNode::newBuiltinType( BuiltinType bt ) { |
---|
[ba7aa2d] | 434 | DeclarationNode * newnode = new DeclarationNode; |
---|
[8f6f47d7] | 435 | newnode->type = new TypeData( TypeData::Builtin ); |
---|
| 436 | newnode->builtin = bt; |
---|
[148f7290] | 437 | newnode->type->builtintype = newnode->builtin; |
---|
[8f6f47d7] | 438 | return newnode; |
---|
| 439 | } // DeclarationNode::newBuiltinType |
---|
| 440 | |
---|
[a46b69c] | 441 | DeclarationNode * DeclarationNode::newFunction( const string * name, DeclarationNode * ret, DeclarationNode * param, StatementNode * body ) { |
---|
| 442 | DeclarationNode * newnode = newName( name ); |
---|
| 443 | newnode->type = new TypeData( TypeData::Function ); |
---|
| 444 | newnode->type->function.params = param; |
---|
| 445 | newnode->type->function.body = body; |
---|
| 446 | |
---|
| 447 | if ( ret ) { |
---|
| 448 | newnode->type->base = ret->type; |
---|
| 449 | ret->type = nullptr; |
---|
| 450 | delete ret; |
---|
| 451 | } // if |
---|
| 452 | |
---|
| 453 | return newnode; |
---|
| 454 | } // DeclarationNode::newFunction |
---|
| 455 | |
---|
[25bca42] | 456 | DeclarationNode * DeclarationNode::newAttribute( const string * name, ExpressionNode * expr ) { |
---|
[44a81853] | 457 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 458 | newnode->type = nullptr; |
---|
[bb7422a] | 459 | std::vector<ast::ptr<ast::Expr>> exprs; |
---|
[44a81853] | 460 | buildList( expr, exprs ); |
---|
[b38f6da] | 461 | newnode->attributes.push_back( new ast::Attribute( *name, std::move( exprs ) ) ); |
---|
[44a81853] | 462 | delete name; |
---|
| 463 | return newnode; |
---|
| 464 | } |
---|
| 465 | |
---|
[2d019af] | 466 | DeclarationNode * DeclarationNode::newDirectiveStmt( StatementNode * stmt ) { |
---|
| 467 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 468 | newnode->directiveStmt = stmt; |
---|
| 469 | return newnode; |
---|
| 470 | } |
---|
| 471 | |
---|
[e994912] | 472 | DeclarationNode * DeclarationNode::newAsmStmt( StatementNode * stmt ) { |
---|
| 473 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 474 | newnode->asmStmt = stmt; |
---|
| 475 | return newnode; |
---|
| 476 | } |
---|
| 477 | |
---|
[bb7422a] | 478 | DeclarationNode * DeclarationNode::newStaticAssert( ExpressionNode * condition, ast::Expr * message ) { |
---|
[f6e3e34] | 479 | DeclarationNode * newnode = new DeclarationNode; |
---|
| 480 | newnode->assert.condition = condition; |
---|
| 481 | newnode->assert.message = message; |
---|
| 482 | return newnode; |
---|
| 483 | } |
---|
| 484 | |
---|
[bb7422a] | 485 | static void appendError( string & dst, const string & src ) { |
---|
[5b639ee] | 486 | if ( src.empty() ) return; |
---|
| 487 | if ( dst.empty() ) { dst = src; return; } |
---|
| 488 | dst += ", " + src; |
---|
| 489 | } // appendError |
---|
| 490 | |
---|
[ba7aa2d] | 491 | void DeclarationNode::checkQualifiers( const TypeData * src, const TypeData * dst ) { |
---|
[bb7422a] | 492 | const ast::CV::Qualifiers qsrc = src->qualifiers, qdst = dst->qualifiers; // optimization |
---|
| 493 | const ast::CV::Qualifiers duplicates = qsrc & qdst; |
---|
| 494 | |
---|
| 495 | if ( duplicates.any() ) { |
---|
| 496 | std::stringstream str; |
---|
| 497 | str << "duplicate "; |
---|
| 498 | ast::print( str, duplicates ); |
---|
| 499 | str << "qualifier(s)"; |
---|
| 500 | appendError( error, str.str() ); |
---|
[a7c90d4] | 501 | } // for |
---|
[c1c1112] | 502 | } // DeclarationNode::checkQualifiers |
---|
| 503 | |
---|
[a7c90d4] | 504 | void DeclarationNode::checkSpecifiers( DeclarationNode * src ) { |
---|
[bb7422a] | 505 | ast::Function::Specs fsDups = funcSpecs & src->funcSpecs; |
---|
| 506 | if ( fsDups.any() ) { |
---|
| 507 | std::stringstream str; |
---|
| 508 | str << "duplicate "; |
---|
| 509 | ast::print( str, fsDups ); |
---|
| 510 | str << "function specifier(s)"; |
---|
| 511 | appendError( error, str.str() ); |
---|
[dd020c0] | 512 | } // if |
---|
| 513 | |
---|
[bb7422a] | 514 | // Skip if everything is unset. |
---|
| 515 | if ( storageClasses.any() && src->storageClasses.any() ) { |
---|
| 516 | ast::Storage::Classes dups = storageClasses & src->storageClasses; |
---|
| 517 | // Check for duplicates. |
---|
| 518 | if ( dups.any() ) { |
---|
| 519 | std::stringstream str; |
---|
| 520 | str << "duplicate "; |
---|
| 521 | ast::print( str, dups ); |
---|
| 522 | str << "storage class(es)"; |
---|
| 523 | appendError( error, str.str() ); |
---|
| 524 | // Check for conflicts. |
---|
| 525 | } else if ( !src->storageClasses.is_threadlocal_any() ) { |
---|
| 526 | std::stringstream str; |
---|
| 527 | str << "conflicting "; |
---|
| 528 | ast::print( str, ast::Storage::Classes( 1 << storageClasses.ffs() ) ); |
---|
| 529 | str << "& "; |
---|
| 530 | ast::print( str, ast::Storage::Classes( 1 << src->storageClasses.ffs() ) ); |
---|
| 531 | str << "storage classes"; |
---|
| 532 | appendError( error, str.str() ); |
---|
| 533 | // FIX to preserve invariant of one basic storage specifier |
---|
| 534 | src->storageClasses.reset(); |
---|
| 535 | } |
---|
[b6424d9] | 536 | } // if |
---|
[dd020c0] | 537 | |
---|
[a7c90d4] | 538 | appendError( error, src->error ); |
---|
| 539 | } // DeclarationNode::checkSpecifiers |
---|
[b6424d9] | 540 | |
---|
[a7c90d4] | 541 | DeclarationNode * DeclarationNode::copySpecifiers( DeclarationNode * q ) { |
---|
[6f95000] | 542 | funcSpecs |= q->funcSpecs; |
---|
| 543 | storageClasses |= q->storageClasses; |
---|
[c0aa336] | 544 | |
---|
[bb7422a] | 545 | std::vector<ast::ptr<ast::Attribute>> tmp; |
---|
| 546 | tmp.reserve( q->attributes.size() ); |
---|
| 547 | for ( auto const & attr : q->attributes ) { |
---|
| 548 | tmp.emplace_back( ast::shallowCopy( attr.get() ) ); |
---|
| 549 | } |
---|
| 550 | spliceBegin( attributes, tmp ); |
---|
| 551 | |
---|
[b6424d9] | 552 | return this; |
---|
[a7c90d4] | 553 | } // DeclarationNode::copySpecifiers |
---|
[b6424d9] | 554 | |
---|
[f2f512ba] | 555 | static void addQualifiersToType( TypeData *& src, TypeData * dst ) { |
---|
[101e0bd] | 556 | if ( dst->base ) { |
---|
| 557 | addQualifiersToType( src, dst->base ); |
---|
| 558 | } else if ( dst->kind == TypeData::Function ) { |
---|
| 559 | dst->base = src; |
---|
[2298f728] | 560 | src = nullptr; |
---|
[101e0bd] | 561 | } else { |
---|
[6f95000] | 562 | dst->qualifiers |= src->qualifiers; |
---|
[101e0bd] | 563 | } // if |
---|
| 564 | } // addQualifiersToType |
---|
| 565 | |
---|
[ba7aa2d] | 566 | DeclarationNode * DeclarationNode::addQualifiers( DeclarationNode * q ) { |
---|
[af9da5f] | 567 | if ( ! q ) { return this; } // empty qualifier |
---|
[101e0bd] | 568 | |
---|
[a7c90d4] | 569 | checkSpecifiers( q ); |
---|
| 570 | copySpecifiers( q ); |
---|
[101e0bd] | 571 | |
---|
[c38ae92] | 572 | if ( ! q->type ) { delete q; return this; } |
---|
[101e0bd] | 573 | |
---|
| 574 | if ( ! type ) { |
---|
[c38ae92] | 575 | type = q->type; // reuse structure |
---|
[1b77274] | 576 | q->type = nullptr; |
---|
| 577 | delete q; |
---|
[101e0bd] | 578 | return this; |
---|
| 579 | } // if |
---|
| 580 | |
---|
[c38ae92] | 581 | if ( q->type->forall ) { // forall qualifier ? |
---|
| 582 | if ( type->forall ) { // polymorphic routine ? |
---|
| 583 | type->forall->appendList( q->type->forall ); // augment forall qualifier |
---|
[101e0bd] | 584 | } else { |
---|
[c38ae92] | 585 | if ( type->kind == TypeData::Aggregate ) { // struct/union ? |
---|
| 586 | if ( type->aggregate.params ) { // polymorphic ? |
---|
| 587 | type->aggregate.params->appendList( q->type->forall ); // augment forall qualifier |
---|
| 588 | } else { // not polymorphic |
---|
[a1c9ddd] | 589 | type->aggregate.params = q->type->forall; // set forall qualifier |
---|
[c38ae92] | 590 | } // if |
---|
| 591 | } else { // not polymorphic |
---|
| 592 | type->forall = q->type->forall; // make polymorphic routine |
---|
[68cd1ce] | 593 | } // if |
---|
| 594 | } // if |
---|
[c38ae92] | 595 | q->type->forall = nullptr; // forall qualifier moved |
---|
[68cd1ce] | 596 | } // if |
---|
[6ef2d81] | 597 | |
---|
[a7c90d4] | 598 | checkQualifiers( type, q->type ); |
---|
[78e2fca] | 599 | if ( (builtin == Zero || builtin == One) && q->type->qualifiers.any() && error.length() == 0 ) { |
---|
[be00a2d] | 600 | SemanticWarning( yylloc, Warning::BadQualifiersZeroOne, builtinTypeNames[builtin] ); |
---|
[9dc31c10] | 601 | } // if |
---|
[6ef2d81] | 602 | addQualifiersToType( q->type, type ); |
---|
| 603 | |
---|
[b87a5ed] | 604 | delete q; |
---|
| 605 | return this; |
---|
[101e0bd] | 606 | } // addQualifiers |
---|
[3848e0e] | 607 | |
---|
[f2f512ba] | 608 | static void addTypeToType( TypeData *& src, TypeData *& dst ) { |
---|
[101e0bd] | 609 | if ( src->forall && dst->kind == TypeData::Function ) { |
---|
| 610 | if ( dst->forall ) { |
---|
| 611 | dst->forall->appendList( src->forall ); |
---|
[b87a5ed] | 612 | } else { |
---|
[101e0bd] | 613 | dst->forall = src->forall; |
---|
| 614 | } // if |
---|
[2298f728] | 615 | src->forall = nullptr; |
---|
[101e0bd] | 616 | } // if |
---|
| 617 | if ( dst->base ) { |
---|
| 618 | addTypeToType( src, dst->base ); |
---|
| 619 | } else { |
---|
| 620 | switch ( dst->kind ) { |
---|
[0d0931d] | 621 | case TypeData::Unknown: |
---|
[6f95000] | 622 | src->qualifiers |= dst->qualifiers; |
---|
[101e0bd] | 623 | dst = src; |
---|
[2298f728] | 624 | src = nullptr; |
---|
[101e0bd] | 625 | break; |
---|
[0d0931d] | 626 | case TypeData::Basic: |
---|
[6f95000] | 627 | dst->qualifiers |= src->qualifiers; |
---|
[101e0bd] | 628 | if ( src->kind != TypeData::Unknown ) { |
---|
| 629 | assert( src->kind == TypeData::Basic ); |
---|
| 630 | |
---|
| 631 | if ( dst->basictype == DeclarationNode::NoBasicType ) { |
---|
| 632 | dst->basictype = src->basictype; |
---|
| 633 | } else if ( src->basictype != DeclarationNode::NoBasicType ) |
---|
[b38f6da] | 634 | SemanticError( yylloc, string( "multiple declaration types \"" ) + DeclarationNode::basicTypeNames[ dst->basictype ] + |
---|
| 635 | "\" and \"" + DeclarationNode::basicTypeNames[ src->basictype ] + "\"." ); |
---|
[101e0bd] | 636 | |
---|
| 637 | if ( dst->complextype == DeclarationNode::NoComplexType ) { |
---|
| 638 | dst->complextype = src->complextype; |
---|
| 639 | } else if ( src->complextype != DeclarationNode::NoComplexType ) |
---|
[b38f6da] | 640 | SemanticError( yylloc, string( "multiple declaration types \"" ) + DeclarationNode::complexTypeNames[ src->complextype ] + |
---|
| 641 | "\" and \"" + DeclarationNode::complexTypeNames[ src->complextype ] + "\"." ); |
---|
[101e0bd] | 642 | |
---|
| 643 | if ( dst->signedness == DeclarationNode::NoSignedness ) { |
---|
| 644 | dst->signedness = src->signedness; |
---|
| 645 | } else if ( src->signedness != DeclarationNode::NoSignedness ) |
---|
[b38f6da] | 646 | SemanticError( yylloc, string( "conflicting type specifier \"" ) + DeclarationNode::signednessNames[ dst->signedness ] + |
---|
| 647 | "\" and \"" + DeclarationNode::signednessNames[ src->signedness ] + "\"." ); |
---|
[101e0bd] | 648 | |
---|
| 649 | if ( dst->length == DeclarationNode::NoLength ) { |
---|
| 650 | dst->length = src->length; |
---|
| 651 | } else if ( dst->length == DeclarationNode::Long && src->length == DeclarationNode::Long ) { |
---|
| 652 | dst->length = DeclarationNode::LongLong; |
---|
| 653 | } else if ( src->length != DeclarationNode::NoLength ) |
---|
[b38f6da] | 654 | SemanticError( yylloc, string( "conflicting type specifier \"" ) + DeclarationNode::lengthNames[ dst->length ] + |
---|
| 655 | "\" and \"" + DeclarationNode::lengthNames[ src->length ] + "\"." ); |
---|
[101e0bd] | 656 | } // if |
---|
| 657 | break; |
---|
[0d0931d] | 658 | default: |
---|
[101e0bd] | 659 | switch ( src->kind ) { |
---|
[0d0931d] | 660 | case TypeData::Aggregate: |
---|
| 661 | case TypeData::Enum: |
---|
[101e0bd] | 662 | dst->base = new TypeData( TypeData::AggregateInst ); |
---|
| 663 | dst->base->aggInst.aggregate = src; |
---|
| 664 | if ( src->kind == TypeData::Aggregate ) { |
---|
| 665 | dst->base->aggInst.params = maybeClone( src->aggregate.actuals ); |
---|
[68cd1ce] | 666 | } // if |
---|
[6f95000] | 667 | dst->base->qualifiers |= src->qualifiers; |
---|
[2298f728] | 668 | src = nullptr; |
---|
[b87a5ed] | 669 | break; |
---|
[0d0931d] | 670 | default: |
---|
[101e0bd] | 671 | if ( dst->forall ) { |
---|
| 672 | dst->forall->appendList( src->forall ); |
---|
| 673 | } else { |
---|
| 674 | dst->forall = src->forall; |
---|
| 675 | } // if |
---|
[2298f728] | 676 | src->forall = nullptr; |
---|
[101e0bd] | 677 | dst->base = src; |
---|
[2298f728] | 678 | src = nullptr; |
---|
[68cd1ce] | 679 | } // switch |
---|
[101e0bd] | 680 | } // switch |
---|
[68cd1ce] | 681 | } // if |
---|
[3848e0e] | 682 | } |
---|
| 683 | |
---|
[ba7aa2d] | 684 | DeclarationNode * DeclarationNode::addType( DeclarationNode * o ) { |
---|
[b87a5ed] | 685 | if ( o ) { |
---|
[a7c90d4] | 686 | checkSpecifiers( o ); |
---|
| 687 | copySpecifiers( o ); |
---|
[b87a5ed] | 688 | if ( o->type ) { |
---|
| 689 | if ( ! type ) { |
---|
| 690 | if ( o->type->kind == TypeData::Aggregate || o->type->kind == TypeData::Enum ) { |
---|
| 691 | type = new TypeData( TypeData::AggregateInst ); |
---|
[8f6f47d7] | 692 | type->aggInst.aggregate = o->type; |
---|
[b87a5ed] | 693 | if ( o->type->kind == TypeData::Aggregate ) { |
---|
[43c89a7] | 694 | type->aggInst.hoistType = o->type->aggregate.body; |
---|
[8f6f47d7] | 695 | type->aggInst.params = maybeClone( o->type->aggregate.actuals ); |
---|
[43c89a7] | 696 | } else { |
---|
| 697 | type->aggInst.hoistType = o->type->enumeration.body; |
---|
[68cd1ce] | 698 | } // if |
---|
[6f95000] | 699 | type->qualifiers |= o->type->qualifiers; |
---|
[b87a5ed] | 700 | } else { |
---|
| 701 | type = o->type; |
---|
[68cd1ce] | 702 | } // if |
---|
[2298f728] | 703 | o->type = nullptr; |
---|
[b87a5ed] | 704 | } else { |
---|
| 705 | addTypeToType( o->type, type ); |
---|
[68cd1ce] | 706 | } // if |
---|
| 707 | } // if |
---|
[b87a5ed] | 708 | if ( o->bitfieldWidth ) { |
---|
| 709 | bitfieldWidth = o->bitfieldWidth; |
---|
[68cd1ce] | 710 | } // if |
---|
[71bd8c6] | 711 | |
---|
| 712 | // there may be typedefs chained onto the type |
---|
[1d4580a] | 713 | if ( o->get_next() ) { |
---|
| 714 | set_last( o->get_next()->clone() ); |
---|
[1db21619] | 715 | } // if |
---|
[68cd1ce] | 716 | } // if |
---|
[b87a5ed] | 717 | delete o; |
---|
[66406f3] | 718 | |
---|
[b87a5ed] | 719 | return this; |
---|
[3848e0e] | 720 | } |
---|
| 721 | |
---|
[f135b50] | 722 | DeclarationNode * DeclarationNode::addEnumBase( DeclarationNode * o ) { |
---|
[b38f6da] | 723 | if ( o && o->type) { |
---|
[f135b50] | 724 | type->base= o->type; |
---|
[b38f6da] | 725 | } // if |
---|
[f135b50] | 726 | delete o; |
---|
| 727 | return this; |
---|
| 728 | } |
---|
| 729 | |
---|
[ba7aa2d] | 730 | DeclarationNode * DeclarationNode::addTypedef() { |
---|
| 731 | TypeData * newtype = new TypeData( TypeData::Symbolic ); |
---|
[2298f728] | 732 | newtype->symbolic.params = nullptr; |
---|
[8f6f47d7] | 733 | newtype->symbolic.isTypedef = true; |
---|
[2298f728] | 734 | newtype->symbolic.name = name ? new string( *name ) : nullptr; |
---|
[b87a5ed] | 735 | newtype->base = type; |
---|
| 736 | type = newtype; |
---|
| 737 | return this; |
---|
[3848e0e] | 738 | } |
---|
| 739 | |
---|
[ba7aa2d] | 740 | DeclarationNode * DeclarationNode::addAssertions( DeclarationNode * assertions ) { |
---|
[bb7422a] | 741 | if ( variable.tyClass != ast::TypeDecl::NUMBER_OF_KINDS ) { |
---|
[702e826] | 742 | if ( variable.assertions ) { |
---|
| 743 | variable.assertions->appendList( assertions ); |
---|
| 744 | } else { |
---|
| 745 | variable.assertions = assertions; |
---|
| 746 | } // if |
---|
| 747 | return this; |
---|
[2298f728] | 748 | } // if |
---|
| 749 | |
---|
[b87a5ed] | 750 | assert( type ); |
---|
| 751 | switch ( type->kind ) { |
---|
[0d0931d] | 752 | case TypeData::Symbolic: |
---|
[8f6f47d7] | 753 | if ( type->symbolic.assertions ) { |
---|
| 754 | type->symbolic.assertions->appendList( assertions ); |
---|
[b87a5ed] | 755 | } else { |
---|
[8f6f47d7] | 756 | type->symbolic.assertions = assertions; |
---|
[68cd1ce] | 757 | } // if |
---|
[b87a5ed] | 758 | break; |
---|
[0d0931d] | 759 | default: |
---|
[b87a5ed] | 760 | assert( false ); |
---|
[68cd1ce] | 761 | } // switch |
---|
[974906e2] | 762 | |
---|
[b87a5ed] | 763 | return this; |
---|
[51b7345] | 764 | } |
---|
| 765 | |
---|
[fb114fa1] | 766 | DeclarationNode * DeclarationNode::addName( string * newname ) { |
---|
[2298f728] | 767 | assert( ! name ); |
---|
| 768 | name = newname; |
---|
[b87a5ed] | 769 | return this; |
---|
[51b7345] | 770 | } |
---|
| 771 | |
---|
[c0aa336] | 772 | DeclarationNode * DeclarationNode::addAsmName( DeclarationNode * newname ) { |
---|
[58dd019] | 773 | assert( ! asmName ); |
---|
[c0aa336] | 774 | asmName = newname ? newname->asmName : nullptr; |
---|
| 775 | return this->addQualifiers( newname ); |
---|
[58dd019] | 776 | } |
---|
| 777 | |
---|
[ba7aa2d] | 778 | DeclarationNode * DeclarationNode::addBitfield( ExpressionNode * size ) { |
---|
[b87a5ed] | 779 | bitfieldWidth = size; |
---|
| 780 | return this; |
---|
[51b7345] | 781 | } |
---|
| 782 | |
---|
[ba7aa2d] | 783 | DeclarationNode * DeclarationNode::addVarArgs() { |
---|
[b87a5ed] | 784 | assert( type ); |
---|
| 785 | hasEllipsis = true; |
---|
| 786 | return this; |
---|
[51b7345] | 787 | } |
---|
| 788 | |
---|
[c453ac4] | 789 | DeclarationNode * DeclarationNode::addFunctionBody( StatementNode * body, ExpressionNode * withExprs ) { |
---|
[b87a5ed] | 790 | assert( type ); |
---|
| 791 | assert( type->kind == TypeData::Function ); |
---|
[2298f728] | 792 | assert( ! type->function.body ); |
---|
[8f6f47d7] | 793 | type->function.body = body; |
---|
[c453ac4] | 794 | type->function.withExprs = withExprs; |
---|
[b87a5ed] | 795 | return this; |
---|
[51b7345] | 796 | } |
---|
| 797 | |
---|
[ba7aa2d] | 798 | DeclarationNode * DeclarationNode::addOldDeclList( DeclarationNode * list ) { |
---|
[b87a5ed] | 799 | assert( type ); |
---|
| 800 | assert( type->kind == TypeData::Function ); |
---|
[2298f728] | 801 | assert( ! type->function.oldDeclList ); |
---|
[8f6f47d7] | 802 | type->function.oldDeclList = list; |
---|
[b87a5ed] | 803 | return this; |
---|
[51b7345] | 804 | } |
---|
| 805 | |
---|
[c0aa336] | 806 | DeclarationNode * DeclarationNode::setBase( TypeData * newType ) { |
---|
[b87a5ed] | 807 | if ( type ) { |
---|
[ba7aa2d] | 808 | TypeData * prevBase = type; |
---|
| 809 | TypeData * curBase = type->base; |
---|
[2298f728] | 810 | while ( curBase != nullptr ) { |
---|
[b87a5ed] | 811 | prevBase = curBase; |
---|
| 812 | curBase = curBase->base; |
---|
[68cd1ce] | 813 | } // while |
---|
[b87a5ed] | 814 | prevBase->base = newType; |
---|
| 815 | } else { |
---|
| 816 | type = newType; |
---|
[68cd1ce] | 817 | } // if |
---|
[c0aa336] | 818 | return this; |
---|
[3848e0e] | 819 | } |
---|
| 820 | |
---|
[c0aa336] | 821 | DeclarationNode * DeclarationNode::copyAttribute( DeclarationNode * a ) { |
---|
| 822 | if ( a ) { |
---|
[bb7422a] | 823 | spliceBegin( attributes, a->attributes ); |
---|
[c0aa336] | 824 | a->attributes.clear(); |
---|
| 825 | } // if |
---|
| 826 | return this; |
---|
| 827 | } // copyAttribute |
---|
| 828 | |
---|
[ba7aa2d] | 829 | DeclarationNode * DeclarationNode::addPointer( DeclarationNode * p ) { |
---|
[b87a5ed] | 830 | if ( p ) { |
---|
[6926a6d] | 831 | assert( p->type->kind == TypeData::Pointer || p->type->kind == TypeData::Reference ); |
---|
[c0aa336] | 832 | setBase( p->type ); |
---|
[2298f728] | 833 | p->type = nullptr; |
---|
[c0aa336] | 834 | copyAttribute( p ); |
---|
[b87a5ed] | 835 | delete p; |
---|
[68cd1ce] | 836 | } // if |
---|
[b87a5ed] | 837 | return this; |
---|
[3848e0e] | 838 | } |
---|
| 839 | |
---|
[ba7aa2d] | 840 | DeclarationNode * DeclarationNode::addArray( DeclarationNode * a ) { |
---|
[b87a5ed] | 841 | if ( a ) { |
---|
| 842 | assert( a->type->kind == TypeData::Array ); |
---|
[c0aa336] | 843 | setBase( a->type ); |
---|
[2298f728] | 844 | a->type = nullptr; |
---|
[c0aa336] | 845 | copyAttribute( a ); |
---|
[b87a5ed] | 846 | delete a; |
---|
[68cd1ce] | 847 | } // if |
---|
[b87a5ed] | 848 | return this; |
---|
[51b7345] | 849 | } |
---|
| 850 | |
---|
[ba7aa2d] | 851 | DeclarationNode * DeclarationNode::addNewPointer( DeclarationNode * p ) { |
---|
[b87a5ed] | 852 | if ( p ) { |
---|
[e6cee92] | 853 | assert( p->type->kind == TypeData::Pointer || p->type->kind == TypeData::Reference ); |
---|
[b87a5ed] | 854 | if ( type ) { |
---|
| 855 | switch ( type->kind ) { |
---|
[0d0931d] | 856 | case TypeData::Aggregate: |
---|
| 857 | case TypeData::Enum: |
---|
[b87a5ed] | 858 | p->type->base = new TypeData( TypeData::AggregateInst ); |
---|
[8f6f47d7] | 859 | p->type->base->aggInst.aggregate = type; |
---|
[b87a5ed] | 860 | if ( type->kind == TypeData::Aggregate ) { |
---|
[8f6f47d7] | 861 | p->type->base->aggInst.params = maybeClone( type->aggregate.actuals ); |
---|
[68cd1ce] | 862 | } // if |
---|
[6f95000] | 863 | p->type->base->qualifiers |= type->qualifiers; |
---|
[b87a5ed] | 864 | break; |
---|
| 865 | |
---|
[0d0931d] | 866 | default: |
---|
[b87a5ed] | 867 | p->type->base = type; |
---|
[68cd1ce] | 868 | } // switch |
---|
[2298f728] | 869 | type = nullptr; |
---|
[68cd1ce] | 870 | } // if |
---|
[b87a5ed] | 871 | delete this; |
---|
| 872 | return p; |
---|
| 873 | } else { |
---|
| 874 | return this; |
---|
[68cd1ce] | 875 | } // if |
---|
[51b7345] | 876 | } |
---|
| 877 | |
---|
[ba7aa2d] | 878 | static TypeData * findLast( TypeData * a ) { |
---|
[b87a5ed] | 879 | assert( a ); |
---|
[ba7aa2d] | 880 | TypeData * cur = a; |
---|
[a32b204] | 881 | while ( cur->base ) { |
---|
[b87a5ed] | 882 | cur = cur->base; |
---|
[68cd1ce] | 883 | } // while |
---|
[b87a5ed] | 884 | return cur; |
---|
[3848e0e] | 885 | } |
---|
| 886 | |
---|
[ba7aa2d] | 887 | DeclarationNode * DeclarationNode::addNewArray( DeclarationNode * a ) { |
---|
[0d0931d] | 888 | if ( ! a ) return this; |
---|
[738e304] | 889 | assert( a->type->kind == TypeData::Array ); |
---|
| 890 | TypeData * lastArray = findLast( a->type ); |
---|
| 891 | if ( type ) { |
---|
| 892 | switch ( type->kind ) { |
---|
[0d0931d] | 893 | case TypeData::Aggregate: |
---|
| 894 | case TypeData::Enum: |
---|
[738e304] | 895 | lastArray->base = new TypeData( TypeData::AggregateInst ); |
---|
| 896 | lastArray->base->aggInst.aggregate = type; |
---|
| 897 | if ( type->kind == TypeData::Aggregate ) { |
---|
| 898 | lastArray->base->aggInst.params = maybeClone( type->aggregate.actuals ); |
---|
| 899 | } // if |
---|
[6f95000] | 900 | lastArray->base->qualifiers |= type->qualifiers; |
---|
[738e304] | 901 | break; |
---|
[0d0931d] | 902 | default: |
---|
[738e304] | 903 | lastArray->base = type; |
---|
| 904 | } // switch |
---|
| 905 | type = nullptr; |
---|
[68cd1ce] | 906 | } // if |
---|
[738e304] | 907 | delete this; |
---|
| 908 | return a; |
---|
[51b7345] | 909 | } |
---|
[3848e0e] | 910 | |
---|
[ba7aa2d] | 911 | DeclarationNode * DeclarationNode::addParamList( DeclarationNode * params ) { |
---|
| 912 | TypeData * ftype = new TypeData( TypeData::Function ); |
---|
[8f6f47d7] | 913 | ftype->function.params = params; |
---|
[c0aa336] | 914 | setBase( ftype ); |
---|
[b87a5ed] | 915 | return this; |
---|
[3848e0e] | 916 | } |
---|
| 917 | |
---|
[ba7aa2d] | 918 | static TypeData * addIdListToType( TypeData * type, DeclarationNode * ids ) { |
---|
[b87a5ed] | 919 | if ( type ) { |
---|
| 920 | if ( type->kind != TypeData::Function ) { |
---|
| 921 | type->base = addIdListToType( type->base, ids ); |
---|
| 922 | } else { |
---|
[8f6f47d7] | 923 | type->function.idList = ids; |
---|
[68cd1ce] | 924 | } // if |
---|
[b87a5ed] | 925 | return type; |
---|
[3848e0e] | 926 | } else { |
---|
[ba7aa2d] | 927 | TypeData * newtype = new TypeData( TypeData::Function ); |
---|
[8f6f47d7] | 928 | newtype->function.idList = ids; |
---|
[b87a5ed] | 929 | return newtype; |
---|
[68cd1ce] | 930 | } // if |
---|
[2298f728] | 931 | } // addIdListToType |
---|
[974906e2] | 932 | |
---|
[ba7aa2d] | 933 | DeclarationNode * DeclarationNode::addIdList( DeclarationNode * ids ) { |
---|
[b87a5ed] | 934 | type = addIdListToType( type, ids ); |
---|
| 935 | return this; |
---|
[3848e0e] | 936 | } |
---|
| 937 | |
---|
[ba7aa2d] | 938 | DeclarationNode * DeclarationNode::addInitializer( InitializerNode * init ) { |
---|
[b87a5ed] | 939 | initializer = init; |
---|
| 940 | return this; |
---|
[3848e0e] | 941 | } |
---|
| 942 | |
---|
[67cf18c] | 943 | DeclarationNode * DeclarationNode::addTypeInitializer( DeclarationNode * init ) { |
---|
[bb7422a] | 944 | assertf( variable.tyClass != ast::TypeDecl::NUMBER_OF_KINDS, "Called addTypeInitializer on something that isn't a type variable." ); |
---|
[67cf18c] | 945 | variable.initializer = init; |
---|
| 946 | return this; |
---|
| 947 | } |
---|
| 948 | |
---|
[a46b69c] | 949 | DeclarationNode * DeclarationNode::cloneType( string * name ) { |
---|
| 950 | DeclarationNode * newnode = newName( name ); |
---|
[b87a5ed] | 951 | newnode->type = maybeClone( type ); |
---|
[a7c90d4] | 952 | newnode->copySpecifiers( this ); |
---|
[b87a5ed] | 953 | return newnode; |
---|
[3848e0e] | 954 | } |
---|
| 955 | |
---|
[2298f728] | 956 | DeclarationNode * DeclarationNode::cloneBaseType( DeclarationNode * o ) { |
---|
| 957 | if ( ! o ) return nullptr; |
---|
| 958 | |
---|
[a7c90d4] | 959 | o->copySpecifiers( this ); |
---|
[2298f728] | 960 | if ( type ) { |
---|
| 961 | TypeData * srcType = type; |
---|
| 962 | |
---|
[c0aa336] | 963 | // search for the base type by scanning off pointers and array designators |
---|
[2298f728] | 964 | while ( srcType->base ) { |
---|
| 965 | srcType = srcType->base; |
---|
| 966 | } // while |
---|
| 967 | |
---|
| 968 | TypeData * newType = srcType->clone(); |
---|
| 969 | if ( newType->kind == TypeData::AggregateInst ) { |
---|
| 970 | // don't duplicate members |
---|
| 971 | if ( newType->aggInst.aggregate->kind == TypeData::Enum ) { |
---|
| 972 | delete newType->aggInst.aggregate->enumeration.constants; |
---|
| 973 | newType->aggInst.aggregate->enumeration.constants = nullptr; |
---|
[b2da0574] | 974 | newType->aggInst.aggregate->enumeration.body = false; |
---|
[b87a5ed] | 975 | } else { |
---|
[2298f728] | 976 | assert( newType->aggInst.aggregate->kind == TypeData::Aggregate ); |
---|
| 977 | delete newType->aggInst.aggregate->aggregate.fields; |
---|
| 978 | newType->aggInst.aggregate->aggregate.fields = nullptr; |
---|
[b2da0574] | 979 | newType->aggInst.aggregate->aggregate.body = false; |
---|
[68cd1ce] | 980 | } // if |
---|
[43c89a7] | 981 | // don't hoist twice |
---|
| 982 | newType->aggInst.hoistType = false; |
---|
[68cd1ce] | 983 | } // if |
---|
[2298f728] | 984 | |
---|
| 985 | newType->forall = maybeClone( type->forall ); |
---|
| 986 | if ( ! o->type ) { |
---|
| 987 | o->type = newType; |
---|
| 988 | } else { |
---|
| 989 | addTypeToType( newType, o->type ); |
---|
| 990 | delete newType; |
---|
| 991 | } // if |
---|
[68cd1ce] | 992 | } // if |
---|
[b87a5ed] | 993 | return o; |
---|
[51b7345] | 994 | } |
---|
| 995 | |
---|
[ba7aa2d] | 996 | DeclarationNode * DeclarationNode::extractAggregate() const { |
---|
[b87a5ed] | 997 | if ( type ) { |
---|
[ba7aa2d] | 998 | TypeData * ret = typeextractAggregate( type ); |
---|
[b87a5ed] | 999 | if ( ret ) { |
---|
[ba7aa2d] | 1000 | DeclarationNode * newnode = new DeclarationNode; |
---|
[b87a5ed] | 1001 | newnode->type = ret; |
---|
| 1002 | return newnode; |
---|
[843054c2] | 1003 | } // if |
---|
| 1004 | } // if |
---|
[2298f728] | 1005 | return nullptr; |
---|
[3848e0e] | 1006 | } |
---|
| 1007 | |
---|
[b38f6da] | 1008 | // If a typedef wraps an anonymous declaration, name the inner declaration so it has a consistent name across |
---|
| 1009 | // translation units. |
---|
[45e753c] | 1010 | static void nameTypedefedDecl( |
---|
| 1011 | DeclarationNode * innerDecl, |
---|
| 1012 | const DeclarationNode * outerDecl ) { |
---|
| 1013 | TypeData * outer = outerDecl->type; |
---|
| 1014 | assert( outer ); |
---|
| 1015 | // First make sure this is a typedef: |
---|
| 1016 | if ( outer->kind != TypeData::Symbolic || !outer->symbolic.isTypedef ) { |
---|
| 1017 | return; |
---|
| 1018 | } |
---|
| 1019 | TypeData * inner = innerDecl->type; |
---|
| 1020 | assert( inner ); |
---|
| 1021 | // Always clear any CVs associated with the aggregate: |
---|
| 1022 | inner->qualifiers.reset(); |
---|
| 1023 | // Handle anonymous aggregates: typedef struct { int i; } foo |
---|
| 1024 | if ( inner->kind == TypeData::Aggregate && inner->aggregate.anon ) { |
---|
| 1025 | delete inner->aggregate.name; |
---|
| 1026 | inner->aggregate.name = new string( "__anonymous_" + *outerDecl->name ); |
---|
| 1027 | inner->aggregate.anon = false; |
---|
| 1028 | assert( outer->base ); |
---|
| 1029 | delete outer->base->aggInst.aggregate->aggregate.name; |
---|
| 1030 | outer->base->aggInst.aggregate->aggregate.name = new string( "__anonymous_" + *outerDecl->name ); |
---|
| 1031 | outer->base->aggInst.aggregate->aggregate.anon = false; |
---|
| 1032 | outer->base->aggInst.aggregate->qualifiers.reset(); |
---|
| 1033 | // Handle anonymous enumeration: typedef enum { A, B, C } foo |
---|
| 1034 | } else if ( inner->kind == TypeData::Enum && inner->enumeration.anon ) { |
---|
| 1035 | delete inner->enumeration.name; |
---|
| 1036 | inner->enumeration.name = new string( "__anonymous_" + *outerDecl->name ); |
---|
| 1037 | inner->enumeration.anon = false; |
---|
| 1038 | assert( outer->base ); |
---|
| 1039 | delete outer->base->aggInst.aggregate->enumeration.name; |
---|
| 1040 | outer->base->aggInst.aggregate->enumeration.name = new string( "__anonymous_" + *outerDecl->name ); |
---|
| 1041 | outer->base->aggInst.aggregate->enumeration.anon = false; |
---|
| 1042 | // No qualifiers.reset() here. |
---|
| 1043 | } |
---|
| 1044 | } |
---|
| 1045 | |
---|
| 1046 | // This code handles a special issue with the attribute transparent_union. |
---|
| 1047 | // |
---|
| 1048 | // typedef union U { int i; } typedef_name __attribute__(( aligned(16) )) __attribute__(( transparent_union )) |
---|
| 1049 | // |
---|
| 1050 | // Here the attribute aligned goes with the typedef_name, so variables declared of this type are |
---|
| 1051 | // aligned. However, the attribute transparent_union must be moved from the typedef_name to |
---|
| 1052 | // alias union U. Currently, this is the only know attribute that must be moved from typedef to |
---|
| 1053 | // alias. |
---|
| 1054 | static void moveUnionAttribute( ast::Decl * decl, ast::UnionDecl * unionDecl ) { |
---|
| 1055 | if ( auto typedefDecl = dynamic_cast<ast::TypedefDecl *>( decl ) ) { |
---|
| 1056 | // Is the typedef alias a union aggregate? |
---|
| 1057 | if ( nullptr == unionDecl ) return; |
---|
| 1058 | |
---|
| 1059 | // If typedef is an alias for a union, then its alias type was hoisted above and remembered. |
---|
| 1060 | if ( auto unionInstType = typedefDecl->base.as<ast::UnionInstType>() ) { |
---|
| 1061 | auto instType = ast::mutate( unionInstType ); |
---|
| 1062 | // Remove all transparent_union attributes from typedef and move to alias union. |
---|
| 1063 | for ( auto attr = instType->attributes.begin() ; attr != instType->attributes.end() ; ) { |
---|
| 1064 | assert( *attr ); |
---|
| 1065 | if ( (*attr)->name == "transparent_union" || (*attr)->name == "__transparent_union__" ) { |
---|
| 1066 | unionDecl->attributes.emplace_back( attr->release() ); |
---|
| 1067 | attr = instType->attributes.erase( attr ); |
---|
| 1068 | } else { |
---|
| 1069 | attr++; |
---|
| 1070 | } |
---|
| 1071 | } |
---|
| 1072 | typedefDecl->base = instType; |
---|
| 1073 | } |
---|
| 1074 | } |
---|
| 1075 | } |
---|
| 1076 | |
---|
| 1077 | // Get the non-anonymous name of the instance type of the declaration, |
---|
| 1078 | // if one exists. |
---|
| 1079 | static const std::string * getInstTypeOfName( ast::Decl * decl ) { |
---|
| 1080 | if ( auto dwt = dynamic_cast<ast::DeclWithType *>( decl ) ) { |
---|
| 1081 | if ( auto aggr = dynamic_cast<ast::BaseInstType const *>( dwt->get_type() ) ) { |
---|
| 1082 | if ( aggr->name.find("anonymous") == std::string::npos ) { |
---|
| 1083 | return &aggr->name; |
---|
| 1084 | } |
---|
| 1085 | } |
---|
| 1086 | } |
---|
| 1087 | return nullptr; |
---|
| 1088 | } |
---|
| 1089 | |
---|
[b38f6da] | 1090 | void buildList( DeclarationNode * firstNode, std::vector<ast::ptr<ast::Decl>> & outputList ) { |
---|
[a16764a6] | 1091 | SemanticErrorException errors; |
---|
[bb7422a] | 1092 | std::back_insert_iterator<std::vector<ast::ptr<ast::Decl>>> out( outputList ); |
---|
[2298f728] | 1093 | |
---|
[45e753c] | 1094 | for ( const DeclarationNode * cur = firstNode ; cur ; cur = strict_next( cur ) ) { |
---|
[b87a5ed] | 1095 | try { |
---|
[45e753c] | 1096 | bool extracted_named = false; |
---|
| 1097 | ast::UnionDecl * unionDecl = nullptr; |
---|
[692c1cc] | 1098 | |
---|
[ba7aa2d] | 1099 | if ( DeclarationNode * extr = cur->extractAggregate() ) { |
---|
[78e2fca] | 1100 | assert( cur->type ); |
---|
[45e753c] | 1101 | nameTypedefedDecl( extr, cur ); |
---|
[692c1cc] | 1102 | |
---|
[45e753c] | 1103 | if ( ast::Decl * decl = extr->build() ) { |
---|
[692c1cc] | 1104 | // Remember the declaration if it is a union aggregate ? |
---|
[bb7422a] | 1105 | unionDecl = dynamic_cast<ast::UnionDecl *>( decl ); |
---|
[692c1cc] | 1106 | |
---|
| 1107 | *out++ = decl; |
---|
[3d7e53b] | 1108 | |
---|
| 1109 | // need to remember the cases where a declaration contains an anonymous aggregate definition |
---|
| 1110 | assert( extr->type ); |
---|
| 1111 | if ( extr->type->kind == TypeData::Aggregate ) { |
---|
[692c1cc] | 1112 | // typedef struct { int A } B is the only case? |
---|
[45e753c] | 1113 | extracted_named = !extr->type->aggregate.anon; |
---|
[3d7e53b] | 1114 | } else if ( extr->type->kind == TypeData::Enum ) { |
---|
[692c1cc] | 1115 | // typedef enum { A } B is the only case? |
---|
[45e753c] | 1116 | extracted_named = !extr->type->enumeration.anon; |
---|
| 1117 | } else { |
---|
| 1118 | extracted_named = true; |
---|
[3d7e53b] | 1119 | } |
---|
[843054c2] | 1120 | } // if |
---|
[f39096c] | 1121 | delete extr; |
---|
[843054c2] | 1122 | } // if |
---|
[2298f728] | 1123 | |
---|
[45e753c] | 1124 | if ( ast::Decl * decl = cur->build() ) { |
---|
| 1125 | moveUnionAttribute( decl, unionDecl ); |
---|
| 1126 | |
---|
| 1127 | if ( "" == decl->name && !cur->get_inLine() ) { |
---|
| 1128 | // Don't include anonymous declaration for named aggregates, |
---|
| 1129 | // but do include them for anonymous aggregates, e.g.: |
---|
| 1130 | // struct S { |
---|
| 1131 | // struct T { int x; }; // no anonymous member |
---|
| 1132 | // struct { int y; }; // anonymous member |
---|
| 1133 | // struct T; // anonymous member |
---|
| 1134 | // }; |
---|
| 1135 | if ( extracted_named ) { |
---|
| 1136 | continue; |
---|
| 1137 | } |
---|
[692c1cc] | 1138 | |
---|
[45e753c] | 1139 | if ( auto name = getInstTypeOfName( decl ) ) { |
---|
| 1140 | // Temporary: warn about anonymous member declarations of named types, since |
---|
| 1141 | // this conflicts with the syntax for the forward declaration of an anonymous type. |
---|
| 1142 | SemanticWarning( cur->location, Warning::AggrForwardDecl, name->c_str() ); |
---|
| 1143 | } |
---|
[e07caa2] | 1144 | } // if |
---|
[45e753c] | 1145 | *out++ = decl; |
---|
[843054c2] | 1146 | } // if |
---|
[45e753c] | 1147 | } catch ( SemanticErrorException & e ) { |
---|
[b87a5ed] | 1148 | errors.append( e ); |
---|
[843054c2] | 1149 | } // try |
---|
[e07caa2] | 1150 | } // for |
---|
[2298f728] | 1151 | |
---|
[b87a5ed] | 1152 | if ( ! errors.isEmpty() ) { |
---|
| 1153 | throw errors; |
---|
[843054c2] | 1154 | } // if |
---|
[2298f728] | 1155 | } // buildList |
---|
[3848e0e] | 1156 | |
---|
[3d7e53b] | 1157 | // currently only builds assertions, function parameters, and return values |
---|
[6611177] | 1158 | void buildList( DeclarationNode * firstNode, std::vector<ast::ptr<ast::DeclWithType>> & outputList ) { |
---|
[a16764a6] | 1159 | SemanticErrorException errors; |
---|
[bb7422a] | 1160 | std::back_insert_iterator<std::vector<ast::ptr<ast::DeclWithType>>> out( outputList ); |
---|
[43c89a7] | 1161 | |
---|
[45e753c] | 1162 | for ( const DeclarationNode * cur = firstNode; cur; cur = strict_next( cur ) ) { |
---|
[b87a5ed] | 1163 | try { |
---|
[bb7422a] | 1164 | ast::Decl * decl = cur->build(); |
---|
[45e753c] | 1165 | assertf( decl, "buildList: build for ast::DeclWithType." ); |
---|
[bb7422a] | 1166 | if ( ast::DeclWithType * dwt = dynamic_cast<ast::DeclWithType *>( decl ) ) { |
---|
[47498bd] | 1167 | dwt->location = cur->location; |
---|
[3ca7ef3] | 1168 | *out++ = dwt; |
---|
[bb7422a] | 1169 | } else if ( ast::StructDecl * agg = dynamic_cast<ast::StructDecl *>( decl ) ) { |
---|
[3d7e53b] | 1170 | // e.g., int foo(struct S) {} |
---|
[bb7422a] | 1171 | auto inst = new ast::StructInstType( agg->name ); |
---|
| 1172 | auto obj = new ast::ObjectDecl( cur->location, "", inst ); |
---|
| 1173 | obj->linkage = linkage; |
---|
[3ca7ef3] | 1174 | *out++ = obj; |
---|
[47498bd] | 1175 | delete agg; |
---|
[bb7422a] | 1176 | } else if ( ast::UnionDecl * agg = dynamic_cast<ast::UnionDecl *>( decl ) ) { |
---|
[3d7e53b] | 1177 | // e.g., int foo(union U) {} |
---|
[bb7422a] | 1178 | auto inst = new ast::UnionInstType( agg->name ); |
---|
| 1179 | auto obj = new ast::ObjectDecl( cur->location, |
---|
| 1180 | "", inst, nullptr, ast::Storage::Classes(), |
---|
| 1181 | linkage ); |
---|
[3ca7ef3] | 1182 | *out++ = obj; |
---|
[bb7422a] | 1183 | } else if ( ast::EnumDecl * agg = dynamic_cast<ast::EnumDecl *>( decl ) ) { |
---|
[3d7e53b] | 1184 | // e.g., int foo(enum E) {} |
---|
[bb7422a] | 1185 | auto inst = new ast::EnumInstType( agg->name ); |
---|
| 1186 | auto obj = new ast::ObjectDecl( cur->location, |
---|
| 1187 | "", |
---|
| 1188 | inst, |
---|
| 1189 | nullptr, |
---|
| 1190 | ast::Storage::Classes(), |
---|
| 1191 | linkage |
---|
| 1192 | ); |
---|
[3ca7ef3] | 1193 | *out++ = obj; |
---|
[45e753c] | 1194 | } else { |
---|
| 1195 | assertf( false, "buildList: Could not convert to ast::DeclWithType." ); |
---|
[843054c2] | 1196 | } // if |
---|
[45e753c] | 1197 | } catch ( SemanticErrorException & e ) { |
---|
[b87a5ed] | 1198 | errors.append( e ); |
---|
[843054c2] | 1199 | } // try |
---|
[3a5131ed] | 1200 | } // for |
---|
| 1201 | |
---|
[b87a5ed] | 1202 | if ( ! errors.isEmpty() ) { |
---|
| 1203 | throw errors; |
---|
[843054c2] | 1204 | } // if |
---|
[2298f728] | 1205 | } // buildList |
---|
[3848e0e] | 1206 | |
---|
[bb7422a] | 1207 | void buildTypeList( const DeclarationNode * firstNode, |
---|
| 1208 | std::vector<ast::ptr<ast::Type>> & outputList ) { |
---|
[a16764a6] | 1209 | SemanticErrorException errors; |
---|
[bb7422a] | 1210 | std::back_insert_iterator<std::vector<ast::ptr<ast::Type>>> out( outputList ); |
---|
[2298f728] | 1211 | |
---|
[45e753c] | 1212 | for ( const DeclarationNode * cur = firstNode ; cur ; cur = strict_next( cur ) ) { |
---|
[b87a5ed] | 1213 | try { |
---|
[ba7aa2d] | 1214 | * out++ = cur->buildType(); |
---|
[45e753c] | 1215 | } catch ( SemanticErrorException & e ) { |
---|
[b87a5ed] | 1216 | errors.append( e ); |
---|
[843054c2] | 1217 | } // try |
---|
[45e753c] | 1218 | } // for |
---|
[2298f728] | 1219 | |
---|
[b87a5ed] | 1220 | if ( ! errors.isEmpty() ) { |
---|
| 1221 | throw errors; |
---|
[843054c2] | 1222 | } // if |
---|
[2298f728] | 1223 | } // buildTypeList |
---|
[51b7345] | 1224 | |
---|
[bb7422a] | 1225 | ast::Decl * DeclarationNode::build() const { |
---|
[a16764a6] | 1226 | if ( ! error.empty() ) SemanticError( this, error + " in declaration of " ); |
---|
[2298f728] | 1227 | |
---|
[e994912] | 1228 | if ( asmStmt ) { |
---|
[bb7422a] | 1229 | auto stmt = strict_dynamic_cast<ast::AsmStmt *>( asmStmt->build() ); |
---|
| 1230 | return new ast::AsmDecl( stmt->location, stmt ); |
---|
[e994912] | 1231 | } // if |
---|
[2d019af] | 1232 | if ( directiveStmt ) { |
---|
[bb7422a] | 1233 | auto stmt = strict_dynamic_cast<ast::DirectiveStmt *>( directiveStmt->build() ); |
---|
| 1234 | return new ast::DirectiveDecl( stmt->location, stmt ); |
---|
[2d019af] | 1235 | } // if |
---|
[e994912] | 1236 | |
---|
[bb7422a] | 1237 | if ( variable.tyClass != ast::TypeDecl::NUMBER_OF_KINDS ) { |
---|
[f0ecf9b] | 1238 | // otype is internally converted to dtype + otype parameters |
---|
[bb7422a] | 1239 | static const ast::TypeDecl::Kind kindMap[] = { ast::TypeDecl::Dtype, ast::TypeDecl::Dtype, ast::TypeDecl::Dtype, ast::TypeDecl::Ftype, ast::TypeDecl::Ttype, ast::TypeDecl::Dimension }; |
---|
| 1240 | static_assert( sizeof(kindMap) / sizeof(kindMap[0]) == ast::TypeDecl::NUMBER_OF_KINDS, "DeclarationNode::build: kindMap is out of sync." ); |
---|
[8f60f0b] | 1241 | assertf( variable.tyClass < sizeof(kindMap)/sizeof(kindMap[0]), "Variable's tyClass is out of bounds." ); |
---|
[bb7422a] | 1242 | ast::TypeDecl * ret = new ast::TypeDecl( location, |
---|
| 1243 | *name, |
---|
| 1244 | ast::Storage::Classes(), |
---|
| 1245 | (ast::Type *)nullptr, |
---|
| 1246 | kindMap[ variable.tyClass ], |
---|
| 1247 | variable.tyClass == ast::TypeDecl::Otype || variable.tyClass == ast::TypeDecl::DStype, |
---|
| 1248 | variable.initializer ? variable.initializer->buildType() : nullptr |
---|
| 1249 | ); |
---|
| 1250 | buildList( variable.assertions, ret->assertions ); |
---|
[2298f728] | 1251 | return ret; |
---|
| 1252 | } // if |
---|
| 1253 | |
---|
[843054c2] | 1254 | if ( type ) { |
---|
[dd020c0] | 1255 | // Function specifiers can only appear on a function definition/declaration. |
---|
| 1256 | // |
---|
| 1257 | // inline _Noreturn int f(); // allowed |
---|
| 1258 | // inline _Noreturn int g( int i ); // allowed |
---|
| 1259 | // inline _Noreturn int i; // disallowed |
---|
[fb04321] | 1260 | if ( type->kind != TypeData::Function && funcSpecs.any() ) { |
---|
[a16764a6] | 1261 | SemanticError( this, "invalid function specifier for " ); |
---|
[dd020c0] | 1262 | } // if |
---|
[284da8c] | 1263 | // Forall qualifier can only appear on a function/aggregate definition/declaration. |
---|
| 1264 | // |
---|
| 1265 | // forall int f(); // allowed |
---|
| 1266 | // forall int g( int i ); // allowed |
---|
| 1267 | // forall int i; // disallowed |
---|
| 1268 | if ( type->kind != TypeData::Function && type->forall ) { |
---|
| 1269 | SemanticError( this, "invalid type qualifier for " ); |
---|
| 1270 | } // if |
---|
[3ed994e] | 1271 | bool isDelete = initializer && initializer->get_isDelete(); |
---|
[bb7422a] | 1272 | ast::Decl * decl = buildDecl( |
---|
| 1273 | type, |
---|
| 1274 | name ? *name : string( "" ), |
---|
| 1275 | storageClasses, |
---|
| 1276 | maybeBuild( bitfieldWidth ), |
---|
| 1277 | funcSpecs, |
---|
| 1278 | linkage, |
---|
| 1279 | asmName, |
---|
| 1280 | isDelete ? nullptr : maybeBuild( initializer ), |
---|
| 1281 | copy( attributes ) |
---|
| 1282 | )->set_extension( extension ); |
---|
[3ed994e] | 1283 | if ( isDelete ) { |
---|
[bb7422a] | 1284 | auto dwt = strict_dynamic_cast<ast::DeclWithType *>( decl ); |
---|
[3ed994e] | 1285 | dwt->isDeleted = true; |
---|
| 1286 | } |
---|
| 1287 | return decl; |
---|
[843054c2] | 1288 | } // if |
---|
[2298f728] | 1289 | |
---|
[f6e3e34] | 1290 | if ( assert.condition ) { |
---|
[bb7422a] | 1291 | auto cond = maybeBuild( assert.condition ); |
---|
| 1292 | auto msg = strict_dynamic_cast<ast::ConstantExpr *>( maybeCopy( assert.message ) ); |
---|
| 1293 | return new ast::StaticAssertDecl( location, cond, msg ); |
---|
[f6e3e34] | 1294 | } |
---|
| 1295 | |
---|
[dd020c0] | 1296 | // SUE's cannot have function specifiers, either |
---|
| 1297 | // |
---|
[79aae15] | 1298 | // inline _Noreturn struct S { ... }; // disallowed |
---|
| 1299 | // inline _Noreturn enum E { ... }; // disallowed |
---|
[fb04321] | 1300 | if ( funcSpecs.any() ) { |
---|
[a16764a6] | 1301 | SemanticError( this, "invalid function specifier for " ); |
---|
[843054c2] | 1302 | } // if |
---|
[e874605] | 1303 | if ( enumInLine ) { |
---|
[bb7422a] | 1304 | return new ast::InlineMemberDecl( location, |
---|
| 1305 | *name, (ast::Type*)nullptr, storageClasses, linkage ); |
---|
[e874605] | 1306 | } // if |
---|
[dd020c0] | 1307 | assertf( name, "ObjectDecl must a have name\n" ); |
---|
[bb7422a] | 1308 | auto ret = new ast::ObjectDecl( location, |
---|
| 1309 | *name, |
---|
| 1310 | (ast::Type*)nullptr, |
---|
| 1311 | maybeBuild( initializer ), |
---|
| 1312 | storageClasses, |
---|
| 1313 | linkage, |
---|
| 1314 | maybeBuild( bitfieldWidth ) |
---|
| 1315 | ); |
---|
| 1316 | ret->asmName = asmName; |
---|
| 1317 | ret->extension = extension; |
---|
| 1318 | return ret; |
---|
[51b7345] | 1319 | } |
---|
| 1320 | |
---|
[bb7422a] | 1321 | ast::Type * DeclarationNode::buildType() const { |
---|
[b87a5ed] | 1322 | assert( type ); |
---|
[974906e2] | 1323 | |
---|
[b87a5ed] | 1324 | switch ( type->kind ) { |
---|
[0d0931d] | 1325 | case TypeData::Enum: |
---|
| 1326 | case TypeData::Aggregate: { |
---|
[bb7422a] | 1327 | ast::BaseInstType * ret = |
---|
| 1328 | buildComAggInst( type, copy( attributes ), linkage ); |
---|
| 1329 | buildList( type->aggregate.actuals, ret->params ); |
---|
[0d0931d] | 1330 | return ret; |
---|
| 1331 | } |
---|
| 1332 | case TypeData::Symbolic: { |
---|
[bb7422a] | 1333 | ast::TypeInstType * ret = new ast::TypeInstType( |
---|
| 1334 | *type->symbolic.name, |
---|
| 1335 | // This is just a default, the true value is not known yet. |
---|
| 1336 | ast::TypeDecl::Dtype, |
---|
| 1337 | buildQualifiers( type ), |
---|
| 1338 | copy( attributes ) ); |
---|
| 1339 | buildList( type->symbolic.actuals, ret->params ); |
---|
[0d0931d] | 1340 | return ret; |
---|
| 1341 | } |
---|
| 1342 | default: |
---|
[bb7422a] | 1343 | ast::Type * simpletypes = typebuild( type ); |
---|
| 1344 | // copy because member is const |
---|
| 1345 | simpletypes->attributes = attributes; |
---|
[c0aa336] | 1346 | return simpletypes; |
---|
[b87a5ed] | 1347 | } // switch |
---|
[3848e0e] | 1348 | } |
---|
| 1349 | |
---|
[b87a5ed] | 1350 | // Local Variables: // |
---|
| 1351 | // tab-width: 4 // |
---|
| 1352 | // mode: c++ // |
---|
| 1353 | // compile-command: "make install" // |
---|
| 1354 | // End: // |
---|