This is not overly conservative.

Some = [10, 2730). A subset of that is [1024..2048) which covers every possible
10-bit pattern.

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

diff --git a/unittests/Support/ConstantRangeTest.cpp b/unittests/Support/ConstantRangeTest.cpp
index 4a9e972802c5039d1874e03589fd4d67a96996c1..d11d776970ce433d1ee9cd4aebc76d665778ff05 100644 (file)
--- a/unittests/Support/ConstantRangeTest.cpp
+++ b/unittests/Support/ConstantRangeTest.cpp
@@ -149,7 +149,6 @@ TEST_F(ConstantRangeTest, Trunc) {
   EXPECT_TRUE(TEmpty.isEmptySet());
   EXPECT_EQ(TOne, ConstantRange(APInt(One.getLower()).trunc(10),
                                 APInt(One.getUpper()).trunc(10)));
-  // TODO: ConstantRange is currently over-conservative here.
   EXPECT_TRUE(TSome.isFullSet());
 }