I can be of more beneficial :-)
Cheers
Zhouyi
> -Original Messages-
> From: "Vladimir Makarov"
> Sent Time: Thursday, June 25, 2015
> To: "Zhouyi Zhou" , gcc-patches@gcc.gnu.org
> Cc:
> Subject: Re: [PATCH IRA] save a bitmap check
>
> On 06
On 06/25/2015 11:08 AM, Vladimir Makarov wrote:
On 06/24/2015 05:54 AM, Zhouyi Zhou wrote:
In function assign_hard_reg, checking the bit of conflict_a in
consideration_allocno_bitmap is unneccesary, because when retry_p is
false, conflicting objects are always inside of the same loop_node
(this
On 06/24/2015 05:54 AM, Zhouyi Zhou wrote:
In function assign_hard_reg, checking the bit of conflict_a in
consideration_allocno_bitmap is unneccesary, because when retry_p is
false, conflicting objects are always inside of the same loop_node
(this is ensured in function process_bb_node_lives whic
On 06/24/2015 03:54 AM, Zhouyi Zhou wrote:
In function assign_hard_reg, checking the bit of conflict_a in
consideration_allocno_bitmap is unneccesary, because when retry_p is
false, conflicting objects are always inside of the same loop_node
(this is ensured in function process_bb_node_lives whi
In function assign_hard_reg, checking the bit of conflict_a in
consideration_allocno_bitmap is unneccesary, because when retry_p is
false, conflicting objects are always inside of the same loop_node
(this is ensured in function process_bb_node_lives which marks the
living objects to death near t
