source: src/ResolvExpr/CurrentObject.cc@ 4e22d7d

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 stuck-waitfor-destruct with_gc
Last change on this file since 4e22d7d was f64d9bc, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Handle initialization of arrays with enumerator dimension and VLAs [fixes #75]
  • Property mode set to 100644
File size: 20.8 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
11// Last Modified By : Rob Schluntz
12// Last Modified On : Tue Jun 13 15:28:44 2017
13// Update Count : 2
14//
15
[ea6332d]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
[e4d829b]21
[ea6332d]22#include "Common/Indenter.h" // for Indenter, operator<<
23#include "Common/SemanticError.h" // for SemanticError
24#include "Common/utility.h" // for toString
[e4d829b]25#include "CurrentObject.h"
[ea6332d]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
[e4d829b]32
33#if 0
34#define PRINT(x) x
35#else
36#define PRINT(x)
37#endif
38
39namespace ResolvExpr {
[62423350]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
[e4d829b]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
[9ff56e7]105 virtual void print( std::ostream & out, __attribute__((unused)) Indenter indent ) const {
[e4d829b]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 ) ) {
[f64d9bc]137 size = constExpr->intValue();
138 isVLA = false;
[e4d829b]139 PRINT( std::cerr << "array type with size: " << size << std::endl; )
140 } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) {
[62423350]141 setSize( castExpr->get_arg() ); // xxx - need to perform the conversion specified by the cast
[f64d9bc]142 } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) {
143 if ( EnumInstType * inst = dynamic_cast< EnumInstType * > ( varExpr->result ) ) {
144 long long int value;
145 if ( inst->baseEnum->valueOf( varExpr->var, value ) ) {
146 size = value;
147 isVLA = false;
148 }
149 }
[e4d829b]150 } else {
[62423350]151 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
[e4d829b]152 }
153 }
154
155 public:
156 void setPosition( Expression * expr ) {
157 // need to permit integer-constant-expressions, including: integer constants, enumeration constants, character constants, sizeof expressions, _Alignof expressions, cast expressions
158 if ( ConstantExpr * constExpr = dynamic_cast< ConstantExpr * >( expr ) ) {
[f64d9bc]159 index = constExpr->intValue();
[e4d829b]160 } else if ( CastExpr * castExpr = dynamic_cast< CastExpr * >( expr ) ) {
161 setPosition( castExpr->get_arg() );
162 } else if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( expr ) ) {
[f64d9bc]163 EnumInstType * inst = dynamic_cast<EnumInstType *>( varExpr->get_result() );
164 assertf( inst, "ArrayIterator given variable that isn't an enum constant : %s", toString( expr ).c_str() );
165 long long int value;
166 if ( inst->baseEnum->valueOf( varExpr->var, value ) ) {
167 index = value;
168 }
[e4d829b]169 } else if ( dynamic_cast< SizeofExpr * >( expr ) || dynamic_cast< AlignofExpr * >( expr ) ) {
170 index = 0; // xxx - get actual sizeof/alignof value?
171 } else {
172 assertf( false, "bad designator given to ArrayIterator: %s", toString( expr ).c_str() );
173 }
174 }
175
176 virtual void setPosition( std::list< Expression * > & designators ) {
177 if ( ! designators.empty() ) {
178 setPosition( designators.front() );
179 designators.pop_front();
180 memberIter->setPosition( designators );
181 }
182 }
183
184 virtual std::list<InitAlternative> operator*() const {
185 return first();
186 }
187
[f64d9bc]188 virtual operator bool() const { return ! isVLA && index < size; }
[e4d829b]189
190 virtual MemberIterator & bigStep() {
191 PRINT( std::cerr << "bigStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
192 ++index;
193 delete memberIter;
[f64d9bc]194 if ( ! isVLA && index < size ) memberIter = createMemberIterator( base );
[e4d829b]195 else memberIter = nullptr;
196 return *this;
197 }
198
199 virtual MemberIterator & smallStep() {
200 PRINT( std::cerr << "smallStep in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
201 if ( memberIter ) {
202 PRINT( std::cerr << "has member iter: " << *memberIter << std::endl; )
203 memberIter->smallStep();
204 if ( *memberIter ) {
205 PRINT( std::cerr << "has valid member iter" << std::endl; )
206 return *this;
207 }
208 }
209 return bigStep();
210 }
211
212 virtual Type * getType() { return array; }
213 virtual Type * getNext() { return base; }
214
215 virtual std::list<InitAlternative> first() const {
216 PRINT( std::cerr << "first in ArrayIterator (" << index << "/" << size << ")" << std::endl; )
217 if ( memberIter && *memberIter ) {
218 std::list<InitAlternative> ret = memberIter->first();
219 for ( InitAlternative & alt : ret ) {
220 alt.designation->get_designators().push_front( new ConstantExpr( Constant::from_ulong( index ) ) );
221 }
222 return ret;
223 }
224 return std::list<InitAlternative>();
225 }
226
227 virtual void print( std::ostream & out, Indenter indent ) const {
228 out << "ArrayIterator(Array of " << base << ")";
229 if ( memberIter ) {
230 Indenter childIndent = indent+1;
231 out << std::endl << childIndent;
232 memberIter->print( out, childIndent );
233 }
234 }
235
236 private:
237 ArrayType * array = nullptr;
238 Type * base = nullptr;
239 size_t index = 0;
240 size_t size = 0;
[f64d9bc]241 bool isVLA = true;
[e4d829b]242 MemberIterator * memberIter = nullptr;
243 };
244
245 class AggregateIterator : public MemberIterator {
246 public:
[62423350]247 typedef std::list<Declaration *> MemberList;
248 typedef MemberList::const_iterator iterator;
249 std::string kind = ""; // for debug
250 std::string name;
251 Type * inst = nullptr;
252 const MemberList & members;
[e4d829b]253 iterator curMember;
[62423350]254 bool atbegin = true; // false at first {small,big}Step -- this aggr type is only added to the possibilities at the beginning
[e4d829b]255 Type * curType = nullptr;
256 MemberIterator * memberIter = nullptr;
[62423350]257 mutable TypeSubstitution sub;
[e4d829b]258
[62423350]259 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]260 PRINT( std::cerr << "Creating " << kind << "(" << name << ")"; )
[e4d829b]261 init();
262 }
263
264 virtual ~AggregateIterator() {
265 delete memberIter;
266 }
267
268 bool init() {
[62423350]269 PRINT( std::cerr << "--init()--" << members.size() << std::endl; )
270 if ( curMember != members.end() ) {
[e4d829b]271 if ( ObjectDecl * field = dynamic_cast< ObjectDecl * >( *curMember ) ) {
272 PRINT( std::cerr << "incremented to field: " << field << std::endl; )
273 curType = field->get_type();
274 memberIter = createMemberIterator( curType );
275 return true;
276 }
277 }
278 return false;
279 }
280
281 virtual std::list<InitAlternative> operator*() const {
282 if (memberIter && *memberIter) {
283 std::list<InitAlternative> ret = memberIter->first();
[62423350]284 PRINT( std::cerr << "sub: " << sub << std::endl; )
[e4d829b]285 for ( InitAlternative & alt : ret ) {
286 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
[e3e16bc]287 alt.designation->get_designators().push_front( new VariableExpr( strict_dynamic_cast< ObjectDecl * >( *curMember ) ) );
[62423350]288 // need to substitute for generic types, so that casts are to concrete types
289 PRINT( std::cerr << " type is: " << alt.type; )
290 sub.apply( alt.type ); // also apply to designation??
291 PRINT( std::cerr << " ==> " << alt.type << std::endl; )
[e4d829b]292 }
293 return ret;
294 }
295 return std::list<InitAlternative>();
296 }
297
298 virtual void setPosition( std::list< Expression * > & designators ) {
299 if ( ! designators.empty() ) {
300 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr * >( designators.front() ) ) {
[62423350]301 for ( curMember = members.begin(); curMember != members.end(); ++curMember ) {
[e4d829b]302 if ( *curMember == varExpr->get_var() ) {
303 designators.pop_front();
304 delete memberIter;
305 memberIter = createMemberIterator( varExpr->get_result() );
306 curType = varExpr->get_result();
[62423350]307 atbegin = curMember == members.begin() && designators.empty(); // xxx - is this the right condition for atbegin??
[e4d829b]308 memberIter->setPosition( designators );
309 return;
310 } // if
311 } // for
[62423350]312 assertf( false, "could not find member in %s: %s", kind.c_str(), toString( varExpr ).c_str() );
[e4d829b]313 } else {
[62423350]314 assertf( false, "bad designator given to %s: %s", kind.c_str(), toString( designators.front() ).c_str() );
[e4d829b]315 } // if
316 } // if
317 }
318
319 virtual MemberIterator & smallStep() {
320 PRINT( std::cerr << "smallStep in " << kind << std::endl; )
321 atbegin = false;
322 if ( memberIter ) {
323 PRINT( std::cerr << "has member iter, incrementing..." << std::endl; )
324 memberIter->smallStep();
325 if ( *memberIter ) {
326 PRINT( std::cerr << "success!" << std::endl; )
327 return *this;
328 }
329 }
330 return bigStep();
331 }
332
333 virtual Type * getType() { return inst; }
334 virtual Type * getNext() {
335 if ( memberIter && *memberIter ) return memberIter->getType(); // xxx - ??? recursive call???
336 return nullptr;
337 }
338
339 virtual std::list<InitAlternative> first() const {
340 std::list<InitAlternative> ret;
341 PRINT( std::cerr << "first " << kind << std::endl; )
342 if ( memberIter && *memberIter ) { // might not need *memberIter??
343 PRINT( std::cerr << "adding children" << std::endl; )
344 ret = memberIter->first();
345 for ( InitAlternative & alt : ret ) {
346 PRINT( std::cerr << "iterating and adding designators" << std::endl; )
[e3e16bc]347 alt.designation->get_designators().push_front( new VariableExpr( strict_dynamic_cast< ObjectDecl * >( *curMember ) ) );
[e4d829b]348 }
349 }
350 // if ( curMember == std::next( decl->get_members().begin(), 1 ) ) { // xxx - this never triggers because curMember is incremented immediately on construction
351 if ( atbegin ) { // xxx - this never triggers because curMember is incremented immediately on construction
352 // xxx - what about case of empty struct??
353 // only add self if at the very beginning of the structure
354 PRINT( std::cerr << "adding self" << std::endl; )
355 ret.push_front( { inst->clone(), new Designation( {} ) } );
356 }
357 return ret;
358 }
359
360 virtual void print( std::ostream & out, Indenter indent ) const {
[62423350]361 out << kind << "(" << name << ")";
[e4d829b]362 if ( memberIter ) {
363 Indenter childIndent = indent+1;
364 out << std::endl << childIndent;
365 memberIter->print( out, childIndent );
366 }
367 }
368 };
369
370 class UnionIterator : public AggregateIterator {
371 public:
[62423350]372 UnionIterator( UnionInstType * inst ) : AggregateIterator( "UnionIterator", inst->get_name(), inst, inst->get_baseUnion()->get_members() ) {}
[e4d829b]373
374 virtual operator bool() const { return (memberIter && *memberIter); }
375 virtual MemberIterator & bigStep() {
376 // unions only initialize one member
377 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
378 atbegin = false;
379 delete memberIter;
380 memberIter = nullptr;
381 curType = nullptr;
[62423350]382 curMember = members.end();
[e4d829b]383 return *this;
384 }
385 virtual std::list<InitAlternative> first() const { return std::list<InitAlternative>{}; }
386 };
387
388 class StructIterator : public AggregateIterator {
389 public:
[62423350]390 StructIterator( StructInstType * inst ) : AggregateIterator( "StructIterator", inst->get_name(), inst, inst->get_baseStruct()->get_members() ) {}
391
392 virtual operator bool() const { return curMember != members.end() || (memberIter && *memberIter); }
393
394 virtual MemberIterator & bigStep() {
395 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
396 atbegin = false;
397 delete memberIter;
398 memberIter = nullptr;
399 curType = nullptr;
400 for ( ; curMember != members.end(); ) {
401 ++curMember;
402 if ( init() ) {
403 return *this;
404 }
405 }
406 return *this;
407 }
408 };
409
410 class TupleIterator : public AggregateIterator {
411 public:
412 TupleIterator( TupleType * inst ) : AggregateIterator( "TupleIterator", toString("Tuple", inst->size()), inst, inst->get_members() ) {}
[e4d829b]413
[62423350]414 virtual operator bool() const { return curMember != members.end() || (memberIter && *memberIter); }
[e4d829b]415
416 virtual MemberIterator & bigStep() {
417 PRINT( std::cerr << "bigStep in " << kind << std::endl; )
418 atbegin = false;
419 delete memberIter;
420 memberIter = nullptr;
421 curType = nullptr;
[62423350]422 for ( ; curMember != members.end(); ) {
[e4d829b]423 ++curMember;
424 if ( init() ) {
425 return *this;
426 }
427 }
428 return *this;
429 }
430 };
431
432 MemberIterator * createMemberIterator( Type * type ) {
433 if ( ReferenceToType * aggr = dynamic_cast< ReferenceToType * >( type ) ) {
434 if ( StructInstType * sit = dynamic_cast< StructInstType * >( aggr ) ) {
435 return new StructIterator( sit );
436 } else if ( UnionInstType * uit = dynamic_cast< UnionInstType * >( aggr ) ) {
437 return new UnionIterator( uit );
438 } else {
[62423350]439 assertf( dynamic_cast< TypeInstType * >( type ), "some other reftotype" );
440 return new SimpleIterator( type );
[e4d829b]441 }
442 } else if ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) {
443 return new ArrayIterator( at );
[62423350]444 } else if ( TupleType * tt = dynamic_cast< TupleType * >( type ) ) {
445 return new TupleIterator( tt );
[e4d829b]446 } else {
447 return new SimpleIterator( type );
448 }
449 }
450
451 CurrentObject::CurrentObject() {}
452 CurrentObject::CurrentObject( Type * type ) {
453 objStack.push( new SimpleIterator( type ) );
454 }
455
456
457 void CurrentObject::setNext( Designation * designation ) {
458 assertf( ! objStack.empty(), "obj stack empty in setNext" );
459 PRINT( std::cerr << "____setNext" << designation << std::endl; )
460 objStack.top()->setPosition( designation->get_designators() );
461 }
462
463 Designation * CurrentObject::findNext( Designation * designation ) {
464 typedef std::list< Expression * > DesignatorChain;
465 PRINT( std::cerr << "___findNext" << std::endl; )
466 // find all the d's
467 std::list<DesignatorChain> desigAlts{ { } }, newDesigAlts;
468 std::list<Type *> curTypes { (objStack.top())->getType() }, newTypes;
469 for ( Expression * expr : designation->get_designators() ) {
470 PRINT( std::cerr << "____untyped: " << expr << std::endl; )
471 std::list<DesignatorChain>::iterator dit = desigAlts.begin();
472 if ( NameExpr * nexpr = dynamic_cast<NameExpr *>(expr) ) {
473 for ( Type * t : curTypes ) {
474 assert( dit != desigAlts.end() );
475 DesignatorChain & d = *dit;
476 PRINT( std::cerr << "____actual: " << t << std::endl; )
477 ReferenceToType * refType = dynamic_cast<ReferenceToType *>(t);
478 std::list<Declaration *> members;
479 if ( refType ) {
480 refType->lookup( nexpr->get_name(), members ); // concatenate identical field name
481 // xxx - need to also include anonymous members in this somehow...
482 for ( Declaration * mem: members ) {
483 if ( ObjectDecl * field = dynamic_cast<ObjectDecl *>(mem) ) {
484 PRINT( std::cerr << "____alt: " << field->get_type() << std::endl; )
485 DesignatorChain newD = d;
486 newD.push_back( new VariableExpr( field ) );
487 newDesigAlts.push_back( newD );
488 newTypes.push_back( field->get_type() );
489 } // if
490 } // for
491 } // if
492 ++dit;
493 } // for
494 } else {
495 for ( Type * t : curTypes ) {
496 assert( dit != desigAlts.end() );
497 DesignatorChain & d = *dit;
498 if ( ArrayType * at = dynamic_cast< ArrayType * > ( t ) ) {
499 PRINT( std::cerr << "____alt: " << at->get_base() << std::endl; )
500 d.push_back( expr );
501 newDesigAlts.push_back( d );
502 newTypes.push_back( at->get_base() );
503 }
504 ++dit;
505 } // for
506 } // if
507 desigAlts = newDesigAlts;
508 newDesigAlts.clear();
509 curTypes = newTypes;
510 newTypes.clear();
[56e49b0]511 assertf( desigAlts.size() == curTypes.size(), "Designator alternatives (%zu) and current types (%zu) out of sync", desigAlts.size(), curTypes.size() );
[e4d829b]512 } // for
513 if ( desigAlts.size() > 1 ) {
514 throw SemanticError( toString("Too many alternatives (", desigAlts.size(), ") for designation: "), designation );
515 } else if ( desigAlts.size() == 0 ) {
516 throw SemanticError( "No reasonable alternatives for designation: ", designation );
517 }
518 DesignatorChain & d = desigAlts.back();
519 PRINT( for ( Expression * expr : d ) {
520 std::cerr << "____desig: " << expr << std::endl;
521 } ) // for
522 assertf( ! curTypes.empty(), "empty designator chosen");
523
524 // set new designators
525 assertf( ! objStack.empty(), "empty object stack when setting designation" );
526 Designation * actualDesignation = new Designation( d );
527 objStack.top()->setPosition( d ); // destroys d
528 return actualDesignation;
529 }
530
531 void CurrentObject::increment() {
532 PRINT( std::cerr << "____increment" << std::endl; )
533 if ( ! objStack.empty() ) {
534 PRINT( std::cerr << *objStack.top() << std::endl; )
535 objStack.top()->smallStep();
536 }
537 }
538
539 void CurrentObject::enterListInit() {
540 PRINT( std::cerr << "____entering list init" << std::endl; )
541 assertf( ! objStack.empty(), "empty obj stack entering list init" );
542 Type * type = objStack.top()->getNext();
543 if ( type ) {
544 objStack.push( createMemberIterator( type ) );
545 } else {
546 assertf( false, "not sure about this case..." );
547 }
548 }
549
550 void CurrentObject::exitListInit() {
551 PRINT( std::cerr << "____exiting list init" << std::endl; )
552 assertf( ! objStack.empty(), "objstack empty" );
553 delete objStack.top();
554 objStack.pop();
555 if ( ! objStack.empty() ) {
556 PRINT( std::cerr << *objStack.top() << std::endl; )
557 objStack.top()->bigStep();
558 }
559 }
560
561 std::list< InitAlternative > CurrentObject::getOptions() {
562 PRINT( std::cerr << "____getting current options" << std::endl; )
563 assertf( ! objStack.empty(), "objstack empty in getOptions" );
564 return **objStack.top();
565 }
[62423350]566
567 Type * CurrentObject::getCurrentType() {
568 PRINT( std::cerr << "____getting current type" << std::endl; )
569 assertf( ! objStack.empty(), "objstack empty in getCurrentType" );
570 return objStack.top()->getNext();
571 }
[e4d829b]572} // namespace ResolvExpr
573
574// Local Variables: //
575// tab-width: 4 //
576// mode: c++ //
577// compile-command: "make install" //
578// End: //
Note: See TracBrowser for help on using the repository browser.