mirrors/gcc
0
0
Fork 0
mirror of https://gcc.gnu.org/git/gcc.git synced 2025-01-12 22:14:18 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

dependency.c (gfc_check_element_vs_element): Revert last change.

Browse Source 
* dependency.c (gfc_check_element_vs_element): Revert last change.

	* gfortran.dg/dependency_9.f90: Remove for the time being.

From-SVN: r111703
This commit is contained in:
Roger Sayle 2006-03-04 02:40:45 +00:00 committed by Roger Sayle
parent 32b830e773
commit 636ffc571b
4 changed files with 9 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gcc/fortran/ChangeLog
View File

@ -1,3 +1,7 @@
2006-03-03 Roger Sayle <roger@eyesopen.com>
* dependency.c (gfc_check_element_vs_element): Revert last change.
2006-03-03 Roger Sayle <roger@eyesopen.com>
* dependency.c (gfc_check_element_vs_element): Consider two

8
gcc/fortran/dependency.c
View File

@ -739,14 +739,8 @@ gfc_check_element_vs_element (gfc_ref * lref, gfc_ref * rref, int n)
i = gfc_dep_compare_expr (r_start, l_start);
if (i == 0)
return GFC_DEP_EQUAL;
/* Treat two scalar variables as potentially equal. This allows
us to prove that a(i,:) and a(j,:) have no dependency. See
Gerald Roth, "Evaluation of Array Syntax Dependence Analysis",
Proceedings of the International Conference on Parallel and
Distributed Processing Techniques and Applications (PDPTA2001),
Las Vegas, Nevada, June 2001. This used to be GFC_DEP_OVERLAP. */
if (i == -2)
return GFC_DEP_EQUAL;
return GFC_DEP_OVERLAP;
return GFC_DEP_NODEP;
}

4
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,7 @@
2006-03-04 Roger Sayle <roger@eyesopen.com>
* gfortran.dg/dependency_9.f90: Remove for the time being.
2006-03-04 Krister Walfridsson <cato@df.lth.se>
* objc.dg/bad-receiver-type.m: Add space before bracket in dg

13
gcc/testsuite/gfortran.dg/dependency_9.f90
View File

@ -1,13 +0,0 @@
! { dg-do compile }
! { dg-options "-O2 -fdump-tree-original" }
subroutine foo(a,i,j)
integer, dimension (4,4) :: a
integer :: i
integer :: j
where (a(i,:) .ne. 0)
a(j,:) = 1
endwhere
end subroutine
! { dg-final { scan-tree-dump-times "malloc" 0 "original" } }
! { dg-final { cleanup-tree-dump "original" } }