Path: utzoo!yunexus!ists!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!snorkelwacker!spdcc!ima!esegue!compilers-sender From: bright@dataio.Data-IO.COM (Walter Bright) Newsgroups: comp.compilers Subject: Re: Gotos Message-ID: <1989Nov18.162519.6773@esegue.segue.boston.ma.us> Date: 18 Nov 89 16:25:19 GMT Article-I.D.: esegue.1989Nov18.162519.6773 References: <1989Nov13.203034.1778@esegue.segue.boston.ma.us> Sender: compilers-sender@esegue.segue.boston.ma.us Reply-To: bright@dataio.Data-IO.COM (Walter Bright) Organization: Data I/O Corporation; Redmond, WA Lines: 25 Approved: compilers@esegue.segue.boston.ma.us In article <1989Nov13.203034.1778@esegue.segue.boston.ma.us> Preston Briggs 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)] -- Send compilers articles to compilers@esegue.segue.boston.ma.us {spdcc | ima | lotus}!esegue. Meta-mail to compilers-request@esegue. Please send responses to the author of the message, not the poster.