Backward branches

kugan@ieee.org (kugan)
14 Dec 2003 22:13:51 -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: kugan@ieee.org (kugan)
Newsgroups: comp.compilers
Date: 14 Dec 2003 22:13:51 -0500
Organization: http://groups.google.com
Keywords: hardware, optimize
Posted-Date: 14 Dec 2003 22:13:51 EST

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? Are there any
tools by which I can measure this for a given application?


Thanks
Kugan
[Hardware loop detection has been around for a long time. The 360/91
did it with a simple backward branch check in the late 1960s. -John]


Post a followup to this message

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