1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346
|
/* Copyright (c) 2003, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License, version 2.0, for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
/* Some useful string utility functions used by the MySQL server */
#include "sql/strfunc.h"
#include <string.h>
#include "m_ctype.h" // my_charset_latin1
#include "my_alloc.h"
#include "my_dbug.h"
#include "my_sys.h"
#include "sql/sql_class.h"
#include "sql/sql_const.h"
#include "sql_string.h"
#include "typelib.h" // TYPELIB
/*
Return bitmap for strings used in a set
SYNOPSIS
find_set()
lib Strings in set
str Strings of set-strings separated by ','
err_pos If error, set to point to start of wrong set string
err_len If error, set to the length of wrong set string
set_warning Set to 1 if some string in set couldn't be used
NOTE
We delete all end space from str before comparison
RETURN
bitmap of all sets found in x.
set_warning is set to 1 if there was any sets that couldn't be set
*/
static const char field_separator = ',';
ulonglong find_set(const TYPELIB *lib, const char *str, size_t length,
const CHARSET_INFO *cs, const char **err_pos, uint *err_len,
bool *set_warning) {
const CHARSET_INFO *strip = cs ? cs : &my_charset_latin1;
const char *end = str + strip->cset->lengthsp(strip, str, length);
ulonglong found = 0;
*err_pos = nullptr; // No error yet
*err_len = 0;
if (str != end) {
const char *start = str;
for (;;) {
const char *pos = start;
uint var_len;
int mblen = 1;
if (cs && cs->mbminlen > 1) {
for (; pos < end; pos += mblen) {
my_wc_t wc;
if ((mblen = cs->cset->mb_wc(cs, &wc, (const uchar *)pos,
(const uchar *)end)) < 1)
mblen = 1; // Not to hang on a wrong multibyte sequence
if (wc == (my_wc_t)field_separator) break;
}
} else
for (; pos != end && *pos != field_separator; pos++)
;
var_len = (uint)(pos - start);
uint find = cs ? find_type2(lib, start, var_len, cs)
: find_type(lib, start, var_len, false);
if (!find && *err_len == 0) // report the first error with length > 0
{
*err_pos = start;
*err_len = var_len;
*set_warning = true;
} else if (find) // avoid 1ULL << 4294967295
found |= 1ULL << (find - 1);
if (pos >= end) break;
start = pos + mblen;
}
}
return found;
}
/*
Function to find a string in a TYPELIB
(similar to find_type() of mysys/typelib.c)
SYNOPSIS
find_type()
lib TYPELIB (struct of pointer to values + count)
find String to find
length Length of string to find
part_match Allow part matching of value
RETURN
0 error
> 0 position in TYPELIB->type_names +1
*/
uint find_type(const TYPELIB *lib, const char *find, size_t length,
bool part_match) {
uint found_count = 0, found_pos = 0;
const char *end = find + length;
const char *i;
const char *j;
for (uint pos = 0; (j = lib->type_names[pos++]);) {
for (i = find; i != end && my_toupper(system_charset_info, *i) ==
my_toupper(system_charset_info, *j);
i++, j++)
;
if (i == end) {
if (!*j) return (pos);
found_count++;
found_pos = pos;
}
}
return (found_count == 1 && part_match ? found_pos : 0);
}
/*
Find a string in a list of strings according to collation
SYNOPSIS
find_type2()
lib TYPELIB (struct of pointer to values + count)
x String to find
length String length
cs Character set + collation to use for comparison
NOTES
RETURN
0 No matching value
>0 Offset+1 in typelib for matched string
*/
uint find_type2(const TYPELIB *typelib, const char *x, size_t length,
const CHARSET_INFO *cs) {
int pos;
const char *j;
DBUG_TRACE;
DBUG_PRINT("enter",
("x: '%.*s' lib: 0x%p", static_cast<int>(length), x, typelib));
if (!typelib->count) {
DBUG_PRINT("exit", ("no count"));
return 0;
}
for (pos = 0; (j = typelib->type_names[pos]); pos++) {
if (!my_strnncoll(cs, (const uchar *)x, length, (const uchar *)j,
typelib->type_lengths[pos]))
return pos + 1;
}
DBUG_PRINT("exit", ("Couldn't find type"));
return 0;
} /* find_type */
/*
Check if the first word in a string is one of the ones in TYPELIB
SYNOPSIS
check_word()
lib TYPELIB
val String to check
end End of input
end_of_word Store value of last used byte here if we found word
RETURN
0 No matching value
> 1 lib->type_names[#-1] matched
end_of_word will point to separator character/end in 'val'
*/
uint check_word(TYPELIB *lib, const char *val, const char *end,
const char **end_of_word) {
int res;
const char *ptr;
/* Fiend end of word */
for (ptr = val; ptr < end && my_isalpha(&my_charset_latin1, *ptr); ptr++)
;
if ((res = find_type(lib, val, (uint)(ptr - val), true)) > 0)
*end_of_word = ptr;
return res;
}
/*
Converts a string between character sets
SYNOPSIS
strconvert()
from_cs source character set
from source, a null terminated string
to destination buffer
to_length destination buffer length
NOTES
'to' is always terminated with a '\0' character.
If there is no enough space to convert whole string,
only prefix is converted, and terminated with '\0'.
RETURN VALUES
result string length
*/
size_t strconvert(const CHARSET_INFO *from_cs, const char *from,
CHARSET_INFO *to_cs, char *to, size_t to_length,
uint *errors) {
my_wc_t wc;
char *to_start = to;
uchar *to_end = (uchar *)to + to_length - 1;
my_charset_conv_mb_wc mb_wc = from_cs->cset->mb_wc;
my_charset_conv_wc_mb wc_mb = to_cs->cset->wc_mb;
uint error_count = 0;
while (true) {
/*
Lookahead of max 10 bytes should suffice for all character sets.
*/
const size_t max_char_len = strnlen(from, 10);
int cnvres = (*mb_wc)(from_cs, &wc, pointer_cast<const uchar *>(from),
pointer_cast<const uchar *>(from) + max_char_len);
if (cnvres > 0) {
if (!wc) break;
from += cnvres;
} else if (cnvres == MY_CS_ILSEQ) {
error_count++;
from++;
wc = '?';
} else
break; // Impossible char.
outp:
if ((cnvres = (*wc_mb)(to_cs, wc, (uchar *)to, to_end)) > 0)
to += cnvres;
else if (cnvres == MY_CS_ILUNI && wc != '?') {
error_count++;
wc = '?';
goto outp;
} else
break;
}
*to = '\0';
*errors = error_count;
return static_cast<size_t>(to - to_start);
}
char *set_to_string(THD *thd, LEX_STRING *result, ulonglong set,
const char *lib[], bool quoted) {
char buff[STRING_BUFFER_USUAL_SIZE * 8];
String tmp(buff, sizeof(buff), &my_charset_latin1);
LEX_STRING unused;
if (!result) result = &unused;
tmp.length(0);
for (uint i = 0; set; i++, set >>= 1)
if (set & 1) {
if (quoted) tmp.append('\'');
tmp.append(lib[i]);
if (quoted) tmp.append('\'');
tmp.append(',');
}
if (tmp.length()) {
result->str = thd->strmake(tmp.ptr(), tmp.length() - 1);
result->length = tmp.length() - 1;
} else {
result->str = const_cast<char *>("");
result->length = 0;
}
return result->str;
}
char *set_to_string(THD *thd, LEX_STRING *result, ulonglong set,
const char *lib[]) {
return set_to_string(thd, result, set, lib, false);
}
char *flagset_to_string(THD *thd, LEX_STRING *result, ulonglong set,
const char *lib[]) {
char buff[STRING_BUFFER_USUAL_SIZE * 8];
String tmp(buff, sizeof(buff), &my_charset_latin1);
LEX_STRING unused;
if (!result) result = &unused;
tmp.length(0);
// note that the last element is always "default", and it's ignored below
for (uint i = 0; lib[i + 1]; i++, set >>= 1) {
tmp.append(lib[i]);
tmp.append(set & 1 ? "=on," : "=off,");
}
result->str = thd->strmake(tmp.ptr(), tmp.length() - 1);
result->length = tmp.length() - 1;
return result->str;
}
LEX_STRING *make_lex_string_root(MEM_ROOT *mem_root, const char *str,
size_t length) {
auto lex_str =
reinterpret_cast<LEX_STRING *>(mem_root->Alloc(sizeof(LEX_STRING)));
if (lex_str == nullptr || lex_string_strmake(mem_root, lex_str, str, length))
return nullptr;
return lex_str;
}
bool lex_string_strmake(MEM_ROOT *mem_root, LEX_STRING *lex_str,
const char *str, size_t length) {
if (!(lex_str->str = strmake_root(mem_root, str, length))) return true;
lex_str->length = length;
return false;
}
bool lex_string_strmake(MEM_ROOT *mem_root, LEX_CSTRING *lex_str,
const char *str, size_t length) {
if (!(lex_str->str = strmake_root(mem_root, str, length))) return true;
lex_str->length = length;
return false;
}
|