From: Alon Zakai <azakai@google.com>
Date: Wed, 27 Mar 2019 20:12:42 +0000 (+0000)
Subject: [WebAssembly] Add some whitespace to WebAssemblyFixIrreducibleControlFlow
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=631103abab3f4c5c3027081f4404db6e4c3b57ca;p=llvm

[WebAssembly] Add some whitespace to WebAssemblyFixIrreducibleControlFlow

Differential Revision: https://reviews.llvm.org/D59855

modified:   llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@357117 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp b/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp
index 4e309f909f3..adaf8ee3785 100644
--- a/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp
+++ b/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp
@@ -26,6 +26,7 @@
 /// single entry in the loop containing the previous multiple entries. After
 /// ensuring all the loops in a region are reducible, we recurse into them. The
 /// total time complexity of this pass is:
+///
 ///   O(NumBlocks * NumNestedLoops * NumIrreducibleLoops +
 ///     NumLoops * NumLoops)
 ///
@@ -38,6 +39,7 @@
 /// irreducibility. The graph algorithms for finding loops and entries and so
 /// forth are also similar to the Relooper. The main differences between this
 /// pass and the Relooper are:
+///
 ///  * We just care about irreducibility, so we just look at loops.
 ///  * The Relooper emits structured control flow (with ifs etc.), while we
 ///    emit a CFG.