From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.7 required=5.0 tests=BAYES_00,HEADER_SPAM,
	INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: ff499,32898cca6ca4143e,start
X-Google-Attributes: gidff499,public
X-Google-Thread: 103376,32898cca6ca4143e,start
X-Google-Attributes: gid103376,public
From: Iain Bate <iain.bate@cs.york.ac.uk>
Subject: Compiler Optimisation?
Date: 1998/12/06
Message-ID: <98-12-010@comp.compilers>#1/1
X-Deja-AN: 419515866
Sender: johnl@iecc.com
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
Organization: York UTC
Keywords: optimize, question
Newsgroups: comp.lang.ada,comp.compilers
X-FAQ-and-archives: http://www.iecc.com/compilers
Date: 1998-12-06T00:00:00+00:00
List-Id: <comp.lang.ada>

I am looking for some specific information on compiler optimisation
and I was wondering if anyone could help. Basically, I would like to
get some idea how much faster code executes due to optimisation. I am
looking for the information at two levels:

1. How much faster code executes due to the overall optimisation
process?
2. How much faster code executes due to specific optimisation stages,
e.g. the speed-up due to the peephole stage?

I realise there are some quite large variations in the type of
optimisation algorithms that are used, but I am simply looking for
some typical figures - if these exist.

I would be very grateful for any help that people can provide in terms
of actual information or guidance of where to look (I'm sure there
must be loads of data on this subject). Also, is there any chance any
replies can be copied directly to me at iain.bate@cs.york.ac.uk since
I will read it faster that way

Thanks in Advance

Iain
[The answer to both questions is "somewhat, usually, depending on the
application and the compiler" but perhaps some people can offer some rules
of thumb. -John]