mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-01-17 17:26:00 +00:00
0c20486517
Based on Horspool's simplified version of Boyer-Moore. We use a constant-sized table of uint8_ts to keep cache thrashing low, needles bigger than 255 bytes are uncommon anyways. The worst case is still O(n*m) but we do a lot better on the average case now. llvm-svn: 142061