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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
use std::collections::{hash_map, HashMap, HashSet};
use std::path::{Path, PathBuf};
use petgraph::{
algo::kosaraju_scc, graph::NodeIndex, stable_graph::StableGraph, visit::Dfs, Direction,
};
use serde::{Deserialize, Serialize};
use crate::c_langs_macros::is_specials;
use crate::node::Node;
use crate::langs::*;
use crate::languages::language_preproc::*;
use crate::tools::*;
use crate::traits::*;
#[derive(Debug, Default, Deserialize, Serialize)]
pub struct PreprocFile {
pub direct_includes: HashSet<String>,
pub indirect_includes: HashSet<String>,
pub macros: HashSet<String>,
}
#[derive(Debug, Default, Deserialize, Serialize)]
pub struct PreprocResults {
pub files: HashMap<PathBuf, PreprocFile>,
}
impl PreprocFile {
pub fn new_macros(macros: &[&str]) -> Self {
let mut pf = Self::default();
for m in macros {
pf.macros.insert((*m).to_string());
}
pf
}
}
pub fn get_macros<S: ::std::hash::BuildHasher>(
file: &Path,
files: &HashMap<PathBuf, PreprocFile, S>,
) -> HashSet<String> {
let mut macros = HashSet::new();
if let Some(pf) = files.get(file) {
for m in pf.macros.iter() {
macros.insert(m.to_string());
}
for f in pf.indirect_includes.iter() {
if let Some(pf) = files.get(&PathBuf::from(f)) {
for m in pf.macros.iter() {
macros.insert(m.to_string());
}
}
}
}
macros
}
pub fn fix_includes<S: ::std::hash::BuildHasher>(
files: &mut HashMap<PathBuf, PreprocFile, S>,
all_files: &HashMap<String, Vec<PathBuf>, S>,
) {
let mut nodes: HashMap<PathBuf, NodeIndex> = HashMap::new();
let mut g = StableGraph::new();
for (file, pf) in files.iter() {
let node = match nodes.entry(file.clone()) {
hash_map::Entry::Occupied(l) => *l.get(),
hash_map::Entry::Vacant(p) => *p.insert(g.add_node(file.clone())),
};
let direct_includes = &pf.direct_includes;
for i in direct_includes {
let possibilities = guess_file(file, i, all_files);
for i in possibilities {
if &i != file {
let i = match nodes.entry(i.clone()) {
hash_map::Entry::Occupied(l) => *l.get(),
hash_map::Entry::Vacant(p) => *p.insert(g.add_node(i)),
};
g.add_edge(node, i, 0);
} else {
eprintln!("Warning: possible self inclusion {:?}", file);
}
}
}
}
let mut scc = kosaraju_scc(&g);
let mut scc_map: HashMap<NodeIndex, HashSet<String>> = HashMap::new();
for component in scc.iter_mut() {
if component.len() > 1 {
let mut incoming = Vec::new();
let mut outgoing = Vec::new();
let mut paths = HashSet::new();
for c in component.iter() {
for i in g.neighbors_directed(*c, Direction::Incoming) {
if !component.contains(&i) && !incoming.contains(&i) {
incoming.push(i);
}
}
for o in g.neighbors_directed(*c, Direction::Outgoing) {
if !component.contains(&o) && !outgoing.contains(&o) {
outgoing.push(o);
}
}
}
let replacement = g.add_node(PathBuf::from(""));
for i in incoming.drain(..) {
g.add_edge(i, replacement, 0);
}
for o in outgoing.drain(..) {
g.add_edge(replacement, o, 0);
}
for c in component.drain(..) {
let path = g.remove_node(c).unwrap();
paths.insert(path.to_str().unwrap().to_string());
*nodes.get_mut(&path).unwrap() = replacement;
}
eprintln!("Warning: possible include cycle:");
for p in paths.iter() {
eprintln!(" - {:?}", p);
}
eprintln!();
scc_map.insert(replacement, paths);
}
}
for (path, node) in nodes {
let mut dfs = Dfs::new(&g, node);
if let Some(pf) = files.get_mut(&path) {
let x_inc = &mut pf.indirect_includes;
while let Some(node) = dfs.next(&g) {
let w = g.node_weight(node).unwrap();
if w == &PathBuf::from("") {
let paths = scc_map.get(&node);
if let Some(paths) = paths {
for p in paths {
x_inc.insert(p.to_string());
}
} else {
eprintln!("DEBUG: {:?} {:?}", path, node);
}
} else {
x_inc.insert(w.to_str().unwrap().to_string());
}
}
} else {
}
}
}
pub fn preprocess(parser: &PreprocParser, path: &Path, results: &mut PreprocResults) {
let node = parser.get_root();
let mut cursor = node.object().walk();
let mut stack = Vec::new();
let code = parser.get_code();
let mut file_result = PreprocFile::default();
stack.push(node);
while let Some(node) = stack.pop() {
cursor.reset(node.object());
if cursor.goto_first_child() {
loop {
stack.push(Node::new(cursor.node()));
if !cursor.goto_next_sibling() {
break;
}
}
}
let id = Preproc::from(node.object().kind_id());
match id {
Preproc::Define | Preproc::Undef => {
cursor.reset(node.object());
cursor.goto_first_child();
let identifier = cursor.node();
if identifier.kind_id() == Preproc::Identifier {
let r#macro = identifier.utf8_text(code).unwrap();
if !is_specials(r#macro) {
file_result.macros.insert(r#macro.to_string());
}
}
}
Preproc::PreprocInclude => {
cursor.reset(node.object());
cursor.goto_first_child();
let file = cursor.node();
if file.kind_id() == Preproc::StringLiteral {
let file = &code[file.start_byte() + 1..file.end_byte() - 1];
let start = file.iter().position(|&c| c != b' ' && c != b'\t').unwrap();
let end = file.iter().rposition(|&c| c != b' ' && c != b'\t').unwrap();
let file = &file[start..=end];
let file = String::from_utf8(file.to_vec()).unwrap();
file_result.direct_includes.insert(file);
}
}
_ => {}
}
}
results.files.insert(path.to_path_buf(), file_result);
}