1 /* Copyright (c) 2009 Xilinx, Inc. All rights reserved.
3 Redistribution and use in source and binary forms, with or without
4 modification, are permitted provided that the following conditions are
7 1. Redistributions source code must retain the above copyright notice,
8 this list of conditions and the following disclaimer.
10 2. Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
14 3. Neither the name of Xilinx nor the names of its contributors may be
15 used to endorse or promote products derived from this software without
16 specific prior written permission.
18 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS "AS
19 IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
20 TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
21 PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
24 TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
25 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
26 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
27 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 <<strcmp>>---character string compare
39 int strcmp(const char *<[a]>, const char *<[b]>);
43 int strcmp(<[a]>, <[b]>)
48 <<strcmp>> compares the string at <[a]> to
52 If <<*<[a]>>> sorts lexicographically after <<*<[b]>>>,
53 <<strcmp>> returns a number greater than zero. If the two
54 strings match, <<strcmp>> returns zero. If <<*<[a]>>>
55 sorts lexicographically before <<*<[b]>>>, <<strcmp>> returns a
56 number less than zero.
61 <<strcmp>> requires no supporting OS subroutines.
70 /* Nonzero if either X or Y is not aligned on a "long" boundary. */
71 #define UNALIGNED(X, Y) \
72 (((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1)))
74 /* DETECTNULL returns nonzero if (long)X contains a NULL byte. */
75 #if LONG_MAX == 2147483647L
76 #define DETECTNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080)
78 #if LONG_MAX == 9223372036854775807L
79 #define DETECTNULL(X) (((X) - 0x0101010101010101) & ~(X) & 0x8080808080808080)
81 #error long int is not a 32bit or 64bit type.
86 #error long int is not a 32bit or 64bit byte
90 _DEFUN (strcmp, (s1, s2),
97 #if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__)
98 while (*s1 != '\0' && *s1 == *s2)
104 return (*(unsigned char *) s1) - (*(unsigned char *) s2);
109 /* If s1 or s2 are unaligned, then compare bytes. */
110 if (!UNALIGNED (s1, s2))
112 /* If s1 and s2 are word-aligned, compare them a word at a time. */
113 a1 = (unsigned long*)s1;
114 a2 = (unsigned long*)s2;
117 /* To get here, *a1 == *a2, thus if we find a null in *a1,
118 then the strings must be equal, so return zero. */
119 if (DETECTNULL (*a1))
126 /* A difference was detected in last few bytes of s1, so search bytewise */
131 while (*s1 != '\0' && *s1 == *s2)
136 return (*(unsigned char *) s1) - (*(unsigned char *) s2);
137 #endif /* not PREFER_SIZE_OVER_SPEED */
142 or r9, r0, r0 /* Index register */ \n\
146 bnei r3, try_align_args \n\
147 bnei r4, regular_strcmp /* At this point we don't have a choice */ \n\
151 pcmpbf r7, r3, r0 /* See if there is Null byte */ \n\
152 bnei r7, end_cmp_loop /* IF yes (r7 > 0) use byte compares in end_cmp_loop */ \n\
153 cmpu r7, r4, r3 /* ELSE compare whole word */ \n\
156 addik r9, r9, 4 /* delay slot */ \n\
158 lbu r3, r5, r9 /* byte compare loop */ \n\
160 cmpu r7, r4, r3 /* Compare bytes */ \n\
161 bnei r7, end_cmp_early \n\
162 bneid r3, end_cmp_loop /* If reached null on one string, terminate */ \n\
163 addik r9, r9, 1 /* delay slot */ \n\
169 bnei r7, regular_strcmp /* cannot align args */ \n\
170 rsubik r10, r3, 4 /* Number of initial bytes to align */ \n\
177 addik r10, r10, -1 \n\
178 beqid r10, cmp_loop \n\
187 brid regular_strcmp \n\
191 or r3, r0, r7 /* Return strcmp result */");
193 #endif /* ! HAVE_HW_PCMP */