RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00
Code Issues Projects Releases Wiki Activity

Missing word

Browse Source 
llvm-svn: 178774
This commit is contained in:
Eli Bendersky 2013-04-04 18:29:19 +00:00
parent a53fa8d450
commit 91eef1d3c8
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/Passes.rst
View File

@ -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.