]>
Commit | Line | Data |
---|---|---|
f20569fa XL |
1 | //! Types for tracking pieces of source code within a crate. |
2 | //! | |
3 | //! The [`SourceMap`] tracks all the source code used within a single crate, mapping | |
4 | //! from integer byte positions to the original source code location. Each bit | |
5 | //! of source parsed during crate parsing (typically files, in-memory strings, | |
6 | //! or various bits of macro expansion) cover a continuous range of bytes in the | |
7 | //! `SourceMap` and are represented by [`SourceFile`]s. Byte positions are stored in | |
8 | //! [`Span`] and used pervasively in the compiler. They are absolute positions | |
9 | //! within the `SourceMap`, which upon request can be converted to line and column | |
10 | //! information, source code snippets, etc. | |
11 | ||
12 | pub use crate::hygiene::{ExpnData, ExpnKind}; | |
13 | pub use crate::*; | |
14 | ||
15 | use rustc_data_structures::fx::FxHashMap; | |
16 | use rustc_data_structures::stable_hasher::StableHasher; | |
17 | use rustc_data_structures::sync::{AtomicU32, Lrc, MappedReadGuard, ReadGuard, RwLock}; | |
18 | use std::cmp; | |
19 | use std::convert::TryFrom; | |
20 | use std::hash::Hash; | |
21 | use std::path::{Path, PathBuf}; | |
22 | use std::sync::atomic::Ordering; | |
23 | ||
24 | use std::fs; | |
25 | use std::io; | |
26 | use tracing::debug; | |
27 | ||
28 | #[cfg(test)] | |
29 | mod tests; | |
30 | ||
31 | /// Returns the span itself if it doesn't come from a macro expansion, | |
32 | /// otherwise return the call site span up to the `enclosing_sp` by | |
33 | /// following the `expn_data` chain. | |
34 | pub fn original_sp(sp: Span, enclosing_sp: Span) -> Span { | |
35 | let expn_data1 = sp.ctxt().outer_expn_data(); | |
36 | let expn_data2 = enclosing_sp.ctxt().outer_expn_data(); | |
37 | if expn_data1.is_root() || !expn_data2.is_root() && expn_data1.call_site == expn_data2.call_site | |
38 | { | |
39 | sp | |
40 | } else { | |
41 | original_sp(expn_data1.call_site, enclosing_sp) | |
42 | } | |
43 | } | |
44 | ||
45 | pub mod monotonic { | |
46 | use std::ops::{Deref, DerefMut}; | |
47 | ||
48 | /// A `MonotonicVec` is a `Vec` which can only be grown. | |
49 | /// Once inserted, an element can never be removed or swapped, | |
50 | /// guaranteeing that any indices into a `MonotonicVec` are stable | |
51 | // This is declared in its own module to ensure that the private | |
52 | // field is inaccessible | |
53 | pub struct MonotonicVec<T>(Vec<T>); | |
54 | impl<T> MonotonicVec<T> { | |
55 | pub fn new(val: Vec<T>) -> MonotonicVec<T> { | |
56 | MonotonicVec(val) | |
57 | } | |
58 | ||
59 | pub fn push(&mut self, val: T) { | |
60 | self.0.push(val); | |
61 | } | |
62 | } | |
63 | ||
64 | impl<T> Default for MonotonicVec<T> { | |
65 | fn default() -> Self { | |
66 | MonotonicVec::new(vec![]) | |
67 | } | |
68 | } | |
69 | ||
70 | impl<T> Deref for MonotonicVec<T> { | |
71 | type Target = Vec<T>; | |
72 | fn deref(&self) -> &Self::Target { | |
73 | &self.0 | |
74 | } | |
75 | } | |
76 | ||
77 | impl<T> !DerefMut for MonotonicVec<T> {} | |
78 | } | |
79 | ||
80 | #[derive(Clone, Encodable, Decodable, Debug, Copy, HashStable_Generic)] | |
81 | pub struct Spanned<T> { | |
82 | pub node: T, | |
83 | pub span: Span, | |
84 | } | |
85 | ||
86 | pub fn respan<T>(sp: Span, t: T) -> Spanned<T> { | |
87 | Spanned { node: t, span: sp } | |
88 | } | |
89 | ||
90 | pub fn dummy_spanned<T>(t: T) -> Spanned<T> { | |
91 | respan(DUMMY_SP, t) | |
92 | } | |
93 | ||
94 | // _____________________________________________________________________________ | |
95 | // SourceFile, MultiByteChar, FileName, FileLines | |
96 | // | |
97 | ||
98 | /// An abstraction over the fs operations used by the Parser. | |
99 | pub trait FileLoader { | |
100 | /// Query the existence of a file. | |
101 | fn file_exists(&self, path: &Path) -> bool; | |
102 | ||
103 | /// Read the contents of an UTF-8 file into memory. | |
104 | fn read_file(&self, path: &Path) -> io::Result<String>; | |
105 | } | |
106 | ||
107 | /// A FileLoader that uses std::fs to load real files. | |
108 | pub struct RealFileLoader; | |
109 | ||
110 | impl FileLoader for RealFileLoader { | |
111 | fn file_exists(&self, path: &Path) -> bool { | |
112 | fs::metadata(path).is_ok() | |
113 | } | |
114 | ||
115 | fn read_file(&self, path: &Path) -> io::Result<String> { | |
116 | fs::read_to_string(path) | |
117 | } | |
118 | } | |
119 | ||
120 | // This is a `SourceFile` identifier that is used to correlate `SourceFile`s between | |
121 | // subsequent compilation sessions (which is something we need to do during | |
122 | // incremental compilation). | |
123 | #[derive(Copy, Clone, PartialEq, Eq, Hash, Encodable, Decodable, Debug)] | |
124 | pub struct StableSourceFileId(u128); | |
125 | ||
126 | // FIXME: we need a more globally consistent approach to the problem solved by | |
127 | // StableSourceFileId, perhaps built atop source_file.name_hash. | |
128 | impl StableSourceFileId { | |
129 | pub fn new(source_file: &SourceFile) -> StableSourceFileId { | |
130 | StableSourceFileId::new_from_pieces( | |
131 | &source_file.name, | |
132 | source_file.name_was_remapped, | |
133 | source_file.unmapped_path.as_ref(), | |
134 | ) | |
135 | } | |
136 | ||
137 | fn new_from_pieces( | |
138 | name: &FileName, | |
139 | name_was_remapped: bool, | |
140 | unmapped_path: Option<&FileName>, | |
141 | ) -> StableSourceFileId { | |
142 | let mut hasher = StableHasher::new(); | |
143 | ||
144 | if let FileName::Real(real_name) = name { | |
145 | // rust-lang/rust#70924: Use the stable (virtualized) name when | |
146 | // available. (We do not want artifacts from transient file system | |
147 | // paths for libstd to leak into our build artifacts.) | |
148 | real_name.stable_name().hash(&mut hasher) | |
149 | } else { | |
150 | name.hash(&mut hasher); | |
151 | } | |
152 | name_was_remapped.hash(&mut hasher); | |
153 | unmapped_path.hash(&mut hasher); | |
154 | ||
155 | StableSourceFileId(hasher.finish()) | |
156 | } | |
157 | } | |
158 | ||
159 | // _____________________________________________________________________________ | |
160 | // SourceMap | |
161 | // | |
162 | ||
163 | #[derive(Default)] | |
164 | pub(super) struct SourceMapFiles { | |
165 | source_files: monotonic::MonotonicVec<Lrc<SourceFile>>, | |
166 | stable_id_to_source_file: FxHashMap<StableSourceFileId, Lrc<SourceFile>>, | |
167 | } | |
168 | ||
169 | pub struct SourceMap { | |
170 | /// The address space below this value is currently used by the files in the source map. | |
171 | used_address_space: AtomicU32, | |
172 | ||
173 | files: RwLock<SourceMapFiles>, | |
174 | file_loader: Box<dyn FileLoader + Sync + Send>, | |
175 | // This is used to apply the file path remapping as specified via | |
176 | // `--remap-path-prefix` to all `SourceFile`s allocated within this `SourceMap`. | |
177 | path_mapping: FilePathMapping, | |
178 | ||
179 | /// The algorithm used for hashing the contents of each source file. | |
180 | hash_kind: SourceFileHashAlgorithm, | |
181 | } | |
182 | ||
183 | impl SourceMap { | |
184 | pub fn new(path_mapping: FilePathMapping) -> SourceMap { | |
185 | Self::with_file_loader_and_hash_kind( | |
186 | Box::new(RealFileLoader), | |
187 | path_mapping, | |
188 | SourceFileHashAlgorithm::Md5, | |
189 | ) | |
190 | } | |
191 | ||
192 | pub fn with_file_loader_and_hash_kind( | |
193 | file_loader: Box<dyn FileLoader + Sync + Send>, | |
194 | path_mapping: FilePathMapping, | |
195 | hash_kind: SourceFileHashAlgorithm, | |
196 | ) -> SourceMap { | |
197 | SourceMap { | |
198 | used_address_space: AtomicU32::new(0), | |
199 | files: Default::default(), | |
200 | file_loader, | |
201 | path_mapping, | |
202 | hash_kind, | |
203 | } | |
204 | } | |
205 | ||
206 | pub fn path_mapping(&self) -> &FilePathMapping { | |
207 | &self.path_mapping | |
208 | } | |
209 | ||
210 | pub fn file_exists(&self, path: &Path) -> bool { | |
211 | self.file_loader.file_exists(path) | |
212 | } | |
213 | ||
214 | pub fn load_file(&self, path: &Path) -> io::Result<Lrc<SourceFile>> { | |
215 | let src = self.file_loader.read_file(path)?; | |
216 | let filename = path.to_owned().into(); | |
217 | Ok(self.new_source_file(filename, src)) | |
218 | } | |
219 | ||
220 | /// Loads source file as a binary blob. | |
221 | /// | |
222 | /// Unlike `load_file`, guarantees that no normalization like BOM-removal | |
223 | /// takes place. | |
224 | pub fn load_binary_file(&self, path: &Path) -> io::Result<Vec<u8>> { | |
225 | // Ideally, this should use `self.file_loader`, but it can't | |
226 | // deal with binary files yet. | |
227 | let bytes = fs::read(path)?; | |
228 | ||
229 | // We need to add file to the `SourceMap`, so that it is present | |
230 | // in dep-info. There's also an edge case that file might be both | |
231 | // loaded as a binary via `include_bytes!` and as proper `SourceFile` | |
232 | // via `mod`, so we try to use real file contents and not just an | |
233 | // empty string. | |
234 | let text = std::str::from_utf8(&bytes).unwrap_or("").to_string(); | |
235 | self.new_source_file(path.to_owned().into(), text); | |
236 | Ok(bytes) | |
237 | } | |
238 | ||
239 | // By returning a `MonotonicVec`, we ensure that consumers cannot invalidate | |
240 | // any existing indices pointing into `files`. | |
241 | pub fn files(&self) -> MappedReadGuard<'_, monotonic::MonotonicVec<Lrc<SourceFile>>> { | |
242 | ReadGuard::map(self.files.borrow(), |files| &files.source_files) | |
243 | } | |
244 | ||
245 | pub fn source_file_by_stable_id( | |
246 | &self, | |
247 | stable_id: StableSourceFileId, | |
248 | ) -> Option<Lrc<SourceFile>> { | |
249 | self.files.borrow().stable_id_to_source_file.get(&stable_id).cloned() | |
250 | } | |
251 | ||
252 | fn allocate_address_space(&self, size: usize) -> Result<usize, OffsetOverflowError> { | |
253 | let size = u32::try_from(size).map_err(|_| OffsetOverflowError)?; | |
254 | ||
255 | loop { | |
256 | let current = self.used_address_space.load(Ordering::Relaxed); | |
257 | let next = current | |
258 | .checked_add(size) | |
259 | // Add one so there is some space between files. This lets us distinguish | |
260 | // positions in the `SourceMap`, even in the presence of zero-length files. | |
261 | .and_then(|next| next.checked_add(1)) | |
262 | .ok_or(OffsetOverflowError)?; | |
263 | ||
264 | if self | |
265 | .used_address_space | |
266 | .compare_exchange(current, next, Ordering::Relaxed, Ordering::Relaxed) | |
267 | .is_ok() | |
268 | { | |
269 | return Ok(usize::try_from(current).unwrap()); | |
270 | } | |
271 | } | |
272 | } | |
273 | ||
274 | /// Creates a new `SourceFile`. | |
275 | /// If a file already exists in the `SourceMap` with the same ID, that file is returned | |
276 | /// unmodified. | |
277 | pub fn new_source_file(&self, filename: FileName, src: String) -> Lrc<SourceFile> { | |
278 | self.try_new_source_file(filename, src).unwrap_or_else(|OffsetOverflowError| { | |
279 | eprintln!("fatal error: rustc does not support files larger than 4GB"); | |
280 | crate::fatal_error::FatalError.raise() | |
281 | }) | |
282 | } | |
283 | ||
284 | fn try_new_source_file( | |
285 | &self, | |
286 | mut filename: FileName, | |
287 | src: String, | |
288 | ) -> Result<Lrc<SourceFile>, OffsetOverflowError> { | |
289 | // The path is used to determine the directory for loading submodules and | |
290 | // include files, so it must be before remapping. | |
291 | // Note that filename may not be a valid path, eg it may be `<anon>` etc, | |
292 | // but this is okay because the directory determined by `path.pop()` will | |
293 | // be empty, so the working directory will be used. | |
294 | let unmapped_path = filename.clone(); | |
295 | ||
296 | let was_remapped; | |
297 | if let FileName::Real(real_filename) = &mut filename { | |
298 | match real_filename { | |
299 | RealFileName::Named(path_to_be_remapped) | |
300 | | RealFileName::Devirtualized { | |
301 | local_path: path_to_be_remapped, | |
302 | virtual_name: _, | |
303 | } => { | |
304 | let mapped = self.path_mapping.map_prefix(path_to_be_remapped.clone()); | |
305 | was_remapped = mapped.1; | |
306 | *path_to_be_remapped = mapped.0; | |
307 | } | |
308 | } | |
309 | } else { | |
310 | was_remapped = false; | |
311 | } | |
312 | ||
313 | let file_id = | |
314 | StableSourceFileId::new_from_pieces(&filename, was_remapped, Some(&unmapped_path)); | |
315 | ||
316 | let lrc_sf = match self.source_file_by_stable_id(file_id) { | |
317 | Some(lrc_sf) => lrc_sf, | |
318 | None => { | |
319 | let start_pos = self.allocate_address_space(src.len())?; | |
320 | ||
321 | let source_file = Lrc::new(SourceFile::new( | |
322 | filename, | |
323 | was_remapped, | |
324 | unmapped_path, | |
325 | src, | |
326 | Pos::from_usize(start_pos), | |
327 | self.hash_kind, | |
328 | )); | |
329 | ||
330 | let mut files = self.files.borrow_mut(); | |
331 | ||
332 | files.source_files.push(source_file.clone()); | |
333 | files.stable_id_to_source_file.insert(file_id, source_file.clone()); | |
334 | ||
335 | source_file | |
336 | } | |
337 | }; | |
338 | Ok(lrc_sf) | |
339 | } | |
340 | ||
341 | /// Allocates a new `SourceFile` representing a source file from an external | |
342 | /// crate. The source code of such an "imported `SourceFile`" is not available, | |
343 | /// but we still know enough to generate accurate debuginfo location | |
344 | /// information for things inlined from other crates. | |
345 | pub fn new_imported_source_file( | |
346 | &self, | |
347 | filename: FileName, | |
348 | name_was_remapped: bool, | |
349 | src_hash: SourceFileHash, | |
350 | name_hash: u128, | |
351 | source_len: usize, | |
352 | cnum: CrateNum, | |
353 | mut file_local_lines: Vec<BytePos>, | |
354 | mut file_local_multibyte_chars: Vec<MultiByteChar>, | |
355 | mut file_local_non_narrow_chars: Vec<NonNarrowChar>, | |
356 | mut file_local_normalized_pos: Vec<NormalizedPos>, | |
357 | original_start_pos: BytePos, | |
358 | original_end_pos: BytePos, | |
359 | ) -> Lrc<SourceFile> { | |
360 | let start_pos = self | |
361 | .allocate_address_space(source_len) | |
362 | .expect("not enough address space for imported source file"); | |
363 | ||
364 | let end_pos = Pos::from_usize(start_pos + source_len); | |
365 | let start_pos = Pos::from_usize(start_pos); | |
366 | ||
367 | for pos in &mut file_local_lines { | |
368 | *pos = *pos + start_pos; | |
369 | } | |
370 | ||
371 | for mbc in &mut file_local_multibyte_chars { | |
372 | mbc.pos = mbc.pos + start_pos; | |
373 | } | |
374 | ||
375 | for swc in &mut file_local_non_narrow_chars { | |
376 | *swc = *swc + start_pos; | |
377 | } | |
378 | ||
379 | for nc in &mut file_local_normalized_pos { | |
380 | nc.pos = nc.pos + start_pos; | |
381 | } | |
382 | ||
383 | let source_file = Lrc::new(SourceFile { | |
384 | name: filename, | |
385 | name_was_remapped, | |
386 | unmapped_path: None, | |
387 | src: None, | |
388 | src_hash, | |
389 | external_src: Lock::new(ExternalSource::Foreign { | |
390 | kind: ExternalSourceKind::AbsentOk, | |
391 | original_start_pos, | |
392 | original_end_pos, | |
393 | }), | |
394 | start_pos, | |
395 | end_pos, | |
396 | lines: file_local_lines, | |
397 | multibyte_chars: file_local_multibyte_chars, | |
398 | non_narrow_chars: file_local_non_narrow_chars, | |
399 | normalized_pos: file_local_normalized_pos, | |
400 | name_hash, | |
401 | cnum, | |
402 | }); | |
403 | ||
404 | let mut files = self.files.borrow_mut(); | |
405 | ||
406 | files.source_files.push(source_file.clone()); | |
407 | files | |
408 | .stable_id_to_source_file | |
409 | .insert(StableSourceFileId::new(&source_file), source_file.clone()); | |
410 | ||
411 | source_file | |
412 | } | |
413 | ||
414 | pub fn mk_substr_filename(&self, sp: Span) -> String { | |
415 | let pos = self.lookup_char_pos(sp.lo()); | |
416 | format!("<{}:{}:{}>", pos.file.name, pos.line, pos.col.to_usize() + 1) | |
417 | } | |
418 | ||
419 | // If there is a doctest offset, applies it to the line. | |
420 | pub fn doctest_offset_line(&self, file: &FileName, orig: usize) -> usize { | |
421 | match file { | |
422 | FileName::DocTest(_, offset) => { | |
423 | if *offset < 0 { | |
424 | orig - (-(*offset)) as usize | |
425 | } else { | |
426 | orig + *offset as usize | |
427 | } | |
428 | } | |
429 | _ => orig, | |
430 | } | |
431 | } | |
432 | ||
433 | /// Return the SourceFile that contains the given `BytePos` | |
434 | pub fn lookup_source_file(&self, pos: BytePos) -> Lrc<SourceFile> { | |
435 | let idx = self.lookup_source_file_idx(pos); | |
436 | (*self.files.borrow().source_files)[idx].clone() | |
437 | } | |
438 | ||
439 | /// Looks up source information about a `BytePos`. | |
440 | pub fn lookup_char_pos(&self, pos: BytePos) -> Loc { | |
441 | let sf = self.lookup_source_file(pos); | |
442 | let (line, col, col_display) = sf.lookup_file_pos_with_col_display(pos); | |
443 | Loc { file: sf, line, col, col_display } | |
444 | } | |
445 | ||
446 | // If the corresponding `SourceFile` is empty, does not return a line number. | |
447 | pub fn lookup_line(&self, pos: BytePos) -> Result<SourceFileAndLine, Lrc<SourceFile>> { | |
448 | let f = self.lookup_source_file(pos); | |
449 | ||
450 | match f.lookup_line(pos) { | |
451 | Some(line) => Ok(SourceFileAndLine { sf: f, line }), | |
452 | None => Err(f), | |
453 | } | |
454 | } | |
455 | ||
456 | /// Returns `Some(span)`, a union of the LHS and RHS span. The LHS must precede the RHS. If | |
457 | /// there are gaps between LHS and RHS, the resulting union will cross these gaps. | |
458 | /// For this to work, | |
459 | /// | |
460 | /// * the syntax contexts of both spans much match, | |
461 | /// * the LHS span needs to end on the same line the RHS span begins, | |
462 | /// * the LHS span must start at or before the RHS span. | |
463 | pub fn merge_spans(&self, sp_lhs: Span, sp_rhs: Span) -> Option<Span> { | |
464 | // Ensure we're at the same expansion ID. | |
465 | if sp_lhs.ctxt() != sp_rhs.ctxt() { | |
466 | return None; | |
467 | } | |
468 | ||
469 | let lhs_end = match self.lookup_line(sp_lhs.hi()) { | |
470 | Ok(x) => x, | |
471 | Err(_) => return None, | |
472 | }; | |
473 | let rhs_begin = match self.lookup_line(sp_rhs.lo()) { | |
474 | Ok(x) => x, | |
475 | Err(_) => return None, | |
476 | }; | |
477 | ||
478 | // If we must cross lines to merge, don't merge. | |
479 | if lhs_end.line != rhs_begin.line { | |
480 | return None; | |
481 | } | |
482 | ||
483 | // Ensure these follow the expected order and that we don't overlap. | |
484 | if (sp_lhs.lo() <= sp_rhs.lo()) && (sp_lhs.hi() <= sp_rhs.lo()) { | |
485 | Some(sp_lhs.to(sp_rhs)) | |
486 | } else { | |
487 | None | |
488 | } | |
489 | } | |
490 | ||
491 | pub fn span_to_string(&self, sp: Span) -> String { | |
492 | if self.files.borrow().source_files.is_empty() && sp.is_dummy() { | |
493 | return "no-location".to_string(); | |
494 | } | |
495 | ||
496 | let lo = self.lookup_char_pos(sp.lo()); | |
497 | let hi = self.lookup_char_pos(sp.hi()); | |
498 | format!( | |
499 | "{}:{}:{}: {}:{}", | |
500 | lo.file.name, | |
501 | lo.line, | |
502 | lo.col.to_usize() + 1, | |
503 | hi.line, | |
504 | hi.col.to_usize() + 1, | |
505 | ) | |
506 | } | |
507 | ||
508 | pub fn span_to_filename(&self, sp: Span) -> FileName { | |
509 | self.lookup_char_pos(sp.lo()).file.name.clone() | |
510 | } | |
511 | ||
512 | pub fn span_to_unmapped_path(&self, sp: Span) -> FileName { | |
513 | self.lookup_char_pos(sp.lo()) | |
514 | .file | |
515 | .unmapped_path | |
516 | .clone() | |
517 | .expect("`SourceMap::span_to_unmapped_path` called for imported `SourceFile`?") | |
518 | } | |
519 | ||
520 | pub fn is_multiline(&self, sp: Span) -> bool { | |
521 | let lo = self.lookup_char_pos(sp.lo()); | |
522 | let hi = self.lookup_char_pos(sp.hi()); | |
523 | lo.line != hi.line | |
524 | } | |
525 | ||
526 | pub fn is_valid_span(&self, sp: Span) -> Result<(Loc, Loc), SpanLinesError> { | |
527 | let lo = self.lookup_char_pos(sp.lo()); | |
528 | debug!("span_to_lines: lo={:?}", lo); | |
529 | let hi = self.lookup_char_pos(sp.hi()); | |
530 | debug!("span_to_lines: hi={:?}", hi); | |
531 | if lo.file.start_pos != hi.file.start_pos { | |
532 | return Err(SpanLinesError::DistinctSources(DistinctSources { | |
533 | begin: (lo.file.name.clone(), lo.file.start_pos), | |
534 | end: (hi.file.name.clone(), hi.file.start_pos), | |
535 | })); | |
536 | } | |
537 | Ok((lo, hi)) | |
538 | } | |
539 | ||
540 | pub fn is_line_before_span_empty(&self, sp: Span) -> bool { | |
541 | match self.span_to_prev_source(sp) { | |
542 | Ok(s) => s.split('\n').last().map_or(false, |l| l.trim_start().is_empty()), | |
543 | Err(_) => false, | |
544 | } | |
545 | } | |
546 | ||
547 | pub fn span_to_lines(&self, sp: Span) -> FileLinesResult { | |
548 | debug!("span_to_lines(sp={:?})", sp); | |
549 | let (lo, hi) = self.is_valid_span(sp)?; | |
550 | assert!(hi.line >= lo.line); | |
551 | ||
552 | if sp.is_dummy() { | |
553 | return Ok(FileLines { file: lo.file, lines: Vec::new() }); | |
554 | } | |
555 | ||
556 | let mut lines = Vec::with_capacity(hi.line - lo.line + 1); | |
557 | ||
558 | // The span starts partway through the first line, | |
559 | // but after that it starts from offset 0. | |
560 | let mut start_col = lo.col; | |
561 | ||
562 | // For every line but the last, it extends from `start_col` | |
563 | // and to the end of the line. Be careful because the line | |
564 | // numbers in Loc are 1-based, so we subtract 1 to get 0-based | |
565 | // lines. | |
566 | // | |
567 | // FIXME: now that we handle DUMMY_SP up above, we should consider | |
568 | // asserting that the line numbers here are all indeed 1-based. | |
569 | let hi_line = hi.line.saturating_sub(1); | |
570 | for line_index in lo.line.saturating_sub(1)..hi_line { | |
571 | let line_len = lo.file.get_line(line_index).map_or(0, |s| s.chars().count()); | |
572 | lines.push(LineInfo { line_index, start_col, end_col: CharPos::from_usize(line_len) }); | |
573 | start_col = CharPos::from_usize(0); | |
574 | } | |
575 | ||
576 | // For the last line, it extends from `start_col` to `hi.col`: | |
577 | lines.push(LineInfo { line_index: hi_line, start_col, end_col: hi.col }); | |
578 | ||
579 | Ok(FileLines { file: lo.file, lines }) | |
580 | } | |
581 | ||
582 | /// Extracts the source surrounding the given `Span` using the `extract_source` function. The | |
583 | /// extract function takes three arguments: a string slice containing the source, an index in | |
584 | /// the slice for the beginning of the span and an index in the slice for the end of the span. | |
585 | fn span_to_source<F, T>(&self, sp: Span, extract_source: F) -> Result<T, SpanSnippetError> | |
586 | where | |
587 | F: Fn(&str, usize, usize) -> Result<T, SpanSnippetError>, | |
588 | { | |
589 | let local_begin = self.lookup_byte_offset(sp.lo()); | |
590 | let local_end = self.lookup_byte_offset(sp.hi()); | |
591 | ||
592 | if local_begin.sf.start_pos != local_end.sf.start_pos { | |
593 | Err(SpanSnippetError::DistinctSources(DistinctSources { | |
594 | begin: (local_begin.sf.name.clone(), local_begin.sf.start_pos), | |
595 | end: (local_end.sf.name.clone(), local_end.sf.start_pos), | |
596 | })) | |
597 | } else { | |
598 | self.ensure_source_file_source_present(local_begin.sf.clone()); | |
599 | ||
600 | let start_index = local_begin.pos.to_usize(); | |
601 | let end_index = local_end.pos.to_usize(); | |
602 | let source_len = (local_begin.sf.end_pos - local_begin.sf.start_pos).to_usize(); | |
603 | ||
604 | if start_index > end_index || end_index > source_len { | |
605 | return Err(SpanSnippetError::MalformedForSourcemap(MalformedSourceMapPositions { | |
606 | name: local_begin.sf.name.clone(), | |
607 | source_len, | |
608 | begin_pos: local_begin.pos, | |
609 | end_pos: local_end.pos, | |
610 | })); | |
611 | } | |
612 | ||
613 | if let Some(ref src) = local_begin.sf.src { | |
614 | extract_source(src, start_index, end_index) | |
615 | } else if let Some(src) = local_begin.sf.external_src.borrow().get_source() { | |
616 | extract_source(src, start_index, end_index) | |
617 | } else { | |
618 | Err(SpanSnippetError::SourceNotAvailable { filename: local_begin.sf.name.clone() }) | |
619 | } | |
620 | } | |
621 | } | |
622 | ||
623 | /// Returns the source snippet as `String` corresponding to the given `Span`. | |
624 | pub fn span_to_snippet(&self, sp: Span) -> Result<String, SpanSnippetError> { | |
625 | self.span_to_source(sp, |src, start_index, end_index| { | |
626 | src.get(start_index..end_index) | |
627 | .map(|s| s.to_string()) | |
628 | .ok_or(SpanSnippetError::IllFormedSpan(sp)) | |
629 | }) | |
630 | } | |
631 | ||
632 | pub fn span_to_margin(&self, sp: Span) -> Option<usize> { | |
633 | match self.span_to_prev_source(sp) { | |
634 | Err(_) => None, | |
635 | Ok(source) => source | |
636 | .split('\n') | |
637 | .last() | |
638 | .map(|last_line| last_line.len() - last_line.trim_start().len()), | |
639 | } | |
640 | } | |
641 | ||
642 | /// Returns the source snippet as `String` before the given `Span`. | |
643 | pub fn span_to_prev_source(&self, sp: Span) -> Result<String, SpanSnippetError> { | |
644 | self.span_to_source(sp, |src, start_index, _| { | |
645 | src.get(..start_index).map(|s| s.to_string()).ok_or(SpanSnippetError::IllFormedSpan(sp)) | |
646 | }) | |
647 | } | |
648 | ||
649 | /// Extends the given `Span` to just after the previous occurrence of `c`. Return the same span | |
650 | /// if no character could be found or if an error occurred while retrieving the code snippet. | |
651 | pub fn span_extend_to_prev_char(&self, sp: Span, c: char, accept_newlines: bool) -> Span { | |
652 | if let Ok(prev_source) = self.span_to_prev_source(sp) { | |
653 | let prev_source = prev_source.rsplit(c).next().unwrap_or(""); | |
654 | if !prev_source.is_empty() && (!prev_source.contains('\n') || accept_newlines) { | |
655 | return sp.with_lo(BytePos(sp.lo().0 - prev_source.len() as u32)); | |
656 | } | |
657 | } | |
658 | ||
659 | sp | |
660 | } | |
661 | ||
662 | /// Extends the given `Span` to just after the previous occurrence of `pat` when surrounded by | |
663 | /// whitespace. Returns the same span if no character could be found or if an error occurred | |
664 | /// while retrieving the code snippet. | |
665 | pub fn span_extend_to_prev_str(&self, sp: Span, pat: &str, accept_newlines: bool) -> Span { | |
666 | // assure that the pattern is delimited, to avoid the following | |
667 | // fn my_fn() | |
668 | // ^^^^ returned span without the check | |
669 | // ---------- correct span | |
670 | for ws in &[" ", "\t", "\n"] { | |
671 | let pat = pat.to_owned() + ws; | |
672 | if let Ok(prev_source) = self.span_to_prev_source(sp) { | |
673 | let prev_source = prev_source.rsplit(&pat).next().unwrap_or("").trim_start(); | |
674 | if prev_source.is_empty() && sp.lo().0 != 0 { | |
675 | return sp.with_lo(BytePos(sp.lo().0 - 1)); | |
676 | } else if !prev_source.contains('\n') || accept_newlines { | |
677 | return sp.with_lo(BytePos(sp.lo().0 - prev_source.len() as u32)); | |
678 | } | |
679 | } | |
680 | } | |
681 | ||
682 | sp | |
683 | } | |
684 | ||
685 | /// Returns the source snippet as `String` after the given `Span`. | |
686 | pub fn span_to_next_source(&self, sp: Span) -> Result<String, SpanSnippetError> { | |
687 | self.span_to_source(sp, |src, _, end_index| { | |
688 | src.get(end_index..).map(|s| s.to_string()).ok_or(SpanSnippetError::IllFormedSpan(sp)) | |
689 | }) | |
690 | } | |
691 | ||
692 | /// Extends the given `Span` to just after the next occurrence of `c`. | |
693 | pub fn span_extend_to_next_char(&self, sp: Span, c: char, accept_newlines: bool) -> Span { | |
694 | if let Ok(next_source) = self.span_to_next_source(sp) { | |
695 | let next_source = next_source.split(c).next().unwrap_or(""); | |
696 | if !next_source.is_empty() && (!next_source.contains('\n') || accept_newlines) { | |
697 | return sp.with_hi(BytePos(sp.hi().0 + next_source.len() as u32)); | |
698 | } | |
699 | } | |
700 | ||
701 | sp | |
702 | } | |
703 | ||
704 | /// Given a `Span`, tries to get a shorter span ending before the first occurrence of `char` | |
705 | /// `c`. | |
706 | pub fn span_until_char(&self, sp: Span, c: char) -> Span { | |
707 | match self.span_to_snippet(sp) { | |
708 | Ok(snippet) => { | |
709 | let snippet = snippet.split(c).next().unwrap_or("").trim_end(); | |
710 | if !snippet.is_empty() && !snippet.contains('\n') { | |
711 | sp.with_hi(BytePos(sp.lo().0 + snippet.len() as u32)) | |
712 | } else { | |
713 | sp | |
714 | } | |
715 | } | |
716 | _ => sp, | |
717 | } | |
718 | } | |
719 | ||
720 | /// Given a `Span`, tries to get a shorter span ending just after the first occurrence of `char` | |
721 | /// `c`. | |
722 | pub fn span_through_char(&self, sp: Span, c: char) -> Span { | |
723 | if let Ok(snippet) = self.span_to_snippet(sp) { | |
724 | if let Some(offset) = snippet.find(c) { | |
725 | return sp.with_hi(BytePos(sp.lo().0 + (offset + c.len_utf8()) as u32)); | |
726 | } | |
727 | } | |
728 | sp | |
729 | } | |
730 | ||
731 | /// Given a `Span`, gets a new `Span` covering the first token and all its trailing whitespace | |
732 | /// or the original `Span`. | |
733 | /// | |
734 | /// If `sp` points to `"let mut x"`, then a span pointing at `"let "` will be returned. | |
735 | pub fn span_until_non_whitespace(&self, sp: Span) -> Span { | |
736 | let mut whitespace_found = false; | |
737 | ||
738 | self.span_take_while(sp, |c| { | |
739 | if !whitespace_found && c.is_whitespace() { | |
740 | whitespace_found = true; | |
741 | } | |
742 | ||
743 | !whitespace_found || c.is_whitespace() | |
744 | }) | |
745 | } | |
746 | ||
747 | /// Given a `Span`, gets a new `Span` covering the first token without its trailing whitespace | |
748 | /// or the original `Span` in case of error. | |
749 | /// | |
750 | /// If `sp` points to `"let mut x"`, then a span pointing at `"let"` will be returned. | |
751 | pub fn span_until_whitespace(&self, sp: Span) -> Span { | |
752 | self.span_take_while(sp, |c| !c.is_whitespace()) | |
753 | } | |
754 | ||
755 | /// Given a `Span`, gets a shorter one until `predicate` yields `false`. | |
756 | pub fn span_take_while<P>(&self, sp: Span, predicate: P) -> Span | |
757 | where | |
758 | P: for<'r> FnMut(&'r char) -> bool, | |
759 | { | |
760 | if let Ok(snippet) = self.span_to_snippet(sp) { | |
761 | let offset = snippet.chars().take_while(predicate).map(|c| c.len_utf8()).sum::<usize>(); | |
762 | ||
763 | sp.with_hi(BytePos(sp.lo().0 + (offset as u32))) | |
764 | } else { | |
765 | sp | |
766 | } | |
767 | } | |
768 | ||
769 | /// Given a `Span`, return a span ending in the closest `{`. This is useful when you have a | |
770 | /// `Span` enclosing a whole item but we need to point at only the head (usually the first | |
771 | /// line) of that item. | |
772 | /// | |
773 | /// *Only suitable for diagnostics.* | |
774 | pub fn guess_head_span(&self, sp: Span) -> Span { | |
775 | // FIXME: extend the AST items to have a head span, or replace callers with pointing at | |
776 | // the item's ident when appropriate. | |
777 | self.span_until_char(sp, '{') | |
778 | } | |
779 | ||
780 | /// Returns a new span representing just the start point of this span. | |
781 | pub fn start_point(&self, sp: Span) -> Span { | |
782 | let pos = sp.lo().0; | |
783 | let width = self.find_width_of_character_at_span(sp, false); | |
784 | let corrected_start_position = pos.checked_add(width).unwrap_or(pos); | |
785 | let end_point = BytePos(cmp::max(corrected_start_position, sp.lo().0)); | |
786 | sp.with_hi(end_point) | |
787 | } | |
788 | ||
789 | /// Returns a new span representing just the end point of this span. | |
790 | pub fn end_point(&self, sp: Span) -> Span { | |
791 | let pos = sp.hi().0; | |
792 | ||
793 | let width = self.find_width_of_character_at_span(sp, false); | |
794 | let corrected_end_position = pos.checked_sub(width).unwrap_or(pos); | |
795 | ||
796 | let end_point = BytePos(cmp::max(corrected_end_position, sp.lo().0)); | |
797 | sp.with_lo(end_point) | |
798 | } | |
799 | ||
800 | /// Returns a new span representing the next character after the end-point of this span. | |
801 | pub fn next_point(&self, sp: Span) -> Span { | |
802 | if sp.is_dummy() { | |
803 | return sp; | |
804 | } | |
805 | let start_of_next_point = sp.hi().0; | |
806 | ||
807 | let width = self.find_width_of_character_at_span(sp.shrink_to_hi(), true); | |
808 | // If the width is 1, then the next span should point to the same `lo` and `hi`. However, | |
809 | // in the case of a multibyte character, where the width != 1, the next span should | |
810 | // span multiple bytes to include the whole character. | |
811 | let end_of_next_point = | |
812 | start_of_next_point.checked_add(width - 1).unwrap_or(start_of_next_point); | |
813 | ||
814 | let end_of_next_point = BytePos(cmp::max(sp.lo().0 + 1, end_of_next_point)); | |
815 | Span::new(BytePos(start_of_next_point), end_of_next_point, sp.ctxt()) | |
816 | } | |
817 | ||
818 | /// Finds the width of a character, either before or after the provided span. | |
819 | fn find_width_of_character_at_span(&self, sp: Span, forwards: bool) -> u32 { | |
820 | let sp = sp.data(); | |
821 | if sp.lo == sp.hi { | |
822 | debug!("find_width_of_character_at_span: early return empty span"); | |
823 | return 1; | |
824 | } | |
825 | ||
826 | let local_begin = self.lookup_byte_offset(sp.lo); | |
827 | let local_end = self.lookup_byte_offset(sp.hi); | |
828 | debug!( | |
829 | "find_width_of_character_at_span: local_begin=`{:?}`, local_end=`{:?}`", | |
830 | local_begin, local_end | |
831 | ); | |
832 | ||
833 | if local_begin.sf.start_pos != local_end.sf.start_pos { | |
834 | debug!("find_width_of_character_at_span: begin and end are in different files"); | |
835 | return 1; | |
836 | } | |
837 | ||
838 | let start_index = local_begin.pos.to_usize(); | |
839 | let end_index = local_end.pos.to_usize(); | |
840 | debug!( | |
841 | "find_width_of_character_at_span: start_index=`{:?}`, end_index=`{:?}`", | |
842 | start_index, end_index | |
843 | ); | |
844 | ||
845 | // Disregard indexes that are at the start or end of their spans, they can't fit bigger | |
846 | // characters. | |
847 | if (!forwards && end_index == usize::MIN) || (forwards && start_index == usize::MAX) { | |
848 | debug!("find_width_of_character_at_span: start or end of span, cannot be multibyte"); | |
849 | return 1; | |
850 | } | |
851 | ||
852 | let source_len = (local_begin.sf.end_pos - local_begin.sf.start_pos).to_usize(); | |
853 | debug!("find_width_of_character_at_span: source_len=`{:?}`", source_len); | |
854 | // Ensure indexes are also not malformed. | |
855 | if start_index > end_index || end_index > source_len { | |
856 | debug!("find_width_of_character_at_span: source indexes are malformed"); | |
857 | return 1; | |
858 | } | |
859 | ||
860 | let src = local_begin.sf.external_src.borrow(); | |
861 | ||
862 | // We need to extend the snippet to the end of the src rather than to end_index so when | |
863 | // searching forwards for boundaries we've got somewhere to search. | |
864 | let snippet = if let Some(ref src) = local_begin.sf.src { | |
865 | let len = src.len(); | |
866 | &src[start_index..len] | |
867 | } else if let Some(src) = src.get_source() { | |
868 | let len = src.len(); | |
869 | &src[start_index..len] | |
870 | } else { | |
871 | return 1; | |
872 | }; | |
873 | debug!("find_width_of_character_at_span: snippet=`{:?}`", snippet); | |
874 | ||
875 | let mut target = if forwards { end_index + 1 } else { end_index - 1 }; | |
876 | debug!("find_width_of_character_at_span: initial target=`{:?}`", target); | |
877 | ||
878 | while !snippet.is_char_boundary(target - start_index) && target < source_len { | |
879 | target = if forwards { | |
880 | target + 1 | |
881 | } else { | |
882 | match target.checked_sub(1) { | |
883 | Some(target) => target, | |
884 | None => { | |
885 | break; | |
886 | } | |
887 | } | |
888 | }; | |
889 | debug!("find_width_of_character_at_span: target=`{:?}`", target); | |
890 | } | |
891 | debug!("find_width_of_character_at_span: final target=`{:?}`", target); | |
892 | ||
893 | if forwards { (target - end_index) as u32 } else { (end_index - target) as u32 } | |
894 | } | |
895 | ||
896 | pub fn get_source_file(&self, filename: &FileName) -> Option<Lrc<SourceFile>> { | |
897 | // Remap filename before lookup | |
898 | let filename = self.path_mapping().map_filename_prefix(filename).0; | |
899 | for sf in self.files.borrow().source_files.iter() { | |
900 | if filename == sf.name { | |
901 | return Some(sf.clone()); | |
902 | } | |
903 | } | |
904 | None | |
905 | } | |
906 | ||
907 | /// For a global `BytePos`, computes the local offset within the containing `SourceFile`. | |
908 | pub fn lookup_byte_offset(&self, bpos: BytePos) -> SourceFileAndBytePos { | |
909 | let idx = self.lookup_source_file_idx(bpos); | |
910 | let sf = (*self.files.borrow().source_files)[idx].clone(); | |
911 | let offset = bpos - sf.start_pos; | |
912 | SourceFileAndBytePos { sf, pos: offset } | |
913 | } | |
914 | ||
915 | /// Converts an absolute `BytePos` to a `CharPos` relative to the `SourceFile`. | |
916 | pub fn bytepos_to_file_charpos(&self, bpos: BytePos) -> CharPos { | |
917 | let idx = self.lookup_source_file_idx(bpos); | |
918 | let sf = &(*self.files.borrow().source_files)[idx]; | |
919 | sf.bytepos_to_file_charpos(bpos) | |
920 | } | |
921 | ||
922 | // Returns the index of the `SourceFile` (in `self.files`) that contains `pos`. | |
923 | // This index is guaranteed to be valid for the lifetime of this `SourceMap`, | |
924 | // since `source_files` is a `MonotonicVec` | |
925 | pub fn lookup_source_file_idx(&self, pos: BytePos) -> usize { | |
926 | self.files | |
927 | .borrow() | |
928 | .source_files | |
929 | .binary_search_by_key(&pos, |key| key.start_pos) | |
930 | .unwrap_or_else(|p| p - 1) | |
931 | } | |
932 | ||
933 | pub fn count_lines(&self) -> usize { | |
934 | self.files().iter().fold(0, |a, f| a + f.count_lines()) | |
935 | } | |
936 | ||
937 | pub fn generate_fn_name_span(&self, span: Span) -> Option<Span> { | |
938 | let prev_span = self.span_extend_to_prev_str(span, "fn", true); | |
939 | if let Ok(snippet) = self.span_to_snippet(prev_span) { | |
940 | debug!( | |
941 | "generate_fn_name_span: span={:?}, prev_span={:?}, snippet={:?}", | |
942 | span, prev_span, snippet | |
943 | ); | |
944 | ||
945 | if snippet.is_empty() { | |
946 | return None; | |
947 | }; | |
948 | ||
949 | let len = snippet | |
950 | .find(|c: char| !c.is_alphanumeric() && c != '_') | |
951 | .expect("no label after fn"); | |
952 | Some(prev_span.with_hi(BytePos(prev_span.lo().0 + len as u32))) | |
953 | } else { | |
954 | None | |
955 | } | |
956 | } | |
957 | ||
958 | /// Takes the span of a type parameter in a function signature and try to generate a span for | |
959 | /// the function name (with generics) and a new snippet for this span with the pointed type | |
960 | /// parameter as a new local type parameter. | |
961 | /// | |
962 | /// For instance: | |
963 | /// ```rust,ignore (pseudo-Rust) | |
964 | /// // Given span | |
965 | /// fn my_function(param: T) | |
966 | /// // ^ Original span | |
967 | /// | |
968 | /// // Result | |
969 | /// fn my_function(param: T) | |
970 | /// // ^^^^^^^^^^^ Generated span with snippet `my_function<T>` | |
971 | /// ``` | |
972 | /// | |
973 | /// Attention: The method used is very fragile since it essentially duplicates the work of the | |
974 | /// parser. If you need to use this function or something similar, please consider updating the | |
975 | /// `SourceMap` functions and this function to something more robust. | |
976 | pub fn generate_local_type_param_snippet(&self, span: Span) -> Option<(Span, String)> { | |
977 | // Try to extend the span to the previous "fn" keyword to retrieve the function | |
978 | // signature. | |
979 | let sugg_span = self.span_extend_to_prev_str(span, "fn", false); | |
980 | if sugg_span != span { | |
981 | if let Ok(snippet) = self.span_to_snippet(sugg_span) { | |
982 | // Consume the function name. | |
983 | let mut offset = snippet | |
984 | .find(|c: char| !c.is_alphanumeric() && c != '_') | |
985 | .expect("no label after fn"); | |
986 | ||
987 | // Consume the generics part of the function signature. | |
988 | let mut bracket_counter = 0; | |
989 | let mut last_char = None; | |
990 | for c in snippet[offset..].chars() { | |
991 | match c { | |
992 | '<' => bracket_counter += 1, | |
993 | '>' => bracket_counter -= 1, | |
994 | '(' => { | |
995 | if bracket_counter == 0 { | |
996 | break; | |
997 | } | |
998 | } | |
999 | _ => {} | |
1000 | } | |
1001 | offset += c.len_utf8(); | |
1002 | last_char = Some(c); | |
1003 | } | |
1004 | ||
1005 | // Adjust the suggestion span to encompass the function name with its generics. | |
1006 | let sugg_span = sugg_span.with_hi(BytePos(sugg_span.lo().0 + offset as u32)); | |
1007 | ||
1008 | // Prepare the new suggested snippet to append the type parameter that triggered | |
1009 | // the error in the generics of the function signature. | |
1010 | let mut new_snippet = if last_char == Some('>') { | |
1011 | format!("{}, ", &snippet[..(offset - '>'.len_utf8())]) | |
1012 | } else { | |
1013 | format!("{}<", &snippet[..offset]) | |
1014 | }; | |
1015 | new_snippet | |
1016 | .push_str(&self.span_to_snippet(span).unwrap_or_else(|_| "T".to_string())); | |
1017 | new_snippet.push('>'); | |
1018 | ||
1019 | return Some((sugg_span, new_snippet)); | |
1020 | } | |
1021 | } | |
1022 | ||
1023 | None | |
1024 | } | |
1025 | pub fn ensure_source_file_source_present(&self, source_file: Lrc<SourceFile>) -> bool { | |
1026 | source_file.add_external_src(|| match source_file.name { | |
1027 | FileName::Real(ref name) => self.file_loader.read_file(name.local_path()).ok(), | |
1028 | _ => None, | |
1029 | }) | |
1030 | } | |
1031 | ||
1032 | pub fn is_imported(&self, sp: Span) -> bool { | |
1033 | let source_file_index = self.lookup_source_file_idx(sp.lo()); | |
1034 | let source_file = &self.files()[source_file_index]; | |
1035 | source_file.is_imported() | |
1036 | } | |
1037 | } | |
1038 | ||
1039 | #[derive(Clone)] | |
1040 | pub struct FilePathMapping { | |
1041 | mapping: Vec<(PathBuf, PathBuf)>, | |
1042 | } | |
1043 | ||
1044 | impl FilePathMapping { | |
1045 | pub fn empty() -> FilePathMapping { | |
1046 | FilePathMapping { mapping: vec![] } | |
1047 | } | |
1048 | ||
1049 | pub fn new(mapping: Vec<(PathBuf, PathBuf)>) -> FilePathMapping { | |
1050 | FilePathMapping { mapping } | |
1051 | } | |
1052 | ||
1053 | /// Applies any path prefix substitution as defined by the mapping. | |
1054 | /// The return value is the remapped path and a boolean indicating whether | |
1055 | /// the path was affected by the mapping. | |
1056 | pub fn map_prefix(&self, path: PathBuf) -> (PathBuf, bool) { | |
1057 | // NOTE: We are iterating over the mapping entries from last to first | |
1058 | // because entries specified later on the command line should | |
1059 | // take precedence. | |
1060 | for &(ref from, ref to) in self.mapping.iter().rev() { | |
1061 | if let Ok(rest) = path.strip_prefix(from) { | |
1062 | return (to.join(rest), true); | |
1063 | } | |
1064 | } | |
1065 | ||
1066 | (path, false) | |
1067 | } | |
1068 | ||
1069 | fn map_filename_prefix(&self, file: &FileName) -> (FileName, bool) { | |
1070 | match file { | |
1071 | FileName::Real(realfile) => { | |
1072 | let path = realfile.local_path(); | |
1073 | let (path, mapped) = self.map_prefix(path.to_path_buf()); | |
1074 | (FileName::Real(RealFileName::Named(path)), mapped) | |
1075 | } | |
1076 | other => (other.clone(), false), | |
1077 | } | |
1078 | } | |
1079 | } |