https://gcc.gnu.org/bugzilla/show_bug.cgi?id=102943
--- Comment #45 from Andrew Macleod <amacleod at redhat dot com> --- (In reply to Richard Biener from comment #43) > (In reply to Andrew Macleod from comment #42) > > (In reply to Richard Biener from comment #37) > > > I'm looking at range_def_chain::m_def_chain, it's use is well obfuscated > > > by > > > inheritance but comments suggest that we have one such structure either > > > for > > > each edge in the CFG or for each basic-block. In particular this > > > > There is one structure per ssa-name globally. > [...] > > so its just O(ssa-name) already. > > so you mean O(num-ssa-names^2) since if it exists for each SSA name then > we have m_def_chain (of length num-ssa-names) for each SSA name? That's > what I originally feared, but I failed to find the array(?) that stores > the range_def_chains. no O(num_ssa_names). There is a single gori_compute object in ranger, which inherits from a gori-map (which manages imports/exports list for blocks), which inherits from the range_def_chain class. There is a single m_def_chain[] vector for all of ranger. so one entry per ssa-name. each ssa-name has a single rdc structure.
