 |
Cheat Engine The Official Site of Cheat Engine
|
| View previous topic :: View next topic |
| Author |
Message |
grasmanek94 Master Cheater
Reputation: 0
Joined: 03 Jun 2008 Posts: 283 Location: The Netherlands
|
Posted: Tue Jun 04, 2013 3:10 pm Post subject: Calculate pointer path between pointer and address? |
|
|
Well, I have a pointer of, for example:
[[[[[[[CE98EC]+D8]+40]+6C]+10]+1C]+4]
which points to the base of a unit structure (position,health, some other pointers I did not analyse).
now, I have address, for example 0x0F600000, and I want to find/check if a pointer to it from my previous pointer (exists?):
[[[[[[[CE98EC]+D8]+40]+6C]+10]+1C]+4]+ xxxxxxxxxxxxxxx -> 0x0F600000
Is this doable in Cheat Engine? If yes, how?
Maybe with Structure Spider? I can't find any tutorial on it, I don't know where to input my base offsets. Or if inputting as base the last address of the pointer, where do I input the address I'm looking for?
|
|
| Back to top |
|
 |
Gniarf Grandmaster Cheater Supreme
Reputation: 43
Joined: 12 Mar 2012 Posts: 1285
|
Posted: Tue Jun 04, 2013 3:57 pm Post subject: Re: Calculate pointer path between pointer and address? |
|
|
| grasmanek94 wrote: | | Is this doable in Cheat Engine? | Yes
| grasmanek94 wrote: | | If yes, how? | Use the pointerscanner and scan for address 0F600000 (pointer level 7 or greater), the do a rescan specifying "base must be in range" CE98Eb to CE98Ed, and "must start with offsets" D8,40,6C,10,1C,4. It's simple, but should take a while due to the level of the pointer you're searching, so consider at least finding the last offset manually via debugger.
One alternate method is to note the value of "[[[[[[CE98EC]+D8]+40]+6C]+10]+1C]+4" (for example 0x12345678), do low level pointerscan (like level 1 to 3) for address 0x0F600000, specifying "Only find paths with a static address = OFF". Then do a rescan specifying "base must be in range" 0x12345677 to 0x12345679. Problem is that as soon as [[[[[[CE98EC]+D8]+40]+6C]+10]+1C]+4 gets reallocated your .ptr file becomes useless, so you can't rescan anymore.
Edit after your edit: that's what you call "inputting as base the last address of the pointer"
|
|
| Back to top |
|
 |
Dark Byte Site Admin
Reputation: 471
Joined: 09 May 2003 Posts: 25838 Location: The netherlands
|
Posted: Tue Jun 04, 2013 4:38 pm Post subject: |
|
|
The structure spider also works
Find the address [[[[[[CE98EC]+D8]+40]+6C]+10]+1C]+4 points to and fill that in as the base address of the left column
Then tick "pointer must be in range" and fill in as range "0F600000" and "0F600000"
Then do a data scan and it'll scan from the given base address and show all paths that end in f600000 from that base address up to the max given level
Now, when you've found it, you can add those offsets to the old pointer
_________________
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 |
|
| Back to top |
|
 |
grasmanek94 Master Cheater
Reputation: 0
Joined: 03 Jun 2008 Posts: 283 Location: The Netherlands
|
Posted: Tue Jun 04, 2013 5:40 pm Post subject: |
|
|
ah yep that works, than you guys for your input
|
|
| Back to top |
|
 |
|
|
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
|
|