source: src/Parser/DeclarationNode.cc@ 5546eee4

Last change on this file since 5546eee4 was ca9d65e, checked in by Peter A. Buhr <pabuhr@…>, 22 months ago

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