misc. links

[Guy Laden <laden@math.tau.ac.il>]

> An additional `optimize til you drop' setting would do all the things
> necessary to produce the `best' code.  This setting would include
> keeping all procedures in memory, inter module procedure inling,
> iterative optimization runs, etc.

I've come across some new items that might be of interest when/if
we get to the stage where global optimization are an issue:

http://www.cs.princeton.edu/~mff/ - contains links to a thesis titled: 
A Retargetable Optimizing Linker
This thesis describes mld, a retargetable, optimizing linker, for the MIPS,
SPARC, and Intel 486 architectures. The linker optimizes away some of the
costs of late binding. In particular, mld's optimizations permit efficient
implementation of Modula-3's module-encapsulation and data-abstraction
features. The thesis presents the results of applying mld's simple
optimization techniques to several Modula-3 programs and reports their
execution times on the MIPS and Intel 486 architectures. 

http://www.cmass.com/threads/1/threads.html#advanced
A (short) description of 'The Whole Program Optimizer', for Modula-3

Other stuff:

. In case anybody missed the GPM project papers, they're definately worth
  looking at: http://www.fit.qut.edu.au/CompSci/PLAS/GPM/publications.html

Two tools:

. The New Jersey Machine-Code Toolkit helps programmers write
  applications that process machine code---assemblers,
  disassemblers, code generators, tracers, profilers, and debuggers.
  http://www.cs.princeton.edu/~mff/toolkit

. bottom-up tree rewriting tool MBURG, to be used for code selection
  in compilers:
	http://www.dstc.qut.edu.au/~gough/sigplan.ps
	http://www.dstc.qut.edu.au/~gough/mburg07.ps
  I'd like your opinions on using MBURG or a similar tool for generating
  parts of the compiler's code-selection code.

Guy.