1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
// This file is part of the AspectC++ compiler 'ac++'.
// Copyright (C) 1999-2003 The 'ac++' developers (see aspectc.org)
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of
// the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public
// License along with this program; if not, write to the Free
// Software Foundation, Inc., 59 Temple Place, Suite 330, Boston,
// MA 02111-1307 USA
#ifndef __include_graph_h__
#define __include_graph_h__
// Visitor, which expands all project-local includes
#include "Puma/PreVisitor.h"
namespace Puma {
class CTranslationUnit;
class Unit;
class CProject;
}
using namespace Puma;
#include <map>
using std::map;
#include <set>
using std::set;
#include <iostream>
using std::ostream;
using std::endl;
class IncludeGraph : public PreVisitor {
struct Node {
const Unit *_unit;
mutable bool _visited; // for cycle detection
set<Node*> _includes;
Node (const Unit *u) : _unit (u), _visited (false) {}
void dump () const;
};
// associates a node object to each unit
typedef map<const Unit*, Node> Map;
Map _nodes;
// the project to which all this belongs
CProject &_project;
// Go through the nodes of the syntax tree.
void iterateNodes (PreTree*);
// Visiting the parts of the preprocessor syntax tree.
void visitPreIncludeDirective_Pre (PreIncludeDirective*);
// find/create an entry in '_nodes'
Node &find (const Unit*);
// Checks whether there is a path from node 'a' to 'b' in the include graph
bool includes (const Node &a, const Node &b) const;
// collect all units included by some node
void included_files (const Node &node, set<const Unit*> &units,
bool only_project = true) const;
// Reset the 'visited' flag of all nodes in the DAG
void reset_visited () const;
public:
IncludeGraph (CProject &p) : _project (p) {}
IncludeGraph (CProject &p, CTranslationUnit &tunit) : _project (p) {
init (tunit);
}
virtual ~IncludeGraph () {}
// Fills the include graph
void init (CTranslationUnit &tunit);
// Checks whether on unit 'a' directly or indirecly includes another unit 'b'
bool includes (const Unit *a, const Unit *b) const;
// Get all files the are directly or indirectly included
bool included_files (const Unit *unit, set<const Unit*> &units,
bool only_project = true) const;
// Add an edge to the include graph from 'a' to 'b'
void add_edge (const Unit *a, const Unit *b);
// print all nodes
void dump () const;
};
#endif // __include_graph_h__
|
