[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 |
---|
| 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 <stack> |
---|
| 17 | #include <iostream> |
---|
| 18 | |
---|
| 19 | #include "CurrentObject.h" |
---|
| 20 | |
---|
| 21 | #include "SynTree/Declaration.h" |
---|
| 22 | #include "SynTree/Initializer.h" |
---|
| 23 | #include "SynTree/Type.h" |
---|
| 24 | |
---|
| 25 | #if 0 |
---|
| 26 | #define PRINT(x) x |
---|
| 27 | #else |
---|
| 28 | #define PRINT(x) |
---|
| 29 | #endif |
---|
| 30 | |
---|
| 31 | namespace ResolvExpr { |
---|
| 32 | long long int getConstValue( ConstantExpr * constExpr ) { |
---|
| 33 | if ( BasicType * basicType = dynamic_cast< BasicType * >( constExpr->get_result() ) ) { |
---|
| 34 | if ( basicType->get_kind() == BasicType::Char || basicType->get_kind() == BasicType::SignedChar || basicType->get_kind() == BasicType::UnsignedChar ) { |
---|
| 35 | assertf( constExpr->get_constant()->get_value().size() == 3, "constant value with unusual length: %s", constExpr->get_constant()->get_value().c_str() ); |
---|
| 36 | return constExpr->get_constant()->get_value()[1]; |
---|
| 37 | } else { |
---|
| 38 | return stoll( constExpr->get_constant()->get_value() ); |
---|
| 39 | } |
---|
| 40 | } else { |
---|
| 41 | assertf( false, "unhandled type on getConstValue %s", constExpr->get_result() ); |
---|
| 42 | } |
---|
| 43 | } |
---|
| 44 | |
---|
| 45 | struct Indenter { |
---|
| 46 | static const int amt = 2; |
---|
| 47 | unsigned int indent = 0; |
---|
| 48 | |
---|
| 49 | Indenter & operator+=(int nlevels) { indent += amt*nlevels; return *this; } |
---|
| 50 | Indenter & operator-=(int nlevels) { indent -= amt*nlevels; return *this; } |
---|
| 51 | Indenter operator+(int nlevels) { Indenter indenter = *this; return indenter += nlevels; } |
---|
| 52 | Indenter operator-(int nlevels) { Indenter indenter = *this; return indenter -= nlevels; } |
---|
| 53 | Indenter & operator++() { return *this += 1; } |
---|
| 54 | Indenter & operator--() { return *this -= 1; } |
---|
| 55 | }; |
---|
| 56 | std::ostream & operator<<( std::ostream & out, Indenter & indent ) { |
---|
| 57 | return out << std::string(indent.indent, ' '); |
---|
| 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, 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 | setSize( at->get_dimension() ); |
---|
| 128 | } |
---|
| 129 | |
---|
| 130 | ~ArrayIterator() { |
---|
| 131 | delete memberIter; |
---|
| 132 | } |
---|
| 133 | |
---|
| 134 | private: |
---|
| 135 | void setSize( Expression * expr ) { |
---|
| 136 | if ( ConstantExpr * constExpr = dynamic_cast< ConstantExpr * >( expr ) ) { |
---|
| 137 | size = getConstValue( constExpr ); // 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 |
---|
| 138 | PRINT( std::cerr << "array type with size: " << size << std::endl; ) |
---|
| 139 | } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) { |
---|
| 140 | setSize( castExpr->get_arg() ); |
---|
| 141 | } else { |
---|
| 142 | assertf( false, "unhandled expression in setSize: %s", toString( expr ).c_str() ); |
---|
| 143 | } |
---|
| 144 | } |
---|
| 145 | |
---|
| 146 | public: |
---|
| 147 | void setPosition( Expression * expr ) { |
---|
| 148 | // need to permit integer-constant-expressions, including: integer constants, enumeration constants, character constants, sizeof expressions, _Alignof expressions, cast expressions |
---|
| 149 | if ( ConstantExpr * constExpr = dynamic_cast< ConstantExpr * >( expr ) ) { |
---|
| 150 | index = getConstValue( constExpr ); |
---|
| 151 | } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) { |
---|
| 152 | setPosition( castExpr->get_arg() ); |
---|
| 153 | } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) { |
---|
| 154 | assertf( dynamic_cast<EnumInstType *> ( varExpr->get_result() ), "ArrayIterator given variable that isn't an enum constant", toString( expr ).c_str() ); |
---|
| 155 | index = 0; // xxx - get actual value of enum constant |
---|
| 156 | } else if ( dynamic_cast< SizeofExpr * >( expr ) || dynamic_cast< AlignofExpr * >( expr ) ) { |
---|
| 157 | index = 0; // xxx - get actual sizeof/alignof value? |
---|
| 158 | } else { |
---|
| 159 | assertf( false, "bad designator given to ArrayIterator: %s", toString( expr ).c_str() ); |
---|
| 160 | } |
---|
| 161 | } |
---|
| 162 | |
---|
| 163 | virtual void setPosition( std::list< Expression * > & designators ) { |
---|
| 164 | if ( ! designators.empty() ) { |
---|
| 165 | setPosition( designators.front() ); |
---|
| 166 | designators.pop_front(); |
---|
| 167 | memberIter->setPosition( designators ); |
---|
| 168 | } |
---|
| 169 | } |
---|
| 170 | |
---|
| 171 | virtual std::list<InitAlternative> operator*() const { |
---|
| 172 | return first(); |
---|
| 173 | } |
---|
| 174 | |
---|
| 175 | virtual operator bool() const { return index < size; } |
---|
| 176 | |
---|
| 177 | virtual MemberIterator & bigStep() { |
---|
| 178 | PRINT( std::cerr << "bigStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; ) |
---|
| 179 | ++index; |
---|
| 180 | delete memberIter; |
---|
| 181 | if ( index < size ) memberIter = createMemberIterator( base ); |
---|
| 182 | else memberIter = nullptr; |
---|
| 183 | return *this; |
---|
| 184 | } |
---|
| 185 | |
---|
| 186 | virtual MemberIterator & smallStep() { |
---|
| 187 | PRINT( std::cerr << "smallStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; ) |
---|
| 188 | if ( memberIter ) { |
---|
| 189 | PRINT( std::cerr << "has member iter: " << *memberIter << std::endl; ) |
---|
| 190 | memberIter->smallStep(); |
---|
| 191 | if ( *memberIter ) { |
---|
| 192 | PRINT( std::cerr << "has valid member iter" << std::endl; ) |
---|
| 193 | return *this; |
---|
| 194 | } |
---|
| 195 | } |
---|
| 196 | return bigStep(); |
---|
| 197 | } |
---|
| 198 | |
---|
| 199 | virtual Type * getType() { return array; } |
---|
| 200 | virtual Type * getNext() { return base; } |
---|
| 201 | |
---|
| 202 | virtual std::list<InitAlternative> first() const { |
---|
| 203 | PRINT( std::cerr << "first in ArrayIterator (" << index << "/" << size << ")" << std::endl; ) |
---|
| 204 | if ( memberIter && *memberIter ) { |
---|
| 205 | std::list<InitAlternative> ret = memberIter->first(); |
---|
| 206 | for ( InitAlternative & alt : ret ) { |
---|
| 207 | alt.designation->get_designators().push_front( new ConstantExpr( Constant::from_ulong( index ) ) ); |
---|
| 208 | } |
---|
| 209 | return ret; |
---|
| 210 | } |
---|
| 211 | return std::list<InitAlternative>(); |
---|
| 212 | } |
---|
| 213 | |
---|
| 214 | virtual void print( std::ostream & out, Indenter indent ) const { |
---|
| 215 | out << "ArrayIterator(Array of " << base << ")"; |
---|
| 216 | if ( memberIter ) { |
---|
| 217 | Indenter childIndent = indent+1; |
---|
| 218 | out << std::endl << childIndent; |
---|
| 219 | memberIter->print( out, childIndent ); |
---|
| 220 | } |
---|
| 221 | } |
---|
| 222 | |
---|
| 223 | private: |
---|
| 224 | ArrayType * array = nullptr; |
---|
| 225 | Type * base = nullptr; |
---|
| 226 | size_t index = 0; |
---|
| 227 | size_t size = 0; |
---|
| 228 | MemberIterator * memberIter = nullptr; |
---|
| 229 | }; |
---|
| 230 | |
---|
| 231 | class AggregateIterator : public MemberIterator { |
---|
| 232 | public: |
---|
| 233 | typedef std::list<Declaration *>::iterator iterator; |
---|
| 234 | const char * kind = ""; // for debug |
---|
| 235 | ReferenceToType * inst = nullptr; |
---|
| 236 | AggregateDecl * decl = nullptr; |
---|
| 237 | iterator curMember; |
---|
| 238 | bool atbegin = true; // false at first {small,big}Step -- this struct type is only added to the possibilities at the beginning |
---|
| 239 | Type * curType = nullptr; |
---|
| 240 | MemberIterator * memberIter = nullptr; |
---|
| 241 | |
---|
| 242 | AggregateIterator( const char * kind, ReferenceToType * inst, AggregateDecl * decl ) : kind( kind ), inst( inst ), decl( decl ), curMember( decl->get_members().begin() ) { |
---|
| 243 | init(); |
---|
| 244 | } |
---|
| 245 | |
---|
| 246 | virtual ~AggregateIterator() { |
---|
| 247 | delete memberIter; |
---|
| 248 | } |
---|
| 249 | |
---|
| 250 | bool init() { |
---|
| 251 | PRINT( std::cerr << "--init()--" << std::endl; ) |
---|
| 252 | if ( curMember != decl->get_members().end() ) { |
---|
| 253 | if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( *curMember ) ) { |
---|
| 254 | PRINT( std::cerr << "incremented to field: " << field << std::endl; ) |
---|
| 255 | curType = field->get_type(); |
---|
| 256 | memberIter = createMemberIterator( curType ); |
---|
| 257 | return true; |
---|
| 258 | } |
---|
| 259 | } |
---|
| 260 | return false; |
---|
| 261 | } |
---|
| 262 | |
---|
| 263 | virtual std::list<InitAlternative> operator*() const { |
---|
| 264 | if (memberIter && *memberIter) { |
---|
| 265 | std::list<InitAlternative> ret = memberIter->first(); |
---|
| 266 | for ( InitAlternative & alt : ret ) { |
---|
| 267 | PRINT( std::cerr << "iterating and adding designators" << std::endl; ) |
---|
| 268 | alt.designation->get_designators().push_front( new VariableExpr( safe_dynamic_cast< ObjectDecl * >( *curMember ) ) ); |
---|
| 269 | } |
---|
| 270 | return ret; |
---|
| 271 | } |
---|
| 272 | return std::list<InitAlternative>(); |
---|
| 273 | } |
---|
| 274 | |
---|
| 275 | virtual void setPosition( std::list< Expression * > & designators ) { |
---|
| 276 | if ( ! designators.empty() ) { |
---|
| 277 | if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( designators.front() ) ) { |
---|
| 278 | for ( curMember = decl->get_members().begin(); curMember != decl->get_members().end(); ++curMember ) { |
---|
| 279 | if ( *curMember == varExpr->get_var() ) { |
---|
| 280 | designators.pop_front(); |
---|
| 281 | delete memberIter; |
---|
| 282 | memberIter = createMemberIterator( varExpr->get_result() ); |
---|
| 283 | curType = varExpr->get_result(); |
---|
| 284 | atbegin = curMember == decl->get_members().begin() && designators.empty(); // xxx - is this right?? |
---|
| 285 | memberIter->setPosition( designators ); |
---|
| 286 | return; |
---|
| 287 | } // if |
---|
| 288 | } // for |
---|
| 289 | assertf( false, "could not find member in %s: %s", kind, toString( varExpr ).c_str() ); |
---|
| 290 | } else { |
---|
| 291 | assertf( false, "bad designator given to %s: %s", kind, toString( designators.front() ).c_str() ); |
---|
| 292 | } // if |
---|
| 293 | } // if |
---|
| 294 | } |
---|
| 295 | |
---|
| 296 | virtual MemberIterator & smallStep() { |
---|
| 297 | PRINT( std::cerr << "smallStep in " << kind << std::endl; ) |
---|
| 298 | atbegin = false; |
---|
| 299 | if ( memberIter ) { |
---|
| 300 | PRINT( std::cerr << "has member iter, incrementing..." << std::endl; ) |
---|
| 301 | memberIter->smallStep(); |
---|
| 302 | if ( *memberIter ) { |
---|
| 303 | PRINT( std::cerr << "success!" << std::endl; ) |
---|
| 304 | return *this; |
---|
| 305 | } |
---|
| 306 | } |
---|
| 307 | return bigStep(); |
---|
| 308 | } |
---|
| 309 | |
---|
| 310 | virtual Type * getType() { return inst; } |
---|
| 311 | virtual Type * getNext() { |
---|
| 312 | if ( memberIter && *memberIter ) return memberIter->getType(); // xxx - ??? recursive call??? |
---|
| 313 | return nullptr; |
---|
| 314 | } |
---|
| 315 | |
---|
| 316 | virtual std::list<InitAlternative> first() const { |
---|
| 317 | std::list<InitAlternative> ret; |
---|
| 318 | PRINT( std::cerr << "first " << kind << std::endl; ) |
---|
| 319 | if ( memberIter && *memberIter ) { // might not need *memberIter?? |
---|
| 320 | PRINT( std::cerr << "adding children" << std::endl; ) |
---|
| 321 | ret = memberIter->first(); |
---|
| 322 | for ( InitAlternative & alt : ret ) { |
---|
| 323 | PRINT( std::cerr << "iterating and adding designators" << std::endl; ) |
---|
| 324 | alt.designation->get_designators().push_front( new VariableExpr( safe_dynamic_cast< ObjectDecl * >( *curMember ) ) ); |
---|
| 325 | } |
---|
| 326 | } |
---|
| 327 | // if ( curMember == std::next( decl->get_members().begin(), 1 ) ) { // xxx - this never triggers because curMember is incremented immediately on construction |
---|
| 328 | if ( atbegin ) { // xxx - this never triggers because curMember is incremented immediately on construction |
---|
| 329 | // xxx - what about case of empty struct?? |
---|
| 330 | // only add self if at the very beginning of the structure |
---|
| 331 | PRINT( std::cerr << "adding self" << std::endl; ) |
---|
| 332 | ret.push_front( { inst->clone(), new Designation( {} ) } ); |
---|
| 333 | } |
---|
| 334 | return ret; |
---|
| 335 | } |
---|
| 336 | |
---|
| 337 | virtual void print( std::ostream & out, Indenter indent ) const { |
---|
| 338 | out << kind << "(" << decl->get_name() << ")"; |
---|
| 339 | if ( memberIter ) { |
---|
| 340 | Indenter childIndent = indent+1; |
---|
| 341 | out << std::endl << childIndent; |
---|
| 342 | memberIter->print( out, childIndent ); |
---|
| 343 | } |
---|
| 344 | } |
---|
| 345 | }; |
---|
| 346 | |
---|
| 347 | class UnionIterator : public AggregateIterator { |
---|
| 348 | public: |
---|
| 349 | UnionIterator( UnionInstType * inst ) : AggregateIterator( "UnionIterator", inst, inst->get_baseUnion() ) {} |
---|
| 350 | |
---|
| 351 | virtual operator bool() const { return (memberIter && *memberIter); } |
---|
| 352 | virtual MemberIterator & bigStep() { |
---|
| 353 | // unions only initialize one member |
---|
| 354 | PRINT( std::cerr << "bigStep in " << kind << std::endl; ) |
---|
| 355 | atbegin = false; |
---|
| 356 | delete memberIter; |
---|
| 357 | memberIter = nullptr; |
---|
| 358 | curType = nullptr; |
---|
| 359 | curMember = decl->get_members().end(); |
---|
| 360 | return *this; |
---|
| 361 | } |
---|
| 362 | virtual std::list<InitAlternative> first() const { return std::list<InitAlternative>{}; } |
---|
| 363 | }; |
---|
| 364 | |
---|
| 365 | class StructIterator : public AggregateIterator { |
---|
| 366 | public: |
---|
| 367 | StructIterator( StructInstType * inst ) : AggregateIterator( "StructIterator", inst, inst->get_baseStruct() ) {} |
---|
| 368 | |
---|
| 369 | virtual operator bool() const { return curMember != decl->get_members().end() || (memberIter && *memberIter); } |
---|
| 370 | |
---|
| 371 | virtual MemberIterator & bigStep() { |
---|
| 372 | PRINT( std::cerr << "bigStep in " << kind << std::endl; ) |
---|
| 373 | atbegin = false; |
---|
| 374 | delete memberIter; |
---|
| 375 | memberIter = nullptr; |
---|
| 376 | curType = nullptr; |
---|
| 377 | for ( ; curMember != decl->get_members().end(); ) { |
---|
| 378 | ++curMember; |
---|
| 379 | if ( init() ) { |
---|
| 380 | return *this; |
---|
| 381 | } |
---|
| 382 | } |
---|
| 383 | return *this; |
---|
| 384 | } |
---|
| 385 | }; |
---|
| 386 | |
---|
| 387 | MemberIterator * createMemberIterator( Type * type ) { |
---|
| 388 | if ( ReferenceToType * aggr = dynamic_cast< ReferenceToType * >( type ) ) { |
---|
| 389 | if ( StructInstType * sit = dynamic_cast< StructInstType * >( aggr ) ) { |
---|
| 390 | return new StructIterator( sit ); |
---|
| 391 | } else if ( UnionInstType * uit = dynamic_cast< UnionInstType * >( aggr ) ) { |
---|
| 392 | return new UnionIterator( uit ); |
---|
| 393 | } else { |
---|
| 394 | assertf( false, "some other reftotype" ); |
---|
| 395 | } |
---|
| 396 | } else if ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) { |
---|
| 397 | return new ArrayIterator( at ); |
---|
| 398 | } else { |
---|
| 399 | return new SimpleIterator( type ); |
---|
| 400 | } |
---|
| 401 | } |
---|
| 402 | |
---|
| 403 | CurrentObject::CurrentObject() {} |
---|
| 404 | CurrentObject::CurrentObject( Type * type ) { |
---|
| 405 | objStack.push( new SimpleIterator( type ) ); |
---|
| 406 | } |
---|
| 407 | |
---|
| 408 | |
---|
| 409 | void CurrentObject::setNext( Designation * designation ) { |
---|
| 410 | assertf( ! objStack.empty(), "obj stack empty in setNext" ); |
---|
| 411 | PRINT( std::cerr << "____setNext" << designation << std::endl; ) |
---|
| 412 | objStack.top()->setPosition( designation->get_designators() ); |
---|
| 413 | } |
---|
| 414 | |
---|
| 415 | Designation * CurrentObject::findNext( Designation * designation ) { |
---|
| 416 | typedef std::list< Expression * > DesignatorChain; |
---|
| 417 | PRINT( std::cerr << "___findNext" << std::endl; ) |
---|
| 418 | // find all the d's |
---|
| 419 | std::list<DesignatorChain> desigAlts{ { } }, newDesigAlts; |
---|
| 420 | std::list<Type *> curTypes { (objStack.top())->getType() }, newTypes; |
---|
| 421 | for ( Expression * expr : designation->get_designators() ) { |
---|
| 422 | PRINT( std::cerr << "____untyped: " << expr << std::endl; ) |
---|
| 423 | std::list<DesignatorChain>::iterator dit = desigAlts.begin(); |
---|
| 424 | if ( NameExpr * nexpr = dynamic_cast<NameExpr *>(expr) ) { |
---|
| 425 | for ( Type * t : curTypes ) { |
---|
| 426 | assert( dit != desigAlts.end() ); |
---|
| 427 | DesignatorChain & d = *dit; |
---|
| 428 | PRINT( std::cerr << "____actual: " << t << std::endl; ) |
---|
| 429 | ReferenceToType * refType = dynamic_cast<ReferenceToType *>(t); |
---|
| 430 | std::list<Declaration *> members; |
---|
| 431 | if ( refType ) { |
---|
| 432 | refType->lookup( nexpr->get_name(), members ); // concatenate identical field name |
---|
| 433 | // xxx - need to also include anonymous members in this somehow... |
---|
| 434 | for ( Declaration * mem: members ) { |
---|
| 435 | if ( ObjectDecl * field = dynamic_cast<ObjectDecl *>(mem) ) { |
---|
| 436 | PRINT( std::cerr << "____alt: " << field->get_type() << std::endl; ) |
---|
| 437 | DesignatorChain newD = d; |
---|
| 438 | newD.push_back( new VariableExpr( field ) ); |
---|
| 439 | newDesigAlts.push_back( newD ); |
---|
| 440 | newTypes.push_back( field->get_type() ); |
---|
| 441 | } // if |
---|
| 442 | } // for |
---|
| 443 | } // if |
---|
| 444 | ++dit; |
---|
| 445 | } // for |
---|
| 446 | } else { |
---|
| 447 | for ( Type * t : curTypes ) { |
---|
| 448 | assert( dit != desigAlts.end() ); |
---|
| 449 | DesignatorChain & d = *dit; |
---|
| 450 | if ( ArrayType * at = dynamic_cast< ArrayType * > ( t ) ) { |
---|
| 451 | PRINT( std::cerr << "____alt: " << at->get_base() << std::endl; ) |
---|
| 452 | d.push_back( expr ); |
---|
| 453 | newDesigAlts.push_back( d ); |
---|
| 454 | newTypes.push_back( at->get_base() ); |
---|
| 455 | } |
---|
| 456 | ++dit; |
---|
| 457 | } // for |
---|
| 458 | } // if |
---|
| 459 | desigAlts = newDesigAlts; |
---|
| 460 | newDesigAlts.clear(); |
---|
| 461 | curTypes = newTypes; |
---|
| 462 | newTypes.clear(); |
---|
| 463 | assertf( desigAlts.size() == curTypes.size(), "Designator alternatives (%d) and current types (%d) out of sync", desigAlts.size(), curTypes.size() ); |
---|
| 464 | } // for |
---|
| 465 | if ( desigAlts.size() > 1 ) { |
---|
| 466 | throw SemanticError( toString("Too many alternatives (", desigAlts.size(), ") for designation: "), designation ); |
---|
| 467 | } else if ( desigAlts.size() == 0 ) { |
---|
| 468 | throw SemanticError( "No reasonable alternatives for designation: ", designation ); |
---|
| 469 | } |
---|
| 470 | DesignatorChain & d = desigAlts.back(); |
---|
| 471 | PRINT( for ( Expression * expr : d ) { |
---|
| 472 | std::cerr << "____desig: " << expr << std::endl; |
---|
| 473 | } ) // for |
---|
| 474 | assertf( ! curTypes.empty(), "empty designator chosen"); |
---|
| 475 | |
---|
| 476 | // set new designators |
---|
| 477 | assertf( ! objStack.empty(), "empty object stack when setting designation" ); |
---|
| 478 | Designation * actualDesignation = new Designation( d ); |
---|
| 479 | objStack.top()->setPosition( d ); // destroys d |
---|
| 480 | return actualDesignation; |
---|
| 481 | } |
---|
| 482 | |
---|
| 483 | void CurrentObject::increment() { |
---|
| 484 | PRINT( std::cerr << "____increment" << std::endl; ) |
---|
| 485 | if ( ! objStack.empty() ) { |
---|
| 486 | PRINT( std::cerr << *objStack.top() << std::endl; ) |
---|
| 487 | objStack.top()->smallStep(); |
---|
| 488 | } |
---|
| 489 | } |
---|
| 490 | |
---|
| 491 | void CurrentObject::enterListInit() { |
---|
| 492 | PRINT( std::cerr << "____entering list init" << std::endl; ) |
---|
| 493 | assertf( ! objStack.empty(), "empty obj stack entering list init" ); |
---|
| 494 | Type * type = objStack.top()->getNext(); |
---|
| 495 | if ( type ) { |
---|
| 496 | // xxx - record types.front()? |
---|
| 497 | objStack.push( createMemberIterator( type ) ); |
---|
| 498 | } else { |
---|
| 499 | assertf( false, "not sure about this case..." ); |
---|
| 500 | } |
---|
| 501 | } |
---|
| 502 | |
---|
| 503 | void CurrentObject::exitListInit() { |
---|
| 504 | PRINT( std::cerr << "____exiting list init" << std::endl; ) |
---|
| 505 | assertf( ! objStack.empty(), "objstack empty" ); |
---|
| 506 | delete objStack.top(); |
---|
| 507 | objStack.pop(); |
---|
| 508 | if ( ! objStack.empty() ) { |
---|
| 509 | PRINT( std::cerr << *objStack.top() << std::endl; ) |
---|
| 510 | objStack.top()->bigStep(); |
---|
| 511 | } |
---|
| 512 | } |
---|
| 513 | |
---|
| 514 | std::list< InitAlternative > CurrentObject::getOptions() { |
---|
| 515 | PRINT( std::cerr << "____getting current options" << std::endl; ) |
---|
| 516 | assertf( ! objStack.empty(), "objstack empty in getOptions" ); |
---|
| 517 | return **objStack.top(); |
---|
| 518 | } |
---|
| 519 | } // namespace ResolvExpr |
---|
| 520 | |
---|
| 521 | // Local Variables: // |
---|
| 522 | // tab-width: 4 // |
---|
| 523 | // mode: c++ // |
---|
| 524 | // compile-command: "make install" // |
---|
| 525 | // End: // |
---|