From e4e00f2cfecea7649dee554f815531084347c1ef Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Thu, 18 Oct 2012 05:46:16 +0000 Subject: 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 --- docs/ReleaseNotes.html | 12 ++++++++++-- 1 file changed, 10 insertions(+), 2 deletions(-) (limited to 'docs/ReleaseNotes.html') diff --git a/docs/ReleaseNotes.html b/docs/ReleaseNotes.html index ea29ccee97..26c5213b12 100644 --- a/docs/ReleaseNotes.html +++ b/docs/ReleaseNotes.html @@ -466,9 +466,17 @@ Release Notes.

In addition to many minor performance tweaks and bug fixes, this release includes a few major enhancements and additions to the optimizers:

-

Loop Vectorizer - We've added a basic loop vectorizer and we are now able +

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.

+ can be enabled using the -mllvm -vectorize flags. We can vectorize this code: + + 
+    for (i=0; i<n; i++) {
+      a[i] = b[i+1] + c[i+3] + i;
+    }
+
+ +