source: src/SymTab/Validate.cc@ b67dc146

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor deferred_resn demangler enum forall-pointer-decay gc_noraii jacob/cs343-translation jenkins-sandbox memory new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since b67dc146 was 83de11e, checked in by Rob Schluntz <rschlunt@…>, 9 years ago

fix invalid use of lists that caused a crash in gcc versions larger than 4.9.3C
  • Property mode set to 100644
File size: 26.1 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// Validate.cc --
8//
9// Author : Richard C. Bilson
10// Created On : Sun May 17 21:50:04 2015
11// Last Modified By : Rob Schluntz
12// Last Modified On : Wed May 11 13:17:52 2016
13// Update Count : 297
14//
15
16// The "validate" phase of translation is used to take a syntax tree and convert it into a standard form that aims to be
17// as regular in structure as possible. Some assumptions can be made regarding the state of the tree after this pass is
18// complete, including:
19//
20// - No nested structure or union definitions; any in the input are "hoisted" to the level of the containing struct or
21// union.
22//
23// - All enumeration constants have type EnumInstType.
24//
25// - The type "void" never occurs in lists of function parameter or return types; neither do tuple types. A function
26// taking no arguments has no argument types, and tuples are flattened.
27//
28// - No context instances exist; they are all replaced by the set of declarations signified by the context, instantiated
29// by the particular set of type arguments.
30//
31// - Every declaration is assigned a unique id.
32//
33// - No typedef declarations or instances exist; the actual type is substituted for each instance.
34//
35// - Each type, struct, and union definition is followed by an appropriate assignment operator.
36//
37// - Each use of a struct or union is connected to a complete definition of that struct or union, even if that
38// definition occurs later in the input.
39
40#include <list>
41#include <iterator>
42#include "Common/utility.h"
43#include "Common/UniqueName.h"
44#include "Validate.h"
45#include "SynTree/Visitor.h"
46#include "SynTree/Mutator.h"
47#include "SynTree/Type.h"
48#include "SynTree/Expression.h"
49#include "SynTree/Statement.h"
50#include "SynTree/TypeSubstitution.h"
51#include "Indexer.h"
52#include "FixFunction.h"
53// #include "ImplementationType.h"
54#include "GenPoly/DeclMutator.h"
55#include "AddVisit.h"
56#include "MakeLibCfa.h"
57#include "TypeEquality.h"
58#include "Autogen.h"
59#include "ResolvExpr/typeops.h"
60
61#define debugPrint( x ) if ( doDebug ) { std::cout << x; }
62
63namespace SymTab {
64 class HoistStruct : public Visitor {
65 public:
66 /// Flattens nested struct types
67 static void hoistStruct( std::list< Declaration * > &translationUnit );
68
69 std::list< Declaration * > &get_declsToAdd() { return declsToAdd; }
70
71 virtual void visit( StructDecl *aggregateDecl );
72 virtual void visit( UnionDecl *aggregateDecl );
73
74 virtual void visit( CompoundStmt *compoundStmt );
75 virtual void visit( SwitchStmt *switchStmt );
76 virtual void visit( ChooseStmt *chooseStmt );
77 // virtual void visit( CaseStmt *caseStmt );
78 private:
79 HoistStruct();
80
81 template< typename AggDecl > void handleAggregate( AggDecl *aggregateDecl );
82
83 std::list< Declaration * > declsToAdd;
84 bool inStruct;
85 };
86
87 /// Replaces enum types by int, and function or array types in function parameter and return lists by appropriate pointers.
88 class Pass1 : public Visitor {
89 typedef Visitor Parent;
90 virtual void visit( EnumDecl *aggregateDecl );
91 virtual void visit( FunctionType *func );
92 };
93
94 /// Associates forward declarations of aggregates with their definitions
95 class Pass2 : public Indexer {
96 typedef Indexer Parent;
97 public:
98 Pass2( bool doDebug, const Indexer *indexer );
99 private:
100 virtual void visit( StructInstType *structInst );
101 virtual void visit( UnionInstType *unionInst );
102 virtual void visit( TraitInstType *contextInst );
103 virtual void visit( StructDecl *structDecl );
104 virtual void visit( UnionDecl *unionDecl );
105 virtual void visit( TypeInstType *typeInst );
106
107 const Indexer *indexer;
108
109 typedef std::map< std::string, std::list< StructInstType * > > ForwardStructsType;
110 typedef std::map< std::string, std::list< UnionInstType * > > ForwardUnionsType;
111 ForwardStructsType forwardStructs;
112 ForwardUnionsType forwardUnions;
113 };
114
115 /// Replaces array and function types in forall lists by appropriate pointer type
116 class Pass3 : public Indexer {
117 typedef Indexer Parent;
118 public:
119 Pass3( const Indexer *indexer );
120 private:
121 virtual void visit( ObjectDecl *object );
122 virtual void visit( FunctionDecl *func );
123
124 const Indexer *indexer;
125 };
126
127 class ReturnChecker : public Visitor {
128 public:
129 /// Checks that return statements return nothing if their return type is void
130 /// and return something if the return type is non-void.
131 static void checkFunctionReturns( std::list< Declaration * > & translationUnit );
132 private:
133 virtual void visit( FunctionDecl * functionDecl );
134
135 virtual void visit( ReturnStmt * returnStmt );
136
137 std::list< DeclarationWithType * > returnVals;
138 };
139
140 class EliminateTypedef : public Mutator {
141 public:
142 EliminateTypedef() : scopeLevel( 0 ) {}
143 /// Replaces typedefs by forward declarations
144 static void eliminateTypedef( std::list< Declaration * > &translationUnit );
145 private:
146 virtual Declaration *mutate( TypedefDecl *typeDecl );
147 virtual TypeDecl *mutate( TypeDecl *typeDecl );
148 virtual DeclarationWithType *mutate( FunctionDecl *funcDecl );
149 virtual DeclarationWithType *mutate( ObjectDecl *objDecl );
150 virtual CompoundStmt *mutate( CompoundStmt *compoundStmt );
151 virtual Type *mutate( TypeInstType *aggregateUseType );
152 virtual Expression *mutate( CastExpr *castExpr );
153
154 virtual Declaration *mutate( StructDecl * structDecl );
155 virtual Declaration *mutate( UnionDecl * unionDecl );
156 virtual Declaration *mutate( EnumDecl * enumDecl );
157 virtual Declaration *mutate( TraitDecl * contextDecl );
158
159 template<typename AggDecl>
160 AggDecl *handleAggregate( AggDecl * aggDecl );
161
162 template<typename AggDecl>
163 void addImplicitTypedef( AggDecl * aggDecl );
164
165 typedef std::map< std::string, std::pair< TypedefDecl *, int > > TypedefMap;
166 TypedefMap typedefNames;
167 int scopeLevel;
168 };
169
170 class VerifyCtorDtor : public Visitor {
171 public:
172 /// ensure that constructors and destructors have at least one
173 /// parameter, the first of which must be a pointer, and no
174 /// return values.
175 static void verify( std::list< Declaration * > &translationUnit );
176
177 virtual void visit( FunctionDecl *funcDecl );
178};
179
180 class CompoundLiteral : public GenPoly::DeclMutator {
181 DeclarationNode::StorageClass storageclass = DeclarationNode::NoStorageClass;
182
183 virtual DeclarationWithType * mutate( ObjectDecl *objectDecl );
184 virtual Expression *mutate( CompoundLiteralExpr *compLitExpr );
185 };
186
187 void validate( std::list< Declaration * > &translationUnit, bool doDebug ) {
188 Pass1 pass1;
189 Pass2 pass2( doDebug, 0 );
190 Pass3 pass3( 0 );
191 CompoundLiteral compoundliteral;
192
193 EliminateTypedef::eliminateTypedef( translationUnit );
194 HoistStruct::hoistStruct( translationUnit );
195 acceptAll( translationUnit, pass1 );
196 acceptAll( translationUnit, pass2 );
197 ReturnChecker::checkFunctionReturns( translationUnit );
198 mutateAll( translationUnit, compoundliteral );
199 autogenerateRoutines( translationUnit );
200 acceptAll( translationUnit, pass3 );
201 VerifyCtorDtor::verify( translationUnit );
202 }
203
204 void validateType( Type *type, const Indexer *indexer ) {
205 Pass1 pass1;
206 Pass2 pass2( false, indexer );
207 Pass3 pass3( indexer );
208 type->accept( pass1 );
209 type->accept( pass2 );
210 type->accept( pass3 );
211 }
212
213 void HoistStruct::hoistStruct( std::list< Declaration * > &translationUnit ) {
214 HoistStruct hoister;
215 acceptAndAdd( translationUnit, hoister, true );
216 }
217
218 HoistStruct::HoistStruct() : inStruct( false ) {
219 }
220
221 void filter( std::list< Declaration * > &declList, bool (*pred)( Declaration * ), bool doDelete ) {
222 std::list< Declaration * >::iterator i = declList.begin();
223 while ( i != declList.end() ) {
224 std::list< Declaration * >::iterator next = i;
225 ++next;
226 if ( pred( *i ) ) {
227 if ( doDelete ) {
228 delete *i;
229 } // if
230 declList.erase( i );
231 } // if
232 i = next;
233 } // while
234 }
235
236 bool isStructOrUnion( Declaration *decl ) {
237 return dynamic_cast< StructDecl * >( decl ) || dynamic_cast< UnionDecl * >( decl );
238 }
239
240 template< typename AggDecl >
241 void HoistStruct::handleAggregate( AggDecl *aggregateDecl ) {
242 if ( inStruct ) {
243 // Add elements in stack order corresponding to nesting structure.
244 declsToAdd.push_front( aggregateDecl );
245 Visitor::visit( aggregateDecl );
246 } else {
247 inStruct = true;
248 Visitor::visit( aggregateDecl );
249 inStruct = false;
250 } // if
251 // Always remove the hoisted aggregate from the inner structure.
252 filter( aggregateDecl->get_members(), isStructOrUnion, false );
253 }
254
255 void HoistStruct::visit( StructDecl *aggregateDecl ) {
256 handleAggregate( aggregateDecl );
257 }
258
259 void HoistStruct::visit( UnionDecl *aggregateDecl ) {
260 handleAggregate( aggregateDecl );
261 }
262
263 void HoistStruct::visit( CompoundStmt *compoundStmt ) {
264 addVisit( compoundStmt, *this );
265 }
266
267 void HoistStruct::visit( SwitchStmt *switchStmt ) {
268 addVisit( switchStmt, *this );
269 }
270
271 void HoistStruct::visit( ChooseStmt *switchStmt ) {
272 addVisit( switchStmt, *this );
273 }
274
275 // void HoistStruct::visit( CaseStmt *caseStmt ) {
276 // addVisit( caseStmt, *this );
277 // }
278
279 void Pass1::visit( EnumDecl *enumDecl ) {
280 // Set the type of each member of the enumeration to be EnumConstant
281
282 for ( std::list< Declaration * >::iterator i = enumDecl->get_members().begin(); i != enumDecl->get_members().end(); ++i ) {
283 ObjectDecl * obj = dynamic_cast< ObjectDecl * >( *i );
284 assert( obj );
285 // obj->set_type( new EnumInstType( Type::Qualifiers( true, false, false, false, false, false ), enumDecl->get_name() ) );
286 BasicType * enumType = new BasicType( Type::Qualifiers(), BasicType::SignedInt );
287 obj->set_type( enumType ) ;
288 } // for
289 Parent::visit( enumDecl );
290 }
291
292 namespace {
293 template< typename DWTList >
294 void fixFunctionList( DWTList & dwts, FunctionType * func ) {
295 // the only case in which "void" is valid is where it is the only one in the list; then it should be removed
296 // entirely other fix ups are handled by the FixFunction class
297 typedef typename DWTList::iterator DWTIterator;
298 DWTIterator begin( dwts.begin() ), end( dwts.end() );
299 if ( begin == end ) return;
300 FixFunction fixer;
301 DWTIterator i = begin;
302 *i = (*i)->acceptMutator( fixer );
303 if ( fixer.get_isVoid() ) {
304 DWTIterator j = i;
305 ++i;
306 dwts.erase( j );
307 if ( i != end ) {
308 throw SemanticError( "invalid type void in function type ", func );
309 } // if
310 } else {
311 ++i;
312 for ( ; i != end; ++i ) {
313 FixFunction fixer;
314 *i = (*i )->acceptMutator( fixer );
315 if ( fixer.get_isVoid() ) {
316 throw SemanticError( "invalid type void in function type ", func );
317 } // if
318 } // for
319 } // if
320 }
321 }
322
323 void Pass1::visit( FunctionType *func ) {
324 // Fix up parameters and return types
325 fixFunctionList( func->get_parameters(), func );
326 fixFunctionList( func->get_returnVals(), func );
327 Visitor::visit( func );
328 }
329
330 Pass2::Pass2( bool doDebug, const Indexer *other_indexer ) : Indexer( doDebug ) {
331 if ( other_indexer ) {
332 indexer = other_indexer;
333 } else {
334 indexer = this;
335 } // if
336 }
337
338 void Pass2::visit( StructInstType *structInst ) {
339 Parent::visit( structInst );
340 StructDecl *st = indexer->lookupStruct( structInst->get_name() );
341 // it's not a semantic error if the struct is not found, just an implicit forward declaration
342 if ( st ) {
343 //assert( ! structInst->get_baseStruct() || structInst->get_baseStruct()->get_members().empty() || ! st->get_members().empty() );
344 structInst->set_baseStruct( st );
345 } // if
346 if ( ! st || st->get_members().empty() ) {
347 // use of forward declaration
348 forwardStructs[ structInst->get_name() ].push_back( structInst );
349 } // if
350 }
351
352 void Pass2::visit( UnionInstType *unionInst ) {
353 Parent::visit( unionInst );
354 UnionDecl *un = indexer->lookupUnion( unionInst->get_name() );
355 // it's not a semantic error if the union is not found, just an implicit forward declaration
356 if ( un ) {
357 unionInst->set_baseUnion( un );
358 } // if
359 if ( ! un || un->get_members().empty() ) {
360 // use of forward declaration
361 forwardUnions[ unionInst->get_name() ].push_back( unionInst );
362 } // if
363 }
364
365 void Pass2::visit( TraitInstType *contextInst ) {
366 Parent::visit( contextInst );
367 TraitDecl *ctx = indexer->lookupTrait( contextInst->get_name() );
368 if ( ! ctx ) {
369 throw SemanticError( "use of undeclared context " + contextInst->get_name() );
370 } // if
371 for ( std::list< TypeDecl * >::const_iterator i = ctx->get_parameters().begin(); i != ctx->get_parameters().end(); ++i ) {
372 for ( std::list< DeclarationWithType * >::const_iterator assert = (*i )->get_assertions().begin(); assert != (*i )->get_assertions().end(); ++assert ) {
373 if ( TraitInstType *otherCtx = dynamic_cast< TraitInstType * >(*assert ) ) {
374 cloneAll( otherCtx->get_members(), contextInst->get_members() );
375 } else {
376 contextInst->get_members().push_back( (*assert )->clone() );
377 } // if
378 } // for
379 } // for
380
381 if ( ctx->get_parameters().size() != contextInst->get_parameters().size() ) {
382 throw SemanticError( "incorrect number of context parameters: ", contextInst );
383 } // if
384
385 applySubstitution( ctx->get_parameters().begin(), ctx->get_parameters().end(), contextInst->get_parameters().begin(), ctx->get_members().begin(), ctx->get_members().end(), back_inserter( contextInst->get_members() ) );
386 }
387
388 void Pass2::visit( StructDecl *structDecl ) {
389 // visit struct members first so that the types of self-referencing members are updated properly
390 Parent::visit( structDecl );
391 if ( ! structDecl->get_members().empty() ) {
392 ForwardStructsType::iterator fwds = forwardStructs.find( structDecl->get_name() );
393 if ( fwds != forwardStructs.end() ) {
394 for ( std::list< StructInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) {
395 (*inst )->set_baseStruct( structDecl );
396 } // for
397 forwardStructs.erase( fwds );
398 } // if
399 } // if
400 }
401
402 void Pass2::visit( UnionDecl *unionDecl ) {
403 Parent::visit( unionDecl );
404 if ( ! unionDecl->get_members().empty() ) {
405 ForwardUnionsType::iterator fwds = forwardUnions.find( unionDecl->get_name() );
406 if ( fwds != forwardUnions.end() ) {
407 for ( std::list< UnionInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) {
408 (*inst )->set_baseUnion( unionDecl );
409 } // for
410 forwardUnions.erase( fwds );
411 } // if
412 } // if
413 }
414
415 void Pass2::visit( TypeInstType *typeInst ) {
416 if ( NamedTypeDecl *namedTypeDecl = lookupType( typeInst->get_name() ) ) {
417 if ( TypeDecl *typeDecl = dynamic_cast< TypeDecl * >( namedTypeDecl ) ) {
418 typeInst->set_isFtype( typeDecl->get_kind() == TypeDecl::Ftype );
419 } // if
420 } // if
421 }
422
423 Pass3::Pass3( const Indexer *other_indexer ) : Indexer( false ) {
424 if ( other_indexer ) {
425 indexer = other_indexer;
426 } else {
427 indexer = this;
428 } // if
429 }
430
431 /// Fix up assertions
432 void forallFixer( Type *func ) {
433 for ( std::list< TypeDecl * >::iterator type = func->get_forall().begin(); type != func->get_forall().end(); ++type ) {
434 std::list< DeclarationWithType * > toBeDone, nextRound;
435 toBeDone.splice( toBeDone.end(), (*type )->get_assertions() );
436 while ( ! toBeDone.empty() ) {
437 for ( std::list< DeclarationWithType * >::iterator assertion = toBeDone.begin(); assertion != toBeDone.end(); ++assertion ) {
438 if ( TraitInstType *ctx = dynamic_cast< TraitInstType * >( (*assertion )->get_type() ) ) {
439 for ( std::list< Declaration * >::const_iterator i = ctx->get_members().begin(); i != ctx->get_members().end(); ++i ) {
440 DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *i );
441 assert( dwt );
442 nextRound.push_back( dwt->clone() );
443 }
444 delete ctx;
445 } else {
446 FixFunction fixer;
447 *assertion = (*assertion )->acceptMutator( fixer );
448 if ( fixer.get_isVoid() ) {
449 throw SemanticError( "invalid type void in assertion of function ", func );
450 }
451 (*type )->get_assertions().push_back( *assertion );
452 } // if
453 } // for
454 toBeDone.clear();
455 toBeDone.splice( toBeDone.end(), nextRound );
456 } // while
457 } // for
458 }
459
460 void Pass3::visit( ObjectDecl *object ) {
461 forallFixer( object->get_type() );
462 if ( PointerType *pointer = dynamic_cast< PointerType * >( object->get_type() ) ) {
463 forallFixer( pointer->get_base() );
464 } // if
465 Parent::visit( object );
466 object->fixUniqueId();
467 }
468
469 void Pass3::visit( FunctionDecl *func ) {
470 forallFixer( func->get_type() );
471 Parent::visit( func );
472 func->fixUniqueId();
473 }
474
475 void ReturnChecker::checkFunctionReturns( std::list< Declaration * > & translationUnit ) {
476 ReturnChecker checker;
477 acceptAll( translationUnit, checker );
478 }
479
480 void ReturnChecker::visit( FunctionDecl * functionDecl ) {
481 std::list< DeclarationWithType * > oldReturnVals = returnVals;
482 returnVals = functionDecl->get_functionType()->get_returnVals();
483 Visitor::visit( functionDecl );
484 returnVals = oldReturnVals;
485 }
486
487 void ReturnChecker::visit( ReturnStmt * returnStmt ) {
488 if ( returnStmt->get_expr() == NULL && returnVals.size() != 0 ) {
489 throw SemanticError( "Non-void function returns no values: " , returnStmt );
490 } else if ( returnStmt->get_expr() != NULL && returnVals.size() == 0 ) {
491 throw SemanticError( "void function returns values: " , returnStmt );
492 }
493 }
494
495
496 bool isTypedef( Declaration *decl ) {
497 return dynamic_cast< TypedefDecl * >( decl );
498 }
499
500 void EliminateTypedef::eliminateTypedef( std::list< Declaration * > &translationUnit ) {
501 EliminateTypedef eliminator;
502 mutateAll( translationUnit, eliminator );
503 filter( translationUnit, isTypedef, true );
504 }
505
506 Type *EliminateTypedef::mutate( TypeInstType * typeInst ) {
507 // instances of typedef types will come here. If it is an instance
508 // of a typdef type, link the instance to its actual type.
509 TypedefMap::const_iterator def = typedefNames.find( typeInst->get_name() );
510 if ( def != typedefNames.end() ) {
511 Type *ret = def->second.first->get_base()->clone();
512 ret->get_qualifiers() += typeInst->get_qualifiers();
513 // place instance parameters on the typedef'd type
514 if ( ! typeInst->get_parameters().empty() ) {
515 ReferenceToType *rtt = dynamic_cast<ReferenceToType*>(ret);
516 if ( ! rtt ) {
517 throw SemanticError("cannot apply type parameters to base type of " + typeInst->get_name());
518 }
519 rtt->get_parameters().clear();
520 cloneAll( typeInst->get_parameters(), rtt->get_parameters() );
521 mutateAll( rtt->get_parameters(), *this ); // recursively fix typedefs on parameters
522 } // if
523 delete typeInst;
524 return ret;
525 } // if
526 return typeInst;
527 }
528
529 Declaration *EliminateTypedef::mutate( TypedefDecl * tyDecl ) {
530 Declaration *ret = Mutator::mutate( tyDecl );
531 if ( typedefNames.count( tyDecl->get_name() ) == 1 && typedefNames[ tyDecl->get_name() ].second == scopeLevel ) {
532 // typedef to the same name from the same scope
533 // must be from the same type
534
535 Type * t1 = tyDecl->get_base();
536 Type * t2 = typedefNames[ tyDecl->get_name() ].first->get_base();
537 if ( ! ResolvExpr::typesCompatible( t1, t2, Indexer() ) ) {
538 throw SemanticError( "cannot redefine typedef: " + tyDecl->get_name() );
539 }
540 } else {
541 typedefNames[ tyDecl->get_name() ] = std::make_pair( tyDecl, scopeLevel );
542 } // if
543
544 // When a typedef is a forward declaration:
545 // typedef struct screen SCREEN;
546 // the declaration portion must be retained:
547 // struct screen;
548 // because the expansion of the typedef is:
549 // void rtn( SCREEN *p ) => void rtn( struct screen *p )
550 // hence the type-name "screen" must be defined.
551 // Note, qualifiers on the typedef are superfluous for the forward declaration.
552 if ( StructInstType *aggDecl = dynamic_cast< StructInstType * >( tyDecl->get_base() ) ) {
553 return new StructDecl( aggDecl->get_name() );
554 } else if ( UnionInstType *aggDecl = dynamic_cast< UnionInstType * >( tyDecl->get_base() ) ) {
555 return new UnionDecl( aggDecl->get_name() );
556 } else {
557 return ret;
558 } // if
559 }
560
561 TypeDecl *EliminateTypedef::mutate( TypeDecl * typeDecl ) {
562 TypedefMap::iterator i = typedefNames.find( typeDecl->get_name() );
563 if ( i != typedefNames.end() ) {
564 typedefNames.erase( i ) ;
565 } // if
566 return typeDecl;
567 }
568
569 DeclarationWithType *EliminateTypedef::mutate( FunctionDecl * funcDecl ) {
570 TypedefMap oldNames = typedefNames;
571 DeclarationWithType *ret = Mutator::mutate( funcDecl );
572 typedefNames = oldNames;
573 return ret;
574 }
575
576 DeclarationWithType *EliminateTypedef::mutate( ObjectDecl * objDecl ) {
577 TypedefMap oldNames = typedefNames;
578 DeclarationWithType *ret = Mutator::mutate( objDecl );
579 typedefNames = oldNames;
580 // is the type a function?
581 if ( FunctionType *funtype = dynamic_cast<FunctionType *>( ret->get_type() ) ) {
582 // replace the current object declaration with a function declaration
583 return new FunctionDecl( ret->get_name(), ret->get_storageClass(), ret->get_linkage(), funtype, 0, ret->get_isInline(), ret->get_isNoreturn() );
584 } else if ( objDecl->get_isInline() || objDecl->get_isNoreturn() ) {
585 throw SemanticError( "invalid inline or _Noreturn specification in declaration of ", objDecl );
586 } // if
587 return ret;
588 }
589
590 Expression *EliminateTypedef::mutate( CastExpr * castExpr ) {
591 TypedefMap oldNames = typedefNames;
592 Expression *ret = Mutator::mutate( castExpr );
593 typedefNames = oldNames;
594 return ret;
595 }
596
597 CompoundStmt *EliminateTypedef::mutate( CompoundStmt * compoundStmt ) {
598 TypedefMap oldNames = typedefNames;
599 scopeLevel += 1;
600 CompoundStmt *ret = Mutator::mutate( compoundStmt );
601 scopeLevel -= 1;
602 std::list< Statement * >::iterator i = compoundStmt->get_kids().begin();
603 while ( i != compoundStmt->get_kids().end() ) {
604 std::list< Statement * >::iterator next = i+1;
605 if ( DeclStmt *declStmt = dynamic_cast< DeclStmt * >( *i ) ) {
606 if ( dynamic_cast< TypedefDecl * >( declStmt->get_decl() ) ) {
607 delete *i;
608 compoundStmt->get_kids().erase( i );
609 } // if
610 } // if
611 i = next;
612 } // while
613 typedefNames = oldNames;
614 return ret;
615 }
616
617 // there may be typedefs nested within aggregates in order for everything to work properly, these should be removed
618 // as well
619 template<typename AggDecl>
620 AggDecl *EliminateTypedef::handleAggregate( AggDecl * aggDecl ) {
621 std::list<Declaration *>::iterator it = aggDecl->get_members().begin();
622 for ( ; it != aggDecl->get_members().end(); ) {
623 std::list< Declaration * >::iterator next = it+1;
624 if ( dynamic_cast< TypedefDecl * >( *it ) ) {
625 delete *it;
626 aggDecl->get_members().erase( it );
627 } // if
628 it = next;
629 }
630 return aggDecl;
631 }
632
633 template<typename AggDecl>
634 void EliminateTypedef::addImplicitTypedef( AggDecl * aggDecl ) {
635 if ( typedefNames.count( aggDecl->get_name() ) == 0 ) {
636 Type *type;
637 if ( StructDecl * newDeclStructDecl = dynamic_cast< StructDecl * >( aggDecl ) ) {
638 type = new StructInstType( Type::Qualifiers(), newDeclStructDecl->get_name() );
639 } else if ( UnionDecl * newDeclUnionDecl = dynamic_cast< UnionDecl * >( aggDecl ) ) {
640 type = new UnionInstType( Type::Qualifiers(), newDeclUnionDecl->get_name() );
641 } else if ( EnumDecl * newDeclEnumDecl = dynamic_cast< EnumDecl * >( aggDecl ) ) {
642 type = new EnumInstType( Type::Qualifiers(), newDeclEnumDecl->get_name() );
643 } // if
644 TypedefDecl * tyDecl = new TypedefDecl( aggDecl->get_name(), DeclarationNode::NoStorageClass, type );
645 typedefNames[ aggDecl->get_name() ] = std::make_pair( tyDecl, scopeLevel );
646 } // if
647 }
648 Declaration *EliminateTypedef::mutate( StructDecl * structDecl ) {
649 addImplicitTypedef( structDecl );
650 Mutator::mutate( structDecl );
651 return handleAggregate( structDecl );
652 }
653
654 Declaration *EliminateTypedef::mutate( UnionDecl * unionDecl ) {
655 addImplicitTypedef( unionDecl );
656 Mutator::mutate( unionDecl );
657 return handleAggregate( unionDecl );
658 }
659
660 Declaration *EliminateTypedef::mutate( EnumDecl * enumDecl ) {
661 addImplicitTypedef( enumDecl );
662 Mutator::mutate( enumDecl );
663 return handleAggregate( enumDecl );
664 }
665
666 Declaration *EliminateTypedef::mutate( TraitDecl * contextDecl ) {
667 Mutator::mutate( contextDecl );
668 return handleAggregate( contextDecl );
669 }
670
671 void VerifyCtorDtor::verify( std::list< Declaration * > & translationUnit ) {
672 VerifyCtorDtor verifier;
673 acceptAll( translationUnit, verifier );
674 }
675
676 void VerifyCtorDtor::visit( FunctionDecl * funcDecl ) {
677 FunctionType * funcType = funcDecl->get_functionType();
678 std::list< DeclarationWithType * > &returnVals = funcType->get_returnVals();
679 std::list< DeclarationWithType * > &params = funcType->get_parameters();
680
681 if ( funcDecl->get_name() == "?{}" || funcDecl->get_name() == "^?{}" ) {
682 if ( params.size() == 0 ) {
683 throw SemanticError( "Constructors and destructors require at least one parameter ", funcDecl );
684 }
685 if ( ! dynamic_cast< PointerType * >( params.front()->get_type() ) ) {
686 throw SemanticError( "First parameter of a constructor or destructor must be a pointer ", funcDecl );
687 }
688 if ( returnVals.size() != 0 ) {
689 throw SemanticError( "Constructors and destructors cannot have explicit return values ", funcDecl );
690 }
691 }
692
693 Visitor::visit( funcDecl );
694 // original idea: modify signature of ctor/dtors and insert appropriate return statements
695 // to cause desired behaviour
696 // new idea: add comma exprs to every ctor call to produce first parameter.
697 // this requires some memoization of the first parameter, because it can be a
698 // complicated expression with side effects (see: malloc). idea: add temporary variable
699 // that is assigned address of constructed object in ctor argument position and
700 // return the temporary. It should also be done after all implicit ctors are
701 // added, so not in this pass!
702 }
703
704 DeclarationWithType * CompoundLiteral::mutate( ObjectDecl *objectDecl ) {
705 storageclass = objectDecl->get_storageClass();
706 DeclarationWithType * temp = Mutator::mutate( objectDecl );
707 storageclass = DeclarationNode::NoStorageClass;
708 return temp;
709 }
710
711 Expression *CompoundLiteral::mutate( CompoundLiteralExpr *compLitExpr ) {
712 // transform [storage_class] ... (struct S){ 3, ... };
713 // into [storage_class] struct S temp = { 3, ... };
714 static UniqueName indexName( "_compLit" );
715
716 ObjectDecl *tempvar = new ObjectDecl( indexName.newName(), storageclass, LinkageSpec::C, 0, compLitExpr->get_type(), compLitExpr->get_initializer() );
717 compLitExpr->set_type( 0 );
718 compLitExpr->set_initializer( 0 );
719 delete compLitExpr;
720 DeclarationWithType * newtempvar = mutate( tempvar );
721 addDeclaration( newtempvar ); // add modified temporary to current block
722 return new VariableExpr( newtempvar );
723 }
724} // namespace SymTab
725
726// Local Variables: //
727// tab-width: 4 //
728// mode: c++ //
729// compile-command: "make install" //
730// End: //
Note: See TracBrowser for help on using the repository browser.