Coverage Report

Created: 2025-12-14 06:10

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.95k
{
36
2.95k
  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
15.3k
  for(;; (*a)++, (*b)++) {
43
15.3k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
44
2.31k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
45
2.06k
      return bias;
46
13.2k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
47
255
      return -1;
48
13.0k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
49
637
      return +1;
50
12.3k
    else if (**a < **b) {
51
1.60k
      if (!bias)
52
522
        bias = -1;
53
10.7k
    } else if (**a > **b) {
54
1.69k
      if (!bias)
55
860
        bias = +1;
56
1.69k
    }
57
15.3k
  }
58
59
0
  return 0;
60
2.95k
}
61
/* }}} */
62
63
/* {{{ compare_left */
64
static int
65
compare_left(char const **a, char const *aend, char const **b, char const *bend)
66
835
{
67
  /* Compare two left-aligned numbers: the first to have a
68
     different value wins. */
69
3.13k
  for(;; (*a)++, (*b)++) {
70
3.13k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
71
357
      (*b == bend || !isdigit((int)(unsigned char)**b)))
72
323
      return 0;
73
2.80k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
74
34
      return -1;
75
2.77k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
76
26
      return +1;
77
2.74k
     else if (**a < **b)
78
127
       return -1;
79
2.62k
     else if (**a > **b)
80
325
       return +1;
81
3.13k
  }
82
83
0
  return 0;
84
835
}
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.4k
{
90
27.4k
  unsigned char ca, cb;
91
27.4k
  char const *ap, *bp;
92
27.4k
  char const *aend = a + a_len,
93
27.4k
         *bend = b + b_len;
94
27.4k
  int fractional, result;
95
96
27.4k
  if (a_len == 0 || b_len == 0) {
97
1.45k
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98
1.45k
  }
99
100
26.0k
  ap = a;
101
26.0k
  bp = b;
102
103
26.0k
  ca = *ap; cb = *bp;
104
105
  /* skip over leading zeros */
106
26.0k
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107
12
    ca = *++ap;
108
12
  }
109
110
26.0k
  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111
21
    cb = *++bp;
112
21
  }
113
114
308k
  while (1) {
115
116
    /* Skip consecutive whitespace */
117
308k
    while (isspace((int)(unsigned char)ca)) {
118
36.1k
      ca = *++ap;
119
36.1k
    }
120
121
308k
    while (isspace((int)(unsigned char)cb)) {
122
36.3k
      cb = *++bp;
123
36.3k
    }
124
125
    /* process run of digits */
126
308k
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
127
3.78k
      fractional = (ca == '0' || cb == '0');
128
129
3.78k
      if (fractional)
130
835
        result = compare_left(&ap, aend, &bp, bend);
131
2.95k
      else
132
2.95k
        result = compare_right(&ap, aend, &bp, bend);
133
134
3.78k
      if (result != 0)
135
2.12k
        return result;
136
1.66k
      else if (ap == aend && bp == bend)
137
        /* End of the strings. Let caller sort them out. */
138
131
        return 0;
139
1.53k
      else if (ap == aend)
140
6
        return -1;
141
1.52k
      else if (bp == bend)
142
6
        return 1;
143
1.52k
      else {
144
        /* Keep on comparing from the current point. */
145
1.52k
        ca = *ap; cb = *bp;
146
1.52k
      }
147
3.78k
    }
148
149
306k
    if (is_case_insensitive) {
150
62
      ca = toupper((int)(unsigned char)ca);
151
62
      cb = toupper((int)(unsigned char)cb);
152
62
    }
153
154
306k
    if (ca < cb)
155
5.89k
      return -1;
156
300k
    else if (ca > cb)
157
13.0k
      return +1;
158
159
287k
    ++ap; ++bp;
160
287k
    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.86k
      return 0;
164
283k
    else if (ap >= aend)
165
267
      return -1;
166
283k
    else if (bp >= bend)
167
697
      return 1;
168
169
282k
    ca = *ap; cb = *bp;
170
282k
  }
171
26.0k
}
172
/* }}} */