search for: 5e19f134

I tested the "restricted" keyword and it works well :) The generated code is a bunch of shufflevector instructions, but after a second -O3 pass, everything looks fine. This problem is described in my ML post "passes propose passes" and occurs here again. LLVM has so much great passes, but they cannot start again when the code was somewhat simplified :( Maybe that's one

On Mon, 2012-02-13 at 11:11 +0100, Carl-Philip Hänsch wrote: > I will test your suggestion, but I designed the test case to load the > memory directly into <4 x float> registers. So there is absolutely no > permutation and other swizzle or move operations. Maybe the heuristic > should not only count the depth but also the surrounding load/store > operations. I've attached

...load/store operations vectorized, too? (I designed the test > > case to completely fit the SSE registers) > > > > 2012/2/10 Hal Finkel -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120214/5e19f134/attachment.html>