search for: vregd

Displaying 4 results from an estimated 4 matches for "vregd".

Did you mean: vreg
2016 Jun 02
2
PBQP register allocation and copy propagation
...register, causing a MOV. The above trivial example would be reduced by rule R1, so would actually work optimally (because the reduction would account for B's costs in A). However it is trivial to add two or more interfering defs that cause the reduction rule to change to RN: %vregC = def... %vregD = def... %vregB = COPY %R0 %vregA = COPY %vregB = use %vregC, %vregD 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. What do you thin...
2016 Jun 03
2
PBQP register allocation and copy propagation
...register, causing a MOV. The above trivial example would be reduced by rule R1, so would actually work optimally (because the reduction would account for B's costs in A). However it is trivial to add two or more interfering defs that cause the reduction rule to change to RN: %vregC = def... %vregD = def... %vregB = COPY %R0 %vregA = COPY %vregB = use %vregC, %vregD I think one idea to improve the situation is to consider the cost vector of adjacent nodes during RN. Let's say you decided to do a RN for node A and want to compute the costs for choosing register %Ri. The current impl...
2016 Jun 03
2
PBQP register allocation and copy propagation
..., so would actually >> work optimally (because the reduction would account for B's costs in A). >> However it is trivial to add two or more interfering defs that cause the >> reduction rule to change to RN: >> >> >> >> %vregC = def... >> >> %vregD = def... >> >> %vregB = COPY %R0 >> >> %vregA = COPY %vregB >> >> = use %vregC, %vregD >> >> I think one idea to improve the situation is to consider the cost vector >> of adjacent nodes during RN. Let's say you decided to do a RN for...
2016 Jun 04
2
PBQP register allocation and copy propagation
...register, causing a MOV. The above trivial example would be reduced by rule R1, so would actually work optimally (because the reduction would account for B's costs in A). However it is trivial to add two or more interfering defs that cause the reduction rule to change to RN: %vregC = def... %vregD = def... %vregB = COPY %R0 %vregA = COPY %vregB = use %vregC, %vregD I think one idea to improve the situation is to consider the cost vector of adjacent nodes during RN. Let's say you decided to do a RN for node A and want to compute the costs for choosing register %Ri. The current impl...