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