Coverage Report

Created: 2026-02-09 07:07

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/php-src/ext/standard/strnatcmp.c
Line
Count
Source
1
/*
2
3
  Modified for PHP by Andrei Zmievski <andrei@ispi.net>
4
5
  strnatcmp.c -- Perform 'natural order' comparisons of strings in C.
6
  Copyright (C) 2000 by Martin Pool <mbp@humbug.org.au>
7
8
  This software is provided 'as-is', without any express or implied
9
  warranty.  In no event will the authors be held liable for any damages
10
  arising from the use of this software.
11
12
  Permission is granted to anyone to use this software for any purpose,
13
  including commercial applications, and to alter it and redistribute it
14
  freely, subject to the following restrictions:
15
16
  1. The origin of this software must not be misrepresented; you must not
17
     claim that you wrote the original software. If you use this software
18
     in a product, an acknowledgment in the product documentation would be
19
     appreciated but is not required.
20
  2. Altered source versions must be plainly marked as such, and must not be
21
     misrepresented as being the original software.
22
  3. This notice may not be removed or altered from any source distribution.
23
*/
24
25
#include <ctype.h>
26
#include <string.h>
27
#include <stdio.h>
28
29
#include "php.h"
30
#include "php_string.h"
31
32
/* {{{ compare_right */
33
static int
34
compare_right(char const **a, char const *aend, char const **b, char const *bend)
35
2.78k
{
36
2.78k
  int bias = 0;
37
38
  /* The longest run of digits wins.  That aside, the greatest
39
     value wins, but we can't know that it will until we've scanned
40
     both numbers to know that they have the same magnitude, so we
41
     remember it in BIAS. */
42
16.6k
  for(;; (*a)++, (*b)++) {
43
16.6k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
44
2.23k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
45
1.98k
      return bias;
46
14.6k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
47
242
      return -1;
48
14.3k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
49
558
      return +1;
50
13.8k
    else if (**a < **b) {
51
1.82k
      if (!bias)
52
568
        bias = -1;
53
11.9k
    } else if (**a > **b) {
54
1.67k
      if (!bias)
55
920
        bias = +1;
56
1.67k
    }
57
16.6k
  }
58
59
0
  return 0;
60
2.78k
}
61
/* }}} */
62
63
/* {{{ compare_left */
64
static int
65
compare_left(char const **a, char const *aend, char const **b, char const *bend)
66
596
{
67
  /* Compare two left-aligned numbers: the first to have a
68
     different value wins. */
69
1.74k
  for(;; (*a)++, (*b)++) {
70
1.74k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
71
231
      (*b == bend || !isdigit((int)(unsigned char)**b)))
72
221
      return 0;
73
1.52k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
74
10
      return -1;
75
1.51k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
76
6
      return +1;
77
1.51k
     else if (**a < **b)
78
113
       return -1;
79
1.39k
     else if (**a > **b)
80
246
       return +1;
81
1.74k
  }
82
83
0
  return 0;
84
596
}
85
/* }}} */
86
87
/* {{{ strnatcmp_ex */
88
PHPAPI int strnatcmp_ex(char const *a, size_t a_len, char const *b, size_t b_len, bool is_case_insensitive)
89
27.5k
{
90
27.5k
  unsigned char ca, cb;
91
27.5k
  char const *ap, *bp;
92
27.5k
  char const *aend = a + a_len,
93
27.5k
         *bend = b + b_len;
94
27.5k
  int fractional, result;
95
96
27.5k
  if (a_len == 0 || b_len == 0) {
97
1.02k
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98
1.02k
  }
99
100
26.5k
  ap = a;
101
26.5k
  bp = b;
102
103
26.5k
  ca = *ap; cb = *bp;
104
105
  /* skip over leading zeros */
106
27.0k
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107
498
    ca = *++ap;
108
498
  }
109
110
26.6k
  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111
120
    cb = *++bp;
112
120
  }
113
114
302k
  while (1) {
115
116
    /* Skip consecutive whitespace */
117
302k
    while (isspace((int)(unsigned char)ca)) {
118
35.4k
      ca = *++ap;
119
35.4k
    }
120
121
302k
    while (isspace((int)(unsigned char)cb)) {
122
35.8k
      cb = *++bp;
123
35.8k
    }
124
125
    /* process run of digits */
126
302k
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
127
3.38k
      fractional = (ca == '0' || cb == '0');
128
129
3.38k
      if (fractional)
130
596
        result = compare_left(&ap, aend, &bp, bend);
131
2.78k
      else
132
2.78k
        result = compare_right(&ap, aend, &bp, bend);
133
134
3.38k
      if (result != 0)
135
2.04k
        return result;
136
1.34k
      else if (ap == aend && bp == bend)
137
        /* End of the strings. Let caller sort them out. */
138
51
        return 0;
139
1.29k
      else if (ap == aend)
140
15
        return -1;
141
1.27k
      else if (bp == bend)
142
9
        return 1;
143
1.26k
      else {
144
        /* Keep on comparing from the current point. */
145
1.26k
        ca = *ap; cb = *bp;
146
1.26k
      }
147
3.38k
    }
148
149
300k
    if (is_case_insensitive) {
150
60
      ca = toupper((int)(unsigned char)ca);
151
60
      cb = toupper((int)(unsigned char)cb);
152
60
    }
153
154
300k
    if (ca < cb)
155
6.11k
      return -1;
156
293k
    else if (ca > cb)
157
13.6k
      return +1;
158
159
280k
    ++ap; ++bp;
160
280k
    if (ap >= aend && bp >= bend)
161
      /* The strings compare the same.  Perhaps the caller
162
         will want to call strcmp to break the tie. */
163
3.65k
      return 0;
164
276k
    else if (ap >= aend)
165
251
      return -1;
166
276k
    else if (bp >= bend)
167
722
      return 1;
168
169
275k
    ca = *ap; cb = *bp;
170
275k
  }
171
26.5k
}
172
/* }}} */