source: src/SymTab/Validate.cc@ 2bae7307

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 2bae7307 was 843054c2, checked in by Peter A. Buhr <pabuhr@…>, 10 years ago

licencing: seventh groups of files
  • Property mode set to 100644
File size: 30.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// Validate.cc --
8//
9// Author : Richard C. Bilson
10// Created On : Sun May 17 21:50:04 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Tue May 19 16:50:09 2015
13// Update Count : 3
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 "Indexer.h"
48#include "SynTree/TypeSubstitution.h"
49#include "FixFunction.h"
50#include "ImplementationType.h"
51#include "utility.h"
52#include "UniqueName.h"
53#include "AddVisit.h"
54
55
56#define debugPrint( x ) if ( doDebug ) { std::cout << x; }
57
58namespace SymTab {
59 class HoistStruct : public Visitor {
60 public:
61 static void hoistStruct( std::list< Declaration * > &translationUnit );
62
63 std::list< Declaration * > &get_declsToAdd() { return declsToAdd; }
64
65 virtual void visit( StructDecl *aggregateDecl );
66 virtual void visit( UnionDecl *aggregateDecl );
67
68 virtual void visit( CompoundStmt *compoundStmt );
69 virtual void visit( IfStmt *ifStmt );
70 virtual void visit( WhileStmt *whileStmt );
71 virtual void visit( ForStmt *forStmt );
72 virtual void visit( SwitchStmt *switchStmt );
73 virtual void visit( ChooseStmt *chooseStmt );
74 virtual void visit( CaseStmt *caseStmt );
75 virtual void visit( CatchStmt *catchStmt );
76 private:
77 HoistStruct();
78
79 template< typename AggDecl > void handleAggregate( AggDecl *aggregateDecl );
80
81 std::list< Declaration * > declsToAdd;
82 bool inStruct;
83 };
84
85 class Pass1 : public Visitor {
86 typedef Visitor Parent;
87 virtual void visit( EnumDecl *aggregateDecl );
88 virtual void visit( FunctionType *func );
89 };
90
91 class Pass2 : public Indexer {
92 typedef Indexer Parent;
93 public:
94 Pass2( bool doDebug, const Indexer *indexer );
95 private:
96 virtual void visit( StructInstType *structInst );
97 virtual void visit( UnionInstType *unionInst );
98 virtual void visit( ContextInstType *contextInst );
99 virtual void visit( StructDecl *structDecl );
100 virtual void visit( UnionDecl *unionDecl );
101 virtual void visit( TypeInstType *typeInst );
102
103 const Indexer *indexer;
104
105 typedef std::map< std::string, std::list< StructInstType * > > ForwardStructsType;
106 typedef std::map< std::string, std::list< UnionInstType * > > ForwardUnionsType;
107 ForwardStructsType forwardStructs;
108 ForwardUnionsType forwardUnions;
109 };
110
111 class Pass3 : public Indexer {
112 typedef Indexer Parent;
113 public:
114 Pass3( const Indexer *indexer );
115 private:
116 virtual void visit( ObjectDecl *object );
117 virtual void visit( FunctionDecl *func );
118
119 const Indexer *indexer;
120 };
121
122 class AddStructAssignment : public Visitor {
123 public:
124 static void addStructAssignment( std::list< Declaration * > &translationUnit );
125
126 std::list< Declaration * > &get_declsToAdd() { return declsToAdd; }
127
128 virtual void visit( StructDecl *structDecl );
129 virtual void visit( UnionDecl *structDecl );
130 virtual void visit( TypeDecl *typeDecl );
131 virtual void visit( ContextDecl *ctxDecl );
132 virtual void visit( FunctionDecl *functionDecl );
133
134 virtual void visit( FunctionType *ftype );
135 virtual void visit( PointerType *ftype );
136
137 virtual void visit( CompoundStmt *compoundStmt );
138 virtual void visit( IfStmt *ifStmt );
139 virtual void visit( WhileStmt *whileStmt );
140 virtual void visit( ForStmt *forStmt );
141 virtual void visit( SwitchStmt *switchStmt );
142 virtual void visit( ChooseStmt *chooseStmt );
143 virtual void visit( CaseStmt *caseStmt );
144 virtual void visit( CatchStmt *catchStmt );
145
146 AddStructAssignment() : functionNesting( 0 ) {}
147 private:
148 template< typename StmtClass > void visitStatement( StmtClass *stmt );
149
150 std::list< Declaration * > declsToAdd;
151 std::set< std::string > structsDone;
152 unsigned int functionNesting; // current level of nested functions
153 };
154
155 class EliminateTypedef : public Mutator {
156 public:
157 static void eliminateTypedef( std::list< Declaration * > &translationUnit );
158 private:
159 virtual Declaration *mutate( TypedefDecl *typeDecl );
160 virtual TypeDecl *mutate( TypeDecl *typeDecl );
161 virtual DeclarationWithType *mutate( FunctionDecl *funcDecl );
162 virtual ObjectDecl *mutate( ObjectDecl *objDecl );
163 virtual CompoundStmt *mutate( CompoundStmt *compoundStmt );
164 virtual Type *mutate( TypeInstType *aggregateUseType );
165 virtual Expression *mutate( CastExpr *castExpr );
166
167 std::map< std::string, TypedefDecl * > typedefNames;
168 };
169
170 void validate( std::list< Declaration * > &translationUnit, bool doDebug ) {
171 Pass1 pass1;
172 Pass2 pass2( doDebug, 0 );
173 Pass3 pass3( 0 );
174 EliminateTypedef::eliminateTypedef( translationUnit );
175 HoistStruct::hoistStruct( translationUnit );
176 acceptAll( translationUnit, pass1 );
177 acceptAll( translationUnit, pass2 );
178 AddStructAssignment::addStructAssignment( translationUnit );
179 acceptAll( translationUnit, pass3 );
180 }
181
182 void validateType( Type *type, const Indexer *indexer ) {
183 Pass1 pass1;
184 Pass2 pass2( false, indexer );
185 Pass3 pass3( indexer );
186 type->accept( pass1 );
187 type->accept( pass2 );
188 type->accept( pass3 );
189 }
190
191 template< typename Visitor >
192 void acceptAndAdd( std::list< Declaration * > &translationUnit, Visitor &visitor, bool addBefore ) {
193 std::list< Declaration * >::iterator i = translationUnit.begin();
194 while ( i != translationUnit.end() ) {
195 (*i)->accept( visitor );
196 std::list< Declaration * >::iterator next = i;
197 next++;
198 if ( ! visitor.get_declsToAdd().empty() ) {
199 translationUnit.splice( addBefore ? i : next, visitor.get_declsToAdd() );
200 } // if
201 i = next;
202 } // while
203 }
204
205 void HoistStruct::hoistStruct( std::list< Declaration * > &translationUnit ) {
206 HoistStruct hoister;
207 acceptAndAdd( translationUnit, hoister, true );
208 }
209
210 HoistStruct::HoistStruct() : inStruct( false ) {
211 }
212
213 void filter( std::list< Declaration * > &declList, bool (*pred)( Declaration * ), bool doDelete ) {
214 std::list< Declaration * >::iterator i = declList.begin();
215 while ( i != declList.end() ) {
216 std::list< Declaration * >::iterator next = i;
217 ++next;
218 if ( pred( *i ) ) {
219 if ( doDelete ) {
220 delete *i;
221 } // if
222 declList.erase( i );
223 } // if
224 i = next;
225 } // while
226 }
227
228 bool isStructOrUnion( Declaration *decl ) {
229 return dynamic_cast< StructDecl * >( decl ) || dynamic_cast< UnionDecl * >( decl );
230 }
231
232 template< typename AggDecl >
233 void HoistStruct::handleAggregate( AggDecl *aggregateDecl ) {
234 if ( inStruct ) {
235 // Add elements in stack order corresponding to nesting structure.
236 declsToAdd.push_front( aggregateDecl );
237 Visitor::visit( aggregateDecl );
238 } else {
239 inStruct = true;
240 Visitor::visit( aggregateDecl );
241 inStruct = false;
242 } // if
243 // Always remove the hoisted aggregate from the inner structure.
244 filter( aggregateDecl->get_members(), isStructOrUnion, false );
245 }
246
247 void HoistStruct::visit( StructDecl *aggregateDecl ) {
248 handleAggregate( aggregateDecl );
249 }
250
251 void HoistStruct::visit( UnionDecl *aggregateDecl ) {
252 handleAggregate( aggregateDecl );
253 }
254
255 void HoistStruct::visit( CompoundStmt *compoundStmt ) {
256 addVisit( compoundStmt, *this );
257 }
258
259 void HoistStruct::visit( IfStmt *ifStmt ) {
260 addVisit( ifStmt, *this );
261 }
262
263 void HoistStruct::visit( WhileStmt *whileStmt ) {
264 addVisit( whileStmt, *this );
265 }
266
267 void HoistStruct::visit( ForStmt *forStmt ) {
268 addVisit( forStmt, *this );
269 }
270
271 void HoistStruct::visit( SwitchStmt *switchStmt ) {
272 addVisit( switchStmt, *this );
273 }
274
275 void HoistStruct::visit( ChooseStmt *switchStmt ) {
276 addVisit( switchStmt, *this );
277 }
278
279 void HoistStruct::visit( CaseStmt *caseStmt ) {
280 addVisit( caseStmt, *this );
281 }
282
283 void HoistStruct::visit( CatchStmt *cathStmt ) {
284 addVisit( cathStmt, *this );
285 }
286
287 void Pass1::visit( EnumDecl *enumDecl ) {
288 // Set the type of each member of the enumeration to be EnumConstant
289
290 for ( std::list< Declaration * >::iterator i = enumDecl->get_members().begin(); i != enumDecl->get_members().end(); ++i ) {
291 ObjectDecl *obj = dynamic_cast< ObjectDecl * >( *i );
292 assert( obj );
293 obj->set_type( new EnumInstType( Type::Qualifiers( true, false, false, false, false, false ), enumDecl->get_name() ) );
294 } // for
295 Parent::visit( enumDecl );
296 }
297
298 namespace {
299 template< typename DWTIterator >
300 void fixFunctionList( DWTIterator begin, DWTIterator end, FunctionType *func ) {
301 // the only case in which "void" is valid is where it is the only one in the list; then it should be removed
302 // entirely other fix ups are handled by the FixFunction class
303 if ( begin == end ) return;
304 FixFunction fixer;
305 DWTIterator i = begin;
306 *i = (*i )->acceptMutator( fixer );
307 if ( fixer.get_isVoid() ) {
308 DWTIterator j = i;
309 ++i;
310 func->get_parameters().erase( j );
311 if ( i != end ) {
312 throw SemanticError( "invalid type void in function type ", func );
313 } // if
314 } else {
315 ++i;
316 for ( ; i != end; ++i ) {
317 FixFunction fixer;
318 *i = (*i )->acceptMutator( fixer );
319 if ( fixer.get_isVoid() ) {
320 throw SemanticError( "invalid type void in function type ", func );
321 } // if
322 } // for
323 } // if
324 }
325 }
326
327 void Pass1::visit( FunctionType *func ) {
328 // Fix up parameters and return types
329 fixFunctionList( func->get_parameters().begin(), func->get_parameters().end(), func );
330 fixFunctionList( func->get_returnVals().begin(), func->get_returnVals().end(), func );
331 Visitor::visit( func );
332 }
333
334 Pass2::Pass2( bool doDebug, const Indexer *other_indexer ) : Indexer( doDebug ) {
335 if ( other_indexer ) {
336 indexer = other_indexer;
337 } else {
338 indexer = this;
339 } // if
340 }
341
342 void Pass2::visit( StructInstType *structInst ) {
343 Parent::visit( structInst );
344 StructDecl *st = indexer->lookupStruct( structInst->get_name() );
345 // it's not a semantic error if the struct is not found, just an implicit forward declaration
346 if ( st ) {
347 assert( ! structInst->get_baseStruct() || structInst->get_baseStruct()->get_members().empty() || ! st->get_members().empty() );
348 structInst->set_baseStruct( st );
349 } // if
350 if ( ! st || st->get_members().empty() ) {
351 // use of forward declaration
352 forwardStructs[ structInst->get_name() ].push_back( structInst );
353 } // if
354 }
355
356 void Pass2::visit( UnionInstType *unionInst ) {
357 Parent::visit( unionInst );
358 UnionDecl *un = indexer->lookupUnion( unionInst->get_name() );
359 // it's not a semantic error if the union is not found, just an implicit forward declaration
360 if ( un ) {
361 unionInst->set_baseUnion( un );
362 } // if
363 if ( ! un || un->get_members().empty() ) {
364 // use of forward declaration
365 forwardUnions[ unionInst->get_name() ].push_back( unionInst );
366 } // if
367 }
368
369 void Pass2::visit( ContextInstType *contextInst ) {
370 Parent::visit( contextInst );
371 ContextDecl *ctx = indexer->lookupContext( contextInst->get_name() );
372 if ( ! ctx ) {
373 throw SemanticError( "use of undeclared context " + contextInst->get_name() );
374 } // if
375 for ( std::list< TypeDecl * >::const_iterator i = ctx->get_parameters().begin(); i != ctx->get_parameters().end(); ++i ) {
376 for ( std::list< DeclarationWithType * >::const_iterator assert = (*i )->get_assertions().begin(); assert != (*i )->get_assertions().end(); ++assert ) {
377 if ( ContextInstType *otherCtx = dynamic_cast< ContextInstType * >(*assert ) ) {
378 cloneAll( otherCtx->get_members(), contextInst->get_members() );
379 } else {
380 contextInst->get_members().push_back( (*assert )->clone() );
381 } // if
382 } // for
383 } // for
384 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() ) );
385 }
386
387 void Pass2::visit( StructDecl *structDecl ) {
388 if ( ! structDecl->get_members().empty() ) {
389 ForwardStructsType::iterator fwds = forwardStructs.find( structDecl->get_name() );
390 if ( fwds != forwardStructs.end() ) {
391 for ( std::list< StructInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) {
392 (*inst )->set_baseStruct( structDecl );
393 } // for
394 forwardStructs.erase( fwds );
395 } // if
396 } // if
397 Indexer::visit( structDecl );
398 }
399
400 void Pass2::visit( UnionDecl *unionDecl ) {
401 if ( ! unionDecl->get_members().empty() ) {
402 ForwardUnionsType::iterator fwds = forwardUnions.find( unionDecl->get_name() );
403 if ( fwds != forwardUnions.end() ) {
404 for ( std::list< UnionInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) {
405 (*inst )->set_baseUnion( unionDecl );
406 } // for
407 forwardUnions.erase( fwds );
408 } // if
409 } // if
410 Indexer::visit( unionDecl );
411 }
412
413 void Pass2::visit( TypeInstType *typeInst ) {
414 if ( NamedTypeDecl *namedTypeDecl = lookupType( typeInst->get_name() ) ) {
415 if ( TypeDecl *typeDecl = dynamic_cast< TypeDecl * >( namedTypeDecl ) ) {
416 typeInst->set_isFtype( typeDecl->get_kind() == TypeDecl::Ftype );
417 } // if
418 } // if
419 }
420
421 Pass3::Pass3( const Indexer *other_indexer ) : Indexer( false ) {
422 if ( other_indexer ) {
423 indexer = other_indexer;
424 } else {
425 indexer = this;
426 } // if
427 }
428
429 void forallFixer( Type *func ) {
430 // Fix up assertions
431 for ( std::list< TypeDecl * >::iterator type = func->get_forall().begin(); type != func->get_forall().end(); ++type ) {
432 std::list< DeclarationWithType * > toBeDone, nextRound;
433 toBeDone.splice( toBeDone.end(), (*type )->get_assertions() );
434 while ( ! toBeDone.empty() ) {
435 for ( std::list< DeclarationWithType * >::iterator assertion = toBeDone.begin(); assertion != toBeDone.end(); ++assertion ) {
436 if ( ContextInstType *ctx = dynamic_cast< ContextInstType * >( (*assertion )->get_type() ) ) {
437 for ( std::list< Declaration * >::const_iterator i = ctx->get_members().begin(); i != ctx->get_members().end(); ++i ) {
438 DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *i );
439 assert( dwt );
440 nextRound.push_back( dwt->clone() );
441 }
442 delete ctx;
443 } else {
444 FixFunction fixer;
445 *assertion = (*assertion )->acceptMutator( fixer );
446 if ( fixer.get_isVoid() ) {
447 throw SemanticError( "invalid type void in assertion of function ", func );
448 }
449 (*type )->get_assertions().push_back( *assertion );
450 } // if
451 } // for
452 toBeDone.clear();
453 toBeDone.splice( toBeDone.end(), nextRound );
454 } // while
455 } // for
456 }
457
458 void Pass3::visit( ObjectDecl *object ) {
459 forallFixer( object->get_type() );
460 if ( PointerType *pointer = dynamic_cast< PointerType * >( object->get_type() ) ) {
461 forallFixer( pointer->get_base() );
462 } // if
463 Parent::visit( object );
464 object->fixUniqueId();
465 }
466
467 void Pass3::visit( FunctionDecl *func ) {
468 forallFixer( func->get_type() );
469 Parent::visit( func );
470 func->fixUniqueId();
471 }
472
473 static const std::list< std::string > noLabels;
474
475 void AddStructAssignment::addStructAssignment( std::list< Declaration * > &translationUnit ) {
476 AddStructAssignment visitor;
477 acceptAndAdd( translationUnit, visitor, false );
478 }
479
480 template< typename OutputIterator >
481 void makeScalarAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, DeclarationWithType *member, OutputIterator out ) {
482 ObjectDecl *obj = dynamic_cast<ObjectDecl *>( member );
483 // unnamed bit fields are not copied as they cannot be accessed
484 if ( obj != NULL && obj->get_name() == "" && obj->get_bitfieldWidth() != NULL ) return;
485
486 UntypedExpr *assignExpr = new UntypedExpr( new NameExpr( "?=?" ) );
487
488 UntypedExpr *derefExpr = new UntypedExpr( new NameExpr( "*?" ) );
489 derefExpr->get_args().push_back( new VariableExpr( dstParam ) );
490
491 // do something special for unnamed members
492 Expression *dstselect = new AddressExpr( new MemberExpr( member, derefExpr ) );
493 assignExpr->get_args().push_back( dstselect );
494
495 Expression *srcselect = new MemberExpr( member, new VariableExpr( srcParam ) );
496 assignExpr->get_args().push_back( srcselect );
497
498 *out++ = new ExprStmt( noLabels, assignExpr );
499 }
500
501 template< typename OutputIterator >
502 void makeArrayAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, DeclarationWithType *member, ArrayType *array, OutputIterator out ) {
503 static UniqueName indexName( "_index" );
504
505 // for a flexible array member nothing is done -- user must define own assignment
506 if ( ! array->get_dimension() ) return;
507
508 ObjectDecl *index = new ObjectDecl( indexName.newName(), Declaration::NoStorageClass, LinkageSpec::C, 0, new BasicType( Type::Qualifiers(), BasicType::SignedInt ), 0 );
509 *out++ = new DeclStmt( noLabels, index );
510
511 UntypedExpr *init = new UntypedExpr( new NameExpr( "?=?" ) );
512 init->get_args().push_back( new AddressExpr( new VariableExpr( index ) ) );
513 init->get_args().push_back( new NameExpr( "0" ) );
514 Statement *initStmt = new ExprStmt( noLabels, init );
515
516 UntypedExpr *cond = new UntypedExpr( new NameExpr( "?<?" ) );
517 cond->get_args().push_back( new VariableExpr( index ) );
518 cond->get_args().push_back( array->get_dimension()->clone() );
519
520 UntypedExpr *inc = new UntypedExpr( new NameExpr( "++?" ) );
521 inc->get_args().push_back( new AddressExpr( new VariableExpr( index ) ) );
522
523 UntypedExpr *assignExpr = new UntypedExpr( new NameExpr( "?=?" ) );
524
525 UntypedExpr *derefExpr = new UntypedExpr( new NameExpr( "*?" ) );
526 derefExpr->get_args().push_back( new VariableExpr( dstParam ) );
527
528 Expression *dstselect = new MemberExpr( member, derefExpr );
529 UntypedExpr *dstIndex = new UntypedExpr( new NameExpr( "?+?" ) );
530 dstIndex->get_args().push_back( dstselect );
531 dstIndex->get_args().push_back( new VariableExpr( index ) );
532 assignExpr->get_args().push_back( dstIndex );
533
534 Expression *srcselect = new MemberExpr( member, new VariableExpr( srcParam ) );
535 UntypedExpr *srcIndex = new UntypedExpr( new NameExpr( "?[?]" ) );
536 srcIndex->get_args().push_back( srcselect );
537 srcIndex->get_args().push_back( new VariableExpr( index ) );
538 assignExpr->get_args().push_back( srcIndex );
539
540 *out++ = new ForStmt( noLabels, initStmt, cond, inc, new ExprStmt( noLabels, assignExpr ) );
541 }
542
543 Declaration *makeStructAssignment( StructDecl *aggregateDecl, StructInstType *refType, unsigned int functionNesting ) {
544 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );
545
546 ObjectDecl *returnVal = new ObjectDecl( "", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, refType->clone(), 0 );
547 assignType->get_returnVals().push_back( returnVal );
548
549 ObjectDecl *dstParam = new ObjectDecl( "_dst", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), refType->clone() ), 0 );
550 assignType->get_parameters().push_back( dstParam );
551
552 ObjectDecl *srcParam = new ObjectDecl( "_src", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, refType, 0 );
553 assignType->get_parameters().push_back( srcParam );
554
555 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units
556 // because each unit generates copies of the default routines for each aggregate.
557 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? Declaration::NoStorageClass : Declaration::Static, LinkageSpec::AutoGen, assignType, new CompoundStmt( noLabels ), true );
558 assignDecl->fixUniqueId();
559
560 for ( std::list< Declaration * >::const_iterator member = aggregateDecl->get_members().begin(); member != aggregateDecl->get_members().end(); ++member ) {
561 if ( DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *member ) ) {
562 if ( ArrayType *array = dynamic_cast< ArrayType * >( dwt->get_type() ) ) {
563 makeArrayAssignment( srcParam, dstParam, dwt, array, back_inserter( assignDecl->get_statements()->get_kids() ) );
564 } else {
565 makeScalarAssignment( srcParam, dstParam, dwt, back_inserter( assignDecl->get_statements()->get_kids() ) );
566 } // if
567 } // if
568 } // for
569 assignDecl->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, new VariableExpr( srcParam ) ) );
570
571 return assignDecl;
572 }
573
574 Declaration *makeUnionAssignment( UnionDecl *aggregateDecl, UnionInstType *refType, unsigned int functionNesting ) {
575 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );
576
577 ObjectDecl *returnVal = new ObjectDecl( "", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, refType->clone(), 0 );
578 assignType->get_returnVals().push_back( returnVal );
579
580 ObjectDecl *dstParam = new ObjectDecl( "_dst", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), refType->clone() ), 0 );
581 assignType->get_parameters().push_back( dstParam );
582
583 ObjectDecl *srcParam = new ObjectDecl( "_src", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, refType, 0 );
584 assignType->get_parameters().push_back( srcParam );
585
586 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units
587 // because each unit generates copies of the default routines for each aggregate.
588 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? Declaration::NoStorageClass : Declaration::Static, LinkageSpec::AutoGen, assignType, new CompoundStmt( noLabels ), true );
589 assignDecl->fixUniqueId();
590
591 UntypedExpr *copy = new UntypedExpr( new NameExpr( "__builtin_memcpy" ) );
592 copy->get_args().push_back( new VariableExpr( dstParam ) );
593 copy->get_args().push_back( new AddressExpr( new VariableExpr( srcParam ) ) );
594 copy->get_args().push_back( new SizeofExpr( refType->clone() ) );
595
596 assignDecl->get_statements()->get_kids().push_back( new ExprStmt( noLabels, copy ) );
597 assignDecl->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, new VariableExpr( srcParam ) ) );
598
599 return assignDecl;
600 }
601
602 void AddStructAssignment::visit( StructDecl *structDecl ) {
603 if ( ! structDecl->get_members().empty() && structsDone.find( structDecl->get_name() ) == structsDone.end() ) {
604 StructInstType *structInst = new StructInstType( Type::Qualifiers(), structDecl->get_name() );
605 structInst->set_baseStruct( structDecl );
606 declsToAdd.push_back( makeStructAssignment( structDecl, structInst, functionNesting ) );
607 structsDone.insert( structDecl->get_name() );
608 } // if
609 }
610
611 void AddStructAssignment::visit( UnionDecl *unionDecl ) {
612 if ( ! unionDecl->get_members().empty() ) {
613 UnionInstType *unionInst = new UnionInstType( Type::Qualifiers(), unionDecl->get_name() );
614 unionInst->set_baseUnion( unionDecl );
615 declsToAdd.push_back( makeUnionAssignment( unionDecl, unionInst, functionNesting ) );
616 } // if
617 }
618
619 void AddStructAssignment::visit( TypeDecl *typeDecl ) {
620 CompoundStmt *stmts = 0;
621 TypeInstType *typeInst = new TypeInstType( Type::Qualifiers(), typeDecl->get_name(), false );
622 typeInst->set_baseType( typeDecl );
623 ObjectDecl *src = new ObjectDecl( "_src", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, typeInst->clone(), 0 );
624 ObjectDecl *dst = new ObjectDecl( "_dst", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), typeInst->clone() ), 0 );
625 if ( typeDecl->get_base() ) {
626 stmts = new CompoundStmt( std::list< Label >() );
627 UntypedExpr *assign = new UntypedExpr( new NameExpr( "?=?" ) );
628 assign->get_args().push_back( new CastExpr( new VariableExpr( dst ), new PointerType( Type::Qualifiers(), typeDecl->get_base()->clone() ) ) );
629 assign->get_args().push_back( new CastExpr( new VariableExpr( src ), typeDecl->get_base()->clone() ) );
630 stmts->get_kids().push_back( new ReturnStmt( std::list< Label >(), assign ) );
631 } // if
632 FunctionType *type = new FunctionType( Type::Qualifiers(), false );
633 type->get_returnVals().push_back( new ObjectDecl( "", Declaration::NoStorageClass, LinkageSpec::Cforall, 0, typeInst, 0 ) );
634 type->get_parameters().push_back( dst );
635 type->get_parameters().push_back( src );
636 FunctionDecl *func = new FunctionDecl( "?=?", Declaration::NoStorageClass, LinkageSpec::AutoGen, type, stmts, false );
637 declsToAdd.push_back( func );
638 }
639
640 void addDecls( std::list< Declaration * > &declsToAdd, std::list< Statement * > &statements, std::list< Statement * >::iterator i ) {
641 if ( ! declsToAdd.empty() ) {
642 for ( std::list< Declaration * >::iterator decl = declsToAdd.begin(); decl != declsToAdd.end(); ++decl ) {
643 statements.insert( i, new DeclStmt( noLabels, *decl ) );
644 } // for
645 declsToAdd.clear();
646 } // if
647 }
648
649 void AddStructAssignment::visit( FunctionType *) {
650 // ensure that we don't add assignment ops for types defined as part of the function
651 }
652
653 void AddStructAssignment::visit( PointerType *) {
654 // ensure that we don't add assignment ops for types defined as part of the pointer
655 }
656
657 void AddStructAssignment::visit( ContextDecl *) {
658 // ensure that we don't add assignment ops for types defined as part of the context
659 }
660
661 template< typename StmtClass >
662 inline void AddStructAssignment::visitStatement( StmtClass *stmt ) {
663 std::set< std::string > oldStructs = structsDone;
664 addVisit( stmt, *this );
665 structsDone = oldStructs;
666 }
667
668 void AddStructAssignment::visit( FunctionDecl *functionDecl ) {
669 maybeAccept( functionDecl->get_functionType(), *this );
670 acceptAll( functionDecl->get_oldDecls(), *this );
671 functionNesting += 1;
672 maybeAccept( functionDecl->get_statements(), *this );
673 functionNesting -= 1;
674 }
675
676 void AddStructAssignment::visit( CompoundStmt *compoundStmt ) {
677 visitStatement( compoundStmt );
678 }
679
680 void AddStructAssignment::visit( IfStmt *ifStmt ) {
681 visitStatement( ifStmt );
682 }
683
684 void AddStructAssignment::visit( WhileStmt *whileStmt ) {
685 visitStatement( whileStmt );
686 }
687
688 void AddStructAssignment::visit( ForStmt *forStmt ) {
689 visitStatement( forStmt );
690 }
691
692 void AddStructAssignment::visit( SwitchStmt *switchStmt ) {
693 visitStatement( switchStmt );
694 }
695
696 void AddStructAssignment::visit( ChooseStmt *switchStmt ) {
697 visitStatement( switchStmt );
698 }
699
700 void AddStructAssignment::visit( CaseStmt *caseStmt ) {
701 visitStatement( caseStmt );
702 }
703
704 void AddStructAssignment::visit( CatchStmt *cathStmt ) {
705 visitStatement( cathStmt );
706 }
707
708 bool isTypedef( Declaration *decl ) {
709 return dynamic_cast< TypedefDecl * >( decl );
710 }
711
712 void EliminateTypedef::eliminateTypedef( std::list< Declaration * > &translationUnit ) {
713 EliminateTypedef eliminator;
714 mutateAll( translationUnit, eliminator );
715 filter( translationUnit, isTypedef, true );
716 }
717
718 Type *EliminateTypedef::mutate( TypeInstType *typeInst ) {
719 std::map< std::string, TypedefDecl * >::const_iterator def = typedefNames.find( typeInst->get_name() );
720 if ( def != typedefNames.end() ) {
721 Type *ret = def->second->get_base()->clone();
722 ret->get_qualifiers() += typeInst->get_qualifiers();
723 delete typeInst;
724 return ret;
725 } // if
726 return typeInst;
727 }
728
729 Declaration *EliminateTypedef::mutate( TypedefDecl *tyDecl ) {
730 Declaration *ret = Mutator::mutate( tyDecl );
731 typedefNames[ tyDecl->get_name() ] = tyDecl;
732 // When a typedef is a forward declaration:
733 // typedef struct screen SCREEN;
734 // the declaration portion must be retained:
735 // struct screen;
736 // because the expansion of the typedef is:
737 // void rtn( SCREEN *p ) => void rtn( struct screen *p )
738 // hence the type-name "screen" must be defined.
739 // Note, qualifiers on the typedef are superfluous for the forward declaration.
740 if ( StructInstType *aggDecl = dynamic_cast< StructInstType * >( tyDecl->get_base() ) ) {
741 return new StructDecl( aggDecl->get_name() );
742 } else if ( UnionInstType *aggDecl = dynamic_cast< UnionInstType * >( tyDecl->get_base() ) ) {
743 return new UnionDecl( aggDecl->get_name() );
744 } else {
745 return ret;
746 } // if
747 }
748
749 TypeDecl *EliminateTypedef::mutate( TypeDecl *typeDecl ) {
750 std::map< std::string, TypedefDecl * >::iterator i = typedefNames.find( typeDecl->get_name() );
751 if ( i != typedefNames.end() ) {
752 typedefNames.erase( i ) ;
753 } // if
754 return typeDecl;
755 }
756
757 DeclarationWithType *EliminateTypedef::mutate( FunctionDecl *funcDecl ) {
758 std::map< std::string, TypedefDecl * > oldNames = typedefNames;
759 DeclarationWithType *ret = Mutator::mutate( funcDecl );
760 typedefNames = oldNames;
761 return ret;
762 }
763
764 ObjectDecl *EliminateTypedef::mutate( ObjectDecl *objDecl ) {
765 std::map< std::string, TypedefDecl * > oldNames = typedefNames;
766 ObjectDecl *ret = Mutator::mutate( objDecl );
767 typedefNames = oldNames;
768 return ret;
769 }
770
771 Expression *EliminateTypedef::mutate( CastExpr *castExpr ) {
772 std::map< std::string, TypedefDecl * > oldNames = typedefNames;
773 Expression *ret = Mutator::mutate( castExpr );
774 typedefNames = oldNames;
775 return ret;
776 }
777
778 CompoundStmt *EliminateTypedef::mutate( CompoundStmt *compoundStmt ) {
779 std::map< std::string, TypedefDecl * > oldNames = typedefNames;
780 CompoundStmt *ret = Mutator::mutate( compoundStmt );
781 std::list< Statement * >::iterator i = compoundStmt->get_kids().begin();
782 while ( i != compoundStmt->get_kids().end() ) {
783 std::list< Statement * >::iterator next = i;
784 ++next;
785 if ( DeclStmt *declStmt = dynamic_cast< DeclStmt * >( *i ) ) {
786 if ( dynamic_cast< TypedefDecl * >( declStmt->get_decl() ) ) {
787 delete *i;
788 compoundStmt->get_kids().erase( i );
789 } // if
790 } // if
791 i = next;
792 } // while
793 typedefNames = oldNames;
794 return ret;
795 }
796} // namespace SymTab
797
798// Local Variables: //
799// tab-width: 4 //
800// mode: c++ //
801// compile-command: "make install" //
802// End: //
Note: See TracBrowser for help on using the repository browser.