This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: New const function detection code and infinite loops.
- To: Michael Hayes <m dot hayes at elec dot canterbury dot ac dot nz>
- Subject: Re: New const function detection code and infinite loops.
- From: Jan Hubicka <jhub6202 at ss1000 dot ms dot mff dot cuni dot cz>
- Date: Tue, 2 Nov 1999 15:39:38 +0100 (MET)
- cc: egcs at egcs dot cygnus dot com
On Sat, 28 Aug 1999, Michael Hayes wrote:
> Jan Hubicka writes:
> > So I can send a patch if neccesary. Is there any way how to detect
> > bounded loops? (loop.c does it, is this information available somewhere?)
>
> I've got some code, if you are interested, that I'm tidying up for
> submission that tries to estimate the maximum number of estimations
> for "well-behaved" loops. However, it relies on information gathered
> during strength reduction.
Hi
I've just found this email in my mailbox :) So sorry for the late reply.
I would be very interested in the code... Do you have some patch?
as I noticed you seems to be going to make some changes too loop handling
soon. Will this be included?
It would be nice to have pass that will attach "maximal/minimal/expected
number of executions for each basic block.
We can use it for proving of finitarity as well as in other optimizations
like register allocation or reg-stack...
Honza
>
> Michael.
>