http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23384
--- Comment #7 from rguenther at suse dot de <rguenther at suse dot de> --- On Tue, 7 Jan 2014, steven at gcc dot gnu.org wrote: > http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23384 > > --- Comment #6 from Steven Bosscher <steven at gcc dot gnu.org> --- > (In reply to Richard Biener from comment #5) > > Would it be possible to compute ESCAPED per basic block as a local set, > compute transitive closure over the CFG, and use that information when > constructing the points-to graph? Well, ESCAPED is computed by solving the points-to graph ... also "transitive closing" over the CFG isn't easily possible without doing a full points-to graph solving. I think more flow-sensitivity asks for a entirely different algorithm (or - just a weird quick idea - marking constraints with a "flow" version, and during solving only consider "older" edges/constraints and only when that converged bump the "age" of the solving process. that's probably equivalent to incrementally building / solving the points-to graph for all SESE regions in a dominator order)
