newlib-cygwin/newlib/libc/machine/xtensa/strlen.S

116 lines
3.3 KiB
ArmAsm
Raw Normal View History

2023-08-17 06:05:53 +08:00
/* ANSI C standard library function strlen.
Copyright (c) 2001-2008 Tensilica Inc.
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
#include "xtensa-asm.h"
.text
.begin schedule
.align 4
.literal_position
.global strlen
.type strlen, @function
strlen:
leaf_entry sp, 16
/* a2 = s */
addi a3, a2, -4 // because we overincrement at the end
movi a4, MASK0
movi a5, MASK1
movi a6, MASK2
movi a7, MASK3
bbsi.l a2, 0, .L1mod2
bbsi.l a2, 1, .L2mod4
j .Laligned
.L1mod2: // address is odd
l8ui a8, a3, 4 // get byte 0
addi a3, a3, 1 // advance string pointer
beqz a8, .Lz3 // if byte 0 is zero
bbci.l a3, 1, .Laligned // if string pointer is now word-aligned
.L2mod4: // address is 2 mod 4
addi a3, a3, 2 // advance ptr for aligned access
l32i a8, a3, 0 // get word with first two bytes of string
bnone a8, a6, .Lz2 // if byte 2 (of word, not string) is zero
bany a8, a7, .Laligned // if byte 3 (of word, not string) is nonzero
/* Byte 3 is zero. */
addi a3, a3, 3 // point to zero byte
sub a2, a3, a2 // subtract to get length
leaf_return
/* String is word-aligned. */
.align 4
#if XCHAL_HAVE_LOOPS
#if XCHAL_HAVE_DENSITY
/* (2 mod 4) alignment for loop instruction */
#else
/* (1 mod 4) alignment for loop instruction */
.byte 0
.byte 0
#endif
#endif
.Laligned:
#if XCHAL_HAVE_LOOPS
#if XCHAL_HAVE_DENSITY
_movi.n a8, 0 // set up for the maximum loop count
#else
_movi a8, 0 // set up for the maximum loop count
#endif
loop a8, .Lz3 // loop forever (almost anyway)
#endif
1: l32i a8, a3, 4 // get next word of string
addi a3, a3, 4 // advance string pointer
bnone a8, a4, .Lz0 // if byte 0 is zero
bnone a8, a5, .Lz1 // if byte 1 is zero
bnone a8, a6, .Lz2 // if byte 2 is zero
#if XCHAL_HAVE_LOOPS
bnone a8, a7, .Lz3 // if byte 3 is zero
#else
bany a8, a7, 1b // repeat if byte 3 is non-zero
#endif
.Lz3: /* Byte 3 is zero. */
addi a3, a3, 3 // point to zero byte
/* Fall through.... */
.Lz0: /* Byte 0 is zero. */
sub a2, a3, a2 // subtract to get length
leaf_return
.Lz1: /* Byte 1 is zero. */
addi a3, a3, 1 // point to zero byte
sub a2, a3, a2 // subtract to get length
leaf_return
.Lz2: /* Byte 2 is zero. */
addi a3, a3, 2 // point to zero byte
sub a2, a3, a2 // subtract to get length
leaf_return
.end schedule
.size strlen, . - strlen