Related articles |
---|
Gotos jhallen@wpi.wpi.edu (1989-11-12) |
Re: Gotos preston@rice.edu (Preston Briggs) (1989-11-13) |
Re: Gotos bright@dataio.Data-IO.COM (1989-11-17) |
Newsgroups: | comp.compilers |
Date: | 17 Nov 89 21:51:25 GMT |
References: | <1989Nov13.203034.1778@esegue.segue.boston.ma.us> |
From: | bright@dataio.Data-IO.COM (Walter Bright) |
Organization: | Data I/O Corporation; Redmond, WA |
In article <1989Nov13.203034.1778@esegue.segue.boston.ma.us> Preston Briggs <preston@rice.edu> writes:
>In article <1989Nov12.222530.14148@esegue.segue.boston.ma.us> you write:
>>In particular, do C optimizing compilers take a simple minded
>>view towards gotos or does data flow analysis actually follow goto paths?
Zortech C's optimizer (which I wrote) converts *everything* into goto's, and
then analyzes the flow graph to discover loops and such.
>Do any of the IBM PC-class C compilers do global optimizations?
Zortech does.
>Global constant propagation?
Zortech does.
>Graph coloring register allocation?
Zortech does.
ZTC also does loop induction variables, copy propagation, common
subexpressions, very busy expressions, dead variables, dead code,
loop invariants, etc.
[From bright@dataio.Data-IO.COM (Walter Bright)]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.