| commit | 6e6a558ebce556476d8fd659b419a2760f2ab154 | [log] [tgz] |
|---|---|---|
| author | Benjamin Kramer <benny.kra@googlemail.com> | Sat Oct 15 10:08:31 2011 +0000 |
| committer | Benjamin Kramer <benny.kra@googlemail.com> | Sat Oct 15 10:08:31 2011 +0000 |
| tree | 0331aaeaa342b5fd9f0adf98895d3d91e2182f4f | |
| parent | e9b58d0aac4e89b53a4be0e6f289b66649e1512b [diff] |
Add a bad char heuristic to StringRef::find. 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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@142061 91177308-0d34-0410-b5e6-96231b3b80d8