/* * Bittorrent Client using Qt and libtorrent. * Copyright (C) 2015 Vladimir Golovnev * Copyright (C) 2006 Christophe Dumez * * 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. * * In addition, as a special exception, the copyright holders give permission to * link this program with the OpenSSL project's "OpenSSL" library (or with * modified versions of it that use the same license as the "OpenSSL" library), * and distribute the linked executables. You must obey the GNU General Public * License in all respects for all of the code used other than "OpenSSL". If you * modify file(s), you may extend this exception to your version of the file(s), * but you are not obligated to do so. If you do not wish to do so, delete this * exception statement from your version. */ #include "string.h" #include #include #include #include #include #include #ifdef Q_OS_MAC #include #endif namespace { class NaturalCompare { public: explicit NaturalCompare(const Qt::CaseSensitivity caseSensitivity = Qt::CaseSensitive) : m_caseSensitivity(caseSensitivity) { #ifdef Q_OS_WIN // Without ICU library, QCollator uses the native API on Windows 7+. But that API // sorts older versions of μTorrent differently than the newer ones because the // 'μ' character is encoded differently and the native API can't cope with that. // So default to using our custom natural sorting algorithm instead. // See #5238 and #5240 // Without ICU library, QCollator doesn't support `setNumericMode(true)` on an OS older than Win7 #else m_collator.setNumericMode(true); m_collator.setCaseSensitivity(caseSensitivity); #endif } int operator()(const QString &left, const QString &right) const { #ifdef Q_OS_WIN return compare(left, right); #else return m_collator.compare(left, right); #endif } private: int compare(const QString &left, const QString &right) const { // Return value <0: `left` is smaller than `right` // Return value >0: `left` is greater than `right` // Return value =0: both strings are equal int posL = 0; int posR = 0; while (true) { if ((posL == left.size()) || (posR == right.size())) return (left.size() - right.size()); // when a shorter string is another string's prefix, shorter string place before longer string const QChar leftChar = (m_caseSensitivity == Qt::CaseSensitive) ? left[posL] : left[posL].toLower(); const QChar rightChar = (m_caseSensitivity == Qt::CaseSensitive) ? right[posR] : right[posR].toLower(); // Compare only non-digits. // Numbers should be compared as a whole // otherwise the string->int conversion can yield a wrong value if ((leftChar == rightChar) && !leftChar.isDigit()) { // compare next character ++posL; ++posR; } else if (leftChar.isDigit() && rightChar.isDigit()) { // Both are digits, compare the numbers const auto consumeNumber = [](const QString &str, int &pos) -> int { const int start = pos; while ((pos < str.size()) && str[pos].isDigit()) ++pos; return str.midRef(start, (pos - start)).toInt(); }; const int numL = consumeNumber(left, posL); const int numR = consumeNumber(right, posR); if (numL != numR) return (numL - numR); // String + digits do match and we haven't hit the end of both strings // then continue to consume the remainings } else { return (leftChar.unicode() - rightChar.unicode()); } } } QCollator m_collator; const Qt::CaseSensitivity m_caseSensitivity; }; } int Utils::String::naturalCompare(const QString &left, const QString &right, const Qt::CaseSensitivity caseSensitivity) { // provide a single `NaturalCompare` instance for easy use // https://doc.qt.io/qt-5/threads-reentrancy.html if (caseSensitivity == Qt::CaseSensitive) { #ifdef Q_OS_MAC // workaround for Apple xcode: https://stackoverflow.com/a/29929949 static QThreadStorage nCmp; if (!nCmp.hasLocalData()) nCmp.setLocalData(NaturalCompare(Qt::CaseSensitive)); return (nCmp.localData())(left, right); #else thread_local NaturalCompare nCmp(Qt::CaseSensitive); return nCmp(left, right); #endif } #ifdef Q_OS_MAC static QThreadStorage nCmp; if (!nCmp.hasLocalData()) nCmp.setLocalData(NaturalCompare(Qt::CaseInsensitive)); return (nCmp.localData())(left, right); #else thread_local NaturalCompare nCmp(Qt::CaseInsensitive); return nCmp(left, right); #endif } // to send numbers instead of strings with suffixes QString Utils::String::fromDouble(double n, int precision) { /* HACK because QString rounds up. Eg QString::number(0.999*100.0, 'f' ,1) == 99.9 ** but QString::number(0.9999*100.0, 'f' ,1) == 100.0 The problem manifests when ** the number has more digits after the decimal than we want AND the digit after ** our 'wanted' is >= 5. In this case our last digit gets rounded up. So for each ** precision we add an extra 0 behind 1 in the below algorithm. */ double prec = std::pow(10.0, precision); return QLocale::system().toString(std::floor(n * prec) / prec, 'f', precision); } // Implements constant-time comparison to protect against timing attacks // Taken from https://crackstation.net/hashing-security.htm bool Utils::String::slowEquals(const QByteArray &a, const QByteArray &b) { int lengthA = a.length(); int lengthB = b.length(); int diff = lengthA ^ lengthB; for (int i = 0; (i < lengthA) && (i < lengthB); i++) diff |= a[i] ^ b[i]; return (diff == 0); } // This is marked as internal in QRegExp.cpp, but is exported. The alternative would be to // copy the code from QRegExp::wc2rx(). QString qt_regexp_toCanonical(const QString &pattern, QRegExp::PatternSyntax patternSyntax); QString Utils::String::wildcardToRegex(const QString &pattern) { return qt_regexp_toCanonical(pattern, QRegExp::Wildcard); }