100 lines
3.4 KiB
C++
100 lines
3.4 KiB
C++
#include "textthread.h"
|
|
#include "host.h"
|
|
#include "util.h"
|
|
|
|
extern const wchar_t* INVALID_CODEPAGE;
|
|
|
|
// return true if repetition found (see https://github.com/Artikash/Textractor/issues/40)
|
|
static bool RemoveRepetition(std::wstring& text)
|
|
{
|
|
wchar_t* end = text.data() + text.size();
|
|
for (int length = text.size() / 3; length > 6; --length)
|
|
if (memcmp(end - length * 3, end - length * 2, length * sizeof(wchar_t)) == 0 && memcmp(end - length * 3, end - length * 1, length * sizeof(wchar_t)) == 0)
|
|
return RemoveRepetition(text = std::wstring(end - length, length)), true;
|
|
return false;
|
|
}
|
|
|
|
TextThread::TextThread(ThreadParam tp, HookParam hp, std::optional<std::wstring> name) :
|
|
handle(threadCounter++),
|
|
name(name.value_or(Util::StringToWideString(hp.name).value())),
|
|
tp(tp),
|
|
hp(hp)
|
|
{}
|
|
|
|
void TextThread::Start()
|
|
{
|
|
CreateTimerQueueTimer(&timer, NULL, [](void* This, BOOLEAN) { ((TextThread*)This)->Flush(); }, this, 10, 10, WT_EXECUTELONGFUNCTION);
|
|
}
|
|
|
|
void TextThread::Stop()
|
|
{
|
|
timer = NULL;
|
|
}
|
|
|
|
void TextThread::AddSentence(std::wstring sentence)
|
|
{
|
|
queuedSentences->emplace_back(std::move(sentence));
|
|
}
|
|
|
|
void TextThread::Push(BYTE* data, int length)
|
|
{
|
|
if (length < 0) return;
|
|
std::scoped_lock lock(bufferMutex);
|
|
|
|
BYTE doubleByteChar[2];
|
|
if (length == 1) // doublebyte characters must be processed as pairs
|
|
if (leadByte) std::tie(doubleByteChar[0], doubleByteChar[1], data, length, leadByte) = std::tuple(leadByte, data[0], doubleByteChar, 2, 0);
|
|
else if (IsDBCSLeadByteEx(hp.codepage ? hp.codepage : Host::defaultCodepage, data[0])) std::tie(leadByte, length) = std::tuple(data[0], 0);
|
|
|
|
if (hp.type & USING_UNICODE) buffer.append((wchar_t*)data, length / sizeof(wchar_t));
|
|
else if (auto converted = Util::StringToWideString(std::string((char*)data, length), hp.codepage ? hp.codepage : Host::defaultCodepage)) buffer.append(converted.value());
|
|
else Host::AddConsoleOutput(INVALID_CODEPAGE);
|
|
if (hp.type & FULL_STRING) buffer.push_back(L'\n');
|
|
lastPushTime = GetTickCount();
|
|
|
|
if (filterRepetition)
|
|
{
|
|
if (std::all_of(buffer.begin(), buffer.end(), [&](wchar_t ch) { return repeatingChars.find(ch) != repeatingChars.end(); })) buffer.clear();
|
|
if (RemoveRepetition(buffer)) // sentence repetition detected, which means the entire sentence has already been received
|
|
{
|
|
if (hp.type & BLOCK_FLOOD) Host::RemoveHook(tp.processId, tp.addr);
|
|
repeatingChars = std::unordered_set(buffer.begin(), buffer.end());
|
|
AddSentence(std::move(buffer));
|
|
buffer.clear();
|
|
}
|
|
}
|
|
|
|
if (flushDelay == 0 && hp.type & FULL_STRING)
|
|
{
|
|
AddSentence(std::move(buffer));
|
|
buffer.clear();
|
|
}
|
|
}
|
|
|
|
void TextThread::Flush()
|
|
{
|
|
{
|
|
auto storage = this->storage.Acquire();
|
|
if (storage->size() > maxHistorySize) storage->erase(0, storage->size() - maxHistorySize); // https://github.com/Artikash/Textractor/issues/127#issuecomment-486882983
|
|
}
|
|
|
|
std::deque<std::wstring> sentences;
|
|
queuedSentences->swap(sentences);
|
|
int totalSize = 0;
|
|
for (auto& sentence : sentences)
|
|
{
|
|
totalSize += sentence.size();
|
|
sentence.erase(std::remove(sentence.begin(), sentence.end(), L'\0'));
|
|
if (Output(*this, sentence)) storage->append(sentence);
|
|
}
|
|
if (hp.type & BLOCK_FLOOD && totalSize > PIPE_BUFFER_SIZE) Host::RemoveHook(tp.processId, tp.addr);
|
|
|
|
std::scoped_lock lock(bufferMutex);
|
|
if (buffer.empty()) return;
|
|
if (buffer.size() > maxBufferSize || GetTickCount() - lastPushTime > flushDelay)
|
|
{
|
|
AddSentence(std::move(buffer));
|
|
buffer.clear();
|
|
}
|
|
}
|