[PATCH] D59855: [WebAssembly] Add some whitespace for clarity

[Alon Zakai via Phabricator via llvm-commits]

This revision was automatically updated to reflect the committed changes.
Closed by commit rL357117: [WebAssembly] Add some whitespace to WebAssemblyFixIrreducibleControlFlow (authored by azakai, committed by ).
Herald added a project: LLVM.
Herald added a subscriber: llvm-commits.

Changed prior to commit:
  https://reviews.llvm.org/D59855?vs=192389&id=192505#toc

Repository:
  rL LLVM

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D59855/new/

https://reviews.llvm.org/D59855

Files:
  llvm/trunk/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp


Index: llvm/trunk/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp
===================================================================
--- llvm/trunk/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp
+++ llvm/trunk/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.


-------------- next part --------------
A non-text attachment was scrubbed...
Name: D59855.192505.patch
Type: text/x-patch
Size: 1008 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20190327/620fda85/attachment.bin>