/src/php-src/ext/standard/strnatcmp.c

Source
/*

  Modified for PHP by Andrei Zmievski <andrei@ispi.net>

  strnatcmp.c -- Perform 'natural order' comparisons of strings in C.
  Copyright (C) 2000 by Martin Pool <mbp@humbug.org.au>

  This software is provided 'as-is', without any express or implied
  warranty.  In no event will the authors be held liable for any damages
  arising from the use of this software.

  Permission is granted to anyone to use this software for any purpose,
  including commercial applications, and to alter it and redistribute it
  freely, subject to the following restrictions:

  1. The origin of this software must not be misrepresented; you must not
     claim that you wrote the original software. If you use this software
     in a product, an acknowledgment in the product documentation would be
     appreciated but is not required.
  2. Altered source versions must be plainly marked as such, and must not be
     misrepresented as being the original software.
  3. This notice may not be removed or altered from any source distribution.
*/

#include <ctype.h>
#include <string.h>
#include <stdio.h>

#include "php.h"
#include "php_string.h"

/* {{{ compare_right */
static int
compare_right(char const **a, char const *aend, char const **b, char const *bend)
{
  int bias = 0;

  /* The longest run of digits wins.  That aside, the greatest
     value wins, but we can't know that it will until we've scanned
     both numbers to know that they have the same magnitude, so we
     remember it in BIAS. */
  for(;; (*a)++, (*b)++) {
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
      (*b == bend || !isdigit((int)(unsigned char)**b)))
      return bias;
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
      return -1;
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
      return +1;
    else if (**a < **b) {
      if (!bias)
        bias = -1;
    } else if (**a > **b) {
      if (!bias)
        bias = +1;
    }
  }

  return 0;
}
/* }}} */

/* {{{ compare_left */
static int
compare_left(char const **a, char const *aend, char const **b, char const *bend)
{
  /* Compare two left-aligned numbers: the first to have a
     different value wins. */
  for(;; (*a)++, (*b)++) {
    if ((*a == aend || !isdigit((int)(unsigned char)**a)) &&
      (*b == bend || !isdigit((int)(unsigned char)**b)))
      return 0;
    else if (*a == aend || !isdigit((int)(unsigned char)**a))
      return -1;
    else if (*b == bend || !isdigit((int)(unsigned char)**b))
      return +1;
     else if (**a < **b)
       return -1;
     else if (**a > **b)
       return +1;
  }

  return 0;
}
/* }}} */

