source: src/ResolvExpr/CurrentObject.cc@ 78754d7

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 78754d7 was 78754d7, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Fix assertion failure in CurrentObject [fixes #77]
  • Property mode set to 100644
File size: 21.2 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// CurrentObject.h --
8//
9// Author : Rob Schluntz
10// Created On : Tue Jun 13 15:28:32 2017
11// Last Modified By : Rob Schluntz
12// Last Modified On : Tue Jun 13 15:28:44 2017
13// Update Count : 2
14//
15
16#include <stddef.h> // for size_t
17#include <cassert> // for assertf, assert, safe_dynamic_...
18#include <iostream> // for ostream, operator<<, basic_ost...
19#include <stack> // for stack
20#include <string> // for string, operator<<, allocator
21
22#include "Common/Indenter.h" // for Indenter, operator<<
23#include "Common/SemanticError.h" // for SemanticError
24#include "Common/utility.h" // for toString
25#include "CurrentObject.h"
26#include "SynTree/Constant.h" // for Constant
27#include "SynTree/Declaration.h" // for ObjectDecl, Declaration, Struc...
28#include "SynTree/Expression.h" // for InitAlternative, VariableExpr
29#include "SynTree/Initializer.h" // for Designation, operator<<
30#include "SynTree/Type.h" // for Type, StructInstType, UnionIns...
31#include "SynTree/TypeSubstitution.h" // for TypeSubstitution
32
33#if 0
34#define PRINT(x) x
35#else
36#define PRINT(x)
37#endif
38
39namespace ResolvExpr {
40 template< typename AggrInst >
41 TypeSubstitution makeGenericSubstitution( AggrInst * inst ) {
42 assert( inst );
43 assert( inst->get_baseParameters() );
44 std::list< TypeDecl * > baseParams = *inst->get_baseParameters();
45 std::list< Expression * > typeSubs = inst->get_parameters();
46 TypeSubstitution subs( baseParams.begin(), baseParams.end(), typeSubs.begin() );
47 return subs;
48 }
49
50 TypeSubstitution makeGenericSubstitution( Type * type ) {
51 if ( StructInstType * inst = dynamic_cast< StructInstType * >( type ) ) {
52 return makeGenericSubstitution( inst );
53 } else if ( UnionInstType * inst = dynamic_cast< UnionInstType * >( type ) ) {
54 return makeGenericSubstitution( inst );
55 } else {
56 return TypeSubstitution();
57 }
58 }
59
60 class MemberIterator {
61 public:
62 virtual ~MemberIterator() {}
63
64 virtual void setPosition( std::list< Expression * > & designators ) = 0;
65 virtual std::list<InitAlternative> operator*() const = 0;
66 virtual operator bool() const = 0;
67 virtual MemberIterator & bigStep() = 0;
68 virtual MemberIterator & smallStep() = 0;
69 virtual Type * getType() = 0;
70 virtual Type * getNext() = 0;
71
72 virtual void print( std::ostream & out, Indenter indent ) const = 0;
73
74 virtual std::list<InitAlternative> first() const = 0; // should be protected
75 };
76
77 std::ostream & operator<<(std::ostream & out, const MemberIterator & it) {
78 Indenter indenter;
79 it.print( out, indenter );
80 return out;
81 }
82
83 /// create a new MemberIterator that traverses a type correctly
84 MemberIterator * createMemberIterator( Type * type );
85
86 /// iterates "other" types, e.g. basic types, pointer types, etc. which do not change at list initializer entry
87 class SimpleIterator : public MemberIterator {
88 public:
89 SimpleIterator( Type * type ) : type( type ) {}
90
91 virtual void setPosition( std::list< Expression * > & designators ) {
92 assertf( designators.empty(), "simple iterator given non-empty designator..." ); // xxx - might be semantic error
93 }
94
95 virtual std::list<InitAlternative> operator*() const { return first(); }
96 virtual operator bool() const { return type; }
97
98 // big step is the same as small step
99 virtual MemberIterator & bigStep() { return smallStep(); }
100 virtual MemberIterator & smallStep() {
101 type = nullptr; // type is nullified on increment since SimpleIterators do not have members
102 return *this;
103 }
104
105 virtual void print( std::ostream & out, __attribute__((unused)) Indenter indent ) const {
106 out << "SimpleIterator(" << type << ")";
107 }
108
109 virtual Type * getType() { return type; }
110 virtual Type * getNext() { return type; }
111
112 protected:
113 virtual std::list<InitAlternative> first() const {
114 if ( type ) return std::list<InitAlternative>{ { type->clone(), new Designation( {} ) } };
115 else return std::list<InitAlternative>{};
116 }
117 private:
118 Type * type = nullptr;
119 };
120
121 class ArrayIterator : public MemberIterator {
122 public:
123 ArrayIterator( ArrayType * at ) : array( at ) {
124 PRINT( std::cerr << "Creating array iterator: " << at << std::endl; )
125 base = at->get_base();
126 memberIter = createMemberIterator( base );
127 if ( at->isVarLen ) throw SemanticError( "VLA initialization does not support @=", at );
128 setSize( at->get_dimension() );
129 }
130
131 ~ArrayIterator() {
132 delete memberIter;
133 }
134
135 private:
136 void setSize( Expression * expr ) {
137 if ( ConstantExpr * constExpr = dynamic_cast< ConstantExpr * >( expr ) ) {
138 try {
139 size = constExpr->intValue();
140 PRINT( std::cerr << "array type with size: " << size << std::endl; )
141 } catch ( SemanticError & ) {
142 throw SemanticError( "Constant expression of non-integral type in array dimension: ", expr );
143 }
144 } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) {
145 setSize( castExpr->get_arg() ); // xxx - need to perform the conversion specified by the cast
146 } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) {
147 if ( EnumInstType * inst = dynamic_cast< EnumInstType * > ( varExpr->result ) ) {
148 long long int value;
149 if ( inst->baseEnum->valueOf( varExpr->var, value ) ) {
150 size = value;
151 }
152 }
153 } else {
154 assertf( false, "unhandled expression in setSize: %s", toString( expr ).c_str() ); // xxx - if not a constant expression, it's not simple to determine how long the array actually is, which is necessary for initialization to be done correctly -- fix this
155 }
156 }
157
158 public:
159 void setPosition( Expression * expr ) {
160 // need to permit integer-constant-expressions, including: integer constants, enumeration constants, character constants, sizeof expressions, _Alignof expressions, cast expressions
161 if ( ConstantExpr * constExpr = dynamic_cast< ConstantExpr * >( expr ) ) {
162 try {
163 index = constExpr->intValue();
164 } catch( SemanticError & ) {
165 throw SemanticError( "Constant expression of non-integral type in array designator: ", expr );
166 }
167 } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) {
168 setPosition( castExpr->get_arg() );
169 } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) {
170 EnumInstType * inst = dynamic_cast<EnumInstType *>( varExpr->get_result() );
171 assertf( inst, "ArrayIterator given variable that isn't an enum constant : %s", toString( expr ).c_str() );
172 long long int value;
173 if ( inst->baseEnum->valueOf( varExpr->var, value ) ) {
174 index = value;
175 }
176 } else if ( dynamic_cast< SizeofExpr * >( expr ) || dynamic_cast< AlignofExpr * >( expr ) ) {
177 index = 0; // xxx - get actual sizeof/alignof value?
178 } else {
179 assertf( false, "bad designator given to ArrayIterator: %s", toString( expr ).c_str() );
180 }
181 }
182
183 virtual void setPosition( std::list< Expression * > & designators ) {
184 if ( ! designators.empty() ) {
185 setPosition( designators.front() );
186 designators.pop_front();
187 memberIter->setPosition( designators );
188 }
189 }
190
191 virtual std::list<InitAlternative> operator*() const {
192 return first();
193 }
194
195 virtual operator bool() const { return index < size; }
196
197 virtual MemberIterator & bigStep() {
198 PRINT( std::cerr << "bigStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
199 ++index;
200 delete memberIter;
201 if ( index < size ) memberIter = createMemberIterator( base );
202 else memberIter = nullptr;
203 return *this;
204 }
205
206 virtual MemberIterator & smallStep() {
207 PRINT( std::cerr << "smallStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
208 if ( memberIter ) {
209 PRINT( std::cerr << "has member iter: " << *memberIter << std::endl; )
210 memberIter->smallStep();
211 if ( *memberIter ) {
212 PRINT( std::cerr << "has valid member iter" << std::endl; )
213 return *this;
214 }
215 }
216 return bigStep();
217 }
218
219 virtual Type * getType() { return array; }
220 virtual Type * getNext() { return base; }
221
222 virtual std::list<InitAlternative> first() const {
223 PRINT( std::cerr << "first in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
224 if ( memberIter && *memberIter ) {
225 std::list<InitAlternative> ret = memberIter->first();
226 for ( InitAlternative & alt : ret ) {
227 alt.designation->get_designators().push_front( new ConstantExpr( Constant::from_ulong( index ) ) );
228 }
229 return ret;
230 }
231 return std::list<InitAlternative>();
232 }
233
234 virtual void print( std::ostream & out, Indenter indent ) const {
235 out << "ArrayIterator(Array of " << base << ")";
236 if ( memberIter ) {
237 Indenter childIndent = indent+1;
238 out << std::endl << childIndent;
239 memberIter->print( out, childIndent );
240 }
241 }
242
243 private:
244 ArrayType * array = nullptr;
245 Type * base = nullptr;
246 size_t index = 0;
247 size_t size = 0;
248 MemberIterator * memberIter = nullptr;
249 };
250
251 class AggregateIterator : public MemberIterator {
252 public:
253 typedef std::list<Declaration *> MemberList;
254 typedef MemberList::const_iterator iterator;
255 std::string kind = ""; // for debug
256 std::string name;
257 Type * inst = nullptr;
258 const MemberList & members;
259 iterator curMember;
260 bool atbegin = true; // false at first {small,big}Step -- this aggr type is only added to the possibilities at the beginning
261 Type * curType = nullptr;
262 MemberIterator * memberIter = nullptr;
263 mutable TypeSubstitution sub;
264
265 AggregateIterator( const std::string & kind, const std::string & name, Type * inst, const MemberList & members ) : kind( kind ), name( name ), inst( inst ), members( members ), curMember( members.begin() ), sub( makeGenericSubstitution( inst ) ) {
266 PRINT( std::cerr << "Creating " << kind << "(" << name << ")"; )
267 init();
268 }
269
270 virtual ~AggregateIterator() {
271 delete memberIter;
272 }
273
274 bool init() {
275 PRINT( std::cerr << "--init()--" << members.size() << std::endl; )
276 if ( curMember != members.end() ) {
277 if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( *curMember ) ) {
278 PRINT( std::cerr << "incremented to field: " << field << std::endl; )
279 curType = field->get_type();
280 memberIter = createMemberIterator( curType );
281 return true;
282 }
283 }
284 return false;
285 }
286
287 virtual std::list<InitAlternative> operator*() const {
288 if (memberIter && *memberIter) {
289 std::list<InitAlternative> ret = memberIter->first();
290 PRINT( std::cerr << "sub: " << sub << std::endl; )
291 for ( InitAlternative & alt : ret ) {
292 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
293 alt.designation->get_designators().push_front( new VariableExpr( strict_dynamic_cast< ObjectDecl * >( *curMember ) ) );
294 // need to substitute for generic types, so that casts are to concrete types
295 PRINT( std::cerr << " type is: " << alt.type; )
296 sub.apply( alt.type ); // also apply to designation??
297 PRINT( std::cerr << " ==> " << alt.type << std::endl; )
298 }
299 return ret;
300 }
301 return std::list<InitAlternative>();
302 }
303
304 virtual void setPosition( std::list< Expression * > & designators ) {
305 if ( ! designators.empty() ) {
306 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( designators.front() ) ) {
307 for ( curMember = members.begin(); curMember != members.end(); ++curMember ) {
308 if ( *curMember == varExpr->get_var() ) {
309 designators.pop_front();
310 delete memberIter;
311 memberIter = createMemberIterator( varExpr->get_result() );
312 curType = varExpr->get_result();
313 atbegin = curMember == members.begin() && designators.empty(); // xxx - is this the right condition for atbegin??
314 memberIter->setPosition( designators );
315 return;
316 } // if
317 } // for
318 assertf( false, "could not find member in %s: %s", kind.c_str(), toString( varExpr ).c_str() );
319 } else {
320 assertf( false, "bad designator given to %s: %s", kind.c_str(), toString( designators.front() ).c_str() );
321 } // if
322 } // if
323 }
324
325 virtual MemberIterator & smallStep() {
326 PRINT( std::cerr << "smallStep in " << kind << std::endl; )
327 atbegin = false;
328 if ( memberIter ) {
329 PRINT( std::cerr << "has member iter, incrementing..." << std::endl; )
330 memberIter->smallStep();
331 if ( *memberIter ) {
332 PRINT( std::cerr << "success!" << std::endl; )
333 return *this;
334 }
335 }
336 return bigStep();
337 }
338
339 virtual Type * getType() { return inst; }
340 virtual Type * getNext() {
341 if ( memberIter && *memberIter ) return memberIter->getType(); // xxx - ??? recursive call???
342 return nullptr;
343 }
344
345 virtual std::list<InitAlternative> first() const {
346 std::list<InitAlternative> ret;
347 PRINT( std::cerr << "first " << kind << std::endl; )
348 if ( memberIter && *memberIter ) { // might not need *memberIter??
349 PRINT( std::cerr << "adding children" << std::endl; )
350 ret = memberIter->first();
351 for ( InitAlternative & alt : ret ) {
352 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
353 alt.designation->get_designators().push_front( new VariableExpr( strict_dynamic_cast< ObjectDecl * >( *curMember ) ) );
354 }
355 }
356 // if ( curMember == std::next( decl->get_members().begin(), 1 ) ) { // xxx - this never triggers because curMember is incremented immediately on construction
357 if ( atbegin ) { // xxx - this never triggers because curMember is incremented immediately on construction
358 // xxx - what about case of empty struct??
359 // only add self if at the very beginning of the structure
360 PRINT( std::cerr << "adding self" << std::endl; )
361 ret.push_front( { inst->clone(), new Designation( {} ) } );
362 }
363 return ret;
364 }
365
366 virtual void print( std::ostream & out, Indenter indent ) const {
367 out << kind << "(" << name << ")";
368 if ( memberIter ) {
369 Indenter childIndent = indent+1;
370 out << std::endl << childIndent;
371 memberIter->print( out, childIndent );
372 }
373 }
374 };
375
376 class UnionIterator : public AggregateIterator {
377 public:
378 UnionIterator( UnionInstType * inst ) : AggregateIterator( "UnionIterator", inst->get_name(), inst, inst->get_baseUnion()->get_members() ) {}
379
380 virtual operator bool() const { return (memberIter && *memberIter); }
381 virtual MemberIterator & bigStep() {
382 // unions only initialize one member
383 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
384 atbegin = false;
385 delete memberIter;
386 memberIter = nullptr;
387 curType = nullptr;
388 curMember = members.end();
389 return *this;
390 }
391 virtual std::list<InitAlternative> first() const { return std::list<InitAlternative>{}; }
392 };
393
394 class StructIterator : public AggregateIterator {
395 public:
396 StructIterator( StructInstType * inst ) : AggregateIterator( "StructIterator", inst->get_name(), inst, inst->get_baseStruct()->get_members() ) {}
397
398 virtual operator bool() const { return curMember != members.end() || (memberIter && *memberIter); }
399
400 virtual MemberIterator & bigStep() {
401 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
402 atbegin = false;
403 delete memberIter;
404 memberIter = nullptr;
405 curType = nullptr;
406 for ( ; curMember != members.end(); ) {
407 ++curMember;
408 if ( init() ) {
409 return *this;
410 }
411 }
412 return *this;
413 }
414 };
415
416 class TupleIterator : public AggregateIterator {
417 public:
418 TupleIterator( TupleType * inst ) : AggregateIterator( "TupleIterator", toString("Tuple", inst->size()), inst, inst->get_members() ) {}
419
420 virtual operator bool() const { return curMember != members.end() || (memberIter && *memberIter); }
421
422 virtual MemberIterator & bigStep() {
423 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
424 atbegin = false;
425 delete memberIter;
426 memberIter = nullptr;
427 curType = nullptr;
428 for ( ; curMember != members.end(); ) {
429 ++curMember;
430 if ( init() ) {
431 return *this;
432 }
433 }
434 return *this;
435 }
436 };
437
438 MemberIterator * createMemberIterator( Type * type ) {
439 if ( ReferenceToType * aggr = dynamic_cast< ReferenceToType * >( type ) ) {
440 if ( StructInstType * sit = dynamic_cast< StructInstType * >( aggr ) ) {
441 return new StructIterator( sit );
442 } else if ( UnionInstType * uit = dynamic_cast< UnionInstType * >( aggr ) ) {
443 return new UnionIterator( uit );
444 } else {
445 assertf( dynamic_cast< EnumInstType * >( type ) || dynamic_cast< TypeInstType * >( type ), "Encountered unhandled ReferenceToType in createMemberIterator: %s", toString( type ).c_str() );
446 return new SimpleIterator( type );
447 }
448 } else if ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) {
449 return new ArrayIterator( at );
450 } else if ( TupleType * tt = dynamic_cast< TupleType * >( type ) ) {
451 return new TupleIterator( tt );
452 } else {
453 return new SimpleIterator( type );
454 }
455 }
456
457 CurrentObject::CurrentObject() {}
458 CurrentObject::CurrentObject( Type * type ) {
459 objStack.push( new SimpleIterator( type ) );
460 }
461
462
463 void CurrentObject::setNext( Designation * designation ) {
464 assertf( ! objStack.empty(), "obj stack empty in setNext" );
465 PRINT( std::cerr << "____setNext" << designation << std::endl; )
466 objStack.top()->setPosition( designation->get_designators() );
467 }
468
469 Designation * CurrentObject::findNext( Designation * designation ) {
470 typedef std::list< Expression * > DesignatorChain;
471 PRINT( std::cerr << "___findNext" << std::endl; )
472 // find all the d's
473 std::list<DesignatorChain> desigAlts{ { } }, newDesigAlts;
474 std::list<Type *> curTypes { (objStack.top())->getType() }, newTypes;
475 for ( Expression * expr : designation->get_designators() ) {
476 PRINT( std::cerr << "____untyped: " << expr << std::endl; )
477 std::list<DesignatorChain>::iterator dit = desigAlts.begin();
478 if ( NameExpr * nexpr = dynamic_cast<NameExpr *>(expr) ) {
479 for ( Type * t : curTypes ) {
480 assert( dit != desigAlts.end() );
481 DesignatorChain & d = *dit;
482 PRINT( std::cerr << "____actual: " << t << std::endl; )
483 ReferenceToType * refType = dynamic_cast<ReferenceToType *>(t);
484 std::list<Declaration *> members;
485 if ( refType ) {
486 refType->lookup( nexpr->get_name(), members ); // concatenate identical field name
487 // xxx - need to also include anonymous members in this somehow...
488 for ( Declaration * mem: members ) {
489 if ( ObjectDecl * field = dynamic_cast<ObjectDecl *>(mem) ) {
490 PRINT( std::cerr << "____alt: " << field->get_type() << std::endl; )
491 DesignatorChain newD = d;
492 newD.push_back( new VariableExpr( field ) );
493 newDesigAlts.push_back( newD );
494 newTypes.push_back( field->get_type() );
495 } // if
496 } // for
497 } // if
498 ++dit;
499 } // for
500 } else {
501 for ( Type * t : curTypes ) {
502 assert( dit != desigAlts.end() );
503 DesignatorChain & d = *dit;
504 if ( ArrayType * at = dynamic_cast< ArrayType * > ( t ) ) {
505 PRINT( std::cerr << "____alt: " << at->get_base() << std::endl; )
506 d.push_back( expr );
507 newDesigAlts.push_back( d );
508 newTypes.push_back( at->get_base() );
509 }
510 ++dit;
511 } // for
512 } // if
513 desigAlts = newDesigAlts;
514 newDesigAlts.clear();
515 curTypes = newTypes;
516 newTypes.clear();
517 assertf( desigAlts.size() == curTypes.size(), "Designator alternatives (%zu) and current types (%zu) out of sync", desigAlts.size(), curTypes.size() );
518 } // for
519 if ( desigAlts.size() > 1 ) {
520 throw SemanticError( toString("Too many alternatives (", desigAlts.size(), ") for designation: "), designation );
521 } else if ( desigAlts.size() == 0 ) {
522 throw SemanticError( "No reasonable alternatives for designation: ", designation );
523 }
524 DesignatorChain & d = desigAlts.back();
525 PRINT( for ( Expression * expr : d ) {
526 std::cerr << "____desig: " << expr << std::endl;
527 } ) // for
528 assertf( ! curTypes.empty(), "empty designator chosen");
529
530 // set new designators
531 assertf( ! objStack.empty(), "empty object stack when setting designation" );
532 Designation * actualDesignation = new Designation( d );
533 objStack.top()->setPosition( d ); // destroys d
534 return actualDesignation;
535 }
536
537 void CurrentObject::increment() {
538 PRINT( std::cerr << "____increment" << std::endl; )
539 if ( ! objStack.empty() ) {
540 PRINT( std::cerr << *objStack.top() << std::endl; )
541 objStack.top()->smallStep();
542 }
543 }
544
545 void CurrentObject::enterListInit() {
546 PRINT( std::cerr << "____entering list init" << std::endl; )
547 assertf( ! objStack.empty(), "empty obj stack entering list init" );
548 Type * type = objStack.top()->getNext();
549 if ( type ) {
550 objStack.push( createMemberIterator( type ) );
551 } else {
552 assertf( false, "not sure about this case..." );
553 }
554 }
555
556 void CurrentObject::exitListInit() {
557 PRINT( std::cerr << "____exiting list init" << std::endl; )
558 assertf( ! objStack.empty(), "objstack empty" );
559 delete objStack.top();
560 objStack.pop();
561 if ( ! objStack.empty() ) {
562 PRINT( std::cerr << *objStack.top() << std::endl; )
563 objStack.top()->bigStep();
564 }
565 }
566
567 std::list< InitAlternative > CurrentObject::getOptions() {
568 PRINT( std::cerr << "____getting current options" << std::endl; )
569 assertf( ! objStack.empty(), "objstack empty in getOptions" );
570 return **objStack.top();
571 }
572
573 Type * CurrentObject::getCurrentType() {
574 PRINT( std::cerr << "____getting current type" << std::endl; )
575 assertf( ! objStack.empty(), "objstack empty in getCurrentType" );
576 return objStack.top()->getNext();
577 }
578} // namespace ResolvExpr
579
580// Local Variables: //
581// tab-width: 4 //
582// mode: c++ //
583// compile-command: "make install" //
584// End: //
Note: See TracBrowser for help on using the repository browser.