On Sun, Mar 22, 2015 at 10:10 PM, Oleg Endo <oleg.e...@t-online.de> wrote: > The PBQP approach is indeed very tempting, but there > are a lot more things to it than just the solver. To get good > improvements of the generated code, the optimization also has to be able > to reorder memory accesses and perform other transformations such as > converting pre-inc into post-inc modes in loops etc.
I confess there are some optimizations that the PBQP approach doesn't take into account, like reordering the instructions. Could you elaborate a bit on the prec-inc to post-inc conversion? I might be missing something, but I think the PBQP algorithm should have no problem transforming the addressing mode to post-inc if that makes the overall cost less. Of course, PBQP is just one approach, and I would be willing to try other methods. > Although my point of view is a bit > SH biased, I believe that once it's working on SH, other platforms will > benefit from it. Yeah, it's probably a good idea to implement AMS for a specific platform first, and SH does have a variety of addressing modes. > The scope would > need to be narrowed down a bit for a GSoC project, but if you want, we > could give it a try and I would step forward as a mentor. I'd like to give this a try, I'm sure a lot could be achieved in a summer. Could you share how you planned to approach the problem? I'd also be interested in some of the papers you found (I haven't yet been able to find much on the subject apart from the PBQP method). Best regards, Erik
