[tree-ssa] computed gotos

[Brad Lucier]

> > The Gambit-C Scheme->C compiler can generate code that contains
> > either computed gotos or a large switch,
> What does the switch look like?
> Can you hand me some code where the performance depends on the use of 
> computed gotos?
> I'll run it through CIL (which *does* the transformation), and see if 
> it is, indeed slower.

I'm working now with a beta version of Gambit 4.0 and the benchmark
suite doesn't seem to work on RH 8.0 with the standard 3.2 compiler.
Also CIL doesn't pass "make check" on this platform even though it
claims to work with gcc 3.2.  Will CIL work on code generated from
powerpc?

> Thus, it would be helpful to be able to benchmark code, rather than 
> theorize.

I don't know who you think is theorizing, but I wouldn't want to
describe other people's experiences that way.

Brad