Re: optimizing compiler against iaverage assembly programmer.

Cliff Click <cliffc@risc.sps.mot.com>
19 Jun 1997 00:04:26 -0400

          From comp.compilers

Related articles
optimizing compiler against iaverage assembly programmer. gclind01@starbase.spd.louisville.edu (1997-06-15)
Re: optimizing compiler against iaverage assembly programmer. disc@disclink.com (DISC) (1997-06-19)
Re: optimizing compiler against iaverage assembly programmer. cliffc@risc.sps.mot.com (Cliff Click) (1997-06-19)
Re: optimizing compiler against iaverage assembly programmer. gmiller@iswt.com (Greg Miller) (1997-06-20)
Re: optimizing compiler against iaverage assembly programmer. lehotsky@tiac.net (1997-06-20)
Re: optimizing compiler against iaverage assembly programmer. rnordier@iafrica.com (Robert Nordier) (1997-06-24)
Re: optimizing compiler against iaverage assembly programmer. jim-neil@digital.net (1997-06-24)
Re: optimizing compiler against iaverage assembly programmer. jbuck@synopsys.com (1997-06-24)
Re: optimizing compiler against iaverage assembly programmer. bromage@cs.mu.oz.au (1997-06-30)
[10 later articles]
| List of all articles for this month |

From: Cliff Click <cliffc@risc.sps.mot.com>
Newsgroups: comp.compilers,comp.lang.asm.x86
Date: 19 Jun 1997 00:04:26 -0400
Organization: RISC Software, Motorola
References: 97-06-071
Keywords: assembler, optimize, performance

George C. Lindauer wrote:
>
> I was thinking about the assertion 'a good optimizing compiler will
> nearly always outcode a moderately proficient assembly programmer'.
>
> 1) What does the average assembly programmer do with the linkage
> between procedures? Does a good compiler still beat this? How does
> that affect the proposition?


A good one can optimize what registers are passed with what values,
and know what registers are not clobbered (and can hold values across
the call) i.e. interprocedural register allocation. So can a good
optimizing compiler.


>....
> Are good optimizing compilers really all they are cracked up to be?


I routinely see a 2x speed improvement for using the optimizer. More
for tuned routines (ala Spec benchmarks), sometimes much more.
Writing a good Matrix Multiply is hard, but if you write a simple one
darned if most compilers these days don't up and do something really
fancy with it. ;-)




> [Other important points: compilers make it a lot easier to use complex
> data structures,


I think this one falls under the catagory of using _any_ compiler,
optimizing or not.


> and compilers don't get bored halfway through and generate
> reliably pretty good code. -John]


Yup.


Cliff


--
Cliff Click, Ph.D. Compiler Researcher & Designer
RISC Software, Motorola PowerPC Compilers
cliffc@risc.sps.mot.com (512) 891-7240
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.