Lines Matching refs:start_ptr
113 let start_ptr = haystack.as_ptr(); in memchr() localVariable
115 let mut ptr = start_ptr; in memchr()
120 return Some(sub(ptr, start_ptr)); in memchr()
127 if let Some(i) = forward_search1(start_ptr, end_ptr, ptr, vn1) { in memchr()
131 ptr = ptr.add(VECTOR_SIZE - (start_ptr as usize & VECTOR_ALIGN)); in memchr()
132 debug_assert!(ptr > start_ptr && end_ptr.sub(VECTOR_SIZE) >= start_ptr); in memchr()
148 let mut at = sub(ptr, start_ptr); in memchr()
176 if let Some(i) = forward_search1(start_ptr, end_ptr, ptr, vn1) { in memchr()
186 return forward_search1(start_ptr, end_ptr, ptr, vn1); in memchr()
197 let start_ptr = haystack.as_ptr(); in memchr2() localVariable
199 let mut ptr = start_ptr; in memchr2()
204 return Some(sub(ptr, start_ptr)); in memchr2()
211 if let Some(i) = forward_search2(start_ptr, end_ptr, ptr, vn1, vn2) { in memchr2()
215 ptr = ptr.add(VECTOR_SIZE - (start_ptr as usize & VECTOR_ALIGN)); in memchr2()
216 debug_assert!(ptr > start_ptr && end_ptr.sub(VECTOR_SIZE) >= start_ptr); in memchr2()
230 let mut at = sub(ptr, start_ptr); in memchr2()
245 if let Some(i) = forward_search2(start_ptr, end_ptr, ptr, vn1, vn2) { in memchr2()
255 return forward_search2(start_ptr, end_ptr, ptr, vn1, vn2); in memchr2()
272 let start_ptr = haystack.as_ptr(); in memchr3() localVariable
274 let mut ptr = start_ptr; in memchr3()
279 return Some(sub(ptr, start_ptr)); in memchr3()
286 if let Some(i) = forward_search3(start_ptr, end_ptr, ptr, vn1, vn2, vn3) { in memchr3()
290 ptr = ptr.add(VECTOR_SIZE - (start_ptr as usize & VECTOR_ALIGN)); in memchr3()
291 debug_assert!(ptr > start_ptr && end_ptr.sub(VECTOR_SIZE) >= start_ptr); in memchr3()
309 let mut at = sub(ptr, start_ptr); in memchr3()
327 forward_search3(start_ptr, end_ptr, ptr, vn1, vn2, vn3) in memchr3()
338 return forward_search3(start_ptr, end_ptr, ptr, vn1, vn2, vn3); in memchr3()
348 let start_ptr = haystack.as_ptr(); in memrchr() localVariable
353 while ptr > start_ptr { in memrchr()
356 return Some(sub(ptr, start_ptr)); in memrchr()
363 if let Some(i) = reverse_search1(start_ptr, end_ptr, ptr, vn1) { in memrchr()
368 debug_assert!(start_ptr <= ptr && ptr <= end_ptr); in memrchr()
369 while loop_size == LOOP_SIZE && ptr >= start_ptr.add(loop_size) { in memrchr()
385 let mut at = sub(ptr.add(3 * VECTOR_SIZE), start_ptr); in memrchr()
409 while ptr >= start_ptr.add(VECTOR_SIZE) { in memrchr()
411 if let Some(i) = reverse_search1(start_ptr, end_ptr, ptr, vn1) { in memrchr()
415 if ptr > start_ptr { in memrchr()
416 debug_assert!(sub(ptr, start_ptr) < VECTOR_SIZE); in memrchr()
417 return reverse_search1(start_ptr, end_ptr, start_ptr, vn1); in memrchr()
428 let start_ptr = haystack.as_ptr(); in memrchr2() localVariable
433 while ptr > start_ptr { in memrchr2()
436 return Some(sub(ptr, start_ptr)); in memrchr2()
443 if let Some(i) = reverse_search2(start_ptr, end_ptr, ptr, vn1, vn2) { in memrchr2()
448 debug_assert!(start_ptr <= ptr && ptr <= end_ptr); in memrchr2()
449 while loop_size == LOOP_SIZE2 && ptr >= start_ptr.add(loop_size) { in memrchr2()
463 let mut at = sub(ptr.add(VECTOR_SIZE), start_ptr); in memrchr2()
476 while ptr >= start_ptr.add(VECTOR_SIZE) { in memrchr2()
478 if let Some(i) = reverse_search2(start_ptr, end_ptr, ptr, vn1, vn2) { in memrchr2()
482 if ptr > start_ptr { in memrchr2()
483 debug_assert!(sub(ptr, start_ptr) < VECTOR_SIZE); in memrchr2()
484 return reverse_search2(start_ptr, end_ptr, start_ptr, vn1, vn2); in memrchr2()
501 let start_ptr = haystack.as_ptr(); in memrchr3() localVariable
506 while ptr > start_ptr { in memrchr3()
509 return Some(sub(ptr, start_ptr)); in memrchr3()
516 if let Some(i) = reverse_search3(start_ptr, end_ptr, ptr, vn1, vn2, vn3) { in memrchr3()
521 debug_assert!(start_ptr <= ptr && ptr <= end_ptr); in memrchr3()
522 while loop_size == LOOP_SIZE2 && ptr >= start_ptr.add(loop_size) { in memrchr3()
540 let mut at = sub(ptr.add(VECTOR_SIZE), start_ptr); in memrchr3()
555 while ptr >= start_ptr.add(VECTOR_SIZE) { in memrchr3()
558 reverse_search3(start_ptr, end_ptr, ptr, vn1, vn2, vn3) in memrchr3()
563 if ptr > start_ptr { in memrchr3()
564 debug_assert!(sub(ptr, start_ptr) < VECTOR_SIZE); in memrchr3()
565 return reverse_search3(start_ptr, end_ptr, start_ptr, vn1, vn2, vn3); in memrchr3()
572 start_ptr: *const u8, in forward_search1()
577 debug_assert!(sub(end_ptr, start_ptr) >= VECTOR_SIZE); in forward_search1()
578 debug_assert!(start_ptr <= ptr); in forward_search1()
584 Some(sub(ptr, start_ptr) + forward_pos(mask)) in forward_search1()
592 start_ptr: *const u8, in forward_search2()
598 debug_assert!(sub(end_ptr, start_ptr) >= VECTOR_SIZE); in forward_search2()
599 debug_assert!(start_ptr <= ptr); in forward_search2()
608 Some(sub(ptr, start_ptr) + forward_pos2(mask1, mask2)) in forward_search2()
616 start_ptr: *const u8, in forward_search3()
623 debug_assert!(sub(end_ptr, start_ptr) >= VECTOR_SIZE); in forward_search3()
624 debug_assert!(start_ptr <= ptr); in forward_search3()
636 Some(sub(ptr, start_ptr) + forward_pos3(mask1, mask2, mask3)) in forward_search3()
644 start_ptr: *const u8, in reverse_search1()
649 debug_assert!(sub(end_ptr, start_ptr) >= VECTOR_SIZE); in reverse_search1()
650 debug_assert!(start_ptr <= ptr); in reverse_search1()
656 Some(sub(ptr, start_ptr) + reverse_pos(mask)) in reverse_search1()
664 start_ptr: *const u8, in reverse_search2()
670 debug_assert!(sub(end_ptr, start_ptr) >= VECTOR_SIZE); in reverse_search2()
671 debug_assert!(start_ptr <= ptr); in reverse_search2()
680 Some(sub(ptr, start_ptr) + reverse_pos2(mask1, mask2)) in reverse_search2()
688 start_ptr: *const u8, in reverse_search3()
695 debug_assert!(sub(end_ptr, start_ptr) >= VECTOR_SIZE); in reverse_search3()
696 debug_assert!(start_ptr <= ptr); in reverse_search3()
708 Some(sub(ptr, start_ptr) + reverse_pos3(mask1, mask2, mask3)) in reverse_search3()