OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

graphite-interchange.c: Fix comments.

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

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

From-SVN: r154598
This commit is contained in:
Sebastian Pop 2009-11-25 05:12:07 +00:00 committed by Sebastian Pop
parent 9b196c9394
commit 009150e1fc
3 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog.graphite
View File

@ -1,3 +1,8 @@
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.

3
gcc/graphite-interchange.c
View File

@ -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

3
gcc/testsuite/gcc.dg/graphite/block-1.c
View File

@ -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];