This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/26854] [4.3/4.4 Regression] Inordinate compile times on large routines
- From: "lucier at math dot purdue dot edu" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 18 Sep 2008 01:19:07 -0000
- Subject: [Bug tree-optimization/26854] [4.3/4.4 Regression] Inordinate compile times on large routines
- References: <bug-26854-271@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #75 from lucier at math dot purdue dot edu 2008-09-18 01:19 -------
Created an attachment (id=16350)
--> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=16350&action=view)
statistics with checking enabled and using longs to count bytes
Using the patch from
http://gcc.gnu.org/ml/gcc-patches/2008-09/msg01270.html
I gathered statistics using 64-bit longs for this test case. Using it, one
finds that 10,292,897,120 bytes of bitmaps and 6,449,831,120 bytes in
alloc-pools are allocated with mainline for this test case (at least when
checking is enabled).
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26854