llvm-mirror

mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-19 10:13:13 +00:00

History

Daniel Dunbar 78bb7f4dc9 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.

llvm-svn: 103647

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.