source: src/InitTweak/InitTweak.cc@ 101e0bd

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

automatically hide generated assignment functions following the same rules as ctor/dtors
  • Property mode set to 100644
File size: 17.8 KB
RevLine 
[4d2434a]1#include <algorithm>
[2b46a13]2#include "InitTweak.h"
3#include "SynTree/Visitor.h"
4#include "SynTree/Statement.h"
5#include "SynTree/Initializer.h"
6#include "SynTree/Expression.h"
[f9cebb5]7#include "SynTree/Attribute.h"
[2b46a13]8#include "GenPoly/GenPoly.h"
[4d4882a]9#include "ResolvExpr/typeops.h"
[2b46a13]10
11namespace InitTweak {
[64071c2]12 namespace {
13 class HasDesignations : public Visitor {
14 public:
15 bool hasDesignations = false;
16 template<typename Init>
17 void handleInit( Init * init ) {
18 if ( ! init->get_designators().empty() ) hasDesignations = true;
19 else Visitor::visit( init );
20 }
21 virtual void visit( SingleInit * singleInit ) { handleInit( singleInit); }
22 virtual void visit( ListInit * listInit ) { handleInit( listInit); }
23 };
[2b46a13]24
[dcd73d1]25 class InitDepthChecker : public Visitor {
26 public:
27 bool depthOkay = true;
28 Type * type;
29 int curDepth = 0, maxDepth = 0;
30 InitDepthChecker( Type * type ) : type( type ) {
31 Type * t = type;
32 while ( ArrayType * at = dynamic_cast< ArrayType * >( t ) ) {
33 maxDepth++;
34 t = at->get_base();
35 }
36 maxDepth++;
37 }
38 virtual void visit( ListInit * listInit ) {
39 curDepth++;
40 if ( curDepth > maxDepth ) depthOkay = false;
41 Visitor::visit( listInit );
42 curDepth--;
43 }
44 };
45
[4d2434a]46 class InitFlattener : public Visitor {
[64071c2]47 public:
48 virtual void visit( SingleInit * singleInit );
49 virtual void visit( ListInit * listInit );
50 std::list< Expression * > argList;
51 };
[2b46a13]52
[4d2434a]53 void InitFlattener::visit( SingleInit * singleInit ) {
[64071c2]54 argList.push_back( singleInit->get_value()->clone() );
55 }
[2b46a13]56
[4d2434a]57 void InitFlattener::visit( ListInit * listInit ) {
58 // flatten nested list inits
59 std::list<Initializer*>::iterator it = listInit->begin();
60 for ( ; it != listInit->end(); ++it ) {
[64071c2]61 (*it)->accept( *this );
62 }
63 }
64 }
[2b46a13]65
[64071c2]66 std::list< Expression * > makeInitList( Initializer * init ) {
[4d2434a]67 InitFlattener flattener;
68 maybeAccept( init, flattener );
69 return flattener.argList;
[64071c2]70 }
[2b46a13]71
[64071c2]72 bool isDesignated( Initializer * init ) {
73 HasDesignations finder;
74 maybeAccept( init, finder );
75 return finder.hasDesignations;
[dcd73d1]76 }
77
78 bool checkInitDepth( ObjectDecl * objDecl ) {
79 InitDepthChecker checker( objDecl->get_type() );
80 maybeAccept( objDecl->get_init(), checker );
81 return checker.depthOkay;
[64071c2]82 }
[2b46a13]83
[39f84a4]84 class InitExpander::ExpanderImpl {
85 public:
86 virtual std::list< Expression * > next( std::list< Expression * > & indices ) = 0;
[4d2434a]87 virtual Statement * buildListInit( UntypedExpr * callExpr, std::list< Expression * > & indices ) = 0;
[39f84a4]88 };
89
90 class InitImpl : public InitExpander::ExpanderImpl {
91 public:
[4d2434a]92 InitImpl( Initializer * init ) : init( init ) {}
[39f84a4]93
94 virtual std::list< Expression * > next( std::list< Expression * > & indices ) {
95 // this is wrong, but just a placeholder for now
[4d2434a]96 // if ( ! flattened ) flatten( indices );
97 // return ! inits.empty() ? makeInitList( inits.front() ) : std::list< Expression * >();
98 return makeInitList( init );
[39f84a4]99 }
[4d2434a]100
101 virtual Statement * buildListInit( UntypedExpr * callExpr, std::list< Expression * > & indices );
[39f84a4]102 private:
[4d2434a]103 Initializer * init;
[39f84a4]104 };
105
106 class ExprImpl : public InitExpander::ExpanderImpl {
107 public:
108 ExprImpl( Expression * expr ) : arg( expr ) {}
109
[9b4c936]110 ~ExprImpl() { delete arg; }
111
[39f84a4]112 virtual std::list< Expression * > next( std::list< Expression * > & indices ) {
113 std::list< Expression * > ret;
114 Expression * expr = maybeClone( arg );
115 if ( expr ) {
116 for ( std::list< Expression * >::reverse_iterator it = indices.rbegin(); it != indices.rend(); ++it ) {
117 // go through indices and layer on subscript exprs ?[?]
118 ++it;
119 UntypedExpr * subscriptExpr = new UntypedExpr( new NameExpr( "?[?]") );
120 subscriptExpr->get_args().push_back( expr );
121 subscriptExpr->get_args().push_back( (*it)->clone() );
122 expr = subscriptExpr;
123 }
124 ret.push_back( expr );
125 }
126 return ret;
127 }
[4d2434a]128
129 virtual Statement * buildListInit( UntypedExpr * callExpr, std::list< Expression * > & indices );
[39f84a4]130 private:
131 Expression * arg;
132 };
133
134 InitExpander::InitExpander( Initializer * init ) : expander( new InitImpl( init ) ) {}
135
136 InitExpander::InitExpander( Expression * expr ) : expander( new ExprImpl( expr ) ) {}
137
138 std::list< Expression * > InitExpander::operator*() {
139 return cur;
140 }
141
142 InitExpander & InitExpander::operator++() {
143 cur = expander->next( indices );
144 return *this;
145 }
146
147 // use array indices list to build switch statement
148 void InitExpander::addArrayIndex( Expression * index, Expression * dimension ) {
149 indices.push_back( index );
150 indices.push_back( dimension );
151 }
152
[4d2434a]153 void InitExpander::clearArrayIndices() {
[9b4c936]154 deleteAll( indices );
[4d2434a]155 indices.clear();
156 }
157
158 namespace {
[f9cebb5]159 /// given index i, dimension d, initializer init, and callExpr f, generates
160 /// if (i < d) f(..., init)
161 /// ++i;
162 /// so that only elements within the range of the array are constructed
[4d2434a]163 template< typename OutIterator >
[f9cebb5]164 void buildCallExpr( UntypedExpr * callExpr, Expression * index, Expression * dimension, Initializer * init, OutIterator out ) {
[4d2434a]165 UntypedExpr * cond = new UntypedExpr( new NameExpr( "?<?") );
166 cond->get_args().push_back( index->clone() );
167 cond->get_args().push_back( dimension->clone() );
168
169 std::list< Expression * > args = makeInitList( init );
170 callExpr->get_args().splice( callExpr->get_args().end(), args );
171
172 *out++ = new IfStmt( noLabels, cond, new ExprStmt( noLabels, callExpr ), NULL );
173
174 UntypedExpr * increment = new UntypedExpr( new NameExpr( "++?" ) );
175 increment->get_args().push_back( new AddressExpr( index->clone() ) );
176 *out++ = new ExprStmt( noLabels, increment );
177 }
178
179 template< typename OutIterator >
180 void build( UntypedExpr * callExpr, InitExpander::IndexList::iterator idx, InitExpander::IndexList::iterator idxEnd, Initializer * init, OutIterator out ) {
181 if ( idx == idxEnd ) return;
182 Expression * index = *idx++;
183 assert( idx != idxEnd );
184 Expression * dimension = *idx++;
185
[f9cebb5]186 // xxx - may want to eventually issue a warning here if we can detect
187 // that the number of elements exceeds to dimension of the array
[4d2434a]188 if ( idx == idxEnd ) {
189 if ( ListInit * listInit = dynamic_cast< ListInit * >( init ) ) {
190 for ( Initializer * init : *listInit ) {
[f9cebb5]191 buildCallExpr( callExpr->clone(), index, dimension, init, out );
[4d2434a]192 }
193 } else {
[f9cebb5]194 buildCallExpr( callExpr->clone(), index, dimension, init, out );
[4d2434a]195 }
196 } else {
197 std::list< Statement * > branches;
198
199 unsigned long cond = 0;
200 ListInit * listInit = dynamic_cast< ListInit * >( init );
201 if ( ! listInit ) {
202 // xxx - this shouldn't be an error, but need a way to
203 // terminate without creating output, so should catch this error
204 throw SemanticError( "unbalanced list initializers" );
205 }
[f9cebb5]206
207 static UniqueName targetLabel( "L__autogen__" );
208 Label switchLabel( targetLabel.newName(), 0, std::list< Attribute * >{ new Attribute("unused") } );
[4d2434a]209 for ( Initializer * init : *listInit ) {
210 Expression * condition;
211 // check for designations
212 // if ( init-> ) {
213 condition = new ConstantExpr( Constant::from_ulong( cond ) );
214 ++cond;
215 // } else {
216 // condition = // ... take designation
217 // cond = // ... take designation+1
218 // }
219 std::list< Statement * > stmts;
220 build( callExpr, idx, idxEnd, init, back_inserter( stmts ) );
[f9cebb5]221 stmts.push_back( new BranchStmt( noLabels, switchLabel, BranchStmt::Break ) );
[4d2434a]222 CaseStmt * caseStmt = new CaseStmt( noLabels, condition, stmts );
223 branches.push_back( caseStmt );
224 }
225 *out++ = new SwitchStmt( noLabels, index->clone(), branches );
[f9cebb5]226 *out++ = new NullStmt( std::list<Label>{ switchLabel } );
[4d2434a]227 }
228 }
229 }
230
231 // if array came with an initializer list: initialize each element
232 // may have more initializers than elements in the array - need to check at each index that
233 // we haven't exceeded size.
234 // may have fewer initializers than elements in the array - need to default construct
235 // remaining elements.
236 // To accomplish this, generate switch statement, consuming all of expander's elements
237 Statement * InitImpl::buildListInit( UntypedExpr * dst, std::list< Expression * > & indices ) {
238 if ( ! init ) return NULL;
[f9cebb5]239 CompoundStmt * block = new CompoundStmt( noLabels );
240 build( dst, indices.begin(), indices.end(), init, back_inserter( block->get_kids() ) );
241 if ( block->get_kids().empty() ) {
242 delete block;
[4d2434a]243 return NULL;
244 } else {
245 init = NULL; // init was consumed in creating the list init
[f9cebb5]246 return block;
[4d2434a]247 }
[39f84a4]248 }
249
[4d2434a]250 Statement * ExprImpl::buildListInit( UntypedExpr * dst, std::list< Expression * > & indices ) {
251 return NULL;
252 }
253
254 Statement * InitExpander::buildListInit( UntypedExpr * dst ) {
255 return expander->buildListInit( dst, indices );
256 }
257
[64071c2]258 bool tryConstruct( ObjectDecl * objDecl ) {
259 return ! LinkageSpec::isBuiltin( objDecl->get_linkage() ) &&
260 (objDecl->get_init() == NULL ||
[1ba88a0]261 ( objDecl->get_init() != NULL && objDecl->get_init()->get_maybeConstructed() ))
[6cf27a07]262 && objDecl->get_storageClass() != DeclarationNode::Extern;
[64071c2]263 }
[2b46a13]264
[4d2434a]265 class CallFinder : public Visitor {
266 public:
267 typedef Visitor Parent;
268 CallFinder( const std::list< std::string > & names ) : names( names ) {}
269
270 virtual void visit( ApplicationExpr * appExpr ) {
271 handleCallExpr( appExpr );
272 }
273
274 virtual void visit( UntypedExpr * untypedExpr ) {
275 handleCallExpr( untypedExpr );
276 }
277
278 std::list< Expression * > * matches;
279 private:
280 const std::list< std::string > names;
281
282 template< typename CallExpr >
283 void handleCallExpr( CallExpr * expr ) {
284 Parent::visit( expr );
285 std::string fname = getFunctionName( expr );
286 if ( std::find( names.begin(), names.end(), fname ) != names.end() ) {
287 matches->push_back( expr );
[cad355a]288 }
[64071c2]289 }
[4d2434a]290 };
291
292 void collectCtorDtorCalls( Statement * stmt, std::list< Expression * > & matches ) {
293 static CallFinder finder( std::list< std::string >{ "?{}", "^?{}" } );
294 finder.matches = &matches;
295 maybeAccept( stmt, finder );
[64071c2]296 }
[4d2434a]297
298 Expression * getCtorDtorCall( Statement * stmt ) {
299 std::list< Expression * > matches;
300 collectCtorDtorCalls( stmt, matches );
301 assert( matches.size() <= 1 );
302 return matches.size() == 1 ? matches.front() : NULL;
303 }
304
[aedfd91]305 namespace {
[ee1635c8]306 DeclarationWithType * getCalledFunction( Expression * expr ) {
307 assert( expr );
308 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) {
309 return varExpr->get_var();
310 } else if ( MemberExpr * memberExpr = dynamic_cast< MemberExpr * >( expr ) ) {
311 return memberExpr->get_member();
312 } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) {
313 return getCalledFunction( castExpr->get_arg() );
314 }
315 return nullptr;
[aedfd91]316 }
317 }
[70f89d00]318
[aedfd91]319 ApplicationExpr * isIntrinsicCallExpr( Expression * expr ) {
320 ApplicationExpr * appExpr = dynamic_cast< ApplicationExpr * >( expr );
321 if ( ! appExpr ) return NULL;
[ee1635c8]322 DeclarationWithType * function = getCalledFunction( appExpr->get_function() );
[64071c2]323 assert( function );
324 // check for Intrinsic only - don't want to remove all overridable ctor/dtors because autogenerated ctor/dtor
325 // will call all member dtors, and some members may have a user defined dtor.
[ee1635c8]326 return function->get_linkage() == LinkageSpec::Intrinsic ? appExpr : NULL;
[aedfd91]327 }
328
[a465caff]329 namespace {
330 template <typename Predicate>
331 bool allofCtorDtor( Statement * stmt, const Predicate & pred ) {
332 std::list< Expression * > callExprs;
333 collectCtorDtorCalls( stmt, callExprs );
334 // if ( callExprs.empty() ) return false; // xxx - do I still need this check?
335 return std::all_of( callExprs.begin(), callExprs.end(), pred);
336 }
337 }
338
[f9cebb5]339 bool isIntrinsicSingleArgCallStmt( Statement * stmt ) {
[a465caff]340 return allofCtorDtor( stmt, []( Expression * callExpr ){
[4d2434a]341 if ( ApplicationExpr * appExpr = isIntrinsicCallExpr( callExpr ) ) {
342 assert( ! appExpr->get_function()->get_results().empty() );
343 FunctionType *funcType = GenPoly::getFunctionType( appExpr->get_function()->get_results().front() );
344 assert( funcType );
345 return funcType->get_parameters().size() == 1;
346 }
347 return false;
348 });
[64071c2]349 }
[f1b1e4c]350
[a465caff]351 bool isIntrinsicCallStmt( Statement * stmt ) {
352 return allofCtorDtor( stmt, []( Expression * callExpr ) {
353 return isIntrinsicCallExpr( callExpr );
354 });
355 }
356
[64071c2]357 namespace {
358 template<typename CallExpr>
359 Expression *& callArg( CallExpr * callExpr, unsigned int pos ) {
360 if ( pos >= callExpr->get_args().size() ) assert( false && "asking for argument that doesn't exist. Return NULL/throw exception?" );
361 for ( Expression *& arg : callExpr->get_args() ) {
362 if ( pos == 0 ) return arg;
363 pos--;
364 }
365 assert( false );
366 }
367 }
[f1b1e4c]368
[64071c2]369 Expression *& getCallArg( Expression * callExpr, unsigned int pos ) {
370 if ( ApplicationExpr * appExpr = dynamic_cast< ApplicationExpr * >( callExpr ) ) {
371 return callArg( appExpr, pos );
372 } else if ( UntypedExpr * untypedExpr = dynamic_cast< UntypedExpr * >( callExpr ) ) {
373 return callArg( untypedExpr, pos );
374 } else {
375 assert( false && "Unexpected expression type passed to getCallArg" );
376 }
377 }
[f1b1e4c]378
[64071c2]379 namespace {
[c738ca4]380 std::string funcName( Expression * func ) {
[64071c2]381 if ( NameExpr * nameExpr = dynamic_cast< NameExpr * >( func ) ) {
382 return nameExpr->get_name();
383 } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( func ) ) {
384 return varExpr->get_var()->get_name();
[c738ca4]385 } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( func ) ) {
386 return funcName( castExpr->get_arg() );
[ee1635c8]387 } else if ( MemberExpr * memberExpr = dynamic_cast< MemberExpr * >( func ) ) {
388 return memberExpr->get_member()->get_name();
[64071c2]389 } else {
390 assert( false && "Unexpected expression type being called as a function in call expression" );
391 }
392 }
393 }
[70f89d00]394
[64071c2]395 std::string getFunctionName( Expression * expr ) {
396 if ( ApplicationExpr * appExpr = dynamic_cast< ApplicationExpr * >( expr ) ) {
[c738ca4]397 return funcName( appExpr->get_function() );
[64071c2]398 } else if ( UntypedExpr * untypedExpr = dynamic_cast< UntypedExpr * > ( expr ) ) {
[c738ca4]399 return funcName( untypedExpr->get_function() );
[64071c2]400 } else {
[c738ca4]401 std::cerr << expr << std::endl;
[64071c2]402 assert( false && "Unexpected expression type passed to getFunctionName" );
403 }
404 }
[10a7775]405
[64071c2]406 Type * getPointerBase( Type * type ) {
407 if ( PointerType * ptrType = dynamic_cast< PointerType * >( type ) ) {
408 return ptrType->get_base();
409 } else if ( ArrayType * arrayType = dynamic_cast< ArrayType * >( type ) ) {
410 return arrayType->get_base();
411 } else {
412 return NULL;
413 }
414 }
[10a7775]415
[64071c2]416 Type * isPointerType( Type * type ) {
417 if ( getPointerBase( type ) ) return type;
418 else return NULL;
419 }
[40e636a]420
421 class ConstExprChecker : public Visitor {
422 public:
423 ConstExprChecker() : isConstExpr( true ) {}
424
425 virtual void visit( ApplicationExpr *applicationExpr ) { isConstExpr = false; }
426 virtual void visit( UntypedExpr *untypedExpr ) { isConstExpr = false; }
[1ba88a0]427 virtual void visit( NameExpr *nameExpr ) {
428 // xxx - temporary hack, because 0 and 1 really should be constexprs, even though they technically aren't in Cforall today
429 if ( nameExpr->get_name() != "0" && nameExpr->get_name() != "1" ) isConstExpr = false;
430 }
431 // virtual void visit( CastExpr *castExpr ) { isConstExpr = false; }
432 virtual void visit( AddressExpr *addressExpr ) {
433 // address of a variable or member expression is constexpr
434 Expression * arg = addressExpr->get_arg();
435 if ( ! dynamic_cast< NameExpr * >( arg) && ! dynamic_cast< VariableExpr * >( arg ) && ! dynamic_cast< MemberExpr * >( arg ) && ! dynamic_cast< UntypedMemberExpr * >( arg ) ) isConstExpr = false;
436 }
[40e636a]437 virtual void visit( LabelAddressExpr *labAddressExpr ) { isConstExpr = false; }
438 virtual void visit( UntypedMemberExpr *memberExpr ) { isConstExpr = false; }
439 virtual void visit( MemberExpr *memberExpr ) { isConstExpr = false; }
440 virtual void visit( VariableExpr *variableExpr ) { isConstExpr = false; }
441 // these might be okay?
442 // virtual void visit( SizeofExpr *sizeofExpr );
443 // virtual void visit( AlignofExpr *alignofExpr );
444 // virtual void visit( UntypedOffsetofExpr *offsetofExpr );
445 // virtual void visit( OffsetofExpr *offsetofExpr );
446 // virtual void visit( OffsetPackExpr *offsetPackExpr );
447 // virtual void visit( AttrExpr *attrExpr );
448 // virtual void visit( CommaExpr *commaExpr );
449 // virtual void visit( LogicalExpr *logicalExpr );
450 // virtual void visit( ConditionalExpr *conditionalExpr );
451 virtual void visit( TupleExpr *tupleExpr ) { isConstExpr = false; }
452 virtual void visit( SolvedTupleExpr *tupleExpr ) { isConstExpr = false; }
453 virtual void visit( TypeExpr *typeExpr ) { isConstExpr = false; }
454 virtual void visit( AsmExpr *asmExpr ) { isConstExpr = false; }
455 virtual void visit( UntypedValofExpr *valofExpr ) { isConstExpr = false; }
456 virtual void visit( CompoundLiteralExpr *compLitExpr ) { isConstExpr = false; }
457
458 bool isConstExpr;
459 };
460
461 bool isConstExpr( Expression * expr ) {
462 if ( expr ) {
463 ConstExprChecker checker;
464 expr->accept( checker );
465 return checker.isConstExpr;
466 }
467 return true;
468 }
469
470 bool isConstExpr( Initializer * init ) {
471 if ( init ) {
472 ConstExprChecker checker;
473 init->accept( checker );
474 return checker.isConstExpr;
475 } // if
476 // for all intents and purposes, no initializer means const expr
477 return true;
478 }
479
[79970ed]480 bool isConstructor( const std::string & str ) { return str == "?{}"; }
481 bool isDestructor( const std::string & str ) { return str == "^?{}"; }
[ee1635c8]482 bool isAssignment( const std::string & str ) { return str == "?=?"; }
[79970ed]483 bool isCtorDtor( const std::string & str ) { return isConstructor( str ) || isDestructor( str ); }
[ee1635c8]484 bool isCtorDtorAssign( const std::string & str ) { return isCtorDtor( str ) || isAssignment( str ); }
[4d4882a]485
[ee1635c8]486 FunctionDecl * isCopyFunction( Declaration * decl, const std::string & fname ) {
[4d4882a]487 FunctionDecl * function = dynamic_cast< FunctionDecl * >( decl );
488 if ( ! function ) return 0;
[ee1635c8]489 if ( function->get_name() != fname ) return 0;
[4d4882a]490 FunctionType * ftype = function->get_functionType();
491 if ( ftype->get_parameters().size() != 2 ) return 0;
492
493 Type * t1 = ftype->get_parameters().front()->get_type();
494 Type * t2 = ftype->get_parameters().back()->get_type();
495 PointerType * ptrType = dynamic_cast< PointerType * > ( t1 );
496 assert( ptrType );
497
[ee1635c8]498 if ( ResolvExpr::typesCompatibleIgnoreQualifiers( ptrType->get_base(), t2, SymTab::Indexer() ) ) {
[4d4882a]499 return function;
500 } else {
[ee1635c8]501 return nullptr;
[4d4882a]502 }
503 }
[ee1635c8]504
505 FunctionDecl * isCopyConstructor( Declaration * decl ) {
506 return isCopyFunction( decl, "?{}" );
507 }
[2b46a13]508}
Note: See TracBrowser for help on using the repository browser.