diff options
author | Alon Zakai <azakai@google.com> | 2019-03-27 20:12:42 +0000 |
---|---|---|
committer | Alon Zakai <azakai@google.com> | 2019-03-27 20:12:42 +0000 |
commit | e9e01cc73a8d87b567afe3d217fefe92a1a347db (patch) | |
tree | 4a4b11e2ba2db13b83cc2aa194c1e7c40f793363 /llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp | |
parent | c6dfaa0e836c1b63366b1010157538d9c346a8b3 (diff) | |
download | llvm-e9e01cc73a8d87b567afe3d217fefe92a1a347db.zip llvm-e9e01cc73a8d87b567afe3d217fefe92a1a347db.tar.gz llvm-e9e01cc73a8d87b567afe3d217fefe92a1a347db.tar.bz2 |
[WebAssembly] Add some whitespace to WebAssemblyFixIrreducibleControlFlow
Differential Revision: https://reviews.llvm.org/D59855
modified: llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp
llvm-svn: 357117
Diffstat (limited to 'llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp')
-rw-r--r-- | llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp b/llvm/lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp index 4e309f9..adaf8ee 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. |