Context Navigation

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

ADTast-experimentalpthread-emulation

Last change on this file since a9762dc was a9762dc, checked in by Thierry Delisle <tdelisle@…>, 20 months ago
Passvisitor can now track code location
Property mode set to `100644`
File size: 64.2 KB

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

Note: See TracBrowser for help on using the repository browser.

Download in other formats: