Displaying 4 results from an estimated 4 matches for "affinitiy".
Did you mean:
affinities
2016 Jun 03
2
PBQP register allocation and copy propagation
...a RN for
node A and want to compute the costs for choosing register %Ri. The current
implementation does this by computing min(row/column i of edge A <--> B)
but you can do better by adding B's cost vector to the row/column before
computing the minimum. This way you also consider B's affinitiy for %R0.
In fact, it seems even worse than this; if RN is used, then all neighbors
are disconnected. So during backpropagation, unless I'm missing something,
it seems we will only ever consider the node cost, never adding in any edge
cost.
On Fri, 3 Jun 2016 at 19:04 James Molloy <james at...
2016 Jun 04
2
PBQP register allocation and copy propagation
...a RN for node A and want to compute the costs for choosing register %Ri. The current implementation does this by computing min(row/column i of edge A <--> B) but you can do better by adding B's cost vector to the row/column before computing the minimum. This way you also consider B's affinitiy for %R0.
The current solver does not use an "RN" rule as such (certainly nothing comparable to what was discussed in the 2002 Scholz/Eckstein paper). We have a heuristic rule for selecting nodes for reduction, but we do not propagate costs from heuristically reduced nodes until backpropa...
2016 Jun 03
2
PBQP register allocation and copy propagation
...a RN for node A and want to compute the costs for choosing register %Ri. The current implementation does this by computing min(row/column i of edge A <--> B) but you can do better by adding B's cost vector to the row/column before computing the minimum. This way you also consider B's affinitiy for %R0.
Now the reduction order is arbitrary and local costs aren't propagated unlike R1 and R2. In fact, there is a rule "RM" proposed by Buchwald [1] that seeks to fix a very similar case to this.
Porting RM to that situation would basically say "always fulfill this affinit...
2016 Jun 02
2
PBQP register allocation and copy propagation
Hi Lang and Arnaud,
I've been testing out the PBQP allocator for Thumb-2 and have ran into a
problem I'd love to get your input on.
The problem is exemplfied in the codegen for the function @bar in the
attached IR file:
bar:
push {r4, lr}
sub sp, #12
(1) movw r2, :lower16:.L_MergedGlobals
(1) movt r2, :upper16:.L_MergedGlobals
ldm.w r2,