mirror of
https://sourceware.org/git/glibc.git
synced 2025-01-04 00:31:09 +00:00
10624a97e8
Improvements compared to POWER9 version: 1. Take into account first 16B comparison for aligned strings The previous version compares the first 16B and increments r4 by the number of bytes until the address is 16B-aligned, then starts doing aligned loads at that address. For aligned strings, this causes the first 16B to be compared twice, because the increment is 0. Here we calculate the next 16B-aligned address differently, which avoids that issue. 2. Use simple comparisons for the first ~192 bytes The main loop is good for big strings, but comparing 16B each time is better for smaller strings. So after aligning the address to 16 Bytes, we check more 176B in 16B chunks. There may be some overlaps with the main loop for unaligned strings, but we avoid using the more aggressive strategy too soon, and also allow the loop to start at a 64B-aligned address. This greatly benefits smaller strings and avoids overlapping checks if the string is already aligned at a 64B boundary. 3. Reduce dependencies between load blocks caused by address calculation on loop Doing a precise time tracing on the code showed many loads in the loop were stalled waiting for updates to r4 from previous code blocks. This implementation avoids that as much as possible by using 2 registers (r4 and r5) to hold addresses to be used by different parts of the code. Also, the previous code aligned the address to 16B, then to 64B by doing a few 48B loops (if needed) until the address was aligned. The main loop could not start until that 48B loop had finished and r4 was updated with the current address. Here we calculate the address used by the loop very early, so it can start sooner. The main loop now uses 2 pointers 128B apart to make pointer updates less frequent, and also unrolls 1 iteration to guarantee there is enough time between iterations to update the pointers, reducing stalled cycles. 4. Use new P10 instructions lxvp is used to load 32B with a single instruction, reducing contention in the load queue. vextractbm allows simplifying the tail code for the loop, replacing vbpermq and avoiding having to generate a permute control vector. Reviewed-by: Paul E Murphy <murphyp@linux.ibm.com> Reviewed-by: Raphael M Zinsly <rzinsly@linux.ibm.com> Reviewed-by: Lucas A. M. Magalhaes <lamm@linux.ibm.com> |
||
|---|---|---|
| .. | ||
| a2 | ||
| be | ||
| bits | ||
| cell | ||
| fpu | ||
| le | ||
| multiarch | ||
| power4 | ||
| power6 | ||
| power7 | ||
| power8 | ||
| __longjmp-common.S | ||
| __longjmp.S | ||
| addmul_1.S | ||
| atomic-machine.h | ||
| backtrace.c | ||
| bsd-_setjmp.S | ||
| bsd-setjmp.S | ||
| bzero.S | ||
| configure | ||
| configure.ac | ||
| crti.S | ||
| crtn.S | ||
| dl-dtprocnum.h | ||
| dl-irel.h | ||
| dl-machine.c | ||
| dl-machine.h | ||
| dl-trampoline.S | ||
| entry.h | ||
| ffsll.c | ||
| hp-timing.h | ||
| Implies | ||
| lshift.S | ||
| Makefile | ||
| memcpy.S | ||
| memset.S | ||
| mul_1.S | ||
| ppc-mcount.S | ||
| register-dump.h | ||
| rtld-memset.c | ||
| setjmp-bug21895.c | ||
| setjmp-common.S | ||
| setjmp.S | ||
| stackguard-macros.h | ||
| start.S | ||
| strchr.S | ||
| strcmp.S | ||
| strlen.S | ||
| strncmp.S | ||
| submul_1.S | ||
| sysdep.h | ||
| tls-macros.h | ||
| tst-audit.h | ||
| tst-setjmp-bug21895-static.c | ||
| tst-ucontext-ppc64-vscr.c | ||