From 1bac9410193495d82f643e40b74f8c755664a534 Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Thu, 2 Feb 2006 06:36:48 +0000
Subject: [PATCH] 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
---
 lib/Target/X86/README.txt | 10 ----------
 1 file changed, 10 deletions(-)

diff --git a/lib/Target/X86/README.txt b/lib/Target/X86/README.txt
index 57aaab05773..36f287bcf92 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.
 
-- 
2.34.1