------- Comment #2 from spop at gcc dot gnu dot org 2008-09-11 16:47 ------- Jan proposed to switch to a different algorithm for detecting scops based on the fact that scops are single entry, single exit regions.
Instead of detecting scops from the innermost to the outermost, we should instead build a tree of SESE regions, then from the outermost SESE ask whether the region contains side effects, in which case we can walk down to an inner SESE region that does not contain side effects. When a SESE does not contain side effects, and does contain interesting code for graphite, i.e. loops, we do build a scop for it. We are working on an implementation of this algorithm. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=37372