A simple & fast hex searching and patching tool

Based on anchored_memchr, a stride-anchored substring search by EshayDev that advances by the pattern length and, at each anchor, uses a per-byte inverted index of the pattern to generate candidate alignments, verifying each with memcmp.

git clone https://github.com/Antibioticss/xsp.git --recursive
cd xsp
mkdir build && cd build
cmake .. && cmake --build .

xsp - hex search & patch tool
usage: xsp [options] hex1 [hex2]
options:
  -f, --file <file>         path to the file to patch
  -r, --range <range>       range of the matches, eg: '0,-1'
  -t <threads>              number of threads to use (default: auto)
  --str                     treat args as string instead of hex string
  --benchmark               run search performance benchmarks
  -h, --help                print this usage

When hex2 is not provided, xsp will search hex1 in the binary and print offsets.

Otherwise, xsp will replace the occurrences of hex1 with hex2.

All kinds of hex strings are supported, these are all valid.

abcd1234
ab cd 12 34
ABCD1234
AB cd 1234

--range uses Python-like indexes, start with 0, support negative indexes

elements: 12 34 ab cd
indexes:   0  1  2  3
indexes:  -4 -3 -2 -1

range string is two indexes separated by ,

xsp will replace the occurrences start from the first index to the second index (include the beginning and ending)