2020-11-14 05:11:54 +01:00
|
|
|
/*
|
|
|
|
* SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
*
|
2023-01-17 12:26:43 -08:00
|
|
|
* Copyright (C) 2020-2023 The DOSBox Staging Team
|
2020-11-14 05:11:54 +01:00
|
|
|
*
|
|
|
|
* This program 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; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* 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 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 Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef DOSBOX_STRING_UTILS_H
|
|
|
|
#define DOSBOX_STRING_UTILS_H
|
|
|
|
|
2021-01-16 21:11:56 +01:00
|
|
|
#include "dosbox.h"
|
|
|
|
|
|
|
|
#include <cassert>
|
2020-12-10 17:54:27 +01:00
|
|
|
#include <cstdarg>
|
2020-11-14 05:11:54 +01:00
|
|
|
#include <cstring>
|
2023-01-05 09:26:29 -08:00
|
|
|
#include <limits.h>
|
2022-10-12 13:54:28 -07:00
|
|
|
#include <optional>
|
2020-11-14 05:11:54 +01:00
|
|
|
#include <string>
|
2022-08-13 14:06:30 +10:00
|
|
|
#include <vector>
|
2020-11-14 05:11:54 +01:00
|
|
|
|
2021-10-21 15:03:59 -07:00
|
|
|
template <size_t N>
|
|
|
|
int safe_sprintf(char (&dst)[N], const char *fmt, ...)
|
|
|
|
GCC_ATTRIBUTE(format(printf, 2, 3));
|
|
|
|
|
|
|
|
template <size_t N>
|
|
|
|
int safe_sprintf(char (&dst)[N], const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
va_start(args, fmt);
|
|
|
|
const int ret = vsnprintf(dst, N, fmt, args);
|
|
|
|
va_end(args);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2021-01-16 21:11:56 +01:00
|
|
|
/* Copy a string into C array
|
|
|
|
*
|
|
|
|
* This function copies string pointed by src to a fixed-size buffer dst.
|
|
|
|
* At most N bytes from src are copied, where N is size of dst. If exactly
|
|
|
|
* N bytes are copied, then terminating null byte is put into dst, thus
|
|
|
|
* buffer overrun is prevented.
|
|
|
|
*
|
|
|
|
* Function returns pointer to buffer to be compatible with strcpy.
|
|
|
|
*
|
|
|
|
* This is a safer drop-in replacement for strcpy function (when used to fill
|
|
|
|
* buffers, whose size is known at compilation time), however some caveats
|
|
|
|
* still apply:
|
|
|
|
*
|
|
|
|
* - src cannot be null, otherwise the behaviour is undefined
|
|
|
|
* - dst and src strings must not overlap, otherwise the behaviour is undefined
|
|
|
|
* - src string must be null-terminated, otherwise the behaviour is undefined
|
|
|
|
*
|
|
|
|
* Usage:
|
|
|
|
*
|
|
|
|
* char buffer[2];
|
|
|
|
* safe_strcpy(buffer, "abc");
|
|
|
|
* // buffer is filled with "a"
|
|
|
|
*/
|
|
|
|
template <size_t N>
|
|
|
|
char *safe_strcpy(char (&dst)[N], const char *src) noexcept
|
|
|
|
{
|
|
|
|
assert(src != nullptr);
|
|
|
|
assert(src < &dst[0] || src > &dst[N - 1]);
|
2021-10-21 15:03:59 -07:00
|
|
|
const auto rcode = safe_sprintf(dst, "%s", src);
|
|
|
|
return (rcode >= 0) ? &dst[0] : nullptr;
|
2021-01-16 21:11:56 +01:00
|
|
|
}
|
2020-12-10 17:54:27 +01:00
|
|
|
|
2021-01-16 21:11:56 +01:00
|
|
|
template <size_t N>
|
|
|
|
char *safe_strcat(char (&dst)[N], const char *src) noexcept
|
|
|
|
{
|
|
|
|
strncat(dst, src, N - strnlen(dst, N) - 1);
|
|
|
|
return &dst[0];
|
|
|
|
}
|
2020-12-10 17:54:27 +01:00
|
|
|
|
2021-08-24 08:41:09 -07:00
|
|
|
template <size_t N>
|
|
|
|
size_t safe_strlen(char (&str)[N]) noexcept
|
|
|
|
{
|
|
|
|
static_assert(N != 0, "zero-length arrays are not supported");
|
|
|
|
return strnlen(str, N - 1);
|
|
|
|
}
|
|
|
|
|
2023-05-27 23:49:07 -07:00
|
|
|
bool starts_with(const std::string_view str, const std::string_view prefix) noexcept;
|
2020-11-14 05:11:54 +01:00
|
|
|
|
2023-05-27 09:43:58 -07:00
|
|
|
bool ends_with(const std::string_view str, const std::string_view suffix) noexcept;
|
2021-07-19 10:37:11 -07:00
|
|
|
|
2021-09-17 03:23:53 -07:00
|
|
|
bool find_in_case_insensitive(const std::string &needle, const std::string &haystack);
|
|
|
|
|
2022-01-05 08:00:20 -08:00
|
|
|
// Safely terminate a C string at the given offset
|
|
|
|
//
|
|
|
|
// Convert code like: stuff[n] = 0;
|
|
|
|
// - "is stuff an integer array?"
|
|
|
|
// - "are we setting a counter back to 0?"
|
|
|
|
// - "is stuff a valid array?"
|
|
|
|
//
|
|
|
|
// To: terminate_str_at(stuff, n);
|
|
|
|
// which is self-documenting about the type (stuff is a string),
|
|
|
|
// intent (terminating), and where it's being applied (n);
|
|
|
|
//
|
|
|
|
template <typename T, typename INDEX_T>
|
|
|
|
void terminate_str_at(T *str, INDEX_T i) noexcept
|
|
|
|
{
|
|
|
|
// Check that we're only operating on bona-fide C strings
|
|
|
|
static_assert(std::is_same_v<T, char> || std::is_same_v<T, wchar_t>,
|
|
|
|
"Can only reset a *char or *wchar_t with the string-terminator");
|
|
|
|
|
|
|
|
// Check that we don't underflow with a negative index
|
|
|
|
assert(std::is_unsigned_v<INDEX_T> || i >= 0);
|
|
|
|
|
|
|
|
// Check that we don't dereferrence a null pointer
|
|
|
|
assert(str != nullptr);
|
|
|
|
str[i] = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
// reset a C string with the string-terminator character
|
|
|
|
template <typename T>
|
|
|
|
void reset_str(T *str) noexcept
|
|
|
|
{
|
|
|
|
terminate_str_at(str, 0);
|
|
|
|
}
|
|
|
|
|
2023-01-16 13:40:38 -08:00
|
|
|
// Is the ASCII character within the upper nibble?
|
|
|
|
constexpr bool is_upper_ascii(const char c)
|
|
|
|
{
|
|
|
|
constexpr uint8_t upper_ascii_first = 128;
|
|
|
|
constexpr uint8_t upper_ascii_last = 255;
|
|
|
|
|
|
|
|
#if (CHAR_MIN < 0) // char is signed
|
|
|
|
static_assert(std::is_signed_v<char> && CHAR_MAX < upper_ascii_last);
|
|
|
|
return static_cast<uint8_t>(c) >= upper_ascii_first;
|
|
|
|
|
|
|
|
#else // char is unsigned
|
|
|
|
static_assert(std::is_unsigned_v<char> && CHAR_MAX == upper_ascii_last);
|
|
|
|
return c >= upper_ascii_first;
|
|
|
|
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2023-01-05 09:26:29 -08:00
|
|
|
// Is it an ASCII control character?
|
|
|
|
constexpr bool is_control_ascii(const char c)
|
|
|
|
{
|
|
|
|
// clang-format off
|
|
|
|
// ASCII control characters span the bottom 5 bits plus the DEL character.
|
|
|
|
// Ref:https://en.wikipedia.org/wiki/ASCII#Control_characters
|
|
|
|
[[maybe_unused]]
|
|
|
|
constexpr char controls_first = 0b0'0000;
|
|
|
|
constexpr char controls_last = 0b1'1111;
|
|
|
|
constexpr char delete_char = 0b111'1111;
|
|
|
|
// clang-format on
|
|
|
|
|
|
|
|
#if (CHAR_MIN < 0) // char is signed
|
|
|
|
static_assert(std::is_signed_v<char> && CHAR_MAX == delete_char);
|
|
|
|
return (c >= controls_first && c <= controls_last) ||
|
|
|
|
#else // char is unsigned
|
|
|
|
static_assert(std::is_unsigned_v<char> && CHAR_MAX > delete_char);
|
|
|
|
return c <= controls_last ||
|
|
|
|
#endif
|
|
|
|
// return continues ...
|
|
|
|
c == delete_char;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Is the character within the printable ASCII range?
|
|
|
|
constexpr bool is_printable_ascii(const char c)
|
|
|
|
{
|
|
|
|
// The printable ASCII range spans the Space to ESC characters.
|
|
|
|
// Ref:https://en.wikipedia.org/wiki/ASCII#Printable_characters
|
|
|
|
constexpr char space_char = ' ';
|
|
|
|
constexpr char escape_char = 0b111'1110;
|
|
|
|
return c >= space_char && c <= escape_char;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Is the character within the standard ASCII range?
|
|
|
|
constexpr bool is_ascii(const char c)
|
|
|
|
{
|
|
|
|
return is_printable_ascii(c) || is_control_ascii(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Is the character with the extended printable ASCII range?
|
|
|
|
constexpr bool is_extended_printable_ascii(const char c)
|
|
|
|
{
|
|
|
|
// The extended ASCII range spans all 8-bits, leaving the extended
|
|
|
|
// printable portion of those being the non-control characters.
|
|
|
|
// Ref:https://en.wikipedia.org/wiki/ASCII#8-bit_codes
|
|
|
|
return !is_control_ascii(c);
|
|
|
|
}
|
|
|
|
|
2022-08-13 11:56:11 +10:00
|
|
|
bool is_hex_digits(const std::string_view s) noexcept;
|
2022-08-13 11:07:26 +10:00
|
|
|
|
2022-08-13 11:56:11 +10:00
|
|
|
bool is_digits(const std::string_view s) noexcept;
|
|
|
|
|
|
|
|
void strreplace(char *str, char o, char n);
|
|
|
|
char *ltrim(char *str);
|
|
|
|
char *rtrim(char *str);
|
|
|
|
char *trim(char *str);
|
|
|
|
char *upcase(char *str);
|
|
|
|
char *lowcase(char *str);
|
|
|
|
|
|
|
|
inline bool is_empty(const char *str) noexcept
|
|
|
|
{
|
|
|
|
return str[0] == '\0';
|
|
|
|
}
|
|
|
|
|
2022-10-02 13:00:55 -07:00
|
|
|
// case-insensitive comparisons
|
2022-10-12 08:44:05 -07:00
|
|
|
bool ciequals(const char a, const char b);
|
2023-02-04 10:06:31 -08:00
|
|
|
|
|
|
|
// case-insensitive comparison for combinations of
|
|
|
|
// const char *, const std::string&, and const string_view
|
|
|
|
template <typename T1, typename T2>
|
|
|
|
constexpr bool iequals(T1&& a, T2&& b)
|
|
|
|
{
|
|
|
|
using str_t1 = std::conditional_t<std::is_same_v<T1, const std::string&>,
|
|
|
|
const std::string&,
|
|
|
|
const std::string_view>;
|
|
|
|
|
|
|
|
using str_t2 = std::conditional_t<std::is_same_v<T2, const std::string&>,
|
|
|
|
const std::string&,
|
|
|
|
const std::string_view>;
|
|
|
|
|
|
|
|
const str_t1 str_a = std::forward<T1>(a);
|
|
|
|
const str_t2 str_b = std::forward<T2>(b);
|
|
|
|
|
|
|
|
return std::equal(str_a.begin(), str_a.end(), str_b.begin(), str_b.end(), ciequals);
|
|
|
|
}
|
2022-10-02 13:00:55 -07:00
|
|
|
|
2023-02-08 12:59:24 -08:00
|
|
|
// Performs a "natural" comparison between A and B, which is case-insensitive
|
|
|
|
// and treats number sequenences as whole numbers. Returns true if A < B. This
|
|
|
|
// function can be used with higher order sort rountines, like std::sort.
|
|
|
|
//
|
|
|
|
// Examples:
|
|
|
|
// - ("abc_2", "ABC_10") -> true, because abc_ matches and 2 < 10.
|
|
|
|
// - ("xyz_2", "ABC_10") -> false, because 'x' > 'a'.
|
|
|
|
// - ("abc123", "abc123=") -> true, simply because the first is shorter.
|
|
|
|
bool natural_compare(const std::string& a, const std::string& b);
|
|
|
|
|
|
|
|
char* strip_word(char*& cmd);
|
2022-08-13 11:56:11 +10:00
|
|
|
|
|
|
|
std::string replace(const std::string &str, char old_char, char new_char) noexcept;
|
|
|
|
void trim(std::string &str, const char trim_chars[] = " \r\t\f\n");
|
|
|
|
void upcase(std::string &str);
|
|
|
|
void lowcase(std::string &str);
|
|
|
|
void strip_punctuation(std::string &str);
|
|
|
|
|
|
|
|
// Split a string on an arbitrary character delimiter. Absent string content on
|
|
|
|
// either side of a delimiter is treated as an empty string. For example:
|
|
|
|
// split("abc:", ':') returns {"abc", ""}
|
|
|
|
// split(":def", ':') returns {"", "def"}
|
|
|
|
// split(":", ':') returns {"", ""}
|
|
|
|
// split("::", ':') returns {"", "", ""}
|
2023-05-16 21:48:09 -06:00
|
|
|
std::vector<std::string> split(std::string_view seq, char delim);
|
2022-08-13 11:56:11 +10:00
|
|
|
|
|
|
|
// Split a string on whitespace, where whitespace can be any of the following:
|
|
|
|
// ' ' (0x20) space (SPC)
|
|
|
|
// '\t' (0x09) horizontal tab (TAB)
|
|
|
|
// '\n' (0x0a) newline (LF)
|
|
|
|
// '\v' (0x0b) vertical tab (VT)
|
|
|
|
// '\f' (0x0c) feed (FF)
|
|
|
|
// '\r' (0x0d) carriage return (CR)
|
|
|
|
// Absent string content on either side of a delimiter is omitted. For example:
|
|
|
|
// split("abc") returns {"abc"}
|
|
|
|
// split(" a b c ") returns {"a", "b", "c"}
|
|
|
|
// split("\t \n abc \r \v def \f \v ") returns {"abc", "def"}
|
|
|
|
// split("a\tb\nc\vd e\rf") returns {"a", "b", "c", "d", "e", "f"}
|
|
|
|
// split(" ") returns {}
|
|
|
|
// split(" ") returns {}
|
2023-05-16 21:48:09 -06:00
|
|
|
std::vector<std::string> split(std::string_view seq);
|
2022-08-13 11:07:26 +10:00
|
|
|
|
2023-02-08 13:00:13 -08:00
|
|
|
std::string join_with_commas(const std::vector<std::string>& items,
|
2023-02-09 17:40:38 -08:00
|
|
|
const std::string_view and_conjunction = "and",
|
|
|
|
const std::string_view end_punctuation = ".");
|
2022-08-25 20:29:23 +02:00
|
|
|
|
2022-08-28 10:19:17 -07:00
|
|
|
// Clear the language if it's set to the POSIX default
|
|
|
|
void clear_language_if_default(std::string &language);
|
|
|
|
|
2022-08-25 20:29:23 +02:00
|
|
|
// Get recommended DOS code page to render the UTF-8 strings to. This
|
|
|
|
// might not be the code page set using KEYB command, for example due
|
|
|
|
// to emulated hardware limitations, or duplicated code page numbers
|
2023-04-17 22:41:14 +02:00
|
|
|
uint16_t get_utf8_code_page();
|
|
|
|
|
|
|
|
// Convert the UTF-8 string to the format intended for display inside emulated
|
|
|
|
// environment. Code page '0' means a pure 7-bit ASCII. Function without
|
|
|
|
// code_page parameter uses current DOS code page.
|
|
|
|
// Return value 'false' means there were problems with string decoding or
|
|
|
|
// rendering, but the overall output should still be sane.
|
|
|
|
bool utf8_to_dos(const std::string& str_in, std::string& str_out);
|
|
|
|
bool utf8_to_dos(const std::string& str_in, std::string& str_out,
|
|
|
|
const uint16_t code_page);
|
|
|
|
// Similarly, convert the opposite way
|
|
|
|
void dos_to_utf8(const std::string& str_in, std::string& str_out);
|
|
|
|
void dos_to_utf8(const std::string& str_in, std::string& str_out,
|
|
|
|
const uint16_t code_page);
|
2022-08-25 20:29:23 +02:00
|
|
|
|
2022-10-12 13:54:28 -07:00
|
|
|
// Parse a value from the string, clamp the result within the given min and max
|
|
|
|
// values, and return it as a float. This API should give us enough numerical
|
|
|
|
// range and accuracy for any text-based inputs.
|
|
|
|
//
|
|
|
|
// For example:
|
|
|
|
// - parse_value("101", 0, 100) return 100.0f.
|
|
|
|
// - parse_value("x10", 0, 100) return empty.
|
|
|
|
// - parse_value("txt", 0, 100) return empty.
|
|
|
|
// - parse_value("", 0, 100) return empty.
|
|
|
|
//
|
|
|
|
// To use it, check if the result then access it:
|
|
|
|
// const auto val = parse_value(s, ...);
|
|
|
|
// if (val)
|
|
|
|
// do_something(*val)
|
|
|
|
// else
|
|
|
|
// log_warning("%s was invalid", s.c_str());
|
|
|
|
//
|
|
|
|
// Alternatively, scope the value inside the if/else
|
|
|
|
// if (const auto v = parse_value(s, ...); v)
|
|
|
|
// do_something(*v)
|
|
|
|
// else
|
|
|
|
// log_warning("%s was invalid", s.c_str());
|
|
|
|
//
|
2023-05-27 12:20:27 -07:00
|
|
|
std::optional<float> parse_value(const std::string_view s,
|
|
|
|
const float min_value, const float max_value);
|
2022-10-12 13:54:28 -07:00
|
|
|
|
|
|
|
// parse_value clamped between 0 and 100
|
2023-05-27 12:20:27 -07:00
|
|
|
std::optional<float> parse_percentage(const std::string_view s);
|
2022-10-12 13:54:28 -07:00
|
|
|
|
|
|
|
// Parse a value from a character-prefixed string, clamp the result within the
|
|
|
|
// given min and max values, and return it as a float. This API should give us
|
|
|
|
// enough numerical range and accuracy for any text-based inputs.
|
|
|
|
//
|
|
|
|
// For example:
|
|
|
|
// - parse_prefixed_value('x', "x101", 0, 100) return 100.0f.
|
|
|
|
// - parse_prefixed_value('X', "x101", 0, 100) return 100.0f.
|
|
|
|
// - parse_prefixed_value('y', "x101", 0, 100) return empty.
|
|
|
|
// - parse_prefixed_value('y', "1000", 0, 100) return empty.
|
|
|
|
// - parse_prefixed_value('y', "text", 0, 100) return empty.
|
|
|
|
//
|
|
|
|
// To use it, check if the result then access it:
|
|
|
|
// const auto val = parse_prefixed_value(...);
|
|
|
|
// if (val)
|
|
|
|
// do_something(*val);
|
|
|
|
// else
|
|
|
|
// log_warning("%s was invalid", s.c_str());
|
|
|
|
//
|
|
|
|
// Alternatively, scope the value inside the if/else
|
|
|
|
// if (const auto v = parse_prefixed_value(...); v)
|
|
|
|
// do_something(*v)
|
|
|
|
// else
|
|
|
|
// log_warning("%s was invalid", s.c_str());
|
|
|
|
//
|
|
|
|
std::optional<float> parse_prefixed_value(const char prefix, const std::string &s,
|
|
|
|
const float min_value,
|
|
|
|
const float max_value);
|
|
|
|
|
|
|
|
// parse_prefixed_value clamped between 0 and 100
|
|
|
|
std::optional<float> parse_prefixed_percentage(const char prefix, const std::string &s);
|
|
|
|
|
2022-11-26 13:15:54 +01:00
|
|
|
// tries to convert string to integer,
|
|
|
|
// returns value only if succeeded
|
|
|
|
std::optional<int> to_int(const std::string& value);
|
|
|
|
|
2020-11-14 05:11:54 +01:00
|
|
|
#endif
|