3 <<strcmp>>---character string compare
10 int strcmp(const char *<[a]>, const char *<[b]>);
14 int strcmp(<[a]>, <[b]>)
19 <<strcmp>> compares the string at <[a]> to
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.
32 <<strcmp>> requires no supporting OS subroutines.
41 /* Nonzero if either X or Y is not aligned on a "long" boundary. */
42 #define UNALIGNED(X, Y) \
43 (((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1)))
45 /* DETECTNULL returns nonzero if (long)X contains a NULL byte. */
46 #if LONG_MAX == 2147483647L
47 #define DETECTNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080)
49 #if LONG_MAX == 9223372036854775807L
50 #define DETECTNULL(X) (((X) - 0x0101010101010101) & ~(X) & 0x8080808080808080)
52 #error long int is not a 32bit or 64bit type.
57 #error long int is not a 32bit or 64bit byte
61 _DEFUN (strcmp
, (s1
, s2
),
65 #if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__)
66 while (*s1
!= '\0' && *s1
== *s2
)
72 return (*(unsigned char *) s1
) - (*(unsigned char *) s2
);
77 /* If s1 or s2 are unaligned, then compare bytes. */
78 if (!UNALIGNED (s1
, s2
))
80 /* If s1 and s2 are word-aligned, compare them a word at a time. */
81 a1
= (unsigned long*)s1
;
82 a2
= (unsigned long*)s2
;
85 /* To get here, *a1 == *a2, thus if we find a null in *a1,
86 then the strings must be equal, so return zero. */
94 /* A difference was detected in last few bytes of s1, so search bytewise */
99 while (*s1
!= '\0' && *s1
== *s2
)
104 return (*(unsigned char *) s1
) - (*(unsigned char *) s2
);
105 #endif /* not PREFER_SIZE_OVER_SPEED */