Coverage Report

Created: 2025-07-11 06:57

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