binfind searches files for a byte sequence specified on the command line.

binfind uses the Boyer-Moore algorithm and is able to search large files without using a lot of memory. (Note that the pattern, however, is placed in core memory, so do not expect good performance with huge patterns.)

For each occurence of the pattern binfind prints a line containing the offset of the occurence in the searched file. If more than one file was specified binfind prints the filename and a colon before the offset.

Starting with version 0.0.2 binfind can search files bigger than 4GB on 32 bit Linux.

See the man page for details.


binfind-0.0.3.tar.gz (source)
binfind-0.0.2.tar.gz (source)
binfind-0.0.1.tar.gz (source)

See the files README and INSTALL in the tarball for more information.


Search the file COPYING for the string "General" followed by a newline:

binfind -a General -x 0a COPYING



Valid HTML 4.01!