llvm/unittests at bd4fa2efd373c46dc14b87744b908f16f539c836 - llvm

RPCS3/llvm

mirror of https://github.com/RPCS3/llvm.git synced 2025-03-02 07:37:02 +00:00

History

Daniel Dunbar aa81380353 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

2010-05-12 21:35:19 +00:00

ADT

ADT: Add ilist_node::get{Prev,Next}Node, which return the adjacent node or null.

2010-05-12 21:35:19 +00:00

ExecutionEngine

Update unittest for allocator laziness.

2010-04-13 15:01:26 +00:00

Support

Fix death tests in -Asserts builds.

2010-03-17 01:18:45 +00:00

Transforms

Teach this test not to leak. Also, clean up all the cast<BinaryOperator> cruft.