aboutsummaryrefslogtreecommitdiff
path: root/unittests/ADT/SCCIteratorTest.cpp
AgeCommit message (Collapse)Author
2012-12-04Sort the #include lines for unittest/...Chandler Carruth
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169250 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-29Avoid undefined behaviour if somehow NUM_GRAPHS equals 2^32 (orDuncan Sands
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
2011-07-29Remove extra semicolon.Jakub Staszak
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136432 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-28Use unsigned rather than uint16_t in case anyone feels like testingDuncan Sands
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
2011-07-28Check an additional property specific to the way LLVMDuncan Sands
iterates over SCC's. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136353 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-28Add a unittest for the simply connected components (SCC) iterator class.Duncan Sands
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