| 7c5c12bd4d60070c90161df9f6ae078c1f7b1ce5 |
|
04-Jan-2013 |
Jakob Stoklund Olesen <stoklund@2pi.dk> |
Add an iplist::clearAndLeakNodesUnsafely() function.
The iplist::clear() function can be quite expensive because it traverses
the entire list, calling deleteNode() and removeNodeFromList() on each
element. If node destruction and deallocation can be handled some other
way, clearAndLeakNodesUnsafely() can be used to jettison all nodes
without bringing them into cache.
The function name is meant to be ominous.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171540 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/ilistTest.cpp
|
| 7f00f87767036e74445aad0164eea13cf2642610 |
|
02-Jan-2013 |
Chandler Carruth <chandlerc@gmail.com> |
Sort a few more #include lines in tools/... unittests/... and utils/...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171363 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/ilistTest.cpp
|
| 7f1d6d688f6ae288a16a4151e8a27b518d97f6f7 |
|
18-Dec-2012 |
Jakob Stoklund Olesen <stoklund@2pi.dk> |
Add an assertion for a likely ilist::splice() contract violation.
The single-element ilist::splice() function supports a noop move:
List.splice(I, List, I);
The corresponding std::list function doesn't allow that, so add a unit
test to document that behavior.
This also means that
List.splice(I, List, F);
is somewhat surprisingly not equivalent to
List.splice(I, List, F, next(F));
This patch adds an assertion to catch the illegal case I == F above.
Alternatively, we could make I == F a legal noop, but that would make
ilist differ even more from std::list.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@170443 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/ilistTest.cpp
|
| 5a88dda4be791426ab4d20a6a6c9c65d66614a27 |
|
04-Dec-2012 |
Chandler Carruth <chandlerc@gmail.com> |
Sort the #include lines for unittest/...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169250 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/ilistTest.cpp
|
| f1fd2288f36b58b8979761ba09e2a398c6afd110 |
|
13-May-2010 |
Daniel Dunbar <daniel@zuster.org> |
Fix const ilist_node::get{Prev,Next}Node() to actually compile. Picky, picky.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@103723 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/ilistTest.cpp
|
| aa81380353a27d9d216cafdd88df08a5eef43b74 |
|
12-May-2010 |
Daniel Dunbar <daniel@zuster.org> |
ADT: Add ilist_node::get{Prev,Next}Node, which return the adjacent node or null.
- This provides a convenient alternative to using something llvm::prior or
manual iterator access, for example::
if (T *Prev = foo->getPrevNode())
...
instead of::
iterator it(foo);
if (it != begin()) {
--it;
...
}
- Chris, please review.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@103647 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/ilistTest.cpp
|