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
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
#[cfg(feature = "unit_test")]
mod tests;
/// A safe interface to `memchr`.
///
pub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> {
let p = unsafe { c::memchr(haystack.as_ptr(), needle, haystack.len()) };
if p.is_null() {
None
} else {
Some(p as usize - (haystack.as_ptr() as usize))
}
}
pub fn memrchr(needle: u8, haystack: &[u8]) -> Option<usize> {
fn memrchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {
if haystack.is_empty() {
return None;
}
let p = unsafe { c::memrchr(haystack.as_ptr(), needle, haystack.len()) };
if p.is_null() {
None
} else {
Some(p as usize - (haystack.as_ptr() as usize))
}
}
memrchr_specific(needle, haystack)
}
mod c {
use core::ptr;
/// # Safety
pub unsafe fn memchr(s: *const u8, c: u8, n: usize) -> *const u8 {
let mut ret = ptr::null();
let mut p = s;
for _ in 0..n {
if *p == c {
ret = p;
break;
}
p = p.offset(1);
}
ret
}
/// # Safety
pub unsafe fn memrchr(s: *const u8, c: u8, n: usize) -> *const u8 {
if n == 0 {
return ptr::null();
}
let mut ret = ptr::null();
let mut p: *const u8 = (s as usize + (n - 1)) as *const u8;
for _ in 0..n {
if *p == c {
ret = p;
break;
}
p = p.offset(-1);
}
ret
}
}