|sparc object hackery and Bliss techniques? firstname.lastname@example.org (1993-07-26)|
|Re: sparc object hackery and Bliss techniques? email@example.com (1993-07-29)|
|Re: sparc object hackery and Bliss techniques? firstname.lastname@example.org (1993-07-30)|
|Re: sparc object hackery and Bliss techniques? email@example.com (1993-07-30)|
|From:||firstname.lastname@example.org (Jim Harding)|
|Keywords:||assembler, optimize, question, comment|
|Organization:||EDS Unigraphics, Cypress CA|
|Date:||Mon, 26 Jul 1993 09:43:57 GMT|
In regards to dsitinguishing code from data within an object file you can
do something similar to what I had done with some disassemblers which was
to locate all reachable instructions. Starting from all known code labels
in the symbol table, decode instructions until you reach an unconditional
jump or return instruction while noting all branches to labels. Finding
jump tables for implementing switch statements may be a little bit
difficult but it can be done. All branch labels and jump table entries
will start new code paths to search.
Now I have a question. I have the book 'The Design of an Optimizing
Compiler' by Wulf et. al. and have found the ideas in it to be quite
interesting even though it is rather old by CS standards (1975). Is there
any information anywhere on the Bliss language which it describes or on
any languages which use similar compiler techniques? I know I may be out
of touch asking about such a language.
[Incidentally, we're still working on reissuing the book by Wulf et al.
though it's taking longer than I would have expected. Around the end of
the year, I hope. -John]
Return to the
Search the comp.compilers archives again.