Re: Backward branches

haberg@matematik.su.se (Hans Aberg)
21 Dec 2003 23:11:02 -0500

          From comp.compilers
Related articles
Backward branches kugan@ieee.org (2003-12-14)
Re: Backward branches torbenm@diku.dk (2003-12-20)
Re: Backward branches haberg@matematik.su.se (2003-12-21)
Re: Backward branches kugan@ieee.org (2004-01-02)
Re: Backward branches vbdis@aol.com (2004-01-09)
Re: Backward branches j.troeger@qut.edu.au (Jens Troeger) (2004-01-12)
Re: Backward branches Robert.Thorpe@antenova.com (Robert Thorpe) (2004-01-16)
| List of all articles for this month |
From: haberg@matematik.su.se (Hans Aberg)
Newsgroups: comp.compilers
Date: 21 Dec 2003 23:11:02 -0500
Organization: Mathematics
References: 03-12-108 03-12-109
Keywords: architecture, optimize
Posted-Date: 21 Dec 2003 23:11:02 EST

kugan@ieee.org (kugan) writes:


> I need to detect loops using H/W. I am wondering whether it is
> possible to detect loops just by detecting backward branches. What
> would be the approximate success rate for this scheme? What are the
> other instances where backward branches will be used?


If you view the code with jumps as a directed graph, then you are asking
for the strongly connected components (SCC's) of that graph, to which one
can use Tarjan's strongly connected components (SCC) algorithm:
        http://www1.ics.uci.edu/~eppstein/161/960220.html#sca


    Hans Aberg

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.