diff options
| author | Eli Bendersky <eliben@google.com> | 2013-04-04 18:29:19 +0000 |
|---|---|---|
| committer | Eli Bendersky <eliben@google.com> | 2013-04-04 18:29:19 +0000 |
| commit | 8256a98847ea90fae11ee95a0a3089e60f623b84 (patch) | |
| tree | 3d9c64e06554ef1fe4d4e8ba766ed434efea4a4d /docs | |
| parent | ee27cac9fac622d3198d4a53130f04653ad09d37 (diff) | |
Missing word
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178774 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/Passes.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/docs/Passes.rst b/docs/Passes.rst index 9cb8ba0c34..d279eca3af 100644 --- a/docs/Passes.rst +++ b/docs/Passes.rst @@ -1018,8 +1018,8 @@ possible, it transforms the individual ``alloca`` instructions into nice clean scalar SSA form. This combines a simple scalar replacement of aggregates algorithm with the -:ref:`mem2reg <passes-mem2reg>` algorithm because often interact, especially -for C++ programs. As such, iterating between ``scalarrepl``, then +:ref:`mem2reg <passes-mem2reg>` algorithm because they often interact, +especially for C++ programs. As such, iterating between ``scalarrepl``, then :ref:`mem2reg <passes-mem2reg>` until we run out of things to promote works well. |