strcase.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. /***************************************************************************
  2. * _ _ ____ _
  3. * Project ___| | | | _ \| |
  4. * / __| | | | |_) | |
  5. * | (__| |_| | _ <| |___
  6. * \___|\___/|_| \_\_____|
  7. *
  8. * Copyright (C) Daniel Stenberg, <[email protected]>, et al.
  9. *
  10. * This software is licensed as described in the file COPYING, which
  11. * you should have received as part of this distribution. The terms
  12. * are also available at https://curl.se/docs/copyright.html.
  13. *
  14. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  15. * copies of the Software, and permit persons to whom the Software is
  16. * furnished to do so, under the terms of the COPYING file.
  17. *
  18. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  19. * KIND, either express or implied.
  20. *
  21. * SPDX-License-Identifier: curl
  22. *
  23. ***************************************************************************/
  24. #include "curl_setup.h"
  25. #include "strcase.h"
  26. /* Mapping table to go from lowercase to uppercase for plain ASCII.*/
  27. static const unsigned char touppermap[256] = {
  28. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
  29. 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
  30. 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
  31. 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
  32. 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
  33. 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
  34. 90, 91, 92, 93, 94, 95, 96, 65, 66, 67, 68, 69, 70, 71, 72,
  35. 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87,
  36. 88, 89, 90, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
  37. 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
  38. 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
  39. 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
  40. 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
  41. 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209,
  42. 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
  43. 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239,
  44. 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254,
  45. 255
  46. };
  47. /* Mapping table to go from uppercase to lowercase for plain ASCII.*/
  48. static const unsigned char tolowermap[256] = {
  49. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
  50. 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
  51. 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
  52. 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
  53. 60, 61, 62, 63, 64, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106,
  54. 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
  55. 122, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
  56. 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
  57. 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
  58. 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
  59. 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
  60. 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
  61. 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
  62. 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209,
  63. 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
  64. 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239,
  65. 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254,
  66. 255
  67. };
  68. /* Portable, consistent toupper. Do not use toupper() because its behavior is
  69. altered by the current locale. */
  70. char Curl_raw_toupper(char in)
  71. {
  72. return (char)touppermap[(unsigned char)in];
  73. }
  74. /* Portable, consistent tolower. Do not use tolower() because its behavior is
  75. altered by the current locale. */
  76. char Curl_raw_tolower(char in)
  77. {
  78. return (char)tolowermap[(unsigned char)in];
  79. }
  80. /* Copy an upper case version of the string from src to dest. The
  81. * strings may overlap. No more than n characters of the string are copied
  82. * (including any NUL) and the destination string will NOT be
  83. * null-terminated if that limit is reached.
  84. */
  85. void Curl_strntoupper(char *dest, const char *src, size_t n)
  86. {
  87. if(n < 1)
  88. return;
  89. do {
  90. *dest++ = Curl_raw_toupper(*src);
  91. } while(*src++ && --n);
  92. }
  93. /* Copy a lower case version of the string from src to dest. The
  94. * strings may overlap. No more than n characters of the string are copied
  95. * (including any NUL) and the destination string will NOT be
  96. * null-terminated if that limit is reached.
  97. */
  98. void Curl_strntolower(char *dest, const char *src, size_t n)
  99. {
  100. if(n < 1)
  101. return;
  102. do {
  103. *dest++ = Curl_raw_tolower(*src);
  104. } while(*src++ && --n);
  105. }
  106. /* Compare case-sensitive null-terminated strings, taking care of possible
  107. * null pointers. Return true if arguments match.
  108. */
  109. bool Curl_safecmp(char *a, char *b)
  110. {
  111. if(a && b)
  112. return !strcmp(a, b);
  113. return !a && !b;
  114. }
  115. /*
  116. * Curl_timestrcmp() returns 0 if the two strings are identical. The time this
  117. * function spends is a function of the shortest string, not of the contents.
  118. */
  119. int Curl_timestrcmp(const char *a, const char *b)
  120. {
  121. int match = 0;
  122. int i = 0;
  123. if(a && b) {
  124. while(1) {
  125. match |= a[i] ^ b[i];
  126. if(!a[i] || !b[i])
  127. break;
  128. i++;
  129. }
  130. }
  131. else
  132. return a || b;
  133. return match;
  134. }