Posted: Wed Jun 17, 2020 11:18 am Post subject: AoB scan vs pointer scan speed
What's the speed of pointer scan vs aob scan? If I have an address that often changes (and the pointer has to be re-scanned often) would it make aob "too slow"? I want to upgrade my application to use aob instead of pointers so I wouldn't have to rescan for pointers every patch, but I'm worried about efficiency.
Let's say I have ~50 pointers that need to be re-traversed every hour, and ~10 that need to be re-traversed every few minutes. Would switching to aob make a noticeable speed difference?
Sorry, I gave an incomplete example yesterday. The reason I'm worried about speed is, when there's a need to update the pointer it needs to be done quickly (the application has to react fast) and I guess doing AoB scan requires to search through the entire target application's memory until a pattern is found. So that would take seconds, right? Even if it's periodically every few minutes it still has to be done in short time, so would AoB work for that or should I stick to pointers?
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