Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 1 | /* |
| 2 | FUNCTION |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 3 | <<strcmp>>---character string compare |
| 4 | |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 5 | INDEX |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 6 | strcmp |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 7 | |
| 8 | ANSI_SYNOPSIS |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 9 | #include <string.h> |
| 10 | int strcmp(const char *<[a]>, const char *<[b]>); |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 11 | |
| 12 | TRAD_SYNOPSIS |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 13 | #include <string.h> |
| 14 | int strcmp(<[a]>, <[b]>) |
| 15 | char *<[a]>; |
| 16 | char *<[b]>; |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 17 | |
| 18 | DESCRIPTION |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 19 | <<strcmp>> compares the string at <[a]> to |
| 20 | the string at <[b]>. |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 21 | |
| 22 | RETURNS |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 23 | If <<*<[a]>>> sorts lexicographically after <<*<[b]>>>, |
| 24 | <<strcmp>> returns a number greater than zero. If the two |
| 25 | strings match, <<strcmp>> returns zero. If <<*<[a]>>> |
| 26 | sorts lexicographically before <<*<[b]>>>, <<strcmp>> returns a |
| 27 | number less than zero. |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 28 | |
| 29 | PORTABILITY |
| 30 | <<strcmp>> is ANSI C. |
| 31 | |
| 32 | <<strcmp>> requires no supporting OS subroutines. |
| 33 | |
| 34 | QUICKREF |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 35 | strcmp ansi pure |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 36 | */ |
| 37 | |
| 38 | #include <string.h> |
| 39 | #include <limits.h> |
Thomas Martitz | f32bd59 | 2010-06-22 18:34:03 +0000 | [diff] [blame] | 40 | #include "_ansi.h" /* for _DEFUN */ |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 41 | |
| 42 | /* Nonzero if either X or Y is not aligned on a "long" boundary. */ |
| 43 | #define UNALIGNED(X, Y) \ |
| 44 | (((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1))) |
| 45 | |
| 46 | /* DETECTNULL returns nonzero if (long)X contains a NULL byte. */ |
| 47 | #if LONG_MAX == 2147483647L |
| 48 | #define DETECTNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080) |
| 49 | #else |
| 50 | #if LONG_MAX == 9223372036854775807L |
| 51 | #define DETECTNULL(X) (((X) - 0x0101010101010101) & ~(X) & 0x8080808080808080) |
| 52 | #else |
| 53 | #error long int is not a 32bit or 64bit type. |
| 54 | #endif |
| 55 | #endif |
| 56 | |
| 57 | #ifndef DETECTNULL |
| 58 | #error long int is not a 32bit or 64bit byte |
| 59 | #endif |
| 60 | |
| 61 | int |
| 62 | _DEFUN (strcmp, (s1, s2), |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 63 | _CONST char *s1 _AND |
| 64 | _CONST char *s2) |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 65 | { |
| 66 | #if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__) |
| 67 | while (*s1 != '\0' && *s1 == *s2) |
| 68 | { |
| 69 | s1++; |
| 70 | s2++; |
| 71 | } |
| 72 | |
| 73 | return (*(unsigned char *) s1) - (*(unsigned char *) s2); |
| 74 | #else |
| 75 | unsigned long *a1; |
| 76 | unsigned long *a2; |
| 77 | |
| 78 | /* If s1 or s2 are unaligned, then compare bytes. */ |
| 79 | if (!UNALIGNED (s1, s2)) |
| 80 | { |
| 81 | /* If s1 and s2 are word-aligned, compare them a word at a time. */ |
| 82 | a1 = (unsigned long*)s1; |
| 83 | a2 = (unsigned long*)s2; |
| 84 | while (*a1 == *a2) |
| 85 | { |
| 86 | /* To get here, *a1 == *a2, thus if we find a null in *a1, |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 87 | then the strings must be equal, so return zero. */ |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 88 | if (DETECTNULL (*a1)) |
Andree Buschmann | 0b7dcd6 | 2010-02-22 21:24:09 +0000 | [diff] [blame] | 89 | return 0; |
Björn Stenberg | b69338f | 2002-05-30 21:03:17 +0000 | [diff] [blame] | 90 | |
| 91 | a1++; |
| 92 | a2++; |
| 93 | } |
| 94 | |
| 95 | /* A difference was detected in last few bytes of s1, so search bytewise */ |
| 96 | s1 = (char*)a1; |
| 97 | s2 = (char*)a2; |
| 98 | } |
| 99 | |
| 100 | while (*s1 != '\0' && *s1 == *s2) |
| 101 | { |
| 102 | s1++; |
| 103 | s2++; |
| 104 | } |
| 105 | return (*(unsigned char *) s1) - (*(unsigned char *) s2); |
| 106 | #endif /* not PREFER_SIZE_OVER_SPEED */ |
| 107 | } |