Displaying 4 results from an estimated 4 matches for "vrega".
Did you mean:
vreg
2016 Jun 02
2
PBQP register allocation and copy propagation
...something
better with the reduction order.
This ties in with another problem I'm seeing with a prototype live-range
splitter for PBQP. Obviously when pre-splitting around every instruction,
many copies are inserted. But the above problem rears its head again!
Consider this:
%vregB = COPY %R0
%vregA = COPY %vregB
COPY
A <------> B
Node B has an affinity for register R0. The affinity edge between A and B
is a simple coalescing affinity (identity matrix). If B is assigned first,
it will get R0 and then A will also select R0. However if A is selected
first then it doesn't know...
2016 Jun 03
2
PBQP register allocation and copy propagation
...something better with the reduction order.
This ties in with another problem I'm seeing with a prototype live-range splitter for PBQP. Obviously when pre-splitting around every instruction, many copies are inserted. But the above problem rears its head again! Consider this:
%vregB = COPY %R0
%vregA = COPY %vregB
COPY
A <------> B
Node B has an affinity for register R0. The affinity edge between A and B is a simple coalescing affinity (identity matrix). If B is assigned first, it will get R0 and then A will also select R0. However if A is selected first then it doesn't know...
2016 Jun 03
2
PBQP register allocation and copy propagation
...#39;m seeing with a prototype live-range
>> splitter for PBQP. Obviously when pre-splitting around every instruction,
>> many copies are inserted. But the above problem rears its head again!
>> Consider this:
>>
>>
>>
>> %vregB = COPY %R0
>>
>> %vregA = COPY %vregB
>>
>>
>>
>> COPY
>>
>> A <------> B
>>
>>
>>
>> Node B has an affinity for register R0. The affinity edge between A and B
>> is a simple coalescing affinity (identity matrix). If B is assigned first,
>&...
2016 Jun 04
2
PBQP register allocation and copy propagation
...something better with the reduction order.
This ties in with another problem I'm seeing with a prototype live-range splitter for PBQP. Obviously when pre-splitting around every instruction, many copies are inserted. But the above problem rears its head again! Consider this:
%vregB = COPY %R0
%vregA = COPY %vregB
COPY
A <------> B
Node B has an affinity for register R0. The affinity edge between A and B is a simple coalescing affinity (identity matrix). If B is assigned first, it will get R0 and then A will also select R0. However if A is selected first then it doesn't know...