[llvm] bbc7f09 - [TableGen][NFC] Remove leading spaces

[via llvm-commits]

Author: wangpc
Date: 2023-12-12T18:17:13+08:00
New Revision: bbc7f099590cb33b220c12bfe8f5c8ff7b7a5011

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

LOG: [TableGen][NFC] Remove leading spaces

Added: 
    

Modified: 
    llvm/utils/TableGen/DAGISelMatcherGen.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/utils/TableGen/DAGISelMatcherGen.cpp b/llvm/utils/TableGen/DAGISelMatcherGen.cpp
index fcc5e4d061c86..3526e97c8e08e 100644
--- a/llvm/utils/TableGen/DAGISelMatcherGen.cpp
+++ b/llvm/utils/TableGen/DAGISelMatcherGen.cpp
@@ -149,24 +149,24 @@ MatcherGen::MatcherGen(const PatternToMatch &pattern,
                        const CodeGenDAGPatterns &cgp)
     : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), TheMatcher(nullptr),
       CurPredicate(nullptr) {
-    // We need to produce the matcher tree for the patterns source pattern.  To
-    // do this we need to match the structure as well as the types.  To do the
-    // type matching, we want to figure out the fewest number of type checks we
-    // need to emit.  For example, if there is only one integer type supported
-    // by a target, there should be no type comparisons at all for integer
-    // patterns!
-    //
-    // To figure out the fewest number of type checks needed, clone the pattern,
-    // remove the types, then perform type inference on the pattern as a whole.
-    // If there are unresolved types, emit an explicit check for those types,
-    // apply the type to the tree, then rerun type inference.  Iterate until all
-    // types are resolved.
-    //
-    PatWithNoTypes = Pattern.getSrcPattern()->clone();
-    PatWithNoTypes->RemoveAllTypes();
+  // We need to produce the matcher tree for the patterns source pattern.  To
+  // do this we need to match the structure as well as the types.  To do the
+  // type matching, we want to figure out the fewest number of type checks we
+  // need to emit.  For example, if there is only one integer type supported
+  // by a target, there should be no type comparisons at all for integer
+  // patterns!
+  //
+  // To figure out the fewest number of type checks needed, clone the pattern,
+  // remove the types, then perform type inference on the pattern as a whole.
+  // If there are unresolved types, emit an explicit check for those types,
+  // apply the type to the tree, then rerun type inference.  Iterate until all
+  // types are resolved.
+  //
+  PatWithNoTypes = Pattern.getSrcPattern()->clone();
+  PatWithNoTypes->RemoveAllTypes();
 
-    // If there are types that are manifestly known, infer them.
-    InferPossibleTypes();
+  // If there are types that are manifestly known, infer them.
+  InferPossibleTypes();
 }
 
 /// InferPossibleTypes - As we emit the pattern, we end up generating type