searcher: use naive line counting on big-endian

This patches out bytecount's "fast" vectorized algorithm on big-endian
machines, where it has been observed to fail. Going forward, bytecount
should probably fix this on their end, but for now, we take a small
performance hit on big-endian machines.

Fixes #1144

1 files changed, 7 insertions, 0 deletions

diff --git a/grep-searcher/src/lines.rs b/grep-searcher/src/lines.rs
index ed225a42..9393234c 100644
--- a/grep-searcher/src/lines.rs
+++ b/grep-searcher/src/lines.rs
@@ -109,10 +109,17 @@ impl LineStep {
 }
 
 /// Count the number of occurrences of `line_term` in `bytes`.
+#[cfg(target_endian = "little")]
 pub fn count(bytes: &[u8], line_term: u8) -> u64 {
     bytecount::count(bytes, line_term) as u64
 }
 
+/// Count the number of occurrences of `line_term` in `bytes`.
+#[cfg(target_endian = "big")]
+pub fn count(bytes: &[u8], line_term: u8) -> u64 {
+    bytecount::naive_count(bytes, line_term) as u64
+}
+
 /// Given a line that possibly ends with a terminator, return that line without
 /// the terminator.
 #[inline(always)]