Re: optimizing compiler against average assembly programmer.

Charles Fiterman <cef@geodesic.com>
4 Jul 1997 14:40:48 -0400

          From comp.compilers

Related articles
[3 earlier articles]
Re: optimizing compiler against average assembly programmer. rboland@csi.uottawa.ca (Ralph Boland) (1997-06-24)
Re: optimizing compiler against average assembly programmer. dglaston@asc.corp.mot.com (Daniel Glastonbury) (1997-06-24)
Re: optimizing compiler against average assembly programmer. walter@bytecraft.com (Walter Banks) (1997-06-30)
Re: optimizing compiler against average assembly programmer. gclind01@starbase.spd.louisville.edu (1997-06-30)
Re: optimizing compiler against average assembly programmer. norman@kbss.bt.co.uk (Norman Hilton) (1997-06-30)
Re: optimizing compiler against average assembly programmer. debray@cs.arizona.edu (1997-06-30)
Re: optimizing compiler against average assembly programmer. cef@geodesic.com (Charles Fiterman) (1997-07-04)
Re: optimizing compiler against average assembly programmer. vkarvone@raita.oulu.fi (1997-07-04)
Re: optimizing compiler against average assembly programmer. rhyde@cs.ucr.edu (1997-07-04)
Re: optimizing compiler against average assembly programmer. WStreett@shell.monmouth.com (1997-07-08)
Re: optimizing compiler against average assembly programmer. monnier+comp/compilers/news/@tequila.cs.yale.edu (Stefan Monnier) (1997-07-08)
Re: optimizing compiler against average assembly programmer. charles.marslett@tempe.vlsi.com (1997-07-08)
Re: optimizing compiler against average assembly programmer. leichter@smarts.com (Jerry Leichter) (1997-07-09)
[7 later articles]
| List of all articles for this month |

From: Charles Fiterman <cef@geodesic.com>
Newsgroups: comp.compilers,comp.lang.asm.x86
Date: 4 Jul 1997 14:40:48 -0400
Organization: Geodesic Systems
References: 97-06-071 97-06-074 97-06-107
Keywords: optimize, practice

>That algorithm will always win. However, take an non
>trival assembly program and create algorithmically similar C
>and the compiled results will very similiar often smaller.


My opinion on this has been shifted to the machine by an article in
the 1997 SIGPLAN PLDI.


Simple Translation of Goal Directed Evaluation by Todd
Proebsting. http://www.cs.arizona.edu/people/todd


In it the goal directed expression


    x > ((a to b) * (c to d))


is compiled into better code than I would have produced by hand. I
would have emulated nested for loops missing the fact that the path
from increment to range check is hotter than the path from
initialization to range check.


This is more than a compiler beating out a good programmer. Iterators
are basic to encapsulation of logic. If we can add iterators to a
language and produce code from them as good as what people would
produce by partial evaluation, we have very sophisticated tools for
building powerful dense programs.


Also specialization, producing code on the fly is a technique people
wont be using.
--


Post a followup to this message

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