mirror of
https://github.com/alliedmodders/amxmodx.git
synced 2024-10-16 23:37:04 +03:00
ab854ec035
* Compile as static library, update AMBuildScript and link to core * Update VS project files to include the library * Add UTF-8 Rewind library (v1.5.1) to third_party directory * Update ACKNOWLEDGEMENTS.txt * Move AMXX buffer in its own function * Move constants from string.inc to string_const.inc and update project files * Move stocks from string.inc to string_stocks.inc and update project files * Improve UTF-8 support in containi() and update documentation * Improve UTF-8 support in strcmp() and update documentation * Improve UTF-8 support in strfind() and update documentation Worth to be noted that this native with ignorecase set was not working properly. So broken that no one reported the issue. This adds also a safety check for "pos" parameter to not go < 0. * Improve UTF-8 support in strncmp() and update documentation * Improve UTF-8 support in equali() and update documentation * Add an option to some UTF-8 Rewind functions for avoiding invalid data to be replaced By default it replaces any invalid byte or sequence of bytes by 0xFFFD (3 bytes). It can be problematic when the input buffer is not changed (from a plugin) and that some natives need to calculate a position from the converted string. With such replacement, the position is displaced due the final string length being larger. This compiles the library as C++, because I added some silly param with a default default value which is not supported by C. * Improve UTF-8 support in replace_string/ex() and update documentation * Add is_string_category() and update documentation * Update a little testsuite plugin (and fix linux compilation) * Add mb_strotolower/upper() and update documentation * Add mb_ucfirst() and update documentation * Add mb_strtotile() and update documentation * Improve UTF-8 support in get_players() and find_player() with name/case insenstive flags set * Fix KliPPy's complain
1429 lines
28 KiB
C
1429 lines
28 KiB
C
/*
|
|
Copyright (C) 2014-2016 Quinten Lansu
|
|
|
|
Permission is hereby granted, free of charge, to any person
|
|
obtaining a copy of this software and associated documentation
|
|
files (the "Software"), to deal in the Software without
|
|
restriction, including without limitation the rights to use,
|
|
copy, modify, merge, publish, distribute, sublicense, and/or
|
|
sell copies of the Software, and to permit persons to whom the
|
|
Software is furnished to do so, subject to the following
|
|
conditions:
|
|
|
|
The above copyright notice and this permission notice shall be
|
|
included in all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
|
|
#include "utf8rewind.h"
|
|
|
|
#include "internal/base.h"
|
|
#include "internal/casemapping.h"
|
|
#include "internal/codepoint.h"
|
|
#include "internal/composition.h"
|
|
#include "internal/decomposition.h"
|
|
#include "internal/database.h"
|
|
#include "internal/seeking.h"
|
|
#include "internal/streaming.h"
|
|
|
|
size_t utf8len(const char* text)
|
|
{
|
|
const uint8_t* src;
|
|
size_t src_length;
|
|
size_t length;
|
|
|
|
/* Validate input */
|
|
|
|
if (text == 0 ||
|
|
text[0] == 0)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
length = 0;
|
|
|
|
/* Determine length in codepoints */
|
|
|
|
src = (const uint8_t*)text;
|
|
src_length = strlen(text);
|
|
|
|
while (src_length > 0)
|
|
{
|
|
uint8_t src_offset = 1;
|
|
|
|
/* Check if the current byte is part of a multi-byte sequence */
|
|
|
|
uint8_t codepoint_length = codepoint_decoded_length[*src];
|
|
if (codepoint_length > 1)
|
|
{
|
|
/* Check every byte of the sequence */
|
|
|
|
do
|
|
{
|
|
if (src[src_offset] < 0x80 || /* Not a continuation byte */
|
|
src[src_offset] > 0xBF) /* Start of a new sequence */
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
while (++src_offset < codepoint_length);
|
|
}
|
|
|
|
/* Found a codepoint */
|
|
|
|
length++;
|
|
|
|
/* Move cursor */
|
|
|
|
if (src_offset >= src_length)
|
|
{
|
|
break;
|
|
}
|
|
|
|
src += src_offset;
|
|
src_length -= src_offset;
|
|
}
|
|
|
|
return length;
|
|
}
|
|
|
|
size_t utf16toutf8(const utf16_t* input, size_t inputSize, char* target, size_t targetSize, int32_t* errors)
|
|
{
|
|
const utf16_t* src;
|
|
size_t src_size;
|
|
char* dst;
|
|
size_t dst_size;
|
|
size_t bytes_written = 0;
|
|
|
|
/* Validate parameters */
|
|
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(utf16_t, bytes_written);
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
/* Setup cursors */
|
|
|
|
src = input;
|
|
src_size = inputSize;
|
|
dst = target;
|
|
dst_size = targetSize;
|
|
|
|
/* Loop over input */
|
|
|
|
while (src_size > 0)
|
|
{
|
|
unicode_t codepoint;
|
|
uint8_t encoded_size;
|
|
|
|
if (src_size < sizeof(utf16_t))
|
|
{
|
|
/* Not enough data */
|
|
|
|
goto invaliddata;
|
|
}
|
|
|
|
codepoint = (unicode_t)*src;
|
|
|
|
if (codepoint >= SURROGATE_HIGH_START &&
|
|
codepoint <= SURROGATE_LOW_END)
|
|
{
|
|
/* Decode surrogate pair */
|
|
|
|
if (codepoint > SURROGATE_HIGH_END)
|
|
{
|
|
/* Missing high surrogate codepoint */
|
|
|
|
codepoint = REPLACEMENT_CHARACTER;
|
|
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
}
|
|
else if (
|
|
src_size < 2 * sizeof(utf16_t))
|
|
{
|
|
/* Not enough data */
|
|
|
|
goto invaliddata;
|
|
}
|
|
else
|
|
{
|
|
/* Read low surrogate codepoint */
|
|
|
|
if (src[1] < SURROGATE_LOW_START ||
|
|
src[1] > SURROGATE_LOW_END)
|
|
{
|
|
/* Missing low surrogate codepoint */
|
|
|
|
codepoint = REPLACEMENT_CHARACTER;
|
|
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
}
|
|
else
|
|
{
|
|
/* Decode codepoint from surrogate pair */
|
|
|
|
codepoint =
|
|
(MAX_BASIC_MULTILINGUAL_PLANE + 1) +
|
|
(src[1] - SURROGATE_LOW_START) +
|
|
((src[0] - SURROGATE_HIGH_START) << 10);
|
|
|
|
src++;
|
|
src_size -= sizeof(utf16_t);
|
|
}
|
|
}
|
|
}
|
|
|
|
encoded_size = codepoint_write(codepoint, &dst, &dst_size);
|
|
if (encoded_size == 0)
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
bytes_written += encoded_size;
|
|
|
|
src++;
|
|
src_size -= sizeof(utf16_t);
|
|
}
|
|
|
|
return bytes_written;
|
|
|
|
invaliddata:
|
|
if (dst != 0)
|
|
{
|
|
if (dst_size < REPLACEMENT_CHARACTER_STRING_LENGTH)
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
/* Write replacement codepoint to output */
|
|
|
|
memcpy(dst, REPLACEMENT_CHARACTER_STRING, REPLACEMENT_CHARACTER_STRING_LENGTH);
|
|
}
|
|
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
|
|
return bytes_written + REPLACEMENT_CHARACTER_STRING_LENGTH;
|
|
}
|
|
|
|
size_t utf32toutf8(const unicode_t* input, size_t inputSize, char* target, size_t targetSize, int32_t* errors)
|
|
{
|
|
const unicode_t* src;
|
|
size_t src_size;
|
|
char* dst;
|
|
size_t dst_size;
|
|
size_t bytes_written = 0;
|
|
|
|
/* Validate parameters */
|
|
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(unicode_t, bytes_written);
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
/* Setup cursors */
|
|
|
|
src = input;
|
|
src_size = inputSize;
|
|
dst = target;
|
|
dst_size = targetSize;
|
|
|
|
/* Loop over input */
|
|
|
|
while (src_size > 0)
|
|
{
|
|
unicode_t codepoint;
|
|
uint8_t encoded_size;
|
|
|
|
if (src_size < sizeof(unicode_t))
|
|
{
|
|
/* Not enough data */
|
|
|
|
goto invaliddata;
|
|
}
|
|
|
|
codepoint = *src;
|
|
|
|
if (codepoint >= SURROGATE_HIGH_START &&
|
|
codepoint <= SURROGATE_LOW_END)
|
|
{
|
|
/* Decode surrogate pair */
|
|
|
|
if (codepoint > SURROGATE_HIGH_END)
|
|
{
|
|
/* Missing high surrogate codepoint */
|
|
|
|
codepoint = REPLACEMENT_CHARACTER;
|
|
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
}
|
|
else if (
|
|
src_size < 2 * sizeof(unicode_t))
|
|
{
|
|
/* Not enough data */
|
|
|
|
goto invaliddata;
|
|
}
|
|
else
|
|
{
|
|
/* Read low surrogate codepoint */
|
|
|
|
if (src[1] < SURROGATE_LOW_START ||
|
|
src[1] > SURROGATE_LOW_END)
|
|
{
|
|
/* Missing low surrogate codepoint */
|
|
|
|
codepoint = REPLACEMENT_CHARACTER;
|
|
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
}
|
|
else
|
|
{
|
|
/* Decode codepoint from surrogate pair */
|
|
|
|
codepoint =
|
|
(MAX_BASIC_MULTILINGUAL_PLANE + 1) +
|
|
(src[1] - SURROGATE_LOW_START) +
|
|
((src[0] - SURROGATE_HIGH_START) << 10);
|
|
|
|
src++;
|
|
src_size -= sizeof(unicode_t);
|
|
}
|
|
}
|
|
}
|
|
|
|
encoded_size = codepoint_write(codepoint, &dst, &dst_size);
|
|
if (encoded_size == 0)
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
bytes_written += encoded_size;
|
|
|
|
src++;
|
|
src_size -= sizeof(unicode_t);
|
|
}
|
|
|
|
return bytes_written;
|
|
|
|
invaliddata:
|
|
if (dst != 0)
|
|
{
|
|
if (dst_size < REPLACEMENT_CHARACTER_STRING_LENGTH)
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
/* Write replacement codepoint to output */
|
|
|
|
memcpy(dst, REPLACEMENT_CHARACTER_STRING, REPLACEMENT_CHARACTER_STRING_LENGTH);
|
|
}
|
|
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
|
|
return bytes_written + REPLACEMENT_CHARACTER_STRING_LENGTH;
|
|
}
|
|
|
|
size_t widetoutf8(const wchar_t* input, size_t inputSize, char* target, size_t targetSize, int32_t* errors)
|
|
{
|
|
#if UTF8_WCHAR_UTF16
|
|
return utf16toutf8((const utf16_t*)input, inputSize, target, targetSize, errors);
|
|
#elif UTF8_WCHAR_UTF32
|
|
return utf32toutf8((const unicode_t*)input, inputSize, target, targetSize, errors);
|
|
#else
|
|
return SIZE_MAX;
|
|
#endif
|
|
}
|
|
|
|
size_t utf8toutf16(const char* input, size_t inputSize, utf16_t* target, size_t targetSize, int32_t* errors)
|
|
{
|
|
const char* src;
|
|
size_t src_size;
|
|
utf16_t* dst;
|
|
size_t dst_size;
|
|
size_t bytes_written = 0;
|
|
|
|
/* Validate parameters */
|
|
|
|
UTF8_VALIDATE_PARAMETERS(char, utf16_t, bytes_written);
|
|
|
|
/* Setup cursors */
|
|
|
|
src = input;
|
|
src_size = inputSize;
|
|
dst = target;
|
|
dst_size = targetSize;
|
|
|
|
/* Loop over input */
|
|
|
|
while (src_size > 0)
|
|
{
|
|
unicode_t decoded;
|
|
uint8_t decoded_size = codepoint_read(src, src_size, &decoded);
|
|
|
|
if (decoded <= MAX_BASIC_MULTILINGUAL_PLANE)
|
|
{
|
|
/* Codepoint fits in a single UTF-16 codepoint */
|
|
|
|
if (dst != 0)
|
|
{
|
|
/* Write to output */
|
|
|
|
if (dst_size < sizeof(utf16_t))
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
*dst++ = (utf16_t)decoded;
|
|
dst_size -= sizeof(utf16_t);
|
|
}
|
|
|
|
bytes_written += sizeof(utf16_t);
|
|
}
|
|
else
|
|
{
|
|
/* Codepoint must be encoded using a surrogate pair */
|
|
|
|
if (dst != 0)
|
|
{
|
|
/* Write to output */
|
|
|
|
if (dst_size < 2 * sizeof(utf16_t))
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
/* Encoded value is always beyond BMP */
|
|
|
|
decoded -= (MAX_BASIC_MULTILINGUAL_PLANE + 1);
|
|
*dst++ = SURROGATE_HIGH_START + (decoded >> 10);
|
|
*dst++ = SURROGATE_LOW_START + (decoded & 0x03FF);
|
|
|
|
dst_size -= 2 * sizeof(utf16_t);
|
|
}
|
|
|
|
bytes_written += 2 * sizeof(utf16_t);
|
|
}
|
|
|
|
src += decoded_size;
|
|
src_size -= decoded_size;
|
|
}
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
size_t utf8toutf32(const char* input, size_t inputSize, unicode_t* target, size_t targetSize, int32_t* errors)
|
|
{
|
|
const char* src;
|
|
size_t src_size;
|
|
unicode_t* dst;
|
|
size_t dst_size;
|
|
size_t bytes_written = 0;
|
|
|
|
/* Validate parameters */
|
|
|
|
UTF8_VALIDATE_PARAMETERS(char, unicode_t, bytes_written);
|
|
|
|
/* Setup cursors */
|
|
|
|
src = input;
|
|
src_size = inputSize;
|
|
dst = target;
|
|
dst_size = targetSize;
|
|
|
|
/* Loop over input */
|
|
|
|
while (src_size > 0)
|
|
{
|
|
unicode_t decoded;
|
|
uint8_t decoded_length = codepoint_read(src, src_size, &decoded);
|
|
|
|
if (dst != 0)
|
|
{
|
|
/* Write to output */
|
|
|
|
if (dst_size < sizeof(unicode_t))
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
*dst++ = decoded;
|
|
dst_size -= sizeof(unicode_t);
|
|
}
|
|
|
|
bytes_written += sizeof(unicode_t);
|
|
|
|
src += decoded_length;
|
|
src_size -= decoded_length;
|
|
}
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
size_t utf8towide(const char* input, size_t inputSize, wchar_t* target, size_t targetSize, int32_t* errors)
|
|
{
|
|
#if UTF8_WCHAR_UTF16
|
|
return utf8toutf16(input, inputSize, (utf16_t*)target, targetSize, errors);
|
|
#elif UTF8_WCHAR_UTF32
|
|
return utf8toutf32(input, inputSize, (unicode_t*)target, targetSize, errors);
|
|
#else
|
|
return SIZE_MAX;
|
|
#endif
|
|
}
|
|
|
|
const char* utf8seek(const char* text, size_t textSize, const char* textStart, off_t offset, int direction)
|
|
{
|
|
const char* text_end;
|
|
|
|
if (text == 0 ||
|
|
textStart == 0)
|
|
{
|
|
return text;
|
|
}
|
|
|
|
text_end = textStart + textSize;
|
|
|
|
switch (direction)
|
|
{
|
|
|
|
case SEEK_CUR:
|
|
{
|
|
if (offset == 0)
|
|
{
|
|
return text;
|
|
}
|
|
else if (offset > 0)
|
|
{
|
|
return seeking_forward(text, text_end, textSize, offset);
|
|
}
|
|
else
|
|
{
|
|
return seeking_rewind(textStart, text, textSize, offset);
|
|
}
|
|
|
|
} break;
|
|
|
|
case SEEK_SET:
|
|
{
|
|
if (text < textStart)
|
|
{
|
|
return text;
|
|
}
|
|
|
|
return seeking_forward(textStart, text_end, textSize, offset);
|
|
|
|
} break;
|
|
|
|
case SEEK_END:
|
|
return seeking_rewind(textStart, text_end, textSize, -offset);
|
|
|
|
default:
|
|
return text;
|
|
|
|
}
|
|
}
|
|
|
|
UTF8_API size_t utf8envlocale()
|
|
{
|
|
/*
|
|
Sources for locales and code pages
|
|
|
|
Windows
|
|
https://msdn.microsoft.com/en-US/goglobal/bb896001.aspx
|
|
|
|
POSIX
|
|
https://www-01.ibm.com/support/knowledgecenter/ssw_aix_61/com.ibm.aix.nlsgdrf/support_languages_locales.htm
|
|
*/
|
|
|
|
#if WIN32 || _WINDOWS
|
|
#define UTF8_LOCALE_CHECK(_name, _ansiCodepage, _oemCodepage) \
|
|
(codepage == _ansiCodepage || codepage == _oemCodepage)
|
|
|
|
unsigned int codepage;
|
|
_locale_t locale = _get_current_locale();
|
|
|
|
if (locale == 0)
|
|
{
|
|
return UTF8_LOCALE_DEFAULT;
|
|
}
|
|
|
|
// Microsoft changed the name of the codepage member in VS2015.
|
|
|
|
#if _MSC_VER >= 1900
|
|
codepage = ((__crt_locale_data_public*)(locale)->locinfo)->_locale_lc_codepage;
|
|
#else
|
|
codepage = locale->locinfo->lc_codepage;
|
|
#endif
|
|
#else
|
|
#define UTF8_LOCALE_CHECK(_name, _ansiCodepage, _oemCodepage) \
|
|
!strncasecmp(locale, _name, 5)
|
|
|
|
const char* locale = setlocale(LC_ALL, 0);
|
|
if (locale == 0)
|
|
{
|
|
return UTF8_LOCALE_DEFAULT;
|
|
}
|
|
#endif
|
|
|
|
if (UTF8_LOCALE_CHECK("lt_lt", 1257, 775))
|
|
{
|
|
return UTF8_LOCALE_LITHUANIAN;
|
|
}
|
|
else if (
|
|
UTF8_LOCALE_CHECK("tr_tr", 1254, 857) ||
|
|
UTF8_LOCALE_CHECK("az_az", 1254, 857))
|
|
{
|
|
return UTF8_LOCALE_TURKISH_AND_AZERI_LATIN;
|
|
}
|
|
|
|
return UTF8_LOCALE_DEFAULT;
|
|
}
|
|
|
|
size_t utf8toupper(const char* input, size_t inputSize, char* target, size_t targetSize, size_t locale, int32_t* errors, int no_replacement)
|
|
{
|
|
CaseMappingState state;
|
|
|
|
/* Validate parameters */
|
|
|
|
if (no_replacement)
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR_NOCR(char, 0);
|
|
}
|
|
else
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(char, 0);
|
|
}
|
|
|
|
/* Initialize case mapping */
|
|
|
|
if (!casemapping_initialize(
|
|
&state,
|
|
input, inputSize,
|
|
target, targetSize,
|
|
UppercaseIndex1Ptr, UppercaseIndex2Ptr, UppercaseDataPtr,
|
|
QuickCheckCaseMapped_Uppercase, locale,
|
|
errors))
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
/* Execute case mapping as long as input remains */
|
|
|
|
while (state.src_size > 0)
|
|
{
|
|
size_t converted;
|
|
|
|
if ((converted = casemapping_execute(&state, errors, no_replacement)) == 0)
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
state.total_bytes_needed += converted;
|
|
}
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
size_t utf8tolower(const char* input, size_t inputSize, char* target, size_t targetSize, size_t locale, int32_t* errors, int no_replacement)
|
|
{
|
|
CaseMappingState state;
|
|
|
|
/* Validate parameters */
|
|
|
|
if (no_replacement)
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR_NOCR(char, 0);
|
|
}
|
|
else
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(char, 0);
|
|
}
|
|
|
|
/* Initialize case mapping */
|
|
|
|
if (!casemapping_initialize(
|
|
&state,
|
|
input, inputSize,
|
|
target, targetSize,
|
|
LowercaseIndex1Ptr, LowercaseIndex2Ptr, LowercaseDataPtr,
|
|
QuickCheckCaseMapped_Lowercase, locale,
|
|
errors))
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
/* Execute case mapping as long as input remains */
|
|
|
|
while (state.src_size > 0)
|
|
{
|
|
size_t converted;
|
|
|
|
if ((converted = casemapping_execute(&state, errors, no_replacement)) == 0)
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
state.total_bytes_needed += converted;
|
|
}
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
size_t utf8totitle(const char* input, size_t inputSize, char* target, size_t targetSize, size_t locale, int32_t* errors, int no_replacement)
|
|
{
|
|
CaseMappingState state;
|
|
|
|
/* Validate parameters */
|
|
|
|
if (no_replacement)
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR_NOCR(char, 0);
|
|
}
|
|
else
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(char, 0);
|
|
}
|
|
|
|
/* Initialize case mapping */
|
|
|
|
if (!casemapping_initialize(
|
|
&state,
|
|
input, inputSize,
|
|
target, targetSize,
|
|
TitlecaseIndex1Ptr, TitlecaseIndex2Ptr, TitlecaseDataPtr,
|
|
QuickCheckCaseMapped_Titlecase, locale,
|
|
errors))
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
/* Execute case mapping as long as input remains */
|
|
|
|
while (state.src_size > 0)
|
|
{
|
|
size_t converted;
|
|
|
|
if ((converted = casemapping_execute(&state, errors, no_replacement)) == 0)
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
/*
|
|
The first letter of every word should be titlecase, the rest should
|
|
be converted to lowercase.
|
|
*/
|
|
|
|
if (state.last_canonical_combining_class == CCC_NOT_REORDERED)
|
|
{
|
|
if (state.property_data == TitlecaseDataPtr)
|
|
{
|
|
if ((state.last_general_category & UTF8_CATEGORY_LETTER) != 0)
|
|
{
|
|
state.property_index1 = LowercaseIndex1Ptr;
|
|
state.property_index2 = LowercaseIndex2Ptr;
|
|
state.property_data = LowercaseDataPtr;
|
|
|
|
state.quickcheck_flags = QuickCheckCaseMapped_Lowercase;
|
|
}
|
|
}
|
|
else if (
|
|
(state.last_general_category & UTF8_CATEGORY_LETTER) == 0)
|
|
{
|
|
state.property_index1 = TitlecaseIndex1Ptr;
|
|
state.property_index2 = TitlecaseIndex2Ptr;
|
|
state.property_data = TitlecaseDataPtr;
|
|
|
|
state.quickcheck_flags = QuickCheckCaseMapped_Titlecase;
|
|
}
|
|
}
|
|
|
|
state.total_bytes_needed += converted;
|
|
}
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
size_t utf8casefold(const char* input, size_t inputSize, char* target, size_t targetSize, size_t locale, int32_t* errors, int no_replacement)
|
|
{
|
|
CaseMappingState state;
|
|
|
|
/* Validate parameters */
|
|
|
|
if (no_replacement)
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR_NOCR(char, 0);
|
|
}
|
|
else
|
|
{
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(char, 0);
|
|
}
|
|
|
|
/* Initialize case mapping */
|
|
|
|
if (!casemapping_initialize(
|
|
&state,
|
|
input, inputSize,
|
|
target, targetSize,
|
|
CaseFoldingIndex1Ptr, CaseFoldingIndex2Ptr, CaseFoldingDataPtr,
|
|
QuickCheckCaseMapped_Casefolded, locale,
|
|
errors))
|
|
{
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
if (state.locale == UTF8_LOCALE_TURKISH_AND_AZERI_LATIN)
|
|
{
|
|
/* Exceptional behavior for Turkish and Azerbaijani (Latin) locales */
|
|
|
|
while (state.src_size > 0)
|
|
{
|
|
const char* resolved = 0;
|
|
uint8_t bytes_needed = 0;
|
|
|
|
/* Read next code point */
|
|
|
|
if (!(state.last_code_point_size = codepoint_read(state.src, state.src_size, &state.last_code_point)))
|
|
{
|
|
goto invaliddata;
|
|
}
|
|
|
|
/* Move source cursor */
|
|
|
|
if (state.src_size >= state.last_code_point_size)
|
|
{
|
|
state.src += state.last_code_point_size;
|
|
state.src_size -= state.last_code_point_size;
|
|
}
|
|
else
|
|
{
|
|
state.src_size = 0;
|
|
}
|
|
|
|
/* Resolve case folding */
|
|
|
|
if ((PROPERTY_GET_CM(state.last_code_point) & QuickCheckCaseMapped_Casefolded) != 0)
|
|
{
|
|
if (state.last_code_point == CP_LATIN_CAPITAL_LETTER_I)
|
|
{
|
|
resolved = "\xC4\xB1";
|
|
bytes_needed = 2;
|
|
}
|
|
else if (
|
|
state.last_code_point == CP_LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE)
|
|
{
|
|
resolved = "i";
|
|
bytes_needed = 1;
|
|
}
|
|
else
|
|
{
|
|
resolved = database_querydecomposition(state.last_code_point, state.property_index1, state.property_index2, state.property_data, &bytes_needed);
|
|
}
|
|
}
|
|
|
|
/* Write to output */
|
|
|
|
if (resolved != 0)
|
|
{
|
|
/* Write resolved string to output */
|
|
|
|
if (state.dst != 0)
|
|
{
|
|
if (state.dst_size < bytes_needed)
|
|
{
|
|
goto outofspace;
|
|
}
|
|
|
|
memcpy(state.dst, resolved, bytes_needed);
|
|
|
|
state.dst += bytes_needed;
|
|
state.dst_size -= bytes_needed;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Write code point unchanged to output */
|
|
|
|
if (!(bytes_needed = codepoint_write(state.last_code_point, &state.dst, &state.dst_size)))
|
|
{
|
|
goto outofspace;
|
|
}
|
|
}
|
|
|
|
state.total_bytes_needed += bytes_needed;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Execute case mapping as long as input remains */
|
|
|
|
while (state.src_size > 0)
|
|
{
|
|
const char* resolved = 0;
|
|
uint8_t bytes_needed = 0;
|
|
|
|
/* Read next code point */
|
|
|
|
if (!(state.last_code_point_size = codepoint_read(state.src, state.src_size, &state.last_code_point)))
|
|
{
|
|
goto invaliddata;
|
|
}
|
|
|
|
/* If option set, we want to avoid invalid byte to be replaced. Forces size to 1 to read the next byte. */
|
|
if (no_replacement && state.last_code_point == REPLACEMENT_CHARACTER)
|
|
{
|
|
state.last_code_point_size = 1;
|
|
}
|
|
|
|
/* Move source cursor */
|
|
|
|
if (state.src_size >= state.last_code_point_size)
|
|
{
|
|
state.src += state.last_code_point_size;
|
|
state.src_size -= state.last_code_point_size;
|
|
}
|
|
else
|
|
{
|
|
state.src_size = 0;
|
|
}
|
|
|
|
/* Resolve case folding */
|
|
|
|
if ((PROPERTY_GET_CM(state.last_code_point) & QuickCheckCaseMapped_Casefolded) != 0)
|
|
{
|
|
resolved = database_querydecomposition(state.last_code_point, state.property_index1, state.property_index2, state.property_data, &bytes_needed);
|
|
}
|
|
|
|
if (resolved != 0)
|
|
{
|
|
/* Write resolved string to output */
|
|
|
|
if (state.dst != 0)
|
|
{
|
|
if (state.dst_size < bytes_needed)
|
|
{
|
|
goto outofspace;
|
|
}
|
|
|
|
memcpy(state.dst, resolved, bytes_needed);
|
|
|
|
state.dst += bytes_needed;
|
|
state.dst_size -= bytes_needed;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Write code point unchanged to output */
|
|
|
|
/* If option set, we want to write any invalid byte as it is. */
|
|
if (no_replacement && state.last_code_point == REPLACEMENT_CHARACTER)
|
|
{
|
|
bytes_needed = 1;
|
|
|
|
if (state.dst != 0)
|
|
{
|
|
if (state.dst_size < bytes_needed)
|
|
{
|
|
goto outofspace;
|
|
}
|
|
|
|
*state.dst = *(state.src - bytes_needed);
|
|
state.dst += bytes_needed;
|
|
}
|
|
}
|
|
else if (!(bytes_needed = codepoint_write(state.last_code_point, &state.dst, &state.dst_size)))
|
|
{
|
|
goto outofspace;
|
|
}
|
|
}
|
|
|
|
state.total_bytes_needed += bytes_needed;
|
|
}
|
|
}
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return state.total_bytes_needed;
|
|
|
|
invaliddata:
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
|
|
return state.total_bytes_needed;
|
|
|
|
outofspace:
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return state.total_bytes_needed;
|
|
}
|
|
|
|
uint8_t utf8isnormalized(const char* input, size_t inputSize, size_t flags, size_t* offset)
|
|
{
|
|
const char* src = input;
|
|
size_t src_size = inputSize;
|
|
uint8_t last_canonical_class = CCC_NOT_REORDERED;
|
|
size_t found_offset = 0;
|
|
uint8_t result = UTF8_NORMALIZATION_RESULT_YES;
|
|
unicode_t decoded;
|
|
uint8_t canonical_class;
|
|
uint8_t quick_check;
|
|
const size_t* property_index;
|
|
const uint8_t* property_data;
|
|
|
|
/* Validate input and flags */
|
|
|
|
if (input == NULL ||
|
|
inputSize == 0 ||
|
|
(flags & (UTF8_NORMALIZE_DECOMPOSE | UTF8_NORMALIZE_COMPOSE)) == 0)
|
|
{
|
|
goto end;
|
|
}
|
|
|
|
/* Get properties */
|
|
|
|
if ((flags & UTF8_NORMALIZE_COMPOSE) != 0)
|
|
{
|
|
if ((flags & UTF8_NORMALIZE_COMPATIBILITY) != 0)
|
|
{
|
|
property_index = QuickCheckNFKCIndexPtr;
|
|
property_data = QuickCheckNFKCDataPtr;
|
|
}
|
|
else
|
|
{
|
|
property_index = QuickCheckNFCIndexPtr;
|
|
property_data = QuickCheckNFCDataPtr;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if ((flags & UTF8_NORMALIZE_COMPATIBILITY) != 0)
|
|
{
|
|
property_index = QuickCheckNFKDIndexPtr;
|
|
property_data = QuickCheckNFKDDataPtr;
|
|
}
|
|
else
|
|
{
|
|
property_index = QuickCheckNFDIndexPtr;
|
|
property_data = QuickCheckNFDDataPtr;
|
|
}
|
|
}
|
|
|
|
/* Process input */
|
|
|
|
while (src_size > 0)
|
|
{
|
|
/* Read codepoint at cursor */
|
|
|
|
uint8_t read = codepoint_read(src, src_size, &decoded);
|
|
if (read == 0)
|
|
{
|
|
break;
|
|
}
|
|
|
|
/* Get canonical combining class and quick check value */
|
|
|
|
canonical_class = PROPERTY_GET_CCC(decoded);
|
|
quick_check = PROPERTY_GET(property_index, property_data, decoded);
|
|
|
|
/* Compare CCC to previous CCC */
|
|
|
|
if (last_canonical_class > canonical_class &&
|
|
canonical_class > CCC_NOT_REORDERED)
|
|
{
|
|
result = UTF8_NORMALIZATION_RESULT_NO;
|
|
|
|
break;
|
|
}
|
|
|
|
/* Compare quick check value */
|
|
|
|
if (quick_check == QuickCheckResult_No)
|
|
{
|
|
result = UTF8_NORMALIZATION_RESULT_NO;
|
|
|
|
break;
|
|
}
|
|
else if (
|
|
quick_check == QuickCheckResult_Maybe)
|
|
{
|
|
result = UTF8_NORMALIZATION_RESULT_MAYBE;
|
|
}
|
|
|
|
/* Append to offset */
|
|
|
|
if (result != UTF8_NORMALIZATION_RESULT_MAYBE)
|
|
{
|
|
found_offset += read;
|
|
}
|
|
|
|
last_canonical_class = canonical_class;
|
|
|
|
src += read;
|
|
src_size -= read;
|
|
}
|
|
|
|
end:
|
|
if (offset != 0)
|
|
{
|
|
*offset = found_offset;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
size_t utf8normalize(const char* input, size_t inputSize, char* target, size_t targetSize, size_t flags, int32_t* errors)
|
|
{
|
|
char* dst = target;
|
|
size_t dst_size = targetSize;
|
|
StreamState stream[4];
|
|
DecomposeState decompose_state;
|
|
ComposeState compose_state;
|
|
uint8_t compatibility = (flags & UTF8_NORMALIZE_COMPATIBILITY) != 0;
|
|
StreamState* stream_output;
|
|
uint8_t finished = 0;
|
|
size_t bytes_written = 0;
|
|
|
|
/*
|
|
Decomposition uses the following process:
|
|
|
|
input --> stream[0] -->
|
|
(decompose) --> stream[1] -->
|
|
(accumulate) --> stream[2] -->
|
|
output
|
|
|
|
The accumulation step is necessary in order to prevent buffer overflow
|
|
attacks.
|
|
|
|
Composition adds another stream buffer:
|
|
|
|
input --> stream[0] -->
|
|
(decompose) --> stream[1] -->
|
|
(accumulate) --> stream[2] -->
|
|
(compose) --> stream[3] -->
|
|
output
|
|
|
|
Although four streaming buffers may seem excessive, they are necessary
|
|
for preventing allocations on the heap.
|
|
*/
|
|
|
|
/* Check for valid flags */
|
|
|
|
if ((flags & (UTF8_NORMALIZE_DECOMPOSE | UTF8_NORMALIZE_COMPOSE)) == 0)
|
|
{
|
|
UTF8_SET_ERROR(INVALID_FLAG);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
/* Validate parameters */
|
|
|
|
UTF8_VALIDATE_PARAMETERS_CHAR(char, bytes_written);
|
|
|
|
/* Initialize decomposition */
|
|
|
|
memset(stream, 0, sizeof(stream));
|
|
|
|
if (!stream_initialize(&stream[0], input, inputSize) ||
|
|
!decompose_initialize(&decompose_state, &stream[0], &stream[1], compatibility))
|
|
{
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
stream_output = &stream[2];
|
|
|
|
if ((flags & UTF8_NORMALIZE_COMPOSE) != 0)
|
|
{
|
|
/* Initialize composition */
|
|
|
|
if (!compose_initialize(&compose_state, &stream[2], &stream[3], compatibility))
|
|
{
|
|
UTF8_SET_ERROR(INVALID_DATA);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
stream_output = &stream[3];
|
|
}
|
|
|
|
do
|
|
{
|
|
uint8_t write = 0;
|
|
|
|
/* Accumulate decomposed input in next stream */
|
|
|
|
if (stream[1].current > 0)
|
|
{
|
|
unicode_t* src_codepoint = stream[1].codepoint;
|
|
unicode_t* dst_codepoint = stream[2].codepoint + stream[2].filled;
|
|
uint8_t* src_qc = stream[1].quick_check;
|
|
uint8_t* dst_qc = stream[2].quick_check + stream[2].filled;
|
|
uint8_t* src_ccc = stream[1].canonical_combining_class;
|
|
uint8_t* dst_ccc = stream[2].canonical_combining_class + stream[2].filled;
|
|
|
|
if ((flags & UTF8_NORMALIZE_COMPOSE) != 0)
|
|
{
|
|
uint8_t i;
|
|
|
|
/* Update stream properties to use composition values */
|
|
|
|
for (i = 0; i < stream[1].current; ++i)
|
|
{
|
|
*dst_qc++ = PROPERTY_GET(compose_state.qc_index, compose_state.qc_data, *src_codepoint);
|
|
*dst_ccc++ = *src_ccc++;
|
|
*dst_codepoint++ = *src_codepoint++;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Copy directly */
|
|
|
|
memcpy(dst_codepoint, src_codepoint, stream[1].current * sizeof(unicode_t));
|
|
memcpy(dst_qc, src_qc, stream[1].current * sizeof(uint8_t));
|
|
memcpy(dst_ccc, src_ccc, stream[1].current * sizeof(uint8_t));
|
|
}
|
|
|
|
stream[2].current += stream[1].current;
|
|
stream[2].filled += stream[1].current;
|
|
}
|
|
|
|
/* Decompose input sequence into next stream */
|
|
|
|
finished = !decompose_execute(&decompose_state);
|
|
if (!finished)
|
|
{
|
|
/* Output current stream it it could overflow accumulation buffer */
|
|
|
|
write = (stream[1].current + stream[2].filled) >= STREAM_SAFE_MAX;
|
|
}
|
|
|
|
/* Reorder potentially unordered decomposed stream */
|
|
|
|
if (!stream[1].stable)
|
|
{
|
|
stream_reorder(&stream[1]);
|
|
}
|
|
|
|
/* Write stream to output when overflowing or when accumulation buffer is empty*/
|
|
|
|
if (write ||
|
|
finished)
|
|
{
|
|
uint8_t i;
|
|
|
|
/* Compose accumulation buffer */
|
|
|
|
if ((flags & UTF8_NORMALIZE_COMPOSE) != 0 &&
|
|
!compose_execute(&compose_state))
|
|
{
|
|
break;
|
|
}
|
|
|
|
/* Write to output buffer */
|
|
|
|
for (i = 0; i < stream_output->current; ++i)
|
|
{
|
|
uint8_t encoded_size = codepoint_write(stream_output->codepoint[i], &dst, &dst_size);
|
|
if (encoded_size == 0)
|
|
{
|
|
UTF8_SET_ERROR(NOT_ENOUGH_SPACE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
bytes_written += encoded_size;
|
|
}
|
|
|
|
/* Reset accumulation buffer */
|
|
|
|
stream[2].current = 0;
|
|
stream[2].filled = 0;
|
|
}
|
|
}
|
|
while (!finished);
|
|
|
|
UTF8_SET_ERROR(NONE);
|
|
|
|
return bytes_written;
|
|
}
|
|
|
|
size_t utf8iscategory(const char* input, size_t inputSize, size_t flags)
|
|
{
|
|
const char* src = input;
|
|
size_t src_size = inputSize;
|
|
|
|
if (input == 0 ||
|
|
inputSize == 0)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
while (src_size > 0)
|
|
{
|
|
unicode_t code_point;
|
|
uint32_t general_category;
|
|
uint8_t canonical_combining_class;
|
|
uint8_t offset;
|
|
|
|
/* Compatibility fixes */
|
|
|
|
if ((flags & UTF8_CATEGORY_COMPATIBILITY) != 0 &&
|
|
*src < MAX_BASIC_LATIN)
|
|
{
|
|
if (flags == UTF8_CATEGORY_ISBLANK)
|
|
{
|
|
if (*src == 0x09)
|
|
{
|
|
/* CHARACTER TABULATION */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else if (
|
|
*src == 0x20)
|
|
{
|
|
/* SPACE */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
else if (
|
|
flags == UTF8_CATEGORY_ISSPACE)
|
|
{
|
|
if (*src < 0x09 ||
|
|
*src > 0x20)
|
|
{
|
|
break;
|
|
}
|
|
else if (
|
|
*src <= 0x0D)
|
|
{
|
|
/* CHARACTER TABULATION ... CARRIAGE RETURN (CR) */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else if (
|
|
*src == 0x20)
|
|
{
|
|
/* SPACE */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
else if (
|
|
flags == UTF8_CATEGORY_ISXDIGIT)
|
|
{
|
|
if (*src < 0x30 ||
|
|
*src > 0x66)
|
|
{
|
|
break;
|
|
}
|
|
else if (
|
|
*src <= 0x39)
|
|
{
|
|
/* DIGIT ZERO ... DIGIT NINE */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else if (
|
|
*src >= 0x41 &&
|
|
*src <= 0x46)
|
|
{
|
|
/* LATIN CAPITAL LETTER A ... LATIN CAPITAL LETTER F */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else if (
|
|
*src >= 0x61)
|
|
{
|
|
/* LATIN SMALL LETTER A ... LATIN SMALL LETTER F */
|
|
|
|
src++;
|
|
src_size--;
|
|
|
|
continue;
|
|
}
|
|
else
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Read next code point */
|
|
|
|
offset = codepoint_read(src, src_size, &code_point);
|
|
|
|
/* Match General Category against flags */
|
|
|
|
general_category = PROPERTY_GET_GC(code_point);
|
|
if ((general_category & flags) == 0 &&
|
|
/* Check for the start of the next grapheme cluster */
|
|
((flags & UTF8_CATEGORY_IGNORE_GRAPHEME_CLUSTER) != 0 || (canonical_combining_class = PROPERTY_GET_CCC(code_point)) == CCC_NOT_REORDERED))
|
|
{
|
|
break;
|
|
}
|
|
|
|
/* Move source cursor */
|
|
|
|
if (offset > src_size)
|
|
{
|
|
break;
|
|
}
|
|
|
|
src += offset;
|
|
src_size -= offset;
|
|
}
|
|
|
|
return src - input;
|
|
} |