1 //===- llvm/unittest/Support/IntegersSubsetTest.cpp - IntegersSubset tests ===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/ADT/APInt.h"
11 #include "llvm/Support/IntegersSubset.h"
12 #include "llvm/Support/IntegersSubsetMapping.h"
14 #include "gtest/gtest.h"
22 class Int : public APInt {
24 Int(uint64_t V) : APInt(64, V) {}
25 bool operator < (const APInt& RHS) const { return ult(RHS); }
26 bool operator > (const APInt& RHS) const { return ugt(RHS); }
27 bool operator <= (const APInt& RHS) const { return ule(RHS); }
28 bool operator >= (const APInt& RHS) const { return uge(RHS); }
31 typedef IntRange<Int> Range;
32 typedef IntegersSubsetGeneric<Int> Subset;
33 typedef IntegersSubsetMapping<unsigned,Subset,Int> Mapping;
35 TEST(IntegersSubsetTest, GeneralTest) {
39 std::vector<Range> Ranges;
42 // Initialize Subset as union of three pairs:
43 // { {0, 8}, {10, 18}, {20, 28} }
44 for (unsigned i = 0; i < 3; ++i)
45 Ranges.push_back(Range(Int(i*10), Int(i*10 + 8)));
47 Subset TheSubset(Ranges);
49 for (unsigned i = 0; i < 3; ++i) {
50 EXPECT_EQ(TheSubset.getItem(i).getLow(), Int(i*10));
51 EXPECT_EQ(TheSubset.getItem(i).getHigh(), Int(i*10 + 8));
54 EXPECT_EQ(TheSubset.getNumItems(), 3ULL);
56 // Test belonging to range.
58 EXPECT_TRUE(TheSubset.isSatisfies(Int(5)));
59 EXPECT_FALSE(TheSubset.isSatisfies(Int(9)));
61 // Test when subset contains the only item.
64 Ranges.push_back(Range(Int(10), Int(10)));
66 Subset TheSingleNumber(Ranges);
68 EXPECT_TRUE(TheSingleNumber.isSingleNumber());
70 Ranges.push_back(Range(Int(12), Int(15)));
72 Subset NotASingleNumber(Ranges);
74 EXPECT_FALSE(NotASingleNumber.isSingleNumber());
76 // Test when subset contains items that are not a ranges but
77 // the single numbers.
80 Ranges.push_back(Range(Int(10), Int(10)));
81 Ranges.push_back(Range(Int(15), Int(19)));
83 Subset WithSingleNumberItems(Ranges);
85 EXPECT_TRUE(WithSingleNumberItems.isSingleNumber(0));
86 EXPECT_FALSE(WithSingleNumberItems.isSingleNumber(1));
88 // Test size of subset. Note subset itself may be not optimized (improper),
89 // so it may contain duplicates, and the size of subset { {0, 9} {5, 9} }
90 // will 15 instead of 10.
93 Ranges.push_back(Range(Int(0), Int(9)));
94 Ranges.push_back(Range(Int(5), Int(9)));
96 Subset NotOptimizedSubset(Ranges);
98 EXPECT_EQ(NotOptimizedSubset.getSize(), 15ULL);
100 // Test access to a single value.
101 // getSingleValue(idx) method represents subset as flat numbers collection,
102 // so subset { {0, 3}, {8, 10} } will represented as array
103 // { 0, 1, 2, 3, 8, 9, 10 }.
106 Ranges.push_back(Range(Int(0), Int(3)));
107 Ranges.push_back(Range(Int(8), Int(10)));
109 Subset OneMoreSubset(Ranges);
111 EXPECT_EQ(OneMoreSubset.getSingleValue(5), Int(9));
114 TEST(IntegersSubsetTest, MappingTest) {
116 Mapping::Cases TheCases;
118 unsigned Successors[3] = {0, 1, 2};
120 // Test construction.
123 for (unsigned i = 0; i < 3; ++i)
124 TheMapping.add(Int(10*i), Int(10*i + 9), Successors + i);
125 TheMapping.add(Int(111), Int(222), Successors);
126 TheMapping.removeItem(--TheMapping.end());
128 TheMapping.getCases(TheCases);
130 EXPECT_EQ(TheCases.size(), 3ULL);
132 for (unsigned i = 0; i < 3; ++i) {
133 Mapping::Cases::iterator CaseIt = TheCases.begin();
134 std::advance(CaseIt, i);
135 EXPECT_EQ(CaseIt->first, Successors + i);
136 EXPECT_EQ(CaseIt->second.getNumItems(), 1ULL);
137 EXPECT_EQ(CaseIt->second.getItem(0), Range(Int(10*i), Int(10*i + 9)));
140 // Test verification.
142 Mapping ImproperMapping;
143 ImproperMapping.add(Int(10), Int(11), Successors + 0);
144 ImproperMapping.add(Int(11), Int(12), Successors + 1);
146 Mapping::RangeIterator ErrItem;
147 EXPECT_FALSE(ImproperMapping.verify(ErrItem));
148 EXPECT_EQ(ErrItem, --ImproperMapping.end());
150 Mapping ProperMapping;
151 ProperMapping.add(Int(10), Int(11), Successors + 0);
152 ProperMapping.add(Int(12), Int(13), Successors + 1);
154 EXPECT_TRUE(ProperMapping.verify(ErrItem));
156 // Test optimization.
158 Mapping ToBeOptimized;
160 for (unsigned i = 0; i < 3; ++i) {
161 ToBeOptimized.add(Int(i * 10), Int(i * 10 + 1), Successors + i);
162 ToBeOptimized.add(Int(i * 10 + 2), Int(i * 10 + 9), Successors + i);
165 ToBeOptimized.optimize();
168 ToBeOptimized.getCases(TheCases);
170 EXPECT_EQ(TheCases.size(), 3ULL);
172 for (unsigned i = 0; i < 3; ++i) {
173 Mapping::Cases::iterator CaseIt = TheCases.begin();
174 std::advance(CaseIt, i);
175 EXPECT_EQ(CaseIt->first, Successors + i);
176 EXPECT_EQ(CaseIt->second.getNumItems(), 1ULL);
177 EXPECT_EQ(CaseIt->second.getItem(0), Range(Int(i * 10), Int(i * 10 + 9)));