2009-10-16 Sebastian Pop <sebastian.pop@amd.com>

	* graphite-interchange.c: Fix comments.
	* gcc.dg/graphite/block-1.c: Fix comments.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@154598 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/ChangeLog.graphite b/gcc/ChangeLog.graphite
index 60f378a..195aaae 100644 (file)
--- a/gcc/ChangeLog.graphite
+++ b/gcc/ChangeLog.graphite
@@ -1,5 +1,10 @@
 2009-10-16  Sebastian Pop  <sebastian.pop@amd.com>
 
+       * graphite-interchange.c: Fix comments.
+       * gcc.dg/graphite/block-1.c: Fix comments.
+
+2009-10-16  Sebastian Pop  <sebastian.pop@amd.com>
+
        * gcc.dg/graphite/interchange-7.c: Un-XFAILed.
        * gcc.dg/graphite/interchange-9.c: Un-XFAILed.
 

diff --git a/gcc/graphite-interchange.c b/gcc/graphite-interchange.c
index 0e432ce..8926ac3 100644 (file)
--- a/gcc/graphite-interchange.c
+++ b/gcc/graphite-interchange.c
@@ -310,7 +310,8 @@ memory_stride_in_loop (Value stride, graphite_dim_t depth, poly_dr_p pdr)
 
    Next, to measure the impact of iterating once in loop "i", we build
    a maximization problem: first, we add to DR accesses the dimensions
-   k, s2, s3, L1 = 100 * s0 + s1, L2, and D1: polyhedron P1.
+   k, s2, s3, L1 = 100 * s0 + s1, L2, and D1: this is the polyhedron P1.
+   L1 and L2 are the linearized memory access functions.
 
    | i   j   N   a  s0  s1   k  s2  s3  L1  L2  D1   1
    | 0   0   0   1   0   0   0   0   0   0   0   0  -5    = 0  alias = 5

diff --git a/gcc/testsuite/gcc.dg/graphite/block-1.c b/gcc/testsuite/gcc.dg/graphite/block-1.c
index 7eb3866..35c5c6a 100644 (file)
--- a/gcc/testsuite/gcc.dg/graphite/block-1.c
+++ b/gcc/testsuite/gcc.dg/graphite/block-1.c
@@ -26,9 +26,6 @@ int main()
 
   bar ();
 
-  /* FIXME: For now, reductions are not handled by the code generation
-     of graphite.  We have to bound the scop to the above loops.  */
-
   for(i = 0; i < MAX; i++)
     for(j = 0; j < MAX; j++)
       sum += A[i*MAX + j];