Skip to content

L
linux
Commit 43de30d3 authored by Sam Tebbs's avatar Sam Tebbs Committed by Will Deacon
Browse files
Options

arm64: Import latest version of Cortex Strings' memcmp 

Import the latest version of the former Cortex Strings - now
Arm Optimized Routines - memcmp function based on the upstream
code of string/aarch64/memcmp.S at commit e823e3a from
https://github.com/ARM-software/optimized-routines

Note that for simplicity Arm have chosen to contribute this code
to Linux under GPLv2 rather than the original MIT license.
Signed-off-by: default avatarSam Tebbs <sam.tebbs@arm.com>
[ rm: update attribution and commit message ]
Signed-off-by: default avatarRobin Murphy <robin.murphy@arm.com>
Acked-by: default avatarMark Rutland <mark.rutland@arm.com>
Link: https://lore.kernel.org/r/2889de2d41054f3f508fb3addad784a3606ef383.1622128527.git.robin.murphy@arm.comSigned-off-by: default avatarWill Deacon <will@kernel.org>
parent c4681547
Hide whitespace changes
Inline Side-by-side
Showing with 119 additions and 227 deletions
arch/arm64/lib/memcmp.S
View file @ 43de30d3
/* SPDX-License-Identifier: GPL-2.0-only */ /* SPDX-License-Identifier: GPL-2.0-only */
/* /*
* Copyright (C) 2013 ARM Ltd. * Copyright (c) 2013-2020, Arm Limited.
* Copyright (C) 2013 Linaro.
* *
* This code is based on glibc cortex strings work originally authored by Linaro * Adapted from the original at:
* be found @ * https://github.com/ARM-software/optimized-routines/blob/master/string/aarch64/memcmp.S
*
* http://bazaar.launchpad.net/~linaro-toolchain-dev/cortex-strings/trunk/
* files/head:/src/aarch64/
*/ */
#include <linux/linkage.h> #include <linux/linkage.h>
#include <asm/assembler.h> #include <asm/assembler.h>
/* /* Assumptions:
* compare memory areas(when two memory areas' offset are different, *
* alignment handled by the hardware) * ARMv8-a, AArch64, unaligned accesses.
* */
* Parameters:
* x0 - const memory area 1 pointer #define L(label) .L ## label
* x1 - const memory area 2 pointer
* x2 - the maximal compare byte length
* Returns:
* x0 - a compare result, maybe less than, equal to, or greater than ZERO
*/
/* Parameters and result. */ /* Parameters and result. */
src1 .req x0 #define src1 x0
src2 .req x1 #define src2 x1
limit .req x2 #define limit x2
result .req x0 #define result w0
/* Internal variables. */ /* Internal variables. */
data1 .req x3 #define data1 x3
data1w .req w3 #define data1w w3
data2 .req x4 #define data1h x4
data2w .req w4 #define data2 x5
has_nul .req x5 #define data2w w5
diff .req x6 #define data2h x6
endloop .req x7 #define tmp1 x7
tmp1 .req x8 #define tmp2 x8
tmp2 .req x9
tmp3 .req x10
pos .req x11
limit_wd .req x12
mask .req x13
SYM_FUNC_START_WEAK_PI(memcmp) SYM_FUNC_START_WEAK_PI(memcmp)
cbz limit, .Lret0 subs limit, limit, 8
eor tmp1, src1, src2 b.lo L(less8)
tst tmp1, #7
b.ne .Lmisaligned8 ldr data1, [src1], 8
ands tmp1, src1, #7 ldr data2, [src2], 8
b.ne .Lmutual_align cmp data1, data2
sub limit_wd, limit, #1 /* limit != 0, so no underflow. */ b.ne L(return)
lsr limit_wd, limit_wd, #3 /* Convert to Dwords. */
/* subs limit, limit, 8
* The input source addresses are at alignment boundary. b.gt L(more16)
* Directly compare eight bytes each time.
*/ ldr data1, [src1, limit]
.Lloop_aligned: ldr data2, [src2, limit]
ldr data1, [src1], #8 b L(return)
ldr data2, [src2], #8
.Lstart_realigned: L(more16):
subs limit_wd, limit_wd, #1 ldr data1, [src1], 8
eor diff, data1, data2 /* Non-zero if differences found. */ ldr data2, [src2], 8
csinv endloop, diff, xzr, cs /* Last Dword or differences. */ cmp data1, data2
cbz endloop, .Lloop_aligned bne L(return)
/* Not reached the limit, must have found a diff. */ /* Jump directly to comparing the last 16 bytes for 32 byte (or less)
tbz limit_wd, #63, .Lnot_limit strings. */
subs limit, limit, 16
/* Limit % 8 == 0 => the diff is in the last 8 bytes. */ b.ls L(last_bytes)
ands limit, limit, #7
b.eq .Lnot_limit /* We overlap loads between 0-32 bytes at either side of SRC1 when we
/* try to align, so limit it only to strings larger than 128 bytes. */
* The remained bytes less than 8. It is needed to extract valid data cmp limit, 96
* from last eight bytes of the intended memory range. b.ls L(loop16)
*/
lsl limit, limit, #3 /* bytes-> bits. */ /* Align src1 and adjust src2 with bytes not yet done. */
mov mask, #~0 and tmp1, src1, 15
CPU_BE( lsr mask, mask, limit ) add limit, limit, tmp1
CPU_LE( lsl mask, mask, limit ) sub src1, src1, tmp1
bic data1, data1, mask sub src2, src2, tmp1
bic data2, data2, mask
/* Loop performing 16 bytes per iteration using aligned src1.
orr diff, diff, mask Limit is pre-decremented by 16 and must be larger than zero.
b .Lnot_limit Exit if <= 16 bytes left to do or if the data is not equal. */
.p2align 4
.Lmutual_align: L(loop16):
/* ldp data1, data1h, [src1], 16
* Sources are mutually aligned, but are not currently at an ldp data2, data2h, [src2], 16
* alignment boundary. Round down the addresses and then mask off subs limit, limit, 16
* the bytes that precede the start point. ccmp data1, data2, 0, hi
*/ ccmp data1h, data2h, 0, eq
bic src1, src1, #7 b.eq L(loop16)
bic src2, src2, #7
ldr data1, [src1], #8 cmp data1, data2
ldr data2, [src2], #8 bne L(return)
/* mov data1, data1h
* We can not add limit with alignment offset(tmp1) here. Since the mov data2, data2h
* addition probably make the limit overflown. cmp data1, data2
*/ bne L(return)
sub limit_wd, limit, #1/*limit != 0, so no underflow.*/
and tmp3, limit_wd, #7 /* Compare last 1-16 bytes using unaligned access. */
lsr limit_wd, limit_wd, #3 L(last_bytes):
add tmp3, tmp3, tmp1 add src1, src1, limit
add limit_wd, limit_wd, tmp3, lsr #3 add src2, src2, limit
add limit, limit, tmp1/* Adjust the limit for the extra. */ ldp data1, data1h, [src1]
ldp data2, data2h, [src2]
lsl tmp1, tmp1, #3/* Bytes beyond alignment -> bits.*/ cmp data1, data2
neg tmp1, tmp1/* Bits to alignment -64. */ bne L(return)
mov tmp2, #~0 mov data1, data1h
/*mask off the non-intended bytes before the start address.*/ mov data2, data2h
CPU_BE( lsl tmp2, tmp2, tmp1 )/*Big-endian.Early bytes are at MSB*/ cmp data1, data2
/* Little-endian. Early bytes are at LSB. */
CPU_LE( lsr tmp2, tmp2, tmp1 ) /* Compare data bytes and set return value to 0, -1 or 1. */
L(return):
orr data1, data1, tmp2 #ifndef __AARCH64EB__
orr data2, data2, tmp2 rev data1, data1
b .Lstart_realigned rev data2, data2
#endif
/*src1 and src2 have different alignment offset.*/ cmp data1, data2
.Lmisaligned8: L(ret_eq):
cmp limit, #8 cset result, ne
b.lo .Ltiny8proc /*limit < 8: compare byte by byte*/ cneg result, result, lo
and tmp1, src1, #7
neg tmp1, tmp1
add tmp1, tmp1, #8/*valid length in the first 8 bytes of src1*/
and tmp2, src2, #7
neg tmp2, tmp2
add tmp2, tmp2, #8/*valid length in the first 8 bytes of src2*/
subs tmp3, tmp1, tmp2
csel pos, tmp1, tmp2, hi /*Choose the maximum.*/
sub limit, limit, pos
/*compare the proceeding bytes in the first 8 byte segment.*/
.Ltinycmp:
ldrb data1w, [src1], #1
ldrb data2w, [src2], #1
subs pos, pos, #1
ccmp data1w, data2w, #0, ne /* NZCV = 0b0000. */
b.eq .Ltinycmp
cbnz pos, 1f /*diff occurred before the last byte.*/
cmp data1w, data2w
b.eq .Lstart_align
1:
sub result, data1, data2
ret ret
.Lstart_align: .p2align 4
lsr limit_wd, limit, #3 /* Compare up to 8 bytes. Limit is [-8..-1]. */
cbz limit_wd, .Lremain8 L(less8):
adds limit, limit, 4
ands xzr, src1, #7 b.lo L(less4)
b.eq .Lrecal_offset ldr data1w, [src1], 4
/*process more leading bytes to make src1 aligned...*/ ldr data2w, [src2], 4
add src1, src1, tmp3 /*backwards src1 to alignment boundary*/ cmp data1w, data2w
add src2, src2, tmp3 b.ne L(return)
sub limit, limit, tmp3 sub limit, limit, 4
lsr limit_wd, limit, #3 L(less4):
cbz limit_wd, .Lremain8 adds limit, limit, 4
/*load 8 bytes from aligned SRC1..*/ beq L(ret_eq)
ldr data1, [src1], #8 L(byte_loop):
ldr data2, [src2], #8 ldrb data1w, [src1], 1
ldrb data2w, [src2], 1
subs limit_wd, limit_wd, #1 subs limit, limit, 1
eor diff, data1, data2 /*Non-zero if differences found.*/ ccmp data1w, data2w, 0, ne /* NZCV = 0b0000. */
csinv endloop, diff, xzr, ne b.eq L(byte_loop)
cbnz endloop, .Lunequal_proc sub result, data1w, data2w
/*How far is the current SRC2 from the alignment boundary...*/
and tmp3, tmp3, #7
.Lrecal_offset:/*src1 is aligned now..*/
neg pos, tmp3
.Lloopcmp_proc:
/*
* Divide the eight bytes into two parts. First,backwards the src2
* to an alignment boundary,load eight bytes and compare from
* the SRC2 alignment boundary. If all 8 bytes are equal,then start
* the second part's comparison. Otherwise finish the comparison.
* This special handle can garantee all the accesses are in the
* thread/task space in avoid to overrange access.
*/
ldr data1, [src1,pos]
ldr data2, [src2,pos]
eor diff, data1, data2 /* Non-zero if differences found. */
cbnz diff, .Lnot_limit
/*The second part process*/
ldr data1, [src1], #8
ldr data2, [src2], #8
eor diff, data1, data2 /* Non-zero if differences found. */
subs limit_wd, limit_wd, #1
csinv endloop, diff, xzr, ne/*if limit_wd is 0,will finish the cmp*/
cbz endloop, .Lloopcmp_proc
.Lunequal_proc:
cbz diff, .Lremain8
/* There is difference occurred in the latest comparison. */
.Lnot_limit:
/*
* For little endian,reverse the low significant equal bits into MSB,then
* following CLZ can find how many equal bits exist.
*/
CPU_LE( rev diff, diff )
CPU_LE( rev data1, data1 )
CPU_LE( rev data2, data2 )
/*
* The MS-non-zero bit of DIFF marks either the first bit
* that is different, or the end of the significant data.
* Shifting left now will bring the critical information into the
* top bits.
*/
clz pos, diff
lsl data1, data1, pos
lsl data2, data2, pos
/*
* We need to zero-extend (char is unsigned) the value and then
* perform a signed subtraction.
*/
lsr data1, data1, #56
sub result, data1, data2, lsr #56
ret ret
.Lremain8:
/* Limit % 8 == 0 =>. all data are equal.*/
ands limit, limit, #7
b.eq .Lret0
.Ltiny8proc:
ldrb data1w, [src1], #1
ldrb data2w, [src2], #1
subs limit, limit, #1
ccmp data1w, data2w, #0, ne /* NZCV = 0b0000. */
b.eq .Ltiny8proc
sub result, data1, data2
ret
.Lret0:
mov result, #0
ret
SYM_FUNC_END_PI(memcmp) SYM_FUNC_END_PI(memcmp)
EXPORT_SYMBOL_NOKASAN(memcmp) EXPORT_SYMBOL_NOKASAN(memcmp)
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
GitLab Nexedi Edition | About GitLab | About Nexedi | 沪ICP备2021021310号-2 | 沪ICP备2021021310号-7