1caab277bSThomas Gleixner/* SPDX-License-Identifier: GPL-2.0-only */ 20a42cb0aSzhichang.yuan/* 30a42cb0aSzhichang.yuan * Copyright (C) 2013 ARM Ltd. 40a42cb0aSzhichang.yuan * Copyright (C) 2013 Linaro. 50a42cb0aSzhichang.yuan * 60a42cb0aSzhichang.yuan * This code is based on glibc cortex strings work originally authored by Linaro 70a42cb0aSzhichang.yuan * be found @ 80a42cb0aSzhichang.yuan * 90a42cb0aSzhichang.yuan * http://bazaar.launchpad.net/~linaro-toolchain-dev/cortex-strings/trunk/ 100a42cb0aSzhichang.yuan * files/head:/src/aarch64/ 110a42cb0aSzhichang.yuan */ 120a42cb0aSzhichang.yuan 130a42cb0aSzhichang.yuan#include <linux/linkage.h> 140a42cb0aSzhichang.yuan#include <asm/assembler.h> 150a42cb0aSzhichang.yuan 160a42cb0aSzhichang.yuan/* 170a42cb0aSzhichang.yuan * determine the length of a fixed-size string 180a42cb0aSzhichang.yuan * 190a42cb0aSzhichang.yuan * Parameters: 200a42cb0aSzhichang.yuan * x0 - const string pointer 210a42cb0aSzhichang.yuan * x1 - maximal string length 220a42cb0aSzhichang.yuan * Returns: 230a42cb0aSzhichang.yuan * x0 - the return length of specific string 240a42cb0aSzhichang.yuan */ 250a42cb0aSzhichang.yuan 260a42cb0aSzhichang.yuan/* Arguments and results. */ 270a42cb0aSzhichang.yuansrcin .req x0 280a42cb0aSzhichang.yuanlen .req x0 290a42cb0aSzhichang.yuanlimit .req x1 300a42cb0aSzhichang.yuan 310a42cb0aSzhichang.yuan/* Locals and temporaries. */ 320a42cb0aSzhichang.yuansrc .req x2 330a42cb0aSzhichang.yuandata1 .req x3 340a42cb0aSzhichang.yuandata2 .req x4 350a42cb0aSzhichang.yuandata2a .req x5 360a42cb0aSzhichang.yuanhas_nul1 .req x6 370a42cb0aSzhichang.yuanhas_nul2 .req x7 380a42cb0aSzhichang.yuantmp1 .req x8 390a42cb0aSzhichang.yuantmp2 .req x9 400a42cb0aSzhichang.yuantmp3 .req x10 410a42cb0aSzhichang.yuantmp4 .req x11 420a42cb0aSzhichang.yuanzeroones .req x12 430a42cb0aSzhichang.yuanpos .req x13 440a42cb0aSzhichang.yuanlimit_wd .req x14 450a42cb0aSzhichang.yuan 460a42cb0aSzhichang.yuan#define REP8_01 0x0101010101010101 470a42cb0aSzhichang.yuan#define REP8_7f 0x7f7f7f7f7f7f7f7f 480a42cb0aSzhichang.yuan#define REP8_80 0x8080808080808080 490a42cb0aSzhichang.yuan 50*0f61f6beSMark RutlandSYM_FUNC_START(__pi_strnlen) 510a42cb0aSzhichang.yuan cbz limit, .Lhit_limit 520a42cb0aSzhichang.yuan mov zeroones, #REP8_01 530a42cb0aSzhichang.yuan bic src, srcin, #15 540a42cb0aSzhichang.yuan ands tmp1, srcin, #15 550a42cb0aSzhichang.yuan b.ne .Lmisaligned 560a42cb0aSzhichang.yuan /* Calculate the number of full and partial words -1. */ 570a42cb0aSzhichang.yuan sub limit_wd, limit, #1 /* Limit != 0, so no underflow. */ 580a42cb0aSzhichang.yuan lsr limit_wd, limit_wd, #4 /* Convert to Qwords. */ 590a42cb0aSzhichang.yuan 600a42cb0aSzhichang.yuan /* 610a42cb0aSzhichang.yuan * NUL detection works on the principle that (X - 1) & (~X) & 0x80 620a42cb0aSzhichang.yuan * (=> (X - 1) & ~(X | 0x7f)) is non-zero iff a byte is zero, and 630a42cb0aSzhichang.yuan * can be done in parallel across the entire word. 640a42cb0aSzhichang.yuan */ 650a42cb0aSzhichang.yuan /* 660a42cb0aSzhichang.yuan * The inner loop deals with two Dwords at a time. This has a 670a42cb0aSzhichang.yuan * slightly higher start-up cost, but we should win quite quickly, 680a42cb0aSzhichang.yuan * especially on cores with a high number of issue slots per 690a42cb0aSzhichang.yuan * cycle, as we get much better parallelism out of the operations. 700a42cb0aSzhichang.yuan */ 710a42cb0aSzhichang.yuan.Lloop: 720a42cb0aSzhichang.yuan ldp data1, data2, [src], #16 730a42cb0aSzhichang.yuan.Lrealigned: 740a42cb0aSzhichang.yuan sub tmp1, data1, zeroones 750a42cb0aSzhichang.yuan orr tmp2, data1, #REP8_7f 760a42cb0aSzhichang.yuan sub tmp3, data2, zeroones 770a42cb0aSzhichang.yuan orr tmp4, data2, #REP8_7f 780a42cb0aSzhichang.yuan bic has_nul1, tmp1, tmp2 790a42cb0aSzhichang.yuan bic has_nul2, tmp3, tmp4 800a42cb0aSzhichang.yuan subs limit_wd, limit_wd, #1 810a42cb0aSzhichang.yuan orr tmp1, has_nul1, has_nul2 820a42cb0aSzhichang.yuan ccmp tmp1, #0, #0, pl /* NZCV = 0000 */ 830a42cb0aSzhichang.yuan b.eq .Lloop 840a42cb0aSzhichang.yuan 850a42cb0aSzhichang.yuan cbz tmp1, .Lhit_limit /* No null in final Qword. */ 860a42cb0aSzhichang.yuan 870a42cb0aSzhichang.yuan /* 880a42cb0aSzhichang.yuan * We know there's a null in the final Qword. The easiest thing 890a42cb0aSzhichang.yuan * to do now is work out the length of the string and return 900a42cb0aSzhichang.yuan * MIN (len, limit). 910a42cb0aSzhichang.yuan */ 920a42cb0aSzhichang.yuan sub len, src, srcin 930a42cb0aSzhichang.yuan cbz has_nul1, .Lnul_in_data2 940a42cb0aSzhichang.yuanCPU_BE( mov data2, data1 ) /*perpare data to re-calculate the syndrome*/ 950a42cb0aSzhichang.yuan 960a42cb0aSzhichang.yuan sub len, len, #8 970a42cb0aSzhichang.yuan mov has_nul2, has_nul1 980a42cb0aSzhichang.yuan.Lnul_in_data2: 990a42cb0aSzhichang.yuan /* 1000a42cb0aSzhichang.yuan * For big-endian, carry propagation (if the final byte in the 1010a42cb0aSzhichang.yuan * string is 0x01) means we cannot use has_nul directly. The 1020a42cb0aSzhichang.yuan * easiest way to get the correct byte is to byte-swap the data 1030a42cb0aSzhichang.yuan * and calculate the syndrome a second time. 1040a42cb0aSzhichang.yuan */ 1050a42cb0aSzhichang.yuanCPU_BE( rev data2, data2 ) 1060a42cb0aSzhichang.yuanCPU_BE( sub tmp1, data2, zeroones ) 1070a42cb0aSzhichang.yuanCPU_BE( orr tmp2, data2, #REP8_7f ) 1080a42cb0aSzhichang.yuanCPU_BE( bic has_nul2, tmp1, tmp2 ) 1090a42cb0aSzhichang.yuan 1100a42cb0aSzhichang.yuan sub len, len, #8 1110a42cb0aSzhichang.yuan rev has_nul2, has_nul2 1120a42cb0aSzhichang.yuan clz pos, has_nul2 1130a42cb0aSzhichang.yuan add len, len, pos, lsr #3 /* Bits to bytes. */ 1140a42cb0aSzhichang.yuan cmp len, limit 1150a42cb0aSzhichang.yuan csel len, len, limit, ls /* Return the lower value. */ 1160a42cb0aSzhichang.yuan ret 1170a42cb0aSzhichang.yuan 1180a42cb0aSzhichang.yuan.Lmisaligned: 1190a42cb0aSzhichang.yuan /* 1200a42cb0aSzhichang.yuan * Deal with a partial first word. 1210a42cb0aSzhichang.yuan * We're doing two things in parallel here; 1220a42cb0aSzhichang.yuan * 1) Calculate the number of words (but avoiding overflow if 1230a42cb0aSzhichang.yuan * limit is near ULONG_MAX) - to do this we need to work out 1240a42cb0aSzhichang.yuan * limit + tmp1 - 1 as a 65-bit value before shifting it; 1250a42cb0aSzhichang.yuan * 2) Load and mask the initial data words - we force the bytes 1260a42cb0aSzhichang.yuan * before the ones we are interested in to 0xff - this ensures 1270a42cb0aSzhichang.yuan * early bytes will not hit any zero detection. 1280a42cb0aSzhichang.yuan */ 1290a42cb0aSzhichang.yuan ldp data1, data2, [src], #16 1300a42cb0aSzhichang.yuan 1310a42cb0aSzhichang.yuan sub limit_wd, limit, #1 1320a42cb0aSzhichang.yuan and tmp3, limit_wd, #15 1330a42cb0aSzhichang.yuan lsr limit_wd, limit_wd, #4 1340a42cb0aSzhichang.yuan 1350a42cb0aSzhichang.yuan add tmp3, tmp3, tmp1 1360a42cb0aSzhichang.yuan add limit_wd, limit_wd, tmp3, lsr #4 1370a42cb0aSzhichang.yuan 1380a42cb0aSzhichang.yuan neg tmp4, tmp1 1390a42cb0aSzhichang.yuan lsl tmp4, tmp4, #3 /* Bytes beyond alignment -> bits. */ 1400a42cb0aSzhichang.yuan 1410a42cb0aSzhichang.yuan mov tmp2, #~0 1420a42cb0aSzhichang.yuan /* Big-endian. Early bytes are at MSB. */ 1430a42cb0aSzhichang.yuanCPU_BE( lsl tmp2, tmp2, tmp4 ) /* Shift (tmp1 & 63). */ 1440a42cb0aSzhichang.yuan /* Little-endian. Early bytes are at LSB. */ 1450a42cb0aSzhichang.yuanCPU_LE( lsr tmp2, tmp2, tmp4 ) /* Shift (tmp1 & 63). */ 1460a42cb0aSzhichang.yuan 1470a42cb0aSzhichang.yuan cmp tmp1, #8 1480a42cb0aSzhichang.yuan 1490a42cb0aSzhichang.yuan orr data1, data1, tmp2 1500a42cb0aSzhichang.yuan orr data2a, data2, tmp2 1510a42cb0aSzhichang.yuan 1520a42cb0aSzhichang.yuan csinv data1, data1, xzr, le 1530a42cb0aSzhichang.yuan csel data2, data2, data2a, le 1540a42cb0aSzhichang.yuan b .Lrealigned 1550a42cb0aSzhichang.yuan 1560a42cb0aSzhichang.yuan.Lhit_limit: 1570a42cb0aSzhichang.yuan mov len, limit 1580a42cb0aSzhichang.yuan ret 159*0f61f6beSMark RutlandSYM_FUNC_END(__pi_strnlen) 160*0f61f6beSMark Rutland 161*0f61f6beSMark RutlandSYM_FUNC_ALIAS_WEAK(strnlen, __pi_strnlen) 162ac0e8c72SMark RutlandEXPORT_SYMBOL_NOKASAN(strnlen) 163