------- Comment #42 from potswa at mac dot com 2009-10-30 19:14 ------- Sorry, "once per ring" doesn't guarantee more than one pass for k=2 and n odd, or the test case I presented. Better to say there are k passes, although performance should improve for n/k on the order of cache associativity. Details not really important.
-- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=41351
