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

diff --git a/lib/Target/X86/README.txt b/lib/Target/X86/README.txt
index 57aaab05773c52b380f7da3f55a352dcc6150790..36f287bcf9227f347da3f9a45af301a2947408a7 100644 (file)
--- 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.