source: src/AST/Util.cpp @ 41d3c8d

ADTast-experimentalenumpthread-emulationqualifiedEnum
Last change on this file since 41d3c8d was 33b7d49, checked in by Andrew Beach <ajbeach@…>, 3 years ago

Added another check to checkInvariants for code locations. I also went through and made sure you can put it every after every new AST pass not followed by a forceFillCodeLocations.

  • Property mode set to 100644
File size: 1.8 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2019 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// Util.hpp -- General utilities for working with the AST.
8//
9// Author           : Andrew Beach
10// Created On       : Wed Jan 19  9:46:00 2022
11// Last Modified By : Andrew Beach
12// Last Modified On : Fri Mar 11 18:07:00 2022
13// Update Count     : 1
14//
15
16#include "Util.hpp"
17
18#include "Node.hpp"
19#include "ParseNode.hpp"
20#include "Pass.hpp"
21#include "TranslationUnit.hpp"
22
23#include <vector>
24
25namespace ast {
26
27namespace {
28
29/// Check that ast::ptr/strong references do not form a cycle.
30struct NoStrongCyclesCore {
31        std::vector<const Node *> parents;
32
33        void previsit( const Node * node ) {
34                for ( auto & parent : parents ) {
35                        assert( parent != node );
36                }
37                parents.push_back( node );
38        }
39
40        void postvisit( const Node * node ) {
41                assert( !parents.empty() );
42                assert( parents.back() == node );
43                parents.pop_back();
44        }
45};
46
47/// Check that every note that can has a set CodeLocation.
48struct SetCodeLocationsCore {
49        void previsit( const ParseNode * node ) {
50                assert( node->location.isSet() );
51        }
52};
53
54struct InvariantCore {
55        // To save on the number of visits: this is a kind of composed core.
56        // None of the passes should make changes so ordering doesn't matter.
57        NoStrongCyclesCore no_strong_cycles;
58        SetCodeLocationsCore set_code_locations;
59
60        void previsit( const Node * node ) {
61                no_strong_cycles.previsit( node );
62        }
63
64        void previsit( const ParseNode * node ) {
65                no_strong_cycles.previsit( node );
66                set_code_locations.previsit( node );
67        }
68
69        void postvisit( const Node * node ) {
70                no_strong_cycles.postvisit( node );
71        }
72};
73
74} // namespace
75
76void checkInvariants( TranslationUnit & transUnit ) {
77        ast::Pass<InvariantCore>::run( transUnit );
78}
79
80} // namespace ast
Note: See TracBrowser for help on using the repository browser.