134 lines
3.3 KiB
C++
134 lines
3.3 KiB
C++
// For license of this file, see <project-root-folder>/LICENSE.md.
|
|
|
|
//
|
|
// Copyright (C) 2011-2017 by Martin Rotter <rotter.martinos@gmail.com>
|
|
// Copyright (C) 2010-2014 by David Rosca <nowrep@gmail.com>
|
|
//
|
|
// RSS Guard 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.
|
|
//
|
|
// RSS Guard 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 RSS Guard. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#include "network-web/adblock/adblockrule.h"
|
|
#include "network-web/adblock/adblocksearchtree.h"
|
|
|
|
#include "definitions/definitions.h"
|
|
|
|
#include <QWebEngineUrlRequestInfo>
|
|
|
|
AdBlockSearchTree::AdBlockSearchTree() : m_root(new Node) {}
|
|
|
|
AdBlockSearchTree::~AdBlockSearchTree() {
|
|
deleteNode(m_root);
|
|
}
|
|
|
|
void AdBlockSearchTree::clear() {
|
|
deleteNode(m_root);
|
|
m_root = new Node;
|
|
}
|
|
|
|
bool AdBlockSearchTree::add(const AdBlockRule* rule) {
|
|
if (rule->m_type != AdBlockRule::StringContainsMatchRule) {
|
|
return false;
|
|
}
|
|
|
|
const QString filter = rule->m_matchString;
|
|
int len = filter.size();
|
|
|
|
if (len <= 0) {
|
|
qWarningNN << LOGSEC_ADBLOCK << "Inserting rule with filter len <= 0!";
|
|
return false;
|
|
}
|
|
|
|
Node* node = m_root;
|
|
|
|
for (int i = 0; i < len; ++i) {
|
|
const QChar c = filter.at(i);
|
|
Node* next = node->children.value(c);
|
|
|
|
if (next == nullptr) {
|
|
next = new Node;
|
|
next->c = c;
|
|
node->children[c] = next;
|
|
}
|
|
|
|
node = next;
|
|
}
|
|
|
|
node->rule = rule;
|
|
return true;
|
|
}
|
|
|
|
const AdBlockRule* AdBlockSearchTree::find(const QWebEngineUrlRequestInfo& request, const QString& domain, const QString& urlString) const {
|
|
int len = urlString.size();
|
|
|
|
if (len <= 0) {
|
|
return nullptr;
|
|
}
|
|
|
|
for (int i = 0; i < len; ++i) {
|
|
const AdBlockRule* rule = prefixSearch(request, domain, urlString, urlString.mid(i), len - i);
|
|
|
|
if (rule != nullptr) {
|
|
return rule;
|
|
}
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
const AdBlockRule* AdBlockSearchTree::prefixSearch(const QWebEngineUrlRequestInfo& request, const QString& domain,
|
|
const QString& urlString, const QString& choppedUrlString, int len) const {
|
|
if (len <= 0) {
|
|
return nullptr;
|
|
}
|
|
|
|
Node* node = m_root->children.value(choppedUrlString.at(0));
|
|
|
|
if (node == nullptr) {
|
|
return nullptr;
|
|
}
|
|
|
|
for (int i = 1; i < len; ++i) {
|
|
const QChar c = choppedUrlString.at(i);
|
|
|
|
if ((node->rule != nullptr) && node->rule->networkMatch(request, domain, urlString)) {
|
|
return node->rule;
|
|
}
|
|
|
|
node = node->children.value(c);
|
|
|
|
if (node == nullptr) {
|
|
return nullptr;
|
|
}
|
|
}
|
|
|
|
if ((node->rule != nullptr) && node->rule->networkMatch(request, domain, urlString)) {
|
|
return node->rule;
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
void AdBlockSearchTree::deleteNode(AdBlockSearchTree::Node* node) {
|
|
if (node == nullptr) {
|
|
return;
|
|
}
|
|
|
|
QHashIterator<QChar, Node*> i(node->children);
|
|
|
|
while (i.hasNext()) {
|
|
i.next();
|
|
deleteNode(i.value());
|
|
}
|
|
|
|
delete node;
|
|
}
|