Index: runtime/vm/flow_graph_range_analysis_test.cc |
diff --git a/runtime/vm/flow_graph_range_analysis_test.cc b/runtime/vm/flow_graph_range_analysis_test.cc |
index a15cea68aa34f14ba5b332a095d64058e593b1e3..6e01d2a0f5cd17b041b7f153a3a1ed527e71ac7e 100644 |
--- a/runtime/vm/flow_graph_range_analysis_test.cc |
+++ b/runtime/vm/flow_graph_range_analysis_test.cc |
@@ -94,7 +94,6 @@ TEST_CASE(RangeTests) { |
#undef TEST_RANGE_OP |
} |
- |
TEST_CASE(RangeTestsInfinity) { |
// +/- inf overflowed. |
EXPECT(RangeBoundary::NegativeInfinity().OverflowedSmi()); |
@@ -152,7 +151,6 @@ TEST_CASE(RangeTestsInfinity) { |
EXPECT(unsatisfiable_left->IsUnsatisfiable()); |
} |
- |
TEST_CASE(RangeUtils) { |
// [-inf, +inf]. |
const Range& range_0 = *(new Range(RangeBoundary::NegativeInfinity(), |
@@ -238,7 +236,6 @@ TEST_CASE(RangeUtils) { |
RangeBoundary::PositiveInfinity())); |
} |
- |
TEST_CASE(RangeBinaryOp) { |
Range* range_a = new Range(RangeBoundary::FromConstant(-1), |
RangeBoundary::PositiveInfinity()); |
@@ -287,7 +284,6 @@ TEST_CASE(RangeBinaryOp) { |
} |
} |
- |
TEST_CASE(RangeAdd) { |
#define TEST_RANGE_ADD(l_min, l_max, r_min, r_max, result_min, result_max) \ |
{ \ |
@@ -368,7 +364,6 @@ TEST_CASE(RangeAdd) { |
#undef TEST_RANGE_ADD |
} |
- |
TEST_CASE(RangeSub) { |
#define TEST_RANGE_SUB(l_min, l_max, r_min, r_max, result_min, result_max) \ |
{ \ |
@@ -419,11 +414,9 @@ TEST_CASE(RangeSub) { |
RangeBoundary(static_cast<int64_t>(kMaxInt32) + 30), |
RangeBoundary(static_cast<int64_t>(kMaxInt32) + 40)); |
- |
#undef TEST_RANGE_SUB |
} |
- |
TEST_CASE(RangeAnd) { |
#define TEST_RANGE_AND(l_min, l_max, r_min, r_max, result_min, result_max) \ |
{ \ |
@@ -478,7 +471,6 @@ TEST_CASE(RangeAnd) { |
#undef TEST_RANGE_AND |
} |
- |
TEST_CASE(RangeIntersectionMinMax) { |
// Test IntersectionMin and IntersectionMax methods which for constants are |
// simply defined as Max/Min respectively. |
@@ -558,7 +550,6 @@ TEST_CASE(RangeIntersectionMinMax) { |
.ConstantValue() == 1); |
} |
- |
TEST_CASE(RangeJoinMinMax) { |
// Test IntersectionMin and IntersectionMax methods which for constants are |
// simply defined as Min/Max respectively. |