Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!widener!ukma!memstvx1!utkcs2!emory!wuarchive!usc!apple!jeffh@HyperMail.apple.com
From: jeffh@HyperMail.apple.com (Jeff Holcomb)
Newsgroups: comp.sys.apple2
Subject: Re: Any Pascal programmers for Apple II GS?
Message-ID: <13432@goofy.Apple.COM>
Date: 10 May 91 00:36:52 GMT
Sender: usenet@Apple.COM
Organization: Apple Computer, Inc.
Lines: 28

References:<14308@ucrmath.ucr.edu> <13419@goofy.Apple.COM> <52655@apple.Apple.COM>

In article <52655@apple.Apple.COM>, stadler@Apple.COM (Andy Stadler) writes:
> 
> The MPW IIGS Pascal compiler contains a huge library of "code templates" which
> allow it to select the best series of opcodes for a given set of operations.
> Each template includes information on the size (# of bytes) and speed (# of
> cycles) and the compiler iterates over every set of templates which could
> work, and then chooses the set which have the best (speed or space, depending
> on a command-line option).  These templates range from the mundane to the
> complex....

These all seem to be similar to peephole optimizations...are any other
optimizations done on the tree-code (like common subexpression elimination,
data flow analysis, or loop optimizations)?

I have had quite a bit of experience with the Gnu C Compiler and I'm used to the
type of optimizations it does, so that's the main reason I'm curious about the
MPW IIgs Pascal compiler.

> Finally, there are some simple rules programmers can follow which will help
> the compiler generate the best code possible.  If there's anyone out there
> actually using this compiler, let me know and I can explain some of them...

I'd be interested in seeing these...

--
Jeff Holcomb      x4-0841
Apple ATG System Software
jeffh@HyperMail.apple.com