Missing word
authorEli Bendersky <eliben@google.com>
Thu, 4 Apr 2013 18:29:19 +0000 (18:29 +0000)
committerEli Bendersky <eliben@google.com>
Thu, 4 Apr 2013 18:29:19 +0000 (18:29 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178774 91177308-0d34-0410-b5e6-96231b3b80d8

docs/Passes.rst

index 9cb8ba0c34bca6ddc9ece7ce3fd293f6df9e9e6d..d279eca3afb65ac3c9c41f57dd249074242b2265 100644 (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.