Patchwork [36/44] Fix comments.

login
register
mail settings
Submitter Sebastian Pop
Date Sept. 30, 2010, 6:01 p.m.
Message ID <1285869696-10915-37-git-send-email-sebpop@gmail.com>
Download mbox | patch
Permalink /patch/66223/
State New
Headers show

Comments

Sebastian Pop - Sept. 30, 2010, 6:01 p.m.
From: spop <spop@138bc75d-0d04-0410-961f-82ee72b054a4>

2010-09-09  Sebastian Pop  <sebastian.pop@amd.com>

	* graphite-flattening.c: Fix comments.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/branches/graphite@164129 138bc75d-0d04-0410-961f-82ee72b054a4
---
 gcc/ChangeLog             |    4 ++++
 gcc/ChangeLog.graphite    |    4 ++++
 gcc/graphite-flattening.c |   10 ++++++++--
 3 files changed, 16 insertions(+), 2 deletions(-)

Patch

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index ff91fff..61c31d7 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,5 +1,9 @@ 
 2010-09-30  Sebastian Pop  <sebastian.pop@amd.com>
 
+	* graphite-flattening.c: Fix comments.
+
+2010-09-30  Sebastian Pop  <sebastian.pop@amd.com>
+
 	* Makefile.in (OBJS-common): Add graphite-flattening.o.
 	(graphite-flattening.o): New rule.
 	* common.opt (floop-flatten): New flag.
diff --git a/gcc/ChangeLog.graphite b/gcc/ChangeLog.graphite
index 7e0e887..00ab005 100644
--- a/gcc/ChangeLog.graphite
+++ b/gcc/ChangeLog.graphite
@@ -1,5 +1,9 @@ 
 2010-09-09  Sebastian Pop  <sebastian.pop@amd.com>
 
+	* graphite-flattening.c: Fix comments.
+
+2010-09-09  Sebastian Pop  <sebastian.pop@amd.com>
+
 	* Makefile.in (OBJS-common): Add graphite-flattening.o.
 	(graphite-flattening.o): New rule.
 	* common.opt (floop-flatten): New flag.
diff --git a/gcc/graphite-flattening.c b/gcc/graphite-flattening.c
index 0f98337..c026ffc 100644
--- a/gcc/graphite-flattening.c
+++ b/gcc/graphite-flattening.c
@@ -55,6 +55,12 @@  along with GCC; see the file COPYING3.  If not see
    then apply on the full loop body, without needing the outer-loop
    vectorization.
 
+   The loop flattening pass that has been described in a very Fortran
+   specific way in the 1992 paper by Reinhard von Hanxleden and Ken
+   Kennedy: "Relaxing SIMD Control Flow Constraints using Loop
+   Transformations" available from
+   http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.5033
+
    The canonical example is as follows: suppose that we have a loop
    nest with known iteration counts
 
@@ -95,11 +101,11 @@  along with GCC; see the file COPYING3.  If not see
    |   }
    | }
 
-   For an arbitrarily complex loop nests the algorithm proceeds in two
+   For an arbitrarily complex loop nest the algorithm proceeds in two
    steps.  First, the LST is flattened by removing the loops structure
    and by inserting the statements in the order they appear in
    depth-first order.  Then, the scattering of each statement is
-   transformed such that it
+   transformed accordingly.
 
    Supposing that the original program is represented by the following
    LST: