source: src/AST/Pass.impl.hpp@ 135143ba

ADT ast-experimental
Last change on this file since 135143ba was 5408b59, checked in by JiadaL <j82liang@…>, 3 years ago

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