2006-11-28 14:19:18 +00:00
|
|
|
/* $Id$ */
|
|
|
|
|
2009-08-21 20:21:05 +00:00
|
|
|
/*
|
|
|
|
* This file is part of OpenTTD.
|
|
|
|
* OpenTTD is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2.
|
|
|
|
* OpenTTD 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 for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2008-05-06 15:11:33 +00:00
|
|
|
/** @file string.cpp Handling of C-type strings (char*). */
|
2007-04-04 01:35:16 +00:00
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
#include "stdafx.h"
|
2007-07-14 22:37:40 +00:00
|
|
|
#include "debug.h"
|
2007-12-25 09:48:53 +00:00
|
|
|
#include "core/alloc_func.hpp"
|
2008-10-28 14:42:31 +00:00
|
|
|
#include "core/math_func.hpp"
|
2008-01-07 14:23:25 +00:00
|
|
|
#include "string_func.h"
|
2006-11-28 14:19:18 +00:00
|
|
|
|
2008-01-13 01:21:35 +00:00
|
|
|
#include "table/control_codes.h"
|
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
#include <stdarg.h>
|
2009-03-15 00:32:18 +00:00
|
|
|
#include <ctype.h> /* required for tolower() */
|
2006-11-28 14:19:18 +00:00
|
|
|
|
2008-10-28 15:47:42 +00:00
|
|
|
/**
|
|
|
|
* Safer implementation of vsnprintf; same as vsnprintf except:
|
|
|
|
* - last instead of size, i.e. replace sizeof with lastof.
|
|
|
|
* - return gives the amount of characters added, not what it would add.
|
|
|
|
* @param str buffer to write to up to last
|
|
|
|
* @param last last character we may write to
|
|
|
|
* @param format the formatting (see snprintf)
|
|
|
|
* @param ap the list of arguments for the format
|
|
|
|
* @return the number of added characters
|
|
|
|
*/
|
|
|
|
static int CDECL vseprintf(char *str, const char *last, const char *format, va_list ap)
|
|
|
|
{
|
|
|
|
if (str >= last) return 0;
|
2009-04-06 10:05:36 +00:00
|
|
|
size_t size = last - str + 1;
|
2008-10-28 15:47:42 +00:00
|
|
|
return min((int)size, vsnprintf(str, size, format, ap));
|
|
|
|
}
|
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
void ttd_strlcat(char *dst, const char *src, size_t size)
|
|
|
|
{
|
|
|
|
assert(size > 0);
|
2008-10-29 16:30:41 +00:00
|
|
|
while (size > 0 && *dst != '\0') {
|
|
|
|
size--;
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
|
|
|
|
ttd_strlcpy(dst, src, size);
|
2006-11-28 14:19:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void ttd_strlcpy(char *dst, const char *src, size_t size)
|
|
|
|
{
|
|
|
|
assert(size > 0);
|
2008-10-29 16:30:41 +00:00
|
|
|
while (--size > 0 && *src != '\0') {
|
|
|
|
*dst++ = *src++;
|
|
|
|
}
|
2006-11-28 14:19:18 +00:00
|
|
|
*dst = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-01-10 00:31:47 +00:00
|
|
|
char *strecat(char *dst, const char *src, const char *last)
|
2006-11-28 14:19:18 +00:00
|
|
|
{
|
|
|
|
assert(dst <= last);
|
2008-10-29 16:30:41 +00:00
|
|
|
while (*dst != '\0') {
|
2006-11-28 14:19:18 +00:00
|
|
|
if (dst == last) return dst;
|
2008-10-29 16:30:41 +00:00
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
return strecpy(dst, src, last);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-01-10 00:31:47 +00:00
|
|
|
char *strecpy(char *dst, const char *src, const char *last)
|
2006-11-28 14:19:18 +00:00
|
|
|
{
|
|
|
|
assert(dst <= last);
|
2008-10-29 16:30:41 +00:00
|
|
|
while (dst != last && *src != '\0') {
|
|
|
|
*dst++ = *src++;
|
|
|
|
}
|
2006-11-28 14:19:18 +00:00
|
|
|
*dst = '\0';
|
2008-10-29 16:30:41 +00:00
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
if (dst == last && *src != '\0') {
|
2007-07-14 22:37:40 +00:00
|
|
|
#ifdef STRGEN
|
2006-11-28 14:19:18 +00:00
|
|
|
error("String too long for destination buffer");
|
2007-07-14 22:37:40 +00:00
|
|
|
#else /* STRGEN */
|
|
|
|
DEBUG(misc, 0, "String too long for destination buffer");
|
|
|
|
#endif /* STRGEN */
|
2006-11-28 14:19:18 +00:00
|
|
|
}
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-10-28 14:42:31 +00:00
|
|
|
char *CDECL str_fmt(const char *str, ...)
|
2006-11-28 14:19:18 +00:00
|
|
|
{
|
|
|
|
char buf[4096];
|
|
|
|
va_list va;
|
|
|
|
|
|
|
|
va_start(va, str);
|
2008-10-28 14:42:31 +00:00
|
|
|
int len = vseprintf(buf, lastof(buf), str, va);
|
2006-11-28 14:19:18 +00:00
|
|
|
va_end(va);
|
2008-10-28 14:42:31 +00:00
|
|
|
char *p = MallocT<char>(len + 1);
|
|
|
|
memcpy(p, buf, len + 1);
|
2006-11-28 14:19:18 +00:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-03-06 01:23:25 +00:00
|
|
|
void str_validate(char *str, const char *last, bool allow_newlines, bool ignore)
|
2006-11-28 14:19:18 +00:00
|
|
|
{
|
2009-03-06 01:23:25 +00:00
|
|
|
/* Assume the ABSOLUTE WORST to be in str as it comes from the outside. */
|
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
char *dst = str;
|
2009-03-06 01:23:25 +00:00
|
|
|
while (*str != '\0') {
|
|
|
|
size_t len = Utf8EncodedCharLen(*str);
|
|
|
|
/* If the character is unknown, i.e. encoded length is 0
|
|
|
|
* we assume worst case for the length check.
|
|
|
|
* The length check is needed to prevent Utf8Decode to read
|
|
|
|
* over the terminating '\0' if that happens to be placed
|
|
|
|
* within the encoding of an UTF8 character. */
|
|
|
|
if ((len == 0 && str + 4 > last) || str + len > last) break;
|
|
|
|
|
|
|
|
WChar c;
|
|
|
|
len = Utf8Decode(&c, str);
|
|
|
|
/* It's possible to encode the string termination character
|
|
|
|
* into a multiple bytes. This prevents those termination
|
|
|
|
* characters to be skipped */
|
|
|
|
if (c == '\0') break;
|
2006-11-28 14:19:18 +00:00
|
|
|
|
2009-02-21 00:47:59 +00:00
|
|
|
if (IsPrintable(c) && (c < SCC_SPRITE_START || c > SCC_SPRITE_END)) {
|
2006-11-28 14:19:18 +00:00
|
|
|
/* Copy the character back. Even if dst is current the same as str
|
|
|
|
* (i.e. no characters have been changed) this is quicker than
|
|
|
|
* moving the pointers ahead by len */
|
|
|
|
do {
|
|
|
|
*dst++ = *str++;
|
|
|
|
} while (--len != 0);
|
2009-01-18 13:12:57 +00:00
|
|
|
} else if (allow_newlines && c == '\n') {
|
|
|
|
*dst++ = *str++;
|
2006-11-28 14:19:18 +00:00
|
|
|
} else {
|
2009-01-18 13:12:57 +00:00
|
|
|
if (allow_newlines && c == '\r' && str[1] == '\n') {
|
|
|
|
str += len;
|
|
|
|
continue;
|
|
|
|
}
|
2006-11-28 14:19:18 +00:00
|
|
|
/* Replace the undesirable character with a question mark */
|
|
|
|
str += len;
|
2009-02-02 13:46:26 +00:00
|
|
|
if (!ignore) *dst++ = '?';
|
2006-11-28 14:19:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*dst = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void str_strip_colours(char *str)
|
|
|
|
{
|
|
|
|
char *dst = str;
|
|
|
|
WChar c;
|
|
|
|
size_t len;
|
|
|
|
|
|
|
|
for (len = Utf8Decode(&c, str); c != '\0'; len = Utf8Decode(&c, str)) {
|
|
|
|
if (c < SCC_BLUE || c > SCC_BLACK) {
|
|
|
|
/* Copy the character back. Even if dst is current the same as str
|
|
|
|
* (i.e. no characters have been changed) this is quicker than
|
|
|
|
* moving the pointers ahead by len */
|
|
|
|
do {
|
|
|
|
*dst++ = *str++;
|
|
|
|
} while (--len != 0);
|
|
|
|
} else {
|
|
|
|
/* Just skip (strip) the colour codes */
|
|
|
|
str += len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*dst = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Convert a given ASCII string to lowercase.
|
|
|
|
* NOTE: only support ASCII characters, no UTF8 fancy. As currently
|
|
|
|
* the function is only used to lowercase data-filenames if they are
|
|
|
|
* not found, this is sufficient. If more, or general functionality is
|
|
|
|
* needed, look to r7271 where it was removed because it was broken when
|
|
|
|
* using certain locales: eg in Turkish the uppercase 'I' was converted to
|
2007-04-04 01:35:16 +00:00
|
|
|
* '?', so just revert to the old functionality
|
|
|
|
* @param str string to convert */
|
2006-11-28 14:19:18 +00:00
|
|
|
void strtolower(char *str)
|
|
|
|
{
|
|
|
|
for (; *str != '\0'; str++) *str = tolower(*str);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Only allow certain keys. You can define the filter to be used. This makes
|
|
|
|
* sure no invalid keys can get into an editbox, like BELL.
|
|
|
|
* @param key character to be checked
|
|
|
|
* @param afilter the filter to use
|
|
|
|
* @return true or false depending if the character is printable/valid or not
|
|
|
|
*/
|
|
|
|
bool IsValidChar(WChar key, CharSetFilter afilter)
|
|
|
|
{
|
|
|
|
switch (afilter) {
|
2009-10-31 14:06:16 +00:00
|
|
|
case CS_ALPHANUMERAL: return IsPrintable(key);
|
|
|
|
case CS_NUMERAL: return (key >= '0' && key <= '9');
|
|
|
|
case CS_NUMERAL_SPACE: return (key >= '0' && key <= '9') || key == ' ';
|
|
|
|
case CS_ALPHA: return IsPrintable(key) && !(key >= '0' && key <= '9');
|
2006-11-28 14:19:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef WIN32
|
2008-01-02 18:42:51 +00:00
|
|
|
/* Since version 3.14, MinGW Runtime has snprintf() and vsnprintf() conform to C99 but it's not the case for older versions */
|
|
|
|
#if (__MINGW32_MAJOR_VERSION < 3) || ((__MINGW32_MAJOR_VERSION == 3) && (__MINGW32_MINOR_VERSION < 14))
|
2006-11-28 14:19:18 +00:00
|
|
|
int CDECL snprintf(char *str, size_t size, const char *format, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
va_start(ap, format);
|
|
|
|
ret = vsnprintf(str, size, format, ap);
|
|
|
|
va_end(ap);
|
|
|
|
return ret;
|
|
|
|
}
|
2008-01-02 18:42:51 +00:00
|
|
|
#endif /* MinGW Runtime < 3.14 */
|
2006-11-28 14:19:18 +00:00
|
|
|
|
|
|
|
#ifdef _MSC_VER
|
2007-01-13 13:06:18 +00:00
|
|
|
/* *nprintf broken, not POSIX compliant, MSDN description
|
|
|
|
* - If len < count, then len characters are stored in buffer, a null-terminator is appended, and len is returned.
|
|
|
|
* - If len = count, then len characters are stored in buffer, no null-terminator is appended, and len is returned.
|
|
|
|
* - If len > count, then count characters are stored in buffer, no null-terminator is appended, and a negative value is returned
|
|
|
|
*/
|
2006-11-28 14:19:18 +00:00
|
|
|
int CDECL vsnprintf(char *str, size_t size, const char *format, va_list ap)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
ret = _vsnprintf(str, size, format, ap);
|
2007-01-13 13:13:32 +00:00
|
|
|
if (ret < 0 || ret == size) str[size - 1] = '\0';
|
2006-11-28 14:19:18 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* _MSC_VER */
|
|
|
|
|
|
|
|
#endif /* WIN32 */
|
|
|
|
|
2008-10-28 14:42:31 +00:00
|
|
|
/**
|
|
|
|
* Safer implementation of snprintf; same as snprintf except:
|
|
|
|
* - last instead of size, i.e. replace sizeof with lastof.
|
|
|
|
* - return gives the amount of characters added, not what it would add.
|
|
|
|
* @param str buffer to write to up to last
|
|
|
|
* @param last last character we may write to
|
|
|
|
* @param format the formatting (see snprintf)
|
|
|
|
* @return the number of added characters
|
|
|
|
*/
|
|
|
|
int CDECL seprintf(char *str, const char *last, const char *format, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
|
|
|
|
va_start(ap, format);
|
|
|
|
int ret = vseprintf(str, last, format, ap);
|
|
|
|
va_end(ap);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
|
2007-01-13 13:47:57 +00:00
|
|
|
/** Convert the md5sum to a hexadecimal string representation
|
|
|
|
* @param buf buffer to put the md5sum into
|
|
|
|
* @param last last character of buffer (usually lastof(buf))
|
|
|
|
* @param md5sum the md5sum itself
|
|
|
|
* @return a pointer to the next character after the md5sum */
|
|
|
|
char *md5sumToString(char *buf, const char *last, const uint8 md5sum[16])
|
|
|
|
{
|
|
|
|
char *p = buf;
|
|
|
|
|
|
|
|
for (uint i = 0; i < 16; i++) {
|
2008-10-28 14:42:31 +00:00
|
|
|
p += seprintf(p, last, "%02X", md5sum[i]);
|
2007-01-13 13:47:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-11-28 14:19:18 +00:00
|
|
|
/* UTF-8 handling routines */
|
|
|
|
|
|
|
|
|
|
|
|
/* Decode and consume the next UTF-8 encoded character
|
|
|
|
* @param c Buffer to place decoded character.
|
|
|
|
* @param s Character stream to retrieve character from.
|
|
|
|
* @return Number of characters in the sequence.
|
|
|
|
*/
|
|
|
|
size_t Utf8Decode(WChar *c, const char *s)
|
|
|
|
{
|
|
|
|
assert(c != NULL);
|
|
|
|
|
2007-11-19 21:02:30 +00:00
|
|
|
if (!HasBit(s[0], 7)) {
|
2006-11-28 14:19:18 +00:00
|
|
|
/* Single byte character: 0xxxxxxx */
|
|
|
|
*c = s[0];
|
|
|
|
return 1;
|
|
|
|
} else if (GB(s[0], 5, 3) == 6) {
|
|
|
|
if (IsUtf8Part(s[1])) {
|
|
|
|
/* Double byte character: 110xxxxx 10xxxxxx */
|
|
|
|
*c = GB(s[0], 0, 5) << 6 | GB(s[1], 0, 6);
|
|
|
|
if (*c >= 0x80) return 2;
|
|
|
|
}
|
|
|
|
} else if (GB(s[0], 4, 4) == 14) {
|
|
|
|
if (IsUtf8Part(s[1]) && IsUtf8Part(s[2])) {
|
|
|
|
/* Triple byte character: 1110xxxx 10xxxxxx 10xxxxxx */
|
|
|
|
*c = GB(s[0], 0, 4) << 12 | GB(s[1], 0, 6) << 6 | GB(s[2], 0, 6);
|
|
|
|
if (*c >= 0x800) return 3;
|
|
|
|
}
|
|
|
|
} else if (GB(s[0], 3, 5) == 30) {
|
|
|
|
if (IsUtf8Part(s[1]) && IsUtf8Part(s[2]) && IsUtf8Part(s[3])) {
|
|
|
|
/* 4 byte character: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
|
|
|
|
*c = GB(s[0], 0, 3) << 18 | GB(s[1], 0, 6) << 12 | GB(s[2], 0, 6) << 6 | GB(s[3], 0, 6);
|
|
|
|
if (*c >= 0x10000 && *c <= 0x10FFFF) return 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-03-15 00:32:18 +00:00
|
|
|
/* DEBUG(misc, 1, "[utf8] invalid UTF-8 sequence"); */
|
2006-11-28 14:19:18 +00:00
|
|
|
*c = '?';
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Encode a unicode character and place it in the buffer
|
|
|
|
* @param buf Buffer to place character.
|
|
|
|
* @param c Unicode character to encode.
|
|
|
|
* @return Number of characters in the encoded sequence.
|
|
|
|
*/
|
|
|
|
size_t Utf8Encode(char *buf, WChar c)
|
|
|
|
{
|
|
|
|
if (c < 0x80) {
|
|
|
|
*buf = c;
|
|
|
|
return 1;
|
|
|
|
} else if (c < 0x800) {
|
|
|
|
*buf++ = 0xC0 + GB(c, 6, 5);
|
|
|
|
*buf = 0x80 + GB(c, 0, 6);
|
|
|
|
return 2;
|
|
|
|
} else if (c < 0x10000) {
|
|
|
|
*buf++ = 0xE0 + GB(c, 12, 4);
|
|
|
|
*buf++ = 0x80 + GB(c, 6, 6);
|
|
|
|
*buf = 0x80 + GB(c, 0, 6);
|
|
|
|
return 3;
|
|
|
|
} else if (c < 0x110000) {
|
|
|
|
*buf++ = 0xF0 + GB(c, 18, 3);
|
|
|
|
*buf++ = 0x80 + GB(c, 12, 6);
|
|
|
|
*buf++ = 0x80 + GB(c, 6, 6);
|
|
|
|
*buf = 0x80 + GB(c, 0, 6);
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
|
2009-03-15 00:32:18 +00:00
|
|
|
/* DEBUG(misc, 1, "[utf8] can't UTF-8 encode value 0x%X", c); */
|
2006-11-28 14:19:18 +00:00
|
|
|
*buf = '?';
|
|
|
|
return 1;
|
|
|
|
}
|
2007-03-05 00:45:56 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Properly terminate an UTF8 string to some maximum length
|
|
|
|
* @param s string to check if it needs additional trimming
|
|
|
|
* @param maxlen the maximum length the buffer can have.
|
|
|
|
* @return the new length in bytes of the string (eg. strlen(new_string))
|
|
|
|
* @NOTE maxlen is the string length _INCLUDING_ the terminating '\0'
|
|
|
|
*/
|
|
|
|
size_t Utf8TrimString(char *s, size_t maxlen)
|
|
|
|
{
|
|
|
|
size_t length = 0;
|
|
|
|
|
|
|
|
for (const char *ptr = strchr(s, '\0'); *s != '\0';) {
|
|
|
|
size_t len = Utf8EncodedCharLen(*s);
|
2007-03-10 00:26:19 +00:00
|
|
|
/* Silently ignore invalid UTF8 sequences, our only concern trimming */
|
|
|
|
if (len == 0) len = 1;
|
2007-03-05 00:45:56 +00:00
|
|
|
|
|
|
|
/* Take care when a hard cutoff was made for the string and
|
|
|
|
* the last UTF8 sequence is invalid */
|
|
|
|
if (length + len >= maxlen || (s + len > ptr)) break;
|
|
|
|
s += len;
|
|
|
|
length += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
*s = '\0';
|
|
|
|
return length;
|
2007-03-05 05:03:28 +00:00
|
|
|
}
|
2008-08-24 17:02:21 +00:00
|
|
|
|
|
|
|
#ifndef _GNU_SOURCE
|
|
|
|
#include "core/math_func.hpp"
|
|
|
|
char *strndup(const char *s, size_t len)
|
|
|
|
{
|
|
|
|
len = min(strlen(s), len);
|
|
|
|
char *tmp = CallocT<char>(len + 1);
|
|
|
|
memcpy(tmp, s, len);
|
|
|
|
return tmp;
|
|
|
|
}
|
2009-02-06 15:53:48 +00:00
|
|
|
#endif /* !_GNU_SOURCE */
|
2009-02-06 11:58:52 +00:00
|
|
|
|
2009-02-06 15:53:48 +00:00
|
|
|
#ifdef DEFINE_STRCASESTR
|
2009-02-06 11:58:52 +00:00
|
|
|
const char *strcasestr(const char *haystack, const char *needle)
|
|
|
|
{
|
|
|
|
size_t hay_len = strlen(haystack);
|
|
|
|
size_t needle_len = strlen(needle);
|
|
|
|
while (hay_len >= needle_len) {
|
|
|
|
if (strncasecmp(haystack, needle, needle_len) == 0) return haystack;
|
|
|
|
|
|
|
|
haystack++;
|
|
|
|
hay_len--;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
2009-02-06 15:53:48 +00:00
|
|
|
#endif /* DEFINE_STRCASESTR */
|