2018-05-29 10:50:13 -05:00
|
|
|
use super::*;
|
|
|
|
use unicode_width::UnicodeWidthChar;
|
|
|
|
|
2019-07-31 19:20:23 -05:00
|
|
|
#[cfg(test)]
|
|
|
|
mod tests;
|
|
|
|
|
2019-02-08 07:53:55 -06:00
|
|
|
/// Finds all newlines, multi-byte characters, and non-narrow characters in a
|
2018-08-18 05:13:52 -05:00
|
|
|
/// SourceFile.
|
2018-05-29 10:50:13 -05:00
|
|
|
///
|
|
|
|
/// This function will use an SSE2 enhanced implementation if hardware support
|
|
|
|
/// is detected at runtime.
|
2018-08-18 05:13:56 -05:00
|
|
|
pub fn analyze_source_file(
|
2018-05-29 10:50:13 -05:00
|
|
|
src: &str,
|
2018-08-18 05:13:56 -05:00
|
|
|
source_file_start_pos: BytePos,
|
2018-05-29 10:50:13 -05:00
|
|
|
) -> (Vec<BytePos>, Vec<MultiByteChar>, Vec<NonNarrowChar>) {
|
2018-08-18 05:13:56 -05:00
|
|
|
let mut lines = vec![source_file_start_pos];
|
2018-05-29 10:50:13 -05:00
|
|
|
let mut multi_byte_chars = vec![];
|
|
|
|
let mut non_narrow_chars = vec![];
|
|
|
|
|
|
|
|
// Calls the right implementation, depending on hardware support available.
|
2018-08-18 05:13:56 -05:00
|
|
|
analyze_source_file_dispatch(
|
|
|
|
src,
|
|
|
|
source_file_start_pos,
|
2018-05-29 10:50:13 -05:00
|
|
|
&mut lines,
|
|
|
|
&mut multi_byte_chars,
|
|
|
|
&mut non_narrow_chars,
|
|
|
|
);
|
|
|
|
|
|
|
|
// The code above optimistically registers a new line *after* each \n
|
2018-08-18 05:13:56 -05:00
|
|
|
// it encounters. If that point is already outside the source_file, remove
|
2018-05-29 10:50:13 -05:00
|
|
|
// it again.
|
|
|
|
if let Some(&last_line_start) = lines.last() {
|
2018-10-29 15:26:13 -05:00
|
|
|
let source_file_end = source_file_start_pos + BytePos::from_usize(src.len());
|
|
|
|
assert!(source_file_end >= last_line_start);
|
|
|
|
if last_line_start == source_file_end {
|
2018-05-29 10:50:13 -05:00
|
|
|
lines.pop();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
(lines, multi_byte_chars, non_narrow_chars)
|
|
|
|
}
|
|
|
|
|
2019-02-03 12:42:27 -06:00
|
|
|
cfg_if::cfg_if! {
|
2018-12-08 05:06:54 -06:00
|
|
|
if #[cfg(all(any(target_arch = "x86", target_arch = "x86_64")))] {
|
2018-08-18 05:13:56 -05:00
|
|
|
fn analyze_source_file_dispatch(src: &str,
|
|
|
|
source_file_start_pos: BytePos,
|
2018-05-29 10:50:13 -05:00
|
|
|
lines: &mut Vec<BytePos>,
|
|
|
|
multi_byte_chars: &mut Vec<MultiByteChar>,
|
|
|
|
non_narrow_chars: &mut Vec<NonNarrowChar>) {
|
|
|
|
if is_x86_feature_detected!("sse2") {
|
|
|
|
unsafe {
|
2018-08-18 05:13:56 -05:00
|
|
|
analyze_source_file_sse2(src,
|
|
|
|
source_file_start_pos,
|
2018-05-29 10:50:13 -05:00
|
|
|
lines,
|
|
|
|
multi_byte_chars,
|
|
|
|
non_narrow_chars);
|
|
|
|
}
|
|
|
|
} else {
|
2018-08-18 05:13:56 -05:00
|
|
|
analyze_source_file_generic(src,
|
2018-05-29 10:50:13 -05:00
|
|
|
src.len(),
|
2018-08-18 05:13:56 -05:00
|
|
|
source_file_start_pos,
|
2018-05-29 10:50:13 -05:00
|
|
|
lines,
|
|
|
|
multi_byte_chars,
|
|
|
|
non_narrow_chars);
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-08 07:53:55 -06:00
|
|
|
/// Checks 16 byte chunks of text at a time. If the chunk contains
|
2018-05-29 10:50:13 -05:00
|
|
|
/// something other than printable ASCII characters and newlines, the
|
|
|
|
/// function falls back to the generic implementation. Otherwise it uses
|
|
|
|
/// SSE2 intrinsics to quickly find all newlines.
|
|
|
|
#[target_feature(enable = "sse2")]
|
2018-08-18 05:13:56 -05:00
|
|
|
unsafe fn analyze_source_file_sse2(src: &str,
|
2018-05-29 10:50:13 -05:00
|
|
|
output_offset: BytePos,
|
|
|
|
lines: &mut Vec<BytePos>,
|
|
|
|
multi_byte_chars: &mut Vec<MultiByteChar>,
|
|
|
|
non_narrow_chars: &mut Vec<NonNarrowChar>) {
|
|
|
|
#[cfg(target_arch = "x86")]
|
|
|
|
use std::arch::x86::*;
|
|
|
|
#[cfg(target_arch = "x86_64")]
|
|
|
|
use std::arch::x86_64::*;
|
|
|
|
|
|
|
|
const CHUNK_SIZE: usize = 16;
|
|
|
|
|
|
|
|
let src_bytes = src.as_bytes();
|
|
|
|
|
|
|
|
let chunk_count = src.len() / CHUNK_SIZE;
|
|
|
|
|
|
|
|
// This variable keeps track of where we should start decoding a
|
|
|
|
// chunk. If a multi-byte character spans across chunk boundaries,
|
|
|
|
// we need to skip that part in the next chunk because we already
|
|
|
|
// handled it.
|
|
|
|
let mut intra_chunk_offset = 0;
|
|
|
|
|
|
|
|
for chunk_index in 0 .. chunk_count {
|
|
|
|
let ptr = src_bytes.as_ptr() as *const __m128i;
|
2018-06-01 05:54:15 -05:00
|
|
|
// We don't know if the pointer is aligned to 16 bytes, so we
|
|
|
|
// use `loadu`, which supports unaligned loading.
|
2020-12-03 16:06:58 -06:00
|
|
|
let chunk = _mm_loadu_si128(ptr.add(chunk_index));
|
2018-05-29 10:50:13 -05:00
|
|
|
|
|
|
|
// For character in the chunk, see if its byte value is < 0, which
|
|
|
|
// indicates that it's part of a UTF-8 char.
|
|
|
|
let multibyte_test = _mm_cmplt_epi8(chunk, _mm_set1_epi8(0));
|
|
|
|
// Create a bit mask from the comparison results.
|
|
|
|
let multibyte_mask = _mm_movemask_epi8(multibyte_test);
|
|
|
|
|
|
|
|
// If the bit mask is all zero, we only have ASCII chars here:
|
|
|
|
if multibyte_mask == 0 {
|
|
|
|
assert!(intra_chunk_offset == 0);
|
|
|
|
|
|
|
|
// Check if there are any control characters in the chunk. All
|
|
|
|
// control characters that we can encounter at this point have a
|
|
|
|
// byte value less than 32 or ...
|
|
|
|
let control_char_test0 = _mm_cmplt_epi8(chunk, _mm_set1_epi8(32));
|
|
|
|
let control_char_mask0 = _mm_movemask_epi8(control_char_test0);
|
|
|
|
|
|
|
|
// ... it's the ASCII 'DEL' character with a value of 127.
|
|
|
|
let control_char_test1 = _mm_cmpeq_epi8(chunk, _mm_set1_epi8(127));
|
|
|
|
let control_char_mask1 = _mm_movemask_epi8(control_char_test1);
|
|
|
|
|
|
|
|
let control_char_mask = control_char_mask0 | control_char_mask1;
|
|
|
|
|
|
|
|
if control_char_mask != 0 {
|
|
|
|
// Check for newlines in the chunk
|
|
|
|
let newlines_test = _mm_cmpeq_epi8(chunk, _mm_set1_epi8(b'\n' as i8));
|
|
|
|
let newlines_mask = _mm_movemask_epi8(newlines_test);
|
|
|
|
|
|
|
|
if control_char_mask == newlines_mask {
|
|
|
|
// All control characters are newlines, record them
|
|
|
|
let mut newlines_mask = 0xFFFF0000 | newlines_mask as u32;
|
|
|
|
let output_offset = output_offset +
|
|
|
|
BytePos::from_usize(chunk_index * CHUNK_SIZE + 1);
|
|
|
|
|
|
|
|
loop {
|
|
|
|
let index = newlines_mask.trailing_zeros();
|
|
|
|
|
|
|
|
if index >= CHUNK_SIZE as u32 {
|
|
|
|
// We have arrived at the end of the chunk.
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
lines.push(BytePos(index) + output_offset);
|
|
|
|
|
|
|
|
// Clear the bit, so we can find the next one.
|
|
|
|
newlines_mask &= (!1) << index;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We are done for this chunk. All control characters were
|
|
|
|
// newlines and we took care of those.
|
|
|
|
continue
|
|
|
|
} else {
|
|
|
|
// Some of the control characters are not newlines,
|
|
|
|
// fall through to the slow path below.
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// No control characters, nothing to record for this chunk
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// The slow path.
|
|
|
|
// There are control chars in here, fallback to generic decoding.
|
|
|
|
let scan_start = chunk_index * CHUNK_SIZE + intra_chunk_offset;
|
2018-08-18 05:13:56 -05:00
|
|
|
intra_chunk_offset = analyze_source_file_generic(
|
2018-05-29 10:50:13 -05:00
|
|
|
&src[scan_start .. ],
|
|
|
|
CHUNK_SIZE - intra_chunk_offset,
|
|
|
|
BytePos::from_usize(scan_start) + output_offset,
|
|
|
|
lines,
|
|
|
|
multi_byte_chars,
|
|
|
|
non_narrow_chars
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
// There might still be a tail left to analyze
|
|
|
|
let tail_start = chunk_count * CHUNK_SIZE + intra_chunk_offset;
|
|
|
|
if tail_start < src.len() {
|
2018-08-18 05:13:56 -05:00
|
|
|
analyze_source_file_generic(&src[tail_start as usize ..],
|
2018-05-29 10:50:13 -05:00
|
|
|
src.len() - tail_start,
|
|
|
|
output_offset + BytePos::from_usize(tail_start),
|
|
|
|
lines,
|
|
|
|
multi_byte_chars,
|
|
|
|
non_narrow_chars);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
|
|
|
|
// The target (or compiler version) does not support SSE2 ...
|
2018-08-18 05:13:56 -05:00
|
|
|
fn analyze_source_file_dispatch(src: &str,
|
|
|
|
source_file_start_pos: BytePos,
|
2018-05-29 10:50:13 -05:00
|
|
|
lines: &mut Vec<BytePos>,
|
|
|
|
multi_byte_chars: &mut Vec<MultiByteChar>,
|
|
|
|
non_narrow_chars: &mut Vec<NonNarrowChar>) {
|
2018-08-18 05:13:56 -05:00
|
|
|
analyze_source_file_generic(src,
|
2018-05-29 10:50:13 -05:00
|
|
|
src.len(),
|
2018-08-18 05:13:56 -05:00
|
|
|
source_file_start_pos,
|
2018-05-29 10:50:13 -05:00
|
|
|
lines,
|
|
|
|
multi_byte_chars,
|
|
|
|
non_narrow_chars);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// `scan_len` determines the number of bytes in `src` to scan. Note that the
|
|
|
|
// function can read past `scan_len` if a multi-byte character start within the
|
|
|
|
// range but extends past it. The overflow is returned by the function.
|
2018-08-18 05:13:56 -05:00
|
|
|
fn analyze_source_file_generic(
|
|
|
|
src: &str,
|
2018-05-29 10:50:13 -05:00
|
|
|
scan_len: usize,
|
|
|
|
output_offset: BytePos,
|
|
|
|
lines: &mut Vec<BytePos>,
|
|
|
|
multi_byte_chars: &mut Vec<MultiByteChar>,
|
|
|
|
non_narrow_chars: &mut Vec<NonNarrowChar>,
|
|
|
|
) -> usize {
|
|
|
|
assert!(src.len() >= scan_len);
|
|
|
|
let mut i = 0;
|
|
|
|
let src_bytes = src.as_bytes();
|
|
|
|
|
|
|
|
while i < scan_len {
|
|
|
|
let byte = unsafe {
|
|
|
|
// We verified that i < scan_len <= src.len()
|
|
|
|
*src_bytes.get_unchecked(i as usize)
|
|
|
|
};
|
|
|
|
|
|
|
|
// How much to advance in order to get to the next UTF-8 char in the
|
|
|
|
// string.
|
|
|
|
let mut char_len = 1;
|
|
|
|
|
|
|
|
if byte < 32 {
|
|
|
|
// This is an ASCII control character, it could be one of the cases
|
|
|
|
// that are interesting to us.
|
|
|
|
|
|
|
|
let pos = BytePos::from_usize(i) + output_offset;
|
|
|
|
|
|
|
|
match byte {
|
|
|
|
b'\n' => {
|
|
|
|
lines.push(pos + BytePos(1));
|
|
|
|
}
|
|
|
|
b'\t' => {
|
|
|
|
non_narrow_chars.push(NonNarrowChar::Tab(pos));
|
|
|
|
}
|
|
|
|
_ => {
|
|
|
|
non_narrow_chars.push(NonNarrowChar::ZeroWidth(pos));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if byte >= 127 {
|
|
|
|
// The slow path:
|
|
|
|
// This is either ASCII control character "DEL" or the beginning of
|
|
|
|
// a multibyte char. Just decode to `char`.
|
|
|
|
let c = (&src[i..]).chars().next().unwrap();
|
|
|
|
char_len = c.len_utf8();
|
|
|
|
|
|
|
|
let pos = BytePos::from_usize(i) + output_offset;
|
|
|
|
|
|
|
|
if char_len > 1 {
|
2020-12-03 16:06:58 -06:00
|
|
|
assert!((2..=4).contains(&char_len));
|
2018-05-29 10:50:13 -05:00
|
|
|
let mbc = MultiByteChar { pos, bytes: char_len as u8 };
|
|
|
|
multi_byte_chars.push(mbc);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Assume control characters are zero width.
|
|
|
|
// FIXME: How can we decide between `width` and `width_cjk`?
|
|
|
|
let char_width = UnicodeWidthChar::width(c).unwrap_or(0);
|
|
|
|
|
|
|
|
if char_width != 1 {
|
|
|
|
non_narrow_chars.push(NonNarrowChar::new(pos, char_width));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
i += char_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
i - scan_len
|
|
|
|
}
|