source: src/ResolvExpr/CurrentObject.cc@ 2f6a9391

ADT ast-experimental
Last change on this file since 2f6a9391 was 8f06277, checked in by Andrew Beach <ajbeach@…>, 3 years ago

Some clean-up in Common/utility.h. Deleted some unused declarations and moved others to one of two new headers.
  • Property mode set to 100644
File size: 37.1 KB
RevLine 
[e4d829b]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
[f37d9e7]11// Last Modified By : Peter A. Buhr
12// Last Modified On : Fri Jul 1 09:16:01 2022
13// Update Count : 15
[e4d829b]14//
15
[ea6332d]16#include <stddef.h> // for size_t
17#include <cassert> // for assertf, assert, safe_dynamic_...
[60aaa51d]18#include <deque>
[ea6332d]19#include <iostream> // for ostream, operator<<, basic_ost...
20#include <stack> // for stack
21#include <string> // for string, operator<<, allocator
[e4d829b]22
[8e1467d]23#include "AST/Copy.hpp" // for shallowCopy
[2b59f55]24#include "AST/Expr.hpp" // for InitAlternative
[60aaa51d]25#include "AST/GenericSubstitution.hpp" // for genericSubstitution
[2b59f55]26#include "AST/Init.hpp" // for Designation
27#include "AST/Node.hpp" // for readonly
[8f06277]28#include "AST/Print.hpp" // for readonly
[60aaa51d]29#include "AST/Type.hpp"
[8f06277]30#include "Common/Eval.h" // for eval
[ea6332d]31#include "Common/Indenter.h" // for Indenter, operator<<
32#include "Common/SemanticError.h" // for SemanticError
33#include "Common/utility.h" // for toString
[e4d829b]34#include "CurrentObject.h"
[ea6332d]35#include "SynTree/Constant.h" // for Constant
36#include "SynTree/Declaration.h" // for ObjectDecl, Declaration, Struc...
37#include "SynTree/Expression.h" // for InitAlternative, VariableExpr
38#include "SynTree/Initializer.h" // for Designation, operator<<
39#include "SynTree/Type.h" // for Type, StructInstType, UnionIns...
40#include "SynTree/TypeSubstitution.h" // for TypeSubstitution
[e4d829b]41
42#if 0
43#define PRINT(x) x
44#else
45#define PRINT(x)
46#endif
47
48namespace ResolvExpr {
[62423350]49 template< typename AggrInst >
50 TypeSubstitution makeGenericSubstitution( AggrInst * inst ) {
51 assert( inst );
52 assert( inst->get_baseParameters() );
53 std::list< TypeDecl * > baseParams = *inst->get_baseParameters();
54 std::list< Expression * > typeSubs = inst->get_parameters();
55 TypeSubstitution subs( baseParams.begin(), baseParams.end(), typeSubs.begin() );
56 return subs;
57 }
58
59 TypeSubstitution makeGenericSubstitution( Type * type ) {
60 if ( StructInstType * inst = dynamic_cast< StructInstType * >( type ) ) {
61 return makeGenericSubstitution( inst );
62 } else if ( UnionInstType * inst = dynamic_cast< UnionInstType * >( type ) ) {
63 return makeGenericSubstitution( inst );
64 } else {
65 return TypeSubstitution();
66 }
67 }
68
[e4d829b]69 class MemberIterator {
70 public:
71 virtual ~MemberIterator() {}
72
[84e8423]73 /// walks the current object using the given designators as a guide
[e4d829b]74 virtual void setPosition( std::list< Expression * > & designators ) = 0;
[84e8423]75
[1df492a]76 /// retrieve the list of possible Type/Designation pairs for the current position in the currect object
[e4d829b]77 virtual std::list<InitAlternative> operator*() const = 0;
[84e8423]78
79 /// true if the iterator is not currently at the end
[e4d829b]80 virtual operator bool() const = 0;
[84e8423]81
82 /// moves the iterator by one member in the current object
[e4d829b]83 virtual MemberIterator & bigStep() = 0;
[84e8423]84
85 /// moves the iterator by one member in the current subobject
[e4d829b]86 virtual MemberIterator & smallStep() = 0;
[84e8423]87
88 /// the type of the current object
[e4d829b]89 virtual Type * getType() = 0;
[84e8423]90
91 /// the type of the current subobject
[e4d829b]92 virtual Type * getNext() = 0;
93
[84e8423]94 /// printing for debug
[e4d829b]95 virtual void print( std::ostream & out, Indenter indent ) const = 0;
96
[84e8423]97 /// helper for operator*; aggregates must add designator to each init alternative, but
98 /// adding designators in operator* creates duplicates.
[e4d829b]99 virtual std::list<InitAlternative> first() const = 0; // should be protected
100 };
101
102 std::ostream & operator<<(std::ostream & out, const MemberIterator & it) {
103 Indenter indenter;
104 it.print( out, indenter );
105 return out;
106 }
107
108 /// create a new MemberIterator that traverses a type correctly
109 MemberIterator * createMemberIterator( Type * type );
110
111 /// iterates "other" types, e.g. basic types, pointer types, etc. which do not change at list initializer entry
112 class SimpleIterator : public MemberIterator {
113 public:
114 SimpleIterator( Type * type ) : type( type ) {}
115
116 virtual void setPosition( std::list< Expression * > & designators ) {
117 assertf( designators.empty(), "simple iterator given non-empty designator..." ); // xxx - might be semantic error
118 }
119
120 virtual std::list<InitAlternative> operator*() const { return first(); }
121 virtual operator bool() const { return type; }
122
123 // big step is the same as small step
124 virtual MemberIterator & bigStep() { return smallStep(); }
125 virtual MemberIterator & smallStep() {
126 type = nullptr; // type is nullified on increment since SimpleIterators do not have members
127 return *this;
128 }
129
[9ff56e7]130 virtual void print( std::ostream & out, __attribute__((unused)) Indenter indent ) const {
[e4d829b]131 out << "SimpleIterator(" << type << ")";
132 }
133
134 virtual Type * getType() { return type; }
135 virtual Type * getNext() { return type; }
136
137 protected:
138 virtual std::list<InitAlternative> first() const {
139 if ( type ) return std::list<InitAlternative>{ { type->clone(), new Designation( {} ) } };
140 else return std::list<InitAlternative>{};
141 }
142 private:
143 Type * type = nullptr;
144 };
145
146 class ArrayIterator : public MemberIterator {
147 public:
148 ArrayIterator( ArrayType * at ) : array( at ) {
149 PRINT( std::cerr << "Creating array iterator: " << at << std::endl; )
[f072892]150 base = at->base;
[e4d829b]151 memberIter = createMemberIterator( base );
[f072892]152 if ( at->isVarLen ) SemanticError( at, "VLA initialization does not support @=: " );
153 setSize( at->dimension );
[e4d829b]154 }
155
156 ~ArrayIterator() {
157 delete memberIter;
158 }
159
160 private:
[f37d9e7]161 void setSize( Expression * expr ) {
162 auto res = eval( expr );
[ba4a1d8]163 if (res.second) {
164 size = res.first;
[e4d829b]165 } else {
[ba4a1d8]166 SemanticError( expr->location, toString("Array designator must be a constant expression: ", expr) );
[e4d829b]167 }
168 }
169
170 public:
171 void setPosition( Expression * expr ) {
172 // need to permit integer-constant-expressions, including: integer constants, enumeration constants, character constants, sizeof expressions, _Alignof expressions, cast expressions
[f37d9e7]173 auto arg = eval( expr );
174 index = arg.first;
175 return;
176
177 // if ( ConstantExpr * constExpr = dynamic_cast< ConstantExpr * >( expr ) ) {
178 // try {
179 // index = constExpr->intValue();
180 // } catch( SemanticErrorException & ) {
181 // SemanticError( expr, "Constant expression of non-integral type in array designator: " );
182 // }
183 // } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) {
184 // setPosition( castExpr->get_arg() );
185 // } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) {
186 // EnumInstType * inst = dynamic_cast<EnumInstType *>( varExpr->get_result() );
187 // assertf( inst, "ArrayIterator given variable that isn't an enum constant : %s", toString( expr ).c_str() );
188 // long long int value;
189 // if ( inst->baseEnum->valueOf( varExpr->var, value ) ) {
190 // index = value;
191 // }
192 // } else if ( dynamic_cast< SizeofExpr * >( expr ) || dynamic_cast< AlignofExpr * >( expr ) ) {
193 // index = 0; // xxx - get actual sizeof/alignof value?
194 // } else {
195 // assertf( false, "4 bad designator given to ArrayIterator: %s", toString( expr ).c_str() );
196 // }
[e4d829b]197 }
198
199 virtual void setPosition( std::list< Expression * > & designators ) {
200 if ( ! designators.empty() ) {
201 setPosition( designators.front() );
202 designators.pop_front();
203 memberIter->setPosition( designators );
204 }
205 }
206
207 virtual std::list<InitAlternative> operator*() const {
208 return first();
209 }
210
[4b97770]211 virtual operator bool() const { return index < size; }
[e4d829b]212
213 virtual MemberIterator & bigStep() {
214 PRINT( std::cerr << "bigStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
215 ++index;
216 delete memberIter;
[4b97770]217 if ( index < size ) memberIter = createMemberIterator( base );
[e4d829b]218 else memberIter = nullptr;
219 return *this;
220 }
221
222 virtual MemberIterator & smallStep() {
223 PRINT( std::cerr << "smallStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
224 if ( memberIter ) {
225 PRINT( std::cerr << "has member iter: " << *memberIter << std::endl; )
226 memberIter->smallStep();
227 if ( *memberIter ) {
228 PRINT( std::cerr << "has valid member iter" << std::endl; )
229 return *this;
230 }
231 }
232 return bigStep();
233 }
234
235 virtual Type * getType() { return array; }
236 virtual Type * getNext() { return base; }
237
238 virtual std::list<InitAlternative> first() const {
239 PRINT( std::cerr << "first in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
240 if ( memberIter && *memberIter ) {
241 std::list<InitAlternative> ret = memberIter->first();
242 for ( InitAlternative & alt : ret ) {
243 alt.designation->get_designators().push_front( new ConstantExpr( Constant::from_ulong( index ) ) );
244 }
245 return ret;
246 }
247 return std::list<InitAlternative>();
248 }
249
250 virtual void print( std::ostream & out, Indenter indent ) const {
251 out << "ArrayIterator(Array of " << base << ")";
252 if ( memberIter ) {
253 Indenter childIndent = indent+1;
254 out << std::endl << childIndent;
255 memberIter->print( out, childIndent );
256 }
257 }
258
259 private:
260 ArrayType * array = nullptr;
261 Type * base = nullptr;
262 size_t index = 0;
263 size_t size = 0;
264 MemberIterator * memberIter = nullptr;
265 };
266
267 class AggregateIterator : public MemberIterator {
268 public:
[62423350]269 typedef std::list<Declaration *> MemberList;
270 typedef MemberList::const_iterator iterator;
271 std::string kind = ""; // for debug
272 std::string name;
273 Type * inst = nullptr;
274 const MemberList & members;
[e4d829b]275 iterator curMember;
[62423350]276 bool atbegin = true; // false at first {small,big}Step -- this aggr type is only added to the possibilities at the beginning
[e4d829b]277 Type * curType = nullptr;
278 MemberIterator * memberIter = nullptr;
[62423350]279 mutable TypeSubstitution sub;
[e4d829b]280
[62423350]281 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 ) ) {
[c6747a1]282 PRINT( std::cerr << "Creating " << kind << "(" << name << ")"; )
[e4d829b]283 init();
284 }
285
286 virtual ~AggregateIterator() {
287 delete memberIter;
288 }
289
290 bool init() {
[62423350]291 PRINT( std::cerr << "--init()--" << members.size() << std::endl; )
292 if ( curMember != members.end() ) {
[e4d829b]293 if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( *curMember ) ) {
294 PRINT( std::cerr << "incremented to field: " << field << std::endl; )
295 curType = field->get_type();
296 memberIter = createMemberIterator( curType );
297 return true;
298 }
299 }
300 return false;
301 }
302
303 virtual std::list<InitAlternative> operator*() const {
304 if (memberIter && *memberIter) {
305 std::list<InitAlternative> ret = memberIter->first();
[62423350]306 PRINT( std::cerr << "sub: " << sub << std::endl; )
[e4d829b]307 for ( InitAlternative & alt : ret ) {
308 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
[e3e16bc]309 alt.designation->get_designators().push_front( new VariableExpr( strict_dynamic_cast< ObjectDecl * >( *curMember ) ) );
[62423350]310 // need to substitute for generic types, so that casts are to concrete types
311 PRINT( std::cerr << " type is: " << alt.type; )
312 sub.apply( alt.type ); // also apply to designation??
313 PRINT( std::cerr << " ==> " << alt.type << std::endl; )
[e4d829b]314 }
315 return ret;
316 }
317 return std::list<InitAlternative>();
318 }
319
320 virtual void setPosition( std::list< Expression * > & designators ) {
321 if ( ! designators.empty() ) {
322 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( designators.front() ) ) {
[62423350]323 for ( curMember = members.begin(); curMember != members.end(); ++curMember ) {
[e4d829b]324 if ( *curMember == varExpr->get_var() ) {
325 designators.pop_front();
326 delete memberIter;
327 memberIter = createMemberIterator( varExpr->get_result() );
328 curType = varExpr->get_result();
[62423350]329 atbegin = curMember == members.begin() && designators.empty(); // xxx - is this the right condition for atbegin??
[e4d829b]330 memberIter->setPosition( designators );
331 return;
332 } // if
333 } // for
[62423350]334 assertf( false, "could not find member in %s: %s", kind.c_str(), toString( varExpr ).c_str() );
[e4d829b]335 } else {
[f37d9e7]336 assertf( false, "3 bad designator given to %s: %s", kind.c_str(), toString( designators.front() ).c_str() );
[e4d829b]337 } // if
338 } // if
339 }
340
341 virtual MemberIterator & smallStep() {
342 PRINT( std::cerr << "smallStep in " << kind << std::endl; )
343 atbegin = false;
344 if ( memberIter ) {
345 PRINT( std::cerr << "has member iter, incrementing..." << std::endl; )
346 memberIter->smallStep();
347 if ( *memberIter ) {
348 PRINT( std::cerr << "success!" << std::endl; )
349 return *this;
350 }
351 }
352 return bigStep();
353 }
354
355 virtual Type * getType() { return inst; }
356 virtual Type * getNext() {
357 if ( memberIter && *memberIter ) return memberIter->getType(); // xxx - ??? recursive call???
358 return nullptr;
359 }
360
361 virtual std::list<InitAlternative> first() const {
362 std::list<InitAlternative> ret;
363 PRINT( std::cerr << "first " << kind << std::endl; )
364 if ( memberIter && *memberIter ) { // might not need *memberIter??
365 PRINT( std::cerr << "adding children" << std::endl; )
366 ret = memberIter->first();
367 for ( InitAlternative & alt : ret ) {
368 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
[e3e16bc]369 alt.designation->get_designators().push_front( new VariableExpr( strict_dynamic_cast< ObjectDecl * >( *curMember ) ) );
[e4d829b]370 }
371 }
[84e8423]372 if ( atbegin ) {
[e4d829b]373 // xxx - what about case of empty struct??
374 // only add self if at the very beginning of the structure
375 PRINT( std::cerr << "adding self" << std::endl; )
376 ret.push_front( { inst->clone(), new Designation( {} ) } );
377 }
378 return ret;
379 }
380
381 virtual void print( std::ostream & out, Indenter indent ) const {
[62423350]382 out << kind << "(" << name << ")";
[e4d829b]383 if ( memberIter ) {
384 Indenter childIndent = indent+1;
385 out << std::endl << childIndent;
386 memberIter->print( out, childIndent );
387 }
388 }
389 };
390
391 class UnionIterator : public AggregateIterator {
392 public:
[62423350]393 UnionIterator( UnionInstType * inst ) : AggregateIterator( "UnionIterator", inst->get_name(), inst, inst->get_baseUnion()->get_members() ) {}
[e4d829b]394
395 virtual operator bool() const { return (memberIter && *memberIter); }
396 virtual MemberIterator & bigStep() {
397 // unions only initialize one member
398 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
399 atbegin = false;
400 delete memberIter;
401 memberIter = nullptr;
402 curType = nullptr;
[62423350]403 curMember = members.end();
[e4d829b]404 return *this;
405 }
406 };
407
408 class StructIterator : public AggregateIterator {
409 public:
[62423350]410 StructIterator( StructInstType * inst ) : AggregateIterator( "StructIterator", inst->get_name(), inst, inst->get_baseStruct()->get_members() ) {}
411
412 virtual operator bool() const { return curMember != members.end() || (memberIter && *memberIter); }
413
414 virtual MemberIterator & bigStep() {
415 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
416 atbegin = false;
417 delete memberIter;
418 memberIter = nullptr;
419 curType = nullptr;
420 for ( ; curMember != members.end(); ) {
421 ++curMember;
422 if ( init() ) {
423 return *this;
424 }
425 }
426 return *this;
427 }
428 };
429
430 class TupleIterator : public AggregateIterator {
431 public:
432 TupleIterator( TupleType * inst ) : AggregateIterator( "TupleIterator", toString("Tuple", inst->size()), inst, inst->get_members() ) {}
[e4d829b]433
[62423350]434 virtual operator bool() const { return curMember != members.end() || (memberIter && *memberIter); }
[e4d829b]435
436 virtual MemberIterator & bigStep() {
437 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
438 atbegin = false;
439 delete memberIter;
440 memberIter = nullptr;
441 curType = nullptr;
[62423350]442 for ( ; curMember != members.end(); ) {
[e4d829b]443 ++curMember;
444 if ( init() ) {
445 return *this;
446 }
447 }
448 return *this;
449 }
450 };
451
452 MemberIterator * createMemberIterator( Type * type ) {
453 if ( ReferenceToType * aggr = dynamic_cast< ReferenceToType * >( type ) ) {
454 if ( StructInstType * sit = dynamic_cast< StructInstType * >( aggr ) ) {
455 return new StructIterator( sit );
456 } else if ( UnionInstType * uit = dynamic_cast< UnionInstType * >( aggr ) ) {
457 return new UnionIterator( uit );
458 } else {
[78754d7]459 assertf( dynamic_cast< EnumInstType * >( type ) || dynamic_cast< TypeInstType * >( type ), "Encountered unhandled ReferenceToType in createMemberIterator: %s", toString( type ).c_str() );
[62423350]460 return new SimpleIterator( type );
[e4d829b]461 }
462 } else if ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) {
463 return new ArrayIterator( at );
[62423350]464 } else if ( TupleType * tt = dynamic_cast< TupleType * >( type ) ) {
465 return new TupleIterator( tt );
[e4d829b]466 } else {
467 return new SimpleIterator( type );
468 }
469 }
470
471 CurrentObject::CurrentObject() {}
472 CurrentObject::CurrentObject( Type * type ) {
473 objStack.push( new SimpleIterator( type ) );
474 }
475
476
477 void CurrentObject::setNext( Designation * designation ) {
478 assertf( ! objStack.empty(), "obj stack empty in setNext" );
479 PRINT( std::cerr << "____setNext" << designation << std::endl; )
480 objStack.top()->setPosition( designation->get_designators() );
481 }
482
483 Designation * CurrentObject::findNext( Designation * designation ) {
484 typedef std::list< Expression * > DesignatorChain;
485 PRINT( std::cerr << "___findNext" << std::endl; )
486 // find all the d's
487 std::list<DesignatorChain> desigAlts{ { } }, newDesigAlts;
488 std::list<Type *> curTypes { (objStack.top())->getType() }, newTypes;
489 for ( Expression * expr : designation->get_designators() ) {
490 PRINT( std::cerr << "____untyped: " << expr << std::endl; )
491 std::list<DesignatorChain>::iterator dit = desigAlts.begin();
492 if ( NameExpr * nexpr = dynamic_cast<NameExpr *>(expr) ) {
493 for ( Type * t : curTypes ) {
494 assert( dit != desigAlts.end() );
495 DesignatorChain & d = *dit;
496 PRINT( std::cerr << "____actual: " << t << std::endl; )
497 ReferenceToType * refType = dynamic_cast<ReferenceToType *>(t);
498 std::list<Declaration *> members;
499 if ( refType ) {
500 refType->lookup( nexpr->get_name(), members ); // concatenate identical field name
501 // xxx - need to also include anonymous members in this somehow...
502 for ( Declaration * mem: members ) {
503 if ( ObjectDecl * field = dynamic_cast<ObjectDecl *>(mem) ) {
504 PRINT( std::cerr << "____alt: " << field->get_type() << std::endl; )
505 DesignatorChain newD = d;
506 newD.push_back( new VariableExpr( field ) );
507 newDesigAlts.push_back( newD );
508 newTypes.push_back( field->get_type() );
509 } // if
510 } // for
511 } // if
512 ++dit;
513 } // for
514 } else {
515 for ( Type * t : curTypes ) {
516 assert( dit != desigAlts.end() );
517 DesignatorChain & d = *dit;
518 if ( ArrayType * at = dynamic_cast< ArrayType * > ( t ) ) {
519 PRINT( std::cerr << "____alt: " << at->get_base() << std::endl; )
520 d.push_back( expr );
521 newDesigAlts.push_back( d );
522 newTypes.push_back( at->get_base() );
523 }
524 ++dit;
525 } // for
526 } // if
527 desigAlts = newDesigAlts;
528 newDesigAlts.clear();
529 curTypes = newTypes;
530 newTypes.clear();
[56e49b0]531 assertf( desigAlts.size() == curTypes.size(), "Designator alternatives (%zu) and current types (%zu) out of sync", desigAlts.size(), curTypes.size() );
[e4d829b]532 } // for
533 if ( desigAlts.size() > 1 ) {
[a16764a6]534 SemanticError( designation, toString("Too many alternatives (", desigAlts.size(), ") for designation: ") );
[e4d829b]535 } else if ( desigAlts.size() == 0 ) {
[a16764a6]536 SemanticError( designation, "No reasonable alternatives for designation: " );
[e4d829b]537 }
538 DesignatorChain & d = desigAlts.back();
539 PRINT( for ( Expression * expr : d ) {
540 std::cerr << "____desig: " << expr << std::endl;
541 } ) // for
542 assertf( ! curTypes.empty(), "empty designator chosen");
543
544 // set new designators
545 assertf( ! objStack.empty(), "empty object stack when setting designation" );
546 Designation * actualDesignation = new Designation( d );
547 objStack.top()->setPosition( d ); // destroys d
548 return actualDesignation;
549 }
550
551 void CurrentObject::increment() {
552 PRINT( std::cerr << "____increment" << std::endl; )
553 if ( ! objStack.empty() ) {
554 PRINT( std::cerr << *objStack.top() << std::endl; )
555 objStack.top()->smallStep();
556 }
557 }
558
559 void CurrentObject::enterListInit() {
560 PRINT( std::cerr << "____entering list init" << std::endl; )
561 assertf( ! objStack.empty(), "empty obj stack entering list init" );
562 Type * type = objStack.top()->getNext();
563 if ( type ) {
564 objStack.push( createMemberIterator( type ) );
565 } else {
566 assertf( false, "not sure about this case..." );
567 }
568 }
569
570 void CurrentObject::exitListInit() {
571 PRINT( std::cerr << "____exiting list init" << std::endl; )
572 assertf( ! objStack.empty(), "objstack empty" );
573 delete objStack.top();
574 objStack.pop();
575 if ( ! objStack.empty() ) {
576 PRINT( std::cerr << *objStack.top() << std::endl; )
577 objStack.top()->bigStep();
578 }
579 }
580
581 std::list< InitAlternative > CurrentObject::getOptions() {
582 PRINT( std::cerr << "____getting current options" << std::endl; )
583 assertf( ! objStack.empty(), "objstack empty in getOptions" );
584 return **objStack.top();
585 }
[62423350]586
587 Type * CurrentObject::getCurrentType() {
588 PRINT( std::cerr << "____getting current type" << std::endl; )
589 assertf( ! objStack.empty(), "objstack empty in getCurrentType" );
590 return objStack.top()->getNext();
591 }
[e4d829b]592} // namespace ResolvExpr
593
[b7d92b96]594namespace ast {
[60aaa51d]595 /// create a new MemberIterator that traverses a type correctly
596 MemberIterator * createMemberIterator( const CodeLocation & loc, const Type * type );
[b7d92b96]597
598 /// Iterates "other" types (e.g. basic, pointer) which do not change at list initializer entry
599 class SimpleIterator final : public MemberIterator {
[2b59f55]600 CodeLocation location;
[954c954]601 const Type * type = nullptr;
[b7d92b96]602 public:
[2b59f55]603 SimpleIterator( const CodeLocation & loc, const Type * t ) : location( loc ), type( t ) {}
604
[2890212]605 void setPosition(
606 std::deque< ptr< Expr > >::const_iterator begin,
[60aaa51d]607 std::deque< ptr< Expr > >::const_iterator end
608 ) override {
609 if ( begin != end ) {
610 SemanticError( location, "Un-designated initializer given non-empty designator" );
611 }
612 }
[2b59f55]613
[60aaa51d]614 std::deque< InitAlternative > operator* () const override { return first(); }
615
616 operator bool() const override { return type; }
617
618 SimpleIterator & bigStep() override { return smallStep(); }
619 SimpleIterator & smallStep() override {
620 type = nullptr; // empty on increment because no members
621 return *this;
622 }
623
624 const Type * getType() override { return type; }
625
626 const Type * getNext() override { return type; }
627
628 std::deque< InitAlternative > first() const override {
[2b59f55]629 if ( type ) return { InitAlternative{ type, new Designation{ location } } };
630 return {};
631 }
[b7d92b96]632 };
633
[60aaa51d]634 /// Iterates array types
635 class ArrayIterator final : public MemberIterator {
636 CodeLocation location;
[954c954]637 const ArrayType * array = nullptr;
638 const Type * base = nullptr;
[60aaa51d]639 size_t index = 0;
640 size_t size = 0;
641 std::unique_ptr< MemberIterator > memberIter;
642
643 void setSize( const Expr * expr ) {
[f37d9e7]644 auto res = eval( expr );
[60aaa51d]645 if ( ! res.second ) {
[f37d9e7]646 SemanticError( location, toString( "Array designator must be a constant expression: ", expr ) );
[60aaa51d]647 }
648 size = res.first;
649 }
650
651 public:
[f37d9e7]652 ArrayIterator( const CodeLocation & loc, const ArrayType * at ) : location( loc ), array( at ), base( at->base ) {
[60aaa51d]653 PRINT( std::cerr << "Creating array iterator: " << at << std::endl; )
654 memberIter.reset( createMemberIterator( loc, base ) );
655 if ( at->isVarLen ) {
656 SemanticError( location, at, "VLA initialization does not support @=: " );
657 }
658 setSize( at->dimension );
659 }
660
661 void setPosition( const Expr * expr ) {
[2890212]662 // need to permit integer-constant-expressions, including: integer constants,
663 // enumeration constants, character constants, sizeof expressions, alignof expressions,
[60aaa51d]664 // cast expressions
[f37d9e7]665
666 auto arg = eval( expr );
667 index = arg.first;
668 return;
669
670 // if ( auto constExpr = dynamic_cast< const ConstantExpr * >( expr ) ) {
671 // try {
672 // index = constExpr->intValue();
673 // } catch ( SemanticErrorException & ) {
674 // SemanticError( expr, "Constant expression of non-integral type in array designator: " );
675 // }
676 // } else if ( auto castExpr = dynamic_cast< const CastExpr * >( expr ) ) {
677 // setPosition( castExpr->arg );
678 // } else if ( dynamic_cast< const SizeofExpr * >( expr ) || dynamic_cast< const AlignofExpr * >( expr ) ) {
679 // index = 0;
680 // } else {
681 // assertf( false, "2 bad designator given to ArrayIterator: %s", toString( expr ).c_str() );
682 // }
[60aaa51d]683 }
684
[2890212]685 void setPosition(
686 std::deque< ptr< Expr > >::const_iterator begin,
[60aaa51d]687 std::deque< ptr< Expr > >::const_iterator end
688 ) override {
689 if ( begin == end ) return;
690
691 setPosition( *begin );
692 memberIter->setPosition( ++begin, end );
693 }
694
695 std::deque< InitAlternative > operator* () const override { return first(); }
696
697 operator bool() const override { return index < size; }
698
699 ArrayIterator & bigStep() override {
700 PRINT( std::cerr << "bigStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
701 ++index;
702 memberIter.reset( index < size ? createMemberIterator( location, base ) : nullptr );
703 return *this;
704 }
705
706 ArrayIterator & smallStep() override {
707 PRINT( std::cerr << "smallStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
708 if ( memberIter ) {
709 PRINT( std::cerr << "has member iter: " << *memberIter << std::endl; )
710 memberIter->smallStep();
711 if ( *memberIter ) {
712 PRINT( std::cerr << "has valid member iter" << std::endl; )
713 return *this;
714 }
715 }
716 return bigStep();
717 }
718
719 const Type * getType() override { return array; }
720
721 const Type * getNext() override { return base; }
722
723 std::deque< InitAlternative > first() const override {
724 PRINT( std::cerr << "first in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
725 if ( memberIter && *memberIter ) {
726 std::deque< InitAlternative > ret = memberIter->first();
727 for ( InitAlternative & alt : ret ) {
[f37d9e7]728 alt.designation.get_and_mutate()->designators.emplace_front( ConstantExpr::from_ulong( location, index ) );
[60aaa51d]729 }
730 return ret;
731 }
732 return {};
733 }
734 };
735
736 class AggregateIterator : public MemberIterator {
737 protected:
738 using MemberList = std::vector< ptr< Decl > >;
739
740 CodeLocation location;
741 std::string kind; // for debug
742 std::string name;
743 const Type * inst;
744 const MemberList & members;
745 MemberList::const_iterator curMember;
746 bool atbegin = true; // false at first {small,big}Step
747 const Type * curType = nullptr;
748 std::unique_ptr< MemberIterator > memberIter = nullptr;
749 TypeSubstitution sub;
750
751 bool init() {
752 PRINT( std::cerr << "--init()--" << members.size() << std::endl; )
753 if ( curMember != members.end() ) {
754 if ( auto field = curMember->as< ObjectDecl >() ) {
755 PRINT( std::cerr << "incremented to field: " << field << std::endl; )
756 curType = field->get_type();
757 memberIter.reset( createMemberIterator( location, curType ) );
758 return true;
759 }
760 }
761 return false;
762 }
763
[2890212]764 AggregateIterator(
765 const CodeLocation & loc, const std::string k, const std::string & n, const Type * i,
[60aaa51d]766 const MemberList & ms )
[2890212]767 : location( loc ), kind( k ), name( n ), inst( i ), members( ms ), curMember( ms.begin() ),
[60aaa51d]768 sub( genericSubstitution( i ) ) {
769 PRINT( std::cerr << "Creating " << kind << "(" << name << ")"; )
770 init();
771 }
772
773 public:
[2890212]774 void setPosition(
775 std::deque< ptr< Expr > >::const_iterator begin,
[60aaa51d]776 std::deque< ptr< Expr > >::const_iterator end
777 ) final {
778 if ( begin == end ) return;
779
780 if ( auto varExpr = begin->as< VariableExpr >() ) {
781 for ( curMember = members.begin(); curMember != members.end(); ++curMember ) {
782 if ( *curMember != varExpr->var ) continue;
783
784 ++begin;
785
786 memberIter.reset( createMemberIterator( location, varExpr->result ) );
787 curType = varExpr->result;
788 atbegin = curMember == members.begin() && begin == end;
789 memberIter->setPosition( begin, end );
790 return;
791 }
[f37d9e7]792 assertf( false, "could not find member in %s: %s", kind.c_str(), toString( varExpr ).c_str() );
[60aaa51d]793 } else {
[f37d9e7]794 assertf( false, "1 bad designator given to %s: %s", kind.c_str(), toString( *begin ).c_str() );
[60aaa51d]795 }
796 }
797
798 std::deque< InitAlternative > operator* () const final {
799 if ( memberIter && *memberIter ) {
800 std::deque< InitAlternative > ret = memberIter->first();
801 PRINT( std::cerr << "sub: " << sub << std::endl; )
802 for ( InitAlternative & alt : ret ) {
803 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
804 alt.designation.get_and_mutate()->designators.emplace_front(
805 new VariableExpr{ location, curMember->strict_as< ObjectDecl >() } );
806 // need to substitute for generic types so that casts are to concrete types
[8e1467d]807 alt.type = shallowCopy(alt.type.get());
[60aaa51d]808 PRINT( std::cerr << " type is: " << alt.type; )
809 sub.apply( alt.type ); // also apply to designation??
810 PRINT( std::cerr << " ==> " << alt.type << std::endl; )
811 }
812 return ret;
813 }
814 return {};
815 }
816
817 AggregateIterator & smallStep() final {
818 PRINT( std::cerr << "smallStep in " << kind << std::endl; )
819 atbegin = false;
820 if ( memberIter ) {
821 PRINT( std::cerr << "has member iter, incrementing..." << std::endl; )
822 memberIter->smallStep();
823 if ( *memberIter ) {
824 PRINT( std::cerr << "success!" << std::endl; )
825 return *this;
826 }
827 }
828 return bigStep();
829 }
830
831 AggregateIterator & bigStep() override = 0;
832
833 const Type * getType() final { return inst; }
834
835 const Type * getNext() final {
836 return ( memberIter && *memberIter ) ? memberIter->getType() : nullptr;
837 }
838
839 std::deque< InitAlternative > first() const final {
840 std::deque< InitAlternative > ret;
841 PRINT( std::cerr << "first " << kind << std::endl; )
842 if ( memberIter && *memberIter ) {
843 PRINT( std::cerr << "adding children" << std::endl; )
844 ret = memberIter->first();
845 for ( InitAlternative & alt : ret ) {
846 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
[2890212]847 alt.designation.get_and_mutate()->designators.emplace_front(
[60aaa51d]848 new VariableExpr{ location, curMember->strict_as< ObjectDecl >() } );
849 }
850 }
851 if ( atbegin ) {
852 // only add self if at the very beginning of the structure
853 PRINT( std::cerr << "adding self" << std::endl; )
854 ret.emplace_front( inst, new Designation{ location } );
855 }
856 return ret;
857 }
858 };
859
860 class StructIterator final : public AggregateIterator {
861 public:
862 StructIterator( const CodeLocation & loc, const StructInstType * inst )
863 : AggregateIterator( loc, "StructIterator", inst->name, inst, inst->base->members ) {}
864
865 operator bool() const override {
866 return curMember != members.end() || (memberIter && *memberIter);
867 }
868
869 StructIterator & bigStep() override {
870 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
871 atbegin = false;
872 memberIter = nullptr;
873 curType = nullptr;
874 while ( curMember != members.end() ) {
875 ++curMember;
876 if ( init() ) return *this;
877 }
878 return *this;
879 }
880 };
881
882 class UnionIterator final : public AggregateIterator {
883 public:
884 UnionIterator( const CodeLocation & loc, const UnionInstType * inst )
885 : AggregateIterator( loc, "UnionIterator", inst->name, inst, inst->base->members ) {}
886
887 operator bool() const override { return memberIter && *memberIter; }
888
889 UnionIterator & bigStep() override {
890 // unions only initialize one member
891 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
892 atbegin = false;
893 memberIter = nullptr;
894 curType = nullptr;
895 curMember = members.end();
896 return *this;
897 }
898 };
899
900 class TupleIterator final : public AggregateIterator {
901 public:
[2890212]902 TupleIterator( const CodeLocation & loc, const TupleType * inst )
903 : AggregateIterator(
904 loc, "TupleIterator", toString("Tuple", inst->size()), inst, inst->members
[60aaa51d]905 ) {}
906
907 operator bool() const override {
908 return curMember != members.end() || (memberIter && *memberIter);
909 }
910
911 TupleIterator & bigStep() override {
912 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
913 atbegin = false;
914 memberIter = nullptr;
915 curType = nullptr;
916 while ( curMember != members.end() ) {
917 ++curMember;
918 if ( init() ) return *this;
919 }
920 return *this;
921 }
922 };
923
924 MemberIterator * createMemberIterator( const CodeLocation & loc, const Type * type ) {
[98e8b3b]925 if ( auto aggr = dynamic_cast< const BaseInstType * >( type ) ) {
[60aaa51d]926 if ( auto sit = dynamic_cast< const StructInstType * >( aggr ) ) {
[de57af9]927 assert( sit->base );
[60aaa51d]928 return new StructIterator{ loc, sit };
929 } else if ( auto uit = dynamic_cast< const UnionInstType * >( aggr ) ) {
[de57af9]930 assert( uit->base );
[60aaa51d]931 return new UnionIterator{ loc, uit };
932 } else {
[2890212]933 assertf(
934 dynamic_cast< const EnumInstType * >( type )
935 || dynamic_cast< const TypeInstType * >( type ),
[98e8b3b]936 "Encountered unhandled BaseInstType in createMemberIterator: %s",
[60aaa51d]937 toString( type ).c_str() );
938 return new SimpleIterator{ loc, type };
939 }
940 } else if ( auto at = dynamic_cast< const ArrayType * >( type ) ) {
941 return new ArrayIterator{ loc, at };
942 } else if ( auto tt = dynamic_cast< const TupleType * >( type ) ) {
943 return new TupleIterator{ loc, tt };
944 } else {
945 return new SimpleIterator{ loc, type };
946 }
947 }
948
[2b59f55]949 CurrentObject::CurrentObject( const CodeLocation & loc, const Type * type ) : objStack() {
950 objStack.emplace_back( new SimpleIterator{ loc, type } );
[b7d92b96]951 }
952
[2d11663]953 const Designation * CurrentObject::findNext( const Designation * designation ) {
954 using DesignatorChain = std::deque< ptr< Expr > >;
955 PRINT( std::cerr << "___findNext" << std::endl; )
[2890212]956
[2d11663]957 // find all the d's
958 std::vector< DesignatorChain > desigAlts{ {} }, newDesigAlts;
959 std::deque< const Type * > curTypes{ objStack.back()->getType() }, newTypes;
960 for ( const Expr * expr : designation->designators ) {
961 PRINT( std::cerr << "____untyped: " << expr << std::endl; )
962 auto dit = desigAlts.begin();
963 if ( auto nexpr = dynamic_cast< const NameExpr * >( expr ) ) {
964 for ( const Type * t : curTypes ) {
965 assert( dit != desigAlts.end() );
966
967 DesignatorChain & d = *dit;
968 PRINT( std::cerr << "____actual: " << t << std::endl; )
[98e8b3b]969 if ( auto refType = dynamic_cast< const BaseInstType * >( t ) ) {
[2d11663]970 // concatenate identical field names
971 for ( const Decl * mem : refType->lookup( nexpr->name ) ) {
972 if ( auto field = dynamic_cast< const ObjectDecl * >( mem ) ) {
973 PRINT( std::cerr << "____alt: " << field->type << std::endl; )
974 DesignatorChain d2 = d;
975 d2.emplace_back( new VariableExpr{ expr->location, field } );
976 newDesigAlts.emplace_back( std::move( d2 ) );
977 newTypes.emplace_back( field->type );
978 }
979 }
980 }
981
982 ++dit;
983 }
984 } else {
985 for ( const Type * t : curTypes ) {
986 assert( dit != desigAlts.end() );
987
988 DesignatorChain & d = *dit;
989 if ( auto at = dynamic_cast< const ArrayType * >( t ) ) {
990 PRINT( std::cerr << "____alt: " << at->get_base() << std::endl; )
991 d.emplace_back( expr );
992 newDesigAlts.emplace_back( d );
993 newTypes.emplace_back( at->base );
994 }
995 }
996 }
997
998 // reset queue
999 desigAlts = std::move( newDesigAlts );
1000 newDesigAlts.clear();
1001 curTypes = std::move( newTypes );
1002 newTypes.clear();
1003 assertf( desigAlts.size() == curTypes.size(), "Designator alternatives (%zu) and current types (%zu) out of sync", desigAlts.size(), curTypes.size() );
1004 }
1005
1006 if ( desigAlts.size() > 1 ) {
1007 SemanticError( designation, toString("Too many alternatives (", desigAlts.size(), ") for designation: ") );
1008 } else if ( desigAlts.empty() ) {
1009 SemanticError( designation, "No reasonable alternatives for designation: " );
1010 }
1011
1012 DesignatorChain & d = desigAlts.back();
1013 PRINT( for ( Expression * expr : d ) {
1014 std::cerr << "____desig: " << expr << std::endl;
1015 } ) // for
1016 assertf( ! curTypes.empty(), "empty designator chosen");
1017
1018 // set new designators
1019 assertf( ! objStack.empty(), "empty object stack when setting designation" );
[2890212]1020 Designation * actualDesignation =
[2d11663]1021 new Designation{ designation->location, DesignatorChain{d} };
1022 objStack.back()->setPosition( d ); // destroys d
1023 return actualDesignation;
1024 }
1025
1026 void CurrentObject::setNext( const Designation * designation ) {
[60aaa51d]1027 PRINT( std::cerr << "____setNext" << designation << std::endl; )
1028 assertf( ! objStack.empty(), "obj stack empty in setNext" );
1029 objStack.back()->setPosition( designation->designators );
1030 }
1031
1032 void CurrentObject::increment() {
1033 PRINT( std::cerr << "____increment" << std::endl; )
1034 if ( objStack.empty() ) return;
1035 PRINT( std::cerr << *objStack.back() << std::endl; )
1036 objStack.back()->smallStep();
1037 }
1038
1039 void CurrentObject::enterListInit( const CodeLocation & loc ) {
1040 PRINT( std::cerr << "____entering list init" << std::endl; )
1041 assertf( ! objStack.empty(), "empty obj stack entering list init" );
1042 const ast::Type * type = objStack.back()->getNext();
1043 assert( type );
1044 objStack.emplace_back( createMemberIterator( loc, type ) );
1045 }
1046
1047 void CurrentObject::exitListInit() {
1048 PRINT( std::cerr << "____exiting list init" << std::endl; )
1049 assertf( ! objStack.empty(), "objstack empty" );
1050 objStack.pop_back();
1051 if ( ! objStack.empty() ) {
1052 PRINT( std::cerr << *objStack.back() << std::endl; )
1053 objStack.back()->bigStep();
1054 }
1055 }
1056
1057 std::deque< InitAlternative > CurrentObject::getOptions() {
[2b59f55]1058 PRINT( std::cerr << "____getting current options" << std::endl; )
1059 assertf( ! objStack.empty(), "objstack empty in getOptions" );
1060 return **objStack.back();
1061 }
[60aaa51d]1062
1063 const Type * CurrentObject::getCurrentType() {
1064 PRINT( std::cerr << "____getting current type" << std::endl; )
1065 assertf( ! objStack.empty(), "objstack empty in getCurrentType" );
1066 return objStack.back()->getNext();
1067 }
[b7d92b96]1068}
1069
[e4d829b]1070// Local Variables: //
1071// tab-width: 4 //
1072// mode: c++ //
1073// compile-command: "make install" //
1074// End: //
Note: See TracBrowser for help on using the repository browser.