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 | // Autogen.cc -- |
---|
8 | // |
---|
9 | // Author : Rob Schluntz |
---|
10 | // Created On : Thu Mar 03 15:45:56 2016 |
---|
11 | // Last Modified By : Andrew Beach |
---|
12 | // Last Modified On : Fri Jul 14 16:41:00 2017 |
---|
13 | // Update Count : 62 |
---|
14 | // |
---|
15 | |
---|
16 | #include "Autogen.h" |
---|
17 | |
---|
18 | #include <algorithm> // for count_if |
---|
19 | #include <cassert> // for strict_dynamic_cast, assert, assertf |
---|
20 | #include <iterator> // for back_insert_iterator, back_inserter |
---|
21 | #include <list> // for list, _List_iterator, list<>::iter... |
---|
22 | #include <set> // for set, _Rb_tree_const_iterator |
---|
23 | #include <utility> // for pair |
---|
24 | #include <vector> // for vector |
---|
25 | |
---|
26 | #include "AddVisit.h" // for addVisit |
---|
27 | #include "CodeGen/OperatorTable.h" // for isCtorDtor, isCtorDtorAssign |
---|
28 | #include "Common/PassVisitor.h" // for PassVisitor |
---|
29 | #include "Common/ScopedMap.h" // for ScopedMap<>::const_iterator, Scope... |
---|
30 | #include "Common/utility.h" // for cloneAll, operator+ |
---|
31 | #include "GenPoly/ScopedSet.h" // for ScopedSet, ScopedSet<>::iterator |
---|
32 | #include "InitTweak/GenInit.h" // for fixReturnStatements |
---|
33 | #include "ResolvExpr/Resolver.h" // for resolveDecl |
---|
34 | #include "SymTab/Mangler.h" // for Mangler |
---|
35 | #include "SynTree/Attribute.h" // For Attribute |
---|
36 | #include "SynTree/Mutator.h" // for maybeMutate |
---|
37 | #include "SynTree/Statement.h" // for CompoundStmt, ReturnStmt, ExprStmt |
---|
38 | #include "SynTree/Type.h" // for FunctionType, Type, TypeInstType |
---|
39 | #include "SynTree/Visitor.h" // for maybeAccept, Visitor, acceptAll |
---|
40 | |
---|
41 | class Attribute; |
---|
42 | |
---|
43 | namespace SymTab { |
---|
44 | Type * SizeType = 0; |
---|
45 | |
---|
46 | /// Data used to generate functions generically. Specifically, the name of the generated function and a function which generates the routine protoype |
---|
47 | struct FuncData { |
---|
48 | typedef FunctionType * (*TypeGen)( Type * ); |
---|
49 | FuncData( const std::string & fname, const TypeGen & genType ) : fname( fname ), genType( genType ) {} |
---|
50 | std::string fname; |
---|
51 | TypeGen genType; |
---|
52 | }; |
---|
53 | |
---|
54 | struct AutogenerateRoutines final : public WithDeclsToAdd, public WithVisitorRef<AutogenerateRoutines>, public WithGuards, public WithShortCircuiting, public WithIndexer { |
---|
55 | AutogenerateRoutines(); |
---|
56 | |
---|
57 | void previsit( EnumDecl * enumDecl ); |
---|
58 | void previsit( StructDecl * structDecl ); |
---|
59 | void previsit( UnionDecl * structDecl ); |
---|
60 | void previsit( TypeDecl * typeDecl ); |
---|
61 | void previsit( TraitDecl * traitDecl ); |
---|
62 | void previsit( FunctionDecl * functionDecl ); |
---|
63 | |
---|
64 | void previsit( CompoundStmt * compoundStmt ); |
---|
65 | |
---|
66 | private: |
---|
67 | |
---|
68 | GenPoly::ScopedSet< std::string > structsDone; |
---|
69 | unsigned int functionNesting = 0; // current level of nested functions |
---|
70 | |
---|
71 | std::vector< FuncData > data; |
---|
72 | }; |
---|
73 | |
---|
74 | /// generates routines for tuple types. |
---|
75 | struct AutogenTupleRoutines : public WithDeclsToAdd, public WithVisitorRef<AutogenTupleRoutines>, public WithGuards, public WithShortCircuiting { |
---|
76 | void previsit( FunctionDecl * functionDecl ); |
---|
77 | |
---|
78 | void postvisit( TupleType * tupleType ); |
---|
79 | |
---|
80 | void previsit( CompoundStmt * compoundStmt ); |
---|
81 | |
---|
82 | private: |
---|
83 | unsigned int functionNesting = 0; // current level of nested functions |
---|
84 | GenPoly::ScopedSet< std::string > seenTuples; |
---|
85 | }; |
---|
86 | |
---|
87 | void autogenerateRoutines( std::list< Declaration * > &translationUnit ) { |
---|
88 | PassVisitor<AutogenerateRoutines> generator; |
---|
89 | acceptAll( translationUnit, generator ); |
---|
90 | |
---|
91 | // needs to be done separately because AutogenerateRoutines skips types that appear as function arguments, etc. |
---|
92 | // AutogenTupleRoutines tupleGenerator; |
---|
93 | // acceptAll( translationUnit, tupleGenerator ); |
---|
94 | } |
---|
95 | |
---|
96 | //============================================================================================= |
---|
97 | // FuncGenerator definitions |
---|
98 | //============================================================================================= |
---|
99 | class FuncGenerator { |
---|
100 | public: |
---|
101 | std::list< Declaration * > definitions, forwards; |
---|
102 | |
---|
103 | FuncGenerator( Type * type, const std::vector< FuncData > & data, unsigned int functionNesting, SymTab::Indexer & indexer ) : type( type ), data( data ), functionNesting( functionNesting ), indexer( indexer ) {} |
---|
104 | |
---|
105 | virtual bool shouldAutogen() const = 0; |
---|
106 | void genStandardFuncs(); |
---|
107 | virtual void genFieldCtors() = 0; |
---|
108 | protected: |
---|
109 | Type * type; |
---|
110 | const std::vector< FuncData > & data; |
---|
111 | unsigned int functionNesting; |
---|
112 | SymTab::Indexer & indexer; |
---|
113 | |
---|
114 | virtual void genFuncBody( FunctionDecl * dcl ) = 0; |
---|
115 | virtual bool isConcurrentType() const = 0; |
---|
116 | |
---|
117 | void resolve( FunctionDecl * dcl ); |
---|
118 | void generatePrototypes( std::list< FunctionDecl * > & newFuncs ); |
---|
119 | }; |
---|
120 | |
---|
121 | class StructFuncGenerator : public FuncGenerator { |
---|
122 | StructDecl * aggregateDecl; |
---|
123 | public: |
---|
124 | StructFuncGenerator( StructDecl * aggregateDecl, StructInstType * refType, const std::vector< FuncData > & data, unsigned int functionNesting, SymTab::Indexer & indexer ) : FuncGenerator( refType, data, functionNesting, indexer ), aggregateDecl( aggregateDecl) {} |
---|
125 | |
---|
126 | virtual bool shouldAutogen() const override; |
---|
127 | virtual bool isConcurrentType() const override; |
---|
128 | |
---|
129 | virtual void genFuncBody( FunctionDecl * dcl ) override; |
---|
130 | virtual void genFieldCtors() override; |
---|
131 | |
---|
132 | private: |
---|
133 | /// generates a single struct member operation (constructor call, destructor call, assignment call) |
---|
134 | void makeMemberOp( ObjectDecl * dstParam, Expression * src, DeclarationWithType * field, FunctionDecl * func, bool forward = true ); |
---|
135 | |
---|
136 | /// generates the body of a struct function by iterating the struct members (via parameters) - generates default ctor, copy ctor, assignment, and dtor bodies, but NOT field ctor bodies |
---|
137 | template<typename Iterator> |
---|
138 | void makeFunctionBody( Iterator member, Iterator end, FunctionDecl * func, bool forward = true ); |
---|
139 | |
---|
140 | /// generate the body of a constructor which takes parameters that match fields, e.g. |
---|
141 | /// void ?{}(A *, int) and void?{}(A *, int, int) for a struct A which has two int fields. |
---|
142 | template<typename Iterator> |
---|
143 | void makeFieldCtorBody( Iterator member, Iterator end, FunctionDecl * func ); |
---|
144 | }; |
---|
145 | |
---|
146 | class UnionFuncGenerator : public FuncGenerator { |
---|
147 | UnionDecl * aggregateDecl; |
---|
148 | public: |
---|
149 | UnionFuncGenerator( UnionDecl * aggregateDecl, UnionInstType * refType, const std::vector< FuncData > & data, unsigned int functionNesting, SymTab::Indexer & indexer ) : FuncGenerator( refType, data, functionNesting, indexer ), aggregateDecl( aggregateDecl) {} |
---|
150 | |
---|
151 | virtual bool shouldAutogen() const override; |
---|
152 | virtual bool isConcurrentType() const override; |
---|
153 | |
---|
154 | virtual void genFuncBody( FunctionDecl * dcl ) override; |
---|
155 | virtual void genFieldCtors() override; |
---|
156 | |
---|
157 | private: |
---|
158 | /// generates a single struct member operation (constructor call, destructor call, assignment call) |
---|
159 | template<typename OutputIterator> |
---|
160 | void makeMemberOp( ObjectDecl * srcParam, ObjectDecl * dstParam, OutputIterator out ); |
---|
161 | |
---|
162 | /// generates the body of a struct function by iterating the struct members (via parameters) - generates default ctor, copy ctor, assignment, and dtor bodies, but NOT field ctor bodies |
---|
163 | template<typename Iterator> |
---|
164 | void makeFunctionBody( Iterator member, Iterator end, FunctionDecl * func, bool forward = true ); |
---|
165 | |
---|
166 | /// generate the body of a constructor which takes parameters that match fields, e.g. |
---|
167 | /// void ?{}(A *, int) and void?{}(A *, int, int) for a struct A which has two int fields. |
---|
168 | template<typename Iterator> |
---|
169 | void makeFieldCtorBody( Iterator member, Iterator end, FunctionDecl * func ); |
---|
170 | }; |
---|
171 | |
---|
172 | class EnumFuncGenerator : public FuncGenerator { |
---|
173 | public: |
---|
174 | EnumFuncGenerator( EnumInstType * refType, const std::vector< FuncData > & data, unsigned int functionNesting, SymTab::Indexer & indexer ) : FuncGenerator( refType, data, functionNesting, indexer ) {} |
---|
175 | |
---|
176 | virtual bool shouldAutogen() const override; |
---|
177 | virtual bool isConcurrentType() const override; |
---|
178 | |
---|
179 | virtual void genFuncBody( FunctionDecl * dcl ) override; |
---|
180 | virtual void genFieldCtors() override; |
---|
181 | |
---|
182 | private: |
---|
183 | }; |
---|
184 | |
---|
185 | class TypeFuncGenerator : public FuncGenerator { |
---|
186 | TypeDecl * typeDecl; |
---|
187 | public: |
---|
188 | TypeFuncGenerator( TypeDecl * typeDecl, TypeInstType * refType, const std::vector<FuncData> & data, unsigned int functionNesting, SymTab::Indexer & indexer ) : FuncGenerator( refType, data, functionNesting, indexer ), typeDecl( typeDecl ) {} |
---|
189 | |
---|
190 | virtual bool shouldAutogen() const override; |
---|
191 | virtual void genFuncBody( FunctionDecl * dcl ) override; |
---|
192 | virtual bool isConcurrentType() const override; |
---|
193 | virtual void genFieldCtors() override; |
---|
194 | }; |
---|
195 | |
---|
196 | //============================================================================================= |
---|
197 | // helper functions |
---|
198 | //============================================================================================= |
---|
199 | void generateFunctions( FuncGenerator & gen, std::list< Declaration * > & declsToAdd ) { |
---|
200 | if ( ! gen.shouldAutogen() ) return; |
---|
201 | |
---|
202 | // generate each of the functions based on the supplied FuncData objects |
---|
203 | gen.genStandardFuncs(); |
---|
204 | gen.genFieldCtors(); |
---|
205 | |
---|
206 | declsToAdd.splice( declsToAdd.end(), gen.forwards ); |
---|
207 | declsToAdd.splice( declsToAdd.end(), gen.definitions ); |
---|
208 | } |
---|
209 | |
---|
210 | bool isUnnamedBitfield( ObjectDecl * obj ) { |
---|
211 | return obj != nullptr && obj->name == "" && obj->bitfieldWidth != nullptr; |
---|
212 | } |
---|
213 | |
---|
214 | /// inserts a forward declaration for functionDecl into declsToAdd |
---|
215 | void addForwardDecl( FunctionDecl * functionDecl, std::list< Declaration * > & declsToAdd ) { |
---|
216 | FunctionDecl * decl = functionDecl->clone(); |
---|
217 | delete decl->statements; |
---|
218 | decl->statements = nullptr; |
---|
219 | declsToAdd.push_back( decl ); |
---|
220 | decl->fixUniqueId(); |
---|
221 | } |
---|
222 | |
---|
223 | const std::list< TypeDecl * > getGenericParams( Type * t ) { |
---|
224 | std::list< TypeDecl * > * ret = nullptr; |
---|
225 | if ( StructInstType * inst = dynamic_cast< StructInstType * > ( t ) ) { |
---|
226 | ret = inst->get_baseParameters(); |
---|
227 | } else if ( UnionInstType * inst = dynamic_cast< UnionInstType * >( t ) ) { |
---|
228 | ret = inst->get_baseParameters(); |
---|
229 | } |
---|
230 | return ret ? *ret : std::list< TypeDecl * >(); |
---|
231 | } |
---|
232 | |
---|
233 | /// given type T, generate type of default ctor/dtor, i.e. function type void (*) (T *) |
---|
234 | FunctionType * genDefaultType( Type * paramType ) { |
---|
235 | const auto & typeParams = getGenericParams( paramType ); |
---|
236 | FunctionType *ftype = new FunctionType( Type::Qualifiers(), false ); |
---|
237 | cloneAll( typeParams, ftype->forall ); |
---|
238 | ObjectDecl *dstParam = new ObjectDecl( "_dst", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, new ReferenceType( Type::Qualifiers(), paramType->clone() ), nullptr ); |
---|
239 | ftype->parameters.push_back( dstParam ); |
---|
240 | return ftype; |
---|
241 | } |
---|
242 | |
---|
243 | /// given type T, generate type of copy ctor, i.e. function type void (*) (T *, T) |
---|
244 | FunctionType * genCopyType( Type * paramType ) { |
---|
245 | FunctionType *ftype = genDefaultType( paramType ); |
---|
246 | ObjectDecl *srcParam = new ObjectDecl( "_src", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, paramType->clone(), nullptr ); |
---|
247 | ftype->parameters.push_back( srcParam ); |
---|
248 | return ftype; |
---|
249 | } |
---|
250 | |
---|
251 | /// given type T, generate type of assignment, i.e. function type T (*) (T *, T) |
---|
252 | FunctionType * genAssignType( Type * paramType ) { |
---|
253 | FunctionType *ftype = genCopyType( paramType ); |
---|
254 | ObjectDecl *returnVal = new ObjectDecl( "_ret", Type::StorageClasses(), LinkageSpec::Cforall, nullptr, paramType->clone(), nullptr ); |
---|
255 | ftype->returnVals.push_back( returnVal ); |
---|
256 | return ftype; |
---|
257 | } |
---|
258 | |
---|
259 | /// generate a function decl from a name and type. Nesting depth determines whether |
---|
260 | /// the declaration is static or not; optional paramter determines if declaration is intrinsic |
---|
261 | FunctionDecl * genFunc( const std::string & fname, FunctionType * ftype, unsigned int functionNesting, bool isIntrinsic = false ) { |
---|
262 | // Routines at global scope marked "static" to prevent multiple definitions in separate translation units |
---|
263 | // because each unit generates copies of the default routines for each aggregate. |
---|
264 | Type::StorageClasses scs = functionNesting > 0 ? Type::StorageClasses() : Type::StorageClasses( Type::Static ); |
---|
265 | LinkageSpec::Spec spec = isIntrinsic ? LinkageSpec::Intrinsic : LinkageSpec::AutoGen; |
---|
266 | FunctionDecl * decl = new FunctionDecl( fname, scs, spec, ftype, new CompoundStmt( noLabels ), |
---|
267 | std::list< Attribute * >(), Type::FuncSpecifiers( Type::Inline ) ); |
---|
268 | decl->fixUniqueId(); |
---|
269 | return decl; |
---|
270 | } |
---|
271 | |
---|
272 | Type * declToType( Declaration * decl ) { |
---|
273 | if ( DeclarationWithType * dwt = dynamic_cast< DeclarationWithType * >( decl ) ) { |
---|
274 | return dwt->get_type(); |
---|
275 | } |
---|
276 | return nullptr; |
---|
277 | } |
---|
278 | |
---|
279 | Type * declToTypeDeclBase( Declaration * decl ) { |
---|
280 | if ( TypeDecl * td = dynamic_cast< TypeDecl * >( decl ) ) { |
---|
281 | return td->base; |
---|
282 | } |
---|
283 | return nullptr; |
---|
284 | } |
---|
285 | |
---|
286 | //============================================================================================= |
---|
287 | // FuncGenerator member definitions |
---|
288 | //============================================================================================= |
---|
289 | void FuncGenerator::genStandardFuncs() { |
---|
290 | std::list< FunctionDecl * > newFuncs; |
---|
291 | generatePrototypes( newFuncs ); |
---|
292 | |
---|
293 | for ( FunctionDecl * dcl : newFuncs ) { |
---|
294 | genFuncBody( dcl ); |
---|
295 | if ( CodeGen::isAssignment( dcl->name ) ) { |
---|
296 | // assignment needs to return a value |
---|
297 | FunctionType * assignType = dcl->type; |
---|
298 | assert( assignType->parameters.size() == 2 ); |
---|
299 | assert( assignType->returnVals.size() == 1 ); |
---|
300 | ObjectDecl * dstParam = strict_dynamic_cast< ObjectDecl * >( assignType->parameters.front() ); |
---|
301 | dcl->statements->push_back( new ReturnStmt( noLabels, new VariableExpr( dstParam ) ) ); |
---|
302 | } |
---|
303 | resolve( dcl ); |
---|
304 | } |
---|
305 | } |
---|
306 | |
---|
307 | void FuncGenerator::generatePrototypes( std::list< FunctionDecl * > & newFuncs ) { |
---|
308 | bool concurrent_type = isConcurrentType(); |
---|
309 | for ( const FuncData & d : data ) { |
---|
310 | // generate a function (?{}, ?=?, ^?{}) based on the current FuncData. |
---|
311 | FunctionType * ftype = d.genType( type ); |
---|
312 | |
---|
313 | // destructor for concurrent type must be mutex |
---|
314 | if ( concurrent_type && CodeGen::isDestructor( d.fname ) ) { |
---|
315 | ftype->parameters.front()->get_type()->set_mutex( true ); |
---|
316 | } |
---|
317 | |
---|
318 | newFuncs.push_back( genFunc( d.fname, ftype, functionNesting ) ); |
---|
319 | } |
---|
320 | } |
---|
321 | |
---|
322 | void FuncGenerator::resolve( FunctionDecl * dcl ) { |
---|
323 | try { |
---|
324 | ResolvExpr::resolveDecl( dcl, indexer ); |
---|
325 | if ( functionNesting == 0 ) { |
---|
326 | // forward declare if top-level struct, so that |
---|
327 | // type is complete as soon as its body ends |
---|
328 | // Note: this is necessary if we want structs which contain |
---|
329 | // generic (otype) structs as members. |
---|
330 | addForwardDecl( dcl, forwards ); |
---|
331 | } |
---|
332 | definitions.push_back( dcl ); |
---|
333 | indexer.addId( dcl ); |
---|
334 | } catch ( SemanticError err ) { |
---|
335 | // okay if decl does not resolve - that means the function should not be generated |
---|
336 | delete dcl; |
---|
337 | } |
---|
338 | } |
---|
339 | |
---|
340 | bool StructFuncGenerator::shouldAutogen() const { |
---|
341 | // Builtins do not use autogeneration. |
---|
342 | return ! aggregateDecl->linkage.is_builtin; |
---|
343 | } |
---|
344 | bool StructFuncGenerator::isConcurrentType() const { return aggregateDecl->is_thread() || aggregateDecl->is_monitor(); } |
---|
345 | |
---|
346 | void StructFuncGenerator::genFuncBody( FunctionDecl * dcl ) { |
---|
347 | // generate appropriate calls to member ctor, assignment |
---|
348 | // destructor needs to do everything in reverse, so pass "forward" based on whether the function is a destructor |
---|
349 | if ( ! CodeGen::isDestructor( dcl->name ) ) { |
---|
350 | makeFunctionBody( aggregateDecl->members.begin(), aggregateDecl->members.end(), dcl ); |
---|
351 | } else { |
---|
352 | makeFunctionBody( aggregateDecl->members.rbegin(), aggregateDecl->members.rend(), dcl, false ); |
---|
353 | } |
---|
354 | } |
---|
355 | |
---|
356 | void StructFuncGenerator::genFieldCtors() { |
---|
357 | // field ctors are only generated if default constructor and copy constructor are both generated |
---|
358 | unsigned numCtors = std::count_if( definitions.begin(), definitions.end(), [](Declaration * dcl) { return CodeGen::isConstructor( dcl->name ); } ); |
---|
359 | |
---|
360 | // Field constructors are only generated if default and copy constructor |
---|
361 | // are generated, since they need access to both |
---|
362 | if ( numCtors != 2 ) return; |
---|
363 | |
---|
364 | // create constructors which take each member type as a parameter. |
---|
365 | // for example, for struct A { int x, y; }; generate |
---|
366 | // void ?{}(A *, int) and void ?{}(A *, int, int) |
---|
367 | FunctionType * memCtorType = genDefaultType( type ); |
---|
368 | for ( Declaration * member : aggregateDecl->members ) { |
---|
369 | DeclarationWithType * field = strict_dynamic_cast<DeclarationWithType *>( member ); |
---|
370 | if ( isUnnamedBitfield( dynamic_cast< ObjectDecl * > ( field ) ) ) { |
---|
371 | // don't make a function whose parameter is an unnamed bitfield |
---|
372 | continue; |
---|
373 | } |
---|
374 | memCtorType->parameters.push_back( new ObjectDecl( field->name, Type::StorageClasses(), LinkageSpec::Cforall, 0, field->get_type()->clone(), 0 ) ); |
---|
375 | FunctionDecl * ctor = genFunc( "?{}", memCtorType->clone(), functionNesting ); |
---|
376 | makeFieldCtorBody( aggregateDecl->members.begin(), aggregateDecl->members.end(), ctor ); |
---|
377 | resolve( ctor ); |
---|
378 | } |
---|
379 | delete memCtorType; |
---|
380 | } |
---|
381 | |
---|
382 | void StructFuncGenerator::makeMemberOp( ObjectDecl * dstParam, Expression * src, DeclarationWithType * field, FunctionDecl * func, bool forward ) { |
---|
383 | InitTweak::InitExpander srcParam( src ); |
---|
384 | |
---|
385 | // assign to destination |
---|
386 | Expression *dstselect = new MemberExpr( field, new CastExpr( new VariableExpr( dstParam ), strict_dynamic_cast< ReferenceType* >( dstParam->get_type() )->base->clone() ) ); |
---|
387 | genImplicitCall( srcParam, dstselect, func->name, back_inserter( func->statements->kids ), field, forward ); |
---|
388 | } |
---|
389 | |
---|
390 | template<typename Iterator> |
---|
391 | void StructFuncGenerator::makeFunctionBody( Iterator member, Iterator end, FunctionDecl * func, bool forward ) { |
---|
392 | for ( ; member != end; ++member ) { |
---|
393 | if ( DeclarationWithType *field = dynamic_cast< DeclarationWithType * >( *member ) ) { // otherwise some form of type declaration, e.g. Aggregate |
---|
394 | // query the type qualifiers of this field and skip assigning it if it is marked const. |
---|
395 | // If it is an array type, we need to strip off the array layers to find its qualifiers. |
---|
396 | Type * type = field->get_type(); |
---|
397 | while ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) { |
---|
398 | type = at->get_base(); |
---|
399 | } |
---|
400 | |
---|
401 | if ( type->get_const() && CodeGen::isAssignment( func->name ) ) { |
---|
402 | // don't assign const members, but do construct/destruct |
---|
403 | continue; |
---|
404 | } |
---|
405 | |
---|
406 | assert( ! func->get_functionType()->get_parameters().empty() ); |
---|
407 | ObjectDecl * dstParam = dynamic_cast<ObjectDecl*>( func->get_functionType()->get_parameters().front() ); |
---|
408 | ObjectDecl * srcParam = nullptr; |
---|
409 | if ( func->get_functionType()->get_parameters().size() == 2 ) { |
---|
410 | srcParam = dynamic_cast<ObjectDecl*>( func->get_functionType()->get_parameters().back() ); |
---|
411 | } |
---|
412 | |
---|
413 | // srcParam may be NULL, in which case we have default ctor/dtor |
---|
414 | assert( dstParam ); |
---|
415 | |
---|
416 | Expression *srcselect = srcParam ? new MemberExpr( field, new VariableExpr( srcParam ) ) : nullptr; |
---|
417 | makeMemberOp( dstParam, srcselect, field, func, forward ); |
---|
418 | } // if |
---|
419 | } // for |
---|
420 | } // makeFunctionBody |
---|
421 | |
---|
422 | template<typename Iterator> |
---|
423 | void StructFuncGenerator::makeFieldCtorBody( Iterator member, Iterator end, FunctionDecl * func ) { |
---|
424 | FunctionType * ftype = func->type; |
---|
425 | std::list<DeclarationWithType*> & params = ftype->parameters; |
---|
426 | assert( params.size() >= 2 ); // should not call this function for default ctor, etc. |
---|
427 | |
---|
428 | // skip 'this' parameter |
---|
429 | ObjectDecl * dstParam = dynamic_cast<ObjectDecl*>( params.front() ); |
---|
430 | assert( dstParam ); |
---|
431 | std::list<DeclarationWithType*>::iterator parameter = params.begin()+1; |
---|
432 | for ( ; member != end; ++member ) { |
---|
433 | if ( DeclarationWithType * field = dynamic_cast<DeclarationWithType*>( *member ) ) { |
---|
434 | if ( isUnnamedBitfield( dynamic_cast< ObjectDecl * > ( field ) ) ) { |
---|
435 | // don't make a function whose parameter is an unnamed bitfield |
---|
436 | continue; |
---|
437 | } else if ( parameter != params.end() ) { |
---|
438 | // matching parameter, initialize field with copy ctor |
---|
439 | Expression *srcselect = new VariableExpr(*parameter); |
---|
440 | makeMemberOp( dstParam, srcselect, field, func ); |
---|
441 | ++parameter; |
---|
442 | } else { |
---|
443 | // no matching parameter, initialize field with default ctor |
---|
444 | makeMemberOp( dstParam, nullptr, field, func ); |
---|
445 | } |
---|
446 | } |
---|
447 | } |
---|
448 | } |
---|
449 | |
---|
450 | bool UnionFuncGenerator::shouldAutogen() const { |
---|
451 | // Builtins do not use autogeneration. |
---|
452 | return ! aggregateDecl->linkage.is_builtin; |
---|
453 | } |
---|
454 | |
---|
455 | // xxx - is this right? |
---|
456 | bool UnionFuncGenerator::isConcurrentType() const { return false; }; |
---|
457 | |
---|
458 | /// generate a single union assignment expression (using memcpy) |
---|
459 | template< typename OutputIterator > |
---|
460 | void UnionFuncGenerator::makeMemberOp( ObjectDecl * srcParam, ObjectDecl * dstParam, OutputIterator out ) { |
---|
461 | UntypedExpr *copy = new UntypedExpr( new NameExpr( "__builtin_memcpy" ) ); |
---|
462 | copy->args.push_back( new AddressExpr( new VariableExpr( dstParam ) ) ); |
---|
463 | copy->args.push_back( new AddressExpr( new VariableExpr( srcParam ) ) ); |
---|
464 | copy->args.push_back( new SizeofExpr( srcParam->get_type()->clone() ) ); |
---|
465 | *out++ = new ExprStmt( noLabels, copy ); |
---|
466 | } |
---|
467 | |
---|
468 | /// generates the body of a union assignment/copy constructor/field constructor |
---|
469 | void UnionFuncGenerator::genFuncBody( FunctionDecl * funcDecl ) { |
---|
470 | FunctionType * ftype = funcDecl->type; |
---|
471 | if ( InitTweak::isCopyConstructor( funcDecl ) || InitTweak::isAssignment( funcDecl ) ) { |
---|
472 | assert( ftype->parameters.size() == 2 ); |
---|
473 | ObjectDecl * dstParam = strict_dynamic_cast< ObjectDecl * >( ftype->parameters.front() ); |
---|
474 | ObjectDecl * srcParam = strict_dynamic_cast< ObjectDecl * >( ftype->parameters.back() ); |
---|
475 | makeMemberOp( srcParam, dstParam, back_inserter( funcDecl->statements->kids ) ); |
---|
476 | } else { |
---|
477 | // default ctor/dtor body is empty - add unused attribute to parameter to silence warnings |
---|
478 | assert( ftype->parameters.size() == 1 ); |
---|
479 | ObjectDecl * dstParam = strict_dynamic_cast< ObjectDecl * >( ftype->parameters.front() ); |
---|
480 | dstParam->attributes.push_back( new Attribute( "unused" ) ); |
---|
481 | } |
---|
482 | } |
---|
483 | |
---|
484 | /// generate the body of a constructor which takes parameters that match fields, e.g. |
---|
485 | /// void ?{}(A *, int) and void?{}(A *, int, int) for a struct A which has two int fields. |
---|
486 | void UnionFuncGenerator::genFieldCtors() { |
---|
487 | // field ctors are only generated if default constructor and copy constructor are both generated |
---|
488 | unsigned numCtors = std::count_if( definitions.begin(), definitions.end(), [](Declaration * dcl) { return CodeGen::isConstructor( dcl->get_name() ); } ); |
---|
489 | |
---|
490 | // Field constructors are only generated if default and copy constructor |
---|
491 | // are generated, since they need access to both |
---|
492 | if ( numCtors != 2 ) return; |
---|
493 | |
---|
494 | // create a constructor which takes the first member type as a parameter. |
---|
495 | // for example, for Union A { int x; double y; }; generate |
---|
496 | // void ?{}(A *, int) |
---|
497 | // This is to mimic C's behaviour which initializes the first member of the union. |
---|
498 | FunctionType * memCtorType = genDefaultType( type ); |
---|
499 | for ( Declaration * member : aggregateDecl->members ) { |
---|
500 | DeclarationWithType * field = strict_dynamic_cast<DeclarationWithType *>( member ); |
---|
501 | if ( isUnnamedBitfield( dynamic_cast< ObjectDecl * > ( field ) ) ) { |
---|
502 | // don't make a function whose parameter is an unnamed bitfield |
---|
503 | break; |
---|
504 | } |
---|
505 | memCtorType->parameters.push_back( new ObjectDecl( field->name, Type::StorageClasses(), LinkageSpec::Cforall, nullptr, field->get_type()->clone(), nullptr ) ); |
---|
506 | FunctionDecl * ctor = genFunc( "?{}", memCtorType->clone(), functionNesting ); |
---|
507 | ObjectDecl * srcParam = strict_dynamic_cast<ObjectDecl *>( ctor->type->parameters.back() ); |
---|
508 | srcParam->fixUniqueId(); |
---|
509 | ObjectDecl * dstParam = InitTweak::getParamThis( ctor->type ); |
---|
510 | makeMemberOp( srcParam, dstParam, back_inserter( ctor->statements->kids ) ); |
---|
511 | resolve( ctor ); |
---|
512 | // only generate one field ctor for unions |
---|
513 | break; |
---|
514 | } |
---|
515 | delete memCtorType; |
---|
516 | } |
---|
517 | |
---|
518 | void EnumFuncGenerator::genFuncBody( FunctionDecl * funcDecl ) { |
---|
519 | // xxx - Temporary: make these functions intrinsic so they codegen as C assignment. |
---|
520 | // Really they're something of a cross between instrinsic and autogen, so should |
---|
521 | // probably make a new linkage type |
---|
522 | funcDecl->linkage = LinkageSpec::Intrinsic; |
---|
523 | FunctionType * ftype = funcDecl->type; |
---|
524 | if ( InitTweak::isCopyConstructor( funcDecl ) || InitTweak::isAssignment( funcDecl ) ) { |
---|
525 | assert( ftype->parameters.size() == 2 ); |
---|
526 | ObjectDecl * dstParam = strict_dynamic_cast< ObjectDecl * >( ftype->parameters.front() ); |
---|
527 | ObjectDecl * srcParam = strict_dynamic_cast< ObjectDecl * >( ftype->parameters.back() ); |
---|
528 | |
---|
529 | // enum copy construct and assignment is just C-style assignment. |
---|
530 | // this looks like a bad recursive call, but code gen will turn it into |
---|
531 | // a C-style assignment. |
---|
532 | // This happens before function pointer type conversion, so need to do it manually here |
---|
533 | ApplicationExpr * callExpr = new ApplicationExpr( VariableExpr::functionPointer( funcDecl ) ); |
---|
534 | callExpr->get_args().push_back( new VariableExpr( dstParam ) ); |
---|
535 | callExpr->get_args().push_back( new VariableExpr( srcParam ) ); |
---|
536 | funcDecl->statements->push_back( new ExprStmt( noLabels, callExpr ) ); |
---|
537 | } else { |
---|
538 | // default ctor/dtor body is empty - add unused attribute to parameter to silence warnings |
---|
539 | assert( ftype->parameters.size() == 1 ); |
---|
540 | ObjectDecl * dstParam = strict_dynamic_cast< ObjectDecl * >( ftype->parameters.front() ); |
---|
541 | dstParam->attributes.push_back( new Attribute( "unused" ) ); |
---|
542 | } |
---|
543 | } |
---|
544 | |
---|
545 | bool EnumFuncGenerator::shouldAutogen() const { return true; } |
---|
546 | bool EnumFuncGenerator::isConcurrentType() const { return false; } |
---|
547 | // enums do not have field constructors |
---|
548 | void EnumFuncGenerator::genFieldCtors() {} |
---|
549 | |
---|
550 | bool TypeFuncGenerator::shouldAutogen() const { return true; }; |
---|
551 | |
---|
552 | void TypeFuncGenerator::genFuncBody( FunctionDecl * dcl ) { |
---|
553 | FunctionType * ftype = dcl->type; |
---|
554 | assertf( ftype->parameters.size() == 1 || ftype->parameters.size() == 2, "Incorrect number of parameters in autogenerated typedecl function: %zd", ftype->parameters.size() ); |
---|
555 | DeclarationWithType * dst = ftype->parameters.front(); |
---|
556 | DeclarationWithType * src = ftype->parameters.size() == 2 ? ftype->parameters.back() : nullptr; |
---|
557 | // generate appropriate calls to member ctor, assignment |
---|
558 | UntypedExpr * expr = new UntypedExpr( new NameExpr( dcl->name ) ); |
---|
559 | expr->args.push_back( new CastExpr( new VariableExpr( dst ), new ReferenceType( Type::Qualifiers(), typeDecl->base->clone() ) ) ); |
---|
560 | if ( src ) expr->args.push_back( new CastExpr( new VariableExpr( src ), typeDecl->base->clone() ) ); |
---|
561 | dcl->statements->kids.push_back( new ExprStmt( noLabels, expr ) ); |
---|
562 | }; |
---|
563 | |
---|
564 | // xxx - should reach in and determine if base type is concurrent? |
---|
565 | bool TypeFuncGenerator::isConcurrentType() const { return false; }; |
---|
566 | |
---|
567 | // opaque types do not have field constructors |
---|
568 | void TypeFuncGenerator::genFieldCtors() {}; |
---|
569 | |
---|
570 | //============================================================================================= |
---|
571 | // Visitor definitions |
---|
572 | //============================================================================================= |
---|
573 | AutogenerateRoutines::AutogenerateRoutines() { |
---|
574 | // the order here determines the order that these functions are generated. |
---|
575 | // assignment should come last since it uses copy constructor in return. |
---|
576 | data.emplace_back( "?{}", genDefaultType ); |
---|
577 | data.emplace_back( "?{}", genCopyType ); |
---|
578 | data.emplace_back( "^?{}", genDefaultType ); |
---|
579 | data.emplace_back( "?=?", genAssignType ); |
---|
580 | } |
---|
581 | |
---|
582 | void AutogenerateRoutines::previsit( EnumDecl * enumDecl ) { |
---|
583 | // must visit children (enum constants) to add them to the indexer |
---|
584 | if ( enumDecl->has_body() ) { |
---|
585 | EnumInstType enumInst( Type::Qualifiers(), enumDecl->get_name() ); |
---|
586 | enumInst.set_baseEnum( enumDecl ); |
---|
587 | EnumFuncGenerator gen( &enumInst, data, functionNesting, indexer ); |
---|
588 | generateFunctions( gen, declsToAddAfter ); |
---|
589 | } |
---|
590 | } |
---|
591 | |
---|
592 | void AutogenerateRoutines::previsit( StructDecl * structDecl ) { |
---|
593 | visit_children = false; |
---|
594 | if ( structDecl->has_body() ) { |
---|
595 | StructInstType structInst( Type::Qualifiers(), structDecl->name ); |
---|
596 | structInst.set_baseStruct( structDecl ); |
---|
597 | for ( TypeDecl * typeDecl : structDecl->parameters ) { |
---|
598 | structInst.parameters.push_back( new TypeExpr( new TypeInstType( Type::Qualifiers(), typeDecl->name, typeDecl ) ) ); |
---|
599 | } |
---|
600 | StructFuncGenerator gen( structDecl, &structInst, data, functionNesting, indexer ); |
---|
601 | generateFunctions( gen, declsToAddAfter ); |
---|
602 | } // if |
---|
603 | } |
---|
604 | |
---|
605 | void AutogenerateRoutines::previsit( UnionDecl * unionDecl ) { |
---|
606 | visit_children = false; |
---|
607 | if ( unionDecl->has_body() ) { |
---|
608 | UnionInstType unionInst( Type::Qualifiers(), unionDecl->get_name() ); |
---|
609 | unionInst.set_baseUnion( unionDecl ); |
---|
610 | for ( TypeDecl * typeDecl : unionDecl->get_parameters() ) { |
---|
611 | unionInst.get_parameters().push_back( new TypeExpr( new TypeInstType( Type::Qualifiers(), typeDecl->get_name(), typeDecl ) ) ); |
---|
612 | } |
---|
613 | UnionFuncGenerator gen( unionDecl, &unionInst, data, functionNesting, indexer ); |
---|
614 | generateFunctions( gen, declsToAddAfter ); |
---|
615 | } // if |
---|
616 | } |
---|
617 | |
---|
618 | // generate ctor/dtors/assign for typedecls, e.g., otype T = int *; |
---|
619 | void AutogenerateRoutines::previsit( TypeDecl * typeDecl ) { |
---|
620 | if ( ! typeDecl->base ) return; |
---|
621 | |
---|
622 | TypeInstType refType( Type::Qualifiers(), typeDecl->name, typeDecl ); |
---|
623 | TypeFuncGenerator gen( typeDecl, &refType, data, functionNesting, indexer ); |
---|
624 | generateFunctions( gen, declsToAddAfter ); |
---|
625 | |
---|
626 | } |
---|
627 | |
---|
628 | void AutogenerateRoutines::previsit( TraitDecl * ) { |
---|
629 | // ensure that we don't add assignment ops for types defined as part of the trait |
---|
630 | visit_children = false; |
---|
631 | } |
---|
632 | |
---|
633 | void AutogenerateRoutines::previsit( FunctionDecl * ) { |
---|
634 | // Track whether we're currently in a function. |
---|
635 | // Can ignore function type idiosyncrasies, because function type can never |
---|
636 | // declare a new type. |
---|
637 | functionNesting += 1; |
---|
638 | GuardAction( [this]() { functionNesting -= 1; } ); |
---|
639 | } |
---|
640 | |
---|
641 | void AutogenerateRoutines::previsit( CompoundStmt * ) { |
---|
642 | GuardScope( structsDone ); |
---|
643 | } |
---|
644 | |
---|
645 | void makeTupleFunctionBody( FunctionDecl * function ) { |
---|
646 | FunctionType * ftype = function->get_functionType(); |
---|
647 | assertf( ftype->get_parameters().size() == 1 || ftype->get_parameters().size() == 2, "too many parameters in generated tuple function" ); |
---|
648 | |
---|
649 | UntypedExpr * untyped = new UntypedExpr( new NameExpr( function->get_name() ) ); |
---|
650 | |
---|
651 | /// xxx - &* is used to make this easier for later passes to handle |
---|
652 | untyped->get_args().push_back( new AddressExpr( UntypedExpr::createDeref( new VariableExpr( ftype->get_parameters().front() ) ) ) ); |
---|
653 | if ( ftype->get_parameters().size() == 2 ) { |
---|
654 | untyped->get_args().push_back( new VariableExpr( ftype->get_parameters().back() ) ); |
---|
655 | } |
---|
656 | function->get_statements()->get_kids().push_back( new ExprStmt( noLabels, untyped ) ); |
---|
657 | function->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, UntypedExpr::createDeref( new VariableExpr( ftype->get_parameters().front() ) ) ) ); |
---|
658 | } |
---|
659 | |
---|
660 | void AutogenTupleRoutines::postvisit( TupleType * tupleType ) { |
---|
661 | std::string mangleName = SymTab::Mangler::mangleType( tupleType ); |
---|
662 | if ( seenTuples.find( mangleName ) != seenTuples.end() ) return; |
---|
663 | seenTuples.insert( mangleName ); |
---|
664 | |
---|
665 | // T ?=?(T *, T); |
---|
666 | FunctionType *assignType = genAssignType( tupleType ); |
---|
667 | |
---|
668 | // void ?{}(T *); void ^?{}(T *); |
---|
669 | FunctionType *ctorType = genDefaultType( tupleType ); |
---|
670 | FunctionType *dtorType = genDefaultType( tupleType ); |
---|
671 | |
---|
672 | // void ?{}(T *, T); |
---|
673 | FunctionType *copyCtorType = genCopyType( tupleType ); |
---|
674 | |
---|
675 | std::set< TypeDecl* > done; |
---|
676 | std::list< TypeDecl * > typeParams; |
---|
677 | for ( Type * t : *tupleType ) { |
---|
678 | if ( TypeInstType * ty = dynamic_cast< TypeInstType * >( t ) ) { |
---|
679 | if ( ! done.count( ty->get_baseType() ) ) { |
---|
680 | TypeDecl * newDecl = new TypeDecl( ty->get_baseType()->get_name(), Type::StorageClasses(), nullptr, TypeDecl::Dtype, true ); |
---|
681 | TypeInstType * inst = new TypeInstType( Type::Qualifiers(), newDecl->get_name(), newDecl ); |
---|
682 | newDecl->get_assertions().push_back( new FunctionDecl( "?=?", Type::StorageClasses(), LinkageSpec::Cforall, genAssignType( inst ), nullptr, |
---|
683 | std::list< Attribute * >(), Type::FuncSpecifiers( Type::Inline ) ) ); |
---|
684 | newDecl->get_assertions().push_back( new FunctionDecl( "?{}", Type::StorageClasses(), LinkageSpec::Cforall, genDefaultType( inst ), nullptr, |
---|
685 | std::list< Attribute * >(), Type::FuncSpecifiers( Type::Inline ) ) ); |
---|
686 | newDecl->get_assertions().push_back( new FunctionDecl( "?{}", Type::StorageClasses(), LinkageSpec::Cforall, genCopyType( inst ), nullptr, |
---|
687 | std::list< Attribute * >(), Type::FuncSpecifiers( Type::Inline ) ) ); |
---|
688 | newDecl->get_assertions().push_back( new FunctionDecl( "^?{}", Type::StorageClasses(), LinkageSpec::Cforall, genDefaultType( inst ), nullptr, |
---|
689 | std::list< Attribute * >(), Type::FuncSpecifiers( Type::Inline ) ) ); |
---|
690 | typeParams.push_back( newDecl ); |
---|
691 | done.insert( ty->get_baseType() ); |
---|
692 | } |
---|
693 | } |
---|
694 | } |
---|
695 | cloneAll( typeParams, ctorType->get_forall() ); |
---|
696 | cloneAll( typeParams, dtorType->get_forall() ); |
---|
697 | cloneAll( typeParams, copyCtorType->get_forall() ); |
---|
698 | cloneAll( typeParams, assignType->get_forall() ); |
---|
699 | |
---|
700 | FunctionDecl *assignDecl = genFunc( "?=?", assignType, functionNesting ); |
---|
701 | FunctionDecl *ctorDecl = genFunc( "?{}", ctorType, functionNesting ); |
---|
702 | FunctionDecl *copyCtorDecl = genFunc( "?{}", copyCtorType, functionNesting ); |
---|
703 | FunctionDecl *dtorDecl = genFunc( "^?{}", dtorType, functionNesting ); |
---|
704 | |
---|
705 | makeTupleFunctionBody( assignDecl ); |
---|
706 | makeTupleFunctionBody( ctorDecl ); |
---|
707 | makeTupleFunctionBody( copyCtorDecl ); |
---|
708 | makeTupleFunctionBody( dtorDecl ); |
---|
709 | |
---|
710 | declsToAddBefore.push_back( ctorDecl ); |
---|
711 | declsToAddBefore.push_back( copyCtorDecl ); |
---|
712 | declsToAddBefore.push_back( dtorDecl ); |
---|
713 | declsToAddBefore.push_back( assignDecl ); // assignment should come last since it uses copy constructor in return |
---|
714 | } |
---|
715 | |
---|
716 | void AutogenTupleRoutines::previsit( FunctionDecl *functionDecl ) { |
---|
717 | visit_children = false; |
---|
718 | maybeAccept( functionDecl->type, *visitor ); |
---|
719 | functionNesting += 1; |
---|
720 | maybeAccept( functionDecl->statements, *visitor ); |
---|
721 | functionNesting -= 1; |
---|
722 | } |
---|
723 | |
---|
724 | void AutogenTupleRoutines::previsit( CompoundStmt * ) { |
---|
725 | GuardScope( seenTuples ); |
---|
726 | } |
---|
727 | } // SymTab |
---|
728 | |
---|
729 | // Local Variables: // |
---|
730 | // tab-width: 4 // |
---|
731 | // mode: c++ // |
---|
732 | // compile-command: "make install" // |
---|
733 | // End: // |
---|