external_llvm.git - Unnamed repository; edit this file 'description' to name the repository.

	Commit message (Collapse)	Author	Age	Files	Lines
*	Sort the #include lines for unittest/...	Chandler Carruth	2012-12-04	1	-2/+2
\| \| \| \|	git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169250 91177308-0d34-0410-b5e6-96231b3b80d8
*	Avoid undefined behaviour if somehow NUM_GRAPHS equals 2^32 (or	Duncan Sands	2011-07-29	1	-10/+6
\| \| \| \| \| \| \| \|	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
*	Remove extra semicolon.	Jakub Staszak	2011-07-29	1	-1/+1
\| \| \| \|	git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136432 91177308-0d34-0410-b5e6-96231b3b80d8
*	Use unsigned rather than uint16_t in case anyone feels like testing	Duncan Sands	2011-07-28	1	-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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136354 91177308-0d34-0410-b5e6-96231b3b80d8
*	Check an additional property specific to the way LLVM	Duncan Sands	2011-07-28	1	-0/+15
\| \| \| \| \| \| \|	iterates over SCC's. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136353 91177308-0d34-0410-b5e6-96231b3b80d8
*	Add a unittest for the simply connected components (SCC) iterator class.	Duncan Sands	2011-07-28	1	-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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136351 91177308-0d34-0410-b5e6-96231b3b80d8