https://gcc.gnu.org/bugzilla/show_bug.cgi?id=99395
--- Comment #9 from Richard Biener <rguenth at gcc dot gnu.org> --- (In reply to JuzheZhong from comment #8) > Hi, Richard. > > Now, I find the time to GCC vectorization optimization. > > I find this case: > > _2 = a[_1]; > ... > a[i_16] = _4; > ,,, > _7 = a[_1]; ---> This load should be eliminated and re-use _2. > > Am I right ? > > Could you guide me which pass should do this CSE optimization ? > > Thanks. In principle it's value-numbering. The reason it doesn't do this is compile-time cost of doing full data-ref analysis. In principle it's as "easy" as hooking that up into vn_reference_lookup_3 as part of the early work therein to disambiguate more defs. Iff we chose to refrain from valueizing any of the SSA uses we could cache both the data references and the dependence resolution. One could also think of doing very simple recognition of these single index expressions and / or integrating this with other cases. IIRC there's some warranting SCEV processing / niter analysis as well for example to figure that for (int i = 0; i < 128; ++i) a[i] = 1; return a[5]; returns 1.
