public inbox for gcc-bugs@sourceware.org
help / color / mirror / Atom feed
From: "Joost.VandeVondele at mat dot ethz.ch" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug middle-end/53852] New: -ftree-loop-linear: large compile time / memory usage
Date: Wed, 04 Jul 2012 11:19:00 -0000 [thread overview]
Message-ID: <bug-53852-4@http.gcc.gnu.org/bugzilla/> (raw)
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53852
Bug #: 53852
Summary: -ftree-loop-linear: large compile time / memory usage
Classification: Unclassified
Product: gcc
Version: 4.8.0
Status: UNCONFIRMED
Severity: normal
Priority: P3
Component: middle-end
AssignedTo: unassigned@gcc.gnu.org
ReportedBy: Joost.VandeVondele@mat.ethz.ch
Current trunk (189233) has >X Gb of memory usage (before I have to kill the
compilation) on the following testcase with:
gfortran -O2 -ftree-loop-linear test.f90
SUBROUTINE build_d_tensor_gks(d1f, d2f, d3f, d4f, d5f, v, d1, d2, d3, d4,
d5)
INTEGER, PARAMETER :: dp=8
REAL(KIND=dp), DIMENSION(3), INTENT(OUT) :: d1f
REAL(KIND=dp), DIMENSION(3, 3), &
INTENT(OUT) :: d2f
REAL(KIND=dp), DIMENSION(3, 3, 3), &
INTENT(OUT) :: d3f
REAL(KIND=dp), DIMENSION(3, 3, 3, 3), &
INTENT(OUT) :: d4f
REAL(KIND=dp), &
DIMENSION(3, 3, 3, 3, 3), &
INTENT(OUT), OPTIONAL :: d5f
REAL(KIND=dp), DIMENSION(3), INTENT(IN) :: v
REAL(KIND=dp), INTENT(IN) :: d1, d2, d3, d4
REAL(KIND=dp), INTENT(IN), OPTIONAL :: d5
INTEGER :: k1, k2, k3, k4, k5
REAL(KIND=dp) :: w
d1f = 0.0_dp
d2f = 0.0_dp
d3f = 0.0_dp
d4f = 0.0_dp
DO k1=1,3
d1f(k1)=d1f(k1)+v(k1)*d1
ENDDO
DO k1=1,3
DO k2=1,3
d2f(k2,k1)=d2f(k2,k1)+v(k1)*v(k2)*d2
ENDDO
d2f(k1,k1)=d2f(k1,k1)+ d1
ENDDO
DO k1=1,3
DO k2=1,3
DO k3=1,3
d3f(k3,k2,k1)=d3f(k3,k2,k1)+v(k1)*v(k2)*v(k3)*d3
ENDDO
w=v(k1)*d2
d3f(k1,k2,k2)=d3f(k1,k2,k2)+w
d3f(k2,k1,k2)=d3f(k2,k1,k2)+w
d3f(k2,k2,k1)=d3f(k2,k2,k1)+w
ENDDO
ENDDO
DO k1=1,3
DO k2=1,3
DO k3=1,3
DO k4=1,3
d4f(k4,k3,k2,k1)=d4f(k4,k3,k2,k1)+ &
v(k1)*v(k2)*v(k3)*v(k4)*d4
ENDDO
w=v(k1)*v(k2)*d3
d4f(k1,k2,k3,k3)=d4f(k1,k2,k3,k3)+w
d4f(k1,k3,k2,k3)=d4f(k1,k3,k2,k3)+w
d4f(k3,k1,k2,k3)=d4f(k3,k1,k2,k3)+w
d4f(k1,k3,k3,k2)=d4f(k1,k3,k3,k2)+w
d4f(k3,k1,k3,k2)=d4f(k3,k1,k3,k2)+w
d4f(k3,k3,k1,k2)=d4f(k3,k3,k1,k2)+w
ENDDO
d4f(k1,k1,k2,k2)=d4f(k1,k1,k2,k2)+d2
d4f(k1,k2,k1,k2)=d4f(k1,k2,k1,k2)+d2
d4f(k1,k2,k2,k1)=d4f(k1,k2,k2,k1)+d2
ENDDO
ENDDO
IF (PRESENT(d5f).AND.PRESENT(d5)) THEN
d5f = 0.0_dp
DO k1=1,3
DO k2=1,3
DO k3=1,3
DO k4=1,3
DO k5=1,3
d5f(k5,k4,k3,k2,k1)=d5f(k5,k4,k3,k2,k1)+ &
v(k1)*v(k2)*v(k3)*v(k4)*v(k5)*d5
ENDDO
w=v(k1)*v(k2)*v(k3)*d4
d5f(k1,k2,k3,k4,k4)=d5f(k1,k2,k3,k4,k4)+w
d5f(k1,k2,k4,k3,k4)=d5f(k1,k2,k4,k3,k4)+w
d5f(k1,k4,k2,k3,k4)=d5f(k1,k4,k2,k3,k4)+w
d5f(k4,k1,k2,k3,k4)=d5f(k4,k1,k2,k3,k4)+w
d5f(k1,k2,k4,k4,k3)=d5f(k1,k2,k4,k4,k3)+w
d5f(k1,k4,k2,k4,k3)=d5f(k1,k4,k2,k4,k3)+w
d5f(k4,k1,k2,k4,k3)=d5f(k4,k1,k2,k4,k3)+w
d5f(k1,k4,k4,k2,k3)=d5f(k1,k4,k4,k2,k3)+w
d5f(k4,k1,k4,k2,k3)=d5f(k4,k1,k4,k2,k3)+w
d5f(k4,k4,k1,k2,k3)=d5f(k4,k4,k1,k2,k3)+w
ENDDO
w=v(k1)*d3
d5f(k1,k2,k2,k3,k3)=d5f(k1,k2,k2,k3,k3)+w
d5f(k1,k2,k3,k2,k3)=d5f(k1,k2,k3,k2,k3)+w
d5f(k1,k2,k3,k3,k2)=d5f(k1,k2,k3,k3,k2)+w
d5f(k2,k1,k2,k3,k3)=d5f(k2,k1,k2,k3,k3)+w
d5f(k2,k1,k3,k2,k3)=d5f(k2,k1,k3,k2,k3)+w
d5f(k2,k1,k3,k3,k2)=d5f(k2,k1,k3,k3,k2)+w
d5f(k2,k2,k1,k3,k3)=d5f(k2,k2,k1,k3,k3)+w
d5f(k2,k3,k1,k2,k3)=d5f(k2,k3,k1,k2,k3)+w
d5f(k2,k3,k1,k3,k2)=d5f(k2,k3,k1,k3,k2)+w
d5f(k2,k2,k3,k1,k3)=d5f(k2,k2,k3,k1,k3)+w
d5f(k2,k3,k2,k1,k3)=d5f(k2,k3,k2,k1,k3)+w
d5f(k2,k3,k3,k1,k2)=d5f(k2,k3,k3,k1,k2)+w
d5f(k2,k2,k3,k3,k1)=d5f(k2,k2,k3,k3,k1)+w
d5f(k2,k3,k2,k3,k1)=d5f(k2,k3,k2,k3,k1)+w
d5f(k2,k3,k3,k2,k1)=d5f(k2,k3,k3,k2,k1)+w
ENDDO
ENDDO
ENDDO
END IF
END SUBROUTINE build_d_tensor_gks
next reply other threads:[~2012-07-04 11:19 UTC|newest]
Thread overview: 23+ messages / expand[flat|nested] mbox.gz Atom feed top
2012-07-04 11:19 Joost.VandeVondele at mat dot ethz.ch [this message]
2012-07-04 11:54 ` [Bug middle-end/53852] " rguenth at gcc dot gnu.org
2012-07-04 12:11 ` matz at gcc dot gnu.org
2012-07-04 12:18 ` Joost.VandeVondele at mat dot ethz.ch
2012-07-04 12:44 ` [Bug tree-optimization/53852] [4.8 Regression] " rguenth at gcc dot gnu.org
2012-08-22 11:58 ` Joost.VandeVondele at mat dot ethz.ch
2012-12-06 16:25 ` rguenth at gcc dot gnu.org
2012-12-13 13:00 ` rguenth at gcc dot gnu.org
2013-02-07 9:05 ` Joost.VandeVondele at mat dot ethz.ch
2013-02-19 20:48 ` law at redhat dot com
2013-03-22 14:43 ` [Bug tree-optimization/53852] [4.8/4.9 " jakub at gcc dot gnu.org
2013-05-31 10:58 ` jakub at gcc dot gnu.org
2013-10-16 9:51 ` jakub at gcc dot gnu.org
2014-01-23 7:30 ` law at redhat dot com
2014-05-22 9:02 ` [Bug tree-optimization/53852] [4.8/4.9/4.10 " rguenth at gcc dot gnu.org
2014-12-19 13:41 ` [Bug tree-optimization/53852] [4.8/4.9/5 " jakub at gcc dot gnu.org
2015-06-23 8:23 ` [Bug tree-optimization/53852] [4.8/4.9/5/6 " rguenth at gcc dot gnu.org
2015-06-26 20:13 ` [Bug tree-optimization/53852] [4.9/5/6 " jakub at gcc dot gnu.org
2015-06-26 20:37 ` jakub at gcc dot gnu.org
2015-08-28 4:28 ` Joost.VandeVondele at mat dot ethz.ch
2015-08-28 14:29 ` spop at gcc dot gnu.org
2015-09-02 22:38 ` spop at gcc dot gnu.org
2015-09-09 4:23 ` spop at gcc dot gnu.org
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=bug-53852-4@http.gcc.gnu.org/bugzilla/ \
--to=gcc-bugzilla@gcc.gnu.org \
--cc=gcc-bugs@gcc.gnu.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).