2 .\" Copyright 1993 David Metcalfe (david@prism.demon.co.uk)
3 .\" and Copyright 2020 Michael Kerrisk <mtk.manpages@gmail.com>
5 .\" SPDX-License-Identifier: Linux-man-pages-copyleft
7 .\" References consulted:
8 .\" Linux libc source code
9 .\" Lewine's _POSIX Programmer's Guide_ (O'Reilly & Associates, 1991)
11 .\" Modified Sat Jul 24 18:08:52 1993 by Rik Faith (faith@cs.unc.edu)
12 .\" Modified 2001-08-31, aeb
14 .TH strcmp 3 (date) "Linux man-pages (unreleased)"
16 strcmp, strncmp \- compare two strings
19 .RI ( libc ", " \-lc )
22 .B #include <string.h>
24 .BI "int strcmp(const char *" s1 ", const char *" s2 );
25 .BI "int strncmp(const char " s1 [. n "], const char " s2 [. n "], size_t " n );
30 function compares the two strings
34 The locale is not taken into account (for a locale-aware comparison, see
36 The comparison is done using unsigned characters.
39 returns an integer indicating the result of the comparison, as follows:
59 function is similar, except it compares
60 only the first (at most)
71 functions return an integer
72 less than, equal to, or greater than zero if
76 bytes thereof) is found, respectively, to be less than, to
77 match, or be greater than
80 For an explanation of the terms used in this section, see
88 Interface Attribute Value
92 T} Thread safety MT-Safe
98 POSIX.1 specifies only that:
101 The sign of a nonzero return value shall be determined by the sign
102 of the difference between the values of the first pair of bytes
103 (both interpreted as type
104 .IR "unsigned char" )
105 that differ in the strings being compared.
108 In glibc, as in most other implementations,
109 the return value is the arithmetic result of subtracting
110 the last compared byte in
112 from the last compared byte in
114 (If the two characters are equal, this difference is 0.)
118 POSIX.1-2001, C89, SVr4, 4.3BSD.
120 The program below can be used to demonstrate the operation of
122 (when given two arguments) and
124 (when given three arguments).
125 First, some examples using
130 $ \fB./string_comp ABC ABC\fP
131 <str1> and <str2> are equal
132 $ \fB./string_comp ABC AB\fP # \[aq]C\[aq] is ASCII 67; \[aq]C\[aq] \- \[aq]\e0\[aq] = 67
133 <str1> is greater than <str2> (67)
134 $ \fB./string_comp ABA ABZ\fP # \[aq]A\[aq] is ASCII 65; \[aq]Z\[aq] is ASCII 90
135 <str1> is less than <str2> (\-25)
136 $ \fB./string_comp ABJ ABC\fP
137 <str1> is greater than <str2> (7)
138 $ .\fB/string_comp $\[aq]\e201\[aq] A\fP # 0201 \- 0101 = 0100 (or 64 decimal)
139 <str1> is greater than <str2> (64)
143 The last example uses
144 .BR bash (1)-specific
145 syntax to produce a string containing an 8-bit ASCII code;
146 the result demonstrates that the string comparison uses unsigned
149 And then some examples using
154 $ \fB./string_comp ABC AB 3\fP
155 <str1> is greater than <str2> (67)
156 $ \fB./string_comp ABC AB 2\fP
157 <str1> and <str2> are equal in the first 2 bytes
162 .\" SRC BEGIN (string_comp.c)
166 Licensed under GNU General Public License v2 or later.
173 main(int argc, char *argv[])
178 fprintf(stderr, "Usage: %s <str1> <str2> [<len>]\en", argv[0]);
183 res = strcmp(argv[1], argv[2]);
185 res = strncmp(argv[1], argv[2], atoi(argv[3]));
188 printf("<str1> and <str2> are equal");
190 printf(" in the first %d bytes\en", atoi(argv[3]));
192 } else if (res < 0) {
193 printf("<str1> is less than <str2> (%d)\en", res);
195 printf("<str1> is greater than <str2> (%d)\en", res);