llvm/unittests/ADT
Duncan P. N. Exon Smith f1f27bb03e ADT: Split out simple_ilist, a simple intrusive list
Split out a new, low-level intrusive list type with clear semantics.
Unlike iplist (and ilist), all operations on simple_ilist are intrusive,
and simple_ilist never takes ownership of its nodes.  This enables an
intuitive API that has the right defaults for intrusive lists.
- insert() takes references (not pointers!) to nodes (in iplist/ilist,
  passing a reference will cause the node to be copied).
- erase() takes only iterators (like std::list), and does not destroy
  the nodes.
- remove() takes only references and has the same behaviour as erase().
- clear() does not destroy the nodes.
- The destructor does not destroy the nodes.
- New API {erase,remove,clear}AndDispose() take an extra Disposer
  functor for callsites that want to call some disposal routine (e.g.,
  std::default_delete).

This list is not currently configurable, and has no callbacks.

The initial motivation was to fix iplist<>::sort to work correctly (even
with callbacks in ilist_traits<>).  iplist<> uses simple_ilist<>::sort
directly.  The new test in unittests/IR/ModuleTest.cpp crashes without
this commit.

Fixing sort() via a low-level layer provided a good opportunity to:
- Unit test the low-level functionality thoroughly.
- Modernize the API, largely inspired by other intrusive list
  implementations.

Here's a sketch of a longer-term plan:
- Create BumpPtrList<>, a non-intrusive list implemented using
  simple_ilist<>, and use it for the Token list in
  lib/Support/YAMLParser.cpp.  This will factor out the only real use of
  createNode().
- Evolve the iplist<> and ilist<> APIs in the direction of
  simple_ilist<>, making allocation/deallocation explicit at call sites
  (similar to simple_ilist<>::eraseAndDispose()).
- Factor out remaining calls to createNode() and deleteNode() and remove
  the customization from ilist_traits<>.
- Transition uses of iplist<>/ilist<> that don't need callbacks over to
  simple_ilist<>.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@280107 91177308-0d34-0410-b5e6-96231b3b80d8
2016-08-30 16:23:55 +00:00
..
APFloatTest.cpp
APIntTest.cpp Fix UB in APInt::ashr 2016-08-10 19:50:14 +00:00
APSIntTest.cpp
ArrayRefTest.cpp Fix ArrayRef initializer_list Ctor Test 2016-08-25 22:09:13 +00:00
BitmaskEnumTest.cpp
BitVectorTest.cpp
CMakeLists.txt ADT: Split out simple_ilist, a simple intrusive list 2016-08-30 16:23:55 +00:00
DAGDeltaAlgorithmTest.cpp
DeltaAlgorithmTest.cpp
DenseMapTest.cpp
DenseSetTest.cpp [ADT] Add a reserve() method to DenseSet as well as an insert() for R-value 2016-08-13 20:42:19 +00:00
DepthFirstIteratorTest.cpp [ADT] Actually mutate the iterator VisitStack.back().second, not its copy. 2016-08-22 21:59:26 +00:00
FoldingSet.cpp
FunctionRefTest.cpp
HashingTest.cpp
IListBaseTest.cpp ADT: Split out simple_ilist, a simple intrusive list 2016-08-30 16:23:55 +00:00
IListIteratorTest.cpp ADT: Split out simple_ilist, a simple intrusive list 2016-08-30 16:23:55 +00:00
IListNodeBaseTest.cpp ADT: Explode include/llvm/ADT/{ilist,ilist_node}.h, NFC 2016-08-30 01:37:58 +00:00
IListSentinelTest.cpp ADT: Separate some list manipulation API into ilist_base, NFC 2016-08-22 22:21:07 +00:00
IListTest.cpp Rename unittests/ADT/ilistTestTemp.cpp => IListTest.cpp 2016-08-30 00:18:43 +00:00
ImmutableMapTest.cpp
ImmutableSetTest.cpp
IntEqClassesTest.cpp
IntervalMapTest.cpp
IntrusiveRefCntPtrTest.cpp
IteratorTest.cpp Move unittests/Support/IteratorTest.cpp to unittests/ADT/ 2016-08-20 14:58:31 +00:00
MakeUniqueTest.cpp
MapVectorTest.cpp
OptionalTest.cpp [ADT] Add relation operators for Optional 2016-08-11 20:10:15 +00:00
PackedVectorTest.cpp
PointerEmbeddedIntTest.cpp
PointerIntPairTest.cpp
PointerSumTypeTest.cpp
PointerUnionTest.cpp
PostOrderIteratorTest.cpp [ADT] Change PostOrderIterator to use NodeRef. NFC. 2016-08-15 21:52:54 +00:00
PriorityWorklistTest.cpp
RangeAdapterTest.cpp Reapply "ADT: Remove references in has_rbegin for reverse()" 2016-08-18 17:15:25 +00:00
SCCIteratorTest.cpp [ADT] Actually mutate the iterator VisitStack.back().second, not its copy. 2016-08-22 21:59:26 +00:00
ScopeExitTest.cpp [ADT] Add make_scope_exit(). 2016-08-10 17:52:09 +00:00
SequenceTest.cpp
SetVectorTest.cpp
SimpleIListTest.cpp ADT: Split out simple_ilist, a simple intrusive list 2016-08-30 16:23:55 +00:00
SmallPtrSetTest.cpp
SmallStringTest.cpp
SmallVectorTest.cpp
SparseBitVectorTest.cpp
SparseMultiSetTest.cpp
SparseSetTest.cpp
STLExtrasTest.cpp [ADT] Add the worlds simplest STL extra. Or at least close to it. 2016-08-19 02:07:51 +00:00
StringMapTest.cpp
StringRefTest.cpp
TestGraph.h [ADT] Actually mutate the iterator VisitStack.back().second, not its copy. 2016-08-22 21:59:26 +00:00
TinyPtrVectorTest.cpp
TripleTest.cpp Remove the Triple tests that stressing the TargetParser's behaviour. 2016-08-17 03:17:07 +00:00
TwineTest.cpp
VariadicFunctionTest.cpp