llvm-6502

mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-05 14:34:55 +00:00

History

Chandler Carruth 14ee003f1a [SDAG] Fix a case where we would iteratively legalize a node during

combining by replacing it with something else but not re-process the
node afterward to remove it.

In a truly remarkable stroke of bad luck, this would (in the test case
attached) end up getting some other node combined into it without ever
getting re-processed. By adding it back on to the worklist, in addition
to deleting the dead nodes more quickly we also ensure that if it
*stops* being dead for any reason it makes it back through the
legalizer. Without this, the test case will end up failing during
instruction selection due to an and node with a type we don't have an
instruction pattern for.

It took many million runs of the shuffle fuzz tester to find this.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@215611 91177308-0d34-0410-b5e6-96231b3b80d8

2014-08-14 01:07:37 +00:00

Analysis

In LVI(Lazy Value Info), originally value on a BB can only be caculated once,

2014-08-11 05:02:04 +00:00

AsmParser

Canonicalize header guards into a common format.

2014-08-13 16:26:38 +00:00

Bitcode

Canonicalize header guards into a common format.

2014-08-13 16:26:38 +00:00

CodeGen

[SDAG] Fix a case where we would iteratively legalize a node during