AutoHotkey Community

[wOxxOm]

A built-in function of searching binary data buffer (haystack) for occurence of another binary sequence (needle) without stopping at \x00 (NULL) chars is a blessing and it would execute about 1000000 (million) times faster than current spoofing of zeroes with spaces, which is crucial for even 100k files. Especially if it's written using asm 'scasb' + subsequent 'repe cmpsd', cx=len>>2, and final 'repe cmpsb', cx=len&&3 (IMHO)

something like:
InBuf(haystackVar-or-addr, needleVar-or-addr, uint haystackSize, uint needleSize, [ StartingPos = 1 ])
also BufGetPos

p.s. I'm not great at asm but having just written this wish I thought that I can take some on-the-fly-asm-in-AHK examples from the forum and try to make the asm code myself

[Lexikos]

[Laszlo]

If the search pattern is short, a simple search loop programmed in C gives you fast code. This can be included in an AHK script as a machine code function. Otherwise you need complex code for high speed search, so you might be better off using an external dll. If you cannot find a suitable one, a simple approach gives you short code at reasonable speed: compute the checksum S of the search pattern of length L, and then scan the data, updating a running checksum of the current L words. If their checksum C = S, check if the current L words are equal to the search pattern, otherwise shift your attention one word to the right in the data, by adding the newly included word to C and subtracting the leaving word (to update C). You could use more complex checksums, or randomized ones, to avoid rare problems, where many false positives are found in the data (C = S with not matching patterns).

[wOxxOm]

I've coded it in asm, it turned out to be easier than I though initially - Machine code binary buffer searching regardless of NULL