Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Help: Looking for optimization algorithms tvalesky@site.gmu.edu) (1995-10-25) |
| Re: Help: Looking for optimization algorithms lts@cs.rice.edu (Taylor Simpson) (1995-10-30) |
| Re: Help: Looking for optimization algorithms cliffc@ami.sps.mot.com (1995-10-31) |
| Re: Help: Looking for optimization algorithms bill@amber.ssd.hcsc.com (1995-11-06) |
| Newsgroups: | comp.compilers |
| From: | cliffc@ami.sps.mot.com (Cliff Click) |
| Keywords: | optimize, report |
| Organization: | none |
| References: | 95-10-133 |
| Date: | Tue, 31 Oct 1995 13:20:27 GMT |
tvalesky@site.gmu.edu (Thomas B Valesky (CS)) writes:
> Can anyone point me to fairly detailed pseudocode for global common
> subexpression elimination and/or loop-invariant detection and code
> motion? The Dragon book gives outlines of them, but I'd really love
> to see a more detailed description of them. Most of the other
> compiler books I've looked at focus on parsing and code generation,
> and don't pay much attention to optimization.
Hate to toot my own horn ;-).
Take a look at: "Global Code Motion, Global Value Numbering" from
'95 PLDI Proceedings, page 246, or my web page at:
http://bellona.cs.rice.edu/MSCP/cliff.html
Cliff
--
Cliff Click Compiler Researcher & Designer
RISC Software, Motorola PowerPC Compilers
cliffc@risc.sps.mot.com (512) 891-7240
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.