AuroraMiddleware/glibc
1
0
Fork 0
mirror of https://sourceware.org/git/glibc.git synced 2024-11-09 23:00:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

x86_64: Optimize ffsll function code size.

Browse Source 
Ffsll function randomly regress by ~20%, depending on how code gets
aligned in memory.  Ffsll function code size is 17 bytes.  Since default
function alignment is 16 bytes, it can load on 16, 32, 48 or 64 bytes
aligned memory.  When ffsll function load at 16, 32 or 64 bytes aligned
memory, entire code fits in single 64 bytes cache line.  When ffsll
function load at 48 bytes aligned memory, it splits in two cache line,
hence random regression.

Ffsll function size reduction from 17 bytes to 12 bytes ensures that it
will always fit in single 64 bytes cache line.

This patch fixes ffsll function random performance regression.

Reviewed-by: Carlos O'Donell <carlos@redhat.com>
(cherry picked from commit 9d94997b5f)
This commit is contained in:
Sunil K Pandey 2023-07-26 08:34:05 -07:00
parent 9f27ef8090
commit 61f2272bc6
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
sysdeps/x86_64/ffsll.c
View File

@ -27,13 +27,13 @@ int
ffsll (long long int x)
{
long long int cnt;
long long int tmp;
asm ("bsfq %2,%0\n" /* Count low bits in X and store in %1. */
"cmoveq %1,%0\n" /* If number was zero, use -1 as result. */
: "=&r" (cnt), "=r" (tmp) : "rm" (x), "1" (-1));
asm ("mov $-1,%k0\n" /* Initialize cnt to -1. */
"bsf %1,%0\n" /* Count low bits in x and store in cnt. */
"inc %k0\n" /* Increment cnt by 1. */
: "=&r" (cnt) : "r" (x));
return cnt + 1;
return cnt;
}
#ifndef __ILP32__