[PATCH] Choose the best consecutive candidate for a store instruction in SLP vectorizer

[Chad Rosier]

Minor nits.


REPOSITORY
  rL LLVM

================
Comment at: lib/Transforms/Vectorize/SLPVectorizer.cpp:3250
@@ +3249,3 @@
+    IndexQueue.clear();
+    // If a store has multiple consectutive store candidates, search Stores
+    // array according to the sequence: from i+1 to e, then from i-1 to 0.
----------------
consecutive

================
Comment at: test/Transforms/SLPVectorizer/X86/pr23510.ll:6
@@ +5,3 @@
+target triple = "x86_64-unknown-linux-gnu"
+
+; CHECK: lshr <2 x i64>
----------------
; CHECK-LABEL: @_Z3fooPml(

http://reviews.llvm.org/D10445

EMAIL PREFERENCES
  http://reviews.llvm.org/settings/panel/emailpreferences/