source: src/ResolvExpr/CurrentObject.cc@ 5684736

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 5684736 was 2b59f55, checked in by Aaron Moss <a3moss@…>, 6 years ago

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