| Related articles |
|---|
| Finding loops in a disassembly mdomeika@news.jf.intel.com (Max Domeika) (1995-07-22) |
| finding loops in disassembly ng@eecs.harvard.edu (Nicolas Gloy) (1995-07-27) |
| Re: Finding loops in a disassembly mercier@cinenet.net (1995-07-27) |
| Newsgroups: | comp.compilers |
| From: | Max Domeika <mdomeika@news.jf.intel.com> |
| Keywords: | analysis, optimize, question |
| Organization: | Intel Corp., Hillsboro, Oregon |
| Date: | Sat, 22 Jul 1995 06:03:45 GMT |
I'm trying to write a program to find loops in a disassembly
listing. My program is able to form the CFG for a disassembly
and I am now ready to attempt to find loops. I'm intending
to use Algorithm 10.1 (pg. 604) in the Dragon book. Question(s):
Are there any foreseeable problems in this besides indirect jumps?
Is there a more efficient and reliable way to do this?
Max
--
----------------------------------------------------
|Max Domeika |
|Summer Intern (Clemson University, South Carolina)|
|Office Location: Jones Farm 1, H-17 |
|Office Phone: (503) 264-7066 |
|Mailstop: JF1-19 |
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.