/* {{{ strnatcmp_ex */
PHPAPI int strnatcmp_ex(char const *a, size_t a_len, char const *b, size_t b_len, bool is_case_insensitive)
{
  unsigned char ca, cb;
  char const *ap, *bp;
  char const *aend = a + a_len,
         *bend = b + b_len;
  int fractional, result;

  if (a_len == 0 || b_len == 0) {
    return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
  }

  ap = a;
  bp = b;

  ca = *ap; cb = *bp;

  /* skip over leading zeros */
  while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
    ca = *++ap;
  }

  while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
    cb = *++bp;
  }

  while (1) {

    /* Skip consecutive whitespace */
    while (isspace((int)(unsigned char)ca)) {
      ca = *++ap;
    }

    while (isspace((int)(unsigned char)cb)) {
      cb = *++bp;
    }

    /* process run of digits */
    if (isdigit((int)(unsigned char)ca)  &&  isdigit((int)(unsigned char)cb)) {
      fractional = (ca == '0' || cb == '0');

      if (fractional)
        result = compare_left(&ap, aend, &bp, bend);
      else
        result = compare_right(&ap, aend, &bp, bend);

      if (result != 0)
        return result;
      else if (ap == aend && bp == bend)
        /* End of the strings. Let caller sort them out. */
        return 0;
      else if (ap == aend)
        return -1;
      else if (bp == bend)
        return 1;
      else {
        /* Keep on comparing from the current point. */
        ca = *ap; cb = *bp;
      }
    }

    if (is_case_insensitive) {
      ca = toupper((int)(unsigned char)ca);
      cb = toupper((int)(unsigned char)cb);
    }

    if (ca < cb)
      return -1;
    else if (ca > cb)
      return +1;

    ++ap; ++bp;
    if (ap >= aend && bp >= bend)
      /* The strings compare the same.  Perhaps the caller
         will want to call strcmp to break the tie. */
      return 0;
    else if (ap >= aend)
      return -1;
    else if (bp >= bend)
      return 1;

    ca = *ap; cb = *bp;
  }
}
/* }}} */

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	1.73k	{
36	1.73k	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	7.69k	for(;; (a)++, (b)++) {
43	7.69k	if ((a == aend \|\| !isdigit((int)(unsigned char)*a)) &&
44	1.31k	(b == bend \|\| !isdigit((int)(unsigned char)*b)))
45	1.18k	return bias;
46	6.51k	else if (a == aend \|\| !isdigit((int)(unsigned char)*a))
47	130	return -1;
48	6.38k	else if (b == bend \|\| !isdigit((int)(unsigned char)*b))
49	427	return +1;
50	5.95k	else if (a < b) {
51	1.11k	if (!bias)
52	383	bias = -1;
53	4.84k	} else if (a > b) {
54	1.11k	if (!bias)
55	613	bias = +1;
56	1.11k	}
57	7.69k	}
58
59	0	return 0;
60	1.73k	}
61		/* }}} */
62
63		/* {{{ compare_left */
64		static int
65		compare_left(char const *a, char const aend, char const *b, char const bend)
66	519	{
67		/* Compare two left-aligned numbers: the first to have a
68		different value wins. */
69	1.38k	for(;; (a)++, (b)++) {
70	1.38k	if ((a == aend \|\| !isdigit((int)(unsigned char)*a)) &&
71	188	(b == bend \|\| !isdigit((int)(unsigned char)*b)))
72	180	return 0;
73	1.20k	else if (a == aend \|\| !isdigit((int)(unsigned char)*a))
74	8	return -1;
75	1.19k	else if (b == bend \|\| !isdigit((int)(unsigned char)*b))
76	12	return +1;
77	1.18k	else if (a < b)
78	114	return -1;
79	1.07k	else if (a > b)
80	205	return +1;
81	1.38k	}
82
83	0	return 0;
84	519	}
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	19.8k	{
90	19.8k	unsigned char ca, cb;
91	19.8k	char const ap, bp;
92	19.8k	char const *aend = a + a_len,
93	19.8k	*bend = b + b_len;
94	19.8k	int fractional, result;
95
96	19.8k	if (a_len == 0 \|\| b_len == 0) {
97	751	return (a_len == b_len ? 0 : (a_len > b_len ? 1 : -1));
98	751	}
99
100	19.0k	ap = a;
101	19.0k	bp = b;
102
103	19.0k	ca = ap; cb = bp;
104
105		/* skip over leading zeros */
106	19.0k	while (ca == '0' && (ap+1 < aend) && isdigit((int)(unsigned char)*(ap+1))) {
107	12	ca = *++ap;
108	12	}
109
110	19.0k	while (cb == '0' && (bp+1 < bend) && isdigit((int)(unsigned char)*(bp+1))) {
111	21	cb = *++bp;
112	21	}
113
114	229k	while (1) {
115
116		/* Skip consecutive whitespace */
117	229k	while (isspace((int)(unsigned char)ca)) {
118	27.4k	ca = *++ap;
119	27.4k	}
120
121	229k	while (isspace((int)(unsigned char)cb)) {
122	27.4k	cb = *++bp;
123	27.4k	}
124
125		/* process run of digits */
126	229k	if (isdigit((int)(unsigned char)ca) && isdigit((int)(unsigned char)cb)) {
127	2.25k	fractional = (ca == '0' \|\| cb == '0');
128
129	2.25k	if (fractional)
130	519	result = compare_left(&ap, aend, &bp, bend);
131	1.73k	else
132	1.73k	result = compare_right(&ap, aend, &bp, bend);
133
134	2.25k	if (result != 0)
135	1.44k	return result;
136	811	else if (ap == aend && bp == bend)
137		/* End of the strings. Let caller sort them out. */
138	29	return 0;
139	782	else if (ap == aend)
140	6	return -1;
141	776	else if (bp == bend)
142	6	return 1;
143	770	else {
144		/* Keep on comparing from the current point. */
145	770	ca = ap; cb = bp;
146	770	}
147	2.25k	}
148
149	228k	if (is_case_insensitive) {
150	31	ca = toupper((int)(unsigned char)ca);
151	31	cb = toupper((int)(unsigned char)cb);
152	31	}
153
154	228k	if (ca < cb)
155	4.37k	return -1;
156	223k	else if (ca > cb)
157	9.68k	return +1;
158
159	214k	++ap; ++bp;
160	214k	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	2.65k	return 0;
164	211k	else if (ap >= aend)
165	236	return -1;
166	211k	else if (bp >= bend)
167	614	return 1;
168
169	210k	ca = ap; cb = bp;
170	210k	}
171	19.0k	}
172		/* }}} */

Coverage Report

Created: 2025-11-16 06:23