Re: [GCC RFC]A new and simple pass merging paired load store instructions

[Jeff Law <law at redhat dot com>]

On 05/15/14 10:51, Mike Stump wrote:
> On May 15, 2014, at 12:26 AM, bin.cheng <bin.cheng@arm.com> wrote:
> > Here comes up with a new GCC pass looking through each basic block
> > and merging paired load store even they are not adjacent to each
> > other.
>
> So I have a target that has load and store multiple support that
> supports large a number of registers (2-n registers), and I added a
> sched0 pass that is a light copy of the regular scheduling pass that
> uses a different cost function which arranges all loads first, then
> all stores then everything else.  Within a group of loads or stores
> the secondary key is the base register, the next key is the offset.
> The net result, all loads off the same register are sorted in
> increasing order.
Glad to see someone else stumble on (ab)using the scheduler to do this.

I've poked at the scheduler several times to do similar stuff, but was 
never really satisfied with the results and never tried to polish those 
prototypes into something worth submitting.

One example I've poked at was discovery of stores which then feed into a 
load from the same location.  Which obviously we'd prefer to turn into a 
store + copy (subject to mess of constraints).  There's a handful of 
these kind of transformations that seem to naturally drop out of this 
kind of work.

Similarly a post-reload pass could be used to promote single word 
loads/stores to double-word operations.

If anyone cared about PA 1.1 code generation, it'd be a much cleaner way 
to support the non-fused fmpyadd fmpysub insns.

Anyway, if you want to move forward with the idea, I'd certainly support 
doing so.

jeff