42dc673fa5
Adds the core implementation of the new search. The rough architecture is the following: A search for a certain type of information (strings, bytes, keys etc.) creates a collections of items to search for (byte patterns, regular expressions etc.). Then specifies some settings how the search (number of threads, maxum hits...) and the finding is performed (string length, inverse match etc.). It also defines a search space, which is currently only the IO buffer. But can be anything in the future, like a graphs or the knowledge base. The search splits up the search space into windows (for IO: address ranges) and dispatches each search window into a 'find()' thread. The 'find()' handler (provided by a specific search implementation) checks the given window and produces search hits matching the elements in the search collection. The main search handler collects the hits of the dispatched workers and returns them to the user. Note: The byte and string search implementations are added in the next two commits. Part 6/9. Likely won't build in between parts. Co-authored-by: wargio <deroad@kumo.xn--q9jyb4c> |
||
|---|---|---|
| .. | ||
| blob | ||
| man | ||
| rizin | ||
| rz-asm | ||
| rz-ax | ||
| rz-bin | ||
| rz-diff | ||
| rz-find | ||
| rz-gg | ||
| rz-hash | ||
| rz-run | ||
| rz-sign | ||
| rz-test | ||
| meson.build | ||