2012-06-21 09:51:26 +00:00
|
|
|
set(LLVM_LINK_COMPONENTS
|
|
|
|
|
Support
|
|
|
|
|
)
|
|
|
|
|
|
2012-08-30 16:22:32 +00:00
|
|
|
set(ADTSources
|
2012-06-21 09:51:26 +00:00
|
|
|
APFloatTest.cpp
|
|
|
|
|
APIntTest.cpp
|
2014-03-02 20:56:28 +00:00
|
|
|
APSIntTest.cpp
|
2014-02-05 22:22:56 +00:00
|
|
|
ArrayRefTest.cpp
|
2012-06-21 09:51:26 +00:00
|
|
|
BitVectorTest.cpp
|
|
|
|
|
DAGDeltaAlgorithmTest.cpp
|
|
|
|
|
DeltaAlgorithmTest.cpp
|
|
|
|
|
DenseMapTest.cpp
|
|
|
|
|
DenseSetTest.cpp
|
|
|
|
|
FoldingSet.cpp
|
|
|
|
|
HashingTest.cpp
|
|
|
|
|
ilistTest.cpp
|
2012-10-14 16:06:09 +00:00
|
|
|
ImmutableMapTest.cpp
|
2012-06-21 09:51:26 +00:00
|
|
|
ImmutableSetTest.cpp
|
|
|
|
|
IntEqClassesTest.cpp
|
|
|
|
|
IntervalMapTest.cpp
|
|
|
|
|
IntrusiveRefCntPtrTest.cpp
|
2014-03-09 11:20:17 +00:00
|
|
|
MakeUniqueTest.cpp
|
2013-01-25 22:29:23 +00:00
|
|
|
MapVectorTest.cpp
|
2013-02-20 00:26:04 +00:00
|
|
|
OptionalTest.cpp
|
2012-06-21 09:51:26 +00:00
|
|
|
PackedVectorTest.cpp
|
2014-03-07 19:19:56 +00:00
|
|
|
PointerIntPairTest.cpp
|
2013-08-21 21:30:23 +00:00
|
|
|
PointerUnionTest.cpp
|
2012-06-21 09:51:26 +00:00
|
|
|
SCCIteratorTest.cpp
|
|
|
|
|
SmallPtrSetTest.cpp
|
|
|
|
|
SmallStringTest.cpp
|
|
|
|
|
SmallVectorTest.cpp
|
|
|
|
|
SparseBitVectorTest.cpp
|
2013-01-21 18:18:53 +00:00
|
|
|
SparseMultiSetTest.cpp
|
2012-06-21 09:51:26 +00:00
|
|
|
SparseSetTest.cpp
|
|
|
|
|
StringMapTest.cpp
|
|
|
|
|
StringRefTest.cpp
|
Bring TinyPtrVector under test. Somehow we never picked up unit tests
for this class. These tests exercise most of the basic properties, but
the API for TinyPtrVector is very strange currently. My plan is to start
fleshing out the API to match that of SmallVector, but I wanted a test
for what is there first.
Sadly, it doesn't look reasonable to just re-use the SmallVector tests,
as this container can only ever store pointers, and much of the
SmallVector testing is to get construction and destruction right.
Just to get this basic test working, I had to add value_type to the
interface.
While here I found a subtle bug in the combination of 'erase', 'begin',
and 'end'. Both 'begin' and 'end' wanted to use a null pointer to
indicate the "end" iterator of an empty vector, regardless of whether
there is actually a vector allocated or the pointer union is null.
Everything else was fine with this except for erase. If you erase the
last element of a vector after it has held more than one element, we
return the end iterator of the underlying SmallVector which need not be
a null pointer. Instead, simply use the pointer, and poniter + size()
begin/end definitions in the tiny case, and delegate to the inner vector
whenever it is present.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@161024 91177308-0d34-0410-b5e6-96231b3b80d8
2012-07-31 02:48:31 +00:00
|
|
|
TinyPtrVectorTest.cpp
|
2012-06-21 09:51:26 +00:00
|
|
|
TripleTest.cpp
|
|
|
|
|
TwineTest.cpp
|
|
|
|
|
VariadicFunctionTest.cpp
|
|
|
|
|
)
|
2012-08-30 16:22:32 +00:00
|
|
|
|
|
|
|
|
add_llvm_unittest(ADTTests
|
|
|
|
|
${ADTSources}
|
|
|
|
|
)
|
