mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-27 07:20:11 +00:00
5bfc425236
* sysdeps/ia64/memccpy.S: New file. * sysdeps/ia64/memchr.S: New file. * sysdeps/ia64/memcmp.S: New file. * sysdeps/ia64/memcpy.S: New file. * sysdeps/ia64/memmove.S: New file. * sysdeps/ia64/memset.S: New file. * sysdeps/ia64/strcat.S: New file. * sysdeps/ia64/strchr.S: New file. * sysdeps/ia64/strcmp.S: New file. * sysdeps/ia64/strcpy.S: New file. * sysdeps/ia64/strlen.S: New file. * sysdeps/ia64/strncmp.S: New file. * sysdeps/ia64/strncpy.S: New file. * sysdeps/ia64/softpipe.h: New file. Patches by Dan Pop <Dan.Pop@cern.ch>. * manual/memory.texi: Document memory handling functions (mlock, munlock, mlockall, munlockall, brk, and sbrk)
64 lines
1.8 KiB
ArmAsm
64 lines
1.8 KiB
ArmAsm
/* Optimized version of the standard strncmp() function.
|
|
This file is part of the GNU C Library.
|
|
Copyright (C) 2000 Free Software Foundation, Inc.
|
|
Contributed by Dan Pop <Dan.Pop@cern.ch>.
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Library General Public License as
|
|
published by the Free Software Foundation; either version 2 of the
|
|
License, or (at your option) any later version.
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Library General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Library General Public
|
|
License along with the GNU C Library; see the file COPYING.LIB. If not,
|
|
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
/* Return: the result of the comparison
|
|
|
|
Inputs:
|
|
in0: s1
|
|
in1: s2
|
|
in2: n
|
|
|
|
Unlike memcmp(), this function is optimized for mismatches within the
|
|
first few characters. */
|
|
|
|
#include <sysdep.h>
|
|
#undef ret
|
|
|
|
#define s1 in0
|
|
#define s2 in1
|
|
#define n in2
|
|
|
|
#define saved_pfs r14
|
|
#define val1 r15
|
|
#define val2 r16
|
|
|
|
|
|
ENTRY(strncmp)
|
|
alloc saved_pfs = ar.pfs, 3, 0, 0, 0
|
|
mov ret0 = r0
|
|
cmp.eq p6, p0 = r0, r0 // set p6
|
|
cmp.eq p7, p0 = n, r0 // return immediately if n == 0
|
|
(p7) br.cond.spnt .restore_and_exit ;;
|
|
.loop:
|
|
ld1 val1 = [s1], 1
|
|
ld1 val2 = [s2], 1
|
|
adds n = -1, n // n--
|
|
;;
|
|
cmp.ne.and p6, p0 = val1, r0
|
|
cmp.ne.and p6, p0 = val2, r0
|
|
cmp.ne.and p6, p0 = n, r0
|
|
cmp.eq.and p6, p0 = val1, val2
|
|
(p6) br.cond.sptk .loop
|
|
sub ret0 = val1, val2
|
|
.restore_and_exit:
|
|
mov ar.pfs = saved_pfs
|
|
br.ret.sptk.many b0
|
|
END(strncmp)
|