search for: 9e8176a5

...t and never updated, but since it's already there, we could come up with a few tests that would check the boundaries of a 30 loc piece, no? --renato -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131105/9e8176a5/attachment.html>

----- Original Message ----- > > On Oct 31, 2013, at 6:06 AM, Hal Finkel <hfinkel at anl.gov> wrote: > > > Hello, > > > > We currently generate suboptimal code for this loop: > > > > for (int i = 1; i < LEN; i++) { > > a[i] = a[0] + b[i]; > > } > > > > The largest problem is that we won't vectorize the loop because