Question on mapping old to specialized cgraph_edges

Question on mapping old to specialized cgraph_edges

[Erick Ochoa]

Hi,

I am trying to find a map between cgraph_edge*s before ipa-cp and after
ipa-cp has specialized nodes. Does anyone know if such a map is available?
Or an equivalent? I think technically it should be a map between:

(cgraph_node* caller, cgraph_edge* e, cgraph_node *callee) X (cgraph_node*
caller', cgraph_edge* e', cgraph_node *callee')

since both caller and callee may be updated during ipa-cp. But any help or
direction is appreciated.

Thanks!

Re: Question on mapping old to specialized cgraph_edges

[Martin Jambor]

Hi Erik,

On Wed, Mar 09 2022, Erick Ochoa via Gcc wrote:
> Hi,
>
> I am trying to find a map between cgraph_edge*s before ipa-cp and after
> ipa-cp has specialized nodes. Does anyone know if such a map is available?
> Or an equivalent? I think technically it should be a map between:
>

Generally there isn't.  IPA-CP however needs it itself and so constructs
it in edge_clone_summaries.  But the summaries are freed after the
IPA-analysis phase of the pass - and it would take work to keep it
somehow updated during following IPA passes (especially inlining).

Martin