aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Support/ErrorHandling.cpp
diff options
context:
space:
mode:
authorHal Finkel <hfinkel@anl.gov>2012-11-12 21:21:02 +0000
committerHal Finkel <hfinkel@anl.gov>2012-11-12 21:21:02 +0000
commit9cf33729316852043371235a33e310f34132afa8 (patch)
treed247a998f229429c73208991dadf347f1bf71422 /llvm/lib/Support/ErrorHandling.cpp
parentda5919ffa10c251091482f5aea0c30eca123aa54 (diff)
downloadllvm-9cf33729316852043371235a33e310f34132afa8.zip
llvm-9cf33729316852043371235a33e310f34132afa8.tar.gz
llvm-9cf33729316852043371235a33e310f34132afa8.tar.bz2
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. llvm-svn: 167750
Diffstat (limited to 'llvm/lib/Support/ErrorHandling.cpp')
0 files changed, 0 insertions, 0 deletions