Hi skimo, On Tue, Sep 26, 2017 at 10:15 AM, Sven Verdoolaege < sven.verdoola...@gmail.com> wrote:
> On Tue, Sep 26, 2017 at 09:19:50AM -0500, Sebastian Pop wrote: > > Sven, is there already a function that computes the sum of all > > strides in a proximity map? Maybe you have code that does > > something similar in pet or ppcg? > > What exactly do you want to sum? If this involves any counting, then it cannot currently > I think that it does involve counting: we need to know the distance between all pairs of array accesses, that is the number of points in the dependence polyhedron. > be done in pet or ppcg since isl does not support counting yet > and the public version of barvinok is GPL licensed. > > Also, it's better to ask such questions on the isl mailing list > isl-developm...@googlegroups.com > > We are trying to find a metric that shows that isl's scheduler did a useful transform. Something like a diff tool that shows before and after scheduling the strides of array accesses. Could the isl scheduler output a description of what it did? We would like to use that output to build testcases that match the behavior of the compiler on different patterns. Thanks, Sebastian
