1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
/* -*- mode: c; c-file-style: "k&r" -*-
strnatcmp.c -- Perform 'natural order' comparisons of strings in C.
Copyright (C) 2000, 2004 by Martin Pool <mbp sourcefrog net>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
/* partial change history:
*
* 2004-10-10 mbp: Lift out character type dependencies into macros.
*
* Eric Sosman pointed out that ctype functions take a parameter whose
* value must be that of an unsigned int, even on platforms that have
* negative chars in their default char type.
*/
#include <assert.h>
#include <ctype.h>
#include "strnatcmp.h"
/* These are defined as macros to make it easier to adapt this code to
* different characters types or comparison functions. */
static inline int
nat_isdigit(nat_char a)
{
return isdigit((unsigned char) a);
}
static inline int
nat_isspace(nat_char a)
{
return isspace((unsigned char) a);
}
static inline nat_char
nat_toupper(nat_char a)
{
return toupper((unsigned char) a);
}
static int
compare_right(int a_len, nat_char const *a, int b_len, nat_char const *b, int *len_out)
{
int bias = 0;
/* The longest run of digits wins. That aside, the greatest
value wins, but we can't know that it will until we've scanned
both numbers to know that they have the same magnitude, so we
remember it in BIAS. */
for (;; a++, b++, a_len--, b_len--, (*len_out)++) {
if (a_len == 0 && b_len == 0)
return bias;
if (a_len == 0)
return -1;
if (b_len == 0)
return 1;
if (!nat_isdigit(*a) && !nat_isdigit(*b))
return bias;
else if (!nat_isdigit(*a))
return -1;
else if (!nat_isdigit(*b))
return +1;
else if (*a < *b) {
if (!bias)
bias = -1;
} else if (*a > *b) {
if (!bias)
bias = +1;
} else if (!*a && !*b)
return bias;
}
return 0;
}
static int
compare_left(int a_len, nat_char const *a, int b_len, nat_char const *b, int *len_out)
{
/* Compare two left-aligned numbers: the first to have a
different value wins. */
for (;; a++, b++, a_len--, b_len--, (*len_out)++) {
if (a_len == 0 && b_len == 0)
return 0;
if (a_len == 0)
return -1;
if (b_len == 0)
return 1;
if (!nat_isdigit(*a) && !nat_isdigit(*b))
return 0;
else if (!nat_isdigit(*a))
return -1;
else if (!nat_isdigit(*b))
return +1;
else if (*a < *b)
return -1;
else if (*a > *b)
return +1;
}
return 0;
}
static int strnatcmp0(int a_len, nat_char const *a,
int b_len, nat_char const *b,
int fold_case)
{
int ai, bi;
nat_char ca, cb;
int fractional, result;
assert(a && b);
ai = bi = 0;
while (1) {
if (ai >= a_len)
ca = 0;
else
ca = a[ai];
if (bi >= b_len)
cb = 0;
else
cb = b[bi];
/* skip over leading spaces or zeros */
while (nat_isspace(ca)) {
ai += 1;
if (ai >= a_len)
ca = 0;
else
ca = a[ai];
}
while (nat_isspace(cb)) {
bi += 1;
if (bi >= b_len)
cb = 0;
else
cb = b[bi];
}
/* process run of digits */
if (nat_isdigit(ca) && nat_isdigit(cb)) {
int num_len = 0;
fractional = (ca == '0' || cb == '0');
if (fractional) {
if ((result = compare_left(a_len - ai, a + ai, b_len - bi,
b + bi, &num_len)) != 0) {
return result;
}
} else {
if ((result = compare_right(a_len - ai, a + ai, b_len - bi,
b + bi, &num_len)) != 0) {
return result;
}
}
ai += num_len;
bi += num_len;
continue;
}
if (!ca && !cb) {
/* The strings compare the same. Perhaps the caller
will want to call strcmp to break the tie. */
return 0;
}
if (fold_case) {
ca = nat_toupper(ca);
cb = nat_toupper(cb);
}
if (ca < cb)
return -1;
else if (ca > cb)
return +1;
++ai;
++bi;
}
}
int ipv4cmp(int a_len, nat_char const *a,
int b_len, nat_char const *b,
int *res_out)
{
int ai, bi;
nat_char ca, cb;
int fractional, result = 0;
assert(a && b);
ai = bi = 0;
while (result == 0) {
if (ai >= a_len)
ca = 0;
else
ca = a[ai];
if (bi >= b_len)
cb = 0;
else
cb = b[bi];
/* skip over leading spaces or zeros */
while (nat_isspace(ca)) {
ai += 1;
if (ai >= a_len)
ca = 0;
else
ca = a[ai];
}
while (nat_isspace(cb)) {
bi += 1;
if (bi >= b_len)
cb = 0;
else
cb = b[bi];
}
/* process run of digits */
if (nat_isdigit(ca) && nat_isdigit(cb)) {
int num_len = 0;
fractional = (ca == '0' || cb == '0');
if (fractional) {
result = compare_left(a_len - ai, a + ai, b_len - bi,
b + bi, &num_len);
} else {
result = compare_right(a_len - ai, a + ai, b_len - bi,
b + bi, &num_len);
}
ai += num_len;
bi += num_len;
continue;
}
if (!ca && !cb) {
/* The strings compare the same. Perhaps the caller
will want to call strcmp to break the tie. */
*res_out = result;
return 1;
}
if (ca != '.' || cb != '.') {
return 0;
}
++ai;
++bi;
}
for (; ai < a_len; ai++) {
if (!isdigit(a[ai]) || a[ai] != '.') {
return 0;
}
}
for (; bi < b_len; bi++) {
if (!isdigit(b[bi]) || b[bi] != '.') {
return 0;
}
}
*res_out = result;
return 1;
}
int strnatcmp(int a_len, nat_char const *a, int b_len, nat_char const *b)
{
return strnatcmp0(a_len, a, b_len, b, 0);
}
/* Compare, recognizing numeric string and ignoring case. */
int strnatcasecmp(int a_len, nat_char const *a, int b_len, nat_char const *b)
{
return strnatcmp0(a_len, a, b_len, b, 1);
}
|
