Add a small example which shows a vectorizable loop with a non-pow-of-two count

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@166169 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nadav Rotem 2012-10-18 05:46:16 +00:00
parent 3b9a911efc
commit e4e00f2cfe

View File

@ -466,9 +466,17 @@ Release Notes</a>.</h1>
<p>In addition to many minor performance tweaks and bug fixes, this release
includes a few major enhancements and additions to the optimizers:</p>
<p> Loop Vectorizer - We've added a basic loop vectorizer and we are now able
<p> Loop Vectorizer - We've added a basic loop vectorizer and we are now able
to vectorize small loops. The loop vectorizer is disabled by default and
can be enabled using the -mllvm -vectorize flags. </p>
can be enabled using the -mllvm -vectorize flags. We can vectorize this code:
<pre class="doc_code">
for (i=0; i&lt;n; i++) {
a[i] = b[i+1] + c[i+3] + i;
}
</pre>
</p>
<ul>
<li>...</li>