Coverage Report

Created: 2026-01-18 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
4.83k
{
36
4.83k
  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
33.9k
  for(;; (*a)++, (*b)++) {
43
33.9k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
44
4.24k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
45
3.89k
      return bias;
46
30.0k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
47
351
      return -1;
48
29.7k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
49
586
      return +1;
50
29.1k
    else if (**a < **b) {
51
852
      if (!bias)
52
368
        bias = -1;
53
28.3k
    } else if (**a > **b) {
54
780
      if (!bias)
55
284
        bias = +1;
56
780
    }
57
33.9k
  }
58
59
0
  return 0;
60
4.83k
}
61
/* }}} */
62
63
/* {{{ compare_left */
64
static int
65
compare_left(char const **a, char const *aend, char const **b, char const *bend)
66
9.89k
{
67
  /* Compare two left-aligned numbers: the first to have a
68
     different value wins. */
69
79.7k
  for(;; (*a)++, (*b)++) {
70
79.7k
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
71
8.11k
      (*b == bend || !isdigit((int)(unsigned char)**b)))
72
7.59k
      return 0;
73
72.1k
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
74
524
      return -1;
75
71.6k
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
76
895
      return +1;
77
70.7k
     else if (**a < **b)
78
307
       return -1;
79
70.4k
     else if (**a > **b)
80
570
       return +1;
81
79.7k
  }
82
83
0
  return 0;
84
9.89k
}
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
29.4k
{
90
29.4k
  unsigned char ca, cb;
91
29.4k
  char const *ap, *bp;
92
29.4k
  char const *aend = a + a_len,
93
29.4k
         *bend = b + b_len;
94
29.4k
  int fractional, result;
95
96
29.4k
  if (a_len == 0 || b_len == 0) {
97
1.37k
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98
1.37k
  }
99
100
28.0k
  ap = a;
101
28.0k
  bp = b;
102
103
28.0k
  ca = *ap; cb = *bp;
104
105
  /* skip over leading zeros */
106
29.1k
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107
1.09k
    ca = *++ap;
108
1.09k
  }
109
110
28.4k
  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111
429
    cb = *++bp;
112
429
  }
113
114
283k
  while (1) {
115
116
    /* Skip consecutive whitespace */
117
283k
    while (isspace((int)(unsigned char)ca)) {
118
17.7k
      ca = *++ap;
119
17.7k
    }
120
121
283k
    while (isspace((int)(unsigned char)cb)) {
122
16.9k
      cb = *++bp;
123
16.9k
    }
124
125
    /* process run of digits */
126
283k
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
127
14.7k
      fractional = (ca == '0' || cb == '0');
128
129
14.7k
      if (fractional)
130
9.89k
        result = compare_left(&ap, aend, &bp, bend);
131
4.83k
      else
132
4.83k
        result = compare_right(&ap, aend, &bp, bend);
133
134
14.7k
      if (result != 0)
135
3.48k
        return result;
136
11.2k
      else if (ap == aend && bp == bend)
137
        /* End of the strings. Let caller sort them out. */
138
574
        return 0;
139
10.6k
      else if (ap == aend)
140
44
        return -1;
141
10.6k
      else if (bp == bend)
142
125
        return 1;
143
10.4k
      else {
144
        /* Keep on comparing from the current point. */
145
10.4k
        ca = *ap; cb = *bp;
146
10.4k
      }
147
14.7k
    }
148
149
279k
    if (is_case_insensitive) {
150
0
      ca = toupper((int)(unsigned char)ca);
151
0
      cb = toupper((int)(unsigned char)cb);
152
0
    }
153
154
279k
    if (ca < cb)
155
5.12k
      return -1;
156
274k
    else if (ca > cb)
157
11.5k
      return +1;
158
159
262k
    ++ap; ++bp;
160
262k
    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
6.58k
      return 0;
164
256k
    else if (ap >= aend)
165
202
      return -1;
166
255k
    else if (bp >= bend)
167
365
      return 1;
168
169
255k
    ca = *ap; cb = *bp;
170
255k
  }
171
28.0k
}
172
/* }}} */