source: src/SymTab/Validate.cc@ dfee306

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 string with_gc
Last change on this file since dfee306 was dfee306, checked in by Rob Schluntz <rschlunt@…>, 10 years ago

Merge branch 'master' of /u/cforall/software/cfa/cfa-cc
  • Property mode set to 100644
File size: 36.2 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 : Mon Jul 13 14:38:19 2015
13// Update Count : 184
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 "Validate.h"
43#include "SynTree/Visitor.h"
44#include "SynTree/Mutator.h"
45#include "SynTree/Type.h"
46#include "SynTree/Statement.h"
47#include "SynTree/TypeSubstitution.h"
48#include "Indexer.h"
49#include "FixFunction.h"
50// #include "ImplementationType.h"
51#include "utility.h"
52#include "UniqueName.h"
53#include "AddVisit.h"
54#include "MakeLibCfa.h"
55#include "TypeEquality.h"
56
57#define debugPrint( x ) if ( doDebug ) { std::cout << x; }
58
59namespace SymTab {
60 class HoistStruct : public Visitor {
61 public:
62 /// Flattens nested struct types
63 static void hoistStruct( std::list< Declaration * > &translationUnit );
64
65 std::list< Declaration * > &get_declsToAdd() { return declsToAdd; }
66
67 virtual void visit( StructDecl *aggregateDecl );
68 virtual void visit( UnionDecl *aggregateDecl );
69
70 virtual void visit( CompoundStmt *compoundStmt );
71 virtual void visit( IfStmt *ifStmt );
72 virtual void visit( WhileStmt *whileStmt );
73 virtual void visit( ForStmt *forStmt );
74 virtual void visit( SwitchStmt *switchStmt );
75 virtual void visit( ChooseStmt *chooseStmt );
76 virtual void visit( CaseStmt *caseStmt );
77 virtual void visit( CatchStmt *catchStmt );
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( ContextInstType *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 AddStructAssignment : public Visitor {
128 public:
129 /// Generates assignment operators for aggregate types as required
130 static void addStructAssignment( std::list< Declaration * > &translationUnit );
131
132 std::list< Declaration * > &get_declsToAdd() { return declsToAdd; }
133
134 virtual void visit( EnumDecl *enumDecl );
135 virtual void visit( StructDecl *structDecl );
136 virtual void visit( UnionDecl *structDecl );
137 virtual void visit( TypeDecl *typeDecl );
138 virtual void visit( ContextDecl *ctxDecl );
139 virtual void visit( FunctionDecl *functionDecl );
140
141 virtual void visit( FunctionType *ftype );
142 virtual void visit( PointerType *ftype );
143
144 virtual void visit( CompoundStmt *compoundStmt );
145 virtual void visit( IfStmt *ifStmt );
146 virtual void visit( WhileStmt *whileStmt );
147 virtual void visit( ForStmt *forStmt );
148 virtual void visit( SwitchStmt *switchStmt );
149 virtual void visit( ChooseStmt *chooseStmt );
150 virtual void visit( CaseStmt *caseStmt );
151 virtual void visit( CatchStmt *catchStmt );
152
153 AddStructAssignment() : functionNesting( 0 ) {}
154 private:
155 template< typename StmtClass > void visitStatement( StmtClass *stmt );
156
157 std::list< Declaration * > declsToAdd;
158 std::set< std::string > structsDone;
159 unsigned int functionNesting; // current level of nested functions
160 };
161
162 class EliminateTypedef : public Mutator {
163 public:
164 EliminateTypedef() : scopeLevel( 0 ) {}
165 static void eliminateTypedef( std::list< Declaration * > &translationUnit );
166 private:
167 virtual Declaration *mutate( TypedefDecl *typeDecl );
168 virtual TypeDecl *mutate( TypeDecl *typeDecl );
169 virtual DeclarationWithType *mutate( FunctionDecl *funcDecl );
170 virtual ObjectDecl *mutate( ObjectDecl *objDecl );
171 virtual CompoundStmt *mutate( CompoundStmt *compoundStmt );
172 virtual Type *mutate( TypeInstType *aggregateUseType );
173 virtual Expression *mutate( CastExpr *castExpr );
174
175 virtual Declaration *mutate( StructDecl * structDecl );
176 virtual Declaration *mutate( UnionDecl * unionDecl );
177 virtual Declaration *mutate( EnumDecl * enumDecl );
178 virtual Declaration *mutate( ContextDecl * contextDecl );
179
180 template<typename AggDecl>
181 AggDecl *handleAggregate( AggDecl * aggDecl );
182
183 typedef std::map< std::string, std::pair< TypedefDecl *, int > > TypedefMap;
184 TypedefMap typedefNames;
185 int scopeLevel;
186 };
187
188 void validate( std::list< Declaration * > &translationUnit, bool doDebug ) {
189 Pass1 pass1;
190 Pass2 pass2( doDebug, 0 );
191 Pass3 pass3( 0 );
192 EliminateTypedef::eliminateTypedef( translationUnit );
193 HoistStruct::hoistStruct( translationUnit );
194 acceptAll( translationUnit, pass1 );
195 acceptAll( translationUnit, pass2 );
196 // need to collect all of the assignment operators prior to
197 // this point and only generate assignment operators if one doesn't exist
198 AddStructAssignment::addStructAssignment( translationUnit );
199 acceptAll( translationUnit, pass3 );
200 }
201
202 void validateType( Type *type, const Indexer *indexer ) {
203 Pass1 pass1;
204 Pass2 pass2( false, indexer );
205 Pass3 pass3( indexer );
206 type->accept( pass1 );
207 type->accept( pass2 );
208 type->accept( pass3 );
209 }
210
211 template< typename Visitor >
212 void acceptAndAdd( std::list< Declaration * > &translationUnit, Visitor &visitor, bool addBefore ) {
213 std::list< Declaration * >::iterator i = translationUnit.begin();
214 while ( i != translationUnit.end() ) {
215 (*i)->accept( visitor );
216 std::list< Declaration * >::iterator next = i;
217 next++;
218 if ( ! visitor.get_declsToAdd().empty() ) {
219 translationUnit.splice( addBefore ? i : next, visitor.get_declsToAdd() );
220 } // if
221 i = next;
222 } // while
223 }
224
225 void HoistStruct::hoistStruct( std::list< Declaration * > &translationUnit ) {
226 HoistStruct hoister;
227 acceptAndAdd( translationUnit, hoister, true );
228 }
229
230 HoistStruct::HoistStruct() : inStruct( false ) {
231 }
232
233 void filter( std::list< Declaration * > &declList, bool (*pred)( Declaration * ), bool doDelete ) {
234 std::list< Declaration * >::iterator i = declList.begin();
235 while ( i != declList.end() ) {
236 std::list< Declaration * >::iterator next = i;
237 ++next;
238 if ( pred( *i ) ) {
239 if ( doDelete ) {
240 delete *i;
241 } // if
242 declList.erase( i );
243 } // if
244 i = next;
245 } // while
246 }
247
248 bool isStructOrUnion( Declaration *decl ) {
249 return dynamic_cast< StructDecl * >( decl ) || dynamic_cast< UnionDecl * >( decl );
250 }
251
252 template< typename AggDecl >
253 void HoistStruct::handleAggregate( AggDecl *aggregateDecl ) {
254 if ( inStruct ) {
255 // Add elements in stack order corresponding to nesting structure.
256 declsToAdd.push_front( aggregateDecl );
257 Visitor::visit( aggregateDecl );
258 } else {
259 inStruct = true;
260 Visitor::visit( aggregateDecl );
261 inStruct = false;
262 } // if
263 // Always remove the hoisted aggregate from the inner structure.
264 filter( aggregateDecl->get_members(), isStructOrUnion, false );
265 }
266
267 void HoistStruct::visit( StructDecl *aggregateDecl ) {
268 handleAggregate( aggregateDecl );
269 }
270
271 void HoistStruct::visit( UnionDecl *aggregateDecl ) {
272 handleAggregate( aggregateDecl );
273 }
274
275 void HoistStruct::visit( CompoundStmt *compoundStmt ) {
276 addVisit( compoundStmt, *this );
277 }
278
279 void HoistStruct::visit( IfStmt *ifStmt ) {
280 addVisit( ifStmt, *this );
281 }
282
283 void HoistStruct::visit( WhileStmt *whileStmt ) {
284 addVisit( whileStmt, *this );
285 }
286
287 void HoistStruct::visit( ForStmt *forStmt ) {
288 addVisit( forStmt, *this );
289 }
290
291 void HoistStruct::visit( SwitchStmt *switchStmt ) {
292 addVisit( switchStmt, *this );
293 }
294
295 void HoistStruct::visit( ChooseStmt *switchStmt ) {
296 addVisit( switchStmt, *this );
297 }
298
299 void HoistStruct::visit( CaseStmt *caseStmt ) {
300 addVisit( caseStmt, *this );
301 }
302
303 void HoistStruct::visit( CatchStmt *cathStmt ) {
304 addVisit( cathStmt, *this );
305 }
306
307 void Pass1::visit( EnumDecl *enumDecl ) {
308 // Set the type of each member of the enumeration to be EnumConstant
309
310 for ( std::list< Declaration * >::iterator i = enumDecl->get_members().begin(); i != enumDecl->get_members().end(); ++i ) {
311 ObjectDecl * obj = dynamic_cast< ObjectDecl * >( *i );
312 assert( obj );
313 // obj->set_type( new EnumInstType( Type::Qualifiers( true, false, false, false, false, false ), enumDecl->get_name() ) );
314 BasicType * enumType = new BasicType( Type::Qualifiers(), BasicType::SignedInt );
315 obj->set_type( enumType ) ;
316 } // for
317 Parent::visit( enumDecl );
318 }
319
320 namespace {
321 template< typename DWTIterator >
322 void fixFunctionList( DWTIterator begin, DWTIterator end, FunctionType *func ) {
323 // the only case in which "void" is valid is where it is the only one in the list; then it should be removed
324 // entirely other fix ups are handled by the FixFunction class
325 if ( begin == end ) return;
326 FixFunction fixer;
327 DWTIterator i = begin;
328 *i = (*i )->acceptMutator( fixer );
329 if ( fixer.get_isVoid() ) {
330 DWTIterator j = i;
331 ++i;
332 func->get_parameters().erase( j );
333 if ( i != end ) {
334 throw SemanticError( "invalid type void in function type ", func );
335 } // if
336 } else {
337 ++i;
338 for ( ; i != end; ++i ) {
339 FixFunction fixer;
340 *i = (*i )->acceptMutator( fixer );
341 if ( fixer.get_isVoid() ) {
342 throw SemanticError( "invalid type void in function type ", func );
343 } // if
344 } // for
345 } // if
346 }
347 }
348
349 void Pass1::visit( FunctionType *func ) {
350 // Fix up parameters and return types
351 fixFunctionList( func->get_parameters().begin(), func->get_parameters().end(), func );
352 fixFunctionList( func->get_returnVals().begin(), func->get_returnVals().end(), func );
353 Visitor::visit( func );
354 }
355
356 Pass2::Pass2( bool doDebug, const Indexer *other_indexer ) : Indexer( doDebug ) {
357 if ( other_indexer ) {
358 indexer = other_indexer;
359 } else {
360 indexer = this;
361 } // if
362 }
363
364 void Pass2::visit( StructInstType *structInst ) {
365 Parent::visit( structInst );
366 StructDecl *st = indexer->lookupStruct( structInst->get_name() );
367 // it's not a semantic error if the struct is not found, just an implicit forward declaration
368 if ( st ) {
369 assert( ! structInst->get_baseStruct() || structInst->get_baseStruct()->get_members().empty() || ! st->get_members().empty() );
370 structInst->set_baseStruct( st );
371 } // if
372 if ( ! st || st->get_members().empty() ) {
373 // use of forward declaration
374 forwardStructs[ structInst->get_name() ].push_back( structInst );
375 } // if
376 }
377
378 void Pass2::visit( UnionInstType *unionInst ) {
379 Parent::visit( unionInst );
380 UnionDecl *un = indexer->lookupUnion( unionInst->get_name() );
381 // it's not a semantic error if the union is not found, just an implicit forward declaration
382 if ( un ) {
383 unionInst->set_baseUnion( un );
384 } // if
385 if ( ! un || un->get_members().empty() ) {
386 // use of forward declaration
387 forwardUnions[ unionInst->get_name() ].push_back( unionInst );
388 } // if
389 }
390
391 void Pass2::visit( ContextInstType *contextInst ) {
392 Parent::visit( contextInst );
393 ContextDecl *ctx = indexer->lookupContext( contextInst->get_name() );
394 if ( ! ctx ) {
395 throw SemanticError( "use of undeclared context " + contextInst->get_name() );
396 } // if
397 for ( std::list< TypeDecl * >::const_iterator i = ctx->get_parameters().begin(); i != ctx->get_parameters().end(); ++i ) {
398 for ( std::list< DeclarationWithType * >::const_iterator assert = (*i )->get_assertions().begin(); assert != (*i )->get_assertions().end(); ++assert ) {
399 if ( ContextInstType *otherCtx = dynamic_cast< ContextInstType * >(*assert ) ) {
400 cloneAll( otherCtx->get_members(), contextInst->get_members() );
401 } else {
402 contextInst->get_members().push_back( (*assert )->clone() );
403 } // if
404 } // for
405 } // for
406 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() ) );
407 }
408
409 void Pass2::visit( StructDecl *structDecl ) {
410 if ( ! structDecl->get_members().empty() ) {
411 ForwardStructsType::iterator fwds = forwardStructs.find( structDecl->get_name() );
412 if ( fwds != forwardStructs.end() ) {
413 for ( std::list< StructInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) {
414 (*inst )->set_baseStruct( structDecl );
415 } // for
416 forwardStructs.erase( fwds );
417 } // if
418 } // if
419 Indexer::visit( structDecl );
420 }
421
422 void Pass2::visit( UnionDecl *unionDecl ) {
423 if ( ! unionDecl->get_members().empty() ) {
424 ForwardUnionsType::iterator fwds = forwardUnions.find( unionDecl->get_name() );
425 if ( fwds != forwardUnions.end() ) {
426 for ( std::list< UnionInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) {
427 (*inst )->set_baseUnion( unionDecl );
428 } // for
429 forwardUnions.erase( fwds );
430 } // if
431 } // if
432 Indexer::visit( unionDecl );
433 }
434
435 void Pass2::visit( TypeInstType *typeInst ) {
436 if ( NamedTypeDecl *namedTypeDecl = lookupType( typeInst->get_name() ) ) {
437 if ( TypeDecl *typeDecl = dynamic_cast< TypeDecl * >( namedTypeDecl ) ) {
438 typeInst->set_isFtype( typeDecl->get_kind() == TypeDecl::Ftype );
439 } // if
440 } // if
441 }
442
443 Pass3::Pass3( const Indexer *other_indexer ) : Indexer( false ) {
444 if ( other_indexer ) {
445 indexer = other_indexer;
446 } else {
447 indexer = this;
448 } // if
449 }
450
451 /// Fix up assertions
452 void forallFixer( Type *func ) {
453 for ( std::list< TypeDecl * >::iterator type = func->get_forall().begin(); type != func->get_forall().end(); ++type ) {
454 std::list< DeclarationWithType * > toBeDone, nextRound;
455 toBeDone.splice( toBeDone.end(), (*type )->get_assertions() );
456 while ( ! toBeDone.empty() ) {
457 for ( std::list< DeclarationWithType * >::iterator assertion = toBeDone.begin(); assertion != toBeDone.end(); ++assertion ) {
458 if ( ContextInstType *ctx = dynamic_cast< ContextInstType * >( (*assertion )->get_type() ) ) {
459 for ( std::list< Declaration * >::const_iterator i = ctx->get_members().begin(); i != ctx->get_members().end(); ++i ) {
460 DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *i );
461 assert( dwt );
462 nextRound.push_back( dwt->clone() );
463 }
464 delete ctx;
465 } else {
466 FixFunction fixer;
467 *assertion = (*assertion )->acceptMutator( fixer );
468 if ( fixer.get_isVoid() ) {
469 throw SemanticError( "invalid type void in assertion of function ", func );
470 }
471 (*type )->get_assertions().push_back( *assertion );
472 } // if
473 } // for
474 toBeDone.clear();
475 toBeDone.splice( toBeDone.end(), nextRound );
476 } // while
477 } // for
478 }
479
480 void Pass3::visit( ObjectDecl *object ) {
481 forallFixer( object->get_type() );
482 if ( PointerType *pointer = dynamic_cast< PointerType * >( object->get_type() ) ) {
483 forallFixer( pointer->get_base() );
484 } // if
485 Parent::visit( object );
486 object->fixUniqueId();
487 }
488
489 void Pass3::visit( FunctionDecl *func ) {
490 forallFixer( func->get_type() );
491 Parent::visit( func );
492 func->fixUniqueId();
493 }
494
495 static const std::list< std::string > noLabels;
496
497 void AddStructAssignment::addStructAssignment( std::list< Declaration * > &translationUnit ) {
498 AddStructAssignment visitor;
499 acceptAndAdd( translationUnit, visitor, false );
500 }
501
502 template< typename OutputIterator >
503 void makeScalarAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, DeclarationWithType *member, OutputIterator out ) {
504 ObjectDecl *obj = dynamic_cast<ObjectDecl *>( member );
505 // unnamed bit fields are not copied as they cannot be accessed
506 if ( obj != NULL && obj->get_name() == "" && obj->get_bitfieldWidth() != NULL ) return;
507
508 UntypedExpr *assignExpr = new UntypedExpr( new NameExpr( "?=?" ) );
509
510 UntypedExpr *derefExpr = new UntypedExpr( new NameExpr( "*?" ) );
511 derefExpr->get_args().push_back( new VariableExpr( dstParam ) );
512
513 // do something special for unnamed members
514 Expression *dstselect = new AddressExpr( new MemberExpr( member, derefExpr ) );
515 assignExpr->get_args().push_back( dstselect );
516
517 Expression *srcselect = new MemberExpr( member, new VariableExpr( srcParam ) );
518 assignExpr->get_args().push_back( srcselect );
519
520 *out++ = new ExprStmt( noLabels, assignExpr );
521 }
522
523 template< typename OutputIterator >
524 void makeArrayAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, DeclarationWithType *member, ArrayType *array, OutputIterator out ) {
525 static UniqueName indexName( "_index" );
526
527 // for a flexible array member nothing is done -- user must define own assignment
528 if ( ! array->get_dimension() ) return;
529
530 ObjectDecl *index = new ObjectDecl( indexName.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, 0, new BasicType( Type::Qualifiers(), BasicType::SignedInt ), 0 );
531 *out++ = new DeclStmt( noLabels, index );
532
533 UntypedExpr *init = new UntypedExpr( new NameExpr( "?=?" ) );
534 init->get_args().push_back( new AddressExpr( new VariableExpr( index ) ) );
535 init->get_args().push_back( new NameExpr( "0" ) );
536 Statement *initStmt = new ExprStmt( noLabels, init );
537
538 UntypedExpr *cond = new UntypedExpr( new NameExpr( "?<?" ) );
539 cond->get_args().push_back( new VariableExpr( index ) );
540 cond->get_args().push_back( array->get_dimension()->clone() );
541
542 UntypedExpr *inc = new UntypedExpr( new NameExpr( "++?" ) );
543 inc->get_args().push_back( new AddressExpr( new VariableExpr( index ) ) );
544
545 UntypedExpr *assignExpr = new UntypedExpr( new NameExpr( "?=?" ) );
546
547 UntypedExpr *derefExpr = new UntypedExpr( new NameExpr( "*?" ) );
548 derefExpr->get_args().push_back( new VariableExpr( dstParam ) );
549
550 Expression *dstselect = new MemberExpr( member, derefExpr );
551 UntypedExpr *dstIndex = new UntypedExpr( new NameExpr( "?+?" ) );
552 dstIndex->get_args().push_back( dstselect );
553 dstIndex->get_args().push_back( new VariableExpr( index ) );
554 assignExpr->get_args().push_back( dstIndex );
555
556 Expression *srcselect = new MemberExpr( member, new VariableExpr( srcParam ) );
557 UntypedExpr *srcIndex = new UntypedExpr( new NameExpr( "?[?]" ) );
558 srcIndex->get_args().push_back( srcselect );
559 srcIndex->get_args().push_back( new VariableExpr( index ) );
560 assignExpr->get_args().push_back( srcIndex );
561
562 *out++ = new ForStmt( noLabels, initStmt, cond, inc, new ExprStmt( noLabels, assignExpr ) );
563 }
564
565 //E ?=?(E volatile*, int),
566 // ?=?(E _Atomic volatile*, int);
567 void makeEnumAssignment( EnumDecl *enumDecl, EnumInstType *refType, unsigned int functionNesting, std::list< Declaration * > &declsToAdd ) {
568 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );
569
570 ObjectDecl *returnVal = new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, refType->clone(), 0 );
571 assignType->get_returnVals().push_back( returnVal );
572
573 // need two assignment operators with different types
574 FunctionType * assignType2 = assignType->clone();
575
576 // E ?=?(E volatile *, E)
577 Type *etype = refType->clone();
578 // etype->get_qualifiers() += Type::Qualifiers(false, true, false, false, false, false);
579
580 ObjectDecl *dstParam = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), etype ), 0 );
581 assignType->get_parameters().push_back( dstParam );
582
583 ObjectDecl *srcParam = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, etype->clone(), 0 );
584 assignType->get_parameters().push_back( srcParam );
585
586 // E ?=?(E volatile *, int)
587 assignType2->get_parameters().push_back( dstParam->clone() );
588 BasicType * paramType = new BasicType(Type::Qualifiers(), BasicType::SignedInt);
589 ObjectDecl *srcParam2 = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, paramType, 0 );
590 assignType2->get_parameters().push_back( srcParam2 );
591
592 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units
593 // because each unit generates copies of the default routines for each aggregate.
594
595 // since there is no definition, these should not be inline
596 // make these intrinsic so that the code generator does not make use of them
597 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::Intrinsic, assignType, 0, false, false );
598 assignDecl->fixUniqueId();
599 FunctionDecl *assignDecl2 = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::Intrinsic, assignType2, 0, false, false );
600 assignDecl2->fixUniqueId();
601
602 // these should be built in the same way that the prelude
603 // functions are, so build a list containing the prototypes
604 // and allow MakeLibCfa to autogenerate the bodies.
605 std::list< Declaration * > assigns;
606 assigns.push_back( assignDecl );
607 assigns.push_back( assignDecl2 );
608
609 LibCfa::makeLibCfa( assigns );
610
611 // need to remove the prototypes, since this may be nested in a routine
612 for (int start = 0, end = assigns.size()/2; start < end; start++) {
613 delete assigns.front();
614 assigns.pop_front();
615 }
616
617 declsToAdd.insert( declsToAdd.begin(), assigns.begin(), assigns.end() );
618 }
619
620
621 Declaration *makeStructAssignment( StructDecl *aggregateDecl, StructInstType *refType, unsigned int functionNesting ) {
622 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );
623
624 ObjectDecl *returnVal = new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, refType->clone(), 0 );
625 assignType->get_returnVals().push_back( returnVal );
626
627 ObjectDecl *dstParam = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), refType->clone() ), 0 );
628 assignType->get_parameters().push_back( dstParam );
629
630 ObjectDecl *srcParam = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, refType, 0 );
631 assignType->get_parameters().push_back( srcParam );
632
633 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units
634 // because each unit generates copies of the default routines for each aggregate.
635 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::AutoGen, assignType, new CompoundStmt( noLabels ), true, false );
636 assignDecl->fixUniqueId();
637
638 for ( std::list< Declaration * >::const_iterator member = aggregateDecl->get_members().begin(); member != aggregateDecl->get_members().end(); ++member ) {
639 if ( DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *member ) ) {
640 // query the type qualifiers of this field and skip assigning it if it is marked const.
641 // If it is an array type, we need to strip off the array layers to find its qualifiers.
642 Type * type = dwt->get_type();
643 while ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) {
644 type = at->get_base();
645 }
646
647 if ( type->get_qualifiers().isConst ) {
648 // don't assign const members
649 continue;
650 }
651
652 if ( ArrayType *array = dynamic_cast< ArrayType * >( dwt->get_type() ) ) {
653 makeArrayAssignment( srcParam, dstParam, dwt, array, back_inserter( assignDecl->get_statements()->get_kids() ) );
654 } else {
655 makeScalarAssignment( srcParam, dstParam, dwt, back_inserter( assignDecl->get_statements()->get_kids() ) );
656 } // if
657 } // if
658 } // for
659 assignDecl->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, new VariableExpr( srcParam ) ) );
660
661 return assignDecl;
662 }
663
664 Declaration *makeUnionAssignment( UnionDecl *aggregateDecl, UnionInstType *refType, unsigned int functionNesting ) {
665 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );
666
667 ObjectDecl *returnVal = new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, refType->clone(), 0 );
668 assignType->get_returnVals().push_back( returnVal );
669
670 ObjectDecl *dstParam = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), refType->clone() ), 0 );
671 assignType->get_parameters().push_back( dstParam );
672
673 ObjectDecl *srcParam = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, refType, 0 );
674 assignType->get_parameters().push_back( srcParam );
675
676 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units
677 // because each unit generates copies of the default routines for each aggregate.
678 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::AutoGen, assignType, new CompoundStmt( noLabels ), true, false );
679 assignDecl->fixUniqueId();
680
681 UntypedExpr *copy = new UntypedExpr( new NameExpr( "__builtin_memcpy" ) );
682 copy->get_args().push_back( new VariableExpr( dstParam ) );
683 copy->get_args().push_back( new AddressExpr( new VariableExpr( srcParam ) ) );
684 copy->get_args().push_back( new SizeofExpr( refType->clone() ) );
685
686 assignDecl->get_statements()->get_kids().push_back( new ExprStmt( noLabels, copy ) );
687 assignDecl->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, new VariableExpr( srcParam ) ) );
688
689 return assignDecl;
690 }
691
692 void AddStructAssignment::visit( EnumDecl *enumDecl ) {
693 if ( ! enumDecl->get_members().empty() ) {
694 EnumInstType *enumInst = new EnumInstType( Type::Qualifiers(), enumDecl->get_name() );
695 // enumInst->set_baseEnum( enumDecl );
696 // declsToAdd.push_back(
697 makeEnumAssignment( enumDecl, enumInst, functionNesting, declsToAdd );
698 }
699 }
700
701 void AddStructAssignment::visit( StructDecl *structDecl ) {
702 if ( ! structDecl->get_members().empty() && structsDone.find( structDecl->get_name() ) == structsDone.end() ) {
703 StructInstType *structInst = new StructInstType( Type::Qualifiers(), structDecl->get_name() );
704 structInst->set_baseStruct( structDecl );
705 declsToAdd.push_back( makeStructAssignment( structDecl, structInst, functionNesting ) );
706 structsDone.insert( structDecl->get_name() );
707 } // if
708 }
709
710 void AddStructAssignment::visit( UnionDecl *unionDecl ) {
711 if ( ! unionDecl->get_members().empty() ) {
712 UnionInstType *unionInst = new UnionInstType( Type::Qualifiers(), unionDecl->get_name() );
713 unionInst->set_baseUnion( unionDecl );
714 declsToAdd.push_back( makeUnionAssignment( unionDecl, unionInst, functionNesting ) );
715 } // if
716 }
717
718 void AddStructAssignment::visit( TypeDecl *typeDecl ) {
719 CompoundStmt *stmts = 0;
720 TypeInstType *typeInst = new TypeInstType( Type::Qualifiers(), typeDecl->get_name(), false );
721 typeInst->set_baseType( typeDecl );
722 ObjectDecl *src = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, typeInst->clone(), 0 );
723 ObjectDecl *dst = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), typeInst->clone() ), 0 );
724 if ( typeDecl->get_base() ) {
725 stmts = new CompoundStmt( std::list< Label >() );
726 UntypedExpr *assign = new UntypedExpr( new NameExpr( "?=?" ) );
727 assign->get_args().push_back( new CastExpr( new VariableExpr( dst ), new PointerType( Type::Qualifiers(), typeDecl->get_base()->clone() ) ) );
728 assign->get_args().push_back( new CastExpr( new VariableExpr( src ), typeDecl->get_base()->clone() ) );
729 stmts->get_kids().push_back( new ReturnStmt( std::list< Label >(), assign ) );
730 } // if
731 FunctionType *type = new FunctionType( Type::Qualifiers(), false );
732 type->get_returnVals().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, typeInst, 0 ) );
733 type->get_parameters().push_back( dst );
734 type->get_parameters().push_back( src );
735 FunctionDecl *func = new FunctionDecl( "?=?", DeclarationNode::NoStorageClass, LinkageSpec::AutoGen, type, stmts, false, false );
736 declsToAdd.push_back( func );
737 }
738
739 void addDecls( std::list< Declaration * > &declsToAdd, std::list< Statement * > &statements, std::list< Statement * >::iterator i ) {
740 for ( std::list< Declaration * >::iterator decl = declsToAdd.begin(); decl != declsToAdd.end(); ++decl ) {
741 statements.insert( i, new DeclStmt( noLabels, *decl ) );
742 } // for
743 declsToAdd.clear();
744 }
745
746 void AddStructAssignment::visit( FunctionType *) {
747 // ensure that we don't add assignment ops for types defined as part of the function
748 }
749
750 void AddStructAssignment::visit( PointerType *) {
751 // ensure that we don't add assignment ops for types defined as part of the pointer
752 }
753
754 void AddStructAssignment::visit( ContextDecl *) {
755 // ensure that we don't add assignment ops for types defined as part of the context
756 }
757
758 template< typename StmtClass >
759 inline void AddStructAssignment::visitStatement( StmtClass *stmt ) {
760 std::set< std::string > oldStructs = structsDone;
761 addVisit( stmt, *this );
762 structsDone = oldStructs;
763 }
764
765 void AddStructAssignment::visit( FunctionDecl *functionDecl ) {
766 maybeAccept( functionDecl->get_functionType(), *this );
767 acceptAll( functionDecl->get_oldDecls(), *this );
768 functionNesting += 1;
769 maybeAccept( functionDecl->get_statements(), *this );
770 functionNesting -= 1;
771 }
772
773 void AddStructAssignment::visit( CompoundStmt *compoundStmt ) {
774 visitStatement( compoundStmt );
775 }
776
777 void AddStructAssignment::visit( IfStmt *ifStmt ) {
778 visitStatement( ifStmt );
779 }
780
781 void AddStructAssignment::visit( WhileStmt *whileStmt ) {
782 visitStatement( whileStmt );
783 }
784
785 void AddStructAssignment::visit( ForStmt *forStmt ) {
786 visitStatement( forStmt );
787 }
788
789 void AddStructAssignment::visit( SwitchStmt *switchStmt ) {
790 visitStatement( switchStmt );
791 }
792
793 void AddStructAssignment::visit( ChooseStmt *switchStmt ) {
794 visitStatement( switchStmt );
795 }
796
797 void AddStructAssignment::visit( CaseStmt *caseStmt ) {
798 visitStatement( caseStmt );
799 }
800
801 void AddStructAssignment::visit( CatchStmt *cathStmt ) {
802 visitStatement( cathStmt );
803 }
804
805 bool isTypedef( Declaration *decl ) {
806 return dynamic_cast< TypedefDecl * >( decl );
807 }
808
809 void EliminateTypedef::eliminateTypedef( std::list< Declaration * > &translationUnit ) {
810 EliminateTypedef eliminator;
811 mutateAll( translationUnit, eliminator );
812 filter( translationUnit, isTypedef, true );
813 }
814
815 Type *EliminateTypedef::mutate( TypeInstType * typeInst ) {
816 // instances of typedef types will come here. If it is an instance
817 // of a typdef type, link the instance to its actual type.
818 TypedefMap::const_iterator def = typedefNames.find( typeInst->get_name() );
819 if ( def != typedefNames.end() ) {
820 Type *ret = def->second.first->get_base()->clone();
821 ret->get_qualifiers() += typeInst->get_qualifiers();
822 delete typeInst;
823 return ret;
824 } // if
825 return typeInst;
826 }
827
828 Declaration *EliminateTypedef::mutate( TypedefDecl * tyDecl ) {
829 Declaration *ret = Mutator::mutate( tyDecl );
830 if ( typedefNames.count( tyDecl->get_name() ) == 1 && typedefNames[ tyDecl->get_name() ].second == scopeLevel ) {
831 // typedef to the same name from the same scope
832 // must be from the same type
833
834 Type * t1 = tyDecl->get_base();
835 Type * t2 = typedefNames[ tyDecl->get_name() ].first->get_base();
836 if ( ! typeEquals( t1, t2, true ) ) {
837 throw SemanticError( "cannot redefine typedef: " + tyDecl->get_name() );
838 }
839 } else {
840 typedefNames[ tyDecl->get_name() ] = std::make_pair( tyDecl, scopeLevel );
841 } // if
842
843 // When a typedef is a forward declaration:
844 // typedef struct screen SCREEN;
845 // the declaration portion must be retained:
846 // struct screen;
847 // because the expansion of the typedef is:
848 // void rtn( SCREEN *p ) => void rtn( struct screen *p )
849 // hence the type-name "screen" must be defined.
850 // Note, qualifiers on the typedef are superfluous for the forward declaration.
851 if ( StructInstType *aggDecl = dynamic_cast< StructInstType * >( tyDecl->get_base() ) ) {
852 return new StructDecl( aggDecl->get_name() );
853 } else if ( UnionInstType *aggDecl = dynamic_cast< UnionInstType * >( tyDecl->get_base() ) ) {
854 return new UnionDecl( aggDecl->get_name() );
855 } else {
856 return ret;
857 } // if
858 }
859
860 TypeDecl *EliminateTypedef::mutate( TypeDecl * typeDecl ) {
861 TypedefMap::iterator i = typedefNames.find( typeDecl->get_name() );
862 if ( i != typedefNames.end() ) {
863 typedefNames.erase( i ) ;
864 } // if
865 return typeDecl;
866 }
867
868 DeclarationWithType *EliminateTypedef::mutate( FunctionDecl * funcDecl ) {
869 TypedefMap oldNames = typedefNames;
870 DeclarationWithType *ret = Mutator::mutate( funcDecl );
871 typedefNames = oldNames;
872 return ret;
873 }
874
875 ObjectDecl *EliminateTypedef::mutate( ObjectDecl * objDecl ) {
876 TypedefMap oldNames = typedefNames;
877 ObjectDecl *ret = Mutator::mutate( objDecl );
878 typedefNames = oldNames;
879 return ret;
880 }
881
882 Expression *EliminateTypedef::mutate( CastExpr * castExpr ) {
883 TypedefMap oldNames = typedefNames;
884 Expression *ret = Mutator::mutate( castExpr );
885 typedefNames = oldNames;
886 return ret;
887 }
888
889 CompoundStmt *EliminateTypedef::mutate( CompoundStmt * compoundStmt ) {
890 TypedefMap oldNames = typedefNames;
891 scopeLevel += 1;
892 CompoundStmt *ret = Mutator::mutate( compoundStmt );
893 scopeLevel -= 1;
894 std::list< Statement * >::iterator i = compoundStmt->get_kids().begin();
895 while ( i != compoundStmt->get_kids().end() ) {
896 std::list< Statement * >::iterator next = i+1;
897 if ( DeclStmt *declStmt = dynamic_cast< DeclStmt * >( *i ) ) {
898 if ( dynamic_cast< TypedefDecl * >( declStmt->get_decl() ) ) {
899 delete *i;
900 compoundStmt->get_kids().erase( i );
901 } // if
902 } // if
903 i = next;
904 } // while
905 typedefNames = oldNames;
906 return ret;
907 }
908
909 // there may be typedefs nested within aggregates
910 // in order for everything to work properly, these
911 // should be removed as well
912 template<typename AggDecl>
913 AggDecl *EliminateTypedef::handleAggregate( AggDecl * aggDecl ) {
914 std::list<Declaration *>::iterator it = aggDecl->get_members().begin();
915 for ( ; it != aggDecl->get_members().end(); ) {
916 std::list< Declaration * >::iterator next = it+1;
917 if ( dynamic_cast< TypedefDecl * >( *it ) ) {
918 delete *it;
919 aggDecl->get_members().erase( it );
920 } // if
921 it = next;
922 }
923 return aggDecl;
924 }
925
926 Declaration *EliminateTypedef::mutate( StructDecl * structDecl ) {
927 Mutator::mutate( structDecl );
928 return handleAggregate( structDecl );
929 }
930
931 Declaration *EliminateTypedef::mutate( UnionDecl * unionDecl ) {
932 Mutator::mutate( unionDecl );
933 return handleAggregate( unionDecl );
934 }
935
936 Declaration *EliminateTypedef::mutate( EnumDecl * enumDecl ) {
937 Mutator::mutate( enumDecl );
938 return handleAggregate( enumDecl );
939 }
940
941 Declaration *EliminateTypedef::mutate( ContextDecl * contextDecl ) {
942 Mutator::mutate( contextDecl );
943 return handleAggregate( contextDecl );
944 }
945
946} // namespace SymTab
947
948// Local Variables: //
949// tab-width: 4 //
950// mode: c++ //
951// compile-command: "make install" //
952// End: //
Note: See TracBrowser for help on using the repository browser.