source: src/AST/Pass.impl.hpp@ f30be51f

Last change on this file since f30be51f was 85855b0, checked in by JiadaL <j82liang@…>, 17 months ago
  1. Implement enum cast; 2. Change valueE so that opague enum returns quasi_void; 3. change enum hiding interpretation and pass visiting scheme
  • Property mode set to 100644
File size: 62.2 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2019 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// ast::Pass.impl.hpp --
8//
9// Author : Thierry Delisle
10// Created On : Thu May 09 15::37::05 2019
11// Last Modified By :
12// Last Modified On :
13// Update Count :
14//
15
16#pragma once
17// IWYU pragma: private, include "AST/Pass.hpp"
18
19#include <type_traits>
20#include <unordered_map>
21
22#include "AST/Copy.hpp"
23#include "AST/TranslationUnit.hpp"
24#include "AST/TypeSubstitution.hpp"
25
26#define VISIT_START( node ) \
27 using namespace ast; \
28 /* back-up the last known code location */ \
29 __attribute__((unused)) auto guard0 = __pass::make_location_guard( core, node, 0 ); \
30 /* back-up the visit children */ \
31 __attribute__((unused)) auto guard1 = __pass::make_visit_children_guard( core, 0 ); \
32 /* setup the scope for passes that want to run code at exit */ \
33 __attribute__((unused)) auto guard2 = __pass::make_value_guard( core, 0 ); \
34 /* begin tracing memory allocation if requested by this pass */ \
35 __pass::beginTrace( core, 0 ); \
36 /* call the implementation of the previsit of this pass */ \
37 __pass::previsit( core, node, 0 );
38
39#define VISIT_END( type, node ) \
40 /* call the implementation of the postvisit of this pass */ \
41 auto __return = __pass::postvisit( core, node, 0 ); \
42 assertf(__return, "post visit should never return null"); \
43 /* end tracing memory allocation if requested by this pass */ \
44 __pass::endTrace( core, 0 ); \
45 return __return;
46
47#ifdef PEDANTIC_PASS_ASSERT
48#define __pedantic_pass_assert(...) assert(__VA_ARGS__)
49#define __pedantic_pass_assertf(...) assertf(__VA_ARGS__)
50#else
51#define __pedantic_pass_assert(...)
52#define __pedantic_pass_assertf(...)
53#endif
54
55namespace ast::__pass {
56 // Check if this is either a null pointer or a pointer to an empty container
57 template<typename T>
58 static inline bool empty( T * ptr ) {
59 return !ptr || ptr->empty();
60 }
61
62 template< typename core_t, typename node_t >
63 static inline node_t* mutate(const node_t *node) {
64 return std::is_base_of<PureVisitor, core_t>::value ? ::ast::shallowCopy(node) : ::ast::mutate(node);
65 }
66
67 //------------------------------
68 template<typename it_t, template <class...> class container_t>
69 static inline void take_all( it_t it, container_t<ast::ptr<ast::Decl>> * decls, bool * mutated = nullptr ) {
70 if ( empty( decls ) ) return;
71
72 std::transform(decls->begin(), decls->end(), it, [](const ast::Decl * decl) -> auto {
73 return new DeclStmt( decl->location, decl );
74 });
75 decls->clear();
76 if ( mutated ) *mutated = true;
77 }
78
79 template<typename it_t, template <class...> class container_t>
80 static inline void take_all( it_t it, container_t<ast::ptr<ast::Stmt>> * stmts, bool * mutated = nullptr ) {
81 if ( empty( stmts ) ) return;
82
83 std::move(stmts->begin(), stmts->end(), it);
84 stmts->clear();
85 if ( mutated ) *mutated = true;
86 }
87
88 //------------------------------
89 /// Check if should be skipped, different for pointers and containers
90 template<typename node_t>
91 bool skip( const ast::ptr<node_t> & val ) {
92 return !val;
93 }
94
95 template< template <class...> class container_t, typename node_t >
96 bool skip( const container_t<ast::ptr< node_t >> & val ) {
97 return val.empty();
98 }
99
100 //------------------------------
101 /// Get the value to visit, different for pointers and containers
102 template<typename node_t>
103 auto get( const ast::ptr<node_t> & val, int ) -> decltype(val.get()) {
104 return val.get();
105 }
106
107 template<typename node_t>
108 const node_t & get( const node_t & val, long ) {
109 return val;
110 }
111}
112
113template< typename core_t >
114template< typename node_t >
115auto ast::Pass< core_t >::call_accept( const node_t * node ) ->
116 ast::Pass< core_t >::call_accept_result_t<node_t> {
117 __pedantic_pass_assert( __visit_children() );
118 __pedantic_pass_assert( node );
119
120 auto nval = node->accept( *this );
121 return { nval != node, nval };
122}
123
124template< typename core_t >
125ast::__pass::template result1<ast::Expr> ast::Pass< core_t >::call_accept_top( const ast::Expr * expr ) {
126 __pedantic_pass_assert( __visit_children() );
127 __pedantic_pass_assert( expr );
128
129 const ast::TypeSubstitution ** typeSubs_ptr = __pass::typeSubs( core, 0 );
130 if ( typeSubs_ptr && expr->env ) {
131 *typeSubs_ptr = expr->env;
132 }
133
134 auto nval = expr->accept( *this );
135 return { nval != expr, nval };
136}
137
138template< typename core_t >
139ast::__pass::template result1<ast::Stmt> ast::Pass< core_t >::call_accept_as_compound( const ast::Stmt * stmt ) {
140 __pedantic_pass_assert( __visit_children() );
141 __pedantic_pass_assert( stmt );
142
143 // add a few useful symbols to the scope
144 using __pass::empty;
145
146 // get the stmts/decls that will need to be spliced in
147 auto stmts_before = __pass::stmtsToAddBefore( core, 0 );
148 auto stmts_after = __pass::stmtsToAddAfter ( core, 0 );
149 auto decls_before = __pass::declsToAddBefore( core, 0 );
150 auto decls_after = __pass::declsToAddAfter ( core, 0 );
151
152 // These may be modified by subnode but most be restored once we exit this statemnet.
153 ValueGuardPtr< const ast::TypeSubstitution * > __old_env ( __pass::typeSubs( core, 0 ) );
154 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_before) >::type > __old_decls_before( stmts_before );
155 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_after ) >::type > __old_decls_after ( stmts_after );
156 ValueGuardPtr< typename std::remove_pointer< decltype(decls_before) >::type > __old_stmts_before( decls_before );
157 ValueGuardPtr< typename std::remove_pointer< decltype(decls_after ) >::type > __old_stmts_after ( decls_after );
158
159 // Now is the time to actually visit the node
160 const ast::Stmt * nstmt = stmt->accept( *this );
161
162 // If the pass doesn't want to add anything then we are done
163 if ( empty(stmts_before) && empty(stmts_after) && empty(decls_before) && empty(decls_after) ) {
164 return { nstmt != stmt, nstmt };
165 }
166
167 // Make sure that it is either adding statements or declartions but not both
168 // this is because otherwise the order would be awkward to predict
169 assert(( empty( stmts_before ) && empty( stmts_after ))
170 || ( empty( decls_before ) && empty( decls_after )) );
171
172 // Create a new Compound Statement to hold the new decls/stmts
173 ast::CompoundStmt * compound = new ast::CompoundStmt( stmt->location );
174
175 // Take all the declarations that go before
176 __pass::take_all( std::back_inserter( compound->kids ), decls_before );
177 __pass::take_all( std::back_inserter( compound->kids ), stmts_before );
178
179 // Insert the original declaration
180 compound->kids.emplace_back( nstmt );
181
182 // Insert all the declarations that go before
183 __pass::take_all( std::back_inserter( compound->kids ), decls_after );
184 __pass::take_all( std::back_inserter( compound->kids ), stmts_after );
185
186 return { true, compound };
187}
188
189template< typename core_t >
190template< template <class...> class container_t >
191ast::__pass::template resultNstmt<container_t> ast::Pass< core_t >::call_accept( const container_t< ptr<Stmt> > & statements ) {
192 __pedantic_pass_assert( __visit_children() );
193 __pedantic_pass_assert( !statements.empty() );
194
195 // We are going to aggregate errors for all these statements
196 SemanticErrorException errors;
197
198 // add a few useful symbols to the scope
199 using __pass::empty;
200
201 // get the stmts/decls that will need to be spliced in
202 auto stmts_before = __pass::stmtsToAddBefore( core, 0 );
203 auto stmts_after = __pass::stmtsToAddAfter ( core, 0 );
204 auto decls_before = __pass::declsToAddBefore( core, 0 );
205 auto decls_after = __pass::declsToAddAfter ( core, 0 );
206
207 // These may be modified by subnode but most be restored once we exit this statemnet.
208 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_before) >::type > __old_decls_before( stmts_before );
209 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_after ) >::type > __old_decls_after ( stmts_after );
210 ValueGuardPtr< typename std::remove_pointer< decltype(decls_before) >::type > __old_stmts_before( decls_before );
211 ValueGuardPtr< typename std::remove_pointer< decltype(decls_after ) >::type > __old_stmts_after ( decls_after );
212
213 // update pass statitistics
214 pass_visitor_stats.depth++;
215 pass_visitor_stats.max->push(pass_visitor_stats.depth);
216 pass_visitor_stats.avg->push(pass_visitor_stats.depth);
217
218 __pass::resultNstmt<container_t> new_kids;
219 for ( auto value : enumerate( statements ) ) {
220 try {
221 size_t i = value.idx;
222 const Stmt * stmt = value.val;
223 __pedantic_pass_assert( stmt );
224 const ast::Stmt * new_stmt = stmt->accept( *this );
225 assert( new_stmt );
226
227 // Make sure that it is either adding statements or declartions but not both
228 // this is because otherwise the order would be awkward to predict
229 assert(( empty( stmts_before ) && empty( stmts_after ))
230 || ( empty( decls_before ) && empty( decls_after )) );
231
232 // Take all the statements which should have gone after, N/A for first iteration
233 new_kids.take_all( decls_before );
234 new_kids.take_all( stmts_before );
235
236 // Now add the statement if there is one
237 if ( new_stmt != stmt ) {
238 new_kids.differs = true;
239 new_kids.values.emplace_back( new_stmt );
240 } else {
241 new_kids.values.emplace_back( i );
242 }
243
244 // Take all the declarations that go before
245 new_kids.take_all( decls_after );
246 new_kids.take_all( stmts_after );
247 } catch ( SemanticErrorException &e ) {
248 errors.append( e );
249 }
250 }
251 pass_visitor_stats.depth--;
252 if ( !errors.isEmpty() ) { throw errors; }
253
254 return new_kids;
255}
256
257template< typename core_t >
258template< template <class...> class container_t, typename node_t >
259ast::__pass::template resultN<container_t, node_t> ast::Pass< core_t >::call_accept( const container_t< ast::ptr<node_t> > & container ) {
260 __pedantic_pass_assert( __visit_children() );
261 __pedantic_pass_assert( !container.empty() );
262
263 // Collect errors from processing all these nodes.
264 SemanticErrorException errors;
265
266 pass_visitor_stats.depth++;
267 pass_visitor_stats.max->push(pass_visitor_stats.depth);
268 pass_visitor_stats.avg->push(pass_visitor_stats.depth);
269
270 bool mutated = false;
271 container_t<ptr<node_t>> new_kids;
272 for ( const node_t * node : container ) {
273 try {
274 __pedantic_pass_assert( node );
275 const node_t * new_stmt = strict_dynamic_cast< const node_t * >( node->accept( *this ) );
276 if ( new_stmt != node ) {
277 mutated = true;
278 new_kids.emplace_back( new_stmt );
279 } else {
280 new_kids.emplace_back( nullptr );
281 }
282 } catch ( SemanticErrorException &e ) {
283 errors.append( e );
284 }
285 }
286
287 __pedantic_pass_assert( new_kids.size() == container.size() );
288 pass_visitor_stats.depth--;
289 if ( !errors.isEmpty() ) { throw errors; }
290
291 return ast::__pass::resultN<container_t, node_t>{ mutated, new_kids };
292}
293
294template< typename core_t >
295template<typename node_t, typename super_t, typename field_t>
296void ast::Pass< core_t >::maybe_accept(
297 const node_t * & parent,
298 field_t super_t::*field
299) {
300 static_assert( std::is_base_of<super_t, node_t>::value, "Error deducing member object" );
301
302 if ( __pass::skip( parent->*field ) ) return;
303 const auto & old_val = __pass::get(parent->*field, 0);
304
305 static_assert( !std::is_same<const ast::Node * &, decltype(old_val)>::value, "ERROR" );
306
307 auto result = call_accept( old_val );
308 if ( result.differs ) {
309 auto new_parent = __pass::mutate<core_t>(parent);
310 result.apply( new_parent, field );
311 parent = new_parent;
312 }
313}
314
315template< typename core_t >
316template<typename node_t, typename super_t, typename field_t>
317void ast::Pass< core_t >::maybe_accept_top(
318 const node_t * & parent,
319 field_t super_t::*field
320) {
321 static_assert( std::is_base_of<super_t, node_t>::value, "Error deducing member object" );
322
323 if ( __pass::skip( parent->*field ) ) return;
324 const auto & old_val = __pass::get(parent->*field, 0);
325
326 static_assert( !std::is_same<const ast::Node * &, decltype(old_val)>::value, "ERROR" );
327
328 auto result = call_accept_top( old_val );
329 if ( result.differs ) {
330 auto new_parent = __pass::mutate<core_t>(parent);
331 result.apply( new_parent, field );
332 parent = new_parent;
333 }
334}
335
336template< typename core_t >
337template<typename node_t, typename super_t, typename field_t>
338void ast::Pass< core_t >::maybe_accept_as_compound(
339 const node_t * & parent,
340 field_t super_t::*child
341) {
342 static_assert( std::is_base_of<super_t, node_t>::value, "Error deducing member object" );
343
344 if ( __pass::skip( parent->*child ) ) return;
345 const auto & old_val = __pass::get(parent->*child, 0);
346
347 static_assert( !std::is_same<const ast::Node * &, decltype(old_val)>::value, "ERROR" );
348
349 auto result = call_accept_as_compound( old_val );
350 if ( result.differs ) {
351 auto new_parent = __pass::mutate<core_t>(parent);
352 result.apply( new_parent, child );
353 parent = new_parent;
354 }
355}
356
357//------------------------------------------------------------------------------------------------------------------------------------------------------------------------
358//========================================================================================================================================================================
359//========================================================================================================================================================================
360//========================================================================================================================================================================
361//========================================================================================================================================================================
362//========================================================================================================================================================================
363//------------------------------------------------------------------------------------------------------------------------------------------------------------------------
364
365template< typename core_t >
366inline void ast::accept_all( std::list< ast::ptr<ast::Decl> > & decls, ast::Pass< core_t > & visitor ) {
367 // We are going to aggregate errors for all these statements
368 SemanticErrorException errors;
369
370 // add a few useful symbols to the scope
371 using __pass::empty;
372
373 // get the stmts/decls that will need to be spliced in
374 auto decls_before = __pass::declsToAddBefore( visitor.core, 0);
375 auto decls_after = __pass::declsToAddAfter ( visitor.core, 0);
376
377 // update pass statitistics
378 pass_visitor_stats.depth++;
379 pass_visitor_stats.max->push(pass_visitor_stats.depth);
380 pass_visitor_stats.avg->push(pass_visitor_stats.depth);
381
382 for ( std::list< ast::ptr<ast::Decl> >::iterator i = decls.begin(); ; ++i ) {
383 // splice in new declarations after previous decl
384 if ( !empty( decls_after ) ) { decls.splice( i, *decls_after ); }
385
386 if ( i == decls.end() ) break;
387
388 try {
389 // run visitor on declaration
390 ast::ptr<ast::Decl> & node = *i;
391 assert( node );
392 node = node->accept( visitor );
393 }
394 catch( SemanticErrorException &e ) {
395 if (__pass::on_error (visitor.core, *i, 0))
396 errors.append( e );
397 }
398
399 // splice in new declarations before current decl
400 if ( !empty( decls_before ) ) { decls.splice( i, *decls_before ); }
401 }
402 pass_visitor_stats.depth--;
403 if ( !errors.isEmpty() ) { throw errors; }
404}
405
406template< typename core_t >
407inline void ast::accept_all( ast::TranslationUnit & unit, ast::Pass< core_t > & visitor ) {
408 if ( auto ptr = __pass::translationUnit( visitor.core, 0 ) ) {
409 ValueGuard<const TranslationUnit *> guard( *ptr );
410 *ptr = &unit;
411 return ast::accept_all( unit.decls, visitor );
412 } else {
413 return ast::accept_all( unit.decls, visitor );
414 }
415}
416
417// A NOTE ON THE ORDER OF TRAVERSAL
418//
419// Types and typedefs have their base types visited before they are added to the type table. This is ok, since there is
420// no such thing as a recursive type or typedef.
421//
422// typedef struct { T *x; } T; // never allowed
423//
424// for structs/unions, it is possible to have recursion, so the decl should be added as if it's incomplete to begin, the
425// members are traversed, and then the complete type should be added (assuming the type is completed by this particular
426// declaration).
427//
428// struct T { struct T *x; }; // allowed
429//
430// It is important to add the complete type to the symbol table *after* the members/base has been traversed, since that
431// traversal may modify the definition of the type and these modifications should be visible when the symbol table is
432// queried later in this pass.
433
434//--------------------------------------------------------------------------
435// ObjectDecl
436template< typename core_t >
437const ast::DeclWithType * ast::Pass< core_t >::visit( const ast::ObjectDecl * node ) {
438 VISIT_START( node );
439
440 if ( __visit_children() ) {
441 {
442 guard_symtab guard { *this };
443 maybe_accept( node, &ObjectDecl::type );
444 }
445 maybe_accept( node, &ObjectDecl::init );
446 maybe_accept( node, &ObjectDecl::bitfieldWidth );
447 maybe_accept( node, &ObjectDecl::attributes );
448 }
449
450 __pass::symtab::addId( core, 0, node );
451
452 VISIT_END( DeclWithType, node );
453}
454
455//--------------------------------------------------------------------------
456// FunctionDecl
457template< typename core_t >
458const ast::DeclWithType * ast::Pass< core_t >::visit( const ast::FunctionDecl * node ) {
459 VISIT_START( node );
460
461 __pass::symtab::addId( core, 0, node );
462
463 if ( __visit_children() ) {
464 maybe_accept( node, &FunctionDecl::withExprs );
465 }
466 {
467 // with clause introduces a level of scope (for the with expression members).
468 // with clause exprs are added to the symbol table before parameters so that parameters
469 // shadow with exprs and not the other way around.
470 guard_symtab guard { *this };
471 __pass::symtab::addWith( core, 0, node->withExprs, node );
472 {
473 guard_symtab guard { *this };
474 // implicit add __func__ identifier as specified in the C manual 6.4.2.2
475 // This is a C name and so has C linkage.
476 static ast::ptr< ast::ObjectDecl > func{ new ast::ObjectDecl{
477 CodeLocation{}, "__func__",
478 new ast::ArrayType{
479 new ast::BasicType{ ast::BasicKind::Char, ast::CV::Const },
480 nullptr, VariableLen, DynamicDim
481 },
482 nullptr,
483 ast::Storage::Classes(),
484 ast::Linkage::C,
485 } };
486 __pass::symtab::addId( core, 0, func );
487 if ( __visit_children() ) {
488 maybe_accept( node, &FunctionDecl::type_params );
489 maybe_accept( node, &FunctionDecl::assertions );
490 maybe_accept( node, &FunctionDecl::params );
491 maybe_accept( node, &FunctionDecl::returns );
492 maybe_accept( node, &FunctionDecl::type );
493 maybe_accept( node, &FunctionDecl::attributes );
494 // First remember that we are now within a function.
495 ValueGuard< bool > oldInFunction( inFunction );
496 inFunction = true;
497 // The function body needs to have the same scope as parameters.
498 // A CompoundStmt will not enter a new scope if atFunctionTop is true.
499 ValueGuard< bool > oldAtFunctionTop( atFunctionTop );
500 atFunctionTop = true;
501 maybe_accept( node, &FunctionDecl::stmts );
502 }
503 }
504 }
505
506 VISIT_END( DeclWithType, node );
507}
508
509//--------------------------------------------------------------------------
510// StructDecl
511template< typename core_t >
512const ast::Decl * ast::Pass< core_t >::visit( const ast::StructDecl * node ) {
513 VISIT_START( node );
514
515 // make up a forward declaration and add it before processing the members
516 // needs to be on the heap because addStruct saves the pointer
517 __pass::symtab::addStructFwd( core, 0, node );
518
519 if ( __visit_children() ) {
520 guard_symtab guard { * this };
521 maybe_accept( node, &StructDecl::params );
522 maybe_accept( node, &StructDecl::members );
523 maybe_accept( node, &StructDecl::attributes );
524 }
525
526 // this addition replaces the forward declaration
527 __pass::symtab::addStruct( core, 0, node );
528
529 VISIT_END( Decl, node );
530}
531
532//--------------------------------------------------------------------------
533// UnionDecl
534template< typename core_t >
535const ast::Decl * ast::Pass< core_t >::visit( const ast::UnionDecl * node ) {
536 VISIT_START( node );
537
538 // make up a forward declaration and add it before processing the members
539 __pass::symtab::addUnionFwd( core, 0, node );
540
541 if ( __visit_children() ) {
542 guard_symtab guard { * this };
543 maybe_accept( node, &UnionDecl::params );
544 maybe_accept( node, &UnionDecl::members );
545 maybe_accept( node, &UnionDecl::attributes );
546 }
547
548 __pass::symtab::addUnion( core, 0, node );
549
550 VISIT_END( Decl, node );
551}
552
553//--------------------------------------------------------------------------
554// EnumDecl
555template< typename core_t >
556const ast::Decl * ast::Pass< core_t >::visit( const ast::EnumDecl * node ) {
557 VISIT_START( node );
558
559 __pass::symtab::addEnum( core, 0, node );
560
561 if ( __visit_children() ) {
562 maybe_accept( node, &EnumDecl::base );
563 maybe_accept( node, &EnumDecl::params );
564 maybe_accept( node, &EnumDecl::members );
565 maybe_accept( node, &EnumDecl::attributes );
566 maybe_accept( node, &EnumDecl::inlinedDecl );
567 }
568
569 VISIT_END( Decl, node );
570}
571
572//--------------------------------------------------------------------------
573// TraitDecl
574template< typename core_t >
575const ast::Decl * ast::Pass< core_t >::visit( const ast::TraitDecl * node ) {
576 VISIT_START( node );
577
578 if ( __visit_children() ) {
579 guard_symtab guard { *this };
580 maybe_accept( node, &TraitDecl::params );
581 maybe_accept( node, &TraitDecl::members );
582 maybe_accept( node, &TraitDecl::attributes );
583 }
584
585 __pass::symtab::addTrait( core, 0, node );
586
587 VISIT_END( Decl, node );
588}
589
590//--------------------------------------------------------------------------
591// TypeDecl
592template< typename core_t >
593const ast::Decl * ast::Pass< core_t >::visit( const ast::TypeDecl * node ) {
594 VISIT_START( node );
595
596 if ( __visit_children() ) {
597 guard_symtab guard { *this };
598 maybe_accept( node, &TypeDecl::base );
599 }
600
601 // see A NOTE ON THE ORDER OF TRAVERSAL, above
602 // note that assertions come after the type is added to the symtab, since they are not part of the type proper
603 // and may depend on the type itself
604 __pass::symtab::addType( core, 0, node );
605
606 if ( __visit_children() ) {
607 maybe_accept( node, &TypeDecl::assertions );
608
609 {
610 guard_symtab guard { *this };
611 maybe_accept( node, &TypeDecl::init );
612 }
613 }
614
615 VISIT_END( Decl, node );
616}
617
618//--------------------------------------------------------------------------
619// TypedefDecl
620template< typename core_t >
621const ast::Decl * ast::Pass< core_t >::visit( const ast::TypedefDecl * node ) {
622 VISIT_START( node );
623
624 if ( __visit_children() ) {
625 guard_symtab guard { *this };
626 maybe_accept( node, &TypedefDecl::base );
627 }
628
629 __pass::symtab::addType( core, 0, node );
630
631 if ( __visit_children() ) {
632 maybe_accept( node, &TypedefDecl::assertions );
633 }
634
635 VISIT_END( Decl, node );
636}
637
638//--------------------------------------------------------------------------
639// AsmDecl
640template< typename core_t >
641const ast::AsmDecl * ast::Pass< core_t >::visit( const ast::AsmDecl * node ) {
642 VISIT_START( node );
643
644 if ( __visit_children() ) {
645 maybe_accept( node, &AsmDecl::stmt );
646 }
647
648 VISIT_END( AsmDecl, node );
649}
650
651//--------------------------------------------------------------------------
652// DirectiveDecl
653template< typename core_t >
654const ast::DirectiveDecl * ast::Pass< core_t >::visit( const ast::DirectiveDecl * node ) {
655 VISIT_START( node );
656
657 if ( __visit_children() ) {
658 maybe_accept( node, &DirectiveDecl::stmt );
659 }
660
661 VISIT_END( DirectiveDecl, node );
662}
663
664//--------------------------------------------------------------------------
665// StaticAssertDecl
666template< typename core_t >
667const ast::StaticAssertDecl * ast::Pass< core_t >::visit( const ast::StaticAssertDecl * node ) {
668 VISIT_START( node );
669
670 if ( __visit_children() ) {
671 maybe_accept_top( node, &StaticAssertDecl::cond );
672 maybe_accept( node, &StaticAssertDecl::msg );
673 }
674
675 VISIT_END( StaticAssertDecl, node );
676}
677
678//--------------------------------------------------------------------------
679// InlineMemberDecl
680template< typename core_t >
681const ast::DeclWithType * ast::Pass< core_t >::visit( const ast::InlineMemberDecl * node ) {
682 VISIT_START( node );
683
684 if ( __visit_children() ) {
685 {
686 guard_symtab guard { *this };
687 maybe_accept( node, &InlineMemberDecl::type );
688 }
689 }
690
691 VISIT_END( DeclWithType, node );
692}
693
694//--------------------------------------------------------------------------
695// CompoundStmt
696template< typename core_t >
697const ast::CompoundStmt * ast::Pass< core_t >::visit( const ast::CompoundStmt * node ) {
698 VISIT_START( node );
699
700 if ( __visit_children() ) {
701 // Do not enter (or leave) a new symbol table scope if atFunctionTop.
702 // But always enter (and leave) a new general scope.
703 if ( atFunctionTop ) {
704 ValueGuard< bool > guard1( atFunctionTop );
705 atFunctionTop = false;
706 guard_scope guard2( *this );
707 maybe_accept( node, &CompoundStmt::kids );
708 } else {
709 guard_symtab guard1( *this );
710 guard_scope guard2( *this );
711 maybe_accept( node, &CompoundStmt::kids );
712 }
713 }
714
715 VISIT_END( CompoundStmt, node );
716}
717
718//--------------------------------------------------------------------------
719// ExprStmt
720template< typename core_t >
721const ast::Stmt * ast::Pass< core_t >::visit( const ast::ExprStmt * node ) {
722 VISIT_START( node );
723
724 if ( __visit_children() ) {
725 maybe_accept_top( node, &ExprStmt::expr );
726 }
727
728 VISIT_END( Stmt, node );
729}
730
731//--------------------------------------------------------------------------
732// AsmStmt
733template< typename core_t >
734const ast::Stmt * ast::Pass< core_t >::visit( const ast::AsmStmt * node ) {
735 VISIT_START( node )
736
737 if ( __visit_children() ) {
738 maybe_accept( node, &AsmStmt::instruction );
739 maybe_accept( node, &AsmStmt::output );
740 maybe_accept( node, &AsmStmt::input );
741 maybe_accept( node, &AsmStmt::clobber );
742 }
743
744 VISIT_END( Stmt, node );
745}
746
747//--------------------------------------------------------------------------
748// DirectiveStmt
749template< typename core_t >
750const ast::Stmt * ast::Pass< core_t >::visit( const ast::DirectiveStmt * node ) {
751 VISIT_START( node )
752
753 VISIT_END( Stmt, node );
754}
755
756//--------------------------------------------------------------------------
757// IfStmt
758template< typename core_t >
759const ast::Stmt * ast::Pass< core_t >::visit( const ast::IfStmt * node ) {
760 VISIT_START( node );
761
762 if ( __visit_children() ) {
763 // if statements introduce a level of scope (for the initialization)
764 guard_symtab guard { *this };
765 maybe_accept( node, &IfStmt::inits );
766 maybe_accept_top( node, &IfStmt::cond );
767 maybe_accept_as_compound( node, &IfStmt::then );
768 maybe_accept_as_compound( node, &IfStmt::else_ );
769 }
770
771 VISIT_END( Stmt, node );
772}
773
774//--------------------------------------------------------------------------
775// WhileDoStmt
776template< typename core_t >
777const ast::Stmt * ast::Pass< core_t >::visit( const ast::WhileDoStmt * node ) {
778 VISIT_START( node );
779
780 if ( __visit_children() ) {
781 // while statements introduce a level of scope (for the initialization)
782 guard_symtab guard { *this };
783 maybe_accept( node, &WhileDoStmt::inits );
784 maybe_accept_top( node, &WhileDoStmt::cond );
785 maybe_accept_as_compound( node, &WhileDoStmt::body );
786 }
787
788 VISIT_END( Stmt, node );
789}
790
791//--------------------------------------------------------------------------
792// ForStmt
793template< typename core_t >
794const ast::Stmt * ast::Pass< core_t >::visit( const ast::ForStmt * node ) {
795 VISIT_START( node );
796
797 if ( __visit_children() ) {
798 // for statements introduce a level of scope (for the initialization)
799 guard_symtab guard { *this };
800 // xxx - old ast does not create WithStmtsToAdd scope for loop inits. should revisit this later.
801 maybe_accept( node, &ForStmt::inits );
802 maybe_accept_top( node, &ForStmt::cond );
803 maybe_accept_top( node, &ForStmt::inc );
804 maybe_accept_as_compound( node, &ForStmt::body );
805 }
806
807 VISIT_END( Stmt, node );
808}
809
810//--------------------------------------------------------------------------
811// SwitchStmt
812template< typename core_t >
813const ast::Stmt * ast::Pass< core_t >::visit( const ast::SwitchStmt * node ) {
814 VISIT_START( node );
815
816 if ( __visit_children() ) {
817 maybe_accept_top( node, &SwitchStmt::cond );
818 maybe_accept( node, &SwitchStmt::cases );
819 }
820
821 VISIT_END( Stmt, node );
822}
823
824//--------------------------------------------------------------------------
825// CaseClause
826template< typename core_t >
827const ast::CaseClause * ast::Pass< core_t >::visit( const ast::CaseClause * node ) {
828 VISIT_START( node );
829
830 if ( __visit_children() ) {
831 maybe_accept_top( node, &CaseClause::cond );
832 maybe_accept( node, &CaseClause::stmts );
833 }
834
835 VISIT_END( CaseClause, node );
836}
837
838//--------------------------------------------------------------------------
839// BranchStmt
840template< typename core_t >
841const ast::Stmt * ast::Pass< core_t >::visit( const ast::BranchStmt * node ) {
842 VISIT_START( node );
843 VISIT_END( Stmt, node );
844}
845
846//--------------------------------------------------------------------------
847// ReturnStmt
848template< typename core_t >
849const ast::Stmt * ast::Pass< core_t >::visit( const ast::ReturnStmt * node ) {
850 VISIT_START( node );
851
852 if ( __visit_children() ) {
853 maybe_accept_top( node, &ReturnStmt::expr );
854 }
855
856 VISIT_END( Stmt, node );
857}
858
859//--------------------------------------------------------------------------
860// ThrowStmt
861template< typename core_t >
862const ast::Stmt * ast::Pass< core_t >::visit( const ast::ThrowStmt * node ) {
863 VISIT_START( node );
864
865 if ( __visit_children() ) {
866 maybe_accept( node, &ThrowStmt::expr );
867 maybe_accept( node, &ThrowStmt::target );
868 }
869
870 VISIT_END( Stmt, node );
871}
872
873//--------------------------------------------------------------------------
874// TryStmt
875template< typename core_t >
876const ast::Stmt * ast::Pass< core_t >::visit( const ast::TryStmt * node ) {
877 VISIT_START( node );
878
879 if ( __visit_children() ) {
880 maybe_accept( node, &TryStmt::body );
881 maybe_accept( node, &TryStmt::handlers );
882 maybe_accept( node, &TryStmt::finally );
883 }
884
885 VISIT_END( Stmt, node );
886}
887
888//--------------------------------------------------------------------------
889// CatchClause
890template< typename core_t >
891const ast::CatchClause * ast::Pass< core_t >::visit( const ast::CatchClause * node ) {
892 VISIT_START( node );
893
894 if ( __visit_children() ) {
895 // catch statements introduce a level of scope (for the caught exception)
896 guard_symtab guard { *this };
897 maybe_accept( node, &CatchClause::decl );
898 maybe_accept_top( node, &CatchClause::cond );
899 maybe_accept_as_compound( node, &CatchClause::body );
900 }
901
902 VISIT_END( CatchClause, node );
903}
904
905//--------------------------------------------------------------------------
906// FinallyClause
907template< typename core_t >
908const ast::FinallyClause * ast::Pass< core_t >::visit( const ast::FinallyClause * node ) {
909 VISIT_START( node );
910
911 if ( __visit_children() ) {
912 maybe_accept( node, &FinallyClause::body );
913 }
914
915 VISIT_END( FinallyClause, node );
916}
917
918//--------------------------------------------------------------------------
919// FinallyStmt
920template< typename core_t >
921const ast::Stmt * ast::Pass< core_t >::visit( const ast::SuspendStmt * node ) {
922 VISIT_START( node );
923
924 if ( __visit_children() ) {
925 maybe_accept( node, &SuspendStmt::then );
926 }
927
928 VISIT_END( Stmt, node );
929}
930
931//--------------------------------------------------------------------------
932// WhenClause
933template< typename core_t >
934const ast::WhenClause * ast::Pass< core_t >::visit( const ast::WhenClause * node ) {
935 VISIT_START( node );
936
937 if ( __visit_children() ) {
938 maybe_accept( node, &WhenClause::target );
939 maybe_accept( node, &WhenClause::stmt );
940 maybe_accept( node, &WhenClause::when_cond );
941 }
942
943 VISIT_END( WhenClause, node );
944}
945
946//--------------------------------------------------------------------------
947// WaitForStmt
948template< typename core_t >
949const ast::Stmt * ast::Pass< core_t >::visit( const ast::WaitForStmt * node ) {
950 VISIT_START( node );
951
952 if ( __visit_children() ) {
953 maybe_accept( node, &WaitForStmt::clauses );
954 maybe_accept( node, &WaitForStmt::timeout_time );
955 maybe_accept( node, &WaitForStmt::timeout_stmt );
956 maybe_accept( node, &WaitForStmt::timeout_cond );
957 maybe_accept( node, &WaitForStmt::else_stmt );
958 maybe_accept( node, &WaitForStmt::else_cond );
959 }
960
961 VISIT_END( Stmt, node );
962}
963
964//--------------------------------------------------------------------------
965// WaitForClause
966template< typename core_t >
967const ast::WaitForClause * ast::Pass< core_t >::visit( const ast::WaitForClause * node ) {
968 VISIT_START( node );
969
970 if ( __visit_children() ) {
971 maybe_accept( node, &WaitForClause::target );
972 maybe_accept( node, &WaitForClause::target_args );
973 maybe_accept( node, &WaitForClause::stmt );
974 maybe_accept( node, &WaitForClause::when_cond );
975 }
976
977 VISIT_END( WaitForClause, node );
978}
979
980//--------------------------------------------------------------------------
981// WaitUntilStmt
982template< typename core_t >
983const ast::Stmt * ast::Pass< core_t >::visit( const ast::WaitUntilStmt * node ) {
984 VISIT_START( node );
985
986 if ( __visit_children() ) {
987 maybe_accept( node, &WaitUntilStmt::clauses );
988 maybe_accept( node, &WaitUntilStmt::timeout_time );
989 maybe_accept( node, &WaitUntilStmt::timeout_stmt );
990 maybe_accept( node, &WaitUntilStmt::timeout_cond );
991 maybe_accept( node, &WaitUntilStmt::else_stmt );
992 maybe_accept( node, &WaitUntilStmt::else_cond );
993 }
994
995 VISIT_END( Stmt, node );
996}
997
998//--------------------------------------------------------------------------
999// WithStmt
1000template< typename core_t >
1001const ast::Decl * ast::Pass< core_t >::visit( const ast::WithStmt * node ) {
1002 VISIT_START( node );
1003
1004 if ( __visit_children() ) {
1005 maybe_accept( node, &WithStmt::exprs );
1006 {
1007 // catch statements introduce a level of scope (for the caught exception)
1008 guard_symtab guard { *this };
1009 __pass::symtab::addWith( core, 0, node->exprs, node );
1010 maybe_accept( node, &WithStmt::stmt );
1011 }
1012 }
1013
1014 VISIT_END( Stmt, node );
1015}
1016
1017//--------------------------------------------------------------------------
1018// NullStmt
1019template< typename core_t >
1020const ast::NullStmt * ast::Pass< core_t >::visit( const ast::NullStmt * node ) {
1021 VISIT_START( node );
1022 VISIT_END( NullStmt, node );
1023}
1024
1025//--------------------------------------------------------------------------
1026// DeclStmt
1027template< typename core_t >
1028const ast::Stmt * ast::Pass< core_t >::visit( const ast::DeclStmt * node ) {
1029 VISIT_START( node );
1030
1031 if ( __visit_children() ) {
1032 maybe_accept( node, &DeclStmt::decl );
1033 }
1034
1035 VISIT_END( Stmt, node );
1036}
1037
1038//--------------------------------------------------------------------------
1039// ImplicitCtorDtorStmt
1040template< typename core_t >
1041const ast::Stmt * ast::Pass< core_t >::visit( const ast::ImplicitCtorDtorStmt * node ) {
1042 VISIT_START( node );
1043
1044 // For now this isn't visited, it is unclear if this causes problem
1045 // if all tests are known to pass, remove this code
1046 if ( __visit_children() ) {
1047 maybe_accept( node, &ImplicitCtorDtorStmt::callStmt );
1048 }
1049
1050 VISIT_END( Stmt, node );
1051}
1052
1053//--------------------------------------------------------------------------
1054// MutexStmt
1055template< typename core_t >
1056const ast::Stmt * ast::Pass< core_t >::visit( const ast::MutexStmt * node ) {
1057 VISIT_START( node );
1058
1059 if ( __visit_children() ) {
1060 // mutex statements introduce a level of scope (for the initialization)
1061 guard_symtab guard { *this };
1062 maybe_accept( node, &MutexStmt::stmt );
1063 maybe_accept( node, &MutexStmt::mutexObjs );
1064 }
1065
1066 VISIT_END( Stmt, node );
1067}
1068
1069//--------------------------------------------------------------------------
1070// CorunStmt
1071template< typename core_t >
1072const ast::Stmt * ast::Pass< core_t >::visit( const ast::CorunStmt * node ) {
1073 VISIT_START( node );
1074
1075 if ( __visit_children() ) {
1076 maybe_accept( node, &CorunStmt::stmt );
1077 }
1078
1079 VISIT_END( Stmt, node );
1080}
1081
1082//--------------------------------------------------------------------------
1083// CoforStmt
1084template< typename core_t >
1085const ast::Stmt * ast::Pass< core_t >::visit( const ast::CoforStmt * node ) {
1086 VISIT_START( node );
1087
1088 if ( __visit_children() ) {
1089 // for statements introduce a level of scope (for the initialization)
1090 guard_symtab guard { *this };
1091 maybe_accept( node, &CoforStmt::inits );
1092 maybe_accept_top( node, &CoforStmt::cond );
1093 maybe_accept_top( node, &CoforStmt::inc );
1094 maybe_accept_as_compound( node, &CoforStmt::body );
1095 }
1096
1097 VISIT_END( Stmt, node );
1098}
1099
1100//--------------------------------------------------------------------------
1101// ApplicationExpr
1102template< typename core_t >
1103const ast::Expr * ast::Pass< core_t >::visit( const ast::ApplicationExpr * node ) {
1104 VISIT_START( node );
1105
1106 if ( __visit_children() ) {
1107 {
1108 guard_symtab guard { *this };
1109 maybe_accept( node, &ApplicationExpr::result );
1110 }
1111 maybe_accept( node, &ApplicationExpr::func );
1112 maybe_accept( node, &ApplicationExpr::args );
1113 }
1114
1115 VISIT_END( Expr, node );
1116}
1117
1118//--------------------------------------------------------------------------
1119// UntypedExpr
1120template< typename core_t >
1121const ast::Expr * ast::Pass< core_t >::visit( const ast::UntypedExpr * node ) {
1122 VISIT_START( node );
1123
1124 if ( __visit_children() ) {
1125 {
1126 guard_symtab guard { *this };
1127 maybe_accept( node, &UntypedExpr::result );
1128 }
1129
1130 maybe_accept( node, &UntypedExpr::args );
1131 }
1132
1133 VISIT_END( Expr, node );
1134}
1135
1136//--------------------------------------------------------------------------
1137// NameExpr
1138template< typename core_t >
1139const ast::Expr * ast::Pass< core_t >::visit( const ast::NameExpr * node ) {
1140 VISIT_START( node );
1141
1142 if ( __visit_children() ) {
1143 guard_symtab guard { *this };
1144 maybe_accept( node, &NameExpr::result );
1145 }
1146
1147 VISIT_END( Expr, node );
1148}
1149
1150//--------------------------------------------------------------------------
1151// QualifiedNameExpr
1152template< typename core_t >
1153const ast::Expr * ast::Pass< core_t >::visit( const ast::QualifiedNameExpr * node ) {
1154 VISIT_START( node );
1155 if ( __visit_children() ) {
1156 guard_symtab guard { *this };
1157 maybe_accept( node, &QualifiedNameExpr::type_decl );
1158 }
1159 VISIT_END( Expr, node );
1160}
1161
1162//--------------------------------------------------------------------------
1163// CastExpr
1164template< typename core_t >
1165const ast::Expr * ast::Pass< core_t >::visit( const ast::CastExpr * node ) {
1166 VISIT_START( node );
1167
1168 if ( __visit_children() ) {
1169 {
1170 guard_symtab guard { *this };
1171 maybe_accept( node, &CastExpr::result );
1172 }
1173 maybe_accept( node, &CastExpr::arg );
1174 }
1175
1176 VISIT_END( Expr, node );
1177}
1178
1179//--------------------------------------------------------------------------
1180// KeywordCastExpr
1181template< typename core_t >
1182const ast::Expr * ast::Pass< core_t >::visit( const ast::KeywordCastExpr * node ) {
1183 VISIT_START( node );
1184
1185 if ( __visit_children() ) {
1186 {
1187 guard_symtab guard { *this };
1188 maybe_accept( node, &KeywordCastExpr::result );
1189 }
1190 maybe_accept( node, &KeywordCastExpr::arg );
1191 }
1192
1193 VISIT_END( Expr, node );
1194}
1195
1196//--------------------------------------------------------------------------
1197// VirtualCastExpr
1198template< typename core_t >
1199const ast::Expr * ast::Pass< core_t >::visit( const ast::VirtualCastExpr * node ) {
1200 VISIT_START( node );
1201
1202 if ( __visit_children() ) {
1203 {
1204 guard_symtab guard { *this };
1205 maybe_accept( node, &VirtualCastExpr::result );
1206 }
1207 maybe_accept( node, &VirtualCastExpr::arg );
1208 }
1209
1210 VISIT_END( Expr, node );
1211}
1212
1213//--------------------------------------------------------------------------
1214// AddressExpr
1215template< typename core_t >
1216const ast::Expr * ast::Pass< core_t >::visit( const ast::AddressExpr * node ) {
1217 VISIT_START( node );
1218
1219 if ( __visit_children() ) {
1220 {
1221 guard_symtab guard { *this };
1222 maybe_accept( node, &AddressExpr::result );
1223 }
1224 maybe_accept( node, &AddressExpr::arg );
1225 }
1226
1227 VISIT_END( Expr, node );
1228}
1229
1230//--------------------------------------------------------------------------
1231// LabelAddressExpr
1232template< typename core_t >
1233const ast::Expr * ast::Pass< core_t >::visit( const ast::LabelAddressExpr * node ) {
1234 VISIT_START( node );
1235
1236 if ( __visit_children() ) {
1237 guard_symtab guard { *this };
1238 maybe_accept( node, &LabelAddressExpr::result );
1239 }
1240
1241 VISIT_END( Expr, node );
1242}
1243
1244//--------------------------------------------------------------------------
1245// UntypedMemberExpr
1246template< typename core_t >
1247const ast::Expr * ast::Pass< core_t >::visit( const ast::UntypedMemberExpr * node ) {
1248 VISIT_START( node );
1249
1250 if ( __visit_children() ) {
1251 {
1252 guard_symtab guard { *this };
1253 maybe_accept( node, &UntypedMemberExpr::result );
1254 }
1255 maybe_accept( node, &UntypedMemberExpr::aggregate );
1256 maybe_accept( node, &UntypedMemberExpr::member );
1257 }
1258
1259 VISIT_END( Expr, node );
1260}
1261
1262//--------------------------------------------------------------------------
1263// MemberExpr
1264template< typename core_t >
1265const ast::Expr * ast::Pass< core_t >::visit( const ast::MemberExpr * node ) {
1266 VISIT_START( node );
1267
1268 if ( __visit_children() ) {
1269 {
1270 guard_symtab guard { *this };
1271 maybe_accept( node, &MemberExpr::result );
1272 }
1273 maybe_accept( node, &MemberExpr::aggregate );
1274 }
1275
1276 VISIT_END( Expr, node );
1277}
1278
1279//--------------------------------------------------------------------------
1280// VariableExpr
1281template< typename core_t >
1282const ast::Expr * ast::Pass< core_t >::visit( const ast::VariableExpr * node ) {
1283 VISIT_START( node );
1284
1285 if ( __visit_children() ) {
1286 guard_symtab guard { *this };
1287 maybe_accept( node, &VariableExpr::result );
1288 }
1289
1290 VISIT_END( Expr, node );
1291}
1292
1293//--------------------------------------------------------------------------
1294// ConstantExpr
1295template< typename core_t >
1296const ast::Expr * ast::Pass< core_t >::visit( const ast::ConstantExpr * node ) {
1297 VISIT_START( node );
1298
1299 if ( __visit_children() ) {
1300 guard_symtab guard { *this };
1301 maybe_accept( node, &ConstantExpr::result );
1302 }
1303
1304 VISIT_END( Expr, node );
1305}
1306
1307//--------------------------------------------------------------------------
1308// SizeofExpr
1309template< typename core_t >
1310const ast::Expr * ast::Pass< core_t >::visit( const ast::SizeofExpr * node ) {
1311 VISIT_START( node );
1312
1313 if ( __visit_children() ) {
1314 {
1315 guard_symtab guard { *this };
1316 maybe_accept( node, &SizeofExpr::result );
1317 }
1318 if ( node->type ) {
1319 maybe_accept( node, &SizeofExpr::type );
1320 } else {
1321 maybe_accept( node, &SizeofExpr::expr );
1322 }
1323 }
1324
1325 VISIT_END( Expr, node );
1326}
1327
1328//--------------------------------------------------------------------------
1329// AlignofExpr
1330template< typename core_t >
1331const ast::Expr * ast::Pass< core_t >::visit( const ast::AlignofExpr * node ) {
1332 VISIT_START( node );
1333
1334 if ( __visit_children() ) {
1335 {
1336 guard_symtab guard { *this };
1337 maybe_accept( node, &AlignofExpr::result );
1338 }
1339 if ( node->type ) {
1340 maybe_accept( node, &AlignofExpr::type );
1341 } else {
1342 maybe_accept( node, &AlignofExpr::expr );
1343 }
1344 }
1345
1346 VISIT_END( Expr, node );
1347}
1348
1349//--------------------------------------------------------------------------
1350// UntypedOffsetofExpr
1351template< typename core_t >
1352const ast::Expr * ast::Pass< core_t >::visit( const ast::UntypedOffsetofExpr * node ) {
1353 VISIT_START( node );
1354
1355 if ( __visit_children() ) {
1356 {
1357 guard_symtab guard { *this };
1358 maybe_accept( node, &UntypedOffsetofExpr::result );
1359 }
1360 maybe_accept( node, &UntypedOffsetofExpr::type );
1361 }
1362
1363 VISIT_END( Expr, node );
1364}
1365
1366//--------------------------------------------------------------------------
1367// OffsetofExpr
1368template< typename core_t >
1369const ast::Expr * ast::Pass< core_t >::visit( const ast::OffsetofExpr * node ) {
1370 VISIT_START( node );
1371
1372 if ( __visit_children() ) {
1373 {
1374 guard_symtab guard { *this };
1375 maybe_accept( node, &OffsetofExpr::result );
1376 }
1377 maybe_accept( node, &OffsetofExpr::type );
1378 }
1379
1380 VISIT_END( Expr, node );
1381}
1382
1383//--------------------------------------------------------------------------
1384// OffsetPackExpr
1385template< typename core_t >
1386const ast::Expr * ast::Pass< core_t >::visit( const ast::OffsetPackExpr * node ) {
1387 VISIT_START( node );
1388
1389 if ( __visit_children() ) {
1390 {
1391 guard_symtab guard { *this };
1392 maybe_accept( node, &OffsetPackExpr::result );
1393 }
1394 maybe_accept( node, &OffsetPackExpr::type );
1395 }
1396
1397 VISIT_END( Expr, node );
1398}
1399
1400//--------------------------------------------------------------------------
1401// LogicalExpr
1402template< typename core_t >
1403const ast::Expr * ast::Pass< core_t >::visit( const ast::LogicalExpr * node ) {
1404 VISIT_START( node );
1405
1406 if ( __visit_children() ) {
1407 {
1408 guard_symtab guard { *this };
1409 maybe_accept( node, &LogicalExpr::result );
1410 }
1411 maybe_accept( node, &LogicalExpr::arg1 );
1412 maybe_accept( node, &LogicalExpr::arg2 );
1413 }
1414
1415 VISIT_END( Expr, node );
1416}
1417
1418//--------------------------------------------------------------------------
1419// ConditionalExpr
1420template< typename core_t >
1421const ast::Expr * ast::Pass< core_t >::visit( const ast::ConditionalExpr * node ) {
1422 VISIT_START( node );
1423
1424 if ( __visit_children() ) {
1425 {
1426 guard_symtab guard { *this };
1427 maybe_accept( node, &ConditionalExpr::result );
1428 }
1429 maybe_accept( node, &ConditionalExpr::arg1 );
1430 maybe_accept( node, &ConditionalExpr::arg2 );
1431 maybe_accept( node, &ConditionalExpr::arg3 );
1432 }
1433
1434 VISIT_END( Expr, node );
1435}
1436
1437//--------------------------------------------------------------------------
1438// CommaExpr
1439template< typename core_t >
1440const ast::Expr * ast::Pass< core_t >::visit( const ast::CommaExpr * node ) {
1441 VISIT_START( node );
1442
1443 if ( __visit_children() ) {
1444 {
1445 guard_symtab guard { *this };
1446 maybe_accept( node, &CommaExpr::result );
1447 }
1448 maybe_accept( node, &CommaExpr::arg1 );
1449 maybe_accept( node, &CommaExpr::arg2 );
1450 }
1451
1452 VISIT_END( Expr, node );
1453}
1454
1455//--------------------------------------------------------------------------
1456// TypeExpr
1457template< typename core_t >
1458const ast::Expr * ast::Pass< core_t >::visit( const ast::TypeExpr * node ) {
1459 VISIT_START( node );
1460
1461 if ( __visit_children() ) {
1462 {
1463 guard_symtab guard { *this };
1464 maybe_accept( node, &TypeExpr::result );
1465 }
1466 maybe_accept( node, &TypeExpr::type );
1467 }
1468
1469 VISIT_END( Expr, node );
1470}
1471
1472//--------------------------------------------------------------------------
1473// DimensionExpr
1474template< typename core_t >
1475const ast::Expr * ast::Pass< core_t >::visit( const ast::DimensionExpr * node ) {
1476 VISIT_START( node );
1477
1478 if ( __visit_children() ) {
1479 guard_symtab guard { *this };
1480 maybe_accept( node, &DimensionExpr::result );
1481 }
1482
1483 VISIT_END( Expr, node );
1484}
1485
1486//--------------------------------------------------------------------------
1487// AsmExpr
1488template< typename core_t >
1489const ast::Expr * ast::Pass< core_t >::visit( const ast::AsmExpr * node ) {
1490 VISIT_START( node );
1491
1492 if ( __visit_children() ) {
1493 {
1494 guard_symtab guard { *this };
1495 maybe_accept( node, &AsmExpr::result );
1496 }
1497 maybe_accept( node, &AsmExpr::constraint );
1498 maybe_accept( node, &AsmExpr::operand );
1499 }
1500
1501 VISIT_END( Expr, node );
1502}
1503
1504//--------------------------------------------------------------------------
1505// ImplicitCopyCtorExpr
1506template< typename core_t >
1507const ast::Expr * ast::Pass< core_t >::visit( const ast::ImplicitCopyCtorExpr * node ) {
1508 VISIT_START( node );
1509
1510 if ( __visit_children() ) {
1511 {
1512 guard_symtab guard { *this };
1513 maybe_accept( node, &ImplicitCopyCtorExpr::result );
1514 }
1515 maybe_accept( node, &ImplicitCopyCtorExpr::callExpr );
1516 }
1517
1518 VISIT_END( Expr, node );
1519}
1520
1521//--------------------------------------------------------------------------
1522// ConstructorExpr
1523template< typename core_t >
1524const ast::Expr * ast::Pass< core_t >::visit( const ast::ConstructorExpr * node ) {
1525 VISIT_START( node );
1526
1527 if ( __visit_children() ) {
1528 {
1529 guard_symtab guard { *this };
1530 maybe_accept( node, &ConstructorExpr::result );
1531 }
1532 maybe_accept( node, &ConstructorExpr::callExpr );
1533 }
1534
1535 VISIT_END( Expr, node );
1536}
1537
1538//--------------------------------------------------------------------------
1539// CompoundLiteralExpr
1540template< typename core_t >
1541const ast::Expr * ast::Pass< core_t >::visit( const ast::CompoundLiteralExpr * node ) {
1542 VISIT_START( node );
1543
1544 if ( __visit_children() ) {
1545 {
1546 guard_symtab guard { *this };
1547 maybe_accept( node, &CompoundLiteralExpr::result );
1548 }
1549 maybe_accept( node, &CompoundLiteralExpr::init );
1550 }
1551
1552 VISIT_END( Expr, node );
1553}
1554
1555//--------------------------------------------------------------------------
1556// RangeExpr
1557template< typename core_t >
1558const ast::Expr * ast::Pass< core_t >::visit( const ast::RangeExpr * node ) {
1559 VISIT_START( node );
1560
1561 if ( __visit_children() ) {
1562 {
1563 guard_symtab guard { *this };
1564 maybe_accept( node, &RangeExpr::result );
1565 }
1566 maybe_accept( node, &RangeExpr::low );
1567 maybe_accept( node, &RangeExpr::high );
1568 }
1569
1570 VISIT_END( Expr, node );
1571}
1572
1573//--------------------------------------------------------------------------
1574// UntypedTupleExpr
1575template< typename core_t >
1576const ast::Expr * ast::Pass< core_t >::visit( const ast::UntypedTupleExpr * node ) {
1577 VISIT_START( node );
1578
1579 if ( __visit_children() ) {
1580 {
1581 guard_symtab guard { *this };
1582 maybe_accept( node, &UntypedTupleExpr::result );
1583 }
1584 maybe_accept( node, &UntypedTupleExpr::exprs );
1585 }
1586
1587 VISIT_END( Expr, node );
1588}
1589
1590//--------------------------------------------------------------------------
1591// TupleExpr
1592template< typename core_t >
1593const ast::Expr * ast::Pass< core_t >::visit( const ast::TupleExpr * node ) {
1594 VISIT_START( node );
1595
1596 if ( __visit_children() ) {
1597 {
1598 guard_symtab guard { *this };
1599 maybe_accept( node, &TupleExpr::result );
1600 }
1601 maybe_accept( node, &TupleExpr::exprs );
1602 }
1603
1604 VISIT_END( Expr, node );
1605}
1606
1607//--------------------------------------------------------------------------
1608// TupleIndexExpr
1609template< typename core_t >
1610const ast::Expr * ast::Pass< core_t >::visit( const ast::TupleIndexExpr * node ) {
1611 VISIT_START( node );
1612
1613 if ( __visit_children() ) {
1614 {
1615 guard_symtab guard { *this };
1616 maybe_accept( node, &TupleIndexExpr::result );
1617 }
1618 maybe_accept( node, &TupleIndexExpr::tuple );
1619 }
1620
1621 VISIT_END( Expr, node );
1622}
1623
1624//--------------------------------------------------------------------------
1625// TupleAssignExpr
1626template< typename core_t >
1627const ast::Expr * ast::Pass< core_t >::visit( const ast::TupleAssignExpr * node ) {
1628 VISIT_START( node );
1629
1630 if ( __visit_children() ) {
1631 {
1632 guard_symtab guard { *this };
1633 maybe_accept( node, &TupleAssignExpr::result );
1634 }
1635 maybe_accept( node, &TupleAssignExpr::stmtExpr );
1636 }
1637
1638 VISIT_END( Expr, node );
1639}
1640
1641//--------------------------------------------------------------------------
1642// StmtExpr
1643template< typename core_t >
1644const ast::Expr * ast::Pass< core_t >::visit( const ast::StmtExpr * node ) {
1645 VISIT_START( node );
1646
1647 if ( __visit_children() ) {
1648 // don't want statements from outer CompoundStmts to be added to this StmtExpr
1649 // get the stmts that will need to be spliced in
1650 auto stmts_before = __pass::stmtsToAddBefore( core, 0);
1651 auto stmts_after = __pass::stmtsToAddAfter ( core, 0);
1652
1653 // These may be modified by subnode but most be restored once we exit this statemnet.
1654 ValueGuardPtr< const ast::TypeSubstitution * > __old_env( __pass::typeSubs( core, 0 ) );
1655 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_before) >::type > __old_decls_before( stmts_before );
1656 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_after ) >::type > __old_decls_after ( stmts_after );
1657
1658 {
1659 guard_symtab guard { *this };
1660 maybe_accept( node, &StmtExpr::result );
1661 }
1662 maybe_accept( node, &StmtExpr::stmts );
1663 maybe_accept( node, &StmtExpr::returnDecls );
1664 maybe_accept( node, &StmtExpr::dtors );
1665 }
1666
1667 VISIT_END( Expr, node );
1668}
1669
1670//--------------------------------------------------------------------------
1671// UniqueExpr
1672template< typename core_t >
1673const ast::Expr * ast::Pass< core_t >::visit( const ast::UniqueExpr * node ) {
1674 VISIT_START( node );
1675
1676 if ( __visit_children() ) {
1677 {
1678 guard_symtab guard { *this };
1679 maybe_accept( node, &UniqueExpr::result );
1680 }
1681 maybe_accept( node, &UniqueExpr::expr );
1682 }
1683
1684 VISIT_END( Expr, node );
1685}
1686
1687//--------------------------------------------------------------------------
1688// UntypedInitExpr
1689template< typename core_t >
1690const ast::Expr * ast::Pass< core_t >::visit( const ast::UntypedInitExpr * node ) {
1691 VISIT_START( node );
1692
1693 if ( __visit_children() ) {
1694 {
1695 guard_symtab guard { *this };
1696 maybe_accept( node, &UntypedInitExpr::result );
1697 }
1698 maybe_accept( node, &UntypedInitExpr::expr );
1699 // not currently visiting initAlts, but this doesn't matter since this node is only used in the resolver.
1700 }
1701
1702 VISIT_END( Expr, node );
1703}
1704
1705//--------------------------------------------------------------------------
1706// InitExpr
1707template< typename core_t >
1708const ast::Expr * ast::Pass< core_t >::visit( const ast::InitExpr * node ) {
1709 VISIT_START( node );
1710
1711 if ( __visit_children() ) {
1712 {
1713 guard_symtab guard { *this };
1714 maybe_accept( node, &InitExpr::result );
1715 }
1716 maybe_accept( node, &InitExpr::expr );
1717 maybe_accept( node, &InitExpr::designation );
1718 }
1719
1720 VISIT_END( Expr, node );
1721}
1722
1723//--------------------------------------------------------------------------
1724// DeletedExpr
1725template< typename core_t >
1726const ast::Expr * ast::Pass< core_t >::visit( const ast::DeletedExpr * node ) {
1727 VISIT_START( node );
1728
1729 if ( __visit_children() ) {
1730 {
1731 guard_symtab guard { *this };
1732 maybe_accept( node, &DeletedExpr::result );
1733 }
1734 maybe_accept( node, &DeletedExpr::expr );
1735 // don't visit deleteStmt, because it is a pointer to somewhere else in the tree.
1736 }
1737
1738 VISIT_END( Expr, node );
1739}
1740
1741//--------------------------------------------------------------------------
1742// DefaultArgExpr
1743template< typename core_t >
1744const ast::Expr * ast::Pass< core_t >::visit( const ast::DefaultArgExpr * node ) {
1745 VISIT_START( node );
1746
1747 if ( __visit_children() ) {
1748 {
1749 guard_symtab guard { *this };
1750 maybe_accept( node, &DefaultArgExpr::result );
1751 }
1752 maybe_accept( node, &DefaultArgExpr::expr );
1753 }
1754
1755 VISIT_END( Expr, node );
1756}
1757
1758//--------------------------------------------------------------------------
1759// GenericExpr
1760template< typename core_t >
1761const ast::Expr * ast::Pass< core_t >::visit( const ast::GenericExpr * node ) {
1762 VISIT_START( node );
1763
1764 if ( __visit_children() ) {
1765 {
1766 guard_symtab guard { *this };
1767 maybe_accept( node, &GenericExpr::result );
1768 }
1769 maybe_accept( node, &GenericExpr::control );
1770
1771 std::vector<GenericExpr::Association> new_kids;
1772 new_kids.reserve(node->associations.size());
1773 bool mutated = false;
1774 for( const auto & assoc : node->associations ) {
1775 const Type * type = nullptr;
1776 if( assoc.type ) {
1777 guard_symtab guard { *this };
1778 type = assoc.type->accept( *this );
1779 if( type != assoc.type ) mutated = true;
1780 }
1781 const Expr * expr = nullptr;
1782 if( assoc.expr ) {
1783 expr = assoc.expr->accept( *this );
1784 if( expr != assoc.expr ) mutated = true;
1785 }
1786 new_kids.emplace_back( type, expr );
1787 }
1788
1789 if(mutated) {
1790 auto n = __pass::mutate<core_t>(node);
1791 n->associations = std::move( new_kids );
1792 node = n;
1793 }
1794 }
1795
1796 VISIT_END( Expr, node );
1797}
1798
1799//--------------------------------------------------------------------------
1800// VoidType
1801template< typename core_t >
1802const ast::Type * ast::Pass< core_t >::visit( const ast::VoidType * node ) {
1803 VISIT_START( node );
1804
1805 VISIT_END( Type, node );
1806}
1807
1808//--------------------------------------------------------------------------
1809// BasicType
1810template< typename core_t >
1811const ast::Type * ast::Pass< core_t >::visit( const ast::BasicType * node ) {
1812 VISIT_START( node );
1813
1814 VISIT_END( Type, node );
1815}
1816
1817//--------------------------------------------------------------------------
1818// PointerType
1819template< typename core_t >
1820const ast::Type * ast::Pass< core_t >::visit( const ast::PointerType * node ) {
1821 VISIT_START( node );
1822
1823 if ( __visit_children() ) {
1824 maybe_accept( node, &PointerType::dimension );
1825 maybe_accept( node, &PointerType::base );
1826 }
1827
1828 VISIT_END( Type, node );
1829}
1830
1831//--------------------------------------------------------------------------
1832// ArrayType
1833template< typename core_t >
1834const ast::Type * ast::Pass< core_t >::visit( const ast::ArrayType * node ) {
1835 VISIT_START( node );
1836
1837 if ( __visit_children() ) {
1838 maybe_accept( node, &ArrayType::dimension );
1839 maybe_accept( node, &ArrayType::base );
1840 }
1841
1842 VISIT_END( Type, node );
1843}
1844
1845//--------------------------------------------------------------------------
1846// ReferenceType
1847template< typename core_t >
1848const ast::Type * ast::Pass< core_t >::visit( const ast::ReferenceType * node ) {
1849 VISIT_START( node );
1850
1851 if ( __visit_children() ) {
1852 maybe_accept( node, &ReferenceType::base );
1853 }
1854
1855 VISIT_END( Type, node );
1856}
1857
1858//--------------------------------------------------------------------------
1859// QualifiedType
1860template< typename core_t >
1861const ast::Type * ast::Pass< core_t >::visit( const ast::QualifiedType * node ) {
1862 VISIT_START( node );
1863
1864 if ( __visit_children() ) {
1865 maybe_accept( node, &QualifiedType::parent );
1866 maybe_accept( node, &QualifiedType::child );
1867 }
1868
1869 VISIT_END( Type, node );
1870}
1871
1872//--------------------------------------------------------------------------
1873// FunctionType
1874template< typename core_t >
1875const ast::Type * ast::Pass< core_t >::visit( const ast::FunctionType * node ) {
1876 VISIT_START( node );
1877
1878 if ( __visit_children() ) {
1879 // guard_forall_subs forall_guard { *this, node };
1880 // mutate_forall( node );
1881 maybe_accept( node, &FunctionType::assertions );
1882 maybe_accept( node, &FunctionType::returns );
1883 maybe_accept( node, &FunctionType::params );
1884 }
1885
1886 VISIT_END( Type, node );
1887}
1888
1889//--------------------------------------------------------------------------
1890// StructInstType
1891template< typename core_t >
1892const ast::Type * ast::Pass< core_t >::visit( const ast::StructInstType * node ) {
1893 VISIT_START( node );
1894
1895 __pass::symtab::addStructId( core, 0, node->name );
1896
1897 if ( __visit_children() ) {
1898 guard_symtab guard { *this };
1899 maybe_accept( node, &StructInstType::params );
1900 }
1901
1902 VISIT_END( Type, node );
1903}
1904
1905//--------------------------------------------------------------------------
1906// UnionInstType
1907template< typename core_t >
1908const ast::Type * ast::Pass< core_t >::visit( const ast::UnionInstType * node ) {
1909 VISIT_START( node );
1910
1911 __pass::symtab::addUnionId( core, 0, node->name );
1912
1913 if ( __visit_children() ) {
1914 guard_symtab guard { *this };
1915 maybe_accept( node, &UnionInstType::params );
1916 }
1917
1918 VISIT_END( Type, node );
1919}
1920
1921//--------------------------------------------------------------------------
1922// EnumInstType
1923template< typename core_t >
1924const ast::Type * ast::Pass< core_t >::visit( const ast::EnumInstType * node ) {
1925 VISIT_START( node );
1926
1927 if ( __visit_children() ) {
1928 maybe_accept( node, &EnumInstType::params );
1929 }
1930
1931 VISIT_END( Type, node );
1932}
1933
1934//--------------------------------------------------------------------------
1935// TraitInstType
1936template< typename core_t >
1937const ast::Type * ast::Pass< core_t >::visit( const ast::TraitInstType * node ) {
1938 VISIT_START( node );
1939
1940 if ( __visit_children() ) {
1941 maybe_accept( node, &TraitInstType::params );
1942 }
1943
1944 VISIT_END( Type, node );
1945}
1946
1947//--------------------------------------------------------------------------
1948// TypeInstType
1949template< typename core_t >
1950const ast::Type * ast::Pass< core_t >::visit( const ast::TypeInstType * node ) {
1951 VISIT_START( node );
1952
1953 if ( __visit_children() ) {
1954 {
1955 maybe_accept( node, &TypeInstType::params );
1956 }
1957 // ensure that base re-bound if doing substitution
1958 __pass::forall::replace( core, 0, node );
1959 }
1960
1961 VISIT_END( Type, node );
1962}
1963
1964//--------------------------------------------------------------------------
1965// TupleType
1966template< typename core_t >
1967const ast::Type * ast::Pass< core_t >::visit( const ast::TupleType * node ) {
1968 VISIT_START( node );
1969
1970 if ( __visit_children() ) {
1971 maybe_accept( node, &TupleType::types );
1972 }
1973
1974 VISIT_END( Type, node );
1975}
1976
1977//--------------------------------------------------------------------------
1978// TypeofType
1979template< typename core_t >
1980const ast::Type * ast::Pass< core_t >::visit( const ast::TypeofType * node ) {
1981 VISIT_START( node );
1982
1983 if ( __visit_children() ) {
1984 maybe_accept( node, &TypeofType::expr );
1985 }
1986
1987 VISIT_END( Type, node );
1988}
1989
1990//--------------------------------------------------------------------------
1991// VTableType
1992template< typename core_t >
1993const ast::Type * ast::Pass< core_t >::visit( const ast::VTableType * node ) {
1994 VISIT_START( node );
1995
1996 if ( __visit_children() ) {
1997 maybe_accept( node, &VTableType::base );
1998 }
1999
2000 VISIT_END( Type, node );
2001}
2002
2003//--------------------------------------------------------------------------
2004// VarArgsType
2005template< typename core_t >
2006const ast::Type * ast::Pass< core_t >::visit( const ast::VarArgsType * node ) {
2007 VISIT_START( node );
2008
2009 VISIT_END( Type, node );
2010}
2011
2012//--------------------------------------------------------------------------
2013// ZeroType
2014template< typename core_t >
2015const ast::Type * ast::Pass< core_t >::visit( const ast::ZeroType * node ) {
2016 VISIT_START( node );
2017
2018 VISIT_END( Type, node );
2019}
2020
2021//--------------------------------------------------------------------------
2022// OneType
2023template< typename core_t >
2024const ast::Type * ast::Pass< core_t >::visit( const ast::OneType * node ) {
2025 VISIT_START( node );
2026
2027 VISIT_END( Type, node );
2028}
2029
2030//--------------------------------------------------------------------------
2031// GlobalScopeType
2032template< typename core_t >
2033const ast::Type * ast::Pass< core_t >::visit( const ast::GlobalScopeType * node ) {
2034 VISIT_START( node );
2035
2036 VISIT_END( Type, node );
2037}
2038
2039
2040//--------------------------------------------------------------------------
2041// Designation
2042template< typename core_t >
2043const ast::Designation * ast::Pass< core_t >::visit( const ast::Designation * node ) {
2044 VISIT_START( node );
2045
2046 if ( __visit_children() ) {
2047 maybe_accept( node, &Designation::designators );
2048 }
2049
2050 VISIT_END( Designation, node );
2051}
2052
2053//--------------------------------------------------------------------------
2054// SingleInit
2055template< typename core_t >
2056const ast::Init * ast::Pass< core_t >::visit( const ast::SingleInit * node ) {
2057 VISIT_START( node );
2058
2059 if ( __visit_children() ) {
2060 maybe_accept_top( node, &SingleInit::value );
2061 }
2062
2063 VISIT_END( Init, node );
2064}
2065
2066//--------------------------------------------------------------------------
2067// ListInit
2068template< typename core_t >
2069const ast::Init * ast::Pass< core_t >::visit( const ast::ListInit * node ) {
2070 VISIT_START( node );
2071
2072 if ( __visit_children() ) {
2073 maybe_accept( node, &ListInit::designations );
2074 maybe_accept( node, &ListInit::initializers );
2075 }
2076
2077 VISIT_END( Init, node );
2078}
2079
2080//--------------------------------------------------------------------------
2081// ConstructorInit
2082template< typename core_t >
2083const ast::Init * ast::Pass< core_t >::visit( const ast::ConstructorInit * node ) {
2084 VISIT_START( node );
2085
2086 if ( __visit_children() ) {
2087 maybe_accept( node, &ConstructorInit::ctor );
2088 maybe_accept( node, &ConstructorInit::dtor );
2089 maybe_accept( node, &ConstructorInit::init );
2090 }
2091
2092 VISIT_END( Init, node );
2093}
2094
2095//--------------------------------------------------------------------------
2096// Attribute
2097template< typename core_t >
2098const ast::Attribute * ast::Pass< core_t >::visit( const ast::Attribute * node ) {
2099 VISIT_START( node );
2100
2101 if ( __visit_children() ) {
2102 maybe_accept( node, &Attribute::params );
2103 }
2104
2105 VISIT_END( Attribute, node );
2106}
2107
2108//--------------------------------------------------------------------------
2109// TypeSubstitution
2110template< typename core_t >
2111const ast::TypeSubstitution * ast::Pass< core_t >::visit( const ast::TypeSubstitution * node ) {
2112 VISIT_START( node );
2113
2114 if ( __visit_children() ) {
2115 bool mutated = false;
2116 ast::TypeSubstitution::TypeMap new_map;
2117 for ( const auto & p : node->typeMap ) {
2118 guard_symtab guard { *this };
2119 auto new_node = p.second->accept( *this );
2120 if (new_node != p.second) mutated = true;
2121 new_map.insert({ p.first, new_node });
2122 }
2123 if (mutated) {
2124 auto new_node = __pass::mutate<core_t>( node );
2125 new_node->typeMap.swap( new_map );
2126 node = new_node;
2127 }
2128 }
2129
2130 VISIT_END( TypeSubstitution, node );
2131}
2132
2133#undef __pedantic_pass_assertf
2134#undef __pedantic_pass_assert
2135#undef VISIT_START
2136#undef VISIT_END
Note: See TracBrowser for help on using the repository browser.