This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/34708] Inlining heuristics issue
- From: "hubicka at ucw dot cz" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 8 Jan 2008 12:15:46 -0000
- Subject: [Bug tree-optimization/34708] Inlining heuristics issue
- References: <bug-34708-87@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #5 from hubicka at ucw dot cz 2008-01-08 12:15 -------
Subject: Re: Inlining heuristics issue
> I think we want to account PHI nodes as real copies instead (d->count +=
> PHI_NUM_ARGS (...)) -- if they involve real operands (not VOPs).
We ignore cost of MODIFY_EXPR in assumption that it will get quite
likely optimized out (that is important for simple containers). So
ignoring PHI nodes is consistent in this manner, but on the other hand
PHIs are less often in containers and more likely to stay after
inlining. I will add code for that.
Honza
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=34708