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

1 files changed, 4 insertions, 4 deletions

diff --git a/unittests/ADT/SCCIteratorTest.cpp b/unittests/ADT/SCCIteratorTest.cpp
index cf0ec014df..1151da0837 100644
--- a/unittests/ADT/SCCIteratorTest.cpp
+++ b/unittests/ADT/SCCIteratorTest.cpp
@@ -251,8 +251,8 @@ TEST(SCCIteratorTest, AllSmallGraphs) {
 #define NUM_GRAPHS (NUM_NODES * (NUM_NODES - 1))
 
   /// GraphDescriptor - Enumerate all graphs using NUM_GRAPHS bits.
-  uint16_t GraphDescriptor = 0;
-  assert(NUM_GRAPHS <= sizeof(uint16_t) * CHAR_BIT && "Too many graphs!");
+  unsigned GraphDescriptor = 0;
+  assert(NUM_GRAPHS <= sizeof(unsigned) * CHAR_BIT && "Too many graphs!");
 
   do {
     typedef Graph<NUM_NODES> GT;
@@ -260,7 +260,7 @@ TEST(SCCIteratorTest, AllSmallGraphs) {
     GT G;
 
     // Add edges as specified by the descriptor.
-    uint16_t DescriptorCopy = GraphDescriptor;
+    unsigned DescriptorCopy = GraphDescriptor;
     for (unsigned i = 0; i != NUM_NODES; ++i)
       for (unsigned j = 0; j != NUM_NODES; ++j) {
         // Always add a self-edge.
@@ -344,7 +344,7 @@ TEST(SCCIteratorTest, AllSmallGraphs) {
     EXPECT_EQ(NodesInSomeSCC, G.NodesReachableFrom(0));
 
     ++GraphDescriptor;
-  } while (GraphDescriptor && (unsigned)GraphDescriptor < (1U << NUM_GRAPHS));
+  } while (GraphDescriptor && GraphDescriptor < (1U << NUM_GRAPHS));
 }
 
 }