[llvm] 58dd265 - [TableGen] Pass size to std::vector constructor instead of using resize. NFC

[Craig Topper via llvm-commits]

Author: Craig Topper
Date: 2023-04-10T00:17:41-07:00
New Revision: 58dd265d25f0922a78d023472d820f3d2018e47d

URL: https://github.com/llvm/llvm-project/commit/58dd265d25f0922a78d023472d820f3d2018e47d
DIFF: https://github.com/llvm/llvm-project/commit/58dd265d25f0922a78d023472d820f3d2018e47d.diff

LOG: [TableGen] Pass size to std::vector constructor instead of using resize. NFC

Added: 
    

Modified: 
    llvm/utils/TableGen/CodeGenDAGPatterns.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
index 81821a41bd79..3bd5bfad5cd6 100644
--- a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
+++ b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
@@ -2091,8 +2091,8 @@ void TreePatternNode::InlinePatternFragments(
     }
 
     // Recursively inline children nodes.
-    std::vector<std::vector<TreePatternNodePtr> > ChildAlternatives;
-    ChildAlternatives.resize(T->getNumChildren());
+    std::vector<std::vector<TreePatternNodePtr>> ChildAlternatives(
+        T->getNumChildren());
     for (unsigned i = 0, e = T->getNumChildren(); i != e; ++i) {
       TreePatternNodePtr Child = T->getChildShared(i);
       InlinePatternFragments(Child, TP, ChildAlternatives[i]);
@@ -2111,8 +2111,7 @@ void TreePatternNode::InlinePatternFragments(
     }
 
     // The end result is an all-pairs construction of the resultant pattern.
-    std::vector<unsigned> Idxs;
-    Idxs.resize(ChildAlternatives.size());
+    std::vector<unsigned> Idxs(ChildAlternatives.size());
     bool NotDone;
     do {
       // Create the variant and add it to the output list.
@@ -4506,8 +4505,7 @@ static void CombineChildVariants(
       return;
 
   // The end result is an all-pairs construction of the resultant pattern.
-  std::vector<unsigned> Idxs;
-  Idxs.resize(ChildVariants.size());
+  std::vector<unsigned> Idxs(ChildVariants.size());
   bool NotDone;
   do {
 #ifndef NDEBUG
@@ -4668,8 +4666,8 @@ static void GenerateVariantsOf(TreePatternNodePtr N,
   }
 
   // Compute permutations of all children.
-  std::vector<std::vector<TreePatternNodePtr>> ChildVariants;
-  ChildVariants.resize(N->getNumChildren());
+  std::vector<std::vector<TreePatternNodePtr>> ChildVariants(
+      N->getNumChildren());
   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
     GenerateVariantsOf(N->getChildShared(i), ChildVariants[i], CDP, DepVars);