| commit | 5c46f74ec78e73bc91785299a6877f45a7b2f1df | [log] [tgz] |
|---|---|---|
| author | Chris Lattner <sabre@nondot.org> | Wed Oct 05 06:11:08 2005 +0000 |
| committer | Chris Lattner <sabre@nondot.org> | Wed Oct 05 06:11:08 2005 +0000 |
| tree | b7c349b5bcd093b7b1d0eefc7ba8bfba5021f8c4 | |
| parent | d48050aa1509130871b8bb2453270c92b969c2e7 [diff] |
Implement the code for PowerPC/inverted-bool-compares.ll, even though it that testcase still does not pass with the dag combiner. This is because not all forms of br* are folded yet. Also, when we combine a node into another one, delete the node immediately instead of waiting for the node to potentially come up in the future. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23632 91177308-0d34-0410-b5e6-96231b3b80d8