Computes, for every function-definition vertex F, summary(F) = own(F) unioned with summary(G) over every transitive callee G.
F
summary(F) = own(F)
summary(G)
G
the fully linked dataflow graph
the effects a single function definition produces itself (its contribution to the summary)
a map from each function-definition vertex to its transitive-effect summary
Computes, for every function-definition vertex
F,summary(F) = own(F)unioned withsummary(G)over every transitive calleeG.