source: src/Parser/DeclarationNode.cc@ 12a1013

ADT ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 12a1013 was 68b52b0, checked in by Michael Brooks <mlbrooks@…>, 4 years ago

Implementing syntax forall( T * ) abbreviating forall( T & | sized(T) )
  • Property mode set to 100644
File size: 39.5 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 : Tue Mar 23 08:44:08 2021
13// Update Count : 1149
14//
15
16#include <cassert> // for assert, assertf, strict_dynamic_cast
17#include <iterator> // for back_insert_iterator
18#include <list> // for list
19#include <memory> // for unique_ptr
20#include <ostream> // for operator<<, ostream, basic_ostream
21#include <string> // for string, operator+, allocator, char...
22
23#include "Common/SemanticError.h" // for SemanticError
24#include "Common/UniqueName.h" // for UniqueName
25#include "Common/utility.h" // for maybeClone, maybeBuild, CodeLocation
26#include "Parser/ParseNode.h" // for DeclarationNode, ExpressionNode
27#include "SynTree/LinkageSpec.h" // for Spec, linkageName, Cforall
28#include "SynTree/Attribute.h" // for Attribute
29#include "SynTree/Declaration.h" // for TypeDecl, ObjectDecl, Declaration
30#include "SynTree/Expression.h" // for Expression, ConstantExpr
31#include "SynTree/Statement.h" // for AsmStmt
32#include "SynTree/Type.h" // for Type, Type::StorageClasses, Type::...
33#include "TypeData.h" // for TypeData, TypeData::Aggregate_t
34#include "TypedefTable.h" // for TypedefTable
35
36class Initializer;
37
38extern TypedefTable typedefTable;
39
40using namespace std;
41
42// These must harmonize with the corresponding DeclarationNode enumerations.
43const char * DeclarationNode::basicTypeNames[] = { "void", "_Bool", "char", "int", "int128",
44 "float", "double", "long double", "float80", "float128",
45 "_float16", "_float32", "_float32x", "_float64", "_float64x", "_float128", "_float128x", "NoBasicTypeNames" };
46const char * DeclarationNode::complexTypeNames[] = { "_Complex", "NoComplexTypeNames", "_Imaginary" }; // Imaginary unsupported => parse, but make invisible and print error message
47const char * DeclarationNode::signednessNames[] = { "signed", "unsigned", "NoSignednessNames" };
48const char * DeclarationNode::lengthNames[] = { "short", "long", "long long", "NoLengthNames" };
49const char * DeclarationNode::builtinTypeNames[] = { "__builtin_va_list", "__auto_type", "zero_t", "one_t", "NoBuiltinTypeNames" };
50
51UniqueName DeclarationNode::anonymous( "__anonymous" );
52
53extern LinkageSpec::Spec linkage; // defined in parser.yy
54
55DeclarationNode::DeclarationNode() :
56 linkage( ::linkage ) {
57
58// variable.name = nullptr;
59 variable.tyClass = TypeDecl::NUMBER_OF_KINDS;
60 variable.assertions = nullptr;
61 variable.initializer = nullptr;
62
63// attr.name = nullptr;
64 attr.expr = nullptr;
65 attr.type = nullptr;
66
67 assert.condition = nullptr;
68 assert.message = nullptr;
69}
70
71DeclarationNode::~DeclarationNode() {
72// delete attr.name;
73 delete attr.expr;
74 delete attr.type;
75
76// delete variable.name;
77 delete variable.assertions;
78 delete variable.initializer;
79
80 delete type;
81 delete bitfieldWidth;
82
83 delete asmStmt;
84 // asmName, no delete, passed to next stage
85 delete initializer;
86
87 delete assert.condition;
88 delete assert.message;
89}
90
91DeclarationNode * DeclarationNode::clone() const {
92 DeclarationNode * newnode = new DeclarationNode;
93 newnode->set_next( maybeClone( get_next() ) );
94 newnode->name = name ? new string( *name ) : nullptr;
95
96 newnode->builtin = NoBuiltinType;
97 newnode->type = maybeClone( type );
98 newnode->inLine = inLine;
99 newnode->storageClasses = storageClasses;
100 newnode->funcSpecs = funcSpecs;
101 newnode->bitfieldWidth = maybeClone( bitfieldWidth );
102 newnode->enumeratorValue.reset( maybeClone( enumeratorValue.get() ) );
103 newnode->hasEllipsis = hasEllipsis;
104 newnode->linkage = linkage;
105 newnode->asmName = maybeClone( asmName );
106 cloneAll( attributes, newnode->attributes );
107 newnode->initializer = maybeClone( initializer );
108 newnode->extension = extension;
109 newnode->asmStmt = maybeClone( asmStmt );
110 newnode->error = error;
111
112// newnode->variable.name = variable.name ? new string( *variable.name ) : nullptr;
113 newnode->variable.tyClass = variable.tyClass;
114 newnode->variable.assertions = maybeClone( variable.assertions );
115 newnode->variable.initializer = maybeClone( variable.initializer );
116
117// newnode->attr.name = attr.name ? new string( *attr.name ) : nullptr;
118 newnode->attr.expr = maybeClone( attr.expr );
119 newnode->attr.type = maybeClone( attr.type );
120
121 newnode->assert.condition = maybeClone( assert.condition );
122 newnode->assert.message = maybeClone( assert.message );
123 return newnode;
124} // DeclarationNode::clone
125
126void DeclarationNode::print( std::ostream & os, int indent ) const {
127 os << string( indent, ' ' );
128 if ( name ) {
129 os << *name << ": ";
130 } else {
131 os << "unnamed: ";
132 } // if
133
134 if ( linkage != LinkageSpec::Cforall ) {
135 os << LinkageSpec::name( linkage ) << " ";
136 } // if
137
138 storageClasses.print( os );
139 funcSpecs.print( os );
140
141 if ( type ) {
142 type->print( os, indent );
143 } else {
144 os << "untyped entity ";
145 } // if
146
147 if ( bitfieldWidth ) {
148 os << endl << string( indent + 2, ' ' ) << "with bitfield width ";
149 bitfieldWidth->printOneLine( os );
150 } // if
151
152 if ( initializer ) {
153 os << endl << string( indent + 2, ' ' ) << "with initializer ";
154 initializer->printOneLine( os );
155 os << " maybe constructed? " << initializer->get_maybeConstructed();
156
157 } // if
158
159 os << endl;
160}
161
162void DeclarationNode::printList( std::ostream & os, int indent ) const {
163 ParseNode::printList( os, indent );
164 if ( hasEllipsis ) {
165 os << string( indent, ' ' ) << "and a variable number of other arguments" << endl;
166 } // if
167}
168
169DeclarationNode * DeclarationNode::newStorageClass( Type::StorageClasses sc ) {
170 DeclarationNode * newnode = new DeclarationNode;
171 newnode->storageClasses = sc;
172 return newnode;
173} // DeclarationNode::newStorageClass
174
175DeclarationNode * DeclarationNode::newFuncSpecifier( Type::FuncSpecifiers fs ) {
176 DeclarationNode * newnode = new DeclarationNode;
177 newnode->funcSpecs = fs;
178 return newnode;
179} // DeclarationNode::newFuncSpecifier
180
181DeclarationNode * DeclarationNode::newTypeQualifier( Type::Qualifiers tq ) {
182 DeclarationNode * newnode = new DeclarationNode;
183 newnode->type = new TypeData();
184 newnode->type->qualifiers = tq;
185 return newnode;
186} // DeclarationNode::newQualifier
187
188DeclarationNode * DeclarationNode::newBasicType( BasicType bt ) {
189 DeclarationNode * newnode = new DeclarationNode;
190 newnode->type = new TypeData( TypeData::Basic );
191 newnode->type->basictype = bt;
192 return newnode;
193} // DeclarationNode::newBasicType
194
195DeclarationNode * DeclarationNode::newComplexType( ComplexType ct ) {
196 DeclarationNode * newnode = new DeclarationNode;
197 newnode->type = new TypeData( TypeData::Basic );
198 newnode->type->complextype = ct;
199 return newnode;
200} // DeclarationNode::newComplexType
201
202DeclarationNode * DeclarationNode::newSignedNess( Signedness sn ) {
203 DeclarationNode * newnode = new DeclarationNode;
204 newnode->type = new TypeData( TypeData::Basic );
205 newnode->type->signedness = sn;
206 return newnode;
207} // DeclarationNode::newSignedNess
208
209DeclarationNode * DeclarationNode::newLength( Length lnth ) {
210 DeclarationNode * newnode = new DeclarationNode;
211 newnode->type = new TypeData( TypeData::Basic );
212 newnode->type->length = lnth;
213 return newnode;
214} // DeclarationNode::newLength
215
216DeclarationNode * DeclarationNode::newForall( DeclarationNode * forall ) {
217 DeclarationNode * newnode = new DeclarationNode;
218 newnode->type = new TypeData( TypeData::Unknown );
219 newnode->type->forall = forall;
220 return newnode;
221} // DeclarationNode::newForall
222
223DeclarationNode * DeclarationNode::newFromGlobalScope() {
224 DeclarationNode * newnode = new DeclarationNode;
225 newnode->type = new TypeData( TypeData::GlobalScope );
226 return newnode;
227}
228
229DeclarationNode * DeclarationNode::newQualifiedType( DeclarationNode * parent, DeclarationNode * child) {
230 DeclarationNode * newnode = new DeclarationNode;
231 newnode->type = new TypeData( TypeData::Qualified );
232 newnode->type->qualified.parent = parent->type;
233 newnode->type->qualified.child = child->type;
234 parent->type = nullptr;
235 child->type = nullptr;
236 delete parent;
237 delete child;
238 return newnode;
239}
240
241DeclarationNode * DeclarationNode::newAggregate( AggregateDecl::Aggregate kind, const string * name, ExpressionNode * actuals, DeclarationNode * fields, bool body ) {
242 DeclarationNode * newnode = new DeclarationNode;
243 newnode->type = new TypeData( TypeData::Aggregate );
244 newnode->type->aggregate.kind = kind;
245 newnode->type->aggregate.name = name == nullptr ? new string( DeclarationNode::anonymous.newName() ) : name;
246 newnode->type->aggregate.actuals = actuals;
247 newnode->type->aggregate.fields = fields;
248 newnode->type->aggregate.body = body;
249 newnode->type->aggregate.tagged = false;
250 newnode->type->aggregate.parent = nullptr;
251 newnode->type->aggregate.anon = name == nullptr;
252 return newnode;
253} // DeclarationNode::newAggregate
254
255DeclarationNode * DeclarationNode::newEnum( const string * name, DeclarationNode * constants, bool body ) {
256 DeclarationNode * newnode = new DeclarationNode;
257 newnode->type = new TypeData( TypeData::Enum );
258 newnode->type->enumeration.name = name == nullptr ? new string( DeclarationNode::anonymous.newName() ) : name;
259 newnode->type->enumeration.constants = constants;
260 newnode->type->enumeration.body = body;
261 newnode->type->enumeration.anon = name == nullptr;
262 return newnode;
263} // DeclarationNode::newEnum
264
265DeclarationNode * DeclarationNode::newName( const string * name ) {
266 DeclarationNode * newnode = new DeclarationNode;
267 assert( ! newnode->name );
268 newnode->name = name;
269 return newnode;
270} // DeclarationNode::newName
271
272DeclarationNode * DeclarationNode::newEnumConstant( const string * name, ExpressionNode * constant ) {
273 DeclarationNode * newnode = newName( name );
274 newnode->enumeratorValue.reset( constant );
275 return newnode;
276} // DeclarationNode::newEnumConstant
277
278DeclarationNode * DeclarationNode::newFromTypedef( const string * name ) {
279 DeclarationNode * newnode = new DeclarationNode;
280 newnode->type = new TypeData( TypeData::SymbolicInst );
281 newnode->type->symbolic.name = name;
282 newnode->type->symbolic.isTypedef = true;
283 newnode->type->symbolic.params = nullptr;
284 return newnode;
285} // DeclarationNode::newFromTypedef
286
287DeclarationNode * DeclarationNode::newFromTypeGen( const string * name, ExpressionNode * params ) {
288 DeclarationNode * newnode = new DeclarationNode;
289 newnode->type = new TypeData( TypeData::SymbolicInst );
290 newnode->type->symbolic.name = name;
291 newnode->type->symbolic.isTypedef = false;
292 newnode->type->symbolic.actuals = params;
293 return newnode;
294} // DeclarationNode::newFromTypeGen
295
296DeclarationNode * DeclarationNode::newTypeParam( TypeDecl::Kind tc, const string * name ) {
297 DeclarationNode * newnode = newName( name );
298 newnode->type = nullptr;
299 newnode->variable.tyClass = tc;
300 newnode->variable.assertions = nullptr;
301 return newnode;
302} // DeclarationNode::newTypeParam
303
304DeclarationNode * DeclarationNode::newTrait( const string * name, DeclarationNode * params, DeclarationNode * asserts ) {
305 DeclarationNode * newnode = new DeclarationNode;
306 newnode->type = new TypeData( TypeData::Aggregate );
307 newnode->type->aggregate.name = name;
308 newnode->type->aggregate.kind = AggregateDecl::Trait;
309 newnode->type->aggregate.params = params;
310 newnode->type->aggregate.fields = asserts;
311 return newnode;
312} // DeclarationNode::newTrait
313
314DeclarationNode * DeclarationNode::newTraitUse( const string * name, ExpressionNode * params ) {
315 DeclarationNode * newnode = new DeclarationNode;
316 newnode->type = new TypeData( TypeData::AggregateInst );
317 newnode->type->aggInst.aggregate = new TypeData( TypeData::Aggregate );
318 newnode->type->aggInst.aggregate->aggregate.kind = AggregateDecl::Trait;
319 newnode->type->aggInst.aggregate->aggregate.name = name;
320 newnode->type->aggInst.params = params;
321 return newnode;
322} // DeclarationNode::newTraitUse
323
324DeclarationNode * DeclarationNode::newTypeDecl( const string * name, DeclarationNode * typeParams ) {
325 DeclarationNode * newnode = newName( name );
326 newnode->type = new TypeData( TypeData::Symbolic );
327 newnode->type->symbolic.isTypedef = false;
328 newnode->type->symbolic.params = typeParams;
329 return newnode;
330} // DeclarationNode::newTypeDecl
331
332DeclarationNode * DeclarationNode::newPointer( DeclarationNode * qualifiers, OperKinds kind ) {
333 DeclarationNode * newnode = new DeclarationNode;
334 newnode->type = new TypeData( kind == OperKinds::PointTo ? TypeData::Pointer : TypeData::Reference );
335 if ( kind == OperKinds::And ) {
336 // T && is parsed as 'And' operator rather than two references => add a second reference type
337 TypeData * td = new TypeData( TypeData::Reference );
338 td->base = newnode->type;
339 newnode->type = td;
340 }
341 if ( qualifiers ) {
342 return newnode->addQualifiers( qualifiers );
343 } else {
344 return newnode;
345 } // if
346} // DeclarationNode::newPointer
347
348DeclarationNode * DeclarationNode::newArray( ExpressionNode * size, DeclarationNode * qualifiers, bool isStatic ) {
349 DeclarationNode * newnode = new DeclarationNode;
350 newnode->type = new TypeData( TypeData::Array );
351 newnode->type->array.dimension = size;
352 newnode->type->array.isStatic = isStatic;
353 if ( newnode->type->array.dimension == nullptr || newnode->type->array.dimension->isExpressionType<ConstantExpr * >() ) {
354 newnode->type->array.isVarLen = false;
355 } else {
356 newnode->type->array.isVarLen = true;
357 } // if
358 return newnode->addQualifiers( qualifiers );
359} // DeclarationNode::newArray
360
361DeclarationNode * DeclarationNode::newVarArray( DeclarationNode * qualifiers ) {
362 DeclarationNode * newnode = new DeclarationNode;
363 newnode->type = new TypeData( TypeData::Array );
364 newnode->type->array.dimension = nullptr;
365 newnode->type->array.isStatic = false;
366 newnode->type->array.isVarLen = true;
367 return newnode->addQualifiers( qualifiers );
368}
369
370DeclarationNode * DeclarationNode::newBitfield( ExpressionNode * size ) {
371 DeclarationNode * newnode = new DeclarationNode;
372 newnode->bitfieldWidth = size;
373 return newnode;
374}
375
376DeclarationNode * DeclarationNode::newTuple( DeclarationNode * members ) {
377 DeclarationNode * newnode = new DeclarationNode;
378 newnode->type = new TypeData( TypeData::Tuple );
379 newnode->type->tuple = members;
380 return newnode;
381}
382
383DeclarationNode * DeclarationNode::newTypeof( ExpressionNode * expr, bool basetypeof ) {
384 DeclarationNode * newnode = new DeclarationNode;
385 newnode->type = new TypeData( basetypeof ? TypeData::Basetypeof : TypeData::Typeof );
386 newnode->type->typeexpr = expr;
387 return newnode;
388}
389
390DeclarationNode * DeclarationNode::newBuiltinType( BuiltinType bt ) {
391 DeclarationNode * newnode = new DeclarationNode;
392 newnode->type = new TypeData( TypeData::Builtin );
393 newnode->builtin = bt;
394 newnode->type->builtintype = newnode->builtin;
395 return newnode;
396} // DeclarationNode::newBuiltinType
397
398DeclarationNode * DeclarationNode::newFunction( const string * name, DeclarationNode * ret, DeclarationNode * param, StatementNode * body ) {
399 DeclarationNode * newnode = newName( name );
400 newnode->type = new TypeData( TypeData::Function );
401 newnode->type->function.params = param;
402 newnode->type->function.body = body;
403
404 if ( ret ) {
405 newnode->type->base = ret->type;
406 ret->type = nullptr;
407 delete ret;
408 } // if
409
410 return newnode;
411} // DeclarationNode::newFunction
412
413DeclarationNode * DeclarationNode::newAttribute( const string * name, ExpressionNode * expr ) {
414 DeclarationNode * newnode = new DeclarationNode;
415 newnode->type = nullptr;
416 std::list< Expression * > exprs;
417 buildList( expr, exprs );
418 newnode->attributes.push_back( new Attribute( *name, exprs ) );
419 delete name;
420 return newnode;
421}
422
423DeclarationNode * DeclarationNode::newDirectiveStmt( StatementNode * stmt ) {
424 DeclarationNode * newnode = new DeclarationNode;
425 newnode->directiveStmt = stmt;
426 return newnode;
427}
428
429DeclarationNode * DeclarationNode::newAsmStmt( StatementNode * stmt ) {
430 DeclarationNode * newnode = new DeclarationNode;
431 newnode->asmStmt = stmt;
432 return newnode;
433}
434
435DeclarationNode * DeclarationNode::newStaticAssert( ExpressionNode * condition, Expression * message ) {
436 DeclarationNode * newnode = new DeclarationNode;
437 newnode->assert.condition = condition;
438 newnode->assert.message = message;
439 return newnode;
440}
441
442
443void appendError( string & dst, const string & src ) {
444 if ( src.empty() ) return;
445 if ( dst.empty() ) { dst = src; return; }
446 dst += ", " + src;
447} // appendError
448
449void DeclarationNode::checkQualifiers( const TypeData * src, const TypeData * dst ) {
450 const Type::Qualifiers qsrc = src->qualifiers, qdst = dst->qualifiers; // optimization
451
452 if ( (qsrc & qdst).any() ) { // duplicates ?
453 for ( unsigned int i = 0; i < Type::NumTypeQualifier; i += 1 ) { // find duplicates
454 if ( qsrc[i] && qdst[i] ) {
455 appendError( error, string( "duplicate " ) + Type::QualifiersNames[i] );
456 } // if
457 } // for
458 } // for
459} // DeclarationNode::checkQualifiers
460
461void DeclarationNode::checkSpecifiers( DeclarationNode * src ) {
462 if ( (funcSpecs & src->funcSpecs).any() ) { // duplicates ?
463 for ( unsigned int i = 0; i < Type::NumFuncSpecifier; i += 1 ) { // find duplicates
464 if ( funcSpecs[i] && src->funcSpecs[i] ) {
465 appendError( error, string( "duplicate " ) + Type::FuncSpecifiersNames[i] );
466 } // if
467 } // for
468 } // if
469
470 if ( storageClasses.any() && src->storageClasses.any() ) { // any reason to check ?
471 if ( (storageClasses & src->storageClasses ).any() ) { // duplicates ?
472 for ( unsigned int i = 0; i < Type::NumStorageClass; i += 1 ) { // find duplicates
473 if ( storageClasses[i] && src->storageClasses[i] ) {
474 appendError( error, string( "duplicate " ) + Type::StorageClassesNames[i] );
475 } // if
476 } // for
477 // src is the new item being added and has a single bit
478 } else if ( ! src->storageClasses.is_threadlocal ) { // conflict ?
479 appendError( error, string( "conflicting " ) + Type::StorageClassesNames[storageClasses.ffs()] +
480 " & " + Type::StorageClassesNames[src->storageClasses.ffs()] );
481 src->storageClasses.reset(); // FIX to preserve invariant of one basic storage specifier
482 } // if
483 } // if
484
485 appendError( error, src->error );
486} // DeclarationNode::checkSpecifiers
487
488DeclarationNode * DeclarationNode::copySpecifiers( DeclarationNode * q ) {
489 funcSpecs |= q->funcSpecs;
490 storageClasses |= q->storageClasses;
491
492 for ( Attribute *attr: reverseIterate( q->attributes ) ) {
493 attributes.push_front( attr->clone() );
494 } // for
495 return this;
496} // DeclarationNode::copySpecifiers
497
498static void addQualifiersToType( TypeData *& src, TypeData * dst ) {
499 if ( dst->base ) {
500 addQualifiersToType( src, dst->base );
501 } else if ( dst->kind == TypeData::Function ) {
502 dst->base = src;
503 src = nullptr;
504 } else {
505 dst->qualifiers |= src->qualifiers;
506 } // if
507} // addQualifiersToType
508
509DeclarationNode * DeclarationNode::addQualifiers( DeclarationNode * q ) {
510 if ( ! q ) { return this; } // empty qualifier
511
512 checkSpecifiers( q );
513 copySpecifiers( q );
514
515 if ( ! q->type ) { delete q; return this; }
516
517 if ( ! type ) {
518 type = q->type; // reuse structure
519 q->type = nullptr;
520 delete q;
521 return this;
522 } // if
523
524 if ( q->type->forall ) { // forall qualifier ?
525 if ( type->forall ) { // polymorphic routine ?
526 type->forall->appendList( q->type->forall ); // augment forall qualifier
527 } else {
528 if ( type->kind == TypeData::Aggregate ) { // struct/union ?
529 if ( type->aggregate.params ) { // polymorphic ?
530 type->aggregate.params->appendList( q->type->forall ); // augment forall qualifier
531 } else { // not polymorphic
532 type->aggregate.params = q->type->forall; // set forall qualifier
533 } // if
534 } else { // not polymorphic
535 type->forall = q->type->forall; // make polymorphic routine
536 } // if
537 } // if
538 q->type->forall = nullptr; // forall qualifier moved
539 } // if
540
541 checkQualifiers( type, q->type );
542 if ( (builtin == Zero || builtin == One) && q->type->qualifiers.val != 0 && error.length() == 0 ) {
543 SemanticWarning( yylloc, Warning::BadQualifiersZeroOne, Type::QualifiersNames[ilog2( q->type->qualifiers.val )], builtinTypeNames[builtin] );
544 } // if
545 addQualifiersToType( q->type, type );
546
547 delete q;
548 return this;
549} // addQualifiers
550
551static void addTypeToType( TypeData *& src, TypeData *& dst ) {
552 if ( src->forall && dst->kind == TypeData::Function ) {
553 if ( dst->forall ) {
554 dst->forall->appendList( src->forall );
555 } else {
556 dst->forall = src->forall;
557 } // if
558 src->forall = nullptr;
559 } // if
560 if ( dst->base ) {
561 addTypeToType( src, dst->base );
562 } else {
563 switch ( dst->kind ) {
564 case TypeData::Unknown:
565 src->qualifiers |= dst->qualifiers;
566 dst = src;
567 src = nullptr;
568 break;
569 case TypeData::Basic:
570 dst->qualifiers |= src->qualifiers;
571 if ( src->kind != TypeData::Unknown ) {
572 assert( src->kind == TypeData::Basic );
573
574 if ( dst->basictype == DeclarationNode::NoBasicType ) {
575 dst->basictype = src->basictype;
576 } else if ( src->basictype != DeclarationNode::NoBasicType )
577 SemanticError( yylloc, src, string( "conflicting type specifier " ) + DeclarationNode::basicTypeNames[ src->basictype ] + " in type: " );
578
579 if ( dst->complextype == DeclarationNode::NoComplexType ) {
580 dst->complextype = src->complextype;
581 } else if ( src->complextype != DeclarationNode::NoComplexType )
582 SemanticError( yylloc, src, string( "conflicting type specifier " ) + DeclarationNode::complexTypeNames[ src->complextype ] + " in type: " );
583
584 if ( dst->signedness == DeclarationNode::NoSignedness ) {
585 dst->signedness = src->signedness;
586 } else if ( src->signedness != DeclarationNode::NoSignedness )
587 SemanticError( yylloc, src, string( "conflicting type specifier " ) + DeclarationNode::signednessNames[ src->signedness ] + " in type: " );
588
589 if ( dst->length == DeclarationNode::NoLength ) {
590 dst->length = src->length;
591 } else if ( dst->length == DeclarationNode::Long && src->length == DeclarationNode::Long ) {
592 dst->length = DeclarationNode::LongLong;
593 } else if ( src->length != DeclarationNode::NoLength )
594 SemanticError( yylloc, src, string( "conflicting type specifier " ) + DeclarationNode::lengthNames[ src->length ] + " in type: " );
595 } // if
596 break;
597 default:
598 switch ( src->kind ) {
599 case TypeData::Aggregate:
600 case TypeData::Enum:
601 dst->base = new TypeData( TypeData::AggregateInst );
602 dst->base->aggInst.aggregate = src;
603 if ( src->kind == TypeData::Aggregate ) {
604 dst->base->aggInst.params = maybeClone( src->aggregate.actuals );
605 } // if
606 dst->base->qualifiers |= src->qualifiers;
607 src = nullptr;
608 break;
609 default:
610 if ( dst->forall ) {
611 dst->forall->appendList( src->forall );
612 } else {
613 dst->forall = src->forall;
614 } // if
615 src->forall = nullptr;
616 dst->base = src;
617 src = nullptr;
618 } // switch
619 } // switch
620 } // if
621}
622
623DeclarationNode * DeclarationNode::addType( DeclarationNode * o ) {
624 if ( o ) {
625 checkSpecifiers( o );
626 copySpecifiers( o );
627 if ( o->type ) {
628 if ( ! type ) {
629 if ( o->type->kind == TypeData::Aggregate || o->type->kind == TypeData::Enum ) {
630 type = new TypeData( TypeData::AggregateInst );
631 type->aggInst.aggregate = o->type;
632 if ( o->type->kind == TypeData::Aggregate ) {
633 type->aggInst.hoistType = o->type->aggregate.body;
634 type->aggInst.params = maybeClone( o->type->aggregate.actuals );
635 } else {
636 type->aggInst.hoistType = o->type->enumeration.body;
637 } // if
638 type->qualifiers |= o->type->qualifiers;
639 } else {
640 type = o->type;
641 } // if
642 o->type = nullptr;
643 } else {
644 addTypeToType( o->type, type );
645 } // if
646 } // if
647 if ( o->bitfieldWidth ) {
648 bitfieldWidth = o->bitfieldWidth;
649 } // if
650
651 // there may be typedefs chained onto the type
652 if ( o->get_next() ) {
653 set_last( o->get_next()->clone() );
654 } // if
655 } // if
656 delete o;
657 return this;
658}
659
660DeclarationNode * DeclarationNode::addTypedef() {
661 TypeData * newtype = new TypeData( TypeData::Symbolic );
662 newtype->symbolic.params = nullptr;
663 newtype->symbolic.isTypedef = true;
664 newtype->symbolic.name = name ? new string( *name ) : nullptr;
665 newtype->base = type;
666 type = newtype;
667 return this;
668}
669
670DeclarationNode * DeclarationNode::addAssertions( DeclarationNode * assertions ) {
671 if ( variable.tyClass != TypeDecl::NUMBER_OF_KINDS ) {
672 if ( variable.assertions ) {
673 variable.assertions->appendList( assertions );
674 } else {
675 variable.assertions = assertions;
676 } // if
677 return this;
678 } // if
679
680 assert( type );
681 switch ( type->kind ) {
682 case TypeData::Symbolic:
683 if ( type->symbolic.assertions ) {
684 type->symbolic.assertions->appendList( assertions );
685 } else {
686 type->symbolic.assertions = assertions;
687 } // if
688 break;
689 default:
690 assert( false );
691 } // switch
692
693 return this;
694}
695
696DeclarationNode * DeclarationNode::addName( string * newname ) {
697 assert( ! name );
698 name = newname;
699 return this;
700}
701
702DeclarationNode * DeclarationNode::addAsmName( DeclarationNode * newname ) {
703 assert( ! asmName );
704 asmName = newname ? newname->asmName : nullptr;
705 return this->addQualifiers( newname );
706}
707
708DeclarationNode * DeclarationNode::addBitfield( ExpressionNode * size ) {
709 bitfieldWidth = size;
710 return this;
711}
712
713DeclarationNode * DeclarationNode::addVarArgs() {
714 assert( type );
715 hasEllipsis = true;
716 return this;
717}
718
719DeclarationNode * DeclarationNode::addFunctionBody( StatementNode * body, ExpressionNode * withExprs ) {
720 assert( type );
721 assert( type->kind == TypeData::Function );
722 assert( ! type->function.body );
723 type->function.body = body;
724 type->function.withExprs = withExprs;
725 return this;
726}
727
728DeclarationNode * DeclarationNode::addOldDeclList( DeclarationNode * list ) {
729 assert( type );
730 assert( type->kind == TypeData::Function );
731 assert( ! type->function.oldDeclList );
732 type->function.oldDeclList = list;
733 return this;
734}
735
736DeclarationNode * DeclarationNode::setBase( TypeData * newType ) {
737 if ( type ) {
738 TypeData * prevBase = type;
739 TypeData * curBase = type->base;
740 while ( curBase != nullptr ) {
741 prevBase = curBase;
742 curBase = curBase->base;
743 } // while
744 prevBase->base = newType;
745 } else {
746 type = newType;
747 } // if
748 return this;
749}
750
751DeclarationNode * DeclarationNode::copyAttribute( DeclarationNode * a ) {
752 if ( a ) {
753 for ( Attribute *attr: reverseIterate( a->attributes ) ) {
754 attributes.push_front( attr );
755 } // for
756 a->attributes.clear();
757 } // if
758 return this;
759} // copyAttribute
760
761DeclarationNode * DeclarationNode::addPointer( DeclarationNode * p ) {
762 if ( p ) {
763 assert( p->type->kind == TypeData::Pointer || p->type->kind == TypeData::Reference );
764 setBase( p->type );
765 p->type = nullptr;
766 copyAttribute( p );
767 delete p;
768 } // if
769 return this;
770}
771
772DeclarationNode * DeclarationNode::addArray( DeclarationNode * a ) {
773 if ( a ) {
774 assert( a->type->kind == TypeData::Array );
775 setBase( a->type );
776 a->type = nullptr;
777 copyAttribute( a );
778 delete a;
779 } // if
780 return this;
781}
782
783DeclarationNode * DeclarationNode::addNewPointer( DeclarationNode * p ) {
784 if ( p ) {
785 assert( p->type->kind == TypeData::Pointer || p->type->kind == TypeData::Reference );
786 if ( type ) {
787 switch ( type->kind ) {
788 case TypeData::Aggregate:
789 case TypeData::Enum:
790 p->type->base = new TypeData( TypeData::AggregateInst );
791 p->type->base->aggInst.aggregate = type;
792 if ( type->kind == TypeData::Aggregate ) {
793 p->type->base->aggInst.params = maybeClone( type->aggregate.actuals );
794 } // if
795 p->type->base->qualifiers |= type->qualifiers;
796 break;
797
798 default:
799 p->type->base = type;
800 } // switch
801 type = nullptr;
802 } // if
803 delete this;
804 return p;
805 } else {
806 return this;
807 } // if
808}
809
810static TypeData * findLast( TypeData * a ) {
811 assert( a );
812 TypeData * cur = a;
813 while ( cur->base ) {
814 cur = cur->base;
815 } // while
816 return cur;
817}
818
819DeclarationNode * DeclarationNode::addNewArray( DeclarationNode * a ) {
820 if ( ! a ) return this;
821 assert( a->type->kind == TypeData::Array );
822 TypeData * lastArray = findLast( a->type );
823 if ( type ) {
824 switch ( type->kind ) {
825 case TypeData::Aggregate:
826 case TypeData::Enum:
827 lastArray->base = new TypeData( TypeData::AggregateInst );
828 lastArray->base->aggInst.aggregate = type;
829 if ( type->kind == TypeData::Aggregate ) {
830 lastArray->base->aggInst.params = maybeClone( type->aggregate.actuals );
831 } // if
832 lastArray->base->qualifiers |= type->qualifiers;
833 break;
834 default:
835 lastArray->base = type;
836 } // switch
837 type = nullptr;
838 } // if
839 delete this;
840 return a;
841}
842
843DeclarationNode * DeclarationNode::addParamList( DeclarationNode * params ) {
844 TypeData * ftype = new TypeData( TypeData::Function );
845 ftype->function.params = params;
846 setBase( ftype );
847 return this;
848}
849
850static TypeData * addIdListToType( TypeData * type, DeclarationNode * ids ) {
851 if ( type ) {
852 if ( type->kind != TypeData::Function ) {
853 type->base = addIdListToType( type->base, ids );
854 } else {
855 type->function.idList = ids;
856 } // if
857 return type;
858 } else {
859 TypeData * newtype = new TypeData( TypeData::Function );
860 newtype->function.idList = ids;
861 return newtype;
862 } // if
863} // addIdListToType
864
865DeclarationNode * DeclarationNode::addIdList( DeclarationNode * ids ) {
866 type = addIdListToType( type, ids );
867 return this;
868}
869
870DeclarationNode * DeclarationNode::addInitializer( InitializerNode * init ) {
871 initializer = init;
872 return this;
873}
874
875DeclarationNode * DeclarationNode::addTypeInitializer( DeclarationNode * init ) {
876 assertf( variable.tyClass != TypeDecl::NUMBER_OF_KINDS, "Called addTypeInitializer on something that isn't a type variable." );
877 variable.initializer = init;
878 return this;
879}
880
881DeclarationNode * DeclarationNode::cloneType( string * name ) {
882 DeclarationNode * newnode = newName( name );
883 newnode->type = maybeClone( type );
884 newnode->copySpecifiers( this );
885 return newnode;
886}
887
888DeclarationNode * DeclarationNode::cloneBaseType( DeclarationNode * o ) {
889 if ( ! o ) return nullptr;
890
891 o->copySpecifiers( this );
892 if ( type ) {
893 TypeData * srcType = type;
894
895 // search for the base type by scanning off pointers and array designators
896 while ( srcType->base ) {
897 srcType = srcType->base;
898 } // while
899
900 TypeData * newType = srcType->clone();
901 if ( newType->kind == TypeData::AggregateInst ) {
902 // don't duplicate members
903 if ( newType->aggInst.aggregate->kind == TypeData::Enum ) {
904 delete newType->aggInst.aggregate->enumeration.constants;
905 newType->aggInst.aggregate->enumeration.constants = nullptr;
906 newType->aggInst.aggregate->enumeration.body = false;
907 } else {
908 assert( newType->aggInst.aggregate->kind == TypeData::Aggregate );
909 delete newType->aggInst.aggregate->aggregate.fields;
910 newType->aggInst.aggregate->aggregate.fields = nullptr;
911 newType->aggInst.aggregate->aggregate.body = false;
912 } // if
913 // don't hoist twice
914 newType->aggInst.hoistType = false;
915 } // if
916
917 newType->forall = maybeClone( type->forall );
918 if ( ! o->type ) {
919 o->type = newType;
920 } else {
921 addTypeToType( newType, o->type );
922 delete newType;
923 } // if
924 } // if
925 return o;
926}
927
928DeclarationNode * DeclarationNode::extractAggregate() const {
929 if ( type ) {
930 TypeData * ret = typeextractAggregate( type );
931 if ( ret ) {
932 DeclarationNode * newnode = new DeclarationNode;
933 newnode->type = ret;
934 return newnode;
935 } // if
936 } // if
937 return nullptr;
938}
939
940void buildList( const DeclarationNode * firstNode, std::list< Declaration * > & outputList ) {
941 SemanticErrorException errors;
942 std::back_insert_iterator< std::list< Declaration * > > out( outputList );
943
944 for ( const DeclarationNode * cur = firstNode; cur; cur = dynamic_cast< DeclarationNode * >( cur->get_next() ) ) {
945 try {
946 bool extracted = false;
947 bool anon = false;
948 if ( DeclarationNode * extr = cur->extractAggregate() ) {
949 // handle the case where a structure declaration is contained within an object or type declaration
950 Declaration * decl = extr->build();
951 if ( decl ) {
952 // hoist the structure declaration
953 decl->location = cur->location;
954 * out++ = decl;
955
956 // need to remember the cases where a declaration contains an anonymous aggregate definition
957 extracted = true;
958 assert( extr->type );
959 if ( extr->type->kind == TypeData::Aggregate ) {
960 anon = extr->type->aggregate.anon;
961 } else if ( extr->type->kind == TypeData::Enum ) {
962 // xxx - is it useful to have an implicit anonymous enum member?
963 anon = extr->type->enumeration.anon;
964 }
965 } // if
966 delete extr;
967 } // if
968
969 Declaration * decl = cur->build();
970 if ( decl ) {
971 // don't include anonymous declaration for named aggregates, but do include them for anonymous aggregates, e.g.:
972 // struct S {
973 // struct T { int x; }; // no anonymous member
974 // struct { int y; }; // anonymous member
975 // struct T; // anonymous member
976 // };
977 if ( ! (extracted && decl->name == "" && ! anon && ! cur->get_inLine()) ) {
978 if ( decl->name == "" ) {
979 if ( DeclarationWithType * dwt = dynamic_cast<DeclarationWithType *>( decl ) ) {
980 if ( ReferenceToType * aggr = dynamic_cast<ReferenceToType *>( dwt->get_type() ) ) {
981 if ( aggr->name.find("anonymous") == std::string::npos ) {
982 if ( ! cur->get_inLine() ) {
983 // temporary: warn about anonymous member declarations of named types, since
984 // this conflicts with the syntax for the forward declaration of an anonymous type
985 SemanticWarning( cur->location, Warning::AggrForwardDecl, aggr->name.c_str() );
986 } // if
987 } // if
988 } // if
989 } // if
990 } // if
991 decl->location = cur->location;
992 *out++ = decl;
993 } // if
994 } // if
995 } catch( SemanticErrorException & e ) {
996 errors.append( e );
997 } // try
998 } // for
999
1000 if ( ! errors.isEmpty() ) {
1001 throw errors;
1002 } // if
1003} // buildList
1004
1005// currently only builds assertions, function parameters, and return values
1006void buildList( const DeclarationNode * firstNode, std::list< DeclarationWithType * > & outputList ) {
1007 SemanticErrorException errors;
1008 std::back_insert_iterator< std::list< DeclarationWithType * > > out( outputList );
1009
1010 for ( const DeclarationNode * cur = firstNode; cur; cur = dynamic_cast< DeclarationNode * >( cur->get_next() ) ) {
1011 try {
1012 Declaration * decl = cur->build();
1013 assert( decl );
1014 if ( DeclarationWithType * dwt = dynamic_cast< DeclarationWithType * >( decl ) ) {
1015 dwt->location = cur->location;
1016 *out++ = dwt;
1017 } else if ( StructDecl * agg = dynamic_cast< StructDecl * >( decl ) ) {
1018 // e.g., int foo(struct S) {}
1019 StructInstType * inst = new StructInstType( Type::Qualifiers(), agg->name );
1020 auto obj = new ObjectDecl( "", Type::StorageClasses(), linkage, nullptr, inst, nullptr );
1021 obj->location = cur->location;
1022 *out++ = obj;
1023 delete agg;
1024 } else if ( UnionDecl * agg = dynamic_cast< UnionDecl * >( decl ) ) {
1025 // e.g., int foo(union U) {}
1026 UnionInstType * inst = new UnionInstType( Type::Qualifiers(), agg->name );
1027 auto obj = new ObjectDecl( "", Type::StorageClasses(), linkage, nullptr, inst, nullptr );
1028 obj->location = cur->location;
1029 *out++ = obj;
1030 } else if ( EnumDecl * agg = dynamic_cast< EnumDecl * >( decl ) ) {
1031 // e.g., int foo(enum E) {}
1032 EnumInstType * inst = new EnumInstType( Type::Qualifiers(), agg->name );
1033 auto obj = new ObjectDecl( "", Type::StorageClasses(), linkage, nullptr, inst, nullptr );
1034 obj->location = cur->location;
1035 *out++ = obj;
1036 } // if
1037 } catch( SemanticErrorException & e ) {
1038 errors.append( e );
1039 } // try
1040 } // for
1041
1042 if ( ! errors.isEmpty() ) {
1043 throw errors;
1044 } // if
1045} // buildList
1046
1047void buildTypeList( const DeclarationNode * firstNode, std::list< Type * > & outputList ) {
1048 SemanticErrorException errors;
1049 std::back_insert_iterator< std::list< Type * > > out( outputList );
1050 const DeclarationNode * cur = firstNode;
1051
1052 while ( cur ) {
1053 try {
1054 * out++ = cur->buildType();
1055 } catch( SemanticErrorException & e ) {
1056 errors.append( e );
1057 } // try
1058 cur = dynamic_cast< DeclarationNode * >( cur->get_next() );
1059 } // while
1060
1061 if ( ! errors.isEmpty() ) {
1062 throw errors;
1063 } // if
1064} // buildTypeList
1065
1066Declaration * DeclarationNode::build() const {
1067 if ( ! error.empty() ) SemanticError( this, error + " in declaration of " );
1068
1069 if ( asmStmt ) {
1070 return new AsmDecl( strict_dynamic_cast<AsmStmt *>( asmStmt->build() ) );
1071 } // if
1072 if ( directiveStmt ) {
1073 return new DirectiveDecl( strict_dynamic_cast<DirectiveStmt *>( directiveStmt->build() ) );
1074 } // if
1075
1076 if ( variable.tyClass != TypeDecl::NUMBER_OF_KINDS ) {
1077 // otype is internally converted to dtype + otype parameters
1078 static const TypeDecl::Kind kindMap[] = { TypeDecl::Dtype, TypeDecl::Dtype, TypeDecl::Dtype, TypeDecl::Ftype, TypeDecl::Ttype, TypeDecl::Dimension };
1079 static_assert( sizeof(kindMap) / sizeof(kindMap[0]) == TypeDecl::NUMBER_OF_KINDS, "DeclarationNode::build: kindMap is out of sync." );
1080 assertf( variable.tyClass < sizeof(kindMap)/sizeof(kindMap[0]), "Variable's tyClass is out of bounds." );
1081 TypeDecl * ret = new TypeDecl( *name, Type::StorageClasses(), nullptr, kindMap[ variable.tyClass ], variable.tyClass == TypeDecl::Otype || variable.tyClass == TypeDecl::DStype, variable.initializer ? variable.initializer->buildType() : nullptr );
1082 buildList( variable.assertions, ret->get_assertions() );
1083 return ret;
1084 } // if
1085
1086 if ( type ) {
1087 // Function specifiers can only appear on a function definition/declaration.
1088 //
1089 // inline _Noreturn int f(); // allowed
1090 // inline _Noreturn int g( int i ); // allowed
1091 // inline _Noreturn int i; // disallowed
1092 if ( type->kind != TypeData::Function && funcSpecs.any() ) {
1093 SemanticError( this, "invalid function specifier for " );
1094 } // if
1095 // Forall qualifier can only appear on a function/aggregate definition/declaration.
1096 //
1097 // forall int f(); // allowed
1098 // forall int g( int i ); // allowed
1099 // forall int i; // disallowed
1100 if ( type->kind != TypeData::Function && type->forall ) {
1101 SemanticError( this, "invalid type qualifier for " );
1102 } // if
1103 bool isDelete = initializer && initializer->get_isDelete();
1104 Declaration * decl = buildDecl( type, name ? *name : string( "" ), storageClasses, maybeBuild< Expression >( bitfieldWidth ), funcSpecs, linkage, asmName, isDelete ? nullptr : maybeBuild< Initializer >(initializer), attributes )->set_extension( extension );
1105 if ( isDelete ) {
1106 DeclarationWithType * dwt = strict_dynamic_cast<DeclarationWithType *>( decl );
1107 dwt->isDeleted = true;
1108 }
1109 return decl;
1110 } // if
1111
1112 if ( assert.condition ) {
1113 return new StaticAssertDecl( maybeBuild< Expression >( assert.condition ), strict_dynamic_cast< ConstantExpr * >( maybeClone( assert.message ) ) );
1114 }
1115
1116 // SUE's cannot have function specifiers, either
1117 //
1118 // inline _Noreturn struct S { ... }; // disallowed
1119 // inline _Noreturn enum E { ... }; // disallowed
1120 if ( funcSpecs.any() ) {
1121 SemanticError( this, "invalid function specifier for " );
1122 } // if
1123 assertf( name, "ObjectDecl must a have name\n" );
1124 return (new ObjectDecl( *name, storageClasses, linkage, maybeBuild< Expression >( bitfieldWidth ), nullptr, maybeBuild< Initializer >( initializer ) ))->set_asmName( asmName )->set_extension( extension );
1125}
1126
1127Type * DeclarationNode::buildType() const {
1128 assert( type );
1129
1130 if ( attr.expr ) {
1131 return new AttrType( buildQualifiers( type ), *name, attr.expr->build(), attributes );
1132 } else if ( attr.type ) {
1133 return new AttrType( buildQualifiers( type ), *name, attr.type->buildType(), attributes );
1134 } // if
1135
1136 switch ( type->kind ) {
1137 case TypeData::Enum:
1138 case TypeData::Aggregate: {
1139 ReferenceToType * ret = buildComAggInst( type, attributes, linkage );
1140 buildList( type->aggregate.actuals, ret->get_parameters() );
1141 return ret;
1142 }
1143 case TypeData::Symbolic: {
1144 TypeInstType * ret = new TypeInstType( buildQualifiers( type ), *type->symbolic.name, false, attributes );
1145 buildList( type->symbolic.actuals, ret->get_parameters() );
1146 return ret;
1147 }
1148 default:
1149 Type * simpletypes = typebuild( type );
1150 simpletypes->get_attributes() = attributes; // copy because member is const
1151 return simpletypes;
1152 } // switch
1153}
1154
1155// Local Variables: //
1156// tab-width: 4 //
1157// mode: c++ //
1158// compile-command: "make install" //
1159// End: //
Note: See TracBrowser for help on using the repository browser.