This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Computed gotos
- From: dewar at gnat dot com (Robert Dewar)
- To: aph at redhat dot com, positrone at freemail dot it
- Cc: dewar at gnat dot com, gcc at gcc dot gnu dot org, paul at nowt dot org
- Date: Mon, 30 Jun 2003 17:32:45 -0400 (EDT)
- Subject: Re: [tree-ssa] Computed gotos
> I strongly agree about the fact that computed gotos are the most
> natural and efficient choice in some situations (bytecode interpreters
> and translators which generate C code). However I think that the
> discussion was just about a matter of style: using computed goto vs.
> using switch, keeping both constructs available.
I wonder if we are all on the same page here with terminology. What exactly
do people mean by a computed goto? I had assumed that they meant the computed
goto of Fortran, and I cannot see what possible advantage that has over a
switch statement.