Coverage Report

Created: 2025-09-27 06:26

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.55k
{
36
2.55k
  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
9.46k
  for(;; (*a)++, (*b)++) {
43
9.46k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
44
2.20k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
45
2.09k
      return bias;
46
7.37k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
47
114
      return -1;
48
7.25k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
49
344
      return +1;
50
6.91k
    else if (**a < **b) {
51
1.15k
      if (!bias)
52
504
        bias = -1;
53
5.76k
    } else if (**a > **b) {
54
1.21k
      if (!bias)
55
855
        bias = +1;
56
1.21k
    }
57
9.46k
  }
58
59
0
  return 0;
60
2.55k
}
61
/* }}} */
62
63
/* {{{ compare_left */
64
static int
65
compare_left(char const **a, char const *aend, char const **b, char const *bend)
66
468
{
67
  /* Compare two left-aligned numbers: the first to have a
68
     different value wins. */
69
1.14k
  for(;; (*a)++, (*b)++) {
70
1.14k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
71
144
      (*b == bend || !isdigit((int)(unsigned char)**b)))
72
136
      return 0;
73
1.01k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
74
8
      return -1;
75
1.00k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
76
8
      return +1;
77
994
     else if (**a < **b)
78
112
       return -1;
79
882
     else if (**a > **b)
80
204
       return +1;
81
1.14k
  }
82
83
0
  return 0;
84
468
}
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.9k
{
90
26.9k
  unsigned char ca, cb;
91
26.9k
  char const *ap, *bp;
92
26.9k
  char const *aend = a + a_len,
93
26.9k
         *bend = b + b_len;
94
26.9k
  int fractional, result;
95
96
26.9k
  if (a_len == 0 || b_len == 0) {
97
791
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98
791
  }
99
100
26.1k
  ap = a;
101
26.1k
  bp = b;
102
103
26.1k
  ca = *ap; cb = *bp;
104
105
  /* skip over leading zeros */
106
26.1k
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107
30
    ca = *++ap;
108
30
  }
109
110
26.1k
  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111
24
    cb = *++bp;
112
24
  }
113
114
343k
  while (1) {
115
116
    /* Skip consecutive whitespace */
117
343k
    while (isspace((int)(unsigned char)ca)) {
118
37.4k
      ca = *++ap;
119
37.4k
    }
120
121
343k
    while (isspace((int)(unsigned char)cb)) {
122
37.6k
      cb = *++bp;
123
37.6k
    }
124
125
    /* process run of digits */
126
343k
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
127
3.01k
      fractional = (ca == '0' || cb == '0');
128
129
3.01k
      if (fractional)
130
468
        result = compare_left(&ap, aend, &bp, bend);
131
2.55k
      else
132
2.55k
        result = compare_right(&ap, aend, &bp, bend);
133
134
3.01k
      if (result != 0)
135
1.80k
        return result;
136
1.21k
      else if (ap == aend && bp == bend)
137
        /* End of the strings. Let caller sort them out. */
138
29
        return 0;
139
1.18k
      else if (ap == aend)
140
3
        return -1;
141
1.17k
      else if (bp == bend)
142
15
        return 1;
143
1.16k
      else {
144
        /* Keep on comparing from the current point. */
145
1.16k
        ca = *ap; cb = *bp;
146
1.16k
      }
147
3.01k
    }
148
149
342k
    if (is_case_insensitive) {
150
0
      ca = toupper((int)(unsigned char)ca);
151
0
      cb = toupper((int)(unsigned char)cb);
152
0
    }
153
154
342k
    if (ca < cb)
155
6.09k
      return -1;
156
336k
    else if (ca > cb)
157
12.9k
      return +1;
158
159
323k
    ++ap; ++bp;
160
323k
    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
4.01k
      return 0;
164
319k
    else if (ap >= aend)
165
290
      return -1;
166
318k
    else if (bp >= bend)
167
917
      return 1;
168
169
317k
    ca = *ap; cb = *bp;
170
317k
  }
171
26.1k
}
172
/* }}} */