source: src/AST/Pass.impl.hpp@ 17a0228a

ADT arm-eh ast-experimental cleanup-dtors enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 17a0228a was 17a0228a, checked in by Thierry Delisle <tdelisle@…>, 7 years ago

Added more visit passes
  • Property mode set to 100644
File size: 48.3 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// 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/TypeSubstitution.hpp"
23
24#define VISIT_START( node ) \
25 using namespace ast; \
26 /* back-up the visit children */ \
27 __attribute__((unused)) ast::__pass::visit_children_guard guard1( ast::__pass::visit_children(pass, 0) ); \
28 /* setup the scope for passes that want to run code at exit */ \
29 __attribute__((unused)) ast::__pass::guard_value guard2( ast::__pass::at_cleanup (pass, 0) ); \
30 /* call the implementation of the previsit of this pass */ \
31 __pass::previsit( pass, node, 0 );
32
33#define VISIT( code... ) \
34 /* if this node should visit its children */ \
35 if ( __visit_children() ) { \
36 /* visit the children */ \
37 code \
38 }
39
40#define VISIT_END( type, node ) \
41 /* call the implementation of the postvisit of this pass */ \
42 auto __return = __pass::postvisit( pass, node, 0 ); \
43 assertf(__return, "post visit should never return null"); \
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 namespace __pass {
56 // Check if this is either a null pointer or a pointer to an empty container
57 template<typename T>
58 static inline bool empty( T * ptr ) {
59 return !ptr || ptr->empty();
60 }
61
62 //------------------------------
63 template<typename it_t, template <class...> class container_t>
64 static inline void take_all( it_t it, container_t<ast::ptr<ast::Decl>> * decls, bool * mutated = nullptr ) {
65 if(empty(decls)) return;
66
67 std::transform(decls->begin(), decls->end(), it, [](const ast::Decl * decl) -> auto {
68 return new DeclStmt( decl->location, decl );
69 });
70 decls->clear();
71 if(mutated) *mutated = true;
72 }
73
74 template<typename it_t, template <class...> class container_t>
75 static inline void take_all( it_t it, container_t<ast::ptr<ast::Stmt>> * decls, bool * mutated = nullptr ) {
76 if(empty(decls)) return;
77
78 std::move(decls->begin(), decls->end(), it);
79 decls->clear();
80 if(mutated) *mutated = true;
81 }
82
83 //------------------------------
84 /// Check if should be skipped, different for pointers and containers
85 template<typename node_t>
86 bool skip( const ast::ptr<node_t> & val) {
87 return !val;
88 }
89
90 template< template <class...> class container_t, typename node_t >
91 bool skip( const container_t<ast::ptr< node_t >> & val ) {
92 return val.empty();
93 }
94
95 //------------------------------
96 /// Get the value to visit, different for pointers and containers
97 template<typename node_t>
98 auto get( const ast::ptr<node_t> & val, int ) -> decltype(val.get()) {
99 return val.get();
100 }
101
102 template<typename node_t>
103 const node_t & get( const node_t & val, long) {
104 return val;
105 }
106
107
108 //------------------------------
109 /// Check if value was mutated, different for pointers and containers
110 template<typename lhs_t, typename rhs_t>
111 bool differs( const lhs_t * old_val, const rhs_t * new_val ) {
112 return old_val != new_val;
113 }
114
115 template< template <class...> class container_t, typename node_t >
116 bool differs( const container_t<ast::ptr< node_t >> &, const container_t<ast::ptr< node_t >> & new_val ) {
117 return !new_val.empty();
118 }
119 }
120
121 template< typename pass_t >
122 template< typename node_t >
123 auto Pass< pass_t >::call_accept( const node_t * node )
124 -> typename std::enable_if<
125 !std::is_base_of<ast::Expr, node_t>::value &&
126 !std::is_base_of<ast::Stmt, node_t>::value
127 , decltype( node->accept(*this) )
128 >::type
129
130 {
131 __pedantic_pass_assert( __visit_children() );
132 __pedantic_pass_assert( expr );
133
134 static_assert( !std::is_base_of<ast::Expr, node_t>::value, "ERROR");
135 static_assert( !std::is_base_of<ast::Stmt, node_t>::value, "ERROR");
136
137 return node->accept( *this );
138 }
139
140 template< typename pass_t >
141 const ast::Expr * Pass< pass_t >::call_accept( const ast::Expr * expr ) {
142 __pedantic_pass_assert( __visit_children() );
143 __pedantic_pass_assert( expr );
144
145 const ast::TypeSubstitution ** env_ptr = __pass::env( pass, 0);
146 if ( env_ptr && expr->env ) {
147 *env_ptr = expr->env;
148 }
149
150 return expr->accept( *this );
151 }
152
153 template< typename pass_t >
154 const ast::Stmt * Pass< pass_t >::call_accept( const ast::Stmt * stmt ) {
155 __pedantic_pass_assert( __visit_children() );
156 __pedantic_pass_assert( stmt );
157
158 // add a few useful symbols to the scope
159 using __pass::empty;
160
161 // get the stmts/decls that will need to be spliced in
162 auto stmts_before = __pass::stmtsToAddBefore( pass, 0);
163 auto stmts_after = __pass::stmtsToAddAfter ( pass, 0);
164 auto decls_before = __pass::declsToAddBefore( pass, 0);
165 auto decls_after = __pass::declsToAddAfter ( pass, 0);
166
167 // These may be modified by subnode but most be restored once we exit this statemnet.
168 ValueGuardPtr< const ast::TypeSubstitution * > __old_env ( __pass::env( pass, 0) );
169 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_before) >::type > __old_decls_before( stmts_before );
170 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_after ) >::type > __old_decls_after ( stmts_after );
171 ValueGuardPtr< typename std::remove_pointer< decltype(decls_before) >::type > __old_stmts_before( decls_before );
172 ValueGuardPtr< typename std::remove_pointer< decltype(decls_after ) >::type > __old_stmts_after ( decls_after );
173
174 // Now is the time to actually visit the node
175 const ast::Stmt * nstmt = stmt->accept( *this );
176
177 // If the pass doesn't want to add anything then we are done
178 if( empty(stmts_before) && empty(stmts_after) && empty(decls_before) && empty(decls_after) ) {
179 return nstmt;
180 }
181
182 // Make sure that it is either adding statements or declartions but not both
183 // this is because otherwise the order would be awkward to predict
184 assert(( empty( stmts_before ) && empty( stmts_after ))
185 || ( empty( decls_before ) && empty( decls_after )) );
186
187 // Create a new Compound Statement to hold the new decls/stmts
188 ast::CompoundStmt * compound = new ast::CompoundStmt( stmt->location );
189
190 // Take all the declarations that go before
191 __pass::take_all( std::back_inserter( compound->kids ), decls_before );
192 __pass::take_all( std::back_inserter( compound->kids ), stmts_before );
193
194 // Insert the original declaration
195 compound->kids.emplace_back( nstmt );
196
197 // Insert all the declarations that go before
198 __pass::take_all( std::back_inserter( compound->kids ), decls_after );
199 __pass::take_all( std::back_inserter( compound->kids ), stmts_after );
200
201 return compound;
202 }
203
204 template< typename pass_t >
205 template< template <class...> class container_t >
206 container_t< ptr<Stmt> > Pass< pass_t >::call_accept( const container_t< ptr<Stmt> > & statements ) {
207 __pedantic_pass_assert( __visit_children() );
208 if( statements.empty() ) return {};
209
210 // We are going to aggregate errors for all these statements
211 SemanticErrorException errors;
212
213 // add a few useful symbols to the scope
214 using __pass::empty;
215
216 // get the stmts/decls that will need to be spliced in
217 auto stmts_before = __pass::stmtsToAddBefore( pass, 0);
218 auto stmts_after = __pass::stmtsToAddAfter ( pass, 0);
219 auto decls_before = __pass::declsToAddBefore( pass, 0);
220 auto decls_after = __pass::declsToAddAfter ( pass, 0);
221
222 // These may be modified by subnode but most be restored once we exit this statemnet.
223 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_before) >::type > __old_decls_before( stmts_before );
224 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_after ) >::type > __old_decls_after ( stmts_after );
225 ValueGuardPtr< typename std::remove_pointer< decltype(decls_before) >::type > __old_stmts_before( decls_before );
226 ValueGuardPtr< typename std::remove_pointer< decltype(decls_after ) >::type > __old_stmts_after ( decls_after );
227
228 // update pass statitistics
229 pass_visitor_stats.depth++;
230 pass_visitor_stats.max->push(pass_visitor_stats.depth);
231 pass_visitor_stats.avg->push(pass_visitor_stats.depth);
232
233 bool mutated = false;
234 container_t< ptr<Stmt> > new_kids;
235 for( const Stmt * stmt : statements ) {
236 try {
237 __pedantic_pass_assert( stmt );
238 const ast::Stmt * new_stmt = stmt->accept( *this );
239 assert( new_stmt );
240 if(new_stmt != stmt ) mutated = true;
241
242 // Make sure that it is either adding statements or declartions but not both
243 // this is because otherwise the order would be awkward to predict
244 assert(( empty( stmts_before ) && empty( stmts_after ))
245 || ( empty( decls_before ) && empty( decls_after )) );
246
247
248
249 // Take all the statements which should have gone after, N/A for first iteration
250 __pass::take_all( std::back_inserter( new_kids ), decls_before, &mutated );
251 __pass::take_all( std::back_inserter( new_kids ), stmts_before, &mutated );
252
253 // Now add the statement if there is one
254 new_kids.emplace_back( new_stmt );
255
256 // Take all the declarations that go before
257 __pass::take_all( std::back_inserter( new_kids ), decls_after, &mutated );
258 __pass::take_all( std::back_inserter( new_kids ), stmts_after, &mutated );
259 }
260 catch ( SemanticErrorException &e ) {
261 errors.append( e );
262 }
263 }
264 pass_visitor_stats.depth--;
265 if ( !errors.isEmpty() ) { throw errors; }
266
267 return mutated ? new_kids : container_t< ptr<Stmt> >();
268 }
269
270 template< typename pass_t >
271 template< template <class...> class container_t, typename node_t >
272 container_t< ast::ptr<node_t> > Pass< pass_t >::call_accept( const container_t< ast::ptr<node_t> > & container ) {
273 __pedantic_pass_assert( __visit_children() );
274 if( container.empty() ) return {};
275 SemanticErrorException errors;
276
277 pass_visitor_stats.depth++;
278 pass_visitor_stats.max->push(pass_visitor_stats.depth);
279 pass_visitor_stats.avg->push(pass_visitor_stats.depth);
280
281 bool mutated = false;
282 container_t< ast::ptr<node_t> > new_kids;
283 for ( const node_t * node : container ) {
284 try {
285 __pedantic_pass_assert( node );
286 const node_t * new_stmt = strict_dynamic_cast< const node_t * >( node->accept( *this ) );
287 if(new_stmt != node ) mutated = true;
288
289 new_kids.emplace_back( new_stmt );
290 }
291 catch( SemanticErrorException &e ) {
292 errors.append( e );
293 }
294 }
295 pass_visitor_stats.depth--;
296 if ( ! errors.isEmpty() ) { throw errors; }
297
298 return mutated ? new_kids : container_t< ast::ptr<node_t> >();
299 }
300
301 template< typename pass_t >
302 template<typename node_t, typename parent_t, typename child_t>
303 void Pass< pass_t >::maybe_accept(
304 const node_t * & parent,
305 child_t parent_t::*child
306 ) {
307 static_assert( std::is_base_of<parent_t, node_t>::value, "Error deducing member object" );
308
309 if(__pass::skip(parent->*child)) return;
310 const auto & old_val = __pass::get(parent->*child, 0);
311
312 static_assert( !std::is_same<const ast::Node * &, decltype(old_val)>::value, "ERROR");
313
314 auto new_val = call_accept( old_val );
315
316 static_assert( !std::is_same<const ast::Node *, decltype(new_val)>::value || std::is_same<int, decltype(old_val)>::value, "ERROR");
317
318 if( __pass::differs(old_val, new_val) ) {
319 auto new_parent = mutate(parent);
320 new_parent->*child = new_val;
321 parent = new_parent;
322 }
323 }
324
325}
326
327//------------------------------------------------------------------------------------------------------------------------------------------------------------------------
328//========================================================================================================================================================================
329//========================================================================================================================================================================
330//========================================================================================================================================================================
331//========================================================================================================================================================================
332//========================================================================================================================================================================
333//------------------------------------------------------------------------------------------------------------------------------------------------------------------------
334
335template< typename pass_t >
336inline void ast::accept_all( std::list< ast::ptr<ast::Decl> > & decls, ast::Pass< pass_t > & visitor ) {
337 // We are going to aggregate errors for all these statements
338 SemanticErrorException errors;
339
340 // add a few useful symbols to the scope
341 using __pass::empty;
342
343 // get the stmts/decls that will need to be spliced in
344 auto decls_before = __pass::declsToAddBefore( visitor.pass, 0);
345 auto decls_after = __pass::declsToAddAfter ( visitor.pass, 0);
346
347 // update pass statitistics
348 pass_visitor_stats.depth++;
349 pass_visitor_stats.max->push(pass_visitor_stats.depth);
350 pass_visitor_stats.avg->push(pass_visitor_stats.depth);
351
352 for ( std::list< ast::ptr<ast::Decl> >::iterator i = decls.begin(); ; ++i ) {
353 // splice in new declarations after previous decl
354 if ( !empty( decls_after ) ) { decls.splice( i, *decls_after ); }
355
356 if ( i == decls.end() ) break;
357
358 try {
359 // run visitor on declaration
360 ast::ptr<ast::Decl> & node = *i;
361 assert( node );
362 node = node->accept( visitor );
363 }
364 catch( SemanticErrorException &e ) {
365 errors.append( e );
366 }
367
368 // splice in new declarations before current decl
369 if ( !empty( decls_before ) ) { decls.splice( i, *decls_before ); }
370 }
371 pass_visitor_stats.depth--;
372 if ( !errors.isEmpty() ) { throw errors; }
373}
374
375// A NOTE ON THE ORDER OF TRAVERSAL
376//
377// Types and typedefs have their base types visited before they are added to the type table. This is ok, since there is
378// no such thing as a recursive type or typedef.
379//
380// typedef struct { T *x; } T; // never allowed
381//
382// for structs/unions, it is possible to have recursion, so the decl should be added as if it's incomplete to begin, the
383// members are traversed, and then the complete type should be added (assuming the type is completed by this particular
384// declaration).
385//
386// struct T { struct T *x; }; // allowed
387//
388// It is important to add the complete type to the symbol table *after* the members/base has been traversed, since that
389// traversal may modify the definition of the type and these modifications should be visible when the symbol table is
390// queried later in this pass.
391
392//--------------------------------------------------------------------------
393// ObjectDecl
394template< typename pass_t >
395const ast::DeclWithType * ast::Pass< pass_t >::visit( const ast::ObjectDecl * node ) {
396 VISIT_START( node );
397
398 VISIT(
399 {
400 guard_indexer guard { *this };
401 maybe_accept( node, &ObjectDecl::type );
402 }
403 maybe_accept( node, &ObjectDecl::init );
404 maybe_accept( node, &ObjectDecl::bitfieldWidth );
405 maybe_accept( node, &ObjectDecl::attributes );
406 )
407
408 __pass::indexer::addId( pass, 0, node );
409
410 VISIT_END( DeclWithType, node );
411}
412
413//--------------------------------------------------------------------------
414// FunctionDecl
415template< typename pass_t >
416const ast::DeclWithType * ast::Pass< pass_t >::visit( const ast::FunctionDecl * node ) {
417 VISIT_START( node );
418
419 __pass::indexer::addId( pass, 0, node );
420
421 VISIT(maybe_accept( node, &FunctionDecl::withExprs );)
422 {
423 // with clause introduces a level of scope (for the with expression members).
424 // with clause exprs are added to the indexer before parameters so that parameters
425 // shadow with exprs and not the other way around.
426 guard_indexer guard { *this };
427 __pass::indexer::addWith( pass, 0, node->withExprs, node );
428 {
429 guard_indexer guard { *this };
430 // implicit add __func__ identifier as specified in the C manual 6.4.2.2
431 static ast::ObjectDecl func(
432 node->location, "__func__",
433 new ast::ArrayType(
434 new ast::BasicType( ast::BasicType::Char, ast::CV::Qualifiers( ast::CV::Const ) ),
435 nullptr, VariableLen, DynamicDim
436 )
437 );
438 __pass::indexer::addId( pass, 0, &func );
439 VISIT(
440 maybe_accept( node, &FunctionDecl::type );
441 // function body needs to have the same scope as parameters - CompoundStmt will not enter
442 // a new scope if inFunction is true
443 ValueGuard< bool > oldInFunction( inFunction );
444 inFunction = true;
445 maybe_accept( node, &FunctionDecl::stmts );
446 maybe_accept( node, &FunctionDecl::attributes );
447 )
448 }
449 }
450
451 VISIT_END( DeclWithType, node );
452}
453
454//--------------------------------------------------------------------------
455// StructDecl
456template< typename pass_t >
457const ast::Decl * ast::Pass< pass_t >::visit( const ast::StructDecl * node ) {
458 VISIT_START( node );
459
460 // make up a forward declaration and add it before processing the members
461 // needs to be on the heap because addStruct saves the pointer
462 __pass::indexer::addStructFwd( pass, 0, node );
463
464 VISIT({
465 guard_indexer guard { * this };
466 maybe_accept( node, &StructDecl::params );
467 maybe_accept( node, &StructDecl::members );
468 })
469
470 // this addition replaces the forward declaration
471 __pass::indexer::addStruct( pass, 0, node );
472
473 VISIT_END( Decl, node );
474}
475
476//--------------------------------------------------------------------------
477// UnionDecl
478template< typename pass_t >
479const ast::Decl * ast::Pass< pass_t >::visit( const ast::UnionDecl * node ) {
480 VISIT_START( node );
481
482 // make up a forward declaration and add it before processing the members
483 __pass::indexer::addUnionFwd( pass, 0, node );
484
485 VISIT({
486 guard_indexer guard { * this };
487 maybe_accept( node, &UnionDecl::params );
488 maybe_accept( node, &UnionDecl::members );
489 })
490
491 __pass::indexer::addUnion( pass, 0, node );
492
493 VISIT_END( Decl, node );
494}
495
496//--------------------------------------------------------------------------
497// EnumDecl
498template< typename pass_t >
499const ast::Decl * ast::Pass< pass_t >::visit( const ast::EnumDecl * node ) {
500 VISIT_START( node );
501
502 __pass::indexer::addEnum( pass, 0, node );
503
504 VISIT(
505 // unlike structs, traits, and unions, enums inject their members into the global scope
506 maybe_accept( node, &EnumDecl::params );
507 maybe_accept( node, &EnumDecl::members );
508 )
509
510 VISIT_END( Decl, node );
511}
512
513//--------------------------------------------------------------------------
514// TraitDecl
515template< typename pass_t >
516const ast::Decl * ast::Pass< pass_t >::visit( const ast::TraitDecl * node ) {
517 VISIT_START( node );
518
519 VISIT({
520 guard_indexer guard { *this };
521 maybe_accept( node, &TraitDecl::params );
522 maybe_accept( node, &TraitDecl::members );
523 })
524
525 __pass::indexer::addTrait( pass, 0, node );
526
527 VISIT_END( Decl, node );
528}
529
530//--------------------------------------------------------------------------
531// TypeDecl
532template< typename pass_t >
533const ast::Decl * ast::Pass< pass_t >::visit( const ast::TypeDecl * node ) {
534 VISIT_START( node );
535
536 VISIT({
537 guard_indexer guard { *this };
538 maybe_accept( node, &TypeDecl::params );
539 maybe_accept( node, &TypeDecl::base );
540 })
541
542 // see A NOTE ON THE ORDER OF TRAVERSAL, above
543 // note that assertions come after the type is added to the symtab, since they are not part of the type proper
544 // and may depend on the type itself
545 __pass::indexer::addType( pass, 0, node );
546
547 VISIT(
548 maybe_accept( node, &TypeDecl::assertions );
549
550 {
551 guard_indexer guard { *this };
552 maybe_accept( node, &TypeDecl::init );
553 }
554 )
555
556 VISIT_END( Decl, node );
557}
558
559//--------------------------------------------------------------------------
560// TypedefDecl
561template< typename pass_t >
562const ast::Decl * ast::Pass< pass_t >::visit( const ast::TypedefDecl * node ) {
563 VISIT_START( node );
564
565 VISIT({
566 guard_indexer guard { *this };
567 maybe_accept( node, &TypedefDecl::params );
568 maybe_accept( node, &TypedefDecl::base );
569 })
570
571 __pass::indexer::addType( pass, 0, node );
572
573 VISIT( maybe_accept( node, &TypedefDecl::assertions ); )
574
575 VISIT_END( Decl, node );
576}
577
578//--------------------------------------------------------------------------
579// AsmDecl
580template< typename pass_t >
581const ast::AsmDecl * ast::Pass< pass_t >::visit( const ast::AsmDecl * node ) {
582 VISIT_START( node );
583
584 VISIT(
585 maybe_accept( node, &AsmDecl::stmt );
586 )
587
588 VISIT_END( AsmDecl, node );
589}
590
591//--------------------------------------------------------------------------
592// StaticAssertDecl
593template< typename pass_t >
594const ast::StaticAssertDecl * ast::Pass< pass_t >::visit( const ast::StaticAssertDecl * node ) {
595 VISIT_START( node );
596
597 VISIT(
598 maybe_accept( node, &StaticAssertDecl::condition );
599 maybe_accept( node, &StaticAssertDecl::msg );
600 )
601
602 VISIT_END( StaticAssertDecl, node );
603}
604
605//--------------------------------------------------------------------------
606// CompoundStmt
607template< typename pass_t >
608const ast::CompoundStmt * ast::Pass< pass_t >::visit( const ast::CompoundStmt * node ) {
609 VISIT_START( node );
610 VISIT({
611 // do not enter a new scope if inFunction is true - needs to check old state before the assignment
612 auto guard1 = makeFuncGuard( [this, inFunction = this->inFunction]() {
613 if ( ! inFunction ) __pass::indexer::enter(pass, 0);
614 }, [this, inFunction = this->inFunction]() {
615 if ( ! inFunction ) __pass::indexer::leave(pass, 0);
616 });
617 ValueGuard< bool > guard2( inFunction );
618 guard_scope guard3 { *this };
619 inFunction = false;
620 maybe_accept( node, &CompoundStmt::kids );
621 })
622 VISIT_END( CompoundStmt, node );
623}
624
625//--------------------------------------------------------------------------
626// ExprStmt
627template< typename pass_t >
628const ast::Stmt * ast::Pass< pass_t >::visit( const ast::ExprStmt * node ) {
629 VISIT_START( node );
630
631 VISIT(
632 maybe_accept( node, &ExprStmt::expr );
633 )
634
635 VISIT_END( Stmt, node );
636}
637
638//--------------------------------------------------------------------------
639// AsmStmt
640template< typename pass_t >
641const ast::Stmt * ast::Pass< pass_t >::visit( const ast::AsmStmt * node ) {
642 VISIT_START( node )
643
644 VISIT(
645 maybe_accept( node, &AsmStmt::instruction );
646 maybe_accept( node, &AsmStmt::output );
647 maybe_accept( node, &AsmStmt::input );
648 maybe_accept( node, &AsmStmt::clobber );
649 )
650
651 VISIT_END( Stmt, node );
652}
653
654//--------------------------------------------------------------------------
655// DirectiveStmt
656template< typename pass_t >
657const ast::Stmt * ast::Pass< pass_t >::visit( const ast::DirectiveStmt * node ) {
658 VISIT_START( node )
659
660 VISIT_END( Stmt, node );
661}
662
663//--------------------------------------------------------------------------
664// IfStmt
665template< typename pass_t >
666const ast::Stmt * ast::Pass< pass_t >::visit( const ast::IfStmt * node ) {
667 VISIT_START( node );
668
669 VISIT({
670 // if statements introduce a level of scope (for the initialization)
671 guard_indexer guard { *this };
672 maybe_accept( node, &IfStmt::inits );
673 maybe_accept( node, &IfStmt::cond );
674 maybe_accept( node, &IfStmt::thenPart );
675 maybe_accept( node, &IfStmt::elsePart );
676 })
677
678 VISIT_END( Stmt, node );
679}
680
681//--------------------------------------------------------------------------
682// WhileStmt
683template< typename pass_t >
684const ast::Stmt * ast::Pass< pass_t >::visit( const ast::WhileStmt * node ) {
685 VISIT_START( node );
686
687 VISIT({
688 // while statements introduce a level of scope (for the initialization)
689 guard_indexer guard { *this };
690 maybe_accept( node, &WhileStmt::inits );
691 maybe_accept( node, &WhileStmt::cond );
692 maybe_accept( node, &WhileStmt::body );
693 })
694
695 VISIT_END( Stmt, node );
696}
697
698//--------------------------------------------------------------------------
699// ForStmt
700template< typename pass_t >
701const ast::Stmt * ast::Pass< pass_t >::visit( const ast::ForStmt * node ) {
702 VISIT_START( node );
703
704 VISIT({
705 // for statements introduce a level of scope (for the initialization)
706 guard_indexer guard { *this };
707 maybe_accept( node, &ForStmt::inits );
708 maybe_accept( node, &ForStmt::cond );
709 maybe_accept( node, &ForStmt::inc );
710 maybe_accept( node, &ForStmt::body );
711 })
712
713 VISIT_END( Stmt, node );
714}
715
716//--------------------------------------------------------------------------
717// SwitchStmt
718template< typename pass_t >
719const ast::Stmt * ast::Pass< pass_t >::visit( const ast::SwitchStmt * node ) {
720 VISIT_START( node );
721
722 VISIT(
723 maybe_accept( node, &SwitchStmt::cond );
724 maybe_accept( node, &SwitchStmt::stmts );
725 )
726
727 VISIT_END( Stmt, node );
728}
729
730//--------------------------------------------------------------------------
731// CaseStmt
732template< typename pass_t >
733const ast::Stmt * ast::Pass< pass_t >::visit( const ast::CaseStmt * node ) {
734 VISIT_START( node );
735
736 VISIT(
737 maybe_accept( node, &CaseStmt::cond );
738 maybe_accept( node, &CaseStmt::stmts );
739 )
740
741 VISIT_END( Stmt, node );
742}
743
744//--------------------------------------------------------------------------
745// BranchStmt
746template< typename pass_t >
747const ast::Stmt * ast::Pass< pass_t >::visit( const ast::BranchStmt * node ) {
748 VISIT_START( node );
749 VISIT_END( Stmt, node );
750}
751
752//--------------------------------------------------------------------------
753// ReturnStmt
754template< typename pass_t >
755const ast::Stmt * ast::Pass< pass_t >::visit( const ast::ReturnStmt * node ) {
756 VISIT_START( node );
757
758 VISIT(
759 maybe_accept( node, &ReturnStmt::expr );
760 )
761
762 VISIT_END( Stmt, node );
763}
764
765//--------------------------------------------------------------------------
766// ThrowStmt
767template< typename pass_t >
768const ast::Stmt * ast::Pass< pass_t >::visit( const ast::ThrowStmt * node ) {
769 VISIT_START( node );
770
771 VISIT(
772 maybe_accept( node, &ThrowStmt::expr );
773 maybe_accept( node, &ThrowStmt::target );
774 )
775
776 VISIT_END( Stmt, node );
777}
778
779//--------------------------------------------------------------------------
780// TryStmt
781template< typename pass_t >
782const ast::Stmt * ast::Pass< pass_t >::visit( const ast::TryStmt * node ) {
783 VISIT_START( node );
784
785 VISIT(
786 maybe_accept( node, &TryStmt::body );
787 maybe_accept( node, &TryStmt::handlers );
788 maybe_accept( node, &TryStmt::finally );
789 )
790
791 VISIT_END( Stmt, node );
792}
793
794//--------------------------------------------------------------------------
795// CatchStmt
796template< typename pass_t >
797const ast::Stmt * ast::Pass< pass_t >::visit( const ast::CatchStmt * node ) {
798 VISIT_START( node );
799
800 VISIT({
801 // catch statements introduce a level of scope (for the caught exception)
802 guard_indexer guard { *this };
803 maybe_accept( node, &CatchStmt::decl );
804 maybe_accept( node, &CatchStmt::cond );
805 maybe_accept( node, &CatchStmt::body );
806 })
807
808 VISIT_END( Stmt, node );
809}
810
811//--------------------------------------------------------------------------
812// FinallyStmt
813template< typename pass_t >
814const ast::Stmt * ast::Pass< pass_t >::visit( const ast::FinallyStmt * node ) {
815 VISIT_START( node );
816
817 VISIT(
818 maybe_accept( node, &FinallyStmt::body );
819 )
820
821 VISIT_END( Stmt, node );
822}
823
824//--------------------------------------------------------------------------
825// WaitForStmt
826template< typename pass_t >
827const ast::Stmt * ast::Pass< pass_t >::visit( const ast::WaitForStmt * node ) {
828 VISIT_START( node );
829 // for( auto & clause : node->clauses ) {
830 // maybeAccept_impl( clause.target.function, *this );
831 // maybeAccept_impl( clause.target.arguments, *this );
832
833 // maybeAccept_impl( clause.statement, *this );
834 // maybeAccept_impl( clause.condition, *this );
835 // }
836
837 #define maybe_accept(field) \
838 if(node->field) { \
839 auto nval = call_accept( node->field ); \
840 if(nval != node->field ) { \
841 auto nparent = mutate(node); \
842 nparent->field = nval; \
843 node = nparent; \
844 } \
845 }
846
847 VISIT(
848 maybe_accept( timeout.time );
849 maybe_accept( timeout.stmt );
850 maybe_accept( timeout.cond );
851 maybe_accept( orElse.stmt );
852 maybe_accept( orElse.cond );
853 )
854
855 #undef maybe_accept
856
857 VISIT_END( Stmt, node );
858}
859
860//--------------------------------------------------------------------------
861// WithStmt
862template< typename pass_t >
863const ast::Stmt * ast::Pass< pass_t >::visit( const ast::WithStmt * node ) {
864 VISIT_START( node );
865
866 VISIT(
867 maybe_accept( node, &WithStmt::exprs );
868 {
869 // catch statements introduce a level of scope (for the caught exception)
870 guard_indexer guard { *this };
871 __pass::indexer::addWith( pass, 0, node->exprs, node );
872 maybe_accept( node, &WithStmt::stmt );
873 }
874 )
875 VISIT_END( Stmt, node );
876}
877
878//--------------------------------------------------------------------------
879// NullStmt
880template< typename pass_t >
881const ast::NullStmt * ast::Pass< pass_t >::visit( const ast::NullStmt * node ) {
882 VISIT_START( node );
883 VISIT_END( NullStmt, node );
884}
885
886//--------------------------------------------------------------------------
887// DeclStmt
888template< typename pass_t >
889const ast::Stmt * ast::Pass< pass_t >::visit( const ast::DeclStmt * node ) {
890 VISIT_START( node );
891
892 VISIT(
893 maybe_accept( node, &DeclStmt::decl );
894 )
895
896 VISIT_END( Stmt, node );
897}
898
899//--------------------------------------------------------------------------
900// ImplicitCtorDtorStmt
901template< typename pass_t >
902const ast::Stmt * ast::Pass< pass_t >::visit( const ast::ImplicitCtorDtorStmt * node ) {
903 VISIT_START( node );
904
905 // For now this isn't visited, it is unclear if this causes problem
906 // if all tests are known to pass, remove this code
907 // VISIT(
908 // maybe_accept( node, &ImplicitCtorDtorStmt::callStmt );
909 // )
910
911 VISIT_END( Stmt, node );
912}
913
914//--------------------------------------------------------------------------
915// ApplicationExpr
916template< typename pass_t >
917const ast::Expr * ast::Pass< pass_t >::visit( const ast::ApplicationExpr * node ) {
918 VISIT_START( node );
919
920 VISIT(
921 {
922 guard_indexer guard { *this };
923 maybe_accept( node, &ApplicationExpr::result );
924 }
925 maybe_accept( node, &ApplicationExpr::func );
926 maybe_accept( node, &ApplicationExpr::args );
927 )
928
929 VISIT_END( Expr, node );
930}
931
932//--------------------------------------------------------------------------
933// UntypedExpr
934template< typename pass_t >
935const ast::Expr * ast::Pass< pass_t >::visit( const ast::UntypedExpr * node ) {
936 VISIT_START( node );
937
938 VISIT(
939 {
940 guard_indexer guard { *this };
941 maybe_accept( node, &UntypedExpr::result );
942 }
943
944 maybe_accept( node, &UntypedExpr::args );
945 )
946
947 VISIT_END( Expr, node );
948}
949
950//--------------------------------------------------------------------------
951// NameExpr
952template< typename pass_t >
953const ast::Expr * ast::Pass< pass_t >::visit( const ast::NameExpr * node ) {
954 VISIT_START( node );
955
956 VISIT({
957 guard_indexer guard { *this };
958 maybe_accept( node, &NameExpr::result );
959 })
960
961 VISIT_END( Expr, node );
962}
963
964//--------------------------------------------------------------------------
965// CastExpr
966template< typename pass_t >
967const ast::Expr * ast::Pass< pass_t >::visit( const ast::CastExpr * node ) {
968 VISIT_START( node );
969
970 VISIT({
971 guard_indexer guard { *this };
972 maybe_accept( node, &CastExpr::result );
973 }
974 maybe_accept( node, &CastExpr::arg );
975 )
976
977 VISIT_END( Expr, node );
978}
979
980//--------------------------------------------------------------------------
981// KeywordCastExpr
982template< typename pass_t >
983const ast::Expr * ast::Pass< pass_t >::visit( const ast::KeywordCastExpr * node ) {
984 VISIT_START( node );
985
986 VISIT({
987 guard_indexer guard { *this };
988 maybe_accept( node, &KeywordCastExpr::result );
989 }
990 maybe_accept( node, &KeywordCastExpr::arg );
991 )
992
993 VISIT_END( Expr, node );
994}
995
996//--------------------------------------------------------------------------
997// VirtualCastExpr
998template< typename pass_t >
999const ast::Expr * ast::Pass< pass_t >::visit( const ast::VirtualCastExpr * node ) {
1000 VISIT_START( node );
1001
1002 VISIT({
1003 guard_indexer guard { *this };
1004 maybe_accept( node, &VirtualCastExpr::result );
1005 }
1006 maybe_accept( node, &VirtualCastExpr::arg );
1007 )
1008
1009 VISIT_END( Expr, node );
1010}
1011
1012//--------------------------------------------------------------------------
1013// AddressExpr
1014template< typename pass_t >
1015const ast::Expr * ast::Pass< pass_t >::visit( const ast::AddressExpr * node ) {
1016 VISIT_START( node );
1017
1018 VISIT({
1019 guard_indexer guard { *this };
1020 maybe_accept( node, &AddressExpr::result );
1021 }
1022 maybe_accept( node, &AddressExpr::arg );
1023 )
1024
1025 VISIT_END( Expr, node );
1026}
1027
1028//--------------------------------------------------------------------------
1029// LabelAddressExpr
1030template< typename pass_t >
1031const ast::Expr * ast::Pass< pass_t >::visit( const ast::LabelAddressExpr * node ) {
1032 VISIT_START( node );
1033
1034 VISIT({
1035 guard_indexer guard { *this };
1036 maybe_accept( node, &LabelAddressExpr::result );
1037 })
1038
1039 VISIT_END( Expr, node );
1040}
1041
1042//--------------------------------------------------------------------------
1043// UntypedMemberExpr
1044template< typename pass_t >
1045const ast::Expr * ast::Pass< pass_t >::visit( const ast::UntypedMemberExpr * node ) {
1046 VISIT_START( node );
1047
1048 VISIT({
1049 guard_indexer guard { *this };
1050 maybe_accept( node, &UntypedMemberExpr::result );
1051 }
1052 maybe_accept( node, &UntypedMemberExpr::aggregate );
1053 maybe_accept( node, &UntypedMemberExpr::member );
1054 )
1055
1056 VISIT_END( Expr, node );
1057}
1058
1059//--------------------------------------------------------------------------
1060// MemberExpr
1061template< typename pass_t >
1062const ast::Expr * ast::Pass< pass_t >::visit( const ast::MemberExpr * node ) {
1063 VISIT_START( node );
1064
1065 VISIT({
1066 guard_indexer guard { *this };
1067 maybe_accept( node, &MemberExpr::result );
1068 }
1069 maybe_accept( node, &MemberExpr::aggregate );
1070 )
1071
1072 VISIT_END( Expr, node );
1073}
1074
1075//--------------------------------------------------------------------------
1076// VariableExpr
1077template< typename pass_t >
1078const ast::Expr * ast::Pass< pass_t >::visit( const ast::VariableExpr * node ) {
1079 VISIT_START( node );
1080
1081 VISIT({
1082 guard_indexer guard { *this };
1083 maybe_accept( node, &VariableExpr::result );
1084 })
1085
1086 VISIT_END( Expr, node );
1087}
1088
1089//--------------------------------------------------------------------------
1090// ConstantExpr
1091template< typename pass_t >
1092const ast::Expr * ast::Pass< pass_t >::visit( const ast::ConstantExpr * node ) {
1093 VISIT_START( node );
1094
1095 VISIT({
1096 guard_indexer guard { *this };
1097 maybe_accept( node, &ConstantExpr::result );
1098 })
1099
1100 VISIT_END( Expr, node );
1101}
1102
1103//--------------------------------------------------------------------------
1104// SizeofExpr
1105template< typename pass_t >
1106const ast::Expr * ast::Pass< pass_t >::visit( const ast::SizeofExpr * node ) {
1107 VISIT_START( node );
1108
1109 VISIT({
1110 guard_indexer guard { *this };
1111 maybe_accept( node, &SizeofExpr::result );
1112 }
1113 if ( node->type ) {
1114 maybe_accept( node, &SizeofExpr::type );
1115 } else {
1116 maybe_accept( node, &SizeofExpr::expr );
1117 }
1118 )
1119
1120 VISIT_END( Expr, node );
1121}
1122
1123//--------------------------------------------------------------------------
1124// AlignofExpr
1125template< typename pass_t >
1126const ast::Expr * ast::Pass< pass_t >::visit( const ast::AlignofExpr * node ) {
1127 VISIT_START( node );
1128
1129 VISIT({
1130 guard_indexer guard { *this };
1131 maybe_accept( node, &AlignofExpr::result );
1132 }
1133 if ( node->type ) {
1134 maybe_accept( node, &AlignofExpr::type );
1135 } else {
1136 maybe_accept( node, &AlignofExpr::expr );
1137 }
1138 )
1139
1140 VISIT_END( Expr, node );
1141}
1142
1143//--------------------------------------------------------------------------
1144// UntypedOffsetofExpr
1145template< typename pass_t >
1146const ast::Expr * ast::Pass< pass_t >::visit( const ast::UntypedOffsetofExpr * node ) {
1147 VISIT_START( node );
1148
1149 VISIT({
1150 guard_indexer guard { *this };
1151 maybe_accept( node, &UntypedOffsetofExpr::result );
1152 }
1153 maybe_accept( node, &UntypedOffsetofExpr::type );
1154 )
1155
1156 VISIT_END( Expr, node );
1157}
1158
1159//--------------------------------------------------------------------------
1160// OffsetofExpr
1161template< typename pass_t >
1162const ast::Expr * ast::Pass< pass_t >::visit( const ast::OffsetofExpr * node ) {
1163 VISIT_START( node );
1164
1165 VISIT({
1166 guard_indexer guard { *this };
1167 maybe_accept( node, &OffsetofExpr::result );
1168 }
1169 maybe_accept( node, &OffsetofExpr::type );
1170 )
1171
1172 VISIT_END( Expr, node );
1173}
1174
1175//--------------------------------------------------------------------------
1176// OffsetPackExpr
1177template< typename pass_t >
1178const ast::Expr * ast::Pass< pass_t >::visit( const ast::OffsetPackExpr * node ) {
1179 VISIT_START( node );
1180
1181 VISIT({
1182 guard_indexer guard { *this };
1183 maybe_accept( node, &OffsetPackExpr::result );
1184 }
1185 maybe_accept( node, &OffsetPackExpr::type );
1186 )
1187
1188 VISIT_END( Expr, node );
1189}
1190
1191//--------------------------------------------------------------------------
1192// LogicalExpr
1193template< typename pass_t >
1194const ast::Expr * ast::Pass< pass_t >::visit( const ast::LogicalExpr * node ) {
1195 VISIT_START( node );
1196
1197 VISIT({
1198 guard_indexer guard { *this };
1199 maybe_accept( node, &LogicalExpr::result );
1200 }
1201 maybe_accept( node, &LogicalExpr::arg1 );
1202 maybe_accept( node, &LogicalExpr::arg2 );
1203 )
1204
1205 VISIT_END( Expr, node );
1206}
1207
1208//--------------------------------------------------------------------------
1209// ConditionalExpr
1210template< typename pass_t >
1211const ast::Expr * ast::Pass< pass_t >::visit( const ast::ConditionalExpr * node ) {
1212 VISIT_START( node );
1213
1214 VISIT({
1215 guard_indexer guard { *this };
1216 maybe_accept( node, &ConditionalExpr::result );
1217 }
1218 maybe_accept( node, &ConditionalExpr::arg1 );
1219 maybe_accept( node, &ConditionalExpr::arg2 );
1220 maybe_accept( node, &ConditionalExpr::arg3 );
1221 )
1222
1223 VISIT_END( Expr, node );
1224}
1225
1226//--------------------------------------------------------------------------
1227// CommaExpr
1228template< typename pass_t >
1229const ast::Expr * ast::Pass< pass_t >::visit( const ast::CommaExpr * node ) {
1230 VISIT_START( node );
1231
1232 VISIT({
1233 guard_indexer guard { *this };
1234 maybe_accept( node, &CommaExpr::result );
1235 }
1236 maybe_accept( node, &CommaExpr::arg1 );
1237 maybe_accept( node, &CommaExpr::arg2 );
1238 )
1239
1240 VISIT_END( Expr, node );
1241}
1242
1243//--------------------------------------------------------------------------
1244// TypeExpr
1245template< typename pass_t >
1246const ast::Expr * ast::Pass< pass_t >::visit( const ast::TypeExpr * node ) {
1247 VISIT_START( node );
1248
1249 VISIT({
1250 guard_indexer guard { *this };
1251 maybe_accept( node, &TypeExpr::result );
1252 }
1253 maybe_accept( node, &TypeExpr::type );
1254 )
1255
1256 VISIT_END( Expr, node );
1257}
1258
1259//--------------------------------------------------------------------------
1260// AsmExpr
1261template< typename pass_t >
1262const ast::Expr * ast::Pass< pass_t >::visit( const ast::AsmExpr * node ) {
1263 VISIT_START( node );
1264
1265 VISIT({
1266 guard_indexer guard { *this };
1267 maybe_accept( node, &AsmExpr::result );
1268 }
1269 maybe_accept( node, &AsmExpr::inout );
1270 maybe_accept( node, &AsmExpr::constraint );
1271 maybe_accept( node, &AsmExpr::operand );
1272 )
1273
1274 VISIT_END( Expr, node );
1275}
1276
1277//--------------------------------------------------------------------------
1278// ImplicitCopyCtorExpr
1279template< typename pass_t >
1280const ast::Expr * ast::Pass< pass_t >::visit( const ast::ImplicitCopyCtorExpr * node ) {
1281 VISIT_START( node );
1282
1283 VISIT({
1284 guard_indexer guard { *this };
1285 maybe_accept( node, &ImplicitCopyCtorExpr::result );
1286 }
1287 maybe_accept( node, &ImplicitCopyCtorExpr::callExpr );
1288 maybe_accept( node, &ImplicitCopyCtorExpr::tempDecls );
1289 maybe_accept( node, &ImplicitCopyCtorExpr::returnDecls );
1290 maybe_accept( node, &ImplicitCopyCtorExpr::dtors );
1291 )
1292
1293 VISIT_END( Expr, node );
1294}
1295
1296//--------------------------------------------------------------------------
1297// ConstructorExpr
1298template< typename pass_t >
1299const ast::Expr * ast::Pass< pass_t >::visit( const ast::ConstructorExpr * node ) {
1300 VISIT_START( node );
1301
1302 VISIT({
1303 guard_indexer guard { *this };
1304 maybe_accept( node, &ConstructorExpr::result );
1305 }
1306 maybe_accept( node, &ConstructorExpr::callExpr );
1307 )
1308
1309 VISIT_END( Expr, node );
1310}
1311
1312//--------------------------------------------------------------------------
1313// CompoundLiteralExpr
1314template< typename pass_t >
1315const ast::Expr * ast::Pass< pass_t >::visit( const ast::CompoundLiteralExpr * node ) {
1316 VISIT_START( node );
1317
1318 VISIT({
1319 guard_indexer guard { *this };
1320 maybe_accept( node, &CompoundLiteralExpr::result );
1321 }
1322 maybe_accept( node, &CompoundLiteralExpr::init );
1323 )
1324
1325 VISIT_END( Expr, node );
1326}
1327
1328//--------------------------------------------------------------------------
1329// RangeExpr
1330template< typename pass_t >
1331const ast::Expr * ast::Pass< pass_t >::visit( const ast::RangeExpr * node ) {
1332 VISIT_START( node );
1333
1334 VISIT({
1335 guard_indexer guard { *this };
1336 maybe_accept( node, &RangeExpr::result );
1337 }
1338 maybe_accept( node, &RangeExpr::low );
1339 maybe_accept( node, &RangeExpr::high );
1340 )
1341
1342 VISIT_END( Expr, node );
1343}
1344
1345//--------------------------------------------------------------------------
1346// UntypedTupleExpr
1347template< typename pass_t >
1348const ast::Expr * ast::Pass< pass_t >::visit( const ast::UntypedTupleExpr * node ) {
1349 VISIT_START( node );
1350
1351 VISIT({
1352 guard_indexer guard { *this };
1353 maybe_accept( node, &UntypedTupleExpr::result );
1354 }
1355 maybe_accept( node, &UntypedTupleExpr::exprs );
1356 )
1357
1358 VISIT_END( Expr, node );
1359}
1360
1361//--------------------------------------------------------------------------
1362// TupleExpr
1363template< typename pass_t >
1364const ast::Expr * ast::Pass< pass_t >::visit( const ast::TupleExpr * node ) {
1365 VISIT_START( node );
1366
1367 VISIT({
1368 guard_indexer guard { *this };
1369 maybe_accept( node, &TupleExpr::result );
1370 }
1371 maybe_accept( node, &TupleExpr::exprs );
1372 )
1373
1374 VISIT_END( Expr, node );
1375}
1376
1377//--------------------------------------------------------------------------
1378// TupleIndexExpr
1379template< typename pass_t >
1380const ast::Expr * ast::Pass< pass_t >::visit( const ast::TupleIndexExpr * node ) {
1381 VISIT_START( node );
1382
1383 VISIT({
1384 guard_indexer guard { *this };
1385 maybe_accept( node, &TupleIndexExpr::result );
1386 }
1387 maybe_accept( node, &TupleIndexExpr::tuple );
1388 )
1389
1390 VISIT_END( Expr, node );
1391}
1392
1393//--------------------------------------------------------------------------
1394// TupleAssignExpr
1395template< typename pass_t >
1396const ast::Expr * ast::Pass< pass_t >::visit( const ast::TupleAssignExpr * node ) {
1397 VISIT_START( node );
1398
1399 VISIT({
1400 guard_indexer guard { *this };
1401 maybe_accept( node, &TupleAssignExpr::result );
1402 }
1403 maybe_accept( node, &TupleAssignExpr::stmtExpr );
1404 )
1405
1406 VISIT_END( Expr, node );
1407}
1408
1409//--------------------------------------------------------------------------
1410// StmtExpr
1411template< typename pass_t >
1412const ast::Expr * ast::Pass< pass_t >::visit( const ast::StmtExpr * node ) {
1413 VISIT_START( node );
1414
1415 VISIT(// don't want statements from outer CompoundStmts to be added to this StmtExpr
1416 // get the stmts that will need to be spliced in
1417 auto stmts_before = __pass::stmtsToAddBefore( pass, 0);
1418 auto stmts_after = __pass::stmtsToAddAfter ( pass, 0);
1419
1420 // These may be modified by subnode but most be restored once we exit this statemnet.
1421 ValueGuardPtr< const ast::TypeSubstitution * > __old_env( __pass::env( pass, 0) );
1422 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_before) >::type > __old_decls_before( stmts_before );
1423 ValueGuardPtr< typename std::remove_pointer< decltype(stmts_after ) >::type > __old_decls_after ( stmts_after );
1424
1425 {
1426 guard_indexer guard { *this };
1427 maybe_accept( node, &StmtExpr::result );
1428 }
1429 maybe_accept( node, &StmtExpr::stmts );
1430 maybe_accept( node, &StmtExpr::returnDecls );
1431 maybe_accept( node, &StmtExpr::dtors );
1432 )
1433
1434 VISIT_END( Expr, node );
1435}
1436
1437//--------------------------------------------------------------------------
1438// UniqueExpr
1439template< typename pass_t >
1440const ast::Expr * ast::Pass< pass_t >::visit( const ast::UniqueExpr * node ) {
1441 VISIT_START( node );
1442
1443 VISIT({
1444 guard_indexer guard { *this };
1445 maybe_accept( node, &UniqueExpr::result );
1446 }
1447 maybe_accept( node, &UniqueExpr::expr );
1448 )
1449
1450 VISIT_END( Expr, node );
1451}
1452
1453//--------------------------------------------------------------------------
1454// UntypedInitExpr
1455template< typename pass_t >
1456const ast::Expr * ast::Pass< pass_t >::visit( const ast::UntypedInitExpr * node ) {
1457 VISIT_START( node );
1458
1459 VISIT({
1460 guard_indexer guard { *this };
1461 maybe_accept( node, &UntypedInitExpr::result );
1462 }
1463 maybe_accept( node, &UntypedInitExpr::expr );
1464 // not currently visiting initAlts, but this doesn't matter since this node is only used in the resolver.
1465 )
1466
1467 VISIT_END( Expr, node );
1468}
1469
1470//--------------------------------------------------------------------------
1471// InitExpr
1472template< typename pass_t >
1473const ast::Expr * ast::Pass< pass_t >::visit( const ast::InitExpr * node ) {
1474 VISIT_START( node );
1475
1476 VISIT({
1477 guard_indexer guard { *this };
1478 maybe_accept( node, &InitExpr::result );
1479 }
1480 maybe_accept( node, &InitExpr::expr );
1481 maybe_accept( node, &InitExpr::designation );
1482 )
1483
1484 VISIT_END( Expr, node );
1485}
1486
1487//--------------------------------------------------------------------------
1488// DeletedExpr
1489template< typename pass_t >
1490const ast::Expr * ast::Pass< pass_t >::visit( const ast::DeletedExpr * node ) {
1491 VISIT_START( node );
1492
1493 VISIT({
1494 guard_indexer guard { *this };
1495 maybe_accept( node, &DeletedExpr::result );
1496 }
1497 maybe_accept( node, &DeletedExpr::expr );
1498 // don't visit deleteStmt, because it is a pointer to somewhere else in the tree.
1499 )
1500
1501 VISIT_END( Expr, node );
1502}
1503
1504//--------------------------------------------------------------------------
1505// DefaultArgExpr
1506template< typename pass_t >
1507const ast::Expr * ast::Pass< pass_t >::visit( const ast::DefaultArgExpr * node ) {
1508 VISIT_START( node );
1509
1510 VISIT({
1511 guard_indexer guard { *this };
1512 maybe_accept( node, &DefaultArgExpr::result );
1513 }
1514 maybe_accept( node, &DefaultArgExpr::expr );
1515 )
1516
1517 VISIT_END( Expr, node );
1518}
1519
1520//--------------------------------------------------------------------------
1521// GenericExpr
1522template< typename pass_t >
1523const ast::Expr * ast::Pass< pass_t >::visit( const ast::GenericExpr * node ) {
1524 VISIT_START( node );
1525
1526 VISIT({
1527 guard_indexer guard { *this };
1528 maybe_accept( node, &GenericExpr::result );
1529 }
1530 maybe_accept( node, &GenericExpr::control );
1531
1532 std::vector<GenericExpr::Association> new_kids;
1533 new_kids.reserve(node->associations.size());
1534 bool mutated = false;
1535 for( const auto & assoc : node->associations ) {
1536 Type * type = nullptr;
1537 if( assoc.type ) {
1538 guard_indexer guard { *this };
1539 type = assoc.type->accept( *this );
1540 if( type != assoc.type ) mutated = true;
1541 }
1542 Expr * expr = nullptr;
1543 if( assoc.expr ) {
1544 expr = assoc.expr->accept( *this );
1545 if( expr != assoc.expr ) mutated = true;
1546 }
1547 new_kids.emplace_back( type, expr );
1548 }
1549
1550 if(mutated) {
1551 auto n = mutate(node);
1552 n->associations = std::move( new_kids );
1553 node = n;
1554 }
1555 )
1556
1557 VISIT_END( Expr, node );
1558}
1559
1560
1561
1562
1563//--------------------------------------------------------------------------
1564// SingleInit
1565template< typename pass_t >
1566const ast::Init * ast::Pass< pass_t >::visit( const ast::SingleInit * node ) {
1567 VISIT_START( node );
1568
1569 VISIT(
1570 maybe_accept( node, &SingleInit::value );
1571 )
1572
1573 VISIT_END( Init, node );
1574}
1575
1576//--------------------------------------------------------------------------
1577// ListInit
1578template< typename pass_t >
1579const ast::Init * ast::Pass< pass_t >::visit( const ast::ListInit * node ) {
1580 VISIT_START( node );
1581
1582 VISIT(
1583 maybe_accept( node, &ListInit::designations );
1584 maybe_accept( node, &ListInit::initializers );
1585 )
1586
1587 VISIT_END( Init, node );
1588}
1589
1590//--------------------------------------------------------------------------
1591// ConstructorInit
1592template< typename pass_t >
1593const ast::Init * ast::Pass< pass_t >::visit( const ast::ConstructorInit * node ) {
1594 VISIT_START( node );
1595
1596 VISIT(
1597 maybe_accept( node, &ConstructorInit::ctor );
1598 maybe_accept( node, &ConstructorInit::dtor );
1599 maybe_accept( node, &ConstructorInit::init );
1600 )
1601
1602 VISIT_END( Init, node );
1603}
1604
1605//--------------------------------------------------------------------------
1606// Attribute
1607template< typename pass_t >
1608const ast::Attribute * ast::Pass< pass_t >::visit( const ast::Attribute * node ) {
1609 VISIT_START( node );
1610
1611 VISIT(
1612 maybe_accept( node, &Attribute::parameters );
1613 )
1614
1615 VISIT_END( Attribute, node );
1616}
1617
1618// //--------------------------------------------------------------------------
1619// // TypeSubstitution
1620// template< typename pass_t >
1621// const ast::TypeSubstitution * ast::Pass< pass_t >::visit( const ast::TypeSubstitution * node ) {
1622// VISIT_START( node );
1623
1624// VISIT(
1625// {
1626// bool mutated = false;
1627// std::unordered_map< std::string, ast::ptr< ast::Type > > new_map;
1628// for ( const auto & p : node->typeEnv ) {
1629// guard_indexer guard { *this };
1630// auto new_node = p.second->accept( *this );
1631// if (new_node != p.second) mutated = false;
1632// new_map.insert({ p.first, new_node });
1633// }
1634// if (mutated) {
1635// auto new_node = mutate( node );
1636// new_node->typeEnv.swap( new_map );
1637// node = new_node;
1638// }
1639// }
1640
1641// {
1642// bool mutated = false;
1643// std::unordered_map< std::string, ast::ptr< ast::Expr > > new_map;
1644// for ( const auto & p : node->varEnv ) {
1645// guard_indexer guard { *this };
1646// auto new_node = p.second->accept( *this );
1647// if (new_node != p.second) mutated = false;
1648// new_map.insert({ p.first, new_node });
1649// }
1650// if (mutated) {
1651// auto new_node = mutate( node );
1652// new_node->varEnv.swap( new_map );
1653// node = new_node;
1654// }
1655// }
1656// )
1657
1658// VISIT_END( TypeSubstitution, node );
1659// }
1660
1661#undef VISIT_START
1662#undef VISIT
1663#undef VISIT_END
Note: See TracBrowser for help on using the repository browser.