Use BMH for memmem

[radare]

https://github.com/xerub/ibex64/blob/27f8cd2e185a883e6fd74df722e5ca643dccdd63/lib/memmem.c

[radare]

https://en.wikipedia.org/wiki/Boyer–Moore–Horspool_algorithm

[radare]

this will speedup r_str_str too http://old.blog.phusion.nl/2010/12/06/efficient-substring-searching/

[radare]

http://volnitsky.com/project/str_search/benchmark-src.tgz

[alvarofe]

If the algorithm is better +1 for my side.

[radare]

i think this will speedup RCons and SDB

[Maijin]

Check it's already partially used here - https://github.com/radare/radare2/blob/master/libr/search/search.c#L8

[MaskRay]

I try to bring back part of Boyer-Moore-Horspool at radareorg/radare2#8195 .

libr/core/cmd_search.c:static void do_string_search(RCore *core, struct search_parameters *param) {

the blocks are sent to the string matching algorithm by chunks of blocksize (defaults to 256). This harms performance.
Searching for needles cross the block boundary is tricky.

[radare]

the blocksize can be changed by the user. im aware thats a performance issue if the user does a wrong choice

[stale]

This issue has been automatically marked as stale because it has not had recent activity. Considering a lot has changed since its creation, we kindly ask you to check again if the issue you reported is still relevant in the current version of radare2. If it is, update this issue with a comment, otherwise it will be automatically closed if no further activity occurs. Thank you for your contributions.