/llvm-gcc-4.0-iphone/libiberty/strverscmp.c

https://gitlab.com/rawko3/iphone-dev · C · 159 lines · 60 code · 18 blank · 81 comment · 15 complexity · 9bd8dc3afab6946fd6f1936b9dc0d019 MD5 · raw file

  1. /* APPLE LOCAL begin mainline 2005-09-01 3449986 */
  2. /* Compare strings while treating digits characters numerically.
  3. Copyright (C) 1997, 2002, 2005 Free Software Foundation, Inc.
  4. This file is part of the libiberty library.
  5. Contributed by Jean-François Bignolles <bignolle@ecoledoc.ibp.fr>, 1997.
  6. Libiberty is free software; you can redistribute it and/or
  7. modify it under the terms of the GNU Lesser General Public
  8. License as published by the Free Software Foundation; either
  9. version 2.1 of the License, or (at your option) any later version.
  10. Libiberty is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. Lesser General Public License for more details.
  14. You should have received a copy of the GNU Lesser General Public
  15. License along with the GNU C Library; if not, write to the Free
  16. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  17. 02111-1307 USA. */
  18. #include "libiberty.h"
  19. #include "safe-ctype.h"
  20. /*
  21. @deftypefun int strverscmp (const char *@var{s1}, const char *@var{s2})
  22. The @code{strverscmp} function compares the string @var{s1} against
  23. @var{s2}, considering them as holding indices/version numbers. Return
  24. value follows the same conventions as found in the @code{strverscmp}
  25. function. In fact, if @var{s1} and @var{s2} contain no digits,
  26. @code{strverscmp} behaves like @code{strcmp}.
  27. Basically, we compare strings normally (character by character), until
  28. we find a digit in each string - then we enter a special comparison
  29. mode, where each sequence of digits is taken as a whole. If we reach the
  30. end of these two parts without noticing a difference, we return to the
  31. standard comparison mode. There are two types of numeric parts:
  32. "integral" and "fractional" (those begin with a '0'). The types
  33. of the numeric parts affect the way we sort them:
  34. @itemize @bullet
  35. @item
  36. integral/integral: we compare values as you would expect.
  37. @item
  38. fractional/integral: the fractional part is less than the integral one.
  39. Again, no surprise.
  40. @item
  41. fractional/fractional: the things become a bit more complex.
  42. If the common prefix contains only leading zeroes, the longest part is less
  43. than the other one; else the comparison behaves normally.
  44. @end itemize
  45. @smallexample
  46. strverscmp ("no digit", "no digit")
  47. @result{} 0 // @r{same behavior as strcmp.}
  48. strverscmp ("item#99", "item#100")
  49. @result{} <0 // @r{same prefix, but 99 < 100.}
  50. strverscmp ("alpha1", "alpha001")
  51. @result{} >0 // @r{fractional part inferior to integral one.}
  52. strverscmp ("part1_f012", "part1_f01")
  53. @result{} >0 // @r{two fractional parts.}
  54. strverscmp ("foo.009", "foo.0")
  55. @result{} <0 // @r{idem, but with leading zeroes only.}
  56. @end smallexample
  57. This function is especially useful when dealing with filename sorting,
  58. because filenames frequently hold indices/version numbers.
  59. @end deftypefun
  60. */
  61. /* states: S_N: normal, S_I: comparing integral part, S_F: comparing
  62. fractional parts, S_Z: idem but with leading Zeroes only */
  63. #define S_N 0x0
  64. #define S_I 0x4
  65. #define S_F 0x8
  66. #define S_Z 0xC
  67. /* result_type: CMP: return diff; LEN: compare using len_diff/diff */
  68. #define CMP 2
  69. #define LEN 3
  70. /* Compare S1 and S2 as strings holding indices/version numbers,
  71. returning less than, equal to or greater than zero if S1 is less than,
  72. equal to or greater than S2 (for more info, see the Glibc texinfo doc). */
  73. int
  74. strverscmp (const char *s1, const char *s2)
  75. {
  76. const unsigned char *p1 = (const unsigned char *) s1;
  77. const unsigned char *p2 = (const unsigned char *) s2;
  78. unsigned char c1, c2;
  79. int state;
  80. int diff;
  81. /* Symbol(s) 0 [1-9] others (padding)
  82. Transition (10) 0 (01) d (00) x (11) - */
  83. static const unsigned int next_state[] =
  84. {
  85. /* state x d 0 - */
  86. /* S_N */ S_N, S_I, S_Z, S_N,
  87. /* S_I */ S_N, S_I, S_I, S_I,
  88. /* S_F */ S_N, S_F, S_F, S_F,
  89. /* S_Z */ S_N, S_F, S_Z, S_Z
  90. };
  91. static const int result_type[] =
  92. {
  93. /* state x/x x/d x/0 x/- d/x d/d d/0 d/-
  94. 0/x 0/d 0/0 0/- -/x -/d -/0 -/- */
  95. /* S_N */ CMP, CMP, CMP, CMP, CMP, LEN, CMP, CMP,
  96. CMP, CMP, CMP, CMP, CMP, CMP, CMP, CMP,
  97. /* S_I */ CMP, -1, -1, CMP, +1, LEN, LEN, CMP,
  98. +1, LEN, LEN, CMP, CMP, CMP, CMP, CMP,
  99. /* S_F */ CMP, CMP, CMP, CMP, CMP, LEN, CMP, CMP,
  100. CMP, CMP, CMP, CMP, CMP, CMP, CMP, CMP,
  101. /* S_Z */ CMP, +1, +1, CMP, -1, CMP, CMP, CMP,
  102. -1, CMP, CMP, CMP
  103. };
  104. if (p1 == p2)
  105. return 0;
  106. c1 = *p1++;
  107. c2 = *p2++;
  108. /* Hint: '0' is a digit too. */
  109. state = S_N | ((c1 == '0') + (ISDIGIT (c1) != 0));
  110. while ((diff = c1 - c2) == 0 && c1 != '\0')
  111. {
  112. state = next_state[state];
  113. c1 = *p1++;
  114. c2 = *p2++;
  115. state |= (c1 == '0') + (ISDIGIT (c1) != 0);
  116. }
  117. state = result_type[state << 2 | (((c2 == '0') + (ISDIGIT (c2) != 0)))];
  118. switch (state)
  119. {
  120. case CMP:
  121. return diff;
  122. case LEN:
  123. while (ISDIGIT (*p1++))
  124. if (!ISDIGIT (*p2++))
  125. return 1;
  126. return ISDIGIT (*p2) ? -1 : diff;
  127. default:
  128. return state;
  129. }
  130. }
  131. /* APPLE LOCAL end mainline 2005-09-01 3449986 */