This repository has been archived by the owner on Dec 29, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 256
/
lib.rs
569 lines (499 loc) · 19 KB
/
lib.rs
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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
#![warn(rust_2018_idioms)]
#[macro_use]
extern crate derive_new;
#[macro_use]
extern crate log;
extern crate rls_data as data;
extern crate rls_span as span;
mod analysis;
mod listings;
mod loader;
mod lowering;
mod raw;
mod symbol_query;
#[cfg(test)]
mod test;
mod util;
use analysis::Analysis;
pub use analysis::{Def, Ident, IdentKind, Ref};
pub use loader::{AnalysisLoader, CargoAnalysisLoader, SearchDirectory, Target};
pub use raw::{name_space_for_def_kind, read_analysis_from_files, Crate, CrateId, DefKind};
pub use symbol_query::SymbolQuery;
use std::collections::HashMap;
use std::fmt::Debug;
use std::path::{Path, PathBuf};
use std::sync::Mutex;
use std::time::{Instant, SystemTime};
use std::u64;
pub struct AnalysisHost<L: AnalysisLoader = CargoAnalysisLoader> {
analysis: Mutex<Option<Analysis>>,
master_crate_map: Mutex<HashMap<CrateId, u32>>,
loader: Mutex<L>,
}
pub type AResult<T> = Result<T, AError>;
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
pub enum AError {
MutexPoison,
Unclassified,
}
#[derive(Debug, Clone)]
pub struct SymbolResult {
pub id: Id,
pub name: String,
pub kind: raw::DefKind,
pub span: Span,
pub parent: Option<Id>,
}
impl SymbolResult {
fn new(id: Id, def: &Def) -> SymbolResult {
SymbolResult {
id,
name: def.name.clone(),
span: def.span.clone(),
kind: def.kind,
parent: def.parent,
}
}
}
pub type Span = span::Span<span::ZeroIndexed>;
/// A common identifier for definitions, references etc. This is effectively a
/// `DefId` with globally unique crate number (instead of a compiler generated
/// crate-local number).
#[derive(Copy, Clone, Eq, PartialEq, Debug, Hash, new)]
pub struct Id(u64);
impl Id {
fn from_crate_and_local(crate_id: u32, local_id: u32) -> Id {
// Use global crate number for high order bits,
// then index for least significant bits.
Id((u64::from(crate_id) << 32) | u64::from(local_id))
}
}
/// Used to indicate a missing index in the Id.
pub const NULL: Id = Id(u64::MAX);
macro_rules! clone_field {
($field: ident) => {
|x| x.$field.clone()
};
}
macro_rules! def_span {
($analysis: expr, $id: expr) => {
$analysis.with_defs_and_then($id, |def| Some(def.span.clone()))
};
}
impl AnalysisHost<CargoAnalysisLoader> {
pub fn new(target: Target) -> AnalysisHost {
AnalysisHost {
analysis: Mutex::new(None),
master_crate_map: Mutex::new(HashMap::new()),
loader: Mutex::new(CargoAnalysisLoader::new(target)),
}
}
}
impl<L: AnalysisLoader> AnalysisHost<L> {
pub fn new_with_loader(loader: L) -> Self {
Self {
analysis: Mutex::new(None),
master_crate_map: Mutex::new(HashMap::new()),
loader: Mutex::new(loader),
}
}
/// Reloads given data passed in `analysis`. This will first check and read
/// on-disk data (just like `reload`). It then imports the data we're
/// passing in directly.
pub fn reload_from_analysis(
&self,
analysis: Vec<data::Analysis>,
path_prefix: &Path,
base_dir: &Path,
blacklist: &[impl AsRef<str> + Debug],
) -> AResult<()> {
self.reload_with_blacklist(path_prefix, base_dir, blacklist)?;
let crates: Vec<_> = analysis
.into_iter()
.map(|analysis| raw::Crate::new(analysis, SystemTime::now(), None, None))
.collect();
lowering::lower(crates, base_dir, self, |host, per_crate, id| {
let mut a = host.analysis.lock()?;
a.as_mut().unwrap().update(id, per_crate);
Ok(())
})
}
pub fn reload(&self, path_prefix: &Path, base_dir: &Path) -> AResult<()> {
self.reload_with_blacklist(path_prefix, base_dir, &[] as &[&str])
}
pub fn reload_with_blacklist(
&self,
path_prefix: &Path,
base_dir: &Path,
blacklist: &[impl AsRef<str> + Debug],
) -> AResult<()> {
trace!("reload_with_blacklist {:?} {:?} {:?}", path_prefix, base_dir, blacklist);
let empty = self.analysis.lock()?.is_none();
if empty || self.loader.lock()?.needs_hard_reload(path_prefix) {
return self.hard_reload_with_blacklist(path_prefix, base_dir, blacklist);
}
let timestamps = self.analysis.lock()?.as_ref().unwrap().timestamps();
let raw_analysis = {
let loader = self.loader.lock()?;
read_analysis_from_files(&*loader, timestamps, blacklist)
};
lowering::lower(raw_analysis, base_dir, self, |host, per_crate, id| {
let mut a = host.analysis.lock()?;
a.as_mut().unwrap().update(id, per_crate);
Ok(())
})
}
/// Reloads the entire project's analysis data.
pub fn hard_reload(&self, path_prefix: &Path, base_dir: &Path) -> AResult<()> {
self.hard_reload_with_blacklist(path_prefix, base_dir, &[] as &[&str])
}
pub fn hard_reload_with_blacklist(
&self,
path_prefix: &Path,
base_dir: &Path,
blacklist: &[impl AsRef<str> + Debug],
) -> AResult<()> {
trace!("hard_reload {:?} {:?}", path_prefix, base_dir);
// We're going to create a dummy AnalysisHost that we will fill with data,
// then once we're done, we'll swap its data into self.
let mut fresh_host = self.loader.lock()?.fresh_host();
fresh_host.analysis = Mutex::new(Some(Analysis::new()));
{
let mut fresh_loader = fresh_host.loader.lock().unwrap();
fresh_loader.set_path_prefix(path_prefix); // TODO: Needed?
let raw_analysis = read_analysis_from_files(&*fresh_loader, HashMap::new(), blacklist);
lowering::lower(raw_analysis, base_dir, &fresh_host, |host, per_crate, id| {
let mut a = host.analysis.lock()?;
a.as_mut().unwrap().update(id, per_crate);
Ok(())
})?;
}
// To guarantee a consistent state and no corruption in case an error
// happens during reloading, we need to swap data with a dummy host in
// a single atomic step. We can't lock and swap every member at a time,
// as this can possibly lead to inconsistent state, but now this can possibly
// deadlock, which isn't that good. Ideally we should have guaranteed
// exclusive access to AnalysisHost as a whole to perform a reliable swap.
macro_rules! swap_mutex_fields {
($($name:ident),*) => {
// First, we need exclusive access to every field before swapping
$(let mut $name = self.$name.lock()?;)*
// Then, we can swap every field
$(*$name = fresh_host.$name.into_inner().unwrap();)*
};
}
swap_mutex_fields!(analysis, master_crate_map, loader);
Ok(())
}
/// Note that `self.has_def()` =/> `self.goto_def().is_ok()`, since if the
/// Def is in an api crate, there is no reasonable Span to jump to.
pub fn has_def(&self, id: Id) -> bool {
match self.analysis.lock() {
Ok(a) => a.as_ref().unwrap().has_def(id),
_ => false,
}
}
pub fn get_def(&self, id: Id) -> AResult<Def> {
self.with_analysis(|a| a.with_defs(id, Clone::clone))
}
pub fn goto_def(&self, span: &Span) -> AResult<Span> {
self.with_analysis(|a| a.def_id_for_span(span).and_then(|id| def_span!(a, id)))
}
pub fn for_each_child_def<F, T>(&self, id: Id, f: F) -> AResult<Vec<T>>
where
F: FnMut(Id, &Def) -> T,
{
self.with_analysis(|a| a.for_each_child(id, f))
}
pub fn def_parents(&self, id: Id) -> AResult<Vec<(Id, String)>> {
self.with_analysis(|a| {
let mut result = vec![];
let mut next = id;
loop {
match a.with_defs_and_then(next, |def| {
def.parent.and_then(|p| a.with_defs(p, |def| (p, def.name.clone())))
}) {
Some((id, name)) => {
result.insert(0, (id, name));
next = id;
}
None => {
return Some(result);
}
}
}
})
}
/// Returns the name of each crate in the program and the id of the root
/// module of that crate.
pub fn def_roots(&self) -> AResult<Vec<(Id, String)>> {
self.with_analysis(|a| {
Some(
a.per_crate
.iter()
.filter_map(|(crate_id, data)| {
data.root_id.map(|id| (id, crate_id.name.clone()))
})
.collect(),
)
})
}
pub fn id(&self, span: &Span) -> AResult<Id> {
self.with_analysis(|a| a.def_id_for_span(span))
}
/// Like id, but will only return a value if it is in the same crate as span.
pub fn crate_local_id(&self, span: &Span) -> AResult<Id> {
self.with_analysis(|a| a.local_def_id_for_span(span))
}
// `include_decl` means the declaration will be included as the first result.
// `force_unique_spans` means that if any reference is a reference to multiple
// defs, then we return an empty vector (in which case, even if include_decl
// is true, the result will be empty).
// Note that for large numbers of refs, if `force_unique_spans` is true, then
// this function might take significantly longer to execute.
pub fn find_all_refs(
&self,
span: &Span,
include_decl: bool,
force_unique_spans: bool,
) -> AResult<Vec<Span>> {
let t_start = Instant::now();
let result = self.with_analysis(|a| {
a.def_id_for_span(span).map(|id| {
if force_unique_spans && a.aliased_imports.contains(&id) {
return vec![];
}
let decl = if include_decl { def_span!(a, id) } else { None };
let refs = a.with_ref_spans(id, |refs| {
if force_unique_spans {
for r in refs.iter() {
match a.ref_for_span(r) {
Some(Ref::Id(_)) => {}
_ => return None,
}
}
}
Some(refs.clone())
});
refs.map(|refs| decl.into_iter().chain(refs.into_iter()).collect::<Vec<_>>())
.unwrap_or_else(|| vec![])
})
});
let time = t_start.elapsed();
info!(
"find_all_refs: {}s",
time.as_secs() as f64 + f64::from(time.subsec_nanos()) / 1_000_000_000.0
);
result
}
pub fn show_type(&self, span: &Span) -> AResult<String> {
self.with_analysis(|a| {
a.def_id_for_span(span)
.and_then(|id| a.with_defs(id, clone_field!(value)))
.or_else(|| a.with_globs(span, clone_field!(value)))
})
}
pub fn docs(&self, span: &Span) -> AResult<String> {
self.with_analysis(|a| {
a.def_id_for_span(span).and_then(|id| a.with_defs(id, clone_field!(docs)))
})
}
/// Finds Defs with names that starting with (ignoring case) `stem`
pub fn matching_defs(&self, stem: &str) -> AResult<Vec<Def>> {
self.query_defs(SymbolQuery::prefix(stem))
}
pub fn query_defs(&self, query: SymbolQuery) -> AResult<Vec<Def>> {
let t_start = Instant::now();
let result = self.with_analysis(move |a| {
let defs = a.query_defs(query);
info!("query_defs {:?}", &defs);
Some(defs)
});
let time = t_start.elapsed();
info!(
"query_defs: {}",
time.as_secs() as f64 + f64::from(time.subsec_nanos()) / 1_000_000_000.0
);
result
}
/// Search for a symbol name, returns a list of spans matching defs and refs
/// for that name.
pub fn search(&self, name: &str) -> AResult<Vec<Span>> {
let t_start = Instant::now();
let result = self.with_analysis(|a| {
Some(a.with_def_names(name, |defs| {
info!("defs: {:?}", defs);
defs.iter()
.flat_map(|id| {
a.with_ref_spans(*id, |refs| {
Some(
def_span!(a, *id)
.into_iter()
.chain(refs.iter().cloned())
.collect::<Vec<_>>(),
)
})
.or_else(|| def_span!(a, *id).map(|s| vec![s]))
.unwrap_or_else(Vec::new)
.into_iter()
})
.collect::<Vec<Span>>()
}))
});
let time = t_start.elapsed();
info!(
"search: {}s",
time.as_secs() as f64 + f64::from(time.subsec_nanos()) / 1_000_000_000.0
);
result
}
// TODO refactor search and find_all_refs to use this
// Includes all references and the def, the def is always first.
pub fn find_all_refs_by_id(&self, id: Id) -> AResult<Vec<Span>> {
let t_start = Instant::now();
let result = self.with_analysis(|a| {
a.with_ref_spans(id, |refs| {
Some(def_span!(a, id).into_iter().chain(refs.iter().cloned()).collect::<Vec<_>>())
})
.or_else(|| def_span!(a, id).map(|s| vec![s]))
});
let time = t_start.elapsed();
info!(
"find_all_refs_by_id: {}s",
time.as_secs() as f64 + f64::from(time.subsec_nanos()) / 1_000_000_000.0
);
result
}
pub fn find_impls(&self, id: Id) -> AResult<Vec<Span>> {
self.with_analysis(|a| Some(a.for_all_crates(|c| c.impls.get(&id).cloned())))
}
/// Search for a symbol name, returning a list of def_ids for that name.
pub fn search_for_id(&self, name: &str) -> AResult<Vec<Id>> {
self.with_analysis(|a| Some(a.with_def_names(name, Clone::clone)))
}
/// Returns all identifiers which overlap the given span.
#[cfg(feature = "idents")]
pub fn idents(&self, span: &Span) -> AResult<Vec<Ident>> {
self.with_analysis(|a| Some(a.idents(span)))
}
pub fn symbols(&self, file_name: &Path) -> AResult<Vec<SymbolResult>> {
self.with_analysis(|a| {
a.with_defs_per_file(file_name, |ids| {
ids.iter()
.map(|id| a.with_defs(*id, |def| SymbolResult::new(*id, def)).unwrap())
.collect()
})
})
}
pub fn doc_url(&self, span: &Span) -> AResult<String> {
// e.g., https://doc.rust-lang.org/nightly/std/string/String.t.html
self.with_analysis(|a| {
a.def_id_for_span(span).and_then(|id| {
a.with_defs_and_then(id, |def| AnalysisHost::<L>::mk_doc_url(def, a))
})
})
}
// e.g., https://github.com/rust-lang/rust/blob/master/src/liballoc/string.rs#L261-L263
pub fn src_url(&self, span: &Span) -> AResult<String> {
// FIXME would be nice not to do this every time.
let path_prefix = self.loader.lock().unwrap().abs_path_prefix();
self.with_analysis(|a| {
a.def_id_for_span(span).and_then(|id| {
a.with_defs_and_then(id, |def| {
AnalysisHost::<L>::mk_src_url(def, path_prefix.as_ref(), a)
})
})
})
}
fn with_analysis<F, T>(&self, f: F) -> AResult<T>
where
F: FnOnce(&Analysis) -> Option<T>,
{
let a = self.analysis.lock()?;
if let Some(ref a) = *a {
f(a).ok_or(AError::Unclassified)
} else {
Err(AError::Unclassified)
}
}
fn mk_doc_url(def: &Def, analysis: &Analysis) -> Option<String> {
if !def.distro_crate {
return None;
}
if def.parent.is_none() && def.qualname.contains('<') {
debug!("mk_doc_url, bailing, found generic qualname: `{}`", def.qualname);
return None;
}
match def.parent {
Some(p) => analysis.with_defs(p, |parent| match def.kind {
DefKind::Field
| DefKind::Method
| DefKind::Tuple
| DefKind::TupleVariant
| DefKind::StructVariant => {
let ns = name_space_for_def_kind(def.kind);
let mut res = AnalysisHost::<L>::mk_doc_url(parent, analysis)
.unwrap_or_else(|| "".into());
res.push_str(&format!("#{}.{}", def.name, ns));
res
}
DefKind::Mod => {
let parent_qualpath = parent.qualname.replace("::", "/");
format!(
"{}/{}/{}/",
analysis.doc_url_base,
parent_qualpath.trim_end_matches('/'),
def.name,
)
}
_ => {
let parent_qualpath = parent.qualname.replace("::", "/");
let ns = name_space_for_def_kind(def.kind);
format!(
"{}/{}/{}.{}.html",
analysis.doc_url_base, parent_qualpath, def.name, ns,
)
}
}),
None => {
let qualpath = def.qualname.replace("::", "/");
let ns = name_space_for_def_kind(def.kind);
Some(format!("{}/{}.{}.html", analysis.doc_url_base, qualpath, ns,))
}
}
}
fn mk_src_url(def: &Def, path_prefix: Option<&PathBuf>, analysis: &Analysis) -> Option<String> {
if !def.distro_crate {
return None;
}
let file_path = &def.span.file;
let file_path = file_path.strip_prefix(path_prefix?).ok()?;
Some(format!(
"{}/{}#L{}-L{}",
analysis.src_url_base,
file_path.to_str().unwrap(),
def.span.range.row_start.one_indexed().0,
def.span.range.row_end.one_indexed().0
))
}
}
impl ::std::fmt::Display for Id {
fn fmt(&self, f: &mut ::std::fmt::Formatter<'_>) -> ::std::fmt::Result {
::std::fmt::Display::fmt(&self.0, f)
}
}
impl ::std::error::Error for AError {}
impl ::std::fmt::Display for AError {
fn fmt(&self, f: &mut ::std::fmt::Formatter<'_>) -> ::std::fmt::Result {
let description = match self {
AError::MutexPoison => "poison error in a mutex (usually a secondary error)",
AError::Unclassified => "unknown error",
};
write!(f, "{}", description)
}
}
impl<T> From<::std::sync::PoisonError<T>> for AError {
fn from(_: ::std::sync::PoisonError<T>) -> AError {
AError::MutexPoison
}
}