source: src/AST/Pass.impl.hpp@ 9e23b446

ADT ast-experimental pthread-emulation qualifiedEnum
Last change on this file since 9e23b446 was 9e23b446, checked in by Fangren Yu <f37yu@…>, 3 years ago

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