mirror of
https://github.com/libretro/scummvm.git
synced 2024-12-15 14:18:37 +00:00
389 lines
8.7 KiB
C++
389 lines
8.7 KiB
C++
/* ScummVM - Graphic Adventure Engine
|
|
*
|
|
* ScummVM is the legal property of its developers, whose names
|
|
* are too numerous to list here. Please refer to the COPYRIGHT
|
|
* file distributed with this source distribution.
|
|
*
|
|
* 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 3 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, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
*/
|
|
|
|
/**
|
|
* Copyright (C) 2011 by Ben Noordhuis <info@bnoordhuis.nl>
|
|
*
|
|
* 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 "common/punycode.h"
|
|
#include "common/debug.h"
|
|
#include "common/tokenizer.h"
|
|
#include "common/util.h"
|
|
|
|
namespace Common {
|
|
|
|
/* punycode parameters, see http://tools.ietf.org/html/rfc3492#section-5 */
|
|
#define BASE 36
|
|
#define TMIN 1
|
|
#define TMAX 26
|
|
#define SKEW 38
|
|
#define DAMP 700
|
|
#define INITIAL_N 128
|
|
#define INITIAL_BIAS 72
|
|
#define SMAX 2147483647 // maximum Unicode code point
|
|
|
|
#define SPECIAL_SYMBOLS "/\":*|\\?%<>"
|
|
|
|
static uint32 adapt_bias(uint32 delta, unsigned n_points, int is_first) {
|
|
uint32 k;
|
|
|
|
delta /= is_first ? DAMP : 2;
|
|
delta += delta / n_points;
|
|
|
|
/* while delta > 455: delta /= 35 */
|
|
for (k = 0; delta > ((BASE - TMIN) * TMAX) / 2; k += BASE) {
|
|
delta /= (BASE - TMIN);
|
|
}
|
|
|
|
return k + (((BASE - TMIN + 1) * delta) / (delta + SKEW));
|
|
}
|
|
|
|
static char encode_digit(int c) {
|
|
assert(c >= 0 && c <= BASE - TMIN);
|
|
if (c > 25) {
|
|
return c + 22; /* '0'..'9' */
|
|
} else {
|
|
return c + 0x61; /* 'a'..'z' */
|
|
}
|
|
}
|
|
|
|
/* Encode as a generalized variable-length integer. Returns number of bytes written. */
|
|
static String encode_var_int(const size_t bias, const size_t delta) {
|
|
size_t k, q, t;
|
|
String dst;
|
|
|
|
k = BASE;
|
|
q = delta;
|
|
|
|
while (true) {
|
|
if (k <= bias) {
|
|
t = TMIN;
|
|
} else if (k >= bias + TMAX) {
|
|
t = TMAX;
|
|
} else {
|
|
t = k - bias;
|
|
}
|
|
|
|
if (q < t) {
|
|
break;
|
|
}
|
|
|
|
dst += encode_digit(t + (q - t) % (BASE - t));
|
|
|
|
q = (q - t) / (BASE - t);
|
|
k += BASE;
|
|
}
|
|
|
|
dst += encode_digit(q);
|
|
|
|
return dst;
|
|
}
|
|
|
|
static size_t decode_digit(uint32 v) {
|
|
if (Common::isDigit(v)) {
|
|
return 26 + (v - '0');
|
|
}
|
|
if (Common::isLower(v)) {
|
|
return v - 'a';
|
|
}
|
|
if (Common::isUpper(v)) {
|
|
return v - 'A';
|
|
}
|
|
return SMAX;
|
|
}
|
|
|
|
String punycode_encode(const U32String &src) {
|
|
size_t srclen = src.size();
|
|
size_t h = 0, si;
|
|
String dst = "xn--";
|
|
|
|
for (si = 0; si < srclen; si++) {
|
|
if (src[si] < 128) {
|
|
dst += src[si];
|
|
h++;
|
|
}
|
|
}
|
|
|
|
size_t b = h;
|
|
|
|
// If every character is ASCII, return the original string.
|
|
if (h == srclen) {
|
|
// If string ends with space or dot, still punycode it
|
|
// because certain FSes do not support files with those
|
|
// endings
|
|
if (src[h - 1] == ' ' || src[h - 1] == '.')
|
|
return dst + '-';
|
|
|
|
return src;
|
|
}
|
|
|
|
// If we have any ASCII characters, add '-' to separate them from
|
|
// the non-ASCII character insertions.
|
|
if (h > 0)
|
|
dst += "-";
|
|
|
|
size_t n = INITIAL_N;
|
|
size_t bias = INITIAL_BIAS;
|
|
size_t delta = 0;
|
|
size_t m;
|
|
|
|
for (; h < srclen; n++, delta++) {
|
|
/* Find next smallest non-basic code point. */
|
|
for (m = SMAX, si = 0; si < srclen; si++) {
|
|
if (src[si] >= n && src[si] < m) {
|
|
m = src[si];
|
|
}
|
|
}
|
|
|
|
if ((m - n) > (SMAX - delta) / (h + 1)) {
|
|
/* OVERFLOW */
|
|
warning("punycode_encode: overflow1");
|
|
return src;
|
|
}
|
|
|
|
delta += (m - n) * (h + 1);
|
|
n = m;
|
|
|
|
for (si = 0; si < srclen; si++) {
|
|
if (src[si] < n) {
|
|
if (++delta == 0) {
|
|
/* OVERFLOW */
|
|
warning("punycode_encode: overflow2");
|
|
return src;
|
|
}
|
|
} else if (src[si] == n) {
|
|
dst += encode_var_int(bias, delta);
|
|
bias = adapt_bias(delta, h + 1, h == b);
|
|
delta = 0;
|
|
h++;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Return how many Unicode code points were converted. */
|
|
return dst;
|
|
}
|
|
|
|
bool punycode_hasprefix(const String &src) {
|
|
return src.hasPrefix("xn--");
|
|
}
|
|
|
|
bool punycode_needEncode(const String &src) {
|
|
for (uint si = 0; si < src.size(); si++) {
|
|
if (src[si] & 0x80 || src[si] < 0x20 || strchr(SPECIAL_SYMBOLS, src[si])) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
// If name ends with space or dot, we have to encode it
|
|
if (src[src.size() - 1] == ' ' || src[src.size() - 1] == '.')
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
U32String punycode_decode(const String &src1) {
|
|
if (!src1.hasPrefix("xn--"))
|
|
return src1;
|
|
|
|
String src(&src1.c_str()[4]); // Skip the prefix for simplification
|
|
int srclen = src.size();
|
|
|
|
/* Ensure that the input contains only ASCII characters. */
|
|
for (int si = 0; si < srclen; si++) {
|
|
if (src[si] & 0x80) {
|
|
return src1;
|
|
}
|
|
}
|
|
|
|
size_t di = src.findLastOf('-');
|
|
|
|
// If we have no '-', the entire string is non-ASCII character insertions.
|
|
if (di == String::npos)
|
|
di = 0;
|
|
|
|
U32String dst;
|
|
|
|
for (size_t i = 0; i < di; i++) {
|
|
dst += src[i];
|
|
}
|
|
|
|
size_t b = di;
|
|
size_t i = 0;
|
|
size_t n = INITIAL_N;
|
|
size_t bias = INITIAL_BIAS;
|
|
|
|
for (int si = b + (b > 0 ? 1 : 0); si < srclen; di++) {
|
|
size_t org_i = i;
|
|
|
|
for (size_t w = 1, k = BASE; true; k += BASE) {
|
|
size_t digit = decode_digit(src[si++]);
|
|
|
|
if (digit == SMAX) {
|
|
warning("punycode_decode: incorrect digit");
|
|
return src1;
|
|
}
|
|
|
|
if (digit > (SMAX - i) / w) {
|
|
/* OVERFLOW */
|
|
warning("punycode_decode: overflow1");
|
|
return src1;
|
|
}
|
|
|
|
i += digit * w;
|
|
size_t t;
|
|
|
|
if (k <= bias) {
|
|
t = TMIN;
|
|
} else if (k >= bias + TMAX) {
|
|
t = TMAX;
|
|
} else {
|
|
t = k - bias;
|
|
}
|
|
|
|
if (digit < t) {
|
|
break;
|
|
}
|
|
|
|
if (w > SMAX / (BASE - t)) {
|
|
/* OVERFLOW */
|
|
warning("punycode_decode: overflow2");
|
|
return src1;
|
|
}
|
|
|
|
w *= BASE - t;
|
|
}
|
|
|
|
bias = adapt_bias(i - org_i, di + 1, org_i == 0);
|
|
|
|
if (i / (di + 1) > SMAX - n) {
|
|
/* OVERFLOW */
|
|
warning("punycode_decode: overflow3");
|
|
return src1;
|
|
}
|
|
|
|
n += i / (di + 1);
|
|
i %= (di + 1);
|
|
|
|
U32String dst1(dst.c_str(), i);
|
|
dst1 += (u32char_type_t)n;
|
|
dst1 += U32String(&dst.c_str()[i]);
|
|
dst = dst1;
|
|
i++;
|
|
}
|
|
|
|
return dst;
|
|
}
|
|
|
|
String punycode_encodefilename(const U32String &src) {
|
|
U32String dst;
|
|
|
|
for (uint i = 0; i < src.size(); i++) {
|
|
if (src[i] == 0x81) { // In case we have our escape character present
|
|
dst += 0x81;
|
|
dst += 0x79;
|
|
// Encode special symbols and non-printables
|
|
} else if ((src[i] < 0x80 && strchr(SPECIAL_SYMBOLS, (byte)src[i])) || src[i] < 0x20) {
|
|
dst += 0x81;
|
|
dst += src[i] + 0x80;
|
|
} else {
|
|
dst += src[i];
|
|
}
|
|
}
|
|
|
|
return punycode_encode(dst);
|
|
}
|
|
|
|
U32String punycode_decodefilename(const String &src1) {
|
|
U32String dst;
|
|
U32String src = punycode_decode(src1);
|
|
|
|
// Check if the string did not change which could be
|
|
// also on decoding failure
|
|
if (src == src1)
|
|
return src;
|
|
|
|
for (uint i = 0; i < src.size(); i++) {
|
|
if (src[i] == 0x81 && i + 1 < src.size()) {
|
|
i++;
|
|
if (src[i] == 0x79)
|
|
dst += 0x81;
|
|
else
|
|
dst += src[i] - 0x80;
|
|
} else {
|
|
dst += src[i];
|
|
}
|
|
}
|
|
|
|
return dst;
|
|
}
|
|
|
|
Path punycode_decodepath(const Path &src) {
|
|
StringTokenizer tok(src.rawString(), Common::String(DIR_SEPARATOR));
|
|
String res;
|
|
|
|
while (!tok.empty()) {
|
|
res += punycode_decodefilename(tok.nextToken());
|
|
if (!tok.empty())
|
|
res += DIR_SEPARATOR;
|
|
}
|
|
|
|
return Path(res, DIR_SEPARATOR);
|
|
}
|
|
|
|
Path punycode_encodepath(const Path &src) {
|
|
StringTokenizer tok(src.rawString(), Common::String(DIR_SEPARATOR));
|
|
String res;
|
|
|
|
while (!tok.empty()) {
|
|
String part = tok.nextToken();
|
|
if (punycode_needEncode(part))
|
|
res += punycode_encodefilename(part);
|
|
else
|
|
res += part;
|
|
|
|
if (!tok.empty())
|
|
res += DIR_SEPARATOR;
|
|
}
|
|
|
|
return Path(res, DIR_SEPARATOR);
|
|
}
|
|
|
|
} // end of namespace Common
|