Posted: Mon Jun 29, 2015 4:41 am Post subject: Why is rescanning pointers so slow?
I'm scanning for static pointers of which there is a total count of 3,550,612,230. The initial scan took about 10-15 minutes or so but the second scan is taking hours.
I've found this to be the case repeatedly when the number of pointers is exceptionally large. But what I don't understand is why a second scan takes so long. Is the code for this resizing the array every time it removes an entry or something?
Joined: 09 May 2003 Posts: 25262 Location: The netherlands
Posted: Mon Jun 29, 2015 5:40 am Post subject:
The initial scan is fast because it doesn't have to verify that the last 4 or 5 offsets are correct. It only looks for a base address that matches the last entry in the current offset list.
A rescan has to verify every single offset of every single pointer in the list
And it can't make the same assumption that because the offsets of the previous entry are the same that they don't need to be checked. One change in the pointer in any offset can change the outcome of the pointer
Anyhow, next version you can do an rescan during the initial scan if you've made a snapshot of a previous run where you found the address. It greatly reduces the number of results found. (It will eat up about as much RAM as the game itself took up, so get more RAM) _________________
Do not ask me about online cheats. I don't know any and wont help finding them.
Like my help? Join me on Patreon so i can keep helping
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum You cannot attach files in this forum You can download files in this forum