| commit | 86c88c938aec8006d2ce83325ec1f31e1154620b | [log] [tgz] |
|---|---|---|
| author | Hal Finkel <hfinkel@anl.gov> | Mon Nov 12 21:21:02 2012 +0000 |
| committer | Hal Finkel <hfinkel@anl.gov> | Mon Nov 12 21:21:02 2012 +0000 |
| tree | ef60bca1c51bdeb69234a232de93a53c8ed6f006 | |
| parent | 6996fd0b543cf8bd4a0d4e09e80a168f0ae052c5 [diff] |
BBVectorize: Use a more sophisticated check for input cost The old checking code, which assumed that input shuffles and insert-elements could always be folded (and thus were free) is too simple. This can only happen in special circumstances. Using the simple check caused infinite recursion. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167750 91177308-0d34-0410-b5e6-96231b3b80d8