source: src/Parser/TypeData.cc@ e99e43f

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr no_list persistent-indexer pthread-emulation qualifiedEnum
Last change on this file since e99e43f was f441c88, checked in by Aaron Moss <a3moss@…>, 7 years ago

Implement basetypeof
  • Property mode set to 100644
File size: 36.0 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 : Fri Nov 2 07:54:26 2018
13// Update Count : 624
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::Float80:
669 case DeclarationNode::Float128:
670 case DeclarationNode::Double:
671 case DeclarationNode::LongDouble: // not set until below
672 static BasicType::Kind floattype[3][3] = {
673 { BasicType::FloatComplex, BasicType::DoubleComplex, BasicType::LongDoubleComplex },
674 { BasicType::FloatImaginary, BasicType::DoubleImaginary, BasicType::LongDoubleImaginary },
675 { BasicType::Float, BasicType::Double, BasicType::LongDouble },
676 };
677
678 FloatingPoint: ;
679 if ( td->signedness != DeclarationNode::NoSignedness ) {
680 genTSError( DeclarationNode::signednessNames[ td->signedness ], td->basictype );
681 } // if
682 if ( td->length == DeclarationNode::Short || td->length == DeclarationNode::LongLong ) {
683 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
684 } // if
685 if ( td->basictype != DeclarationNode::Double && td->length == DeclarationNode::Long ) {
686 genTSError( DeclarationNode::lengthNames[ td->length ], td->basictype );
687 } // if
688 if ( td->length == DeclarationNode::Long ) {
689 const_cast<TypeData *>(td)->basictype = DeclarationNode::LongDouble;
690 } // if
691
692 if ( td->basictype == DeclarationNode::Float80 || td->basictype == DeclarationNode::Float128 ) {
693 // if ( td->complextype != DeclarationNode::NoComplexType ) {
694 // genTSError( DeclarationNode::complexTypeNames[ td->complextype ], td->basictype );
695 // }
696 if ( td->basictype == DeclarationNode::Float80 ) ret = BasicType::Float80;
697 else ret = BasicType::Float128;
698 break;
699 }
700
701 ret = floattype[ td->complextype ][ td->basictype - DeclarationNode::Float ];
702 break;
703
704 case DeclarationNode::NoBasicType:
705 // No basic type in declaration => default double for Complex/Imaginary and int type for integral types
706 if ( td->complextype == DeclarationNode::Complex || td->complextype == DeclarationNode::Imaginary ) {
707 const_cast<TypeData *>(td)->basictype = DeclarationNode::Double;
708 goto FloatingPoint;
709 } // if
710
711 const_cast<TypeData *>(td)->basictype = DeclarationNode::Int;
712 goto Integral;
713 default:
714 assertf( false, "unknown basic type" );
715 return nullptr;
716 } // switch
717
718 BasicType * bt = new BasicType( buildQualifiers( td ), ret );
719 buildForall( td->forall, bt->get_forall() );
720 return bt;
721} // buildBasicType
722
723
724PointerType * buildPointer( const TypeData * td ) {
725 PointerType * pt;
726 if ( td->base ) {
727 pt = new PointerType( buildQualifiers( td ), typebuild( td->base ) );
728 } else {
729 pt = new PointerType( buildQualifiers( td ), new BasicType( Type::Qualifiers(), BasicType::SignedInt ) );
730 } // if
731 buildForall( td->forall, pt->get_forall() );
732 return pt;
733} // buildPointer
734
735
736ArrayType * buildArray( const TypeData * td ) {
737 ArrayType * at;
738 if ( td->base ) {
739 at = new ArrayType( buildQualifiers( td ), typebuild( td->base ), maybeBuild< Expression >( td->array.dimension ),
740 td->array.isVarLen, td->array.isStatic );
741 } else {
742 at = new ArrayType( buildQualifiers( td ), new BasicType( Type::Qualifiers(), BasicType::SignedInt ),
743 maybeBuild< Expression >( td->array.dimension ), td->array.isVarLen, td->array.isStatic );
744 } // if
745 buildForall( td->forall, at->get_forall() );
746 return at;
747} // buildArray
748
749
750ReferenceType * buildReference( const TypeData * td ) {
751 ReferenceType * rt;
752 if ( td->base ) {
753 rt = new ReferenceType( buildQualifiers( td ), typebuild( td->base ) );
754 } else {
755 rt = new ReferenceType( buildQualifiers( td ), new BasicType( Type::Qualifiers(), BasicType::SignedInt ) );
756 } // if
757 buildForall( td->forall, rt->get_forall() );
758 return rt;
759} // buildReference
760
761
762AggregateDecl * buildAggregate( const TypeData * td, std::list< Attribute * > attributes, LinkageSpec::Spec linkage ) {
763 assert( td->kind == TypeData::Aggregate );
764 AggregateDecl * at;
765 switch ( td->aggregate.kind ) {
766 case DeclarationNode::Struct:
767 case DeclarationNode::Coroutine:
768 case DeclarationNode::Monitor:
769 case DeclarationNode::Thread:
770 at = new StructDecl( *td->aggregate.name, td->aggregate.kind, attributes, linkage );
771 buildForall( td->aggregate.params, at->get_parameters() );
772 break;
773 case DeclarationNode::Union:
774 at = new UnionDecl( *td->aggregate.name, attributes, linkage );
775 buildForall( td->aggregate.params, at->get_parameters() );
776 break;
777 case DeclarationNode::Trait:
778 at = new TraitDecl( *td->aggregate.name, attributes, linkage );
779 buildList( td->aggregate.params, at->get_parameters() );
780 break;
781 default:
782 assert( false );
783 } // switch
784
785 buildList( td->aggregate.fields, at->get_members() );
786 at->set_body( td->aggregate.body );
787
788 return at;
789} // buildAggregate
790
791
792ReferenceToType * buildComAggInst( const TypeData * type, std::list< Attribute * > attributes, LinkageSpec::Spec linkage ) {
793 switch ( type->kind ) {
794 case TypeData::Enum: {
795 if ( type->enumeration.body ) {
796 EnumDecl * typedecl = buildEnum( type, attributes, linkage );
797 return new EnumInstType( buildQualifiers( type ), typedecl );
798 } else {
799 return new EnumInstType( buildQualifiers( type ), *type->enumeration.name );
800 } // if
801 }
802 case TypeData::Aggregate: {
803 ReferenceToType * ret;
804 if ( type->aggregate.body ) {
805 AggregateDecl * typedecl = buildAggregate( type, attributes, linkage );
806 switch ( type->aggregate.kind ) {
807 case DeclarationNode::Struct:
808 case DeclarationNode::Coroutine:
809 case DeclarationNode::Monitor:
810 case DeclarationNode::Thread:
811 ret = new StructInstType( buildQualifiers( type ), (StructDecl *)typedecl );
812 break;
813 case DeclarationNode::Union:
814 ret = new UnionInstType( buildQualifiers( type ), (UnionDecl *)typedecl );
815 break;
816 case DeclarationNode::Trait:
817 assert( false );
818 //ret = new TraitInstType( buildQualifiers( type ), (TraitDecl *)typedecl );
819 break;
820 default:
821 assert( false );
822 } // switch
823 } else {
824 switch ( type->aggregate.kind ) {
825 case DeclarationNode::Struct:
826 case DeclarationNode::Coroutine:
827 case DeclarationNode::Monitor:
828 case DeclarationNode::Thread:
829 ret = new StructInstType( buildQualifiers( type ), *type->aggregate.name );
830 break;
831 case DeclarationNode::Union:
832 ret = new UnionInstType( buildQualifiers( type ), *type->aggregate.name );
833 break;
834 case DeclarationNode::Trait:
835 ret = new TraitInstType( buildQualifiers( type ), *type->aggregate.name );
836 break;
837 default:
838 assert( false );
839 } // switch
840 } // if
841 return ret;
842 }
843 default:
844 assert( false );
845 } // switch
846} // buildAggInst
847
848
849ReferenceToType * buildAggInst( const TypeData * td ) {
850 assert( td->kind == TypeData::AggregateInst );
851
852 // ReferenceToType * ret = buildComAggInst( td->aggInst.aggregate, std::list< Attribute * >() );
853 ReferenceToType * ret = nullptr;
854 TypeData * type = td->aggInst.aggregate;
855 switch ( type->kind ) {
856 case TypeData::Enum: {
857 return new EnumInstType( buildQualifiers( type ), *type->enumeration.name );
858 }
859 case TypeData::Aggregate: {
860 switch ( type->aggregate.kind ) {
861 case DeclarationNode::Struct:
862 case DeclarationNode::Coroutine:
863 case DeclarationNode::Monitor:
864 case DeclarationNode::Thread:
865 ret = new StructInstType( buildQualifiers( type ), *type->aggregate.name );
866 break;
867 case DeclarationNode::Union:
868 ret = new UnionInstType( buildQualifiers( type ), *type->aggregate.name );
869 break;
870 case DeclarationNode::Trait:
871 ret = new TraitInstType( buildQualifiers( type ), *type->aggregate.name );
872 break;
873 default:
874 assert( false );
875 } // switch
876 }
877 break;
878 default:
879 assert( false );
880 } // switch
881
882 ret->set_hoistType( td->aggInst.hoistType );
883 buildList( td->aggInst.params, ret->get_parameters() );
884 buildForall( td->forall, ret->get_forall() );
885 return ret;
886} // buildAggInst
887
888
889NamedTypeDecl * buildSymbolic( const TypeData * td, std::list< Attribute * > attributes, const string & name, Type::StorageClasses scs, LinkageSpec::Spec linkage ) {
890 assert( td->kind == TypeData::Symbolic );
891 NamedTypeDecl * ret;
892 assert( td->base );
893 if ( td->symbolic.isTypedef ) {
894 ret = new TypedefDecl( name, td->location, scs, typebuild( td->base ), linkage );
895 } else {
896 ret = new TypeDecl( name, scs, typebuild( td->base ), TypeDecl::Dtype, true );
897 } // if
898 buildList( td->symbolic.params, ret->get_parameters() );
899 buildList( td->symbolic.assertions, ret->get_assertions() );
900 ret->base->attributes.splice( ret->base->attributes.end(), attributes );
901 return ret;
902} // buildSymbolic
903
904
905EnumDecl * buildEnum( const TypeData * td, std::list< Attribute * > attributes, LinkageSpec::Spec linkage ) {
906 assert( td->kind == TypeData::Enum );
907 EnumDecl * ret = new EnumDecl( *td->enumeration.name, attributes, linkage );
908 buildList( td->enumeration.constants, ret->get_members() );
909 list< Declaration * >::iterator members = ret->get_members().begin();
910 for ( const DeclarationNode * cur = td->enumeration. constants; cur != nullptr; cur = dynamic_cast< DeclarationNode * >( cur->get_next() ), ++members ) {
911 if ( cur->has_enumeratorValue() ) {
912 ObjectDecl * member = dynamic_cast< ObjectDecl * >(* members);
913 member->set_init( new SingleInit( maybeMoveBuild< Expression >( cur->consume_enumeratorValue() ) ) );
914 } // if
915 } // for
916 ret->set_body( td->enumeration.body );
917 return ret;
918} // buildEnum
919
920
921TypeInstType * buildSymbolicInst( const TypeData * td ) {
922 assert( td->kind == TypeData::SymbolicInst );
923 TypeInstType * ret = new TypeInstType( buildQualifiers( td ), *td->symbolic.name, false );
924 buildList( td->symbolic.actuals, ret->get_parameters() );
925 buildForall( td->forall, ret->get_forall() );
926 return ret;
927} // buildSymbolicInst
928
929
930TupleType * buildTuple( const TypeData * td ) {
931 assert( td->kind == TypeData::Tuple );
932 std::list< Type * > types;
933 buildTypeList( td->tuple, types );
934 TupleType * ret = new TupleType( buildQualifiers( td ), types );
935 buildForall( td->forall, ret->get_forall() );
936 return ret;
937} // buildTuple
938
939
940TypeofType * buildTypeof( const TypeData * td ) {
941 assert( td->kind == TypeData::Typeof || td->kind == TypeData::Basetypeof );
942 assert( td->typeexpr );
943 // assert( td->typeexpr->expr );
944 return new TypeofType{
945 buildQualifiers( td ), td->typeexpr->build(), td->kind == TypeData::Basetypeof };
946} // buildTypeof
947
948
949Declaration * 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 ) {
950 if ( td->kind == TypeData::Function ) {
951 if ( td->function.idList ) { // KR function ?
952 buildKRFunction( td->function ); // transform into C11 function
953 } // if
954
955 FunctionDecl * decl;
956 Statement * stmt = maybeBuild<Statement>( td->function.body );
957 CompoundStmt * body = dynamic_cast< CompoundStmt * >( stmt );
958 decl = new FunctionDecl( name, scs, linkage, buildFunction( td ), body, attributes, funcSpec );
959 buildList( td->function.withExprs, decl->withExprs );
960 return decl->set_asmName( asmName );
961 } else if ( td->kind == TypeData::Aggregate ) {
962 return buildAggregate( td, attributes, linkage );
963 } else if ( td->kind == TypeData::Enum ) {
964 return buildEnum( td, attributes, linkage );
965 } else if ( td->kind == TypeData::Symbolic ) {
966 return buildSymbolic( td, attributes, name, scs, linkage );
967 } else {
968 return (new ObjectDecl( name, scs, linkage, bitfieldWidth, typebuild( td ), init, attributes ))->set_asmName( asmName );
969 } // if
970 return nullptr;
971} // buildDecl
972
973
974FunctionType * buildFunction( const TypeData * td ) {
975 assert( td->kind == TypeData::Function );
976 FunctionType * ft = new FunctionType( buildQualifiers( td ), ! td->function.params || td->function.params->hasEllipsis );
977 buildList( td->function.params, ft->parameters );
978 buildForall( td->forall, ft->forall );
979 if ( td->base ) {
980 switch ( td->base->kind ) {
981 case TypeData::Tuple:
982 buildList( td->base->tuple, ft->returnVals );
983 break;
984 default:
985 ft->get_returnVals().push_back( dynamic_cast< DeclarationWithType * >( buildDecl( td->base, "", Type::StorageClasses(), nullptr, Type::FuncSpecifiers(), LinkageSpec::Cforall, nullptr ) ) );
986 } // switch
987 } else {
988 ft->get_returnVals().push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new BasicType( Type::Qualifiers(), BasicType::SignedInt ), nullptr ) );
989 } // if
990 return ft;
991} // buildFunction
992
993
994// Transform KR routine declarations into C99 routine declarations:
995//
996// rtn( a, b, c ) int a, c; double b {} => int rtn( int a, double c, int b ) {}
997//
998// The type information for each post-declaration is moved to the corresponding pre-parameter and the post-declaration
999// is deleted. Note, the order of the parameter names may not be the same as the declaration names. Duplicate names and
1000// extra names are disallowed.
1001//
1002// Note, there is no KR routine-prototype syntax:
1003//
1004// rtn( a, b, c ) int a, c; double b; // invalid KR prototype
1005// rtn(); // valid KR prototype
1006
1007void buildKRFunction( const TypeData::Function_t & function ) {
1008 assert( ! function.params );
1009 // loop over declaration first as it is easier to spot errors
1010 for ( DeclarationNode * decl = function.oldDeclList; decl != nullptr; decl = dynamic_cast< DeclarationNode * >( decl->get_next() ) ) {
1011 // scan ALL parameter names for each declaration name to check for duplicates
1012 for ( DeclarationNode * param = function.idList; param != nullptr; param = dynamic_cast< DeclarationNode * >( param->get_next() ) ) {
1013 if ( *decl->name == *param->name ) {
1014 // type set => parameter name already transformed by a declaration names so there is a duplicate
1015 // declaration name attempting a second transformation
1016 if ( param->type ) SemanticError( param->location, string( "duplicate declaration name " ) + *param->name );
1017 // declaration type reset => declaration already transformed by a parameter name so there is a duplicate
1018 // parameter name attempting a second transformation
1019 if ( ! decl->type ) SemanticError( param->location, string( "duplicate parameter name " ) + *param->name );
1020 param->type = decl->type; // set copy declaration type to parameter type
1021 decl->type = nullptr; // reset declaration type
1022 param->attributes.splice( param->attributes.end(), decl->attributes ); // copy and reset attributes from declaration to parameter
1023 } // if
1024 } // for
1025 // declaration type still set => type not moved to a matching parameter so there is a missing parameter name
1026 if ( decl->type ) SemanticError( decl->location, string( "missing name in parameter list " ) + *decl->name );
1027 } // for
1028
1029 // Parameter names without a declaration default to type int:
1030 //
1031 // rtb( a, b, c ) const char * b; {} => int rtn( int a, const char * b, int c ) {}
1032
1033 for ( DeclarationNode * param = function.idList; param != nullptr; param = dynamic_cast< DeclarationNode * >( param->get_next() ) ) {
1034 if ( ! param->type ) { // generate type int for empty parameter type
1035 param->type = new TypeData( TypeData::Basic );
1036 param->type->basictype = DeclarationNode::Int;
1037 } // if
1038 } // for
1039
1040 function.params = function.idList; // newly modified idList becomes parameters
1041 function.idList = nullptr; // idList now empty
1042 delete function.oldDeclList; // deletes entire list
1043 function.oldDeclList = nullptr; // reset
1044} // buildKRFunction
1045
1046// Local Variables: //
1047// tab-width: 4 //
1048// mode: c++ //
1049// compile-command: "make install" //
1050// End: //
Note: See TracBrowser for help on using the repository browser.