"Original" Memory pointer base address query algorithm

Source: Internet
Author: User

First for all have NP,GPK and other protection engine, CE looks like will be killed
So write a pseudo-code algorithm that automatically queries the memory base address to prevent forgetting.

DWORD _begin = 0x40000000; For 32-bit

DWORD _end = 0x7FFFFFFF;

DWORD _offset = 0;

DWORD _OFFSETDP = 0xFF;

DWORD targetAddress = 0xBBBBB;

for (DWORD i = _begin; I <= _end;i++)

{

for (_offset = 0;k < _offsetdp;_offset++)

{

DWORD _address = readmemory (_begin + i);

DWORD _add2 = readmemory (_address + _offset);

if (targetAddress = = _add2 | | _address = = targetAddress)

{

Prinf ("Base:%x offset:%x", (_begin + i), _offset);

}

}

}

For multi-level offset, you only need to extend the number of recursion, you need to write the algorithm in detail, do not use multithreading or locks may crash
Please adjust your own mistakes, especially in other languages.

"Original" Memory pointer base address query algorithm

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.