From e9e01cc73a8d87b567afe3d217fefe92a1a347db Mon Sep 17 00:00:00 2001 From: Alon Zakai Date: Wed, 27 Mar 2019 20:12:42 +0000 Subject: [PATCH] [WebAssembly] Add some whitespace to WebAssemblyFixIrreducibleControlFlow Differential Revision: https://reviews.llvm.org/D59855 modified: llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp llvm-svn: 357117 --- .../Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp | 2 ++ 1 file changed, 2 insertions(+) diff --git a/llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp b/llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp index 4e309f909f305..adaf8ee3785e7 100644 --- a/llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp +++ b/llvm/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.