Public-Mirror/Textractor
1
0
Fork 1
mirror of https://github.com/Artikash/Textractor.git synced 2024-12-23 17:04:12 +08:00
Code Issues Projects Releases Wiki Activity

add method for searching all process memory

Browse Source
This commit is contained in:
Akash Mozumdar 2018-08-28 22:05:56 -04:00
parent 0b8e2a217b
commit 728c7a798b
2 changed files with 34 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
vnrhook/util/util.cc
View File

@ -3,8 +3,11 @@
// Branch: ITH_Engine/engine.cpp, revision 133
// See: http://ja.wikipedia.org/wiki/プロジェクト:美少女ゲーム系/ゲームエンジン
#include "common.h"
#include "util/util.h"
#include "ithsys/ithsys.h"
#include "main.h"
#include "growl.h"
namespace { // unnamed
@ -281,4 +284,33 @@ bool Util::SearchResourceString(LPCWSTR str)
return false;
}
DWORD Util::SearchMemory(const BYTE* bytes, unsigned short length, DWORD protect)
{
std::vector<std::pair<DWORD, DWORD>> validMemory;
for (BYTE* probe = NULL; (DWORD)probe < 0x80000000;) // end of user memory space
{
MEMORY_BASIC_INFORMATION info = {};
if (!VirtualQuery(probe, &info, sizeof(info)))
{
probe += 0x1000;
continue;
}
else
{
if (info.Protect > protect && !(info.Protect & PAGE_GUARD)) validMemory.push_back({ (DWORD)info.BaseAddress, info.RegionSize });
probe += info.RegionSize;
}
}
for (auto memory : validMemory)
// Artikash 7/14/2018: not sure, but I think this could throw read access violation if I dont subtract search_length
for (int i = 0; i < memory.second - length; ++i)
for (int j = 0; j <= length; ++j)
if (j == length) return memory.first + i; // not sure about this algorithm...
else if (*((BYTE*)memory.first + i + j) != *(bytes + j) && *(bytes + j) != 0x11) break; // 0x11 = wildcard
return 0;
}
// EOF

2
vnrhook/util/util.h
View File

@ -22,6 +22,8 @@ bool CheckFile(LPCWSTR name);
bool SearchResourceString(LPCWSTR str);
DWORD SearchMemory(const BYTE* bytes, unsigned short length, DWORD protect = PAGE_EXECUTE);
} // namespace Util
// EOF