summaryrefslogtreecommitdiffstats
path: root/llvm/unittests/ADT/SCCIteratorTest.cpp
Commit message (Collapse)AuthorAgeFilesLines
* [C++11] Use 'nullptr'.Craig Topper2014-06-081-1/+1
| | | | llvm-svn: 210442
* SCC: Change clients to use const, NFCDuncan P. N. Exon Smith2014-04-251-1/+1
| | | | | | | | | | It's fishy to be changing the `std::vector<>` owned by the iterator, and no one actual does it, so I'm going to remove the ability in a subsequent commit. First, update the users. <rdar://problem/14292693> llvm-svn: 207252
* Sort the #include lines for unittest/...Chandler Carruth2012-12-041-2/+2
| | | | llvm-svn: 169250
* Avoid undefined behaviour if somehow NUM_GRAPHS equals 2^32 (orDuncan Sands2011-07-291-10/+6
| | | | | | | whatever the size of unsigned is), though this can't actually occur for any integer value of NUM_NODES. llvm-svn: 136460
* Remove extra semicolon.Jakub Staszak2011-07-291-1/+1
| | | | llvm-svn: 136432
* Use unsigned rather than uint16_t in case anyone feels like testingDuncan Sands2011-07-281-4/+4
| | | | | | | | | 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. llvm-svn: 136354
* Check an additional property specific to the way LLVMDuncan Sands2011-07-281-0/+15
| | | | | | iterates over SCC's. llvm-svn: 136353
* Add a unittest for the simply connected components (SCC) iterator class.Duncan Sands2011-07-281-0/+335
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. llvm-svn: 136351
OpenPOWER on IntegriCloud