The C2 escape analysis algorithm relies on an "intermediate structure" called the connection graph, which tracks escaping information of relevant (e.g. objects, fields, etc.) entities.

Currently, this connection graph can be approximated through IGV (with the "Show only connection graph nodes" filter), although it is not complete. As there is a 1-1 relation with connection graph nodes and IR nodes, half of the information is already there, with only the edges remaining.

It should be possible to view this connection graph fully through a new IGV view. A new sub-graph could be dumped in the relevant phases to achieve this purpose.