diff options
| author | Chris Lattner <sabre@nondot.org> | 2006-02-02 06:36:48 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2006-02-02 06:36:48 +0000 |
| commit | 1bac9410193495d82f643e40b74f8c755664a534 (patch) | |
| tree | 4ef97550f98d3627d7d7f020c3d091c93b783eea | |
| parent | b3ddfc42af8d6f5c4b168797ccbcb6b55cb9397f (diff) | |
implemented, testcase here: test/Regression/CodeGen/X86/compare-add.ll
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@25899 91177308-0d34-0410-b5e6-96231b3b80d8
| -rw-r--r-- | lib/Target/X86/README.txt | 10 |
1 files changed, 0 insertions, 10 deletions
diff --git a/lib/Target/X86/README.txt b/lib/Target/X86/README.txt index 57aaab0577..36f287bcf9 100644 --- a/lib/Target/X86/README.txt +++ b/lib/Target/X86/README.txt @@ -289,16 +289,6 @@ The pattern isel got this one right. //===---------------------------------------------------------------------===// -This shouldn't have an explicit ADD (target independent dag combiner hack): - -bool %X(int %X) { - %Y = add int %X, 14 - %Z = setne int %Y, 12345 - ret bool %Z -} - -//===---------------------------------------------------------------------===// - We need to lower switch statements to tablejumps when appropriate instead of always into binary branch trees. |