source: src/Parser/TypeData.cc@ 2890212

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 2890212 was e15853c, checked in by Peter A. Buhr <pabuhr@…>, 7 years ago

remove leading underscores in enums for _FloatNN and _Bool
  • Property mode set to 100644
File size: 36.7 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// TypeData.cc --
8//
9// Author : Rodolfo G. Esteves
10// Created On : Sat May 16 15:12:51 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Wed Feb 13 18:16:23 2019
13// Update Count : 649
14//
15
16#include <cassert> // for assert
17#include <ostream> // for operator<<, ostream, basic_ostream
18
19#include "Common/SemanticError.h" // for SemanticError
20#include "Common/utility.h" // for maybeClone, maybeBuild, maybeMoveB...
21#include "Parser/ParseNode.h" // for DeclarationNode, ExpressionNode
22#include "SynTree/Declaration.h" // for TypeDecl, ObjectDecl, FunctionDecl
23#include "SynTree/Expression.h" // for Expression, ConstantExpr (ptr only)
24#include "SynTree/Initializer.h" // for SingleInit, Initializer (ptr only)
25#include "SynTree/Statement.h" // for CompoundStmt, Statement
26#include "SynTree/Type.h" // for BasicType, Type, Type::ForallList
27#include "TypeData.h"
28
29class Attribute;
30
31using namespace std;
32
33TypeData::TypeData( Kind k ) : location( yylloc ), kind( k ), base( nullptr ), forall( nullptr ) /*, PTR1( (void*)(0xdeadbeefdeadbeef)), PTR2( (void*)(0xdeadbeefdeadbeef) ) */ {
34 switch ( kind ) {
35 case Unknown:
36 case Pointer:
37 case Reference:
38 case EnumConstant:
39 case GlobalScope:
40 // nothing else to initialize
41 break;
42 case Basic:
43 // basic = new Basic_t;
44 break;
45 case Array:
46 // array = new Array_t;
47 array.dimension = nullptr;
48 array.isVarLen = false;
49 array.isStatic = false;
50 break;
51 case Function:
52 // function = new Function_t;
53 function.params = nullptr;
54 function.idList = nullptr;
55 function.oldDeclList = nullptr;
56 function.body = nullptr;
57 function.withExprs = nullptr;
58 break;
59 // Enum is an Aggregate, so both structures are initialized together.
60 case Enum:
61 // enumeration = new Enumeration_t;
62 enumeration.name = nullptr;
63 enumeration.constants = nullptr;
64 enumeration.body = false;
65 enumeration.anon = false;
66 break;
67 case Aggregate:
68 // aggregate = new Aggregate_t;
69 aggregate.kind = DeclarationNode::NoAggregate;
70 aggregate.name = nullptr;
71 aggregate.params = nullptr;
72 aggregate.actuals = nullptr;
73 aggregate.fields = nullptr;
74 aggregate.body = false;
75 aggregate.tagged = false;
76 aggregate.parent = nullptr;
77 aggregate.anon = false;
78 break;
79 case AggregateInst:
80 // aggInst = new AggInst_t;
81 aggInst.aggregate = nullptr;
82 aggInst.params = nullptr;
83 aggInst.hoistType = false;
84 break;
85 case Symbolic:
86 case SymbolicInst:
87 // symbolic = new Symbolic_t;
88 symbolic.name = nullptr;
89 symbolic.params = nullptr;
90 symbolic.actuals = nullptr;
91 symbolic.assertions = nullptr;
92 break;
93 case Tuple:
94 // tuple = new Tuple_t;
95 tuple = nullptr;
96 break;
97 case Typeof:
98 case Basetypeof:
99 // typeexpr = new Typeof_t;
100 typeexpr = nullptr;
101 break;
102 case Builtin:
103 // builtin = new Builtin_t;
104 case Qualified:
105 qualified.parent = nullptr;
106 qualified.child = nullptr;
107 break;
108 } // switch
109} // TypeData::TypeData
110
111
112TypeData::~TypeData() {
113 delete base;
114 delete forall;
115
116 switch ( kind ) {
117 case Unknown:
118 case Pointer:
119 case Reference:
120 case EnumConstant:
121 case GlobalScope:
122 // nothing to destroy
123 break;
124 case Basic:
125 // delete basic;
126 break;
127 case Array:
128 delete array.dimension;
129 // delete array;
130 break;
131 case Function:
132 delete function.params;
133 delete function.idList;
134 delete function.oldDeclList;
135 delete function.body;
136 delete function.withExprs;
137 // delete function;
138 break;
139 case Aggregate:
140 delete aggregate.name;
141 delete aggregate.params;
142 delete aggregate.actuals;
143 delete aggregate.fields;
144 // delete aggregate;
145 break;
146 case AggregateInst:
147 delete aggInst.aggregate;
148 delete aggInst.params;
149 // delete aggInst;
150 break;
151 case Enum:
152 delete enumeration.name;
153 delete enumeration.constants;
154 // delete enumeration;
155 break;
156 case Symbolic:
157 case SymbolicInst:
158 delete symbolic.name;
159 delete symbolic.params;
160 delete symbolic.actuals;
161 delete symbolic.assertions;
162 // delete symbolic;
163 break;
164 case Tuple:
165 // delete tuple->members;
166 delete tuple;
167 break;
168 case Typeof:
169 case Basetypeof:
170 // delete typeexpr->expr;
171 delete typeexpr;
172 break;
173 case Builtin:
174 // delete builtin;
175 break;
176 case Qualified:
177 delete qualified.parent;
178 delete qualified.child;
179 } // switch
180} // TypeData::~TypeData
181
182
183TypeData * TypeData::clone() const {
184 TypeData * newtype = new TypeData( kind );
185 newtype->qualifiers = qualifiers;
186 newtype->base = maybeClone( base );
187 newtype->forall = maybeClone( forall );
188
189 switch ( kind ) {
190 case Unknown:
191 case EnumConstant:
192 case Pointer:
193 case Reference:
194 case GlobalScope:
195 // nothing else to copy
196 break;
197 case Basic:
198 newtype->basictype = basictype;
199 newtype->complextype = complextype;
200 newtype->signedness = signedness;
201 newtype->length = length;
202 break;
203 case Array:
204 newtype->array.dimension = maybeClone( array.dimension );
205 newtype->array.isVarLen = array.isVarLen;
206 newtype->array.isStatic = array.isStatic;
207 break;
208 case Function:
209 newtype->function.params = maybeClone( function.params );
210 newtype->function.idList = maybeClone( function.idList );
211 newtype->function.oldDeclList = maybeClone( function.oldDeclList );
212 newtype->function.body = maybeClone( function.body );
213 newtype->function.withExprs = maybeClone( function.withExprs );
214 break;
215 case Aggregate:
216 newtype->aggregate.kind = aggregate.kind;
217 newtype->aggregate.name = aggregate.name ? new string( *aggregate.name ) : nullptr;
218 newtype->aggregate.params = maybeClone( aggregate.params );
219 newtype->aggregate.actuals = maybeClone( aggregate.actuals );
220 newtype->aggregate.fields = maybeClone( aggregate.fields );
221 newtype->aggregate.body = aggregate.body;
222 newtype->aggregate.anon = aggregate.anon;
223 newtype->aggregate.tagged = aggregate.tagged;
224 newtype->aggregate.parent = aggregate.parent ? new string( *aggregate.parent ) : nullptr;
225 break;
226 case AggregateInst:
227 newtype->aggInst.aggregate = maybeClone( aggInst.aggregate );
228 newtype->aggInst.params = maybeClone( aggInst.params );
229 newtype->aggInst.hoistType = aggInst.hoistType;
230 break;
231 case Enum:
232 newtype->enumeration.name = enumeration.name ? new string( *enumeration.name ) : nullptr;
233 newtype->enumeration.constants = maybeClone( enumeration.constants );
234 newtype->enumeration.body = enumeration.body;
235 newtype->enumeration.anon = enumeration.anon;
236 break;
237 case Symbolic:
238 case SymbolicInst:
239 newtype->symbolic.name = symbolic.name ? new string( *symbolic.name ) : nullptr;
240 newtype->symbolic.params = maybeClone( symbolic.params );
241 newtype->symbolic.actuals = maybeClone( symbolic.actuals );
242 newtype->symbolic.assertions = maybeClone( symbolic.assertions );
243 newtype->symbolic.isTypedef = symbolic.isTypedef;
244 break;
245 case Tuple:
246 newtype->tuple = maybeClone( tuple );
247 break;
248 case Typeof:
249 case Basetypeof:
250 newtype->typeexpr = maybeClone( typeexpr );
251 break;
252 case Builtin:
253 assert( builtintype == DeclarationNode::Zero || builtintype == DeclarationNode::One );
254 newtype->builtintype = builtintype;
255 break;
256 case Qualified:
257 newtype->qualified.parent = maybeClone( qualified.parent );
258 newtype->qualified.child = maybeClone( qualified.child );
259 break;
260 } // switch
261 return newtype;
262} // TypeData::clone
263
264
265void TypeData::print( ostream &os, int indent ) const {
266 for ( int i = 0; i < Type::NumTypeQualifier; i += 1 ) {
267 if ( qualifiers[i] ) os << Type::QualifiersNames[ i ] << ' ';
268 } // for
269
270 if ( forall ) {
271 os << "forall " << endl;
272 forall->printList( os, indent + 4 );
273 } // if
274
275 switch ( kind ) {
276 case Basic:
277 if ( signedness != DeclarationNode::NoSignedness ) os << DeclarationNode::signednessNames[ signedness ] << " ";
278 if ( length != DeclarationNode::NoLength ) os << DeclarationNode::lengthNames[ length ] << " ";
279 if ( complextype == DeclarationNode::NoComplexType ) { // basic type
280 assert( basictype != DeclarationNode::NoBasicType );
281 os << DeclarationNode::basicTypeNames[ basictype ] << " ";
282 } else { // complex type
283 // handle double _Complex
284 if ( basictype != DeclarationNode::NoBasicType ) os << DeclarationNode::basicTypeNames[ basictype ] << " ";
285 os << DeclarationNode::complexTypeNames[ complextype ] << " ";
286 } // if
287 break;
288 case Pointer:
289 os << "pointer ";
290 if ( base ) {
291 os << "to ";
292 base->print( os, indent );
293 } // if
294 break;
295 case Reference:
296 os << "reference ";
297 if ( base ) {
298 os << "to ";
299 base->print( os, indent );
300 } // if
301 break;
302 case Array:
303 if ( array.isStatic ) {
304 os << "static ";
305 } // if
306 if ( array.dimension ) {
307 os << "array of ";
308 array.dimension->printOneLine( os, indent );
309 } else if ( array.isVarLen ) {
310 os << "variable-length array of ";
311 } else {
312 os << "open array of ";
313 } // if
314 if ( base ) {
315 base->print( os, indent );
316 } // if
317 break;
318 case Function:
319 os << "function" << endl;
320 if ( function.params ) {
321 os << string( indent + 2, ' ' ) << "with parameters " << endl;
322 function.params->printList( os, indent + 4 );
323 } else {
324 os << string( indent + 2, ' ' ) << "with no parameters" << endl;
325 } // if
326 if ( function.idList ) {
327 os << string( indent + 2, ' ' ) << "with old-style identifier list " << endl;
328 function.idList->printList( os, indent + 4 );
329 } // if
330 if ( function.oldDeclList ) {
331 os << string( indent + 2, ' ' ) << "with old-style declaration list " << endl;
332 function.oldDeclList->printList( os, indent + 4 );
333 } // if
334 os << string( indent + 2, ' ' ) << "returning ";
335 if ( base ) {
336 base->print( os, indent + 4 );
337 } else {
338 os << "nothing ";
339 } // if
340 os << endl;
341 if ( function.body ) {
342 os << string( indent + 2, ' ' ) << "with body " << endl;
343 function.body->printList( os, indent + 2 );
344 } // if
345 break;
346 case Aggregate:
347 os << DeclarationNode::aggregateNames[ aggregate.kind ] << ' ' << *aggregate.name << endl;
348 if ( aggregate.params ) {
349 os << string( indent + 2, ' ' ) << "with type parameters" << endl;
350 aggregate.params->printList( os, indent + 4 );
351 } // if
352 if ( aggregate.actuals ) {
353 os << string( indent + 2, ' ' ) << "instantiated with actual parameters" << endl;
354 aggregate.actuals->printList( os, indent + 4 );
355 } // if
356 if ( aggregate.fields ) {
357 os << string( indent + 2, ' ' ) << "with members" << endl;
358 aggregate.fields->printList( os, indent + 4 );
359 } // if
360 if ( aggregate.body ) {
361 os << string( indent + 2, ' ' ) << " with body" << endl;
362 } // if
363 break;
364 case AggregateInst:
365 if ( aggInst.aggregate ) {
366 os << "instance of " ;
367 aggInst.aggregate->print( os, indent );
368 } else {
369 os << "instance of an unspecified aggregate ";
370 } // if
371 if ( aggInst.params ) {
372 os << string( indent + 2, ' ' ) << "with parameters" << endl;
373 aggInst.params->printList( os, indent + 2 );
374 } // if
375 break;
376 case Enum:
377 os << "enumeration ";
378 if ( enumeration.constants ) {
379 os << "with constants" << endl;
380 enumeration.constants->printList( os, indent + 2 );
381 } // if
382 if ( enumeration.body ) {
383 os << string( indent + 2, ' ' ) << " with body" << endl;
384 } // if
385 break;
386 case EnumConstant:
387 os << "enumeration constant ";
388 break;
389 case Symbolic:
390 if ( symbolic.isTypedef ) {
391 os << "typedef definition ";
392 } else {
393 os << "type definition ";
394 } // if
395 if ( symbolic.params ) {
396 os << endl << string( indent + 2, ' ' ) << "with parameters" << endl;
397 symbolic.params->printList( os, indent + 2 );
398 } // if
399 if ( symbolic.assertions ) {
400 os << endl << string( indent + 2, ' ' ) << "with assertions" << endl;
401 symbolic.assertions->printList( os, indent + 4 );
402 os << string( indent + 2, ' ' );
403 } // if
404 if ( base ) {
405 os << "for ";
406 base->print( os, indent + 2 );
407 } // if
408 break;
409 case SymbolicInst:
410 os << *symbolic.name;
411 if ( symbolic.actuals ) {
412 os << "(";
413 symbolic.actuals->printList( os, indent + 2 );
414 os << ")";
415 } // if
416 break;
417 case Tuple:
418 os << "tuple ";
419 if ( tuple ) {
420 os << "with members" << endl;
421 tuple->printList( os, indent + 2 );
422 } // if
423 break;
424 case Basetypeof:
425 os << "base-";
426 #if defined(__GNUC__) && __GNUC__ >= 7
427 __attribute__((fallthrough));
428 #endif
429 case Typeof:
430 os << "type-of expression ";
431 if ( typeexpr ) {
432 typeexpr->print( os, indent + 2 );
433 } // if
434 break;
435 case Builtin:
436 os << DeclarationNode::builtinTypeNames[builtintype];
437 break;
438 case GlobalScope:
439 break;
440 case Qualified:
441 qualified.parent->print( os );
442 os << ".";
443 qualified.child->print( os );
444 break;
445 case Unknown:
446 os << "entity of unknown type ";
447 break;
448 default:
449 os << "internal error: TypeData::print " << kind << endl;
450 assert( false );
451 } // switch
452} // TypeData::print
453
454const std::string * TypeData::leafName() const {
455 switch ( kind ) {
456 case Unknown:
457 case Pointer:
458 case Reference:
459 case EnumConstant:
460 case GlobalScope:
461 case Array:
462 case Basic:
463 case Function:
464 case AggregateInst:
465 case Tuple:
466 case Typeof:
467 case Basetypeof:
468 case Builtin:
469 assertf(false, "Tried to get leaf name from kind without a name: %d", kind);
470 break;
471 case Aggregate:
472 return aggregate.name;
473 case Enum:
474 return enumeration.name;
475 case Symbolic:
476 case SymbolicInst:
477 return symbolic.name;
478 case Qualified:
479 return qualified.child->leafName();
480 } // switch
481 assert(false);
482}
483
484
485template< typename ForallList >
486void buildForall( const DeclarationNode * firstNode, ForallList &outputList ) {
487 buildList( firstNode, outputList );
488 auto n = firstNode;
489 for ( typename ForallList::iterator i = outputList.begin(); i != outputList.end(); ++i, n = (DeclarationNode*)n->get_next() ) {
490 TypeDecl * td = static_cast<TypeDecl *>(*i);
491 if ( n->variable.tyClass == DeclarationNode::Otype ) {
492 // add assertion parameters to `type' tyvars in reverse order
493 // add dtor: void ^?{}(T *)
494 FunctionType * dtorType = new FunctionType( Type::Qualifiers(), false );
495 dtorType->get_parameters().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new ReferenceType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), td->get_name(), *i ) ), nullptr ) );
496 td->get_assertions().push_front( new FunctionDecl( "^?{}", Type::StorageClasses(), LinkageSpec::Cforall, dtorType, nullptr ) );
497
498 // add copy ctor: void ?{}(T *, T)
499 FunctionType * copyCtorType = new FunctionType( Type::Qualifiers(), false );
500 copyCtorType->get_parameters().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new ReferenceType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), td->get_name(), *i ) ), nullptr ) );
501 copyCtorType->get_parameters().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new TypeInstType( Type::Qualifiers(), td->get_name(), *i ), nullptr ) );
502 td->get_assertions().push_front( new FunctionDecl( "?{}", Type::StorageClasses(), LinkageSpec::Cforall, copyCtorType, nullptr ) );
503
504 // add default ctor: void ?{}(T *)
505 FunctionType * ctorType = new FunctionType( Type::Qualifiers(), false );
506 ctorType->get_parameters().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new ReferenceType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), td->get_name(), *i ) ), nullptr ) );
507 td->get_assertions().push_front( new FunctionDecl( "?{}", Type::StorageClasses(), LinkageSpec::Cforall, ctorType, nullptr ) );
508
509 // add assignment operator: T * ?=?(T *, T)
510 FunctionType * assignType = new FunctionType( Type::Qualifiers(), false );
511 assignType->get_parameters().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new ReferenceType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), td->get_name(), *i ) ), nullptr ) );
512 assignType->get_parameters().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new TypeInstType( Type::Qualifiers(), td->get_name(), *i ), nullptr ) );
513 assignType->get_returnVals().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new TypeInstType( Type::Qualifiers(), td->get_name(), *i ), nullptr ) );
514 td->get_assertions().push_front( new FunctionDecl( "?=?", Type::StorageClasses(), LinkageSpec::Cforall, assignType, nullptr ) );
515 } // if
516 } // for
517} // buildForall
518
519
520Type * typebuild( const TypeData * td ) {
521 assert( td );
522 switch ( td->kind ) {
523 case TypeData::Unknown:
524 // fill in implicit int
525 return new BasicType( buildQualifiers( td ), BasicType::SignedInt );
526 case TypeData::Basic:
527 return buildBasicType( td );
528 case TypeData::Pointer:
529 return buildPointer( td );
530 case TypeData::Array:
531 return buildArray( td );
532 case TypeData::Reference:
533 return buildReference( td );
534 case TypeData::Function:
535 return buildFunction( td );
536 case TypeData::AggregateInst:
537 return buildAggInst( td );
538 case TypeData::EnumConstant:
539 // the name gets filled in later -- by SymTab::Validate
540 return new EnumInstType( buildQualifiers( td ), "" );
541 case TypeData::SymbolicInst:
542 return buildSymbolicInst( td );
543 case TypeData::Tuple:
544 return buildTuple( td );
545 case TypeData::Typeof:
546 case TypeData::Basetypeof:
547 return buildTypeof( td );
548 case TypeData::Builtin:
549 if (td->builtintype == DeclarationNode::Zero) {
550 return new ZeroType( noQualifiers );
551 }
552 else if (td->builtintype == DeclarationNode::One) {
553 return new OneType( noQualifiers );
554 }
555 else {
556 return new VarArgsType( buildQualifiers( td ) );
557 }
558 case TypeData::GlobalScope:
559 return new GlobalScopeType();
560 case TypeData::Qualified:
561 return new QualifiedType( buildQualifiers( td ), typebuild( td->qualified.parent ), typebuild( td->qualified.child ) );
562 case TypeData::Symbolic:
563 case TypeData::Enum:
564 case TypeData::Aggregate:
565 assert( false );
566 } // switch
567
568 return nullptr;
569} // typebuild
570
571
572TypeData * typeextractAggregate( const TypeData * td, bool toplevel ) {
573 TypeData * ret = nullptr;
574
575 switch ( td->kind ) {
576 case TypeData::Aggregate:
577 if ( ! toplevel && td->aggregate.body ) {
578 ret = td->clone();
579 } // if
580 break;
581 case TypeData::Enum:
582 if ( ! toplevel && td->enumeration.body ) {
583 ret = td->clone();
584 } // if
585 break;
586 case TypeData::AggregateInst:
587 if ( td->aggInst.aggregate ) {
588 ret = typeextractAggregate( td->aggInst.aggregate, false );
589 } // if
590 break;
591 default:
592 if ( td->base ) {
593 ret = typeextractAggregate( td->base, false );
594 } // if
595 } // switch
596 return ret;
597} // typeextractAggregate
598
599
600Type::Qualifiers buildQualifiers( const TypeData * td ) {
601 return td->qualifiers;
602} // buildQualifiers
603
604
605static string genTSError( string msg, DeclarationNode::BasicType basictype ) {
606 SemanticError( yylloc, string( "invalid type specifier \"" ) + msg + "\" for type \"" + DeclarationNode::basicTypeNames[basictype] + "\"." );
607} // genTSError
608
609Type * buildBasicType( const TypeData * td ) {
610 BasicType::Kind ret;
611
612 switch ( td->basictype ) {
613 case DeclarationNode::Void:
614 if ( td->signedness != DeclarationNode::NoSignedness ) {
615 genTSError( DeclarationNode::signednessNames[ td->signedness ], td->basictype );
616 } // if
617 if ( td->length != DeclarationNode::NoLength ) {
618 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
619 } // if
620 return new VoidType( buildQualifiers( td ) );
621 break;
622
623 case DeclarationNode::Bool:
624 if ( td->signedness != DeclarationNode::NoSignedness ) {
625 genTSError( DeclarationNode::signednessNames[ td->signedness ], td->basictype );
626 } // if
627 if ( td->length != DeclarationNode::NoLength ) {
628 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
629 } // if
630
631 ret = BasicType::Bool;
632 break;
633
634 case DeclarationNode::Char:
635 // C11 Standard 6.2.5.15: The three types char, signed char, and unsigned char are collectively called the
636 // character types. The implementation shall define char to have the same range, representation, and behavior as
637 // either signed char or unsigned char.
638 static BasicType::Kind chartype[] = { BasicType::SignedChar, BasicType::UnsignedChar, BasicType::Char };
639
640 if ( td->length != DeclarationNode::NoLength ) {
641 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
642 } // if
643
644 ret = chartype[ td->signedness ];
645 break;
646
647 case DeclarationNode::Int:
648 static BasicType::Kind inttype[2][4] = {
649 { BasicType::ShortSignedInt, BasicType::LongSignedInt, BasicType::LongLongSignedInt, BasicType::SignedInt },
650 { BasicType::ShortUnsignedInt, BasicType::LongUnsignedInt, BasicType::LongLongUnsignedInt, BasicType::UnsignedInt },
651 };
652
653 Integral: ;
654 if ( td->signedness == DeclarationNode::NoSignedness ) {
655 const_cast<TypeData *>(td)->signedness = DeclarationNode::Signed;
656 } // if
657 ret = inttype[ td->signedness ][ td->length ];
658 break;
659
660 case DeclarationNode::Int128:
661 ret = td->signedness == DeclarationNode::Unsigned ? BasicType::UnsignedInt128 : BasicType::SignedInt128;
662 if ( td->length != DeclarationNode::NoLength ) {
663 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
664 } // if
665 break;
666
667 case DeclarationNode::Float:
668 case DeclarationNode::Double:
669 case DeclarationNode::LongDouble: // not set until below
670 case DeclarationNode::uuFloat80:
671 case DeclarationNode::uuFloat128:
672 case DeclarationNode::uFloat16:
673 case DeclarationNode::uFloat32:
674 case DeclarationNode::uFloat32x:
675 case DeclarationNode::uFloat64:
676 case DeclarationNode::uFloat64x:
677 case DeclarationNode::uFloat128:
678 case DeclarationNode::uFloat128x:
679 static BasicType::Kind floattype[2][12] = {
680 { BasicType::FloatComplex, BasicType::DoubleComplex, BasicType::LongDoubleComplex, (BasicType::Kind)-1, (BasicType::Kind)-1, BasicType::uFloat16Complex, BasicType::uFloat32Complex, BasicType::uFloat32xComplex, BasicType::uFloat64Complex, BasicType::uFloat64xComplex, BasicType::uFloat128Complex, BasicType::uFloat128xComplex, },
681 { BasicType::Float, BasicType::Double, BasicType::LongDouble, BasicType::uuFloat80, BasicType::uuFloat128, BasicType::uFloat16, BasicType::uFloat32, BasicType::uFloat32x, BasicType::uFloat64, BasicType::uFloat64x, BasicType::uFloat128, BasicType::uFloat128x, },
682 };
683
684 FloatingPoint: ;
685 if ( td->signedness != DeclarationNode::NoSignedness ) {
686 genTSError( DeclarationNode::signednessNames[ td->signedness ], td->basictype );
687 } // if
688 if ( td->length == DeclarationNode::Short || td->length == DeclarationNode::LongLong ) {
689 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
690 } // if
691 if ( td->basictype != DeclarationNode::Double && td->length == DeclarationNode::Long ) {
692 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
693 } // if
694 if ( td->complextype == DeclarationNode::Imaginary ) {
695 genTSError( DeclarationNode::complexTypeNames[ td->complextype ], td->basictype );
696 } // if
697 if ( (td->basictype == DeclarationNode::uuFloat80 || td->basictype == DeclarationNode::uuFloat128) && td->complextype == DeclarationNode::Complex ) { // gcc unsupported
698 genTSError( DeclarationNode::complexTypeNames[ td->complextype ], td->basictype );
699 } // if
700 if ( td->length == DeclarationNode::Long ) {
701 const_cast<TypeData *>(td)->basictype = DeclarationNode::LongDouble;
702 } // if
703
704 ret = floattype[ td->complextype ][ td->basictype - DeclarationNode::Float ];
705 //printf( "XXXX %d %d %d %d\n", td->complextype, td->basictype, DeclarationNode::Float, ret );
706 break;
707
708 case DeclarationNode::NoBasicType:
709 // No basic type in declaration => default double for Complex/Imaginary and int type for integral types
710 if ( td->complextype == DeclarationNode::Complex || td->complextype == DeclarationNode::Imaginary ) {
711 const_cast<TypeData *>(td)->basictype = DeclarationNode::Double;
712 goto FloatingPoint;
713 } // if
714
715 const_cast<TypeData *>(td)->basictype = DeclarationNode::Int;
716 goto Integral;
717 default:
718 assertf( false, "unknown basic type" );
719 return nullptr;
720 } // switch
721
722 BasicType * bt = new BasicType( buildQualifiers( td ), ret );
723 buildForall( td->forall, bt->get_forall() );
724 return bt;
725} // buildBasicType
726
727
728PointerType * buildPointer( const TypeData * td ) {
729 PointerType * pt;
730 if ( td->base ) {
731 pt = new PointerType( buildQualifiers( td ), typebuild( td->base ) );
732 } else {
733 pt = new PointerType( buildQualifiers( td ), new BasicType( Type::Qualifiers(), BasicType::SignedInt ) );
734 } // if
735 buildForall( td->forall, pt->get_forall() );
736 return pt;
737} // buildPointer
738
739
740ArrayType * buildArray( const TypeData * td ) {
741 ArrayType * at;
742 if ( td->base ) {
743 at = new ArrayType( buildQualifiers( td ), typebuild( td->base ), maybeBuild< Expression >( td->array.dimension ),
744 td->array.isVarLen, td->array.isStatic );
745 } else {
746 at = new ArrayType( buildQualifiers( td ), new BasicType( Type::Qualifiers(), BasicType::SignedInt ),
747 maybeBuild< Expression >( td->array.dimension ), td->array.isVarLen, td->array.isStatic );
748 } // if
749 buildForall( td->forall, at->get_forall() );
750 return at;
751} // buildArray
752
753
754ReferenceType * buildReference( const TypeData * td ) {
755 ReferenceType * rt;
756 if ( td->base ) {
757 rt = new ReferenceType( buildQualifiers( td ), typebuild( td->base ) );
758 } else {
759 rt = new ReferenceType( buildQualifiers( td ), new BasicType( Type::Qualifiers(), BasicType::SignedInt ) );
760 } // if
761 buildForall( td->forall, rt->get_forall() );
762 return rt;
763} // buildReference
764
765
766AggregateDecl * buildAggregate( const TypeData * td, std::list< Attribute * > attributes, LinkageSpec::Spec linkage ) {
767 assert( td->kind == TypeData::Aggregate );
768 AggregateDecl * at;
769 switch ( td->aggregate.kind ) {
770 case DeclarationNode::Struct:
771 case DeclarationNode::Coroutine:
772 case DeclarationNode::Monitor:
773 case DeclarationNode::Thread:
774 at = new StructDecl( *td->aggregate.name, td->aggregate.kind, attributes, linkage );
775 buildForall( td->aggregate.params, at->get_parameters() );
776 break;
777 case DeclarationNode::Union:
778 at = new UnionDecl( *td->aggregate.name, attributes, linkage );
779 buildForall( td->aggregate.params, at->get_parameters() );
780 break;
781 case DeclarationNode::Trait:
782 at = new TraitDecl( *td->aggregate.name, attributes, linkage );
783 buildList( td->aggregate.params, at->get_parameters() );
784 break;
785 default:
786 assert( false );
787 } // switch
788
789 buildList( td->aggregate.fields, at->get_members() );
790 at->set_body( td->aggregate.body );
791
792 return at;
793} // buildAggregate
794
795
796ReferenceToType * buildComAggInst( const TypeData * type, std::list< Attribute * > attributes, LinkageSpec::Spec linkage ) {
797 switch ( type->kind ) {
798 case TypeData::Enum: {
799 if ( type->enumeration.body ) {
800 EnumDecl * typedecl = buildEnum( type, attributes, linkage );
801 return new EnumInstType( buildQualifiers( type ), typedecl );
802 } else {
803 return new EnumInstType( buildQualifiers( type ), *type->enumeration.name );
804 } // if
805 }
806 case TypeData::Aggregate: {
807 ReferenceToType * ret;
808 if ( type->aggregate.body ) {
809 AggregateDecl * typedecl = buildAggregate( type, attributes, linkage );
810 switch ( type->aggregate.kind ) {
811 case DeclarationNode::Struct:
812 case DeclarationNode::Coroutine:
813 case DeclarationNode::Monitor:
814 case DeclarationNode::Thread:
815 ret = new StructInstType( buildQualifiers( type ), (StructDecl *)typedecl );
816 break;
817 case DeclarationNode::Union:
818 ret = new UnionInstType( buildQualifiers( type ), (UnionDecl *)typedecl );
819 break;
820 case DeclarationNode::Trait:
821 assert( false );
822 //ret = new TraitInstType( buildQualifiers( type ), (TraitDecl *)typedecl );
823 break;
824 default:
825 assert( false );
826 } // switch
827 } else {
828 switch ( type->aggregate.kind ) {
829 case DeclarationNode::Struct:
830 case DeclarationNode::Coroutine:
831 case DeclarationNode::Monitor:
832 case DeclarationNode::Thread:
833 ret = new StructInstType( buildQualifiers( type ), *type->aggregate.name );
834 break;
835 case DeclarationNode::Union:
836 ret = new UnionInstType( buildQualifiers( type ), *type->aggregate.name );
837 break;
838 case DeclarationNode::Trait:
839 ret = new TraitInstType( buildQualifiers( type ), *type->aggregate.name );
840 break;
841 default:
842 assert( false );
843 } // switch
844 } // if
845 return ret;
846 }
847 default:
848 assert( false );
849 } // switch
850} // buildAggInst
851
852
853ReferenceToType * buildAggInst( const TypeData * td ) {
854 assert( td->kind == TypeData::AggregateInst );
855
856 // ReferenceToType * ret = buildComAggInst( td->aggInst.aggregate, std::list< Attribute * >() );
857 ReferenceToType * ret = nullptr;
858 TypeData * type = td->aggInst.aggregate;
859 switch ( type->kind ) {
860 case TypeData::Enum: {
861 return new EnumInstType( buildQualifiers( type ), *type->enumeration.name );
862 }
863 case TypeData::Aggregate: {
864 switch ( type->aggregate.kind ) {
865 case DeclarationNode::Struct:
866 case DeclarationNode::Coroutine:
867 case DeclarationNode::Monitor:
868 case DeclarationNode::Thread:
869 ret = new StructInstType( buildQualifiers( type ), *type->aggregate.name );
870 break;
871 case DeclarationNode::Union:
872 ret = new UnionInstType( buildQualifiers( type ), *type->aggregate.name );
873 break;
874 case DeclarationNode::Trait:
875 ret = new TraitInstType( buildQualifiers( type ), *type->aggregate.name );
876 break;
877 default:
878 assert( false );
879 } // switch
880 }
881 break;
882 default:
883 assert( false );
884 } // switch
885
886 ret->set_hoistType( td->aggInst.hoistType );
887 buildList( td->aggInst.params, ret->get_parameters() );
888 buildForall( td->forall, ret->get_forall() );
889 return ret;
890} // buildAggInst
891
892
893NamedTypeDecl * buildSymbolic( const TypeData * td, std::list< Attribute * > attributes, const string & name, Type::StorageClasses scs, LinkageSpec::Spec linkage ) {
894 assert( td->kind == TypeData::Symbolic );
895 NamedTypeDecl * ret;
896 assert( td->base );
897 if ( td->symbolic.isTypedef ) {
898 ret = new TypedefDecl( name, td->location, scs, typebuild( td->base ), linkage );
899 } else {
900 ret = new TypeDecl( name, scs, typebuild( td->base ), TypeDecl::Dtype, true );
901 } // if
902 buildList( td->symbolic.params, ret->get_parameters() );
903 buildList( td->symbolic.assertions, ret->get_assertions() );
904 ret->base->attributes.splice( ret->base->attributes.end(), attributes );
905 return ret;
906} // buildSymbolic
907
908
909EnumDecl * buildEnum( const TypeData * td, std::list< Attribute * > attributes, LinkageSpec::Spec linkage ) {
910 assert( td->kind == TypeData::Enum );
911 EnumDecl * ret = new EnumDecl( *td->enumeration.name, attributes, linkage );
912 buildList( td->enumeration.constants, ret->get_members() );
913 list< Declaration * >::iterator members = ret->get_members().begin();
914 for ( const DeclarationNode * cur = td->enumeration. constants; cur != nullptr; cur = dynamic_cast< DeclarationNode * >( cur->get_next() ), ++members ) {
915 if ( cur->has_enumeratorValue() ) {
916 ObjectDecl * member = dynamic_cast< ObjectDecl * >(* members);
917 member->set_init( new SingleInit( maybeMoveBuild< Expression >( cur->consume_enumeratorValue() ) ) );
918 } // if
919 } // for
920 ret->set_body( td->enumeration.body );
921 return ret;
922} // buildEnum
923
924
925TypeInstType * buildSymbolicInst( const TypeData * td ) {
926 assert( td->kind == TypeData::SymbolicInst );
927 TypeInstType * ret = new TypeInstType( buildQualifiers( td ), *td->symbolic.name, false );
928 buildList( td->symbolic.actuals, ret->get_parameters() );
929 buildForall( td->forall, ret->get_forall() );
930 return ret;
931} // buildSymbolicInst
932
933
934TupleType * buildTuple( const TypeData * td ) {
935 assert( td->kind == TypeData::Tuple );
936 std::list< Type * > types;
937 buildTypeList( td->tuple, types );
938 TupleType * ret = new TupleType( buildQualifiers( td ), types );
939 buildForall( td->forall, ret->get_forall() );
940 return ret;
941} // buildTuple
942
943
944TypeofType * buildTypeof( const TypeData * td ) {
945 assert( td->kind == TypeData::Typeof || td->kind == TypeData::Basetypeof );
946 assert( td->typeexpr );
947 // assert( td->typeexpr->expr );
948 return new TypeofType{
949 buildQualifiers( td ), td->typeexpr->build(), td->kind == TypeData::Basetypeof };
950} // buildTypeof
951
952
953Declaration * buildDecl( const TypeData * td, const string &name, Type::StorageClasses scs, Expression * bitfieldWidth, Type::FuncSpecifiers funcSpec, LinkageSpec::Spec linkage, Expression *asmName, Initializer * init, std::list< Attribute * > attributes ) {
954 if ( td->kind == TypeData::Function ) {
955 if ( td->function.idList ) { // KR function ?
956 buildKRFunction( td->function ); // transform into C11 function
957 } // if
958
959 FunctionDecl * decl;
960 Statement * stmt = maybeBuild<Statement>( td->function.body );
961 CompoundStmt * body = dynamic_cast< CompoundStmt * >( stmt );
962 decl = new FunctionDecl( name, scs, linkage, buildFunction( td ), body, attributes, funcSpec );
963 buildList( td->function.withExprs, decl->withExprs );
964 return decl->set_asmName( asmName );
965 } else if ( td->kind == TypeData::Aggregate ) {
966 return buildAggregate( td, attributes, linkage );
967 } else if ( td->kind == TypeData::Enum ) {
968 return buildEnum( td, attributes, linkage );
969 } else if ( td->kind == TypeData::Symbolic ) {
970 return buildSymbolic( td, attributes, name, scs, linkage );
971 } else {
972 return (new ObjectDecl( name, scs, linkage, bitfieldWidth, typebuild( td ), init, attributes ))->set_asmName( asmName );
973 } // if
974 return nullptr;
975} // buildDecl
976
977
978FunctionType * buildFunction( const TypeData * td ) {
979 assert( td->kind == TypeData::Function );
980 FunctionType * ft = new FunctionType( buildQualifiers( td ), ! td->function.params || td->function.params->hasEllipsis );
981 buildList( td->function.params, ft->parameters );
982 buildForall( td->forall, ft->forall );
983 if ( td->base ) {
984 switch ( td->base->kind ) {
985 case TypeData::Tuple:
986 buildList( td->base->tuple, ft->returnVals );
987 break;
988 default:
989 ft->get_returnVals().push_back( dynamic_cast< DeclarationWithType * >( buildDecl( td->base, "", Type::StorageClasses(), nullptr, Type::FuncSpecifiers(), LinkageSpec::Cforall, nullptr ) ) );
990 } // switch
991 } else {
992 ft->get_returnVals().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new BasicType( Type::Qualifiers(), BasicType::SignedInt ), nullptr ) );
993 } // if
994 return ft;
995} // buildFunction
996
997
998// Transform KR routine declarations into C99 routine declarations:
999//
1000// rtn( a, b, c ) int a, c; double b {} => int rtn( int a, double c, int b ) {}
1001//
1002// The type information for each post-declaration is moved to the corresponding pre-parameter and the post-declaration
1003// is deleted. Note, the order of the parameter names may not be the same as the declaration names. Duplicate names and
1004// extra names are disallowed.
1005//
1006// Note, there is no KR routine-prototype syntax:
1007//
1008// rtn( a, b, c ) int a, c; double b; // invalid KR prototype
1009// rtn(); // valid KR prototype
1010
1011void buildKRFunction( const TypeData::Function_t & function ) {
1012 assert( ! function.params );
1013 // loop over declaration first as it is easier to spot errors
1014 for ( DeclarationNode * decl = function.oldDeclList; decl != nullptr; decl = dynamic_cast< DeclarationNode * >( decl->get_next() ) ) {
1015 // scan ALL parameter names for each declaration name to check for duplicates
1016 for ( DeclarationNode * param = function.idList; param != nullptr; param = dynamic_cast< DeclarationNode * >( param->get_next() ) ) {
1017 if ( *decl->name == *param->name ) {
1018 // type set => parameter name already transformed by a declaration names so there is a duplicate
1019 // declaration name attempting a second transformation
1020 if ( param->type ) SemanticError( param->location, string( "duplicate declaration name " ) + *param->name );
1021 // declaration type reset => declaration already transformed by a parameter name so there is a duplicate
1022 // parameter name attempting a second transformation
1023 if ( ! decl->type ) SemanticError( param->location, string( "duplicate parameter name " ) + *param->name );
1024 param->type = decl->type; // set copy declaration type to parameter type
1025 decl->type = nullptr; // reset declaration type
1026 param->attributes.splice( param->attributes.end(), decl->attributes ); // copy and reset attributes from declaration to parameter
1027 } // if
1028 } // for
1029 // declaration type still set => type not moved to a matching parameter so there is a missing parameter name
1030 if ( decl->type ) SemanticError( decl->location, string( "missing name in parameter list " ) + *decl->name );
1031 } // for
1032
1033 // Parameter names without a declaration default to type int:
1034 //
1035 // rtb( a, b, c ) const char * b; {} => int rtn( int a, const char * b, int c ) {}
1036
1037 for ( DeclarationNode * param = function.idList; param != nullptr; param = dynamic_cast< DeclarationNode * >( param->get_next() ) ) {
1038 if ( ! param->type ) { // generate type int for empty parameter type
1039 param->type = new TypeData( TypeData::Basic );
1040 param->type->basictype = DeclarationNode::Int;
1041 } // if
1042 } // for
1043
1044 function.params = function.idList; // newly modified idList becomes parameters
1045 function.idList = nullptr; // idList now empty
1046 delete function.oldDeclList; // deletes entire list
1047 function.oldDeclList = nullptr; // reset
1048} // buildKRFunction
1049
1050// Local Variables: //
1051// tab-width: 4 //
1052// mode: c++ //
1053// compile-command: "make install" //
1054// End: //
Note: See TracBrowser for help on using the repository browser.