Ping: [PATCH V2] IRA: Speed up setup_left_conflict_sizes_p

[Vladimir Makarov]

On 2015-03-23 9:50 PM, Zhouyi Zhou wrote:
> Hi Vladimir,
>   I am studying IRA in my offer hours because it is marvellous and very educative.

Thanks.  If you are interesting in RA whose code is available, you could
also look at Fred Chow's RA code in Pathscale compiler.
 
>   Did you get a chance to look at the below patch.
>   The elements of allocno_hard_regs_subnode_index are setup in function 
> setup_allocno_hard_regs_subnode_index where elements representing subnodes of a node
> are nonegative. I think we can avoid involving the parent itself into the loop below 
> because when the loop invariant i == 0, allocno_hard_regs_nodes[i + node_preorder_num]
> will be current node, I guess we are not interested in computing left conflict subnodes
> size of current node's parent in current function context.
>
Thanks for the patch.  I believe your patch is doing a right thing.  It
should be committed but I'd rather wait for stage1 start which probably
will happen in 2-3 weeks.

I'll commit your patch right after stage1 start.  If I don't do this at
this time, please ping me again, Zhouyi.