summaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorChandler Carruth <chandlerc@gmail.com>2014-07-26 01:52:13 +0000
committerChandler Carruth <chandlerc@gmail.com>2014-07-26 01:52:13 +0000
commit1bf4d19172879e42eeb595e6337e8b358f6469c9 (patch)
tree1a7819a3c23231c930dc8ab8e8ef79b0a24bce2e /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parente87e5ce5d687a7f1223faa652add3b3b937ae30f (diff)
[x86] Fix PR20355 (and dups) by not using unsigned multiplication when
signed multiplication is requested. While there is not a difference in the *low* half of the result, the *high* half (used specifically to implement the signed division by these constants) certainly is used. The test case I've nuked was actively asserting wrong code. There is a delightful solution to doing signed multiplication even when we don't have it that Richard Smith has crafted, but I'll add the machinery back and implement that in a follow-up patch. This at least restores correctness. llvm-svn: 214007
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions