Coverage Report

Created: 2026-04-01 06:49

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.37k
{
36
2.37k
  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
11.1k
  for(;; (*a)++, (*b)++) {
43
11.1k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
44
1.82k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
45
1.58k
      return bias;
46
9.52k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
47
242
      return -1;
48
9.28k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
49
549
      return +1;
50
8.73k
    else if (**a < **b) {
51
1.42k
      if (!bias)
52
483
        bias = -1;
53
7.30k
    } else if (**a > **b) {
54
1.42k
      if (!bias)
55
863
        bias = +1;
56
1.42k
    }
57
11.1k
  }
58
59
0
  return 0;
60
2.37k
}
61
/* }}} */
62
63
/* {{{ compare_left */
64
static int
65
compare_left(char const **a, char const *aend, char const **b, char const *bend)
66
887
{
67
  /* Compare two left-aligned numbers: the first to have a
68
     different value wins. */
69
2.70k
  for(;; (*a)++, (*b)++) {
70
2.70k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
71
408
      (*b == bend || !isdigit((int)(unsigned char)**b)))
72
394
      return 0;
73
2.30k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
74
14
      return -1;
75
2.29k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
76
30
      return +1;
77
2.26k
     else if (**a < **b)
78
144
       return -1;
79
2.12k
     else if (**a > **b)
80
305
       return +1;
81
2.70k
  }
82
83
0
  return 0;
84
887
}
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
26.3k
{
90
26.3k
  unsigned char ca, cb;
91
26.3k
  char const *ap, *bp;
92
26.3k
  char const *aend = a + a_len,
93
26.3k
         *bend = b + b_len;
94
26.3k
  int fractional, result;
95
96
26.3k
  if (a_len == 0 || b_len == 0) {
97
1.19k
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98
1.19k
  }
99
100
25.1k
  ap = a;
101
25.1k
  bp = b;
102
103
25.1k
  ca = *ap; cb = *bp;
104
105
  /* skip over leading zeros */
106
25.6k
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107
498
    ca = *++ap;
108
498
  }
109
110
25.2k
  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111
120
    cb = *++bp;
112
120
  }
113
114
268k
  while (1) {
115
116
    /* Skip consecutive whitespace */
117
268k
    while (isspace((int)(unsigned char)ca)) {
118
33.2k
      ca = *++ap;
119
33.2k
    }
120
121
268k
    while (isspace((int)(unsigned char)cb)) {
122
33.3k
      cb = *++bp;
123
33.3k
    }
124
125
    /* process run of digits */
126
268k
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
127
3.25k
      fractional = (ca == '0' || cb == '0');
128
129
3.25k
      if (fractional)
130
887
        result = compare_left(&ap, aend, &bp, bend);
131
2.37k
      else
132
2.37k
        result = compare_right(&ap, aend, &bp, bend);
133
134
3.25k
      if (result != 0)
135
2.04k
        return result;
136
1.21k
      else if (ap == aend && bp == bend)
137
        /* End of the strings. Let caller sort them out. */
138
71
        return 0;
139
1.14k
      else if (ap == aend)
140
15
        return -1;
141
1.13k
      else if (bp == bend)
142
6
        return 1;
143
1.12k
      else {
144
        /* Keep on comparing from the current point. */
145
1.12k
        ca = *ap; cb = *bp;
146
1.12k
      }
147
3.25k
    }
148
149
265k
    if (is_case_insensitive) {
150
0
      ca = toupper((int)(unsigned char)ca);
151
0
      cb = toupper((int)(unsigned char)cb);
152
0
    }
153
154
265k
    if (ca < cb)
155
5.84k
      return -1;
156
260k
    else if (ca > cb)
157
12.8k
      return +1;
158
159
247k
    ++ap; ++bp;
160
247k
    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.26k
      return 0;
164
244k
    else if (ap >= aend)
165
277
      return -1;
166
243k
    else if (bp >= bend)
167
758
      return 1;
168
169
242k
    ca = *ap; cb = *bp;
170
242k
  }
171
25.1k
}
172
/* }}} */