Re: Optimizing in assembly language

Tom Payne <thp@hill.cs.ucr.edu> writes:


> Once the flow graph of an assembly language program has been
> determined, I would assume that the usual optimization tricks can be
> applied. So, what are the special difficulties in determining the
> flow graph of an assembly langauge program?


Self-modifying code, branch to register (eg: read some characters
from the keyboard, do some arithmetic, treat the result as an address
and branch to it...).


See http://www.dur.ac.uk/martin.ward/martin/papers/icsm99-t.ps.gz
for a few more problems with analysing assembler (and our solution...)


Martin


Martin.Ward@durham.ac.uk http://www.dur.ac.uk/martin.ward/ Erdos number: 4

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