1 use crate::source_map::SourceMap;
2 use crate::{BytePos, SourceFile, SpanData};
3 use rustc_data_structures::sync::Lrc;
10 // The line's byte position range in the `SourceMap`. This range will fail to contain a valid
11 // position in certain edge cases. Spans often start/end one past something, and when that
12 // something is the last character of a file (this can happen when a file doesn't end in a
13 // newline, for example), we'd still like for the position to be considered within the last
14 // line. However, it isn't according to the exclusive upper bound of this range. We cannot
15 // change the upper bound to be inclusive, because for most lines, the upper bound is the same
16 // as the lower bound of the next line, so there would be an ambiguity.
18 // Since the containment aspect of this range is only used to see whether or not the cache
19 // entry contains a position, the only ramification of the above is that we will get cache
20 // misses for these rare positions. A line lookup for the position via `SourceMap::lookup_line`
21 // after a cache miss will produce the last line number, as desired.
23 file: Lrc<SourceFile>,
31 new_file_and_idx: Option<(Lrc<SourceFile>, usize)>,
35 if let Some((file, file_idx)) = new_file_and_idx {
37 self.file_index = file_idx;
40 let line_index = self.file.lookup_line(pos).unwrap();
41 let line_bounds = self.file.line_bounds(line_index);
42 self.line_number = line_index + 1;
43 self.line = line_bounds;
44 self.touch(time_stamp);
48 fn touch(&mut self, time_stamp: usize) {
49 self.time_stamp = time_stamp;
54 pub struct CachingSourceMapView<'sm> {
55 source_map: &'sm SourceMap,
56 line_cache: [CacheEntry; 3],
60 impl<'sm> CachingSourceMapView<'sm> {
61 pub fn new(source_map: &'sm SourceMap) -> CachingSourceMapView<'sm> {
62 let files = source_map.files();
63 let first_file = files[0].clone();
64 let entry = CacheEntry {
67 line: BytePos(0)..BytePos(0),
72 CachingSourceMapView {
74 line_cache: [entry.clone(), entry.clone(), entry],
79 pub fn byte_pos_to_line_and_col(
82 ) -> Option<(Lrc<SourceFile>, usize, BytePos)> {
85 // Check if the position is in one of the cached lines
86 let cache_idx = self.cache_entry_index(pos);
88 let cache_entry = &mut self.line_cache[cache_idx as usize];
89 cache_entry.touch(self.time_stamp);
92 cache_entry.file.clone(),
93 cache_entry.line_number,
94 pos - cache_entry.line.start,
99 let oldest = self.oldest_cache_entry_index();
101 // If the entry doesn't point to the correct file, get the new file and index.
102 let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, pos) {
103 Some(self.file_for_position(pos)?)
108 let cache_entry = &mut self.line_cache[oldest];
109 cache_entry.update(new_file_and_idx, pos, self.time_stamp);
111 Some((cache_entry.file.clone(), cache_entry.line_number, pos - cache_entry.line.start))
114 pub fn span_data_to_lines_and_cols(
116 span_data: &SpanData,
117 ) -> Option<(Lrc<SourceFile>, usize, BytePos, usize, BytePos)> {
118 self.time_stamp += 1;
120 // Check if lo and hi are in the cached lines.
121 let lo_cache_idx = self.cache_entry_index(span_data.lo);
122 let hi_cache_idx = self.cache_entry_index(span_data.hi);
124 if lo_cache_idx != -1 && hi_cache_idx != -1 {
125 // Cache hit for span lo and hi. Check if they belong to the same file.
127 let lo = &self.line_cache[lo_cache_idx as usize];
128 let hi = &self.line_cache[hi_cache_idx as usize];
130 if lo.file_index != hi.file_index {
137 span_data.lo - lo.line.start,
139 span_data.hi - hi.line.start,
143 self.line_cache[lo_cache_idx as usize].touch(self.time_stamp);
144 self.line_cache[hi_cache_idx as usize].touch(self.time_stamp);
149 // No cache hit or cache hit for only one of span lo and hi.
150 let oldest = if lo_cache_idx != -1 || hi_cache_idx != -1 {
151 let avoid_idx = if lo_cache_idx != -1 { lo_cache_idx } else { hi_cache_idx };
152 self.oldest_cache_entry_index_avoid(avoid_idx as usize)
154 self.oldest_cache_entry_index()
157 // If the entry doesn't point to the correct file, get the new file and index.
158 // Return early if the file containing beginning of span doesn't contain end of span.
159 let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, span_data.lo) {
160 let new_file_and_idx = self.file_for_position(span_data.lo)?;
161 if !file_contains(&new_file_and_idx.0, span_data.hi) {
165 Some(new_file_and_idx)
167 let file = &self.line_cache[oldest].file;
168 if !file_contains(file, span_data.hi) {
175 // Update the cache entries.
176 let (lo_idx, hi_idx) = match (lo_cache_idx, hi_cache_idx) {
177 // Oldest cache entry is for span_data.lo line.
179 let lo = &mut self.line_cache[oldest];
180 lo.update(new_file_and_idx, span_data.lo, self.time_stamp);
182 if !lo.line.contains(&span_data.hi) {
183 let new_file_and_idx = Some((lo.file.clone(), lo.file_index));
184 let next_oldest = self.oldest_cache_entry_index_avoid(oldest);
185 let hi = &mut self.line_cache[next_oldest];
186 hi.update(new_file_and_idx, span_data.hi, self.time_stamp);
187 (oldest, next_oldest)
192 // Oldest cache entry is for span_data.lo line.
194 let lo = &mut self.line_cache[oldest];
195 lo.update(new_file_and_idx, span_data.lo, self.time_stamp);
196 let hi = &mut self.line_cache[hi_cache_idx as usize];
197 hi.touch(self.time_stamp);
198 (oldest, hi_cache_idx as usize)
200 // Oldest cache entry is for span_data.hi line.
202 let hi = &mut self.line_cache[oldest];
203 hi.update(new_file_and_idx, span_data.hi, self.time_stamp);
204 let lo = &mut self.line_cache[lo_cache_idx as usize];
205 lo.touch(self.time_stamp);
206 (lo_cache_idx as usize, oldest)
213 let lo = &self.line_cache[lo_idx];
214 let hi = &self.line_cache[hi_idx];
216 // Span lo and hi may equal line end when last line doesn't
217 // end in newline, hence the inclusive upper bounds below.
218 assert!(span_data.lo >= lo.line.start);
219 assert!(span_data.lo <= lo.line.end);
220 assert!(span_data.hi >= hi.line.start);
221 assert!(span_data.hi <= hi.line.end);
222 assert!(lo.file.contains(span_data.lo));
223 assert!(lo.file.contains(span_data.hi));
224 assert_eq!(lo.file_index, hi.file_index);
229 span_data.lo - lo.line.start,
231 span_data.hi - hi.line.start,
235 fn cache_entry_index(&self, pos: BytePos) -> isize {
236 for (idx, cache_entry) in self.line_cache.iter().enumerate() {
237 if cache_entry.line.contains(&pos) {
245 fn oldest_cache_entry_index(&self) -> usize {
248 for idx in 1..self.line_cache.len() {
249 if self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp {
257 fn oldest_cache_entry_index_avoid(&self, avoid_idx: usize) -> usize {
258 let mut oldest = if avoid_idx != 0 { 0 } else { 1 };
260 for idx in 0..self.line_cache.len() {
262 && self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp
271 fn file_for_position(&self, pos: BytePos) -> Option<(Lrc<SourceFile>, usize)> {
272 if !self.source_map.files().is_empty() {
273 let file_idx = self.source_map.lookup_source_file_idx(pos);
274 let file = &self.source_map.files()[file_idx];
276 if file_contains(file, pos) {
277 return Some((file.clone(), file_idx));
286 fn file_contains(file: &SourceFile, pos: BytePos) -> bool {
287 // `SourceMap::lookup_source_file_idx` and `SourceFile::contains` both consider the position
288 // one past the end of a file to belong to it. Normally, that's what we want. But for the
289 // purposes of converting a byte position to a line and column number, we can't come up with a
290 // line and column number if the file is empty, because an empty file doesn't contain any
291 // lines. So for our purposes, we don't consider empty files to contain any byte position.
292 file.contains(pos) && !file.is_empty()