Let us consider five test cases:
memcmp0 - Calling memcmp() at each byte in the file looking ofr a match, as the original article.
memcmp1 - As above, but optimize by checking the first character and only calling if it matches.
memmem0 - A single call to the glibc memmem() function. Not portable.
kmp0 - The Knuth-Morris-Pratt algorithm as implemented at "Exact String Matching Algorithms", http://www-igm.univ-mlv.fr/~lecroq/string/index.html
bm0 - The Boyer Moore algorithm, also from above
Looking for a 1k needle which lies at the end of a 100MB haystack of random bytes, with the data in file system buffers on a 1.6GHz Atom processor running Linux 2.6.29:
memcmp0 2400 ==================================
memcmp1 530 ========
memmem0 460 =======
kmp0 970 ==============
bm0 70 =
If we assume the data is out on a hard drive, then we get these numbers (same machine, a WD Green Power HD which is an evil thing to benchmark with because it has variable spindle and seek speeds, but suffice it to say it is not terribly fast). All OS caches flushed before each test.
memcmp0 3500 ===================================
memcmp1 1300 =============
memmem0 1200 ============
kmp0 1700 =================
bm0 1100 ===========
Testing on a beefier machine, with a Core 2 Duo 2.8GHz, OS X gives this:
memcmp0 1100 =========================
memcmp1 180 ====
memmem0 not portable
kmp0 360 ========
bm0 88 ==
Update: well crap. this fell of the front page before I finished testing. No one will see these results, but I enjoyed the tests anyway. It is useful to update my rules of thumb and preconceived notions.