[llvm] r342543 - [TableGen] CodeGenDAGPatterns::GenerateVariants - use BitVector::set() where possible. NFCI.

[Simon Pilgrim via llvm-commits]

Author: rksimon
Date: Wed Sep 19 05:23:50 2018
New Revision: 342543

URL: http://llvm.org/viewvc/llvm-project?rev=342543&view=rev
Log:
[TableGen] CodeGenDAGPatterns::GenerateVariants - use BitVector::set() where possible. NFCI.

In these cases we are always setting to true.

Modified:
    llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp

Modified: llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp?rev=342543&r1=342542&r2=342543&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp (original)
+++ llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp Wed Sep 19 05:23:50 2018
@@ -4498,8 +4498,8 @@ void CodeGenDAGPatterns::GenerateVariant
         PatternsToMatch[i].getPredicates();
 
     BitVector &Matches = MatchedPredicates[i];
-    MatchedPatterns[i] = true;
-    Matches[i] = true;
+    MatchedPatterns.set(i);
+    Matches.set(i);
 
     // Don't test patterns that have already been cached - it won't match.
     for (unsigned p = 0; p != NumOriginalPatterns; ++p)
@@ -4509,7 +4509,7 @@ void CodeGenDAGPatterns::GenerateVariant
     // Copy this to all the matching patterns.
     for (int p = Matches.find_first(); p != -1; p = Matches.find_next(p))
       if (p != (int)i) {
-        MatchedPatterns[p] = true;
+        MatchedPatterns.set(p);
         MatchedPredicates[p] = Matches;
       }
   }