| 6815ff07d45e5905b2a5c1e1df8f09ae8c38e5de |
|
29-Jul-2011 |
Duncan Sands <baldrick@free.fr> |
Avoid undefined behaviour if somehow NUM_GRAPHS equals 2^32 (or
whatever the size of unsigned is), though this can't actually
occur for any integer value of NUM_NODES.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136460 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/SCCIteratorTest.cpp
|
| 00eab6c716e206491de195ae4dd85ea493c98582 |
|
29-Jul-2011 |
Jakub Staszak <jstaszak@apple.com> |
Remove extra semicolon.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136432 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/SCCIteratorTest.cpp
|
| 5edfbebb7d085ce52fe7c3f96feacfd246b3f071 |
|
28-Jul-2011 |
Duncan Sands <baldrick@free.fr> |
Use unsigned rather than uint16_t in case anyone feels like testing
more graphs, like all graphs with 5 nodes or less. With a 32 bit
unsigned type, the maximum is graphs with 6 nodes or less, but that
would take a while to test - 5 nodes or less already requires a few
seconds.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136354 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/SCCIteratorTest.cpp
|
| 6f7eec12941f61148c2615eafa50b49096fb9e2f |
|
28-Jul-2011 |
Duncan Sands <baldrick@free.fr> |
Check an additional property specific to the way LLVM
iterates over SCC's.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136353 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/SCCIteratorTest.cpp
|
| 8537e8a9a506a2ca1b7795e8d907982ec2235973 |
|
28-Jul-2011 |
Duncan Sands <baldrick@free.fr> |
Add a unittest for the simply connected components (SCC) iterator class.
This computes every graph with 4 or fewer nodes, and checks that the SCC
class indeed returns exactly the simply connected components reachable
from the initial node.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136351 91177308-0d34-0410-b5e6-96231b3b80d8
/external/llvm/unittests/ADT/SCCIteratorTest.cpp
|