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 | 4ee93cd45b517077b6c615fc200b00c94629c362 (patch) | |
| tree | 3c1b305da187fb32097f78668203b4b1396ae188 /llvm/docs | |
| parent | 299475e0c6b794e7ad138693ed0feb76f2ee62f5 (diff) | |
| download | bcm5719-llvm-4ee93cd45b517077b6c615fc200b00c94629c362.tar.gz bcm5719-llvm-4ee93cd45b517077b6c615fc200b00c94629c362.zip | |
Missing word
llvm-svn: 178774
Diffstat (limited to 'llvm/docs')
| -rw-r--r-- | llvm/docs/Passes.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/docs/Passes.rst b/llvm/docs/Passes.rst index 9cb8ba0c34b..d279eca3afb 100644 --- a/llvm/docs/Passes.rst +++ b/llvm/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. |
