search for: similar_

Hi All, I've more or less finished updating the examples to the DAG style we were talking about. Hopefully I haven't forgotten anything, there was a lot to keep track of :-). Overall, I think there's a couple places where things get a a little awkward (mainly debug info) but things generally look good to me. A Simple Example def : GICombineRule<(defs reg:$D, reg:$S),

...tions on the same result instruction, and there's no real means to include DEBUG_LOC for temporaries that are eliminated and need to be rebased from another value. > I have a more explicit example of this later. > > >> _'Upside-down' matches (i.e. roots at the top) and similar_ >> This one requires algorithm changes which I'd prefer not to discuss in this RFC. Assuming the underlying algorithm gains support for this, this is how the syntax would look: >> def : GICombineRule< >> (defs root:$root, reg:$A), >> (match [{MIR %1 = G_LOAD %root...

Hi All, I've been working on the GlobalISel combiner recently and I'd like to share the plan for how Combine Rules will be defined in GlobalISel and solicit feedback on it. This email ended up rather long so: TL;DR: We're planning to define GlobalISel Combine Rules using MIR syntax with a few bits glued on to interface with the algorithm and escape into C++ when we need to.

...something. I think we can use the same idea you suggested for subregisters: (DIVMOD $T1, $T2, $A, $B, (merge_debug_loc $DL1, $DL2)) >>> I have a more explicit example of this later. >>> >>> >>>> _'Upside-down' matches (i.e. roots at the top) and similar_ >>>> This one requires algorithm changes which I'd prefer not to discuss in this RFC. Assuming the underlying algorithm gains support for this, this is how the syntax would look: >>>> def : GICombineRule< >>>> (defs root:$root, reg:$A), >>>>...