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