Coverage Report

Created: 2025-12-14 06:09

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.02k
{
36
2.02k
  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
8.32k
  for(;; (*a)++, (*b)++) {
43
8.32k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
44
1.51k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
45
1.33k
      return bias;
46
6.98k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
47
174
      return -1;
48
6.81k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
49
513
      return +1;
50
6.29k
    else if (**a < **b) {
51
1.39k
      if (!bias)
52
462
        bias = -1;
53
4.90k
    } else if (**a > **b) {
54
1.48k
      if (!bias)
55
801
        bias = +1;
56
1.48k
    }
57
8.32k
  }
58
59
0
  return 0;
60
2.02k
}
61
/* }}} */
62
63
/* {{{ compare_left */
64
static int
65
compare_left(char const **a, char const *aend, char const **b, char const *bend)
66
153
{
67
  /* Compare two left-aligned numbers: the first to have a
68
     different value wins. */
69
192
  for(;; (*a)++, (*b)++) {
70
192
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
71
39
      (*b == bend || !isdigit((int)(unsigned char)**b)))
72
39
      return 0;
73
153
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
74
0
      return -1;
75
153
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
76
0
      return +1;
77
153
     else if (**a < **b)
78
57
       return -1;
79
96
     else if (**a > **b)
80
57
       return +1;
81
192
  }
82
83
0
  return 0;
84
153
}
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
18.1k
{
90
18.1k
  unsigned char ca, cb;
91
18.1k
  char const *ap, *bp;
92
18.1k
  char const *aend = a + a_len,
93
18.1k
         *bend = b + b_len;
94
18.1k
  int fractional, result;
95
96
18.1k
  if (a_len == 0 || b_len == 0) {
97
579
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98
579
  }
99
100
17.5k
  ap = a;
101
17.5k
  bp = b;
102
103
17.5k
  ca = *ap; cb = *bp;
104
105
  /* skip over leading zeros */
106
17.5k
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107
12
    ca = *++ap;
108
12
  }
109
110
17.5k
  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111
21
    cb = *++bp;
112
21
  }
113
114
209k
  while (1) {
115
116
    /* Skip consecutive whitespace */
117
209k
    while (isspace((int)(unsigned char)ca)) {
118
21.9k
      ca = *++ap;
119
21.9k
    }
120
121
209k
    while (isspace((int)(unsigned char)cb)) {
122
22.1k
      cb = *++bp;
123
22.1k
    }
124
125
    /* process run of digits */
126
209k
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
127
2.17k
      fractional = (ca == '0' || cb == '0');
128
129
2.17k
      if (fractional)
130
153
        result = compare_left(&ap, aend, &bp, bend);
131
2.02k
      else
132
2.02k
        result = compare_right(&ap, aend, &bp, bend);
133
134
2.17k
      if (result != 0)
135
1.46k
        return result;
136
714
      else if (ap == aend && bp == bend)
137
        /* End of the strings. Let caller sort them out. */
138
3
        return 0;
139
711
      else if (ap == aend)
140
6
        return -1;
141
705
      else if (bp == bend)
142
6
        return 1;
143
699
      else {
144
        /* Keep on comparing from the current point. */
145
699
        ca = *ap; cb = *bp;
146
699
      }
147
2.17k
    }
148
149
208k
    if (is_case_insensitive) {
150
0
      ca = toupper((int)(unsigned char)ca);
151
0
      cb = toupper((int)(unsigned char)cb);
152
0
    }
153
154
208k
    if (ca < cb)
155
4.04k
      return -1;
156
204k
    else if (ca > cb)
157
9.35k
      return +1;
158
159
194k
    ++ap; ++bp;
160
194k
    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
1.98k
      return 0;
164
192k
    else if (ap >= aend)
165
213
      return -1;
166
192k
    else if (bp >= bend)
167
453
      return 1;
168
169
192k
    ca = *ap; cb = *bp;
170
192k
  }
171
17.5k
}
172
/* }}} */