This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: SEQUENCEs
- From: Marc Espie <espie at quatramaran dot ens dot fr>
- To: law at redhat dot com
- Cc: gcc at gcc dot gnu dot org
- Date: Tue, 11 Jun 2002 04:35:14 +0200
- Subject: Re: SEQUENCEs
- Organization: Ecole Normale Superieure (quatramaran)
In article <6491.1023755308@porcupine.cygnus.com> you write:
>And just for fun, I instrumented GCC to keep track of the kinds of sequences
>it creates. For a bootstrap of i686-pc-linux-gnu, I simply recorded the length
>of each sequence closed in end_sequence.
>
># insns 1 2 3 4 5 6 7 8 9 10+
>%sequences 80 11 1.2 1.5 1.5 1.7 2.4 0.5 0.4 0.2
>
>
>This clearly shows that most sequences are very short -- so the cost of
>find the end really should not be that high in few those cases where we
>actually
Hum... how are such sequences then used ?
Would it make sense to try to optimize the most common case further (1 insn)
or maybe the two most common cases (<=2, 90%) ?